{"meta":{"query_hash":"d2ab828fadf6","filters":{"topic":"Caching and Content Delivery"},"cohort_total":879,"direct_labels_cover":3,"predictions_cover":879,"exported":879,"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/d2ab828fadf6","api":"https://metacan.xera.ac/api/v1/cohort?topic=Caching+and+Content+Delivery"},"results":[{"id":"W1171784915","doi":"10.1007/978-3-319-15497-8_17","title":"Information-Centric Networking for VANETs","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cloud computing; Enabling; The Internet; Information-centric networking; Key (lock); Computer network; Set (abstract data type); Network topology; Delay-tolerant networking; Routing (electronic design automation); World Wide Web; Routing protocol; Computer security","score_opus":0.04471441569025278,"score_gpt":0.22723397398063516,"score_spread":0.18251955829038238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1171784915","genre_codex":"other","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.0022682124,0.22565967,0.20416598,0.0054034027,0.008738362,0.00011511169,0.00052268786,0.0010804646,0.5520461],"genre_scores_gemma":[0.03841832,0.24265206,0.074080996,0.0016681362,0.0044067344,0.00014885755,0.0009917503,0.00056682725,0.63706625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998554,0.000019363584,0.000005883243,0.00002197545,0.00008068107,0.000016655498],"domain_scores_gemma":[0.99984074,0.00007507308,0.0000072575344,0.000021988437,0.000042515636,0.000012388801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026474622,0.0008142153,0.00044955517,0.00078474934,0.0004397855,0.002201177,0.00092937436,0.0011799386,0.018269705],"category_scores_gemma":[0.0005900456,0.00039683332,0.00028660859,0.002074378,0.0004901801,0.0033823184,0.00087466475,0.0016876302,0.006860782],"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.000017403696,0.000041126383,0.00005927895,0.0005335889,0.000015343936,0.0000685941,0.00011912429,0.0072222226,0.0017484323,0.42349172,0.18159725,0.38508588],"study_design_scores_gemma":[0.0000035473713,0.000016559032,0.000059594528,0.0002855824,0.000008793831,0.00020307879,0.000043913926,0.007223675,0.00063981244,0.12522376,0.86627877,0.000012915387],"about_ca_topic_score_codex":0.0015615552,"about_ca_topic_score_gemma":0.0033567077,"teacher_disagreement_score":0.018269705,"about_ca_system_score_codex":0.0011466515,"about_ca_system_score_gemma":0.0007349884,"threshold_uncertainty_score":0.061118305},"labels":[],"label_agreement":null},{"id":"W117946175","doi":"","title":"The use of multiple Bloom-filters to minimize data transfer during distributed query processing.","year":2001,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Caching and Content Delivery","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":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Bloom filter; Data processing; Information retrieval; Algorithm; Database","score_opus":0.07625833197517029,"score_gpt":0.2279373779275179,"score_spread":0.1516790459523476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117946175","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.048120674,0.0010969413,0.9444759,0.00063106284,0.00011333762,0.00046276665,0.00016023306,0.0014871227,0.0034520035],"genre_scores_gemma":[0.29133534,0.00057467143,0.7019718,0.00021055246,0.00009025589,0.0002964037,0.00036286123,0.00014173808,0.0050164233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979773,0.00043884787,0.00013070831,0.00030912776,0.0010068035,0.00013714924],"domain_scores_gemma":[0.9968053,0.0011789118,0.00033513858,0.000987662,0.00060797733,0.000085121355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016866929,0.0005920985,0.00073235465,0.0009773271,0.0011191538,0.0012664341,0.0017524777,0.0007227121,0.0014551032],"category_scores_gemma":[0.0045102313,0.0004757611,0.0005665767,0.0012065765,0.00064334495,0.0030192034,0.0012108854,0.0009550469,0.0007635793],"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.00085675163,0.00034072707,0.004305894,0.0005793921,0.00022260252,0.00021874822,0.00056053745,0.06706577,0.19697721,0.054045692,0.014256872,0.6605697],"study_design_scores_gemma":[0.00016373908,0.0007490494,0.003122994,0.00006729145,0.00022028608,0.0011135754,0.00035854641,0.6683251,0.24559613,0.038912036,0.04126991,0.00010128381],"about_ca_topic_score_codex":0.0022414299,"about_ca_topic_score_gemma":0.0040283375,"teacher_disagreement_score":0.0022414299,"about_ca_system_score_codex":0.0012913161,"about_ca_system_score_gemma":0.002194191,"threshold_uncertainty_score":0.0093691945},"labels":[],"label_agreement":null},{"id":"W138627","doi":"10.1007/978-3-642-24583-1_31","title":"COCA Filters: Co-occurrence Aware Bloom Filters","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; Computer science; Search engine indexing; Signature (topology); Exploit; Index (typography); Bloom; Data mining; Algorithm; Artificial intelligence; Mathematics; Computer security; World Wide Web","score_opus":0.031003897410714805,"score_gpt":0.2438658754085357,"score_spread":0.2128619779978209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138627","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.011888377,0.0018659714,0.9440214,0.00039721056,0.00034876948,0.000333769,0.0020597652,0.03100847,0.00807627],"genre_scores_gemma":[0.19277106,0.0016554291,0.7731907,0.0005249884,0.00034725884,0.00045275,0.004727965,0.0022592836,0.024070611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829453,0.0002365349,0.00015121265,0.00030341084,0.00082426943,0.00018998157],"domain_scores_gemma":[0.99447834,0.0019043534,0.00027352545,0.002142317,0.0009337844,0.0002676373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015413308,0.0011988676,0.0018217805,0.0029087232,0.0014045172,0.0043012276,0.0027353768,0.001765947,0.010110792],"category_scores_gemma":[0.007108591,0.0010969349,0.0008023037,0.004702872,0.00078522955,0.0047602956,0.0026284931,0.0014787455,0.0049726297],"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.0020409536,0.00038136708,0.0030570019,0.0005446772,0.00019140547,0.00020954407,0.00025098448,0.017469494,0.027491445,0.077456415,0.088790245,0.78211653],"study_design_scores_gemma":[0.0002891386,0.0002250653,0.0008476907,0.00015450497,0.0002221261,0.0008234585,0.00016780412,0.62780535,0.10019215,0.11901576,0.15011139,0.00014551127],"about_ca_topic_score_codex":0.006605836,"about_ca_topic_score_gemma":0.010955511,"teacher_disagreement_score":0.010110792,"about_ca_system_score_codex":0.001894228,"about_ca_system_score_gemma":0.0025992251,"threshold_uncertainty_score":0.033823967},"labels":[],"label_agreement":null},{"id":"W14303514","doi":"10.1007/978-3-642-33185-5_9","title":"Ensuring Relevant and Serendipitous Information Flow in Decentralized Online Social Network","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Serendipity; Social network (sociolinguistics); Peer-to-peer; Distributed computing; Filter (signal processing); Node (physics); Context (archaeology); Architecture; World Wide Web; Computer network; Social media","score_opus":0.014410095017042174,"score_gpt":0.22192341889287845,"score_spread":0.20751332387583626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14303514","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.11716504,0.00044011913,0.87277055,0.0022282975,0.00009872642,0.00026797445,0.00026184047,0.00094184483,0.0058255373],"genre_scores_gemma":[0.9412056,0.0002908169,0.05491341,0.00021536704,0.0001424899,0.00016682557,0.00015778362,0.00015873127,0.002748855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919367,0.0037442145,0.00043358532,0.0012770346,0.0016992495,0.00090923137],"domain_scores_gemma":[0.8170493,0.15218978,0.0057041673,0.014764954,0.006810503,0.0034813385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013529609,0.0011504628,0.002980071,0.0017872151,0.003089423,0.00463917,0.0042237444,0.0041607893,0.0026445503],"category_scores_gemma":[0.10176796,0.0017019883,0.0008591294,0.0022541743,0.0034083512,0.00886021,0.0061610974,0.0033109873,0.00059140084],"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.0018147342,0.0005417317,0.0055993698,0.0006508156,0.00020429041,0.0005119547,0.0018311593,0.5066439,0.010760224,0.36114573,0.011090492,0.09920554],"study_design_scores_gemma":[0.000067289926,0.00007959001,0.0003950423,0.000026972257,0.000041789233,0.00010401751,0.00014161943,0.8223342,0.0025722557,0.17325899,0.0009552628,0.00002300354],"about_ca_topic_score_codex":0.0031706865,"about_ca_topic_score_gemma":0.0028508597,"teacher_disagreement_score":0.013529609,"about_ca_system_score_codex":0.0028973403,"about_ca_system_score_gemma":0.005187107,"threshold_uncertainty_score":0.07155228},"labels":[],"label_agreement":null},{"id":"W1499842627","doi":"","title":"Power-law revisited: large scale measurement study of P2P content popularity","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Popularity; BitTorrent; The Internet; Scale (ratio); Computer science; Zipf's law; Content distribution; Exponential distribution; Power law; BitTorrent tracker; Statistics; Mathematics; World Wide Web; Artificial intelligence; Geography; Computer network; Law; Cartography","score_opus":0.04832899208395549,"score_gpt":0.25100375075394304,"score_spread":0.20267475866998755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499842627","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.8318719,0.0007466774,0.16170008,0.0010563704,0.000053112195,0.00014464789,0.00034487902,0.00043766428,0.003644678],"genre_scores_gemma":[0.99514955,0.00010615589,0.0042851917,0.00006267565,0.00005354163,0.000048533897,0.000114648414,0.000023765164,0.00015604799],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9960181,0.0020010876,0.00018028573,0.00067565835,0.00093338446,0.00019153905],"domain_scores_gemma":[0.92916846,0.054381907,0.005335597,0.007373931,0.0031879726,0.00055215316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006279625,0.0004523251,0.00071677624,0.0016722071,0.00071611366,0.0012090995,0.0014006157,0.0014370859,0.0007106951],"category_scores_gemma":[0.07181154,0.00043198778,0.0005135694,0.002464424,0.0018163379,0.0031488996,0.00090929546,0.0021371483,0.00026556457],"study_design_candidate":"observational","study_design_consensus":"observational","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.0005409008,0.00076703646,0.48780575,0.0004985592,0.00075467664,0.0028133818,0.0035048013,0.3416386,0.021568252,0.04971433,0.0056492356,0.08474447],"study_design_scores_gemma":[0.000024289386,0.00014795185,0.0596356,0.00003257379,0.00004084538,0.00088562805,0.00038007568,0.9174644,0.002655686,0.017556857,0.0011215665,0.00005459564],"about_ca_topic_score_codex":0.0041088075,"about_ca_topic_score_gemma":0.0016516644,"teacher_disagreement_score":0.006279625,"about_ca_system_score_codex":0.001184403,"about_ca_system_score_gemma":0.00037832564,"threshold_uncertainty_score":0.033210278},"labels":[],"label_agreement":null},{"id":"W1501918392","doi":"10.1109/icpwc.1999.759694","title":"Caching in hierarchical user location databases for PCS","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Tree (set theory); Computer network; Architecture; Mobility management; Database; Distributed computing","score_opus":0.04199355576139353,"score_gpt":0.2765455389037854,"score_spread":0.2345519831423919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501918392","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.55323064,0.002316691,0.43360412,0.0010223397,0.000060067952,0.00025435016,0.00039369304,0.0033304133,0.005787755],"genre_scores_gemma":[0.94041586,0.00037161366,0.057288043,0.00006127916,0.000027097147,0.00006881724,0.00019662477,0.00004186163,0.0015287406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803704,0.00064791157,0.00015858613,0.0002585745,0.000549301,0.00034862242],"domain_scores_gemma":[0.9929375,0.002626447,0.0008084469,0.0023525541,0.0009869157,0.00028812073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027052565,0.00044737343,0.0010392882,0.0009274915,0.0012507251,0.0026183496,0.0023490333,0.001400843,0.0011437464],"category_scores_gemma":[0.009344561,0.0006364414,0.0004098512,0.0033425272,0.0009182719,0.004120345,0.0013297264,0.00073634327,0.0003408702],"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.0012182391,0.0002817122,0.016484493,0.00021147847,0.000134551,0.000636431,0.0005038794,0.76012486,0.013355186,0.07179722,0.0072160657,0.12803592],"study_design_scores_gemma":[0.000037336034,0.00009556812,0.0021925627,0.000014326463,0.000050579092,0.00016361609,0.00013227359,0.98224694,0.003928032,0.009226712,0.0018889909,0.00002308434],"about_ca_topic_score_codex":0.029298618,"about_ca_topic_score_gemma":0.03040944,"teacher_disagreement_score":0.029298618,"about_ca_system_score_codex":0.0032684386,"about_ca_system_score_gemma":0.0023427801,"threshold_uncertainty_score":0.05825615},"labels":[],"label_agreement":null},{"id":"W1502615931","doi":"10.1007/978-3-540-72606-7_115","title":"Outburst: Efficient Overlay Content Distribution with Rateless Codes","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Overlay; Upload; Overlay network; Computer network; Online codes; Content distribution; Node (physics); Resilience (materials science); Bandwidth (computing); Content (measure theory); Distributed computing; Decoding methods; Algorithm; Hamming code; The Internet; Operating system; Block code","score_opus":0.029314219322207753,"score_gpt":0.23697192569208894,"score_spread":0.20765770636988118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502615931","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.108288035,0.0010079563,0.86342496,0.00031603238,0.00028721956,0.0002352033,0.00051558507,0.017071562,0.008853467],"genre_scores_gemma":[0.7967705,0.0005039866,0.19211298,0.00015070493,0.000114758346,0.00012427817,0.0005693129,0.00074715604,0.008906359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993087,0.0001193072,0.000031294752,0.0000778283,0.0003211819,0.00014160569],"domain_scores_gemma":[0.99785477,0.00067958306,0.00011487306,0.00075970165,0.00041975922,0.00017123742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008283345,0.0008306844,0.0013818744,0.0010342046,0.00092459336,0.0017727241,0.001947238,0.00063024554,0.002936367],"category_scores_gemma":[0.0038670334,0.00040119066,0.00024607207,0.0015795706,0.00073860376,0.0018614429,0.0027229774,0.0010066269,0.0007296837],"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.0026797084,0.00051135645,0.0015784346,0.0003295749,0.00009893604,0.0004894031,0.0005023778,0.24052268,0.057377536,0.07086368,0.041829318,0.58321697],"study_design_scores_gemma":[0.00010434805,0.00011349094,0.00020528988,0.000018642533,0.000021862155,0.0002109451,0.0000684467,0.9465674,0.02093736,0.025205392,0.006514667,0.00003217248],"about_ca_topic_score_codex":0.0039893785,"about_ca_topic_score_gemma":0.0051614055,"teacher_disagreement_score":0.0039893785,"about_ca_system_score_codex":0.0013034994,"about_ca_system_score_gemma":0.0013190887,"threshold_uncertainty_score":0.009823084},"labels":[],"label_agreement":null},{"id":"W1503895334","doi":"10.1142/9789812773296_0005","title":"On External-Memory Planar Depth-First Search","year":2006,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Planar; Computer science; Materials science; Geology; Computer graphics (images)","score_opus":0.030659435563069597,"score_gpt":0.22500279355205738,"score_spread":0.19434335798898777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503895334","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.020208878,0.0030822312,0.926274,0.0005110745,0.00009659209,0.00014718244,0.0004333848,0.003607117,0.045639507],"genre_scores_gemma":[0.15434825,0.0045656753,0.80686134,0.00041808403,0.00009999492,0.00023859793,0.0013903471,0.0009033026,0.031174429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999582,0.00006594708,0.000018407463,0.00009033397,0.00016396775,0.000079465775],"domain_scores_gemma":[0.9993332,0.00033770959,0.0000465353,0.00014411847,0.00011447437,0.000023913439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030130817,0.0009532252,0.00060993625,0.0011566349,0.0006492572,0.0012190458,0.0015261663,0.0007850986,0.0134089],"category_scores_gemma":[0.0019438334,0.00045234992,0.00044810562,0.00312114,0.0007934716,0.003197484,0.0016097862,0.0010665943,0.0035408458],"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.00039440973,0.000113964445,0.00050558563,0.0007017752,0.000041712967,0.0001984382,0.00021443378,0.12219756,0.017068518,0.16820718,0.028026758,0.6623297],"study_design_scores_gemma":[0.00013301935,0.00015681807,0.00044617918,0.00015251354,0.000057446163,0.0004731564,0.00015498385,0.6906946,0.022820244,0.19229476,0.09254985,0.000066402026],"about_ca_topic_score_codex":0.003997974,"about_ca_topic_score_gemma":0.0043273787,"teacher_disagreement_score":0.0134089,"about_ca_system_score_codex":0.0013971751,"about_ca_system_score_gemma":0.0011545978,"threshold_uncertainty_score":0.044857264},"labels":[],"label_agreement":null},{"id":"W1504222647","doi":"10.1023/a:1020990805004","title":"A Data Cube Model for Prediction-Based Web Prefetching","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hong Kong University of Science and Technology; University of Hong Kong; Simon Fraser University; U.S. Environmental Protection Agency","keywords":"Computer science; Instruction prefetch; Web server; Data cube; Web analytics; Data mining; Online analytical processing; Data Web; Web page; Web application; The Internet; Cluster analysis; Data warehouse; World Wide Web; Web modeling; Web intelligence; Machine learning; Cache; Operating system","score_opus":0.08014086763330527,"score_gpt":0.27628677019490616,"score_spread":0.1961459025616009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504222647","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.043509666,0.0009619627,0.94683355,0.00091367314,0.00017369019,0.000110940164,0.0019839695,0.0025844087,0.0029282577],"genre_scores_gemma":[0.75488776,0.0013374885,0.23687775,0.00022642621,0.0001346074,0.00037763212,0.0020352432,0.0002628645,0.00386021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991819,0.00018630625,0.00007948065,0.00013701119,0.00030620742,0.00010901463],"domain_scores_gemma":[0.9970112,0.0015412259,0.00018054605,0.00046665838,0.0006949278,0.00010546122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015100087,0.0007640546,0.0016198355,0.0011612201,0.0006313307,0.002198876,0.0025426901,0.0010485647,0.0027139399],"category_scores_gemma":[0.0058151223,0.00063438964,0.0009748028,0.0028238199,0.00060878455,0.00301708,0.00087060966,0.0014094944,0.0006427838],"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.0002214285,0.000113507274,0.0014541169,0.000063327534,0.00005890516,0.00006822908,0.00006735808,0.92389876,0.00079277385,0.03109945,0.0036340638,0.03852817],"study_design_scores_gemma":[0.0000028956822,0.0000044424833,0.00002769531,0.0000015772691,0.000004976546,0.000004509934,0.0000027769852,0.9949308,0.00010991085,0.004767601,0.00014034103,0.0000024938713],"about_ca_topic_score_codex":0.030387824,"about_ca_topic_score_gemma":0.023459539,"teacher_disagreement_score":0.030387824,"about_ca_system_score_codex":0.001751772,"about_ca_system_score_gemma":0.002209832,"threshold_uncertainty_score":0.060421884},"labels":[],"label_agreement":null},{"id":"W1505471309","doi":"10.1007/3-540-36265-7_25","title":"Performance Comparison of Pipelined Hash Joins on Workstation Clusters","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hash join; Hash function; Joins; Hash tree; Join (topology); Double hashing; Hash table; Parallel computing; Rolling hash; Theoretical computer science; Programming language; Mathematics","score_opus":0.03145929352713821,"score_gpt":0.24967147517444715,"score_spread":0.21821218164730893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505471309","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97674495,0.0024074,0.0069493945,0.00027008425,0.00020938394,0.00008726191,0.0013494943,0.0060436088,0.005938367],"genre_scores_gemma":[0.9817255,0.00052593724,0.011323085,0.000042059266,0.00009065942,0.00004390748,0.0024320676,0.00026922795,0.0035475022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969584,0.00058255217,0.00024953246,0.00046386322,0.001123909,0.00062166725],"domain_scores_gemma":[0.9905405,0.0048513273,0.00039806438,0.0013502841,0.0017709703,0.0010888398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028065222,0.0010426273,0.0016676022,0.0016109846,0.0011803731,0.0021418831,0.002529163,0.0011081251,0.008979711],"category_scores_gemma":[0.0058283755,0.00095621776,0.00048315406,0.004193207,0.00071197597,0.002499399,0.0013171936,0.0007994861,0.0011055376],"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.0806028,0.0026342345,0.031815536,0.002479968,0.0009238306,0.00074622437,0.0013479005,0.34446713,0.13873607,0.0112795355,0.05619166,0.32877517],"study_design_scores_gemma":[0.0030504237,0.008927301,0.03113985,0.000070851565,0.0005274899,0.00046903754,0.0011183538,0.85222244,0.08704717,0.0050184587,0.010189567,0.00021897367],"about_ca_topic_score_codex":0.006680651,"about_ca_topic_score_gemma":0.0058330297,"teacher_disagreement_score":0.008979711,"about_ca_system_score_codex":0.0018648498,"about_ca_system_score_gemma":0.0016513594,"threshold_uncertainty_score":0.030040145},"labels":[],"label_agreement":null},{"id":"W1509683276","doi":"10.1007/11823728_3","title":"Bulk Loading a Linear Hash File","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Hash function; Sorting; Random access; Torrent file; File size; Parallel computing; Hash table; Function (biology); Algorithm; Operating system; Computer file; Stub file","score_opus":0.01642191192339765,"score_gpt":0.22295529304888698,"score_spread":0.20653338112548933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509683276","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.11267882,0.0010256311,0.5960032,0.0012354453,0.0011804434,0.0012758678,0.014135913,0.14248879,0.12997584],"genre_scores_gemma":[0.46095467,0.0006482026,0.2937516,0.00061071827,0.0005512746,0.0006456927,0.018861653,0.010398743,0.21357751],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925107,0.000052517298,0.000047331585,0.00014003838,0.00035458006,0.00015449109],"domain_scores_gemma":[0.996326,0.0006626648,0.000093573384,0.0021409492,0.0005980276,0.00017871599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171692,0.0010229977,0.0011298438,0.0011703706,0.0011843967,0.0021183053,0.0018211572,0.00090511056,0.07992626],"category_scores_gemma":[0.0025611753,0.000705045,0.00053242414,0.0025555014,0.0006664254,0.0044815824,0.0029268486,0.00088126055,0.035074383],"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.0032656032,0.0004914264,0.0024705983,0.0008654835,0.000089188674,0.0004454154,0.0005374606,0.008442603,0.11236544,0.035392076,0.17346492,0.6621698],"study_design_scores_gemma":[0.00086003455,0.001284754,0.004875877,0.00020440102,0.00029785035,0.0016612465,0.0008808194,0.1855222,0.4386526,0.098133,0.26730797,0.00031922085],"about_ca_topic_score_codex":0.0019609074,"about_ca_topic_score_gemma":0.002177787,"teacher_disagreement_score":0.07992626,"about_ca_system_score_codex":0.0011766449,"about_ca_system_score_gemma":0.0013660437,"threshold_uncertainty_score":0.26737994},"labels":[],"label_agreement":null},{"id":"W1512133649","doi":"10.1145/3084041","title":"Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing","year":2017,"lang":"en","type":"paratext","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; Computer science; Steering committee; Engineering; Engineering management","score_opus":0.020776840021248494,"score_gpt":0.258025964897912,"score_spread":0.23724912487666353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512133649","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013931591,0.21442738,0.14777055,0.029818356,0.19454129,0.0020218885,0.0056267357,0.0073942808,0.38446796],"genre_scores_gemma":[0.025641508,0.109592214,0.037386563,0.0056362683,0.026019745,0.0005888729,0.010031371,0.0015329025,0.78357065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976642,0.0005521493,0.00015731993,0.00031281973,0.00110637,0.00020703627],"domain_scores_gemma":[0.99499184,0.0009849111,0.00021645906,0.0004740357,0.0022634633,0.0010692212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024717706,0.0017193682,0.0017757727,0.0016103596,0.00097245123,0.0042814272,0.0016111609,0.0016535753,0.08432396],"category_scores_gemma":[0.004459497,0.0005021397,0.00069205445,0.0012944242,0.0007563399,0.004112272,0.0020833109,0.0041453736,0.071563885],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0001319051,0.00012218344,0.0007331518,0.00056317623,0.00007298342,0.00021018315,0.00013431978,0.00029360616,0.0037486837,0.0033437298,0.72229946,0.2683466],"study_design_scores_gemma":[0.00001028098,0.00010747586,0.0009403715,0.00022310436,0.00003165313,0.00035177087,0.000107484266,0.001178586,0.00072188606,0.0017976176,0.99450713,0.000022604605],"about_ca_topic_score_codex":0.0018097638,"about_ca_topic_score_gemma":0.003343058,"teacher_disagreement_score":0.08432396,"about_ca_system_score_codex":0.0007859591,"about_ca_system_score_gemma":0.001808634,"threshold_uncertainty_score":0.28209174},"labels":[],"label_agreement":null},{"id":"W1515684223","doi":"10.1109/infocom.2015.7218541","title":"SmartEye: Real-time and efficient cloud image sharing for disaster environments","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cloud computing; Data deduplication; Scalability; Upload; Software-defined networking; Quality of service; Computer network; Computer security; Database; World Wide Web","score_opus":0.021221858207136755,"score_gpt":0.2286225348427982,"score_spread":0.20740067663566145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515684223","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28065234,0.0012342288,0.67841023,0.0009456003,0.00048183135,0.00094851846,0.0009803071,0.020570207,0.015776671],"genre_scores_gemma":[0.9087084,0.00016855267,0.08775626,0.00022541334,0.00005677523,0.00011924621,0.00056704157,0.00016088223,0.00223738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994849,0.00006281156,0.000023960218,0.00008676339,0.0001928719,0.00014860599],"domain_scores_gemma":[0.9993586,0.0000759295,0.00006658546,0.00024522503,0.00010552751,0.00014806142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064913806,0.0006156223,0.00059828145,0.0006161838,0.0009063627,0.00085215206,0.0021246437,0.000654419,0.0022971914],"category_scores_gemma":[0.0012805888,0.00023317298,0.00033894888,0.0006420004,0.0006516417,0.002331422,0.0032640002,0.00062785525,0.0005693324],"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.003237482,0.001282946,0.008591581,0.00034500693,0.00019170654,0.0021733113,0.0008233638,0.13947484,0.18681903,0.025579328,0.07846964,0.55301183],"study_design_scores_gemma":[0.00014551161,0.00028326857,0.0025745563,0.0000142859535,0.000022427255,0.0004402094,0.00029488382,0.9501151,0.022931747,0.008318211,0.014769855,0.00008998665],"about_ca_topic_score_codex":0.0030161578,"about_ca_topic_score_gemma":0.0036698456,"teacher_disagreement_score":0.0030161578,"about_ca_system_score_codex":0.00070328114,"about_ca_system_score_gemma":0.00079060433,"threshold_uncertainty_score":0.0076848865},"labels":[],"label_agreement":null},{"id":"W1516638191","doi":"10.1109/hicss.2001.926537","title":"Taylor series prediction: a cache replacement policy based on second-order trend analysis","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"U.S. Environmental Protection Agency","keywords":"Computer science; Cache; Series (stratigraphy); Order (exchange); Cache algorithms; Time series; Trend analysis; Taylor series; The Internet; CPU cache; Computer network; World Wide Web; Machine learning","score_opus":0.0124221816106277,"score_gpt":0.23462136408605586,"score_spread":0.22219918247542816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516638191","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.044602897,0.0005373145,0.95118296,0.00062277226,0.00013405348,0.000079273545,0.00010875764,0.0010377603,0.0016942789],"genre_scores_gemma":[0.82018,0.0009401709,0.17478395,0.00029259993,0.00023229574,0.00014492872,0.0002819663,0.00015029412,0.0029937897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990094,0.00032932247,0.000077038,0.00018466607,0.0003194233,0.00008020255],"domain_scores_gemma":[0.995216,0.0026791338,0.0004497211,0.00032185207,0.0012105078,0.0001227838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892004,0.0007067382,0.0013395746,0.0009295886,0.0005616519,0.000763229,0.0012686073,0.0010633786,0.0011541449],"category_scores_gemma":[0.013366972,0.0003679605,0.0006470534,0.0010240742,0.0005810886,0.001782232,0.00048405273,0.0012945123,0.00045237236],"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.0003061859,0.00017609392,0.0105074,0.0001604828,0.00013430955,0.00024657082,0.00028785403,0.75121593,0.005594089,0.019637065,0.006567129,0.20516692],"study_design_scores_gemma":[0.0000068581858,0.00003274398,0.00030422743,0.000005811875,0.000010700587,0.000028518169,0.000007963203,0.9964658,0.00057137216,0.0022396254,0.0003184253,0.000007814276],"about_ca_topic_score_codex":0.009922323,"about_ca_topic_score_gemma":0.0074831657,"teacher_disagreement_score":0.009922323,"about_ca_system_score_codex":0.00096944714,"about_ca_system_score_gemma":0.0014147655,"threshold_uncertainty_score":0.019729137},"labels":[],"label_agreement":null},{"id":"W1517263106","doi":"10.1007/978-3-642-11686-5_10","title":"Peer-Assisted Media Streaming: A Holistic Review","year":2010,"lang":"en","type":"review","venue":"Studies in computational intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Live streaming; Computer science; Real Time Streaming Protocol; Peer-to-peer; Coding (social sciences); Protocol (science); Scheduling (production processes); Linear network coding; Video on demand; Protocol design; Video streaming; Multimedia; Computer network; Distributed computing; Communications protocol; World Wide Web; Engineering; The Internet","score_opus":0.3335486728722687,"score_gpt":0.46068444064405506,"score_spread":0.12713576777178637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517263106","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015204854,0.997136,0.0005326664,0.00088286464,0.00043600518,0.000013443744,0.000020977464,0.0000074848754,0.00081861054],"genre_scores_gemma":[0.0013258002,0.99695444,0.0005696823,0.0003086737,0.0005393576,0.000011765395,0.000024981944,0.0000033933038,0.00026189207],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993267,0.00011949119,0.00011398559,0.00012082767,0.0002717664,0.000047243753],"domain_scores_gemma":[0.9908455,0.0060510617,0.00047504136,0.0001840786,0.0022047593,0.0002394908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031885493,0.0009526469,0.002488456,0.0030526593,0.00039125752,0.0018016017,0.0024402183,0.0020790594,0.0036194732],"category_scores_gemma":[0.008617274,0.00050088175,0.0005929422,0.0045151003,0.0009882734,0.0033801093,0.0008632603,0.0015948708,0.0016962426],"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.00012610706,0.00012484653,0.0002468009,0.020653412,0.00018325211,0.00010662164,0.000064769156,0.000652661,0.0008321257,0.005477139,0.040770162,0.9307621],"study_design_scores_gemma":[0.000090962654,0.00034917798,0.0011596892,0.012412607,0.0006738896,0.0010244376,0.00014791233,0.000742862,0.0013083471,0.0058259363,0.9761988,0.00006544244],"about_ca_topic_score_codex":0.00173595,"about_ca_topic_score_gemma":0.0025078407,"teacher_disagreement_score":0.0036194732,"about_ca_system_score_codex":0.0010345702,"about_ca_system_score_gemma":0.0034525013,"threshold_uncertainty_score":0.01686287},"labels":[],"label_agreement":null},{"id":"W1522543880","doi":"10.1109/pimrc.2004.1370958","title":"Mobility-aware Web prefetching over heterogeneous wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Roaming; Computer science; Instruction prefetch; Computer network; Heterogeneous network; Wireless network; Heterogeneous wireless network; Wireless; Wi-Fi; Distributed computing; Telecommunications","score_opus":0.011616377418975615,"score_gpt":0.22181616335764087,"score_spread":0.21019978593866526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522543880","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.28199387,0.0007570114,0.7134507,0.00024118762,0.000052827345,0.00005795302,0.00004675006,0.0010193285,0.0023804354],"genre_scores_gemma":[0.9748489,0.00015947051,0.024296103,0.000021381913,0.00002732846,0.00001764293,0.000025845458,0.000022687267,0.00058067386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975604,0.00006903906,0.00001323154,0.0000449002,0.00007106991,0.000045739256],"domain_scores_gemma":[0.9992473,0.00035193108,0.00009021946,0.0001133473,0.00013720794,0.000060094815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039139352,0.00038223254,0.0005723444,0.00038748185,0.000562478,0.000575453,0.00087019,0.00041982616,0.00042404883],"category_scores_gemma":[0.0021354,0.00021453583,0.00023295255,0.00047289702,0.00039708248,0.001091043,0.00046703743,0.00038240218,0.00009513454],"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.00033629048,0.00012681336,0.0051883096,0.00006566003,0.00005751036,0.00048684631,0.0001663032,0.864657,0.02327223,0.011666936,0.0014024042,0.092573695],"study_design_scores_gemma":[0.0000063280354,0.000025769541,0.00040535905,0.0000021539995,0.000010466812,0.000039932904,0.000019208188,0.9958823,0.0018579267,0.0013781129,0.0003663268,0.000006158011],"about_ca_topic_score_codex":0.005812818,"about_ca_topic_score_gemma":0.0059285704,"teacher_disagreement_score":0.005812818,"about_ca_system_score_codex":0.0007232257,"about_ca_system_score_gemma":0.00045704356,"threshold_uncertainty_score":0.011557996},"labels":[],"label_agreement":null},{"id":"W1529853583","doi":"10.1049/iet-com.2011.0196","title":"Unveiling popularity of BitTorrent Darknets","year":2012,"lang":"en","type":"article","venue":"IET Communications","topic":"Caching and Content Delivery","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":"Simon Fraser University","funders":"","keywords":"BitTorrent; Popularity; BitTorrent tracker; Upload; Computer science; Incentive; Internet privacy; Computer security; Computer network; Peer-to-peer; World Wide Web; Law; Artificial intelligence; Political science","score_opus":0.06657170852920677,"score_gpt":0.30062379833560876,"score_spread":0.234052089806402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529853583","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.9845501,0.00042729412,0.004895876,0.00044242092,0.000019391391,0.000026226424,0.0004265328,0.0001392684,0.009073015],"genre_scores_gemma":[0.99763834,0.00017915235,0.0010423479,0.000026554342,0.00001900064,0.000006659213,0.00021994147,0.00002442515,0.00084352074],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988821,0.00031705128,0.00007369199,0.00019533354,0.00037118595,0.00016069201],"domain_scores_gemma":[0.9827943,0.00839179,0.0028845554,0.0012279311,0.004123074,0.0005784829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014816724,0.00020825486,0.00041132647,0.0037599157,0.0006394854,0.0015296441,0.0007797977,0.0007421948,0.0012922186],"category_scores_gemma":[0.01100721,0.00023139546,0.00017450722,0.003166048,0.0007522524,0.003449109,0.0008693036,0.0006188449,0.00034369345],"study_design_candidate":"observational","study_design_consensus":"observational","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.0011543268,0.00036386578,0.7392158,0.00044276635,0.00014009413,0.0019913658,0.0075031873,0.023965366,0.019548437,0.05039387,0.007892874,0.14738818],"study_design_scores_gemma":[0.000056492012,0.00061619456,0.51556945,0.00021778,0.0002488272,0.0037372948,0.009924956,0.3919364,0.034469157,0.015526596,0.027491258,0.00020552131],"about_ca_topic_score_codex":0.0041865814,"about_ca_topic_score_gemma":0.0038888461,"teacher_disagreement_score":0.0041865814,"about_ca_system_score_codex":0.001035839,"about_ca_system_score_gemma":0.0003481914,"threshold_uncertainty_score":0.008324385},"labels":[],"label_agreement":null},{"id":"W153147739","doi":"","title":"Improving Web Server Performance with Predictive Caching.","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"Computer science; Server; Web server; The Internet; Latency (audio); Computer network; Web API; Web navigation; World Wide Web; File server; Telecommunications","score_opus":0.0061803787020866825,"score_gpt":0.17190134376658744,"score_spread":0.16572096506450076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153147739","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.32359603,0.009930048,0.62581265,0.00206057,0.00035488387,0.00026692078,0.00030635908,0.01513314,0.022539375],"genre_scores_gemma":[0.9539846,0.0009808063,0.042961944,0.00014851194,0.00008185121,0.00003855754,0.00015868254,0.00011476715,0.0015301243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992192,0.00018203039,0.000029065843,0.000079120895,0.0003745987,0.00011597777],"domain_scores_gemma":[0.99798596,0.0009038796,0.00016558953,0.00043613263,0.0004052924,0.00010304275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011010435,0.0009724086,0.00060591515,0.0006432738,0.000552815,0.001329403,0.0018757131,0.0014835699,0.0013176842],"category_scores_gemma":[0.0049861884,0.00030080156,0.0002856018,0.0010457085,0.00065379345,0.002645296,0.00080321333,0.0009924193,0.0008856581],"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.00093092717,0.00087690155,0.009143155,0.0004162431,0.00012599907,0.0004079451,0.00023614905,0.5288351,0.07202931,0.015175221,0.009394131,0.36242884],"study_design_scores_gemma":[0.00003921635,0.00024433952,0.0010261964,0.000020438698,0.000048749807,0.00019817414,0.00004298456,0.9722707,0.017881481,0.0064654495,0.0017386624,0.000023648176],"about_ca_topic_score_codex":0.0041511925,"about_ca_topic_score_gemma":0.0038078048,"teacher_disagreement_score":0.0041511925,"about_ca_system_score_codex":0.0010062016,"about_ca_system_score_gemma":0.0010186911,"threshold_uncertainty_score":0.008254051},"labels":[],"label_agreement":null},{"id":"W1533584723","doi":"10.1109/iccnc.2015.7069439","title":"An application-layer approach for energy-efficient multimedia streaming","year":2015,"lang":"en","type":"article","venue":"2015 International Conference on Computing, Networking and Communications (ICNC)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Session (web analytics); The Internet; Energy (signal processing); Multimedia; Efficient energy use; World Wide Web; Computer network; Database; Electrical engineering; Engineering; Physics","score_opus":0.1104339129886689,"score_gpt":0.3329213190148043,"score_spread":0.22248740602613543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533584723","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.012055522,0.00085019483,0.97098327,0.0003941605,0.00019649108,0.00029295965,0.00007481954,0.0031684183,0.011984199],"genre_scores_gemma":[0.35527733,0.0016343609,0.622418,0.00058937405,0.0002726595,0.00031310198,0.00034757785,0.0003840245,0.018763585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935514,0.00010016936,0.000053825876,0.00007430585,0.000344098,0.000072448944],"domain_scores_gemma":[0.99963737,0.000073730065,0.000021707816,0.00006920917,0.00016535672,0.000032544278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081361586,0.000747115,0.00039524178,0.0004965715,0.0006118457,0.0014806809,0.0017384646,0.0007743864,0.003007544],"category_scores_gemma":[0.0013274072,0.0003199723,0.0005624466,0.0005377657,0.00035934144,0.0013571165,0.0013263975,0.0013260494,0.0011708791],"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.00048881536,0.0004453262,0.0017098716,0.0006023548,0.0001988026,0.0011450854,0.0005443281,0.095032305,0.24434187,0.10993187,0.020896582,0.5246628],"study_design_scores_gemma":[0.000039529914,0.00017087127,0.00049957837,0.00004353506,0.00010022498,0.0005299581,0.00011302005,0.87462664,0.049158044,0.017161008,0.057513747,0.000043874585],"about_ca_topic_score_codex":0.0018224803,"about_ca_topic_score_gemma":0.0027425468,"teacher_disagreement_score":0.003007544,"about_ca_system_score_codex":0.0005182054,"about_ca_system_score_gemma":0.0008809126,"threshold_uncertainty_score":0.010061204},"labels":[],"label_agreement":null},{"id":"W1540825607","doi":"10.1109/icspc.2007.4728602","title":"Multimedia Content Repurposing for Heterogeneous Wireless Clients","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Repurposing; Computer science; Computer network; Wireless; Wireless network; Multimedia; Multi-frequency network; Bandwidth (computing); World Wide Web; Wi-Fi array; Telecommunications","score_opus":0.04839910518842593,"score_gpt":0.2659830912758814,"score_spread":0.21758398608745544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540825607","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.27717733,0.0007642068,0.71253353,0.00025750627,0.000027157921,0.00028070356,0.00006619037,0.0032146426,0.0056787645],"genre_scores_gemma":[0.7901427,0.00033944126,0.20492215,0.00007749574,0.000048147853,0.00009919591,0.00023180743,0.00014143802,0.0039976332],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953616,0.00010205329,0.000025427238,0.000079970574,0.00016190961,0.00009453224],"domain_scores_gemma":[0.9989177,0.00021924992,0.00010425744,0.00042713518,0.0002081496,0.00012349438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062578847,0.000690735,0.00084974716,0.0007138613,0.0008422322,0.001157306,0.0017736288,0.00068897865,0.0017636141],"category_scores_gemma":[0.0018695714,0.000309302,0.0005155735,0.0007962089,0.00039518412,0.0019882037,0.0014603428,0.0008048379,0.00052124314],"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.0011270226,0.0007474561,0.0052824165,0.00018084333,0.00016494845,0.0025991965,0.00071736623,0.098974615,0.33137476,0.017712917,0.005138612,0.53597987],"study_design_scores_gemma":[0.000076592114,0.00024748183,0.0015579372,0.000012161459,0.00008153538,0.0009590949,0.0002648502,0.8874757,0.09723065,0.0060658185,0.0059676464,0.000060538463],"about_ca_topic_score_codex":0.0025952589,"about_ca_topic_score_gemma":0.002241366,"teacher_disagreement_score":0.0025952589,"about_ca_system_score_codex":0.0006973858,"about_ca_system_score_gemma":0.00058367697,"threshold_uncertainty_score":0.0058998466},"labels":[],"label_agreement":null},{"id":"W1541989877","doi":"10.1109/icac.2005.29","title":"Feedback-based Scheduling for Back-end Databases in Shared Dynamic Content Server Clusters","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Provisioning; Distributed computing; Scheduling (production processes); Server; Scalability; Quality of service; Fault tolerance; Dynamic priority scheduling; Load balancing (electrical power); Database; Computer network","score_opus":0.06150122807826486,"score_gpt":0.2710911986953017,"score_spread":0.20958997061703682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541989877","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.3914425,0.00069334276,0.6011059,0.00041847595,0.00014884082,0.00015609262,0.00010623477,0.0037307015,0.0021978659],"genre_scores_gemma":[0.9570313,0.00007590707,0.0421257,0.000043265318,0.000038210208,0.000046250585,0.0000621195,0.0000622594,0.00051500025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989786,0.00029635162,0.000064473556,0.00016074785,0.0003403313,0.00015953905],"domain_scores_gemma":[0.99715376,0.0011275861,0.0002657418,0.0005990629,0.00058565126,0.00026814552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018064952,0.00043556475,0.00058632094,0.0005223172,0.0010266887,0.0010190809,0.0020157392,0.00054470316,0.0007527827],"category_scores_gemma":[0.004760384,0.00038678583,0.00021968466,0.00064471335,0.00066773564,0.0014092388,0.00085467694,0.0005749045,0.00016702265],"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.0015940977,0.00045159142,0.0055219494,0.00016852489,0.00008201749,0.00032506103,0.00066413963,0.7301268,0.06502368,0.024177276,0.0057053724,0.16615947],"study_design_scores_gemma":[0.00004562855,0.00008807404,0.000490649,0.0000029049122,0.000010939286,0.00002746485,0.000039380997,0.98922104,0.0052067214,0.0042058607,0.00065109535,0.000010217474],"about_ca_topic_score_codex":0.0053941454,"about_ca_topic_score_gemma":0.0052478225,"teacher_disagreement_score":0.0053941454,"about_ca_system_score_codex":0.0019057374,"about_ca_system_score_gemma":0.0013825848,"threshold_uncertainty_score":0.013827145},"labels":[],"label_agreement":null},{"id":"W1542297288","doi":"10.1109/wwc.2001.22","title":"Synthetic trace generation for the Internet","year":2001,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Locality; Locality of reference; Router; The Internet; Computer network; TRACE (psycholinguistics); Network packet; IP forwarding; Routing (electronic design automation); Aggregate (composite); Internet traffic; Routing table; Routing protocol; Distributed computing; Cache; World Wide Web","score_opus":0.04312336171498025,"score_gpt":0.24038467534601057,"score_spread":0.19726131363103033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542297288","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5299064,0.0015161929,0.41468054,0.0022977372,0.00042119983,0.0008320397,0.023619669,0.010190887,0.016535342],"genre_scores_gemma":[0.85544944,0.00030211944,0.12650841,0.00011381873,0.00006403805,0.00037424755,0.014080261,0.00031040507,0.0027973368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993693,0.00024606302,0.000030781073,0.00010835146,0.00019407745,0.000051517687],"domain_scores_gemma":[0.9958702,0.002397098,0.0001942734,0.000668235,0.00073408196,0.0001362011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011609476,0.0005672895,0.0003412342,0.0014362179,0.0003989331,0.0006965459,0.0011464686,0.0008275881,0.0040524513],"category_scores_gemma":[0.008098896,0.00021927893,0.0003771603,0.0016602341,0.00047031033,0.0006463443,0.0006746224,0.00068333495,0.0005808087],"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.00066826906,0.00047757468,0.009727618,0.00030222273,0.00007410052,0.00031679377,0.00023470042,0.8130284,0.004000988,0.01861065,0.017598793,0.13495986],"study_design_scores_gemma":[0.000025758944,0.000055885215,0.00071746303,0.000010853502,0.0000061066735,0.00004914823,0.000036045098,0.9872569,0.0013948765,0.007401633,0.0030384588,0.0000069373104],"about_ca_topic_score_codex":0.006642557,"about_ca_topic_score_gemma":0.0059620976,"teacher_disagreement_score":0.006642557,"about_ca_system_score_codex":0.0010197102,"about_ca_system_score_gemma":0.00063132314,"threshold_uncertainty_score":0.013556838},"labels":[],"label_agreement":null},{"id":"W1544609931","doi":"10.1109/mobserv.2015.61","title":"P2P Key-Value Storage Synchronization Workflow for Agronomic Data Management","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Cloud storage; Mobile computing; Computer network; Mobile device; Data synchronization; Cloud computing; Mobile database; Data management; Mobile telephony; Database; Mobile station; Encryption; Wireless sensor network; Mobile radio; World Wide Web; Base station; Operating system","score_opus":0.06140821715564314,"score_gpt":0.26388578056209794,"score_spread":0.20247756340645479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544609931","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.016071245,0.00046157197,0.9521618,0.00069743063,0.000184011,0.0009860601,0.0014254923,0.017901672,0.01011077],"genre_scores_gemma":[0.5231035,0.00090648653,0.4507371,0.00033910404,0.0001337789,0.0010548146,0.0044859513,0.00089478015,0.018344533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986634,0.00021534128,0.0001690586,0.00029480437,0.00045278255,0.0002046827],"domain_scores_gemma":[0.9981988,0.0003119497,0.00014964456,0.0007159877,0.00046589633,0.00015776884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019684704,0.0008051225,0.0007658785,0.0014086583,0.0018790622,0.0028822771,0.0019900117,0.0008192046,0.006547628],"category_scores_gemma":[0.0036439279,0.0004431887,0.00056017656,0.002036046,0.00062906,0.00346641,0.002679985,0.0013478403,0.00355564],"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.001897039,0.00065537787,0.007764679,0.0009829256,0.00021694668,0.0022306768,0.0021366535,0.03833451,0.07580539,0.1480263,0.07755873,0.6443908],"study_design_scores_gemma":[0.00022925476,0.0003435183,0.0036643909,0.00017811166,0.00013305843,0.0010896539,0.00095699803,0.5579383,0.13346767,0.107702315,0.19406833,0.00022847622],"about_ca_topic_score_codex":0.005402186,"about_ca_topic_score_gemma":0.004371309,"teacher_disagreement_score":0.006547628,"about_ca_system_score_codex":0.0014317505,"about_ca_system_score_gemma":0.004197133,"threshold_uncertainty_score":0.021903992},"labels":[],"label_agreement":null},{"id":"W1552747463","doi":"10.1109/mascots.2006.49","title":"Towards Stadium-Scale Wireless Media Streaming","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; Scalability; Exploit; Computer network; Architecture; Real Time Streaming Protocol; Wireless; Workload; Channel (broadcasting); Distributed computing; Multimedia; The Internet; Telecommunications; Operating system; Computer security","score_opus":0.009464384994856393,"score_gpt":0.19900383553119125,"score_spread":0.18953945053633486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552747463","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.15184109,0.002653594,0.83018786,0.001282188,0.00017158127,0.00017347041,0.00009386119,0.003237751,0.010358615],"genre_scores_gemma":[0.6676377,0.0020958942,0.32336354,0.00034824826,0.00019461603,0.00014917317,0.0002362761,0.00017567544,0.0057989787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996629,0.00008317011,0.000018377836,0.000040275092,0.00015425893,0.000041103223],"domain_scores_gemma":[0.9992987,0.00021811371,0.00004362366,0.00012390288,0.00023396079,0.00008174118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067879737,0.00032886915,0.00037593444,0.00036350862,0.0005871749,0.00091485557,0.0010272842,0.000483942,0.0014393376],"category_scores_gemma":[0.0019974161,0.00026085138,0.00020418328,0.000607668,0.0006889898,0.0017497254,0.0009877646,0.0011013997,0.0007253461],"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.00089406024,0.0003934908,0.00579485,0.00075687,0.00009558312,0.0008849589,0.0013980754,0.17077194,0.24552193,0.16368046,0.01575511,0.39405268],"study_design_scores_gemma":[0.00008431199,0.00029481793,0.0009212416,0.00005392448,0.000040172417,0.0003099978,0.00021491807,0.88485557,0.033462223,0.041962203,0.037762083,0.00003850657],"about_ca_topic_score_codex":0.0018770528,"about_ca_topic_score_gemma":0.0023735792,"teacher_disagreement_score":0.0018770528,"about_ca_system_score_codex":0.00059029897,"about_ca_system_score_gemma":0.0005897881,"threshold_uncertainty_score":0.004815042},"labels":[],"label_agreement":null},{"id":"W1554966033","doi":"10.1109/icc.2015.7248935","title":"Virtual resource allocation in information-centric wireless virtual networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"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","keywords":"Computer science; Resource allocation; Computer network; Wireless; Resource management (computing); Wireless network; Resource (disambiguation); Distributed computing; Telecommunications","score_opus":0.014556508860540945,"score_gpt":0.20676262686401986,"score_spread":0.19220611800347892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554966033","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.022324847,0.0005757542,0.97440356,0.0001831598,0.000049328017,0.00002782704,0.000013948508,0.00008210183,0.0023395172],"genre_scores_gemma":[0.90698117,0.0004398534,0.090808325,0.00011514185,0.000049699876,0.00007300053,0.000026957676,0.000027901739,0.001478017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991399,0.0004901335,0.000022789183,0.00009385905,0.00013199881,0.00012138899],"domain_scores_gemma":[0.9992748,0.00043092037,0.000087649656,0.000070833165,0.00008251067,0.0000532215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013916031,0.00050339627,0.000681948,0.00028830254,0.0004574234,0.00097604626,0.0009749895,0.000539395,0.00072908466],"category_scores_gemma":[0.0021664517,0.00027858713,0.00025835153,0.0005720543,0.00093060866,0.0014845867,0.0010785804,0.0006737695,0.000086401626],"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.000053866836,0.00003340795,0.00019472129,0.00004355041,0.000022462942,0.00006900089,0.00004571161,0.92581624,0.0019050403,0.048535187,0.0007703962,0.022510413],"study_design_scores_gemma":[0.0000054949614,0.000014786125,0.00003233633,0.0000024727372,0.0000034880065,0.00001540599,0.000008567744,0.991088,0.00034364904,0.007968682,0.00051396707,0.0000031593602],"about_ca_topic_score_codex":0.0018223589,"about_ca_topic_score_gemma":0.0018324597,"teacher_disagreement_score":0.0018223589,"about_ca_system_score_codex":0.0010635646,"about_ca_system_score_gemma":0.0010826205,"threshold_uncertainty_score":0.007716775},"labels":[],"label_agreement":null},{"id":"W1558907079","doi":"10.1109/iscas.2004.1329243","title":"Multi-server optimal bandwidth monitoring for collaborative distributed retrieval","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Alberta","funders":"","keywords":"Computer science; Server; Bandwidth (computing); Scalability; Video retrieval; Computer network; Data retrieval; Task (project management); Process (computing); Information retrieval; Distributed computing; Real-time computing; Database; Operating system","score_opus":0.03614074381871764,"score_gpt":0.27158051165888963,"score_spread":0.235439767840172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558907079","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.0345342,0.00047688678,0.9629999,0.00013484662,0.000029364006,0.000050091967,0.000020301519,0.00057991355,0.0011744847],"genre_scores_gemma":[0.85169965,0.00016576906,0.14645597,0.00005131022,0.000058428188,0.00010383827,0.0000512401,0.000052743606,0.0013611295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982456,0.0005295277,0.00009778282,0.0004459296,0.0004977703,0.00018342097],"domain_scores_gemma":[0.99723595,0.0013933385,0.00036980247,0.0004499202,0.00040862223,0.00014244285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021082559,0.00061392837,0.0014531292,0.0008132999,0.0008350776,0.0011966919,0.001826487,0.0010680554,0.00082072715],"category_scores_gemma":[0.0064980574,0.0005014715,0.00040011623,0.0010213314,0.00078371505,0.0019250518,0.0010824569,0.00083230267,0.00031627525],"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.0005927661,0.00022643342,0.0014200787,0.00010185539,0.00007432255,0.00011748196,0.000160269,0.7988002,0.014768316,0.016361738,0.0020516429,0.16532496],"study_design_scores_gemma":[0.000017404303,0.000028025986,0.00012311587,0.0000018856166,0.000007534465,0.000026493912,0.000008089231,0.99586177,0.0010563908,0.0026455815,0.0002184179,0.0000051821708],"about_ca_topic_score_codex":0.0029374715,"about_ca_topic_score_gemma":0.0021712696,"teacher_disagreement_score":0.0029374715,"about_ca_system_score_codex":0.0015545291,"about_ca_system_score_gemma":0.0012241959,"threshold_uncertainty_score":0.011278987},"labels":[],"label_agreement":null},{"id":"W1564692306","doi":"10.1109/icc.2015.7249238","title":"Dynamic adaptive streaming over popularity-driven caching in Information-Centric Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Computer network; Popularity; The Internet; Zipf's law; Information-centric networking; Video quality; Queueing theory; Quality of experience; Dynamic Adaptive Streaming over HTTP; Multimedia; Quality of service; Real-time computing; Metric (unit); World Wide Web","score_opus":0.016246316263427384,"score_gpt":0.2280633463327073,"score_spread":0.21181703006927993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564692306","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.3072301,0.001838313,0.6797152,0.0008760173,0.00011986699,0.00018693601,0.00026314377,0.0011160888,0.00865428],"genre_scores_gemma":[0.9734971,0.00036038097,0.024893427,0.00006516511,0.00003648344,0.000043713502,0.00006490517,0.00002814832,0.0010106758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926776,0.0002393486,0.00003080937,0.00011292364,0.00019967585,0.00014943953],"domain_scores_gemma":[0.99767274,0.0012683754,0.00022352357,0.00019367095,0.00049830845,0.00014343594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015521412,0.0006037609,0.00074747676,0.00052348943,0.00068658387,0.000963301,0.0014728864,0.00059168943,0.00077039667],"category_scores_gemma":[0.00401216,0.00026951308,0.00026556305,0.0009766648,0.0007454235,0.0014077406,0.0006306273,0.0006615893,0.00009088054],"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.0003113371,0.00009203239,0.0010882092,0.000078763405,0.000032287,0.00009043006,0.0000701964,0.9434383,0.005231737,0.023377335,0.0011974007,0.024992008],"study_design_scores_gemma":[0.000008687844,0.000033289078,0.00010854789,0.0000027218289,0.0000062674494,0.000012873187,0.000009794255,0.9959947,0.00062127894,0.0029525475,0.00024561133,0.00000368657],"about_ca_topic_score_codex":0.013689091,"about_ca_topic_score_gemma":0.014065103,"teacher_disagreement_score":0.013689091,"about_ca_system_score_codex":0.002830841,"about_ca_system_score_gemma":0.002040976,"threshold_uncertainty_score":0.027218819},"labels":[],"label_agreement":null},{"id":"W1575367420","doi":"10.1109/ccnc.2015.7157985","title":"An Information Centric Networking approach towards contextualized edge service","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Orchestration; Service (business); Information-centric networking; Scalability; Computer network; Personalization; Enhanced Data Rates for GSM Evolution; Edge device; Next-generation network; Active networking; World Wide Web; Telecommunications; Multimedia; Cache; The Internet; Cloud computing","score_opus":0.04981285538484662,"score_gpt":0.2505393972236548,"score_spread":0.2007265418388082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575367420","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.0053627975,0.001810299,0.942063,0.0032136566,0.00035824784,0.00016130056,0.00009654504,0.0004608714,0.046473265],"genre_scores_gemma":[0.3359449,0.0047217766,0.63484645,0.002092609,0.0009095913,0.00043399472,0.00030659972,0.00022102302,0.020523064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843234,0.0005292289,0.00009448838,0.000341689,0.0003917738,0.00021038305],"domain_scores_gemma":[0.9989328,0.00033114047,0.00007022827,0.0002847225,0.00022846111,0.00015253562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144563,0.00081148266,0.0005014433,0.0012258004,0.0015277831,0.0052792626,0.002471411,0.0019479545,0.0030236405],"category_scores_gemma":[0.0019729517,0.0005118155,0.00079564005,0.0013352082,0.0028503367,0.0063617467,0.0042014956,0.0030047114,0.0007113459],"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.000028751938,0.00003423882,0.00026903785,0.000099591394,0.000016870763,0.00023132186,0.00050783204,0.009506917,0.0024450514,0.96032953,0.0024362854,0.024094477],"study_design_scores_gemma":[0.000022791626,0.00010418642,0.00039169707,0.00022471542,0.00007831272,0.0005493497,0.0007768835,0.13204983,0.005877836,0.58628416,0.2735746,0.000065531705],"about_ca_topic_score_codex":0.0042636446,"about_ca_topic_score_gemma":0.0046284767,"teacher_disagreement_score":0.0052792626,"about_ca_system_score_codex":0.002616297,"about_ca_system_score_gemma":0.0022036529,"threshold_uncertainty_score":0.018982708},"labels":[],"label_agreement":null},{"id":"W1575538731","doi":"","title":"Analysis and performance evaluation of data transport methods in Content-Centric Networking","year":2013,"lang":"en","type":"article","venue":"Asia-Pacific Network Operations and Management Symposium","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth (computing); Content centric networking; Computer network; Content delivery","score_opus":0.055039696932119936,"score_gpt":0.2953566142127356,"score_spread":0.2403169172806157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575538731","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.87742275,0.00486369,0.10909875,0.0004175224,0.000116056835,0.00026301335,0.00027341995,0.000608302,0.006936455],"genre_scores_gemma":[0.9823857,0.0007107966,0.015978312,0.000020776988,0.0000299805,0.000077944955,0.00018950428,0.000048754388,0.0005582366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99403447,0.0021457681,0.00029248127,0.00042840652,0.0025455928,0.0005533001],"domain_scores_gemma":[0.9778593,0.0154624805,0.0011633919,0.001463443,0.003775488,0.00027596636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00564384,0.0012426855,0.00086569105,0.0031468826,0.0008015915,0.0014819235,0.0013794446,0.0011428795,0.0008623284],"category_scores_gemma":[0.016808935,0.00036503782,0.0005665392,0.0031169623,0.00073048705,0.002906655,0.00060596253,0.0007464279,0.00018723244],"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.0026762516,0.0013740932,0.036618467,0.0007797997,0.00034324802,0.00030698854,0.00038135707,0.6924511,0.037085526,0.014942183,0.0018537411,0.21118726],"study_design_scores_gemma":[0.0000152165485,0.00043054283,0.0034043626,0.00001644655,0.000051971478,0.00006719954,0.00007732378,0.9828541,0.011776012,0.00081162003,0.00047441962,0.000020865706],"about_ca_topic_score_codex":0.0074494653,"about_ca_topic_score_gemma":0.00281005,"teacher_disagreement_score":0.0074494653,"about_ca_system_score_codex":0.003921339,"about_ca_system_score_gemma":0.0009552945,"threshold_uncertainty_score":0.02984786},"labels":[],"label_agreement":null},{"id":"W1578015699","doi":"10.1109/infocom.2015.7218428","title":"Location-aware associated data placement for geo-distributed data-intensive applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":71,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Partition (number theory); Distributed database; Hash function; TRACE (psycholinguistics); Set (abstract data type); Database transaction; Scheme (mathematics); Data mining; Database; Computer security","score_opus":0.18399870200226653,"score_gpt":0.3317666399366781,"score_spread":0.14776793793441156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578015699","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.11660788,0.0016615116,0.8710998,0.00050039246,0.00020783863,0.00024769828,0.00037877617,0.0072202343,0.0020757867],"genre_scores_gemma":[0.68275553,0.00045110701,0.31467852,0.000079490674,0.00006850335,0.00010054315,0.0006801675,0.00015029224,0.0010358422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987651,0.00035809333,0.00014749207,0.0002669985,0.00035574927,0.00010659106],"domain_scores_gemma":[0.9962374,0.00072499336,0.00038536175,0.0016550139,0.0007111918,0.000286052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013456227,0.00077605,0.0009847793,0.0011047281,0.0014756451,0.0012995518,0.0025562842,0.00092416187,0.00081332703],"category_scores_gemma":[0.005908402,0.0005172017,0.00035584753,0.0030371002,0.0006843572,0.0030008927,0.0020697648,0.00086359546,0.0006206485],"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.0009940348,0.0006599877,0.016690075,0.0006441585,0.00016169088,0.00087570056,0.0011978394,0.33432302,0.07714633,0.0153155755,0.017819926,0.5341717],"study_design_scores_gemma":[0.00008773128,0.00020028585,0.0025540064,0.00002684732,0.00005271802,0.00047253858,0.00072637555,0.9421274,0.032382347,0.010406342,0.01090123,0.00006216507],"about_ca_topic_score_codex":0.0033545373,"about_ca_topic_score_gemma":0.004843607,"teacher_disagreement_score":0.0033545373,"about_ca_system_score_codex":0.0008891128,"about_ca_system_score_gemma":0.0015611062,"threshold_uncertainty_score":0.0071163774},"labels":[],"label_agreement":null},{"id":"W1578377210","doi":"10.1002/wcm.1182","title":"OUR: Optimal Update‐based Replacement policy for cache in wireless data access networks with optimal effective hits and bandwidth requirements","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Computer network; Cache invalidation; Bandwidth (computing); Data access; Cache algorithms; Scheme (mathematics); Data transmission; Wireless; Wireless network; Distributed computing; CPU cache; Database; Telecommunications","score_opus":0.0880910298997147,"score_gpt":0.34171440433638756,"score_spread":0.2536233744366728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578377210","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.45154083,0.0034149738,0.5408365,0.00046382978,0.00014200901,0.00015719474,0.00012033668,0.00066432374,0.0026599965],"genre_scores_gemma":[0.97683185,0.00017882137,0.022413086,0.000035517576,0.000029452855,0.000028540479,0.00002979924,0.00001275319,0.0004401943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880624,0.00041979062,0.00011639246,0.00013715665,0.0003299996,0.00019034908],"domain_scores_gemma":[0.995878,0.0017226181,0.0005367756,0.0007334495,0.0009165318,0.0002127055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014547195,0.0004804291,0.0011035748,0.0006643137,0.0008028693,0.0011950897,0.0015554026,0.00069994165,0.00045777188],"category_scores_gemma":[0.0072383294,0.00033026733,0.00022703082,0.000837997,0.00056267367,0.001631687,0.00066958275,0.00045931095,0.00011889143],"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.0032421427,0.0006050518,0.0135157835,0.0007204586,0.00026906352,0.0009044516,0.0009020371,0.5734291,0.06365518,0.047169942,0.0073559983,0.28823075],"study_design_scores_gemma":[0.00007335353,0.00029651343,0.0009432861,0.00001689095,0.00007089754,0.00037016525,0.0001121123,0.9844259,0.007975819,0.004328323,0.0013596877,0.000027139615],"about_ca_topic_score_codex":0.0020984164,"about_ca_topic_score_gemma":0.0026405386,"teacher_disagreement_score":0.0020984164,"about_ca_system_score_codex":0.0010480828,"about_ca_system_score_gemma":0.0011940661,"threshold_uncertainty_score":0.00769341},"labels":[],"label_agreement":null},{"id":"W157866064","doi":"10.22215/etd/2003-05331","title":"Enhancing hyperlink structure for improving Web performance.","year":2003,"lang":"en","type":"dissertation","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Hyperlink; Web page; Path (computing); Heuristic; Traverse; Web modeling; Web navigation; World Wide Web; Information retrieval; Data mining; Computer network; Artificial intelligence; Geography","score_opus":0.00794357292894153,"score_gpt":0.21729958512428998,"score_spread":0.20935601219534844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157866064","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.3311962,0.009965602,0.60480195,0.0017008502,0.0002861873,0.0005555176,0.00052881934,0.010656047,0.04030882],"genre_scores_gemma":[0.72940314,0.003368301,0.25028116,0.00032670717,0.00031130126,0.0002783929,0.0008697415,0.0007806203,0.014380651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.00016947725,0.000020367985,0.00007259982,0.00020471518,0.00005833714],"domain_scores_gemma":[0.9971585,0.0013560266,0.000328173,0.0005383759,0.00041847103,0.00020040563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067758514,0.0008743035,0.00049924944,0.0012810011,0.0006231652,0.0013427653,0.0010527917,0.0010703997,0.00603279],"category_scores_gemma":[0.0058931885,0.000353269,0.00029583354,0.002088677,0.0004253444,0.0032415632,0.0009552426,0.0009680866,0.0019691328],"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.0006356465,0.0018510174,0.006123537,0.0010124261,0.00017162586,0.00020916536,0.00038183626,0.16684105,0.13736476,0.02357924,0.013234323,0.64859545],"study_design_scores_gemma":[0.000357227,0.0017489844,0.01014884,0.00017913543,0.00040615862,0.0011373273,0.00030992366,0.68543726,0.15727809,0.07308074,0.06980223,0.000114090304],"about_ca_topic_score_codex":0.0009467875,"about_ca_topic_score_gemma":0.0023483536,"teacher_disagreement_score":0.00603279,"about_ca_system_score_codex":0.00071715034,"about_ca_system_score_gemma":0.0007617482,"threshold_uncertainty_score":0.020181715},"labels":[],"label_agreement":null},{"id":"W1581689476","doi":"10.1002/nem.1851","title":"User‐centric context data collection and provision harnessing Content‐Centric Networking paradigm","year":2013,"lang":"en","type":"article","venue":"International Journal of Network Management","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Computer science; Computer network; Context management; Bandwidth (computing); Transmission Control Protocol; Data collection; Ubiquitous computing; Network packet; Operating system","score_opus":0.04015442509620459,"score_gpt":0.2536399134744558,"score_spread":0.2134854883782512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581689476","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.061989333,0.00097159727,0.9267154,0.00073773175,0.00010737205,0.0003226593,0.00010234818,0.0017039335,0.0073497165],"genre_scores_gemma":[0.7449037,0.0005616173,0.2515627,0.00021561077,0.0001116006,0.0001930755,0.0002209437,0.00006322023,0.002167452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00033905404,0.00009857865,0.00018432766,0.00045925134,0.000101277445],"domain_scores_gemma":[0.99832195,0.00029408812,0.00019194749,0.0004188824,0.0006145777,0.00015856637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018815877,0.00047406147,0.0005747497,0.0009672356,0.00078590144,0.0019999023,0.0011355977,0.0006249713,0.00041497804],"category_scores_gemma":[0.0022807494,0.00021955403,0.00025826017,0.0006737788,0.0005536025,0.0027716232,0.0019132447,0.00080174545,0.00018133111],"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.00042367313,0.00054887333,0.010934237,0.00041135852,0.00018044957,0.0009016768,0.002315915,0.051510185,0.114054844,0.16771816,0.013956499,0.63704413],"study_design_scores_gemma":[0.000044904264,0.0002996741,0.004979319,0.00012767756,0.00020710262,0.0009865457,0.00065957394,0.772139,0.07343114,0.06465326,0.082292296,0.00017946381],"about_ca_topic_score_codex":0.0033583161,"about_ca_topic_score_gemma":0.0035252373,"teacher_disagreement_score":0.0033583161,"about_ca_system_score_codex":0.0008529799,"about_ca_system_score_gemma":0.001669402,"threshold_uncertainty_score":0.009950876},"labels":[],"label_agreement":null},{"id":"W1581844963","doi":"10.1109/cloud.2015.19","title":"Server Provisioning in Content Delivery Clouds","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Peering; Provisioning; Computer science; Cache; Content delivery; Content delivery network; Computer network; Cloud computing; Bandwidth (computing); Server farm; Operating system; Server; The Internet; Client–server model","score_opus":0.08934867867553703,"score_gpt":0.24531022175889844,"score_spread":0.1559615430833614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581844963","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.87438625,0.001071915,0.11501598,0.0007923798,0.0000697523,0.000166773,0.0003585694,0.0005063233,0.0076321266],"genre_scores_gemma":[0.99088085,0.0001805305,0.008051905,0.00004586111,0.000015734237,0.00002215555,0.0000676868,0.00005893195,0.00067636307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984231,0.0004796865,0.00005234473,0.00025383948,0.00030589785,0.0004851239],"domain_scores_gemma":[0.9972488,0.0015263645,0.00031091485,0.00025131868,0.00040872238,0.0002538477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019166725,0.00081523624,0.0011451315,0.0005738176,0.0015132639,0.0022507785,0.0014387642,0.001330766,0.0013213778],"category_scores_gemma":[0.0068209404,0.00060679676,0.00030983146,0.0014334065,0.0013892811,0.0020136654,0.0010568827,0.0008681299,0.0002186234],"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.0001686568,0.00010927314,0.0038309295,0.00007742399,0.000033794568,0.00018967333,0.00011641921,0.9653868,0.0044811773,0.015839642,0.0013380403,0.008428117],"study_design_scores_gemma":[0.000013361708,0.00003429681,0.00083222,0.0000062085583,0.000018293045,0.000030202817,0.00011574148,0.9929443,0.0019263645,0.0036171887,0.00045317796,0.000008599605],"about_ca_topic_score_codex":0.027760768,"about_ca_topic_score_gemma":0.015469311,"teacher_disagreement_score":0.027760768,"about_ca_system_score_codex":0.0040842798,"about_ca_system_score_gemma":0.0026728876,"threshold_uncertainty_score":0.05519837},"labels":[],"label_agreement":null},{"id":"W1582930193","doi":"10.1002/dac.2902","title":"Energy efficiency and traffic offloading in wireless mesh networks with delay bounds","year":2014,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Computer science; Quality of service; Efficient energy use; Wireless mesh network; Computer network; Wireless; Wireless network; Integer programming; Bounded function; Bandwidth (computing); Mathematical optimization; Telecommunications; Algorithm","score_opus":0.01017368377834638,"score_gpt":0.2284265357600941,"score_spread":0.21825285198174774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582930193","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.39219648,0.0033520798,0.586936,0.0016537802,0.00012494315,0.000056901776,0.00013031083,0.00010925781,0.015440224],"genre_scores_gemma":[0.9909911,0.0005573519,0.006329384,0.000036882528,0.000044300712,0.000020409962,0.000019419605,0.000020491289,0.0019806959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954176,0.00021165138,0.0000144122905,0.000044995933,0.000082193226,0.00010496405],"domain_scores_gemma":[0.9972307,0.002307946,0.00019587582,0.00006681809,0.00014216565,0.00005645384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012471641,0.0005023887,0.0005538487,0.0005973433,0.00039585205,0.0010843968,0.0006558807,0.0006827107,0.0010370481],"category_scores_gemma":[0.00465055,0.0002462319,0.00039189061,0.0006767455,0.00068884564,0.0013953083,0.0006566563,0.00059451506,0.000078517216],"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.000079169826,0.00003341033,0.00090495223,0.000056204848,0.000024823785,0.00010629585,0.000039340342,0.9471875,0.00288692,0.04191704,0.00038548192,0.0063788462],"study_design_scores_gemma":[0.0000029990251,0.000016324018,0.00017231055,0.0000045440056,0.0000066551197,0.000018274242,0.000014886296,0.9915359,0.00030811416,0.007746946,0.00017041598,0.0000025413296],"about_ca_topic_score_codex":0.0023433997,"about_ca_topic_score_gemma":0.001707304,"teacher_disagreement_score":0.0023433997,"about_ca_system_score_codex":0.0015422726,"about_ca_system_score_gemma":0.0004911674,"threshold_uncertainty_score":0.011189997},"labels":[],"label_agreement":null},{"id":"W1584094645","doi":"10.1007/11424918_11","title":"SWAMI: Searching the Web Using Agents with Mobility and Intelligence","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Swami; Computer science; World Wide Web; Artificial intelligence; Philosophy; Theology","score_opus":0.03859558952410785,"score_gpt":0.26702390421465516,"score_spread":0.2284283146905473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584094645","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.031295627,0.0025542278,0.9003136,0.0012146474,0.0004206794,0.00019600321,0.0004781205,0.020384988,0.04314214],"genre_scores_gemma":[0.21732225,0.0029263168,0.71223575,0.00045329455,0.00016151943,0.0003621052,0.0017100527,0.0017985053,0.0630302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980897,0.000043116543,0.00001564753,0.0000316963,0.000078630204,0.000021972393],"domain_scores_gemma":[0.9995858,0.00018650084,0.000024084775,0.000095952804,0.000046294812,0.00006131382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035706203,0.00082211214,0.0006757743,0.000693735,0.0007273296,0.0021225954,0.0018124656,0.0012227423,0.0070868395],"category_scores_gemma":[0.0016878325,0.0005072844,0.00041746956,0.0008989049,0.0006877391,0.0032255978,0.0019073281,0.0014595594,0.0029836062],"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.00058352854,0.0003483787,0.0019505484,0.0007062619,0.00016959736,0.0006240679,0.0014831765,0.035864636,0.027779974,0.19263275,0.0983313,0.6395258],"study_design_scores_gemma":[0.00015475276,0.00017115103,0.00096306985,0.0001578259,0.00015705866,0.0008592487,0.0005165426,0.50314575,0.028552648,0.18231969,0.28290924,0.00009309119],"about_ca_topic_score_codex":0.0024256539,"about_ca_topic_score_gemma":0.0029792406,"teacher_disagreement_score":0.0070868395,"about_ca_system_score_codex":0.00026471342,"about_ca_system_score_gemma":0.000504878,"threshold_uncertainty_score":0.023707867},"labels":[],"label_agreement":null},{"id":"W1584521535","doi":"10.1109/infcomw.2015.7179413","title":"Caching-as-a-Service: Virtual caching framework in the cloud-based mobile networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":41,"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 British Columbia","funders":"","keywords":"Computer science; Cloud computing; Computer network; Service (business); Operating system; Business","score_opus":0.024339302197220698,"score_gpt":0.2612145473709585,"score_spread":0.23687524517373781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584521535","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.044571996,0.004786423,0.94128966,0.00077601086,0.00020231602,0.00010383019,0.00007859564,0.00082646275,0.0073647564],"genre_scores_gemma":[0.8800408,0.0015882701,0.116381906,0.00014428172,0.00008330373,0.00007502896,0.000054391017,0.000044794622,0.0015872905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994198,0.00025295213,0.000026248448,0.0000662887,0.00013740068,0.000097382246],"domain_scores_gemma":[0.9997012,0.000073981515,0.000028985918,0.000045391902,0.000104981,0.000045475612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083135907,0.00042763713,0.0006467242,0.00047250997,0.0007421913,0.0016874068,0.0014410623,0.0008329779,0.00055110257],"category_scores_gemma":[0.0009620686,0.00016752954,0.00045012735,0.000836466,0.0009109896,0.0014315867,0.0006480659,0.0006809732,0.00013979635],"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.00016356003,0.00010553011,0.0017535654,0.00014681142,0.00008273813,0.00046314683,0.00020257848,0.5667696,0.011752236,0.35888374,0.0053157937,0.054360654],"study_design_scores_gemma":[0.000007812181,0.00002829645,0.00011445318,0.000010156554,0.000014812097,0.00007536011,0.000033603344,0.98573977,0.0007282702,0.010455356,0.002779098,0.000013008555],"about_ca_topic_score_codex":0.020877367,"about_ca_topic_score_gemma":0.013560435,"teacher_disagreement_score":0.020877367,"about_ca_system_score_codex":0.0019091134,"about_ca_system_score_gemma":0.0022049933,"threshold_uncertainty_score":0.041511655},"labels":[],"label_agreement":null},{"id":"W1584556476","doi":"","title":"Proceedings of the 2013 ACM MobiCom workshop on Lowest cost denominator networking for universal access","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"The Internet; Internet access; Computer science; Scalability; Universal design; Digital divide; Telecommunications; Internet privacy; Computer security; World Wide Web","score_opus":0.03594732968845599,"score_gpt":0.25606692159909494,"score_spread":0.22011959191063896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584556476","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016907398,0.0669302,0.38694224,0.09454465,0.08640633,0.001962543,0.001932088,0.005951182,0.33842334],"genre_scores_gemma":[0.122468285,0.06253877,0.21362853,0.014724643,0.03305188,0.0020496885,0.0064551355,0.0035257745,0.5415572],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99649495,0.0009561593,0.00017705986,0.00041331592,0.0014556557,0.0005027395],"domain_scores_gemma":[0.9967775,0.00069181906,0.00012354138,0.00045226337,0.0010980682,0.00085685716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052411184,0.0017412382,0.0012559587,0.0011984737,0.002709433,0.005963095,0.0032408673,0.0026818386,0.044416253],"category_scores_gemma":[0.007012247,0.0007094729,0.00077200576,0.0011696122,0.0015854179,0.009846671,0.005033684,0.0053286385,0.019252956],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0003716347,0.00018012329,0.0005100739,0.00036362174,0.00005104111,0.00028764876,0.00046221763,0.001873856,0.0035895077,0.029052198,0.7697555,0.1935026],"study_design_scores_gemma":[0.000033978184,0.00008410949,0.00044747858,0.00028716202,0.000022562133,0.00020914566,0.00041480665,0.008248664,0.0009685943,0.011272271,0.9779781,0.0000331801],"about_ca_topic_score_codex":0.008001291,"about_ca_topic_score_gemma":0.014547489,"teacher_disagreement_score":0.044416253,"about_ca_system_score_codex":0.0021415672,"about_ca_system_score_gemma":0.0034886734,"threshold_uncertainty_score":0.14858717},"labels":[],"label_agreement":null},{"id":"W1594176915","doi":"10.1109/cloud.2015.147","title":"EdgeX: Edge Replication for Web Applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Latency (audio); Data center; Enhanced Data Rates for GSM Evolution; Computer network; Java; Replication (statistics); Distributed computing; Dynamic web page; Web application; Operating system; World Wide Web; Web service; Telecommunications","score_opus":0.06422361188495253,"score_gpt":0.2876128829361424,"score_spread":0.22338927105118989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594176915","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.062771305,0.0016609436,0.82743305,0.00065982953,0.000534333,0.0008315428,0.0009990279,0.08115465,0.023955412],"genre_scores_gemma":[0.5047114,0.0012199562,0.44180194,0.00061162654,0.00033925858,0.00056530186,0.0035199933,0.0044003786,0.042830117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989054,0.0002081677,0.00009359036,0.00017436374,0.00046651566,0.0001519404],"domain_scores_gemma":[0.997934,0.00024994602,0.0001098871,0.0010921297,0.00044666577,0.00016737892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013372093,0.0007431439,0.00057970674,0.0006878938,0.0009646046,0.0019407517,0.0026272994,0.0010212273,0.005883227],"category_scores_gemma":[0.0034966036,0.0005292738,0.00041309395,0.0006532839,0.00041336575,0.0031615878,0.0025245983,0.0011748032,0.0029119833],"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.0021702566,0.000570511,0.0060324813,0.0007008867,0.00016269597,0.0012798532,0.00091960107,0.023928542,0.11209794,0.06799311,0.110702194,0.673442],"study_design_scores_gemma":[0.0005356875,0.0010735196,0.004438698,0.00018764871,0.00014283063,0.0021543915,0.00043438363,0.5509807,0.14384459,0.035703745,0.26022553,0.00027829147],"about_ca_topic_score_codex":0.0021113337,"about_ca_topic_score_gemma":0.0020870543,"teacher_disagreement_score":0.005883227,"about_ca_system_score_codex":0.0005572976,"about_ca_system_score_gemma":0.0008109701,"threshold_uncertainty_score":0.019681334},"labels":[],"label_agreement":null},{"id":"W1594302605","doi":"10.1023/a:1022641304493","title":"On Staleness and the Delivery of Web Pages","year":2003,"lang":"en","type":"article","venue":"Information Systems Frontiers","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Server; Cache; Resource (disambiguation); Proxy server; Web server; Distributed computing; Database; Computer network; World Wide Web; The Internet","score_opus":0.007024329944995074,"score_gpt":0.1726429546754627,"score_spread":0.16561862473046762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594302605","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.5914999,0.0385396,0.27881598,0.027218685,0.0006213084,0.00010298708,0.00087177113,0.0005941859,0.06173565],"genre_scores_gemma":[0.965771,0.008495692,0.012069408,0.0006082362,0.0004320049,0.000035456964,0.00018337337,0.00016509136,0.012239713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784994,0.0009896761,0.00013056333,0.00023855222,0.00042892454,0.00036227354],"domain_scores_gemma":[0.9415089,0.0454485,0.004120746,0.0033415197,0.0044038035,0.0011764308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005057663,0.00062673964,0.0015097441,0.0026823427,0.0016100599,0.005936731,0.0023750272,0.0027552485,0.0074459724],"category_scores_gemma":[0.046643555,0.000812808,0.0006233966,0.004195796,0.0040714233,0.013991327,0.0019003747,0.0031382486,0.0011163189],"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.00041183032,0.00015725514,0.0054609543,0.00018575255,0.000049736016,0.00027129563,0.0016443164,0.026814232,0.0021509721,0.91646385,0.007377028,0.039012887],"study_design_scores_gemma":[0.000058917587,0.00013136823,0.0031734165,0.000109751476,0.00011011602,0.00032360575,0.0009515018,0.14776362,0.0018815745,0.83427364,0.011153751,0.000068670764],"about_ca_topic_score_codex":0.015113797,"about_ca_topic_score_gemma":0.009512952,"teacher_disagreement_score":0.015113797,"about_ca_system_score_codex":0.005307783,"about_ca_system_score_gemma":0.001682289,"threshold_uncertainty_score":0.0385108},"labels":[],"label_agreement":null},{"id":"W1596095404","doi":"10.1007/978-3-540-72990-7_6","title":"Video-on-Demand Server Selection and Placement","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replica; Computer science; Heuristics; Software deployment; Server; Video on demand; Computer network; Distributed computing; Data striping; Bandwidth (computing); Operating system","score_opus":0.020882600255908247,"score_gpt":0.2420162405165629,"score_spread":0.22113364026065466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596095404","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.072047725,0.0011527541,0.8888587,0.0005436658,0.000501125,0.000610162,0.0008801202,0.007258517,0.028147263],"genre_scores_gemma":[0.7448564,0.000760069,0.22630267,0.00015953326,0.0004983169,0.00015400712,0.0012896679,0.0005014867,0.025477812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.000118739474,0.000029081826,0.000104667975,0.0002906859,0.00014954353],"domain_scores_gemma":[0.99894303,0.0003259596,0.000048231097,0.0002497368,0.00030844286,0.00012463858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056367693,0.0011412237,0.0017034627,0.0010518378,0.00092839944,0.0018015904,0.0024206731,0.00089162355,0.009954162],"category_scores_gemma":[0.0023367829,0.000530504,0.0003682988,0.0020423343,0.00028355498,0.0009839962,0.0009199126,0.00068469805,0.0031212824],"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.0015851556,0.00063992804,0.0025177156,0.00024973377,0.00007733233,0.00047065856,0.00012502828,0.18572366,0.06685943,0.012058947,0.045129437,0.68456304],"study_design_scores_gemma":[0.000058052174,0.00010716828,0.001032522,0.000007855623,0.00001929996,0.00029760395,0.00006958115,0.9710089,0.017906895,0.005553368,0.003913257,0.000025436886],"about_ca_topic_score_codex":0.0040136334,"about_ca_topic_score_gemma":0.009685737,"teacher_disagreement_score":0.009954162,"about_ca_system_score_codex":0.0011111314,"about_ca_system_score_gemma":0.0011950994,"threshold_uncertainty_score":0.033299983},"labels":[],"label_agreement":null},{"id":"W1618000773","doi":"10.15353/joci.v2i3.2068","title":"Should communal computing facilities cohabit with public facilities?","year":2007,"lang":"en","type":"article","venue":"The Journal of Community Informatics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disadvantaged; Business; Computer science; Economic growth; Economics","score_opus":0.07165518449216608,"score_gpt":0.2679350821536609,"score_spread":0.19627989766149484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1618000773","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.8127199,0.00059305097,0.011173715,0.0683678,0.00029624597,0.00016649833,0.0002132001,0.00013642879,0.10633316],"genre_scores_gemma":[0.99574465,0.00011497798,0.0006590227,0.0011122823,0.00005749455,0.000023093855,0.000021855565,0.000019249266,0.0022473307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965879,0.00094302354,0.00007587549,0.0003040611,0.0004490578,0.0016401004],"domain_scores_gemma":[0.9764955,0.0050677983,0.005887361,0.0017709292,0.0033409516,0.007437387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133909,0.00019943815,0.00030092834,0.0006940144,0.0062642097,0.0047892723,0.0013193388,0.0022767347,0.014659163],"category_scores_gemma":[0.024569577,0.00029169166,0.00025641144,0.0013336577,0.004349961,0.008038552,0.0038140519,0.002541892,0.0010940586],"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.00034043248,0.0005878885,0.3380751,0.00030493218,0.00009888806,0.0013651472,0.04467701,0.0011684102,0.002518844,0.4011823,0.03985944,0.16982158],"study_design_scores_gemma":[0.00016934442,0.00046945157,0.4371097,0.0008518654,0.000115133844,0.0014578862,0.25452295,0.0073329783,0.002282477,0.10797466,0.1874405,0.0002731667],"about_ca_topic_score_codex":0.03611931,"about_ca_topic_score_gemma":0.06420627,"teacher_disagreement_score":0.03611931,"about_ca_system_score_codex":0.0046264078,"about_ca_system_score_gemma":0.0063794493,"threshold_uncertainty_score":0.07181817},"labels":[],"label_agreement":null},{"id":"W1634932822","doi":"10.1609/socs.v2i1.18200","title":"Degrees of Separation in Social Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":66,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Degree (music); Six degrees of separation; The Internet; Greedy algorithm; Social network (sociolinguistics); Theoretical computer science; Social media; World Wide Web; Algorithm; Engineering","score_opus":0.019990277544513574,"score_gpt":0.2756694242229075,"score_spread":0.255679146678394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634932822","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.45836943,0.0017178081,0.52518034,0.0020710172,0.000054992295,0.00020044435,0.0006399503,0.00046650998,0.011299625],"genre_scores_gemma":[0.9004723,0.0008138778,0.095696494,0.00013210809,0.000058795005,0.00013969735,0.00032007092,0.000069112735,0.002297528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971424,0.0013257511,0.00014076664,0.00049892976,0.0005725918,0.00031953404],"domain_scores_gemma":[0.98688865,0.009900423,0.0014313061,0.00071570656,0.0004295319,0.0006344402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020192838,0.00077403145,0.0009838664,0.002381751,0.0017562238,0.0028849507,0.0010097682,0.0014940504,0.0021574404],"category_scores_gemma":[0.016979387,0.0008751545,0.0007580128,0.0025044468,0.0024308446,0.0052902643,0.0029480557,0.0015122304,0.00041439908],"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.0005892642,0.00016955797,0.0129374135,0.00037467328,0.00015305406,0.00038465002,0.0019459253,0.52865434,0.005217222,0.34477332,0.0045161913,0.10028432],"study_design_scores_gemma":[0.000057957943,0.00007861087,0.0025592337,0.00005650488,0.000042783176,0.00039146582,0.00065759156,0.508946,0.00209251,0.47970378,0.0053635575,0.00005004508],"about_ca_topic_score_codex":0.0020780268,"about_ca_topic_score_gemma":0.0020704288,"teacher_disagreement_score":0.0028849507,"about_ca_system_score_codex":0.0017918182,"about_ca_system_score_gemma":0.0008951775,"threshold_uncertainty_score":0.0130006075},"labels":[],"label_agreement":null},{"id":"W1679867247","doi":"10.48550/arxiv.0707.3670","title":"Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":240,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"The Internet; Internet privacy; Computer science; World Wide Web; Business","score_opus":0.23236823740009313,"score_gpt":0.3199226989382135,"score_spread":0.08755446153812038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1679867247","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.9957859,0.00020908614,0.0014527503,0.000314436,0.00000495281,0.00005257159,0.00068470254,0.000019392053,0.0014762345],"genre_scores_gemma":[0.995369,0.00032771312,0.0023006934,0.000036635945,0.000017477421,0.000055661276,0.0012326615,0.000015342468,0.00064477115],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99928135,0.00025767612,0.000058539124,0.00010136902,0.00017393817,0.00012724774],"domain_scores_gemma":[0.9960068,0.001976878,0.0006446298,0.00030491204,0.00074147776,0.0003253215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075759174,0.00029298515,0.00034926343,0.002535051,0.0012129401,0.0009305018,0.00065504643,0.0012005246,0.00041023057],"category_scores_gemma":[0.0050321873,0.0001437063,0.00021392672,0.004174425,0.000640043,0.0022370343,0.0007590649,0.00058837066,0.0001430779],"study_design_candidate":"observational","study_design_consensus":"observational","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.0005457472,0.0014121076,0.79143775,0.00057719904,0.00016615343,0.012496951,0.029086767,0.023813047,0.014691906,0.014113725,0.0123039605,0.099354774],"study_design_scores_gemma":[0.000039767594,0.000566608,0.760526,0.00018605974,0.00008219348,0.0063018943,0.055799827,0.14183678,0.007884203,0.007074968,0.01956669,0.00013490552],"about_ca_topic_score_codex":0.058094785,"about_ca_topic_score_gemma":0.071721405,"teacher_disagreement_score":0.058094785,"about_ca_system_score_codex":0.0014327051,"about_ca_system_score_gemma":0.0006093369,"threshold_uncertainty_score":0.115513325},"labels":[],"label_agreement":null},{"id":"W1782285140","doi":"10.1007/978-1-4939-0691-8","title":"Enabling Content Distribution in Vehicular Ad Hoc Networks","year":2014,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Content distribution; Distribution (mathematics); Computer science; Content (measure theory); Computer network; Mathematics","score_opus":0.02072776858616168,"score_gpt":0.21552814738488613,"score_spread":0.19480037879872444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782285140","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.036686525,0.043937784,0.8172527,0.0013174877,0.0022058664,0.0001391561,0.00021179367,0.0037665067,0.094482206],"genre_scores_gemma":[0.76606786,0.042250164,0.09999342,0.0003124741,0.0011791126,0.00009436246,0.0006090347,0.00048604637,0.08900734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972755,0.00004753954,0.0000102587765,0.000024662248,0.00013656939,0.000053399344],"domain_scores_gemma":[0.9996804,0.00014278942,0.000012413222,0.000050931834,0.000095751624,0.000017841929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002943666,0.0005938723,0.00057803805,0.00072515465,0.00036475086,0.0012722658,0.00092868565,0.0006273327,0.0028383431],"category_scores_gemma":[0.0008231025,0.00030851978,0.00019293686,0.0015352973,0.00044655707,0.001690425,0.0009245749,0.00063227006,0.0015216433],"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.00015350414,0.00009446263,0.00058109337,0.00076504226,0.00003922668,0.00035342755,0.00017093966,0.08117603,0.02952172,0.13218461,0.03467374,0.72028613],"study_design_scores_gemma":[0.00003850792,0.0001637101,0.0007902066,0.00022635049,0.000082187915,0.0010942803,0.00025141923,0.5586549,0.03224775,0.13648209,0.26990345,0.000065142354],"about_ca_topic_score_codex":0.0013562326,"about_ca_topic_score_gemma":0.001499822,"teacher_disagreement_score":0.0028383431,"about_ca_system_score_codex":0.0006666362,"about_ca_system_score_gemma":0.0004015354,"threshold_uncertainty_score":0.009495199},"labels":[],"label_agreement":null},{"id":"W1799182606","doi":"10.1145/3095786.3095789","title":"On the Delay Scaling Laws of Cache Networks","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science ICT and Future Planning","keywords":"Cache; Computer science; Cache algorithms; The Internet; Computer network; Information-centric networking; Smart Cache; Scaling law; Cache invalidation; Distributed computing; CPU cache; Computer security; Scaling; World Wide Web","score_opus":0.04290150399387017,"score_gpt":0.2545774610532141,"score_spread":0.21167595705934394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799182606","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.18081515,0.023422586,0.62852997,0.012970348,0.0014913623,0.00018010713,0.00080786756,0.0009995927,0.15078305],"genre_scores_gemma":[0.93913615,0.014203723,0.024357703,0.0013661226,0.0019717056,0.00030501685,0.00037526892,0.0003072488,0.017977128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.00020797737,0.000022003343,0.00010378652,0.00016673024,0.0000910878],"domain_scores_gemma":[0.9896074,0.007619088,0.0007574666,0.0005574065,0.001155069,0.00030359213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020339824,0.00078469625,0.0008631574,0.0017020815,0.0008885285,0.0021577494,0.0013073998,0.0016010901,0.0055835885],"category_scores_gemma":[0.02308242,0.00049601065,0.0005487948,0.0013420287,0.002297633,0.004767071,0.0010688504,0.0028116982,0.0009811196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000050546663,0.000048878755,0.0012951385,0.00015976644,0.000022095432,0.00015002112,0.00026340177,0.0734673,0.0015220571,0.9043858,0.0073068705,0.011328153],"study_design_scores_gemma":[0.000027078013,0.00003924198,0.0009158138,0.00009223437,0.000019051706,0.00017038219,0.0001009251,0.40773374,0.00039708626,0.5825477,0.007923701,0.00003308454],"about_ca_topic_score_codex":0.00318876,"about_ca_topic_score_gemma":0.0010583658,"teacher_disagreement_score":0.0055835885,"about_ca_system_score_codex":0.0019919674,"about_ca_system_score_gemma":0.00074654707,"threshold_uncertainty_score":0.018678963},"labels":[],"label_agreement":null},{"id":"W1828336234","doi":"10.1007/3-540-45812-3_22","title":"A Management Framework for Service Personalization","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Service provider; Personalization; Service (business); Content management; Computer network; Differentiated service; Service delivery framework; World Wide Web; Server; Database; Service design","score_opus":0.024168197644172353,"score_gpt":0.23974750485183527,"score_spread":0.2155793072076629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1828336234","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.003637087,0.00039146436,0.9731189,0.0007275361,0.00017610673,0.00020155431,0.00019966833,0.0089560095,0.012591748],"genre_scores_gemma":[0.16578601,0.0009394859,0.80095583,0.0005168674,0.00033809047,0.00050741,0.0009717478,0.001459341,0.02852527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980861,0.00038134938,0.00020229183,0.00031335757,0.0007176863,0.00029928458],"domain_scores_gemma":[0.9981932,0.00041526515,0.00010218138,0.00075347174,0.00032858088,0.00020725273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003748653,0.0009053266,0.0010108631,0.0017732024,0.0021320323,0.006262847,0.0032588432,0.0021513095,0.008573796],"category_scores_gemma":[0.0036883135,0.0011115161,0.0011837132,0.002003584,0.0017114825,0.008224246,0.0034145878,0.0036429083,0.0027883973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00013746142,0.00022080171,0.0005904916,0.00014715004,0.000044597622,0.0002291191,0.00061156513,0.017096326,0.0041319504,0.7784911,0.029754683,0.1685448],"study_design_scores_gemma":[0.000069445974,0.00007438723,0.0003039461,0.000117737596,0.000109027256,0.00043332763,0.00023994694,0.3873229,0.008071243,0.40909415,0.1940675,0.00009644681],"about_ca_topic_score_codex":0.00741745,"about_ca_topic_score_gemma":0.006940107,"teacher_disagreement_score":0.008573796,"about_ca_system_score_codex":0.001991141,"about_ca_system_score_gemma":0.0022516255,"threshold_uncertainty_score":0.028682232},"labels":[],"label_agreement":null},{"id":"W184084465","doi":"10.1007/978-3-642-38631-2_12","title":"Next-Generation DoS at the Higher Layers: A Study of SMTP Flooding","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Timeout; Denial-of-service attack; Computer science; Server; Computer network; Application layer DDoS attack; Callback; Flooding (psychology); Computer security; Operating system; The Internet","score_opus":0.057602195282266185,"score_gpt":0.24725444377049022,"score_spread":0.18965224848822404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184084465","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.51455903,0.020062832,0.3345909,0.0070246034,0.0006078163,0.00028154685,0.00028835595,0.0006016173,0.12198333],"genre_scores_gemma":[0.9773037,0.004411856,0.010031591,0.00024277654,0.0004176922,0.00004045361,0.00005730223,0.00012326217,0.007371406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992556,0.00026155275,0.000026457994,0.00008357376,0.00021114491,0.00016166655],"domain_scores_gemma":[0.9959915,0.0024619694,0.00039987836,0.0003807444,0.0005853735,0.00018055413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534245,0.00059728813,0.0009809518,0.0012115366,0.0011351272,0.0024734337,0.0015925597,0.0015607739,0.001936972],"category_scores_gemma":[0.0067549837,0.0004421738,0.0005564913,0.0015353017,0.0018707792,0.0047117546,0.0012732181,0.0017037871,0.00026693993],"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.00018198688,0.00022831187,0.005158695,0.00028319782,0.00007391194,0.0009677411,0.0015290168,0.1746483,0.006503467,0.7694979,0.008741775,0.032185677],"study_design_scores_gemma":[0.000024485966,0.00007875559,0.0020776126,0.00007576871,0.000054479715,0.00063437456,0.000731123,0.8179952,0.0017564555,0.1698485,0.00668419,0.00003901139],"about_ca_topic_score_codex":0.004552015,"about_ca_topic_score_gemma":0.0025281503,"teacher_disagreement_score":0.004552015,"about_ca_system_score_codex":0.0025696626,"about_ca_system_score_gemma":0.0009593538,"threshold_uncertainty_score":0.018644273},"labels":[],"label_agreement":null},{"id":"W1888792907","doi":"10.1007/3-540-45490-x_62","title":"Mining Web Logs to Improve Web Caching and Prefetching","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Security token; Cache; False sharing; The Internet; Proxy (statistics); Cache algorithms; Web page; Data mining; Database; CPU cache; World Wide Web; Computer network; Machine learning","score_opus":0.015952382100617227,"score_gpt":0.23029988881275926,"score_spread":0.21434750671214203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888792907","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.5910356,0.0035741304,0.35737345,0.00079946546,0.0003546076,0.00038667663,0.00713793,0.036037896,0.0033003073],"genre_scores_gemma":[0.82389086,0.0008293973,0.16348648,0.00014568763,0.0002234076,0.00018654428,0.007959021,0.0004755895,0.002802957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993654,0.00009895663,0.00006570262,0.00014515738,0.00025134583,0.00007333879],"domain_scores_gemma":[0.99634117,0.0016490903,0.00035048233,0.0005980726,0.0009117005,0.00014942363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068450137,0.0012140261,0.0014197938,0.0037768679,0.00054785353,0.0012195795,0.0011237175,0.00084368483,0.0012541871],"category_scores_gemma":[0.006188982,0.0006127882,0.0006750643,0.004264673,0.0002570508,0.0017489161,0.00039803906,0.0009020581,0.0010786441],"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.0011288559,0.0017894485,0.09059996,0.0004861028,0.00030522232,0.00028956766,0.00014164406,0.100866646,0.038667962,0.0012799031,0.022519428,0.74192524],"study_design_scores_gemma":[0.00003798319,0.00010531363,0.0065243784,0.000014247405,0.000080242724,0.00010625001,0.000051932908,0.97604895,0.013392908,0.0023601344,0.0012589879,0.000018710009],"about_ca_topic_score_codex":0.009957955,"about_ca_topic_score_gemma":0.022450747,"teacher_disagreement_score":0.009957955,"about_ca_system_score_codex":0.0005843106,"about_ca_system_score_gemma":0.0012436381,"threshold_uncertainty_score":0.019800007},"labels":[],"label_agreement":null},{"id":"W1904820966","doi":"10.1109/ares.2015.101","title":"A Performance Evaluation of Hash Functions for IP Reputation Lookup Using Bloom Filters","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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 New Brunswick","funders":"","keywords":"Bloom filter; Computer science; Hash function; Scalability; Reputation; Cryptography; Computer network; Set (abstract data type); Computer security; Database","score_opus":0.19904195307287045,"score_gpt":0.3194310982633604,"score_spread":0.12038914519048996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1904820966","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.8892365,0.003585778,0.08965651,0.00035543038,0.0002636975,0.0004362335,0.001229146,0.009085291,0.006151383],"genre_scores_gemma":[0.95017266,0.0004487319,0.046611115,0.00005060101,0.000032029275,0.00009907679,0.0009886475,0.0000941601,0.001502942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942978,0.0016145055,0.000621932,0.000743262,0.0020428337,0.0006796236],"domain_scores_gemma":[0.97730756,0.014601602,0.0012999994,0.002234662,0.003945724,0.0006104689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058468254,0.0011969346,0.0013880361,0.0025936968,0.0010069694,0.0019828905,0.00194573,0.0018133197,0.0022461463],"category_scores_gemma":[0.022088591,0.00034564792,0.0005220516,0.002064019,0.0006436409,0.0035370588,0.0008937619,0.00059768587,0.0010686707],"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.019391444,0.002145777,0.055097554,0.0018475469,0.00082702626,0.0007533083,0.0007649603,0.24223045,0.07837841,0.0094984975,0.010416897,0.57864815],"study_design_scores_gemma":[0.00024902658,0.0022304528,0.007999239,0.000055402732,0.00013105504,0.0005538023,0.00022873656,0.9284356,0.056561984,0.0013316108,0.002142727,0.00008032885],"about_ca_topic_score_codex":0.005802328,"about_ca_topic_score_gemma":0.002604301,"teacher_disagreement_score":0.0058468254,"about_ca_system_score_codex":0.0024382065,"about_ca_system_score_gemma":0.0016971632,"threshold_uncertainty_score":0.03092134},"labels":[],"label_agreement":null},{"id":"W1912570954","doi":"10.1109/iccac.2015.29","title":"End-to-End QoS Prediction Model of Vertically Composed Cloud Services via Tensor Factorization","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Cloud computing; Quality of service; Computer science; Software as a service; Mobile QoS; The Internet; End user; Software; Service provider; Service (business); Web service; Throughput; Services computing; Computer network; World Wide Web; Software development; Operating system","score_opus":0.02980051705070195,"score_gpt":0.22572136521594194,"score_spread":0.19592084816524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912570954","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.13833183,0.0003617974,0.8580738,0.0006777678,0.00006143228,0.000062675594,0.00030696343,0.00060483173,0.0015188729],"genre_scores_gemma":[0.9393492,0.00031800687,0.05754367,0.00008595275,0.000036294477,0.000092565926,0.00044236268,0.000033359185,0.0020986444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.0000989992,0.000029234483,0.0001313286,0.000088656874,0.00010065579],"domain_scores_gemma":[0.9990808,0.00040805287,0.0001548738,0.000048131922,0.00024393898,0.000064280364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979194,0.0010238859,0.0006751617,0.0006186618,0.0004886767,0.0007727057,0.0010368278,0.00085079833,0.0009769519],"category_scores_gemma":[0.002055926,0.0004596195,0.00071369123,0.0006767981,0.00048257664,0.0010494031,0.00046867284,0.0012858227,0.0002524694],"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.00008019912,0.000039793365,0.0019422974,0.000021521435,0.000029389454,0.000060667284,0.00003807175,0.9816959,0.001327334,0.0018232828,0.00040979305,0.012531867],"study_design_scores_gemma":[6.0179656e-7,0.0000024318547,0.00004800604,4.4100318e-7,0.0000012246129,0.0000016825248,0.000001061554,0.99970895,0.000047359234,0.00017610595,0.000010986895,0.0000010603874],"about_ca_topic_score_codex":0.049737725,"about_ca_topic_score_gemma":0.024657117,"teacher_disagreement_score":0.049737725,"about_ca_system_score_codex":0.0015804379,"about_ca_system_score_gemma":0.0015439447,"threshold_uncertainty_score":0.098896444},"labels":[],"label_agreement":null},{"id":"W1944949238","doi":"10.1002/wcm.2636","title":"A QoE centric distributed caching approach for vehicular video streaming in cellular networks","year":2015,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Quality of experience; Computer network; Base station; Consistency (knowledge bases); Transmission (telecommunications); Cellular network; Wireless; Wireless network; Distributed computing; Quality of service; Telecommunications","score_opus":0.02825086460530017,"score_gpt":0.25004911406668456,"score_spread":0.22179824946138438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944949238","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.07510281,0.0005792743,0.92172045,0.00026819255,0.00003546452,0.00006061079,0.000024471788,0.00013436195,0.0020743674],"genre_scores_gemma":[0.97306526,0.00021497338,0.025933316,0.000031183296,0.000021373426,0.000027300683,0.000016180706,0.0000102933245,0.00068011245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.00014137017,0.000017611068,0.000058117937,0.00009277615,0.00007105848],"domain_scores_gemma":[0.99947494,0.00020421392,0.000054396132,0.00004792341,0.00017792976,0.000040636012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006301816,0.00049158616,0.0006541973,0.00041697064,0.00042784083,0.00077969773,0.0010024622,0.0005658538,0.00039867155],"category_scores_gemma":[0.0011714464,0.00021401423,0.00039359863,0.0005253682,0.0004901497,0.0005818409,0.00051799306,0.00037119203,0.00007084307],"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.000081368475,0.000058590584,0.0010183111,0.0000715659,0.000039722978,0.00019539174,0.000086892636,0.94038695,0.01049399,0.016580367,0.0007910604,0.0301957],"study_design_scores_gemma":[0.0000031096822,0.000016850012,0.00007885524,0.0000014725285,0.0000062790955,0.000016988486,0.000014095371,0.99802244,0.00042302205,0.0012675718,0.00014574872,0.0000035524151],"about_ca_topic_score_codex":0.012705828,"about_ca_topic_score_gemma":0.011415702,"teacher_disagreement_score":0.012705828,"about_ca_system_score_codex":0.0014613444,"about_ca_system_score_gemma":0.0011075062,"threshold_uncertainty_score":0.025263727},"labels":[],"label_agreement":null},{"id":"W1967150384","doi":"10.1109/icc.2014.6883898","title":"Decentralized caching strategies for energy-efficient content delivery","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Computer science; Content delivery; Computer network; Scheme (mathematics); The Internet; Distributed computing; Network topology; Efficient energy use; Popularity; Content (measure theory); World Wide Web","score_opus":0.03277261780479911,"score_gpt":0.22575911533484438,"score_spread":0.19298649753004526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967150384","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.044536125,0.0002510932,0.9509716,0.00022333395,0.000026975582,0.00005988448,0.00002979993,0.0001432913,0.0037579327],"genre_scores_gemma":[0.90618724,0.0002924474,0.090567134,0.00006365736,0.000038779748,0.00016165225,0.000050084316,0.000037673468,0.0026012834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995906,0.00014267546,0.000016621923,0.00007828908,0.00012854104,0.000043278487],"domain_scores_gemma":[0.9991591,0.00039954882,0.00014436516,0.00008622032,0.00018023407,0.00003060467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065031333,0.00043155544,0.0006230569,0.00033772786,0.00036647022,0.00054325344,0.00083385064,0.0006797823,0.0008579664],"category_scores_gemma":[0.00237133,0.00023244026,0.0003357047,0.00043394454,0.0005015274,0.00090537575,0.0005635738,0.00041449687,0.00018138938],"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.000051550192,0.00006270168,0.00033070106,0.00007121162,0.00003309577,0.00007135567,0.00006339923,0.9324509,0.009937029,0.03097579,0.00081689196,0.02513534],"study_design_scores_gemma":[0.00001425359,0.00003579735,0.00007087112,0.0000023201471,0.000007819445,0.000017438202,0.000011297745,0.9907476,0.000984785,0.0075541628,0.00054948375,0.0000042414895],"about_ca_topic_score_codex":0.0013293219,"about_ca_topic_score_gemma":0.0016466924,"teacher_disagreement_score":0.0013293219,"about_ca_system_score_codex":0.00068722933,"about_ca_system_score_gemma":0.00065749197,"threshold_uncertainty_score":0.0049862266},"labels":[],"label_agreement":null},{"id":"W1968019759","doi":"10.1109/nwesp.2006.24","title":"Performance of Dynamic Web Page Generation for Database-driven Web Sites","year":2006,"lang":"en","type":"article","venue":"International Conference on Next Generation Web Services Practices","topic":"Caching and Content Delivery","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":"Dalhousie University","funders":"","keywords":"Computer science; Dynamic web page; Cache; Static web page; Database; Web server; Latency (audio); Application server; Web page; Operating system; Web API; World Wide Web; The Internet","score_opus":0.09917158554320826,"score_gpt":0.3156751144739805,"score_spread":0.21650352893077224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968019759","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.9826397,0.00064423133,0.0068135527,0.0001574494,0.000052377258,0.000057652796,0.00038861978,0.005287815,0.0039586024],"genre_scores_gemma":[0.9966254,0.00008125984,0.0019532552,0.000029334335,0.000008352172,0.000013697515,0.00052887504,0.00010744185,0.00065234426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99708885,0.0004453041,0.000204959,0.00044247168,0.001108779,0.000709763],"domain_scores_gemma":[0.99262506,0.003169674,0.00040030412,0.0009957475,0.0018261563,0.0009829709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017877222,0.0007480533,0.00091992004,0.0011080354,0.0007753969,0.0015924771,0.0013096032,0.0009170749,0.0022773913],"category_scores_gemma":[0.007260516,0.00041249464,0.00037385637,0.0015171133,0.00052735227,0.0014558197,0.0007632621,0.0009850139,0.0010447645],"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.01518241,0.0031897505,0.078289345,0.0005687722,0.00035901327,0.0012998409,0.0009941505,0.45467538,0.19416356,0.003954181,0.01699691,0.23032671],"study_design_scores_gemma":[0.00018172272,0.0012926917,0.022056855,0.000015007545,0.00007793021,0.0003218028,0.00019713325,0.914776,0.0591836,0.0007054589,0.0011266941,0.00006498546],"about_ca_topic_score_codex":0.016853793,"about_ca_topic_score_gemma":0.0052621947,"teacher_disagreement_score":0.016853793,"about_ca_system_score_codex":0.0015266598,"about_ca_system_score_gemma":0.001194965,"threshold_uncertainty_score":0.03351134},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"bench_or_experimental","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W1968124129","doi":"10.1145/1878537.1878647","title":"Characterization of user networks in Facebook","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Characterization (materials science); Physics; Optics","score_opus":0.007220249240139468,"score_gpt":0.19437580015158473,"score_spread":0.18715555091144526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968124129","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.98960376,0.00024199631,0.0031543914,0.00014853329,0.000009524182,0.00004638727,0.0010860111,0.000091763446,0.0056175967],"genre_scores_gemma":[0.99759406,0.0000942972,0.0010153622,0.000014205148,0.000011579947,0.000033357257,0.0006603198,0.000009623303,0.0005671816],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990772,0.0003347732,0.00009175322,0.0001479067,0.00018746885,0.00016090422],"domain_scores_gemma":[0.9944746,0.0028413506,0.00083168864,0.00046560654,0.00075844495,0.00062837073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005651189,0.00020558515,0.0002734285,0.003143281,0.00090014044,0.0013221715,0.00037466345,0.00046037632,0.0015552649],"category_scores_gemma":[0.0052448837,0.00015604633,0.00017332486,0.0018660104,0.00045800372,0.0015399915,0.0007347413,0.0003086398,0.00036483587],"study_design_candidate":"observational","study_design_consensus":"observational","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.0006237714,0.00025413587,0.8680795,0.00022847213,0.000103962295,0.00088744226,0.0071756532,0.011865917,0.018610518,0.025065321,0.0049446155,0.062160715],"study_design_scores_gemma":[0.000011983558,0.00016916965,0.7526817,0.00011604306,0.000064323925,0.0033664955,0.0080111455,0.20111914,0.0102917,0.011238456,0.012852393,0.00007751565],"about_ca_topic_score_codex":0.004310507,"about_ca_topic_score_gemma":0.004900097,"teacher_disagreement_score":0.004310507,"about_ca_system_score_codex":0.0006490175,"about_ca_system_score_gemma":0.00027794272,"threshold_uncertainty_score":0.00857085},"labels":[],"label_agreement":null},{"id":"W1968268564","doi":"10.1109/glocom.2014.7037531","title":"Evolving to 5G: A fast and near-optimal request routing protocol for mobile core networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"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 New Brunswick","funders":"","keywords":"Computer science; Computer network; Distributed computing; Routing protocol; Routing (electronic design automation)","score_opus":0.02352692754325201,"score_gpt":0.2836519588465652,"score_spread":0.26012503130331316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968268564","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.024196694,0.002044577,0.96189266,0.0014606995,0.0003115444,0.0004986139,0.0001477673,0.00086834835,0.00857902],"genre_scores_gemma":[0.5193506,0.0025771982,0.4699939,0.00077592535,0.00022851769,0.00078861206,0.0005065972,0.00017386318,0.0056047956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873763,0.0005023804,0.00007157095,0.00009474876,0.00042465268,0.00016898365],"domain_scores_gemma":[0.9989759,0.00038942395,0.00012729039,0.00016104877,0.00029113342,0.00005516331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661419,0.0007883969,0.0006025468,0.0010802808,0.0010430381,0.0012258693,0.0014985957,0.0010759471,0.001215986],"category_scores_gemma":[0.0037132455,0.00025812822,0.0004306468,0.001010932,0.0011791375,0.0016001171,0.0015967549,0.0012981879,0.0004084097],"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.00031327517,0.0001318417,0.0006476833,0.00035289937,0.000069962334,0.00037851193,0.0004971931,0.22615603,0.021691058,0.51338613,0.021883981,0.21449138],"study_design_scores_gemma":[0.000058729933,0.00029107038,0.0002312441,0.000060772756,0.000052033032,0.00046115438,0.00013870923,0.83809495,0.008513705,0.11101525,0.041015644,0.00006673888],"about_ca_topic_score_codex":0.0022069865,"about_ca_topic_score_gemma":0.0038531867,"teacher_disagreement_score":0.0022069865,"about_ca_system_score_codex":0.0014618502,"about_ca_system_score_gemma":0.001968998,"threshold_uncertainty_score":0.010606527},"labels":[],"label_agreement":null},{"id":"W1968709821","doi":"10.1109/tmm.2012.2217735","title":"Coordinate Live Streaming and Storage Sharing for Social Media Content Distribution","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; User-generated content; Social media; World Wide Web; Context (archaeology); The Internet; Overlay; Server; Multimedia; Internet privacy","score_opus":0.0565362318636394,"score_gpt":0.2591172673384834,"score_spread":0.202581035474844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968709821","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.3981886,0.00037579393,0.5888369,0.00020526802,0.00008151321,0.00042809692,0.00017258995,0.00612464,0.0055865096],"genre_scores_gemma":[0.9424843,0.00006437348,0.056144126,0.00003291248,0.000030381036,0.000072129056,0.00008965381,0.00005960572,0.0010226364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.00015385682,0.000042705433,0.00016141671,0.00025092147,0.00011046585],"domain_scores_gemma":[0.9976031,0.000549289,0.0002926743,0.0008044649,0.0004923541,0.0002580894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082955166,0.00056826224,0.00047462076,0.0007622645,0.0008657707,0.00091784546,0.0014834845,0.0004913128,0.0015779524],"category_scores_gemma":[0.003106076,0.0002754973,0.00023990934,0.00072817947,0.00087815284,0.0020658348,0.0020843183,0.00058933237,0.0004318124],"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.0024015664,0.00096760277,0.019514121,0.00044462396,0.0002531541,0.00092286605,0.0024930027,0.14445116,0.34063044,0.032184996,0.0069492683,0.44878724],"study_design_scores_gemma":[0.00009356216,0.00062599225,0.0034859648,0.000017078759,0.00009523668,0.0004344466,0.0005230922,0.8737895,0.102810495,0.009782865,0.008270233,0.00007143573],"about_ca_topic_score_codex":0.0027057724,"about_ca_topic_score_gemma":0.0032510816,"teacher_disagreement_score":0.0027057724,"about_ca_system_score_codex":0.00091418845,"about_ca_system_score_gemma":0.00093160983,"threshold_uncertainty_score":0.006632924},"labels":[],"label_agreement":null},{"id":"W1970383686","doi":"10.1109/icws.2005.123","title":"Transparent caching for nomadic WS clients","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Cache; SOAP; Computer network; Bandwidth (computing); Wireless; Mobile device; Wireless network; Distributed computing; Smart Cache; Cache algorithms; CPU cache; World Wide Web; Operating system","score_opus":0.04358384701081258,"score_gpt":0.26874215257970363,"score_spread":0.22515830556889105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970383686","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.6809241,0.00073147885,0.296581,0.0006403363,0.00014523178,0.00018960463,0.0001805065,0.0040039653,0.016603844],"genre_scores_gemma":[0.9721319,0.0001389975,0.022381218,0.00005992243,0.000028552124,0.000049831793,0.000098413984,0.000080467675,0.0050306423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999236,0.00017357865,0.00006638125,0.000113549744,0.0002514653,0.00015908372],"domain_scores_gemma":[0.9961177,0.0010014899,0.0003513289,0.0014125742,0.00081005297,0.00030674503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012916962,0.00039517827,0.00076603063,0.00037958354,0.001352228,0.002021229,0.0016161758,0.0010885083,0.002151942],"category_scores_gemma":[0.005254117,0.00042760797,0.0002922219,0.0005699527,0.000640722,0.0020536282,0.0013464418,0.00083423685,0.0005852534],"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.0050422465,0.0011931625,0.041185495,0.00061718695,0.00026991186,0.0065860827,0.0037632529,0.21211231,0.258625,0.17649107,0.020907681,0.27320662],"study_design_scores_gemma":[0.00011499601,0.00018321817,0.0032659182,0.000029161321,0.00006475167,0.00057211553,0.0004517719,0.9388057,0.03103758,0.015432814,0.009979386,0.000062605955],"about_ca_topic_score_codex":0.009583651,"about_ca_topic_score_gemma":0.013471881,"teacher_disagreement_score":0.009583651,"about_ca_system_score_codex":0.0014707434,"about_ca_system_score_gemma":0.0018196017,"threshold_uncertainty_score":0.019055724},"labels":[],"label_agreement":null},{"id":"W1971063377","doi":"10.1007/s11235-014-9939-7","title":"A hybrid approach for cost-effective media streaming based on prediction of demand in community networks","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Community network; The Internet; Computer network; Content delivery network; Server; World Wide Web","score_opus":0.0302040441044305,"score_gpt":0.24506371259843354,"score_spread":0.21485966849400304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971063377","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.054042634,0.00049435796,0.94251406,0.0002942474,0.00009142043,0.00008313579,0.0001430489,0.0004428979,0.0018941544],"genre_scores_gemma":[0.8096626,0.00035354993,0.18616687,0.00011053272,0.00018771288,0.00014943814,0.00027625804,0.00011270525,0.002980328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00013205326,0.000026511667,0.00009832419,0.00018355437,0.000101743164],"domain_scores_gemma":[0.9983553,0.0010070526,0.00007575222,0.00007752807,0.00035579104,0.00012844098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009092011,0.0007738943,0.0015854947,0.0011008212,0.0006620561,0.0012283308,0.0025532902,0.0014850554,0.0019057664],"category_scores_gemma":[0.0026213462,0.0004805814,0.00065299636,0.00161768,0.00044450918,0.0015192601,0.0010450821,0.0007797093,0.00022420827],"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.0001547595,0.0001870525,0.0010852101,0.000091337984,0.000078776044,0.0001361946,0.0000724048,0.9153307,0.0034482598,0.0082226815,0.0015843475,0.06960824],"study_design_scores_gemma":[0.0000020658758,0.000005046072,0.00002802327,7.393625e-7,0.0000030928172,0.0000047571616,0.000003694656,0.99921453,0.0000880156,0.00059783686,0.000050431063,0.0000017502555],"about_ca_topic_score_codex":0.014211118,"about_ca_topic_score_gemma":0.013603058,"teacher_disagreement_score":0.014211118,"about_ca_system_score_codex":0.0011987357,"about_ca_system_score_gemma":0.0012616526,"threshold_uncertainty_score":0.028256774},"labels":[],"label_agreement":null},{"id":"W1971938370","doi":"10.1007/s12652-009-0001-7","title":"Data ubiquity in autonomic wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Wireless mesh network; Bottleneck; Computer network; The Internet; Wireless network; Wireless; Wireless broadband; Broadband; Scheme (mathematics); Distributed computing; Internet access; Cache; Telecommunications; World Wide Web; Embedded system","score_opus":0.06055178996298065,"score_gpt":0.2946030720256984,"score_spread":0.23405128206271775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971938370","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.63869953,0.00316399,0.34200367,0.0030349593,0.0003932289,0.00007798777,0.00016024073,0.0005071858,0.011959151],"genre_scores_gemma":[0.99600595,0.00019268287,0.0031501884,0.000044018543,0.00005714379,0.000009945796,0.000020416812,0.000014760038,0.0005048003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990727,0.00025122214,0.000078368306,0.00020632299,0.00019523056,0.00019614426],"domain_scores_gemma":[0.99303234,0.0039271647,0.00079122325,0.001016572,0.0008170473,0.00041557103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022848751,0.00025240204,0.0009887199,0.0009661093,0.0016584875,0.0022965567,0.0015639301,0.0011199163,0.0017395671],"category_scores_gemma":[0.012715642,0.000501347,0.00031182967,0.0012159657,0.0012384729,0.004477429,0.0019801182,0.00093502755,0.00019017655],"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.0014575012,0.0004427629,0.03395855,0.0004351807,0.00025286857,0.0019961465,0.0015162671,0.43241006,0.016871758,0.3260197,0.009846163,0.17479311],"study_design_scores_gemma":[0.000034598506,0.0001297379,0.003912175,0.000029727382,0.000082034305,0.0008216189,0.00072490226,0.88645285,0.0020263982,0.10246469,0.0032934833,0.0000277896],"about_ca_topic_score_codex":0.0012897091,"about_ca_topic_score_gemma":0.0015094401,"teacher_disagreement_score":0.0022965567,"about_ca_system_score_codex":0.0009928443,"about_ca_system_score_gemma":0.0005452862,"threshold_uncertainty_score":0.012083709},"labels":[],"label_agreement":null},{"id":"W1972427734","doi":"10.1109/infcomw.2013.6970756","title":"Smarter home networks with simple gateways","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Delegate; Troubleshooting; Computer science; Simple (philosophy); Residential gateway; Internetworking; Gateway (web page); Focus (optics); Computer network; Resource (disambiguation); Default gateway; Home automation; Telecommunications; World Wide Web; The Internet; Operating system","score_opus":0.005959075456370717,"score_gpt":0.16202224563485518,"score_spread":0.15606317017848445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972427734","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.2142145,0.0016231291,0.74497306,0.0008508129,0.0002621137,0.00036227028,0.00025085665,0.0065903426,0.030872865],"genre_scores_gemma":[0.6960467,0.00136756,0.28555855,0.0005444335,0.00018859112,0.00018974103,0.0004672802,0.00018278338,0.015454285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995152,0.00010060783,0.00004067324,0.0001227557,0.00014921845,0.000071663766],"domain_scores_gemma":[0.9994425,0.00009446678,0.000068644695,0.00025331325,0.00006676516,0.00007429654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000668429,0.00048015075,0.0007139144,0.0004593775,0.00043749867,0.0015804756,0.0014115961,0.0009236359,0.002499998],"category_scores_gemma":[0.0008663937,0.00043619613,0.00043157412,0.0006134152,0.00088385737,0.004005904,0.0024588539,0.0010651007,0.0010711317],"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.0010896389,0.0007454445,0.0043236557,0.00089444505,0.00020419773,0.0014882125,0.0011906269,0.12649424,0.24502534,0.32296026,0.02043871,0.27514517],"study_design_scores_gemma":[0.0005369473,0.0009427723,0.0050606607,0.0001580652,0.0003323599,0.0018267779,0.00037575068,0.6249202,0.073004395,0.13235691,0.16028371,0.0002015113],"about_ca_topic_score_codex":0.0010643743,"about_ca_topic_score_gemma":0.0015958559,"teacher_disagreement_score":0.002499998,"about_ca_system_score_codex":0.00052486995,"about_ca_system_score_gemma":0.0003770273,"threshold_uncertainty_score":0.0083633065},"labels":[],"label_agreement":null},{"id":"W1974141524","doi":"10.1117/12.511337","title":"<title>Content adaptation architecture with efficient usage of cached data in a multimedia proxy server</title>","year":2003,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Proxy server; Cache; Proxy (statistics); Architecture; Computer network; Content adaptation; Latency (audio); Adaptation (eye); Multimedia; Computer architecture; Operating system; Telecommunications; Ubiquitous computing","score_opus":0.021306466682575007,"score_gpt":0.21852053287973539,"score_spread":0.19721406619716036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974141524","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26399925,0.0011607824,0.7098524,0.0004945167,0.00021857233,0.00024462558,0.00014356157,0.0131603135,0.010725971],"genre_scores_gemma":[0.86604923,0.0003529844,0.12155336,0.00015843102,0.000085496235,0.00008440417,0.00034145307,0.00014985978,0.011224836],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998294,0.00002828859,0.000021358806,0.000039765375,0.000047585887,0.00003362722],"domain_scores_gemma":[0.99961424,0.000033976958,0.00003275313,0.000111115,0.00014173993,0.00006616718],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029423923,0.00028166483,0.00044850327,0.00038261584,0.00050082186,0.00087893225,0.0016417893,0.00062404753,0.0014815835],"category_scores_gemma":[0.00043301686,0.00018923324,0.00022738696,0.0006016125,0.0003516965,0.00084347493,0.00044874277,0.0004579657,0.0009396623],"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.0015200889,0.0006373376,0.0057909316,0.00021645124,0.00015393079,0.0013857168,0.0003540106,0.055247366,0.5907199,0.013954369,0.015527146,0.31449276],"study_design_scores_gemma":[0.00008534296,0.0003402437,0.0022430497,0.00001541801,0.00009289459,0.0007101893,0.000056695008,0.78753936,0.19427949,0.0018637471,0.012714876,0.000058670237],"about_ca_topic_score_codex":0.0026859024,"about_ca_topic_score_gemma":0.0023228189,"teacher_disagreement_score":0.9985184,"about_ca_system_score_codex":0.00065482984,"about_ca_system_score_gemma":0.0005204069,"threshold_uncertainty_score":0.0053405166},"labels":[],"label_agreement":null},{"id":"W1975614823","doi":"10.1109/ucc.2013.19","title":"Middleware-Enabled Mobile Framework in mHealth","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Dissemination; Computer science; Middleware (distributed applications); Mobile computing; Mobile device; mHealth; Data access; Mobile technology; Computer network; Health care; World Wide Web; Distributed computing; Database; Telecommunications","score_opus":0.014729753695270523,"score_gpt":0.24250120778026588,"score_spread":0.22777145408499536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975614823","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.020696938,0.007902722,0.94742733,0.0016324527,0.0004907522,0.00032588674,0.00015489446,0.0056806635,0.01568834],"genre_scores_gemma":[0.41373932,0.0032501398,0.567907,0.00050890073,0.00019199825,0.0002929209,0.0003320341,0.0004458156,0.013331891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992514,0.00022838103,0.00007779876,0.00011453806,0.0002086698,0.00011911255],"domain_scores_gemma":[0.99963796,0.00010297902,0.000032309945,0.00008787245,0.00006483085,0.000074032585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866362,0.0004452685,0.00038872164,0.00060791743,0.0006633521,0.0020453103,0.0016945687,0.0012509342,0.0023690602],"category_scores_gemma":[0.001603828,0.00034221724,0.00071225426,0.0004969543,0.0008068429,0.002201117,0.0022290822,0.0010718645,0.00090815686],"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.00071835204,0.00024108739,0.0034179608,0.0011693211,0.00020167642,0.003077202,0.002350095,0.05370045,0.05125384,0.5695804,0.014737746,0.29955196],"study_design_scores_gemma":[0.00018634541,0.0004346782,0.0019576866,0.00047608773,0.00023150172,0.002322643,0.0010548838,0.32038411,0.039340954,0.15850617,0.47490317,0.00020178019],"about_ca_topic_score_codex":0.0040198793,"about_ca_topic_score_gemma":0.0035314402,"teacher_disagreement_score":0.0040198793,"about_ca_system_score_codex":0.0009901767,"about_ca_system_score_gemma":0.001231088,"threshold_uncertainty_score":0.007992983},"labels":[],"label_agreement":null},{"id":"W1975651401","doi":"10.1016/j.cor.2007.02.005","title":"Exact algorithms for the joint object placement and request routing problem in content distribution networks","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Linear programming relaxation; Network topology; The Internet; Integer programming; Server; Linear programming; Computer network; Distributed computing; Mathematics","score_opus":0.13321440428502873,"score_gpt":0.35558244196043476,"score_spread":0.22236803767540603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975651401","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.03173213,0.0014605235,0.95667136,0.0011986329,0.00019098139,0.00020757105,0.00036442815,0.0015089937,0.0066652857],"genre_scores_gemma":[0.41935807,0.0010897215,0.56926763,0.00030880692,0.0003095668,0.00045261587,0.0009417666,0.0004565344,0.007815256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973711,0.0008639699,0.000141838,0.00041031232,0.0006685226,0.00054427265],"domain_scores_gemma":[0.9886312,0.00873932,0.00060285773,0.0010005266,0.0006897164,0.00033645314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041918173,0.001773514,0.003104547,0.0017073058,0.0017439058,0.004002078,0.004471073,0.0030495452,0.008728375],"category_scores_gemma":[0.016075315,0.0017496779,0.0011579049,0.0039918707,0.002258508,0.0065671103,0.0030596417,0.0027023454,0.0015090866],"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.00042373655,0.00021443666,0.00067268574,0.00023273041,0.00005650265,0.000048366164,0.00018957152,0.8580549,0.0007512558,0.036567144,0.007875493,0.094913244],"study_design_scores_gemma":[0.000104720064,0.000034825705,0.00012806867,0.000010013909,0.000018439874,0.000021064561,0.000048720307,0.9601109,0.00025855485,0.038551386,0.0007036348,0.000009661531],"about_ca_topic_score_codex":0.01765564,"about_ca_topic_score_gemma":0.01895993,"teacher_disagreement_score":0.01765564,"about_ca_system_score_codex":0.0048368042,"about_ca_system_score_gemma":0.005540451,"threshold_uncertainty_score":0.035105765},"labels":[],"label_agreement":null},{"id":"W1976508410","doi":"10.1016/j.jda.2012.10.006","title":"A novel approach for leveraging co-occurrence to improve the false positive error in signature files","year":2012,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bloom filter; False positive rate; Signature (topology); Computer science; Word error rate; Index (typography); Search engine indexing; Error detection and correction; Type I and type II errors; Data mining; Statistics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.03029142257773487,"score_gpt":0.2858053166275522,"score_spread":0.25551389404981734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976508410","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.03934045,0.0005151319,0.95422333,0.00065730285,0.00040366856,0.00018293314,0.0001991556,0.0034533383,0.0010246673],"genre_scores_gemma":[0.47219878,0.00028102848,0.52177596,0.0005053033,0.00059040065,0.00017081633,0.00040744425,0.00038257433,0.003687681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9831818,0.0038591458,0.0012588085,0.0027272664,0.0075444607,0.0014286074],"domain_scores_gemma":[0.91841644,0.03460334,0.005381151,0.025249006,0.014328245,0.002021872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007166964,0.0022015832,0.0038867856,0.004129326,0.002368401,0.0036116112,0.005459153,0.0044773933,0.0023239385],"category_scores_gemma":[0.053455662,0.0010834814,0.0015267528,0.0050929543,0.0019861432,0.007415024,0.0047725355,0.0046604313,0.0018295228],"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.0039669587,0.0016241055,0.023852687,0.00042892862,0.0005829383,0.001194869,0.00044557048,0.11845912,0.07478388,0.021397667,0.0120120095,0.74125135],"study_design_scores_gemma":[0.00008618236,0.00037656265,0.001655901,0.000027999604,0.00016912546,0.001401604,0.00007906788,0.9378824,0.045006756,0.01049717,0.0027215176,0.00009564423],"about_ca_topic_score_codex":0.0028308842,"about_ca_topic_score_gemma":0.005722164,"teacher_disagreement_score":0.007166964,"about_ca_system_score_codex":0.0014481581,"about_ca_system_score_gemma":0.0054625273,"threshold_uncertainty_score":0.03790301},"labels":[],"label_agreement":null},{"id":"W1979958853","doi":"10.1109/cc.2014.7004531","title":"A game theoretic approach for energy-efficient in-network caching in content-centric networks","year":2014,"lang":"en","type":"article","venue":"China Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Efficient energy use; Game theory; Distributed computing","score_opus":0.028960750842052307,"score_gpt":0.2320833769008597,"score_spread":0.2031226260588074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979958853","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.0064577493,0.00023820731,0.98482597,0.0003734348,0.00006052829,0.00009810855,0.000043027463,0.000046943882,0.007855985],"genre_scores_gemma":[0.7623071,0.0012787239,0.22264467,0.00036163334,0.00021760655,0.0005380131,0.00009797012,0.00007588796,0.012478391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902856,0.0004805426,0.000038037924,0.00012980077,0.00020432138,0.00011873829],"domain_scores_gemma":[0.9988206,0.0007492221,0.00010874629,0.000060159502,0.0001758396,0.00008547715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014912261,0.0011649833,0.0011881653,0.0008656403,0.0009876908,0.0017197913,0.0024348127,0.0016820848,0.0027283553],"category_scores_gemma":[0.0030354762,0.0005374577,0.0010546427,0.0010830356,0.0017708981,0.0022355553,0.0015884466,0.0016734925,0.0003357553],"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.000034625307,0.00007544521,0.00024017815,0.00010572501,0.000045753328,0.00015034509,0.00014367909,0.6263523,0.0018708868,0.360032,0.0017616586,0.009187375],"study_design_scores_gemma":[0.000010759523,0.000020399499,0.000042542855,0.000007695655,0.000011365959,0.00003668319,0.000024124347,0.95077944,0.00018182726,0.047806088,0.0010697333,0.0000093339795],"about_ca_topic_score_codex":0.005306449,"about_ca_topic_score_gemma":0.0054442897,"teacher_disagreement_score":0.005306449,"about_ca_system_score_codex":0.0031420786,"about_ca_system_score_gemma":0.0022883432,"threshold_uncertainty_score":0.022797465},"labels":[],"label_agreement":null},{"id":"W1980983455","doi":"10.1145/1101149.1101211","title":"rStream","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure code; Peer-to-peer; Computer network; Linear network coding; Coding (social sciences); Bandwidth (computing); Multimedia; Redundancy (engineering); Distributed computing; Decoding methods; Telecommunications; Network packet","score_opus":0.008637481674670797,"score_gpt":0.19864168494817244,"score_spread":0.19000420327350165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980983455","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005287774,0.0024160317,0.1904223,0.0023879514,0.0027774484,0.0012290573,0.05437526,0.2880379,0.45306632],"genre_scores_gemma":[0.049743112,0.0024919272,0.09067614,0.0024052656,0.00078133354,0.0010863333,0.10911175,0.03427307,0.709431],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919885,0.000085820626,0.00006276615,0.00014436347,0.00038133244,0.00012689878],"domain_scores_gemma":[0.9986797,0.00017237771,0.00005490252,0.00055469706,0.00037953365,0.00015873503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000796383,0.0010116287,0.0011566691,0.0014727518,0.0010000269,0.0039554466,0.00269972,0.0019908347,0.34730387],"category_scores_gemma":[0.0034766379,0.0006383598,0.0010451479,0.0013425504,0.00045457523,0.0031951775,0.0038492025,0.001647838,0.352623],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00063816627,0.00010211907,0.0005498945,0.00068039494,0.000050401206,0.0003193113,0.0002080989,0.0009368872,0.011902742,0.021390567,0.6768559,0.28636548],"study_design_scores_gemma":[0.00009553016,0.00004860635,0.00042575045,0.00005776844,0.000017220742,0.0002932683,0.000040179195,0.0033602156,0.0066368333,0.006203989,0.98278046,0.00004012352],"about_ca_topic_score_codex":0.0016744585,"about_ca_topic_score_gemma":0.0017816646,"teacher_disagreement_score":0.34730387,"about_ca_system_score_codex":0.00066812075,"about_ca_system_score_gemma":0.0013017054,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1981196359","doi":"10.3390/fi2040603","title":"Network Edge Intelligence for the Emerging Next-Generation Internet","year":2010,"lang":"en","type":"article","venue":"Future Internet","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Cloud computing; Software deployment; Variety (cybernetics); The Internet; Content delivery network; Enhanced Data Rates for GSM Evolution; Service (business); Service provider; Edge device; Computer network; World Wide Web; Computer security; Telecommunications; Server; Operating system; Artificial intelligence; Business","score_opus":0.04214608528300326,"score_gpt":0.25351387745105364,"score_spread":0.21136779216805038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981196359","genre_codex":"other","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.07127562,0.07340519,0.3015794,0.10597713,0.0037506935,0.0001772259,0.00025751282,0.0016264892,0.44195074],"genre_scores_gemma":[0.61126405,0.07186271,0.2068274,0.009853984,0.0024564369,0.00012513147,0.0004913862,0.00023282185,0.09688601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980706,0.00003683704,0.0000087627495,0.000020864558,0.00009334942,0.000033078122],"domain_scores_gemma":[0.9996753,0.00008997474,0.00003358598,0.000054553868,0.0000858008,0.000060791655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004730334,0.00017492705,0.00014800546,0.00040324795,0.0006923493,0.0024387455,0.0004985055,0.0013410738,0.0052744346],"category_scores_gemma":[0.0011934077,0.00011593117,0.00016350087,0.00061081524,0.00047667237,0.0042460947,0.0011602793,0.0011186006,0.0011161573],"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.000072051625,0.000057374593,0.0011769752,0.0001639907,0.000014236708,0.0003108882,0.00023234494,0.0053736693,0.0051002726,0.7206882,0.052650485,0.21415941],"study_design_scores_gemma":[0.000015194604,0.000045260298,0.0012283897,0.00027055878,0.00003092167,0.00062132755,0.00039127428,0.042909928,0.0017740709,0.26059002,0.6920974,0.000025625362],"about_ca_topic_score_codex":0.00151032,"about_ca_topic_score_gemma":0.0029828374,"teacher_disagreement_score":0.0052744346,"about_ca_system_score_codex":0.00081402296,"about_ca_system_score_gemma":0.001126671,"threshold_uncertainty_score":0.017644763},"labels":[],"label_agreement":null},{"id":"W1981199452","doi":"10.1117/12.473037","title":"<title>Distributed adaptation technique for mobile web browsing</title>","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Caching and Content Delivery","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 Alberta","funders":"","keywords":"Computer science; Adaptation (eye); Mobile device; Mobile Web; Content adaptation; Web server; World Wide Web; Multimedia; Architecture; Proxy server; Web navigation; Mobile computing; Computer network; Web service; The Internet; Mobile technology; Operating system; Ubiquitous computing","score_opus":0.0146355562284714,"score_gpt":0.2144934718286669,"score_spread":0.1998579156001955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981199452","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.08510656,0.00079115166,0.9030934,0.0002567161,0.00016280175,0.00009174933,0.000047255995,0.0038233944,0.006626999],"genre_scores_gemma":[0.74255425,0.0005892436,0.2396368,0.000120258264,0.00011933561,0.00008344764,0.00019058885,0.00020722386,0.016498847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987686,0.000029067005,0.000007513098,0.00001920611,0.000048527665,0.000018800029],"domain_scores_gemma":[0.99976665,0.000042886466,0.000014628141,0.000070222304,0.000078345525,0.000027293283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020370162,0.00021169735,0.00030136303,0.00042474893,0.0003352283,0.00036334182,0.00066344783,0.00041084737,0.0020448598],"category_scores_gemma":[0.00048297056,0.0001327249,0.00020769172,0.00044866017,0.0002794213,0.0005569458,0.00030583199,0.0004908368,0.0009052572],"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.0006399583,0.00022800383,0.0023904545,0.0001101055,0.0000512446,0.0013132256,0.00032079156,0.01986188,0.4059634,0.010665347,0.013295482,0.5451601],"study_design_scores_gemma":[0.0000775177,0.00028722023,0.0030923155,0.000021777532,0.0000617357,0.0019705233,0.0001300115,0.84918433,0.12115736,0.0033124126,0.020645393,0.0000593651],"about_ca_topic_score_codex":0.0018755882,"about_ca_topic_score_gemma":0.0021356235,"teacher_disagreement_score":0.0020448598,"about_ca_system_score_codex":0.00030009318,"about_ca_system_score_gemma":0.00021998065,"threshold_uncertainty_score":0.006840706},"labels":[],"label_agreement":null},{"id":"W1982605662","doi":"10.1145/2367589.2367591","title":"Comparing high-performance multi-core web-server architectures","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Server; Cache; Operating system; Focus (optics); Cloud computing; Web server; Throughput; Multi-core processor; File system; Core (optical fiber); File server; The Internet","score_opus":0.053885412362147465,"score_gpt":0.2440920603911381,"score_spread":0.19020664802899062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982605662","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.9777629,0.0010991977,0.0120615475,0.00025895546,0.00018732133,0.00012792918,0.00026406616,0.0008105339,0.0074275876],"genre_scores_gemma":[0.98478127,0.00033177127,0.012519168,0.00007175977,0.00007014152,0.0001005494,0.0007333779,0.00015395395,0.0012381289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977011,0.000600985,0.00019561737,0.0002369979,0.000857123,0.00040811748],"domain_scores_gemma":[0.9929778,0.0024940455,0.00027391405,0.00083408714,0.0029752746,0.000444919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025067315,0.00082545297,0.0007808011,0.0014512644,0.00077388,0.0013969224,0.001652583,0.00092499837,0.002830976],"category_scores_gemma":[0.009295602,0.00037179954,0.00043456443,0.0019889427,0.0003161646,0.002639493,0.00086069724,0.0010054341,0.0008248751],"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.00970994,0.003275652,0.035653256,0.001320789,0.0007697302,0.0006265258,0.0004107716,0.6391225,0.058090553,0.010587369,0.013814792,0.22661811],"study_design_scores_gemma":[0.00036786564,0.0033520674,0.024179252,0.00004391179,0.00019062118,0.00021925764,0.0005013732,0.92842555,0.03386012,0.0049100984,0.0038742337,0.00007575188],"about_ca_topic_score_codex":0.0022197394,"about_ca_topic_score_gemma":0.002373603,"teacher_disagreement_score":0.002830976,"about_ca_system_score_codex":0.0011497813,"about_ca_system_score_gemma":0.0009001834,"threshold_uncertainty_score":0.013257027},"labels":[],"label_agreement":null},{"id":"W1986419211","doi":"10.5539/cis.v6n1p140","title":"Paradigm Shift in the Security-n-Privacy Implementation of Semi-Distributed Online Social Networking","year":2013,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Internet privacy; Exploit; Reputation; Computer security; Credibility; Personally identifiable information; Leverage (statistics); Identity theft; World Wide Web","score_opus":0.017505283066331128,"score_gpt":0.2729031007623396,"score_spread":0.25539781769600844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986419211","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.030483719,0.00075776596,0.9243691,0.009348536,0.000425477,0.00040799734,0.00005143691,0.0012503712,0.03290556],"genre_scores_gemma":[0.65903425,0.00084880006,0.32326978,0.0027772991,0.0003281956,0.0005180053,0.00009111964,0.00022232413,0.012910186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98701626,0.0062116985,0.00065458583,0.0020457173,0.003357985,0.0007138352],"domain_scores_gemma":[0.9861312,0.003653271,0.0007495885,0.0060044224,0.0024994863,0.0009620419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012146591,0.00061018683,0.00066233973,0.0008976404,0.0024488694,0.007857952,0.004470527,0.0033627206,0.002598429],"category_scores_gemma":[0.009840183,0.00080203015,0.0010670938,0.0007264519,0.0065494124,0.010996185,0.0071223928,0.006881998,0.0010943235],"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.00022850903,0.00028175986,0.001862414,0.00028986225,0.00006716962,0.00034170347,0.002392426,0.004695095,0.009982274,0.8847842,0.003915771,0.0911589],"study_design_scores_gemma":[0.00015628355,0.0007636614,0.0017393348,0.00038080866,0.00010509697,0.0022359798,0.0017356314,0.18199158,0.021617506,0.584188,0.20489942,0.00018678828],"about_ca_topic_score_codex":0.0015932719,"about_ca_topic_score_gemma":0.0012877096,"teacher_disagreement_score":0.012146591,"about_ca_system_score_codex":0.0031003114,"about_ca_system_score_gemma":0.0031333254,"threshold_uncertainty_score":0.06423807},"labels":[],"label_agreement":null},{"id":"W1987479549","doi":"10.1109/tmc.2015.2404791","title":"Virtual Servers Co-Migration for Mobile Accesses: Online versus Off-Line","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Server; Computer science; Online algorithm; Lambda; Computer network; Wireless network; Mathematics; Wireless; Combinatorics; Discrete mathematics; Algorithm; Operating system; Physics","score_opus":0.06621270087283197,"score_gpt":0.3247944025949143,"score_spread":0.25858170172208234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987479549","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.2602759,0.0029333415,0.71983635,0.0024332118,0.0009434194,0.0005396573,0.00030120875,0.0019086818,0.010828247],"genre_scores_gemma":[0.91173804,0.00041438203,0.08332546,0.00027701026,0.00020263663,0.00012906508,0.00018176151,0.00018503913,0.0035466712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980526,0.0005924749,0.00008057309,0.00053073285,0.00026589513,0.00047779718],"domain_scores_gemma":[0.99570245,0.001880657,0.00053701026,0.0011017085,0.00032990222,0.00044828892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017279637,0.0017140099,0.0017468642,0.00037352205,0.00157792,0.0022898396,0.0036448922,0.0020687063,0.0049142796],"category_scores_gemma":[0.0055386173,0.00057018036,0.0007338326,0.00092904456,0.0012510016,0.003946494,0.0023536202,0.0015985956,0.0010525109],"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.0016562839,0.00083116436,0.004783963,0.00052720367,0.00018895784,0.0008545947,0.00039876282,0.7441003,0.012738896,0.05340525,0.015663475,0.16485114],"study_design_scores_gemma":[0.0000410742,0.00014485818,0.0003202395,0.000016573602,0.000027226093,0.00023439838,0.00016585279,0.985679,0.0014812314,0.009859308,0.0020166072,0.000013726719],"about_ca_topic_score_codex":0.0036451695,"about_ca_topic_score_gemma":0.0040347017,"teacher_disagreement_score":0.0049142796,"about_ca_system_score_codex":0.0013540231,"about_ca_system_score_gemma":0.0016732805,"threshold_uncertainty_score":0.016439915},"labels":[],"label_agreement":null},{"id":"W1988598188","doi":"10.1109/milcom.2008.4753330","title":"A technology study on tactical naming service for mounted and dismounted segments","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Computer network; Multicast; Distributed hash table; Tactical communications; Service discovery; Service (business); Domain Name System; Bandwidth (computing); The Internet; World Wide Web; Web service","score_opus":0.031925303880670566,"score_gpt":0.28045763164858495,"score_spread":0.2485323277679144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988598188","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.7499799,0.008133415,0.14556655,0.0021086114,0.00011099235,0.00024688596,0.00015536846,0.00022359725,0.093474634],"genre_scores_gemma":[0.97581553,0.0025293846,0.015751077,0.00012390652,0.000031125757,0.00006232247,0.00008794328,0.000018909559,0.0055798255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988224,0.00046647777,0.00003804357,0.0001367301,0.00039357168,0.00014269979],"domain_scores_gemma":[0.9977723,0.0011340984,0.00021998359,0.00020368607,0.0006148171,0.000055176508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012965661,0.00025541327,0.0002942967,0.00081638835,0.00074959826,0.0017247307,0.0007280667,0.0011031511,0.0018132516],"category_scores_gemma":[0.003814023,0.000119499855,0.00030148056,0.0016028595,0.000785508,0.0043776166,0.0004551827,0.000428433,0.00037043725],"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.00040847505,0.0002249431,0.023758383,0.0005140278,0.000060532802,0.0013208383,0.0025340817,0.09523533,0.07413813,0.60221994,0.0037667,0.19581857],"study_design_scores_gemma":[0.000050341754,0.0021692165,0.02019444,0.00023010501,0.0001592528,0.0035842697,0.005096515,0.7220332,0.08712622,0.04851103,0.11071751,0.00012786721],"about_ca_topic_score_codex":0.0037294892,"about_ca_topic_score_gemma":0.002239312,"teacher_disagreement_score":0.0037294892,"about_ca_system_score_codex":0.002483851,"about_ca_system_score_gemma":0.00079706754,"threshold_uncertainty_score":0.018021643},"labels":[],"label_agreement":null},{"id":"W1989095864","doi":"10.1145/1873951.1874070","title":"Negotiating multimedia advertising with attention owners","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Negotiation; Balance (ability); Intermediary; The Internet; Multimedia; Advertising; Computer science; Online advertising; Internet privacy; Psychology; Business; World Wide Web; Marketing; Sociology","score_opus":0.00567937520894823,"score_gpt":0.2014217642852746,"score_spread":0.19574238907632638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989095864","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35759386,0.0020791104,0.2683447,0.011182493,0.0002494385,0.0006140355,0.00012136542,0.0007872478,0.35902765],"genre_scores_gemma":[0.97355247,0.00020856905,0.0125191985,0.00031555007,0.000096560485,0.00007974233,0.00002999989,0.000048313057,0.013149633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997934,0.0007807832,0.00008322081,0.00037168476,0.00041036578,0.00041980977],"domain_scores_gemma":[0.99208117,0.005186219,0.00049040315,0.0007541537,0.00069608766,0.0007918756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052717687,0.00054658455,0.0007415978,0.001032,0.0015206613,0.0047133067,0.0014866224,0.002207772,0.014577968],"category_scores_gemma":[0.019922186,0.00069448183,0.00041252078,0.00079435855,0.0016675625,0.0068102116,0.00418791,0.0016233023,0.0010249673],"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.0011524833,0.00064316776,0.015288859,0.00024195117,0.00013246128,0.0016594643,0.0059867646,0.024066672,0.017411413,0.6068721,0.012279218,0.31426555],"study_design_scores_gemma":[0.0002688118,0.00050211226,0.009916372,0.00013675608,0.00030255623,0.00103558,0.00450154,0.4407257,0.012688687,0.46005747,0.069741376,0.00012296601],"about_ca_topic_score_codex":0.0026293034,"about_ca_topic_score_gemma":0.0023318245,"teacher_disagreement_score":0.014577968,"about_ca_system_score_codex":0.0019056139,"about_ca_system_score_gemma":0.0011661013,"threshold_uncertainty_score":0.048768103},"labels":[],"label_agreement":null},{"id":"W1989656045","doi":"10.1108/17427370810873156","title":"Ubiquitous content formulations for real‐time information communications","year":2008,"lang":"en","type":"article","venue":"International Journal of Pervasive Computing and Communications","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Bottleneck; Adaptation (eye); Content adaptation; Ubiquitous computing; Computer network; Wireless network; Distributed computing; Wireless; Human–computer interaction; Telecommunications","score_opus":0.07927523598200059,"score_gpt":0.3123984524867485,"score_spread":0.23312321650474793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989656045","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.010957748,0.0013810367,0.9636582,0.0010287452,0.00033171193,0.00006104902,0.000088734436,0.00019978333,0.02229295],"genre_scores_gemma":[0.70242345,0.0034067575,0.24841061,0.00083420164,0.0011451447,0.00044151788,0.00024359736,0.0003647321,0.042729925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994868,0.00017619683,0.000025760237,0.00008286019,0.00017578645,0.00005259556],"domain_scores_gemma":[0.9989126,0.00042436874,0.00010799623,0.00017880628,0.0003007343,0.00007563621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063496095,0.00066636497,0.00037906985,0.0006720758,0.00047695258,0.0017605787,0.0011787079,0.000979675,0.0065475414],"category_scores_gemma":[0.003196622,0.00023110927,0.0004680141,0.00074523065,0.0011724377,0.0031443168,0.001260458,0.0014279942,0.001185705],"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.000048524475,0.00004331616,0.0002028828,0.0001407846,0.000015949401,0.00016679487,0.00020448944,0.037250344,0.0041607674,0.9270167,0.005090606,0.025658863],"study_design_scores_gemma":[0.000025015164,0.00007580758,0.00020266198,0.000054358108,0.000026261107,0.00023270347,0.00016852056,0.6502726,0.002977247,0.3143995,0.03154671,0.000018479992],"about_ca_topic_score_codex":0.0013650521,"about_ca_topic_score_gemma":0.0008413774,"teacher_disagreement_score":0.0065475414,"about_ca_system_score_codex":0.0014940391,"about_ca_system_score_gemma":0.0006225496,"threshold_uncertainty_score":0.021903694},"labels":[],"label_agreement":null},{"id":"W1990405567","doi":"10.1145/1516360.1516410","title":"Flower-CDN","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Gossip; Locality; Server; Computer network; Distributed hash table; Latency (audio); Overlay network; Content distribution; World Wide Web; Overlay; Peer-to-peer; The Internet; Operating system; Telecommunications","score_opus":0.007727509809261821,"score_gpt":0.2022893990657407,"score_spread":0.19456188925647888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990405567","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.106339425,0.003151124,0.7280117,0.0025202995,0.0011727514,0.0015846804,0.0061799213,0.024240732,0.12679937],"genre_scores_gemma":[0.6312683,0.0009974787,0.31551397,0.0016090893,0.00014774481,0.0005504305,0.006574936,0.00067524717,0.042662762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995085,0.00008632586,0.000029867122,0.00013339358,0.00012773667,0.00011419817],"domain_scores_gemma":[0.9990871,0.00021948942,0.00004974215,0.00027681334,0.00024395075,0.00012284573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063393207,0.0004000068,0.00059049565,0.00067813846,0.0016513915,0.0014913022,0.0024694777,0.0010248189,0.013530799],"category_scores_gemma":[0.0022754797,0.00024445995,0.00045948062,0.0008300759,0.0005592038,0.0017129652,0.002023861,0.0007249249,0.0020944194],"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.002022928,0.00042619067,0.0036175903,0.00062308996,0.00017415454,0.0007018696,0.00034743673,0.17004591,0.01721311,0.11698012,0.21871193,0.46913564],"study_design_scores_gemma":[0.00025009067,0.00029712258,0.00078984024,0.00007118127,0.00006726017,0.00069581816,0.00021284328,0.760614,0.014304226,0.051898,0.17072323,0.00007647568],"about_ca_topic_score_codex":0.009284802,"about_ca_topic_score_gemma":0.01455248,"teacher_disagreement_score":0.013530799,"about_ca_system_score_codex":0.0019947514,"about_ca_system_score_gemma":0.0014163717,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1991876724","doi":"10.1145/1454573.1454576","title":"On workload merging and filtering effects in hierarchical wireless media streaming","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Calgary","funders":"","keywords":"Computer science; Computer network; Multicast; Server; Scalability; Wireless network; Real Time Streaming Protocol; Wireless; Bandwidth (computing); The Internet; Distributed computing","score_opus":0.011964354876347607,"score_gpt":0.20598922489022278,"score_spread":0.19402487001387517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991876724","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.91289973,0.00071783,0.08208654,0.00028486992,0.000028176206,0.00009873537,0.000049829552,0.00022443292,0.0036099025],"genre_scores_gemma":[0.9954282,0.000101663536,0.00413109,0.000031857322,0.000020003297,0.000011143656,0.000024753363,0.000012473902,0.000238717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988871,0.00043014664,0.000051597483,0.00010909404,0.0003349244,0.00018718131],"domain_scores_gemma":[0.99037457,0.007630807,0.00078420975,0.00037096706,0.0005735289,0.00026600726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643943,0.00059272296,0.0006261793,0.0009765546,0.00067060674,0.0008184131,0.000649584,0.0007233022,0.00051942986],"category_scores_gemma":[0.01032215,0.00030033133,0.00048675883,0.00079283107,0.00085117173,0.0012516761,0.000501537,0.00049168715,0.00007042659],"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.00050819624,0.00039463444,0.01282512,0.000099644276,0.000060243263,0.00050965126,0.000555716,0.89323294,0.045772262,0.012435957,0.00041165247,0.033193972],"study_design_scores_gemma":[0.000013290576,0.00009239753,0.0023534712,0.0000052737046,0.000016571446,0.000055310637,0.0000356511,0.99116373,0.0044543636,0.0016962163,0.00010217276,0.000011554158],"about_ca_topic_score_codex":0.0067245625,"about_ca_topic_score_gemma":0.0032886236,"teacher_disagreement_score":0.0067245625,"about_ca_system_score_codex":0.0015301665,"about_ca_system_score_gemma":0.00050435204,"threshold_uncertainty_score":0.013370872},"labels":[],"label_agreement":null},{"id":"W1992391146","doi":"10.1109/mobilware.2013.15","title":"Handoff Between Proxies in the Proxy-Based Mobile Computing System","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Proxy (statistics); Mobile cloud computing; Mobile device; Handover; Mobile computing; Cloud computing; Computer network; Wireless; Quality of service; Distributed computing; Operating system","score_opus":0.013397835131929514,"score_gpt":0.21664384225178246,"score_spread":0.20324600711985294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992391146","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.64112157,0.0031913884,0.33607644,0.00059393194,0.00045062823,0.00041659927,0.00014693747,0.007756586,0.010245869],"genre_scores_gemma":[0.96327376,0.00027450768,0.033209577,0.000087234155,0.000038760718,0.000044398545,0.00008276811,0.000050726783,0.0029382065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913174,0.00026908048,0.000099794495,0.0001642071,0.00015689924,0.00017837726],"domain_scores_gemma":[0.9986811,0.00027219966,0.0001247981,0.00041154615,0.0001937872,0.0003165069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008281766,0.00041707672,0.0009890175,0.0005426596,0.0014011373,0.0021614495,0.0015646956,0.0012045657,0.002305533],"category_scores_gemma":[0.0018557266,0.00033251548,0.0002996909,0.0007017336,0.0005126548,0.0014621469,0.0012653032,0.00078777026,0.0008571138],"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.009729342,0.0016517141,0.035635542,0.0010021038,0.000578783,0.009843732,0.004232535,0.1671391,0.3218673,0.05236136,0.013534274,0.38242427],"study_design_scores_gemma":[0.00031371505,0.0010032593,0.0057451604,0.000082816674,0.00042776144,0.002134453,0.00073354784,0.85845137,0.09369786,0.0064195925,0.030784944,0.000205536],"about_ca_topic_score_codex":0.002662804,"about_ca_topic_score_gemma":0.0014926915,"teacher_disagreement_score":0.002662804,"about_ca_system_score_codex":0.000627848,"about_ca_system_score_gemma":0.0008190719,"threshold_uncertainty_score":0.0077127814},"labels":[],"label_agreement":null},{"id":"W1992774945","doi":"10.1109/lcn.2014.6925753","title":"Caching-assisted access for vehicular resources","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network","score_opus":0.02795992919473557,"score_gpt":0.2630396838480337,"score_spread":0.23507975465329817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992774945","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.17450102,0.0057264627,0.8049638,0.0005170355,0.00024608057,0.00020679929,0.0003326323,0.003551177,0.009954978],"genre_scores_gemma":[0.96153134,0.000602376,0.034116462,0.00006709503,0.00003636879,0.00004104869,0.00018069951,0.00004299274,0.003381583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994418,0.00012445202,0.000036317844,0.00009056014,0.00014853057,0.0001583108],"domain_scores_gemma":[0.9983929,0.00040841018,0.00012684987,0.0005351,0.0004262009,0.00011051347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043796666,0.00056135806,0.00081110885,0.00067167974,0.00077549857,0.0011778657,0.0016841593,0.00074653246,0.0013880499],"category_scores_gemma":[0.0023497338,0.0002710551,0.00026816843,0.0012312451,0.00042599888,0.001683647,0.0013427435,0.00046762038,0.00038130773],"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.0011748758,0.00025318272,0.006052147,0.00054662226,0.00021972657,0.0015951375,0.00060349685,0.25254807,0.09162239,0.08781678,0.025009016,0.53255856],"study_design_scores_gemma":[0.00004371013,0.0001554711,0.0009970558,0.000029117336,0.00008397056,0.0006025421,0.0002031517,0.94448936,0.02075237,0.014767584,0.017815603,0.000060068996],"about_ca_topic_score_codex":0.011903923,"about_ca_topic_score_gemma":0.015156009,"teacher_disagreement_score":0.011903923,"about_ca_system_score_codex":0.0010801222,"about_ca_system_score_gemma":0.0013194173,"threshold_uncertainty_score":0.023669243},"labels":[],"label_agreement":null},{"id":"W1993803168","doi":"10.1109/snpd.2010.28","title":"Web Object Prefetching: Approaches and a New Algorithm","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Categorization; The Internet; Object (grammar); Web application; Algorithm; Data mining; Theoretical computer science; Artificial intelligence; World Wide Web","score_opus":0.041091753771869355,"score_gpt":0.218315555043357,"score_spread":0.17722380127148765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993803168","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.0028279964,0.001461771,0.9934656,0.00029211995,0.00008669904,0.000022233391,0.000012434867,0.00034878356,0.0014823274],"genre_scores_gemma":[0.11937439,0.003180378,0.8689225,0.00039702322,0.00053656567,0.00016277462,0.00007892441,0.000134784,0.007212645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995332,0.00009435767,0.000041795676,0.00013141031,0.00016861997,0.000030643296],"domain_scores_gemma":[0.9993932,0.0002971205,0.000043025804,0.00008231703,0.00016066818,0.000023628167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007099413,0.0006732993,0.000828237,0.0008959118,0.00040951473,0.0011365408,0.001596286,0.001735983,0.0017704616],"category_scores_gemma":[0.0022651572,0.00047024852,0.0005498475,0.001190127,0.0008535075,0.0030157592,0.00094955676,0.0017890842,0.0008121317],"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.00017828133,0.0001285449,0.00073763647,0.00029113385,0.00008713233,0.00009766505,0.0002010628,0.2577384,0.011684157,0.09245332,0.0060923244,0.63031036],"study_design_scores_gemma":[0.000018343364,0.000050979885,0.00010887985,0.000017023733,0.000016988184,0.00007952279,0.000013199483,0.9744937,0.0019598422,0.019290965,0.0039331513,0.000017521998],"about_ca_topic_score_codex":0.0020733252,"about_ca_topic_score_gemma":0.0016868951,"teacher_disagreement_score":0.0020733252,"about_ca_system_score_codex":0.0007399822,"about_ca_system_score_gemma":0.00046442548,"threshold_uncertainty_score":0.0059227943},"labels":[],"label_agreement":null},{"id":"W1995597621","doi":"10.1145/2038916.2038918","title":"Small-world datacenters","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":132,"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":"National Science Foundation","keywords":"Computer science; Network topology; Computer network; Network packet; Distributed computing; Bandwidth (computing); Routing (electronic design automation); Topology (electrical circuits); Engineering","score_opus":0.1161572178649228,"score_gpt":0.21429927926209907,"score_spread":0.09814206139717628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995597621","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.18864627,0.0012400273,0.77892286,0.0010747405,0.0003756839,0.0003491572,0.0003950041,0.0016600124,0.02733619],"genre_scores_gemma":[0.85684776,0.0006935999,0.13271996,0.000302469,0.00009814235,0.00025920567,0.00043730662,0.00012044163,0.008521201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996612,0.000081939674,0.000019296434,0.00009954095,0.00007714048,0.000060947415],"domain_scores_gemma":[0.9989931,0.0002193495,0.00010678757,0.00029842285,0.00019405971,0.00018818135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057273,0.0003183156,0.0004017774,0.00044634406,0.0009615765,0.0016668481,0.0011467153,0.0004677601,0.0036982954],"category_scores_gemma":[0.001509213,0.00021176376,0.00029099194,0.0005412166,0.00091969816,0.0023219073,0.0013238764,0.00056776765,0.0007667935],"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.0005870824,0.00025144752,0.0050015426,0.00044984548,0.00012609415,0.0005573925,0.0005354123,0.15110017,0.02651415,0.6724374,0.019375002,0.1230644],"study_design_scores_gemma":[0.00025887837,0.00065429497,0.0024197283,0.000089779656,0.000109899775,0.0009665647,0.00085533696,0.4642391,0.027225371,0.31359744,0.18950066,0.000082955994],"about_ca_topic_score_codex":0.00065475906,"about_ca_topic_score_gemma":0.0007750135,"teacher_disagreement_score":0.0036982954,"about_ca_system_score_codex":0.00075859844,"about_ca_system_score_gemma":0.0005577519,"threshold_uncertainty_score":0.012372017},"labels":[],"label_agreement":null},{"id":"W1995673582","doi":"10.1109/tnet.2014.2320723","title":"Hierarchical Cache Performance Analysis Under TTL-Based Consistency","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","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 Calgary","funders":"","keywords":"Computer science; Cache; Latency (audio); Consistency (knowledge bases); Cache coherence; Protocol (science); Consistency model; Computer network; Hierarchy; Operating system; Data consistency; Parallel computing; CPU cache; Real-time computing; Cache algorithms; Telecommunications","score_opus":0.027594597186736704,"score_gpt":0.23484559831767923,"score_spread":0.20725100113094252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995673582","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.45102417,0.0014646583,0.5364411,0.00057182566,0.00006364394,0.000111919006,0.0003537777,0.0014007185,0.008568233],"genre_scores_gemma":[0.99093807,0.00017216035,0.007925168,0.00006302215,0.000034771958,0.00003783322,0.00007876004,0.000039912768,0.0007103417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975164,0.00040197794,0.000110436034,0.00031123738,0.0011617362,0.0004980983],"domain_scores_gemma":[0.9920264,0.0032867722,0.0014347867,0.0012109285,0.0017559417,0.00028516006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023960595,0.00055711303,0.00073168223,0.0011452705,0.00065345113,0.0010727701,0.0016031999,0.00078566297,0.0010236679],"category_scores_gemma":[0.014202656,0.00029575403,0.00043641718,0.0015186671,0.001093333,0.0028480685,0.0011962326,0.0009998088,0.00030220317],"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.00029275435,0.0001136456,0.009110314,0.00014509347,0.000056231027,0.00029877166,0.00030303167,0.8930847,0.01696059,0.05491721,0.0013974097,0.023320187],"study_design_scores_gemma":[0.0000062969425,0.00004078215,0.0008028625,0.000004077501,0.0000096710755,0.000047794252,0.000022198661,0.9942834,0.0014519901,0.003103043,0.0002179794,0.000009892113],"about_ca_topic_score_codex":0.0082674725,"about_ca_topic_score_gemma":0.002925082,"teacher_disagreement_score":0.0082674725,"about_ca_system_score_codex":0.0022633688,"about_ca_system_score_gemma":0.0018136477,"threshold_uncertainty_score":0.016438663},"labels":[],"label_agreement":null},{"id":"W1996941300","doi":"10.1109/icnp.2012.6459975","title":"Towards the optimal caching strategies of peer-assisted VoD systems with HD channels","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Victoria","funders":"","keywords":"Computer science; FIFO (computing and electronics); Popularity; Computer network; Variety (cybernetics); The Internet; Peer-to-peer; Distributed computing; World Wide Web; Artificial intelligence","score_opus":0.0403894913252572,"score_gpt":0.24471160635237793,"score_spread":0.20432211502712072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996941300","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.1149918,0.00070058473,0.8778655,0.00054377445,0.000029030427,0.00011155958,0.00010209106,0.00013778593,0.005517867],"genre_scores_gemma":[0.96218944,0.00044842908,0.034942716,0.00008086913,0.00002235927,0.00008840633,0.00003683869,0.000026064115,0.0021648011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.00021386983,0.000016028645,0.00006771249,0.00010997449,0.00010432492],"domain_scores_gemma":[0.9985587,0.0007846836,0.00022659055,0.00008031666,0.00024721443,0.00010240194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010895234,0.000698754,0.0008794256,0.0006577289,0.000569506,0.0015145895,0.001372023,0.001024423,0.0010641655],"category_scores_gemma":[0.0041266247,0.00068377174,0.00041117336,0.00045290092,0.0009614139,0.0018196832,0.0009889115,0.0008159769,0.00016636176],"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.000028016488,0.000027929495,0.00049407827,0.000030216528,0.000014908492,0.000049556595,0.00007209664,0.95425516,0.0014735078,0.039764497,0.00039107347,0.00339912],"study_design_scores_gemma":[0.0000037179457,0.000005755656,0.000052302265,0.0000026283997,0.0000023482423,0.0000058964306,0.000018478673,0.99475443,0.000115377334,0.004897737,0.0001382239,0.0000030993992],"about_ca_topic_score_codex":0.009378018,"about_ca_topic_score_gemma":0.005776959,"teacher_disagreement_score":0.009378018,"about_ca_system_score_codex":0.0025777908,"about_ca_system_score_gemma":0.0014716577,"threshold_uncertainty_score":0.018703282},"labels":[],"label_agreement":null},{"id":"W1997167079","doi":"10.1016/j.is.2010.08.007","title":"Building a peer-to-peer content distribution network with high performance, scalability and robustness","year":2010,"lang":"en","type":"article","venue":"Information Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Robustness (evolution); Gossip protocol; Computer network; Server; Distributed computing; Locality; Peer-to-peer; Content distribution; Routing protocol; Load balancing (electrical power); Gossip; Routing (electronic design automation); Database","score_opus":0.01253043178690378,"score_gpt":0.20485683220262468,"score_spread":0.1923264004157209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997167079","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.102919795,0.0003459633,0.88760966,0.0007069831,0.00011053413,0.0003404733,0.000086077824,0.0038062844,0.0040741917],"genre_scores_gemma":[0.5125649,0.000312502,0.48220712,0.000143757,0.000117278694,0.00025826375,0.0002280733,0.00019175948,0.00397644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992219,0.00018489976,0.00004817381,0.00016261019,0.00029634943,0.00008610561],"domain_scores_gemma":[0.99811673,0.00061733025,0.000121842786,0.0003762655,0.000522007,0.00024587044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151087,0.00055930245,0.0011490871,0.0007278014,0.0015536736,0.0011965664,0.0022039632,0.0015805697,0.0013898555],"category_scores_gemma":[0.0033313658,0.0005652792,0.00040544604,0.00084227824,0.000776421,0.002609877,0.0019328246,0.0009382653,0.0009251551],"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.00056378206,0.00078270695,0.005031737,0.0005878608,0.00019572715,0.001267894,0.0006203223,0.57861644,0.14084242,0.038034692,0.011899243,0.22155719],"study_design_scores_gemma":[0.00006453468,0.00018534684,0.0004431808,0.000012974034,0.000049597482,0.00028723374,0.00009031688,0.9631565,0.019789027,0.01037286,0.0055215973,0.00002684478],"about_ca_topic_score_codex":0.0023577197,"about_ca_topic_score_gemma":0.002420269,"teacher_disagreement_score":0.0023577197,"about_ca_system_score_codex":0.0007557912,"about_ca_system_score_gemma":0.0011382787,"threshold_uncertainty_score":0.006087601},"labels":[],"label_agreement":null},{"id":"W1997274385","doi":"10.1145/1143549.1143689","title":"SLPManet","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Service discovery; Computer science; Computer network; Latency (audio); Mobile ad hoc network; Protocol (science); Distributed computing; Service (business); Bandwidth (computing); Wireless ad hoc network; Web service; World Wide Web; Wireless; Operating system; Telecommunications","score_opus":0.004667715765035898,"score_gpt":0.1644566972916813,"score_spread":0.15978898152664542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997274385","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05251487,0.0022484427,0.29844734,0.0024784913,0.0015104649,0.0013551281,0.024301035,0.22183295,0.3953113],"genre_scores_gemma":[0.38304612,0.002145442,0.22650161,0.002199313,0.00026135612,0.0017151689,0.079780184,0.014307264,0.29004353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993326,0.000109676716,0.000036700192,0.00010315543,0.0003227611,0.000095096686],"domain_scores_gemma":[0.9991757,0.00015674897,0.000047255267,0.0002847972,0.00025035086,0.00008499145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005288276,0.00059004,0.0004851979,0.00067499315,0.00054689957,0.001354877,0.0016716485,0.0009707234,0.04662553],"category_scores_gemma":[0.0021628672,0.00035529886,0.00037248727,0.00071743573,0.00030125875,0.0018624965,0.0012952023,0.001167336,0.020577645],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0015311074,0.00037163758,0.002444158,0.00081421796,0.00009455832,0.0005992312,0.00023013627,0.020468412,0.029856868,0.050543148,0.51464045,0.37840608],"study_design_scores_gemma":[0.000346709,0.0003507514,0.0010310032,0.000084450265,0.000038467162,0.0007410954,0.000048611837,0.11785411,0.029191691,0.016786339,0.8334614,0.00006539236],"about_ca_topic_score_codex":0.0015987523,"about_ca_topic_score_gemma":0.0015512782,"teacher_disagreement_score":0.04662553,"about_ca_system_score_codex":0.0005999351,"about_ca_system_score_gemma":0.0010419615,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1997932713","doi":"10.1109/tnet.2012.2227338","title":"Estimating Instantaneous Cache Hit Ratio Using Markov Chain Analysis","year":2012,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; FIFO (computing and electronics); Cache algorithms; Cache invalidation; Smart Cache; CPU cache; Cache coloring; Markov chain; Cache pollution; FIFO and LIFO accounting; Parallel computing; Algorithm; Operating system","score_opus":0.04008999090234793,"score_gpt":0.2645258474085417,"score_spread":0.22443585650619374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997932713","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.10073347,0.00036970543,0.89601815,0.00011690336,0.000022027307,0.000085499276,0.00025676866,0.0008401948,0.001557334],"genre_scores_gemma":[0.9155977,0.0006021526,0.08205648,0.000060649836,0.000041109535,0.0001761682,0.00056116836,0.0000693354,0.0008352172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986518,0.00044597106,0.000081824706,0.0002542138,0.00037171168,0.0001945292],"domain_scores_gemma":[0.9885944,0.0086070625,0.0009992239,0.00070824585,0.00091497315,0.00017600787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029002246,0.0008278121,0.0011100185,0.0020242706,0.000468523,0.0012316639,0.0013441279,0.0010867486,0.0011221204],"category_scores_gemma":[0.016031222,0.0006468118,0.00070956117,0.0015136653,0.0007171435,0.0026357071,0.00075919984,0.0010983779,0.0004015614],"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.00011345987,0.000059600945,0.008448909,0.0000547205,0.000058776383,0.00012632424,0.00006264081,0.9528158,0.0024698297,0.015903972,0.00055417616,0.019331787],"study_design_scores_gemma":[0.0000027552485,0.000008895883,0.00036106686,0.0000033132487,0.00000554061,0.000021475229,0.000004164775,0.9969273,0.00036936929,0.0022122266,0.0000768726,0.000006989188],"about_ca_topic_score_codex":0.0095395325,"about_ca_topic_score_gemma":0.004413016,"teacher_disagreement_score":0.0095395325,"about_ca_system_score_codex":0.0015471316,"about_ca_system_score_gemma":0.0012117674,"threshold_uncertainty_score":0.018968046},"labels":[],"label_agreement":null},{"id":"W1999921654","doi":"10.1109/ccece.2012.6334892","title":"An energy-efficiency assessment of Content Centric Networking (CCN)","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Content centric networking; Computer science; Energy consumption; Provisioning; Scalability; Computer network; Information-centric networking; Efficient energy use; Networking hardware; Active networking; Network topology; Distributed computing; Cache; Operating system","score_opus":0.04338549722786862,"score_gpt":0.2693379180344252,"score_spread":0.2259524208065566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999921654","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.9132192,0.001097408,0.06260622,0.00022677006,0.000038831466,0.00015189931,0.0003802591,0.00013517575,0.022144128],"genre_scores_gemma":[0.9929496,0.0001943524,0.0055775377,0.000022290531,0.0000044409962,0.000032522566,0.00013941896,0.000021221307,0.0010585806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9996239,0.00009136577,0.000015510472,0.000045022894,0.00016757812,0.000056644447],"domain_scores_gemma":[0.9988513,0.000705178,0.00008097703,0.00011392213,0.0002242508,0.00002442224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007620622,0.00044133622,0.00040144083,0.0006405181,0.0002639838,0.00042762165,0.0005719237,0.0005805035,0.0011491325],"category_scores_gemma":[0.0017533145,0.00013449194,0.0002763478,0.0010026887,0.00033897944,0.000835027,0.0002838276,0.00027204904,0.00015354746],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048899284,0.00023811024,0.01136259,0.00021109183,0.000085721316,0.00027967527,0.00008674112,0.87895036,0.048407752,0.010940084,0.0010133185,0.04793554],"study_design_scores_gemma":[0.000017132092,0.0006128715,0.010540618,0.000020190157,0.000036553723,0.00026040006,0.000091516486,0.9394568,0.043296166,0.0027757816,0.0028719765,0.000020045229],"about_ca_topic_score_codex":0.0016714656,"about_ca_topic_score_gemma":0.0018587082,"teacher_disagreement_score":0.0016714656,"about_ca_system_score_codex":0.00080951134,"about_ca_system_score_gemma":0.00025871856,"threshold_uncertainty_score":0.005873382},"labels":[],"label_agreement":null},{"id":"W2001149961","doi":"10.1145/2071396.2071401","title":"Exploring interest correlation for peer-to-peer socialized video sharing","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Peer-to-peer; Upload; Workload; Shared resource; File sharing; The Internet; Live streaming; Video quality; Scheduling (production processes); Overlay; Multimedia; Computer network; World Wide Web","score_opus":0.19977123222542179,"score_gpt":0.3402001185884402,"score_spread":0.1404288863630184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001149961","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.3067618,0.00047804526,0.687029,0.00035418782,0.000028653612,0.00015829618,0.00005753835,0.0008124921,0.004319875],"genre_scores_gemma":[0.956842,0.00009846953,0.04224806,0.000024487312,0.000019493815,0.00003685012,0.00002514511,0.000023717941,0.0006817956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998626,0.0005814529,0.000041886808,0.00021172261,0.000389416,0.00014958916],"domain_scores_gemma":[0.99695206,0.0017640269,0.00024252365,0.00042655494,0.00034230616,0.00027249157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018388081,0.0004038117,0.00073307846,0.00054973434,0.001047902,0.0009874123,0.0017741565,0.0007647134,0.0010182163],"category_scores_gemma":[0.0062875715,0.00038041963,0.00031000463,0.00062024756,0.0008344973,0.0025003762,0.001961796,0.00070826506,0.00018273876],"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.0008928543,0.0008150988,0.009805241,0.00028991228,0.00021389476,0.0013460905,0.0024152447,0.5847327,0.07689954,0.11625995,0.0035067715,0.2028226],"study_design_scores_gemma":[0.000020904135,0.00014375405,0.00081744406,0.000004188026,0.000024144849,0.00015643421,0.00018714888,0.97467685,0.0053191236,0.016985603,0.0016438104,0.000020532801],"about_ca_topic_score_codex":0.002596454,"about_ca_topic_score_gemma":0.002254878,"teacher_disagreement_score":0.002596454,"about_ca_system_score_codex":0.0010787032,"about_ca_system_score_gemma":0.00090128655,"threshold_uncertainty_score":0.009724617},"labels":[],"label_agreement":null},{"id":"W2003347881","doi":"10.1016/j.comcom.2014.05.010","title":"Femtocaching in video content delivery: Assignment of video clips to serve dynamic mobile users","year":2014,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Femtocell; Popularity; Video tracking; Computer network; Cache; CLIPS; Wireless network; Multimedia; Wireless; Video processing; Artificial intelligence; Base station; Telecommunications","score_opus":0.04177133278151858,"score_gpt":0.26930755080577007,"score_spread":0.2275362180242515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003347881","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.16770178,0.0017800282,0.8208014,0.00057543704,0.0002506753,0.0002343862,0.00015631129,0.0003414747,0.008158554],"genre_scores_gemma":[0.93002236,0.00088592013,0.064183496,0.00012144962,0.00018614507,0.00006557629,0.00010120802,0.000041871517,0.0043920167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992519,0.0002629097,0.00002187629,0.00017990802,0.00011636812,0.00016701742],"domain_scores_gemma":[0.9985055,0.0007992031,0.00010943242,0.00017467915,0.00028033566,0.00013097719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680517,0.00079134636,0.0012923871,0.00064561446,0.0012390298,0.00096504256,0.0013488503,0.00095862424,0.0018620135],"category_scores_gemma":[0.003154432,0.00044375475,0.00025633274,0.0022220132,0.00091876724,0.0011617795,0.0008812341,0.0006493024,0.00030717795],"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.0017986834,0.00091338006,0.0097201755,0.0004431289,0.0001715881,0.00096747925,0.0006007685,0.37583065,0.057716493,0.062248077,0.012614154,0.47697544],"study_design_scores_gemma":[0.00002526162,0.00022737951,0.0014252637,0.000015138776,0.0000531939,0.0004553894,0.00018050059,0.97898495,0.006151578,0.010229376,0.0022272572,0.000024709096],"about_ca_topic_score_codex":0.007766957,"about_ca_topic_score_gemma":0.009526286,"teacher_disagreement_score":0.007766957,"about_ca_system_score_codex":0.0011216919,"about_ca_system_score_gemma":0.00088295416,"threshold_uncertainty_score":0.015443504},"labels":[],"label_agreement":null},{"id":"W2004029829","doi":"10.1016/j.comnet.2014.09.017","title":"An energy-efficient distributed in-network caching scheme for green content-centric networks","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Distributed computing; Content centric networking; Router; Scheme (mathematics); Energy consumption; Computer network; The Internet; Efficient energy use; Nash equilibrium; Convergence (economics); Cache; Mathematical optimization","score_opus":0.017011090724601288,"score_gpt":0.21258665877453414,"score_spread":0.19557556804993287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004029829","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.15404966,0.0009767573,0.8348648,0.0005835505,0.00038883448,0.0002285147,0.00025277078,0.0023584375,0.006296662],"genre_scores_gemma":[0.9261165,0.00021101027,0.07000219,0.0001509418,0.00006322736,0.000047870468,0.00014156646,0.00005912601,0.0032075013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953914,0.00009576475,0.000025587815,0.00007965372,0.00015267769,0.00010716239],"domain_scores_gemma":[0.9988249,0.00024080412,0.00008223531,0.00028058587,0.00045001047,0.000121496516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063798693,0.0006689433,0.0014688987,0.0006958403,0.0013274135,0.001079521,0.0023105335,0.0008247089,0.0016483166],"category_scores_gemma":[0.0014527722,0.00026057742,0.00030835718,0.0011204717,0.0005064418,0.0012147478,0.0013071346,0.00059425476,0.0003338512],"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.0025012717,0.001380386,0.0037953972,0.0003701335,0.0002698797,0.0007237214,0.00040333284,0.40605944,0.16125639,0.04491981,0.024745274,0.353575],"study_design_scores_gemma":[0.000035638346,0.00009071474,0.00029472663,0.0000056257477,0.00003885603,0.00012802995,0.00003606594,0.9858683,0.008455979,0.003656329,0.0013680683,0.000021762671],"about_ca_topic_score_codex":0.0038901952,"about_ca_topic_score_gemma":0.010282986,"teacher_disagreement_score":0.0038901952,"about_ca_system_score_codex":0.0016462143,"about_ca_system_score_gemma":0.0015286541,"threshold_uncertainty_score":0.011944234},"labels":[],"label_agreement":null},{"id":"W2006522513","doi":"10.1145/2019643.2019646","title":"Characterizing Organizational Use of Web-Based Services","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on the Web","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"","keywords":"Computer science; World Wide Web; Web service; Web application security; Web modeling; Web standards; Web 2.0; Web development; Social web; Database transaction; Web analytics; Service provider; Data Web; Social Semantic Web; Service (business); Data science; Social media; Database; Business","score_opus":0.043670119643372224,"score_gpt":0.2061611586768266,"score_spread":0.16249103903345438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006522513","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.9972114,0.000051019782,0.00093293015,0.000059151247,0.000001201519,0.000008837797,0.00037294684,0.000018758337,0.0013438397],"genre_scores_gemma":[0.99862385,0.000039872797,0.0006398375,0.000007654315,0.0000040284694,0.000007959941,0.00049610366,0.000007317114,0.0001732858],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99920374,0.00022898012,0.00006858877,0.00014032799,0.00024004624,0.000118337186],"domain_scores_gemma":[0.9902625,0.003942607,0.0024822778,0.00085767306,0.0018305822,0.0006242514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089815666,0.00017112812,0.00020710853,0.0035532555,0.00041908983,0.0011203769,0.0005216828,0.00045383399,0.00044540392],"category_scores_gemma":[0.007578607,0.0001324277,0.00013326324,0.0031667782,0.00039286728,0.0011729235,0.00055986724,0.00037871354,0.00021214492],"study_design_candidate":"observational","study_design_consensus":"observational","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.000087707704,0.00021668113,0.95826983,0.000048348833,0.00008349747,0.00018274767,0.0019625453,0.0076179253,0.005006644,0.0028317524,0.00070242723,0.022989951],"study_design_scores_gemma":[0.000007095067,0.00015142126,0.91051286,0.000030131425,0.00003323142,0.00031963523,0.0045391354,0.076132,0.0036883187,0.0019485824,0.0026053076,0.000032294316],"about_ca_topic_score_codex":0.009141968,"about_ca_topic_score_gemma":0.011479631,"teacher_disagreement_score":0.009141968,"about_ca_system_score_codex":0.00083885144,"about_ca_system_score_gemma":0.00038293493,"threshold_uncertainty_score":0.01817751},"labels":[],"label_agreement":null},{"id":"W2008185810","doi":"10.1145/1383422.1383443","title":"StoreGPU","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":90,"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 British Columbia","funders":"Nvidia","keywords":"Computer science","score_opus":0.026006877377967207,"score_gpt":0.18943145505159917,"score_spread":0.16342457767363197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008185810","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04758878,0.005170294,0.41344422,0.0013075412,0.0010373831,0.000980791,0.010874699,0.43283826,0.08675801],"genre_scores_gemma":[0.33097595,0.003869894,0.4865183,0.0022184285,0.00034922705,0.0029147142,0.042129125,0.04911959,0.081904694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993156,0.00009674157,0.000035945894,0.00012544077,0.00029990688,0.00012631495],"domain_scores_gemma":[0.999246,0.00017571378,0.000041009433,0.0002412735,0.00018765418,0.00010848263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809978,0.0013843213,0.0013495917,0.00090180925,0.0010112561,0.002768516,0.004360487,0.0015366779,0.03483044],"category_scores_gemma":[0.002477959,0.0011142333,0.0011042514,0.0015149212,0.0007579889,0.0030578035,0.0030375218,0.0028421935,0.018838923],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.002579115,0.00047554678,0.005252002,0.0017299489,0.00051793497,0.00054619653,0.0009469245,0.026433991,0.019404696,0.05440087,0.49480587,0.3929069],"study_design_scores_gemma":[0.0010211827,0.0005144836,0.0021721076,0.00014994033,0.00019728238,0.00068508997,0.00024693293,0.26596576,0.057995167,0.04688192,0.62395805,0.00021213242],"about_ca_topic_score_codex":0.0038000604,"about_ca_topic_score_gemma":0.0035876113,"teacher_disagreement_score":0.03483044,"about_ca_system_score_codex":0.001143754,"about_ca_system_score_gemma":0.0016682103,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2008532558","doi":"10.1109/icc.2012.6364044","title":"Adaptive information content management and buffer caching design for robust real-time streaming over IP network","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Computer network; Survivability; Real-time computing; Network congestion; Transfer (computing); Data loss; Communication source; Distributed computing; Operating system; Network packet","score_opus":0.052032300246952615,"score_gpt":0.21810014554909382,"score_spread":0.1660678453021412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008532558","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.051310576,0.0007089903,0.94565153,0.00012357377,0.000057031135,0.00008146646,0.000030943243,0.000545956,0.0014900109],"genre_scores_gemma":[0.8850965,0.00032276672,0.11295878,0.00007593182,0.00003684068,0.00009687961,0.000047293004,0.000041726136,0.0013233536],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996525,0.000082404455,0.00003138815,0.00007993596,0.000105612016,0.00004820013],"domain_scores_gemma":[0.999483,0.000106574946,0.00009568115,0.000062907835,0.00021819014,0.00003371352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004495978,0.0004181829,0.0003618944,0.0004407079,0.00038346738,0.00084767677,0.001353528,0.00040283322,0.0006952212],"category_scores_gemma":[0.001048764,0.00021072869,0.00020955397,0.0003080366,0.00038027423,0.0009219666,0.00035460095,0.0003776282,0.00014744315],"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.000949745,0.00022918123,0.0025159533,0.0004028317,0.000164855,0.0005600968,0.000490346,0.32017976,0.41451564,0.044328883,0.003897199,0.21176556],"study_design_scores_gemma":[0.000042795953,0.0003948591,0.00044215142,0.000017524424,0.00009109981,0.00020841701,0.000045749362,0.92417854,0.06873528,0.0022728879,0.0035410204,0.00002979277],"about_ca_topic_score_codex":0.0022676394,"about_ca_topic_score_gemma":0.0021017273,"teacher_disagreement_score":0.0022676394,"about_ca_system_score_codex":0.0010560789,"about_ca_system_score_gemma":0.00070025853,"threshold_uncertainty_score":0.0076624155},"labels":[],"label_agreement":null},{"id":"W2009354338","doi":"10.1007/s12083-012-0168-0","title":"On the collaboration of different peer-to-peer traffic management schemas","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; BitTorrent; Scalability; Distributed computing; Computer network; Cache; Heuristic; Peer-to-peer; The Internet; Implementation; Internet traffic; World Wide Web","score_opus":0.020068551019963063,"score_gpt":0.25848583289943694,"score_spread":0.23841728187947386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009354338","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.045627367,0.00081625575,0.9429917,0.00072143425,0.00011904987,0.0003198362,0.0000725241,0.0007872053,0.00854458],"genre_scores_gemma":[0.5301725,0.0016723236,0.46186626,0.000289433,0.0001920706,0.00035361314,0.00040367697,0.00043105037,0.004618973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913858,0.0041779913,0.0005457069,0.00082210905,0.0025633092,0.00050522364],"domain_scores_gemma":[0.9686584,0.01926017,0.00081406435,0.00642889,0.00414534,0.0006931193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014215682,0.0007254242,0.0019550351,0.0016968014,0.002005175,0.005631248,0.0035635957,0.0025250895,0.0023313996],"category_scores_gemma":[0.039786905,0.0008490851,0.0008665621,0.002242914,0.0024574285,0.0095358165,0.0036947972,0.0020673226,0.0007085395],"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.0008725984,0.00041214874,0.0030971367,0.0003202154,0.00023167575,0.0004125414,0.0017745394,0.22553635,0.018565068,0.6192712,0.0042535746,0.12525293],"study_design_scores_gemma":[0.00007859822,0.00016547475,0.00042871878,0.00005975241,0.00010875057,0.00019970004,0.00028076262,0.82738304,0.008590655,0.15539733,0.0072497386,0.00005755707],"about_ca_topic_score_codex":0.0023044255,"about_ca_topic_score_gemma":0.0019815455,"teacher_disagreement_score":0.014215682,"about_ca_system_score_codex":0.001732289,"about_ca_system_score_gemma":0.002281521,"threshold_uncertainty_score":0.07518059},"labels":[],"label_agreement":null},{"id":"W2010132638","doi":"10.1109/ifipnetworking.2014.6857121","title":"pWeb: A personal interface to the world wide web","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; World Wide Web; Web service; The Internet; Scalability; Directory service; User interface; Android (operating system); Directory; Database","score_opus":0.013022300283403013,"score_gpt":0.2276838969710787,"score_spread":0.21466159668767568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010132638","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010654581,0.0006493782,0.34626985,0.0006946371,0.00027605312,0.0013188159,0.015758144,0.56598294,0.05839566],"genre_scores_gemma":[0.21465187,0.0025374263,0.33613005,0.0033958645,0.00053454615,0.0060564713,0.071548656,0.10582384,0.2593213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960345,0.00006717691,0.000034058732,0.000061115825,0.00016746671,0.000066720655],"domain_scores_gemma":[0.99900824,0.00033514906,0.00006235782,0.00027667667,0.00014785898,0.00016967319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009462563,0.0009599297,0.0006331043,0.0011928595,0.00038921484,0.0015405847,0.0012934819,0.0013065614,0.07503305],"category_scores_gemma":[0.0033272032,0.00061970315,0.00034309307,0.0010959655,0.00025216772,0.0037131822,0.0031402986,0.001593174,0.04754918],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0011818131,0.00043596132,0.0019735948,0.00074318855,0.00008424457,0.00075558317,0.00066533434,0.0012888081,0.023377655,0.0126859825,0.58453166,0.37227625],"study_design_scores_gemma":[0.00038113986,0.00017920042,0.0050927396,0.00014797936,0.000036336707,0.0007957634,0.00014059004,0.021611799,0.0146417385,0.016648656,0.94019365,0.00013034658],"about_ca_topic_score_codex":0.00069872866,"about_ca_topic_score_gemma":0.0010477519,"teacher_disagreement_score":0.07503305,"about_ca_system_score_codex":0.00020092867,"about_ca_system_score_gemma":0.00044084934,"threshold_uncertainty_score":0.25101054},"labels":[],"label_agreement":null},{"id":"W2011543627","doi":"10.1109/glocom.2011.6134330","title":"Collaborative Caching for Video Streaming among Selfish Wireless Service Providers","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Computer science; Computer network; Cache; Server; Provisioning; Wireless; Service provider; Wireless network; Quality of experience; Quality of service; Service (business); Telecommunications; Business","score_opus":0.01869743796066764,"score_gpt":0.2156087982772644,"score_spread":0.19691136031659676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011543627","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.26412958,0.0007971932,0.72933793,0.0006045134,0.000053061565,0.00016489181,0.000042998563,0.00023115703,0.004638613],"genre_scores_gemma":[0.9768927,0.00015259783,0.02189591,0.00003549957,0.000017366074,0.000053429736,0.00001598168,0.000012026409,0.0009245091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985416,0.0007612889,0.000063691135,0.00016624978,0.00029075803,0.00017638292],"domain_scores_gemma":[0.99447894,0.0036665113,0.00058672094,0.00052058237,0.00048205312,0.0002652191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033041947,0.00048418582,0.00093677576,0.00067810353,0.00090787525,0.0013732421,0.001812689,0.0012065592,0.0008818099],"category_scores_gemma":[0.008731304,0.00047171544,0.0006611472,0.00076084316,0.00093440374,0.0017152644,0.0011567296,0.0006021423,0.00014143427],"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.00037614704,0.0002098057,0.0022539874,0.0001481079,0.00013558404,0.000572619,0.00036074905,0.8383002,0.0072750053,0.11731181,0.0013433282,0.031712566],"study_design_scores_gemma":[0.000029331317,0.00004119514,0.00014260513,0.0000033728552,0.000016837279,0.000047787104,0.000021531285,0.98753244,0.00039260197,0.011487509,0.0002782172,0.0000064981314],"about_ca_topic_score_codex":0.0029893152,"about_ca_topic_score_gemma":0.0038248962,"teacher_disagreement_score":0.0033041947,"about_ca_system_score_codex":0.0014592911,"about_ca_system_score_gemma":0.0011453442,"threshold_uncertainty_score":0.017474473},"labels":[],"label_agreement":null},{"id":"W2012493153","doi":"10.1109/tnet.2014.2354262","title":"Measurement Study of Netflix, Hulu, and a Tale of Three CDNs","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Defense Threat Reduction Agency; National Science Foundation","keywords":"Computer science; Cloud computing; Service provider; Content delivery network; Bandwidth (computing); Key (lock); Quality of service; Content delivery; Video streaming; Computer network; Service (business); Multimedia; World Wide Web; Server; Computer security; Operating system","score_opus":0.04813788733683651,"score_gpt":0.23413764308448615,"score_spread":0.18599975574764965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012493153","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.9910546,0.00007813164,0.0045335563,0.00016181458,0.000013118216,0.0000909016,0.0003318197,0.0003911257,0.0033450036],"genre_scores_gemma":[0.9967907,0.000029038205,0.0023943994,0.000037073652,0.000005010368,0.00002960907,0.00035836032,0.0000082808065,0.00034754764],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987864,0.00023954974,0.0000702072,0.00026573482,0.00044052713,0.00019753556],"domain_scores_gemma":[0.9968562,0.0008579098,0.0003793099,0.0002956915,0.0012443119,0.0003665772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452616,0.00055236096,0.00027078053,0.0013554629,0.00071864313,0.00078127376,0.0009435302,0.00055923633,0.0004983463],"category_scores_gemma":[0.00444183,0.00015824854,0.00012483011,0.0015053428,0.0004895747,0.0016967569,0.000646142,0.0008004565,0.00016472723],"study_design_candidate":"observational","study_design_consensus":"observational","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.0021017555,0.002234908,0.5021325,0.0004394284,0.00029726778,0.0020571402,0.0039473386,0.08275134,0.10495696,0.013670954,0.013033347,0.27237704],"study_design_scores_gemma":[0.00011635247,0.001851346,0.43023938,0.0000734596,0.00014108354,0.001119556,0.0033978685,0.484324,0.065890476,0.0015903536,0.011114002,0.00014211347],"about_ca_topic_score_codex":0.022610335,"about_ca_topic_score_gemma":0.01501948,"teacher_disagreement_score":0.022610335,"about_ca_system_score_codex":0.0023156847,"about_ca_system_score_gemma":0.00060413964,"threshold_uncertainty_score":0.04495746},"labels":[],"label_agreement":null},{"id":"W2018431495","doi":"10.1145/1921206.1921210","title":"Characterizing the file hosting service ecosystem","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Calgary","funders":"","keywords":"Upload; Computer science; The Internet; World Wide Web; Service (business); File sharing; Quality of service; Computer network; Business","score_opus":0.01285497849918911,"score_gpt":0.19754887212530645,"score_spread":0.18469389362611732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018431495","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.9864059,0.00014840488,0.01035839,0.00021372482,0.0000045757365,0.000078106015,0.0010845838,0.00016846076,0.001537802],"genre_scores_gemma":[0.98852646,0.00013227892,0.009052443,0.00003322073,0.000012698637,0.00006439797,0.0019883,0.000016673428,0.00017360464],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998139,0.00042698826,0.00018071476,0.00039012657,0.00043045045,0.0004326659],"domain_scores_gemma":[0.9918283,0.0021982794,0.0018502093,0.0012136745,0.0021286395,0.00078089995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021700005,0.0004957748,0.00061554636,0.0045298915,0.0010950331,0.00247107,0.00071000867,0.0013093151,0.0003812463],"category_scores_gemma":[0.009478878,0.00031288087,0.00040957428,0.0041576335,0.0008109709,0.006169883,0.002061201,0.0007570588,0.00018980732],"study_design_candidate":"observational","study_design_consensus":"observational","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.00030526627,0.00038997928,0.85347277,0.00015181312,0.0001532186,0.00044747477,0.00090267305,0.050304096,0.027631445,0.013771559,0.0016817689,0.050787956],"study_design_scores_gemma":[0.00001669522,0.00029631198,0.44770846,0.000039295577,0.000074138276,0.0012501128,0.0015874716,0.5204901,0.011173123,0.012608328,0.004655087,0.00010093427],"about_ca_topic_score_codex":0.0059472625,"about_ca_topic_score_gemma":0.0045741485,"teacher_disagreement_score":0.0059472625,"about_ca_system_score_codex":0.0017975175,"about_ca_system_score_gemma":0.0010317153,"threshold_uncertainty_score":0.0130419135},"labels":[],"label_agreement":null},{"id":"W2019395521","doi":"10.1145/1404880.1404885","title":"Equipment allocation in video-on-demand network deployments","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Server; Computer science; Data striping; Software deployment; Video on demand; Computer network; Resource allocation; Operating system","score_opus":0.038189825905627625,"score_gpt":0.27615409562337595,"score_spread":0.2379642697177483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019395521","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.4187738,0.00042192003,0.5731307,0.00035144505,0.000033072527,0.0002472373,0.00021950707,0.0005652438,0.0062570227],"genre_scores_gemma":[0.94533074,0.00009955519,0.05340843,0.00003189826,0.000006003946,0.00006155056,0.00011657388,0.00004826683,0.0008969834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845946,0.0007264323,0.000056032102,0.0002030108,0.00023802982,0.00031704383],"domain_scores_gemma":[0.99751115,0.0015669159,0.00027007743,0.00024864287,0.0002520916,0.00015111604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001701265,0.000652286,0.0008999321,0.00065780064,0.00051104155,0.00095350575,0.0015315309,0.0009070116,0.0013967209],"category_scores_gemma":[0.006685912,0.0007449481,0.00030963778,0.0009668786,0.00053569477,0.0014090644,0.000915377,0.00044138022,0.00021433055],"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.00009672451,0.000049789745,0.0014950014,0.00005260455,0.0000126024415,0.000121561425,0.000054154294,0.965195,0.0035217153,0.0061104754,0.0007256206,0.022564765],"study_design_scores_gemma":[0.000007763402,0.00005256025,0.0008727892,0.000004681455,0.000006678075,0.00006137472,0.000064872496,0.9949456,0.0013407038,0.0022302344,0.00040572346,0.0000071066456],"about_ca_topic_score_codex":0.0044609597,"about_ca_topic_score_gemma":0.004845368,"teacher_disagreement_score":0.0044609597,"about_ca_system_score_codex":0.0018951776,"about_ca_system_score_gemma":0.0005669481,"threshold_uncertainty_score":0.0137504935},"labels":[],"label_agreement":null},{"id":"W2020110631","doi":"10.1145/1254882.1254916","title":"Building high accuracy bloom filters using partitioned hashing","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Bloom filter; Hash function; Computer science; False positive paradox; Probabilistic logic; Network packet; Bit array; Set (abstract data type); Filter (signal processing); Algorithm; Artificial intelligence; Computer network; Computer security","score_opus":0.03399805375754046,"score_gpt":0.2805886564246253,"score_spread":0.24659060266708488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020110631","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.032274596,0.0002751256,0.962415,0.00014924494,0.000042786472,0.00017871174,0.000203018,0.0028383292,0.0016231801],"genre_scores_gemma":[0.27155167,0.00023898226,0.72397923,0.00018034753,0.00005273046,0.00022049739,0.00050180114,0.0001281011,0.0031465814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629766,0.00080861605,0.00037536313,0.00046230154,0.0016789768,0.00037714865],"domain_scores_gemma":[0.98530394,0.0056318743,0.0011137772,0.0047492934,0.0029056375,0.0002955112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038363428,0.0006657303,0.0013460476,0.002051995,0.0011825496,0.0024631477,0.0017042104,0.0013216818,0.00246233],"category_scores_gemma":[0.016084481,0.0008015533,0.00061421137,0.0019619397,0.00089750096,0.0050755227,0.0026344978,0.00093166967,0.0017767578],"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.0011408852,0.0002533863,0.009108021,0.00035064452,0.00018876101,0.00027759143,0.00087363063,0.12018845,0.08538575,0.05929431,0.0075495006,0.71538895],"study_design_scores_gemma":[0.0001703545,0.00037158132,0.0014569983,0.000057794387,0.000078216755,0.00055892253,0.00023275307,0.7746493,0.16272111,0.043780394,0.015812421,0.00011004715],"about_ca_topic_score_codex":0.0031480885,"about_ca_topic_score_gemma":0.0034473243,"teacher_disagreement_score":0.0038363428,"about_ca_system_score_codex":0.0018873763,"about_ca_system_score_gemma":0.0018631084,"threshold_uncertainty_score":0.020288765},"labels":[],"label_agreement":null},{"id":"W2020540160","doi":"10.1109/itc.2014.6932940","title":"Improving routing scalability in networks with dynamic substrates","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Static routing; Computer science; Dynamic Source Routing; Equal-cost multi-path routing; Computer network; Link-state routing protocol; Policy-based routing; Multipath routing; Distributed computing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Routing protocol","score_opus":0.004586766153007482,"score_gpt":0.18537328713290038,"score_spread":0.1807865209798929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020540160","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.41027388,0.003004069,0.5744899,0.0010968209,0.00018856079,0.00014899057,0.00016922658,0.0021122128,0.008516448],"genre_scores_gemma":[0.9145077,0.00097371236,0.08277882,0.000106341904,0.00006112418,0.000072914925,0.00017005141,0.00007855838,0.0012507349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954385,0.00017487415,0.000030332922,0.000079338635,0.000105445164,0.00006610399],"domain_scores_gemma":[0.9967589,0.0019999624,0.00026548665,0.0005879822,0.00028765554,0.00010006237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013040339,0.0007856195,0.0007824703,0.00079130003,0.00074436335,0.0011888206,0.0010105593,0.0007922608,0.0011011405],"category_scores_gemma":[0.005957357,0.0003270242,0.00028714575,0.0011638585,0.00076799607,0.003322341,0.0014704318,0.0006631896,0.00025258257],"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.00023665371,0.00014035385,0.0026782006,0.00022368348,0.00007457812,0.0005491842,0.00031683082,0.78995895,0.042211827,0.040538542,0.0038660506,0.11920516],"study_design_scores_gemma":[0.00002363095,0.00017357939,0.0004984922,0.000018244606,0.000029829904,0.00021369309,0.00013745252,0.97435737,0.0061740396,0.01577977,0.0025763563,0.000017511395],"about_ca_topic_score_codex":0.0015699952,"about_ca_topic_score_gemma":0.0015058159,"teacher_disagreement_score":0.0015699952,"about_ca_system_score_codex":0.00064277096,"about_ca_system_score_gemma":0.000423078,"threshold_uncertainty_score":0.006896436},"labels":[],"label_agreement":null},{"id":"W2020789881","doi":"10.1109/bigdata.2013.6691768","title":"Index-based join operations in Hive","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Join (topology); Computer science; Index (typography); Database; Computer graphics (images); World Wide Web; Mathematics","score_opus":0.01293356204079269,"score_gpt":0.20675901652431902,"score_spread":0.19382545448352634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020789881","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.016350659,0.000448684,0.9693559,0.00026650075,0.0001075374,0.0003317198,0.00049935456,0.0076366207,0.0050030863],"genre_scores_gemma":[0.19074285,0.0003708498,0.7988721,0.00044734194,0.00013408119,0.00045665356,0.0013802802,0.0014672717,0.0061284597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976872,0.00033414585,0.00031621422,0.0004192407,0.0010174001,0.00022583516],"domain_scores_gemma":[0.996509,0.0011654075,0.00021026556,0.0015493537,0.00043823916,0.00012771215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029088806,0.00058902154,0.0009438535,0.0008391252,0.0009760946,0.0030127773,0.0029866078,0.0010418503,0.004427516],"category_scores_gemma":[0.00627423,0.0006906442,0.0008540518,0.0015749069,0.0014187868,0.0043727807,0.0032669802,0.001683272,0.0013393092],"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.0018096758,0.0009792027,0.007642733,0.0010996608,0.0002609162,0.0007770192,0.0013754065,0.06825064,0.115870446,0.2365305,0.040710002,0.5246939],"study_design_scores_gemma":[0.00047802302,0.0008551005,0.0022429833,0.00011227684,0.00013011515,0.0014744331,0.00044320672,0.55974495,0.15886973,0.13311288,0.14228652,0.00024978287],"about_ca_topic_score_codex":0.0012927874,"about_ca_topic_score_gemma":0.0015066089,"teacher_disagreement_score":0.004427516,"about_ca_system_score_codex":0.0005971871,"about_ca_system_score_gemma":0.0009964391,"threshold_uncertainty_score":0.01538384},"labels":[],"label_agreement":null},{"id":"W2021137601","doi":"10.1007/s11042-009-0309-5","title":"Workload generation for YouTube","year":2009,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"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; Workload; Scalability; Web application; Multimedia; World Wide Web; Database; Operating system","score_opus":0.04621426707385622,"score_gpt":0.26480209884621647,"score_spread":0.21858783177236024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021137601","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.9401615,0.00044317823,0.03705265,0.00062925555,0.00024288401,0.000334924,0.0049413308,0.005514051,0.010680244],"genre_scores_gemma":[0.97622025,0.000087184264,0.014694223,0.00005964663,0.00003103863,0.00011648933,0.0052480428,0.00028831634,0.0032547545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992342,0.00020018259,0.00004615133,0.00013132305,0.00023371265,0.00015444134],"domain_scores_gemma":[0.9979565,0.00080067536,0.000057038782,0.0002269055,0.0007369526,0.00022196484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084361405,0.0006627953,0.0005273364,0.0011413525,0.0008723397,0.0008003119,0.00083047856,0.00057198066,0.0042741317],"category_scores_gemma":[0.0052311663,0.00024137796,0.00030904438,0.0012113145,0.00021373444,0.0007376405,0.00047857818,0.0003148213,0.0006787938],"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.00791855,0.0013268671,0.053230535,0.00063404423,0.00028424023,0.0022956226,0.0014267132,0.40494406,0.058347955,0.013095141,0.11367505,0.3428212],"study_design_scores_gemma":[0.00007670786,0.00010882668,0.005128113,0.000007104381,0.000017430677,0.00009510653,0.00021704283,0.9828871,0.0067988993,0.001988523,0.0026572235,0.000018026796],"about_ca_topic_score_codex":0.03393374,"about_ca_topic_score_gemma":0.034650475,"teacher_disagreement_score":0.03393374,"about_ca_system_score_codex":0.0014603309,"about_ca_system_score_gemma":0.0012533225,"threshold_uncertainty_score":0.0674724},"labels":[],"label_agreement":null},{"id":"W2021997415","doi":"10.1109/mascot.2008.4770587","title":"Filtering Effects of Media Merging in a Cache Hierarchy","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Multicast; Hierarchy; Computer network; Bandwidth (computing); Cache algorithms; Wireless; Distributed computing; CPU cache; Telecommunications","score_opus":0.014901556271207494,"score_gpt":0.198116083320366,"score_spread":0.18321452704915853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021997415","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.95587957,0.00026075615,0.041931037,0.0000729516,0.000009530735,0.000034405093,0.000028113016,0.00018883485,0.0015947801],"genre_scores_gemma":[0.99543864,0.000056270383,0.0042425646,0.000013083125,0.000005587752,0.0000052357636,0.000017205992,0.000007945305,0.00021345011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992518,0.00020817114,0.00004297875,0.000075881864,0.00023683444,0.00018438073],"domain_scores_gemma":[0.9945157,0.003820313,0.0007227434,0.00026603678,0.00048263257,0.00019256088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011307332,0.0004090727,0.0006283584,0.0007139569,0.0007490901,0.0008616889,0.0004948607,0.0007653554,0.0004889279],"category_scores_gemma":[0.0055492856,0.0003062682,0.0004700605,0.0006183627,0.0006900155,0.0014344219,0.0005114097,0.00039171975,0.000069286885],"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.00095918565,0.00032123318,0.016557729,0.00011271834,0.00010973112,0.00068090373,0.0006186979,0.79146194,0.14441405,0.010130599,0.0002962535,0.034336846],"study_design_scores_gemma":[0.000026636755,0.00023780693,0.0044139335,0.000007741779,0.000058938294,0.00013893237,0.000073997835,0.96431166,0.028826704,0.001647085,0.00022983385,0.000026741061],"about_ca_topic_score_codex":0.006826127,"about_ca_topic_score_gemma":0.0041649723,"teacher_disagreement_score":0.006826127,"about_ca_system_score_codex":0.0012563888,"about_ca_system_score_gemma":0.00060808606,"threshold_uncertainty_score":0.013572812},"labels":[],"label_agreement":null},{"id":"W2022260971","doi":"10.1145/2642668.2642680","title":"Cooperative caching in P2P manet","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"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; Software deployment; Computer network; Mobile ad hoc network; Overlay network; Cache; Node (physics); Abstraction; Overlay; Simple (philosophy); Distributed computing; The Internet; World Wide Web","score_opus":0.008346154570318285,"score_gpt":0.20320234648759758,"score_spread":0.1948561919172793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022260971","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.15619187,0.008271731,0.8193621,0.0014471111,0.00022538162,0.00028755,0.00015436336,0.0015950514,0.012464871],"genre_scores_gemma":[0.9462316,0.0017081283,0.048646834,0.00011482259,0.0000887403,0.0001021224,0.00005478859,0.00003239798,0.0030204447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925977,0.0002672574,0.000037249796,0.00012773,0.00022046287,0.00008748607],"domain_scores_gemma":[0.9986278,0.0006678365,0.0001313856,0.00023868648,0.00025599462,0.000078374214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009615898,0.0004158738,0.00074911944,0.0005763068,0.0011738082,0.0011877952,0.0012469318,0.0010199901,0.00067047385],"category_scores_gemma":[0.0020771974,0.00037100096,0.00026765704,0.0014360271,0.0007099427,0.001631176,0.0007689338,0.00056459586,0.00018989459],"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.0004426723,0.00024080715,0.0047698673,0.00059319654,0.00020531159,0.0022647437,0.00062073715,0.6728882,0.031746723,0.12224865,0.010306008,0.15367304],"study_design_scores_gemma":[0.00002044189,0.00011535331,0.0004607029,0.000015440639,0.000046181933,0.00052632997,0.00010326821,0.97096866,0.0032974822,0.018132271,0.0062848506,0.000028979346],"about_ca_topic_score_codex":0.0073123043,"about_ca_topic_score_gemma":0.0074608903,"teacher_disagreement_score":0.0073123043,"about_ca_system_score_codex":0.00076272915,"about_ca_system_score_gemma":0.00093149795,"threshold_uncertainty_score":0.01453948},"labels":[],"label_agreement":null},{"id":"W2024633838","doi":"10.1109/itc.2014.6932964","title":"Energy efficiency and traffic offloading in WLANs with caching and mesh capabilities","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Computer science; Wireless mesh network; Computer network; Efficient energy use; Quality of service; Integer programming; Linear programming; Mesh networking; Energy (signal processing); Wireless network; Service (business); Wireless; Telecommunications; Algorithm","score_opus":0.00546105396697843,"score_gpt":0.17480014184252604,"score_spread":0.1693390878755476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024633838","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.59002036,0.0021462964,0.3894592,0.00082797656,0.00006042288,0.000070441834,0.00010634056,0.00009835288,0.017210629],"genre_scores_gemma":[0.9918825,0.0004061144,0.005144733,0.000030437703,0.000026792508,0.000018557532,0.000017858656,0.000015893245,0.002457135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940753,0.00022681041,0.000015632002,0.000070260714,0.00009776294,0.00018199024],"domain_scores_gemma":[0.99895275,0.0007632355,0.0001225776,0.00003813798,0.000084635714,0.000038697945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007009375,0.0005377352,0.00061679963,0.0005502968,0.000436151,0.0013308129,0.00060363056,0.00089898676,0.0010133963],"category_scores_gemma":[0.0023329929,0.00035481027,0.00043747597,0.0009140766,0.0009439803,0.0017685621,0.00068936154,0.00047603872,0.000118669326],"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.00015159055,0.00012770806,0.0028292297,0.000117609445,0.00004688932,0.00044926684,0.00008645174,0.91482174,0.013174405,0.05717814,0.00034945036,0.010667539],"study_design_scores_gemma":[0.000007128186,0.00005969012,0.0008894137,0.0000066222424,0.00002054348,0.00008079046,0.00006302146,0.9901092,0.0013193863,0.007102811,0.00033493357,0.000006492349],"about_ca_topic_score_codex":0.003816444,"about_ca_topic_score_gemma":0.0035457823,"teacher_disagreement_score":0.003816444,"about_ca_system_score_codex":0.0013125389,"about_ca_system_score_gemma":0.00059481914,"threshold_uncertainty_score":0.009523153},"labels":[],"label_agreement":null},{"id":"W2025005414","doi":"10.1109/jsac.2014.140404","title":"Optimal Delivery of Rate-Adaptive Streams in Underprovisioned Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dynamic Adaptive Streaming over HTTP; Content delivery network; Computer network; Context (archaeology); Quality of experience; Internet traffic; The Internet; Population; Server; Distributed computing; Quality of service; World Wide Web","score_opus":0.026122356390072193,"score_gpt":0.2589571086519255,"score_spread":0.23283475226185332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025005414","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.49767065,0.0004849781,0.49655157,0.00049592485,0.00003355479,0.00013689198,0.00019376133,0.0004295623,0.004003119],"genre_scores_gemma":[0.9762299,0.00020408796,0.022111017,0.000054376836,0.000011655098,0.000049100086,0.000056372282,0.00002875011,0.0012547908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907327,0.00034917847,0.000032955988,0.0001912739,0.00015549154,0.00019767354],"domain_scores_gemma":[0.99784184,0.0015063124,0.00029604798,0.000069292975,0.00017409855,0.00011230168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012045577,0.00063591596,0.0011637765,0.0003902209,0.0005811418,0.0015714467,0.0010450985,0.000955706,0.0009368316],"category_scores_gemma":[0.0044062003,0.0006185389,0.00031237717,0.00062889734,0.0012467947,0.0012852533,0.0008420271,0.00087409205,0.000093232666],"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.0000686988,0.00003021247,0.00025186606,0.000018254132,0.0000058855835,0.000039655526,0.00003607187,0.99360657,0.0011809021,0.0021292027,0.00012509938,0.002507565],"study_design_scores_gemma":[0.000008701016,0.000018377186,0.000050203616,0.0000012048644,0.0000019709778,0.0000052741166,0.000014635677,0.9986965,0.00025299724,0.0008965999,0.000051727897,0.0000017904929],"about_ca_topic_score_codex":0.012385377,"about_ca_topic_score_gemma":0.006870412,"teacher_disagreement_score":0.012385377,"about_ca_system_score_codex":0.0025590544,"about_ca_system_score_gemma":0.001426285,"threshold_uncertainty_score":0.024626553},"labels":[],"label_agreement":null},{"id":"W2026206839","doi":"10.1016/j.peva.2004.07.009","title":"Time-domain analysis of Web cache filter effects","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Parallel computing","score_opus":0.017273337474898766,"score_gpt":0.2551807127017554,"score_spread":0.23790737522685665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026206839","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.64216584,0.0011737887,0.347017,0.00032043253,0.000077045406,0.000045213983,0.0002771838,0.0009989523,0.007924623],"genre_scores_gemma":[0.98032254,0.00035001722,0.01678936,0.000050228846,0.000029600813,0.00001582593,0.0001615816,0.00010807205,0.0021728827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.00007180873,0.000008415968,0.000033936998,0.00013036431,0.0000476032],"domain_scores_gemma":[0.9961389,0.0028349436,0.0001701676,0.00023984983,0.000547904,0.000068203655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248873,0.00036749602,0.00035683965,0.0005376252,0.00019902461,0.0005048631,0.00039274953,0.0004438501,0.0023903195],"category_scores_gemma":[0.0054588555,0.00013574686,0.00026354395,0.0007083447,0.00027240123,0.0006904635,0.00019935051,0.00055419037,0.00029467465],"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.0007711877,0.0002773362,0.0038036646,0.00020649775,0.00010330989,0.0002707247,0.000119840435,0.81599486,0.104505435,0.017251933,0.0018964187,0.05479881],"study_design_scores_gemma":[0.0000059849103,0.000028160403,0.0011154759,0.0000029057232,0.000012665391,0.00003938951,0.00001174244,0.98974824,0.008194485,0.00065234816,0.00018355431,0.0000050770705],"about_ca_topic_score_codex":0.0038888208,"about_ca_topic_score_gemma":0.002382348,"teacher_disagreement_score":0.0038888208,"about_ca_system_score_codex":0.0005904225,"about_ca_system_score_gemma":0.0005033725,"threshold_uncertainty_score":0.00799644},"labels":[],"label_agreement":null},{"id":"W2026907187","doi":"10.1155/2010/130137","title":"EXtending Mobility to Publish/Subscribe Systems Using a Pro-Active Caching Approach","year":2010,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Testbed; Computer science; Publication; Scheme (mathematics); Computer network; Mobility management; Mobility model; Distributed computing; Wireless; Mobile device; World Wide Web; Telecommunications","score_opus":0.025875056500692523,"score_gpt":0.25168964241186814,"score_spread":0.22581458591117562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026907187","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.05862315,0.0004389513,0.93215764,0.000963958,0.0001474525,0.0003880165,0.00005466738,0.0026015379,0.0046245833],"genre_scores_gemma":[0.7356344,0.0005721888,0.25844,0.00028759125,0.00027745552,0.00030942925,0.00011236997,0.00011554701,0.004251033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788576,0.0007481516,0.00027045782,0.0003255811,0.0006019484,0.00016804019],"domain_scores_gemma":[0.98885685,0.0036388952,0.00082198577,0.004589828,0.0014679705,0.0006244691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043243244,0.000597289,0.00091872824,0.0009441211,0.0016815356,0.0033083966,0.0032682521,0.001697055,0.0012852976],"category_scores_gemma":[0.01074855,0.00055471377,0.0009040466,0.0012749655,0.0012670953,0.004937374,0.002348118,0.0017333514,0.00051818613],"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.0007419543,0.0013216767,0.013163011,0.0006383487,0.00043938882,0.0018765215,0.0026667302,0.15320383,0.12411224,0.28088433,0.0075691533,0.41338283],"study_design_scores_gemma":[0.00022519923,0.0005886436,0.0013046794,0.0000451066,0.00025841658,0.0014557764,0.0003614938,0.85377914,0.03579767,0.06574256,0.040293865,0.00014742132],"about_ca_topic_score_codex":0.0026294996,"about_ca_topic_score_gemma":0.0020416928,"teacher_disagreement_score":0.0043243244,"about_ca_system_score_codex":0.0011388107,"about_ca_system_score_gemma":0.001696626,"threshold_uncertainty_score":0.022869527},"labels":[],"label_agreement":null},{"id":"W2028992447","doi":"10.1145/1582379.1582381","title":"A pro-active mobility management scheme for pub/sub systems using neighborhood graph","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Testbed; Mobility management; Computer network; Handover; Distributed computing; Graph; Overhead (engineering); Scheme (mathematics); Workload; Wireless; Theoretical computer science; Telecommunications","score_opus":0.03520728917691235,"score_gpt":0.25783904991271867,"score_spread":0.22263176073580632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028992447","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.06686109,0.000589833,0.92144597,0.0004292342,0.0001291658,0.00026469384,0.00013589984,0.004990792,0.0051533016],"genre_scores_gemma":[0.8094843,0.00032452663,0.18604736,0.000115475195,0.00010012032,0.00013694345,0.00028037376,0.00013545144,0.0033755118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952924,0.000106062354,0.000049788516,0.000089345325,0.00017239049,0.000053093598],"domain_scores_gemma":[0.99860173,0.00027869866,0.00016469417,0.00059004,0.00023318238,0.00013174703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007828007,0.00043592532,0.00055949175,0.0010725613,0.0012518526,0.00083015504,0.001748881,0.00046154734,0.00093113986],"category_scores_gemma":[0.0018341071,0.0002173313,0.00029082334,0.00077478937,0.0004934255,0.0020908196,0.0012828998,0.0006063354,0.00035370758],"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.0005730004,0.00045418806,0.005039147,0.00028117766,0.000111504574,0.0003563668,0.0008455026,0.102249965,0.077365205,0.09681828,0.011795278,0.7041104],"study_design_scores_gemma":[0.00009075806,0.00035847683,0.0020441217,0.00002462186,0.00012612098,0.00056004693,0.00023155774,0.919043,0.026418475,0.021145169,0.029857108,0.00010063587],"about_ca_topic_score_codex":0.0034473848,"about_ca_topic_score_gemma":0.005289323,"teacher_disagreement_score":0.0034473848,"about_ca_system_score_codex":0.00088024925,"about_ca_system_score_gemma":0.0008461049,"threshold_uncertainty_score":0.0068546534},"labels":[],"label_agreement":null},{"id":"W202905625","doi":"","title":"An Analytical Comparison of Distributed and Hierarchical Web-Caching Architectures.","year":2003,"lang":"en","type":"article","venue":"Computers and Their Applications","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Limiting; Distributed computing; False sharing; Hierarchical database model; Distributed database; Server; Cache; Computer network; CPU cache; Cache algorithms; Data mining","score_opus":0.018681280232659345,"score_gpt":0.2690829759286588,"score_spread":0.25040169569599946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W202905625","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.31983095,0.0067796432,0.62997526,0.0018991671,0.00046803613,0.00018559223,0.00043738328,0.0012386807,0.03918529],"genre_scores_gemma":[0.951262,0.000950206,0.044493448,0.00013938402,0.000070161244,0.00008368246,0.00014081226,0.00008176337,0.002778465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989749,0.00034878487,0.00003266109,0.00007978692,0.0004404477,0.0001234393],"domain_scores_gemma":[0.99260396,0.0048874887,0.0005072173,0.0006805765,0.0011812766,0.00013949156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002061213,0.00044218978,0.0004974327,0.0008143996,0.00036819544,0.00091783627,0.0008104012,0.00073994446,0.0023453895],"category_scores_gemma":[0.017400408,0.00021730561,0.00038566248,0.001297219,0.00041610023,0.0016059919,0.0005713211,0.0007400231,0.0004992328],"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.00036315355,0.00035912727,0.0044464837,0.00045250155,0.00013000291,0.00025375388,0.00036902985,0.74599963,0.018123796,0.148618,0.005727391,0.07515714],"study_design_scores_gemma":[0.000025558238,0.0001462951,0.0013802015,0.000029812467,0.000053123054,0.00018262592,0.00013916045,0.9701264,0.0042923545,0.019933661,0.0036697616,0.000021073234],"about_ca_topic_score_codex":0.002540891,"about_ca_topic_score_gemma":0.00269116,"teacher_disagreement_score":0.002540891,"about_ca_system_score_codex":0.0015091936,"about_ca_system_score_gemma":0.0012922647,"threshold_uncertainty_score":0.010949969},"labels":[],"label_agreement":null},{"id":"W2031230831","doi":"10.1016/j.procs.2013.06.036","title":"Bloom Filter Supporting Distributed Policy-Based Management in Wireless Sensor Networks","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Bloom filter; Wireless sensor network; Wireless; Computer network; Telecommunications; Distributed computing","score_opus":0.009695588339612165,"score_gpt":0.22855711934892467,"score_spread":0.2188615310093125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031230831","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.029892618,0.0005376159,0.96361125,0.0006184824,0.00007921574,0.00041110482,0.00019348213,0.0027817315,0.0018745537],"genre_scores_gemma":[0.5373622,0.00072940905,0.45564526,0.00044533765,0.00012793978,0.0007633352,0.0006681539,0.00012234056,0.0041359914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996899,0.0009058582,0.00049546646,0.00048284727,0.0009268484,0.00029005777],"domain_scores_gemma":[0.994027,0.0024788112,0.00070201105,0.001427288,0.0009875953,0.00037733177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004525879,0.00046232232,0.0011839534,0.001587742,0.002306988,0.00308383,0.0022583148,0.0014235087,0.0010704538],"category_scores_gemma":[0.0085777,0.00052217307,0.0005720676,0.0019233495,0.0011781675,0.0051211095,0.0024372486,0.0013467887,0.00037462325],"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.0016699226,0.0008310167,0.011685994,0.0005943507,0.0002510711,0.0009705984,0.002947649,0.14650014,0.058317635,0.2414482,0.012827829,0.52195567],"study_design_scores_gemma":[0.00013292962,0.00027703826,0.000995285,0.00008175728,0.000100811776,0.0003541367,0.0003354215,0.84938854,0.03822989,0.08722772,0.022766586,0.00010989806],"about_ca_topic_score_codex":0.0070133167,"about_ca_topic_score_gemma":0.005302853,"teacher_disagreement_score":0.0070133167,"about_ca_system_score_codex":0.0028053254,"about_ca_system_score_gemma":0.0046889186,"threshold_uncertainty_score":0.023935437},"labels":[],"label_agreement":null},{"id":"W2031427617","doi":"10.1109/icc.2012.6364736","title":"Green content distribution in Wireless Mesh Networks with infrastructure support","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"King Abdulaziz City for Science and Technology","keywords":"Computer science; Computer network; Wireless mesh network; Upload; Wireless network; Mesh networking; Cache; Distributed computing; Energy consumption; Wireless; World Wide Web; Telecommunications","score_opus":0.014257353340025489,"score_gpt":0.2039692412229387,"score_spread":0.1897118878829132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031427617","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.4256051,0.0010362378,0.563586,0.0011630685,0.00009820914,0.0001047135,0.00014684354,0.00024669414,0.008013029],"genre_scores_gemma":[0.9830856,0.00026826188,0.014533301,0.00003820674,0.000025882713,0.000031389307,0.00003460637,0.000023207642,0.0019595404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957293,0.00015830227,0.000011257264,0.00006400518,0.000094079995,0.00009942202],"domain_scores_gemma":[0.9988656,0.0007704197,0.00012615985,0.00006952473,0.00011460472,0.000053746484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806092,0.00044467446,0.000575189,0.00052823464,0.00058134174,0.00084101397,0.0012469485,0.0012774975,0.0010426105],"category_scores_gemma":[0.0031820436,0.00030687117,0.00038546327,0.00084232644,0.0009425253,0.0018469733,0.000788578,0.0003871444,0.00010882985],"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.00009191072,0.000046327918,0.0009328388,0.000050611703,0.000025505482,0.0002445442,0.000065354405,0.9606761,0.0028495651,0.026595872,0.0005952746,0.007826047],"study_design_scores_gemma":[0.00001071485,0.000022626797,0.00016624179,0.0000025345291,0.000006879106,0.000032835913,0.000027954115,0.9912005,0.00037630764,0.007808758,0.00034104032,0.0000036096344],"about_ca_topic_score_codex":0.0038850375,"about_ca_topic_score_gemma":0.002250639,"teacher_disagreement_score":0.0038850375,"about_ca_system_score_codex":0.0016552993,"about_ca_system_score_gemma":0.0004415517,"threshold_uncertainty_score":0.012010038},"labels":[],"label_agreement":null},{"id":"W2031971903","doi":"10.1109/itapp.2010.5566569","title":"A Visualization of All the IP Addresses That Host a Publicly Accessible Web Server","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Acadia University","funders":"","keywords":"Computer science; Web server; Server; Host (biology); World Wide Web; Visualization; Application server; Web page; Ip address; The Internet; Computer network; Data mining; Biology","score_opus":0.045550741988488054,"score_gpt":0.28756724060945493,"score_spread":0.24201649862096689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031971903","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.4510788,0.002857258,0.1866538,0.0072369957,0.0015604615,0.0005290404,0.16242327,0.057454184,0.1302063],"genre_scores_gemma":[0.7865228,0.0015153408,0.14167066,0.00046868474,0.000111873785,0.00022275,0.045791842,0.0022320838,0.021464022],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99978524,0.00004106962,0.000012846917,0.00003437974,0.000073534015,0.000052898893],"domain_scores_gemma":[0.99808013,0.00083689275,0.00011258547,0.0001938245,0.00060781103,0.00016878513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027840363,0.0009899875,0.0004575324,0.0032540916,0.0006553565,0.00093147886,0.00041402673,0.00063096674,0.017289706],"category_scores_gemma":[0.0013842969,0.00018660171,0.0004491484,0.0026547154,0.00031290954,0.0008942433,0.0007455596,0.0011273674,0.0018374397],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002734653,0.0015063357,0.05204792,0.005154796,0.00049508153,0.0030313977,0.0058575077,0.060309816,0.07193538,0.08195745,0.4311093,0.28386042],"study_design_scores_gemma":[0.00041584214,0.00076879904,0.14687547,0.001545974,0.00048429728,0.0026718557,0.0054847654,0.3267157,0.04868833,0.070456944,0.3955792,0.00031285707],"about_ca_topic_score_codex":0.011640743,"about_ca_topic_score_gemma":0.013994182,"teacher_disagreement_score":0.017289706,"about_ca_system_score_codex":0.0004244108,"about_ca_system_score_gemma":0.00068497483,"threshold_uncertainty_score":0.05783981},"labels":[],"label_agreement":null},{"id":"W2032952070","doi":"10.1145/1291233.1291409","title":"Improving the delivery of multimedia embedded in web pages","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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; World Wide Web; Latency (audio); Multimedia; Protocol (science); Web server; Content delivery; Computer network; Operating system; The Internet; Telecommunications","score_opus":0.01447984903577883,"score_gpt":0.2204342992456907,"score_spread":0.20595445020991185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032952070","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.7048851,0.005462968,0.2790417,0.00042137093,0.0001926645,0.00013231474,0.00015209262,0.0036824304,0.006029287],"genre_scores_gemma":[0.8996962,0.0024555519,0.08969514,0.0001307832,0.000120796074,0.000036577876,0.00028896282,0.00022731017,0.007348724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962723,0.000069220616,0.000027998667,0.00004875195,0.0001667187,0.000060029495],"domain_scores_gemma":[0.99859685,0.00049245526,0.00018912644,0.00017269775,0.0004849881,0.00006391152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003346839,0.0005557241,0.0004943779,0.00047573072,0.00037593677,0.00076776894,0.0006492383,0.0006645977,0.0015262854],"category_scores_gemma":[0.002613054,0.00020760913,0.00020029055,0.0005934567,0.00018449796,0.0012576166,0.00038715635,0.00046079585,0.0008861379],"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.0005634955,0.00078039715,0.004524816,0.0005034679,0.000053644064,0.00042536898,0.0002264858,0.036768194,0.63861096,0.0025185908,0.0022685882,0.31275594],"study_design_scores_gemma":[0.00005344309,0.0009991343,0.0053685866,0.0000379055,0.00020705842,0.0008499033,0.00016465633,0.31536022,0.66574097,0.0018446099,0.009342306,0.000031262392],"about_ca_topic_score_codex":0.002239329,"about_ca_topic_score_gemma":0.0017003047,"teacher_disagreement_score":0.002239329,"about_ca_system_score_codex":0.00043744472,"about_ca_system_score_gemma":0.00054944854,"threshold_uncertainty_score":0.0051059723},"labels":[],"label_agreement":null},{"id":"W203357814","doi":"","title":"Towards a Novel Architecture for Wide-Area Data Caching and Replication.","year":2000,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Manitoba","funders":"","keywords":"Computer science; Server; Replication (statistics); Latency (audio); Scalability; Load balancing (electrical power); Computer network; Architecture; Distributed computing; Operating system","score_opus":0.05890144344716357,"score_gpt":0.2741255241366758,"score_spread":0.2152240806895122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203357814","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.00889383,0.0012487062,0.98345655,0.00075649325,0.00021950314,0.0001905086,0.000045864865,0.0023441215,0.0028444866],"genre_scores_gemma":[0.14648114,0.0010483604,0.83901685,0.00047209323,0.00024970775,0.00036081305,0.00027485963,0.00021943603,0.011876739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.0002502912,0.00009175782,0.00022640733,0.0005246434,0.00012458634],"domain_scores_gemma":[0.9963387,0.000480601,0.00021810921,0.0011306325,0.0015663105,0.00026573337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027572815,0.0004264517,0.00081253034,0.00079080777,0.0013740375,0.0028514008,0.0043703527,0.0018235745,0.0015572491],"category_scores_gemma":[0.0033655379,0.00066364516,0.0007017095,0.0010940274,0.0014366857,0.0054531293,0.002679233,0.0021750086,0.0012050007],"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.00062288955,0.0005756693,0.004278462,0.0007466051,0.00035219738,0.0006185476,0.0013055155,0.066630214,0.10308388,0.3955545,0.029039824,0.3971918],"study_design_scores_gemma":[0.00014576245,0.00043638604,0.0009787582,0.00013490391,0.00021264126,0.00074306416,0.00024194598,0.7041934,0.041579444,0.11973201,0.13145489,0.00014681267],"about_ca_topic_score_codex":0.0043888865,"about_ca_topic_score_gemma":0.0059996443,"teacher_disagreement_score":0.0043888865,"about_ca_system_score_codex":0.0019392163,"about_ca_system_score_gemma":0.002506822,"threshold_uncertainty_score":0.0145820975},"labels":[],"label_agreement":null},{"id":"W2034377483","doi":"10.1145/1961659.1961662","title":"Characterizing Web-Based Video Sharing Workloads","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on the Web","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":102,"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 Saskatchewan","funders":"","keywords":"Upload; Computer science; Popularity; Set (abstract data type); Metadata; Workload; Cache; Relevance (law); World Wide Web; Video tracking; Multimedia; Information retrieval; Video processing; Artificial intelligence; Computer network","score_opus":0.05162702859918673,"score_gpt":0.22543494248527635,"score_spread":0.17380791388608963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034377483","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.996789,0.000060655977,0.0015736775,0.000034067423,0.0000056813756,0.000024873585,0.00097586185,0.000103015496,0.000433241],"genre_scores_gemma":[0.9966054,0.000041021147,0.00079017336,0.000012732006,0.000009636311,0.00001921922,0.0023741908,0.000017721793,0.00012993522],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99873286,0.00020757769,0.00014040641,0.00029700066,0.00039239772,0.00022972812],"domain_scores_gemma":[0.9944027,0.0019270268,0.0010032327,0.00069696805,0.0012563217,0.0007137705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010821156,0.00041696263,0.00042382395,0.0021102761,0.00037449988,0.00095806265,0.0006724429,0.00042866057,0.0003872108],"category_scores_gemma":[0.008498882,0.00020103253,0.00022850341,0.0021318449,0.000345125,0.0011960326,0.0007797111,0.00040778023,0.00022960654],"study_design_candidate":"observational","study_design_consensus":"observational","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.0010571934,0.0005767788,0.87582135,0.0002158667,0.00022546931,0.0005993902,0.0012936473,0.04063722,0.02893554,0.0014106052,0.0035793188,0.045647472],"study_design_scores_gemma":[0.000036895002,0.00053310837,0.60691506,0.000031613064,0.000054212444,0.0009906868,0.002296213,0.37392128,0.010414886,0.0022090059,0.0025411404,0.00005589504],"about_ca_topic_score_codex":0.0065869316,"about_ca_topic_score_gemma":0.0053383443,"teacher_disagreement_score":0.0065869316,"about_ca_system_score_codex":0.00064343476,"about_ca_system_score_gemma":0.0004624067,"threshold_uncertainty_score":0.013097227},"labels":[],"label_agreement":null},{"id":"W2034825809","doi":"10.1109/mwc.2014.6882294","title":"Toward green media delivery: location-aware opportunities and approaches","year":2014,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Context (archaeology); Cellular network; Adaptation (eye); Quality of experience; Location awareness; Key (lock); Wireless network; Resource (disambiguation); Quality (philosophy); Wireless; Mobile device; Multimedia; Computer network; Quality of service; Telecommunications; World Wide Web; Computer security","score_opus":0.1827551357681895,"score_gpt":0.2519290799867883,"score_spread":0.06917394421859882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034825809","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.007872514,0.022764312,0.9379377,0.006816691,0.00030317472,0.000064915825,0.00006642997,0.00043150884,0.023742797],"genre_scores_gemma":[0.47677168,0.051597577,0.45151728,0.0015804174,0.00092380744,0.00017787615,0.000156981,0.00019417648,0.017080188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944705,0.00016783395,0.000026024978,0.00010648994,0.00017779044,0.000074919815],"domain_scores_gemma":[0.9990095,0.00042857078,0.00009466696,0.0001587181,0.00023122568,0.000077186414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012514062,0.00087545277,0.00066618464,0.0010695359,0.0007443417,0.0031590085,0.002581803,0.0019895497,0.002020171],"category_scores_gemma":[0.0019529688,0.0005639414,0.00050668954,0.0011361506,0.0012827971,0.0055022924,0.0029416196,0.0018645303,0.00073319755],"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.0000832436,0.00021597267,0.0012790534,0.0005676236,0.00007673574,0.00028305146,0.00062840665,0.10281334,0.005988366,0.64876646,0.007556711,0.231741],"study_design_scores_gemma":[0.000023382025,0.00010897763,0.00053131446,0.00030884324,0.00007788428,0.00033859938,0.00084895745,0.5368876,0.0060240324,0.37247494,0.08229857,0.000076915414],"about_ca_topic_score_codex":0.0029145053,"about_ca_topic_score_gemma":0.0030894612,"teacher_disagreement_score":0.0031590085,"about_ca_system_score_codex":0.0019122608,"about_ca_system_score_gemma":0.0011895315,"threshold_uncertainty_score":0.013874531},"labels":[],"label_agreement":null},{"id":"W2036147040","doi":"10.1007/s12083-009-0054-6","title":"Popularity-aware prefetch in P2P range caching","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instruction prefetch; Computer science; Popularity; Range query (database); Query optimization; Range (aeronautics); Query expansion; Database; Information retrieval; Web search query; Web query classification; Distributed computing; Computer network; Search engine; Cache","score_opus":0.019190802447744515,"score_gpt":0.26918965072567247,"score_spread":0.24999884827792795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036147040","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.3435842,0.006645381,0.6353338,0.0013339052,0.0004125237,0.00019712232,0.0003657411,0.002600466,0.0095268395],"genre_scores_gemma":[0.9631826,0.0005363001,0.033250075,0.000061995284,0.00012834626,0.00004488224,0.00010942739,0.000070582275,0.0026156881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990676,0.00025683743,0.00005061743,0.000110765475,0.0003825243,0.00013169278],"domain_scores_gemma":[0.99637574,0.0021603473,0.00016733527,0.00050132,0.0006624177,0.00013277387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011983983,0.00040586694,0.0011822325,0.00090691523,0.0013732635,0.0011843899,0.0014655279,0.0009992989,0.0015005177],"category_scores_gemma":[0.0068066516,0.00061279227,0.00022184345,0.0020029948,0.00065075234,0.002400857,0.000932178,0.0007008688,0.00025702262],"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.0023996858,0.00048208243,0.01536617,0.00045485215,0.00014935229,0.0012135695,0.00061356666,0.56056815,0.033629168,0.08412652,0.019951358,0.2810454],"study_design_scores_gemma":[0.000034050412,0.00004962941,0.0005701645,0.000006524406,0.000026061933,0.00014484163,0.000058028025,0.9872794,0.0033542516,0.0076298523,0.00083175395,0.00001535437],"about_ca_topic_score_codex":0.0073621585,"about_ca_topic_score_gemma":0.015381126,"teacher_disagreement_score":0.0073621585,"about_ca_system_score_codex":0.0011666697,"about_ca_system_score_gemma":0.0011442058,"threshold_uncertainty_score":0.014638603},"labels":[],"label_agreement":null},{"id":"W2039590313","doi":"10.1145/2578260.2578278","title":"Understand Instant Video Clip Sharing on Mobile Platforms","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multimedia; Scalability; Cloud computing; Service (business); Mobile device; Exploit; Video tracking; CLIPS; Online video; World Wide Web; Video processing; Database; Computer security; Artificial intelligence; Operating system","score_opus":0.023336508810151396,"score_gpt":0.22793305909437817,"score_spread":0.20459655028422677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039590313","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.9481903,0.0013016078,0.02285525,0.002261189,0.000053120562,0.00013240009,0.0018555954,0.0002775581,0.023072949],"genre_scores_gemma":[0.992941,0.0005560992,0.0040045385,0.00009916925,0.00005047137,0.000028656756,0.00043856713,0.00003183293,0.001849765],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9997149,0.00006723228,0.000011167496,0.000071129034,0.00005620902,0.00007924127],"domain_scores_gemma":[0.9989825,0.00044889277,0.00017825418,0.00012455534,0.00016542294,0.000100341254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004061133,0.00029378542,0.00025969153,0.0009795233,0.0007263353,0.0019726867,0.00066409976,0.000736999,0.0017316386],"category_scores_gemma":[0.0029750112,0.00020602076,0.00019156915,0.0011241302,0.0005134069,0.0031363366,0.0007670168,0.00052774115,0.00045143368],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011194284,0.000579604,0.29526415,0.00096991524,0.00025636828,0.004166667,0.026355242,0.101310365,0.057552673,0.13417642,0.029652514,0.34859657],"study_design_scores_gemma":[0.00004336654,0.0003882304,0.23859672,0.0002083566,0.00010243009,0.0020184529,0.029858986,0.59757555,0.011319302,0.05464788,0.065078504,0.00016231164],"about_ca_topic_score_codex":0.018943653,"about_ca_topic_score_gemma":0.01522893,"teacher_disagreement_score":0.018943653,"about_ca_system_score_codex":0.0009567213,"about_ca_system_score_gemma":0.00032968502,"threshold_uncertainty_score":0.037666798},"labels":[],"label_agreement":null},{"id":"W2039996050","doi":"10.1109/passat/socialcom.2011.112","title":"Empirical Comparison of Information Spreading Algorithms in the Presence of 1-Whiskers","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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; Context (archaeology); Algorithm; Field (mathematics); Graph; Social media; Face (sociological concept); Artificial intelligence; Theoretical computer science; World Wide Web; Mathematics","score_opus":0.08432591231430388,"score_gpt":0.3054080728737437,"score_spread":0.22108216055943986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039996050","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.942188,0.0037179927,0.048641257,0.0006050088,0.00011501114,0.00017731918,0.00084410113,0.0008089371,0.002902352],"genre_scores_gemma":[0.9540748,0.0007465269,0.04215072,0.00006206861,0.00007092853,0.00014469102,0.0018455513,0.0001835323,0.0007211747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917006,0.0038167282,0.0007661853,0.0012379651,0.0017742623,0.0007042588],"domain_scores_gemma":[0.726837,0.23329158,0.008623766,0.018313149,0.010909855,0.002024686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014554819,0.0012717855,0.0013034305,0.0057816524,0.0014545878,0.001911339,0.0021624947,0.0023923304,0.0012833653],"category_scores_gemma":[0.12805188,0.00053048576,0.0008316907,0.0048202174,0.00185808,0.0047421088,0.0012648182,0.001706196,0.00061025895],"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.0024893018,0.0011158356,0.0986409,0.0013085725,0.0010490747,0.00039045172,0.00104101,0.7122886,0.009648698,0.018991191,0.007868128,0.14516827],"study_design_scores_gemma":[0.00014113002,0.00049916556,0.017988151,0.00007296509,0.00014728129,0.0008081204,0.00038278894,0.95715564,0.007792056,0.0131776305,0.0017453652,0.000089769914],"about_ca_topic_score_codex":0.0027922927,"about_ca_topic_score_gemma":0.0026235024,"teacher_disagreement_score":0.014554819,"about_ca_system_score_codex":0.0018203217,"about_ca_system_score_gemma":0.0012002633,"threshold_uncertainty_score":0.07697415},"labels":[],"label_agreement":null},{"id":"W2041161353","doi":"10.1145/2811587.2811616","title":"On the Design and Evaluation of Producer Mobility Management Schemes in Named Data Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Mobility management; Benchmarking; Computer network; Modular design; Overhead (engineering); Distributed computing; Business","score_opus":0.22976951618985414,"score_gpt":0.320307686396024,"score_spread":0.09053817020616989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041161353","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.54021615,0.0023897612,0.4419151,0.0010674975,0.0001263779,0.0009947428,0.00014893002,0.00086773274,0.012273699],"genre_scores_gemma":[0.9220352,0.0006011054,0.07627691,0.00007061981,0.000023865061,0.00012316831,0.00009398494,0.000045654928,0.00072954595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99498206,0.0030919418,0.00027614622,0.00031439378,0.0010300046,0.00030553134],"domain_scores_gemma":[0.98522794,0.009579652,0.0010385442,0.001314395,0.0024918441,0.0003475325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008763326,0.0007320947,0.000814962,0.001013686,0.00085538055,0.0017906927,0.0020048534,0.0009652329,0.0007833413],"category_scores_gemma":[0.023081757,0.00033957782,0.00037319993,0.00076715054,0.00090449763,0.003417552,0.0010247085,0.0006734854,0.00013610692],"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.0011931593,0.00075529923,0.01116983,0.00056511234,0.00015834319,0.00016590378,0.0004692368,0.80341303,0.022857744,0.0336191,0.0012490655,0.12438415],"study_design_scores_gemma":[0.00005224389,0.00066318025,0.0009909058,0.000033229015,0.00006958452,0.00007351027,0.00010395281,0.9832665,0.010649691,0.0024907154,0.0015824486,0.000024079527],"about_ca_topic_score_codex":0.0038743343,"about_ca_topic_score_gemma":0.0035897167,"teacher_disagreement_score":0.008763326,"about_ca_system_score_codex":0.0034571656,"about_ca_system_score_gemma":0.0015719944,"threshold_uncertainty_score":0.046345472},"labels":[],"label_agreement":null},{"id":"W2042316989","doi":"10.1145/1836001.1836009","title":"Towards understanding developing world traffic","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Division of Computer and Network Systems","keywords":"Computer science; Scope (computer science); Data science; Proxy (statistics); Developing country; Work (physics); World Wide Web; Engineering","score_opus":0.0626855021188603,"score_gpt":0.25561237568376105,"score_spread":0.19292687356490074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042316989","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.7903131,0.0037144504,0.120030046,0.004242563,0.00011458187,0.00017214363,0.008276788,0.0005297161,0.07260662],"genre_scores_gemma":[0.9427704,0.005566534,0.043784246,0.00037736856,0.00012819938,0.00018160832,0.0048801624,0.00018157023,0.0021299913],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99961853,0.00012033827,0.000026008054,0.000072498246,0.00007240565,0.00009022019],"domain_scores_gemma":[0.99813205,0.0006812172,0.0003878624,0.00018905877,0.0005020356,0.000107823376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076756225,0.0006479303,0.00036959807,0.0059589557,0.0007194507,0.003825799,0.0005338302,0.0008052779,0.0022073195],"category_scores_gemma":[0.0060593793,0.00033377192,0.00037626806,0.0074359,0.0006985249,0.006639584,0.0013548093,0.0015977102,0.00053996244],"study_design_candidate":"observational","study_design_consensus":"observational","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.00012978289,0.00023146474,0.5072194,0.0005305273,0.00015547842,0.0008391437,0.009722315,0.044105165,0.0064670793,0.22664069,0.011335591,0.19262336],"study_design_scores_gemma":[0.000019315004,0.00010745596,0.4434344,0.0006634704,0.00010977239,0.0011113465,0.02263959,0.18320085,0.0053697354,0.17656444,0.16662924,0.00015047411],"about_ca_topic_score_codex":0.02813692,"about_ca_topic_score_gemma":0.015603572,"teacher_disagreement_score":0.02813692,"about_ca_system_score_codex":0.0016109615,"about_ca_system_score_gemma":0.0009787304,"threshold_uncertainty_score":0.05594629},"labels":[],"label_agreement":null},{"id":"W2043961056","doi":"10.1145/1989240.1989254","title":"Load-balanced migration of social media to content clouds","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Social media; Computer science; Focus (optics); Dilemma; Bandwidth (computing); Social network (sociolinguistics); Cloud computing; Social media optimization; Content (measure theory); Data science; World Wide Web; Telecommunications","score_opus":0.06924942768444188,"score_gpt":0.2302992319565076,"score_spread":0.16104980427206572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043961056","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.80377793,0.0009971326,0.17255385,0.0021305387,0.0008942737,0.00062709686,0.00062426255,0.0033250786,0.015069864],"genre_scores_gemma":[0.97503304,0.00013585204,0.021354474,0.00012101971,0.000089358495,0.00006570178,0.00023697627,0.00016183527,0.0028016933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985611,0.0003310315,0.00007494262,0.0002518345,0.00026259944,0.00051844015],"domain_scores_gemma":[0.99584264,0.00072483113,0.00031543488,0.0011687655,0.0011592527,0.00078910746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017142182,0.0008493173,0.00091008074,0.0008332986,0.0024200317,0.002482926,0.002685365,0.00085464603,0.0026240167],"category_scores_gemma":[0.006186464,0.00043461684,0.00041621647,0.0011627404,0.0007996453,0.0025249165,0.0026977372,0.0008078415,0.0009596057],"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.004883239,0.0020231926,0.023989562,0.0004006177,0.00033626615,0.0013157708,0.0018231737,0.47932124,0.0824557,0.050338145,0.05043744,0.3026756],"study_design_scores_gemma":[0.000094354225,0.00014337513,0.002121862,0.000012483636,0.000044582535,0.000120827724,0.00069627236,0.9720428,0.009366538,0.009586085,0.0057429112,0.000027861919],"about_ca_topic_score_codex":0.0098981755,"about_ca_topic_score_gemma":0.008786577,"teacher_disagreement_score":0.0098981755,"about_ca_system_score_codex":0.002017819,"about_ca_system_score_gemma":0.002288267,"threshold_uncertainty_score":0.019681156},"labels":[],"label_agreement":null},{"id":"W2044181062","doi":"10.1109/cluster.2013.6702646","title":"On service migration in the cloud to facilitate mobile accesses","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Computer science; Server; Computer network; Service (business); Cloud computing; Service provider; Quality of service; Mobile QoS; Distributed computing; Operating system","score_opus":0.04074434303494183,"score_gpt":0.240628008919412,"score_spread":0.19988366588447015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044181062","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.147685,0.008139247,0.81930465,0.005653085,0.0005410613,0.00030465482,0.00010128933,0.0004999601,0.017771048],"genre_scores_gemma":[0.87228554,0.004487533,0.117520116,0.00046700268,0.00026420137,0.000106901454,0.00007440297,0.000072686635,0.0047215647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927086,0.00025271726,0.00003713298,0.000108379434,0.00016779122,0.0001630839],"domain_scores_gemma":[0.9989293,0.00056943414,0.00009479758,0.00013890253,0.00018861276,0.000078932244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008332894,0.0005855539,0.00059680897,0.00069346366,0.0010567538,0.0012069168,0.0010495057,0.0009806677,0.0012068804],"category_scores_gemma":[0.002795412,0.00021473863,0.00038951458,0.0013405611,0.0009445188,0.002242166,0.0008512853,0.0008129381,0.00035948877],"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.00043301497,0.00026021863,0.0037529203,0.0002919309,0.0000642271,0.00044186378,0.0003398344,0.59034246,0.015640711,0.13177462,0.010417067,0.24624105],"study_design_scores_gemma":[0.000018565168,0.00010879175,0.0005174993,0.000032106167,0.000018241677,0.00019534225,0.000115820694,0.9731425,0.0031972395,0.0154477,0.0071887453,0.00001742746],"about_ca_topic_score_codex":0.007713397,"about_ca_topic_score_gemma":0.0052765794,"teacher_disagreement_score":0.007713397,"about_ca_system_score_codex":0.0013595562,"about_ca_system_score_gemma":0.0013806742,"threshold_uncertainty_score":0.01533705},"labels":[],"label_agreement":null},{"id":"W2044432004","doi":"10.1109/p2p.2008.17","title":"Popularity-Aware Prefetch in P2P Range Caching","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instruction prefetch; Computer science; Popularity; Range query (database); Query optimization; Database; Range (aeronautics); Query expansion; Distributed database; Peer-to-peer; Web query classification; Distributed computing; Web search query; Information retrieval; Computer network; Search engine; Cache","score_opus":0.03388449682151805,"score_gpt":0.2212879695433985,"score_spread":0.18740347272188046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044432004","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.23235567,0.0047986363,0.750246,0.0011586611,0.00015748992,0.00026199917,0.00018730575,0.002459768,0.00837448],"genre_scores_gemma":[0.9393878,0.0007891483,0.056286875,0.000085147825,0.00010524646,0.00011091854,0.0000993079,0.00006838552,0.0030671188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989806,0.00030332847,0.000051741376,0.00011494575,0.00040152966,0.00014791088],"domain_scores_gemma":[0.9957008,0.0024624702,0.0002845186,0.0007230645,0.00070285925,0.0001263075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400888,0.00042952344,0.0009855927,0.00067789096,0.0012027846,0.00084175594,0.001501968,0.001046134,0.0010737951],"category_scores_gemma":[0.006288906,0.00048712202,0.0002244962,0.001765715,0.0008044365,0.0025409975,0.0010743589,0.0006105955,0.00030565067],"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.0012991336,0.00032233092,0.011355369,0.0005132622,0.00012056545,0.0024518583,0.0006390125,0.6244394,0.03998166,0.08689183,0.016223134,0.2157625],"study_design_scores_gemma":[0.000038261092,0.000068315385,0.0004977255,0.000008214441,0.000020470823,0.0002470938,0.00005305192,0.9837314,0.003868212,0.010047958,0.0013991023,0.000020108795],"about_ca_topic_score_codex":0.0067072203,"about_ca_topic_score_gemma":0.008989943,"teacher_disagreement_score":0.0067072203,"about_ca_system_score_codex":0.001125216,"about_ca_system_score_gemma":0.0011192658,"threshold_uncertainty_score":0.01333636},"labels":[],"label_agreement":null},{"id":"W2045280270","doi":"10.1145/2656346.2660856","title":"An enhanced security scheme for query state inference in EPCglobal discovery services","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Data mining; Probabilistic logic; Database transaction; Inference; Constant false alarm rate; State (computer science); Suite; Scheme (mathematics); Service discovery; Computer network; Information retrieval; Database; Algorithm; Web service; Artificial intelligence; World Wide Web","score_opus":0.008070491061076835,"score_gpt":0.25837851223460284,"score_spread":0.250308021173526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045280270","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.056971606,0.00023796478,0.9383706,0.0004130216,0.000044753764,0.00021320386,0.00018225009,0.0025132387,0.0010533165],"genre_scores_gemma":[0.90188354,0.00008362514,0.09637592,0.00019863405,0.000059367914,0.000111057605,0.0002470285,0.000041038682,0.0009999027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929529,0.0013238473,0.0007499855,0.0013140856,0.0027761152,0.0008830477],"domain_scores_gemma":[0.98643506,0.004623729,0.0018051394,0.004217777,0.00245331,0.00046496917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052275048,0.0007481014,0.0016150383,0.0021770545,0.0017130068,0.002396905,0.0031282876,0.001986024,0.0011095437],"category_scores_gemma":[0.016306898,0.00045120865,0.0010154442,0.0017977682,0.0017822923,0.004834482,0.004000005,0.002086856,0.000569528],"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.005480751,0.0009887556,0.023529978,0.00023845695,0.00039537912,0.0010942993,0.001211391,0.2672486,0.076674975,0.12570404,0.008449653,0.4889837],"study_design_scores_gemma":[0.000053203104,0.00010694434,0.0010871453,0.0000069939333,0.00003930958,0.00030031032,0.000033711563,0.9787315,0.008422793,0.0101609705,0.0010099749,0.000047164074],"about_ca_topic_score_codex":0.005711131,"about_ca_topic_score_gemma":0.003447971,"teacher_disagreement_score":0.005711131,"about_ca_system_score_codex":0.0028711804,"about_ca_system_score_gemma":0.0031844385,"threshold_uncertainty_score":0.027646005},"labels":[],"label_agreement":null},{"id":"W2045426578","doi":"10.1016/j.ipm.2009.12.005","title":"A3CRank: An adaptive ranking method based on connectivity, content and click-through data","year":2010,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Glasgow; Badan Riset dan Inovasi Nasional","keywords":"Ranking SVM; Computer science; Ranking (information retrieval); PageRank; Learning to rank; Aggregate (composite); Information retrieval; Data mining; Rank (graph theory); Machine learning; Web page; Artificial intelligence; Mathematics; World Wide Web","score_opus":0.0762809013681563,"score_gpt":0.3101881089765652,"score_spread":0.23390720760840888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045426578","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.025486663,0.00087647134,0.9168552,0.00021813186,0.0004297449,0.0004878437,0.004935032,0.04887185,0.0018390488],"genre_scores_gemma":[0.15356003,0.0003565472,0.8266383,0.00019297896,0.0003343612,0.0003954935,0.008901651,0.0018335212,0.007787117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677354,0.00072577165,0.00023294488,0.00059090304,0.0014471976,0.00022973093],"domain_scores_gemma":[0.99430263,0.0017369004,0.00028716956,0.0013033159,0.002023945,0.00034612644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025372065,0.0022519983,0.0025984047,0.008805348,0.0012311308,0.002256944,0.0032244073,0.0016960665,0.007962466],"category_scores_gemma":[0.009046231,0.00070904876,0.001471486,0.0058930325,0.0003982687,0.0025249813,0.0014140739,0.0012453496,0.005507451],"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.0013937321,0.0009863123,0.0075639994,0.0005027996,0.00058360817,0.0001558269,0.000076863274,0.019086309,0.015228106,0.002877398,0.06560443,0.8859407],"study_design_scores_gemma":[0.00034827652,0.00042481342,0.0040687295,0.000032271728,0.0002186558,0.00042584975,0.000053590655,0.9593412,0.011788314,0.0067547243,0.016354058,0.00018946412],"about_ca_topic_score_codex":0.0117764,"about_ca_topic_score_gemma":0.029232573,"teacher_disagreement_score":0.0117764,"about_ca_system_score_codex":0.00064360525,"about_ca_system_score_gemma":0.0023534086,"threshold_uncertainty_score":0.026637077},"labels":[],"label_agreement":null},{"id":"W2045652725","doi":"10.1007/s10472-013-9349-7","title":"A model for learning the news in social networks","year":2013,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Timestamp; Computer science; Set (abstract data type); Social network (sociolinguistics); Scheme (mathematics); Search engine indexing; Social media; Theoretical computer science; Information retrieval; World Wide Web; Mathematics; Computer security","score_opus":0.19949455705435598,"score_gpt":0.3370618862868441,"score_spread":0.1375673292324881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045652725","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.11679402,0.0018190561,0.857752,0.008543577,0.0002163511,0.00017396257,0.0028303668,0.00076787587,0.011102802],"genre_scores_gemma":[0.8684601,0.0023471755,0.09384616,0.0008266416,0.0005900725,0.0005086695,0.0018924893,0.00018479588,0.031343836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883324,0.0005245878,0.00006998027,0.00029584116,0.00012398639,0.00015243288],"domain_scores_gemma":[0.9837314,0.013629851,0.000805851,0.00062121183,0.00067951484,0.00053224247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002597048,0.0010878998,0.0022650429,0.0022903571,0.0011787399,0.0031467795,0.0035823889,0.005187995,0.009838009],"category_scores_gemma":[0.018411176,0.0010492941,0.0013545745,0.0029336223,0.0020845742,0.008689854,0.0016535833,0.0028719297,0.0013911512],"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.00026771904,0.00026080653,0.0030770593,0.00020806043,0.00014796996,0.00028239563,0.00046329643,0.53265077,0.0007193109,0.42595622,0.0074932654,0.028473172],"study_design_scores_gemma":[0.000051021176,0.000027047801,0.00017154968,0.000015729416,0.000027953829,0.000044169086,0.000029235582,0.85280776,0.000082180624,0.14585403,0.0008738602,0.000015362757],"about_ca_topic_score_codex":0.014426704,"about_ca_topic_score_gemma":0.012301151,"teacher_disagreement_score":0.014426704,"about_ca_system_score_codex":0.0026991693,"about_ca_system_score_gemma":0.0014279092,"threshold_uncertainty_score":0.03291142},"labels":[],"label_agreement":null},{"id":"W2045856572","doi":"10.1145/1878537.1878779","title":"Genetic algorithms","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Cache algorithms; Locality of reference; Page cache; Cache invalidation; Cache coloring; Smart Cache; Cache-oblivious algorithm; Locality; Cache pollution; Object (grammar); Algorithm; Distributed computing; Bandwidth (computing); CPU cache; Parallel computing; Operating system; Computer network; Artificial intelligence","score_opus":0.010284966746623162,"score_gpt":0.21121502611276446,"score_spread":0.2009300593661413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045856572","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.015697604,0.0017524165,0.92732376,0.0010989731,0.00032415547,0.000346751,0.000792586,0.0017657878,0.050897952],"genre_scores_gemma":[0.28106225,0.002076541,0.6772248,0.001014698,0.00017234596,0.0011492831,0.0026494476,0.00045128318,0.03419937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992725,0.00025564223,0.000041692274,0.00021389226,0.00012874644,0.00008746325],"domain_scores_gemma":[0.9986534,0.00084956223,0.00008473827,0.00012967509,0.00023691914,0.000045682755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785468,0.0017125502,0.0014381463,0.0016685353,0.0010458411,0.002226248,0.002276048,0.0021917338,0.01577828],"category_scores_gemma":[0.004412708,0.00055310724,0.001293357,0.0015484167,0.0008083216,0.0011910769,0.0012148034,0.0013967502,0.004110078],"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.00008409945,0.00016570189,0.0024638807,0.000279903,0.00017672009,0.00017544685,0.00013276582,0.66066605,0.0009951523,0.08842901,0.014647922,0.23178345],"study_design_scores_gemma":[0.000061483275,0.00006543125,0.00034267918,0.00007990166,0.000056100493,0.0001160793,0.000079966,0.90293163,0.0006305335,0.0716082,0.024002608,0.000025362335],"about_ca_topic_score_codex":0.0056760246,"about_ca_topic_score_gemma":0.005506498,"teacher_disagreement_score":0.01577828,"about_ca_system_score_codex":0.00128965,"about_ca_system_score_gemma":0.0018305175,"threshold_uncertainty_score":0.05278361},"labels":[],"label_agreement":null},{"id":"W2046968332","doi":"10.1109/bwcca.2012.47","title":"Characterizing Videos and Users in YouTube: A Survey","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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 Saskatchewan","funders":"","keywords":"Upload; World Wide Web; Computer science; The Internet; Publication; Web content; User-generated content; Publishing; Subject (documents); Web development; Multimedia; Social media; Internet privacy; Advertising","score_opus":0.03943884369057926,"score_gpt":0.24073929034675973,"score_spread":0.20130044665618047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046968332","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.996296,0.00022972951,0.00008291364,0.000191423,0.0000047435333,0.00006153479,0.0015816997,0.0000055554656,0.0015463186],"genre_scores_gemma":[0.9963133,0.0006245522,0.00021790178,0.00017737452,0.00001214178,0.00009136302,0.0012901312,0.000007736437,0.0012655718],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991404,0.00024039595,0.00011641396,0.000101763166,0.00021269322,0.00018838956],"domain_scores_gemma":[0.9967175,0.0010592969,0.0008167507,0.000071633425,0.00071192475,0.0006228711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010203074,0.00013921065,0.00029107186,0.002144112,0.00079085067,0.0008819322,0.00026852434,0.00052708265,0.0023432013],"category_scores_gemma":[0.004007129,0.00017548051,0.00020182034,0.002116384,0.00033546236,0.0016854078,0.0008113764,0.0003830401,0.000541607],"study_design_candidate":"observational","study_design_consensus":"observational","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.00006509981,0.00010364934,0.9735155,0.0000973623,0.000017205377,0.00043867913,0.012316725,0.00003673001,0.00074531435,0.00007805574,0.0015281297,0.011057539],"study_design_scores_gemma":[0.0000023335083,0.00016259767,0.9531281,0.000040063234,0.0000070848255,0.0004530212,0.043214872,0.00033434795,0.00020912169,0.000017410934,0.0024169448,0.0000140928405],"about_ca_topic_score_codex":0.031155309,"about_ca_topic_score_gemma":0.048975278,"teacher_disagreement_score":0.031155309,"about_ca_system_score_codex":0.00088417827,"about_ca_system_score_gemma":0.0004184465,"threshold_uncertainty_score":0.06194794},"labels":[],"label_agreement":null},{"id":"W2047517312","doi":"10.1109/aina.2013.145","title":"Just-In-Time Push Prefetching: Accelerating the Mobile Web","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Computer network; Proxy (statistics); Latency (audio); Server; Web server; Push technology; Cloud computing; Cloud server; The Internet; Mobile device; Mobile computing; Distributed computing; Operating system; Telecommunications","score_opus":0.023061916927320646,"score_gpt":0.22606315363959495,"score_spread":0.2030012367122743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047517312","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.8079443,0.0021981194,0.17167117,0.000557558,0.00022302695,0.00019935989,0.00018104746,0.005915738,0.0111096995],"genre_scores_gemma":[0.9757835,0.00026290305,0.022394082,0.000046270492,0.000034777164,0.000017216504,0.00006397733,0.000052680043,0.0013445676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995572,0.00006746539,0.00002504707,0.000057690864,0.00017448967,0.00011818536],"domain_scores_gemma":[0.9986712,0.00040645193,0.0001601554,0.00032237708,0.00034162574,0.00009819052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703444,0.00045336309,0.00038707134,0.00039923235,0.00051714625,0.0009610508,0.00087703275,0.0004889202,0.0012882616],"category_scores_gemma":[0.001946253,0.00024376425,0.00015779983,0.0008726594,0.00045210097,0.0018857698,0.00047256536,0.00038481908,0.00040158993],"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.0030475764,0.0008868289,0.033933204,0.000740358,0.00013892501,0.0016504884,0.00046258327,0.11126927,0.39548522,0.0123773785,0.008088783,0.4319194],"study_design_scores_gemma":[0.0001691428,0.0014404656,0.014648847,0.00004141305,0.00020069814,0.0017708535,0.0004782771,0.67607635,0.28641003,0.0062627145,0.01239027,0.00011092307],"about_ca_topic_score_codex":0.0032966998,"about_ca_topic_score_gemma":0.0076782755,"teacher_disagreement_score":0.0032966998,"about_ca_system_score_codex":0.00047550697,"about_ca_system_score_gemma":0.0008874688,"threshold_uncertainty_score":0.006555021},"labels":[],"label_agreement":null},{"id":"W2051414875","doi":"10.1109/nca.2013.41","title":"Data Partitioning for Video-on-Demand Services","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Server; Scalability; Video on demand; Workload; On demand; Service (business); The Internet; Architecture; Computer network; Video server; Multimedia; Distributed computing; Database; World Wide Web; Operating system","score_opus":0.0466977648230516,"score_gpt":0.2618131647556691,"score_spread":0.21511539993261752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051414875","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.17447272,0.0011576801,0.8186553,0.00052393903,0.000087776294,0.00029277342,0.00016076652,0.0012480007,0.0034010925],"genre_scores_gemma":[0.64065474,0.0003545051,0.35631576,0.00011583234,0.00003609963,0.0001237824,0.0003172461,0.00014455974,0.0019374603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936837,0.00020455779,0.00004608064,0.000102603786,0.00018636233,0.00009206891],"domain_scores_gemma":[0.9983432,0.00073336693,0.00010979679,0.00040405564,0.00030680536,0.00010263959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009176989,0.00040308537,0.00043808587,0.00060374447,0.0008497832,0.00082019466,0.0013108972,0.0005650683,0.0009569374],"category_scores_gemma":[0.0032225105,0.00023238198,0.0002839792,0.0008792823,0.00049929466,0.0012303337,0.00068821735,0.00051545876,0.00029054508],"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.0011706966,0.0005427873,0.009882242,0.000427846,0.00010822821,0.00027407642,0.0011007508,0.28692144,0.13983327,0.045528363,0.012251564,0.50195867],"study_design_scores_gemma":[0.00007580076,0.00021469375,0.0020494438,0.000024742356,0.000036220626,0.00041322334,0.0003267767,0.9221765,0.04981998,0.016983533,0.007849143,0.000030034367],"about_ca_topic_score_codex":0.0032673746,"about_ca_topic_score_gemma":0.0049997293,"teacher_disagreement_score":0.0032673746,"about_ca_system_score_codex":0.0012811706,"about_ca_system_score_gemma":0.00093366596,"threshold_uncertainty_score":0.009295583},"labels":[],"label_agreement":null},{"id":"W2052351476","doi":"10.1109/twc.2014.2314643","title":"FW-DAS: Fast Wireless Data Access Scheme in Mobile Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"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":"National Research Foundation of Korea","keywords":"Computer science; Computer network; Wireless distribution system; Mobile broadband; Data access; Wireless; Cache; Latency (audio); Wireless network; Wireless intrusion prevention system; Base station; Wi-Fi array; Telecommunications; Database","score_opus":0.05512329076624166,"score_gpt":0.3129568662958513,"score_spread":0.2578335755296096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052351476","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.11011222,0.003372131,0.8788018,0.00033709104,0.0003269912,0.00030575207,0.00021769392,0.0028628265,0.0036635422],"genre_scores_gemma":[0.896517,0.0009719323,0.09821305,0.00021595106,0.00013170645,0.00025268339,0.0002637755,0.000046192494,0.003387786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932003,0.00015474432,0.00005866871,0.00011792114,0.0001961947,0.00015246938],"domain_scores_gemma":[0.99879575,0.00032103935,0.00014035554,0.00030887185,0.0003413612,0.00009254013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085678714,0.0007957951,0.0009500761,0.0012161534,0.0009329497,0.0009110525,0.0018821321,0.0006329574,0.0010454147],"category_scores_gemma":[0.0018182936,0.00022767941,0.0005393881,0.0013171597,0.0007566892,0.0020363154,0.0016613108,0.0008516195,0.00041511274],"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.0013123531,0.00041858107,0.004735198,0.00085856713,0.00019202255,0.0007574463,0.00057300535,0.115626045,0.15934505,0.07512598,0.010874768,0.630181],"study_design_scores_gemma":[0.0001935066,0.0011658372,0.0020008394,0.000055884557,0.00013792282,0.0018744386,0.00022614628,0.90207875,0.037852038,0.02285342,0.03140999,0.00015117667],"about_ca_topic_score_codex":0.0013359134,"about_ca_topic_score_gemma":0.001727282,"teacher_disagreement_score":0.0018821321,"about_ca_system_score_codex":0.0007157353,"about_ca_system_score_gemma":0.000803876,"threshold_uncertainty_score":0.0051930547},"labels":[],"label_agreement":null},{"id":"W2052756861","doi":"10.1007/s11227-014-1141-x","title":"Adaptive global power optimization for Web servers","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Server; Distributed computing; Power (physics); Key (lock); Power optimization; Web server; Node (physics); Central processing unit; Operating system; Power consumption; Embedded system; The Internet","score_opus":0.014409524055755667,"score_gpt":0.22231226062745257,"score_spread":0.20790273657169692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052756861","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.09637586,0.00095079624,0.8839307,0.0011972846,0.00014667485,0.000080799866,0.00017020828,0.0007622011,0.016385518],"genre_scores_gemma":[0.96196675,0.00025111574,0.029148404,0.00012075088,0.00007363705,0.000059331654,0.00008349186,0.0002662839,0.008030299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996915,0.00011379569,0.000009000688,0.000044516568,0.000066075554,0.00007513836],"domain_scores_gemma":[0.9991278,0.0005766416,0.000050912124,0.000067655696,0.00012302813,0.000054076107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007100726,0.0009081327,0.0013366904,0.000482383,0.00043547738,0.0009855997,0.0010674242,0.00080062007,0.004567525],"category_scores_gemma":[0.0034559648,0.00045662004,0.00039334732,0.0007812678,0.00087253127,0.0012080392,0.0009949052,0.0008001713,0.00042490952],"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.00006452503,0.000023891027,0.00011860469,0.00002340852,0.000010613395,0.000017836903,0.000013152898,0.9854887,0.00057415094,0.004145124,0.0010233723,0.008496653],"study_design_scores_gemma":[0.000005288945,0.000006831844,0.000040128398,8.7997563e-7,0.0000019837025,0.0000026636114,0.0000044272965,0.9967392,0.00008912151,0.0030327186,0.000075501026,0.0000012599877],"about_ca_topic_score_codex":0.004868152,"about_ca_topic_score_gemma":0.0043652165,"teacher_disagreement_score":0.004868152,"about_ca_system_score_codex":0.001063856,"about_ca_system_score_gemma":0.0008463387,"threshold_uncertainty_score":0.015279949},"labels":[],"label_agreement":null},{"id":"W2053359564","doi":"10.1016/s0166-5316(00)00032-8","title":"Temporal locality and its impact on Web proxy cache performance","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Locality of reference; Locality; Computer science; Cache; Proxy (statistics); Principle of locality; Popularity; Term (time); Quantum nonlocality; Parallel computing; Machine learning","score_opus":0.033255201452761556,"score_gpt":0.30084270038322247,"score_spread":0.2675874989304609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053359564","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.98939425,0.0009643866,0.006745994,0.00017817502,0.000026579552,0.00001903599,0.0001287528,0.00022008184,0.002322746],"genre_scores_gemma":[0.9984024,0.00011861103,0.0009356871,0.000010496501,0.000016673712,0.0000057607645,0.000050607563,0.000027799342,0.0004319521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742174,0.0009672981,0.00015844197,0.00023199417,0.0009175486,0.00030287885],"domain_scores_gemma":[0.97018695,0.02269771,0.0020465758,0.00163408,0.0027210119,0.0007137136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003372499,0.00040459775,0.00049366214,0.0009810289,0.00079430384,0.0012649226,0.00074099406,0.00077124767,0.0014628529],"category_scores_gemma":[0.022016201,0.00029898714,0.00023174586,0.0019941167,0.00084921287,0.0018850547,0.0005541986,0.00062975317,0.0002023211],"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.014618468,0.0021309094,0.18586974,0.00078365457,0.00051757006,0.0017194743,0.00090668024,0.43555415,0.2112227,0.011648023,0.0032339892,0.13179477],"study_design_scores_gemma":[0.00015855345,0.0020719382,0.039856993,0.000027479771,0.00037831324,0.0012900936,0.00041137481,0.8531421,0.09966688,0.0018491662,0.0010718482,0.000075350996],"about_ca_topic_score_codex":0.0066412794,"about_ca_topic_score_gemma":0.0052988855,"teacher_disagreement_score":0.0066412794,"about_ca_system_score_codex":0.0017002133,"about_ca_system_score_gemma":0.0012913616,"threshold_uncertainty_score":0.017835736},"labels":[],"label_agreement":null},{"id":"W2053761086","doi":"10.1002/dac.1262","title":"UARA in edge routers: an effective approach to user fairness and traffic shaping","year":2011,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University; Polytechnique Montréal","keywords":"Computer science; Computer network; Provisioning; Network congestion; Quality of experience; Enhanced Data Rates for GSM Evolution; Quality of service; Traffic shaping; The Internet; Bandwidth (computing); Network traffic control; Peer-to-peer; Traffic congestion; Network packet; Telecommunications; World Wide Web","score_opus":0.06499478482198469,"score_gpt":0.28241033123697984,"score_spread":0.21741554641499516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053761086","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.041583464,0.00030963577,0.95128155,0.0002660127,0.00008908263,0.00010366279,0.000012908789,0.00072805816,0.005625676],"genre_scores_gemma":[0.8523455,0.000106880034,0.14405975,0.00028764163,0.0001097864,0.00007664852,0.000014840497,0.00006442952,0.002934591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967775,0.001723943,0.00011566127,0.00045317566,0.00051535945,0.00041450874],"domain_scores_gemma":[0.99389416,0.0024719378,0.00040391606,0.0014916409,0.0012994959,0.00043888093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037173072,0.0006514032,0.0010216006,0.0008106155,0.0013389286,0.002177008,0.002365074,0.0014128105,0.0021472506],"category_scores_gemma":[0.006376331,0.00033929548,0.00044808787,0.0005365213,0.0012206377,0.002060253,0.0025983378,0.0017028627,0.0005721574],"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.0012848134,0.0010064717,0.004451065,0.00013957194,0.00014171204,0.00065894704,0.0008393266,0.34753048,0.07371771,0.25752443,0.005598796,0.30710667],"study_design_scores_gemma":[0.000020906375,0.00012361654,0.00019914607,0.000008211757,0.000022182234,0.00010972403,0.00004351503,0.9713867,0.007903324,0.017357228,0.0028041974,0.000021229223],"about_ca_topic_score_codex":0.0009070475,"about_ca_topic_score_gemma":0.0010225836,"teacher_disagreement_score":0.0037173072,"about_ca_system_score_codex":0.0010059121,"about_ca_system_score_gemma":0.0011321773,"threshold_uncertainty_score":0.019659221},"labels":[],"label_agreement":null},{"id":"W2054464274","doi":"10.1109/greencom-ithings-cpscom.2013.224","title":"Efficient Security Solution for Information-centric Networking","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Information-centric networking; Authentication (law); Computer security; The Internet; Cryptography; Key (lock); Public-key cryptography; Computer network; World Wide Web; Encryption","score_opus":0.010241288835918117,"score_gpt":0.19673500145853967,"score_spread":0.18649371262262154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054464274","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.024490044,0.001178976,0.9552791,0.0015376159,0.00020100082,0.00023991214,0.00006784124,0.0005031996,0.016502174],"genre_scores_gemma":[0.6932819,0.001407581,0.29131877,0.00040156665,0.00020975445,0.0003265061,0.00023905643,0.00006909781,0.0127458135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986467,0.00034759557,0.000080373,0.00018205385,0.0005371347,0.00020621732],"domain_scores_gemma":[0.998934,0.0003171854,0.00011504018,0.00027613423,0.0003027961,0.000054874512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011550792,0.00058971165,0.00063108915,0.0009015829,0.001539139,0.0019143634,0.0010897217,0.001278397,0.0034095547],"category_scores_gemma":[0.00202644,0.00026770096,0.0005734228,0.0006039335,0.00080606824,0.003460127,0.0019538056,0.001394083,0.000862676],"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.00030292897,0.00020993846,0.0008461214,0.00033465048,0.00009417087,0.00032221383,0.0003779323,0.07531149,0.03559937,0.7159759,0.010470268,0.16015506],"study_design_scores_gemma":[0.00008301762,0.00017135928,0.00028963012,0.00007322968,0.0000750504,0.00064300344,0.00019915956,0.71573323,0.022090266,0.22915897,0.03143882,0.00004435302],"about_ca_topic_score_codex":0.00045208377,"about_ca_topic_score_gemma":0.0004286354,"teacher_disagreement_score":0.0034095547,"about_ca_system_score_codex":0.0013727314,"about_ca_system_score_gemma":0.0015991566,"threshold_uncertainty_score":0.011406124},"labels":[],"label_agreement":null},{"id":"W2055960541","doi":"10.1109/lcnw.2013.6758526","title":"A value-based cache replacement approach for Information-Centric Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Guelph","funders":"","keywords":"Cache; Computer science; Cache algorithms; Smart Cache; Popularity; Function (biology); Computer network; Value (mathematics); Cache invalidation; Distributed computing; CPU cache","score_opus":0.012409395716929561,"score_gpt":0.1964601650246306,"score_spread":0.18405076930770103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055960541","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.017173164,0.0009794141,0.9790552,0.0002772718,0.000057451536,0.00007041909,0.000027495735,0.0002400906,0.0021193621],"genre_scores_gemma":[0.7271629,0.0009190476,0.26797935,0.00016850348,0.000099243414,0.00012716786,0.000058406546,0.000067660956,0.003417726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829346,0.00073037494,0.00008345898,0.00017316785,0.00057066826,0.00014891132],"domain_scores_gemma":[0.9970963,0.0013785402,0.0002527509,0.000428152,0.0007173904,0.00012698513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027573325,0.00057503936,0.0012516982,0.00091313856,0.00090621726,0.0015883431,0.0026482653,0.00091014575,0.000795907],"category_scores_gemma":[0.0061225174,0.00036631827,0.0006090936,0.0018093573,0.0008212959,0.0019968858,0.00083300564,0.00092561153,0.00023546204],"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.00022192516,0.00019920609,0.0023977256,0.00018538252,0.000093289476,0.0003351566,0.00048088605,0.65157,0.0063616345,0.13170451,0.0042775054,0.20217274],"study_design_scores_gemma":[0.000012109577,0.00007545634,0.00012761736,0.000014969042,0.00002933959,0.00015208028,0.000038412512,0.9795725,0.0013284216,0.015986558,0.0026470316,0.0000155597],"about_ca_topic_score_codex":0.00503228,"about_ca_topic_score_gemma":0.006207513,"teacher_disagreement_score":0.00503228,"about_ca_system_score_codex":0.002128349,"about_ca_system_score_gemma":0.0019197299,"threshold_uncertainty_score":0.015442312},"labels":[],"label_agreement":null},{"id":"W2056689435","doi":"10.1145/1631144.1631156","title":"Accelerating YouTube with video correlation","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Correlation; Computer graphics (images); Mathematics","score_opus":0.017510950884878643,"score_gpt":0.20949306943503357,"score_spread":0.19198211855015493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056689435","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.7749799,0.0009795349,0.20901574,0.00051985314,0.0001041882,0.0003845833,0.00021810466,0.0077998834,0.005998165],"genre_scores_gemma":[0.95954347,0.00019131905,0.038705587,0.00006825941,0.000035401437,0.000087818,0.0002419849,0.00008292822,0.0010432688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989184,0.00021266949,0.00004400846,0.00016370426,0.000468833,0.00019238006],"domain_scores_gemma":[0.9972631,0.0010421154,0.00028579187,0.00042591922,0.00079283956,0.00019031834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326004,0.0005811684,0.00074816524,0.0010601403,0.000695962,0.00073131867,0.001075009,0.0005576884,0.0008755466],"category_scores_gemma":[0.0054977704,0.00029885548,0.00019071586,0.0013225431,0.0004416104,0.001984893,0.0014057083,0.00081726356,0.00041057682],"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.0020370274,0.0014759543,0.06653919,0.00048482142,0.00027186322,0.0012989551,0.0013535131,0.2040146,0.20817168,0.012038249,0.0148665365,0.48744768],"study_design_scores_gemma":[0.000106502746,0.0005924772,0.0108746765,0.000023504683,0.00006129029,0.0005283742,0.0002560229,0.9104592,0.0688217,0.0025749062,0.005644487,0.000056784887],"about_ca_topic_score_codex":0.008080564,"about_ca_topic_score_gemma":0.0057195416,"teacher_disagreement_score":0.008080564,"about_ca_system_score_codex":0.0008987217,"about_ca_system_score_gemma":0.0012277144,"threshold_uncertainty_score":0.016067088},"labels":[],"label_agreement":null},{"id":"W2057197163","doi":"10.1145/2642687.2642701","title":"Quality of experience-enabled social networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of experience; Architecture; Quality of service; Filter (signal processing); World Wide Web; Service (business); Quality (philosophy); Computer network; Network packet; Multimedia; Business","score_opus":0.03526733035822714,"score_gpt":0.28174701539352254,"score_spread":0.24647968503529538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057197163","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.22992906,0.0038795376,0.63048095,0.0039830385,0.0006818986,0.00066267076,0.0010191274,0.009294516,0.120069146],"genre_scores_gemma":[0.9701255,0.00076251634,0.022852529,0.00024942635,0.00015073446,0.00009130282,0.000300406,0.000075469325,0.0053922534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989994,0.0003266798,0.00005708113,0.00014357355,0.00032106563,0.00015222811],"domain_scores_gemma":[0.99785596,0.0005053929,0.00024127726,0.00044200747,0.00065581204,0.00029956162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011009087,0.00044252333,0.00032669076,0.0006044872,0.00061308086,0.002057775,0.00083604094,0.0006394013,0.0026031556],"category_scores_gemma":[0.0034137117,0.00021131682,0.0002828241,0.00067333074,0.00042145033,0.0021115346,0.0021206704,0.00055649027,0.00074347324],"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.0008318253,0.00043643735,0.036516953,0.0007990878,0.000292087,0.0011583805,0.0019036003,0.04732618,0.03694613,0.12236631,0.041735467,0.7096876],"study_design_scores_gemma":[0.00010460646,0.00078927487,0.03029253,0.00020617082,0.00028705323,0.0015484261,0.0014422406,0.59952784,0.019284867,0.088221855,0.25809386,0.00020125261],"about_ca_topic_score_codex":0.001859086,"about_ca_topic_score_gemma":0.0019358293,"teacher_disagreement_score":0.0026031556,"about_ca_system_score_codex":0.0005545568,"about_ca_system_score_gemma":0.00039297438,"threshold_uncertainty_score":0.008708358},"labels":[],"label_agreement":null},{"id":"W2058165990","doi":"10.1145/503334.503337","title":"On filter effects in web caching hierarchies","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Division of Chemistry","keywords":"Computer science; Cache; Cache invalidation; Cache algorithms; Cache pollution; Smart Cache; Zipf's law; CPU cache; Proxy (statistics); Workload; Exploit; Cache coloring; Page cache; Hierarchy; Parallel computing; Computer network; Distributed computing; Operating system; Computer security","score_opus":0.013504914817950353,"score_gpt":0.216158968423024,"score_spread":0.20265405360507366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058165990","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.7297705,0.0030431366,0.2510652,0.0011299537,0.00012411918,0.00014674704,0.00019989024,0.0014342087,0.013086252],"genre_scores_gemma":[0.9849799,0.00063017936,0.012583962,0.00019035621,0.000080173806,0.000030268056,0.000068060726,0.00008106465,0.0013560461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834013,0.00045820526,0.000054087504,0.00018626309,0.00062124187,0.00034008198],"domain_scores_gemma":[0.98215723,0.014794581,0.000990482,0.00079432933,0.0009971962,0.00026612787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018604907,0.00059031445,0.0007182389,0.00088407204,0.0011372654,0.0015383088,0.00072060246,0.0013861696,0.0019897977],"category_scores_gemma":[0.013847941,0.0005366333,0.00053835544,0.00084254803,0.0010748539,0.0033113272,0.0007638879,0.00092862995,0.00025881405],"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.0011240504,0.00047814546,0.030645262,0.00053475087,0.00027779417,0.0011069534,0.0019278526,0.7047329,0.06758667,0.07562626,0.0049223667,0.111036986],"study_design_scores_gemma":[0.00008137695,0.00039772093,0.0070182867,0.000052005158,0.00012762919,0.00049135636,0.00023355424,0.95205843,0.017099444,0.018814057,0.0035596383,0.00006651599],"about_ca_topic_score_codex":0.011540964,"about_ca_topic_score_gemma":0.009138154,"teacher_disagreement_score":0.011540964,"about_ca_system_score_codex":0.00236625,"about_ca_system_score_gemma":0.0009041271,"threshold_uncertainty_score":0.02294755},"labels":[],"label_agreement":null},{"id":"W2059916126","doi":"10.3166/isi.10.5.9-38","title":"On-Mobile Query Processing Incorporating Multiple Non-Collaborative Servers","year":2005,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Query optimization; Server; Query expansion; Database; Information retrieval; World Wide Web","score_opus":0.014067913806366716,"score_gpt":0.23200666648073728,"score_spread":0.21793875267437057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059916126","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.32729742,0.0020859211,0.6310617,0.0012287566,0.00078654673,0.0009036842,0.0005394063,0.012709224,0.023387428],"genre_scores_gemma":[0.79906416,0.0003524108,0.18394144,0.00027814345,0.00035371317,0.00014317285,0.0005372308,0.00037515166,0.014954615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977729,0.0005367481,0.0001846628,0.00041304162,0.00058375363,0.0005087614],"domain_scores_gemma":[0.99576414,0.001191674,0.00010675634,0.0016875328,0.00096511835,0.0002848237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002015697,0.0012308002,0.0021390812,0.0009544288,0.002211682,0.0032645778,0.0031052716,0.0020035545,0.0064792205],"category_scores_gemma":[0.0044158516,0.00078346895,0.00077549263,0.0018796675,0.00066958845,0.004575901,0.0027877144,0.0009505792,0.002808995],"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.006810521,0.0027128034,0.011125984,0.0006313652,0.0008103548,0.0027960956,0.001210597,0.14698377,0.14398989,0.016533885,0.04193086,0.624464],"study_design_scores_gemma":[0.0002778246,0.0005930754,0.0016447895,0.000023828381,0.00014061111,0.00074710196,0.0005055258,0.9507405,0.028013188,0.007316679,0.0099273,0.00006960423],"about_ca_topic_score_codex":0.010999105,"about_ca_topic_score_gemma":0.024527498,"teacher_disagreement_score":0.010999105,"about_ca_system_score_codex":0.0012533009,"about_ca_system_score_gemma":0.0018447529,"threshold_uncertainty_score":0.021870196},"labels":[],"label_agreement":null},{"id":"W2060256724","doi":"10.1109/lcn.2013.6761336","title":"Enhanced Data Delivery framework for dynamic Information-Centric Networks (ICNs)","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Guelph","funders":"Ministero dello Sviluppo Economico; Ontario Ministry of Economic Development and Innovation","keywords":"Computer science; Rendezvous; Node (physics); Computer network; Distributed computing; Set (abstract data type); Key (lock); Network topology; Variety (cybernetics); Provisioning; Delay-tolerant networking; Routing (electronic design automation); Bridge (graph theory); Routing protocol; Operating system; Engineering","score_opus":0.01738463654877405,"score_gpt":0.2390098575869557,"score_spread":0.22162522103818166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060256724","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.004001441,0.00027725272,0.992224,0.00020250594,0.000071533475,0.00014457315,0.00007307622,0.00048709742,0.0025185177],"genre_scores_gemma":[0.23135382,0.0007589839,0.7603109,0.0002508766,0.00012062518,0.0003774573,0.0003156035,0.00014227223,0.0063694897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895716,0.00031088272,0.00006707421,0.00016599825,0.00039878825,0.00010012842],"domain_scores_gemma":[0.9990293,0.00031973168,0.00008207341,0.00022343486,0.0002515917,0.000093884286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128569,0.0006385679,0.00060166186,0.0006137631,0.0007294581,0.0015971086,0.0023696157,0.0010747397,0.0022053197],"category_scores_gemma":[0.0024552974,0.00033295326,0.00061231357,0.0005342356,0.00075654534,0.0017634018,0.0019375752,0.0012389431,0.00058056845],"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.00027294378,0.00022260459,0.001544184,0.00046796355,0.00009001486,0.0007889147,0.00078970473,0.34795827,0.024144057,0.44264454,0.012967783,0.16810903],"study_design_scores_gemma":[0.000044536675,0.00015348392,0.00022107398,0.00003827194,0.00004087995,0.0003707794,0.000095730466,0.91970176,0.0048502786,0.02590551,0.04854089,0.000036875997],"about_ca_topic_score_codex":0.004371452,"about_ca_topic_score_gemma":0.0038413322,"teacher_disagreement_score":0.004371452,"about_ca_system_score_codex":0.0017450883,"about_ca_system_score_gemma":0.001642112,"threshold_uncertainty_score":0.012661576},"labels":[],"label_agreement":null},{"id":"W2061132138","doi":"10.5555/1639809.1639944","title":"Cache replacement solutions by evolutionary computing technique","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Cache algorithms; The Internet; Distributed computing; Computer network; Evolutionary algorithm; CPU cache; World Wide Web; Artificial intelligence","score_opus":0.016132319812842327,"score_gpt":0.23223764854077422,"score_spread":0.2161053287279319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061132138","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.057578206,0.0009770577,0.9313924,0.00041221007,0.000106498854,0.00006948649,0.000020693666,0.0002105864,0.009232904],"genre_scores_gemma":[0.61486894,0.0009045609,0.37769446,0.0001878861,0.00007275716,0.00022111025,0.00006343058,0.00004578757,0.005941136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976,0.00007467937,0.000012082238,0.000036240748,0.00008191199,0.000035178437],"domain_scores_gemma":[0.99978286,0.000092399016,0.0000243496,0.000024160845,0.00006461623,0.00001169921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294651,0.00036807836,0.0005992345,0.0005232839,0.00048593522,0.00052340835,0.00081612426,0.00078628684,0.0009844932],"category_scores_gemma":[0.0012908826,0.00019828418,0.0005122884,0.00064611866,0.00039086238,0.0005131111,0.00046852182,0.00057910534,0.0001436241],"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.000055771085,0.00011412663,0.0020547055,0.00011993607,0.00010150535,0.0002460415,0.00021843115,0.7318036,0.013824042,0.07359991,0.002182654,0.17567933],"study_design_scores_gemma":[0.00001675924,0.000045898716,0.00026872565,0.000010968173,0.000024471843,0.00009216291,0.000024356359,0.9869391,0.0011115697,0.009122145,0.0023355195,0.000008396183],"about_ca_topic_score_codex":0.0018995816,"about_ca_topic_score_gemma":0.0016361106,"teacher_disagreement_score":0.0018995816,"about_ca_system_score_codex":0.00041551082,"about_ca_system_score_gemma":0.00051999313,"threshold_uncertainty_score":0.0037770867},"labels":[],"label_agreement":null},{"id":"W2063190708","doi":"10.1109/mass.2014.29","title":"Towards Smart Routing: Exploiting User Context for Video Delivery in Mobile Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 New Brunswick","funders":"","keywords":"Computer science; Computer network; Exploit; Scheduling (production processes); Triangular routing; Routing (electronic design automation); Static routing; Schedule; Distributed computing; Quality of experience; Quality of service; Routing protocol; Computer security","score_opus":0.019873938989477178,"score_gpt":0.2307170505412641,"score_spread":0.21084311155178692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063190708","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.042206604,0.0016066507,0.953315,0.0006775844,0.00006182301,0.00008953907,0.00004106703,0.00019188522,0.0018099253],"genre_scores_gemma":[0.77294475,0.0018683384,0.2235277,0.00018457556,0.0001408584,0.000084133266,0.00006471387,0.00007822192,0.0011065919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898034,0.0005156927,0.000042095126,0.00014782396,0.00018053761,0.00013356771],"domain_scores_gemma":[0.99856144,0.00086546486,0.00016136038,0.00017864084,0.00013671824,0.00009623404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015137042,0.0008942249,0.0010938565,0.0005472226,0.0008442071,0.0013041308,0.0013962446,0.0013664366,0.00051539805],"category_scores_gemma":[0.0040300847,0.00053889165,0.00049182755,0.00076257065,0.0009814645,0.002949968,0.0017148945,0.0012289002,0.00013040508],"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.00028363374,0.00013273211,0.0018227212,0.00029307252,0.000090372945,0.00030518734,0.0004284453,0.77118075,0.020637587,0.0933208,0.0031733057,0.10833146],"study_design_scores_gemma":[0.000009602845,0.00005839902,0.00016390067,0.000008453728,0.0000146034445,0.000074509786,0.00006988642,0.97643596,0.001272353,0.02061177,0.0012685806,0.000011968442],"about_ca_topic_score_codex":0.0026549743,"about_ca_topic_score_gemma":0.0038181685,"teacher_disagreement_score":0.0026549743,"about_ca_system_score_codex":0.0010783267,"about_ca_system_score_gemma":0.0008222077,"threshold_uncertainty_score":0.008005321},"labels":[],"label_agreement":null},{"id":"W2063293683","doi":"10.1145/1806565.1806571","title":"Tweeting videos","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; World Wide Web; The Internet; Context (archaeology); Social media; Preference; Internet privacy; Internet users; Social network (sociolinguistics); Multimedia","score_opus":0.005657553568787698,"score_gpt":0.19861200782910557,"score_spread":0.19295445426031788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063293683","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27733415,0.0039693397,0.029717429,0.0039916337,0.0028864492,0.002229786,0.07513362,0.0133618275,0.59137577],"genre_scores_gemma":[0.4913547,0.0033400867,0.017368758,0.0019333343,0.0014064797,0.0004445723,0.03433486,0.0009987388,0.4488185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996401,0.000036555874,0.00002348746,0.00006982612,0.00016536553,0.00006465249],"domain_scores_gemma":[0.99858713,0.00043472342,0.0001534891,0.00020983694,0.0004301975,0.00018466868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027687894,0.00047800873,0.00027827415,0.0020293766,0.00077172846,0.0012038684,0.00041096,0.0006655577,0.061670654],"category_scores_gemma":[0.0033786832,0.00014164306,0.00024050775,0.0015337717,0.00016057031,0.001475735,0.0007791704,0.00043041346,0.031310253],"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.00057284854,0.00025997392,0.019563418,0.0008647269,0.000060705042,0.0011233599,0.0014015057,0.00056481396,0.039417837,0.0042060968,0.28199756,0.6499672],"study_design_scores_gemma":[0.00006637447,0.00042101333,0.07120137,0.0002405464,0.00009153075,0.0026794577,0.0022156762,0.006206543,0.030464895,0.0033019837,0.88298285,0.000127728],"about_ca_topic_score_codex":0.0055847852,"about_ca_topic_score_gemma":0.010634169,"teacher_disagreement_score":0.061670654,"about_ca_system_score_codex":0.00029530376,"about_ca_system_score_gemma":0.00027206485,"threshold_uncertainty_score":0.2063089},"labels":[],"label_agreement":null},{"id":"W2063550827","doi":"10.1145/1989493.1989551","title":"Understanding bloom filter intersection for lazy address-set disambiguation","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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":"Bloom filter; Intersection (aeronautics); Set (abstract data type); Hash function; Computer science; Probabilistic logic; Filter (signal processing); Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.3985624610440917,"score_gpt":0.2840977546055879,"score_spread":0.11446470643850382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063550827","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.03684122,0.00026634044,0.9570691,0.0007428684,0.00003218489,0.00011000825,0.00013102994,0.00065347896,0.0041539115],"genre_scores_gemma":[0.73110545,0.0004373015,0.26298073,0.00040964832,0.0001714692,0.00037189774,0.00028930532,0.00032769114,0.0039065536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9879623,0.0035951752,0.0007457042,0.002013895,0.0042955615,0.0013873173],"domain_scores_gemma":[0.9574032,0.026302522,0.003748293,0.008502554,0.0032810653,0.0007623131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010796646,0.0007436458,0.0020813518,0.0027199166,0.0039548324,0.007977011,0.0036320516,0.0030343842,0.0049573807],"category_scores_gemma":[0.05237002,0.0014023674,0.0016078578,0.0029221757,0.006838098,0.022183089,0.006372483,0.0039768475,0.0009776219],"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.0002517824,0.00007594571,0.0026032922,0.000065702094,0.000038099326,0.00016136986,0.000731648,0.06112826,0.0025297247,0.90174884,0.0014099509,0.029255455],"study_design_scores_gemma":[0.00002862939,0.000047776055,0.00027421315,0.000032633237,0.000040139454,0.00022037009,0.00017532393,0.48206368,0.007873072,0.5050433,0.004152887,0.00004785622],"about_ca_topic_score_codex":0.0066646147,"about_ca_topic_score_gemma":0.003303479,"teacher_disagreement_score":0.010796646,"about_ca_system_score_codex":0.0070244856,"about_ca_system_score_gemma":0.0050945687,"threshold_uncertainty_score":0.057098806},"labels":[],"label_agreement":null},{"id":"W2063939659","doi":"10.1109/comst.2015.2392629","title":"A Survey of Security Attacks in Information-Centric Networking","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Bell Canada Enterprises","keywords":"Computer science; Confidentiality; Computer security; Information-centric networking; Internet privacy; Relation (database); Computer network; World Wide Web; The Internet; Database","score_opus":0.11584605980955481,"score_gpt":0.3157378553524336,"score_spread":0.19989179554287878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063939659","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034416966,0.67137694,0.17792472,0.0102678295,0.0017759813,0.0004519728,0.0004118985,0.0008631652,0.10251057],"genre_scores_gemma":[0.24351704,0.67985207,0.056049924,0.0034968907,0.0028288574,0.00030845444,0.0008036205,0.00018074781,0.012962451],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995786,0.0009052456,0.0004324251,0.000342847,0.0021439025,0.00038957156],"domain_scores_gemma":[0.9929617,0.0043670046,0.000648463,0.0007606228,0.0010995029,0.00016271317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026938976,0.0013073151,0.0013405605,0.0043286053,0.0017889888,0.0033736085,0.0013218184,0.002639459,0.0021037054],"category_scores_gemma":[0.0059435195,0.0008212161,0.0009579308,0.006356287,0.0015858208,0.008363289,0.001749388,0.0026570724,0.0009175206],"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.00015829272,0.00021816269,0.0070697153,0.004109904,0.0001576574,0.0007018402,0.0008144563,0.021482607,0.003320427,0.22093648,0.038949415,0.70208097],"study_design_scores_gemma":[0.00003226495,0.0004786646,0.006815635,0.0044853566,0.00028677032,0.008603709,0.0012411479,0.07198222,0.009951621,0.1238737,0.772041,0.00020781507],"about_ca_topic_score_codex":0.0014839169,"about_ca_topic_score_gemma":0.0008079469,"teacher_disagreement_score":0.0043286053,"about_ca_system_score_codex":0.0021864157,"about_ca_system_score_gemma":0.0014138846,"threshold_uncertainty_score":0.015863657},"labels":[],"label_agreement":null},{"id":"W2064735168","doi":"10.1109/icdcsw.2013.54","title":"Update Management in Decentralized Social Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Replicate; Distributed computing; Distributed database; Data management; Data science; Computer network; Database","score_opus":0.00917278893667672,"score_gpt":0.21011862015066987,"score_spread":0.20094583121399315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064735168","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.42902717,0.0019659745,0.55280495,0.0019809555,0.00021878832,0.00032010782,0.00037042506,0.0031768626,0.010134794],"genre_scores_gemma":[0.95923555,0.0004054779,0.036872122,0.00009608907,0.00013632078,0.00011765492,0.00017576835,0.000057041976,0.0029040459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970444,0.0010902876,0.00018064678,0.0005261934,0.0009004207,0.00025805237],"domain_scores_gemma":[0.9846905,0.008238222,0.0018261118,0.0030083356,0.0016643833,0.0005723438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032085609,0.0004924679,0.001103303,0.001264802,0.0022633807,0.0026068995,0.0018927419,0.0013345922,0.0012196469],"category_scores_gemma":[0.01857739,0.0005793107,0.0003201914,0.0019988243,0.0010607839,0.0041958657,0.0019891227,0.0009057545,0.00035969616],"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.0009779038,0.000581788,0.014713739,0.00044252438,0.00021677018,0.00090556586,0.0019039419,0.5055538,0.017975332,0.13008107,0.013693681,0.31295383],"study_design_scores_gemma":[0.000098097604,0.00013233273,0.0014419393,0.00001586,0.000050904837,0.00019791443,0.00023370422,0.94265634,0.003362582,0.046272453,0.0055055353,0.00003234795],"about_ca_topic_score_codex":0.005549396,"about_ca_topic_score_gemma":0.004399415,"teacher_disagreement_score":0.005549396,"about_ca_system_score_codex":0.0015935032,"about_ca_system_score_gemma":0.0015406999,"threshold_uncertainty_score":0.016968727},"labels":[],"label_agreement":null},{"id":"W2065468011","doi":"10.1145/2592798.2592817","title":"Caching in video CDNs","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; The Internet; Enhanced Data Rates for GSM Evolution; Computer network; Content delivery; Internet traffic; Resource (disambiguation); World Wide Web; Telecommunications","score_opus":0.007877287158475932,"score_gpt":0.19774271162997722,"score_spread":0.1898654244715013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065468011","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.2560017,0.036321342,0.62791216,0.004966128,0.0011654318,0.00034702054,0.0011374481,0.0014188512,0.070729904],"genre_scores_gemma":[0.9561499,0.005129802,0.025464064,0.0003324134,0.00022492858,0.00008532246,0.00024601253,0.00007806024,0.012289523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904996,0.00029945764,0.00004263559,0.00016395426,0.00024901316,0.00019495022],"domain_scores_gemma":[0.9974899,0.001331362,0.00017058797,0.0002926023,0.0005735238,0.00014191012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010671898,0.00039032416,0.0009891004,0.00084147253,0.0015672841,0.0027464097,0.0013887938,0.001570944,0.002877694],"category_scores_gemma":[0.0075988867,0.00048915466,0.00028543602,0.0016974089,0.0012372866,0.0029881643,0.0011093192,0.0010051649,0.00037804982],"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.00042531846,0.00010108078,0.0033439663,0.000352957,0.00006488156,0.0005206829,0.00030613982,0.4113003,0.0052852724,0.4916288,0.01903757,0.06763305],"study_design_scores_gemma":[0.000041325206,0.000042353004,0.0005146457,0.000059290545,0.00003370955,0.00022014599,0.000120818055,0.8836391,0.0018345499,0.10317858,0.010282858,0.000032581564],"about_ca_topic_score_codex":0.02567019,"about_ca_topic_score_gemma":0.018773807,"teacher_disagreement_score":0.02567019,"about_ca_system_score_codex":0.0043407166,"about_ca_system_score_gemma":0.0016949042,"threshold_uncertainty_score":0.051041543},"labels":[],"label_agreement":null},{"id":"W2065896408","doi":"10.1504/ijeb.2007.016472","title":"Online shopping bots for electronic commerce: the comparison of functionality and performance","year":2007,"lang":"en","type":"article","venue":"International Journal of Electronic Business","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Key (lock); Product (mathematics); Consistency (knowledge bases); Computer science; Measure (data warehouse); E-commerce; Software; World Wide Web; Advertising; Business; Database; Computer security; Artificial intelligence","score_opus":0.02664606675948613,"score_gpt":0.3073209862641727,"score_spread":0.2806749195046866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065896408","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.9968129,0.00010242568,0.0009730824,0.00005387811,0.00001023563,0.000110074456,0.00013120036,0.00016198531,0.0016442572],"genre_scores_gemma":[0.99520206,0.00007785347,0.0031840098,0.000036598653,0.00001036855,0.000049708367,0.00034626282,0.000040151543,0.0010529893],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9949275,0.0023166533,0.00043252637,0.00045092445,0.0015383196,0.0003340549],"domain_scores_gemma":[0.92411155,0.052780274,0.0050869896,0.004928963,0.01127434,0.001817783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008710824,0.0005904945,0.00071162457,0.0027117094,0.00079069054,0.0015764221,0.00062681246,0.0011309254,0.0012828552],"category_scores_gemma":[0.041826174,0.0003520348,0.00053603924,0.0019023309,0.0007639134,0.0030564724,0.00097191357,0.000565633,0.00086626003],"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.007250685,0.0037206532,0.7025743,0.00077049504,0.0004683455,0.00057414034,0.0040682065,0.0064651095,0.019431867,0.0015433712,0.0031798114,0.24995297],"study_design_scores_gemma":[0.00018153725,0.009466538,0.906532,0.000097856566,0.00032627504,0.0010488345,0.0026523531,0.06347507,0.012214982,0.0010906606,0.0027529707,0.00016087726],"about_ca_topic_score_codex":0.003477796,"about_ca_topic_score_gemma":0.0049453527,"teacher_disagreement_score":0.008710824,"about_ca_system_score_codex":0.00096337934,"about_ca_system_score_gemma":0.0007242613,"threshold_uncertainty_score":0.046067774},"labels":[],"label_agreement":null},{"id":"W2066124181","doi":"10.1109/aina.2006.345","title":"Video transcoding using network processors to support dynamically adaptive video multicast","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of Manitoba","funders":"University of Manitoba","keywords":"Multicast; Transcoding; Computer science; Computer network; Video quality; Enhanced Data Rates for GSM Evolution; Network packet; Real-time computing; Artificial intelligence","score_opus":0.026168149929227894,"score_gpt":0.2471273794060945,"score_spread":0.2209592294768666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066124181","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.680506,0.00062929426,0.3086834,0.00013957507,0.00007435036,0.00021861376,0.000042178122,0.0027543213,0.0069522797],"genre_scores_gemma":[0.9045474,0.00016394861,0.09315008,0.000054385655,0.000020577623,0.000045668214,0.00008924483,0.00004978292,0.0018788012],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982303,0.000040147163,0.000013056393,0.000034148317,0.00006740551,0.000022101174],"domain_scores_gemma":[0.9992774,0.00020859661,0.000062766485,0.000112963724,0.0003024283,0.00003576654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035363072,0.00022265717,0.00023104117,0.00027550492,0.00014670605,0.0003897318,0.0006561983,0.00020269203,0.0007447064],"category_scores_gemma":[0.0013810956,0.0001450588,0.00009561657,0.00016185602,0.0001159305,0.00044614353,0.00023343101,0.0003677173,0.00015588541],"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.0010644186,0.0003814677,0.0059590493,0.00015563055,0.00007383421,0.00045933307,0.00019740661,0.03807702,0.62094545,0.0028842813,0.0028862103,0.32691598],"study_design_scores_gemma":[0.00019543908,0.0015396813,0.005911782,0.000031231568,0.00017568888,0.0015638102,0.00006504911,0.7080598,0.27085936,0.0014227992,0.010140185,0.000035194385],"about_ca_topic_score_codex":0.0009553227,"about_ca_topic_score_gemma":0.0010517772,"teacher_disagreement_score":0.0009553227,"about_ca_system_score_codex":0.00027023995,"about_ca_system_score_gemma":0.00023583048,"threshold_uncertainty_score":0.0024912953},"labels":[],"label_agreement":null},{"id":"W2066128925","doi":"10.1016/j.future.2005.08.003","title":"Web object-based storage management in proxy caches","year":2005,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Pittsburgh","keywords":"Computer science; Cache; Proxy (statistics); Latency (audio); Operating system; Storage management; Page cache; CPU cache; Database; Cache algorithms; Distributed computing","score_opus":0.015112434346808618,"score_gpt":0.21136570992051038,"score_spread":0.19625327557370176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066128925","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.60732335,0.004618091,0.36180082,0.0010464548,0.00035897418,0.00018796806,0.00048478894,0.006198665,0.017980946],"genre_scores_gemma":[0.9679515,0.000521689,0.02599199,0.000049784016,0.00007109725,0.00003247138,0.00022440088,0.00013570773,0.0050215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991603,0.0002057249,0.00008524746,0.000091615184,0.00029264536,0.00016449785],"domain_scores_gemma":[0.997324,0.0006450497,0.00019528161,0.00090912735,0.00070572994,0.00022079294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015376864,0.00030924423,0.0008448492,0.0008792543,0.0013589917,0.0039519314,0.0017698742,0.0010261564,0.0020296334],"category_scores_gemma":[0.003791987,0.0004464962,0.00023592314,0.0019138787,0.00070270966,0.0032393546,0.0008359083,0.0005407793,0.000556725],"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.0031147748,0.001024618,0.019705826,0.0005720279,0.00019836398,0.0014174631,0.0019562575,0.26436105,0.08799803,0.16610941,0.028859796,0.42468235],"study_design_scores_gemma":[0.00007809742,0.00014449237,0.0023057282,0.000033946028,0.00010715,0.00034888397,0.00035456722,0.91971266,0.040430687,0.026333423,0.0100964,0.000054001768],"about_ca_topic_score_codex":0.006867982,"about_ca_topic_score_gemma":0.0064181876,"teacher_disagreement_score":0.006867982,"about_ca_system_score_codex":0.0015792144,"about_ca_system_score_gemma":0.0012904647,"threshold_uncertainty_score":0.01365602},"labels":[],"label_agreement":null},{"id":"W2067583486","doi":"10.1109/tpds.2008.80","title":"Cooperative Secondary Authorization Recycling","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"","keywords":"Computer science; Authorization; Scalability; Server; Cache; Software deployment; Authorization certificate; Computer network; Distributed computing; Computer security; Operating system; Public-key cryptography; Certificate authority","score_opus":0.028073293452751984,"score_gpt":0.22803265951832696,"score_spread":0.199959366065575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067583486","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.22725879,0.0006624697,0.72378755,0.0005771621,0.0001653604,0.0011197331,0.0002521872,0.024490938,0.021685733],"genre_scores_gemma":[0.91152257,0.00014914385,0.073143356,0.00026969038,0.00008448586,0.00024028268,0.00033812204,0.00045044796,0.013801887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956831,0.0010286368,0.00031635858,0.0008484291,0.0014144836,0.00070900534],"domain_scores_gemma":[0.9778315,0.0034852386,0.0015780238,0.012018673,0.004091018,0.0009955034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037387596,0.0011112473,0.0017345755,0.0019268254,0.002318512,0.002414933,0.0034739033,0.0012887175,0.00602369],"category_scores_gemma":[0.009485149,0.00058595504,0.0009824801,0.0014062364,0.0017901235,0.0037981237,0.0044475477,0.00165746,0.002756939],"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.0035220499,0.002073428,0.0147876395,0.00065708155,0.00036446663,0.0016119308,0.0030667442,0.048307456,0.1917836,0.049986582,0.024066433,0.65977263],"study_design_scores_gemma":[0.00041892275,0.0017292707,0.0072263693,0.0001518649,0.00036343499,0.004744043,0.001160747,0.5618344,0.28029358,0.041805986,0.09986749,0.00040398113],"about_ca_topic_score_codex":0.0035737695,"about_ca_topic_score_gemma":0.0028188305,"teacher_disagreement_score":0.00602369,"about_ca_system_score_codex":0.0012135786,"about_ca_system_score_gemma":0.0028582609,"threshold_uncertainty_score":0.020151198},"labels":[],"label_agreement":null},{"id":"W2069118956","doi":"10.1145/2523001.2523005","title":"Propagation-based social-aware multimedia content distribution","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Locality; World Wide Web; Backup; Social network (sociolinguistics); Cache; The Internet; Context (archaeology); Multimedia; Social media; Architecture; Locality of reference; Computer network; Database","score_opus":0.040348600994923614,"score_gpt":0.266989520746035,"score_spread":0.2266409197511114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069118956","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.19372442,0.00043957957,0.7997519,0.0003979224,0.000041246756,0.00020884998,0.00013826208,0.002585872,0.0027119962],"genre_scores_gemma":[0.953124,0.00014932125,0.045535795,0.000047263078,0.000027479351,0.00004529914,0.00009345327,0.000056327535,0.00092099444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910295,0.00027102957,0.00004392358,0.00021224475,0.00027296908,0.00009683008],"domain_scores_gemma":[0.9958556,0.0017706637,0.00053089065,0.0005914174,0.0010005466,0.00025081402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507633,0.00076540426,0.0006857341,0.0011762505,0.0010870539,0.0012226811,0.0017964485,0.0006477537,0.00062430336],"category_scores_gemma":[0.0062281652,0.00045001242,0.00038813087,0.0008996109,0.0006778041,0.0019055741,0.0010832513,0.00092584663,0.00021191202],"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.00048088515,0.00058675447,0.027620556,0.0001683418,0.00019498401,0.00025758345,0.0007055347,0.66594106,0.04787979,0.015035225,0.0033298968,0.23779936],"study_design_scores_gemma":[0.000009117397,0.00004636059,0.0015931592,0.0000028445652,0.000022432547,0.0000373521,0.00004405848,0.991559,0.00417748,0.0019892056,0.00050272734,0.00001629741],"about_ca_topic_score_codex":0.014032072,"about_ca_topic_score_gemma":0.018119778,"teacher_disagreement_score":0.014032072,"about_ca_system_score_codex":0.0016887529,"about_ca_system_score_gemma":0.0014590077,"threshold_uncertainty_score":0.027900755},"labels":[],"label_agreement":null},{"id":"W2069307110","doi":"10.1145/1529282.1529629","title":"Exploiting join cardinality for faster hash joins","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Joins; Join (topology); Computer science; Cardinality (data modeling); Hash join; Hash function; Theoretical computer science; Parallel computing; Database; Mathematics; Programming language","score_opus":0.04712684653484023,"score_gpt":0.26108584233209914,"score_spread":0.2139589957972589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069307110","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.2785953,0.0009089861,0.7067398,0.0005750552,0.00013535724,0.00024589917,0.00042892157,0.007182198,0.0051885317],"genre_scores_gemma":[0.6754754,0.00024846432,0.32153693,0.00010041044,0.00012225573,0.00010338414,0.00071836624,0.0005163221,0.0011784184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950092,0.0011413912,0.0005951346,0.0007398931,0.0020970607,0.0004173234],"domain_scores_gemma":[0.98071736,0.010190631,0.0017477764,0.0050479965,0.0017963311,0.0004999087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063821706,0.00077432214,0.00092241523,0.0013560563,0.001503487,0.0028683217,0.0016698694,0.0006899859,0.0017867082],"category_scores_gemma":[0.015480004,0.0008350071,0.0005678932,0.0013532316,0.0010990283,0.0072769765,0.0037978385,0.0014984258,0.000708526],"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.003101189,0.0008490311,0.045322962,0.0005548783,0.00022534629,0.00045666823,0.0018580914,0.12372368,0.32816884,0.05344352,0.008016206,0.43427965],"study_design_scores_gemma":[0.00026172548,0.00083592243,0.006899834,0.00006309672,0.0001467517,0.0007082815,0.00066704745,0.58245075,0.3453331,0.04161677,0.020822745,0.00019398457],"about_ca_topic_score_codex":0.0010663839,"about_ca_topic_score_gemma":0.0020113315,"teacher_disagreement_score":0.0063821706,"about_ca_system_score_codex":0.0009567992,"about_ca_system_score_gemma":0.0019409788,"threshold_uncertainty_score":0.0337525},"labels":[],"label_agreement":null},{"id":"W2072391395","doi":"10.1155/2012/915178","title":"NCOR: An FPGA-Friendly Nonblocking Data Cache for Soft Processors with Runahead Execution","year":2011,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stratix; Cache; Parallel computing; Blocking (statistics); Embedded system; Field-programmable gate array; Exploit; CPU cache; Computer network","score_opus":0.08094944728558687,"score_gpt":0.29649599788628545,"score_spread":0.21554655060069858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072391395","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.3102017,0.0060673156,0.61232364,0.00064073084,0.00059105305,0.0004590548,0.000770209,0.017299602,0.05164661],"genre_scores_gemma":[0.81270033,0.0010347569,0.15701903,0.00037619032,0.00008676696,0.00012923886,0.0010777926,0.00035889144,0.027217025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974364,0.000024658646,0.000026583542,0.00003063417,0.0001221491,0.00005227434],"domain_scores_gemma":[0.9995024,0.00005995003,0.00010278826,0.0001386625,0.00015106187,0.000045050405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021292531,0.00035001108,0.00030548082,0.00038018942,0.00037691533,0.0007284939,0.0015290973,0.0002443947,0.0031705329],"category_scores_gemma":[0.00045304297,0.0001783888,0.00018550534,0.0005015083,0.00021369675,0.0008172838,0.00035773922,0.00038073907,0.00076521205],"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.002982199,0.00047748667,0.0059956736,0.0012025475,0.00021362936,0.0009435285,0.00030012723,0.035573196,0.3744751,0.039454475,0.030298771,0.5080833],"study_design_scores_gemma":[0.00044660858,0.0018837402,0.0038186144,0.000120249904,0.00027817104,0.0014544337,0.00013854203,0.30671847,0.4919062,0.004176796,0.18886487,0.00019335403],"about_ca_topic_score_codex":0.0029179675,"about_ca_topic_score_gemma":0.011602326,"teacher_disagreement_score":0.0031705329,"about_ca_system_score_codex":0.0008145769,"about_ca_system_score_gemma":0.0013010771,"threshold_uncertainty_score":0.010606468},"labels":[],"label_agreement":null},{"id":"W2072399505","doi":"10.1109/glocom.2014.7037538","title":"MPCS: A mobility/popularity-based caching strategy for information-centric networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":27,"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":"Popularity; Computer science; Computer network; The Internet; Cache; Mobile device; Information-centric networking; Cellular network; World Wide Web","score_opus":0.01687119841608658,"score_gpt":0.2302412726051679,"score_spread":0.21337007418908133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072399505","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.05869996,0.0015656935,0.9309464,0.00049405295,0.00012934514,0.00018670675,0.00017054341,0.00187399,0.005933299],"genre_scores_gemma":[0.92055875,0.0005989352,0.075672716,0.00010721913,0.000085144406,0.0000836269,0.00011499215,0.00006705559,0.0027115229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994867,0.00012937178,0.000034535205,0.00007228186,0.00018423387,0.000092883914],"domain_scores_gemma":[0.99872524,0.00035451006,0.00017410019,0.00022682986,0.00041913253,0.00010031188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007832671,0.0006286378,0.00077875284,0.00097081467,0.0007475334,0.0009190527,0.0021184173,0.000665072,0.0010616452],"category_scores_gemma":[0.0025985667,0.0002799386,0.0003858101,0.0011023107,0.00067498774,0.0015917503,0.0009272957,0.00051516306,0.00026948302],"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.0003483098,0.00022024766,0.004268965,0.000308538,0.0001484783,0.0005310971,0.000290304,0.6333752,0.033601332,0.09395845,0.010340704,0.22260839],"study_design_scores_gemma":[0.000011876764,0.000053705946,0.00024321098,0.0000084784915,0.000024154218,0.000120722034,0.000022003973,0.9895801,0.0028567712,0.005015409,0.0020477644,0.000015830636],"about_ca_topic_score_codex":0.00858657,"about_ca_topic_score_gemma":0.009629226,"teacher_disagreement_score":0.00858657,"about_ca_system_score_codex":0.0019004189,"about_ca_system_score_gemma":0.0018576416,"threshold_uncertainty_score":0.017073154},"labels":[],"label_agreement":null},{"id":"W2073444753","doi":"10.1109/ccece.2014.6901098","title":"Optimization of distributed communication architectures in advanced metering infrastructure of smart grid","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"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":"Scalability; Computer science; Smart grid; Distributed computing; Software deployment; Grid; Communications system; Data center; Computer network; Engineering; Operating system","score_opus":0.006155222305506872,"score_gpt":0.20934946040117788,"score_spread":0.203194238095671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073444753","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.23791474,0.00092980143,0.74997246,0.0006592155,0.00004735279,0.00010933042,0.00007556591,0.00030472878,0.009986752],"genre_scores_gemma":[0.9575291,0.00022909763,0.040912077,0.000029084082,0.000012890299,0.00007953175,0.000033431897,0.000022928483,0.0011518907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00017042739,0.000011347223,0.000064409,0.000089959016,0.000060443454],"domain_scores_gemma":[0.9991725,0.00053175597,0.00010075546,0.000033783173,0.00012742357,0.000033740613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292347,0.0006588032,0.00045907238,0.00042591887,0.00045919165,0.00062698306,0.000488314,0.0006238317,0.00086298765],"category_scores_gemma":[0.0021373294,0.00033999732,0.00024615446,0.0006352869,0.0006150631,0.0010188047,0.0005627834,0.0004782619,0.00008965471],"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.000010219991,0.00000654324,0.00014827341,0.000009882692,0.0000028818097,0.0000129203645,0.0000072735297,0.9946333,0.0003845531,0.0016978171,0.00010685245,0.0029794422],"study_design_scores_gemma":[0.0000051616794,0.000017662447,0.000106077525,0.0000015153283,0.0000025619022,0.000004563924,0.000009591704,0.9983203,0.00018172777,0.0012150551,0.00013372587,0.0000019084505],"about_ca_topic_score_codex":0.004746317,"about_ca_topic_score_gemma":0.0045116534,"teacher_disagreement_score":0.004746317,"about_ca_system_score_codex":0.0016480797,"about_ca_system_score_gemma":0.0011398369,"threshold_uncertainty_score":0.011957765},"labels":[],"label_agreement":null},{"id":"W2074308927","doi":"10.1109/lcn.2014.6925758","title":"Resource allocation and request handling for user-aware content retrieval in the cloud","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Exploit; Software deployment; Resource allocation; Resource (disambiguation); TRACE (psycholinguistics); Distributed computing; Quality of service; Resource management (computing); Service (business); Database; Computer network; Computer security; Operating system","score_opus":0.0391910721690405,"score_gpt":0.2396470349459171,"score_spread":0.2004559627768766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074308927","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.05923092,0.0005263856,0.9334209,0.00042601058,0.00005247553,0.00025236077,0.000089519635,0.0019622797,0.004039065],"genre_scores_gemma":[0.7225164,0.00023705223,0.2748395,0.000107940294,0.00004230596,0.00014206587,0.000104241575,0.00014989427,0.0018605894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988487,0.00041257037,0.00005597905,0.00015302148,0.0002627402,0.00026697552],"domain_scores_gemma":[0.99799806,0.0009606667,0.000198328,0.00045420812,0.00025270967,0.00013603286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012464831,0.0007235714,0.0009283756,0.00065029913,0.0011825153,0.0018115409,0.0017960243,0.0013220501,0.002977894],"category_scores_gemma":[0.0043379106,0.00035091583,0.0004577294,0.0014216664,0.0007434283,0.0017295469,0.0011162269,0.0008218482,0.00088966795],"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.00088199554,0.00044608657,0.0027897249,0.00031944615,0.00006136578,0.0002627185,0.00038446562,0.70977455,0.031419728,0.037917595,0.008957471,0.20678483],"study_design_scores_gemma":[0.000020069083,0.000027329348,0.00016989137,0.0000037002972,0.000006605533,0.000052742536,0.000035066656,0.993915,0.002429858,0.0027158828,0.0006145208,0.000009350086],"about_ca_topic_score_codex":0.012367926,"about_ca_topic_score_gemma":0.014415521,"teacher_disagreement_score":0.012367926,"about_ca_system_score_codex":0.0022167861,"about_ca_system_score_gemma":0.0029180523,"threshold_uncertainty_score":0.024591863},"labels":[],"label_agreement":null},{"id":"W2075530749","doi":"10.1109/mobserv.2014.25","title":"Intrusion Prevention in Asterisk-Based Telephony System","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Asterisk; Computer science; Computer security; Computer network; Telephony; Denial-of-service attack; Middleware (distributed applications); Intrusion detection system; Call control; Voice over IP; Operating system; The Internet","score_opus":0.010052401060223167,"score_gpt":0.2087744374221875,"score_spread":0.1987220363619643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075530749","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.8082919,0.0010225233,0.17065044,0.00039188872,0.00013535177,0.00023147314,0.00011029026,0.012855415,0.0063107647],"genre_scores_gemma":[0.98696136,0.00008887154,0.011770761,0.00005307076,0.000008894823,0.000016749935,0.000045915553,0.000022491513,0.001031861],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992021,0.00014421972,0.00009802503,0.00016793048,0.000232814,0.00015489229],"domain_scores_gemma":[0.99896836,0.00016676683,0.00020102016,0.00032600953,0.00025063503,0.00008715166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057353,0.00035386372,0.0004268375,0.00040978732,0.0004894128,0.00084121356,0.0008553316,0.00052392745,0.00084822095],"category_scores_gemma":[0.0010405454,0.00013852736,0.00022523694,0.0002672292,0.00030813678,0.0010930039,0.00075203093,0.00038712463,0.00036717908],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0036830748,0.0011131165,0.031073963,0.00058735936,0.0002819989,0.004095876,0.0015979403,0.06656309,0.5197482,0.010324432,0.010906783,0.35002413],"study_design_scores_gemma":[0.0001278094,0.0011563329,0.0153533695,0.000068965164,0.00019995355,0.0026364173,0.00044328562,0.5853702,0.37756205,0.0019594573,0.015047597,0.0000745104],"about_ca_topic_score_codex":0.00088199304,"about_ca_topic_score_gemma":0.00045840358,"teacher_disagreement_score":0.00088199304,"about_ca_system_score_codex":0.00043601153,"about_ca_system_score_gemma":0.0005080204,"threshold_uncertainty_score":0.003163457},"labels":[],"label_agreement":null},{"id":"W2075718096","doi":"10.1109/jsac.2013.sup.0513027","title":"A Naming Scheme for P2P Web Hosting","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Scalability; Single point of failure; Dynamism; Scheme (mathematics); Peer-to-peer; Overhead (engineering); Resilience (materials science); Fault tolerance; High availability; Computer network; Distributed computing; Web application; World Wide Web; Database; Operating system","score_opus":0.04386765718388657,"score_gpt":0.28839413544397535,"score_spread":0.24452647826008878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075718096","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.015659703,0.0004165827,0.9739819,0.0007394337,0.00035115663,0.00036122955,0.00008104208,0.0012688352,0.007140088],"genre_scores_gemma":[0.44800928,0.000756804,0.54229087,0.00034076424,0.0002960684,0.0006325446,0.00029481616,0.0001905993,0.0071882843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969035,0.0010793584,0.00045993674,0.0003157691,0.0010530747,0.0001884544],"domain_scores_gemma":[0.993458,0.0015607664,0.00074091804,0.0027182195,0.0012278738,0.00029428332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004111046,0.0005418719,0.0007313131,0.0010162271,0.0028722754,0.0022360513,0.002205239,0.0021047224,0.0015572802],"category_scores_gemma":[0.00855636,0.00037120684,0.0005622223,0.0012209975,0.0020108933,0.006678601,0.0028571198,0.0016846724,0.00081798155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00032611974,0.00013868438,0.0012519171,0.00033554324,0.000040090887,0.0006608852,0.0009035749,0.04696328,0.038887303,0.7325893,0.009414353,0.16848896],"study_design_scores_gemma":[0.000219151,0.0005392392,0.0007386789,0.000093613715,0.0001080219,0.0020485206,0.00032506842,0.6223959,0.02881074,0.22905064,0.115416296,0.00025422132],"about_ca_topic_score_codex":0.0016781641,"about_ca_topic_score_gemma":0.0014608004,"teacher_disagreement_score":0.004111046,"about_ca_system_score_codex":0.001554182,"about_ca_system_score_gemma":0.0022268856,"threshold_uncertainty_score":0.021741569},"labels":[],"label_agreement":null},{"id":"W2076500085","doi":"10.1117/12.449986","title":"<title>Image transcoding for wireless WWW access: the user perspective</title>","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Transcoding; Computer science; Server; Wireless; Mobile device; Bandwidth (computing); Proxy server; Software; Computer network; Real-time computing; Operating system","score_opus":0.01665292005063791,"score_gpt":0.2442211146195766,"score_spread":0.2275681945689387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076500085","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.34940758,0.02095613,0.44213054,0.016332585,0.002416029,0.00044553884,0.00086572085,0.0062885694,0.16115734],"genre_scores_gemma":[0.81395876,0.012978429,0.10620452,0.00096806197,0.00089862273,0.00007444741,0.00060220214,0.00081992615,0.06349505],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995158,0.00017355342,0.000033782828,0.000039864553,0.00019249691,0.00004441292],"domain_scores_gemma":[0.99761224,0.0008524012,0.00007281847,0.0002112138,0.0011164402,0.00013488617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000997228,0.00029017025,0.0003328704,0.000572465,0.00032950967,0.0017957294,0.00045470824,0.00056057534,0.011135425],"category_scores_gemma":[0.0026235387,0.00015711115,0.00017437781,0.0008708821,0.00039337226,0.0017567313,0.00029087323,0.00046547453,0.0028560574],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095330446,0.00026036816,0.015365576,0.0006763504,0.00004648202,0.001406917,0.0007593005,0.004387851,0.19568588,0.013612766,0.06344367,0.70340157],"study_design_scores_gemma":[0.00012603651,0.003093442,0.038542543,0.000551443,0.0002850535,0.010428318,0.0028839922,0.2027534,0.41836074,0.009274382,0.31340054,0.00030005892],"about_ca_topic_score_codex":0.0020795658,"about_ca_topic_score_gemma":0.004583768,"teacher_disagreement_score":0.011135425,"about_ca_system_score_codex":0.00046166772,"about_ca_system_score_gemma":0.0003123614,"threshold_uncertainty_score":0.03725171},"labels":[],"label_agreement":null},{"id":"W2076589318","doi":"10.1016/j.procs.2011.07.081","title":"Using a Cloud-Hosted Proxy to support Mobile Consumers of RESTful Services","year":2011,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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 Saskatchewan","funders":"","keywords":"Computer science; Cloud computing; World Wide Web; Mobile Web; Mobile device; Web service; The Internet; Mobile computing; Mobile cloud computing; Proxy server; Mobile technology; Computer network; Operating system","score_opus":0.04701210453584197,"score_gpt":0.2697621088200591,"score_spread":0.2227500042842171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076589318","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.67500526,0.0014105063,0.2944254,0.0012117547,0.000259406,0.00037071964,0.00010156594,0.008754343,0.018461056],"genre_scores_gemma":[0.97156966,0.0001628333,0.025210306,0.00012901299,0.00002933336,0.000031273656,0.00006247491,0.00012875661,0.002676428],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971026,0.000057784117,0.000031844018,0.00004132674,0.000064162305,0.00009465101],"domain_scores_gemma":[0.99889994,0.00016222389,0.00010199943,0.00040674015,0.0002562581,0.00017281329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040676072,0.0003141563,0.00046177837,0.0003514066,0.0007531967,0.0013937013,0.0010886893,0.00086538546,0.0013256902],"category_scores_gemma":[0.001396141,0.00024811082,0.00028081084,0.0004750999,0.00036004148,0.0016863411,0.001231356,0.0006680278,0.00046654578],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0046566306,0.0013316872,0.022575684,0.00053333136,0.00020668608,0.007674096,0.0023569348,0.020194756,0.5586684,0.07243917,0.018743055,0.29061967],"study_design_scores_gemma":[0.00048244852,0.0007334994,0.007993208,0.000116949515,0.00041405222,0.003700732,0.00073246827,0.57640636,0.3447302,0.008351974,0.056142423,0.0001957352],"about_ca_topic_score_codex":0.0028657452,"about_ca_topic_score_gemma":0.0024554096,"teacher_disagreement_score":0.0028657452,"about_ca_system_score_codex":0.0005518566,"about_ca_system_score_gemma":0.0006651516,"threshold_uncertainty_score":0.005698085},"labels":[],"label_agreement":null},{"id":"W2078782914","doi":"10.1016/j.jnca.2013.09.009","title":"Rich Mobile Applications: Genesis, taxonomy, and open issues","year":2013,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Ministry of Higher Education, Malaysia","keywords":"Computer science; Blueprint; Taxonomy (biology); World Wide Web; Mobile device; Cloud computing; Open research; Data science; Human–computer interaction","score_opus":0.020688207863462618,"score_gpt":0.2508504096136206,"score_spread":0.23016220175015797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078782914","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15666856,0.4555415,0.16050167,0.08572698,0.0019348382,0.0003910009,0.0007840958,0.0011008123,0.13735054],"genre_scores_gemma":[0.640438,0.23903383,0.09593019,0.00507409,0.0040183137,0.00041721272,0.0006933253,0.00038734043,0.014007606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969434,0.00076853175,0.00037108254,0.00050130964,0.0010241717,0.0003915053],"domain_scores_gemma":[0.9883564,0.0054959394,0.00088765164,0.0015217446,0.0027037272,0.0010344444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037088927,0.00060694973,0.0013259838,0.0077003166,0.0040650885,0.01641758,0.0021965788,0.0041406555,0.002357521],"category_scores_gemma":[0.0094793085,0.0009806051,0.0006422296,0.009263566,0.011298531,0.03220037,0.0042584008,0.0053023472,0.00069739943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00006179824,0.00015882328,0.008717839,0.00049887656,0.000015809106,0.0003132849,0.0044806157,0.0007120298,0.0010421176,0.8450542,0.005163621,0.1337809],"study_design_scores_gemma":[0.000019834742,0.0002663517,0.00878561,0.0020836312,0.000047129735,0.0059352433,0.011287276,0.012163743,0.001481915,0.5768991,0.38089514,0.00013499206],"about_ca_topic_score_codex":0.0025676128,"about_ca_topic_score_gemma":0.0035272879,"teacher_disagreement_score":0.01641758,"about_ca_system_score_codex":0.0035456542,"about_ca_system_score_gemma":0.003897771,"threshold_uncertainty_score":0.025725663},"labels":[],"label_agreement":null},{"id":"W2079400051","doi":"10.1145/2512921.2512925","title":"Semantic based networking of information in vehicular clouds based on dimensionality reduction","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Exploit; Cloud computing; The Internet; Semantics (computer science); Cluster analysis; Protocol (science); Computer network; Distributed computing; World Wide Web; Computer security; Artificial intelligence","score_opus":0.011527221331334107,"score_gpt":0.2037722591276166,"score_spread":0.1922450377962825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079400051","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.058008157,0.00036167726,0.93789554,0.00031782468,0.00005753362,0.00007933381,0.00009686655,0.00024358937,0.0029395462],"genre_scores_gemma":[0.8467366,0.00039567944,0.15150441,0.000068112815,0.000046283483,0.000079540645,0.00019343138,0.000027626325,0.0009481741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992138,0.0003133713,0.00004175643,0.000088831905,0.0002551674,0.000087013934],"domain_scores_gemma":[0.99912864,0.00035160416,0.00011737991,0.00017837959,0.00017767078,0.000046276105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069892505,0.00040136412,0.0008267715,0.0007575633,0.0009385291,0.0013495577,0.00070300634,0.0005400566,0.00053216587],"category_scores_gemma":[0.0024040707,0.00022325432,0.0006139665,0.0011172444,0.0007414391,0.0019759922,0.0013637104,0.0006157206,0.00015239864],"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.00008772462,0.000071114635,0.001395606,0.00008969435,0.00005164786,0.00015065896,0.00021506217,0.84630764,0.0063578906,0.086802274,0.0017470482,0.05672361],"study_design_scores_gemma":[0.0000019795395,0.000012880108,0.00018092403,0.0000030230206,0.000004475948,0.00003069214,0.0000449822,0.98632646,0.0007824995,0.0120625235,0.0005428736,0.000006689642],"about_ca_topic_score_codex":0.004326109,"about_ca_topic_score_gemma":0.0044089495,"teacher_disagreement_score":0.004326109,"about_ca_system_score_codex":0.0011679333,"about_ca_system_score_gemma":0.0009077382,"threshold_uncertainty_score":0.008601844},"labels":[],"label_agreement":null},{"id":"W2081092554","doi":"10.1109/tnet.2007.896499","title":"A Framework for Evaluating the Performance of Cluster Algorithms for Hierarchical Networks","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Hierarchical network model; Hierarchical clustering; Scalability; Algorithm; Routing table; Hierarchical routing; Canopy clustering algorithm; Routing (electronic design automation); Hierarchy; Correlation clustering; Routing protocol; Static routing; Machine learning; Computer network","score_opus":0.0744156281436579,"score_gpt":0.33880117369311996,"score_spread":0.26438554554946203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081092554","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.07229095,0.00086177135,0.91801476,0.0002433955,0.000098757766,0.001118599,0.0006751183,0.001389775,0.0053067715],"genre_scores_gemma":[0.43853363,0.00049464026,0.5572809,0.000119667915,0.000056231882,0.0018231524,0.0007074468,0.000259161,0.0007251591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98981935,0.0049722274,0.00059621537,0.00068180216,0.0032853512,0.00064510526],"domain_scores_gemma":[0.97828126,0.01413496,0.0017479282,0.0029047884,0.0026058045,0.0003253671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012753861,0.0019267612,0.0016921149,0.0053626806,0.0014357187,0.0024542254,0.0023916753,0.0024969238,0.0014148854],"category_scores_gemma":[0.04228688,0.00046160456,0.001531342,0.0046929456,0.0018282362,0.003245038,0.0019851916,0.0018489249,0.00039830114],"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.00042005905,0.00040614686,0.004146945,0.00029239227,0.00029945892,0.000058990634,0.00014065251,0.88981104,0.0058006695,0.049010128,0.001974532,0.047639083],"study_design_scores_gemma":[0.000059973994,0.00084194104,0.0016606774,0.00003867665,0.00005387084,0.00007059065,0.00011362942,0.97737473,0.0046320986,0.013234091,0.0018715976,0.000047974394],"about_ca_topic_score_codex":0.004968696,"about_ca_topic_score_gemma":0.0024810913,"teacher_disagreement_score":0.012753861,"about_ca_system_score_codex":0.0027644706,"about_ca_system_score_gemma":0.0018045746,"threshold_uncertainty_score":0.06744969},"labels":[],"label_agreement":null},{"id":"W2081533422","doi":"10.1145/1142473.1142477","title":"Approximately detecting duplicates for streaming data using stable bloom filters","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bloom filter; Computer science; Bloom; Algorithm; Geology; Oceanography","score_opus":0.07897033358739501,"score_gpt":0.2734447982760055,"score_spread":0.19447446468861046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081533422","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.03948731,0.0004433536,0.95727736,0.00021466677,0.000033944325,0.00013703445,0.00024093824,0.0016707578,0.00049469434],"genre_scores_gemma":[0.33401084,0.00051922566,0.6634849,0.000108433334,0.00006504359,0.0001744314,0.00042939582,0.00009118853,0.001116484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697185,0.0007654475,0.00029147996,0.0004348588,0.0013750738,0.00016123893],"domain_scores_gemma":[0.9770827,0.013238132,0.0020099767,0.0041802316,0.0031310206,0.00035791067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004387762,0.00087839307,0.0014256842,0.002837578,0.0011464396,0.0022936338,0.0020883477,0.0015830646,0.001012794],"category_scores_gemma":[0.029742042,0.00075294153,0.0007216467,0.0026214074,0.0010010522,0.005332868,0.0015166561,0.0009212247,0.0005201106],"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.0013247851,0.00019090764,0.017354172,0.0005998545,0.0002506193,0.00042858388,0.0008054415,0.13330744,0.0649826,0.0361138,0.005226873,0.7394149],"study_design_scores_gemma":[0.00011873614,0.00025777804,0.002204781,0.000054107877,0.00008832637,0.0009567601,0.00022025658,0.8943124,0.05938416,0.03747567,0.0048240293,0.000103034385],"about_ca_topic_score_codex":0.003743062,"about_ca_topic_score_gemma":0.0033293164,"teacher_disagreement_score":0.004387762,"about_ca_system_score_codex":0.0016359448,"about_ca_system_score_gemma":0.0028346356,"threshold_uncertainty_score":0.023204982},"labels":[],"label_agreement":null},{"id":"W2081869611","doi":"10.5555/1070432.1070548","title":"An optimal Bloom filter replacement","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":153,"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":"Bloom filter; Hash function; Data structure; Set (abstract data type); Computer science; Element (criminal law); Representation (politics); Amortized analysis; Filter (signal processing); Algorithm; Theoretical computer science; Function (biology); Perfect hash function; Constant (computer programming); Bloom; Hash table","score_opus":0.01162427078857109,"score_gpt":0.25175601308317175,"score_spread":0.24013174229460066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081869611","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.07107142,0.0018007198,0.90750986,0.0017233896,0.0003736129,0.0003150904,0.0008269556,0.0026903567,0.013688641],"genre_scores_gemma":[0.30487305,0.00081545644,0.6775182,0.0007263798,0.000213965,0.00033243786,0.000981561,0.00028414046,0.014254862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758255,0.0005144984,0.00019426718,0.0004757983,0.00088112307,0.0003516971],"domain_scores_gemma":[0.9964348,0.00091335445,0.00019738739,0.0017632068,0.0005334082,0.00015779037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017686472,0.00053174706,0.0018678514,0.0013328482,0.0013082592,0.0019046873,0.00266751,0.0017076709,0.006359504],"category_scores_gemma":[0.009030839,0.00056788424,0.0008486381,0.0023397552,0.00091594446,0.00551276,0.002124021,0.00092838303,0.0019492306],"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.0017012084,0.00054199825,0.0045773257,0.00041871477,0.00012505433,0.00034787005,0.000587506,0.058279086,0.027653864,0.209156,0.03307498,0.6635363],"study_design_scores_gemma":[0.00043462546,0.0005836484,0.001035868,0.0001598012,0.00014771728,0.0015069203,0.00034305523,0.7292411,0.029832855,0.15888226,0.0777438,0.00008838976],"about_ca_topic_score_codex":0.0023038303,"about_ca_topic_score_gemma":0.002465424,"teacher_disagreement_score":0.006359504,"about_ca_system_score_codex":0.0021219905,"about_ca_system_score_gemma":0.003265819,"threshold_uncertainty_score":0.021274686},"labels":[],"label_agreement":null},{"id":"W2084968992","doi":"10.1049/iet-net.2014.0105","title":"Investigation on software‐defined networks’ reactive routing against BitTorrent","year":2015,"lang":"en","type":"article","venue":"IET Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"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; Agence Nationale de la Recherche","keywords":"BitTorrent; Computer network; Computer science; Network topology; Topology (electrical circuits); Logical topology; Distributed computing; Routing (electronic design automation); Routing protocol; Peer-to-peer; Mathematics","score_opus":0.05535742570068246,"score_gpt":0.2270115409873819,"score_spread":0.17165411528669944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084968992","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.9315444,0.0011379863,0.05085169,0.0008992217,0.00026184146,0.00022767628,0.000079956575,0.0007200583,0.014277107],"genre_scores_gemma":[0.9914358,0.0002581961,0.0072995173,0.00012449427,0.000016442593,0.000025789994,0.000063404936,0.000027154923,0.00074917247],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519724,0.0020222338,0.00023997508,0.00034156372,0.0018366901,0.00036225928],"domain_scores_gemma":[0.9856624,0.007563615,0.0010393356,0.0015838571,0.0038296755,0.00032119695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004729453,0.00044802294,0.00044386092,0.00094508764,0.0007028265,0.0014651456,0.0014546306,0.0007478352,0.0008634679],"category_scores_gemma":[0.014159188,0.00016881445,0.00029976462,0.00062357425,0.00063192606,0.0017034075,0.0005096863,0.00072784926,0.00017617794],"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.003645029,0.001836277,0.03036238,0.0016485999,0.00070506136,0.002190892,0.002262035,0.27661368,0.3792836,0.046923354,0.0064866734,0.24804235],"study_design_scores_gemma":[0.000073594405,0.002640759,0.009874263,0.00011647242,0.00028832426,0.000943257,0.0011762693,0.8094476,0.16406713,0.0039802124,0.007306909,0.000085164465],"about_ca_topic_score_codex":0.0024028337,"about_ca_topic_score_gemma":0.0014526256,"teacher_disagreement_score":0.004729453,"about_ca_system_score_codex":0.0008463415,"about_ca_system_score_gemma":0.0005734272,"threshold_uncertainty_score":0.025012016},"labels":[],"label_agreement":null},{"id":"W2085049155","doi":"10.1109/dest.2013.6611333","title":"RESTful dissemination of healthcare data in mobile digital ecosystem","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Dissemination; Computer science; Event (particle physics); Health care; Architecture; Synchronizing; Digital ecosystem; Mobile computing; Multimedia; World Wide Web; Computer network; Data science; Telecommunications; Distributed computing","score_opus":0.020631960349289206,"score_gpt":0.2706246448944281,"score_spread":0.2499926845451389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085049155","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.17074427,0.0011324969,0.80726665,0.0017456547,0.00017292995,0.00050276535,0.00028984828,0.011106247,0.007039043],"genre_scores_gemma":[0.92508674,0.00032283796,0.06809314,0.00034294647,0.00008942174,0.00015441248,0.00039002666,0.00017744297,0.005342942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991115,0.000265437,0.00011515657,0.00016985297,0.00022242761,0.00011558766],"domain_scores_gemma":[0.9971348,0.0005320788,0.00020285636,0.0013945112,0.0004844002,0.00025135468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015995365,0.00041354273,0.0005858844,0.00073546806,0.0009883096,0.002390208,0.0014542623,0.0010740289,0.0009097661],"category_scores_gemma":[0.0034127645,0.0003102941,0.00047871692,0.00053359265,0.00054049306,0.0026742266,0.0025871978,0.00080091925,0.00035595812],"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.0025281443,0.00097610697,0.023145879,0.00068964256,0.00050279184,0.004093847,0.0038390302,0.057097897,0.18263859,0.10883203,0.026480416,0.58917564],"study_design_scores_gemma":[0.0002392187,0.00051696034,0.009871039,0.00011362069,0.00035998967,0.0013655534,0.00065697345,0.7877877,0.094920434,0.048197675,0.05580175,0.00016917975],"about_ca_topic_score_codex":0.00262972,"about_ca_topic_score_gemma":0.0021624607,"teacher_disagreement_score":0.00262972,"about_ca_system_score_codex":0.0007479324,"about_ca_system_score_gemma":0.0008135503,"threshold_uncertainty_score":0.00845927},"labels":[],"label_agreement":null},{"id":"W2085059901","doi":"10.1007/s10586-009-0076-0","title":"On GPU’s viability as a middleware accelerator","year":2009,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Nvidia","keywords":"Computer science; Implementation; Exploit; Middleware (distributed applications); Erasure code; Graphics; Embedded system; Distributed computing; Operating system; Decoding methods; Software engineering","score_opus":0.018697008819549554,"score_gpt":0.2505568737334214,"score_spread":0.23185986491387184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085059901","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.50620127,0.031461705,0.09575655,0.04576877,0.002398199,0.000066116285,0.00048728153,0.0019865981,0.31587356],"genre_scores_gemma":[0.9679731,0.0021962824,0.011723258,0.00042674076,0.00024982772,0.000022018463,0.00009597057,0.00023054113,0.017082276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896395,0.0002933386,0.000034758647,0.00012809614,0.00033485595,0.00024494334],"domain_scores_gemma":[0.9959674,0.0018507347,0.0001383357,0.0007138193,0.0009936186,0.0003361601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019144472,0.0003634501,0.0005690728,0.00087016553,0.0014614648,0.005175795,0.0017350982,0.001989827,0.010066557],"category_scores_gemma":[0.007799776,0.00035099982,0.0002582641,0.0012822255,0.0018694558,0.0056201695,0.001382611,0.0015184907,0.001695059],"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.001066281,0.00019668687,0.007989842,0.0003964902,0.00009554303,0.00072835153,0.0010202691,0.02740778,0.027761009,0.74076223,0.047140513,0.14543499],"study_design_scores_gemma":[0.00011767327,0.00034399287,0.0075885393,0.00033560698,0.0002863083,0.0010059979,0.002926503,0.43337914,0.05876459,0.2801489,0.2149748,0.00012801227],"about_ca_topic_score_codex":0.008478161,"about_ca_topic_score_gemma":0.0069281417,"teacher_disagreement_score":0.010066557,"about_ca_system_score_codex":0.0029820632,"about_ca_system_score_gemma":0.0017989401,"threshold_uncertainty_score":0.03367603},"labels":[],"label_agreement":null},{"id":"W2086277644","doi":"10.1016/j.nahs.2006.04.012","title":"A birth–death model for Web cache systems: Numerical solutions and simulation","year":2007,"lang":"en","type":"article","venue":"Nonlinear Analysis Hybrid Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Cache; Computer science; Cache algorithms; Web page; Cache invalidation; CPU cache; Parallel computing; World Wide Web","score_opus":0.04779752712046908,"score_gpt":0.2867555113670878,"score_spread":0.23895798424661874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086277644","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.27737707,0.0038947128,0.67551166,0.003698668,0.0006191389,0.00020256719,0.00047553764,0.00034341053,0.037877247],"genre_scores_gemma":[0.95155436,0.0011600199,0.025252083,0.00035505358,0.00013649532,0.00018940975,0.00018093231,0.00006565595,0.021106014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997547,0.000074087504,0.000012232244,0.000036805228,0.00007040245,0.000051711693],"domain_scores_gemma":[0.99834085,0.00091708126,0.00019178295,0.00007606638,0.0003245971,0.00014973768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010274114,0.00064212776,0.0014109886,0.0010587778,0.0010113082,0.0018960203,0.0015700886,0.0034844095,0.0027605665],"category_scores_gemma":[0.0052044303,0.00058930874,0.0010679882,0.0009876069,0.0023416737,0.0017746118,0.0015585715,0.0016043368,0.0003767399],"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.000033440243,0.000035122797,0.000702455,0.00005219455,0.000021414882,0.00010645251,0.0000941153,0.9336794,0.00065569894,0.061842635,0.00084021396,0.0019367717],"study_design_scores_gemma":[0.000009098789,0.000003955499,0.00006056896,0.0000028118482,0.0000036238068,0.000009726737,0.000014206312,0.9951739,0.000047282218,0.004523614,0.0001466631,0.0000047133626],"about_ca_topic_score_codex":0.021074666,"about_ca_topic_score_gemma":0.0072035957,"teacher_disagreement_score":0.021074666,"about_ca_system_score_codex":0.0017016148,"about_ca_system_score_gemma":0.0013866487,"threshold_uncertainty_score":0.041903973},"labels":[],"label_agreement":null},{"id":"W2087289341","doi":"10.1145/2602204.2602210","title":"IP address multiplexing for VEEs","year":2014,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; IP address management; IPv6; Server; IPv4; Computer network; NAT traversal; Ip address; Multiplexing; Network address translation; Domain Name System; Computer security; Latency (audio); The Internet; Telecommunications; Internet Protocol; World Wide Web","score_opus":0.05178788863831603,"score_gpt":0.30088278825840625,"score_spread":0.24909489962009024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087289341","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.19641113,0.0022648142,0.75609386,0.0009813461,0.00039530732,0.0005661568,0.00024786228,0.018929439,0.024110084],"genre_scores_gemma":[0.78626806,0.00047494486,0.20334788,0.00030824068,0.00018895308,0.00024156336,0.00032598883,0.0003578783,0.008486552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770784,0.0005494417,0.00023648744,0.0004512041,0.0005762821,0.00047882707],"domain_scores_gemma":[0.9915691,0.0017359852,0.0008171282,0.0037595264,0.0012773122,0.00084095396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002898788,0.0010842145,0.0011222258,0.0018975919,0.0017532586,0.0030275083,0.0031504175,0.0012188787,0.0054567875],"category_scores_gemma":[0.010221031,0.0007426331,0.0004958962,0.0015058016,0.0008592747,0.0074178358,0.0054189963,0.0012245174,0.0019213121],"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.002138272,0.0009388888,0.011685825,0.0004603213,0.00020450413,0.0007998731,0.0015626469,0.032985415,0.12687042,0.08547207,0.019584991,0.71729684],"study_design_scores_gemma":[0.0002638873,0.001702244,0.0059101246,0.0002729014,0.00035461521,0.003051036,0.0014085275,0.55440915,0.2122545,0.071446665,0.1485819,0.00034443074],"about_ca_topic_score_codex":0.0012958408,"about_ca_topic_score_gemma":0.0012667599,"teacher_disagreement_score":0.0054567875,"about_ca_system_score_codex":0.001258851,"about_ca_system_score_gemma":0.001102567,"threshold_uncertainty_score":0.018254757},"labels":[],"label_agreement":null},{"id":"W2087831714","doi":"10.1145/2678508.2678516","title":"PSoCCN","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Computer network; Publication; Routing (electronic design automation); The Internet; Distributed computing; World Wide Web","score_opus":0.0063314988089189245,"score_gpt":0.179195612809862,"score_spread":0.17286411400094306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087831714","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010369604,0.0015826845,0.43310058,0.0036108461,0.0024344614,0.0011936959,0.0066906433,0.060621355,0.48039612],"genre_scores_gemma":[0.22638239,0.003907425,0.30733997,0.005066486,0.0008396395,0.0017936208,0.04498219,0.01201201,0.39767632],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988802,0.00016507522,0.00008243169,0.00022215229,0.00051674567,0.00013335983],"domain_scores_gemma":[0.99832445,0.00020846886,0.00007482061,0.00054821506,0.00062729686,0.00021674355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011901248,0.0006015406,0.0005021469,0.0007983544,0.0010656863,0.003287869,0.001773546,0.0013346634,0.040141944],"category_scores_gemma":[0.0037386974,0.00040840855,0.00044286074,0.00092742156,0.00062880653,0.0033930324,0.0022786886,0.0015509785,0.021782583],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00041429006,0.00017251703,0.0015812153,0.00045156482,0.000033662982,0.0003685661,0.0002497874,0.009724984,0.0067951404,0.2690207,0.45788255,0.253305],"study_design_scores_gemma":[0.00004530163,0.00005637497,0.00025147552,0.000063008556,0.000013271514,0.00025407344,0.000037115075,0.037750103,0.0025991986,0.027743628,0.9311574,0.00002920219],"about_ca_topic_score_codex":0.006628768,"about_ca_topic_score_gemma":0.0063707926,"teacher_disagreement_score":0.040141944,"about_ca_system_score_codex":0.0016636407,"about_ca_system_score_gemma":0.002664713,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2088506488","doi":"10.5555/1361492.1361532","title":"A pro-active mobility extension for pub/sub systems","year":2008,"lang":"en","type":"article","venue":"Mobile Wireless Middleware, Operating Systems, and Applications","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Computer network; Extension (predicate logic); Overhead (engineering); Context (archaeology); Transfer (computing); Graph; Distributed computing; Mobile telephony; Mobile computing; Mobile radio; Theoretical computer science; Operating system","score_opus":0.035923410167631876,"score_gpt":0.25188837437065004,"score_spread":0.21596496420301817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088506488","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.07867529,0.0011623052,0.9062655,0.0008756099,0.00033225137,0.00030712786,0.00012526716,0.005432634,0.0068239477],"genre_scores_gemma":[0.72835195,0.00078713254,0.26204556,0.00032597108,0.00040743785,0.0001800257,0.00033773048,0.00021010017,0.007354069],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992131,0.0001670726,0.00009252531,0.00012648509,0.0002941907,0.00010655978],"domain_scores_gemma":[0.9978157,0.00033410318,0.00020428207,0.0011433724,0.00033381302,0.00016873736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096742326,0.0005083956,0.00049978937,0.00064516114,0.0008821889,0.0010849048,0.0018327868,0.00062418403,0.0014645437],"category_scores_gemma":[0.002111146,0.0003931354,0.0004544515,0.0005947914,0.0005269043,0.0026587078,0.001789816,0.0012667967,0.0007764872],"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.0009217332,0.00064213097,0.007880721,0.0006384788,0.00011600847,0.0011327387,0.0010487395,0.03958106,0.2501836,0.09865448,0.012704668,0.5864957],"study_design_scores_gemma":[0.00027014682,0.0012007641,0.004962732,0.00011178075,0.00029279615,0.0037862626,0.00042066653,0.6776433,0.0874758,0.030453576,0.19319168,0.00019059025],"about_ca_topic_score_codex":0.0009037068,"about_ca_topic_score_gemma":0.00088288734,"teacher_disagreement_score":0.0018327868,"about_ca_system_score_codex":0.0004257417,"about_ca_system_score_gemma":0.00057228113,"threshold_uncertainty_score":0.005116284},"labels":[],"label_agreement":null},{"id":"W2088920297","doi":"10.1109/ccece.2014.6901137","title":"Hybrid threshold-based distributed discovery service for the EPCglobal network","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Blocking (statistics); Computer science; Computer network; Table (database); Default gateway; Service (business); Distributed computing; Data mining","score_opus":0.01526272362109015,"score_gpt":0.21776745135923126,"score_spread":0.2025047277381411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088920297","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.10551288,0.0008311743,0.88366705,0.00034995395,0.0001267737,0.00014723014,0.00018322388,0.004822312,0.0043594195],"genre_scores_gemma":[0.8899492,0.00025675827,0.10664072,0.00015312317,0.000061705905,0.00006847531,0.00024810297,0.00006940991,0.002552423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989699,0.0001468515,0.00009517919,0.00016749853,0.0005060628,0.00011446561],"domain_scores_gemma":[0.9985594,0.00040618,0.00019538502,0.0003750389,0.0003397195,0.00012433909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923778,0.0003646869,0.00064469705,0.0011670853,0.00066540897,0.0016345225,0.0018196632,0.0007750301,0.0012022418],"category_scores_gemma":[0.0028329229,0.0002133232,0.00028071046,0.0013617248,0.00047141223,0.0017875938,0.0013702563,0.0007736278,0.0003675715],"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.0018316689,0.00049665954,0.012268018,0.0003981701,0.0001710768,0.0010288974,0.00066164363,0.12693357,0.10237019,0.060002577,0.0108194845,0.6830181],"study_design_scores_gemma":[0.00009346679,0.0001926523,0.0015211825,0.000013553536,0.000064378364,0.00056456774,0.00008050881,0.9614166,0.017802982,0.007162508,0.01103309,0.00005443396],"about_ca_topic_score_codex":0.0046616853,"about_ca_topic_score_gemma":0.0040165777,"teacher_disagreement_score":0.0046616853,"about_ca_system_score_codex":0.0010906699,"about_ca_system_score_gemma":0.0012481945,"threshold_uncertainty_score":0.009269118},"labels":[],"label_agreement":null},{"id":"W2089787080","doi":"10.1145/1324287.1324292","title":"A revenue-rewarding scheme of providing incentive for cooperative proxy caching for media streaming systems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Incentive; Revenue; Computer science; Proxy (statistics); Profit (economics); Cache; Scheme (mathematics); Microeconomics; Computer network; Business; Economics; Finance","score_opus":0.050028613256604605,"score_gpt":0.2922358776239629,"score_spread":0.24220726436735832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089787080","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.0716565,0.0002767283,0.9169798,0.0011116897,0.00013105234,0.00035259093,0.0000624604,0.0003998815,0.009029405],"genre_scores_gemma":[0.8941875,0.000111343914,0.10308074,0.00011686015,0.000078108824,0.00016295446,0.000026846017,0.000028184122,0.0022075067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629766,0.0020719927,0.00016966544,0.00045375907,0.00062362314,0.00038322565],"domain_scores_gemma":[0.99409014,0.0024244273,0.0008239673,0.00097151165,0.0010067825,0.0006831215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005849803,0.0007174344,0.0008472521,0.0007178587,0.0011812662,0.0013909566,0.0027959554,0.001871571,0.0019983079],"category_scores_gemma":[0.0155587,0.0003745524,0.00065272383,0.00060911657,0.0015269106,0.002904033,0.0021090524,0.0015671761,0.0003571982],"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.00063624774,0.0006889314,0.0028724154,0.0002658941,0.0001160248,0.00093143684,0.00077872677,0.26490337,0.026756836,0.59974116,0.0059989295,0.09631007],"study_design_scores_gemma":[0.00014369457,0.0002710401,0.00044126005,0.00002928576,0.0000473638,0.0003895362,0.00007859116,0.92083806,0.00380139,0.06852042,0.005365993,0.00007336541],"about_ca_topic_score_codex":0.001127166,"about_ca_topic_score_gemma":0.0011230675,"teacher_disagreement_score":0.005849803,"about_ca_system_score_codex":0.0016381844,"about_ca_system_score_gemma":0.0021807908,"threshold_uncertainty_score":0.030937135},"labels":[],"label_agreement":null},{"id":"W2089855125","doi":"10.1109/apscc.2009.5394122","title":"Using cooperation to improve the experience of mobile Web Services consumers","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Workflow; Computer science; Android (operating system); Mobile device; Service provider; Mobile Web; World Wide Web; Web service; Mobile QoS; Mobile computing; Java; Service (business); Mobile technology; Telecommunications; Business; Operating system; Database","score_opus":0.018089901723516703,"score_gpt":0.269666866296202,"score_spread":0.2515769645726853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089855125","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.90881157,0.0008333493,0.05093555,0.003273013,0.00005210182,0.000076232245,0.00003377602,0.0005602729,0.03542416],"genre_scores_gemma":[0.9869747,0.00025067554,0.008445077,0.00016527357,0.000030620562,0.000027346669,0.000026131678,0.000053886,0.004026351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987815,0.00082552526,0.000030954496,0.000085018146,0.00017234449,0.000104765255],"domain_scores_gemma":[0.99570435,0.0026664971,0.00033801567,0.00043426495,0.00047288637,0.00038392446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018478463,0.00029057113,0.00033352958,0.00030576665,0.00090043765,0.001821392,0.00050500606,0.001007287,0.0035135546],"category_scores_gemma":[0.0060022697,0.00021041108,0.00026243116,0.0003020672,0.0005686206,0.0028715597,0.0019327325,0.00078414794,0.00059272547],"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.0028220692,0.0021704736,0.0641099,0.00075847213,0.00021696716,0.004460363,0.116691224,0.008553715,0.072569594,0.0492464,0.022842571,0.6555582],"study_design_scores_gemma":[0.001216659,0.01112433,0.107580535,0.00053770276,0.0013645022,0.010944387,0.1361257,0.18243536,0.070926584,0.10825311,0.36886218,0.0006289165],"about_ca_topic_score_codex":0.0010932507,"about_ca_topic_score_gemma":0.00090891006,"teacher_disagreement_score":0.0035135546,"about_ca_system_score_codex":0.0004160824,"about_ca_system_score_gemma":0.0005543858,"threshold_uncertainty_score":0.011753976},"labels":[],"label_agreement":null},{"id":"W2090792305","doi":"10.1088/1742-6596/385/1/012012","title":"GPU-Based Asynchronous Global Optimization with Particle Swarm","year":2012,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Computer science; Speedup; Robustness (evolution); Parallel computing; Particle swarm optimization; Population; Computation; Graphics; CUDA; Parallelizable manifold; Distributed computing; Mathematical optimization; Algorithm; Mathematics","score_opus":0.019876634726935818,"score_gpt":0.22658725161440713,"score_spread":0.2067106168874713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090792305","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.03566369,0.00017310023,0.95687526,0.00012988788,0.00007989876,0.000054588163,0.000036470487,0.00088790036,0.006099081],"genre_scores_gemma":[0.58450943,0.00018312111,0.41011798,0.00008339248,0.000058465477,0.00018169812,0.00016027129,0.00019282618,0.0045128157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973017,0.00008678965,0.000011771404,0.00003732997,0.00011604826,0.00001780848],"domain_scores_gemma":[0.9995233,0.00019606661,0.000049761213,0.000081713864,0.000118594806,0.000030560055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006673256,0.00057796284,0.0006514821,0.00046965695,0.0004302797,0.0007957143,0.00102589,0.0007123384,0.0012249344],"category_scores_gemma":[0.0016321889,0.00033341764,0.00041919507,0.000585861,0.00045612062,0.0006560245,0.0007068655,0.0006250711,0.00036268393],"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.00009837231,0.00005459804,0.0006510278,0.000036798014,0.00003158973,0.000052802992,0.00004710287,0.9504668,0.0041662673,0.0059532253,0.0010827618,0.037358623],"study_design_scores_gemma":[0.000011395345,0.000010948319,0.000050959956,0.0000010723558,0.0000024153146,0.000004392715,0.0000021704573,0.9984492,0.00044063258,0.00066705514,0.00035811285,0.0000016972966],"about_ca_topic_score_codex":0.00500157,"about_ca_topic_score_gemma":0.0044370773,"teacher_disagreement_score":0.00500157,"about_ca_system_score_codex":0.0005932658,"about_ca_system_score_gemma":0.00069029507,"threshold_uncertainty_score":0.009944916},"labels":[],"label_agreement":null},{"id":"W2090963188","doi":"10.1109/infcom.2013.6566741","title":"αRoute: A name based routing scheme for Information Centric Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Policy-based routing; Routing table; Static routing; Routing (electronic design automation); IP forwarding; Scalability; Multipath routing; The Internet; Dynamic Source Routing; Default-free zone; Virtual routing and forwarding; Border Gateway Protocol; Triangular routing; Equal-cost multi-path routing; Distributed computing; Link-state routing protocol; Routing protocol; World Wide Web; Database","score_opus":0.013858613537596385,"score_gpt":0.20854893893346824,"score_spread":0.19469032539587186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090963188","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.032812554,0.0029032943,0.90070087,0.001511723,0.0007054954,0.00030211514,0.0006275659,0.011196521,0.04923977],"genre_scores_gemma":[0.38831165,0.0028746256,0.53850305,0.00075202546,0.00044526768,0.0002690192,0.0018685499,0.0013123327,0.06566349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00012683602,0.0000298028,0.000071372764,0.00016017514,0.0000391626],"domain_scores_gemma":[0.9993862,0.000089266105,0.00009432868,0.00021788644,0.00016685537,0.00004535856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067065755,0.00036407553,0.00040146228,0.0008264572,0.00067735044,0.0012693041,0.0012467798,0.0009168023,0.005471755],"category_scores_gemma":[0.0011871147,0.00020424521,0.00020715337,0.0010236596,0.0007622129,0.0019689782,0.0005975683,0.0005923579,0.0030227234],"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.00073767046,0.00018315783,0.00095801515,0.00040194188,0.00006194569,0.00045412136,0.00029293224,0.029127795,0.08516089,0.24684626,0.082695685,0.55307966],"study_design_scores_gemma":[0.0001929078,0.000663477,0.0018760556,0.00010482724,0.00008370845,0.0021976652,0.00011327136,0.28216764,0.08150112,0.04750736,0.583416,0.00017594865],"about_ca_topic_score_codex":0.0011648828,"about_ca_topic_score_gemma":0.0018694246,"teacher_disagreement_score":0.005471755,"about_ca_system_score_codex":0.0009914642,"about_ca_system_score_gemma":0.00047540572,"threshold_uncertainty_score":0.018304884},"labels":[],"label_agreement":null},{"id":"W2091457418","doi":"10.1109/iwqos.2014.6914303","title":"Optimize the dynamic provisioning and request dispatching in distributed memory cache services","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Provisioning; Server; Dynamic programming; Cache algorithms; Cache invalidation; Distributed computing; Key (lock); Optimization problem; Minification; CPU cache; Computer network; Operating system; Algorithm","score_opus":0.00430309064737642,"score_gpt":0.20229209355579106,"score_spread":0.19798900290841465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091457418","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.23832805,0.0005563518,0.7552911,0.0004826892,0.000032565742,0.00010148305,0.00014392033,0.0005664763,0.0044974615],"genre_scores_gemma":[0.9302291,0.00013911235,0.068024136,0.00003641148,0.0000120125,0.00006520208,0.000075049626,0.00005326726,0.0013656949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974245,0.000084120045,0.00000939527,0.0000468128,0.00004505916,0.00007217731],"domain_scores_gemma":[0.9994814,0.0003357526,0.000057879082,0.000027507103,0.00006735691,0.000030195146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005878309,0.00058267475,0.00067063456,0.00031131224,0.00040245664,0.0007370794,0.0007759036,0.00073231,0.0009388555],"category_scores_gemma":[0.0018540969,0.00029112957,0.00025538672,0.00068879087,0.00037870993,0.0007961345,0.0005084494,0.00043157002,0.00015452153],"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.00006064588,0.00004418503,0.00039909745,0.000036680496,0.000010034518,0.00002220867,0.000018850806,0.98124206,0.0018078955,0.0033014256,0.00046697882,0.012590032],"study_design_scores_gemma":[0.0000044793496,0.000009018589,0.000045137433,5.7892095e-7,0.000001761528,0.000003316039,0.000003712888,0.9987827,0.00029503956,0.00078867725,0.00006448433,0.0000010629641],"about_ca_topic_score_codex":0.008715108,"about_ca_topic_score_gemma":0.00772108,"teacher_disagreement_score":0.008715108,"about_ca_system_score_codex":0.0012108306,"about_ca_system_score_gemma":0.0016138209,"threshold_uncertainty_score":0.01732874},"labels":[],"label_agreement":null},{"id":"W2091560699","doi":"10.1109/wowmom.2014.6919000","title":"On scheduling live media streaming in the cloud — A study","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Cloud computing; Server; Content delivery; Scheduling (production processes); Live streaming; Content delivery network; Bin packing problem; Computer network; Bin; Operating system; Engineering","score_opus":0.028040254717527083,"score_gpt":0.25073236126688886,"score_spread":0.22269210654936178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091560699","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.44730684,0.03091737,0.40976852,0.0077546863,0.0012377757,0.0006172768,0.0006332131,0.00036021514,0.10140411],"genre_scores_gemma":[0.927571,0.0086211935,0.048048556,0.00069829304,0.0009931022,0.000118651005,0.0002243922,0.00019880862,0.013525969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926025,0.00025187532,0.000024672026,0.000103640974,0.00012412248,0.00023549433],"domain_scores_gemma":[0.99680007,0.0024111667,0.00019612147,0.00009441365,0.00025456943,0.0002437933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013999589,0.00068987877,0.0009321296,0.00059404154,0.0008800652,0.0018321109,0.0010213767,0.0009045342,0.006492476],"category_scores_gemma":[0.003782233,0.0003511968,0.00049063005,0.0016790552,0.00085835165,0.002220036,0.00047742928,0.0011055314,0.00044363015],"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.00084760925,0.0011541466,0.0038481718,0.0009122027,0.000157369,0.0005008023,0.00043050098,0.74949473,0.009875283,0.13317057,0.018108536,0.08150013],"study_design_scores_gemma":[0.00004613419,0.0003263444,0.0015353818,0.00005058256,0.000029152074,0.0000986886,0.00032557195,0.976594,0.0015917398,0.01257085,0.006819073,0.000012569782],"about_ca_topic_score_codex":0.019000417,"about_ca_topic_score_gemma":0.010907018,"teacher_disagreement_score":0.019000417,"about_ca_system_score_codex":0.0026601928,"about_ca_system_score_gemma":0.0016546629,"threshold_uncertainty_score":0.03777963},"labels":[],"label_agreement":null},{"id":"W2092183653","doi":"10.1109/infcomw.2014.6849174","title":"Energy-efficient distributed in-network caching for Content-Centric Networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China","keywords":"Computer science; Scheme (mathematics); Energy consumption; Distributed computing; Router; Nash equilibrium; Computer network; Content centric networking; The Internet; Efficient energy use; Energy (signal processing); Mathematical optimization; Cache","score_opus":0.017696852554202898,"score_gpt":0.20291706901703319,"score_spread":0.1852202164628303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092183653","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.09901382,0.0006397151,0.8947031,0.0002873019,0.00005093373,0.00009789993,0.000046312533,0.0002719671,0.0048890156],"genre_scores_gemma":[0.953227,0.00024303595,0.04505416,0.000044923876,0.000019040386,0.000043911765,0.000038549708,0.00001559993,0.0013136821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995623,0.00016790166,0.000020320393,0.00005779458,0.00012676493,0.000064828724],"domain_scores_gemma":[0.99918467,0.00033602797,0.00010455637,0.00014433086,0.00018580993,0.000044589913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077016983,0.00038724625,0.000630369,0.00036277538,0.00067616947,0.00073124096,0.0013894148,0.0006070498,0.00066796667],"category_scores_gemma":[0.0020511094,0.00015903197,0.00024316329,0.00063341606,0.0004262749,0.0010071382,0.00071330066,0.00035351038,0.00011486763],"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.00025182037,0.0002627148,0.002309254,0.00022615457,0.00009288263,0.0002924041,0.00018616207,0.76932395,0.032496564,0.09182981,0.0034867614,0.09924159],"study_design_scores_gemma":[0.000011419833,0.000030826257,0.00016905779,0.0000037315906,0.000013454605,0.0000529132,0.000018357587,0.9878996,0.0025021771,0.008499528,0.0007925774,0.0000062801982],"about_ca_topic_score_codex":0.0024995522,"about_ca_topic_score_gemma":0.005013292,"teacher_disagreement_score":0.0024995522,"about_ca_system_score_codex":0.0012234667,"about_ca_system_score_gemma":0.0010320427,"threshold_uncertainty_score":0.00887686},"labels":[],"label_agreement":null},{"id":"W2095145123","doi":"10.1109/glocomw.2011.6162548","title":"A novel architecture for efficient management of multimedia-service clouds","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cloud computing; Service (business); Architecture; Hierarchy; Adaptation (eye); Distributed computing; Multimedia; Computer network; Database; Operating system","score_opus":0.03703001260013082,"score_gpt":0.22881415286343854,"score_spread":0.1917841402633077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095145123","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.024718726,0.00059202773,0.96268004,0.00061320496,0.00017317681,0.0002167811,0.00011939796,0.0036530704,0.007233725],"genre_scores_gemma":[0.39244407,0.0006918349,0.59896636,0.00021949176,0.00014240398,0.00020784115,0.000398549,0.00014974135,0.0067797666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994578,0.00006873844,0.000044080032,0.0000741508,0.00023570402,0.000119637196],"domain_scores_gemma":[0.99966073,0.000033410237,0.00003203308,0.00008714389,0.00012534393,0.000061311395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006116049,0.0003070845,0.0003990784,0.00046144178,0.0009264122,0.0017449213,0.0018236153,0.00070907484,0.0016296362],"category_scores_gemma":[0.0007751826,0.0003124159,0.00035482412,0.00069732364,0.0004182455,0.0019724746,0.0013644067,0.0009911696,0.0007081959],"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.0005929546,0.00034100254,0.002902232,0.00045150926,0.0001647576,0.00086648774,0.0005865503,0.18255182,0.11287741,0.3481424,0.035986055,0.31453675],"study_design_scores_gemma":[0.00004722586,0.00009229909,0.00050884363,0.00002973463,0.000052864787,0.0002686396,0.000075519994,0.90791136,0.017680388,0.019284165,0.05400403,0.00004499817],"about_ca_topic_score_codex":0.0050606155,"about_ca_topic_score_gemma":0.0062553943,"teacher_disagreement_score":0.0050606155,"about_ca_system_score_codex":0.001733939,"about_ca_system_score_gemma":0.0016961439,"threshold_uncertainty_score":0.012580693},"labels":[],"label_agreement":null},{"id":"W2095399741","doi":"10.1145/2348283.2348451","title":"A hybrid model for ad-hoc information retrieval","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"York University","funders":"","keywords":"Computer science; Information retrieval; Artificial intelligence; Data mining; Machine learning","score_opus":0.02673005953183819,"score_gpt":0.23411649987949038,"score_spread":0.2073864403476522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095399741","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.015262188,0.0016404864,0.9709329,0.0011466992,0.00021266907,0.00024327885,0.0005059824,0.0010005739,0.009055147],"genre_scores_gemma":[0.65636855,0.0033715416,0.28681645,0.00085169374,0.00064639543,0.0012053383,0.0013186454,0.00033239395,0.049088985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820375,0.0005656859,0.0001346757,0.00047411706,0.0004523116,0.00016947254],"domain_scores_gemma":[0.99792707,0.001005672,0.00014983471,0.00036672258,0.0004421604,0.00010849866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020468691,0.0012228597,0.0014722504,0.0020234922,0.0007705957,0.002480269,0.004135217,0.002547303,0.0057029105],"category_scores_gemma":[0.0040439214,0.0006386595,0.0013728609,0.0030404285,0.0010818715,0.005657338,0.0014391629,0.0015273686,0.0036317965],"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.00039146226,0.00040114872,0.0020772596,0.0004876577,0.00034691906,0.0005066379,0.00039922562,0.6354997,0.007084955,0.16399883,0.014625021,0.17418112],"study_design_scores_gemma":[0.00003907789,0.000116789146,0.00019013166,0.000013015947,0.00007261845,0.00022769434,0.000029476954,0.9584569,0.0006450727,0.035200845,0.0049755056,0.000032913722],"about_ca_topic_score_codex":0.005026739,"about_ca_topic_score_gemma":0.005377208,"teacher_disagreement_score":0.0057029105,"about_ca_system_score_codex":0.0015903929,"about_ca_system_score_gemma":0.0012254028,"threshold_uncertainty_score":0.019078135},"labels":[],"label_agreement":null},{"id":"W2095759015","doi":"10.1109/nca.2008.44","title":"Experiments of Large File Caching and Comparisons of Caching Algorithms","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cache; Bandwidth (computing); Upload; Cache algorithms; The Internet; Computer network; Self-certifying File System; Smart Cache; Operating system; Algorithm; CPU cache; File system","score_opus":0.037714609462334674,"score_gpt":0.2714066794419237,"score_spread":0.23369206997958902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095759015","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.98875403,0.00037168924,0.007875053,0.00008067635,0.00004125845,0.00018954287,0.0006348319,0.00079344225,0.0012594805],"genre_scores_gemma":[0.9819639,0.00020735049,0.015861146,0.000031155516,0.000013935337,0.00012684077,0.0010622314,0.0000927212,0.0006407679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974485,0.0008000438,0.0002753804,0.00040648374,0.00061261747,0.0004569289],"domain_scores_gemma":[0.96614623,0.025744123,0.0010412289,0.0027406632,0.003494449,0.00083318376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026388664,0.0011873314,0.0012740782,0.0013898992,0.00092007115,0.00070726004,0.0018948907,0.0013170074,0.0013495171],"category_scores_gemma":[0.014439014,0.0004279255,0.00049643824,0.002317997,0.00088690664,0.0018713608,0.00052344875,0.0013764933,0.00022714036],"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.006274245,0.008968879,0.020775424,0.00086017273,0.0005517377,0.00058645254,0.0008071082,0.8129426,0.0704949,0.0045078504,0.004964508,0.068266094],"study_design_scores_gemma":[0.00040098844,0.0039132205,0.0067909393,0.000030540014,0.00011104939,0.0002767745,0.00037183677,0.9307808,0.05462605,0.0015213673,0.0011092772,0.000067221896],"about_ca_topic_score_codex":0.01006729,"about_ca_topic_score_gemma":0.007535232,"teacher_disagreement_score":0.01006729,"about_ca_system_score_codex":0.0014089831,"about_ca_system_score_gemma":0.0012587449,"threshold_uncertainty_score":0.020017385},"labels":[],"label_agreement":null},{"id":"W2096983012","doi":"10.1109/mascot.2003.1240668","title":"Performance benchmarking of dynamic Web technologies","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Dynamic web page; Web server; Web modeling; Web development; Workload; Web service; Benchmarking; Web content; World Wide Web; Web API; Web navigation; Web standards; Web design; Static web page; Web page; Operating system; The Internet","score_opus":0.007107301126925637,"score_gpt":0.19689184264496465,"score_spread":0.189784541518039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096983012","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.97052807,0.0013157196,0.016904103,0.00018949115,0.00009169217,0.0001956273,0.000689683,0.0017277193,0.008357848],"genre_scores_gemma":[0.99215275,0.00036121273,0.005671965,0.000033812026,0.000027130303,0.00009237037,0.0009831387,0.000112404814,0.0005651819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99381787,0.0016998536,0.00054784026,0.00076045026,0.0021960952,0.0009778787],"domain_scores_gemma":[0.9911526,0.0038287293,0.0005382446,0.001664145,0.0023156821,0.00050064386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027660027,0.0012935343,0.0008650149,0.0026451566,0.00066591427,0.0012866486,0.00213826,0.0011228663,0.0014046323],"category_scores_gemma":[0.009298831,0.0003608581,0.00043012944,0.0032628991,0.0007576217,0.00251895,0.0010868411,0.0010499626,0.00054554146],"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.0046698754,0.0039634686,0.036627833,0.0014278634,0.00050369813,0.00089951477,0.00061303447,0.61487746,0.1320828,0.010300971,0.00805234,0.18598105],"study_design_scores_gemma":[0.00025778636,0.005171241,0.029530086,0.00007474331,0.00016860958,0.00082637335,0.00050318416,0.8217596,0.12913206,0.0039149476,0.0085163545,0.00014505227],"about_ca_topic_score_codex":0.0020955228,"about_ca_topic_score_gemma":0.0010014991,"teacher_disagreement_score":0.0027660027,"about_ca_system_score_codex":0.0013332113,"about_ca_system_score_gemma":0.0005970764,"threshold_uncertainty_score":0.014628172},"labels":[],"label_agreement":null},{"id":"W2097666420","doi":"10.1109/wimob.2008.19","title":"Subscriber Mobility in Pub/Sub Systems: Pro-active vs. Reactive Handoffs","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Computer network; Testbed; Handover; Transfer (computing); Context (archaeology); Throughput; Mobility management; Mobile telephony; Distributed computing; Mobile radio; Telecommunications; Wireless; Operating system","score_opus":0.031641633932899,"score_gpt":0.22054245311305998,"score_spread":0.18890081918016097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097666420","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.6141881,0.0018028686,0.37111586,0.0011365784,0.00022067592,0.00029362642,0.000079796104,0.0015394463,0.009623082],"genre_scores_gemma":[0.9769117,0.00021648838,0.021665853,0.000082341896,0.00007654905,0.000030257415,0.000029911756,0.000034159417,0.0009527546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978289,0.0006710212,0.00015092175,0.00024338019,0.0007371163,0.00036857522],"domain_scores_gemma":[0.9963959,0.0014257282,0.0005480341,0.0008487572,0.00048680516,0.0002948509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002858598,0.00070643116,0.0005931901,0.00078344665,0.0008216118,0.0016561064,0.001465378,0.0010213742,0.0008089172],"category_scores_gemma":[0.005503535,0.00035800174,0.00043323424,0.00062563043,0.0007447749,0.0027115042,0.0009107964,0.00095565,0.00023127744],"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.003162678,0.0017003535,0.034010906,0.00047248483,0.00039636556,0.0014632703,0.001503572,0.38851893,0.21140134,0.10084823,0.0041749743,0.2523468],"study_design_scores_gemma":[0.00011415864,0.0005453564,0.004323138,0.000018442835,0.00015034318,0.00057660806,0.0002784364,0.96790177,0.016186625,0.0063721454,0.0034826533,0.000050272243],"about_ca_topic_score_codex":0.002258162,"about_ca_topic_score_gemma":0.0019925958,"teacher_disagreement_score":0.002858598,"about_ca_system_score_codex":0.0009552112,"about_ca_system_score_gemma":0.00072839775,"threshold_uncertainty_score":0.015117884},"labels":[],"label_agreement":null},{"id":"W2097925411","doi":"10.1007/s12083-012-0149-3","title":"Improving sustainability of BitTorrent darknets","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Upload; Computer science; Incentive; BitTorrent tracker; Enforcement; Computer network; Business; Internet privacy; Peer-to-peer; Environmental economics; World Wide Web; Microeconomics","score_opus":0.014938008074435105,"score_gpt":0.2639305153706544,"score_spread":0.24899250729621927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097925411","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.7735782,0.0039534327,0.14495465,0.0070345537,0.00038820258,0.00016191042,0.0005829512,0.002328789,0.06701719],"genre_scores_gemma":[0.9899171,0.00067161093,0.0060409578,0.00020064552,0.000039711922,0.000021999505,0.00013153949,0.00010527455,0.0028711134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999175,0.00023457926,0.000022734976,0.000096214964,0.0002805001,0.00019086317],"domain_scores_gemma":[0.9960503,0.0008555501,0.00033249136,0.00044305003,0.0018421526,0.00047648538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00213591,0.0004933451,0.0005127139,0.0008941781,0.0009564443,0.0021466385,0.0011521906,0.0009846268,0.0046267966],"category_scores_gemma":[0.007866183,0.00021439104,0.00013819674,0.0007534964,0.0007110996,0.0035530713,0.0023690737,0.0007291954,0.0006521944],"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.0004921729,0.0005321937,0.03478307,0.0005009477,0.00010154383,0.0004099071,0.0007385319,0.2674391,0.046558306,0.14100665,0.018573904,0.4888636],"study_design_scores_gemma":[0.000106130494,0.0007147516,0.014870402,0.00028154938,0.00017359554,0.00044683565,0.003059148,0.6975766,0.042952586,0.16849963,0.07124953,0.000069268805],"about_ca_topic_score_codex":0.004756775,"about_ca_topic_score_gemma":0.0082241455,"teacher_disagreement_score":0.004756775,"about_ca_system_score_codex":0.0017197218,"about_ca_system_score_gemma":0.0026994797,"threshold_uncertainty_score":0.015478194},"labels":[],"label_agreement":null},{"id":"W2098068196","doi":"10.1145/1851290.1851298","title":"How internet concepts and technologies can help green and smarten the electrical grid","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":86,"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":"Smart grid; The Internet; Grid; Computer science; Carbon footprint; Renewable energy; Grid computing; Semantic grid; Distributed computing; Telecommunications; World Wide Web; Engineering; Electrical engineering; Greenhouse gas","score_opus":0.009810605032287778,"score_gpt":0.20712450455342032,"score_spread":0.19731389952113254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098068196","genre_codex":"other","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.021987785,0.07493466,0.14648357,0.29831186,0.0050760903,0.00012969342,0.00016288925,0.0007189149,0.45219457],"genre_scores_gemma":[0.56016237,0.15325682,0.13057786,0.042854007,0.008464319,0.00040733922,0.0002081282,0.0004244042,0.10364466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987577,0.00067946414,0.000043143773,0.00009836268,0.00030699684,0.00011447623],"domain_scores_gemma":[0.9984742,0.0008656154,0.000106483625,0.0002284963,0.00019626452,0.00012890124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018996702,0.00050979265,0.00031015626,0.0012948236,0.001510635,0.008167895,0.0007902842,0.0038451785,0.0069047273],"category_scores_gemma":[0.0035828361,0.0003257071,0.00043423337,0.0012940364,0.006312692,0.017557915,0.0019745436,0.0033942098,0.001987115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000010658638,0.000024354948,0.00022228823,0.0000858741,0.0000114810955,0.00011540292,0.0005702419,0.0015907934,0.00023401508,0.9560983,0.012902741,0.028133715],"study_design_scores_gemma":[0.000014674919,0.000018721685,0.0001421956,0.00013945646,0.000013207937,0.00017875117,0.00073918526,0.0020185541,0.00032826743,0.72776806,0.26861694,0.000021889517],"about_ca_topic_score_codex":0.0021648018,"about_ca_topic_score_gemma":0.0026441086,"teacher_disagreement_score":0.008167895,"about_ca_system_score_codex":0.001583755,"about_ca_system_score_gemma":0.0019306816,"threshold_uncertainty_score":0.023098588},"labels":[],"label_agreement":null},{"id":"W2098893753","doi":"10.1109/mascots.2010.42","title":"Content Delivery Using Replicated Digital Fountains","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"Computer science; Server; Content delivery network; Content delivery; The Internet; Computer network; Architecture; Context (archaeology); Internet traffic; Bandwidth (computing); Download; Operating system","score_opus":0.052752445138735955,"score_gpt":0.23861447032688632,"score_spread":0.18586202518815037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098893753","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73677945,0.00094432663,0.24967217,0.0004051129,0.000086091415,0.000087682565,0.000109759705,0.0015686076,0.010346825],"genre_scores_gemma":[0.9840306,0.00010110705,0.014374144,0.000022637943,0.000009727566,0.000011863035,0.000022771934,0.000025062007,0.0014020948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995956,0.000114859,0.0000188667,0.000082774735,0.00009986254,0.000088086286],"domain_scores_gemma":[0.9988611,0.00039365885,0.00014379987,0.00031221236,0.00020469392,0.00008454785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055520417,0.00031990124,0.00050451147,0.00070687226,0.00071235537,0.0010915888,0.0010611163,0.00063442346,0.0013976876],"category_scores_gemma":[0.0025437858,0.0002101899,0.00029482835,0.00071407366,0.000603119,0.0013940174,0.00082268653,0.000335722,0.00021575698],"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.00085360854,0.00034382567,0.004630633,0.00022080496,0.0001388086,0.0009154255,0.00044182266,0.74136823,0.05700921,0.048190072,0.00410539,0.14178222],"study_design_scores_gemma":[0.000028101074,0.00007280117,0.0005645215,0.000007139637,0.000019780759,0.00012244115,0.00006233574,0.98555446,0.0068993294,0.005380954,0.001273452,0.0000147126175],"about_ca_topic_score_codex":0.010053404,"about_ca_topic_score_gemma":0.0062799375,"teacher_disagreement_score":0.010053404,"about_ca_system_score_codex":0.0021754527,"about_ca_system_score_gemma":0.00058354484,"threshold_uncertainty_score":0.019989729},"labels":[],"label_agreement":null},{"id":"W2099008620","doi":"10.1109/glocom.2010.5684162","title":"Hit Optimal Cache for Wireless Data Access","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Computer science; Computer network; Cache algorithms; Cache invalidation; Smart Cache; Wireless network; Wireless; Data access; Distributed computing; CPU cache; Database; Telecommunications","score_opus":0.09051211775577807,"score_gpt":0.32937434933392523,"score_spread":0.23886223157814718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099008620","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.19524568,0.007253426,0.7861209,0.0010886071,0.00017981822,0.00019400773,0.00039153654,0.001212264,0.008313779],"genre_scores_gemma":[0.95112675,0.0010889428,0.04437889,0.00014505244,0.00006822515,0.00010778971,0.00013261093,0.000052135827,0.0028995692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982419,0.0006085807,0.00011309187,0.00020670699,0.0005127433,0.00031695928],"domain_scores_gemma":[0.99403584,0.0032300928,0.0006115001,0.00083652604,0.0010393673,0.0002466899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017574815,0.00062117877,0.0014094174,0.0010762634,0.0010189236,0.0016486942,0.0014895103,0.0010981059,0.0015060445],"category_scores_gemma":[0.010210168,0.00042412948,0.00033800345,0.0018932123,0.0010260541,0.0028376859,0.00091628404,0.0009635441,0.00028965226],"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.00089529523,0.00020681553,0.0036783952,0.0004492636,0.00015712253,0.00040822304,0.0003690924,0.74263626,0.009610921,0.14736612,0.010513372,0.083709225],"study_design_scores_gemma":[0.000030994106,0.00008345082,0.00033917828,0.000014945892,0.000028753653,0.00013912351,0.000038516362,0.974922,0.0011423603,0.02179695,0.0014466693,0.000017055141],"about_ca_topic_score_codex":0.0043119234,"about_ca_topic_score_gemma":0.0043364917,"teacher_disagreement_score":0.0043119234,"about_ca_system_score_codex":0.0025977732,"about_ca_system_score_gemma":0.002013242,"threshold_uncertainty_score":0.0188483},"labels":[],"label_agreement":null},{"id":"W2099074333","doi":"10.1109/icis-comsar.2006.51","title":"Integration of QoS Queuing Schedules to QoS Caching Schemes","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Quality of service; Schedule; Queueing theory; Server; Computer network; Web server; Queue; Distributed computing; The Internet; Operating system","score_opus":0.011890296385693222,"score_gpt":0.22839535611877954,"score_spread":0.2165050597330863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099074333","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.10946818,0.00070805574,0.8825181,0.00037405526,0.00014491793,0.0001117151,0.0000673469,0.0008603148,0.005747347],"genre_scores_gemma":[0.8515263,0.00056546094,0.14590427,0.00008616244,0.00009611611,0.000066553876,0.00008262236,0.00007145005,0.00160098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985116,0.00063075434,0.00010412713,0.00010164133,0.0005326275,0.000119186574],"domain_scores_gemma":[0.9955278,0.00240613,0.0004310824,0.00063200097,0.00086719455,0.00013591323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002349233,0.0005958632,0.0005573863,0.00059510325,0.0003722645,0.0009482219,0.0012449251,0.0006233761,0.000816225],"category_scores_gemma":[0.008303217,0.0003668656,0.0005223557,0.00086464616,0.0005563728,0.0012017911,0.0005163006,0.0009060537,0.00018206431],"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.00014029199,0.00013616978,0.0015147245,0.00006470529,0.000041931507,0.00006325017,0.00007040874,0.888688,0.0043089683,0.06328098,0.0004674807,0.04122304],"study_design_scores_gemma":[0.000018196359,0.000054484924,0.00016796068,0.000005915261,0.000019454712,0.000023480965,0.000008716365,0.9879374,0.002443357,0.007841858,0.0014707879,0.000008413763],"about_ca_topic_score_codex":0.0045452705,"about_ca_topic_score_gemma":0.0030460677,"teacher_disagreement_score":0.0045452705,"about_ca_system_score_codex":0.0015216636,"about_ca_system_score_gemma":0.0015864763,"threshold_uncertainty_score":0.012424052},"labels":[],"label_agreement":null},{"id":"W2100505577","doi":"10.1109/icws.2009.86","title":"Reducing User Perceived Latency with a Middleware for Mobile SOA Access","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Latency (audio); Computer network; Cache; Usability; Mobile computing; Mobile device; Operating system; Telecommunications","score_opus":0.026358449884821437,"score_gpt":0.26698745629659437,"score_spread":0.24062900641177293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100505577","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.44518456,0.0010318042,0.5178844,0.00073154154,0.00022449618,0.0006656095,0.00012361894,0.025744922,0.008409123],"genre_scores_gemma":[0.8989954,0.00020035157,0.09680827,0.00011070808,0.000048800204,0.00010732017,0.0000891835,0.00032353797,0.0033164427],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937385,0.000110108944,0.00005943553,0.000078528115,0.0002762458,0.0001018282],"domain_scores_gemma":[0.9984932,0.0003981168,0.00014618826,0.00037856583,0.00043412595,0.00014984152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007490973,0.00074334187,0.0005083862,0.0003967516,0.00052744476,0.0011216486,0.0010908351,0.00066072855,0.0017079936],"category_scores_gemma":[0.0038902338,0.0003354934,0.00043533,0.00034274784,0.0002523219,0.0011543713,0.0007307801,0.0010689624,0.0004888545],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0017913652,0.00060371374,0.007884135,0.0006326652,0.00014307453,0.0011958618,0.0014353982,0.00883741,0.68209,0.005417227,0.0030036508,0.28696552],"study_design_scores_gemma":[0.000457584,0.0037258929,0.027023967,0.00017054296,0.000766309,0.0035137944,0.0011817882,0.4532023,0.4299998,0.009009947,0.07051535,0.00043271508],"about_ca_topic_score_codex":0.0029869368,"about_ca_topic_score_gemma":0.0026021963,"teacher_disagreement_score":0.0029869368,"about_ca_system_score_codex":0.0005556899,"about_ca_system_score_gemma":0.000767235,"threshold_uncertainty_score":0.005939126},"labels":[],"label_agreement":null},{"id":"W2100954553","doi":"10.1109/tie.2010.2050292","title":"Mobile Web Navigation in Digital Ecosystems Using Rooted Directed Trees","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":57,"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 Manitoba","funders":"","keywords":"Mobile Web; Computer science; World Wide Web; Mobile device; Web navigation; The Internet; Mobile computing; Web page; Focus (optics); Digital ecosystem; Mobile technology; Multimedia; Computer network; Distributed computing","score_opus":0.021581336743197756,"score_gpt":0.2389895277498673,"score_spread":0.21740819100666953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100954553","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.08977934,0.0009991735,0.9029356,0.00023099918,0.00002652325,0.00012254032,0.00042819342,0.0013418724,0.0041357083],"genre_scores_gemma":[0.6469202,0.0013361166,0.34657148,0.000107628875,0.000027197768,0.00013280535,0.0008493874,0.00014335231,0.003911798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995135,0.00019253486,0.0000386187,0.00010498612,0.00010845694,0.000041908726],"domain_scores_gemma":[0.9978168,0.0014928369,0.00021107728,0.0001447921,0.00024185085,0.00009256906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005595317,0.00040245376,0.0006338312,0.0018083164,0.0007327229,0.0015634074,0.0007681425,0.000794775,0.0013129853],"category_scores_gemma":[0.0035690386,0.00041807926,0.0006873973,0.0028963552,0.0006043164,0.0022292105,0.00073323527,0.000454863,0.00042344615],"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.0003258065,0.00023086305,0.011559594,0.00076401845,0.00019359111,0.001073445,0.0019149297,0.55762917,0.012633973,0.18289006,0.0059920684,0.22479248],"study_design_scores_gemma":[0.000022133545,0.00003708757,0.00083219557,0.000035565045,0.000040316965,0.0001961897,0.00014703294,0.92010707,0.0011625285,0.07281573,0.0045756423,0.000028470327],"about_ca_topic_score_codex":0.014947859,"about_ca_topic_score_gemma":0.02135709,"teacher_disagreement_score":0.014947859,"about_ca_system_score_codex":0.0010924278,"about_ca_system_score_gemma":0.00071547343,"threshold_uncertainty_score":0.029721737},"labels":[],"label_agreement":null},{"id":"W2101028480","doi":"10.1109/wirles.2005.1549468","title":"Cluster-based Replication for Large-scale Mobile Ad-hoc Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Replication (statistics); Mobile ad hoc network; Wireless ad hoc network; Cluster (spacecraft); Vehicular ad hoc network; Scale (ratio); Computer network; Distributed computing; Wireless; Geography; Telecommunications; Mathematics; Statistics","score_opus":0.012811508999619926,"score_gpt":0.25038741492491035,"score_spread":0.23757590592529043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101028480","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.018005162,0.0037203103,0.971421,0.0005651175,0.000372713,0.00024452602,0.00008381457,0.0021070046,0.0034803413],"genre_scores_gemma":[0.54637694,0.0025379895,0.4442015,0.00013415929,0.00037865047,0.00048390843,0.00032788992,0.000177535,0.005381503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898905,0.0003631734,0.00006284258,0.0001142717,0.00041496078,0.00005572786],"domain_scores_gemma":[0.9980763,0.00058421516,0.00016811668,0.00067858427,0.00038249913,0.00011022775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012233258,0.00034642548,0.0005327353,0.0005211244,0.0013566731,0.0009361753,0.0013722557,0.00065241224,0.001367204],"category_scores_gemma":[0.0033092475,0.0003073572,0.0002949065,0.0009491032,0.0005569421,0.0016469957,0.0009953097,0.00066508783,0.0005783086],"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.0003361654,0.00009879363,0.0026613285,0.00089956954,0.00022683185,0.00089254946,0.0007144047,0.3127465,0.043635715,0.15254821,0.02133851,0.4639015],"study_design_scores_gemma":[0.00014786454,0.00031574714,0.0009944567,0.00005915938,0.00011445204,0.000815582,0.00022323665,0.84284127,0.015235697,0.07672097,0.06242797,0.0001035735],"about_ca_topic_score_codex":0.002418194,"about_ca_topic_score_gemma":0.002506523,"teacher_disagreement_score":0.002418194,"about_ca_system_score_codex":0.0008529575,"about_ca_system_score_gemma":0.001139452,"threshold_uncertainty_score":0.006469667},"labels":[],"label_agreement":null},{"id":"W2103162096","doi":"10.1109/icn.2007.76","title":"Proxy-Based Visual Content Repurposing Using Selection Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Repurposing; Computer science; Proxy (statistics); Metric (unit); Selection algorithm; Selection (genetic algorithm); Data mining; Computer network; Machine learning; Distributed computing; Engineering","score_opus":0.04234214491571428,"score_gpt":0.2840745331046634,"score_spread":0.24173238818894913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103162096","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.04387751,0.00033707306,0.95123094,0.000078559395,0.000029252882,0.00011926977,0.00003451032,0.0024016844,0.001891264],"genre_scores_gemma":[0.5373723,0.00030439158,0.45773482,0.000078635036,0.00005833448,0.00013417589,0.00024331918,0.0001905108,0.0038835208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994511,0.00014309742,0.00003382103,0.000100540004,0.00020027914,0.0000711492],"domain_scores_gemma":[0.99936396,0.00019865323,0.00007827715,0.00013158105,0.0001480615,0.000079491496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054790603,0.0007265751,0.0011182155,0.0009407973,0.00059660623,0.00073220505,0.001172932,0.00058808806,0.0017584665],"category_scores_gemma":[0.0012909871,0.0002591449,0.0005340539,0.0008512139,0.0004197541,0.00095647614,0.0007325114,0.00042742767,0.000738405],"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.00087078084,0.00030281398,0.0024050712,0.00015011309,0.000089842026,0.0006130215,0.000249838,0.13613817,0.17956616,0.0065316847,0.004675601,0.66840684],"study_design_scores_gemma":[0.000053315423,0.00013872811,0.0006116037,0.0000059569015,0.0000360571,0.00033717087,0.000057269677,0.95176834,0.042128026,0.0018607146,0.0029734843,0.000029317122],"about_ca_topic_score_codex":0.0019513051,"about_ca_topic_score_gemma":0.0016420753,"teacher_disagreement_score":0.0019513051,"about_ca_system_score_codex":0.00051753776,"about_ca_system_score_gemma":0.00044725576,"threshold_uncertainty_score":0.005882621},"labels":[],"label_agreement":null},{"id":"W2104246885","doi":"10.1109/wimob.2009.23","title":"Media Caching Support for Mobile Transit Clients","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; Smart Cache; Computer network; False sharing; The Internet; Cache algorithms; Wireless; Point (geometry); CPU cache; Operating system","score_opus":0.017024280297552416,"score_gpt":0.24804530381351475,"score_spread":0.23102102351596232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104246885","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.83369845,0.0013893726,0.15067312,0.00061744155,0.00004067238,0.00017471825,0.00011202109,0.0019556687,0.011338577],"genre_scores_gemma":[0.98773175,0.0001576038,0.010800048,0.00002387137,0.000017860033,0.000023064511,0.000040358133,0.000020920419,0.0011845811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973756,0.0000893988,0.0000149429325,0.00003095704,0.00006202646,0.000065187676],"domain_scores_gemma":[0.9982591,0.000711056,0.00017599836,0.0002066987,0.0005586185,0.00008854498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059767964,0.00027075395,0.00042729118,0.00031310768,0.00071725115,0.0011905205,0.0011808409,0.00049501285,0.0012466398],"category_scores_gemma":[0.003850179,0.00018252595,0.00020982587,0.0004297237,0.00030917465,0.0012146645,0.00060574885,0.00038756884,0.00024112954],"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.0028732906,0.000886788,0.044747505,0.0008358479,0.00022366039,0.0035131627,0.0026981053,0.28125817,0.21547922,0.06269019,0.007249352,0.37754473],"study_design_scores_gemma":[0.00010740411,0.00030186356,0.0045655277,0.00004578979,0.00013560447,0.0006088572,0.0005455552,0.94365853,0.03630717,0.0060280836,0.007659796,0.000035851197],"about_ca_topic_score_codex":0.007237929,"about_ca_topic_score_gemma":0.0090061985,"teacher_disagreement_score":0.007237929,"about_ca_system_score_codex":0.0012112695,"about_ca_system_score_gemma":0.0010467711,"threshold_uncertainty_score":0.014391601},"labels":[],"label_agreement":null},{"id":"W2104372778","doi":"10.1109/icis.2007.28","title":"A Matrix Algorithm forWeb Cache Pre-fetching","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Cache; Cache algorithms; Cache-oblivious algorithm; Smart Cache; Algorithm; Scheme (mathematics); Cache invalidation; Simple (philosophy); Parallel computing; Matrix (chemical analysis); CPU cache","score_opus":0.009496566433781372,"score_gpt":0.26308398531995536,"score_spread":0.253587418886174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104372778","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.0035863954,0.00016632453,0.9934953,0.00007184083,0.000056761277,0.000059871236,0.000039608152,0.0016919007,0.0008320519],"genre_scores_gemma":[0.103340946,0.0002212392,0.89209133,0.00007947297,0.00010850864,0.00020687947,0.000253979,0.00019092757,0.0035068064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991714,0.00016423632,0.00005446982,0.00014649096,0.0003890385,0.00007441742],"domain_scores_gemma":[0.9983903,0.00049789017,0.00010220555,0.0003810758,0.00055687106,0.00007166337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006658603,0.0006942813,0.0007961441,0.0010979855,0.0008980682,0.0010064447,0.0015727683,0.0007485767,0.0056793005],"category_scores_gemma":[0.0036128347,0.00032436254,0.00036704153,0.0014572338,0.00048978336,0.0024864103,0.0009779629,0.0012425156,0.0020418153],"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.00046614168,0.00024043123,0.0009232735,0.00017048315,0.000071897375,0.00008598525,0.00012053768,0.12681012,0.025840402,0.041835852,0.012051269,0.7913836],"study_design_scores_gemma":[0.000060825507,0.000093924915,0.0002026937,0.000008651403,0.00001534363,0.00012993309,0.000023640378,0.9717249,0.00942319,0.010467345,0.007821834,0.000027563303],"about_ca_topic_score_codex":0.005994423,"about_ca_topic_score_gemma":0.0077602793,"teacher_disagreement_score":0.005994423,"about_ca_system_score_codex":0.00097111845,"about_ca_system_score_gemma":0.0014177719,"threshold_uncertainty_score":0.01899916},"labels":[],"label_agreement":null},{"id":"W2105831204","doi":"10.1109/milcom.2002.1179602","title":"A hierarchical request-routing architecture for content internetworking","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Computer network; Internetworking; Policy-based routing; The Internet; Distributed computing; Routing protocol; Enhanced Interior Gateway Routing Protocol; Scalability; Interoperability; Static routing; Link-state routing protocol; Routing (electronic design automation); World Wide Web; Database","score_opus":0.04900608404188756,"score_gpt":0.2505103919966736,"score_spread":0.20150430795478602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105831204","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.0041478854,0.00052378967,0.97662395,0.0008067065,0.0001618954,0.00037203566,0.00014050164,0.0057068137,0.01151636],"genre_scores_gemma":[0.12470902,0.00087001605,0.8574404,0.0006462975,0.00024095325,0.000616237,0.00085374963,0.00044396427,0.014179332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985833,0.00044053356,0.00016808567,0.00017871206,0.00049630407,0.00013314522],"domain_scores_gemma":[0.9984402,0.00027113248,0.00009053109,0.0005768658,0.00050741923,0.00011388437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197228,0.0005085492,0.00054720795,0.0010218575,0.0014265691,0.0024303729,0.0026781464,0.0014929709,0.00419243],"category_scores_gemma":[0.0029405067,0.00060940394,0.00063329923,0.0012886425,0.0011183381,0.002913404,0.0015606864,0.0015893966,0.0028150158],"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.00024096639,0.0002948173,0.0012130304,0.00046750705,0.00010001442,0.00047444142,0.00081687764,0.056738127,0.03131894,0.64358264,0.044680864,0.22007175],"study_design_scores_gemma":[0.00012611163,0.0002538416,0.00073415716,0.000096232245,0.00016072631,0.00059489365,0.00015119876,0.61895776,0.010244676,0.17798153,0.19054224,0.00015672589],"about_ca_topic_score_codex":0.0043740557,"about_ca_topic_score_gemma":0.006434074,"teacher_disagreement_score":0.0043740557,"about_ca_system_score_codex":0.001762597,"about_ca_system_score_gemma":0.0022628587,"threshold_uncertainty_score":0.014025092},"labels":[],"label_agreement":null},{"id":"W2106086560","doi":"10.1016/s0166-5316(00)00029-8","title":"Optimized caching in systems with heterogeneous client populations","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Server; Cache; Proxy (statistics); Proxy server; Multicast; Computer network; Bandwidth (computing); Content delivery; Workload; Distributed computing; False sharing; CPU cache; Cache algorithms; Operating system","score_opus":0.0461798311964317,"score_gpt":0.2736159252846863,"score_spread":0.2274360940882546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106086560","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.91967696,0.0012599999,0.074857175,0.00040388055,0.00006390196,0.0002143286,0.00023847367,0.0011736731,0.0021115209],"genre_scores_gemma":[0.9781617,0.00018582097,0.020765,0.00003285539,0.000032458927,0.000057871195,0.00014232205,0.00008392927,0.0005380881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99214137,0.0038083254,0.0004987096,0.0007800015,0.0015394064,0.0012321565],"domain_scores_gemma":[0.96106005,0.028511425,0.0016768465,0.004053793,0.0035301107,0.0011677913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008650792,0.0013225935,0.0022852295,0.0014110382,0.0016252857,0.002864737,0.002734257,0.0016094017,0.0011691416],"category_scores_gemma":[0.030076966,0.00088921667,0.000559069,0.0026817995,0.0022660743,0.004053352,0.0014104721,0.0010561303,0.00020206449],"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.0022341588,0.000508014,0.004853329,0.00012211547,0.00014929844,0.00013644913,0.00015398333,0.9612775,0.0048843976,0.0038774183,0.0011891259,0.020614363],"study_design_scores_gemma":[0.00011340284,0.00016963009,0.0007377723,0.0000037481138,0.000048021724,0.000043463602,0.00004294839,0.99536276,0.0022283182,0.0011386438,0.00009916172,0.000012155],"about_ca_topic_score_codex":0.020268237,"about_ca_topic_score_gemma":0.0120134335,"teacher_disagreement_score":0.020268237,"about_ca_system_score_codex":0.0059730974,"about_ca_system_score_gemma":0.00418554,"threshold_uncertainty_score":0.04575032},"labels":[],"label_agreement":null},{"id":"W2106171735","doi":"10.1109/pccc.2003.1203721","title":"Transparent distributed Web caching with minimum expected response time","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Cache; Smart Cache; Cache invalidation; Cache algorithms; Web server; Computer network; Server; Cache pollution; Response time; Operating system; Page cache; Latency (audio); Distributed computing; CPU cache; The Internet","score_opus":0.015820900638564856,"score_gpt":0.21291056924475385,"score_spread":0.19708966860618898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106171735","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.08730811,0.000720338,0.9016374,0.0003256549,0.000080891245,0.00027761547,0.00010122473,0.005605637,0.0039430936],"genre_scores_gemma":[0.87284565,0.00023638541,0.124090314,0.00011229908,0.000099088655,0.00018007317,0.00014754187,0.00015586798,0.0021327524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961903,0.0009702847,0.00029975062,0.00044354802,0.0017223828,0.00037363652],"domain_scores_gemma":[0.9923712,0.0021632144,0.0009099537,0.0027664688,0.0014511844,0.00033793345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00272961,0.0007639054,0.0018139499,0.00073252845,0.0008507278,0.001677154,0.0022610193,0.0012201401,0.0007281448],"category_scores_gemma":[0.009336354,0.0005864347,0.00076569454,0.0010775632,0.00083472073,0.0020358872,0.0014707723,0.0014104203,0.0005287757],"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.0039931075,0.0015493467,0.006749016,0.0007596098,0.00036322357,0.0012616303,0.0005041588,0.54314965,0.16360049,0.056175373,0.010519627,0.21137482],"study_design_scores_gemma":[0.00024097522,0.00026899602,0.00075180584,0.000015395117,0.0000674696,0.00034625622,0.000020438109,0.96704584,0.01602187,0.012846902,0.0023207006,0.00005340961],"about_ca_topic_score_codex":0.001468463,"about_ca_topic_score_gemma":0.001061502,"teacher_disagreement_score":0.00272961,"about_ca_system_score_codex":0.0011064153,"about_ca_system_score_gemma":0.0016198263,"threshold_uncertainty_score":0.0144357085},"labels":[],"label_agreement":null},{"id":"W2106423578","doi":"10.1109/infcom.2009.5062028","title":"NetTube: Exploring Social Networks for Peer-to-Peer Short Video Sharing","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Peer-to-peer; Upload; Cluster analysis; Workload; The Internet; Key (lock); Scheme (mathematics); Video quality; Multimedia; Architecture; Overlay; File sharing; Social media; World Wide Web; Computer network; Computer security; Artificial intelligence; Operating system","score_opus":0.08576782998461377,"score_gpt":0.28551742399521435,"score_spread":0.19974959401060058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106423578","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.15097134,0.00061013334,0.8376229,0.00090794585,0.000058209418,0.00036863572,0.0001854693,0.0011270891,0.008148288],"genre_scores_gemma":[0.74181855,0.00049443456,0.25381362,0.000081576916,0.0000392357,0.00026972333,0.0001771605,0.00007012232,0.003235521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944526,0.00029247603,0.0000146089005,0.000079032754,0.00012324844,0.000045418463],"domain_scores_gemma":[0.99908364,0.0005739579,0.00006744141,0.00008501264,0.000078130215,0.00011184488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009750624,0.0003983887,0.00040588342,0.0005693294,0.0011662496,0.0010574214,0.0015033352,0.0007550472,0.0021144042],"category_scores_gemma":[0.002718365,0.00025284663,0.0004720103,0.00054762745,0.0007822325,0.0025521151,0.0020587563,0.00053685915,0.0002677612],"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.00029989588,0.00040913536,0.004547718,0.00047786447,0.00017060798,0.00074705295,0.001743503,0.6540532,0.024331596,0.1598139,0.005809166,0.14759631],"study_design_scores_gemma":[0.00004239436,0.00012833624,0.00060503546,0.000013255174,0.000027836326,0.0001483897,0.00041680294,0.9434835,0.0029433286,0.043586146,0.00858115,0.000023902085],"about_ca_topic_score_codex":0.003528634,"about_ca_topic_score_gemma":0.004276117,"teacher_disagreement_score":0.003528634,"about_ca_system_score_codex":0.0007860804,"about_ca_system_score_gemma":0.0007968188,"threshold_uncertainty_score":0.0070734024},"labels":[],"label_agreement":null},{"id":"W2106614282","doi":"10.1287/ijoc.1040.0118","title":"Analyzing Document-Duplication Effects on Policies for Browser and Proxy Caching","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Ford Motor Company","keywords":"Computer science; Proxy (statistics); World Wide Web; Database","score_opus":0.008596965794737562,"score_gpt":0.25175117410807557,"score_spread":0.243154208313338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106614282","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.8992086,0.0015490702,0.092791796,0.00049287645,0.00007261955,0.0001861656,0.00015159642,0.00030110477,0.005246152],"genre_scores_gemma":[0.99116194,0.00032986587,0.00791645,0.000035822464,0.00002060392,0.000034034,0.000045958986,0.000032704625,0.00042259146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947807,0.0018753598,0.0002234494,0.00055301463,0.001373235,0.0011942746],"domain_scores_gemma":[0.93081963,0.05627098,0.004521995,0.003435359,0.0041477066,0.0008043461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008366493,0.00096033,0.0012394759,0.001312242,0.00087420526,0.0018008205,0.001585802,0.0014227959,0.00094353565],"category_scores_gemma":[0.04609974,0.00047829,0.00068443286,0.0017655863,0.0018797937,0.0033186374,0.0010388601,0.0018205747,0.00016074418],"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.0006374712,0.000309571,0.008772665,0.00014531167,0.00010427015,0.00033897694,0.00020776264,0.9396356,0.010518506,0.021469967,0.00069988344,0.017160112],"study_design_scores_gemma":[0.00002981516,0.00019275825,0.0024287535,0.000013356705,0.00007248757,0.00016546021,0.00013841684,0.9843891,0.008149967,0.0040934514,0.00029532582,0.00003100999],"about_ca_topic_score_codex":0.009584868,"about_ca_topic_score_gemma":0.006190223,"teacher_disagreement_score":0.009584868,"about_ca_system_score_codex":0.0077232537,"about_ca_system_score_gemma":0.0034551013,"threshold_uncertainty_score":0.056036413},"labels":[],"label_agreement":null},{"id":"W2107582728","doi":"10.1109/icnp.2006.320218","title":"Modeling and Caching of Peer-to-Peer Traffic","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Byte; The Internet; Cache; Computer network; Distributed computing; Internet traffic; Peer-to-peer; BitTorrent; Operating system","score_opus":0.014464088695355787,"score_gpt":0.22024229971052575,"score_spread":0.20577821101516997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107582728","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.46656418,0.0009455253,0.5223705,0.0008810446,0.00009482534,0.00023951364,0.00036962406,0.0008877659,0.0076469504],"genre_scores_gemma":[0.97492224,0.00050073274,0.022184331,0.00004070526,0.000052407446,0.00012322454,0.0001380718,0.00004051302,0.0019977535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888164,0.00041512633,0.00006387588,0.0001714684,0.0003127877,0.00015513944],"domain_scores_gemma":[0.99711466,0.001667801,0.00027065197,0.00029665523,0.00055264885,0.00009760583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014197079,0.0008565684,0.00094177667,0.0009411953,0.000808335,0.0015443586,0.0023163182,0.0027867614,0.00069349277],"category_scores_gemma":[0.0069894674,0.00052050536,0.0005027211,0.0013601448,0.0008245616,0.002692189,0.00057318324,0.00085241353,0.00031136448],"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.000027510627,0.000033527955,0.0012690789,0.000020826163,0.000009843327,0.00010036976,0.000058277667,0.98365396,0.0011747683,0.010588408,0.00026599108,0.002797368],"study_design_scores_gemma":[0.0000017795003,0.000004227146,0.000088575376,9.4275765e-7,0.0000017789778,0.000013491733,0.0000047511035,0.998618,0.00010435655,0.0010809709,0.00007893903,0.000002112941],"about_ca_topic_score_codex":0.01836758,"about_ca_topic_score_gemma":0.0068241004,"teacher_disagreement_score":0.01836758,"about_ca_system_score_codex":0.0021108687,"about_ca_system_score_gemma":0.0012523517,"threshold_uncertainty_score":0.036521375},"labels":[],"label_agreement":null},{"id":"W2107681918","doi":"10.5555/1870926.1871260","title":"SigNet: network-on-chip filtering for coarse vector directories","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Directory; Computer science; Scalability; Computer network; Cache; Latency (audio); Cache coherence; Bandwidth (computing); Distributed computing; Cache algorithms; Operating system; CPU cache; Telecommunications","score_opus":0.01770619068358665,"score_gpt":0.22936943019173878,"score_spread":0.21166323950815213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107681918","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.35331094,0.00096422643,0.6020064,0.0005972744,0.00029884648,0.00022693892,0.0003219965,0.022144882,0.020128502],"genre_scores_gemma":[0.86897576,0.00013663684,0.12001605,0.00020572309,0.00004184017,0.000082541104,0.00035361492,0.00017719426,0.010010575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968123,0.000058083435,0.000022528578,0.00004151689,0.00013539595,0.000061274775],"domain_scores_gemma":[0.99923027,0.00018548696,0.00010104978,0.00020563143,0.00021538853,0.00006221739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125199,0.00035466382,0.00033136265,0.00052875245,0.0005244893,0.00094921753,0.0009813668,0.00032539832,0.0057125445],"category_scores_gemma":[0.0011862585,0.00013933708,0.0001378606,0.00057186076,0.00032681288,0.00091698446,0.0005344223,0.00040234713,0.0009986702],"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.0018716106,0.00088623,0.010003326,0.00035091696,0.00013330634,0.00049490505,0.00018178162,0.100363135,0.30884585,0.024624633,0.049410205,0.5028342],"study_design_scores_gemma":[0.00010394323,0.0007983833,0.001677438,0.000031032472,0.000038777718,0.0002337695,0.00007292211,0.7847216,0.18491416,0.0029034351,0.024461474,0.00004316678],"about_ca_topic_score_codex":0.0017283823,"about_ca_topic_score_gemma":0.0047302856,"teacher_disagreement_score":0.0057125445,"about_ca_system_score_codex":0.0007328298,"about_ca_system_score_gemma":0.00082838454,"threshold_uncertainty_score":0.019110322},"labels":[],"label_agreement":null},{"id":"W2108775635","doi":"10.1109/cse.2009.396","title":"Socially Enhanced Network Address Translation","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"McGill University","funders":"","keywords":"NAT traversal; Network address translation; Computer science; Network topology; Network address; IPv4; Nat; Private network; Computer network; Computer security; The Internet; Architecture; Address space; Space (punctuation); Internet privacy; IPv6; World Wide Web; Internet Protocol","score_opus":0.022483727132104343,"score_gpt":0.24174849109921945,"score_spread":0.2192647639671151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108775635","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.06252738,0.00063168333,0.82602257,0.0034848205,0.0006759693,0.00025991714,0.00024318004,0.0015897745,0.10456466],"genre_scores_gemma":[0.8322719,0.000613015,0.1395578,0.00070067495,0.00027857453,0.00031782276,0.00026866188,0.00017842802,0.025813177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99742365,0.001291691,0.00012042301,0.00029389135,0.0006953111,0.00017499368],"domain_scores_gemma":[0.9936474,0.0019082547,0.00047250526,0.002529498,0.0012358499,0.00020651166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020289102,0.0005181792,0.00052958674,0.00069854455,0.0014695522,0.0020848955,0.0013325581,0.0014703501,0.0048148953],"category_scores_gemma":[0.010357643,0.00026954288,0.0004337305,0.0008314042,0.0017020905,0.004358335,0.0041132956,0.0011603234,0.0021455605],"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.00017286954,0.0001341081,0.0014945318,0.0002041498,0.00005044184,0.0005573489,0.0014526239,0.043186575,0.013819562,0.7552429,0.010482998,0.17320177],"study_design_scores_gemma":[0.000060057,0.00020625337,0.00070968026,0.00007745685,0.0000856538,0.0009865346,0.0007694469,0.25470456,0.01614456,0.57209164,0.1540675,0.00009670554],"about_ca_topic_score_codex":0.0010423413,"about_ca_topic_score_gemma":0.0013540818,"teacher_disagreement_score":0.0048148953,"about_ca_system_score_codex":0.0011025834,"about_ca_system_score_gemma":0.001329408,"threshold_uncertainty_score":0.01610744},"labels":[],"label_agreement":null},{"id":"W2110008840","doi":"10.1109/lcn.2004.81","title":"Multi-layer analysis of Web browsing performance for wireless PDAs","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Computer science; Computer network; Hypertext Transfer Protocol; Web navigation; Wireless network; Web server; Wireless Application Protocol; Application layer; World Wide Web; Web page; Wireless; The Internet; Operating system","score_opus":0.03789470443320863,"score_gpt":0.2659457002549591,"score_spread":0.22805099582175048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110008840","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.9865724,0.00016839328,0.012018148,0.000016175354,0.0000031256259,0.000014898024,0.00009950157,0.00041162682,0.0006956864],"genre_scores_gemma":[0.9967263,0.00008781877,0.0025985788,0.0000067383644,0.0000031776733,0.000007258051,0.0001301848,0.000030375475,0.0004094556],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951124,0.00009437395,0.000040988994,0.000076842574,0.00020734224,0.000069222624],"domain_scores_gemma":[0.9979912,0.0009253877,0.00021980701,0.00027640085,0.00049177255,0.00009529129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013802,0.00044696318,0.00046707326,0.000739345,0.00021148271,0.0006488019,0.00028547383,0.00035086967,0.00097491196],"category_scores_gemma":[0.002609619,0.00020786843,0.00025307023,0.000614677,0.0001415283,0.0008466319,0.0002756258,0.00043520136,0.0004809393],"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.0027849525,0.0008416873,0.11204322,0.0004946967,0.0004373322,0.00068164483,0.00066879054,0.08185899,0.65330726,0.0011038213,0.0008157167,0.14496195],"study_design_scores_gemma":[0.000031676635,0.0010655937,0.16182931,0.000027542117,0.00020840453,0.0009421717,0.00025204444,0.6157261,0.21797414,0.00073644595,0.0011245889,0.000082026316],"about_ca_topic_score_codex":0.00152655,"about_ca_topic_score_gemma":0.0008789309,"teacher_disagreement_score":0.00152655,"about_ca_system_score_codex":0.0003490033,"about_ca_system_score_gemma":0.00019686528,"threshold_uncertainty_score":0.003261447},"labels":[],"label_agreement":null},{"id":"W2110833653","doi":"10.1109/ideas.1998.694351","title":"WWW in DSM: collaborative caching on the Web","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Manitoba","funders":"","keywords":"Intranet; Computer science; Server; World Wide Web; The Internet; Cache; Web server; Operating system","score_opus":0.02632421001316322,"score_gpt":0.2086951233180184,"score_spread":0.18237091330485516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110833653","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.085002996,0.007979199,0.798395,0.0055026,0.0014795393,0.00031983783,0.00048147052,0.013476757,0.08736258],"genre_scores_gemma":[0.7351091,0.0040065525,0.2259789,0.0018963753,0.0006779368,0.00021502451,0.0012851628,0.0007698525,0.03006112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.00060500257,0.00011792422,0.00013655596,0.00043253563,0.00020498813],"domain_scores_gemma":[0.99842656,0.0002431862,0.00007814371,0.0007595863,0.00030975338,0.00018279545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012169911,0.0004431756,0.00073264225,0.00055931305,0.001288088,0.0038771844,0.0022378222,0.0017406696,0.0028577065],"category_scores_gemma":[0.0025805556,0.00053555024,0.00046018898,0.0017650712,0.0013982335,0.005354723,0.0023679787,0.00160299,0.0010183355],"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.0007949344,0.0004192535,0.0034810447,0.0007017607,0.00011771439,0.0014215678,0.0011981479,0.04052584,0.019559577,0.6529737,0.07086117,0.20794529],"study_design_scores_gemma":[0.0003347181,0.00031064101,0.0012941723,0.00017319119,0.00023759117,0.0021371425,0.00060475554,0.3429616,0.030161412,0.2651916,0.35646284,0.00013034068],"about_ca_topic_score_codex":0.005296795,"about_ca_topic_score_gemma":0.0061872844,"teacher_disagreement_score":0.005296795,"about_ca_system_score_codex":0.0010702794,"about_ca_system_score_gemma":0.0018230625,"threshold_uncertainty_score":0.010531902},"labels":[],"label_agreement":null},{"id":"W2111806784","doi":"10.1109/deec.2005.25","title":"Using semantic information to improve transparent query caching for dynamic content Web sites","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Query optimization; Query expansion; Sargable; Cache; Web search query; Web query classification; Information retrieval; Benchmark (surveying); Query language; Database; Spatial query; Dynamic web page; World Wide Web; Search engine; Web page; Operating system","score_opus":0.05944628871965589,"score_gpt":0.28030997960130744,"score_spread":0.22086369088165153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111806784","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.46511248,0.003667341,0.49772426,0.0008775372,0.00019874383,0.00041932307,0.00044119495,0.027350454,0.0042086556],"genre_scores_gemma":[0.8852324,0.00046629983,0.11157834,0.00016038567,0.00007724108,0.00007275162,0.0007362039,0.0007089524,0.00096751517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99330163,0.0014393601,0.0006919943,0.0006092548,0.0028903827,0.0010673896],"domain_scores_gemma":[0.97770166,0.009361133,0.0017884298,0.006716492,0.0037534554,0.0006788328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004935528,0.0016331635,0.0017918976,0.0019944326,0.0013048509,0.004022908,0.0043259715,0.0013853592,0.0012348832],"category_scores_gemma":[0.027638007,0.00097602856,0.00091543276,0.003021478,0.0015372414,0.011236511,0.0030710544,0.001767374,0.0004935516],"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.00397238,0.001684649,0.0501486,0.0010716679,0.0005887331,0.0011508415,0.0023072388,0.33651736,0.20545135,0.021760633,0.011968184,0.36337832],"study_design_scores_gemma":[0.00010548594,0.00040954968,0.0027705375,0.000034560355,0.0001802989,0.00031766473,0.00022736209,0.9371715,0.04958283,0.0042697676,0.0048220726,0.00010832485],"about_ca_topic_score_codex":0.013150473,"about_ca_topic_score_gemma":0.0101088835,"teacher_disagreement_score":0.013150473,"about_ca_system_score_codex":0.0021335261,"about_ca_system_score_gemma":0.0037225944,"threshold_uncertainty_score":0.026147902},"labels":[],"label_agreement":null},{"id":"W2112162877","doi":"10.1109/mascot.2002.1167096","title":"WebTraff: a GUI for Web proxy cache workload modeling and analysis","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":42,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Workload; Locality; Proxy (statistics); Web page; Web application; Web server; Operating system; Database; World Wide Web; The Internet; Machine learning","score_opus":0.024504623588967208,"score_gpt":0.23781207574621152,"score_spread":0.2133074521572443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112162877","genre_codex":"software","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.0048637176,0.00017799308,0.46602318,0.00013771269,0.00007466367,0.00035353363,0.006792308,0.5134781,0.00809875],"genre_scores_gemma":[0.15378484,0.0011196021,0.6235015,0.0015491719,0.00024071164,0.0037892072,0.04463647,0.13493957,0.036438946],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994148,0.000104830084,0.00006123526,0.00009155807,0.0002622221,0.00006530935],"domain_scores_gemma":[0.9981735,0.00095871574,0.00009032583,0.00023823435,0.00042295537,0.00011630718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010942515,0.0020275242,0.0010331956,0.0017601791,0.00030287926,0.0012266752,0.0023724425,0.0010000308,0.037517373],"category_scores_gemma":[0.0038335123,0.0008496714,0.0008742223,0.0008311634,0.00022857773,0.0015385734,0.0011472562,0.0014294962,0.014880646],"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.0017515268,0.0006345099,0.00792311,0.0011646996,0.0002841552,0.0012296354,0.0006653812,0.04257658,0.04228844,0.008344768,0.48347336,0.40966386],"study_design_scores_gemma":[0.00067788357,0.0002890337,0.008012751,0.00026880772,0.00012543963,0.001443257,0.000108383814,0.6181447,0.054748964,0.011058112,0.30471924,0.0004034395],"about_ca_topic_score_codex":0.0033071183,"about_ca_topic_score_gemma":0.0026146127,"teacher_disagreement_score":0.037517373,"about_ca_system_score_codex":0.00044032556,"about_ca_system_score_gemma":0.0005814135,"threshold_uncertainty_score":0.12550813},"labels":[],"label_agreement":null},{"id":"W2112368807","doi":"10.1109/dest.2008.4635180","title":"Super-consumer based reputation management for web service systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Reputation; Judgement; Reputation management; Reputation system; Computer science; Service (business); Business; Internet privacy; Knowledge management; Marketing","score_opus":0.03281751637440243,"score_gpt":0.22367848190352432,"score_spread":0.1908609655291219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112368807","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.048610006,0.0012539783,0.9282332,0.0018218997,0.00035191438,0.00035083573,0.000108422326,0.00402106,0.015248644],"genre_scores_gemma":[0.82201105,0.0005723397,0.16586366,0.00034535516,0.00048248717,0.0002009958,0.0002843016,0.00028372425,0.009956065],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947747,0.0019543266,0.0004026133,0.0006631232,0.0018795884,0.00032557856],"domain_scores_gemma":[0.9873095,0.003930366,0.0012627668,0.0028164182,0.0035339748,0.0011469554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062423563,0.00056891475,0.0011520019,0.0014765264,0.0023441091,0.003312906,0.0027986213,0.0016213106,0.0031647303],"category_scores_gemma":[0.011229757,0.00061130704,0.00062331074,0.0013653791,0.0012153011,0.007536505,0.0030826076,0.0020444081,0.0013396428],"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.0011875603,0.00070012495,0.013571687,0.00087258266,0.0005198344,0.0017554988,0.002861319,0.09042375,0.036139954,0.3271316,0.04505926,0.4797769],"study_design_scores_gemma":[0.00009635636,0.00030064062,0.0019842917,0.000039281196,0.00017260174,0.0008260827,0.00031714363,0.869282,0.0113474,0.075920455,0.039528653,0.00018504451],"about_ca_topic_score_codex":0.0023415957,"about_ca_topic_score_gemma":0.0024630385,"teacher_disagreement_score":0.0062423563,"about_ca_system_score_codex":0.0014518582,"about_ca_system_score_gemma":0.0014798167,"threshold_uncertainty_score":0.033013105},"labels":[],"label_agreement":null},{"id":"W2112716715","doi":"10.1109/tpds.2007.1119","title":"rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Peer-to-peer; Computer network; Latency (audio); Network topology; Coding (social sciences); Multimedia; Distributed computing; Telecommunications; Network packet","score_opus":0.014971959782380381,"score_gpt":0.23758531545923067,"score_spread":0.22261335567685028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112716715","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.044038605,0.00042100265,0.94555175,0.00020066391,0.000088124674,0.00016496863,0.00007578963,0.0070632985,0.0023958418],"genre_scores_gemma":[0.5441757,0.00031453688,0.45178154,0.00014470001,0.00005136618,0.00022201505,0.00019259122,0.0003549423,0.0027626597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989926,0.00025998574,0.0000613455,0.000100462166,0.00048549136,0.000100090634],"domain_scores_gemma":[0.99780685,0.0009960558,0.00016903592,0.00044069148,0.00045560073,0.00013186129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112728,0.00048562567,0.00060824695,0.00060856494,0.0005654842,0.00079232274,0.0018412995,0.0010659772,0.0012568142],"category_scores_gemma":[0.005548065,0.00026869,0.00031538488,0.00052996824,0.0011461825,0.0016773001,0.0016840774,0.0012235938,0.00047540068],"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.0007815141,0.00023935467,0.0011262306,0.00019179317,0.000078029974,0.00042729345,0.00039806654,0.6831179,0.05817527,0.04762333,0.0060867686,0.2017544],"study_design_scores_gemma":[0.00004718791,0.00006429544,0.00005797336,0.000008490361,0.0000050157764,0.00006603053,0.000014434811,0.98136985,0.012797082,0.003924889,0.0016250536,0.000019804209],"about_ca_topic_score_codex":0.004760646,"about_ca_topic_score_gemma":0.0034867446,"teacher_disagreement_score":0.004760646,"about_ca_system_score_codex":0.0008812438,"about_ca_system_score_gemma":0.001628083,"threshold_uncertainty_score":0.009465873},"labels":[],"label_agreement":null},{"id":"W2113292847","doi":"10.1016/j.comnet.2012.02.015","title":"A bandwidth and effective hit optimal cache scheme for wireless data access networks with client injected updates","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Computer network; Cache invalidation; Bandwidth (computing); Cache algorithms; WiMAX; Wireless network; Smart Cache; Data access; Wireless; Distributed computing; CPU cache; Telecommunications; Database","score_opus":0.026932808309434467,"score_gpt":0.26445712566723295,"score_spread":0.2375243173577985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113292847","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.139122,0.002726779,0.8515403,0.0005257198,0.0002233297,0.00020659645,0.00023779695,0.0017008543,0.003716625],"genre_scores_gemma":[0.91183716,0.0004959965,0.08454216,0.000118389806,0.00012123559,0.00008425597,0.00011959621,0.00008078158,0.0026005004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866045,0.00031472603,0.00008849934,0.00014042597,0.00055250834,0.00024337335],"domain_scores_gemma":[0.9964539,0.0014877825,0.00027051184,0.000697744,0.0008957536,0.00019433146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015805162,0.0007696361,0.0019464986,0.0013356515,0.0014174263,0.0018191638,0.0028434978,0.0010139004,0.0017811015],"category_scores_gemma":[0.0063313213,0.0005052487,0.00031894076,0.001905528,0.0010407438,0.0025727027,0.0015824965,0.0010212794,0.00028040714],"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.0031825316,0.00079895905,0.0034002601,0.0004456208,0.00021393909,0.00043833445,0.0005696286,0.45675898,0.039972037,0.097618766,0.017278258,0.37932256],"study_design_scores_gemma":[0.00005522574,0.00016415348,0.00021302156,0.000009295609,0.000048370373,0.0001406195,0.000045413984,0.98770577,0.0029751325,0.0077403863,0.0008761074,0.000026443653],"about_ca_topic_score_codex":0.004786028,"about_ca_topic_score_gemma":0.008325115,"teacher_disagreement_score":0.004786028,"about_ca_system_score_codex":0.0022426483,"about_ca_system_score_gemma":0.002215053,"threshold_uncertainty_score":0.01627165},"labels":[],"label_agreement":null},{"id":"W2114603263","doi":"10.1145/1134680.1134687","title":"Efficient and transparent dynamic content updates for mobile clients","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mobile device; Server; Computer network; Proxy server; Proxy (statistics); Web page; Database; Operating system; World Wide Web","score_opus":0.021297367451789666,"score_gpt":0.2375496061751758,"score_spread":0.21625223872338611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114603263","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.28044894,0.0015627352,0.6318986,0.0005840843,0.0001749009,0.0009322734,0.00068591046,0.06258882,0.021123651],"genre_scores_gemma":[0.88629,0.000345987,0.1022507,0.00013759105,0.00008105039,0.00020093727,0.00061401457,0.000728722,0.0093509685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880195,0.00014668531,0.000085273314,0.00015730868,0.0006090807,0.00019973988],"domain_scores_gemma":[0.9980287,0.00039167798,0.00017480816,0.00083487673,0.00040245068,0.00016747849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006338511,0.00082113425,0.0008756104,0.0006787178,0.0005261713,0.0021229591,0.0022894028,0.0010309578,0.0033065763],"category_scores_gemma":[0.0045099384,0.00063997804,0.0002466492,0.00073839683,0.00044405667,0.0024544974,0.002331605,0.00090724236,0.0020678332],"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.0024706614,0.00090685615,0.013021321,0.000358016,0.00010484655,0.0018257544,0.001387629,0.038346056,0.2361255,0.01721408,0.018552233,0.66968703],"study_design_scores_gemma":[0.00018265858,0.00027107072,0.0055351374,0.000049023776,0.00007971616,0.0009618846,0.0003354446,0.84171534,0.10945358,0.0064611766,0.03484499,0.000109968336],"about_ca_topic_score_codex":0.00305556,"about_ca_topic_score_gemma":0.0022505492,"teacher_disagreement_score":0.0033065763,"about_ca_system_score_codex":0.0006418754,"about_ca_system_score_gemma":0.00084894744,"threshold_uncertainty_score":0.011061549},"labels":[],"label_agreement":null},{"id":"W2115914192","doi":"10.1109/mascot.2003.1240677","title":"A packet-level simulation study of optimal Web proxy cache placement","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Cache algorithms; Computer network; Cache pollution; Cache invalidation; Smart Cache; Distributed computing; Cache coloring; Heuristics; Proxy (statistics); Network packet; CPU cache; Operating system","score_opus":0.05185223727297933,"score_gpt":0.28042278793849096,"score_spread":0.22857055066551163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115914192","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.9360209,0.00023134059,0.052859597,0.0005639444,0.00005657514,0.000087169625,0.0003303743,0.00018575767,0.00966439],"genre_scores_gemma":[0.9928294,0.00010603997,0.0063212304,0.000052110077,0.0000073460324,0.000035837555,0.00010543213,0.00001746528,0.0005251793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996722,0.000107230735,0.000011234829,0.000033154534,0.00006495208,0.00011132467],"domain_scores_gemma":[0.99719954,0.0020918986,0.0001724071,0.0001242579,0.00030392176,0.0001079596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000835041,0.0003926664,0.0005317306,0.00043241028,0.00042599178,0.00057804596,0.00068183,0.00093632605,0.0011579164],"category_scores_gemma":[0.004286779,0.00025646132,0.0003712594,0.0006314703,0.0007369828,0.0009649078,0.0003716842,0.000899039,0.000083185536],"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.00003036567,0.00004848664,0.0010596756,0.000014709837,0.000010209905,0.000028811313,0.000021789232,0.9950447,0.00066339085,0.0020451695,0.00019801018,0.0008347455],"study_design_scores_gemma":[0.00000828213,0.000024645218,0.00020641074,0.0000015722469,0.0000034189404,0.000004321097,0.000015752796,0.9990144,0.00033229822,0.0003085211,0.00007767697,0.0000027522176],"about_ca_topic_score_codex":0.015066817,"about_ca_topic_score_gemma":0.0072773695,"teacher_disagreement_score":0.015066817,"about_ca_system_score_codex":0.0013757417,"about_ca_system_score_gemma":0.0009639384,"threshold_uncertainty_score":0.029958189},"labels":[],"label_agreement":null},{"id":"W2116314110","doi":"10.1145/2486001.2491714","title":"Smart in-network deduplication for storage-aware SDN","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Data deduplication; Computer science; Bottleneck; Computer network; Software-defined networking; Distributed computing; Overhead (engineering); Search engine indexing; Operating system; Embedded system","score_opus":0.014148966049237892,"score_gpt":0.2155580607613751,"score_spread":0.2014090947121372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116314110","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.23489884,0.001410817,0.75047976,0.00034394558,0.00038476477,0.00034888994,0.00025563498,0.006261474,0.0056159007],"genre_scores_gemma":[0.87160474,0.00027854848,0.1254316,0.00017212832,0.000065735345,0.00010221216,0.00027306736,0.00011582419,0.0019561865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995976,0.00006693556,0.00006302615,0.00007625058,0.00015237347,0.00004372406],"domain_scores_gemma":[0.99846715,0.00032402077,0.00013858204,0.0006012385,0.00039436726,0.00007473709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363537,0.00040029365,0.00041429378,0.00046170576,0.00063966773,0.00079456606,0.0013758824,0.00027864584,0.0008589407],"category_scores_gemma":[0.0015616503,0.00019383445,0.00019085649,0.0004014282,0.00039969158,0.0014203279,0.00076573907,0.00051536516,0.00016883071],"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.0016523881,0.0007628337,0.014035474,0.00085997593,0.00022331845,0.00079364603,0.0006776318,0.07514367,0.40584832,0.029493244,0.013353567,0.45715585],"study_design_scores_gemma":[0.00010597698,0.00031425254,0.001812659,0.000038190043,0.00008805957,0.0006334901,0.00011059765,0.72573376,0.24782039,0.0065432084,0.016736897,0.00006251348],"about_ca_topic_score_codex":0.0008175931,"about_ca_topic_score_gemma":0.0017668045,"teacher_disagreement_score":0.0013758824,"about_ca_system_score_codex":0.00064816413,"about_ca_system_score_gemma":0.0007699222,"threshold_uncertainty_score":0.0047028065},"labels":[],"label_agreement":null},{"id":"W2117260160","doi":"10.1109/icde.2005.6","title":"A Comparative Evaluation of Transparent Scaling Techniques for Dynamic Content Servers","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":69,"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; Scheduling (production processes); Distributed computing; Server; Workload; Load balancing (electrical power); Dynamic web page; Software deployment; Database; Computer network; Operating system; Web service; World Wide Web","score_opus":0.20197673927922508,"score_gpt":0.36440329557997686,"score_spread":0.16242655630075178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117260160","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.8632955,0.0048063467,0.11216794,0.00045446,0.00017099199,0.0006483984,0.00027700452,0.0067352974,0.011444045],"genre_scores_gemma":[0.9296925,0.001110572,0.067169406,0.00006877215,0.000074959,0.00013167149,0.00033678146,0.00043739466,0.0009779019],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99454063,0.0014560665,0.00059235893,0.0004136464,0.002529777,0.00046752166],"domain_scores_gemma":[0.97919846,0.010533162,0.002187428,0.0044212593,0.0029435877,0.0007161181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037308072,0.0015318524,0.0009787234,0.002441544,0.0010333591,0.0017464594,0.0022878435,0.00097245874,0.0010854328],"category_scores_gemma":[0.019272855,0.0006050916,0.0007981209,0.00289535,0.00083961355,0.0029980852,0.0013080039,0.0008097421,0.00032666026],"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.0060590673,0.0032470378,0.01820222,0.0023433338,0.0006514893,0.0006236525,0.0014353988,0.18882972,0.21413967,0.008884466,0.0062709698,0.549313],"study_design_scores_gemma":[0.0005982342,0.00526018,0.017926816,0.00012538499,0.0005199666,0.0006863134,0.0007949083,0.8551159,0.10858184,0.0031031985,0.0070762443,0.00021104174],"about_ca_topic_score_codex":0.002395288,"about_ca_topic_score_gemma":0.0023260422,"teacher_disagreement_score":0.0037308072,"about_ca_system_score_codex":0.0008219465,"about_ca_system_score_gemma":0.0009320874,"threshold_uncertainty_score":0.019730628},"labels":[],"label_agreement":null},{"id":"W2117777550","doi":"10.1155/2013/915963","title":"A Relation Routing Scheme for Distributed Semantic Media Query","year":2013,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"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":"Hunan University of Science and Technology; Natural Science Foundation of Beijing Municipality; National Institute on Alcohol Abuse and Alcoholism; Max-Planck-Gesellschaft; Hunan University; National Natural Science Foundation of China; Sun Yat-sen University; Natural Science Foundation of Hunan Province; University of Ottawa","keywords":"Computer science; Scalability; Semantic computing; Routing (electronic design automation); Scheme (mathematics); Relation (database); Semantic query; Information retrieval; Distributed computing; Data mining; Computer network; Semantic Web; Database; Web search query; Search engine","score_opus":0.023495129094642183,"score_gpt":0.22868943326621466,"score_spread":0.20519430417157247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117777550","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.009848588,0.00027088434,0.9839812,0.00024010676,0.00010208255,0.00026747197,0.00018063023,0.002677189,0.002431815],"genre_scores_gemma":[0.3373733,0.00044408042,0.6554462,0.0002467378,0.00014596463,0.000327489,0.00096228585,0.0002331554,0.0048207208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716276,0.00069831195,0.00045565848,0.00062456354,0.0008602406,0.00019837756],"domain_scores_gemma":[0.99648595,0.0008674734,0.0002606013,0.0014963853,0.0007486512,0.00014093152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034087205,0.00066074904,0.0010716342,0.0017744259,0.0016758364,0.0020868748,0.0019943044,0.001245488,0.00264253],"category_scores_gemma":[0.0059510972,0.00035900468,0.00075962784,0.002056208,0.00093709497,0.0051280013,0.0022260784,0.0011661696,0.001104978],"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.0011261071,0.00037225487,0.00204635,0.0004902465,0.00012667486,0.00041295658,0.0013026161,0.0816597,0.083212495,0.28820708,0.021731792,0.5193117],"study_design_scores_gemma":[0.00016174876,0.00037568566,0.00054277957,0.000033231463,0.0001166716,0.00065697066,0.00028034276,0.8762485,0.028344132,0.04984848,0.043210592,0.00018086795],"about_ca_topic_score_codex":0.0038498077,"about_ca_topic_score_gemma":0.0031040763,"teacher_disagreement_score":0.0038498077,"about_ca_system_score_codex":0.0017531284,"about_ca_system_score_gemma":0.0020084258,"threshold_uncertainty_score":0.018027246},"labels":[],"label_agreement":null},{"id":"W2118766926","doi":"10.1109/ds-rt.2011.14","title":"Error-Resilient Routing for Supporting Multi-dimensional Range Query in HD Tree","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Routing table; Routing (electronic design automation); Static routing; Multipath routing; Distributed computing; Tree (set theory); Destination-Sequenced Distance Vector routing; Link-state routing protocol; Dynamic Source Routing; Range (aeronautics); Computer network; Routing protocol; Mathematics; Engineering","score_opus":0.0807388463711615,"score_gpt":0.2826802693643938,"score_spread":0.20194142299323228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118766926","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.28055778,0.00089973107,0.7099133,0.00032878813,0.00008198761,0.00020714942,0.00047209326,0.0035949417,0.003944256],"genre_scores_gemma":[0.793364,0.00027504357,0.20401554,0.000094711024,0.000033949666,0.000097751676,0.0008323132,0.00007064471,0.0012160308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935776,0.00015826548,0.000066232395,0.00008451732,0.00024689583,0.00008638621],"domain_scores_gemma":[0.99758816,0.00075122714,0.00022880334,0.00086298934,0.00045822092,0.00011066338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009666805,0.00025218143,0.000477888,0.00077394856,0.0007481809,0.0006544134,0.0010662286,0.00045610563,0.0008326751],"category_scores_gemma":[0.003791528,0.00015755881,0.00021596384,0.0010698237,0.00040856976,0.0016798651,0.00078817277,0.0003257661,0.00026136296],"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.0020156961,0.00043045855,0.012523239,0.0006668779,0.00015789283,0.0011341547,0.00068448915,0.3372007,0.2611208,0.0327309,0.011486425,0.3398484],"study_design_scores_gemma":[0.00012010864,0.00068400573,0.0036571813,0.000021660097,0.000083160805,0.0007115343,0.00021991093,0.9075759,0.06306193,0.013740608,0.0100602,0.00006380096],"about_ca_topic_score_codex":0.0021522585,"about_ca_topic_score_gemma":0.0024667026,"teacher_disagreement_score":0.0021522585,"about_ca_system_score_codex":0.0005393092,"about_ca_system_score_gemma":0.00060530216,"threshold_uncertainty_score":0.00511235},"labels":[],"label_agreement":null},{"id":"W2119037696","doi":"10.1109/mascot.2002.1167056","title":"Workload characterization in Web caching hierarchies","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; Smart Cache; TRACE (psycholinguistics); CPU cache; Aggregate (composite); Computer network; Database; Distributed computing; Cache algorithms","score_opus":0.010389025916223437,"score_gpt":0.19982673455896255,"score_spread":0.18943770864273912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119037696","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.98951423,0.000038612518,0.009811201,0.000037151956,0.0000030320562,0.000020360583,0.00005444479,0.00009773127,0.00042325532],"genre_scores_gemma":[0.9988456,0.0000131521265,0.0009933708,0.000005701258,0.0000015589317,0.000007734892,0.000061601844,0.0000069998455,0.000064297725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919146,0.00032265394,0.00005168833,0.000085470245,0.00023030161,0.0001184335],"domain_scores_gemma":[0.99638677,0.0020396628,0.00038980416,0.00033775673,0.0006518613,0.00019414055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001094484,0.0003844049,0.0003524907,0.0005494829,0.0003089575,0.00068579585,0.00056992035,0.0005932195,0.00026078697],"category_scores_gemma":[0.007076552,0.00023573879,0.00022860561,0.0005346804,0.00035184206,0.0008504518,0.00024286694,0.00033290248,0.00007310041],"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.00047656576,0.00035490113,0.060508396,0.00008275723,0.000050052065,0.00038232087,0.00046120264,0.8745961,0.043536875,0.0030895337,0.00037154468,0.016089786],"study_design_scores_gemma":[0.000007845971,0.00006961969,0.0044041025,0.0000025463733,0.0000051825173,0.000049242157,0.000068733105,0.9896153,0.0049451063,0.00074527436,0.00007992135,0.00000709636],"about_ca_topic_score_codex":0.006516542,"about_ca_topic_score_gemma":0.003083947,"teacher_disagreement_score":0.006516542,"about_ca_system_score_codex":0.001029515,"about_ca_system_score_gemma":0.0006039303,"threshold_uncertainty_score":0.012957215},"labels":[],"label_agreement":null},{"id":"W2119978482","doi":"10.1109/icdcsw.2003.1203667","title":"Optimal and near optimal web proxy placement algorithms for networks with planar graph topologies","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Network topology; Topology (electrical circuits); Algorithm; Graph; Cache; Planar graph; Planar; Minimax; Distributed computing; Computer network; Theoretical computer science; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.015937390236866595,"score_gpt":0.23066932980701907,"score_spread":0.21473193957015246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119978482","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.022102542,0.00026365794,0.9744179,0.00015936079,0.000020968097,0.00008124517,0.000075471646,0.00031359072,0.002565176],"genre_scores_gemma":[0.36256042,0.000571912,0.63321054,0.00009244084,0.000044135115,0.00025032807,0.00032191013,0.0001786804,0.0027695424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938154,0.00021338888,0.000036495603,0.00012507968,0.00013230173,0.00011116767],"domain_scores_gemma":[0.9983038,0.0010994045,0.00021821346,0.000108165965,0.00016415726,0.0001062642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010079637,0.001074094,0.0011822704,0.0011191724,0.0006629217,0.0012138053,0.0014108958,0.0011569881,0.0023645272],"category_scores_gemma":[0.0045328964,0.00085852057,0.00075545564,0.0011954249,0.0009341234,0.001888281,0.001367981,0.0009603194,0.000563352],"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.000092295464,0.000050046074,0.00038230116,0.000087368346,0.000021183323,0.000034328194,0.00008051942,0.9316781,0.0011854799,0.016909255,0.0010563654,0.04842266],"study_design_scores_gemma":[0.000023034847,0.000053791555,0.00010303172,0.000009290435,0.000008795771,0.00003127682,0.00005588989,0.9800709,0.0008206544,0.018134056,0.0006799199,0.000009454519],"about_ca_topic_score_codex":0.0036825447,"about_ca_topic_score_gemma":0.0044348957,"teacher_disagreement_score":0.0036825447,"about_ca_system_score_codex":0.0016238078,"about_ca_system_score_gemma":0.0014704255,"threshold_uncertainty_score":0.011781633},"labels":[],"label_agreement":null},{"id":"W2120117879","doi":"10.1155/wcn.2005.57","title":"A Proxy Architecture to Enhance the Performance of WAP 2.0 by Data Compression","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; CDMA2000; Computer network; Wireless; Wireless Application Protocol; Data compression; Wireless network; Telecommunications; Algorithm; Code division multiple access","score_opus":0.033140643067161135,"score_gpt":0.29407565047370016,"score_spread":0.260935007406539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120117879","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.31524032,0.0013252638,0.6556567,0.00033904042,0.00032297056,0.00028346345,0.00014481349,0.016767928,0.00991947],"genre_scores_gemma":[0.8702478,0.00043387036,0.1214253,0.00019678516,0.000117082156,0.000110627596,0.0004211276,0.00039869957,0.0066486765],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996723,0.000053425785,0.00003586003,0.000046782163,0.00013045034,0.00006117637],"domain_scores_gemma":[0.9989912,0.00016927804,0.000081872655,0.00036413796,0.00032524002,0.00006834548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050371065,0.00053825154,0.00041003508,0.0007167773,0.00036129646,0.00097384525,0.0011185133,0.0005223368,0.0014135749],"category_scores_gemma":[0.0015540422,0.00026600904,0.00022655897,0.0005296935,0.00029728966,0.0016222117,0.00078171014,0.0008383288,0.0007317886],"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.0012298594,0.00033349002,0.003930524,0.0003290027,0.000099017125,0.0010879172,0.00033127272,0.021794045,0.61971086,0.02007572,0.006181796,0.32489645],"study_design_scores_gemma":[0.00011854959,0.00089150114,0.0034410886,0.000049302744,0.00011418246,0.002250924,0.000088563495,0.40177965,0.55318874,0.0043085166,0.03366152,0.00010747011],"about_ca_topic_score_codex":0.00046682515,"about_ca_topic_score_gemma":0.00037390913,"teacher_disagreement_score":0.0014135749,"about_ca_system_score_codex":0.0003653341,"about_ca_system_score_gemma":0.00036248102,"threshold_uncertainty_score":0.0047289133},"labels":[],"label_agreement":null},{"id":"W2122738249","doi":"10.1109/icc.2005.1494366","title":"On peer-to-peer client web cache sharing","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cache; Server; Web server; Cache algorithms; Peer-to-peer; Computer network; Smart Cache; Single point of failure; Cache invalidation; Distributed computing; False sharing; CPU cache; World Wide Web; The Internet","score_opus":0.024931786359442508,"score_gpt":0.25661986531306546,"score_spread":0.23168807895362295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122738249","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.099261165,0.0010582904,0.8893281,0.000350831,0.00007439023,0.0002851405,0.00005601731,0.0019725598,0.007613579],"genre_scores_gemma":[0.85793597,0.000645557,0.1336952,0.00013379104,0.00015690656,0.0002082198,0.00009030654,0.00010204537,0.007031928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971545,0.000801247,0.00009648137,0.00036981597,0.0013641518,0.00021379194],"domain_scores_gemma":[0.9959124,0.0014463927,0.00020383933,0.0009791177,0.001321369,0.00013692606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017982818,0.000543934,0.0015159913,0.00078364636,0.0013341347,0.0012138723,0.0025488143,0.0014157271,0.0015338148],"category_scores_gemma":[0.006837509,0.00041853308,0.00031026482,0.0019022196,0.0011045055,0.0029666908,0.0011547959,0.00088091,0.00084478967],"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.001543334,0.0005728311,0.0051514474,0.00054465263,0.00025876818,0.0018952463,0.0014510826,0.45290223,0.048524976,0.094605274,0.011055258,0.38149494],"study_design_scores_gemma":[0.000034018874,0.00010172949,0.00030349128,0.000009249647,0.000033954824,0.00033709424,0.000068801455,0.97899514,0.006357169,0.010215989,0.0035121622,0.000031170646],"about_ca_topic_score_codex":0.0048095314,"about_ca_topic_score_gemma":0.003568508,"teacher_disagreement_score":0.0048095314,"about_ca_system_score_codex":0.0010305459,"about_ca_system_score_gemma":0.0009979155,"threshold_uncertainty_score":0.009563088},"labels":[],"label_agreement":null},{"id":"W2123194759","doi":"10.1109/ictmicc.2007.4448580","title":"A lightweight semantic overlay resource discovery","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Service discovery; Distributed computing; Overlay network; Computer network; Semantic grid; World Wide Web; Web service; The Internet; Semantic Web","score_opus":0.009540482543208415,"score_gpt":0.216802088654938,"score_spread":0.20726160611172958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123194759","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.011015742,0.0002767488,0.9823934,0.00026663498,0.000111104426,0.00014799683,0.000125948,0.0016563648,0.004006167],"genre_scores_gemma":[0.3214184,0.0004926428,0.67238027,0.00010737905,0.00007031473,0.00018032615,0.00038718162,0.00010788839,0.004855672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998417,0.00025947986,0.00012889534,0.00023009654,0.00080593093,0.000158586],"domain_scores_gemma":[0.99897146,0.00020424035,0.00008048299,0.00038305004,0.00028402027,0.000076789795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012457044,0.00037630092,0.0008877098,0.0012347638,0.001097342,0.0016920561,0.0016146363,0.00086882623,0.0013378526],"category_scores_gemma":[0.0027462402,0.00032482334,0.0006191163,0.0012498153,0.000773344,0.0033147694,0.00240262,0.00079598813,0.0004812509],"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.00040943295,0.00024487465,0.0017598511,0.00066115777,0.00015286745,0.0008353459,0.0005316191,0.088173985,0.066162474,0.33598265,0.013133392,0.49195233],"study_design_scores_gemma":[0.000049742,0.00018164718,0.00050310855,0.000039807073,0.00010588224,0.000953032,0.00019395932,0.8296508,0.036594387,0.061698478,0.06993831,0.00009078959],"about_ca_topic_score_codex":0.0025651753,"about_ca_topic_score_gemma":0.003027491,"teacher_disagreement_score":0.0025651753,"about_ca_system_score_codex":0.0011169151,"about_ca_system_score_gemma":0.002251496,"threshold_uncertainty_score":0.0081038475},"labels":[],"label_agreement":null},{"id":"W2123344205","doi":"10.1109/cnsr.2005.61","title":"Understanding the Performance of Cooperative Web Caching Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Bottleneck; Cache; Latency (audio); Distributed computing; The Internet; Computer network; Smart Cache; Cache algorithms; False sharing; Bandwidth (computing); CPU cache; Operating system; Embedded system","score_opus":0.06374374701568072,"score_gpt":0.23366195690375083,"score_spread":0.1699182098880701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123344205","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.6352128,0.0033082322,0.34302017,0.00075474026,0.000050848616,0.00010043994,0.00019365162,0.0007578854,0.016601149],"genre_scores_gemma":[0.9905911,0.00056006864,0.007933234,0.000027333346,0.000029338778,0.000037873247,0.00007328916,0.000036309633,0.00071142113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990397,0.0002645272,0.00004848606,0.0001446668,0.00035979712,0.0001428639],"domain_scores_gemma":[0.99647826,0.0019976876,0.00034536707,0.00037274,0.0007268553,0.00007912526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012515456,0.0008717111,0.0009189222,0.0008799294,0.0004629139,0.0016151905,0.001206196,0.0015437021,0.0010319592],"category_scores_gemma":[0.010053479,0.00049143017,0.000303411,0.0009382456,0.00067460124,0.0036240953,0.00065027835,0.00089298096,0.00043175704],"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.00011394853,0.0001503309,0.004435974,0.00012890849,0.000051497565,0.00013388775,0.00024710488,0.93422395,0.012747266,0.028133973,0.0005738866,0.019059237],"study_design_scores_gemma":[0.0000064013034,0.000028151637,0.00078783464,0.000005636796,0.0000082448405,0.000030406045,0.000027640433,0.9918247,0.0011678104,0.0058701597,0.00023411591,0.000008961202],"about_ca_topic_score_codex":0.007054547,"about_ca_topic_score_gemma":0.0024193297,"teacher_disagreement_score":0.007054547,"about_ca_system_score_codex":0.0016185712,"about_ca_system_score_gemma":0.0009221709,"threshold_uncertainty_score":0.01402694},"labels":[],"label_agreement":null},{"id":"W2125009248","doi":"10.1109/65.844496","title":"Traffic analysis of a Web proxy caching hierarchy","year":2000,"lang":"en","type":"article","venue":"IEEE Network","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":163,"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 Saskatchewan","funders":"","keywords":"Computer science; Hierarchy; Zipf's law; Scalability; Popularity; Server; Proxy (statistics); Workload; World Wide Web; Database; Operating system","score_opus":0.011738120496865736,"score_gpt":0.22261834310655293,"score_spread":0.2108802226096872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125009248","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.9888404,0.000078977486,0.009418992,0.000036536807,0.0000054250854,0.00002215873,0.00015266518,0.000241197,0.0012036146],"genre_scores_gemma":[0.997945,0.00003482341,0.0014372495,0.000009219833,0.000005449334,0.000010850553,0.00026404916,0.000020940892,0.00027245388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993179,0.00013134354,0.000038889,0.000088734465,0.000252218,0.00017106462],"domain_scores_gemma":[0.9969003,0.0008559679,0.0003265485,0.00024772255,0.0013744585,0.0002949374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006383203,0.00038669622,0.0004089774,0.0018119394,0.00051750377,0.0007503147,0.00048468067,0.00042019293,0.0005065488],"category_scores_gemma":[0.003783908,0.00021569138,0.0002546262,0.0013405847,0.00029566436,0.00092846534,0.0003109465,0.00042282254,0.00024137659],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012928117,0.0006840914,0.21584468,0.00015763502,0.00015090525,0.0010747334,0.0009613355,0.45596772,0.23478872,0.013019949,0.002890076,0.07316733],"study_design_scores_gemma":[0.00000615019,0.00008242121,0.027007712,0.000006030947,0.000016885264,0.00016915235,0.00014151268,0.9584748,0.0127003305,0.0010104402,0.0003677953,0.000016829927],"about_ca_topic_score_codex":0.008735548,"about_ca_topic_score_gemma":0.0028255966,"teacher_disagreement_score":0.008735548,"about_ca_system_score_codex":0.0015114609,"about_ca_system_score_gemma":0.00052194664,"threshold_uncertainty_score":0.01736939},"labels":[],"label_agreement":null},{"id":"W2125442200","doi":"10.1109/pccc.2004.1395056","title":"QoS differentiation in switching-based Web caching","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Computer network; Cache; Server; Router; Quality of service; Differentiated service; The Internet; Enhanced Data Rates for GSM Evolution; Differentiated services; Service (business); Distributed computing; Service provider; World Wide Web; Telecommunications","score_opus":0.04308686393570588,"score_gpt":0.297312541009238,"score_spread":0.2542256770735321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125442200","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.33933043,0.0055374294,0.6328695,0.0010089491,0.00025235376,0.00015741133,0.000083466526,0.0006752551,0.020085225],"genre_scores_gemma":[0.97577953,0.0006530526,0.021959858,0.00011220713,0.000055690456,0.000027834863,0.000026107917,0.000014637045,0.0013710053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988337,0.00034504264,0.00006089569,0.00009649751,0.00048826254,0.00017561516],"domain_scores_gemma":[0.9982021,0.0010424985,0.00012134667,0.00022848349,0.00031607944,0.00008946305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017826249,0.00025119877,0.0004343135,0.0005646085,0.00062038715,0.0011458548,0.0010416514,0.0007354351,0.0006826131],"category_scores_gemma":[0.004025735,0.00029278605,0.00028756712,0.0009198494,0.0010757083,0.0010759173,0.000552026,0.0006987629,0.00014368382],"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.00067072845,0.00021432668,0.004629194,0.00021010858,0.00004759646,0.0005592513,0.000391219,0.55528855,0.031819005,0.27527943,0.00245682,0.12843373],"study_design_scores_gemma":[0.00003546344,0.00007681061,0.0005158284,0.000012388154,0.00002333801,0.00014045485,0.000035378176,0.9605239,0.0039160056,0.033201423,0.0015005601,0.000018441191],"about_ca_topic_score_codex":0.0052115354,"about_ca_topic_score_gemma":0.0031261558,"teacher_disagreement_score":0.0052115354,"about_ca_system_score_codex":0.0022840132,"about_ca_system_score_gemma":0.00078859646,"threshold_uncertainty_score":0.01657182},"labels":[],"label_agreement":null},{"id":"W2125752122","doi":"10.1109/dexa.2001.953077","title":"Model based predictive prefetching","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Latency (audio); Web traffic; Predictive power; Web server; Reduction (mathematics); Server; Web application; Distributed computing; The Internet; Computer network; Operating system","score_opus":0.039459713263458686,"score_gpt":0.20759242789193086,"score_spread":0.16813271462847218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125752122","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.054856118,0.0008986897,0.93434113,0.0004209389,0.00010825786,0.00007150326,0.0002793945,0.0034248927,0.005599132],"genre_scores_gemma":[0.89217865,0.0005664591,0.10136531,0.0001644083,0.000084543746,0.000102008795,0.00042056022,0.00011432442,0.005003754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995646,0.00008352151,0.000020455922,0.0000923563,0.00017399511,0.000065039916],"domain_scores_gemma":[0.9991597,0.00038144676,0.00006396255,0.00016094145,0.00020558984,0.000028424682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044235698,0.0005505342,0.0010605187,0.00046791643,0.00033750257,0.00082357053,0.0012289387,0.00066562876,0.001863214],"category_scores_gemma":[0.002037406,0.0003919805,0.0004097014,0.0009549505,0.0003406941,0.0013760515,0.0004961149,0.0008617501,0.00062281167],"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.00015040382,0.00010911433,0.0015700322,0.00006859536,0.000049401442,0.00007529869,0.00003750948,0.8980425,0.00345226,0.006720445,0.002880312,0.08684412],"study_design_scores_gemma":[0.0000057114694,0.000014882337,0.000101338104,0.0000018576337,0.000006812305,0.000016290538,0.0000027461012,0.9973695,0.0005872552,0.0015564692,0.00033365868,0.0000034791858],"about_ca_topic_score_codex":0.0109012835,"about_ca_topic_score_gemma":0.013241825,"teacher_disagreement_score":0.0109012835,"about_ca_system_score_codex":0.00076785556,"about_ca_system_score_gemma":0.00114277,"threshold_uncertainty_score":0.021675646},"labels":[],"label_agreement":null},{"id":"W2126146094","doi":"10.1109/ccece.2008.4564769","title":"Modeling of multimedia files on the Web 2.0","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Popularity; World Wide Web; Multimedia; The Internet; Zipf's law; File sharing; Scalability; Web navigation; Service (business); Workload; Database","score_opus":0.026659789136826057,"score_gpt":0.18252248988569725,"score_spread":0.15586270074887118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126146094","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.666222,0.00055490935,0.32010338,0.00051948265,0.00008123007,0.00021402456,0.0016484031,0.0010614989,0.009595082],"genre_scores_gemma":[0.9635168,0.0004139935,0.028961184,0.00007037893,0.00006610384,0.00014114546,0.00081861386,0.0001771232,0.0058346344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994824,0.00013413279,0.00003197646,0.0000956467,0.00017300957,0.000082859115],"domain_scores_gemma":[0.99853134,0.0007343062,0.00016410608,0.00015042053,0.0003454284,0.000074372154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062466646,0.00074374146,0.0005736087,0.00095683115,0.00044428147,0.0014256394,0.0012541697,0.0010157267,0.0011293757],"category_scores_gemma":[0.0033682704,0.00037269187,0.00063217815,0.001009372,0.0004040015,0.0021545936,0.0004836743,0.0004959003,0.00047741566],"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.00008650443,0.00009459462,0.008689473,0.00006559856,0.000027955237,0.00045449004,0.00020959551,0.95656586,0.00778489,0.013081874,0.0011659691,0.011773103],"study_design_scores_gemma":[0.0000011211448,0.000005656569,0.00054611266,0.0000017263379,0.0000019198378,0.00002075502,0.000015909602,0.9977787,0.00037443574,0.0010605549,0.00019043418,0.0000026973566],"about_ca_topic_score_codex":0.0208162,"about_ca_topic_score_gemma":0.009226812,"teacher_disagreement_score":0.0208162,"about_ca_system_score_codex":0.001194177,"about_ca_system_score_gemma":0.00050225796,"threshold_uncertainty_score":0.04139006},"labels":[],"label_agreement":null},{"id":"W2126514643","doi":"10.1023/a:1019697023170","title":"Evaluation of Strong Consistency Web Caching Techniques","year":2002,"lang":"en","type":"article","venue":"World Wide Web","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; University of Wisconsin-Madison","keywords":"Computer science; Cache; Cache invalidation; Cache algorithms; Smart Cache; Distributed computing; Consistency (knowledge bases); Eventual consistency; Cache coherence; Causal consistency; Consistency model; Computer network; CPU cache; Data consistency; Sequential consistency","score_opus":0.05286046055294654,"score_gpt":0.2679706923057275,"score_spread":0.21511023175278096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126514643","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.8608009,0.0057162144,0.11191014,0.0010495114,0.00044684933,0.00038934994,0.00056280836,0.005735012,0.013389235],"genre_scores_gemma":[0.9456563,0.00072229013,0.050610796,0.00012495989,0.00014739553,0.00006775815,0.0004458955,0.00028912883,0.0019354481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98436165,0.0059401547,0.0009686637,0.00094167184,0.0066084825,0.0011792865],"domain_scores_gemma":[0.91802496,0.053616095,0.003156034,0.013428811,0.010241005,0.0015330801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011477726,0.0016409,0.0013375335,0.0016846987,0.0012992197,0.0023693002,0.0048606503,0.0017458426,0.0029949255],"category_scores_gemma":[0.04489727,0.0007776713,0.0006936778,0.0029220977,0.0016982373,0.0047324123,0.0022158804,0.0015567406,0.0004367805],"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.0257678,0.0060857637,0.031521372,0.002448737,0.0013515551,0.00038970137,0.0006078455,0.36163405,0.058774047,0.023702694,0.01521497,0.47250143],"study_design_scores_gemma":[0.0013018062,0.0024490047,0.005064674,0.000046954698,0.0004936799,0.00025116687,0.0002479993,0.9532639,0.029263992,0.0052648666,0.0022911015,0.000060909344],"about_ca_topic_score_codex":0.00717339,"about_ca_topic_score_gemma":0.00614223,"teacher_disagreement_score":0.011477726,"about_ca_system_score_codex":0.0029787999,"about_ca_system_score_gemma":0.0041616117,"threshold_uncertainty_score":0.060700715},"labels":[],"label_agreement":null},{"id":"W2127373302","doi":"10.1109/ccnc08.2007.90","title":"Cross-Layer Design for Cooperative Caching in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":31,"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 Guelph","funders":"","keywords":"Computer science; Layer (electronics); Simple (philosophy); Computer network; Distributed computing; Wireless ad hoc network; Mobile ad hoc network; Wireless; Operating system","score_opus":0.054182239398593936,"score_gpt":0.2846683015462759,"score_spread":0.230486062147682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127373302","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.046365708,0.00195825,0.94694674,0.00020282739,0.00013875357,0.00018784782,0.000031093077,0.0008626607,0.0033062024],"genre_scores_gemma":[0.78014135,0.00070269045,0.21565595,0.00026647717,0.0000942555,0.00023284406,0.00010259693,0.00006767211,0.0027362274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.00042193508,0.00011656875,0.00016815445,0.00038058654,0.0002027125],"domain_scores_gemma":[0.99772125,0.0005309348,0.00022912388,0.00041267282,0.0010108291,0.00009516073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016344166,0.000704062,0.0004905994,0.00051141874,0.00054591836,0.0011059628,0.0014618217,0.00065318897,0.0010188654],"category_scores_gemma":[0.0027378248,0.00047706283,0.000354324,0.00053527136,0.00047988765,0.0016517775,0.0012572651,0.0009125568,0.00045204643],"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.0008399852,0.0004949607,0.0074291066,0.000859206,0.00056412705,0.0009216023,0.00063477707,0.33745927,0.22673592,0.040603425,0.006112774,0.3773449],"study_design_scores_gemma":[0.00006676519,0.00054467825,0.0012259013,0.000049169317,0.00021319636,0.0005777845,0.00010064634,0.9369363,0.041793358,0.006571183,0.011851208,0.00006977494],"about_ca_topic_score_codex":0.0013652425,"about_ca_topic_score_gemma":0.002757907,"teacher_disagreement_score":0.0016344166,"about_ca_system_score_codex":0.00084230764,"about_ca_system_score_gemma":0.000764681,"threshold_uncertainty_score":0.008643746},"labels":[],"label_agreement":null},{"id":"W2129175125","doi":"10.1109/icci.1993.315384","title":"Design and implementation of a distributed applications testbed","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"Testbed; Computer science; Interoperability; Architecture; Distributed computing; Reliability (semiconductor); Computer architecture; Operating system; Computer network","score_opus":0.0299891643939115,"score_gpt":0.25438739071902333,"score_spread":0.22439822632511183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129175125","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.047896534,0.0001946989,0.91899306,0.0005499562,0.00026731225,0.0039879335,0.00043640254,0.015884385,0.011789687],"genre_scores_gemma":[0.20107114,0.0002473481,0.78691506,0.00021460526,0.00005808032,0.0033526113,0.0016810563,0.00053458335,0.00592562],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976069,0.00073525205,0.0003291658,0.00033357227,0.000665263,0.00032979925],"domain_scores_gemma":[0.9974602,0.0003920805,0.0001743067,0.0006593591,0.0007081876,0.0006058501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004581543,0.00046579144,0.000719712,0.0010107307,0.0007365471,0.0017086838,0.0031481902,0.0010758794,0.003809511],"category_scores_gemma":[0.0045744875,0.00053948554,0.000370619,0.00075909996,0.0007942731,0.0018611754,0.0014973853,0.0013499034,0.0015470505],"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.0018698426,0.002466771,0.015109669,0.0018872074,0.0002589599,0.0025138468,0.0023162784,0.18135491,0.21440199,0.18278866,0.034305852,0.36072597],"study_design_scores_gemma":[0.00087926793,0.0021879175,0.0052772006,0.00029639812,0.0001878669,0.00089927146,0.0006058614,0.5509573,0.15251862,0.017511658,0.26848415,0.00019442398],"about_ca_topic_score_codex":0.0012988774,"about_ca_topic_score_gemma":0.0008307137,"teacher_disagreement_score":0.004581543,"about_ca_system_score_codex":0.0011943568,"about_ca_system_score_gemma":0.00196888,"threshold_uncertainty_score":0.024229765},"labels":[],"label_agreement":null},{"id":"W2129480833","doi":"10.1109/infcom.2011.5934903","title":"On the efficiency of collaborative caching in ISP-aware P2P networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Computer architecture","score_opus":0.021928810373177798,"score_gpt":0.20407873626489942,"score_spread":0.18214992589172163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129480833","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.46068874,0.0037067996,0.5019279,0.0016574728,0.00007088138,0.00012367757,0.00014169012,0.00033686735,0.031345993],"genre_scores_gemma":[0.9832193,0.0004859753,0.015528224,0.00004292033,0.000035654895,0.000032689575,0.000027091311,0.000028695124,0.00059956225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961022,0.0023842491,0.0001351675,0.00034862137,0.0005855511,0.00044428793],"domain_scores_gemma":[0.9645746,0.027964052,0.001606303,0.0027892378,0.0026903308,0.00037539724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006470904,0.0008085727,0.0012044521,0.0012279126,0.0010455647,0.0026330173,0.001854111,0.0014847784,0.0018640262],"category_scores_gemma":[0.03296335,0.00045905073,0.00046493355,0.0018977517,0.0016239964,0.0038523541,0.0015727228,0.0009998202,0.00027528725],"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.00040966345,0.00016308531,0.003631777,0.00013580713,0.000093122726,0.00009087173,0.000096956144,0.8703436,0.003417442,0.0821849,0.0015127201,0.037919957],"study_design_scores_gemma":[0.000016073733,0.00007731803,0.0005580561,0.000017504472,0.000037522575,0.00004761182,0.000047555455,0.9806623,0.0017796998,0.016339405,0.00040708372,0.000009895989],"about_ca_topic_score_codex":0.0032168205,"about_ca_topic_score_gemma":0.002395125,"teacher_disagreement_score":0.006470904,"about_ca_system_score_codex":0.00319326,"about_ca_system_score_gemma":0.0012731684,"threshold_uncertainty_score":0.034221828},"labels":[],"label_agreement":null},{"id":"W2131847371","doi":"10.1109/infcom.2001.916617","title":"On the sensitivity of Web proxy cache performance to workload characteristics","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":67,"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 Saskatchewan","funders":"Canarie","keywords":"Computer science; Workload; Cache; Proxy (statistics); Locality; Locality of reference; Cache algorithms; Zipf's law; Parallel computing; Popularity; CPU cache; Operating system; Database; Statistics; Mathematics","score_opus":0.023882494600833516,"score_gpt":0.19607420941737363,"score_spread":0.1721917148165401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131847371","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.9836601,0.00021663636,0.0143037625,0.00011899471,0.00002664379,0.00007033186,0.0003174824,0.0003764638,0.0009096851],"genre_scores_gemma":[0.9975414,0.000084064544,0.0018694884,0.000058876718,0.000009169972,0.000019225681,0.0002550838,0.00004317128,0.000119470686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978036,0.00072211534,0.00016529283,0.0003819817,0.0007083419,0.00021856742],"domain_scores_gemma":[0.97154623,0.022030255,0.0020330462,0.0020847847,0.0018750943,0.00043053954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019429494,0.0005889354,0.00054429006,0.00069687323,0.00026861802,0.0008207561,0.0005790612,0.00077339594,0.00050896534],"category_scores_gemma":[0.024440829,0.00036589042,0.00024676824,0.00075243734,0.0004595402,0.0008542223,0.00038925992,0.0007523438,0.00021900728],"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.0018258546,0.00061266404,0.08387061,0.0003848119,0.0002957398,0.0010383984,0.0003717681,0.62440956,0.23560518,0.0009747651,0.0010294683,0.049581163],"study_design_scores_gemma":[0.000055156346,0.0010999974,0.042294916,0.000026357484,0.000110074834,0.0010219668,0.00015679604,0.79385704,0.15981668,0.00076782756,0.00072014355,0.00007306604],"about_ca_topic_score_codex":0.0020470659,"about_ca_topic_score_gemma":0.0013515012,"teacher_disagreement_score":0.0020470659,"about_ca_system_score_codex":0.00067437463,"about_ca_system_score_gemma":0.00038070043,"threshold_uncertainty_score":0.0102754235},"labels":[],"label_agreement":null},{"id":"W2134630744","doi":"10.1109/ideas.2005.37","title":"Nomadic Web Service Clients","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Cache; SOAP; Computer network; Cache invalidation; Smart Cache; Cache algorithms; Web service; Distributed computing; World Wide Web; CPU cache","score_opus":0.00966671256416803,"score_gpt":0.19428210259274722,"score_spread":0.18461539002857918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134630744","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.36094263,0.0024223435,0.26514012,0.0017737088,0.00053173275,0.0009879901,0.0014292945,0.011715966,0.35505617],"genre_scores_gemma":[0.8134747,0.001139241,0.057256266,0.0005550378,0.00024386031,0.00052800996,0.0015381442,0.00039764732,0.12486705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871767,0.00016755926,0.00007328854,0.00027255615,0.0005568901,0.0002119071],"domain_scores_gemma":[0.99840075,0.0002603578,0.00009144048,0.00051763473,0.00047564658,0.0002542985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091567484,0.00074104604,0.0009988863,0.0006066366,0.0019012666,0.0038601847,0.0016125438,0.0014705005,0.019891834],"category_scores_gemma":[0.0027642893,0.0004272183,0.00031910106,0.0014818432,0.0005260372,0.0037049884,0.0028359971,0.0012030574,0.007247203],"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.0023894527,0.0013376715,0.026355192,0.0008866319,0.000121374374,0.0056423713,0.006077334,0.015859226,0.082758695,0.3472632,0.063269965,0.44803894],"study_design_scores_gemma":[0.00035270164,0.0005017823,0.01029501,0.00020672637,0.00012410001,0.005768931,0.0058691995,0.2994257,0.062820606,0.09460173,0.5198378,0.0001957541],"about_ca_topic_score_codex":0.0033600482,"about_ca_topic_score_gemma":0.005281071,"teacher_disagreement_score":0.019891834,"about_ca_system_score_codex":0.001052384,"about_ca_system_score_gemma":0.0012250241,"threshold_uncertainty_score":0.06654477},"labels":[],"label_agreement":null},{"id":"W2135273046","doi":"10.1145/1272366.1272375","title":"Cooperative secondary authorization recycling","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"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 British Columbia","funders":"","keywords":"Computer science; Authorization; Scalability; Cache; Server; Software deployment; Computer network; Distributed computing; Computer security; Database; Operating system","score_opus":0.015240980372344202,"score_gpt":0.2489189521175578,"score_spread":0.2336779717452136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135273046","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.20293674,0.00061633287,0.7543196,0.0004991425,0.00012451567,0.0009636522,0.00023117795,0.022523327,0.017785521],"genre_scores_gemma":[0.9002306,0.00014871675,0.0840497,0.00024043673,0.000080143625,0.0002204058,0.0003284178,0.0004358959,0.014265588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562895,0.0011004658,0.00032274803,0.0008650779,0.0014140316,0.000668761],"domain_scores_gemma":[0.97821814,0.0036793787,0.0015603795,0.011728455,0.0039190208,0.0008946549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036176492,0.0010711112,0.0017750975,0.001869017,0.0021792422,0.0023363726,0.0034587919,0.0012826163,0.005542527],"category_scores_gemma":[0.009669417,0.0005719014,0.0009715771,0.0012466582,0.0015527841,0.0034695016,0.0039761164,0.0016023505,0.0027145015],"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.0033326044,0.0019193373,0.014273316,0.0006627741,0.00034918412,0.0016808826,0.0029667462,0.04670301,0.18491428,0.044804968,0.019549143,0.67884386],"study_design_scores_gemma":[0.0003543763,0.0014582289,0.0069506965,0.00014157488,0.0003376779,0.0046808086,0.0010221779,0.5856659,0.26899832,0.041696683,0.08833128,0.00036226187],"about_ca_topic_score_codex":0.0040234984,"about_ca_topic_score_gemma":0.0030813448,"teacher_disagreement_score":0.005542527,"about_ca_system_score_codex":0.001168665,"about_ca_system_score_gemma":0.0027816987,"threshold_uncertainty_score":0.019132137},"labels":[],"label_agreement":null},{"id":"W2135786084","doi":"10.1109/compsac.2007.136","title":"Machine Learning Prediction andWeb Access Modeling","year":2007,"lang":"en","type":"article","venue":"Proceedings - International Computer Software & Applications Conference","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Computer science; Machine learning; Cache; Artificial intelligence; Sequence (biology); Predictive modelling; Scheme (mathematics); Extension (predicate logic); Data mining; Operating system","score_opus":0.03343103169845864,"score_gpt":0.2711120882522849,"score_spread":0.23768105655382626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135786084","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.08118848,0.0011003516,0.9127806,0.0010969924,0.00009403927,0.0000612529,0.00044713428,0.0012489908,0.0019822787],"genre_scores_gemma":[0.9088415,0.00072381756,0.08655136,0.00012843305,0.00018471884,0.0001523985,0.0006811368,0.000059966107,0.0026767477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990283,0.0004039398,0.00005387122,0.00018589551,0.0002285599,0.00009944615],"domain_scores_gemma":[0.99363846,0.004909664,0.00043856303,0.00038376218,0.0005452064,0.00008433896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022476087,0.0008186697,0.0008563934,0.0012184393,0.0004373563,0.0010818868,0.0010658873,0.0012188659,0.0013423894],"category_scores_gemma":[0.009812518,0.00040087907,0.0005246161,0.0020659675,0.000658511,0.0016454542,0.0004644594,0.001462507,0.0004259065],"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.00005274961,0.000076192104,0.004437798,0.000039115374,0.000045089837,0.000048895523,0.000030460467,0.94735676,0.00028963602,0.0057192743,0.00086024246,0.04104379],"study_design_scores_gemma":[0.0000019403083,0.0000063998646,0.00028934563,0.0000025598738,0.000002473762,0.0000073739866,0.0000023817904,0.9955682,0.00013809932,0.0038581183,0.000120158875,0.000003018222],"about_ca_topic_score_codex":0.015506356,"about_ca_topic_score_gemma":0.009666121,"teacher_disagreement_score":0.015506356,"about_ca_system_score_codex":0.0012156229,"about_ca_system_score_gemma":0.0007730095,"threshold_uncertainty_score":0.030832171},"labels":[],"label_agreement":null},{"id":"W2135963291","doi":"10.1109/wimob.2006.1696401","title":"Cooperative Caching with Adaptive Prefetching in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"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 Guelph","funders":"","keywords":"Instruction prefetch; Computer science; Cache; Mobile ad hoc network; Consistency (knowledge bases); Computer network; Overhead (engineering); Scheme (mathematics); Wireless ad hoc network; CPU cache; False sharing; Distributed computing; Cache algorithms; Wireless; Operating system","score_opus":0.008511000567153672,"score_gpt":0.19665769606779349,"score_spread":0.1881466955006398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135963291","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.24236947,0.0057416726,0.7470971,0.000339896,0.000177234,0.00013597078,0.00005036786,0.0011675026,0.0029207645],"genre_scores_gemma":[0.96188825,0.0005012634,0.036009986,0.00005226359,0.000062296946,0.000045870278,0.00003650616,0.000016130198,0.0013874271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999501,0.00016468896,0.000027370577,0.00007586186,0.00015384964,0.00007725532],"domain_scores_gemma":[0.9986451,0.00056193257,0.00012689864,0.00024927998,0.00034850583,0.000068362206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006671701,0.00046858727,0.0006683828,0.0006770578,0.00067411177,0.00048366806,0.0012915449,0.0006493361,0.00036917254],"category_scores_gemma":[0.0019973952,0.0003557288,0.00027799117,0.0010815025,0.00041537834,0.0014591855,0.000580732,0.00036222456,0.00015518023],"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.00084264553,0.00034286993,0.008957379,0.00036412303,0.00028242014,0.0013820255,0.00047525825,0.6219656,0.059209917,0.01610691,0.003867127,0.2862038],"study_design_scores_gemma":[0.000046523448,0.00022088671,0.0008902897,0.000011172999,0.000077598896,0.0002813016,0.00006963094,0.9859278,0.005823559,0.0043460536,0.0022801536,0.000025011119],"about_ca_topic_score_codex":0.004619599,"about_ca_topic_score_gemma":0.005474729,"teacher_disagreement_score":0.004619599,"about_ca_system_score_codex":0.000501607,"about_ca_system_score_gemma":0.00051553315,"threshold_uncertainty_score":0.009185433},"labels":[],"label_agreement":null},{"id":"W2136784393","doi":"10.1007/s12083-009-0047-5","title":"SPACE: A lightweight collaborative caching for clusters","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Computer science; Scheme (mathematics); Overhead (engineering); Distributed computing; Space (punctuation); Cluster (spacecraft); Peer-to-peer; Computer cluster; False sharing; CPU cache; Cache algorithms; Computer network; Parallel computing; Operating system","score_opus":0.013609960840248262,"score_gpt":0.2661503445185948,"score_spread":0.2525403836783466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136784393","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.07174215,0.0020849945,0.83569294,0.0005919643,0.0006766695,0.0007432008,0.001079146,0.07824175,0.009147195],"genre_scores_gemma":[0.5133041,0.00075367885,0.45974952,0.00030431215,0.00032023972,0.00060556363,0.0019554368,0.0025676452,0.02043948],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783164,0.00041831884,0.00013618243,0.00025690408,0.0010723484,0.0002845318],"domain_scores_gemma":[0.9953799,0.00069955917,0.00021856783,0.002492777,0.0006655001,0.00054365565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021815442,0.0011926384,0.0019810873,0.0018250297,0.0024996914,0.0027997803,0.0046779043,0.0019353633,0.007250198],"category_scores_gemma":[0.0054105297,0.00082516903,0.00097221875,0.0024493297,0.0011368894,0.003751145,0.0048328373,0.0013952293,0.002064183],"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.0073457253,0.00096106343,0.005663943,0.0013090258,0.00072204834,0.00065226003,0.0014602013,0.116709545,0.07559182,0.06476144,0.10989147,0.6149314],"study_design_scores_gemma":[0.0010609855,0.00089124247,0.0015845376,0.00008202884,0.00042344374,0.0004988668,0.00032979954,0.85514796,0.0431625,0.03280267,0.06377593,0.00024009851],"about_ca_topic_score_codex":0.010267027,"about_ca_topic_score_gemma":0.011594832,"teacher_disagreement_score":0.010267027,"about_ca_system_score_codex":0.0015526038,"about_ca_system_score_gemma":0.0028859933,"threshold_uncertainty_score":0.024254322},"labels":[],"label_agreement":null},{"id":"W2136795155","doi":"10.1109/tpds.2009.130","title":"On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Byte; Cache; False sharing; The Internet; Distributed computing; Peer-to-peer; Proxy (statistics); Internet traffic; Overhead (engineering); CPU cache; Cache algorithms; World Wide Web","score_opus":0.026165210683312293,"score_gpt":0.24693669426824968,"score_spread":0.2207714835849374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136795155","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.8268764,0.0034103722,0.14808764,0.0014420449,0.00007056007,0.00007956975,0.0001065096,0.00033931583,0.01958758],"genre_scores_gemma":[0.99615854,0.0003218246,0.0031107885,0.000033952783,0.00002648958,0.000009120307,0.000014155423,0.000012743094,0.00031244263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984615,0.0007027857,0.000030008649,0.00014052766,0.00041834186,0.00024688386],"domain_scores_gemma":[0.98763007,0.0092825405,0.00048566854,0.0010309468,0.0013272299,0.00024355232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018612419,0.00073543686,0.00076718966,0.0007264207,0.0008345457,0.0013075623,0.0012236392,0.0014045534,0.0011586231],"category_scores_gemma":[0.015300965,0.00031503206,0.0004060175,0.0011060492,0.00097546977,0.003768617,0.00087396166,0.0008047137,0.00020343435],"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.00044541046,0.00028513774,0.0071137105,0.00013638836,0.00009003053,0.00035177573,0.0002904337,0.883844,0.009037541,0.052798048,0.001617859,0.043989576],"study_design_scores_gemma":[0.000021168693,0.00018157893,0.0015942933,0.00001632257,0.00006457562,0.00018419264,0.00016230826,0.9829289,0.002045742,0.0119438935,0.00083373033,0.000023450855],"about_ca_topic_score_codex":0.0052226963,"about_ca_topic_score_gemma":0.0044010277,"teacher_disagreement_score":0.0052226963,"about_ca_system_score_codex":0.0017553162,"about_ca_system_score_gemma":0.00097043824,"threshold_uncertainty_score":0.012735724},"labels":[],"label_agreement":null},{"id":"W2137014596","doi":"10.1109/asea.2008.61","title":"Web Cache Prefetching by Multi-dimensional Matrix","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Cache; Parallel computing; CPU cache; Web application; Cache algorithms; Matrix (chemical analysis); Algorithm; Theoretical computer science; Operating system","score_opus":0.02709800837955032,"score_gpt":0.2418228623883763,"score_spread":0.214724854008826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137014596","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.28317207,0.0013125706,0.70999795,0.0006459834,0.00009689695,0.000068897694,0.00010664481,0.0006986945,0.0039003135],"genre_scores_gemma":[0.94370395,0.0005500375,0.053179845,0.00006253165,0.00005231027,0.00005058089,0.000058618083,0.000029081584,0.002313038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949014,0.00018003382,0.00001885703,0.00006975502,0.000180775,0.000060530503],"domain_scores_gemma":[0.997965,0.0011948388,0.00024224713,0.0001904236,0.00032319754,0.00008438528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005409301,0.0003527603,0.0004932917,0.0004928673,0.00046543285,0.0007857427,0.00065570447,0.00063154765,0.0010323363],"category_scores_gemma":[0.0033643015,0.00028322186,0.00037151665,0.0009940104,0.0005839713,0.002332296,0.0004024904,0.00061873614,0.00021337201],"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.00023269339,0.00014748059,0.003783815,0.00013606051,0.00005603821,0.00030927235,0.00021027631,0.8781093,0.012748328,0.062163632,0.0017097617,0.04039327],"study_design_scores_gemma":[0.0000060938587,0.000028186076,0.00012773593,0.000001441231,0.0000039555216,0.000036301357,0.000008021074,0.9958215,0.0005729274,0.0031883256,0.00020109622,0.000004522693],"about_ca_topic_score_codex":0.005180367,"about_ca_topic_score_gemma":0.0032235626,"teacher_disagreement_score":0.005180367,"about_ca_system_score_codex":0.00086888456,"about_ca_system_score_gemma":0.0005731827,"threshold_uncertainty_score":0.010300398},"labels":[],"label_agreement":null},{"id":"W2137464581","doi":"10.1109/ccece.1998.682776","title":"A novel scheduling scheme for serving VBR-encoded multimedia streams","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Variable bitrate; Scheduling (production processes); Quality of service; Computer network; Scheme (mathematics); Fraction (chemistry); Constant bitrate; Real-time computing; Multimedia; Distributed computing; Mathematical optimization","score_opus":0.05114651141184646,"score_gpt":0.23933673333828565,"score_spread":0.1881902219264392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137464581","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.046228122,0.0010463515,0.94819725,0.00023411725,0.00040405066,0.00025767146,0.00009858495,0.0012755085,0.0022583941],"genre_scores_gemma":[0.53801763,0.00075170345,0.4565281,0.00022449638,0.0005307233,0.00022494794,0.00024383636,0.00010228559,0.0033763004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991872,0.00020202213,0.00008162588,0.00010346088,0.00030735592,0.00011839866],"domain_scores_gemma":[0.99864215,0.00028327186,0.00019081867,0.00026482294,0.00046612302,0.00015287449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011536705,0.00064352766,0.0008287339,0.00071476435,0.0010745877,0.0007755026,0.0016756034,0.0006757263,0.0009843225],"category_scores_gemma":[0.002023063,0.00032367525,0.00031419942,0.0008732974,0.0005161109,0.0009775711,0.00070935156,0.00074517744,0.00052523654],"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.0012852721,0.0006444272,0.0021029927,0.00042982094,0.00013894658,0.0005849195,0.00060088467,0.18400142,0.26728207,0.0725835,0.010422659,0.4599231],"study_design_scores_gemma":[0.00020304343,0.00041286217,0.00046260556,0.0000185711,0.00006855412,0.000487107,0.00003649608,0.9512264,0.025359344,0.007400362,0.0142572,0.00006745049],"about_ca_topic_score_codex":0.0031061235,"about_ca_topic_score_gemma":0.003458406,"teacher_disagreement_score":0.0031061235,"about_ca_system_score_codex":0.0013415278,"about_ca_system_score_gemma":0.0016650145,"threshold_uncertainty_score":0.0097334385},"labels":[],"label_agreement":null},{"id":"W2137470694","doi":"10.1109/glocomw.2010.5700233","title":"Content caching and replication schemes for peer-to-peer file sharing in wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; File sharing; Computer network; Wireless mesh network; Replication (statistics); Self-certifying File System; Peer-to-peer; Wireless network; Distributed computing; The Internet; Wireless; File system; Operating system","score_opus":0.03473325118272208,"score_gpt":0.2655659134242677,"score_spread":0.23083266224154564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137470694","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.16588329,0.0023384895,0.8248234,0.000665229,0.00025639965,0.000536896,0.00012520446,0.0014758307,0.0038953123],"genre_scores_gemma":[0.81501865,0.00050487666,0.18214221,0.00010344307,0.000121413774,0.00026389002,0.00010827618,0.00006529625,0.0016718844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770397,0.0009010061,0.0001887414,0.0002435192,0.0007617429,0.00020099102],"domain_scores_gemma":[0.9899081,0.004052264,0.0006640181,0.0028371576,0.0022821466,0.00025626962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003652237,0.0005003771,0.0010459811,0.0011462595,0.0016584505,0.0011447334,0.0029379688,0.0017398876,0.0011059911],"category_scores_gemma":[0.014690224,0.0003849306,0.0005641454,0.0011628767,0.001137908,0.0031324702,0.0014423892,0.0008456712,0.00036718798],"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.0021912968,0.00068304566,0.00649769,0.0006357806,0.00039926256,0.0010975942,0.0011636973,0.39786652,0.10298771,0.123693146,0.009669504,0.35311472],"study_design_scores_gemma":[0.00016215193,0.00029656795,0.0006498671,0.000031170246,0.00011467829,0.0005128789,0.00011432252,0.9551223,0.019601591,0.018764958,0.0045277015,0.000101777085],"about_ca_topic_score_codex":0.0033978897,"about_ca_topic_score_gemma":0.0034472996,"teacher_disagreement_score":0.003652237,"about_ca_system_score_codex":0.001954863,"about_ca_system_score_gemma":0.001263463,"threshold_uncertainty_score":0.019315064},"labels":[],"label_agreement":null},{"id":"W2138504866","doi":"10.1109/infcom.2009.5061999","title":"Understanding the Performance Gap Between Pull-Based Mesh Streaming Protocols and Fundamental Limits","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Focus (optics); Perspective (graphical); Computer network; Artificial intelligence","score_opus":0.1526553276166745,"score_gpt":0.2929610501381548,"score_spread":0.14030572252148032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138504866","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.20833695,0.007015939,0.7438536,0.005882946,0.00025338226,0.00011311938,0.0002023672,0.00047581454,0.033865854],"genre_scores_gemma":[0.95790917,0.0034021034,0.036206298,0.00034010556,0.00037835396,0.00015118823,0.000092967675,0.00011736322,0.0014024527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973348,0.0007966135,0.00014678756,0.0003552918,0.0010198534,0.00034665642],"domain_scores_gemma":[0.9739671,0.02110561,0.0015322891,0.0016538806,0.0013129157,0.000428207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049842414,0.00076690497,0.0011178171,0.0014901494,0.0009042184,0.002699481,0.0018521087,0.0018656738,0.0016202542],"category_scores_gemma":[0.031384073,0.0005731734,0.00046144682,0.0010367315,0.0033690487,0.0120970225,0.0030775093,0.0029121176,0.00025715498],"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.00020213868,0.00014296154,0.0010479364,0.00027100425,0.000035562465,0.0001599102,0.00055146846,0.15430629,0.0070341867,0.80960846,0.001625031,0.025015032],"study_design_scores_gemma":[0.00001896731,0.00012663743,0.000495349,0.000062173276,0.000017370427,0.0001873723,0.00020056163,0.5157887,0.0024156459,0.47881046,0.0018358039,0.000040959116],"about_ca_topic_score_codex":0.0006282452,"about_ca_topic_score_gemma":0.00026282528,"teacher_disagreement_score":0.0049842414,"about_ca_system_score_codex":0.0019925192,"about_ca_system_score_gemma":0.0013929795,"threshold_uncertainty_score":0.026359499},"labels":[],"label_agreement":null},{"id":"W2138771267","doi":"10.5539/nct.v2n2p11","title":"A Survey of Cloud Computing and Social Networks","year":2013,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cloud computing; Incentive; Utility computing; Social computing; The Internet; Computer science; Cloud computing security; Data science; Computer security; Social network (sociolinguistics); Cloud testing; Software; Internet privacy; Business; World Wide Web; Social media; Economics","score_opus":0.024012853083892876,"score_gpt":0.23769389738046973,"score_spread":0.21368104429657686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138771267","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011666902,0.7669851,0.033549834,0.019616416,0.0026966336,0.00032497116,0.0013263155,0.00025044882,0.1635834],"genre_scores_gemma":[0.0761371,0.8801568,0.015275915,0.0027371862,0.0050878557,0.00021961347,0.0012923055,0.00009102157,0.019002222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985159,0.0003777952,0.00009656797,0.00015474754,0.00070387375,0.00015120003],"domain_scores_gemma":[0.9969837,0.0017832941,0.00020253373,0.00016790445,0.0006515161,0.00021106302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115695,0.00075484865,0.000883654,0.006008763,0.0017867985,0.0032416356,0.00095815264,0.0015904253,0.0071953884],"category_scores_gemma":[0.0039015864,0.00036755696,0.0005017828,0.017712697,0.0010117659,0.006187328,0.0012024083,0.0012844781,0.0016373588],"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.000052636613,0.00009106109,0.0058856998,0.0033051108,0.000042786574,0.0003276516,0.0005924238,0.0030523252,0.00047175214,0.2661706,0.10667519,0.6133327],"study_design_scores_gemma":[0.0000055852784,0.000034133674,0.0035029151,0.0010098029,0.000015385927,0.0009442045,0.00058059656,0.00436412,0.0001734584,0.05408976,0.9352518,0.000028248494],"about_ca_topic_score_codex":0.006856439,"about_ca_topic_score_gemma":0.00693991,"teacher_disagreement_score":0.0071953884,"about_ca_system_score_codex":0.0020236406,"about_ca_system_score_gemma":0.002484859,"threshold_uncertainty_score":0.024070978},"labels":[],"label_agreement":null},{"id":"W2139391817","doi":"10.1145/2342356.2342360","title":"HyperDex","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":180,"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":"National Science Foundation","keywords":"Computer science; Scalability; Key (lock); Hash function; Chaining; Distributed computing; Consistency (knowledge bases); Block (permutation group theory); Overhead (engineering); Information retrieval; Database; Operating system; Programming language","score_opus":0.017620941901576793,"score_gpt":0.20979504554505635,"score_spread":0.19217410364347956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139391817","genre_codex":"other","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.016700624,0.0040455344,0.2340462,0.0029908407,0.003573854,0.0012784622,0.030925574,0.1975274,0.50891155],"genre_scores_gemma":[0.1686795,0.006043479,0.16341627,0.0040453468,0.0012000962,0.0018222802,0.107188396,0.033782512,0.51382214],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981914,0.00026652036,0.00020940162,0.00032323576,0.00073988194,0.0002694587],"domain_scores_gemma":[0.9967307,0.0004900519,0.00013850538,0.0015198087,0.0007699863,0.00035093146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014403345,0.0009503732,0.000978909,0.0014252621,0.0013170419,0.00628403,0.0032337338,0.0015891432,0.13021089],"category_scores_gemma":[0.0049879844,0.0008723451,0.0009026169,0.0023369216,0.0009497612,0.009768574,0.0076952865,0.0021264965,0.090941265],"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.0015261621,0.00024853187,0.0020733112,0.0010768072,0.00010487884,0.000579991,0.0005787849,0.002965333,0.009321007,0.16318047,0.58343875,0.23490599],"study_design_scores_gemma":[0.00011731791,0.00007308811,0.00032444083,0.00009390205,0.00003003486,0.00036829166,0.00013107745,0.005264061,0.009491711,0.031651776,0.95239925,0.000054887358],"about_ca_topic_score_codex":0.0013647972,"about_ca_topic_score_gemma":0.0011608457,"teacher_disagreement_score":0.13021089,"about_ca_system_score_codex":0.0009722308,"about_ca_system_score_gemma":0.0020422244,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2140943316","doi":"10.1109/inm.2015.7140343","title":"URL forwarding for NAT traversal","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"NAT traversal; Computer science; Usability; Computer network; The Internet; Tree traversal; Architecture; Residential gateway; Set (abstract data type); Protocol (science); Internet access; Network address translation; World Wide Web; Internet Protocol; Operating system","score_opus":0.07698061320496584,"score_gpt":0.26300171275244627,"score_spread":0.18602109954748042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140943316","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.05688894,0.0019626168,0.8751995,0.0008001091,0.0009819183,0.00064722216,0.00094713416,0.031695936,0.030876609],"genre_scores_gemma":[0.6304568,0.0013769605,0.32929876,0.00066952937,0.00041673964,0.0004965037,0.0024071818,0.0015646826,0.03331286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997795,0.0004019223,0.00027891662,0.00034245086,0.00076768047,0.00041403776],"domain_scores_gemma":[0.99305445,0.0013852676,0.00037818993,0.0035671692,0.0013772219,0.0002376137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023743426,0.00078246393,0.0012227626,0.0020945738,0.0022405323,0.0029858593,0.0018662261,0.0023305113,0.0068420763],"category_scores_gemma":[0.00766467,0.00066078495,0.0008080755,0.0014053074,0.0011413776,0.004891404,0.0036578423,0.0014959908,0.00401525],"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.0014987647,0.0006509474,0.011104825,0.00087244523,0.00022147573,0.0017908339,0.0012834913,0.019768368,0.11093548,0.33141145,0.0583743,0.46208754],"study_design_scores_gemma":[0.00018291346,0.00043525442,0.0035117106,0.0002759178,0.00030215422,0.003219527,0.00036374707,0.5399132,0.11114484,0.14683528,0.19348599,0.0003294911],"about_ca_topic_score_codex":0.004201001,"about_ca_topic_score_gemma":0.005214038,"teacher_disagreement_score":0.0068420763,"about_ca_system_score_codex":0.0019690064,"about_ca_system_score_gemma":0.0018567691,"threshold_uncertainty_score":0.022889018},"labels":[],"label_agreement":null},{"id":"W2141289279","doi":"10.1007/s11280-006-8563-1","title":"Alternative Architectures and Protocols for Providing Strong Consistency in Dynamic Web Applications","year":2006,"lang":"en","type":"article","venue":"World Wide Web","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Consistency (knowledge bases); Overhead (engineering); Distributed computing; Latency (audio); Data consistency; Scheme (mathematics); Consistency model; Computer network; Operating system","score_opus":0.014750956803868528,"score_gpt":0.27154439381855583,"score_spread":0.2567934370146873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141289279","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.041442845,0.0014357916,0.94815916,0.0015404971,0.00051008264,0.00029026478,0.0001071832,0.0022499433,0.0042642667],"genre_scores_gemma":[0.5376923,0.0013354007,0.45150372,0.00069698296,0.0006189381,0.0005403089,0.00028345996,0.0005060329,0.0068228594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911987,0.0025128676,0.00094451837,0.0008354959,0.003387207,0.0011212145],"domain_scores_gemma":[0.9580432,0.010961937,0.0020768996,0.0203398,0.0072052674,0.0013729571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013956872,0.0010218881,0.0017391274,0.002573841,0.0037138667,0.008660559,0.0071570463,0.004652466,0.003697967],"category_scores_gemma":[0.02725688,0.0022022305,0.001169864,0.0036578316,0.0046247393,0.014819085,0.006618499,0.008045181,0.0010031306],"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.0017535462,0.00064289424,0.002083822,0.00063183135,0.00022389545,0.00044365835,0.0013778082,0.04367158,0.032520324,0.7889992,0.009909326,0.11774217],"study_design_scores_gemma":[0.00053737685,0.0004028916,0.00066042936,0.00013585376,0.00046122467,0.0006504744,0.0005129229,0.59014416,0.05084931,0.3284849,0.026882764,0.0002776468],"about_ca_topic_score_codex":0.0019422402,"about_ca_topic_score_gemma":0.0033537466,"teacher_disagreement_score":0.013956872,"about_ca_system_score_codex":0.0033945488,"about_ca_system_score_gemma":0.0033907727,"threshold_uncertainty_score":0.07381189},"labels":[],"label_agreement":null},{"id":"W2141508507","doi":"10.1109/lman.1993.665406","title":"Access Traffic characterization in Data Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Bell (Canada)","funders":"","keywords":"Burstiness; Computer science; Traffic generation model; Computer network; Traffic shaping; Internet traffic engineering; Network packet; Network traffic control; Distributed computing","score_opus":0.054454734299553685,"score_gpt":0.2805052054748218,"score_spread":0.22605047117526808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141508507","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.3336569,0.0030392432,0.64104766,0.0006032707,0.00017237861,0.00022629675,0.0010413562,0.0014746597,0.018738281],"genre_scores_gemma":[0.9277851,0.0012020252,0.06453447,0.00012356405,0.00012069433,0.00016596199,0.0010707481,0.00013775367,0.0048597804],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99943453,0.00016391213,0.000043552845,0.00007666906,0.00022106613,0.000060293],"domain_scores_gemma":[0.9985123,0.00077865535,0.00010416584,0.00014349657,0.00039488493,0.00006657718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054870854,0.00044621984,0.0003434259,0.0023849788,0.0005713859,0.0016498389,0.0003754826,0.0005377034,0.0012022279],"category_scores_gemma":[0.0039040756,0.00015873622,0.00017049065,0.002010901,0.00046885648,0.0019150897,0.00037350497,0.00041338842,0.0005046461],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000585414,0.00034250904,0.06608902,0.0004917111,0.00005387876,0.0011687357,0.0015245585,0.13452674,0.10748655,0.18807057,0.011111065,0.48854926],"study_design_scores_gemma":[0.000014420115,0.00025968894,0.023088848,0.00011323018,0.000025159083,0.0024036034,0.00093260995,0.8138425,0.04487023,0.07975673,0.034621276,0.000071763265],"about_ca_topic_score_codex":0.0026253324,"about_ca_topic_score_gemma":0.0011186204,"teacher_disagreement_score":0.0026253324,"about_ca_system_score_codex":0.00074567186,"about_ca_system_score_gemma":0.00028644907,"threshold_uncertainty_score":0.005410254},"labels":[],"label_agreement":null},{"id":"W2141679368","doi":"10.1109/ccece.2003.1226032","title":"An adaptive framework for multimedia messaging services over wireless networks and the Internet","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Alberta","funders":"","keywords":"Computer science; Computer network; The Internet; Multimedia; Multi-frequency network; Wireless; Bandwidth (computing); IP Multimedia Subsystem; Wireless network; World Wide Web; Quality of service; Telecommunications; Heterogeneous network","score_opus":0.010109614075951606,"score_gpt":0.23645224938212162,"score_spread":0.22634263530617002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141679368","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.005519834,0.001004329,0.98252594,0.0006198001,0.00021140483,0.000391829,0.000047734018,0.0025490967,0.00712987],"genre_scores_gemma":[0.15990509,0.0012989886,0.8227325,0.0004230296,0.0004580661,0.0007286937,0.00032446778,0.00044475176,0.013684466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982999,0.0004186491,0.00015804353,0.00023424107,0.0006987047,0.00019054383],"domain_scores_gemma":[0.99889565,0.0002006422,0.00010985891,0.00027760438,0.0002928554,0.00022335873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027913873,0.0009302584,0.0007462249,0.0009187243,0.0015119791,0.0029233068,0.0039527253,0.0023410844,0.0017767517],"category_scores_gemma":[0.0026670939,0.00057864795,0.0010250845,0.00092349784,0.0016506464,0.0029950507,0.0020914346,0.0026909155,0.00091479364],"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.00022654155,0.00027256247,0.0008848161,0.00023337592,0.000083346655,0.0007637729,0.0006934347,0.04128287,0.030452289,0.776167,0.013542033,0.13539782],"study_design_scores_gemma":[0.00013382765,0.0003377432,0.00072315533,0.00014021726,0.00015943416,0.0013091774,0.00017899871,0.60081965,0.014696052,0.108242534,0.27307212,0.00018710019],"about_ca_topic_score_codex":0.0060415147,"about_ca_topic_score_gemma":0.006517202,"teacher_disagreement_score":0.0060415147,"about_ca_system_score_codex":0.0019646997,"about_ca_system_score_gemma":0.002569598,"threshold_uncertainty_score":0.014762461},"labels":[],"label_agreement":null},{"id":"W2143301244","doi":"10.1109/ccece.2003.1226041","title":"Multicast traffic merging in DiffServ-supported MPLS networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Multicast; Computer network; Protocol Independent Multicast; Xcast; Computer science; Distance Vector Multicast Routing Protocol; IP multicast; Pragmatic General Multicast; Source-specific multicast; Multiprotocol Label Switching; Multicast address; Quality of service; Inter-domain","score_opus":0.013637237479660771,"score_gpt":0.22098330072920566,"score_spread":0.20734606324954488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143301244","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.33252543,0.0014829919,0.6581983,0.00020542004,0.00004735302,0.0001436135,0.000070194175,0.0011200606,0.006206545],"genre_scores_gemma":[0.89704466,0.00041742966,0.10046686,0.000105842926,0.00005347259,0.00006276921,0.0001187489,0.0000616218,0.0016686688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987172,0.00044559682,0.000048406982,0.000107709144,0.000526496,0.00015460423],"domain_scores_gemma":[0.9988489,0.00051059324,0.00015570589,0.0001497993,0.00027706742,0.000057814497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012890956,0.00037120387,0.0004363103,0.00089338265,0.0009872589,0.0009037042,0.00088289194,0.0008944921,0.00043459196],"category_scores_gemma":[0.0017848255,0.0003338916,0.00033097935,0.0007470552,0.0007199967,0.0015595624,0.0006508367,0.00048424565,0.00017803366],"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.0012589009,0.00040258284,0.008324492,0.00034837885,0.0001303746,0.0021012106,0.0017834258,0.20410031,0.32333595,0.11706994,0.0027043282,0.33844012],"study_design_scores_gemma":[0.000044606903,0.00046488643,0.0021724051,0.000043929536,0.00010021184,0.0013328539,0.0002941286,0.7912727,0.15855269,0.035675526,0.009975947,0.000070064365],"about_ca_topic_score_codex":0.0010915066,"about_ca_topic_score_gemma":0.00077566516,"teacher_disagreement_score":0.0012890956,"about_ca_system_score_codex":0.0009822756,"about_ca_system_score_gemma":0.00041069154,"threshold_uncertainty_score":0.0071269274},"labels":[],"label_agreement":null},{"id":"W2143917381","doi":"10.1145/2806777.2806933","title":"Software-defined caching","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":50,"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; Forwarding plane; Multitenancy; Visibility; Cloud computing; Software-defined networking; Set (abstract data type); Software; Distributed computing; Computer network; Operating system; Software development","score_opus":0.041999831892094955,"score_gpt":0.23406095366794827,"score_spread":0.19206112177585333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143917381","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02525518,0.0074366317,0.9005306,0.0011052437,0.0010167991,0.0006221608,0.00070075516,0.009790812,0.053541757],"genre_scores_gemma":[0.74156773,0.004739456,0.21664613,0.0015655329,0.00048563324,0.00094802584,0.0024728975,0.0013126035,0.030262062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965528,0.00069623516,0.00027300115,0.00046665428,0.0014919002,0.00051937054],"domain_scores_gemma":[0.9931979,0.0012728489,0.00041393933,0.002577588,0.0021639285,0.00037374714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020092498,0.0010775365,0.00096479384,0.0007767936,0.0012025114,0.003947026,0.0039149057,0.0012857628,0.0042063883],"category_scores_gemma":[0.0067603895,0.0005078393,0.0007004187,0.0015421264,0.0014895571,0.0031581467,0.0028825786,0.0019621032,0.0015410923],"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.0006299167,0.00036015693,0.003665803,0.0011256144,0.0002251157,0.0003364525,0.0005130139,0.066219136,0.019261006,0.6314165,0.053216793,0.22303045],"study_design_scores_gemma":[0.00019933804,0.00039940028,0.0009372338,0.00034068114,0.00018315416,0.0009148421,0.0001744447,0.4616176,0.0340019,0.14249581,0.358569,0.00016667615],"about_ca_topic_score_codex":0.008215586,"about_ca_topic_score_gemma":0.007800783,"teacher_disagreement_score":0.008215586,"about_ca_system_score_codex":0.0026747824,"about_ca_system_score_gemma":0.0039798347,"threshold_uncertainty_score":0.019407034},"labels":[],"label_agreement":null},{"id":"W2144023163","doi":"10.1109/ccece.2003.1226051","title":"Caching dynamic content on the Web","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Dynamic web page; Latency (audio); Download; Computer network; Bandwidth (computing); Scheme (mathematics); Server; Proxy server; Web page; Distributed computing; Operating system; World Wide Web","score_opus":0.03395466727376049,"score_gpt":0.2186575485252322,"score_spread":0.18470288125147172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144023163","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.77466756,0.0037992047,0.19381744,0.0006004565,0.0001205577,0.00012710015,0.00016613607,0.0031437064,0.023557749],"genre_scores_gemma":[0.9708839,0.0012484293,0.02322704,0.00008678925,0.000030084519,0.000022686583,0.00013491035,0.000050728646,0.0043154196],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973136,0.00007358455,0.000013508102,0.000029197206,0.00011426329,0.000038061564],"domain_scores_gemma":[0.99902236,0.00031545255,0.00006431112,0.00028427536,0.00025251275,0.000061172235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038311808,0.0002707467,0.00044498633,0.0005322841,0.00054626475,0.0010900389,0.0006228556,0.00056208676,0.0008639],"category_scores_gemma":[0.0017273856,0.00018135169,0.00011818723,0.00094846543,0.00040469613,0.0015233787,0.00052603387,0.0003944312,0.000310641],"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.0013585811,0.00047742293,0.013661475,0.0005298104,0.00011897955,0.002043624,0.0005256031,0.18859805,0.17525412,0.06087906,0.009877034,0.54667616],"study_design_scores_gemma":[0.00010135313,0.0003615055,0.0053843902,0.000059764487,0.0001522135,0.0012350153,0.00029049945,0.86153334,0.08447196,0.026075535,0.020283297,0.000051198305],"about_ca_topic_score_codex":0.0035296804,"about_ca_topic_score_gemma":0.0028040786,"teacher_disagreement_score":0.0035296804,"about_ca_system_score_codex":0.00072858034,"about_ca_system_score_gemma":0.0005935463,"threshold_uncertainty_score":0.007018268},"labels":[],"label_agreement":null},{"id":"W2145596066","doi":"10.1109/icppw.2011.47","title":"A Runtime Partitioning Technique for Mobile Web Services","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Web service; Partition (number theory); Mobile device; Key (lock); Mobile computing; Distributed computing; Computer network; The Internet; Operating system; World Wide Web","score_opus":0.02189177769725501,"score_gpt":0.22232763452635962,"score_spread":0.2004358568291046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145596066","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.058181655,0.00079248287,0.9318618,0.00011774488,0.00009879849,0.0001543279,0.000077531266,0.005281204,0.0034344643],"genre_scores_gemma":[0.43467093,0.00043872933,0.55938023,0.0000824019,0.000068727735,0.00013724035,0.00036630247,0.0006723693,0.004183094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996201,0.00006864785,0.000028260181,0.00006435407,0.00015537084,0.00006324516],"domain_scores_gemma":[0.99953127,0.00010740598,0.000044119402,0.00016107746,0.00011728833,0.00003891096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028296895,0.00051680306,0.0004261319,0.00063556695,0.0007773423,0.0005263113,0.0007963007,0.00037288805,0.001090816],"category_scores_gemma":[0.0011107557,0.00026291024,0.00047950036,0.00060449616,0.00032251028,0.00076583214,0.00062352256,0.0005660081,0.0005441025],"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.0005436405,0.00019641916,0.0014063661,0.00026548203,0.00009672512,0.0005723234,0.00061991654,0.06270519,0.39072213,0.01707922,0.006509474,0.51928306],"study_design_scores_gemma":[0.00011627522,0.00040972623,0.0024704235,0.000047055124,0.00015023975,0.0014549514,0.00020047475,0.7594658,0.18854529,0.0077454234,0.039289564,0.000104834144],"about_ca_topic_score_codex":0.0025667949,"about_ca_topic_score_gemma":0.0030890119,"teacher_disagreement_score":0.0025667949,"about_ca_system_score_codex":0.0004260399,"about_ca_system_score_gemma":0.00060546485,"threshold_uncertainty_score":0.005103767},"labels":[],"label_agreement":null},{"id":"W2147324834","doi":"10.1007/978-3-319-05290-8_18","title":"Social Media Sharing","year":2014,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Social media; Computer science; The Internet; World Wide Web; Internet privacy; Ideology; Wireless; Mobile device; Multimedia; Business; Telecommunications; Political science","score_opus":0.03898053860751474,"score_gpt":0.2522445282567105,"score_spread":0.21326398964919577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147324834","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021714762,0.005079731,0.06310748,0.0036708333,0.00077484414,0.00016047468,0.00036600907,0.00060884113,0.904517],"genre_scores_gemma":[0.45661804,0.006617503,0.019897131,0.0007378891,0.0014419933,0.00027202407,0.0006471829,0.00032325927,0.51344496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927264,0.00019403368,0.000026980804,0.0001437238,0.0002709683,0.000091659924],"domain_scores_gemma":[0.99873227,0.00045221523,0.00007774514,0.0004738994,0.00017141284,0.00009237237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139797,0.0005810249,0.00043655408,0.0014357715,0.0016888437,0.0037719395,0.0010527329,0.0012627665,0.033941705],"category_scores_gemma":[0.0032004153,0.00031608203,0.00037316367,0.0022933707,0.0012735607,0.007574861,0.0025430128,0.0010805941,0.0067686997],"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.000036727914,0.00006772197,0.0003642797,0.00012347345,0.000023565748,0.000095310126,0.0009727999,0.0015344869,0.0012316457,0.7531209,0.036277346,0.20615177],"study_design_scores_gemma":[0.000015134491,0.00006109586,0.00090953475,0.00023009889,0.000039082523,0.000598142,0.0010902662,0.012915191,0.0030855774,0.43178234,0.5492353,0.000038186026],"about_ca_topic_score_codex":0.0015133757,"about_ca_topic_score_gemma":0.0014743726,"teacher_disagreement_score":0.033941705,"about_ca_system_score_codex":0.0014104472,"about_ca_system_score_gemma":0.0009919698,"threshold_uncertainty_score":0.11354637},"labels":[],"label_agreement":null},{"id":"W2148487037","doi":"10.1109/pccc.2009.5403809","title":"GPU support for batch oriented workloads","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bloom filter; Computer science; Workload; Data structure; Set (abstract data type); Parallel computing; Graphics; Filter (signal processing); General-purpose computing on graphics processing units; Probabilistic logic; Instruction set; Operating system; Algorithm; Artificial intelligence; Programming language","score_opus":0.015124637656672922,"score_gpt":0.24403510393929279,"score_spread":0.22891046628261985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148487037","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.45277175,0.0007415169,0.4772662,0.0008075898,0.00025161277,0.00030693779,0.0008620388,0.039136026,0.02785634],"genre_scores_gemma":[0.88999367,0.00020566111,0.10248478,0.00023058624,0.000055703556,0.00015064608,0.0010536459,0.0011371607,0.004688125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896944,0.00024340104,0.00008367318,0.00015930057,0.00033723735,0.00020694129],"domain_scores_gemma":[0.9958853,0.0013247695,0.00014718494,0.001607504,0.00078726286,0.0002479267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009397849,0.0007753168,0.0008483766,0.00060788676,0.00093723513,0.0018822171,0.0029038494,0.00081881444,0.0053331386],"category_scores_gemma":[0.006431853,0.0005200719,0.00042947818,0.0013288504,0.00054283027,0.0020782046,0.001438595,0.0010975081,0.001270585],"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.0054462277,0.0010815897,0.03180475,0.00063197355,0.00038861437,0.0020731497,0.0015162077,0.28664476,0.17347617,0.058066368,0.06819101,0.3706792],"study_design_scores_gemma":[0.00021349941,0.00028026794,0.0025285794,0.00002916003,0.000057994184,0.0002629343,0.0001632386,0.9128851,0.04868207,0.0123100635,0.02252878,0.000058336886],"about_ca_topic_score_codex":0.007167558,"about_ca_topic_score_gemma":0.0072764014,"teacher_disagreement_score":0.007167558,"about_ca_system_score_codex":0.0010911314,"about_ca_system_score_gemma":0.0016221119,"threshold_uncertainty_score":0.0178411},"labels":[],"label_agreement":null},{"id":"W2148883419","doi":"10.1109/tvt.2008.917238","title":"Proxy-Based Wireless Data Access Algorithms in Mobile Hotspots","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"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; Communications Research Centre Canada","funders":"","keywords":"Computer science; Wireless; Cache; Proxy (statistics); Algorithm; Callback; Mobile wireless; Computer network; Bluetooth; Data access; Database; Operating system; Machine learning","score_opus":0.03881300411109033,"score_gpt":0.2769818341048313,"score_spread":0.23816882999374095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148883419","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.111038096,0.0014989794,0.88410413,0.00019710224,0.00005385028,0.00007047266,0.000034301705,0.0007089363,0.0022942543],"genre_scores_gemma":[0.89574367,0.00050387334,0.101658,0.000055394587,0.00003286688,0.000071335664,0.000046730453,0.000046359277,0.00184178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949205,0.00022664017,0.000032695236,0.000059639766,0.000113345,0.00007570059],"domain_scores_gemma":[0.9981115,0.0010615689,0.00017203878,0.00026309298,0.00029372404,0.0000980527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845879,0.00045958316,0.00084156875,0.0004966967,0.0005227515,0.0010887971,0.0010819255,0.0006559451,0.0010431897],"category_scores_gemma":[0.0044277157,0.00028527225,0.00025436198,0.000817936,0.0006234896,0.0018054689,0.0008183729,0.00045966223,0.00026144047],"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.0006266482,0.00013954415,0.004500799,0.00020723505,0.00009683906,0.00025895983,0.0003425111,0.80812216,0.011762065,0.053620975,0.0023101803,0.11801205],"study_design_scores_gemma":[0.000021552416,0.000051374664,0.00018796122,0.0000048648276,0.000009181335,0.00007299716,0.00003654304,0.992029,0.0022079982,0.0048608235,0.00051126664,0.0000064621563],"about_ca_topic_score_codex":0.0014629045,"about_ca_topic_score_gemma":0.001214775,"teacher_disagreement_score":0.0014629045,"about_ca_system_score_codex":0.00070598465,"about_ca_system_score_gemma":0.00050645776,"threshold_uncertainty_score":0.0052071214},"labels":[],"label_agreement":null},{"id":"W2151283635","doi":"10.1007/978-3-642-15246-7_31","title":"Learning Automaton Based On-Line Discovery and Tracking of Spatio-temporal Event Patterns","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Event (particle physics); Correctness; Artificial intelligence; Automaton; Theoretical computer science; Machine learning; Distributed computing; Algorithm","score_opus":0.016983084757080828,"score_gpt":0.24390611818024155,"score_spread":0.22692303342316072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151283635","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.12891479,0.0002560478,0.86587113,0.00025058247,0.000077006356,0.00007859867,0.00060024654,0.0027346257,0.001217014],"genre_scores_gemma":[0.86219454,0.00013475797,0.13448988,0.00008994486,0.000039395607,0.00012185914,0.0011242589,0.00010887305,0.0016964934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908376,0.00014302423,0.00008849786,0.00041701575,0.00016651543,0.000101180565],"domain_scores_gemma":[0.9924539,0.0054348665,0.0005351688,0.00070986984,0.00064806646,0.00021818631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695765,0.00068458094,0.0017804132,0.0013840017,0.0004862983,0.0014740566,0.0028697364,0.0013712654,0.0025140257],"category_scores_gemma":[0.0070086326,0.0006486585,0.0010323604,0.00135732,0.0006882243,0.001722404,0.0014639965,0.0012337726,0.00075907],"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.00087944284,0.00045547987,0.02031783,0.0002806889,0.00022814405,0.00037142882,0.0002784379,0.66262305,0.009313027,0.010437444,0.002593512,0.29222155],"study_design_scores_gemma":[0.000005965707,0.00001748541,0.00019408883,0.000002489209,0.000007632416,0.00002104845,0.000006594084,0.99741024,0.00048171403,0.0017763122,0.00007337585,0.000003030004],"about_ca_topic_score_codex":0.008356253,"about_ca_topic_score_gemma":0.01031879,"teacher_disagreement_score":0.008356253,"about_ca_system_score_codex":0.0009071883,"about_ca_system_score_gemma":0.0011146405,"threshold_uncertainty_score":0.016615212},"labels":[],"label_agreement":null},{"id":"W2151432319","doi":"10.1109/vetecf.2002.1040711","title":"Image transcoding proxy for mobile Internet access","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Transcoding; Computer science; Mobile device; Wireless; Bandwidth (computing); Proxy (statistics); Server; Mobile computing; Software deployment; The Internet; Computer network; Cache; Telecommunications; World Wide Web; Operating system","score_opus":0.03078673726595693,"score_gpt":0.2860740582747155,"score_spread":0.25528732100875856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151432319","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.05535913,0.0012666188,0.9067541,0.00042788722,0.00042694667,0.00039991568,0.00015650189,0.013439247,0.021769566],"genre_scores_gemma":[0.5810051,0.0007577231,0.39524284,0.0004067401,0.00023740849,0.0002522464,0.00065844867,0.00085748354,0.02058196],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956137,0.00009724903,0.000048192564,0.000080368714,0.0001587437,0.000054125787],"domain_scores_gemma":[0.99841416,0.00025745665,0.000084335144,0.0006159342,0.00051533827,0.0001127449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322129,0.00047784156,0.0006948002,0.00048741067,0.0004648458,0.0011867309,0.0011605147,0.000931652,0.003762633],"category_scores_gemma":[0.0028830953,0.00021401503,0.00026163744,0.00042356708,0.00046610035,0.0011899446,0.0007941967,0.001044583,0.0013913242],"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.0010709023,0.0003039355,0.0018867376,0.0004303491,0.000064131214,0.0028130063,0.00054119516,0.012761918,0.47028536,0.0708291,0.019714536,0.4192989],"study_design_scores_gemma":[0.00017617374,0.00047869032,0.002517683,0.000103680046,0.0001481004,0.005292316,0.00014044522,0.45214498,0.40585166,0.013266874,0.11972568,0.00015381438],"about_ca_topic_score_codex":0.00076630304,"about_ca_topic_score_gemma":0.0005653778,"teacher_disagreement_score":0.003762633,"about_ca_system_score_codex":0.00052093394,"about_ca_system_score_gemma":0.00041639686,"threshold_uncertainty_score":0.012587249},"labels":[],"label_agreement":null},{"id":"W2152272665","doi":"10.1007/978-3-540-45227-0_72","title":"Using User Access Patterns for Semantic Query Caching","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Query optimization; Query language; Web query classification; Query expansion; Sargable; Web search query; Information retrieval; Semantic query; Cache; Selection (genetic algorithm); Online aggregation; RDF query language; Database query; Search engine; Artificial intelligence; Computer network","score_opus":0.05447718944837764,"score_gpt":0.2942570346944909,"score_spread":0.23977984524611323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152272665","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.065442674,0.00048177264,0.9149318,0.00051009835,0.000099083954,0.0001441766,0.0006039361,0.013603325,0.004183094],"genre_scores_gemma":[0.5611096,0.00045773826,0.4315026,0.00021082291,0.000094595656,0.00014034903,0.0012552332,0.0017316461,0.0034975023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676466,0.000821241,0.00038509333,0.00043950463,0.0013104252,0.00027907698],"domain_scores_gemma":[0.9848577,0.0057152514,0.00074211886,0.0067212773,0.0016135466,0.00035003817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034968657,0.001009347,0.0015517598,0.0024280907,0.0011271863,0.0037291113,0.0019974103,0.0013481419,0.0031845353],"category_scores_gemma":[0.019378394,0.0011787433,0.0009721151,0.0042310087,0.0013938268,0.01017686,0.0020493828,0.0019311135,0.0008515782],"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.0022400746,0.00070395076,0.01955349,0.0004940923,0.00026074226,0.0004106322,0.0012852282,0.03784308,0.034462333,0.12497264,0.020628596,0.7571452],"study_design_scores_gemma":[0.00012584381,0.00017459341,0.0019368333,0.00006716402,0.0002625125,0.00078313187,0.00028763784,0.8035125,0.054722156,0.121127926,0.016871275,0.00012837788],"about_ca_topic_score_codex":0.0061547565,"about_ca_topic_score_gemma":0.00930493,"teacher_disagreement_score":0.0061547565,"about_ca_system_score_codex":0.0012087937,"about_ca_system_score_gemma":0.0014451307,"threshold_uncertainty_score":0.018493414},"labels":[],"label_agreement":null},{"id":"W215242877","doi":"10.3233/jcm-2009-0243","title":"Performance optimization for web caching based on input modeling","year":2009,"lang":"en","type":"article","venue":"Journal of Computational Methods in Sciences and Engineering","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Real-time computing; Database","score_opus":0.04095364526263952,"score_gpt":0.3313589073507669,"score_spread":0.2904052620881274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W215242877","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.15863663,0.000616439,0.8338655,0.0004247389,0.000035908113,0.000055919143,0.00021494096,0.0011035166,0.005046416],"genre_scores_gemma":[0.97115874,0.0002489162,0.026575858,0.000040607723,0.000021909735,0.000055590735,0.00012802202,0.000113993556,0.0016562855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986243,0.0006945516,0.000035900655,0.00013163309,0.00031056703,0.00020294599],"domain_scores_gemma":[0.9970783,0.0021116459,0.00015398751,0.00024308094,0.0003548862,0.00005803483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011667168,0.0011526099,0.0013054785,0.0003035829,0.00038590995,0.0015354129,0.0013035218,0.0011391053,0.0020232978],"category_scores_gemma":[0.0059652864,0.00032215138,0.0006769713,0.0007592862,0.00050323963,0.0016165806,0.00059567497,0.0011355154,0.000307308],"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.000086796164,0.00004967254,0.0004545136,0.000043611566,0.000017178472,0.000035929228,0.000017638757,0.98634756,0.0019676455,0.0041484954,0.00026130807,0.0065696756],"study_design_scores_gemma":[0.0000016897224,0.000008539189,0.000052172374,0.0000011241603,0.0000029524049,0.000004047512,0.0000018881593,0.9988722,0.0004190917,0.00060623663,0.0000283166,0.0000017906849],"about_ca_topic_score_codex":0.007972947,"about_ca_topic_score_gemma":0.004217304,"teacher_disagreement_score":0.007972947,"about_ca_system_score_codex":0.0017598062,"about_ca_system_score_gemma":0.001215286,"threshold_uncertainty_score":0.015853107},"labels":[],"label_agreement":null},{"id":"W2153722015","doi":"10.1109/ccece.2002.1012970","title":"Application Layer Routing Options for efficient data transport over the Internet","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Manitoba","funders":"","keywords":"Computer science; Computer network; File transfer; File Transfer Protocol; Transport layer; Network congestion; Routing protocol; Network packet; The Internet; Router; Distributed computing; Operating system; Transfer (computing); Layer (electronics)","score_opus":0.04793800657253877,"score_gpt":0.2737495338706086,"score_spread":0.2258115272980698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153722015","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.0969477,0.0036311587,0.88212776,0.0010477068,0.00014856213,0.00024071462,0.00014470443,0.0055594733,0.010152215],"genre_scores_gemma":[0.62066704,0.0030114546,0.37114888,0.00020501229,0.00018132449,0.0002015738,0.0003578169,0.0002698508,0.0039569116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994419,0.00021096063,0.000059613805,0.000036184265,0.00018236831,0.000068881585],"domain_scores_gemma":[0.9983835,0.0005278034,0.00020698685,0.0005210422,0.00031090487,0.00004984645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012821137,0.00051187305,0.00034578782,0.0006103233,0.00043520055,0.0014782167,0.0011094977,0.0006312705,0.0018701134],"category_scores_gemma":[0.0028190261,0.0003361034,0.00030616924,0.0007824368,0.0003765298,0.0020217772,0.00072349975,0.0007655067,0.0005487386],"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.0005805087,0.00026551913,0.0031759015,0.00089700177,0.00015973143,0.00055915536,0.00041215654,0.09660327,0.23634884,0.1569867,0.0105932765,0.49341792],"study_design_scores_gemma":[0.00018210159,0.0006012778,0.0032588951,0.00012852956,0.00028875898,0.0016098596,0.00020465253,0.6820207,0.104290195,0.089168705,0.11806833,0.00017800472],"about_ca_topic_score_codex":0.00045670517,"about_ca_topic_score_gemma":0.0007159543,"teacher_disagreement_score":0.0018701134,"about_ca_system_score_codex":0.0003906439,"about_ca_system_score_gemma":0.00037836746,"threshold_uncertainty_score":0.006780505},"labels":[],"label_agreement":null},{"id":"W2153758166","doi":"10.1109/tpds.2012.94","title":"Fast Channel Zapping with Destination-Oriented Multicast for IP Video Delivery","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multicast; Computer science; Computer network; IPTV; Scalability; Quality of experience; Channel (broadcasting); Overhead (engineering); Robustness (evolution); Quality of service; Distributed computing; Operating system","score_opus":0.023427496665875736,"score_gpt":0.22812416394470617,"score_spread":0.20469666727883043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153758166","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.07765693,0.0005057361,0.9178881,0.00016715766,0.000075484466,0.00006747703,0.00003773354,0.0005562026,0.0030452241],"genre_scores_gemma":[0.93591887,0.00036015824,0.06260746,0.00007149379,0.000060276077,0.00005207185,0.000043334898,0.000025114348,0.00086118723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.0001171237,0.000016988539,0.000068190006,0.00014698367,0.00010862824],"domain_scores_gemma":[0.9995704,0.0001498196,0.00006331335,0.00009898629,0.00008197921,0.00003552394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048451847,0.00042537352,0.00038052356,0.00042027966,0.0005394932,0.00046193268,0.00086367613,0.00035730092,0.0006934346],"category_scores_gemma":[0.0014135534,0.00016912573,0.00033771677,0.00044729156,0.00046007274,0.00083320925,0.0011724031,0.00067629036,0.00016063204],"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.00092959864,0.00022946508,0.0026489794,0.00043758005,0.00008841784,0.0009872714,0.00077379716,0.36073378,0.24042553,0.11645423,0.0049674003,0.27132386],"study_design_scores_gemma":[0.000017112721,0.00020855972,0.00031267616,0.000012987658,0.000025840005,0.00017259583,0.00007555312,0.97471946,0.011827072,0.009691006,0.0029151463,0.000022030956],"about_ca_topic_score_codex":0.0013622158,"about_ca_topic_score_gemma":0.0012916249,"teacher_disagreement_score":0.0013622158,"about_ca_system_score_codex":0.00069611886,"about_ca_system_score_gemma":0.00045466772,"threshold_uncertainty_score":0.005050719},"labels":[],"label_agreement":null},{"id":"W2154345423","doi":"10.1109/icics.2009.5397604","title":"On Peer-to-Peer relays for VoIP applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Simon Fraser University","funders":"","keywords":"PlanetLab; Voice over IP; Computer science; Relay; Computer network; Snapshot (computer storage); Peer-to-peer; Quality of service; The Internet; World Wide Web; Operating system","score_opus":0.018987391521185403,"score_gpt":0.26859524631472836,"score_spread":0.24960785479354297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154345423","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.5285709,0.006789197,0.4337348,0.0008153558,0.0001941866,0.0008840333,0.00036516265,0.0124911135,0.016155278],"genre_scores_gemma":[0.90844023,0.0015846248,0.08528985,0.00010980306,0.00008853344,0.00012729412,0.0002823419,0.00018841581,0.0038888992],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777645,0.000750812,0.00008637867,0.0002981794,0.00095749943,0.00013068077],"domain_scores_gemma":[0.9959139,0.0018320181,0.00028014215,0.00094591634,0.0008993629,0.00012856483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014716947,0.0007679379,0.00092697196,0.0008511275,0.0009684603,0.00096942624,0.0013958818,0.0009550214,0.0021637124],"category_scores_gemma":[0.00912825,0.00033461401,0.00021940775,0.00082101923,0.00065157894,0.0025271345,0.0008686789,0.0005403882,0.0011514286],"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.00249892,0.00041697096,0.013158031,0.0011523729,0.00017893889,0.0016597937,0.0013480567,0.20867342,0.17602916,0.015254352,0.010172294,0.56945777],"study_design_scores_gemma":[0.00020675421,0.0036265652,0.0124782715,0.00015953522,0.00034369616,0.002159367,0.0007758753,0.69772273,0.22697632,0.01176237,0.043574553,0.00021398255],"about_ca_topic_score_codex":0.003534722,"about_ca_topic_score_gemma":0.0033351518,"teacher_disagreement_score":0.003534722,"about_ca_system_score_codex":0.0007540147,"about_ca_system_score_gemma":0.0005980856,"threshold_uncertainty_score":0.0077831745},"labels":[],"label_agreement":null},{"id":"W2154886281","doi":"10.1109/dnsr.2004.1344710","title":"FACADE - a framework for context-aware content adaptation and delivery","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"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 New Brunswick","funders":"","keywords":"Facade; Computer science; Adaptation (eye); The Internet; Variety (cybernetics); Bridge (graph theory); Content adaptation; Mobile device; Context (archaeology); Ubiquitous computing; Wireless network; World Wide Web; Multimedia; Wireless; Human–computer interaction; Telecommunications; Engineering","score_opus":0.085623371405078,"score_gpt":0.2535544264142839,"score_spread":0.16793105500920588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154886281","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.0011685457,0.00072757446,0.9845051,0.00029075486,0.00010822564,0.0003613532,0.00015539049,0.008890665,0.0037923267],"genre_scores_gemma":[0.059510022,0.0016827092,0.9273801,0.00036609566,0.00016169056,0.0008325488,0.00081117876,0.00088316435,0.008372508],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840254,0.00032542305,0.00015306055,0.00025177843,0.000701674,0.000165583],"domain_scores_gemma":[0.99865377,0.0003929862,0.00009675166,0.0003790597,0.00025202223,0.00022531312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022093756,0.001226917,0.0013668993,0.0016493322,0.0017794754,0.0048566405,0.004329113,0.0026638377,0.0042844736],"category_scores_gemma":[0.004570392,0.0009951015,0.0015859567,0.0012176856,0.0017563008,0.0042019323,0.0041620107,0.004114911,0.002240366],"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.0003585178,0.0003529134,0.0012894812,0.0008654864,0.00023918883,0.0010403859,0.0017646191,0.08327279,0.021212084,0.3654755,0.05272848,0.47140062],"study_design_scores_gemma":[0.00012121494,0.00017477639,0.00051626074,0.000356383,0.00014567949,0.0013876881,0.00031116695,0.48615003,0.012533787,0.13010296,0.3679844,0.00021569533],"about_ca_topic_score_codex":0.013958788,"about_ca_topic_score_gemma":0.013255177,"teacher_disagreement_score":0.013958788,"about_ca_system_score_codex":0.0016221157,"about_ca_system_score_gemma":0.003114255,"threshold_uncertainty_score":0.027755082},"labels":[],"label_agreement":null},{"id":"W2155061132","doi":"10.1109/glocom.2010.5683549","title":"Peer-Assisted Caching for Scalable Media Streaming in Wireless Backhaul Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Backhaul (telecommunications); Cache; False sharing; Scalability; Limiting; Wireless; Smart Cache; Wireless network; CPU cache; Base station; Cache algorithms; Operating system","score_opus":0.015815271067012353,"score_gpt":0.2346461533266667,"score_spread":0.21883088225965433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155061132","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.15711263,0.0037620561,0.8312458,0.0003093018,0.00013694823,0.00016997044,0.00004725074,0.0016561188,0.005559908],"genre_scores_gemma":[0.90109175,0.00089885195,0.095253244,0.000047344376,0.0001024802,0.000070546004,0.000052359737,0.000048284513,0.0024351734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.00011406133,0.000016504053,0.00003159127,0.00014568242,0.000026685406],"domain_scores_gemma":[0.99915934,0.00042020463,0.000047301157,0.0001428581,0.00019416124,0.000036174002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005161601,0.00029146508,0.0006010881,0.00034381784,0.00072154356,0.0005894596,0.0009908496,0.0004468019,0.0008132124],"category_scores_gemma":[0.0021380323,0.00014581723,0.00021734789,0.0004520652,0.00032989756,0.0011277943,0.0004188005,0.00039160886,0.00014524149],"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.0007947686,0.0003243545,0.003800428,0.0005282592,0.00021121332,0.0010034987,0.00056616357,0.2597945,0.13708515,0.051432665,0.0067314785,0.5377275],"study_design_scores_gemma":[0.000053689375,0.00031517041,0.0007126232,0.00001855878,0.00006249704,0.0003090226,0.00007551202,0.96814686,0.016280808,0.0081458315,0.005852659,0.000026823305],"about_ca_topic_score_codex":0.0024902213,"about_ca_topic_score_gemma":0.004355251,"teacher_disagreement_score":0.0024902213,"about_ca_system_score_codex":0.0004985373,"about_ca_system_score_gemma":0.0004759491,"threshold_uncertainty_score":0.004951477},"labels":[],"label_agreement":null},{"id":"W2155147437","doi":"10.1145/1496046.1496053","title":"Group unicast for the real world","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Unicast; Computer science; Broadcasting (networking); Kernel (algebra); Network packet; Computer network; Operating system","score_opus":0.05370073624115723,"score_gpt":0.2462940929299298,"score_spread":0.19259335668877256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155147437","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.36179355,0.009110234,0.58641875,0.0044880304,0.0005112759,0.00014914863,0.00073289295,0.0076461313,0.029149953],"genre_scores_gemma":[0.9061802,0.00095474935,0.08962828,0.00014525972,0.000057374542,0.00008427618,0.00021601774,0.00027086763,0.0024629766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899,0.00034076432,0.000041691816,0.00013286376,0.0003965479,0.00009815173],"domain_scores_gemma":[0.99607396,0.0018498608,0.00027706634,0.00095184485,0.0007274541,0.00011987017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015128079,0.00054092135,0.00056709244,0.00064759667,0.0007313744,0.0021472771,0.0013895313,0.0010306956,0.003023109],"category_scores_gemma":[0.009110895,0.00023609596,0.00019578685,0.0012256836,0.0008778258,0.002797783,0.0008686723,0.0010818441,0.0004869458],"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.00095974543,0.00035503725,0.009995422,0.0007953257,0.00019618502,0.00066576945,0.0005819454,0.43537536,0.03797233,0.2317919,0.02913346,0.25217754],"study_design_scores_gemma":[0.000033531247,0.00015042331,0.0014607864,0.000041112897,0.00004218394,0.0003344003,0.00012597979,0.9199598,0.014050417,0.044822235,0.018946927,0.00003229676],"about_ca_topic_score_codex":0.004574989,"about_ca_topic_score_gemma":0.004562825,"teacher_disagreement_score":0.004574989,"about_ca_system_score_codex":0.0016592386,"about_ca_system_score_gemma":0.0012058733,"threshold_uncertainty_score":0.012038708},"labels":[],"label_agreement":null},{"id":"W2155829307","doi":"10.2139/ssrn.2225359","title":"Attention Allocation in Information-Rich Environments: The Case of News Aggregators","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"News aggregator; Computer science; Business; Internet privacy; World Wide Web","score_opus":0.004834346618029029,"score_gpt":0.19420608965945976,"score_spread":0.18937174304143073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155829307","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.85000676,0.0017224244,0.10483448,0.0065968554,0.00011110275,0.0001478686,0.00034585723,0.00049713894,0.035737608],"genre_scores_gemma":[0.9910767,0.00023927703,0.0054742415,0.000118208656,0.00006702034,0.00001960488,0.000055029617,0.000046823978,0.0029031308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971322,0.0013810004,0.000086277716,0.0004132138,0.00019269445,0.0007946263],"domain_scores_gemma":[0.9548926,0.0341471,0.0021209219,0.0032632318,0.0025055478,0.0030706387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055880565,0.0008856159,0.0023943947,0.0016756671,0.003131589,0.006021575,0.0033131596,0.005701805,0.0089744935],"category_scores_gemma":[0.033466175,0.0011851438,0.00075107475,0.0024690868,0.0026607027,0.008132913,0.0033709798,0.00247097,0.00097057136],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003595193,0.0017493253,0.05288706,0.0006469452,0.0006123428,0.013231102,0.012103239,0.3648849,0.009966176,0.41513228,0.028444638,0.09674672],"study_design_scores_gemma":[0.00022543957,0.00016751394,0.0070720515,0.00003938249,0.0002183775,0.0010249208,0.0032596404,0.80734766,0.0014665998,0.17525198,0.0038262007,0.00010029221],"about_ca_topic_score_codex":0.023786271,"about_ca_topic_score_gemma":0.016085764,"teacher_disagreement_score":0.023786271,"about_ca_system_score_codex":0.002508536,"about_ca_system_score_gemma":0.0013722185,"threshold_uncertainty_score":0.04729563},"labels":[],"label_agreement":null},{"id":"W2156095354","doi":"10.1109/lcn.2008.4664146","title":"Cooperative caching: The case for P2P traffic","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Byte; Computer network; Cache; The Internet; Distributed computing; Overhead (engineering); False sharing; Simple (philosophy); TRACE (psycholinguistics); Internet traffic; CPU cache; Cache algorithms; World Wide Web; Operating system","score_opus":0.04357907904306523,"score_gpt":0.2466289201068072,"score_spread":0.20304984106374196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156095354","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.63442665,0.002173911,0.32843956,0.0059065428,0.00015412543,0.00018703932,0.00015556613,0.00033454414,0.028222065],"genre_scores_gemma":[0.99188715,0.00022441501,0.006744413,0.00007742679,0.00006124367,0.000034698012,0.000017520037,0.000015377193,0.0009377407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539524,0.0017753112,0.00010479212,0.0006416428,0.0011006377,0.0009822575],"domain_scores_gemma":[0.9759846,0.016258996,0.0014324058,0.002784544,0.0027852904,0.0007540863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042108647,0.0010419645,0.0014067736,0.0009288622,0.0023580056,0.0038667838,0.002791686,0.006010728,0.0015980738],"category_scores_gemma":[0.02855923,0.0007026832,0.00088167924,0.0016082972,0.0029087744,0.008909636,0.001594026,0.0019232505,0.0003280184],"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.0006243778,0.00039166174,0.01575821,0.00028395795,0.00015964427,0.00425365,0.0016959269,0.5412213,0.010153358,0.38094077,0.0052359495,0.03928116],"study_design_scores_gemma":[0.00005705038,0.00016858698,0.0013087132,0.000032423908,0.00007006336,0.0014079892,0.00047726717,0.9202265,0.0017591559,0.07142094,0.0030288612,0.000042538803],"about_ca_topic_score_codex":0.008569314,"about_ca_topic_score_gemma":0.0057498426,"teacher_disagreement_score":0.008569314,"about_ca_system_score_codex":0.0027199427,"about_ca_system_score_gemma":0.0014065338,"threshold_uncertainty_score":0.022269428},"labels":[],"label_agreement":null},{"id":"W2156744675","doi":"","title":"A Load-balancing Scheme for Parallel Internet Forwarding Systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Load balancing (electrical power); The Internet; Scheduling (production processes); Network packet; Distributed computing; Computer network; Hash function; Parallel computing; Operating system; Computer security","score_opus":0.021026522659171612,"score_gpt":0.2334438801352951,"score_spread":0.2124173574761235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156744675","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.19181474,0.0002508963,0.80067194,0.00025865406,0.00009592917,0.00028755283,0.0000934496,0.0036921406,0.002834639],"genre_scores_gemma":[0.80038255,0.00010412904,0.19642638,0.00007606468,0.000085603984,0.00015310898,0.00012141338,0.00010612327,0.002544606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948394,0.000096440046,0.000049760063,0.00008993351,0.00021106792,0.000068808185],"domain_scores_gemma":[0.99828714,0.00032181363,0.0001669837,0.0005885545,0.00048175926,0.00015381117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012199375,0.00045274248,0.00052526104,0.0008691852,0.0013775005,0.0007339085,0.0014390012,0.0004899785,0.001562333],"category_scores_gemma":[0.0028380477,0.0002957805,0.00019672548,0.0006567492,0.00059666566,0.0014306545,0.0010764089,0.00046506384,0.00046362818],"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.0012091324,0.00071570737,0.0057791932,0.0001443638,0.00010893878,0.00037694848,0.00078897754,0.20803098,0.20956148,0.036221378,0.00788209,0.5291808],"study_design_scores_gemma":[0.000120080076,0.00023503855,0.0010168423,0.000009261267,0.000047177156,0.0002550256,0.000063650696,0.9417036,0.032854803,0.017097551,0.006554036,0.00004292073],"about_ca_topic_score_codex":0.0016186739,"about_ca_topic_score_gemma":0.0019300735,"teacher_disagreement_score":0.0016186739,"about_ca_system_score_codex":0.0012382717,"about_ca_system_score_gemma":0.0010819013,"threshold_uncertainty_score":0.008984327},"labels":[],"label_agreement":null},{"id":"W2157437781","doi":"10.1109/cicc.2005.1568682","title":"Using cache to reduce power in content-addressable memories (CAMs)","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"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; CMC Microsystems","keywords":"Cache; Computer science; Smart Cache; Power (physics); Page cache; Embedded system; CPU cache; Computer hardware; Cache algorithms; Process (computing); Cache invalidation; Cache coloring; Operating system; Parallel computing","score_opus":0.08427477967495865,"score_gpt":0.27853357316313293,"score_spread":0.19425879348817426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157437781","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.6398057,0.012843558,0.31934568,0.0013390733,0.00040461894,0.00014845228,0.00037209166,0.0045163007,0.021224568],"genre_scores_gemma":[0.897113,0.0018803595,0.093595624,0.0005016532,0.00016813376,0.0000781738,0.00032816056,0.00013452112,0.0062004444],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999156,0.000009788687,0.000006608315,0.000014906419,0.000036638558,0.000016512875],"domain_scores_gemma":[0.99964,0.00013495696,0.00004742824,0.000051743053,0.0001119883,0.000013827437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011177113,0.00029009418,0.00026584222,0.00041146038,0.0003368648,0.0005416971,0.0014427663,0.00052436563,0.0022931853],"category_scores_gemma":[0.00051909353,0.00019023131,0.00023072638,0.0007243842,0.0002509704,0.0015250928,0.00034178622,0.00025061076,0.00054104923],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0005228319,0.00016601491,0.004644003,0.0007953083,0.0001335496,0.0010148849,0.00027064915,0.011858491,0.6143362,0.017282935,0.008628349,0.3403468],"study_design_scores_gemma":[0.00022988027,0.0018897132,0.003129477,0.00010212049,0.00045286384,0.002688748,0.00013172317,0.13323797,0.8043128,0.009073638,0.044678915,0.00007209255],"about_ca_topic_score_codex":0.0006400476,"about_ca_topic_score_gemma":0.0016536872,"teacher_disagreement_score":0.0022931853,"about_ca_system_score_codex":0.0002933183,"about_ca_system_score_gemma":0.00031956777,"threshold_uncertainty_score":0.007671535},"labels":[],"label_agreement":null},{"id":"W2157450304","doi":"10.1109/ccece.2004.1349717","title":"Evaluation of request distribution schemes for Web-server clusters","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Research Manitoba","funders":"","keywords":"Computer science; Throughput; Web server; Content distribution; Server; Cluster (spacecraft); Database; Distribution (mathematics); File server; Computer network; Operating system; The Internet; Mathematics","score_opus":0.04700622082489083,"score_gpt":0.2886653699713211,"score_spread":0.24165914914643025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157450304","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.9642241,0.0006149656,0.02967417,0.00018765162,0.00004141826,0.0003433397,0.00027373203,0.0015874315,0.0030532705],"genre_scores_gemma":[0.9842621,0.00013487398,0.01453557,0.000019325473,0.000014525148,0.000068167814,0.00021448411,0.00006664551,0.0006842806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99357045,0.0025864728,0.00045208132,0.00042749228,0.0023750954,0.0005883423],"domain_scores_gemma":[0.9835992,0.00898961,0.0008074404,0.0021401313,0.0037419682,0.00072173565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006275556,0.00090895727,0.0009311674,0.0018070034,0.0011581647,0.0012785882,0.0018625639,0.0008452366,0.0011147328],"category_scores_gemma":[0.015450897,0.0004002263,0.00028777393,0.0024353096,0.00059133203,0.0019585392,0.0008611374,0.00068186317,0.00029761123],"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.009937946,0.0025005073,0.02675619,0.0009588945,0.00045013256,0.00021833257,0.0006835645,0.6597794,0.08950471,0.0069108084,0.0043054763,0.19799401],"study_design_scores_gemma":[0.00026285267,0.0022822993,0.008647963,0.000016619184,0.00010739084,0.00016766063,0.00028735088,0.9291849,0.056379814,0.0010328919,0.001575379,0.000054805907],"about_ca_topic_score_codex":0.004898056,"about_ca_topic_score_gemma":0.0034902457,"teacher_disagreement_score":0.006275556,"about_ca_system_score_codex":0.0035984465,"about_ca_system_score_gemma":0.0014535756,"threshold_uncertainty_score":0.0331887},"labels":[],"label_agreement":null},{"id":"W2159414163","doi":"10.1109/anss-41.2008.22","title":"A Novel Optimized Caching Technique for Mobile Gnutella Based Network to Support Large-Scale Collaborative Virtual Environment","year":2008,"lang":"en","type":"article","venue":"Proceedings - Simulation Symposium/Proceedings of the ... annual Simulation Symposium","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Distributed computing; Mobile ad hoc network; Overlay network; Routing protocol; Virtual network; Routing (electronic design automation); World Wide Web; The Internet; Wireless","score_opus":0.01386288704651251,"score_gpt":0.24912950828069977,"score_spread":0.23526662123418726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159414163","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.07596574,0.0009667166,0.9168061,0.00026233747,0.000108763605,0.00016732755,0.000102896185,0.0025785377,0.0030416476],"genre_scores_gemma":[0.68487436,0.00040920076,0.31033453,0.00014373695,0.00006178349,0.00014567254,0.00020993977,0.00012125216,0.0036994673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951625,0.00014044205,0.000038811868,0.00008406003,0.0001501091,0.00007028551],"domain_scores_gemma":[0.99893135,0.00018204532,0.00012833027,0.00035019912,0.00034515554,0.000062896135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058935233,0.00055029395,0.0006221893,0.000807397,0.0010351036,0.0007295864,0.0015982669,0.0005813395,0.00057639007],"category_scores_gemma":[0.0017301759,0.00026444526,0.00036790787,0.00091152306,0.0004178241,0.0014469954,0.0007062898,0.00057331164,0.00028716712],"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.0008276783,0.0003436725,0.0070497086,0.00042709144,0.00042701792,0.00088055496,0.000738535,0.27128348,0.3117457,0.047925584,0.0131565295,0.3451944],"study_design_scores_gemma":[0.00005447089,0.00032099095,0.0017432132,0.000023970084,0.00017173479,0.0010851918,0.0001386788,0.9139349,0.06382529,0.00385344,0.014750032,0.00009800572],"about_ca_topic_score_codex":0.0056380793,"about_ca_topic_score_gemma":0.009094241,"teacher_disagreement_score":0.0056380793,"about_ca_system_score_codex":0.0011002519,"about_ca_system_score_gemma":0.0010049911,"threshold_uncertainty_score":0.011210561},"labels":[],"label_agreement":null},{"id":"W2159682405","doi":"10.1109/glocom.2011.6134134","title":"SHARP: A Scalable Framework for Dynamic Joint Replica Placement and Request Routing Scheduling","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"McGill University","funders":"","keywords":"Replica; Scalability; Computer science; Scheduling (production processes); Distributed computing; Routing (electronic design automation); Dynamic priority scheduling; Processor scheduling; Computer network; Topology (electrical circuits); Mathematical optimization; Engineering; Resource (disambiguation); Database; Quality of service; Mathematics","score_opus":0.05296694082498963,"score_gpt":0.26069597507144465,"score_spread":0.20772903424645503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159682405","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.0008736353,0.00007963831,0.99701726,0.00007041434,0.000032361244,0.00007080678,0.0000556488,0.0009257935,0.0008744505],"genre_scores_gemma":[0.124803565,0.00034521442,0.8710474,0.000113736816,0.00013642339,0.0005333095,0.00038305725,0.00052940805,0.0021078822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760544,0.00079179683,0.00013015272,0.00030780848,0.00090857205,0.00025621292],"domain_scores_gemma":[0.99816823,0.000752825,0.00015831049,0.00047543788,0.00028159254,0.0001636328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039435895,0.0012810078,0.0013248009,0.0008000748,0.0008637938,0.0018073759,0.0040332708,0.0010607344,0.0047747735],"category_scores_gemma":[0.005396596,0.00082745956,0.0011796785,0.0012243493,0.0009816614,0.0025648763,0.0030778546,0.0023705494,0.0015456202],"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.0001478778,0.000116966025,0.00028775024,0.00016541261,0.00007704162,0.00013354704,0.00010625793,0.76240134,0.00563335,0.13035907,0.011236933,0.08933448],"study_design_scores_gemma":[0.000027069795,0.000022896647,0.000027998874,0.0000057877055,0.000009589514,0.000022115964,0.000011805466,0.9788669,0.0006940089,0.016540945,0.0037590577,0.000011879168],"about_ca_topic_score_codex":0.005109752,"about_ca_topic_score_gemma":0.007833788,"teacher_disagreement_score":0.005109752,"about_ca_system_score_codex":0.0017490442,"about_ca_system_score_gemma":0.0035584301,"threshold_uncertainty_score":0.020855963},"labels":[],"label_agreement":null},{"id":"W2160735241","doi":"10.1145/1165573.1165634","title":"L-CBF","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"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; Semiconductor Research Corporation","keywords":"Computer science; Parallel computing; Latency (audio); Static random-access memory; Energy (signal processing); Computer hardware; Arithmetic; Mathematics; Telecommunications; Statistics","score_opus":0.005084263126406267,"score_gpt":0.168527571286053,"score_spread":0.16344330815964672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160735241","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87967455,0.0008562234,0.09482292,0.0003178381,0.00008086608,0.000106371095,0.0011192271,0.0063231513,0.016698835],"genre_scores_gemma":[0.94857854,0.0001642655,0.046031047,0.0001251782,0.000014459506,0.000050333474,0.0005972114,0.00014876894,0.0042902227],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952006,0.00004819655,0.000023726938,0.000089941044,0.00015497352,0.00016307994],"domain_scores_gemma":[0.9980373,0.00074056885,0.0003221912,0.00028594525,0.0005489068,0.00006508041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036385914,0.0003593022,0.0003015691,0.0005259928,0.00027717662,0.000546953,0.0013065421,0.0004072139,0.0056437124],"category_scores_gemma":[0.002195672,0.0001712027,0.00019499657,0.0008872684,0.0002353195,0.0012237144,0.00025362577,0.00024290285,0.00071027124],"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.0029072186,0.00053090364,0.021644723,0.0009004847,0.00020040611,0.00060257677,0.00035137363,0.16208307,0.34074646,0.019419266,0.02735284,0.4232606],"study_design_scores_gemma":[0.00028156792,0.0028612982,0.010626259,0.00005088746,0.00014295675,0.0011197756,0.00025093782,0.59982055,0.35714465,0.0049898163,0.022609357,0.00010198337],"about_ca_topic_score_codex":0.007826656,"about_ca_topic_score_gemma":0.011392908,"teacher_disagreement_score":0.007826656,"about_ca_system_score_codex":0.0012299083,"about_ca_system_score_gemma":0.0012532347,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2161496364","doi":"10.1109/iscc.2002.1021681","title":"Performance comparison of alternative Web caching techniques","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Server; Computer network; Smart Cache; Scalability; False sharing; Web server; Distributed computing; Cache algorithms; Operating system; CPU cache; The Internet","score_opus":0.02810103785964782,"score_gpt":0.27528723121954424,"score_spread":0.24718619335989642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161496364","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.96469706,0.004994816,0.021766884,0.00018713535,0.00006555388,0.00011952199,0.00034085798,0.0023338508,0.005494324],"genre_scores_gemma":[0.9848668,0.0007568087,0.0131597305,0.000039278424,0.000028249102,0.000038879025,0.00028228865,0.00006694962,0.0007609948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957996,0.0011221413,0.0003973659,0.00030877462,0.0017741678,0.0005979185],"domain_scores_gemma":[0.98734725,0.0067056958,0.0007840073,0.0012419713,0.003427996,0.00049301295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023970627,0.0008353247,0.0014677556,0.0028459462,0.00094135135,0.0016836702,0.0018923698,0.0015173734,0.0012315459],"category_scores_gemma":[0.00956743,0.0004046138,0.000641824,0.002873036,0.000528968,0.0020511446,0.0007377069,0.0005017304,0.00029948584],"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.021728188,0.0022312049,0.06998965,0.0023630955,0.0014718131,0.001228426,0.0009724882,0.33587158,0.13811035,0.013348981,0.0072349138,0.4054493],"study_design_scores_gemma":[0.0005033095,0.0024193705,0.0147128515,0.00008068126,0.00044270122,0.0009417302,0.00026618075,0.9225117,0.053630404,0.0015032603,0.0028463511,0.00014151039],"about_ca_topic_score_codex":0.008336538,"about_ca_topic_score_gemma":0.007382911,"teacher_disagreement_score":0.008336538,"about_ca_system_score_codex":0.0020400719,"about_ca_system_score_gemma":0.0011468967,"threshold_uncertainty_score":0.016576052},"labels":[],"label_agreement":null},{"id":"W2161918273","doi":"10.1109/icdcs.2011.74","title":"Cloud4Home -- Enhancing Data Services with @Home Clouds","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"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":"Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Cloud computing; Virtualization; Computer network; Data center; Data access; The Internet; Server; Residential gateway; WebRTC; x86; Computer security; Operating system; Database","score_opus":0.04654696713133803,"score_gpt":0.2199109487159361,"score_spread":0.1733639815845981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161918273","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.73085964,0.0011286889,0.15684138,0.0018692586,0.0003333496,0.0009121766,0.00095124886,0.032626085,0.07447817],"genre_scores_gemma":[0.94434166,0.00029936756,0.048527103,0.00026960496,0.000042140702,0.000053116724,0.0006462487,0.00059877685,0.005222007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989164,0.00022965991,0.00003776252,0.000072339964,0.00040047173,0.00034336816],"domain_scores_gemma":[0.9986965,0.00016989368,0.000079094454,0.0004545524,0.00038717754,0.00021285597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089689955,0.0004786763,0.00041347963,0.0004179464,0.0008899104,0.0018542153,0.0016329647,0.000639242,0.0039274152],"category_scores_gemma":[0.0018529395,0.0002619739,0.0003982197,0.0010623493,0.00058495754,0.002634241,0.0021058996,0.00079479744,0.0008333323],"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.0051085157,0.0032395395,0.02798543,0.00092007447,0.0002750637,0.0024057021,0.0011599306,0.16980761,0.15998967,0.07077221,0.10659626,0.45173997],"study_design_scores_gemma":[0.00052323064,0.0013063906,0.013119131,0.000072296956,0.000119192526,0.0012485703,0.00068510283,0.7108745,0.14862004,0.009917656,0.11338175,0.00013206805],"about_ca_topic_score_codex":0.014353846,"about_ca_topic_score_gemma":0.011413727,"teacher_disagreement_score":0.014353846,"about_ca_system_score_codex":0.0011119838,"about_ca_system_score_gemma":0.0014291343,"threshold_uncertainty_score":0.028540611},"labels":[],"label_agreement":null},{"id":"W2161952428","doi":"10.1109/lcn.2001.990791","title":"Transparent distributed Web caching","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Server; Smart Cache; Computer network; Workload; Web server; Distributed computing; False sharing; Cache invalidation; Scheme (mathematics); Layer (electronics); Operating system; CPU cache; Cache algorithms; The Internet","score_opus":0.046387964771875664,"score_gpt":0.22041434988145656,"score_spread":0.1740263851095809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161952428","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.18261628,0.0017011199,0.75790584,0.0004120471,0.00028213777,0.00035311273,0.0003693151,0.0109925615,0.045367546],"genre_scores_gemma":[0.9267132,0.00042473743,0.064595066,0.00018886491,0.00008801532,0.000084726045,0.00030779745,0.00010412123,0.0074933236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990061,0.00017151005,0.00006370218,0.00011843841,0.00045265074,0.0001876544],"domain_scores_gemma":[0.99854505,0.00020881044,0.00014079241,0.00066472555,0.00033308388,0.00010759367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062189525,0.00032463108,0.00044667925,0.00052640354,0.00058971136,0.0015711181,0.00118703,0.0004952557,0.0016815268],"category_scores_gemma":[0.0016558196,0.0002547236,0.0005390055,0.00065070577,0.00048328255,0.0011210878,0.0013396434,0.00073874916,0.00055058196],"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.001363112,0.0006179084,0.007853082,0.0007472821,0.00031001068,0.0009792935,0.00058258197,0.12096002,0.20672712,0.117976986,0.025093492,0.516789],"study_design_scores_gemma":[0.00021617864,0.00032734868,0.004460401,0.00006368296,0.00016821388,0.0010534324,0.00012564898,0.8433615,0.06860525,0.036934882,0.04456354,0.00011985414],"about_ca_topic_score_codex":0.0025880975,"about_ca_topic_score_gemma":0.0022116632,"teacher_disagreement_score":0.0025880975,"about_ca_system_score_codex":0.0008264364,"about_ca_system_score_gemma":0.0012341253,"threshold_uncertainty_score":0.0059962273},"labels":[],"label_agreement":null},{"id":"W2162079228","doi":"10.1109/cec.2006.1688493","title":"An Evolutionary Approach to Optimal Web Proxy Cache Placement","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Proxy (statistics); Evolutionary programming; Network packet; Evolutionary algorithm; Genetic programming; Distributed computing; Evolutionary computation; Cache algorithms; CPU cache; Parallel computing; Computer network; Artificial intelligence; Machine learning","score_opus":0.013217614411125433,"score_gpt":0.21828664213682214,"score_spread":0.2050690277256967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162079228","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.038663074,0.0005091592,0.9522862,0.00051885983,0.000059645525,0.000044292123,0.00003486134,0.000068870926,0.007815043],"genre_scores_gemma":[0.64251506,0.0010089037,0.34938276,0.00023126534,0.00009934596,0.00019229519,0.000093035516,0.00005532838,0.0064220377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995902,0.00018221578,0.000012507304,0.00005076489,0.00011555154,0.00004872217],"domain_scores_gemma":[0.99916255,0.00057811727,0.00006128961,0.000030864354,0.00012751456,0.000039613984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000837797,0.0005174921,0.00061012665,0.00062942377,0.00044720352,0.00069446996,0.00084476115,0.0012077005,0.0019286649],"category_scores_gemma":[0.0034665552,0.0003824501,0.0004669698,0.00063042244,0.00089119887,0.0007521681,0.0006166841,0.0007826601,0.00014247668],"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.000009430866,0.000019445397,0.00024505763,0.000022170792,0.000016238113,0.000036575708,0.000024606898,0.9695524,0.0005029908,0.018307798,0.0002552876,0.011007997],"study_design_scores_gemma":[0.0000076124065,0.00001578802,0.000080882506,0.0000041912876,0.0000050616163,0.000017668866,0.000010279292,0.9920657,0.00013438797,0.0070029967,0.0006521107,0.0000033372644],"about_ca_topic_score_codex":0.002806669,"about_ca_topic_score_gemma":0.0019553395,"teacher_disagreement_score":0.002806669,"about_ca_system_score_codex":0.0009482851,"about_ca_system_score_gemma":0.0008617333,"threshold_uncertainty_score":0.0068802834},"labels":[],"label_agreement":null},{"id":"W2162658475","doi":"10.1109/glocom.2007.54","title":"Bandwidth Landmarking: A Scalable Bandwidth Prediction Mechanism for Distributed Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"PlanetLab; Computer science; Bandwidth (computing); Scalability; Dynamic bandwidth allocation; Bandwidth allocation; Inference; Distributed computing; Computer network; Artificial intelligence; Operating system","score_opus":0.016133832003099778,"score_gpt":0.22033435198974824,"score_spread":0.20420051998664845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162658475","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.01935251,0.00042284644,0.96335334,0.00028795048,0.00012555007,0.00010546334,0.00018911717,0.015058195,0.0011051041],"genre_scores_gemma":[0.6708682,0.00044195494,0.32470205,0.00017750966,0.0002993133,0.00021329783,0.00062718807,0.0005958022,0.0020746554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843735,0.00026550013,0.00011983966,0.00029436796,0.0007267426,0.00015619234],"domain_scores_gemma":[0.99450374,0.0019811885,0.0007642104,0.0018805787,0.0006222112,0.00024811554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033630307,0.00077785767,0.0011333461,0.001916824,0.0011686154,0.0017101861,0.004756563,0.0012192816,0.0023435426],"category_scores_gemma":[0.00836162,0.0006576317,0.00044230535,0.0014706181,0.00095501094,0.005710397,0.0022652068,0.0023230608,0.0006548588],"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.001370802,0.00059388345,0.010512029,0.0004324296,0.00031350064,0.00040228144,0.00069723243,0.17650357,0.04337476,0.0629715,0.02128658,0.6815415],"study_design_scores_gemma":[0.00012108506,0.00017042589,0.0013165958,0.000039402516,0.00010696596,0.00019683981,0.00005201043,0.9365014,0.026155552,0.022242526,0.012969733,0.00012748069],"about_ca_topic_score_codex":0.0035892888,"about_ca_topic_score_gemma":0.0026114949,"teacher_disagreement_score":0.004756563,"about_ca_system_score_codex":0.000965871,"about_ca_system_score_gemma":0.0013772674,"threshold_uncertainty_score":0.017785609},"labels":[],"label_agreement":null},{"id":"W2162828436","doi":"10.1109/imtc.2008.4547105","title":"QoS-Aware Service Selection for Multimedia Transcoding","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Transcoding; Computer science; Quality of service; Selection (genetic algorithm); Multimedia; Service (business); Path (computing); Mobile QoS; Computer network; Routing (electronic design automation); Ant colony optimization algorithms; Selection algorithm; Distributed computing; Service provider; Artificial intelligence","score_opus":0.04697169146902461,"score_gpt":0.2373170735039761,"score_spread":0.1903453820349515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162828436","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.17877921,0.0016751959,0.8105576,0.0004061892,0.0001867575,0.00016259232,0.00004860148,0.0012278925,0.0069559673],"genre_scores_gemma":[0.85120714,0.0005344947,0.14537674,0.00009665217,0.000072740826,0.000044640627,0.00008960681,0.00008337296,0.0024946379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957055,0.000108001535,0.000024435745,0.000057742054,0.00020593424,0.00003341812],"domain_scores_gemma":[0.99936944,0.00019694697,0.00005659078,0.00007560163,0.00025269686,0.00004879156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043193446,0.0003586518,0.0004286344,0.00047730646,0.00046923922,0.00058630086,0.000502609,0.00043369102,0.000790943],"category_scores_gemma":[0.0016373876,0.00012961142,0.00026044578,0.0003902661,0.00026506648,0.0005750651,0.00030461184,0.0004899225,0.00032787205],"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.0006188793,0.00025482322,0.0044641932,0.00022236764,0.00008644083,0.0008870969,0.0003201972,0.0884292,0.3819423,0.013102919,0.003832306,0.50583917],"study_design_scores_gemma":[0.000037918748,0.00025260262,0.0018655632,0.000016602784,0.000050168157,0.0009657291,0.00009379111,0.92257196,0.060683455,0.0057314495,0.0076929983,0.00003772646],"about_ca_topic_score_codex":0.0012167854,"about_ca_topic_score_gemma":0.0014915088,"teacher_disagreement_score":0.0012167854,"about_ca_system_score_codex":0.00034589035,"about_ca_system_score_gemma":0.00034298352,"threshold_uncertainty_score":0.002646029},"labels":[],"label_agreement":null},{"id":"W2163160678","doi":"10.1109/icps.2004.16","title":"Hybrid cache invalidation schemes in mobile environments","year":2004,"lang":"en","type":"article","venue":"International Conference on Pervasive Services","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cache; Cache invalidation; Stateless protocol; Stateful firewall; Computer network; Cache algorithms; Broadcasting (networking); Smart Cache; Page cache; CPU cache; Network packet","score_opus":0.02810207447982097,"score_gpt":0.26497486962772043,"score_spread":0.23687279514789947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163160678","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.40567943,0.003530393,0.5802412,0.0004443073,0.00013515167,0.0002754416,0.00024006075,0.0047151837,0.004738772],"genre_scores_gemma":[0.94610727,0.00029437902,0.0519034,0.00009045759,0.000052566767,0.00009251773,0.00016604063,0.000059199596,0.0012341528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973189,0.0008726487,0.0002680217,0.00021485252,0.00092424144,0.0004013981],"domain_scores_gemma":[0.9889075,0.0031818645,0.0013816087,0.003968122,0.002174134,0.00038664375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00233273,0.00066545553,0.0010333079,0.00126512,0.0013295138,0.0014972542,0.0027144887,0.0013467701,0.0006809715],"category_scores_gemma":[0.0075182235,0.0005418035,0.00041187226,0.0021008023,0.00107923,0.0028396551,0.002017359,0.0008607391,0.00032926287],"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.0037223292,0.0006635251,0.019738045,0.00071453245,0.00050087954,0.001883328,0.0022896177,0.40556514,0.0976669,0.053786203,0.008609521,0.40486],"study_design_scores_gemma":[0.0003411623,0.0008495924,0.0025208998,0.0000492557,0.00019007693,0.0013984853,0.00032466705,0.9229864,0.035431907,0.023382237,0.012367375,0.00015806862],"about_ca_topic_score_codex":0.003506908,"about_ca_topic_score_gemma":0.0031367377,"teacher_disagreement_score":0.003506908,"about_ca_system_score_codex":0.0011508759,"about_ca_system_score_gemma":0.0009516167,"threshold_uncertainty_score":0.012336791},"labels":[],"label_agreement":null},{"id":"W2163986171","doi":"10.1109/mascot.2001.948890","title":"Simulation evaluation of a heterogeneous Web proxy caching hierarchy","year":2002,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":37,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Proxy (statistics); Hierarchy; Workload; CPU cache; Memory hierarchy; Cache algorithms; Distributed computing; Database; Parallel computing; Operating system; Machine learning","score_opus":0.06690183074936287,"score_gpt":0.2830888734879714,"score_spread":0.21618704273860853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163986171","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.99205786,0.000053959877,0.0062897163,0.00007186226,0.000009056736,0.000034697467,0.00009390106,0.0000993044,0.0012896087],"genre_scores_gemma":[0.99739,0.00003438954,0.0022250563,0.000015324727,0.000001905216,0.000018692277,0.000100617726,0.000006640776,0.00020741842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943334,0.00022981908,0.000030685034,0.00005585818,0.00013482694,0.00011539994],"domain_scores_gemma":[0.9970956,0.0018157911,0.00020246454,0.00022736126,0.0004407948,0.00021807702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010356851,0.00046655332,0.0005694474,0.000593371,0.00044334715,0.00063439657,0.0009981575,0.0008348679,0.00060951663],"category_scores_gemma":[0.0036490161,0.00024244611,0.0003573399,0.0006353674,0.00059898355,0.0007483153,0.00047264868,0.0006608341,0.000078932964],"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.00024423408,0.00028535345,0.0046479483,0.000036878017,0.000033350465,0.00011311566,0.00009116887,0.98504156,0.0052284305,0.0012145839,0.0001778385,0.002885484],"study_design_scores_gemma":[0.000027669768,0.00011770709,0.0005398138,0.0000025003044,0.0000063768166,0.000012255853,0.000028912616,0.9971198,0.0018697008,0.00018273301,0.000087035536,0.0000054660863],"about_ca_topic_score_codex":0.013777833,"about_ca_topic_score_gemma":0.0059945793,"teacher_disagreement_score":0.013777833,"about_ca_system_score_codex":0.0014359376,"about_ca_system_score_gemma":0.0008358525,"threshold_uncertainty_score":0.027395248},"labels":[],"label_agreement":null},{"id":"W2165019678","doi":"10.1109/tpds.2010.28","title":"FS2You: Peer-Assisted Semipersistent Online Hosting at a Large Scale","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Upload; Bandwidth (computing); The Internet; Cloud computing; World Wide Web; SSH File Transfer Protocol; Software deployment; Peer-to-peer; BitTorrent; File server; File system; Self-certifying File System; Operating system; Computer network","score_opus":0.01937592325358305,"score_gpt":0.23531616155904106,"score_spread":0.215940238305458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165019678","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.41334793,0.00048360662,0.4842692,0.00039316263,0.00030666147,0.001237687,0.0005080605,0.08830503,0.01114871],"genre_scores_gemma":[0.91997683,0.00010183543,0.073705286,0.00014808492,0.0000665309,0.00027610554,0.0005344499,0.0005617618,0.0046290243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987993,0.00024244713,0.000065810535,0.00025944333,0.00042800745,0.00020494575],"domain_scores_gemma":[0.9952199,0.0010305878,0.00042377406,0.0020914883,0.0005893476,0.00064481166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475981,0.0006957398,0.00056420104,0.00065585005,0.0007590164,0.0008954266,0.003090491,0.0008203623,0.0035381871],"category_scores_gemma":[0.004307097,0.00034071459,0.0002908799,0.00036232488,0.0009269874,0.0029278914,0.003225782,0.0009975634,0.00093456],"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.0039947974,0.0020966954,0.020782797,0.0010526781,0.00039948866,0.0034505816,0.0030630429,0.1093005,0.28446233,0.024384655,0.064302914,0.48270953],"study_design_scores_gemma":[0.0005316512,0.0032456056,0.015545559,0.00008189153,0.00014832799,0.0020538797,0.0009144207,0.80130744,0.10432064,0.009756305,0.06180012,0.00029418783],"about_ca_topic_score_codex":0.0015572299,"about_ca_topic_score_gemma":0.0015180461,"teacher_disagreement_score":0.0035381871,"about_ca_system_score_codex":0.00047754357,"about_ca_system_score_gemma":0.00065263116,"threshold_uncertainty_score":0.01183641},"labels":[],"label_agreement":null},{"id":"W2165414384","doi":"10.1109/glocom.2010.5683935","title":"The Benefits of Network Coding in Distributed Caching in Large-Scale P2P-VoD Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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":"University of Toronto","keywords":"Computer science; Linear network coding; Server; Distributed computing; Coding (social sciences); Bandwidth (computing); Computer network; Distributed data store; Peer-to-peer","score_opus":0.010560057804832547,"score_gpt":0.21161120929656396,"score_spread":0.20105115149173142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165414384","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.20370874,0.0012442226,0.7842977,0.0009202477,0.000049942973,0.00006549996,0.0000502889,0.00015787665,0.009505436],"genre_scores_gemma":[0.9808506,0.0003981636,0.018017815,0.00003567281,0.000016872804,0.000028822953,0.000011796381,0.000013422107,0.0006267877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934345,0.00028730257,0.000017627246,0.000051715717,0.00020540148,0.000094539435],"domain_scores_gemma":[0.99291563,0.0057945168,0.00035392994,0.00027972367,0.0005472228,0.000109001354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014628398,0.0004238589,0.00043710705,0.000456347,0.00059906376,0.0010692277,0.0008985389,0.00085263693,0.0005131884],"category_scores_gemma":[0.010324971,0.00027069665,0.00025742553,0.0007118369,0.0015016977,0.0022975917,0.00075927575,0.0008795006,0.00006855747],"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.00006336565,0.00006208366,0.0011325722,0.00007964443,0.000014296545,0.00017127892,0.00010635763,0.85993814,0.003677204,0.12002048,0.0005024661,0.014232135],"study_design_scores_gemma":[0.0000053284048,0.000018712606,0.00023258572,0.000007156353,0.000006122852,0.000051652183,0.000034785313,0.9820456,0.0007303303,0.016664881,0.00019642958,0.0000064681058],"about_ca_topic_score_codex":0.0039643897,"about_ca_topic_score_gemma":0.004423281,"teacher_disagreement_score":0.0039643897,"about_ca_system_score_codex":0.0015625436,"about_ca_system_score_gemma":0.0010582478,"threshold_uncertainty_score":0.011337161},"labels":[],"label_agreement":null},{"id":"W2166585241","doi":"10.1109/tvlsi.2008.2000244","title":"L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"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":"Bloom filter; Computer science; Energy (signal processing); Set (abstract data type); Parallel computing; Filter (signal processing); Power (physics); Computer hardware; Detector; Real-time computing; Electronic engineering; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.012016306681681719,"score_gpt":0.209290464734775,"score_spread":0.19727415805309328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166585241","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.07232141,0.0009952277,0.9114461,0.00046219598,0.0000805787,0.00014176435,0.00035075453,0.008071453,0.00613052],"genre_scores_gemma":[0.5772683,0.00047921544,0.4151424,0.00041594595,0.00005527465,0.00012230352,0.00037963616,0.00015495507,0.005982041],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999708,0.000053846576,0.000018036482,0.00005411752,0.00011851801,0.00004751454],"domain_scores_gemma":[0.9991467,0.00025492403,0.0001363342,0.00016018108,0.00025887482,0.000042936663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012938,0.00032884342,0.00037489334,0.0010524743,0.00059717795,0.00075201655,0.0017930568,0.0006462837,0.0028827419],"category_scores_gemma":[0.0014210186,0.00022542581,0.00023138354,0.00086154527,0.00042779086,0.0015442623,0.00035515273,0.0004007805,0.0006749256],"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.00118772,0.00020053714,0.0075234,0.0003931538,0.00009353347,0.00025200675,0.0002929397,0.06631847,0.1552797,0.048898403,0.01820783,0.70135236],"study_design_scores_gemma":[0.00022932421,0.0009317848,0.0024537793,0.0000763999,0.00009918263,0.00092416606,0.00011041622,0.77588904,0.14848608,0.016244443,0.054418277,0.00013717428],"about_ca_topic_score_codex":0.0086443415,"about_ca_topic_score_gemma":0.014873211,"teacher_disagreement_score":0.0086443415,"about_ca_system_score_codex":0.0016944024,"about_ca_system_score_gemma":0.0019579309,"threshold_uncertainty_score":0.017188072},"labels":[],"label_agreement":null},{"id":"W2167124731","doi":"10.1109/pccc.2004.1395006","title":"Differentiated caching of dynamic content using effective page classification","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Dynamic web page; Server; Web page; Web server; Cache; Static web page; Scalability; Proxy server; Computer network; Database; Operating system; World Wide Web; The Internet","score_opus":0.09508429031117291,"score_gpt":0.3267462558231591,"score_spread":0.23166196551198617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167124731","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.33597252,0.0020837435,0.6465149,0.00031951966,0.00018992578,0.00027079807,0.00019521211,0.0074585653,0.0069948896],"genre_scores_gemma":[0.8128637,0.00040754472,0.18262278,0.00011028869,0.000091756876,0.0000785223,0.00035340615,0.00012336102,0.003348705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.00022153751,0.00009184116,0.0001338702,0.00038213984,0.00015199602],"domain_scores_gemma":[0.9940515,0.0012873252,0.00046544752,0.0023010063,0.0015472975,0.0003474656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008902849,0.00056435534,0.0013397187,0.0021361592,0.0007981372,0.0021023033,0.0014942994,0.0007409027,0.0007964073],"category_scores_gemma":[0.0051038945,0.00036494265,0.00038971307,0.0025052868,0.0006198381,0.0029232593,0.0009004428,0.0006901303,0.0005194368],"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.0010950008,0.0006385478,0.01576031,0.00018546656,0.00009904567,0.00035570565,0.00037668447,0.049941342,0.07032269,0.016314967,0.0057124565,0.83919775],"study_design_scores_gemma":[0.00013847843,0.0005055471,0.0058008484,0.000030350793,0.00014361339,0.0008183886,0.00008844862,0.91036034,0.05739854,0.0135351755,0.011067403,0.00011287652],"about_ca_topic_score_codex":0.0042855316,"about_ca_topic_score_gemma":0.0057986462,"teacher_disagreement_score":0.0042855316,"about_ca_system_score_codex":0.0010197777,"about_ca_system_score_gemma":0.0011101775,"threshold_uncertainty_score":0.008521199},"labels":[],"label_agreement":null},{"id":"W2167577660","doi":"10.1109/ntms.2011.5720586","title":"Active ISP Involvement in Content-Centric Future Internet","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"The Internet; Scalability; Computer science; Architecture; Node (physics); Enhanced Data Rates for GSM Evolution; Content delivery; Computer network; World Wide Web; Content centric networking; Internet service provider; Internet hosting service; Service (business); Internet privacy; Business; Telecommunications; Database; Engineering; Marketing","score_opus":0.05967781698959137,"score_gpt":0.2121644782175128,"score_spread":0.15248666122792143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167577660","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.46380508,0.0019499572,0.09734051,0.020383624,0.00023006689,0.000081911545,0.000053837633,0.00026144713,0.41589355],"genre_scores_gemma":[0.98397464,0.0007245367,0.0063349875,0.0002989648,0.00008006112,0.00001828057,0.000019381298,0.00001327541,0.00853579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985592,0.00079358654,0.000027100386,0.000108481276,0.00030791413,0.00020367221],"domain_scores_gemma":[0.9971642,0.0008459775,0.0004599217,0.00034428775,0.00070507,0.00048058902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028352502,0.0001587721,0.00011693673,0.00030553676,0.0016165306,0.0036992182,0.0005449823,0.001539018,0.0021655036],"category_scores_gemma":[0.004077013,0.00023701887,0.00012900848,0.0005939677,0.001341754,0.0049453876,0.0013481876,0.0011094338,0.00027592867],"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.000050354236,0.00010147535,0.012769454,0.000049842118,0.000012500818,0.00078506337,0.0048195524,0.0037990457,0.0027348446,0.9303178,0.0053940616,0.039166033],"study_design_scores_gemma":[0.00005392327,0.0002926976,0.0160885,0.00026975703,0.00014219809,0.002844059,0.017124796,0.06708786,0.006286103,0.43473133,0.4550146,0.000064183114],"about_ca_topic_score_codex":0.0016153204,"about_ca_topic_score_gemma":0.002589192,"teacher_disagreement_score":0.0036992182,"about_ca_system_score_codex":0.001395309,"about_ca_system_score_gemma":0.0016092989,"threshold_uncertainty_score":0.014994383},"labels":[],"label_agreement":null},{"id":"W2170123632","doi":"10.1109/tc.2013.111","title":"Data Similarity-Aware Computation Infrastructure for the Cloud","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cache; Cloud computing; Scalability; Exploit; Locality; Cache algorithms; Distributed computing; Parallel computing; Database; CPU cache; Operating system","score_opus":0.03791889465467431,"score_gpt":0.2611096420787313,"score_spread":0.22319074742405698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170123632","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.093679026,0.0016525389,0.8898858,0.000994838,0.00016789476,0.00019747381,0.00029877148,0.0056613605,0.0074623767],"genre_scores_gemma":[0.72684145,0.00040740232,0.2699674,0.0001984217,0.00006278301,0.00009472423,0.00047985415,0.0000776766,0.0018701432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.00007466507,0.000034822464,0.000086141474,0.00023618402,0.00010162257],"domain_scores_gemma":[0.99903154,0.000098765595,0.000073051255,0.00041728016,0.00028761415,0.00009180453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037840533,0.0003392898,0.00053868577,0.0006361539,0.0010035593,0.0009021156,0.0020021992,0.00047312022,0.0019759752],"category_scores_gemma":[0.0014927705,0.00022225546,0.00046067705,0.0015935738,0.00038632186,0.0020564075,0.0018741017,0.00070646586,0.0005687472],"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.0010175119,0.000440875,0.008687203,0.0005416524,0.00020910907,0.0007019105,0.00034905598,0.19947526,0.120085314,0.12440874,0.042203426,0.50188005],"study_design_scores_gemma":[0.00005480042,0.00013847796,0.0015575697,0.00002135878,0.000049646966,0.00026778787,0.00009991902,0.92726403,0.030267997,0.023801273,0.01643475,0.00004247267],"about_ca_topic_score_codex":0.004960216,"about_ca_topic_score_gemma":0.006930682,"teacher_disagreement_score":0.004960216,"about_ca_system_score_codex":0.0015949203,"about_ca_system_score_gemma":0.0024906525,"threshold_uncertainty_score":0.011572003},"labels":[],"label_agreement":null},{"id":"W2170258443","doi":"10.5555/1283383.1283479","title":"Multiple choice tries and distributed hash tables","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"McGill University","funders":"","keywords":"Trie; Sorting; Hash function; Mathematics; String (physics); Simple (philosophy); Computation; Reduction (mathematics); Combinatorics; Discrete mathematics; Binary logarithm; Hash table; Greedy algorithm; Computer science; Data structure; Algorithm","score_opus":0.01614489138482636,"score_gpt":0.22658164082272947,"score_spread":0.2104367494379031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170258443","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.06849262,0.0028918227,0.91333413,0.00048570777,0.00011021701,0.00017453232,0.0003337092,0.0011094167,0.01306783],"genre_scores_gemma":[0.7341164,0.0023973484,0.24889563,0.00025023049,0.00023356591,0.000530364,0.00059021177,0.00027532942,0.012710953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777067,0.00075632473,0.0001013657,0.00032433867,0.00069651316,0.0003508098],"domain_scores_gemma":[0.99543023,0.0028809179,0.00037249413,0.00079057156,0.00036563518,0.00016022423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002140523,0.00065919576,0.0009433203,0.0011423064,0.0007643339,0.0020265672,0.001722073,0.0010356688,0.0064379866],"category_scores_gemma":[0.0072835176,0.0005673233,0.00058109197,0.0028260574,0.001938633,0.0048380024,0.0022525385,0.0011728795,0.0016893044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00067786186,0.00007541016,0.0018773302,0.00033114478,0.00007445559,0.00029905728,0.0003035264,0.21517916,0.0064161536,0.6805488,0.0042279065,0.0899892],"study_design_scores_gemma":[0.00018131897,0.00028680987,0.00043472808,0.000066202294,0.00005613401,0.0006177354,0.0001389827,0.40762377,0.00840667,0.56366676,0.018465962,0.000054992077],"about_ca_topic_score_codex":0.00046546146,"about_ca_topic_score_gemma":0.00044634004,"teacher_disagreement_score":0.0064379866,"about_ca_system_score_codex":0.0010869018,"about_ca_system_score_gemma":0.00093744544,"threshold_uncertainty_score":0.021537185},"labels":[],"label_agreement":null},{"id":"W2170589921","doi":"10.1109/hicss.2015.635","title":"A Framework of Cooperative Cell Caching for the Future Mobile Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":40,"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 British Columbia","funders":"University of British Columbia","keywords":"Computer science; Backhaul (telecommunications); Computer network; Cellular network; Base station; Radio access network; Small cell; Mobile computing; Software deployment; Wireless network; Wireless; Distributed computing; Mobile station; Telecommunications","score_opus":0.019017240944308778,"score_gpt":0.2513123366356397,"score_spread":0.2322950956913309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170589921","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.019397873,0.0015983434,0.9602531,0.0012532687,0.00016116814,0.00011400523,0.00010389545,0.00021051725,0.016907837],"genre_scores_gemma":[0.74520504,0.0018956459,0.24216539,0.00032424324,0.0002571299,0.00044218695,0.00009897238,0.00006536561,0.009546108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993414,0.00031306484,0.000020700068,0.00008487998,0.00015822818,0.00008165912],"domain_scores_gemma":[0.99936026,0.00024417878,0.000051713378,0.00010599317,0.00015814819,0.00007979486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011893859,0.0004938038,0.00070780487,0.00048182238,0.0011784453,0.0017431232,0.0021258532,0.001837563,0.0019094852],"category_scores_gemma":[0.0018016968,0.0002827583,0.000580708,0.0008596175,0.0015946248,0.0018539221,0.0014747088,0.0010833704,0.00034837486],"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.000026271056,0.000043690226,0.00029462593,0.000037715014,0.000021778787,0.0002588423,0.0002460109,0.2591495,0.0022387898,0.7260317,0.002870254,0.008780782],"study_design_scores_gemma":[0.000017621183,0.000035524554,0.00009799752,0.000013397055,0.000014928572,0.00010518744,0.00006297403,0.91035116,0.0002853086,0.08242405,0.00657153,0.000020336438],"about_ca_topic_score_codex":0.0109371375,"about_ca_topic_score_gemma":0.0084396275,"teacher_disagreement_score":0.0109371375,"about_ca_system_score_codex":0.0021959394,"about_ca_system_score_gemma":0.0019334124,"threshold_uncertainty_score":0.021746933},"labels":[],"label_agreement":null},{"id":"W2170982022","doi":"10.1002/wcm.2376","title":"Replication schemes for peer-to-peer content in wireless mesh networks with infrastructure support","year":2013,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"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 British Columbia","funders":"University of British Columbia; King Abdulaziz City for Science and Technology","keywords":"Computer science; Peer-to-peer; Replication (statistics); Computer network; Wireless mesh network; Wireless; Wireless network; Distributed computing; Telecommunications","score_opus":0.025132173401979624,"score_gpt":0.26638954524483194,"score_spread":0.24125737184285231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170982022","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.024147173,0.0009858146,0.97139275,0.00020313772,0.00012472023,0.00034481447,0.00006951942,0.00052949385,0.0022025558],"genre_scores_gemma":[0.58114994,0.000714121,0.4139383,0.00008619148,0.00017782385,0.00049285457,0.00014717644,0.000106257634,0.0031873006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977786,0.0008316538,0.0002227913,0.0003772132,0.0005988092,0.00019103587],"domain_scores_gemma":[0.9944508,0.0023295106,0.00058415066,0.0014252138,0.0010243836,0.00018591722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029475624,0.00072529836,0.0014259631,0.0012275431,0.0016965485,0.0013501644,0.0041144034,0.0015155064,0.0018128097],"category_scores_gemma":[0.010966029,0.0005383372,0.00074541604,0.0014672141,0.001039324,0.0030324792,0.0022878577,0.0009093237,0.0006604553],"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.0006391573,0.00021016343,0.0013258395,0.0006460886,0.00018925985,0.0006151964,0.00085974805,0.55446476,0.03877623,0.13319916,0.0065905624,0.26248378],"study_design_scores_gemma":[0.00008271559,0.00021269667,0.00020927135,0.000028397932,0.0000505611,0.0002749097,0.00012141766,0.95859593,0.0052703414,0.029729102,0.005368455,0.000056251294],"about_ca_topic_score_codex":0.00181033,"about_ca_topic_score_gemma":0.001942279,"teacher_disagreement_score":0.0041144034,"about_ca_system_score_codex":0.0013320664,"about_ca_system_score_gemma":0.0011361939,"threshold_uncertainty_score":0.015588403},"labels":[],"label_agreement":null},{"id":"W2171045163","doi":"10.1145/2036264.2036281","title":"Mining Concept Sequences from Large-Scale Search Logs for Context-Aware Query Suggestion","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Web search query; Information retrieval; Query expansion; Web query classification; Query language; Context (archaeology); Query optimization; Sargable; Session (web analytics); Search engine; Data mining; World Wide Web","score_opus":0.048680879206956164,"score_gpt":0.26151993178890337,"score_spread":0.2128390525819472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171045163","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.22857964,0.0046251444,0.7473,0.00088899705,0.00013077591,0.00070718257,0.0038426784,0.012284695,0.0016408674],"genre_scores_gemma":[0.57698655,0.0008086954,0.41427484,0.00019641621,0.00015938112,0.0003868945,0.006061923,0.00020445239,0.0009209113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984255,0.00040148952,0.00015865662,0.00037984777,0.0005371663,0.00009740401],"domain_scores_gemma":[0.9931938,0.004227514,0.0006485558,0.000672414,0.0010270784,0.00023059036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014675949,0.0015314134,0.0015852201,0.0060125086,0.00078671216,0.0010245449,0.0014827782,0.001303921,0.0010869132],"category_scores_gemma":[0.011944457,0.0004993415,0.0010173479,0.004496618,0.00036353132,0.0031175308,0.00069181964,0.0013080849,0.001098651],"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.0014858237,0.0017470329,0.05848413,0.001734427,0.0005053671,0.0009192061,0.0017345693,0.074746825,0.06119771,0.0048697796,0.021609299,0.77096575],"study_design_scores_gemma":[0.00008855945,0.00030121914,0.008726636,0.00006234983,0.00016843819,0.0006283025,0.0004998153,0.96163493,0.012715613,0.008410099,0.0066767014,0.00008736167],"about_ca_topic_score_codex":0.005878945,"about_ca_topic_score_gemma":0.012607669,"teacher_disagreement_score":0.0060125086,"about_ca_system_score_codex":0.00061135547,"about_ca_system_score_gemma":0.0020898818,"threshold_uncertainty_score":0.011689484},"labels":[],"label_agreement":null},{"id":"W2171121044","doi":"10.1109/iwqos.2008.32","title":"Statistics and Social Network of YouTube Videos","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":732,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; The Internet; Scalability; Key (lock); Social media; World Wide Web; Quality (philosophy); Multimedia; Data science; Internet privacy; Computer security; Database","score_opus":0.02184853257430665,"score_gpt":0.2145091000323955,"score_spread":0.19266056745808885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171121044","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.9808282,0.0002714154,0.0015854962,0.00016016456,0.000015200527,0.0000617496,0.014006362,0.000117935764,0.0029533387],"genre_scores_gemma":[0.9834937,0.00015931296,0.0011341957,0.0000142889285,0.000025354617,0.0000692283,0.014478432,0.000017411221,0.000608139],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990374,0.00018661251,0.00010880206,0.000152065,0.00039654362,0.000118471486],"domain_scores_gemma":[0.99153274,0.003700129,0.0018513113,0.000476243,0.0019577497,0.00048173088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063366874,0.00025614683,0.00039243815,0.0064371475,0.00059501507,0.0005794198,0.00031486785,0.00035929005,0.0011078909],"category_scores_gemma":[0.008154899,0.000112002424,0.00021988123,0.0049703675,0.0003648684,0.0011278716,0.0005091587,0.00032430413,0.00039724677],"study_design_candidate":"observational","study_design_consensus":"observational","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.00035871787,0.00017245753,0.923636,0.00025168178,0.00018326592,0.00080771314,0.0009776275,0.01485687,0.0066088866,0.003310891,0.009423794,0.039412145],"study_design_scores_gemma":[0.0000082427305,0.00013798074,0.9249298,0.000027427099,0.00002725501,0.0007728493,0.0008279925,0.06513814,0.0022756585,0.0011017304,0.0047088144,0.000044186792],"about_ca_topic_score_codex":0.01933814,"about_ca_topic_score_gemma":0.018388277,"teacher_disagreement_score":0.01933814,"about_ca_system_score_codex":0.0007574066,"about_ca_system_score_gemma":0.000327318,"threshold_uncertainty_score":0.038451135},"labels":[],"label_agreement":null},{"id":"W2182571172","doi":"10.1109/mcom.2016.7378432","title":"Cloudifying the 3GPP IP multimedia subsystem for 4G and beyond: A survey","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":30,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"IP Multimedia Subsystem; Computer science; Provisioning; Scalability; Key (lock); Service (business); Multimedia; Computer network; Computer security; Operating system","score_opus":0.06918843469619541,"score_gpt":0.2893427411327787,"score_spread":0.2201543064365833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182571172","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028140206,0.7815078,0.0877967,0.0035998533,0.0008968343,0.00022699885,0.00024151622,0.00050936063,0.097080655],"genre_scores_gemma":[0.12453229,0.8193088,0.04105229,0.001412734,0.0009722393,0.00010042152,0.0005428265,0.000109981396,0.011968389],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951243,0.000075694334,0.000042388576,0.000060927418,0.00021172351,0.000096737465],"domain_scores_gemma":[0.99924755,0.00021076258,0.00007590036,0.000073873365,0.00031275253,0.00007911107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088666327,0.00063953846,0.00047931963,0.0023261884,0.0005874903,0.0024446365,0.0010048728,0.0010329443,0.00255685],"category_scores_gemma":[0.0009962446,0.00039224044,0.00040885416,0.0041171904,0.0005217457,0.003622527,0.0008947981,0.0009845791,0.0013507741],"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.000053341122,0.00006647792,0.00329755,0.0016323325,0.000026827995,0.0002100716,0.00023932612,0.004340765,0.004213447,0.05529432,0.018015472,0.9126101],"study_design_scores_gemma":[0.000009880694,0.00025778968,0.0050380197,0.001432702,0.000081020175,0.0016451272,0.00086442335,0.01699617,0.005964302,0.014343179,0.9533011,0.00006633385],"about_ca_topic_score_codex":0.004511283,"about_ca_topic_score_gemma":0.0035160831,"teacher_disagreement_score":0.004511283,"about_ca_system_score_codex":0.0013994571,"about_ca_system_score_gemma":0.0018025057,"threshold_uncertainty_score":0.01015383},"labels":[],"label_agreement":null},{"id":"W2182859693","doi":"10.14778/3402707.3402711","title":"A Framework for supporting DBMS-like indexes in the cloud","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Cloud computing; Search engine indexing; Distributed computing; Database; Distributed database; Overhead (engineering); Node (physics); Hash table; High availability; Data mining; Hash function; Operating system; Information retrieval","score_opus":0.04723732750376692,"score_gpt":0.26008486779994716,"score_spread":0.21284754029618025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182859693","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.013793745,0.00080146093,0.9512024,0.00069556077,0.00016925184,0.0007886552,0.0004935205,0.027562588,0.0044929516],"genre_scores_gemma":[0.12081136,0.0005784528,0.87290776,0.00030730758,0.00013085538,0.0003128682,0.001254365,0.0010310689,0.0026660047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973053,0.00032716844,0.0004539729,0.00037990336,0.0012135482,0.00032023608],"domain_scores_gemma":[0.9965752,0.00042718512,0.00023764679,0.0013199635,0.00068024214,0.0007597745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004139274,0.00062762876,0.0010503383,0.0014662364,0.0021062645,0.0049823383,0.005092019,0.0013386002,0.001907466],"category_scores_gemma":[0.0055492567,0.0010260048,0.0011523548,0.002244089,0.0015182276,0.0061895982,0.0043523386,0.0023010033,0.0012681796],"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.0010650286,0.001172224,0.010343891,0.0012035461,0.000338554,0.0015033269,0.001925154,0.05099959,0.0799332,0.4141306,0.062458616,0.37492633],"study_design_scores_gemma":[0.0003517469,0.00048817016,0.0027694465,0.00021966232,0.00021279218,0.0014149266,0.0004075618,0.6482491,0.03905315,0.06311833,0.24339989,0.0003151707],"about_ca_topic_score_codex":0.013283753,"about_ca_topic_score_gemma":0.009353796,"teacher_disagreement_score":0.013283753,"about_ca_system_score_codex":0.0018710642,"about_ca_system_score_gemma":0.004535589,"threshold_uncertainty_score":0.026412904},"labels":[],"label_agreement":null},{"id":"W2183437300","doi":"10.21917/ijct.2011.0036","title":"MODIFIED DYNAMIC ONLINE ROUTING ALGORITHM AND REGENERATOR PLACEMENT IN WDM NETWORKS","year":2011,"lang":"en","type":"article","venue":"ICTACT Journal on Communication Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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; Quality (philosophy); Routing (electronic design automation); Regenerative heat exchanger; Routing algorithm; Resource (disambiguation); Wavelength-division multiplexing; Engineering management; Operations research; Computer network; Routing protocol; Engineering; Mechanical engineering","score_opus":0.025394254518263402,"score_gpt":0.25126901950879377,"score_spread":0.22587476499053036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183437300","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.10217091,0.0011397195,0.88895774,0.00038689384,0.00019078857,0.00019241683,0.00014374912,0.00094372366,0.005874127],"genre_scores_gemma":[0.5804602,0.00048194328,0.41101235,0.00009336892,0.0000904527,0.00016208857,0.00019861343,0.00011584942,0.007385094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994512,0.00018633618,0.000031263986,0.000108309396,0.00012982472,0.000093102055],"domain_scores_gemma":[0.99892056,0.00060638686,0.000104583574,0.00012894988,0.00017563393,0.00006397835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009023744,0.00067022693,0.0011827461,0.0012991886,0.0009658857,0.0009931126,0.0023264051,0.0010770613,0.0021017112],"category_scores_gemma":[0.0025752771,0.00046650684,0.00042941573,0.0014104048,0.00058164523,0.0016803385,0.00083438115,0.00053321716,0.00051586545],"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.00050341175,0.00022878707,0.0010935753,0.00015492765,0.00007236164,0.00016088433,0.0002096601,0.7436958,0.00864509,0.016786858,0.005027528,0.22342113],"study_design_scores_gemma":[0.00002508621,0.000055833327,0.00014828805,0.0000054261996,0.000012525874,0.000058904352,0.000025022557,0.9942345,0.0011792865,0.0034748234,0.0007685753,0.000011738243],"about_ca_topic_score_codex":0.005006556,"about_ca_topic_score_gemma":0.007537665,"teacher_disagreement_score":0.005006556,"about_ca_system_score_codex":0.0014375622,"about_ca_system_score_gemma":0.0016020354,"threshold_uncertainty_score":0.010430276},"labels":[],"label_agreement":null},{"id":"W2185744751","doi":"","title":"Low-Latency Caching for Cloud-Based Web Applications","year":2011,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Operating system; Cloud computing; Virtual machine; Cache; Latency (audio); Virtualization","score_opus":0.03504243020709743,"score_gpt":0.23084917533760846,"score_spread":0.19580674513051102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185744751","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7816398,0.016691646,0.118805975,0.0025334316,0.0006043232,0.00067155383,0.00073341787,0.029113483,0.049206275],"genre_scores_gemma":[0.97165394,0.00073624763,0.02263933,0.00029553822,0.00006330708,0.00009945943,0.00020308926,0.0004171706,0.00389186],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973636,0.0004300808,0.00013685174,0.00022525113,0.0013071662,0.00053701835],"domain_scores_gemma":[0.9954972,0.0012568843,0.0003535255,0.0012228877,0.0013808702,0.00028862557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011772206,0.0009765956,0.00077294174,0.00093314354,0.0021268458,0.003229889,0.0027267416,0.0009021745,0.00379632],"category_scores_gemma":[0.006203558,0.00068880303,0.0004070974,0.0019609856,0.000736537,0.0033662717,0.0012296119,0.0014953278,0.0010057421],"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.006184303,0.0027690087,0.03670282,0.0024303326,0.0003579567,0.0019099482,0.001149654,0.178484,0.2675034,0.044514865,0.068452656,0.38954106],"study_design_scores_gemma":[0.00023264349,0.0006644021,0.006005514,0.00011816532,0.0001976607,0.00035894295,0.00032234195,0.87246907,0.09380826,0.008333307,0.017383218,0.000106467065],"about_ca_topic_score_codex":0.023732735,"about_ca_topic_score_gemma":0.03095022,"teacher_disagreement_score":0.023732735,"about_ca_system_score_codex":0.003969918,"about_ca_system_score_gemma":0.0046259817,"threshold_uncertainty_score":0.047189176},"labels":[],"label_agreement":null},{"id":"W2186251686","doi":"","title":"A Matrix Algorithm for Web Cache Pre-fetching","year":2007,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Cache; Cache algorithms; Cache-oblivious algorithm; Algorithm; Cache invalidation; Smart Cache; Scheme (mathematics); Simple (philosophy); Matrix (chemical analysis); Parallel computing; CPU cache","score_opus":0.01403711830895796,"score_gpt":0.2765470170343493,"score_spread":0.2625098987253913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186251686","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.0039801453,0.00016724947,0.9933427,0.000068923066,0.000057706293,0.000056035075,0.000034669392,0.0014526874,0.0008399384],"genre_scores_gemma":[0.11824048,0.0002455531,0.87741154,0.00008254741,0.00012051171,0.00018949574,0.00020916357,0.00018091314,0.003319738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992581,0.00015609118,0.000050204744,0.00012940734,0.0003450181,0.00006128174],"domain_scores_gemma":[0.99840194,0.00055787346,0.00010669813,0.00031978055,0.0005437034,0.00007005192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006268994,0.0006627944,0.0007919401,0.0011233055,0.00086094084,0.00090897846,0.0013984591,0.00068216276,0.004523729],"category_scores_gemma":[0.0035753488,0.0003195577,0.00035945638,0.0013558859,0.00047827128,0.0023200556,0.00080560945,0.0011713376,0.0016793142],"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.0005070881,0.00023631315,0.0009692794,0.00018120866,0.000078783254,0.00008994876,0.00012795677,0.13202071,0.028838508,0.03768923,0.010157559,0.7891035],"study_design_scores_gemma":[0.00006273011,0.00011679317,0.00021546244,0.000009122535,0.000017622035,0.00013925556,0.000024438466,0.97314394,0.010227342,0.009329884,0.006682562,0.000030810825],"about_ca_topic_score_codex":0.0057873838,"about_ca_topic_score_gemma":0.0068148472,"teacher_disagreement_score":0.0057873838,"about_ca_system_score_codex":0.0008948169,"about_ca_system_score_gemma":0.001345679,"threshold_uncertainty_score":0.015133381},"labels":[],"label_agreement":null},{"id":"W2197087742","doi":"10.1002/0471755591.ch2","title":"Understanding the Use of a Campus Wireless Network","year":2005,"lang":"en","type":"other","venue":"","topic":"Caching and Content Delivery","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":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Wireless network; Computer science; Wireless WAN; Computer network; Software deployment; Wireless; Municipal wireless network; Campus network; Network packet; Wireless site survey; Wireless distribution system; Authentication (law); Heterogeneous network; World Wide Web; Wi-Fi array; Computer security; Telecommunications; Software engineering","score_opus":0.11459770772602763,"score_gpt":0.2353307300427719,"score_spread":0.12073302231674428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197087742","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.7156555,0.002184103,0.06899121,0.013114689,0.00003872216,0.0000765624,0.0006961357,0.00018687341,0.19905618],"genre_scores_gemma":[0.98726416,0.0013514467,0.006461956,0.00022973034,0.00001719365,0.00002331818,0.00013264529,0.000028760296,0.0044908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99931765,0.00027658456,0.000031265114,0.00009749615,0.00014518976,0.00013190361],"domain_scores_gemma":[0.9982405,0.0007383619,0.00029778396,0.0001936522,0.00036328562,0.00016646582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075981865,0.00022553178,0.00014363615,0.0015183764,0.00092309614,0.0048205974,0.0008146511,0.0009792602,0.0020050853],"category_scores_gemma":[0.0036427455,0.0002248949,0.00013688681,0.00195409,0.0013585608,0.007875313,0.0011986073,0.00085944956,0.00044227287],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006726132,0.00016595217,0.15615119,0.00022118536,0.000057385838,0.0013206083,0.039074916,0.035986826,0.006690631,0.53642184,0.013357462,0.21048476],"study_design_scores_gemma":[0.0000096923195,0.00011602827,0.17738648,0.0003835436,0.00008613465,0.0014924732,0.11171689,0.18192202,0.004931053,0.2553928,0.266433,0.00012986398],"about_ca_topic_score_codex":0.049936872,"about_ca_topic_score_gemma":0.05716869,"teacher_disagreement_score":0.049936872,"about_ca_system_score_codex":0.002860481,"about_ca_system_score_gemma":0.0013087982,"threshold_uncertainty_score":0.0992924},"labels":[],"label_agreement":null},{"id":"W2197673850","doi":"10.1109/tvt.2015.2480711","title":"On-Road Caching Assistance for Ubiquitous Vehicle-Based Information Services","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Scheme (mathematics); Computer network; Network packet; Path (computing); False sharing; CPU cache","score_opus":0.014194135453235024,"score_gpt":0.2301659841074966,"score_spread":0.21597184865426158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197673850","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.21505696,0.0047916877,0.76529497,0.0005085989,0.0002429867,0.00018598464,0.00023270064,0.003191553,0.010494473],"genre_scores_gemma":[0.9584497,0.00073942944,0.037706606,0.000078700854,0.000031479605,0.000031485368,0.00015823168,0.00003292698,0.0027714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996513,0.00008897765,0.00001900647,0.000047616,0.00010145163,0.00009174136],"domain_scores_gemma":[0.99911994,0.00018759168,0.00008647188,0.0002241131,0.0003244999,0.000057319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038306823,0.00047283413,0.000535707,0.0005376442,0.00062298146,0.000686331,0.0016001879,0.0007014825,0.0012627166],"category_scores_gemma":[0.0013519833,0.0001538429,0.0002571464,0.00078398915,0.00027560766,0.0014718636,0.0008942292,0.00038574758,0.00044687735],"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.00083313556,0.0003348313,0.010877807,0.0006080145,0.00017507712,0.001701748,0.0005808691,0.10486381,0.09373293,0.047871813,0.0172522,0.7211678],"study_design_scores_gemma":[0.000043907046,0.00042413248,0.0028064651,0.000058051068,0.00015260254,0.0013159786,0.0007099405,0.90730685,0.04220008,0.009942365,0.034968615,0.000070990995],"about_ca_topic_score_codex":0.009567014,"about_ca_topic_score_gemma":0.010368103,"teacher_disagreement_score":0.009567014,"about_ca_system_score_codex":0.0007776131,"about_ca_system_score_gemma":0.0009045096,"threshold_uncertainty_score":0.019022644},"labels":[],"label_agreement":null},{"id":"W2203876954","doi":"10.1109/lcnw.2015.7365935","title":"Caching and forwarding assistance for vehicular information services with mobile requesters","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Computer network; Scheme (mathematics)","score_opus":0.01074642502048767,"score_gpt":0.21270668357143424,"score_spread":0.20196025855094657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203876954","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.40182707,0.0030274356,0.5803953,0.0008084417,0.00019615145,0.00029875687,0.00022549758,0.0061304057,0.007090997],"genre_scores_gemma":[0.95509315,0.00041139647,0.0417572,0.00006682774,0.00003943243,0.00004000763,0.0001592703,0.000041643583,0.002391235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957806,0.00011755798,0.00003342073,0.00005297581,0.000121493424,0.0000964977],"domain_scores_gemma":[0.99828595,0.0005844129,0.00017036045,0.0004010936,0.0004465602,0.00011155082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006914512,0.0004555881,0.00056896725,0.0006149283,0.00075144065,0.0006857027,0.0011729096,0.0007566477,0.0008784412],"category_scores_gemma":[0.0028790652,0.00022884397,0.00026337188,0.0007361454,0.0003370529,0.0012008477,0.0008155245,0.00038448427,0.0003593726],"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.0020874164,0.00044776648,0.018958587,0.0006748581,0.0002383662,0.0036614097,0.001796619,0.1363367,0.18731278,0.047955163,0.0212726,0.57925767],"study_design_scores_gemma":[0.00008141446,0.000268967,0.0017250726,0.000028951168,0.000108532986,0.00088830554,0.00046315228,0.93777126,0.034492742,0.0060514268,0.018052388,0.000067750014],"about_ca_topic_score_codex":0.01171304,"about_ca_topic_score_gemma":0.011545176,"teacher_disagreement_score":0.01171304,"about_ca_system_score_codex":0.00061671284,"about_ca_system_score_gemma":0.0011540189,"threshold_uncertainty_score":0.02328968},"labels":[],"label_agreement":null},{"id":"W2204560043","doi":"10.1109/cit/iucc/dasc/picom.2015.262","title":"Detection and Prevention of Malicious Requests in ICN Routing and Caching","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Denial-of-service attack; The Internet; Routing (electronic design automation); Cache; Routing protocol; Computer security; World Wide Web","score_opus":0.028346075374308728,"score_gpt":0.25228078494440637,"score_spread":0.22393470957009765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204560043","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.6650056,0.0012116357,0.31034043,0.0006627367,0.00016053517,0.00064041634,0.0001334597,0.008228781,0.013616337],"genre_scores_gemma":[0.9624027,0.000122006146,0.03618877,0.000101084435,0.000021844788,0.000044610562,0.00010781563,0.000044029443,0.00096718385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967638,0.00072790164,0.00028175308,0.0004049625,0.0014392812,0.00038222797],"domain_scores_gemma":[0.9908593,0.0017093918,0.001791915,0.0027540054,0.002493362,0.0003920045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013043532,0.0008180821,0.0009480932,0.0012890281,0.00082887645,0.0016812994,0.0013228183,0.0011685587,0.0003438388],"category_scores_gemma":[0.0077580614,0.00032741195,0.00030097854,0.0006986001,0.0006571399,0.0015799106,0.0008906009,0.0007922167,0.000330058],"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.0017041772,0.0014582475,0.08491561,0.00034975482,0.00026086433,0.0014562769,0.0010617821,0.070696026,0.29415777,0.0131585095,0.007244504,0.5235365],"study_design_scores_gemma":[0.00006558865,0.0006321573,0.01601989,0.000057876146,0.00019686045,0.0019166981,0.00033117746,0.7890465,0.18218963,0.0033675837,0.0060875025,0.000088398665],"about_ca_topic_score_codex":0.002361581,"about_ca_topic_score_gemma":0.002426414,"teacher_disagreement_score":0.002361581,"about_ca_system_score_codex":0.00078819646,"about_ca_system_score_gemma":0.00172154,"threshold_uncertainty_score":0.0068981647},"labels":[],"label_agreement":null},{"id":"W2212315060","doi":"10.14778/2856318.2856323","title":"Approximate closest community search in networks","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":217,"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 British Columbia","funders":"","keywords":"Truss; Computer science; Approximation algorithm; Greedy algorithm; Set (abstract data type); Graph; Efficient algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Combinatorics; Algorithm","score_opus":0.05422769107867213,"score_gpt":0.2469106196643252,"score_spread":0.19268292858565306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212315060","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.052396487,0.0025556313,0.93577194,0.0012243877,0.00010130435,0.00022492914,0.00060126284,0.00075318443,0.006370844],"genre_scores_gemma":[0.49016175,0.0015618056,0.49685472,0.00042135228,0.00016558394,0.00048164703,0.0020074092,0.00030896306,0.008036776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782664,0.0007739355,0.0000871337,0.00063404447,0.00044574667,0.00023242013],"domain_scores_gemma":[0.9927394,0.0050454033,0.0007005463,0.0005540361,0.00063207414,0.00032848289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002277179,0.0016327337,0.0026317853,0.0026515936,0.0015480991,0.0020385552,0.003694601,0.0030069863,0.004041819],"category_scores_gemma":[0.015153441,0.0010093561,0.001387598,0.0035574601,0.0015288709,0.005133215,0.0030981896,0.002020596,0.0008805576],"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.0002074515,0.000102970545,0.0012438898,0.00026618535,0.000104428036,0.00015276251,0.00020559444,0.90994173,0.00097491243,0.03853371,0.005671347,0.042595],"study_design_scores_gemma":[0.000022473321,0.0000145579625,0.00008391026,0.000014892227,0.000008394672,0.00003578314,0.000037301696,0.9634996,0.00015659137,0.035263166,0.0008574291,0.0000059321133],"about_ca_topic_score_codex":0.009859422,"about_ca_topic_score_gemma":0.012961104,"teacher_disagreement_score":0.009859422,"about_ca_system_score_codex":0.002900251,"about_ca_system_score_gemma":0.0016376948,"threshold_uncertainty_score":0.021042943},"labels":[],"label_agreement":null},{"id":"W2214657254","doi":"","title":"Workload characterization for the multimedia files embedded in the popular web pages","year":2007,"lang":"en","type":"article","venue":"Internet, Multimedia Systems and Applications","topic":"Caching and Content Delivery","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":"Computer science; Web page; World Wide Web; Static web page; Web development; Web modeling; Web API; Data Web; Web navigation; Web service; Cache; Web mapping; Multimedia; Operating system","score_opus":0.022539981968352676,"score_gpt":0.2571600663035967,"score_spread":0.23462008433524406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214657254","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.9192335,0.00021276622,0.07717904,0.00011394779,0.000021702255,0.00019776012,0.0014003228,0.0005525121,0.0010884912],"genre_scores_gemma":[0.982263,0.000080171485,0.015053544,0.000024219542,0.000029466479,0.00015134197,0.0019910294,0.000065312735,0.00034174937],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855155,0.0003667065,0.00019340632,0.00029342284,0.00041079128,0.00018403551],"domain_scores_gemma":[0.98994,0.0049250894,0.0016267876,0.0013293087,0.0017313786,0.00044756653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771515,0.00075663585,0.00076644646,0.003578068,0.00044902577,0.0010374305,0.00071841304,0.00056156516,0.00055015204],"category_scores_gemma":[0.009948397,0.00021218458,0.0004581303,0.0025119307,0.00035334376,0.001705561,0.00039090728,0.00051837607,0.000192041],"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.001328907,0.0012182601,0.44606754,0.00047540703,0.00025910515,0.0007019812,0.00085368427,0.31566367,0.08667373,0.006336524,0.0034761378,0.13694508],"study_design_scores_gemma":[0.000017622719,0.0002572402,0.06976157,0.000014770264,0.000029849309,0.00037839529,0.000263809,0.91016906,0.015691927,0.002367191,0.0010114126,0.00003706045],"about_ca_topic_score_codex":0.0036148364,"about_ca_topic_score_gemma":0.0031557833,"teacher_disagreement_score":0.0036148364,"about_ca_system_score_codex":0.0009037361,"about_ca_system_score_gemma":0.0005696293,"threshold_uncertainty_score":0.007812023},"labels":[],"label_agreement":null},{"id":"W2215745561","doi":"10.1109/isc2.2015.7366191","title":"Application platforms for smart cities","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Testbed; Smart city; Computer science; Intelligent transportation system; Computer security; Systems engineering; World Wide Web; Engineering; Internet of Things; Transport engineering","score_opus":0.04542955327220019,"score_gpt":0.2453035707758248,"score_spread":0.1998740175036246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215745561","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.00920055,0.005812002,0.7861611,0.013795805,0.0028492082,0.0009931085,0.000517264,0.010463734,0.17020726],"genre_scores_gemma":[0.13780738,0.0087643275,0.76333433,0.003447176,0.0015248044,0.0014495591,0.0017852596,0.0026000394,0.07928713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985245,0.00048440843,0.00013859356,0.00017154185,0.00046187016,0.00021917345],"domain_scores_gemma":[0.9981065,0.00051101134,0.00010913964,0.0005997151,0.00035342365,0.0003203314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021799142,0.0010402694,0.0006147897,0.0012172821,0.0022461999,0.0058269356,0.0023913737,0.0030636368,0.020526446],"category_scores_gemma":[0.0046422733,0.0009444116,0.0009066405,0.0013944043,0.0017693182,0.010795531,0.0057637733,0.0047339085,0.0074272403],"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.000030481437,0.00005241341,0.00014069374,0.00023706717,0.000011423171,0.00022222303,0.00035084522,0.0035517388,0.0043472885,0.9177899,0.035193775,0.03807222],"study_design_scores_gemma":[0.000020800579,0.000042669802,0.00015101308,0.00017501309,0.0000122574165,0.00026542574,0.00019753171,0.016177634,0.0022823615,0.15286843,0.8277748,0.000032081814],"about_ca_topic_score_codex":0.0011803427,"about_ca_topic_score_gemma":0.002015885,"teacher_disagreement_score":0.020526446,"about_ca_system_score_codex":0.0015563923,"about_ca_system_score_gemma":0.0016219035,"threshold_uncertainty_score":0.06866777},"labels":[],"label_agreement":null},{"id":"W2218034770","doi":"10.1109/aeect.2015.7360583","title":"A policy-based location-aware framework for personalized services in cloud computing systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Cloud computing; Service provider; Service (business); Adaptation (eye); Handover; Service delivery framework; Process management; Distributed computing; Computer network; Engineering; Business","score_opus":0.03731916492154177,"score_gpt":0.2921439400267148,"score_spread":0.25482477510517304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218034770","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.010668345,0.00040334737,0.9808585,0.00062261376,0.000098316305,0.00017325426,0.00011282043,0.0029755412,0.004087251],"genre_scores_gemma":[0.5193275,0.0006315039,0.475316,0.00022318309,0.000111712034,0.00027590635,0.00027139825,0.0002508686,0.0035918136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904615,0.00026224766,0.00009638604,0.00013741718,0.00032359952,0.00013418168],"domain_scores_gemma":[0.9992829,0.00016460718,0.00006157658,0.00021388508,0.00015473533,0.0001222586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017301562,0.0005000548,0.0007957572,0.0007222201,0.00143053,0.0029525189,0.0022121156,0.0013503927,0.0017748972],"category_scores_gemma":[0.0024643734,0.0005122237,0.00071644806,0.00071643275,0.001121851,0.0022348047,0.001884711,0.0017140311,0.00061056204],"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.00017280146,0.00024157998,0.0022106103,0.00012781926,0.000083954576,0.000521473,0.00051151507,0.6436856,0.009105872,0.24167995,0.008488817,0.09316999],"study_design_scores_gemma":[0.000010475993,0.000018484869,0.00014538909,0.0000138683545,0.000014076194,0.000057430563,0.000035376343,0.97819865,0.001231062,0.013894057,0.0063597434,0.000021455999],"about_ca_topic_score_codex":0.023298314,"about_ca_topic_score_gemma":0.022337524,"teacher_disagreement_score":0.023298314,"about_ca_system_score_codex":0.0021757467,"about_ca_system_score_gemma":0.0038004173,"threshold_uncertainty_score":0.046325445},"labels":[],"label_agreement":null},{"id":"W2218218593","doi":"10.1109/tccn.2015.2488649","title":"Adaptive Caching in the YouTube Content Distribution Network: A Revealed Preference Game-Theoretic Learning Approach","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Server; Computer science; Regret; Cache; Computer network; Latency (audio); Utility maximization problem; Stackelberg competition; Nash equilibrium; Distributed computing; Mathematical optimization; Machine learning; Utility maximization","score_opus":0.18374599267350838,"score_gpt":0.2739955013048865,"score_spread":0.0902495086313781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218218593","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.13163553,0.0005742181,0.85916847,0.0014044705,0.00004077371,0.000108745866,0.00013020166,0.00012346492,0.0068142535],"genre_scores_gemma":[0.9697167,0.00034919483,0.026530627,0.00011580436,0.000033999764,0.00010075613,0.000045404384,0.000018774768,0.003088648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921834,0.00041471378,0.000023998462,0.00011309826,0.00010702303,0.00012293454],"domain_scores_gemma":[0.9965677,0.0025369553,0.00035238074,0.00009747139,0.00027711247,0.00016834286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016247273,0.00073218194,0.0010663138,0.00062894286,0.00063800794,0.0012812836,0.0016414368,0.0014157918,0.0013577596],"category_scores_gemma":[0.005820793,0.00040535672,0.00065366726,0.0007921801,0.0014258872,0.0018865463,0.0009807013,0.0012476982,0.00012385868],"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.000046520174,0.00003358769,0.00079141825,0.000031113315,0.00002758667,0.0001311462,0.00007346266,0.95317596,0.00046090744,0.04032876,0.0004900734,0.0044094687],"study_design_scores_gemma":[0.000003642053,0.000006427499,0.00007093283,0.0000015153203,0.0000028649274,0.0000069549424,0.000011364285,0.9932647,0.000041579216,0.006515945,0.00007079091,0.0000032888083],"about_ca_topic_score_codex":0.021309657,"about_ca_topic_score_gemma":0.014222667,"teacher_disagreement_score":0.021309657,"about_ca_system_score_codex":0.003266156,"about_ca_system_score_gemma":0.0013696481,"threshold_uncertainty_score":0.042371213},"labels":[],"label_agreement":null},{"id":"W2226713063","doi":"10.1109/iwqos.2015.7404698","title":"Online cost minimization for operating geo-distributed cloud CDNs","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Online algorithm; Heuristics; Competitive analysis; Server; Distributed computing; Minification; Replica; Greedy algorithm; Mathematical optimization; Computer network; Real-time computing; Algorithm; Operating system; Upper and lower bounds","score_opus":0.06420631591678808,"score_gpt":0.28201257466424207,"score_spread":0.217806258747454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226713063","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.063106544,0.00028704715,0.9303261,0.0006328735,0.000053593438,0.00012674544,0.000075026546,0.00055511546,0.0048368652],"genre_scores_gemma":[0.7674408,0.00016672398,0.22909112,0.00014316254,0.000051247334,0.00021487432,0.00013926711,0.00015511925,0.002597641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999401,0.00019463373,0.000023659424,0.0001178973,0.00015101183,0.00011168106],"domain_scores_gemma":[0.9978331,0.0015126035,0.00020304353,0.00015756549,0.00018881426,0.00010493283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011743791,0.0009502066,0.0008037768,0.00041473596,0.00051861705,0.0009028814,0.0013080593,0.00097292947,0.0018147125],"category_scores_gemma":[0.0045939963,0.00039240764,0.00035968985,0.00053218845,0.0008530632,0.0010984559,0.0011174808,0.0010258709,0.00028487813],"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.00006692251,0.00006939695,0.00030590763,0.000041701413,0.0000075054845,0.00002453312,0.000020860123,0.9746201,0.00096547615,0.004556531,0.0007733889,0.018547544],"study_design_scores_gemma":[0.0000054032166,0.000009314044,0.00002483551,0.0000013437426,0.0000012384404,0.0000040426057,0.0000043370915,0.9985707,0.00018458815,0.0011020901,0.000090878835,0.000001266185],"about_ca_topic_score_codex":0.005980319,"about_ca_topic_score_gemma":0.005709552,"teacher_disagreement_score":0.005980319,"about_ca_system_score_codex":0.0018920259,"about_ca_system_score_gemma":0.001828795,"threshold_uncertainty_score":0.013727725},"labels":[],"label_agreement":null},{"id":"W2229747717","doi":"10.1109/access.2016.2537208","title":"Internet of Drones","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":478,"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":"Drone; Computer science; Architecture; The Internet; Key (lock); Computer network; Internet traffic; Network architecture; Computer security; World Wide Web; Geography","score_opus":0.047333407785662765,"score_gpt":0.2753258622355282,"score_spread":0.22799245444986543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229747717","genre_codex":"other","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.10080377,0.0064122854,0.28863177,0.0041869595,0.0008934117,0.0007415167,0.0046748766,0.006287861,0.5873676],"genre_scores_gemma":[0.8123442,0.00851499,0.07140239,0.0011226829,0.00024776146,0.00043842764,0.006287272,0.00040062325,0.09924175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996854,0.00007859103,0.00001916712,0.000060575017,0.000105993684,0.000050289385],"domain_scores_gemma":[0.99921834,0.00013427228,0.000052282914,0.00026984885,0.00020985247,0.000115346076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012398,0.00040821137,0.00030903847,0.00082082563,0.0008885543,0.0027691454,0.00086970045,0.0009157324,0.015194064],"category_scores_gemma":[0.0017336748,0.00022585629,0.0003223901,0.0010831481,0.00055290485,0.003851529,0.0012824337,0.00095943606,0.0025757528],"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.00018374507,0.00014939309,0.003230287,0.00038859027,0.00007079417,0.00050670153,0.0004668058,0.047993112,0.0069541195,0.77534735,0.050183285,0.1145258],"study_design_scores_gemma":[0.00008412742,0.00015530451,0.001597771,0.00023019576,0.000050632345,0.0005206206,0.0004123626,0.13640039,0.0051831207,0.10277109,0.7525301,0.00006419026],"about_ca_topic_score_codex":0.009470608,"about_ca_topic_score_gemma":0.0070865075,"teacher_disagreement_score":0.015194064,"about_ca_system_score_codex":0.0009495165,"about_ca_system_score_gemma":0.00096149277,"threshold_uncertainty_score":0.050829172},"labels":[],"label_agreement":null},{"id":"W2254475833","doi":"","title":"Category-based user interaction with online user-generated videos: workload characterization","year":2014,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Cache; Workload; Replication (statistics); Object (grammar); Population; World Wide Web; TRACE (psycholinguistics); Server; Multimedia; Information retrieval; Human–computer interaction; Computer network; Artificial intelligence","score_opus":0.008457724419592867,"score_gpt":0.19119302237930408,"score_spread":0.18273529795971122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254475833","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.9937913,0.000063655476,0.00451985,0.00002662884,0.0000041712397,0.000051985407,0.00075038394,0.00016453507,0.00062754715],"genre_scores_gemma":[0.996924,0.000030994786,0.0018694148,0.000008610768,0.0000056304953,0.000028195116,0.0008984859,0.000012800724,0.00022201576],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99910945,0.00020527838,0.00008800357,0.00016712282,0.00029547178,0.00013462394],"domain_scores_gemma":[0.9945257,0.0028775285,0.00065049663,0.00048472747,0.0010289177,0.00043267218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820978,0.000352723,0.00042027843,0.0020943764,0.00028446777,0.00071980903,0.0004925989,0.00043115858,0.000666668],"category_scores_gemma":[0.006697456,0.00014645781,0.00021346135,0.001839531,0.00022064275,0.0007589969,0.00040807461,0.00030082563,0.00029524157],"study_design_candidate":"observational","study_design_consensus":"observational","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.0010746852,0.00071213325,0.8389386,0.0002467958,0.00019183192,0.00041176987,0.0023323123,0.013626123,0.038938507,0.000698372,0.0019275848,0.10090133],"study_design_scores_gemma":[0.000013940256,0.00059808337,0.7087838,0.000019091196,0.000050275576,0.00085097406,0.0015813995,0.2757187,0.010381535,0.00083795906,0.0010993828,0.00006485762],"about_ca_topic_score_codex":0.0070450446,"about_ca_topic_score_gemma":0.0069505326,"teacher_disagreement_score":0.0070450446,"about_ca_system_score_codex":0.0003754973,"about_ca_system_score_gemma":0.00030122112,"threshold_uncertainty_score":0.014008045},"labels":[],"label_agreement":null},{"id":"W2266146385","doi":"10.1007/s11432-015-5279-9","title":"Modeling of miss-probability in content-centric networking","year":2015,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; The Internet; Cache; Network topology; Computer network; Information-centric networking; Bandwidth (computing); Content delivery; Tree (set theory); Distributed computing; World Wide Web; Mathematics","score_opus":0.12247023729677196,"score_gpt":0.277534274135334,"score_spread":0.155064036838562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266146385","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.26004526,0.003869929,0.7161566,0.0037448306,0.0003863192,0.00018593337,0.000838254,0.0006553924,0.01411746],"genre_scores_gemma":[0.9825036,0.0011400897,0.009156454,0.00016212575,0.00017729592,0.000082678445,0.00016522677,0.00007564214,0.0065368717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998676,0.00047133857,0.000053298427,0.00020339826,0.00024684131,0.00034912536],"domain_scores_gemma":[0.9911255,0.006383068,0.0009310401,0.00025828104,0.00095372193,0.00034841525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030416893,0.0012673561,0.002033543,0.0016945502,0.000916253,0.0019926794,0.0035386276,0.003113645,0.0025291557],"category_scores_gemma":[0.013077122,0.0011926078,0.00082427356,0.0019060267,0.0017316386,0.0032596798,0.0013778198,0.0017033363,0.00037109345],"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.00005057441,0.00003269358,0.00096867984,0.000050731695,0.00002093541,0.00009789353,0.000061659586,0.96476084,0.0004248286,0.030583879,0.00089572044,0.0020515176],"study_design_scores_gemma":[0.000003843562,0.000006671842,0.000120764285,0.0000041001454,0.000008055909,0.00001729818,0.000009145917,0.9962035,0.00005276656,0.003479209,0.00009013604,0.000004511635],"about_ca_topic_score_codex":0.017671775,"about_ca_topic_score_gemma":0.009984979,"teacher_disagreement_score":0.017671775,"about_ca_system_score_codex":0.003912444,"about_ca_system_score_gemma":0.0019091599,"threshold_uncertainty_score":0.035137832},"labels":[],"label_agreement":null},{"id":"W2273658040","doi":"10.1109/glocom.2015.7417166","title":"Cross-Layer Optimization of Fast Video Delivery in Cache-Enabled Relaying Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"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 British Columbia","funders":"","keywords":"Computer science; Cache; Scheduling (production processes); Exploit; Computer network; Optimization problem; Cross-layer optimization; Convex optimization; Constrained optimization problem; Minification; Reduction (mathematics); Distributed computing; Real-time computing; Regular polygon; Wireless; Mathematical optimization; Wireless network; Algorithm","score_opus":0.08311168232316223,"score_gpt":0.31933122107673595,"score_spread":0.2362195387535737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273658040","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.092152186,0.001324698,0.9026126,0.00031147242,0.000049616494,0.00004129963,0.000071876326,0.0001386022,0.0032976463],"genre_scores_gemma":[0.9535554,0.0008032712,0.042084116,0.00006821996,0.000030936008,0.0000898982,0.00007023824,0.00006006855,0.0032378654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954444,0.00017168105,0.000015966707,0.00008416959,0.000095019655,0.000088799454],"domain_scores_gemma":[0.99904305,0.0006248494,0.0001219297,0.000033809545,0.00013785003,0.000038549606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009611,0.0012792503,0.0010503272,0.00038523384,0.00030124467,0.0011942402,0.0009329586,0.001148214,0.0008774661],"category_scores_gemma":[0.0024874345,0.00047994,0.00044517152,0.0005486097,0.0007109217,0.0011743858,0.0008621883,0.0006377286,0.00016562309],"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.000042402102,0.000016297188,0.00018690727,0.000050006027,0.00002066194,0.00008327469,0.00003072531,0.98292327,0.003511381,0.0077064442,0.0002681455,0.005160572],"study_design_scores_gemma":[0.000002884452,0.000024795476,0.000041682877,0.00000194927,0.000004401269,0.000010852649,0.00000587605,0.99848723,0.00040243097,0.0009412056,0.00007412756,0.000002596969],"about_ca_topic_score_codex":0.003936471,"about_ca_topic_score_gemma":0.0021153905,"teacher_disagreement_score":0.003936471,"about_ca_system_score_codex":0.0014609304,"about_ca_system_score_gemma":0.0010273184,"threshold_uncertainty_score":0.010599792},"labels":[],"label_agreement":null},{"id":"W2280239358","doi":"10.1002/dac.3092","title":"Mobile internet: content, security and terminal","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Terminal (telecommunication); Mobile internet; Computer network; Computer security; The Internet; Internet privacy; Telecommunications; World Wide Web","score_opus":0.06405320741582149,"score_gpt":0.2985422041771983,"score_spread":0.2344889967613768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280239358","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022126902,0.15600292,0.41485655,0.041469976,0.013090543,0.00080417236,0.00085897936,0.0025183635,0.34827155],"genre_scores_gemma":[0.4259124,0.1520608,0.22417012,0.009158441,0.019263176,0.0009042984,0.0016105695,0.0010066386,0.1659135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833906,0.00044040626,0.00008748202,0.00017158377,0.00084527646,0.000116227784],"domain_scores_gemma":[0.99845505,0.0004651186,0.00014309245,0.00020026816,0.0005302347,0.00020628217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270787,0.00092198554,0.00077171414,0.0029031343,0.001382505,0.008131087,0.0010598126,0.003025691,0.0062368717],"category_scores_gemma":[0.0042288518,0.0005666785,0.00041322192,0.0039713,0.002526529,0.010135988,0.003027832,0.0023919835,0.0029603213],"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.00005221978,0.00005016547,0.0008335423,0.0006427527,0.000026648473,0.000321023,0.00059848634,0.0038539593,0.0031193336,0.52521455,0.08235316,0.38293424],"study_design_scores_gemma":[0.000013761227,0.0001227221,0.001545656,0.00073031813,0.000042762607,0.0023289504,0.0007587885,0.022025917,0.0017220401,0.17764026,0.79296434,0.00010454777],"about_ca_topic_score_codex":0.0015941801,"about_ca_topic_score_gemma":0.0011849891,"teacher_disagreement_score":0.008131087,"about_ca_system_score_codex":0.0017213844,"about_ca_system_score_gemma":0.0013436998,"threshold_uncertainty_score":0.020864427},"labels":[],"label_agreement":null},{"id":"W2288751468","doi":"10.1109/pdcat.2010.28","title":"A Random Heuristic for Message Broadcasting in Arbitrary Networks","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing: Applications and Technologies","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Heuristic; Computer science; Broadcasting (networking); Null-move heuristic; Node (physics); Consistent heuristic; Tree (set theory); Path (computing); Distributed computing; Theoretical computer science; Algorithm; Computer network; Incremental heuristic search; Search algorithm; Mathematics; Artificial intelligence; Beam search","score_opus":0.009504980256280092,"score_gpt":0.22942314366997096,"score_spread":0.21991816341369086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288751468","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.019455738,0.00030711677,0.9749673,0.00021268753,0.00008587446,0.00023085141,0.00008784488,0.00078474544,0.0038677836],"genre_scores_gemma":[0.38087946,0.0003518135,0.61329263,0.0002371653,0.00009573671,0.00061551883,0.00043406975,0.0003319889,0.0037615558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981773,0.0008928448,0.00007155712,0.00023147438,0.00039754127,0.00022931366],"domain_scores_gemma":[0.9953251,0.0031062614,0.0003066714,0.0007638086,0.00030987416,0.00018813144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019103241,0.0005754138,0.00094651367,0.0011182714,0.0010830496,0.0008634519,0.0021698033,0.0011209138,0.0031780954],"category_scores_gemma":[0.0070341844,0.0004178442,0.0006074124,0.0011390835,0.0013385701,0.001668467,0.0010713832,0.00086421496,0.00075573934],"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.0008064437,0.0002649139,0.0008529131,0.00037006958,0.000107831016,0.00032785782,0.00037410183,0.69755864,0.011158079,0.12950271,0.009851812,0.14882466],"study_design_scores_gemma":[0.00021304125,0.00017678928,0.00015735319,0.000030227346,0.000042759635,0.00020859255,0.00007246103,0.9425446,0.0050760168,0.043130748,0.0083062025,0.00004124447],"about_ca_topic_score_codex":0.0015927069,"about_ca_topic_score_gemma":0.0017229774,"teacher_disagreement_score":0.0031780954,"about_ca_system_score_codex":0.0014663069,"about_ca_system_score_gemma":0.0015262194,"threshold_uncertainty_score":0.010638833},"labels":[],"label_agreement":null},{"id":"W2290505806","doi":"10.1109/iwqos.2015.7404751","title":"WebPro: A proxy-based approach for low latency web browsing on mobile devices","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Web page; Mobile device; World Wide Web; Web navigation; Proxy (statistics); Computer network; Database; Mobile Web; Mobile technology","score_opus":0.0386255355241103,"score_gpt":0.25173009522058554,"score_spread":0.21310455969647524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290505806","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.08731052,0.003933755,0.8042,0.0003664973,0.0003936129,0.0010433912,0.00083595363,0.08387387,0.018042373],"genre_scores_gemma":[0.6492887,0.0015730356,0.31377947,0.0004968112,0.0002038629,0.00045926057,0.002449762,0.0026933753,0.029055698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999049,0.00012173766,0.00007362758,0.00013039053,0.0004707582,0.00015443261],"domain_scores_gemma":[0.9986331,0.00014572972,0.00011596724,0.00066260376,0.00026537117,0.0001772064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005393218,0.000916068,0.00082317553,0.0010091749,0.0005836878,0.0017371732,0.0034386348,0.001080093,0.0038663778],"category_scores_gemma":[0.0015916441,0.00049704214,0.0004041325,0.0012563529,0.00041146294,0.002305882,0.0017436204,0.0009361851,0.0024738018],"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.0031090449,0.0012237141,0.006047861,0.001263369,0.00032057453,0.001764739,0.0005354721,0.015524977,0.286779,0.013023111,0.042665213,0.62774295],"study_design_scores_gemma":[0.0007480412,0.0018759262,0.009146502,0.00022176359,0.00040686782,0.00395477,0.00040860203,0.50123006,0.2968128,0.009852582,0.17491664,0.00042548348],"about_ca_topic_score_codex":0.0031784668,"about_ca_topic_score_gemma":0.0027735862,"teacher_disagreement_score":0.0038663778,"about_ca_system_score_codex":0.0005527525,"about_ca_system_score_gemma":0.0008691789,"threshold_uncertainty_score":0.012934327},"labels":[],"label_agreement":null},{"id":"W2293223786","doi":"10.1109/csci.2015.30","title":"Bloom Filter Tree for Fast Search in Tree-Structured Data","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Bloom filter; Tree traversal; Computer science; Tree (set theory); Search tree; Pruning; Set (abstract data type); Interval tree; Fractal tree index; Node (physics); Metadata; Optimal binary search tree; Data structure; Depth-first search; Filter (signal processing); Data mining; Algorithm; Search algorithm; Mathematics; World Wide Web","score_opus":0.14177595912193267,"score_gpt":0.305617112929154,"score_spread":0.16384115380722133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293223786","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.012676762,0.0006847175,0.98324066,0.00029702138,0.000034637716,0.00016693484,0.00023075422,0.0013780252,0.0012904826],"genre_scores_gemma":[0.11937673,0.00062269566,0.87748504,0.00015206845,0.00004464158,0.00029801924,0.0005044403,0.00011061411,0.0014058107],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846053,0.0004007867,0.00014343481,0.00017399895,0.00067253056,0.0001487781],"domain_scores_gemma":[0.99493563,0.0030406767,0.00032733465,0.00079615065,0.0007464087,0.00015373135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023356813,0.00057088595,0.0012227544,0.0021375215,0.001491182,0.0019311383,0.0016915825,0.0014233515,0.0023475885],"category_scores_gemma":[0.009470443,0.000551916,0.00070828066,0.003964107,0.0009838974,0.0046427757,0.0012957304,0.00114332,0.00084243],"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.0009609214,0.00028588047,0.0036291298,0.00064336875,0.0001466659,0.00043586368,0.0008890245,0.24194829,0.030346986,0.23936252,0.019378424,0.46197292],"study_design_scores_gemma":[0.00011423773,0.00014192513,0.00030162113,0.000052464202,0.000036215162,0.00022199821,0.00010694677,0.87668514,0.01105817,0.101430185,0.009818434,0.000032697335],"about_ca_topic_score_codex":0.006349551,"about_ca_topic_score_gemma":0.0073334896,"teacher_disagreement_score":0.006349551,"about_ca_system_score_codex":0.0027236263,"about_ca_system_score_gemma":0.0036822525,"threshold_uncertainty_score":0.019761324},"labels":[],"label_agreement":null},{"id":"W2295758551","doi":"10.1007/978-3-319-27072-2_4","title":"Application Platform for Smart Transportation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Cloud computing; Provisioning; Computer science; Analytics; Space (punctuation); Data science; Database; Telecommunications; Operating system","score_opus":0.03565193523742028,"score_gpt":0.24174252658439846,"score_spread":0.20609059134697819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295758551","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.02389093,0.003958875,0.5786161,0.0017188304,0.0017234535,0.0010094115,0.007147591,0.13019547,0.25173938],"genre_scores_gemma":[0.2635382,0.0057653673,0.21830626,0.0016664184,0.0006193482,0.001276879,0.029462561,0.011964932,0.4674001],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997657,0.00003583159,0.000017939516,0.000038877646,0.00009246443,0.000049136062],"domain_scores_gemma":[0.9997917,0.000026786149,0.000008528194,0.000062377745,0.00006172479,0.000048899205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003977921,0.0010541205,0.00053257815,0.000710941,0.00046290818,0.0015935587,0.001306867,0.0008699827,0.042258132],"category_scores_gemma":[0.00062383205,0.00042109835,0.00044976393,0.00080125284,0.00019766692,0.002336437,0.0018949214,0.0012089665,0.023106145],"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.0006114026,0.00034576235,0.0011038652,0.0006777266,0.00009321083,0.0008657564,0.0004369366,0.008712217,0.047242854,0.07431478,0.43619353,0.42940196],"study_design_scores_gemma":[0.00006159595,0.000117551725,0.0010245469,0.00013258205,0.000056319914,0.00045738075,0.00010839146,0.054567527,0.0162022,0.017789137,0.9094201,0.00006260899],"about_ca_topic_score_codex":0.002075177,"about_ca_topic_score_gemma":0.0016747804,"teacher_disagreement_score":0.042258132,"about_ca_system_score_codex":0.00037839345,"about_ca_system_score_gemma":0.0005956293,"threshold_uncertainty_score":0.14136755},"labels":[],"label_agreement":null},{"id":"W2296046349","doi":"10.1145/2832241.2832247","title":"Hyper-Q aware intranode MPI collectives on the GPU","year":2015,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; CUDA; Inter-process communication; Parallel computing; Context (archaeology); Overhead (engineering); Host (biology); Process (computing); General-purpose computing on graphics processing units; Service (business); Distributed computing; Feature (linguistics); Message passing; Operating system","score_opus":0.06284357033243061,"score_gpt":0.23175635587529964,"score_spread":0.16891278554286904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296046349","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.3609101,0.0006623686,0.58587027,0.0007467252,0.00035829633,0.00022439622,0.00027601284,0.025403058,0.025548734],"genre_scores_gemma":[0.64869833,0.0001730649,0.33794436,0.00021510622,0.000057202007,0.00020190852,0.00060825434,0.0011784248,0.010923371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994106,0.000095022515,0.000028272265,0.0001325732,0.00021618353,0.00011735953],"domain_scores_gemma":[0.9990747,0.00017098956,0.00006948632,0.00031243105,0.00027166752,0.00010077749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006717476,0.00066059607,0.000597946,0.00047195406,0.0010369404,0.0011518383,0.0020236888,0.0006768474,0.0030363163],"category_scores_gemma":[0.0015255727,0.0003378591,0.00053539564,0.00067267526,0.0007938225,0.0013512836,0.0016025832,0.00091503817,0.0010826339],"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.0014169574,0.00046736788,0.011848396,0.0003303135,0.00017966842,0.0008323014,0.0013220921,0.5431349,0.113411576,0.03510997,0.031959824,0.2599866],"study_design_scores_gemma":[0.00009229471,0.00014725742,0.0009800857,0.00001152511,0.000022468912,0.00008856278,0.00014649292,0.9648202,0.018147504,0.006654646,0.008863664,0.000025265414],"about_ca_topic_score_codex":0.009586707,"about_ca_topic_score_gemma":0.011633169,"teacher_disagreement_score":0.009586707,"about_ca_system_score_codex":0.001090447,"about_ca_system_score_gemma":0.0021269468,"threshold_uncertainty_score":0.019061804},"labels":[],"label_agreement":null},{"id":"W231787360","doi":"10.1007/s11036-015-0616-1","title":"Software Defined Mobile Cloudlet","year":2015,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Cloudlet; OpenFlow; Forwarding plane; Distributed computing; Network packet; Software-defined networking; Mobile device; Operating system","score_opus":0.014588533434225663,"score_gpt":0.22825862493389745,"score_spread":0.21367009149967178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W231787360","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.11942945,0.002320763,0.76439846,0.0012630736,0.0020406994,0.0013801388,0.0018314791,0.031521153,0.07581478],"genre_scores_gemma":[0.8581481,0.0009967074,0.086989716,0.001535374,0.00041546486,0.00037840917,0.0026226453,0.0013605262,0.047553055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917644,0.00010201043,0.000056133224,0.00014011556,0.0003028881,0.00022235766],"domain_scores_gemma":[0.9981945,0.00016771605,0.00012650975,0.0006472968,0.00058661815,0.00027737115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428518,0.000663989,0.00076230627,0.0005816053,0.0008764104,0.0025196872,0.0016458828,0.00086975977,0.0070684757],"category_scores_gemma":[0.0020169031,0.00027832482,0.00035146356,0.0007337448,0.00043892502,0.0017603029,0.0016173405,0.0016136074,0.0031500882],"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.004120294,0.0014021181,0.006144395,0.00081400585,0.00032660016,0.0016986614,0.0007596195,0.023182668,0.15149786,0.27261078,0.16858526,0.3688577],"study_design_scores_gemma":[0.00047891,0.0009625514,0.0037835524,0.00018059839,0.0002317364,0.0023828172,0.00023330616,0.4869503,0.107452154,0.04124942,0.35591853,0.00017609539],"about_ca_topic_score_codex":0.0019498828,"about_ca_topic_score_gemma":0.0022393803,"teacher_disagreement_score":0.0070684757,"about_ca_system_score_codex":0.0010555369,"about_ca_system_score_gemma":0.0012828136,"threshold_uncertainty_score":0.023646414},"labels":[],"label_agreement":null},{"id":"W2320309422","doi":"10.1109/tii.2016.2543258","title":"Cost-Efficient Remote Backup Services for Enterprise Clouds","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Caching and Content Delivery","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":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Neptune; Computer science; Backup; Cloud computing; Data deduplication; Redundancy (engineering); Server; Hash function; Operating system; Computer network; Distributed computing; Database; Computer security","score_opus":0.06564917676955907,"score_gpt":0.27258463920740844,"score_spread":0.20693546243784938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320309422","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.5819936,0.0019404863,0.39629158,0.0010221861,0.00019654412,0.00022600548,0.00059136155,0.01145327,0.006284993],"genre_scores_gemma":[0.9605283,0.00014145237,0.03788371,0.000047262147,0.00001777483,0.000020547515,0.00023579363,0.00008510944,0.0010400866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.00010383768,0.000039078706,0.00009907467,0.0002945244,0.00021633788],"domain_scores_gemma":[0.9984675,0.00027136705,0.00013277415,0.0006104303,0.00036094713,0.00015710821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006320035,0.0006069029,0.00068757235,0.00066548283,0.0012942521,0.0009700472,0.0022143174,0.0005581378,0.0017570951],"category_scores_gemma":[0.0024147271,0.00024755814,0.00028316973,0.0011033225,0.00044905083,0.0017929025,0.0014244532,0.0006011827,0.0004751395],"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.0024667766,0.0006876827,0.008649142,0.00042079279,0.00012783178,0.0012835308,0.00059045997,0.35498023,0.11208334,0.016378444,0.026421664,0.47591013],"study_design_scores_gemma":[0.00007135729,0.00014970764,0.0025013266,0.000015578784,0.000026776315,0.0002818026,0.000283118,0.9524279,0.033432826,0.0062314332,0.0045408723,0.000037230864],"about_ca_topic_score_codex":0.008000488,"about_ca_topic_score_gemma":0.008080293,"teacher_disagreement_score":0.008000488,"about_ca_system_score_codex":0.0011437617,"about_ca_system_score_gemma":0.001488318,"threshold_uncertainty_score":0.015907824},"labels":[],"label_agreement":null},{"id":"W2330589202","doi":"10.1109/mce.2014.2338496","title":"How Data Centers Provide Consumer Services [The Art of Storage]","year":2014,"lang":"en","type":"article","venue":"IEEE Consumer Electronics Magazine","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"Computer science; Cloud computing; Server; Computer data storage; Cloud storage; Data access; Data center; The Internet; Internet of Things; Telecommunications; World Wide Web; Database; Computer network; Operating system","score_opus":0.017096659287792786,"score_gpt":0.22761864867067677,"score_spread":0.210521989382884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330589202","genre_codex":"other","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.01338881,0.074434176,0.12451163,0.10557938,0.0073414766,0.00024623214,0.0011073089,0.0019121235,0.6714789],"genre_scores_gemma":[0.3689377,0.12011181,0.12973972,0.047572955,0.005082261,0.00040103143,0.0009722943,0.0024566997,0.32472557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979948,0.0006591572,0.000075949785,0.00032142713,0.00073183654,0.00021701257],"domain_scores_gemma":[0.9982668,0.00051839446,0.00007498587,0.00039764747,0.0006004086,0.00014178368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476821,0.00047334848,0.00036293035,0.0010918841,0.0027550573,0.010746142,0.0012136486,0.0030333544,0.01192435],"category_scores_gemma":[0.003752619,0.00047286478,0.00040471097,0.0026188204,0.0054721595,0.014757982,0.0020961561,0.0029079348,0.006252096],"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.00004466134,0.00003328706,0.00054223626,0.00032305985,0.00002089286,0.00011718944,0.0021455085,0.00073540944,0.0012935573,0.7598007,0.13060126,0.10434216],"study_design_scores_gemma":[0.0000061710653,0.00001658831,0.0002537462,0.00018228454,0.000009873699,0.00020111741,0.00081745,0.0005312255,0.00070041267,0.067605406,0.92965126,0.000024418676],"about_ca_topic_score_codex":0.0103570465,"about_ca_topic_score_gemma":0.008481585,"teacher_disagreement_score":0.01192435,"about_ca_system_score_codex":0.0031016322,"about_ca_system_score_gemma":0.0027774572,"threshold_uncertainty_score":0.039890945},"labels":[],"label_agreement":null},{"id":"W2339352214","doi":"10.1109/mwc.2016.7553027","title":"Tag-assisted social-aware opportunistic device-to-device sharing for traffic offloading in mobile social networks","year":2016,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":57,"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 British Columbia","funders":"","keywords":"Computer science; Exploit; Cellular traffic; Computer network; Cellular network; Mobile device; Mobile telephony; Mobile computing; Pace; Mobile social network; Architecture; Computer security; Mobile radio; World Wide Web","score_opus":0.09720694468092604,"score_gpt":0.32403993126519304,"score_spread":0.22683298658426698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339352214","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.16938893,0.00045825585,0.823568,0.00021494718,0.00006826016,0.000110599525,0.000048373426,0.00042419258,0.0057185236],"genre_scores_gemma":[0.9822435,0.00007498748,0.016972955,0.000028291897,0.000011670096,0.000030235073,0.000015909944,0.000013417654,0.00060896174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946684,0.00019456621,0.00001977794,0.00007378255,0.0001204471,0.00012454955],"domain_scores_gemma":[0.9991737,0.00039588066,0.00008671223,0.00013395536,0.00011692388,0.00009270379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007116633,0.0006420702,0.00073453126,0.0005289586,0.0009693391,0.00086999056,0.0011864862,0.0006468182,0.00081025454],"category_scores_gemma":[0.0015920616,0.00025562008,0.00046991688,0.0007621436,0.00073451584,0.0011346007,0.0014919043,0.0004150071,0.00019199816],"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.00023472018,0.00029384854,0.0038090837,0.00012010099,0.000095835625,0.00042358044,0.00036463063,0.8442236,0.023027033,0.032497022,0.0016429165,0.09326754],"study_design_scores_gemma":[0.000005017473,0.000040270865,0.00021727722,0.0000026461466,0.000008915588,0.000050646468,0.00004851394,0.9921151,0.0012355568,0.005625269,0.00064159377,0.000009216126],"about_ca_topic_score_codex":0.002987599,"about_ca_topic_score_gemma":0.006122125,"teacher_disagreement_score":0.002987599,"about_ca_system_score_codex":0.00085061596,"about_ca_system_score_gemma":0.00085532793,"threshold_uncertainty_score":0.0061717033},"labels":[],"label_agreement":null},{"id":"W2342910849","doi":"10.1109/lcomm.2016.2558144","title":"Adaptive Delivery in Caching Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Redundancy (engineering); Computer network; Content delivery; Upper and lower bounds; Transmission (telecommunications); Monte Carlo method; Distributed computing; Mathematical optimization; Telecommunications; Mathematics; Statistics","score_opus":0.03457221836502291,"score_gpt":0.23808526651254291,"score_spread":0.20351304814752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342910849","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.07355768,0.0033795075,0.9158048,0.00058803445,0.00010999889,0.00009079069,0.00009326533,0.00038813514,0.0059878523],"genre_scores_gemma":[0.8927773,0.001918773,0.10018007,0.00016816697,0.00009980262,0.00013071674,0.00009167282,0.000064257736,0.004569267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992932,0.00032431853,0.000027693211,0.00010400323,0.00016196106,0.00008875622],"domain_scores_gemma":[0.9976331,0.0016756146,0.00018007158,0.00016235255,0.00029260604,0.000056347177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009987555,0.0005015865,0.00074012,0.00055684603,0.00071724737,0.0010273688,0.0011775387,0.001185019,0.0012580922],"category_scores_gemma":[0.0053351806,0.00035464356,0.00033700437,0.0010008443,0.00087861693,0.001473642,0.0007995714,0.0007603166,0.00021156398],"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.00020633821,0.000042651336,0.0009285419,0.00022875723,0.000054278302,0.00035283715,0.00018096513,0.8344948,0.008149049,0.09758307,0.0032680854,0.054510526],"study_design_scores_gemma":[0.000012405603,0.000032252803,0.00011184684,0.000009294841,0.000011716816,0.00008289341,0.000023110062,0.98350835,0.001004326,0.014006226,0.0011881421,0.000009495211],"about_ca_topic_score_codex":0.0038760386,"about_ca_topic_score_gemma":0.00209707,"teacher_disagreement_score":0.0038760386,"about_ca_system_score_codex":0.0017853872,"about_ca_system_score_gemma":0.00061503734,"threshold_uncertainty_score":0.012953937},"labels":[],"label_agreement":null},{"id":"W2359026266","doi":"","title":"Research on Storage Virtualization Technologies","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Converged storage; Storage virtualization; Computer science; Virtualization; Storage area network; Operating system; Full virtualization; Application virtualization; Information repository; Storage efficiency; iSCSI; Object storage; Computer data storage; Embedded system; Fibre Channel; Cloud computing","score_opus":0.03031756303936663,"score_gpt":0.31845237598197323,"score_spread":0.2881348129426066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359026266","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03385798,0.32233107,0.28983203,0.017568422,0.0049329777,0.0002683121,0.00030614794,0.00067207095,0.33023095],"genre_scores_gemma":[0.5289777,0.29692584,0.10561255,0.0041925665,0.0042985384,0.00045364845,0.00051317277,0.00024252021,0.058783393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985002,0.00038272858,0.0000959902,0.00027062744,0.000563978,0.00018649064],"domain_scores_gemma":[0.9982046,0.0007501448,0.00010464744,0.00027302,0.00058707804,0.000080471385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016321206,0.0006252781,0.0005915947,0.0014067173,0.0010856878,0.005144475,0.0015837973,0.0015378622,0.004696649],"category_scores_gemma":[0.0032736142,0.00047624612,0.00061444414,0.0025729316,0.0017653367,0.011254288,0.0017664025,0.0026338114,0.001403745],"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.000024682124,0.000042829357,0.00037538513,0.000526391,0.000028560395,0.00013469435,0.0003683579,0.0030235462,0.0025206697,0.8856679,0.008389185,0.09889779],"study_design_scores_gemma":[0.00002494749,0.000114787144,0.0007143992,0.0010164443,0.000058190373,0.001431632,0.00064260565,0.021141127,0.012210303,0.40833586,0.55423975,0.000069950824],"about_ca_topic_score_codex":0.0013568798,"about_ca_topic_score_gemma":0.0005657163,"teacher_disagreement_score":0.005144475,"about_ca_system_score_codex":0.0030315365,"about_ca_system_score_gemma":0.0021770482,"threshold_uncertainty_score":0.021995425},"labels":[],"label_agreement":null},{"id":"W2365886613","doi":"","title":"A Resource Discovery Algorithm of Mobile Phone Communication Based on Mobile Ad Hoc Network and Its Implementation","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Datagram; Multicast; Distributed computing; Mobile computing; Unicast; Wireless ad hoc network; Optimized Link State Routing Protocol; Mobile phone; Routing protocol; Network packet; Wireless; Operating system","score_opus":0.006473567865130068,"score_gpt":0.24777731386705232,"score_spread":0.24130374600192225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365886613","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.0109228445,0.0004999703,0.98208916,0.00018328635,0.00013962052,0.00015015138,0.00003990943,0.0014262972,0.0045488332],"genre_scores_gemma":[0.31398013,0.00063632434,0.676521,0.00014694953,0.00010072482,0.00040136083,0.00023425958,0.00008515012,0.007894108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995814,0.000089199115,0.00003862637,0.00009878735,0.00014424942,0.000047660233],"domain_scores_gemma":[0.99972004,0.000059253587,0.000018673583,0.00004256746,0.00014005802,0.00001940816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000379316,0.00040844321,0.00048666136,0.0007842795,0.0008711162,0.000783188,0.0009814537,0.00064402184,0.0016730623],"category_scores_gemma":[0.00090457,0.00023096341,0.0002828319,0.0007093928,0.0003402358,0.0013632617,0.0004496762,0.00048611913,0.0005742991],"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.00031366057,0.00016964409,0.0024828264,0.00030390965,0.00011032699,0.00035794693,0.00036890214,0.11398333,0.0314019,0.07274486,0.014246965,0.7635158],"study_design_scores_gemma":[0.00008555202,0.00019738999,0.00068130007,0.00002379542,0.000048289992,0.00067861384,0.00010744626,0.94482875,0.01891507,0.009127608,0.02523751,0.00006874017],"about_ca_topic_score_codex":0.0041307285,"about_ca_topic_score_gemma":0.0028803672,"teacher_disagreement_score":0.0041307285,"about_ca_system_score_codex":0.0007177629,"about_ca_system_score_gemma":0.0010728682,"threshold_uncertainty_score":0.008213341},"labels":[],"label_agreement":null},{"id":"W2365936287","doi":"","title":"A P2 PApproach to Enhance the Service Ability of Web 2.0 Video Sites","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bottleneck; Computer science; Service (business); Node (physics); Computer network; File sharing; World Wide Web; Multimedia; The Internet; Embedded system","score_opus":0.011571823709251874,"score_gpt":0.25374250915374874,"score_spread":0.24217068544449688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365936287","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.29578587,0.0010553565,0.64470804,0.0019672103,0.00026690308,0.00042871162,0.00013232812,0.0050368025,0.050618768],"genre_scores_gemma":[0.85443056,0.0003225583,0.13407204,0.00021961979,0.00011497935,0.0001559842,0.000095756026,0.00009063655,0.010497868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997223,0.00008132335,0.000009163713,0.000044111468,0.0000833248,0.000059783753],"domain_scores_gemma":[0.9995987,0.000105466424,0.000033707583,0.00008542993,0.00011188014,0.000064831394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035551385,0.0005008481,0.00025770353,0.00060058763,0.00069186947,0.0007391974,0.0009650863,0.0007684826,0.0035860569],"category_scores_gemma":[0.0010864545,0.00019525125,0.00023193905,0.000613664,0.00032794772,0.0015519483,0.00072628335,0.00044012204,0.0009549072],"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.0012087281,0.0013939427,0.007692553,0.00042161183,0.00013043013,0.0014852728,0.0002982071,0.08569986,0.18897778,0.057814214,0.024967462,0.62990993],"study_design_scores_gemma":[0.00044043377,0.0024538087,0.0066253846,0.000053755153,0.00014787751,0.0028624036,0.00031986352,0.75373894,0.13736017,0.024018386,0.07187514,0.00010381834],"about_ca_topic_score_codex":0.003012859,"about_ca_topic_score_gemma":0.003444645,"teacher_disagreement_score":0.0035860569,"about_ca_system_score_codex":0.00038371002,"about_ca_system_score_gemma":0.0007991197,"threshold_uncertainty_score":0.011996567},"labels":[],"label_agreement":null},{"id":"W2373511723","doi":"10.1145/2901378.2901398","title":"A Simulator for Distributed Cache Managementin Friend-to-Friend Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Calgary","funders":"","keywords":"Computer science; Cache; The Internet; Computer network; Bandwidth (computing); Encryption; Network topology; Internet topology; World Wide Web","score_opus":0.013651946300939776,"score_gpt":0.22921178345386403,"score_spread":0.21555983715292426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2373511723","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.05437418,0.00033457036,0.9320783,0.0005219036,0.00018680883,0.00065235776,0.0011909887,0.0035622811,0.0070985695],"genre_scores_gemma":[0.62497014,0.0006235034,0.36096004,0.0002557233,0.00008631522,0.0021083618,0.0016064486,0.00053828175,0.008851155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991949,0.00033126722,0.000063972366,0.00009139835,0.00022897657,0.000089539055],"domain_scores_gemma":[0.99615026,0.0024995145,0.00022992473,0.0003747684,0.0005229398,0.00022257159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014265887,0.00092175935,0.00095614046,0.000594966,0.0010080026,0.001139522,0.0028062714,0.0019892561,0.007809582],"category_scores_gemma":[0.006004774,0.000563272,0.00081629027,0.000514352,0.00091385795,0.0011372296,0.0018036161,0.0017690337,0.0006997175],"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.00017399863,0.00014731682,0.0012990829,0.00012034132,0.000046531797,0.00013536058,0.000154431,0.9597506,0.0029970645,0.024426075,0.0020956493,0.0086534815],"study_design_scores_gemma":[0.00002678942,0.00001981422,0.000037225756,0.0000039504525,0.0000046390915,0.000010980985,0.0000052696187,0.9965048,0.0004197572,0.0018034122,0.0011596193,0.0000037847349],"about_ca_topic_score_codex":0.006220213,"about_ca_topic_score_gemma":0.005595146,"teacher_disagreement_score":0.007809582,"about_ca_system_score_codex":0.0015414797,"about_ca_system_score_gemma":0.0017223107,"threshold_uncertainty_score":0.02612567},"labels":[],"label_agreement":null},{"id":"W2380898862","doi":"","title":"GCaching—A Grid-Based Cooperative Caching System","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"CAE (Canada)","funders":"","keywords":"Computer science; Cache; Server; Distributed computing; Smart Cache; Grid; Cache algorithms; Cache invalidation; False sharing; Proxy server; Computer network; Proxy (statistics); CPU cache; Operating system","score_opus":0.011152237457317903,"score_gpt":0.20620913948000466,"score_spread":0.19505690202268675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380898862","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.11332498,0.0010805643,0.85905915,0.0006367874,0.0002294668,0.00038810456,0.00030692085,0.014657889,0.0103160795],"genre_scores_gemma":[0.8024669,0.00050800334,0.18939675,0.0002831181,0.0000648598,0.00025013924,0.0006715173,0.00012689212,0.006231873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963486,0.00009410494,0.000024455036,0.00007099593,0.000114010516,0.000061543484],"domain_scores_gemma":[0.99924517,0.0000975648,0.0000527963,0.00026579958,0.00020049355,0.00013826675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032248907,0.0003695266,0.0007618077,0.00046431329,0.0010790305,0.0009106723,0.0017530082,0.0006631495,0.001561023],"category_scores_gemma":[0.0007944794,0.00023847645,0.00028465822,0.001233922,0.00050178444,0.0014033968,0.0016867266,0.00068145845,0.0006307233],"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.00141172,0.0006806447,0.011834049,0.00045122788,0.00022604219,0.00182656,0.00083944784,0.2942616,0.05546965,0.048045214,0.06208391,0.52287006],"study_design_scores_gemma":[0.00014318497,0.00021704967,0.0013164659,0.000016307718,0.00007552833,0.0006296601,0.00018625677,0.94815123,0.009891906,0.007731129,0.031571742,0.00006949508],"about_ca_topic_score_codex":0.01020012,"about_ca_topic_score_gemma":0.008232574,"teacher_disagreement_score":0.01020012,"about_ca_system_score_codex":0.0006979786,"about_ca_system_score_gemma":0.0013733219,"threshold_uncertainty_score":0.020281494},"labels":[],"label_agreement":null},{"id":"W2386090715","doi":"","title":"Research on Solution of Lost Secret Shares in Ad Hoc Net Trust Mode","year":2006,"lang":"en","type":"article","venue":"Science Technology and Engineering","topic":"Caching and Content Delivery","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":"Huawei Technologies (Canada)","funders":"","keywords":"Asynchronous communication; Computer security; Wireless ad hoc network; Computer science; Mode (computer interface); Net (polyhedron); Resource (disambiguation); Computer network; Telecommunications; Mathematics; Wireless; Operating system","score_opus":0.01993196181454946,"score_gpt":0.2670450678984876,"score_spread":0.24711310608393813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2386090715","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.069879696,0.0016463904,0.9213224,0.0008914581,0.0001529452,0.000116484916,0.0000278822,0.00022559472,0.0057370816],"genre_scores_gemma":[0.8692959,0.0018456606,0.120056145,0.00012866288,0.00013252017,0.0001073695,0.000050443865,0.000039159517,0.008344105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883586,0.00037088565,0.0000612628,0.00017123765,0.00036604315,0.00019472878],"domain_scores_gemma":[0.9983693,0.0006697691,0.00016802928,0.00025516967,0.0004452454,0.00009253362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328627,0.0004080157,0.00049392035,0.000482931,0.00099567,0.0012570585,0.0015613143,0.0010221993,0.0020989447],"category_scores_gemma":[0.0042235,0.00024737176,0.0004699727,0.0006448424,0.0006927989,0.004024886,0.00090290117,0.0009302584,0.00022588321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0009432448,0.00031547714,0.0044706683,0.0011509729,0.0002474996,0.0015064408,0.0029668487,0.13998182,0.054930538,0.3958703,0.0071521993,0.39046404],"study_design_scores_gemma":[0.00014381098,0.00044967767,0.0005850259,0.000105893334,0.00014072511,0.0012647494,0.0010432616,0.85646844,0.03278891,0.091220476,0.01573323,0.000055818044],"about_ca_topic_score_codex":0.0009452907,"about_ca_topic_score_gemma":0.0007322347,"teacher_disagreement_score":0.0020989447,"about_ca_system_score_codex":0.0008420801,"about_ca_system_score_gemma":0.00081862713,"threshold_uncertainty_score":0.007026553},"labels":[],"label_agreement":null},{"id":"W23910454","doi":"10.1016/j.comnet.2004.03.015","title":"Internet economics: pricing and policies","year":2004,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Electricity; Operational costs; Service provider; The Internet; Minification; Distributed computing; Service (business); Operations research","score_opus":0.014486474246741383,"score_gpt":0.1923403429350339,"score_spread":0.17785386868829253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23910454","genre_codex":"other","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.054674733,0.14772843,0.231695,0.15546596,0.004531573,0.00019409052,0.0011874681,0.0005155392,0.40400726],"genre_scores_gemma":[0.7945246,0.0791604,0.019411799,0.0059054494,0.008421161,0.00023402089,0.00029367045,0.00013461149,0.091914296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980488,0.0010947265,0.00006142376,0.00015500313,0.0005131567,0.00012700258],"domain_scores_gemma":[0.99537706,0.0030315302,0.00034655002,0.00039862603,0.00064535707,0.00020080336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023946555,0.0011939047,0.0014947754,0.0015694414,0.001163034,0.009606222,0.0010945471,0.0066515924,0.012495411],"category_scores_gemma":[0.014470208,0.0009838571,0.00041323336,0.0047692363,0.0046879128,0.012024401,0.0012701959,0.004284565,0.0019736052],"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.00001506112,0.000048719216,0.000238528,0.00007385731,0.000010218142,0.00003960931,0.000054278727,0.005833185,0.00008316212,0.9676961,0.012897206,0.013010204],"study_design_scores_gemma":[0.0000144565465,0.000008121793,0.00025009745,0.000056080262,0.000011548165,0.00011562563,0.000060648035,0.00849887,0.000054627475,0.9728785,0.018040393,0.000011013704],"about_ca_topic_score_codex":0.0039688773,"about_ca_topic_score_gemma":0.0027248687,"teacher_disagreement_score":0.012495411,"about_ca_system_score_codex":0.0052623046,"about_ca_system_score_gemma":0.0026454558,"threshold_uncertainty_score":0.041801274},"labels":[],"label_agreement":null},{"id":"W2395261749","doi":"10.1002/cpe.3869","title":"Towards traffic minimization for data placement in online social networks","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Server; Locality; Network topology; Data center; Social graph; Hash function; Distributed computing; Partition (number theory); Graph partition; Pairwise comparison; Graph; Theoretical computer science; Computer network; Computer security; Social media; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.07111025820182253,"score_gpt":0.3561732568124616,"score_spread":0.28506299861063905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395261749","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.06888826,0.00030876513,0.92571527,0.0008345253,0.00006085624,0.00016229058,0.00014366883,0.0004325199,0.003453864],"genre_scores_gemma":[0.63785857,0.0002851586,0.3567844,0.0001713852,0.00011137282,0.0002489687,0.0003481435,0.00027532605,0.0039166817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974632,0.0011329689,0.000105657055,0.000438248,0.0005083315,0.0003515159],"domain_scores_gemma":[0.99502254,0.0024187244,0.00047704077,0.000849831,0.00085389137,0.0003779282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024188994,0.0012182913,0.0015356146,0.001493591,0.0017842496,0.0023869516,0.00255743,0.0015477269,0.002360744],"category_scores_gemma":[0.008173019,0.0007111012,0.000827663,0.0018746646,0.0013408292,0.0036533163,0.0029452187,0.0012097913,0.0006861139],"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.0002993825,0.000305349,0.0020702477,0.00026960115,0.00008005212,0.000103195496,0.00032996602,0.7833679,0.010032319,0.07675628,0.006507217,0.11987856],"study_design_scores_gemma":[0.00001018899,0.000041652132,0.00018430261,0.0000075900043,0.0000085777565,0.000031058684,0.00009768599,0.97033465,0.0016315263,0.026635157,0.0010113243,0.0000063365355],"about_ca_topic_score_codex":0.0027755362,"about_ca_topic_score_gemma":0.002717066,"teacher_disagreement_score":0.0027755362,"about_ca_system_score_codex":0.0026585257,"about_ca_system_score_gemma":0.0018598125,"threshold_uncertainty_score":0.019289076},"labels":[],"label_agreement":null},{"id":"W2397720834","doi":"10.1504/ijbpim.2015.071255","title":"Peer-to-peer mobile data flow in a crop field","year":2015,"lang":"en","type":"article","venue":"International Journal of Business Process Integration and Management","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Workflow; Redundancy (engineering); Distributed computing; Wireless; Bloom filter; Revenue; Bandwidth (computing); Computer network; Telecommunications; Database","score_opus":0.04553926683661356,"score_gpt":0.3218219643615243,"score_spread":0.27628269752491075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397720834","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.22681472,0.00053213566,0.764734,0.0004733222,0.00010719119,0.000690752,0.00026548054,0.0025786064,0.0038036718],"genre_scores_gemma":[0.7644473,0.0002788139,0.22912341,0.00007087194,0.00004426627,0.00018883112,0.0002533142,0.00005631999,0.0055369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993438,0.00015656615,0.000056925837,0.00019145511,0.00017346565,0.000077788885],"domain_scores_gemma":[0.998582,0.0006705395,0.000110416404,0.00026021345,0.00027167756,0.00010509274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335199,0.0003303155,0.00055445876,0.0010043087,0.0015429953,0.0011782572,0.0011515054,0.0010286474,0.0015831045],"category_scores_gemma":[0.0029663863,0.00034063307,0.00024839415,0.0009880099,0.0005787815,0.0019985712,0.0010693647,0.000463723,0.0004872627],"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.0021076635,0.0006594264,0.009375352,0.00044334156,0.000108030465,0.002262156,0.002811636,0.21386535,0.111945,0.07306376,0.0085293325,0.5748289],"study_design_scores_gemma":[0.00018327558,0.00043090986,0.0022685505,0.000037851405,0.00004494631,0.0007520292,0.00072630594,0.8936938,0.05165342,0.026561448,0.023575222,0.00007220447],"about_ca_topic_score_codex":0.004441526,"about_ca_topic_score_gemma":0.00357461,"teacher_disagreement_score":0.004441526,"about_ca_system_score_codex":0.00092836714,"about_ca_system_score_gemma":0.001293012,"threshold_uncertainty_score":0.008831382},"labels":[],"label_agreement":null},{"id":"W2401170156","doi":"","title":"Two Classes of Optimal Stopping Redundancy Codes.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Redundancy (engineering); Optimal stopping; Reliability engineering; Mathematical optimization","score_opus":0.01522668041773147,"score_gpt":0.2519546869470045,"score_spread":0.23672800652927303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401170156","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.34413412,0.0045335894,0.48000342,0.004801254,0.0006767983,0.00049472874,0.00351357,0.0014160463,0.1604264],"genre_scores_gemma":[0.90490824,0.0019333677,0.059953716,0.0010765631,0.00037449316,0.0005019035,0.0017146552,0.00029986922,0.029237216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752134,0.0006484241,0.00012609104,0.00035686273,0.00071508705,0.0006322862],"domain_scores_gemma":[0.9890085,0.0062279054,0.0011402658,0.0017341248,0.0011227273,0.00076641625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019434986,0.0008137321,0.0011349892,0.0017821642,0.0010184796,0.0034362716,0.0016194144,0.0021729583,0.0078044636],"category_scores_gemma":[0.019106241,0.0005810438,0.00065563037,0.0017311868,0.0019494216,0.0026515257,0.0018422033,0.0021376864,0.001013743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00026384604,0.000086310334,0.0006417322,0.000115023555,0.000018744373,0.0000906407,0.00013100647,0.014592134,0.0011897265,0.9428308,0.011272411,0.0287677],"study_design_scores_gemma":[0.00020071983,0.00014796568,0.00087441143,0.000100991434,0.00003630861,0.0005394185,0.000114364746,0.15783946,0.002014185,0.82060224,0.017466798,0.000063161046],"about_ca_topic_score_codex":0.0014349909,"about_ca_topic_score_gemma":0.0014845161,"teacher_disagreement_score":0.0078044636,"about_ca_system_score_codex":0.0028384402,"about_ca_system_score_gemma":0.0028298425,"threshold_uncertainty_score":0.026108503},"labels":[],"label_agreement":null},{"id":"W2405190381","doi":"10.1109/icassp.2016.7472332","title":"Joint user association and content placement for Cache-enabled wireless access networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":43,"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":"Backhaul (telecommunications); Computer science; Computer network; Cache; Base station; Wireless network; Wireless; Core network; Distributed computing; Operating system","score_opus":0.05060059157480132,"score_gpt":0.24617298059305384,"score_spread":0.19557238901825252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405190381","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.095673375,0.00041630198,0.90100867,0.0001662519,0.000029366143,0.000062424966,0.000030578714,0.00016339634,0.0024496308],"genre_scores_gemma":[0.911157,0.0002404822,0.08705062,0.00003382442,0.000024201967,0.000053027925,0.000031869153,0.00003153177,0.0013773824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925107,0.00033286738,0.000022928149,0.00009713505,0.00016402996,0.00013200518],"domain_scores_gemma":[0.9986499,0.0008695633,0.00015744429,0.00010537125,0.000139004,0.00007861219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011855249,0.00077533006,0.001157241,0.00046119682,0.0006948933,0.0010806775,0.0011789011,0.0010264745,0.00071182166],"category_scores_gemma":[0.004546906,0.00052310363,0.000361395,0.001014542,0.00085984886,0.0012261232,0.00077574793,0.0006407947,0.00017354381],"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.00004946313,0.000041047497,0.0005682309,0.00002178368,0.000017121902,0.00004424984,0.000025708385,0.98166776,0.002193274,0.0052588517,0.00019448402,0.009918142],"study_design_scores_gemma":[0.0000054634493,0.000019969151,0.000084190724,0.0000013743254,0.000005211242,0.000013734168,0.000008570918,0.9978314,0.00054866116,0.0013463375,0.00013253148,0.0000025295653],"about_ca_topic_score_codex":0.006131135,"about_ca_topic_score_gemma":0.00808298,"teacher_disagreement_score":0.006131135,"about_ca_system_score_codex":0.0014506537,"about_ca_system_score_gemma":0.0016807312,"threshold_uncertainty_score":0.012190938},"labels":[],"label_agreement":null},{"id":"W2409990682","doi":"","title":"EFFECTIVENESS OF LOAD BALANCING IN A DISTRIBUTED WEB CACHING SYSTEM","year":2016,"lang":"en","type":"article","venue":"The 7th International Conference on Computational Methods (ICCM2016)","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Computer science; Load balancing (electrical power); Distributed computing; Round-robin DNS; Network Load Balancing Services; Load sharing; False sharing; Load management; Computer network; Server; The Internet; Cache; CPU cache; Operating system; Cache algorithms; Engineering","score_opus":0.04761222669453954,"score_gpt":0.34708256231946105,"score_spread":0.29947033562492154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409990682","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.92770773,0.0007015655,0.058008965,0.00042416714,0.00008014777,0.000109414956,0.00006812771,0.0009190149,0.011980792],"genre_scores_gemma":[0.9967824,0.000046414,0.0028344956,0.00002615313,0.000010790121,0.0000133678295,0.000021567537,0.000021750795,0.00024304357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767894,0.0009449216,0.00012167082,0.0002942159,0.0006579269,0.00030234215],"domain_scores_gemma":[0.985788,0.00887083,0.0013481384,0.0018354809,0.0015063966,0.00065111154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023843073,0.0006686255,0.0010657415,0.0007369723,0.0011878998,0.0017837826,0.00096351973,0.000888303,0.0014781259],"category_scores_gemma":[0.013640017,0.00027248255,0.00032742726,0.00058320485,0.0011223562,0.0023587437,0.0013622696,0.0006963312,0.00021625518],"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.0016093673,0.000798858,0.010402379,0.00023950433,0.00017411352,0.00043865514,0.00033934953,0.86861855,0.052432775,0.013065447,0.00096311845,0.050917838],"study_design_scores_gemma":[0.000092790804,0.00048039286,0.0028721467,0.000013009393,0.000073262505,0.000108312146,0.00023055875,0.9822391,0.009766192,0.0035875342,0.00051426975,0.000022472515],"about_ca_topic_score_codex":0.0038022867,"about_ca_topic_score_gemma":0.002242214,"teacher_disagreement_score":0.0038022867,"about_ca_system_score_codex":0.0013215325,"about_ca_system_score_gemma":0.0013496322,"threshold_uncertainty_score":0.012609541},"labels":[],"label_agreement":null},{"id":"W2415364921","doi":"10.1109/tmc.2015.2480063","title":"Optimizing Video Request Routing in Mobile Networks with Built-in Content Caching","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Server; Distributed computing; Static routing; Routing (electronic design automation); Routing protocol; Policy-based routing; Dynamic Source Routing","score_opus":0.037449273134749175,"score_gpt":0.25452774424474595,"score_spread":0.21707847110999678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415364921","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.18018802,0.0005568761,0.81416994,0.0003847269,0.000038634516,0.00018676564,0.00009864786,0.00080218347,0.0035742235],"genre_scores_gemma":[0.8278581,0.00029973808,0.17005908,0.000061408165,0.000023080036,0.00007523304,0.00012428401,0.000057103483,0.0014420485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996574,0.00014049123,0.0000126447285,0.0000522992,0.000054996435,0.000082183695],"domain_scores_gemma":[0.999243,0.00044292613,0.00011207009,0.00008064734,0.00008502806,0.00003624606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006113077,0.0007544664,0.00052787043,0.00046012932,0.00064629444,0.00082808384,0.0009455276,0.00079292816,0.0005978736],"category_scores_gemma":[0.0020257372,0.00031112263,0.00027370575,0.00071290485,0.00053392,0.0009889025,0.00046497674,0.0004302022,0.00016781557],"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.00008689433,0.000063320396,0.00082217745,0.00005239647,0.00002481273,0.000070503054,0.00005111056,0.94430935,0.007343008,0.005947967,0.001045082,0.040183358],"study_design_scores_gemma":[0.0000072984794,0.000024395362,0.00009727631,0.0000022655868,0.000006431224,0.000019700896,0.000018542241,0.9952773,0.001942911,0.0023506007,0.00025028494,0.0000030710328],"about_ca_topic_score_codex":0.006247526,"about_ca_topic_score_gemma":0.012353989,"teacher_disagreement_score":0.006247526,"about_ca_system_score_codex":0.0016573225,"about_ca_system_score_gemma":0.0010396809,"threshold_uncertainty_score":0.012422323},"labels":[],"label_agreement":null},{"id":"W2423067156","doi":"10.1002/wcm.2700","title":"Power efficient multicasting for pre‐cached multiple description traffic in a wireless network","year":2016,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","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":"McMaster University","funders":"","keywords":"Computer science; Multicast; Computer network; Transmitter power output; Transmission (telecommunications); Cache; Wireless; Power (physics); Heuristic; Telecommunications; Channel (broadcasting)","score_opus":0.02814377066632176,"score_gpt":0.26717524917394453,"score_spread":0.23903147850762277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2423067156","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.3920588,0.0010231927,0.6027536,0.00042972897,0.000050647603,0.0000829224,0.00007191573,0.00018285158,0.0033463927],"genre_scores_gemma":[0.9673711,0.00031401098,0.031104077,0.00003927633,0.000030516818,0.00003382217,0.00004504342,0.000021932718,0.0010401988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994856,0.0002555766,0.000014071572,0.000045271885,0.00010127861,0.00009812778],"domain_scores_gemma":[0.9977738,0.0017331193,0.00017943319,0.00008776799,0.00016111937,0.000064589534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011586176,0.00074883684,0.0009419714,0.00075079245,0.00064080994,0.0007467673,0.0011158808,0.0008182953,0.0008971137],"category_scores_gemma":[0.0029425428,0.00038236592,0.000428107,0.0009649203,0.000575937,0.001220078,0.0006461392,0.00053095596,0.00012225803],"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.000102970356,0.00005557367,0.00055495155,0.000058084173,0.000020299129,0.0001298617,0.00004658088,0.9785404,0.003906462,0.003634931,0.00040723506,0.0125427125],"study_design_scores_gemma":[0.000005729776,0.000023926792,0.00006975425,0.0000014336946,0.0000031680725,0.0000141019245,0.000009620566,0.9987703,0.0002885727,0.000756578,0.000054943383,0.0000017252213],"about_ca_topic_score_codex":0.0038707878,"about_ca_topic_score_gemma":0.0028963496,"teacher_disagreement_score":0.0038707878,"about_ca_system_score_codex":0.0012269848,"about_ca_system_score_gemma":0.0004268511,"threshold_uncertainty_score":0.00890249},"labels":[],"label_agreement":null},{"id":"W2471650598","doi":"10.1109/noms.2016.7502826","title":"On the feasibility of core-rooted path addressing","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing table; Computer network; The Internet; Distributed computing; Network topology; Robustness (evolution); Software deployment; Routing (electronic design automation); Network architecture; Packet forwarding; Routing protocol; World Wide Web; Software engineering","score_opus":0.13837437961439336,"score_gpt":0.2968497174856179,"score_spread":0.15847533787122453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471650598","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.15822355,0.0025617848,0.7534286,0.004865597,0.00027700924,0.00015509482,0.00014967789,0.00089760707,0.079441026],"genre_scores_gemma":[0.87556964,0.0015795785,0.1175008,0.0005795531,0.00019462296,0.00014503123,0.00013347327,0.00017036474,0.0041268216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818486,0.0007380976,0.000072542854,0.00026529783,0.00053687836,0.00020219033],"domain_scores_gemma":[0.9822264,0.012607091,0.00053850794,0.002788278,0.0015995709,0.00024015103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035234552,0.0004707194,0.00052899146,0.00073630817,0.0012124781,0.0022037097,0.0015466338,0.0016405578,0.004530502],"category_scores_gemma":[0.02309524,0.00051752693,0.00037190167,0.00070833357,0.0027341153,0.01115478,0.0021306258,0.0021888067,0.0007955499],"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.0002749392,0.000067351764,0.0015195442,0.00015705758,0.000023331928,0.00017089819,0.00033599965,0.062395044,0.009659594,0.8581297,0.002791504,0.06447503],"study_design_scores_gemma":[0.00006611625,0.00033166577,0.0006796419,0.00012646848,0.000053516582,0.00061006605,0.00025796358,0.39643195,0.009793104,0.5725794,0.019013368,0.000056741515],"about_ca_topic_score_codex":0.0014891472,"about_ca_topic_score_gemma":0.0013068229,"teacher_disagreement_score":0.004530502,"about_ca_system_score_codex":0.0010683698,"about_ca_system_score_gemma":0.0011082962,"threshold_uncertainty_score":0.018634021},"labels":[],"label_agreement":null},{"id":"W2481456747","doi":"10.1142/9789814273046_0010","title":"A SURVEY OF KEY REVOCATION SCHEMES IN MOBILE AD HOC NETWORKS","year":2011,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Revocation; Key (lock); Mobile ad hoc network; Computer science; Vehicular ad hoc network; Computer security; Computer network; Wireless ad hoc network; Telecommunications; Wireless","score_opus":0.047270467229918185,"score_gpt":0.2337842510278114,"score_spread":0.1865137837978932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481456747","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01013223,0.58400095,0.36125126,0.0020953142,0.0019780945,0.0005545545,0.00035551548,0.0009176926,0.038714405],"genre_scores_gemma":[0.15223528,0.6089294,0.20432083,0.0013186055,0.0028383166,0.0005497984,0.0011144524,0.0002562385,0.028437097],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979102,0.00046723062,0.0002656179,0.00031343743,0.0008288371,0.00021468426],"domain_scores_gemma":[0.99800867,0.0010508003,0.00015466246,0.0003904694,0.00033161248,0.00006382406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002053178,0.0010871072,0.0018528803,0.0024701192,0.0012212303,0.0033980606,0.0026035851,0.0015689214,0.005331646],"category_scores_gemma":[0.0048513934,0.00084437244,0.0006380089,0.007399921,0.0013269678,0.0078008384,0.0017865085,0.0022412702,0.0025982317],"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.00020182302,0.00020679933,0.0004287475,0.003374162,0.00005350119,0.000088860535,0.00016729099,0.011852807,0.0042988844,0.09405633,0.022696083,0.86257464],"study_design_scores_gemma":[0.00013852942,0.00080984127,0.001395751,0.002651149,0.00022966298,0.0039454494,0.00052466756,0.118191645,0.009005913,0.198969,0.6639303,0.00020803862],"about_ca_topic_score_codex":0.00080467266,"about_ca_topic_score_gemma":0.00080784265,"teacher_disagreement_score":0.005331646,"about_ca_system_score_codex":0.0019563688,"about_ca_system_score_gemma":0.0014121291,"threshold_uncertainty_score":0.017836094},"labels":[],"label_agreement":null},{"id":"W2482095914","doi":"10.1049/iet-com.2015.1205","title":"Fundamental limits of caching: improved bounds for users with small buffers","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Set (abstract data type); Upper and lower bounds; Computer network; Cache; Buffer (optical fiber); Algorithm; Mathematics; Telecommunications","score_opus":0.06948129246839965,"score_gpt":0.2722086962207822,"score_spread":0.20272740375238255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482095914","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.037669476,0.01398161,0.9055035,0.0025679378,0.0006123262,0.0002028,0.0004678953,0.00062789023,0.038366552],"genre_scores_gemma":[0.7877139,0.015521889,0.17663115,0.0022691034,0.0022137503,0.0010558959,0.00071989786,0.00088972284,0.012984665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950287,0.0016174313,0.0001471463,0.0007548641,0.0014088381,0.0010430521],"domain_scores_gemma":[0.95647246,0.033967596,0.0019237713,0.002351051,0.0038179415,0.0014671265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00790942,0.003066593,0.003181104,0.0033140539,0.0018548099,0.0065802177,0.006742821,0.003412041,0.00903913],"category_scores_gemma":[0.045729473,0.0011829074,0.0018855374,0.0034335912,0.00378694,0.013400992,0.0053489637,0.008922893,0.0015083776],"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.0005654857,0.00030905078,0.0010030253,0.000976646,0.00010948085,0.000363684,0.0008265814,0.1199326,0.011425255,0.81845117,0.009327138,0.036709763],"study_design_scores_gemma":[0.00003652316,0.00019782156,0.00041505948,0.0003362004,0.000108416185,0.00042315217,0.00022746061,0.63780266,0.004789561,0.34786478,0.0076909102,0.00010744637],"about_ca_topic_score_codex":0.0021689094,"about_ca_topic_score_gemma":0.001385563,"teacher_disagreement_score":0.00903913,"about_ca_system_score_codex":0.004973918,"about_ca_system_score_gemma":0.0026903576,"threshold_uncertainty_score":0.041829467},"labels":[],"label_agreement":null},{"id":"W2485169440","doi":"10.1109/icc.2016.7511583","title":"StreamCache: Popularity-based caching for adaptive streaming over information-centric networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Information-centric networking; Cache; Popularity; Computer network; Benchmark (surveying); The Internet; Throughput; World Wide Web; Wireless; Telecommunications","score_opus":0.014043562952176233,"score_gpt":0.21855866797821136,"score_spread":0.20451510502603512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485169440","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.2949507,0.003844445,0.67042124,0.0010007056,0.0003651197,0.00064551627,0.0008656005,0.016976293,0.010930389],"genre_scores_gemma":[0.90968287,0.0009550433,0.085476875,0.00014511534,0.00009864939,0.00014472201,0.00048619535,0.00022382046,0.0027865998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950826,0.000120071665,0.00003930176,0.000057047768,0.00019458483,0.000080726466],"domain_scores_gemma":[0.9982222,0.00060345023,0.00014707362,0.0003509803,0.0005136674,0.00016255394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010148813,0.0004887692,0.00064685114,0.00080393534,0.0008894128,0.001098595,0.0018296421,0.0005508623,0.0012074405],"category_scores_gemma":[0.0036599475,0.00023225705,0.00019558404,0.0010887779,0.0005305793,0.0016878454,0.0008088193,0.00061350083,0.00019111652],"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.0022253671,0.00077584066,0.01405321,0.0005412314,0.00027834764,0.0005113563,0.0004653546,0.45171025,0.04573243,0.03679992,0.029199183,0.41770756],"study_design_scores_gemma":[0.000068101086,0.00013712552,0.0006794407,0.000012032955,0.00002673253,0.00010069441,0.000037333833,0.98370945,0.007511853,0.0031363345,0.0045622885,0.000018604915],"about_ca_topic_score_codex":0.012330855,"about_ca_topic_score_gemma":0.014708858,"teacher_disagreement_score":0.012330855,"about_ca_system_score_codex":0.0014008938,"about_ca_system_score_gemma":0.0022258584,"threshold_uncertainty_score":0.024518192},"labels":[],"label_agreement":null},{"id":"W2489798131","doi":"10.1109/infocom.2016.7524378","title":"Coordinated caching in planet-scale CDNs: Analysis of feasibility and benefits","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Cache; Computer science; Server; Scalability; Computer network; The Internet; Workload; Cache algorithms; Scale (ratio); CPU cache; Database; World Wide Web; Operating system","score_opus":0.026249917107198678,"score_gpt":0.23186716005113767,"score_spread":0.205617242943939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489798131","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.9741314,0.0004421063,0.021362336,0.00030875092,0.000008360773,0.00005845096,0.00010275589,0.000070370705,0.0035155201],"genre_scores_gemma":[0.99771667,0.00007221133,0.0020155166,0.000009166057,0.0000051549587,0.000010604761,0.000028428463,0.0000049060495,0.00013742552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988416,0.0005710035,0.000028947934,0.00015934308,0.0001962553,0.00020296671],"domain_scores_gemma":[0.98361796,0.012554894,0.0011239381,0.00093433034,0.0013140469,0.00045474348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034576,0.0004458157,0.0004596633,0.00074980967,0.00060886145,0.0011827269,0.001016063,0.00093238935,0.0009704854],"category_scores_gemma":[0.018175362,0.00029705136,0.00035811713,0.0010811193,0.0013055028,0.00199924,0.0009668833,0.00058183924,0.00006961213],"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.00036721354,0.000163512,0.026826272,0.00008866378,0.00011115055,0.00032474866,0.00014416773,0.9444119,0.002735836,0.012916866,0.00072513905,0.011184523],"study_design_scores_gemma":[0.000022056789,0.00013561524,0.0054812846,0.000007228278,0.000050973846,0.00008999543,0.00029784077,0.9893148,0.00071155216,0.0036115963,0.0002657847,0.000011272125],"about_ca_topic_score_codex":0.010948961,"about_ca_topic_score_gemma":0.007722896,"teacher_disagreement_score":0.010948961,"about_ca_system_score_codex":0.002340559,"about_ca_system_score_gemma":0.00077711046,"threshold_uncertainty_score":0.021770477},"labels":[],"label_agreement":null},{"id":"W2491433091","doi":"10.1109/icc.2016.7510810","title":"Optimal caching for producer mobility support in Named Data Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Computer network; Retransmission; Handover; Overhead (engineering); Exploit; Benchmark (surveying); Scheme (mathematics); Distributed computing; Network packet; Computer security","score_opus":0.05028024686559368,"score_gpt":0.2803982800539118,"score_spread":0.23011803318831814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2491433091","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.46684578,0.0010947996,0.52715176,0.0007553047,0.000059640985,0.00009008054,0.000112311645,0.00044875906,0.0034415182],"genre_scores_gemma":[0.9789696,0.00013776876,0.020497972,0.000026124317,0.000008468763,0.000016685506,0.000029850558,0.000013275178,0.00030022042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988483,0.0005399088,0.000057375106,0.00013436536,0.00020853031,0.0002115564],"domain_scores_gemma":[0.9968725,0.0019174678,0.00033400964,0.00035228804,0.00042182,0.00010183172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141775,0.000403763,0.000806432,0.00040167035,0.00081249897,0.0011906504,0.0012250241,0.0009762038,0.0004572131],"category_scores_gemma":[0.007413428,0.0003054651,0.00024657868,0.0006894269,0.000732414,0.002127458,0.0009142443,0.00045752895,0.000058930556],"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.00040732799,0.000081529324,0.0026471338,0.0000910539,0.000034959612,0.0002017114,0.00012574908,0.9343642,0.012536778,0.024870057,0.0013104168,0.023329107],"study_design_scores_gemma":[0.0000090315825,0.000026540512,0.00016414358,0.000002880397,0.000006541636,0.000019233321,0.00002385881,0.9958007,0.0014546837,0.0021894285,0.0002978976,0.000005070783],"about_ca_topic_score_codex":0.0066122785,"about_ca_topic_score_gemma":0.0066207475,"teacher_disagreement_score":0.0066122785,"about_ca_system_score_codex":0.0024447702,"about_ca_system_score_gemma":0.0015338982,"threshold_uncertainty_score":0.017738163},"labels":[],"label_agreement":null},{"id":"W2494852310","doi":"10.6138/jit.2015.16.2.20140410c","title":"A Comparison Study of Connected Vehicle Systems between Named Data Networking and IP","year":2015,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Cloud computing; Network packet; Protocol (science); Internet Protocol; The Internet; Packet loss; Dissemination; Vehicular ad hoc network; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications; Operating system","score_opus":0.28642811398053614,"score_gpt":0.3495136429202709,"score_spread":0.06308552893973474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494852310","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.94689167,0.0006625468,0.03756554,0.00018558711,0.00010241053,0.0001140184,0.00022612534,0.00023166774,0.014020446],"genre_scores_gemma":[0.9957228,0.00016269574,0.0034097792,0.000011883889,0.000005522791,0.000024429357,0.00011704596,0.000013673915,0.0005320722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993268,0.00023553091,0.000025513431,0.00009326374,0.00020754867,0.00011139558],"domain_scores_gemma":[0.9983758,0.0008857319,0.00013225015,0.00012116458,0.0003986341,0.00008652754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009995279,0.00041408985,0.0003508165,0.0010160276,0.00046016506,0.0006470679,0.00066259765,0.0004015044,0.0010608668],"category_scores_gemma":[0.002961212,0.00011846525,0.00036091454,0.00084517134,0.00040129948,0.0011686705,0.00036803802,0.00035435526,0.00010308856],"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.00050964317,0.0002730711,0.014645103,0.00023560708,0.00013236604,0.00028569042,0.00019235027,0.9111183,0.00988315,0.021829946,0.0014007472,0.03949407],"study_design_scores_gemma":[0.000015141173,0.0005123021,0.003157641,0.000010920203,0.000030584524,0.000070799,0.00014208964,0.9884461,0.003903112,0.002091682,0.0016047457,0.000014941187],"about_ca_topic_score_codex":0.0043300586,"about_ca_topic_score_gemma":0.002597211,"teacher_disagreement_score":0.0043300586,"about_ca_system_score_codex":0.001152009,"about_ca_system_score_gemma":0.00048832287,"threshold_uncertainty_score":0.008609712},"labels":[],"label_agreement":null},{"id":"W2500859639","doi":"10.1109/icc.2016.7511035","title":"Header length reduction for bloom filter multicast using stochastic overlay networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Bloom filter; Protocol Independent Multicast; Packet forwarding; Distance Vector Multicast Routing Protocol; Xcast; Distributed computing; IP multicast; Forwarding plane; Network packet; Pragmatic General Multicast","score_opus":0.043696005324939516,"score_gpt":0.26005889009621863,"score_spread":0.21636288477127913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500859639","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.1545194,0.00024377093,0.8405505,0.00024507844,0.0000376243,0.00011015494,0.00013272025,0.0022201664,0.0019405712],"genre_scores_gemma":[0.77971894,0.00012141802,0.21873309,0.000087850014,0.000032996988,0.0000857923,0.00022555112,0.000064618645,0.0009296808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983955,0.00035789388,0.00011103225,0.00013829127,0.0008139683,0.00018326666],"domain_scores_gemma":[0.9943334,0.002394012,0.00077593664,0.001310573,0.0010558636,0.00013023008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019785715,0.000428107,0.0005034582,0.0012486492,0.00096301874,0.0008517583,0.0010594215,0.00061191653,0.000682206],"category_scores_gemma":[0.0068074865,0.00024248472,0.00037618217,0.00090992823,0.00043524808,0.0015064935,0.001099915,0.00056715054,0.00018359646],"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.0007632718,0.00039719557,0.010697744,0.00015692058,0.00012295607,0.00032367127,0.0005812231,0.33818176,0.2015958,0.034673907,0.0042694425,0.40823612],"study_design_scores_gemma":[0.000022416647,0.00015388608,0.00080826017,0.000009246074,0.00002743948,0.00015860978,0.00007055619,0.9248956,0.063478336,0.007892463,0.0024631887,0.000019918813],"about_ca_topic_score_codex":0.0024840813,"about_ca_topic_score_gemma":0.0036634074,"teacher_disagreement_score":0.0024840813,"about_ca_system_score_codex":0.0018840447,"about_ca_system_score_gemma":0.0015584314,"threshold_uncertainty_score":0.013669729},"labels":[],"label_agreement":null},{"id":"W2505514615","doi":"10.1109/icc.2016.7510919","title":"Weighted network traffic offloading in cache-enabled heterogeneous networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":41,"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 British Columbia","funders":"","keywords":"Computer science; Cache; Computer network; Heterogeneous network; Cellular network; Heuristic; Throughput; Integer programming; Linear programming; Distributed computing; Wireless network; Wireless; Algorithm","score_opus":0.010462827290401471,"score_gpt":0.19761595728819817,"score_spread":0.1871531299977967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505514615","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.26433653,0.00079186185,0.72728944,0.00025492412,0.000061099454,0.00008198529,0.00009408044,0.00040177733,0.00668834],"genre_scores_gemma":[0.9808997,0.00015186254,0.01800485,0.0000376468,0.000013398454,0.000027200538,0.000038150556,0.000024916833,0.0008022542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995338,0.00015258111,0.000012863079,0.00006951699,0.00010567009,0.00012556894],"domain_scores_gemma":[0.99923384,0.00047850734,0.00007480475,0.000056401976,0.0001020705,0.00005433314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007216776,0.0007136042,0.0008029791,0.00057268684,0.00064723013,0.00096212956,0.00084560714,0.0006297886,0.0007657664],"category_scores_gemma":[0.0017720113,0.00030028378,0.00031424017,0.0009564766,0.0005642521,0.0010121578,0.00066129176,0.00036403368,0.00009841516],"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.000063208,0.000041835825,0.00063103595,0.000029954024,0.00001873612,0.0001505018,0.000021655718,0.97467536,0.003018961,0.0071567856,0.00048905,0.013702816],"study_design_scores_gemma":[0.0000021725784,0.000007240415,0.0000702941,0.0000010266958,0.0000031216937,0.000009209471,0.000008805952,0.9981199,0.00024116463,0.0014537224,0.00008173964,0.0000016232492],"about_ca_topic_score_codex":0.008234855,"about_ca_topic_score_gemma":0.009531908,"teacher_disagreement_score":0.008234855,"about_ca_system_score_codex":0.0015613084,"about_ca_system_score_gemma":0.0007802991,"threshold_uncertainty_score":0.016373873},"labels":[],"label_agreement":null},{"id":"W2505686982","doi":"10.1109/icc.2016.7511198","title":"DACPI: A decentralized access control protocol for information centric networking","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Information-centric networking; Scalability; Access control; The Internet; Protocol (science); Cache; Node (physics); Replay attack; Computer security; Enforcement; World Wide Web; Database","score_opus":0.0355585051246391,"score_gpt":0.3059535534477752,"score_spread":0.2703950483231361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505686982","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.0065269377,0.00051451655,0.97894555,0.0005102441,0.00027151618,0.0010867419,0.00022496116,0.004240932,0.0076786047],"genre_scores_gemma":[0.45236185,0.0011699017,0.5276262,0.0011339984,0.0004569216,0.00324016,0.0012806741,0.0003229184,0.012407335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638367,0.00081528036,0.0003483695,0.00044269708,0.00168207,0.00032793204],"domain_scores_gemma":[0.9950819,0.0014319294,0.00055539905,0.0013601732,0.0011470608,0.00042350806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035581887,0.000745269,0.000914128,0.0015529956,0.0019863076,0.0021427688,0.0025139614,0.0013862937,0.0023875397],"category_scores_gemma":[0.0068540825,0.00042652895,0.00063344353,0.0014058134,0.0019608326,0.0029413272,0.0030006461,0.003092963,0.0006966561],"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.0008955971,0.00047736353,0.002055122,0.00085283717,0.00013972216,0.0011097997,0.00096086116,0.041276626,0.04803209,0.54524773,0.035686824,0.32326546],"study_design_scores_gemma":[0.00038855214,0.0007484972,0.0008766339,0.0001248244,0.00014316333,0.0020594622,0.00018733215,0.655006,0.03683045,0.12801799,0.17537816,0.00023896752],"about_ca_topic_score_codex":0.002371903,"about_ca_topic_score_gemma":0.0019426561,"teacher_disagreement_score":0.0035581887,"about_ca_system_score_codex":0.0016463883,"about_ca_system_score_gemma":0.0037586745,"threshold_uncertainty_score":0.018817723},"labels":[],"label_agreement":null},{"id":"W2506572664","doi":"10.1109/ccece.2003.1226078","title":"QoS differentiation in switching-based Web caching","year":2004,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Server; Computer network; Quality of service; Differentiated services; Router; Enhanced Data Rates for GSM Evolution; Cache; Web server; Class (philosophy); Service (business); Web service; The Internet; Operating system; World Wide Web; Telecommunications; Artificial intelligence","score_opus":0.011221635564189904,"score_gpt":0.21176771473163603,"score_spread":0.20054607916744613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506572664","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.5581307,0.0053315153,0.41626132,0.00083541375,0.00020208202,0.000115566305,0.000077123885,0.000674073,0.01837219],"genre_scores_gemma":[0.98293257,0.00051007257,0.01536103,0.000062660685,0.000033454584,0.0000152053435,0.00002238708,0.000012779908,0.0010498078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931467,0.00023048338,0.000034534198,0.00005937955,0.00026106028,0.000099927245],"domain_scores_gemma":[0.9990477,0.00048600032,0.00007849245,0.00010510465,0.000208083,0.0000746315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011129424,0.00022438234,0.00038900672,0.0004468477,0.0004940409,0.00088593824,0.0007425287,0.00057546503,0.0005918894],"category_scores_gemma":[0.002484255,0.00022101226,0.00023492228,0.0007363709,0.00066524255,0.0008227269,0.00040271186,0.00054335134,0.00011192192],"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.0005741326,0.000211772,0.008034977,0.00023173948,0.00006434848,0.00071312743,0.00041959438,0.5836945,0.042337246,0.20526177,0.0025238695,0.15593284],"study_design_scores_gemma":[0.000028894294,0.00006274899,0.0008660658,0.00000965683,0.000023894387,0.00012893406,0.000035728655,0.9708594,0.0036496406,0.022813361,0.0015056385,0.00001588216],"about_ca_topic_score_codex":0.0062698224,"about_ca_topic_score_gemma":0.0032357897,"teacher_disagreement_score":0.0062698224,"about_ca_system_score_codex":0.0017696477,"about_ca_system_score_gemma":0.0007372473,"threshold_uncertainty_score":0.012839735},"labels":[],"label_agreement":null},{"id":"W251114167","doi":"10.1016/j.comnet.2015.04.012","title":"Smart routing: Fine-grained stall management of video streams in mobile core networks","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Distributed computing; Bottleneck; Cellular network; Backhaul (telecommunications); Radio access network; Real-time computing; Base station; Mobile station; Embedded system","score_opus":0.02810637455799983,"score_gpt":0.23665436566227954,"score_spread":0.2085479911042797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251114167","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.31473896,0.0021373935,0.6647519,0.0006227503,0.00042626332,0.00027542224,0.00045477535,0.012491007,0.0041015185],"genre_scores_gemma":[0.93736356,0.0002416919,0.06014897,0.000108622975,0.00007084009,0.000043515018,0.00025117077,0.00018923129,0.0015824172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952674,0.00009421715,0.000036266934,0.0001041532,0.00012310588,0.0001156496],"domain_scores_gemma":[0.99814415,0.0006308581,0.00020723089,0.00049764663,0.00034590682,0.00017413103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282934,0.000732325,0.0008766355,0.000981529,0.0007859209,0.0011300741,0.0017996663,0.00052809995,0.0016302607],"category_scores_gemma":[0.003505808,0.0004326816,0.00021672584,0.0007233253,0.00051183865,0.0016021949,0.001081924,0.00069109286,0.0002933379],"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.0020439106,0.0003776566,0.008212009,0.00024113248,0.00014275036,0.00030155416,0.00040337787,0.43818823,0.08325411,0.015756965,0.019754795,0.43132347],"study_design_scores_gemma":[0.000027859856,0.0001059429,0.00050551683,0.0000055033174,0.000023212053,0.00003496669,0.000034636727,0.9891338,0.005709996,0.0032471295,0.0011579792,0.000013525417],"about_ca_topic_score_codex":0.005145444,"about_ca_topic_score_gemma":0.011053453,"teacher_disagreement_score":0.005145444,"about_ca_system_score_codex":0.0010507071,"about_ca_system_score_gemma":0.001311385,"threshold_uncertainty_score":0.010230958},"labels":[],"label_agreement":null},{"id":"W2512379690","doi":"10.1109/mcom.2016.7537171","title":"Communications, caching, and computing for content-centric mobile networks: part 1 [guest editorial]","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Caching and Content Delivery","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":"Computer science; Cellular network; Computer network; Mobile telephony; Cellular traffic; Mobile broadband; Mobile phone; Mobile computing; Base station; Telecommunications; Mobile radio; Wireless","score_opus":0.04937697395480108,"score_gpt":0.2810996240281772,"score_spread":0.23172265007337609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512379690","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008507612,0.07019492,0.00051329297,0.034907643,0.8904805,0.0000225693,0.00003803943,0.00006544023,0.0036925105],"genre_scores_gemma":[0.00050136034,0.0303461,0.00015310399,0.010117808,0.9506,0.000016824013,0.000023288165,0.00003387442,0.00820749],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829537,0.00020608757,0.00019394507,0.00030370665,0.0008209094,0.00017994264],"domain_scores_gemma":[0.994165,0.0022564358,0.00039611594,0.00020581116,0.002141496,0.00083517836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022199315,0.0026493515,0.002011745,0.0019023473,0.001855609,0.006228909,0.0028510306,0.010961025,0.012209197],"category_scores_gemma":[0.0064658416,0.0010581253,0.0015658052,0.0017644773,0.0024224275,0.0049418034,0.0011845563,0.015853915,0.010237899],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003975529,0.0000169294,0.000037603204,0.00023635743,0.000013784772,0.00008751291,0.00001445835,0.00007686938,0.00016687239,0.0015928153,0.9822542,0.01546299],"study_design_scores_gemma":[0.000024847677,0.000037642985,0.0001698168,0.0002794516,0.000022880888,0.00025865342,0.000016644835,0.00028682963,0.00011204069,0.0018020098,0.9969708,0.000018383802],"about_ca_topic_score_codex":0.0021387404,"about_ca_topic_score_gemma":0.004612104,"teacher_disagreement_score":0.012209197,"about_ca_system_score_codex":0.002824138,"about_ca_system_score_gemma":0.0022202716,"threshold_uncertainty_score":0.040843844},"labels":[],"label_agreement":null},{"id":"W2517562539","doi":"10.1109/iscc.2016.7543758","title":"Greedy heuristic for replica server placement in Cloud based Content Delivery Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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":"Replica; Computer science; Cloud computing; Server; Scalability; Distributed computing; Greedy algorithm; Heuristics; Heuristic; Quality of service; Computer network; Database; Operating system; Algorithm; Artificial intelligence","score_opus":0.042039317923740424,"score_gpt":0.22828827075165742,"score_spread":0.18624895282791698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517562539","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.06944288,0.0013136296,0.92484176,0.00023839095,0.00013100573,0.00024324305,0.00014720956,0.00081378804,0.0028281454],"genre_scores_gemma":[0.6533811,0.0006241467,0.34384283,0.00009252425,0.000040702853,0.00020855317,0.00022404299,0.000107346095,0.0014786131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899834,0.00040060087,0.000047831538,0.00014300465,0.00020777251,0.00020239815],"domain_scores_gemma":[0.9986792,0.00078547205,0.0001568213,0.00014540758,0.00014390402,0.00008917676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011428451,0.0008907142,0.001583443,0.0009156513,0.0010460119,0.0009169394,0.0017493588,0.00097629736,0.0013332454],"category_scores_gemma":[0.0022945537,0.00060371484,0.0007176641,0.0013858752,0.00078004925,0.00097142294,0.0007694616,0.0005529578,0.00033845194],"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.00017443825,0.00004786464,0.00045369196,0.00007983334,0.000032727094,0.00014914619,0.000058957612,0.9556433,0.0031075266,0.0060033617,0.0015209145,0.03272826],"study_design_scores_gemma":[0.000024175111,0.00003853965,0.000085725056,0.000005220447,0.000010102146,0.00004725887,0.00002578247,0.99524033,0.0008754468,0.003131435,0.0005075185,0.000008544978],"about_ca_topic_score_codex":0.008187627,"about_ca_topic_score_gemma":0.0066806097,"teacher_disagreement_score":0.008187627,"about_ca_system_score_codex":0.0017486647,"about_ca_system_score_gemma":0.0018751589,"threshold_uncertainty_score":0.016279936},"labels":[],"label_agreement":null},{"id":"W2517701812","doi":"10.1109/infcomw.2016.7562167","title":"An ICN-based publish-subscribe platform to deliver UAV service in smart cities","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Encryption; Intelligent transportation system; Dissemination; Application layer; Service (business); Middleware (distributed applications); Publication; Computer security; Distributed computing; Telecommunications; Operating system; Engineering","score_opus":0.028507419218061294,"score_gpt":0.22871553076894502,"score_spread":0.20020811155088372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517701812","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.37654436,0.00095334725,0.5685538,0.00123484,0.0008912483,0.0009970871,0.00046234662,0.022277646,0.028085344],"genre_scores_gemma":[0.8993618,0.00027228286,0.092800364,0.00017073004,0.000060246777,0.00013922744,0.00043181278,0.00016264133,0.00660085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996401,0.0000891314,0.000032045253,0.000060232695,0.00011761653,0.000060823328],"domain_scores_gemma":[0.99943775,0.00007695778,0.000038324033,0.00013970409,0.00019137563,0.00011586814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007458292,0.00028592683,0.00032783957,0.0005009631,0.0006000555,0.0009719923,0.00093658577,0.00053844345,0.0016776993],"category_scores_gemma":[0.00091981963,0.0001807037,0.00019739967,0.00040230242,0.00030261776,0.0013915548,0.0008618753,0.00056470215,0.00047057358],"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.0019373155,0.0014481483,0.011581088,0.0005876237,0.00023389932,0.0036382787,0.0016789612,0.13978387,0.27994332,0.07796633,0.054674957,0.42652622],"study_design_scores_gemma":[0.00015416823,0.00052479573,0.0016526165,0.000023761088,0.0000803539,0.000325746,0.00027948996,0.8789203,0.054807957,0.004022116,0.05914067,0.00006798741],"about_ca_topic_score_codex":0.0042423042,"about_ca_topic_score_gemma":0.0040751295,"teacher_disagreement_score":0.0042423042,"about_ca_system_score_codex":0.0007373516,"about_ca_system_score_gemma":0.0009130764,"threshold_uncertainty_score":0.00843519},"labels":[],"label_agreement":null},{"id":"W2519945036","doi":"10.17760/d20215029","title":"Rethinking the architecture of the web","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Caching and Content Delivery","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":"Science North","funders":"Max Planck Institute for Software Systems","keywords":"World Wide Web; Web API; Web development; Web service; Computer science; JavaScript; Web standards; Web application security; Web modeling; Web 2.0; Web page; Upload; WS-Policy; Service provider; Data Web; Web server; Internet privacy; Service (business); The Internet; Business","score_opus":0.011266888510834445,"score_gpt":0.21699318693549446,"score_spread":0.20572629842466003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519945036","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047539845,0.04349028,0.43829775,0.09195871,0.0036823284,0.00014181626,0.00031805667,0.003539942,0.3710313],"genre_scores_gemma":[0.5771677,0.045732833,0.23441535,0.010420392,0.0035783893,0.0003226445,0.000643312,0.0023594766,0.12535986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760807,0.00078869844,0.00012597194,0.00035612602,0.0008795869,0.00024160041],"domain_scores_gemma":[0.9969728,0.0008671622,0.0000821338,0.0010021138,0.0008073977,0.00026838848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026455917,0.0005520423,0.00047313486,0.0016667299,0.0023505522,0.011629496,0.0018194468,0.0035768102,0.0050512603],"category_scores_gemma":[0.0060146353,0.00094876596,0.00056937773,0.0016545895,0.009396983,0.023878135,0.004081344,0.0071503613,0.0032565717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000013578358,0.000021662778,0.0002502627,0.000066989385,0.000005954612,0.00008791509,0.0011363033,0.0012664875,0.0007001579,0.9642353,0.0064086556,0.025806744],"study_design_scores_gemma":[0.000009397357,0.000011508162,0.00023985564,0.00015107464,0.000009618795,0.00020458808,0.00043180498,0.0061118198,0.00058942306,0.7735768,0.21864133,0.000022632525],"about_ca_topic_score_codex":0.0056759682,"about_ca_topic_score_gemma":0.006005557,"teacher_disagreement_score":0.011629496,"about_ca_system_score_codex":0.002975133,"about_ca_system_score_gemma":0.002696747,"threshold_uncertainty_score":0.02158624},"labels":[],"label_agreement":null},{"id":"W2526269066","doi":"10.1109/tnet.2015.2478059","title":"A Methodology for the Design of Self-Optimizing, Decentralized Content-Caching Strategies","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Computer network; Distributed computing; Node (physics); Set (abstract data type); Network topology; Content delivery; Scheme (mathematics); Energy consumption","score_opus":0.31656922367101437,"score_gpt":0.3304753474713745,"score_spread":0.01390612380036016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526269066","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.00074314274,0.000035297122,0.9980573,0.000041818705,0.000007774755,0.000049511604,0.000010625614,0.000041812804,0.0010126712],"genre_scores_gemma":[0.14317735,0.0003147506,0.85298246,0.00011343693,0.000041110943,0.0008756051,0.000072647905,0.00006745934,0.0023552775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.00034731792,0.00006492673,0.0002072372,0.0003985644,0.00008084194],"domain_scores_gemma":[0.99897695,0.00045343448,0.00014391275,0.00015270742,0.00022353356,0.000049561193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020182098,0.0009225462,0.0009189126,0.0005700885,0.0005948648,0.0012228079,0.0019320669,0.0011788427,0.0022323094],"category_scores_gemma":[0.0033727025,0.00057544943,0.0010678178,0.0006199471,0.0013476394,0.00085997826,0.0012353967,0.0013797719,0.0005000188],"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.000020882782,0.000072808245,0.0002534377,0.00015193004,0.00006603094,0.00008963018,0.00012040694,0.7850543,0.0065111713,0.16621469,0.0011067813,0.0403379],"study_design_scores_gemma":[0.000024308936,0.00006166426,0.000042982585,0.000018237466,0.00001802647,0.000030058349,0.000014465433,0.95653975,0.0012808046,0.037900604,0.0040594544,0.000009551207],"about_ca_topic_score_codex":0.0016169377,"about_ca_topic_score_gemma":0.0017212804,"teacher_disagreement_score":0.0022323094,"about_ca_system_score_codex":0.0012229821,"about_ca_system_score_gemma":0.0022458578,"threshold_uncertainty_score":0.010673463},"labels":[],"label_agreement":null},{"id":"W2526776965","doi":"10.1109/tcc.2015.2474385","title":"Cross-Cloud MapReduce for Big Data","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":31,"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":"Strategic International Collaborative Research Program","keywords":"Computer science; Cloud computing; Big data; Distributed computing; Virtual machine; Scalability; Programming paradigm; Data-intensive computing; Distributed database; Data mining; Database; Operating system; Grid computing","score_opus":0.1530973544353407,"score_gpt":0.32488593402896565,"score_spread":0.17178857959362495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526776965","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.041675612,0.0034455247,0.93102366,0.0023769087,0.00045149916,0.00022496212,0.00033646086,0.0038911635,0.016574187],"genre_scores_gemma":[0.6190852,0.0018390081,0.37124756,0.00046066073,0.00024302182,0.00017334627,0.000829215,0.0004053345,0.0057165986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932516,0.00018401498,0.00002959712,0.000109916204,0.00025320964,0.00009817904],"domain_scores_gemma":[0.9994123,0.00017311823,0.000036237478,0.00019137585,0.00011525036,0.0000718262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012250439,0.0005957008,0.00050839025,0.0004423169,0.00078137795,0.0010714506,0.0015635407,0.0005745074,0.0019089199],"category_scores_gemma":[0.0014632653,0.00030710472,0.00067164126,0.0011096467,0.0005008061,0.001615369,0.0014739507,0.001091778,0.0006490404],"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.0005691493,0.00045633665,0.0040021846,0.00074272347,0.00027337827,0.00067082717,0.00026868292,0.48877478,0.02129917,0.12217859,0.05403908,0.306725],"study_design_scores_gemma":[0.00004126375,0.00008109758,0.0010903036,0.000017121112,0.000027159494,0.00019353705,0.00011255429,0.9023541,0.0075349426,0.060770653,0.027755184,0.000022024527],"about_ca_topic_score_codex":0.0040904563,"about_ca_topic_score_gemma":0.006979694,"teacher_disagreement_score":0.0040904563,"about_ca_system_score_codex":0.0010541807,"about_ca_system_score_gemma":0.0019586429,"threshold_uncertainty_score":0.008133292},"labels":[],"label_agreement":null},{"id":"W2527108173","doi":"10.1109/tcc.2015.2469663","title":"Optimize the Server Provisioning and Request Dispatching in Distributed Memory Cache Services","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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":"Natural Sciences and Engineering Research Council of Canada; British Columbia Knowledge Development Fund; Cummings Foundation","keywords":"Computer science; Cache; Server; Cache algorithms; Provisioning; Computer network; Smart Cache; Cache invalidation; Queue; CPU cache; Cloud computing; Distributed computing; Cache coloring; Operating system","score_opus":0.02289911604299903,"score_gpt":0.24179110419407648,"score_spread":0.21889198815107747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527108173","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.3292207,0.0004845781,0.6650692,0.00033967482,0.000042610187,0.00022079107,0.00014432077,0.001166006,0.003312086],"genre_scores_gemma":[0.90718645,0.00009978354,0.09181824,0.000026429898,0.000008210667,0.00005315717,0.00007004024,0.000040712966,0.00069703703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996226,0.00010831733,0.000018704128,0.000062436164,0.00008662635,0.00010132428],"domain_scores_gemma":[0.9995134,0.00023172764,0.000059090344,0.000049443734,0.000108602755,0.00003783427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894029,0.0005870389,0.0006823771,0.00032957536,0.0005232395,0.0007297944,0.00075875386,0.00063055137,0.0007820235],"category_scores_gemma":[0.0018946067,0.00020158054,0.00025767603,0.00069039804,0.0002732419,0.0008494265,0.00049004745,0.0004109725,0.00019035468],"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.00028002076,0.0002043602,0.0020432053,0.00011973169,0.000025585607,0.000065281325,0.000069169015,0.910639,0.012968066,0.0062814993,0.0014372552,0.065866694],"study_design_scores_gemma":[0.000009655146,0.000020207804,0.00010698986,8.38399e-7,0.0000031127581,0.000008310613,0.000009086699,0.99754447,0.0015019953,0.0006895795,0.0001032704,0.000002323391],"about_ca_topic_score_codex":0.0076328134,"about_ca_topic_score_gemma":0.007788303,"teacher_disagreement_score":0.0076328134,"about_ca_system_score_codex":0.0011922948,"about_ca_system_score_gemma":0.0023148211,"threshold_uncertainty_score":0.015176773},"labels":[],"label_agreement":null},{"id":"W2527538968","doi":"10.1007/s11107-016-0665-9","title":"Priority-based content processing with Q-routing in information-centric networking (ICN)","year":2016,"lang":"en","type":"article","venue":"Photonic Network Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Information-centric networking; Computer network; Cache; Router; Content centric networking; Network packet; Goodput; Latency (audio); Distributed computing; Throughput; Wireless; Operating system","score_opus":0.03937353150518417,"score_gpt":0.23917985730796787,"score_spread":0.1998063258027837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527538968","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.03702703,0.001584558,0.95569664,0.00063485286,0.00032407814,0.00014077977,0.00006878623,0.00058256957,0.003940681],"genre_scores_gemma":[0.77072704,0.0008893871,0.22453906,0.00034280558,0.00027371952,0.000087071334,0.00009895348,0.00009245512,0.002949546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989091,0.00036881343,0.000074469724,0.00019017924,0.00027827153,0.00017923691],"domain_scores_gemma":[0.99718815,0.0014281899,0.00018300279,0.00041771075,0.0006464154,0.00013657814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030119065,0.0005400273,0.00094615074,0.0008031103,0.0011185377,0.0021924807,0.0019397701,0.00096109614,0.0011351645],"category_scores_gemma":[0.004534315,0.00045655147,0.00030398546,0.0012875643,0.0012195719,0.0023604296,0.0009425788,0.0010697948,0.00027911883],"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.0009059633,0.00054140895,0.0027965656,0.00039822623,0.00010822098,0.00028285716,0.000457011,0.30888548,0.039867,0.3299887,0.012470571,0.3032981],"study_design_scores_gemma":[0.000022223167,0.00009516467,0.00016714158,0.000012851115,0.000025775244,0.000065132095,0.0000315484,0.95022315,0.004916016,0.042611297,0.0018102285,0.000019520443],"about_ca_topic_score_codex":0.005425214,"about_ca_topic_score_gemma":0.0064361473,"teacher_disagreement_score":0.005425214,"about_ca_system_score_codex":0.0020016113,"about_ca_system_score_gemma":0.0021252586,"threshold_uncertainty_score":0.015928686},"labels":[],"label_agreement":null},{"id":"W2528650285","doi":"10.1109/iiswc.2016.7581265","title":"Characterizing the workload of a netflix streaming video server","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"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 Saskatchewan; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Session (web analytics); Server; Workload; Computer network; Instruction prefetch; Service (business); The Internet; Locality; Multimedia; Operating system; World Wide Web; Cache","score_opus":0.01652227684521293,"score_gpt":0.20949913037463455,"score_spread":0.19297685352942162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528650285","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.98141026,0.00020271778,0.015780384,0.00010453923,0.000020156353,0.000099414414,0.000823174,0.00036509635,0.0011942849],"genre_scores_gemma":[0.9939511,0.000098273544,0.0042319507,0.0000330162,0.000024461824,0.000048453865,0.0012079148,0.00004541283,0.00035948906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9983931,0.00022857582,0.00017717971,0.00032778687,0.0005468429,0.00032642178],"domain_scores_gemma":[0.9961773,0.0016194475,0.00056035316,0.0003600588,0.00090577744,0.00037700494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088269805,0.0010179097,0.00057916663,0.0011137787,0.00045627437,0.0010214945,0.0008272766,0.00054304505,0.00067463814],"category_scores_gemma":[0.0045011225,0.00027640682,0.00024982993,0.0012130633,0.00034283573,0.0015550398,0.0004988075,0.00046098826,0.0004145502],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026664604,0.0012371731,0.34396982,0.0005932575,0.0002757048,0.001335866,0.0015185863,0.34638104,0.18705466,0.003040798,0.0048284214,0.10709827],"study_design_scores_gemma":[0.000018202012,0.00027925754,0.049856137,0.000015429941,0.00003106414,0.00029155982,0.00040323165,0.9269046,0.020042934,0.0010241854,0.0011024959,0.000030825777],"about_ca_topic_score_codex":0.005023397,"about_ca_topic_score_gemma":0.0025542171,"teacher_disagreement_score":0.005023397,"about_ca_system_score_codex":0.0008486741,"about_ca_system_score_gemma":0.0007984468,"threshold_uncertainty_score":0.009988308},"labels":[],"label_agreement":null},{"id":"W2540542001","doi":"10.1002/9780470579398.ch5","title":"Cross‐Layer Design Framework for Adaptive Cooperative Caching in Mobile Ad Hoc Networks","year":2010,"lang":"en","type":"other","venue":"","topic":"Caching and Content Delivery","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 Guelph","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Layer (electronics); Adaptive quality of service multi-hop routing; Wireless ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Telecommunications; Wireless; Chemistry; Network packet","score_opus":0.03473326091010108,"score_gpt":0.2895917388760803,"score_spread":0.2548584779659792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540542001","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.0011707938,0.00041037588,0.9945909,0.00011967503,0.00007767302,0.00010424861,0.000026506323,0.00033573617,0.0031640613],"genre_scores_gemma":[0.21854433,0.0019718548,0.7572357,0.00047127655,0.00026463877,0.00095306855,0.00024605618,0.0003324698,0.019980595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899477,0.00027329478,0.00007444742,0.000080694845,0.00044599874,0.00013079816],"domain_scores_gemma":[0.9992747,0.0001488858,0.000046931,0.00010584036,0.00039413446,0.00002949135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018807361,0.0009597725,0.0005822628,0.000556789,0.0006501451,0.0021803074,0.0022429896,0.0009060036,0.0039554317],"category_scores_gemma":[0.0016108956,0.00059359387,0.00058056106,0.00050214975,0.0005379105,0.0014087537,0.001111187,0.0016295679,0.00141021],"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.00012714535,0.00019649614,0.0007729615,0.00047807427,0.00019489681,0.0005174163,0.00049109187,0.290532,0.040231545,0.4668068,0.016528785,0.18312275],"study_design_scores_gemma":[0.0000235702,0.00010895113,0.00014124355,0.00006619624,0.00009051327,0.00023241842,0.000063165615,0.92608076,0.0093958,0.02480669,0.03895902,0.000031592794],"about_ca_topic_score_codex":0.002324038,"about_ca_topic_score_gemma":0.004366852,"teacher_disagreement_score":0.0039554317,"about_ca_system_score_codex":0.0011861919,"about_ca_system_score_gemma":0.0012591507,"threshold_uncertainty_score":0.013232231},"labels":[],"label_agreement":null},{"id":"W2545465490","doi":"10.1109/srdsw.2014.16","title":"Latency Amplification: Characterizing the Impact of Web Page Content on Load Times","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Web page; Latency (audio); Page view; Scripting language; Web server; Metric (unit); Server; Content delivery; Static web page; Web analytics; World Wide Web; The Internet; Web navigation; Web development; Computer network; Operating system; Web application security","score_opus":0.040672927000023014,"score_gpt":0.2515388133674773,"score_spread":0.2108658863674543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545465490","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.6495049,0.0009767192,0.33955687,0.00018821126,0.00007030179,0.00025967706,0.002244786,0.0025090468,0.0046894597],"genre_scores_gemma":[0.9585471,0.00023477357,0.039000444,0.00003241957,0.00005113469,0.0001385443,0.001163449,0.0001428179,0.000689348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99760383,0.0004766041,0.00020757293,0.00037389237,0.0010489527,0.0002893078],"domain_scores_gemma":[0.97526985,0.014898988,0.0034480523,0.0025233384,0.0033623935,0.00049739087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496698,0.0011499993,0.0005503978,0.0038455292,0.00047134756,0.0013444864,0.00096692337,0.0006782865,0.0011288336],"category_scores_gemma":[0.027052782,0.0003950764,0.00048430404,0.003675478,0.00048739067,0.0030713244,0.00077538955,0.00086256256,0.00050687144],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009534019,0.00040330016,0.21779327,0.00069229555,0.0003039096,0.00039981527,0.0010244866,0.41667756,0.09094429,0.00720007,0.002705629,0.26090193],"study_design_scores_gemma":[0.000023869345,0.0006297086,0.09175349,0.00004277165,0.000112406015,0.00047362127,0.0002138069,0.847822,0.05112016,0.004375056,0.003290924,0.00014218588],"about_ca_topic_score_codex":0.007185537,"about_ca_topic_score_gemma":0.006520871,"teacher_disagreement_score":0.007185537,"about_ca_system_score_codex":0.0014476576,"about_ca_system_score_gemma":0.0008897429,"threshold_uncertainty_score":0.014287472},"labels":[],"label_agreement":null},{"id":"W2547918424","doi":"10.1145/2988287.2989178","title":"A Novel Service-oriented Architecture for Information-Centric Vehicular Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"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 Ottawa","funders":"","keywords":"Computer science; Service (business); Structuring; Computer network; Information-centric networking; Service-orientation; Architecture; Vehicular ad hoc network; Network architecture; Distributed computing; Telecommunications; Wireless ad hoc network; Wireless","score_opus":0.008781396520588198,"score_gpt":0.193604113769443,"score_spread":0.1848227172488548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547918424","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.01335159,0.0006463719,0.9667495,0.00095439755,0.00035786358,0.00017927487,0.000065503795,0.00086849096,0.016826987],"genre_scores_gemma":[0.46624097,0.0015965436,0.51379293,0.0005475787,0.00029871013,0.00039591143,0.00031823784,0.00016892147,0.016640227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945515,0.00014140728,0.00004697109,0.00008516234,0.00017986775,0.000091456604],"domain_scores_gemma":[0.99949324,0.00006747672,0.0000455912,0.00009411404,0.00019651711,0.0001030946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087294757,0.00051693013,0.00039119486,0.00056768296,0.0011476311,0.002692371,0.0015702964,0.0011316146,0.0015026189],"category_scores_gemma":[0.0011124345,0.0003269637,0.00053572486,0.0007760241,0.0010263401,0.002178727,0.0017323039,0.001396993,0.0009811373],"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.00011818954,0.00008946993,0.0007595112,0.00015131298,0.0000443731,0.0004374947,0.00072897295,0.08486215,0.019745717,0.80796534,0.007168737,0.077928804],"study_design_scores_gemma":[0.000051066498,0.00029919465,0.00035252314,0.00008139161,0.000085633066,0.0006826473,0.00034462192,0.6139563,0.007851271,0.20210892,0.17410989,0.00007655519],"about_ca_topic_score_codex":0.00389888,"about_ca_topic_score_gemma":0.005304785,"teacher_disagreement_score":0.00389888,"about_ca_system_score_codex":0.001317535,"about_ca_system_score_gemma":0.0017416701,"threshold_uncertainty_score":0.009559393},"labels":[],"label_agreement":null},{"id":"W2551266388","doi":"10.1109/tnet.2016.2621067","title":"Flexible Caching Algorithms for Video Content Distribution Networks","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Server; The Internet; Computer network; Online algorithm; Algorithm; Enhanced Data Rates for GSM Evolution; Greedy algorithm; Cache algorithms; Content delivery; Distributed computing; CPU cache; Operating system","score_opus":0.07465156012194464,"score_gpt":0.2679168982591032,"score_spread":0.19326533813715857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551266388","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.03444996,0.00109047,0.9602707,0.00029205004,0.000052504492,0.0000871998,0.00008066924,0.0007562144,0.00292017],"genre_scores_gemma":[0.67321146,0.0007489505,0.32264847,0.00014864001,0.00008619738,0.00021956052,0.00020215908,0.0001672429,0.002567411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987733,0.0005387445,0.00005818224,0.00017333703,0.00028928916,0.00016703698],"domain_scores_gemma":[0.9952093,0.003114255,0.00039618765,0.00060119585,0.0005631265,0.00011600139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023615079,0.0008465367,0.0010240278,0.001016954,0.0008430913,0.0014081756,0.0017315503,0.0010582826,0.0012692581],"category_scores_gemma":[0.0100260675,0.00034495545,0.00044067556,0.0017837095,0.0010942129,0.0021571221,0.0010882792,0.0010713338,0.00028906082],"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.00014476733,0.000084736734,0.0008226123,0.00006402648,0.000023996881,0.000037575996,0.00009150358,0.8727988,0.002540196,0.038635463,0.002271924,0.08248437],"study_design_scores_gemma":[0.000016513715,0.000021600623,0.00008296443,0.0000054236334,0.0000044178646,0.000014980489,0.00001177275,0.9864879,0.00057694846,0.012292023,0.00047903406,0.000006409267],"about_ca_topic_score_codex":0.004792044,"about_ca_topic_score_gemma":0.004492128,"teacher_disagreement_score":0.004792044,"about_ca_system_score_codex":0.0024614236,"about_ca_system_score_gemma":0.0012455763,"threshold_uncertainty_score":0.017858922},"labels":[],"label_agreement":null},{"id":"W2552781918","doi":"10.1145/2988336.2988343","title":"AdaptCache","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.015274959703470838,"score_gpt":0.18886941247549052,"score_spread":0.17359445277201968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552781918","genre_codex":"software","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.11980496,0.006018425,0.31839874,0.0029262516,0.0030063337,0.0026491967,0.010491897,0.37066934,0.1660349],"genre_scores_gemma":[0.55994815,0.0030646888,0.23297898,0.0033133489,0.0007019254,0.002433612,0.022205284,0.01669867,0.15865527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985348,0.00015015189,0.00011504687,0.00022794405,0.0007588193,0.00021321927],"domain_scores_gemma":[0.99670154,0.00041131012,0.00013845826,0.001701479,0.0008541164,0.00019311593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009739603,0.0011378076,0.00097315846,0.0012213953,0.0012885905,0.002207396,0.004617385,0.001590598,0.015812336],"category_scores_gemma":[0.004682187,0.0007445017,0.0006167858,0.002098897,0.0006710239,0.0030184386,0.0025311704,0.0022119726,0.005452336],"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.0026141694,0.00094046484,0.011757331,0.0010484182,0.0004010423,0.0005752947,0.0007440878,0.023037765,0.026315758,0.035795547,0.30959576,0.58717436],"study_design_scores_gemma":[0.00056142407,0.0003945966,0.0066032577,0.00015315332,0.00025019815,0.00096172484,0.0003226429,0.29911065,0.04303396,0.027975997,0.6203365,0.0002958703],"about_ca_topic_score_codex":0.0092596635,"about_ca_topic_score_gemma":0.013386072,"teacher_disagreement_score":0.015812336,"about_ca_system_score_codex":0.0012741407,"about_ca_system_score_gemma":0.0017785322,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2560692595","doi":"10.1145/2872518.2890461","title":"Workload Study of a Media-Rich Educational Web Site","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; World Wide Web; Web site; Workload; Web traffic; The Internet; Multimedia; Implementation; Web navigation","score_opus":0.017442206907050426,"score_gpt":0.2361055437500755,"score_spread":0.21866333684302508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560692595","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.99777704,0.000028589484,0.0013769235,0.000020792113,0.0000068726026,0.000056467747,0.00014769295,0.00006903342,0.00051654404],"genre_scores_gemma":[0.9975319,0.000034271157,0.0015775742,0.000022251192,0.000023986786,0.000038951333,0.00035356564,0.000027091824,0.00039031543],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99875724,0.00044825987,0.00009491766,0.00019682219,0.00035758186,0.00014520608],"domain_scores_gemma":[0.99270916,0.0033126343,0.00065950444,0.00048784557,0.0019140379,0.0009167894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007933231,0.00050443667,0.00051148044,0.0015119157,0.0006411282,0.0008802933,0.0008658469,0.000619507,0.00085917074],"category_scores_gemma":[0.004451206,0.00021153332,0.00024812575,0.0012385725,0.00031406197,0.0008944052,0.0004915267,0.0005198162,0.00038125613],"study_design_candidate":"observational","study_design_consensus":"observational","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.0040396224,0.012892197,0.5187206,0.0012046699,0.00039521966,0.0040115435,0.01019916,0.056149777,0.24299844,0.0023448854,0.008292614,0.13875122],"study_design_scores_gemma":[0.00015859999,0.005017146,0.53740877,0.00007642459,0.00019259115,0.001761444,0.0067016054,0.393391,0.049272377,0.00099858,0.0048464322,0.00017497035],"about_ca_topic_score_codex":0.005307153,"about_ca_topic_score_gemma":0.0049285498,"teacher_disagreement_score":0.005307153,"about_ca_system_score_codex":0.0007048163,"about_ca_system_score_gemma":0.00040092188,"threshold_uncertainty_score":0.010552466},"labels":[],"label_agreement":null},{"id":"W2562538263","doi":"10.1080/08874417.2006.11645899","title":"Performance Evaluation for Web Applications with Web Caching in a Distributed Wireless System Using Opnet™","year":2006,"lang":"en","type":"article","venue":"Journal of Computer Information Systems","topic":"Caching and Content Delivery","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 Lethbridge","funders":"","keywords":"Computer science; Cache; Computer network; Web server; Server; Smart Cache; Cache algorithms; Wireless; Operating system; CPU cache; The Internet","score_opus":0.017597592798651737,"score_gpt":0.2349810861526671,"score_spread":0.21738349335401536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562538263","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.9788168,0.00040605426,0.01921241,0.000057991638,0.000014946073,0.000043896078,0.00002898574,0.00041618574,0.0010026256],"genre_scores_gemma":[0.9937703,0.00010387185,0.005774964,0.0000098481805,0.0000057030006,0.000014408469,0.000038726408,0.000014215149,0.00026800056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886924,0.00034660057,0.00007868632,0.00012673129,0.00041134463,0.00016728227],"domain_scores_gemma":[0.9924115,0.004306583,0.0005247636,0.0005889765,0.0018272579,0.00034092364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016329561,0.00072878797,0.0009977805,0.0006688324,0.00048658298,0.00072814064,0.00079415087,0.0006265983,0.00054305384],"category_scores_gemma":[0.005676961,0.00024413271,0.00039506436,0.0011491025,0.0003948859,0.00097417383,0.00036310081,0.00043443026,0.00015963086],"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.0030549695,0.0012227974,0.03245908,0.0004319575,0.0003996438,0.00059435976,0.00027927384,0.79334563,0.08719504,0.0018678537,0.0008025078,0.07834687],"study_design_scores_gemma":[0.000095352414,0.0012628668,0.005050278,0.000011758444,0.00012098683,0.00019084447,0.00006458165,0.9673789,0.025213296,0.00026693096,0.0003163122,0.0000278494],"about_ca_topic_score_codex":0.0050580185,"about_ca_topic_score_gemma":0.0032101185,"teacher_disagreement_score":0.0050580185,"about_ca_system_score_codex":0.0012064839,"about_ca_system_score_gemma":0.00060739764,"threshold_uncertainty_score":0.010057151},"labels":[],"label_agreement":null},{"id":"W2565659764","doi":"10.1016/j.comnet.2016.12.009","title":"Characteristic time routing in information centric networks","year":2016,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cache; Latency (audio); Computer network; Policy-based routing; The Internet; Information-centric networking; Distributed computing; Cache algorithms; Routing (electronic design automation); Static routing; Routing protocol; CPU cache; World Wide Web; Telecommunications","score_opus":0.005028162034221571,"score_gpt":0.17083391130108713,"score_spread":0.16580574926686556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565659764","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.117117845,0.003202902,0.8675612,0.0023452952,0.0002180414,0.0000853452,0.00019440442,0.00050073984,0.008774211],"genre_scores_gemma":[0.9424764,0.0028667687,0.04366205,0.0002437413,0.00029940408,0.00009387875,0.00020934809,0.00014294146,0.010005481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988949,0.0003645608,0.000047165904,0.00017302134,0.00032232355,0.00019810848],"domain_scores_gemma":[0.9869163,0.008810552,0.0015292027,0.0007531577,0.0012924311,0.00069837255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019629344,0.00052761345,0.0009781511,0.0017016586,0.0010496326,0.0030470642,0.0018011618,0.0014624344,0.002580033],"category_scores_gemma":[0.013993958,0.0005655888,0.00036694252,0.0031610515,0.0019148078,0.0048730997,0.0008940724,0.0013155595,0.00032957],"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.00020304284,0.0000554483,0.001905642,0.00016392964,0.000036171918,0.00016485431,0.0003345434,0.23963624,0.0026660773,0.71856385,0.004978321,0.031291816],"study_design_scores_gemma":[0.000021715554,0.00004633893,0.00038628685,0.000015558262,0.000028265109,0.00013845626,0.000078715646,0.70317763,0.0007499491,0.29248145,0.0028573035,0.000018354925],"about_ca_topic_score_codex":0.0039422056,"about_ca_topic_score_gemma":0.0033709302,"teacher_disagreement_score":0.0039422056,"about_ca_system_score_codex":0.003704012,"about_ca_system_score_gemma":0.001589514,"threshold_uncertainty_score":0.026874602},"labels":[],"label_agreement":null},{"id":"W2565778775","doi":"","title":"Cache In The Air: Enabling the Green Multimedia Caching and Delivery for the 5G Network","year":2014,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Cache; Computer science; Multimedia; Computer network; Content delivery; Smart Cache; CPU cache; Cache algorithms","score_opus":0.020405039490345472,"score_gpt":0.22109611192631512,"score_spread":0.20069107243596965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565778775","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.2548185,0.03290483,0.56021214,0.013470421,0.0034049458,0.00069789594,0.0031606525,0.021409553,0.109921016],"genre_scores_gemma":[0.88025874,0.0055145123,0.082839794,0.0021146685,0.00061596144,0.00013893307,0.0013078112,0.00064219214,0.026567308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899215,0.00018112296,0.00003367024,0.00016149803,0.00032869025,0.0003028039],"domain_scores_gemma":[0.997974,0.00038722815,0.000096580006,0.00046724,0.00082811853,0.00024680165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014915343,0.0009543411,0.0014591585,0.0010183166,0.0015826811,0.0044801617,0.0018521476,0.002218714,0.0067541995],"category_scores_gemma":[0.0033246265,0.00044192895,0.00042228863,0.0018146287,0.0011023475,0.0045564813,0.0027651004,0.001993641,0.0013876079],"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.0034053132,0.0005331192,0.0073092934,0.001020047,0.00035907762,0.0007919935,0.0015296256,0.051374692,0.08358939,0.20691916,0.19410987,0.44905838],"study_design_scores_gemma":[0.00025177785,0.0005319714,0.001775211,0.0002710116,0.00034685666,0.0005987187,0.0009583734,0.73625875,0.044081103,0.066682175,0.14807762,0.00016644079],"about_ca_topic_score_codex":0.022946386,"about_ca_topic_score_gemma":0.03371709,"teacher_disagreement_score":0.022946386,"about_ca_system_score_codex":0.0020500156,"about_ca_system_score_gemma":0.003098898,"threshold_uncertainty_score":0.045625627},"labels":[],"label_agreement":null},{"id":"W2567386150","doi":"10.1109/iri.2016.60","title":"Bloom Filter Tree for Fast Search and Synchronization of Tree-Structured Data","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Bloom filter; Tree traversal; Computer science; Tree (set theory); Synchronizing; Search tree; Metadata; Data structure; Interval tree; Depth-first search; Overhead (engineering); Synchronization (alternating current); Data mining; Search algorithm; Algorithm; Computer network; Mathematics; Operating system","score_opus":0.04022922930280814,"score_gpt":0.25794561049174125,"score_spread":0.2177163811889331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567386150","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.011532782,0.00035508868,0.98417443,0.00013664713,0.000036434212,0.00016710613,0.0002563126,0.002398064,0.0009430442],"genre_scores_gemma":[0.11520878,0.000255033,0.881976,0.00010963185,0.000032311877,0.00027390782,0.00058867485,0.00015156185,0.0014040748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827516,0.00036978454,0.00019349187,0.00025388054,0.0007449943,0.00016268899],"domain_scores_gemma":[0.99550855,0.0020133099,0.00044489864,0.0010533507,0.0008232148,0.0001566259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022342955,0.0006429036,0.0010423805,0.0024899915,0.0015432128,0.0017199878,0.0018546009,0.0010752457,0.0025072275],"category_scores_gemma":[0.007918027,0.0005786306,0.00064461783,0.0036425672,0.0007874618,0.0035386311,0.0012806071,0.0009365376,0.0010507717],"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.0011243246,0.00025843587,0.006043506,0.0006119759,0.00019829144,0.0004952672,0.0010354307,0.12567282,0.07488978,0.109643884,0.016993728,0.6630326],"study_design_scores_gemma":[0.00014337411,0.00019793629,0.00078404637,0.00005790678,0.000051273753,0.00032275915,0.00017538926,0.8969053,0.044808302,0.04064177,0.01585584,0.000056083445],"about_ca_topic_score_codex":0.007873823,"about_ca_topic_score_gemma":0.010128767,"teacher_disagreement_score":0.007873823,"about_ca_system_score_codex":0.0025929727,"about_ca_system_score_gemma":0.004105133,"threshold_uncertainty_score":0.018813372},"labels":[],"label_agreement":null},{"id":"W2568070088","doi":"10.1109/itc-28.2016.142","title":"Optimizing Time to Exhaustion in Service Providers Using Information-centric Networking","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Service provider; Computer science; Popularity; Software deployment; Cache; Service (business); Information-centric networking; Capital expenditure; Computer network; Network congestion; Business; Marketing; Finance","score_opus":0.017680657306079144,"score_gpt":0.21059272583576166,"score_spread":0.1929120685296825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568070088","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.58204335,0.0013755774,0.40355036,0.0017305976,0.00010939444,0.00020781496,0.000104357234,0.000521576,0.010356978],"genre_scores_gemma":[0.9820779,0.00026254507,0.016831616,0.00007639754,0.000018352344,0.000025263631,0.000027512004,0.000028329025,0.0006521007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990754,0.0003565196,0.00004391684,0.00010985102,0.00013070946,0.00028357294],"domain_scores_gemma":[0.99589324,0.0022674648,0.0006404501,0.00024028585,0.00046064518,0.0004978929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024897486,0.000780482,0.0007980007,0.00061932934,0.0010373722,0.001594451,0.001046811,0.0007250914,0.0014904602],"category_scores_gemma":[0.008234533,0.00036401476,0.0002474425,0.000907797,0.0006463822,0.002225563,0.001314307,0.0006685268,0.00018103758],"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.0008648273,0.00040068495,0.0066941194,0.00018101229,0.00007055455,0.00034289644,0.0005199453,0.84102803,0.02381845,0.033531845,0.0032806066,0.089267015],"study_design_scores_gemma":[0.000037317564,0.0002871585,0.0009670408,0.000018842293,0.000043143562,0.00010165484,0.0002521956,0.9805998,0.0047866697,0.011408845,0.0014787999,0.000018490966],"about_ca_topic_score_codex":0.0032263247,"about_ca_topic_score_gemma":0.0037585068,"teacher_disagreement_score":0.0032263247,"about_ca_system_score_codex":0.001516148,"about_ca_system_score_gemma":0.0020090854,"threshold_uncertainty_score":0.0131672025},"labels":[],"label_agreement":null},{"id":"W2568671317","doi":"10.1109/mwc.2017.1500384wc","title":"Information-Centric Wireless Networks with Virtualization and D2D Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Backhaul (telecommunications); Computer network; Cellular network; Wireless; Virtualization; Wireless network; Radio access network; Distributed computing; Base station; Telecommunications; Cloud computing; Mobile station","score_opus":0.026564091058186273,"score_gpt":0.257263249019564,"score_spread":0.23069915796137772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568671317","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.050849978,0.0031840485,0.92954385,0.00088976795,0.00019265406,0.000090093345,0.00007819991,0.00032907134,0.014842264],"genre_scores_gemma":[0.94113475,0.0014921775,0.05517415,0.0001376246,0.00007392603,0.00006379785,0.000059974096,0.0000146466045,0.0018489363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00020502182,0.000022048587,0.000070026304,0.00012985308,0.00011706828],"domain_scores_gemma":[0.9996271,0.00013030159,0.000048879036,0.000075346856,0.000070300215,0.00004803623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005432998,0.00056663476,0.00040973225,0.00034585936,0.00056305167,0.0014471263,0.0010011871,0.00055245997,0.00064090034],"category_scores_gemma":[0.00089607824,0.00017453602,0.0003562095,0.00084552856,0.0006565333,0.001734127,0.0012611499,0.0006459099,0.0001033281],"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.00016743405,0.00012281437,0.0020632956,0.00023336207,0.000096165604,0.0005437408,0.00016059694,0.55597615,0.011957446,0.3068306,0.006165455,0.11568291],"study_design_scores_gemma":[0.000013640799,0.00006166386,0.00030730033,0.00001638603,0.000029106808,0.0002566408,0.000069074995,0.962005,0.0024627983,0.024684122,0.010076375,0.000017959243],"about_ca_topic_score_codex":0.0050454047,"about_ca_topic_score_gemma":0.0043134647,"teacher_disagreement_score":0.0050454047,"about_ca_system_score_codex":0.0011590233,"about_ca_system_score_gemma":0.0012770937,"threshold_uncertainty_score":0.010032117},"labels":[],"label_agreement":null},{"id":"W2575789609","doi":"10.3390/s17010181","title":"Value-Based Caching in Information-Centric Wireless Body Area Networks","year":2017,"lang":"en","type":"article","venue":"Sensors","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"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":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; King Saud University; Institute of Population and Public Health; Society for Radiological Protection","keywords":"Computer science; Cache; Exploit; Node (physics); Computer network; Wireless; Distributed computing; Real-time computing; Computer security; Operating system","score_opus":0.012360375719023608,"score_gpt":0.2196896327202351,"score_spread":0.2073292570012115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575789609","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.11338271,0.005663346,0.8750829,0.00048898463,0.00015855224,0.0001398789,0.00008920775,0.00077741226,0.0042169997],"genre_scores_gemma":[0.95354086,0.0009987919,0.044175696,0.00007499545,0.00005306944,0.00005288105,0.000047786987,0.000027929145,0.0010280915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925476,0.0002939021,0.00004878131,0.00009049001,0.00020621895,0.0001058334],"domain_scores_gemma":[0.9976101,0.0011834743,0.00034255136,0.00037173816,0.00040908981,0.000083105304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012206481,0.00047799852,0.0008033656,0.00071364024,0.00068866124,0.0011005544,0.0016844968,0.00073807576,0.00041972112],"category_scores_gemma":[0.0038744705,0.0002970409,0.00032120314,0.0011873902,0.00082373456,0.0018140145,0.00063183333,0.0004330484,0.00012676182],"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.00058405765,0.0001927802,0.007948348,0.0005408488,0.00018673766,0.00087054976,0.0006248748,0.6673079,0.028808685,0.091293186,0.0046267956,0.1970153],"study_design_scores_gemma":[0.000020719648,0.00015403652,0.00070254825,0.00003362044,0.000053818534,0.00030663752,0.00006955814,0.97577137,0.0062629594,0.0131142745,0.003480137,0.000030372115],"about_ca_topic_score_codex":0.0038000545,"about_ca_topic_score_gemma":0.0035510513,"teacher_disagreement_score":0.0038000545,"about_ca_system_score_codex":0.001168615,"about_ca_system_score_gemma":0.00083627005,"threshold_uncertainty_score":0.00847888},"labels":[],"label_agreement":null},{"id":"W2578979334","doi":"10.1007/s11042-016-4308-z","title":"Dependency- and similarity-aware caching for HTTP adaptive streaming","year":2017,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Qatar National Research Fund","keywords":"Computer science; Cache; Server; Quality of experience; Computer network; Context (archaeology); Hypertext Transfer Protocol; Overhead (engineering); Dynamic Adaptive Streaming over HTTP; The Internet; Distributed computing; Quality of service; World Wide Web; Operating system","score_opus":0.050132409794068564,"score_gpt":0.2837891941933845,"score_spread":0.23365678439931592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578979334","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.11386643,0.0006436284,0.87903523,0.00028601426,0.00011155408,0.000120198325,0.00037449363,0.002163932,0.0033984215],"genre_scores_gemma":[0.8989438,0.00026535583,0.097406775,0.000065022854,0.0001085234,0.00004773279,0.00042262988,0.00015556604,0.0025844998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904317,0.0001653994,0.00008560177,0.00017472422,0.00038962922,0.00014136462],"domain_scores_gemma":[0.9965364,0.00091299514,0.00027961133,0.0012150002,0.0008620433,0.00019394171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092516583,0.0005371164,0.0011307277,0.0009814393,0.0009414757,0.0010833194,0.0018963479,0.0008293458,0.0014772387],"category_scores_gemma":[0.005273664,0.00043837662,0.0005725452,0.0016700203,0.00058571965,0.002087734,0.0013665239,0.0010403888,0.0004015568],"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.0015615667,0.00093063206,0.015945556,0.00028264674,0.0002563815,0.0008278744,0.0004339216,0.38190064,0.09355646,0.11021089,0.014391078,0.37970233],"study_design_scores_gemma":[0.0000110583005,0.00004101133,0.0008612016,0.0000042171346,0.000027086033,0.00013685679,0.000020019814,0.98051476,0.0068586017,0.010750797,0.00075734337,0.000017109489],"about_ca_topic_score_codex":0.0074090254,"about_ca_topic_score_gemma":0.010867879,"teacher_disagreement_score":0.0074090254,"about_ca_system_score_codex":0.001311523,"about_ca_system_score_gemma":0.0021059536,"threshold_uncertainty_score":0.014731824},"labels":[],"label_agreement":null},{"id":"W2583849762","doi":"10.1109/glocom.2016.7841508","title":"A Hybrid Regression Model for Video Popularity-Based Cache Replacement in Content Delivery Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"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; Université du Québec à Montréal","funders":"","keywords":"Computer science; Cache; Popularity; Overhead (engineering); Cache algorithms; Content delivery network; Computer network; Real-time computing; CPU cache; Operating system; Server","score_opus":0.0571671792165885,"score_gpt":0.2526258442866478,"score_spread":0.1954586650700593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583849762","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.17925036,0.0014267763,0.81480354,0.0006346007,0.0000889761,0.000074017174,0.00058970484,0.0016368589,0.0014951645],"genre_scores_gemma":[0.93633723,0.00069584354,0.05786422,0.000119580836,0.000094461546,0.00013906721,0.00072195433,0.0001251146,0.0039026288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.0002857273,0.00004509559,0.00019311033,0.00013871807,0.00008628378],"domain_scores_gemma":[0.997364,0.0016842558,0.00028934417,0.0001405291,0.00047311475,0.000048788657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015914342,0.0008139648,0.0012250061,0.0007083133,0.00030487534,0.0007231447,0.0018938043,0.0008226787,0.0009337941],"category_scores_gemma":[0.0058475095,0.0004446999,0.00062148226,0.0011953942,0.00034292822,0.001207368,0.00038558562,0.0009985912,0.00050681876],"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.00010095328,0.000072326,0.0033059253,0.000042496773,0.00004587405,0.000059919428,0.000032979096,0.9646426,0.0014044053,0.0020647377,0.0008460602,0.027381795],"study_design_scores_gemma":[0.000001894084,0.0000066951347,0.00012920832,0.0000011784381,0.0000035519531,0.000006672048,0.0000015014822,0.9994869,0.00008894588,0.00020851921,0.000062935265,0.0000020467746],"about_ca_topic_score_codex":0.023730712,"about_ca_topic_score_gemma":0.014942073,"teacher_disagreement_score":0.023730712,"about_ca_system_score_codex":0.0011376202,"about_ca_system_score_gemma":0.000827041,"threshold_uncertainty_score":0.047185183},"labels":[],"label_agreement":null},{"id":"W2585499063","doi":"10.1109/glocom.2016.7841636","title":"Blossom: Content Distribution Using Inter-Datacenter Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"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":"China Scholarship Council; University of Toronto","keywords":"Computer science; Multicast; Cloud computing; Computer network; Distributed computing; Bandwidth (computing); Latency (audio); Bandwidth allocation; Telecommunications","score_opus":0.05994883804541524,"score_gpt":0.23878862047505542,"score_spread":0.1788397824296402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585499063","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.028899057,0.00050442334,0.9577457,0.00032604334,0.00008302852,0.00024388552,0.00018900585,0.005328692,0.006680316],"genre_scores_gemma":[0.56481975,0.00036382547,0.42680493,0.000190193,0.0000615926,0.00020495555,0.00040728686,0.0004976904,0.006649743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992092,0.00024575088,0.000025714138,0.0001356975,0.00024236002,0.00014125604],"domain_scores_gemma":[0.99870336,0.000458134,0.00012802902,0.0003450404,0.00023228163,0.00013317178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713607,0.0007986885,0.0008139345,0.00087597006,0.0011775487,0.0015695086,0.0028123574,0.0010804315,0.0028607803],"category_scores_gemma":[0.0041538193,0.000409808,0.0004155944,0.0013404903,0.00082978245,0.002046046,0.0018599285,0.0008534002,0.0008065827],"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.00081419194,0.00029285037,0.0019289932,0.0001787006,0.00009084305,0.00016381546,0.00018619176,0.6870306,0.013188967,0.07243015,0.019450128,0.20424463],"study_design_scores_gemma":[0.000045776054,0.00004045035,0.000102055135,0.0000070772912,0.0000067964024,0.0000395198,0.000012551816,0.98226017,0.002690117,0.011072499,0.0037147875,0.000008252977],"about_ca_topic_score_codex":0.0077855587,"about_ca_topic_score_gemma":0.00812901,"teacher_disagreement_score":0.0077855587,"about_ca_system_score_codex":0.00214476,"about_ca_system_score_gemma":0.0019716665,"threshold_uncertainty_score":0.015561342},"labels":[],"label_agreement":null},{"id":"W2585669107","doi":"10.1109/glocom.2016.7842308","title":"Supporting Consumer Mobility Using Proactive Caching in Named Data Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Mobility management; Cache; Handover; Robustness (evolution); Overhead (engineering); Benchmark (surveying); Scheme (mathematics); The Internet; Distributed computing","score_opus":0.07227911942674317,"score_gpt":0.320580157921122,"score_spread":0.24830103849437882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585669107","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.49161565,0.0010246865,0.49929407,0.00057459204,0.00009569678,0.00015444095,0.00013654033,0.001853249,0.0052510747],"genre_scores_gemma":[0.9756446,0.00013727191,0.023696292,0.00003838281,0.000010884052,0.000022654629,0.00006400299,0.0000190716,0.00036680486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992198,0.00029365113,0.00006187756,0.000103146536,0.00018307455,0.00013845762],"domain_scores_gemma":[0.9974202,0.0010985854,0.00030565032,0.00063781533,0.00040174718,0.00013600312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017767138,0.0005275144,0.0006727852,0.00043390997,0.00076918374,0.0012602096,0.0017015791,0.0009497178,0.00038301054],"category_scores_gemma":[0.004342009,0.00030301817,0.00028951673,0.00071292114,0.0006543136,0.0020394197,0.0013225204,0.0004804719,0.00010109976],"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.0009587752,0.00030581455,0.00862402,0.0002386008,0.0001154193,0.0005369203,0.00040583897,0.7915983,0.053338435,0.032547884,0.0034156237,0.10791431],"study_design_scores_gemma":[0.000019392717,0.00006439523,0.00044716845,0.00000585946,0.000020059473,0.00006837352,0.00004550551,0.9890265,0.005929222,0.003172608,0.00118246,0.000018528624],"about_ca_topic_score_codex":0.0057069706,"about_ca_topic_score_gemma":0.0058356435,"teacher_disagreement_score":0.0057069706,"about_ca_system_score_codex":0.0012732767,"about_ca_system_score_gemma":0.0011918878,"threshold_uncertainty_score":0.011347473},"labels":[],"label_agreement":null},{"id":"W2591925619","doi":"10.1109/ccwc.2017.7868393","title":"An infrastructure as a Service for Mobile Ad-hoc Cloud","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"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 Ottawa","funders":"","keywords":"Cloud computing; Computer science; Distributed computing; Mobile device; Mobile cloud computing; Mobile computing; Service (business); Mobile ad hoc network; Block (permutation group theory); Computer network; World Wide Web; Operating system","score_opus":0.013516863208670167,"score_gpt":0.2772531863810417,"score_spread":0.2637363231723715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591925619","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.019465717,0.009871864,0.848313,0.006209557,0.0040635667,0.0011418721,0.0005591879,0.008528383,0.10184692],"genre_scores_gemma":[0.5967076,0.00896422,0.33634648,0.0016303627,0.0012418159,0.0005615567,0.0009400288,0.00057122414,0.053036705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993749,0.00012974525,0.000042811815,0.00007697113,0.00026730372,0.00010830929],"domain_scores_gemma":[0.9996094,0.00003828385,0.000024549285,0.00008040271,0.00013560112,0.000111824374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005145175,0.00049571664,0.00042868103,0.0006817666,0.0015613738,0.00268897,0.0012410833,0.0014405525,0.0039587263],"category_scores_gemma":[0.0011549289,0.00025260955,0.0004920686,0.0011036173,0.0006759649,0.002429996,0.0016194684,0.0012931605,0.002362654],"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.00022416217,0.000110660156,0.0010961334,0.0007156653,0.00008383769,0.0018489297,0.00046646883,0.018645626,0.028774621,0.6492509,0.1048466,0.1939363],"study_design_scores_gemma":[0.00004120126,0.0002695113,0.00064265303,0.00017104375,0.00007241626,0.0014350862,0.00033869004,0.21714057,0.0075243143,0.054292776,0.7179841,0.00008771348],"about_ca_topic_score_codex":0.00414483,"about_ca_topic_score_gemma":0.0054271496,"teacher_disagreement_score":0.00414483,"about_ca_system_score_codex":0.0016038587,"about_ca_system_score_gemma":0.0028238613,"threshold_uncertainty_score":0.013243258},"labels":[],"label_agreement":null},{"id":"W2592755103","doi":"10.1109/access.2017.2678990","title":"Adaptive Scheme for Caching YouTube Content in a Cellular Network: Machine Learning Approach","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":110,"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 British Columbia","funders":"Huawei Technologies","keywords":"Computer science; Cache; Cellular network; Quality of experience; Computer network; Server; Scheme (mathematics); Base station; Quality of service","score_opus":0.1465749325791359,"score_gpt":0.29921969687710437,"score_spread":0.15264476429796847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592755103","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.1226747,0.00044976218,0.8738585,0.0005212633,0.000046753663,0.000052689822,0.000033041382,0.00024798888,0.0021153162],"genre_scores_gemma":[0.9635587,0.00015377751,0.034684166,0.000093862196,0.000033395925,0.000050889448,0.00003797279,0.0000125003235,0.0013746489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.000076610166,0.000011811753,0.00004789005,0.000048147507,0.000041430445],"domain_scores_gemma":[0.9986765,0.0008692656,0.0001140013,0.0000405183,0.00025717332,0.0000425124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065826945,0.00038285958,0.00065609545,0.00039226963,0.00036276004,0.00047908188,0.0008840889,0.00089707354,0.00063954334],"category_scores_gemma":[0.002629192,0.00019733756,0.0003235651,0.00044149277,0.0005934437,0.0006087976,0.00039023705,0.00072811183,0.00008571908],"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.000022597802,0.000022192358,0.0005940595,0.000012357893,0.000010089393,0.000026413963,0.00001543862,0.9882881,0.00041322745,0.0018757889,0.00017051527,0.008549286],"study_design_scores_gemma":[6.458121e-7,0.00000266974,0.00002163555,3.9598214e-7,7.423405e-7,0.000001341499,9.467581e-7,0.99974924,0.000037227826,0.0001744237,0.000010163933,5.8378055e-7],"about_ca_topic_score_codex":0.01827874,"about_ca_topic_score_gemma":0.011555061,"teacher_disagreement_score":0.01827874,"about_ca_system_score_codex":0.0014229652,"about_ca_system_score_gemma":0.00081835577,"threshold_uncertainty_score":0.036344707},"labels":[],"label_agreement":null},{"id":"W2593718187","doi":"","title":"Novel adaptation technique for web browsing using satellite networks","year":2002,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Caching and Content Delivery","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 Alberta","funders":"","keywords":"Computer science; Mobile Web; Web navigation; Computer network; Mobile computing; Mobile device; Wireless network; Adaptation (eye); Bandwidth (computing); Wireless; World Wide Web; Multimedia; Mobile technology; The Internet; Telecommunications","score_opus":0.018198069403992326,"score_gpt":0.22184804778421774,"score_spread":0.20364997838022542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593718187","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.08661947,0.0010538079,0.9036054,0.00019441762,0.00016777277,0.00007690623,0.000028842145,0.0016131265,0.006640239],"genre_scores_gemma":[0.7555368,0.00092298293,0.23095208,0.00023022523,0.00023065133,0.000118668686,0.00011750772,0.000083967294,0.0118070915],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998542,0.000032547796,0.0000069910543,0.000027022626,0.000056466328,0.000022653156],"domain_scores_gemma":[0.99973017,0.0000948412,0.000021115244,0.000051463994,0.00008053514,0.000021904594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018816451,0.00028754026,0.00031072897,0.00036659237,0.00029826854,0.0002948573,0.00060598156,0.00043836434,0.001616029],"category_scores_gemma":[0.00060192944,0.00011392113,0.00022721248,0.00045799976,0.00024527943,0.00048815578,0.0003142219,0.00048703843,0.0005683096],"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.00039358225,0.00024182914,0.0018939537,0.00014431177,0.000065990134,0.0007597186,0.00025923317,0.025902359,0.28948873,0.0073320353,0.0044969236,0.6690213],"study_design_scores_gemma":[0.00006961551,0.0003950579,0.003228093,0.000024513552,0.0000887395,0.002419896,0.00013933271,0.88175243,0.08974884,0.002774362,0.019301696,0.00005749744],"about_ca_topic_score_codex":0.0010592908,"about_ca_topic_score_gemma":0.0012914774,"teacher_disagreement_score":0.001616029,"about_ca_system_score_codex":0.00017752714,"about_ca_system_score_gemma":0.0001570683,"threshold_uncertainty_score":0.0054061413},"labels":[],"label_agreement":null},{"id":"W2594736069","doi":"10.1109/access.2017.2678510","title":"LACS: A Lightweight Label-Based Access Control Scheme in IoT-Based 5G Caching Context","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":53,"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 Waterloo","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; False sharing; Node (physics); Access control; Wireless; Wireless network; Context (archaeology); Verifiable secret sharing; Cache; Telecommunications","score_opus":0.05803462649450163,"score_gpt":0.3313925177185276,"score_spread":0.273357891224026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594736069","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.09516652,0.0019202543,0.8920774,0.0006280101,0.00038623757,0.0004298486,0.00016374905,0.003633474,0.005594468],"genre_scores_gemma":[0.959313,0.0003062029,0.037725896,0.000285048,0.00010161983,0.00012886086,0.00010322494,0.000029396055,0.0020066297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980501,0.00043545055,0.00018515183,0.00031577825,0.0006199442,0.0003936154],"domain_scores_gemma":[0.9966698,0.000546517,0.00046678697,0.0009244022,0.0011689669,0.00022345608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908584,0.0006961391,0.0009140374,0.0011196986,0.0016464737,0.0016590853,0.0019500295,0.0011999107,0.0010699487],"category_scores_gemma":[0.0038612299,0.0002234432,0.00055923685,0.0009147994,0.0015105667,0.0030284596,0.002195203,0.0011352267,0.0003783054],"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.0028465877,0.0006124018,0.009152606,0.000708209,0.00030173888,0.0028011836,0.0018600988,0.10692943,0.19458765,0.29879507,0.021392984,0.36001202],"study_design_scores_gemma":[0.00016270361,0.0005688844,0.0010730004,0.000063219755,0.00013718133,0.0011020569,0.00017315266,0.92087436,0.03196073,0.026939865,0.016749403,0.00019551191],"about_ca_topic_score_codex":0.006409136,"about_ca_topic_score_gemma":0.0042130584,"teacher_disagreement_score":0.006409136,"about_ca_system_score_codex":0.0021784625,"about_ca_system_score_gemma":0.0019560682,"threshold_uncertainty_score":0.0158059},"labels":[],"label_agreement":null},{"id":"W2600340828","doi":"10.1109/tc.2017.2687920","title":"Rate-Selective Caching for Adaptive Streaming Over Information-Centric Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Computer network; Overhead (engineering); Information-centric networking; Scalability; Provisioning; The Internet; Quality of service; Throughput; Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.01786392560857536,"score_gpt":0.23579656039838462,"score_spread":0.21793263478980926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600340828","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.22121082,0.0017176359,0.7671564,0.000593594,0.000084450556,0.00014909841,0.00014399154,0.00094859436,0.007995371],"genre_scores_gemma":[0.9577552,0.0004375909,0.040758353,0.00004865781,0.000019069106,0.00003974775,0.00004896579,0.00003024184,0.0008621518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997507,0.00007997477,0.000011810395,0.000029561304,0.000083194,0.000044836033],"domain_scores_gemma":[0.9992137,0.0004108458,0.00008359617,0.000089432695,0.00016111185,0.00004127625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079274416,0.00035945897,0.00039177763,0.00038282564,0.0004742271,0.0005707178,0.0009095884,0.00038387024,0.00081707357],"category_scores_gemma":[0.003219023,0.00017379054,0.0002116693,0.00057692017,0.00033928157,0.0007044674,0.00030875255,0.00037788137,0.00008282666],"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.00014906084,0.0000613472,0.0014409433,0.0000744795,0.000026342335,0.000092403345,0.00007245625,0.9319402,0.008800653,0.021536319,0.0014202577,0.034385562],"study_design_scores_gemma":[0.000006758764,0.000020383774,0.00012632785,0.0000030679128,0.0000059965164,0.000012047169,0.000005853308,0.99674976,0.0009059683,0.0017722197,0.00038860025,0.0000029742378],"about_ca_topic_score_codex":0.012189803,"about_ca_topic_score_gemma":0.020178521,"teacher_disagreement_score":0.012189803,"about_ca_system_score_codex":0.0017492491,"about_ca_system_score_gemma":0.0016356807,"threshold_uncertainty_score":0.024237692},"labels":[],"label_agreement":null},{"id":"W2600386439","doi":"10.1109/vtcfall.2016.7880918","title":"Bandwidth Provisioning in Cache-Enabled Software-Defined Mobile Networks: A Robust Optimization Approach","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software-defined networking; Provisioning; Bandwidth allocation; Bandwidth (computing); Cache; Computer network; Distributed computing; Optimization problem; Convex optimization; Flow control (data); Wireless network; Wireless; Regular polygon","score_opus":0.012418751638164775,"score_gpt":0.19434750573205412,"score_spread":0.18192875409388934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600386439","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.008290834,0.0003824161,0.98959863,0.00023644856,0.000025220239,0.000021535425,0.000020207175,0.00008045163,0.0013443676],"genre_scores_gemma":[0.89393157,0.0010260802,0.10270951,0.00013397928,0.00013036578,0.00015949157,0.00008449877,0.00008979421,0.0017347749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992747,0.00032735558,0.000026970929,0.00013089123,0.00015204339,0.00008812916],"domain_scores_gemma":[0.9985222,0.0009776958,0.00021666742,0.000055318284,0.00017916271,0.000048938662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018568742,0.0013953449,0.0014819925,0.0006491922,0.0003946808,0.0015004398,0.0010910949,0.0014004043,0.0007341261],"category_scores_gemma":[0.0030938364,0.00062008505,0.0009391141,0.0006282224,0.0010601055,0.0010939471,0.0010715068,0.0012601706,0.00009420651],"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.000015544958,0.0000117993595,0.00009923098,0.000033451972,0.000023636208,0.000030772557,0.000013614579,0.98899674,0.0005201502,0.0063624647,0.00016975764,0.0037228249],"study_design_scores_gemma":[0.000002013747,0.0000070872743,0.00001683148,0.0000020706048,0.000003490287,0.0000027177798,0.0000026138177,0.9986939,0.00009619449,0.0010979603,0.000073276526,0.0000018358367],"about_ca_topic_score_codex":0.0065475972,"about_ca_topic_score_gemma":0.0026635283,"teacher_disagreement_score":0.0065475972,"about_ca_system_score_codex":0.0013607492,"about_ca_system_score_gemma":0.001201707,"threshold_uncertainty_score":0.013018966},"labels":[],"label_agreement":null},{"id":"W2601036842","doi":"10.11575/prism/30276","title":"Enhanced Scalable Asynchronous Cache Consistency Scheme for Mobile Environment","year":2011,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Stateful firewall; Cache; Cache invalidation; Computer network; Smart Cache; Stateless protocol; Cache algorithms; Asynchronous communication; Distributed computing; CPU cache; Network packet","score_opus":0.016293310860678555,"score_gpt":0.17728277226939254,"score_spread":0.16098946140871398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601036842","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.13816366,0.0010704759,0.8519848,0.00029594655,0.00025446288,0.00022783403,0.00023191168,0.003577499,0.0041934974],"genre_scores_gemma":[0.874582,0.00025591918,0.121452525,0.00010100301,0.00014780817,0.00014111072,0.00029091598,0.00006446007,0.0029643194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.0001801762,0.00007942915,0.00011712901,0.0002974808,0.000105375955],"domain_scores_gemma":[0.9976088,0.0003746929,0.0002510706,0.0007854908,0.0008362885,0.00014364946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010420424,0.00038291325,0.00069470494,0.0008073697,0.00079640845,0.0008685043,0.0017006511,0.00059802836,0.0009134166],"category_scores_gemma":[0.0027613398,0.00019567132,0.0002979596,0.0011934163,0.00034160967,0.0016527459,0.0011380023,0.0007358828,0.00031845403],"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.002511753,0.0006194452,0.008325898,0.0005339778,0.00021929137,0.0010648229,0.0010241454,0.13594714,0.16652904,0.11667893,0.018104095,0.5484416],"study_design_scores_gemma":[0.00033413726,0.00051302067,0.0011980188,0.000021783499,0.00010843473,0.0005803849,0.000097126314,0.9373208,0.03295857,0.012239005,0.014554874,0.00007389332],"about_ca_topic_score_codex":0.0021866988,"about_ca_topic_score_gemma":0.0020699599,"teacher_disagreement_score":0.0021866988,"about_ca_system_score_codex":0.0007781568,"about_ca_system_score_gemma":0.00127068,"threshold_uncertainty_score":0.0056459308},"labels":[],"label_agreement":null},{"id":"W2611201989","doi":"10.3390/s17050994","title":"Scalability Issues for Remote Sensing Infrastructure: A Case Study","year":2017,"lang":"en","type":"article","venue":"Sensors","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Sensor web; Benchmarking; Computer science; Bottleneck; Scalability; The Internet; Data stream mining; Data collection; Wireless sensor network; Data sharing; Data science; World Wide Web; Database; Telecommunications; Computer network; Data mining; Embedded system","score_opus":0.03287701202170779,"score_gpt":0.3137112260240165,"score_spread":0.28083421400230874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611201989","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.9175858,0.0025509512,0.039873485,0.006805486,0.00011954316,0.0007102772,0.0005790728,0.0020129625,0.029762425],"genre_scores_gemma":[0.9753906,0.0007250422,0.02140429,0.00023154731,0.00007751641,0.000109909415,0.00031738202,0.00019925194,0.0015443268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.99300003,0.0028659445,0.00040750921,0.00057261495,0.002098108,0.001055775],"domain_scores_gemma":[0.9661392,0.02347966,0.001411744,0.0029500131,0.004779473,0.0012398736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074351644,0.0008490979,0.0006823891,0.0011908613,0.0022572812,0.0025310994,0.0027447897,0.0021966584,0.0018981654],"category_scores_gemma":[0.022410084,0.0005404786,0.0006430439,0.003573552,0.0016842666,0.0045600384,0.0017117955,0.0020918348,0.0002995598],"study_design_candidate":"case_report","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.002161758,0.003195368,0.12651984,0.0035995042,0.00057402777,0.018737,0.0145958625,0.39691642,0.058449857,0.07783538,0.061236523,0.23617849],"study_design_scores_gemma":[0.00041962072,0.0015449843,0.040089853,0.00035091868,0.00031388603,0.006169352,0.012743143,0.8151923,0.04426903,0.024325179,0.054369915,0.00021184377],"about_ca_topic_score_codex":0.025129365,"about_ca_topic_score_gemma":0.023888158,"teacher_disagreement_score":0.025129365,"about_ca_system_score_codex":0.0042712083,"about_ca_system_score_gemma":0.001945453,"threshold_uncertainty_score":0.049966216},"labels":[],"label_agreement":null},{"id":"W2613755106","doi":"10.1109/wcnc.2017.7925705","title":"Study of Mobility in Cache-Enabled Wireless Heterogeneous Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Cache; Wireless network; Handover; Mobility model; Heterogeneous network; Wireless; Randomness; Distributed computing; Telecommunications","score_opus":0.029671192417019078,"score_gpt":0.26289072612744574,"score_spread":0.23321953371042667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613755106","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.50292706,0.0058557102,0.48177713,0.0018935987,0.000186168,0.00011270838,0.00025021454,0.00024583438,0.0067515904],"genre_scores_gemma":[0.9904407,0.0016846708,0.0065305056,0.000058996226,0.00010167304,0.00005148737,0.000050640712,0.000020774505,0.0010606437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993407,0.0002982854,0.000027094864,0.00008788253,0.00013099315,0.00011497195],"domain_scores_gemma":[0.99575716,0.0031083252,0.00056743453,0.00016397353,0.00027946036,0.0001237199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138751,0.000692414,0.00084448105,0.001069542,0.0006463299,0.0009814374,0.0009384504,0.0010635311,0.00049499],"category_scores_gemma":[0.0060736,0.00039943805,0.0005297228,0.0012206546,0.0012055759,0.0015898689,0.0006898584,0.00078667165,0.000117408235],"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.000059833845,0.000044882596,0.004892839,0.00007687612,0.000099157725,0.0005860668,0.0001942655,0.9313463,0.0054952726,0.049207915,0.0005267023,0.00746994],"study_design_scores_gemma":[0.0000070792016,0.00003388334,0.0009882567,0.000010692283,0.000021403715,0.00011026586,0.0000468398,0.9883284,0.00033086684,0.009705174,0.00040551354,0.000011656746],"about_ca_topic_score_codex":0.003904243,"about_ca_topic_score_gemma":0.0018583304,"teacher_disagreement_score":0.003904243,"about_ca_system_score_codex":0.0013627035,"about_ca_system_score_gemma":0.00048087924,"threshold_uncertainty_score":0.009887099},"labels":[],"label_agreement":null},{"id":"W2614026118","doi":"10.1109/wcnc.2017.7925734","title":"Channel-Aware Device-to-Device Pairing for Collaborative Content Distribution","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Pairing; Latency (audio); Channel (broadcasting); Mobile device; Computer network; Distributed computing; User equipment; Algorithm; Operating system; Telecommunications","score_opus":0.10040562526331516,"score_gpt":0.29618527834055675,"score_spread":0.1957796530772416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614026118","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.04000972,0.00021343968,0.95465803,0.00014328911,0.000051390172,0.00012664443,0.00005021883,0.00031966256,0.0044276495],"genre_scores_gemma":[0.82486784,0.00019166314,0.17262965,0.000059423874,0.000029778214,0.00012868538,0.00007710001,0.00003987255,0.0019759422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987154,0.0005377688,0.000047590427,0.00019151143,0.00025846687,0.00024921575],"domain_scores_gemma":[0.9976876,0.0012659519,0.0002223887,0.00039521366,0.00022766356,0.00020124108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015348478,0.00064344733,0.0012169686,0.000683307,0.0011758897,0.0013428151,0.0012174787,0.0010682595,0.002719993],"category_scores_gemma":[0.0039778333,0.00040424732,0.00062171154,0.0013663338,0.0008594835,0.0021367276,0.0021178115,0.00081763975,0.0005360086],"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.00018690324,0.00018331197,0.0013464891,0.00011328722,0.000029442015,0.00021676173,0.00013257317,0.90452266,0.0055822795,0.03708094,0.0019401957,0.04866515],"study_design_scores_gemma":[0.000019751122,0.000065798406,0.00013758235,0.000005179227,0.000009668673,0.000110854045,0.000047960657,0.98833454,0.0018427231,0.008185778,0.001229367,0.000010822123],"about_ca_topic_score_codex":0.0014547498,"about_ca_topic_score_gemma":0.0018419324,"teacher_disagreement_score":0.002719993,"about_ca_system_score_codex":0.0011887227,"about_ca_system_score_gemma":0.0018176404,"threshold_uncertainty_score":0.009099305},"labels":[],"label_agreement":null},{"id":"W2615926310","doi":"10.1109/twc.2017.2703901","title":"Computation Offloading and Resource Allocation in Wireless Cellular Networks With Mobile Edge Computing","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":719,"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; National Natural Science Foundation of China","keywords":"Computer science; Computation offloading; Mobile edge computing; Resource allocation; Distributed computing; Optimization problem; Wireless network; Wireless; Cellular network; Enhanced Data Rates for GSM Evolution; Computation; Convex optimization; Edge computing; Computer network; Mathematical optimization; Server; Regular polygon; Algorithm; Telecommunications; Mathematics","score_opus":0.024500271187584355,"score_gpt":0.25586693897847257,"score_spread":0.23136666779088821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615926310","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.12175464,0.001754514,0.8661463,0.0006917605,0.00011475436,0.000095078845,0.00004891066,0.000286978,0.00910707],"genre_scores_gemma":[0.96313286,0.00044378632,0.034759924,0.0000791931,0.000038249367,0.000048971582,0.000023417699,0.000017582051,0.0014559085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995493,0.00017361983,0.0000141339615,0.00005692229,0.0000977548,0.00010824867],"domain_scores_gemma":[0.9996024,0.00022256002,0.00004023538,0.00004041887,0.000063261956,0.000031117743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040304713,0.0006573247,0.0007011099,0.00035024204,0.000760318,0.00092622294,0.0006987919,0.0006044754,0.0005953917],"category_scores_gemma":[0.0011386458,0.00021148493,0.00026442864,0.0010317281,0.00067378423,0.00064952025,0.00072286744,0.0005321735,0.00010667343],"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.00013247595,0.00007205409,0.0008600637,0.000060423572,0.00002405137,0.00023744574,0.000065441905,0.9180789,0.004250128,0.018083181,0.0018209408,0.05631487],"study_design_scores_gemma":[0.0000048228558,0.000012607397,0.000076043645,0.0000019543997,0.000004004821,0.000016629992,0.000014029362,0.99617296,0.00046809542,0.002907448,0.00031868528,0.000002804596],"about_ca_topic_score_codex":0.011510645,"about_ca_topic_score_gemma":0.012875069,"teacher_disagreement_score":0.011510645,"about_ca_system_score_codex":0.001172604,"about_ca_system_score_gemma":0.0010751617,"threshold_uncertainty_score":0.02288729},"labels":[],"label_agreement":null},{"id":"W2618018846","doi":"10.1155/2017/2573592","title":"An Association-Oriented Partitioning Approach for Streaming Graph Query","year":2017,"lang":"en","type":"article","venue":"Scientific Programming","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Science and Technology Planning Project of Guangdong Province","keywords":"Computer science; Graph partition; Partition (number theory); Theoretical computer science; Graph; Combinatorics; Mathematics","score_opus":0.024848551810258603,"score_gpt":0.27293582245431885,"score_spread":0.24808727064406025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618018846","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.034405466,0.0006812925,0.95620114,0.00028789009,0.00009207084,0.00029876165,0.0007714458,0.005147435,0.0021145567],"genre_scores_gemma":[0.25808188,0.000441612,0.732739,0.00018094826,0.00012201004,0.00023879112,0.004123681,0.00052990083,0.0035422936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998814,0.00018365636,0.000080006284,0.0003510243,0.00043478984,0.00013655603],"domain_scores_gemma":[0.9982021,0.0004108755,0.00014826375,0.0006060718,0.00046617186,0.00016649911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064522086,0.0011272626,0.0012402518,0.0020862066,0.0012513305,0.001358297,0.002114888,0.0008705396,0.0021032959],"category_scores_gemma":[0.002728755,0.0004688266,0.0009610627,0.0037176602,0.0005575561,0.0031955754,0.0016399941,0.0010021133,0.0010708321],"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.0007437025,0.0006506214,0.0046232804,0.00044435903,0.00017330267,0.00046877612,0.0008529793,0.17515436,0.06290522,0.02578159,0.03584888,0.6923529],"study_design_scores_gemma":[0.000058668564,0.00013160543,0.0010197213,0.000009640647,0.000043337277,0.00040755875,0.0002953792,0.96314824,0.009892568,0.016538646,0.008423744,0.00003088701],"about_ca_topic_score_codex":0.010136582,"about_ca_topic_score_gemma":0.01461547,"teacher_disagreement_score":0.010136582,"about_ca_system_score_codex":0.00095170835,"about_ca_system_score_gemma":0.0016465756,"threshold_uncertainty_score":0.020155132},"labels":[],"label_agreement":null},{"id":"W2625108112","doi":"10.1109/tsc.2017.2712773","title":"A Framework of Hypergraph-Based Data Placement Among Geo-Distributed Datacenters","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"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":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hypergraph; Distributed computing; Replica; Partition (number theory); Set (abstract data type); Distributed database; Hash function; TRACE (psycholinguistics); Data mining; Big data; Scheme (mathematics)","score_opus":0.039873908681168996,"score_gpt":0.28376516151394676,"score_spread":0.24389125283277777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625108112","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.0040124734,0.0002670217,0.99362457,0.00022645031,0.000031694482,0.00008225386,0.00008714449,0.00038426387,0.0012839922],"genre_scores_gemma":[0.24725124,0.0011389933,0.7459095,0.00016484331,0.00013528691,0.00031705154,0.0005054606,0.00022895288,0.0043486585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982589,0.00066211796,0.00006856909,0.00047370075,0.00036270174,0.00017405042],"domain_scores_gemma":[0.99870527,0.00036631868,0.0001507518,0.00028087513,0.00026791578,0.00022891042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016637151,0.001149641,0.0014202158,0.0020982507,0.0017573445,0.002821935,0.003764952,0.0015323368,0.0027083857],"category_scores_gemma":[0.002906532,0.0009154432,0.0012569022,0.00461499,0.0016958322,0.0041862256,0.003287736,0.0014198965,0.0006918441],"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.0000874906,0.00010413226,0.0008061838,0.00017697082,0.00007979363,0.00023579856,0.0003380293,0.8082791,0.0035394097,0.12547368,0.0046761823,0.05620331],"study_design_scores_gemma":[0.000020033442,0.000049429662,0.00017919326,0.000017492686,0.000025810166,0.00007734006,0.00011233623,0.95516914,0.00084349373,0.037436977,0.006043608,0.00002510802],"about_ca_topic_score_codex":0.0137729235,"about_ca_topic_score_gemma":0.0141865695,"teacher_disagreement_score":0.0137729235,"about_ca_system_score_codex":0.0030555516,"about_ca_system_score_gemma":0.0033917702,"threshold_uncertainty_score":0.027385533},"labels":[],"label_agreement":null},{"id":"W2625290469","doi":"10.29173/cais315","title":"Modelling Website Visitation and Resource Usage Characteristics by IP Address Data","year":2013,"lang":"fr","type":"article","venue":"Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Zipf's law; Resource (disambiguation); Computer science; Humanities; Geography; Mathematics; Statistics; Art; Computer network","score_opus":0.050814145178743025,"score_gpt":0.24635943901183452,"score_spread":0.1955452938330915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625290469","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.9718051,0.00012569783,0.022861138,0.00021645789,0.0000091424145,0.00008209604,0.003476326,0.0002941728,0.0011298206],"genre_scores_gemma":[0.9768374,0.00014501711,0.014258943,0.000043212993,0.000013146568,0.00018983585,0.0065072724,0.000109095934,0.0018960608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981558,0.0008538398,0.00014304083,0.00036337762,0.00028529385,0.00019868326],"domain_scores_gemma":[0.98018897,0.015834328,0.0011810582,0.0015611706,0.0009641795,0.00027025913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040560463,0.00076459616,0.00079432153,0.002813849,0.000319704,0.0016889193,0.0015743282,0.0017168287,0.0025451898],"category_scores_gemma":[0.023519143,0.0006575934,0.0018008805,0.005255931,0.00064438785,0.0022286717,0.00069926586,0.0014318547,0.0011091327],"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.0006679809,0.0005923722,0.32841718,0.00025289663,0.0004147732,0.0004519528,0.0009082421,0.63091964,0.0032438864,0.004323161,0.0020264664,0.027781429],"study_design_scores_gemma":[0.000020254545,0.00009288613,0.08643891,0.000017511924,0.000045890407,0.00015669117,0.00023583179,0.9091035,0.0009958752,0.001980916,0.00086317013,0.000048501508],"about_ca_topic_score_codex":0.03551207,"about_ca_topic_score_gemma":0.022873092,"teacher_disagreement_score":0.03551207,"about_ca_system_score_codex":0.001688388,"about_ca_system_score_gemma":0.00081504014,"threshold_uncertainty_score":0.0706107},"labels":[],"label_agreement":null},{"id":"W2625598272","doi":"10.1109/fmec.2017.7946402","title":"Decentralized data offloading for mobile cloud computing based on game theory","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Game theory; Nash equilibrium; Cloud computing; Potential game; Mobile device; Computation offloading; Server; Mobile computing; Computer network; Mobile cloud computing; Distributed computing; Edge computing; Mathematical optimization; Operating system","score_opus":0.08317679796540489,"score_gpt":0.33104397684990394,"score_spread":0.24786717888449905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625598272","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.021514965,0.00022438925,0.96956974,0.00043580894,0.000061803694,0.00019029688,0.000039219827,0.00008325698,0.0078805],"genre_scores_gemma":[0.8912307,0.00042013344,0.10448318,0.00017463781,0.00008057596,0.00031385495,0.0000543074,0.000037956233,0.0032046686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985934,0.00057202013,0.000049726295,0.00019973282,0.00033950398,0.0002456067],"domain_scores_gemma":[0.9991823,0.00046262622,0.00007452916,0.00007355852,0.00012646611,0.00008048678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010101267,0.0007414176,0.0011461038,0.0004307365,0.0010424714,0.0016622555,0.0012374287,0.00086482166,0.002021049],"category_scores_gemma":[0.0017736929,0.0003790498,0.0009771255,0.000674153,0.001240777,0.0018723934,0.001319181,0.0014597046,0.00017414968],"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.000097001546,0.0001424622,0.00064131385,0.0001541242,0.00007279353,0.0002649553,0.00017986426,0.6014825,0.00610556,0.36259732,0.002518224,0.025743837],"study_design_scores_gemma":[0.000020934773,0.000021196984,0.00011857551,0.0000072610683,0.000008785659,0.000032238484,0.000035144745,0.95176595,0.00036526407,0.046592504,0.0010219124,0.000010235695],"about_ca_topic_score_codex":0.0059054224,"about_ca_topic_score_gemma":0.0056287465,"teacher_disagreement_score":0.0059054224,"about_ca_system_score_codex":0.0019167837,"about_ca_system_score_gemma":0.0023830067,"threshold_uncertainty_score":0.013907313},"labels":[],"label_agreement":null},{"id":"W2727608015","doi":"10.1109/tvt.2017.2720481","title":"Cross-Layer Optimization of Fast Video Delivery in Cache- and Buffer-Enabled Relaying Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":50,"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 British Columbia; Huawei Technologies (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Alexander von Humboldt-Stiftung","keywords":"Computer science; Cache; Computer network; Online algorithm; Video quality; Optimization problem; Wireless network; Channel (broadcasting); Real-time computing; Wireless; Algorithm","score_opus":0.013847047946951489,"score_gpt":0.24037351251811165,"score_spread":0.22652646457116016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727608015","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.0952563,0.0014942463,0.89884746,0.00038187733,0.00006886701,0.000055184264,0.00009795419,0.00016442705,0.0036336512],"genre_scores_gemma":[0.959691,0.00080410345,0.035900548,0.00008995931,0.000039118877,0.00008556498,0.00007522104,0.00006739208,0.0032471495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993368,0.00023457651,0.00002286055,0.00013753923,0.00011915136,0.00014908999],"domain_scores_gemma":[0.9982437,0.0012097814,0.00021173322,0.000059453017,0.00019521709,0.00008019398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014711707,0.0016904322,0.0013987323,0.00047469474,0.0003678551,0.0014070964,0.0012777536,0.0014861143,0.0012208109],"category_scores_gemma":[0.0035282415,0.00066015613,0.0005668147,0.0006812636,0.0009374392,0.0014941407,0.001152285,0.0009406763,0.00019812978],"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.0000521063,0.000025667376,0.0002090154,0.000052772477,0.000024221838,0.00010447645,0.000030379135,0.98542446,0.0024236166,0.007107577,0.000274044,0.0042717163],"study_design_scores_gemma":[0.0000039259658,0.000025949706,0.000039451428,0.0000021077524,0.000005369814,0.000010771123,0.000006332693,0.9984989,0.00029472797,0.0010406919,0.00006857642,0.0000030979384],"about_ca_topic_score_codex":0.005224833,"about_ca_topic_score_gemma":0.0024853188,"teacher_disagreement_score":0.005224833,"about_ca_system_score_codex":0.0019245498,"about_ca_system_score_gemma":0.0011287889,"threshold_uncertainty_score":0.01396364},"labels":[],"label_agreement":null},{"id":"W2735632342","doi":"10.11575/prism/31131","title":"Exploiting Non-Uniformities in Redundant Traffic Elimination","year":2010,"lang":"en","type":"article","venue":"Open MIND","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Redundancy (engineering); Network packet; Packet processing; Data redundancy; Cache; Real-time computing; Payload (computing); Computer network; Pipeline (software); Database","score_opus":0.030632938352744447,"score_gpt":0.27523132988286503,"score_spread":0.24459839153012058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735632342","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.4574052,0.0005516256,0.5387384,0.0001561209,0.00002688742,0.000068675145,0.000036971298,0.0010598284,0.0019562116],"genre_scores_gemma":[0.896124,0.00019923056,0.10243566,0.000056375862,0.000025511361,0.00004490657,0.000067843255,0.000059794253,0.0009866355],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992029,0.00018117465,0.0000564366,0.00011846378,0.00029269277,0.00014830954],"domain_scores_gemma":[0.99580586,0.0015641246,0.0005706677,0.0014211703,0.00056595117,0.000072141185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012081307,0.0004906282,0.00054559397,0.0008633235,0.000536743,0.0006914512,0.00094255,0.00036778447,0.00047698646],"category_scores_gemma":[0.0054032984,0.00038779984,0.00030356698,0.0008703604,0.0008136259,0.0018650282,0.0010198292,0.0004438002,0.00017697584],"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.0011009494,0.00035003904,0.021941599,0.00025867848,0.00013656414,0.000728793,0.0008827117,0.15826881,0.40658855,0.022740208,0.0014243337,0.38557887],"study_design_scores_gemma":[0.000079586775,0.0006867889,0.00973226,0.000034532022,0.00015468948,0.001125106,0.000277707,0.68127966,0.29350302,0.007490749,0.005552819,0.000083042156],"about_ca_topic_score_codex":0.0015442822,"about_ca_topic_score_gemma":0.0028648353,"teacher_disagreement_score":0.0015442822,"about_ca_system_score_codex":0.0004822998,"about_ca_system_score_gemma":0.00089678075,"threshold_uncertainty_score":0.0063892603},"labels":[],"label_agreement":null},{"id":"W2735804801","doi":"10.1109/icnidc.2016.7974617","title":"Content caching scheme for D2D communication underlaying cellular networks with capacoty restriction","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Cache; Cellular network; Computer network; Scheme (mathematics); The Internet; Optimization problem; Content delivery; Popularity; Mobile device; Distributed computing; Mobile telephony; Multimedia; Mobile radio; World Wide Web; Algorithm","score_opus":0.04741219672175836,"score_gpt":0.21538211846345787,"score_spread":0.1679699217416995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735804801","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.30165908,0.0017309289,0.68710417,0.0005633734,0.000109612156,0.00015410836,0.00023300471,0.00053823384,0.00790743],"genre_scores_gemma":[0.9809894,0.00023200414,0.0174679,0.000049508868,0.00001731623,0.00004206767,0.00006236046,0.0000134293205,0.001126091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995504,0.00012455415,0.000023775521,0.000076978344,0.00008959414,0.00013456],"domain_scores_gemma":[0.9990281,0.00045414665,0.0000896744,0.00010077356,0.00025832202,0.00006903644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003847389,0.0005556552,0.00088964077,0.0005309909,0.0009413851,0.0009991123,0.0014912284,0.0008258208,0.0013880526],"category_scores_gemma":[0.0017777467,0.00022793484,0.00036355804,0.0012005148,0.0004932661,0.0010019381,0.0007142516,0.0004247591,0.00017813894],"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.00061882637,0.0001265246,0.0028907945,0.00023989091,0.000091405374,0.0006602133,0.0002007233,0.8798691,0.015345839,0.024864543,0.005070808,0.07002143],"study_design_scores_gemma":[0.000017801565,0.00004861183,0.0001802872,0.000005033186,0.000017279393,0.000084059575,0.000027698288,0.9964737,0.00088077766,0.0018531799,0.00040243572,0.0000091151305],"about_ca_topic_score_codex":0.013289367,"about_ca_topic_score_gemma":0.014197638,"teacher_disagreement_score":0.013289367,"about_ca_system_score_codex":0.0019450169,"about_ca_system_score_gemma":0.001338198,"threshold_uncertainty_score":0.02642399},"labels":[],"label_agreement":null},{"id":"W2739051440","doi":"10.1109/iwcmc.2017.7986281","title":"Proactive caching for Producer mobility management in Named Data Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Retransmission; Computer science; Handover; Computer network; Mobility management; Cache; Network packet; Exploit; Scheme (mathematics); The Internet; Computer security; World Wide Web","score_opus":0.09349128527150947,"score_gpt":0.32658002374250444,"score_spread":0.23308873847099498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739051440","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.49623457,0.0034153478,0.48939463,0.0009280399,0.00019216012,0.00019563227,0.00020660253,0.0029490164,0.0064841276],"genre_scores_gemma":[0.97823447,0.00029283747,0.020539274,0.00005398604,0.000015478385,0.0000288691,0.00008707228,0.000035679535,0.0007122706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999318,0.000270545,0.000045252033,0.000101599995,0.00015500336,0.000109629415],"domain_scores_gemma":[0.9984781,0.00055632787,0.0001623711,0.0003666846,0.00034154506,0.000095029325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014461571,0.00044135892,0.0006551904,0.00046456323,0.0010965368,0.0014870223,0.0018027999,0.00092734484,0.0004929876],"category_scores_gemma":[0.0027798251,0.0003244464,0.0002972086,0.0006122858,0.00051992695,0.0021989704,0.001136811,0.00053990015,0.0001184762],"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.0019064468,0.0004349055,0.021074366,0.0005492863,0.00030430968,0.0016847614,0.0013351489,0.60247505,0.11157779,0.053228907,0.01202803,0.19340104],"study_design_scores_gemma":[0.000037051075,0.000114182505,0.0011369408,0.000013695793,0.00006188294,0.00018518385,0.00012354966,0.97838426,0.011615203,0.0036108412,0.0046857325,0.0000314482],"about_ca_topic_score_codex":0.0068054944,"about_ca_topic_score_gemma":0.0069893147,"teacher_disagreement_score":0.0068054944,"about_ca_system_score_codex":0.001426146,"about_ca_system_score_gemma":0.0012043455,"threshold_uncertainty_score":0.0135317445},"labels":[],"label_agreement":null},{"id":"W2739683363","doi":"10.1109/icc.2017.7997019","title":"An analysis of caching in information-centric vehicular networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"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 Ottawa","funders":"","keywords":"Computer science; Information-centric networking; Vehicular ad hoc network; Computer network; Wireless ad hoc network; Crowdsensing; Distributed computing; Work (physics); State (computer science); Computer security; Telecommunications; Cache; Wireless","score_opus":0.009683942042521225,"score_gpt":0.2377351042273191,"score_spread":0.22805116218479787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739683363","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.45281363,0.015504713,0.47360852,0.002638742,0.00028385816,0.00029977082,0.0007644338,0.00036390146,0.05372244],"genre_scores_gemma":[0.986873,0.0023039076,0.006760927,0.00012430374,0.00006347652,0.00004511262,0.00015674699,0.00005389227,0.003618501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992065,0.0002530509,0.000033113065,0.00008719173,0.00018117306,0.0002390634],"domain_scores_gemma":[0.9953454,0.0030031668,0.00039081476,0.00021840107,0.0009069495,0.00013513952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102568,0.00073093857,0.0010441437,0.0015459749,0.0010797683,0.0016833,0.001572799,0.0011827196,0.0021084975],"category_scores_gemma":[0.007979603,0.00038866716,0.0007596658,0.0017938005,0.0011444144,0.0027691333,0.0008291332,0.00064679945,0.00026704275],"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.000052709973,0.000030543393,0.002096149,0.00010189942,0.000042018724,0.0001668428,0.00011257734,0.9099646,0.0012510192,0.07853063,0.0015126244,0.0061382637],"study_design_scores_gemma":[0.000002798009,0.0000276736,0.00065693876,0.000022103795,0.000019948158,0.00007424713,0.000052866308,0.98842573,0.00026548203,0.009468605,0.00097407587,0.000009635689],"about_ca_topic_score_codex":0.026020395,"about_ca_topic_score_gemma":0.016228864,"teacher_disagreement_score":0.026020395,"about_ca_system_score_codex":0.0043678386,"about_ca_system_score_gemma":0.0014462213,"threshold_uncertainty_score":0.051737905},"labels":[],"label_agreement":null},{"id":"W2739728039","doi":"10.1109/icc.2017.7996760","title":"On the performance of adaptive video caching over information-centric networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Information-centric networking; Bandwidth (computing); Computer network; The Internet; Throughput; Video streaming; Multimedia; Cache; World Wide Web; Telecommunications; Wireless","score_opus":0.01458604740726101,"score_gpt":0.20847786630151807,"score_spread":0.19389181889425705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739728039","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.9245347,0.0037046634,0.05881887,0.0010460779,0.00012277058,0.00011115637,0.00031439177,0.00054536277,0.010802035],"genre_scores_gemma":[0.99566406,0.00036808397,0.0035620255,0.000037973834,0.00001649224,0.00001398879,0.00006114635,0.000022832992,0.00025342667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983779,0.00067358854,0.000084348256,0.0001808946,0.00047792008,0.00020528681],"domain_scores_gemma":[0.97536886,0.019571366,0.0011021098,0.0012403828,0.0023508144,0.00036643344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038810147,0.0008362361,0.00079269015,0.0011706065,0.0007634399,0.001173299,0.0012223683,0.0009049912,0.0007754464],"category_scores_gemma":[0.028114317,0.00026372718,0.0002155109,0.0015497265,0.0010446958,0.0022888605,0.00071834563,0.000585242,0.00011298501],"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.0006795119,0.0001427341,0.006920761,0.00009745984,0.000057550344,0.00010017757,0.00010740127,0.9579162,0.0064386744,0.006711124,0.0009024644,0.019925967],"study_design_scores_gemma":[0.000016996426,0.00011976745,0.001459092,0.000011534957,0.000021692847,0.000035266952,0.000033831457,0.9947574,0.0019815133,0.0014277226,0.00012488704,0.000010314606],"about_ca_topic_score_codex":0.01545636,"about_ca_topic_score_gemma":0.010525863,"teacher_disagreement_score":0.01545636,"about_ca_system_score_codex":0.0028906502,"about_ca_system_score_gemma":0.0013785306,"threshold_uncertainty_score":0.03073275},"labels":[],"label_agreement":null},{"id":"W2739925824","doi":"10.1109/icufn.2017.7993886","title":"A cache-node selection mechanism for data replication and service composition within cloud-based systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Cache; Computer network; Cloud computing; Access time; Replica; Distributed computing; Replication (statistics); Node (physics); Operating system","score_opus":0.07540324415688769,"score_gpt":0.2916476740857581,"score_spread":0.21624442992887039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739925824","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.1314991,0.0005021065,0.86406016,0.00015715463,0.00006327117,0.00020455547,0.0000661663,0.0010171133,0.002430367],"genre_scores_gemma":[0.8748855,0.0001497187,0.123497844,0.000026607457,0.000031136267,0.00007665049,0.00006630081,0.00002442087,0.0012417806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937433,0.0001526074,0.00005577898,0.00011022867,0.00022908015,0.00007805894],"domain_scores_gemma":[0.99910295,0.0001880334,0.00010711869,0.00020520424,0.00029558173,0.000101155296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008460287,0.0003591428,0.0005737531,0.00086220517,0.0015962655,0.00075957103,0.00125419,0.0005749903,0.00078359817],"category_scores_gemma":[0.0018887997,0.00022429957,0.0004257216,0.00083079044,0.0005476121,0.0011841812,0.00083268306,0.0004894954,0.00025314165],"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.0013008646,0.0003982508,0.005625003,0.0004441851,0.00022214011,0.001464934,0.0014883667,0.19632253,0.2653805,0.09178834,0.0050944244,0.4304704],"study_design_scores_gemma":[0.000041298837,0.00026608,0.001021661,0.00002077448,0.0000909952,0.00072610995,0.00018009316,0.9467782,0.03554795,0.008314997,0.006947291,0.00006453806],"about_ca_topic_score_codex":0.004101602,"about_ca_topic_score_gemma":0.0047894362,"teacher_disagreement_score":0.004101602,"about_ca_system_score_codex":0.0009767807,"about_ca_system_score_gemma":0.0010027556,"threshold_uncertainty_score":0.008155465},"labels":[],"label_agreement":null},{"id":"W2740024945","doi":"10.1109/icc.2017.7997078","title":"Towards efficient data access in mobile cloud computing using pre-fetching and caching","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cloudlet; Computer science; Cloud computing; Latency (audio); Computer network; Mobile device; Data access; Mobile cloud computing; Mobile computing; Context (archaeology); Architecture; Distributed computing; Database; Operating system; Telecommunications","score_opus":0.08858078102508149,"score_gpt":0.35907213067472643,"score_spread":0.27049134964964494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740024945","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.2105835,0.003338034,0.777025,0.0008360802,0.00016639534,0.00036994027,0.00013469273,0.0035101734,0.0040361467],"genre_scores_gemma":[0.83202714,0.000888604,0.16430677,0.00018153583,0.000060604085,0.00008360341,0.00016757695,0.00010859909,0.0021756603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.000105748324,0.00005065573,0.00012318345,0.00021832612,0.00023134329],"domain_scores_gemma":[0.9986853,0.00021156,0.0000902872,0.00046470683,0.0004122691,0.00013585121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000725688,0.0006912845,0.0009908326,0.0007172009,0.0013625687,0.0018989841,0.0022754972,0.0008653661,0.00088990445],"category_scores_gemma":[0.001504306,0.0003716982,0.0005391345,0.0016608253,0.0005992382,0.0027230436,0.0010522322,0.0010783693,0.0004625908],"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.0028855058,0.0012260897,0.017358001,0.0005865414,0.00032189512,0.0013343582,0.0007216083,0.15986799,0.24707718,0.06296171,0.018473819,0.48718536],"study_design_scores_gemma":[0.000070153896,0.00022413414,0.0015304385,0.000025841004,0.00008451956,0.00031598908,0.00014285267,0.9411906,0.04331346,0.007325114,0.0057281237,0.00004879689],"about_ca_topic_score_codex":0.011588942,"about_ca_topic_score_gemma":0.012154434,"teacher_disagreement_score":0.011588942,"about_ca_system_score_codex":0.0013871798,"about_ca_system_score_gemma":0.0019341387,"threshold_uncertainty_score":0.023042977},"labels":[],"label_agreement":null},{"id":"W2740877105","doi":"10.1109/icc.2017.7996705","title":"Collaborative hierarchical caching for traffic offloading in heterogeneous networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Heterogeneous network; Computer network; Cache; Network topology; Distributed computing; TRACE (psycholinguistics); Cellular network; Wireless network; Wireless","score_opus":0.016995105147306157,"score_gpt":0.26675232587048026,"score_spread":0.2497572207231741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740877105","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.05952516,0.00030248112,0.93706,0.00011420848,0.000024764531,0.00005288983,0.00004002425,0.00025577474,0.0026247918],"genre_scores_gemma":[0.95585203,0.00014291458,0.04295992,0.000041470663,0.000019093604,0.000054573644,0.00004522524,0.0000240634,0.00086076563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954826,0.00014399395,0.000016245996,0.00008024244,0.00010127608,0.00010998091],"domain_scores_gemma":[0.99937266,0.00034908266,0.00006464493,0.00009550886,0.00007523858,0.000042815143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067186664,0.0005910536,0.00091306167,0.00041185043,0.000681549,0.000741123,0.0010068335,0.00073608296,0.0007954464],"category_scores_gemma":[0.0014669088,0.00028292122,0.00053124275,0.00066001515,0.0006366222,0.0010779297,0.00079315447,0.00053082086,0.00012497709],"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.000048970083,0.000045725305,0.00047367907,0.00003944723,0.000023864155,0.000115230214,0.000045526147,0.95992786,0.006276967,0.015124265,0.00058662693,0.017291863],"study_design_scores_gemma":[0.000003162574,0.00000739871,0.000059876566,9.1317486e-7,0.000003994789,0.000008984358,0.000006763478,0.99697316,0.00036766552,0.0024516576,0.000114004026,0.0000023881855],"about_ca_topic_score_codex":0.008001015,"about_ca_topic_score_gemma":0.011757176,"teacher_disagreement_score":0.008001015,"about_ca_system_score_codex":0.0013181462,"about_ca_system_score_gemma":0.0010037869,"threshold_uncertainty_score":0.015908897},"labels":[],"label_agreement":null},{"id":"W2741179406","doi":"10.1109/icc.2017.7996355","title":"Enhancing mobile edge caching with bandwidth provisioning in software-defined mobile networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"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","keywords":"Computer science; Provisioning; Computer network; Backhaul (telecommunications); Distributed computing; Bandwidth (computing); Cache; Cellular network; Mobile edge computing; Server; Base station","score_opus":0.008814272683095302,"score_gpt":0.22956606582639116,"score_spread":0.22075179314329585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741179406","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.18341787,0.0022167524,0.80945444,0.00033709704,0.000048127735,0.00004147351,0.000028801544,0.0002539272,0.004201553],"genre_scores_gemma":[0.9565538,0.00051525363,0.04224685,0.000045300367,0.00001855234,0.000020235057,0.00001881835,0.000016008207,0.00056498405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999564,0.00017274801,0.000015174687,0.000047262813,0.000106316285,0.000094603856],"domain_scores_gemma":[0.9994624,0.00026036438,0.00007342949,0.00005198505,0.000118936885,0.000032978856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054531766,0.000564122,0.00063376356,0.0003445029,0.00042428356,0.00076930906,0.0007698969,0.0006003478,0.0002788797],"category_scores_gemma":[0.0015964746,0.00020426117,0.00024191246,0.0007819932,0.000354837,0.0012539302,0.000625872,0.00045811568,0.000058318397],"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.00017246239,0.00014284877,0.0016543927,0.00012712894,0.0000622862,0.00019574146,0.00009691892,0.84012526,0.027959714,0.032552205,0.0010524915,0.09585856],"study_design_scores_gemma":[0.0000049273553,0.00003198307,0.00012039163,0.0000046554464,0.000013535034,0.00004076167,0.000019060353,0.9939557,0.0027716774,0.0025669176,0.00046473867,0.000005638519],"about_ca_topic_score_codex":0.0037255012,"about_ca_topic_score_gemma":0.0051684002,"teacher_disagreement_score":0.0037255012,"about_ca_system_score_codex":0.00090537407,"about_ca_system_score_gemma":0.0010287326,"threshold_uncertainty_score":0.0074076056},"labels":[],"label_agreement":null},{"id":"W2742288482","doi":"10.1109/twc.2017.2734081","title":"Enhancing QoE-Aware Wireless Edge Caching With Software-Defined Wireless Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":76,"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; Huawei Technologies; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Provisioning; Wireless; Wireless network; Bandwidth (computing); Software-defined networking; Distributed computing; Telecommunications","score_opus":0.02727975285036844,"score_gpt":0.25670874245854547,"score_spread":0.22942898960817704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742288482","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.10470815,0.0008855075,0.8910916,0.00023795114,0.00006309403,0.000061071405,0.000036743644,0.00026837358,0.0026475338],"genre_scores_gemma":[0.9466711,0.00040972288,0.052015055,0.00008602218,0.00003406069,0.000033484404,0.000037926486,0.00001943876,0.00069316785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994485,0.00017433296,0.000032267435,0.00008143571,0.0001445478,0.0001189646],"domain_scores_gemma":[0.99871135,0.0005098192,0.00016513266,0.00014534793,0.00039143357,0.000076958335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006629687,0.0007341998,0.0008972252,0.0003700146,0.00041048546,0.00086860603,0.0010979892,0.00049742585,0.00036286013],"category_scores_gemma":[0.0023309295,0.00021478634,0.00032859837,0.00073870795,0.0003787186,0.001620461,0.00096333574,0.0005712724,0.000076962264],"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.00038756893,0.0005300186,0.006132378,0.00037269812,0.00017969892,0.00055650325,0.00028516448,0.69895977,0.07921671,0.03239417,0.002772617,0.17821275],"study_design_scores_gemma":[0.000009880246,0.000058171303,0.00025354905,0.0000067647575,0.000024151459,0.000075794174,0.000034911223,0.9926474,0.0034706832,0.002694019,0.00071531354,0.000009347241],"about_ca_topic_score_codex":0.003395447,"about_ca_topic_score_gemma":0.0058912393,"teacher_disagreement_score":0.003395447,"about_ca_system_score_codex":0.0007347003,"about_ca_system_score_gemma":0.0010786076,"threshold_uncertainty_score":0.0067513585},"labels":[],"label_agreement":null},{"id":"W2744024646","doi":"10.5555/3107979.3107981","title":"DEVS-based modeling of cached and segmented video download algorithms in LTE-A cellular networks","year":2017,"lang":"en","type":"article","venue":"Communications and Networking Symposium","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"DEVS; Computer science; Cellular network; LTE Advanced; Cache; Computer network; Formalism (music); Cellular traffic; User equipment; Algorithm; Distributed computing; Telecommunications link; Real-time computing; Modeling and simulation; Base station; Simulation","score_opus":0.03477616311115949,"score_gpt":0.25850462905643484,"score_spread":0.22372846594527535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744024646","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.16863564,0.0005882629,0.8128337,0.00040315674,0.00008442336,0.00011621094,0.00046487123,0.00038448744,0.016489225],"genre_scores_gemma":[0.96780974,0.00034226562,0.027876053,0.00005918183,0.000022698021,0.00013008615,0.00022784481,0.000046293368,0.0034858328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.00013139467,0.000025006422,0.000043365493,0.00010016611,0.00007510556],"domain_scores_gemma":[0.99904794,0.00054042944,0.00009182836,0.000049508875,0.00023553974,0.00003470489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077212346,0.0004392867,0.0006006529,0.00040394318,0.00044570846,0.0008873647,0.0010969626,0.00071627914,0.0012772767],"category_scores_gemma":[0.0019247431,0.0002634103,0.00071747263,0.0004264257,0.0006063548,0.0006591895,0.0005012445,0.0006000975,0.00018076316],"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.0000114001405,0.000008821688,0.0002966571,0.000009236588,0.0000043511054,0.00003146539,0.000019965288,0.98833907,0.00047684932,0.009634027,0.00009900728,0.0010690686],"study_design_scores_gemma":[0.0000012980107,0.000002391477,0.000019304747,6.334439e-7,8.952009e-7,0.0000025943868,0.0000022856857,0.999476,0.000060272738,0.00037692726,0.00005672239,7.1813923e-7],"about_ca_topic_score_codex":0.023081237,"about_ca_topic_score_gemma":0.00819781,"teacher_disagreement_score":0.023081237,"about_ca_system_score_codex":0.0016402933,"about_ca_system_score_gemma":0.0010524106,"threshold_uncertainty_score":0.04589379},"labels":[],"label_agreement":null},{"id":"W2746321412","doi":"10.1145/3123878.3131972","title":"Cooperative Active Distribution of Videos in Telco-CDNs","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network","score_opus":0.020861641990288164,"score_gpt":0.264270274318163,"score_spread":0.24340863232787485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746321412","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.53473765,0.00043198423,0.4556179,0.00016296454,0.00003601972,0.00016128851,0.00016472269,0.0011494831,0.0075380066],"genre_scores_gemma":[0.9616206,0.000059539147,0.036685556,0.00002817824,0.000007571308,0.000028927514,0.00008887862,0.000015692274,0.0014651275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962604,0.00008132328,0.000019547539,0.00010670126,0.00009183743,0.00007455054],"domain_scores_gemma":[0.99878734,0.00041058473,0.0001428127,0.00022896068,0.00027182334,0.00015856406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052223704,0.00032776268,0.00040129622,0.00070759107,0.00057176483,0.00096193113,0.0011069825,0.00043619573,0.001070722],"category_scores_gemma":[0.0017823677,0.0001923221,0.00014108555,0.0008826357,0.0005201691,0.0013872372,0.0010722071,0.00032730054,0.00018279452],"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.0016595175,0.00042864608,0.014319528,0.0001770709,0.00008819848,0.0010040421,0.0007549008,0.5509592,0.06988173,0.037710276,0.004518774,0.3184981],"study_design_scores_gemma":[0.000036171885,0.00008450501,0.0009741567,0.00000607498,0.000013805475,0.00011613148,0.00012821332,0.98064303,0.01156076,0.0040752864,0.0023520628,0.000009775236],"about_ca_topic_score_codex":0.0066754543,"about_ca_topic_score_gemma":0.009326326,"teacher_disagreement_score":0.0066754543,"about_ca_system_score_codex":0.0014549341,"about_ca_system_score_gemma":0.00071371236,"threshold_uncertainty_score":0.0132731795},"labels":[],"label_agreement":null},{"id":"W2747746134","doi":"10.1109/tmc.2017.2741481","title":"An Incentive Mechanism Integrating Joint Power, Channel and Link Management for Social-Aware D2D Content Sharing and Proactive Caching","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":99,"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 Manitoba","funders":"","keywords":"Computer science; Computer network; Base station; Cache; Telecommunications link; Power control; Wireless; Scheduling (production processes); Distributed computing; Power (physics); Telecommunications; Mathematical optimization","score_opus":0.052788461821680135,"score_gpt":0.2837829283760228,"score_spread":0.2309944665543427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747746134","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.01721819,0.000101577134,0.97946435,0.0002605682,0.00005408764,0.00011611807,0.000023054845,0.00014528567,0.0026168185],"genre_scores_gemma":[0.8562742,0.00015386805,0.14078124,0.00011205728,0.000086503336,0.00020099204,0.000027619797,0.000034390836,0.0023292918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.00059433555,0.000056196255,0.00015365187,0.0003225543,0.00016955241],"domain_scores_gemma":[0.9983222,0.0008411008,0.00018645561,0.00022794725,0.0002452842,0.00017701341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979455,0.00065685844,0.0009321571,0.0006920251,0.00072467036,0.0011744037,0.002322967,0.0014729517,0.0015761092],"category_scores_gemma":[0.0033228006,0.00028221027,0.00059522974,0.0008372044,0.0009830545,0.002079,0.0016572713,0.001037899,0.00022862328],"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.0003290445,0.0008341023,0.0015589071,0.00024824523,0.00012468491,0.00055230013,0.00028803034,0.40868485,0.025603455,0.40442285,0.0040597003,0.1532939],"study_design_scores_gemma":[0.00004253849,0.0001187036,0.00015829282,0.000008333847,0.000021630132,0.0001553818,0.000029325916,0.96982455,0.0017407994,0.02570309,0.0021721004,0.000025240217],"about_ca_topic_score_codex":0.00084419665,"about_ca_topic_score_gemma":0.0009808677,"teacher_disagreement_score":0.002322967,"about_ca_system_score_codex":0.0011860525,"about_ca_system_score_gemma":0.0016598168,"threshold_uncertainty_score":0.010468483},"labels":[],"label_agreement":null},{"id":"W2748496872","doi":"10.1109/twc.2019.2891618","title":"Decentralized Coded Caching Without File Splitting","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; False sharing; Scheme (mathematics); Wireless network; Wireless; Process (computing); Computer network; Algorithm; Distributed computing; Cache; CPU cache; Operating system; Cache algorithms","score_opus":0.025721066482723598,"score_gpt":0.26307067341090606,"score_spread":0.23734960692818247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748496872","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.124420375,0.00025395944,0.8662889,0.00027275045,0.000072991475,0.00017518616,0.00022543225,0.00086505164,0.007425355],"genre_scores_gemma":[0.9255681,0.00010614037,0.07128609,0.00007156703,0.000029490111,0.00009184667,0.000120704375,0.00002802036,0.0026981018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994167,0.00013890048,0.000021563208,0.00012007325,0.00018723661,0.00011552553],"domain_scores_gemma":[0.9981756,0.0006292265,0.00019414221,0.0005391345,0.00037021606,0.00009167086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396741,0.00036119713,0.00070086407,0.00051337434,0.00060645596,0.0006992942,0.0014428598,0.0008095538,0.001773882],"category_scores_gemma":[0.0029009006,0.00019715852,0.00035068893,0.0011094153,0.0007543449,0.0016657589,0.00090339297,0.0004822543,0.0002935421],"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.0004999336,0.00018405778,0.0019706213,0.00017272466,0.000053170752,0.0004791677,0.00017408616,0.7524125,0.033234224,0.090284534,0.006366341,0.11416864],"study_design_scores_gemma":[0.000020312513,0.00004814035,0.0001940193,0.000005137326,0.00000785068,0.00011970636,0.00001905349,0.9880775,0.0038278392,0.006540145,0.0011278953,0.000012385261],"about_ca_topic_score_codex":0.004698727,"about_ca_topic_score_gemma":0.0050149434,"teacher_disagreement_score":0.004698727,"about_ca_system_score_codex":0.0012168064,"about_ca_system_score_gemma":0.0015096549,"threshold_uncertainty_score":0.00934273},"labels":[],"label_agreement":null},{"id":"W2752020793","doi":"10.1007/s00521-017-3173-7","title":"pART2: using adaptive resonance theory for web caching prefetching","year":2017,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; BAH Enterprises (Canada); Trent University","funders":"Natural Sciences and Engineering Research Council of Canada; Trent University","keywords":"Computer science; Cache; Scheme (mathematics); Cluster analysis; CPU cache; Monte Carlo method; Sensitivity (control systems); Data mining; Distributed computing; Parallel computing; Machine learning","score_opus":0.057805224008872745,"score_gpt":0.3106713973151593,"score_spread":0.2528661733062866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752020793","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.0121938,0.0025448208,0.95867825,0.0013733595,0.0013464541,0.00010992986,0.00025139374,0.00053495605,0.022966951],"genre_scores_gemma":[0.6052142,0.0068072462,0.27539563,0.0018446356,0.0034478733,0.0006930993,0.000719187,0.0014722518,0.1044059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997631,0.0000672184,0.000013964451,0.00004801565,0.000077288554,0.000030474359],"domain_scores_gemma":[0.99932694,0.0003567383,0.000043381937,0.000109830486,0.00013701551,0.000026108879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005958206,0.0006524402,0.00053716294,0.0005108078,0.00033502068,0.0011438783,0.0012406914,0.0012747596,0.022266505],"category_scores_gemma":[0.0028842785,0.0003494774,0.001004949,0.000721809,0.0007215521,0.002175995,0.00080142426,0.001108444,0.0028907272],"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.00018562931,0.00021071482,0.0011276734,0.00071066624,0.00018791806,0.00032667303,0.00024356318,0.2763854,0.03439217,0.42991135,0.048173167,0.20814522],"study_design_scores_gemma":[0.000011982793,0.000037311747,0.0005442692,0.000035378984,0.000029873232,0.00013122043,0.000022123098,0.8740383,0.003586705,0.114012375,0.0075242533,0.000026214891],"about_ca_topic_score_codex":0.0022978212,"about_ca_topic_score_gemma":0.001812557,"teacher_disagreement_score":0.022266505,"about_ca_system_score_codex":0.00064159493,"about_ca_system_score_gemma":0.0005024114,"threshold_uncertainty_score":0.07448888},"labels":[],"label_agreement":null},{"id":"W2753240221","doi":"10.1145/3103010.3103022","title":"Small-Term Distribution for Disk-Based Search","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Term (time); Cluster analysis; Index (typography); Load balancing (electrical power); Compression (physics); Search engine; Data mining; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.08562222265737507,"score_gpt":0.292496878559644,"score_spread":0.20687465590226894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753240221","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7842856,0.0032431602,0.18570128,0.0011244704,0.00023465182,0.00048977166,0.002365848,0.008979066,0.0135761835],"genre_scores_gemma":[0.8982151,0.0005993359,0.09580069,0.00020180715,0.00006082636,0.00024853475,0.0018726899,0.0004929525,0.0025080652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860674,0.0003820679,0.00012958125,0.00028614743,0.00043401448,0.00016142803],"domain_scores_gemma":[0.99370766,0.002913737,0.00033974226,0.0015598373,0.0012222851,0.00025668766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020780496,0.0005662439,0.00074322184,0.0012552268,0.0011258797,0.0016074544,0.0022917064,0.0011317445,0.0022400494],"category_scores_gemma":[0.014170741,0.000345668,0.0004968908,0.003374933,0.0008219084,0.0037039712,0.0008365745,0.0011528147,0.0008530912],"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.002404688,0.0012949298,0.031964384,0.0009175253,0.0002829518,0.00048810235,0.0008584873,0.67868084,0.049986333,0.023749463,0.03046716,0.17890516],"study_design_scores_gemma":[0.00028023304,0.0005113792,0.005416063,0.00002655181,0.00006138286,0.0002982752,0.00019710332,0.9574442,0.018861102,0.0093057165,0.0075437655,0.000054246797],"about_ca_topic_score_codex":0.011957909,"about_ca_topic_score_gemma":0.017498823,"teacher_disagreement_score":0.011957909,"about_ca_system_score_codex":0.0020512745,"about_ca_system_score_gemma":0.0017426254,"threshold_uncertainty_score":0.02377665},"labels":[],"label_agreement":null},{"id":"W2756113194","doi":"10.48550/arxiv.1709.05377","title":"Dynamic Mobile Edge Caching with Location Differentiation","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"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":"China Scholarship Council; Ministry of Education, India; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Backhaul (telecommunications); Exploit; Popularity; Content delivery; Cache; Mobile edge computing; Enhanced Data Rates for GSM Evolution; Latency (audio); Computer network; Real-time computing; Base station; Artificial intelligence; Computer security; Telecommunications","score_opus":0.03916561685917943,"score_gpt":0.1786717447753173,"score_spread":0.13950612791613787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756113194","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.119867206,0.00078455685,0.8742634,0.00026759497,0.00006234791,0.00007605429,0.00010346036,0.0011024337,0.0034728958],"genre_scores_gemma":[0.9699859,0.00011235153,0.02850908,0.000066564055,0.000024640985,0.000020555199,0.000050165127,0.000015297777,0.0012155718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.00012252848,0.000025040126,0.00015117296,0.00010189248,0.000109635504],"domain_scores_gemma":[0.99900913,0.00034838074,0.0001375773,0.0002336716,0.00020176494,0.00006951271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005793256,0.0005986622,0.00088364724,0.00044874806,0.00046317562,0.00081819127,0.001541722,0.0008498641,0.00061349466],"category_scores_gemma":[0.0025247051,0.0002822404,0.0003015757,0.0008573245,0.0005071377,0.0011663763,0.0009197372,0.0006519243,0.00032844552],"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.00035115916,0.00017832543,0.0058393725,0.00007414402,0.00006327465,0.00033484746,0.00013816016,0.80944437,0.01238243,0.015657743,0.0028770883,0.1526591],"study_design_scores_gemma":[0.00000763266,0.00002804841,0.00024327027,0.0000026508446,0.000008029677,0.00006992699,0.000009132833,0.99643326,0.0012681582,0.0015439513,0.0003795603,0.000006402237],"about_ca_topic_score_codex":0.005422171,"about_ca_topic_score_gemma":0.006891188,"teacher_disagreement_score":0.005422171,"about_ca_system_score_codex":0.0009446591,"about_ca_system_score_gemma":0.0008541853,"threshold_uncertainty_score":0.010781229},"labels":[],"label_agreement":null},{"id":"W2757150185","doi":"10.1109/access.2017.2754419","title":"A Survey on Content Placement Algorithms for Cloud-Based Content Delivery Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University; University of Waterloo","funders":"","keywords":"Cloud computing; Computer science; Quality of service; Algorithm; Server; Content delivery network; Content delivery; Key (lock); Distributed computing; Computer network; Operating system","score_opus":0.22272835248472966,"score_gpt":0.3370601172835303,"score_spread":0.11433176479880064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757150185","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00761386,0.050589584,0.9272057,0.0007346389,0.00050291984,0.00036850202,0.00035412886,0.0009861381,0.011644534],"genre_scores_gemma":[0.13679618,0.08734388,0.7652488,0.0006795765,0.001108734,0.0006071457,0.001224945,0.00051514717,0.006475618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997717,0.00060616387,0.00023846766,0.00039331146,0.0008226699,0.00022238612],"domain_scores_gemma":[0.9969446,0.0016705185,0.00019347256,0.00041958917,0.0006849112,0.00008693099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019143561,0.0018300279,0.0021004665,0.0022897667,0.0014117009,0.0029302922,0.0030160232,0.0020142857,0.004114141],"category_scores_gemma":[0.007022248,0.0008718507,0.0010983548,0.00646863,0.000664052,0.0033871874,0.0014203266,0.0014836653,0.0022510365],"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.00020020588,0.00020366724,0.0012998591,0.0021169127,0.00010056897,0.000102828686,0.0001655443,0.14864552,0.0056659165,0.04409841,0.022807376,0.7745931],"study_design_scores_gemma":[0.00007201593,0.00032274297,0.0012390984,0.0007461429,0.00014739805,0.0011199841,0.00026175848,0.81319946,0.007869035,0.04768143,0.12725481,0.000086060856],"about_ca_topic_score_codex":0.0046697725,"about_ca_topic_score_gemma":0.0036781123,"teacher_disagreement_score":0.0046697725,"about_ca_system_score_codex":0.0029773898,"about_ca_system_score_gemma":0.0023974138,"threshold_uncertainty_score":0.021602571},"labels":[],"label_agreement":null},{"id":"W2760626209","doi":"10.48550/arxiv.1709.07198","title":"Cyber Insurance for Heterogeneous Wireless Networks","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 Alberta","funders":"","keywords":"Computer security; Reliability (semiconductor); Service (business); Wireless network; Computer science; Wireless; Business; Risk analysis (engineering); Telecommunications","score_opus":0.07288304696134598,"score_gpt":0.1904284001815963,"score_spread":0.11754535322025031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760626209","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.09180764,0.060560346,0.75319594,0.013430715,0.0010788039,0.00013737263,0.00019247492,0.0005357198,0.07906101],"genre_scores_gemma":[0.9445958,0.020890746,0.027416963,0.0005761504,0.0006724437,0.000072273964,0.0000894959,0.00004332856,0.0056427117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990426,0.00032930364,0.000051352385,0.000126828,0.00031070955,0.00013922917],"domain_scores_gemma":[0.9980494,0.0011985291,0.00019459012,0.00028291502,0.00017315672,0.000101406404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148771,0.00038355368,0.0004612478,0.0008915102,0.0007670255,0.0027374798,0.0007992161,0.0014676508,0.0017393054],"category_scores_gemma":[0.0055271857,0.00023763324,0.00048613004,0.0007425574,0.0017994564,0.004215484,0.0016279775,0.0017214525,0.00022744961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000026576121,0.00001993307,0.0010630849,0.00018505861,0.000035966095,0.00043808678,0.00018448118,0.034148987,0.0014280073,0.9120002,0.004223523,0.04624614],"study_design_scores_gemma":[0.000013771433,0.00005558575,0.0012625838,0.00028910823,0.00006654901,0.001018599,0.00021731759,0.32231086,0.0020184799,0.6088215,0.06388854,0.000036983238],"about_ca_topic_score_codex":0.0016498066,"about_ca_topic_score_gemma":0.0009976033,"teacher_disagreement_score":0.0027374798,"about_ca_system_score_codex":0.0022647723,"about_ca_system_score_gemma":0.0010292331,"threshold_uncertainty_score":0.016432106},"labels":[],"label_agreement":null},{"id":"W2761125797","doi":"10.1109/comst.2017.2758763","title":"Integration of Networking, Caching, and Computing in Wireless Systems: A Survey, Some Research Issues, and Challenges","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":145,"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; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Software deployment; Distributed computing; Wireless; Open research; Latency (audio); Computer network; Telecommunications; World Wide Web; Database","score_opus":0.3225336490015563,"score_gpt":0.4078846327510423,"score_spread":0.08535098374948602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761125797","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039740154,0.93683624,0.035212263,0.005352199,0.0010199684,0.00006884199,0.00006053573,0.00015130937,0.017324759],"genre_scores_gemma":[0.025554895,0.94859064,0.01822334,0.001078197,0.002786837,0.000075239106,0.0001187901,0.000045331668,0.0035267696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988123,0.00033513,0.000115588984,0.00017361,0.00042444837,0.00013890455],"domain_scores_gemma":[0.9973598,0.0016313714,0.000144983,0.00016663299,0.0005958,0.000101419675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018418324,0.0008994095,0.001278534,0.0030405484,0.001112369,0.003990557,0.0013478717,0.002025793,0.0021417935],"category_scores_gemma":[0.00229769,0.0008337255,0.00057722896,0.008583022,0.0013832663,0.009312392,0.0014185809,0.0024483218,0.0009647117],"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.000069622874,0.00021502428,0.003293667,0.007259417,0.00007899092,0.000281166,0.0006837747,0.0054778825,0.0024323214,0.19574775,0.029268023,0.75519234],"study_design_scores_gemma":[0.00001440164,0.0003128246,0.0031786864,0.0046256823,0.00014335381,0.0022898319,0.0019811345,0.02495666,0.0029618754,0.11909277,0.8402893,0.00015341239],"about_ca_topic_score_codex":0.0029195591,"about_ca_topic_score_gemma":0.0022860102,"teacher_disagreement_score":0.003990557,"about_ca_system_score_codex":0.0017068279,"about_ca_system_score_gemma":0.0021229459,"threshold_uncertainty_score":0.012383938},"labels":[],"label_agreement":null},{"id":"W2761862361","doi":"10.1109/tvt.2017.2760281","title":"Integrated Networking, Caching, and Computing for Connected Vehicles: A Deep Reinforcement Learning Approach","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":585,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Reinforcement learning; Orchestration; Computer science; Distributed computing; Scheme (mathematics); Resource allocation; Resource management (computing); Software-defined networking; Computer network; Artificial intelligence","score_opus":0.01821917043973043,"score_gpt":0.238006655922601,"score_spread":0.21978748548287058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761862361","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.06365853,0.0008591313,0.9280194,0.0009396463,0.00007654702,0.000044753375,0.000049765178,0.0002532327,0.0060989633],"genre_scores_gemma":[0.9709281,0.00025529874,0.025684914,0.00014967946,0.000039344017,0.000050214046,0.000039485916,0.000019778528,0.002833184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997496,0.00007185079,0.000009083817,0.000049941318,0.00004665772,0.00007292919],"domain_scores_gemma":[0.99939215,0.00034592766,0.000068761394,0.000027162183,0.00011070133,0.000055365846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069102895,0.0006608677,0.000919149,0.00032902468,0.00035121522,0.00076179643,0.0012797492,0.0011273033,0.0015384575],"category_scores_gemma":[0.0015326828,0.00033682465,0.0003732437,0.00038338607,0.0009383784,0.0008949434,0.00082459406,0.0012396366,0.00013742354],"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.000022884406,0.000027495878,0.00043453134,0.000015320085,0.00001602891,0.000029955509,0.00001582593,0.98395395,0.00032911164,0.006696647,0.00032989343,0.008128395],"study_design_scores_gemma":[0.0000016416226,0.000004239087,0.00001875841,8.694662e-7,0.000001635355,0.0000018658628,0.0000017207766,0.9988323,0.00003005566,0.0010602939,0.000045555098,9.946997e-7],"about_ca_topic_score_codex":0.013922979,"about_ca_topic_score_gemma":0.010931449,"teacher_disagreement_score":0.013922979,"about_ca_system_score_codex":0.0014491624,"about_ca_system_score_gemma":0.0013785962,"threshold_uncertainty_score":0.027683914},"labels":[],"label_agreement":null},{"id":"W2762666685","doi":"10.1109/lcomm.2017.2759780","title":"Video Transcoding, Caching, and Multicast for Heterogeneous Networks Over Wireless Network Virtualization","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multicast; Transcoding; Computer network; Heterogeneous network; Distributed computing; Wireless network; Network virtualization; Source-specific multicast; Virtualization; Scheme (mathematics); Xcast; Wireless; Cloud computing; Operating system","score_opus":0.037138828447178966,"score_gpt":0.28651696772635443,"score_spread":0.24937813927917546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762666685","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.082806975,0.001338829,0.91212463,0.00033906344,0.00008924561,0.00004513324,0.000026500045,0.00020353693,0.0030260512],"genre_scores_gemma":[0.9510033,0.00043851466,0.047764566,0.000056476496,0.000039711216,0.00003302738,0.000024848508,0.00001907674,0.00062041584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.0001896146,0.000014910034,0.000036262616,0.00008803378,0.000087202294],"domain_scores_gemma":[0.99962604,0.00015175101,0.000048447848,0.0000487851,0.00007426017,0.000050636256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074895914,0.00041042358,0.00053866213,0.00033233993,0.00048059926,0.0006481116,0.00084458606,0.00042964748,0.000323217],"category_scores_gemma":[0.001154687,0.00013858234,0.00031521352,0.00045595696,0.0003926402,0.00082585064,0.00067696103,0.0004886846,0.000041247666],"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.00020404559,0.00013001246,0.0017046795,0.00014600823,0.00010389189,0.00059228204,0.00012514259,0.74485725,0.040711895,0.10942294,0.0043048244,0.09769701],"study_design_scores_gemma":[0.0000040729515,0.000018456158,0.00008294526,0.0000019157562,0.0000092102955,0.000040452174,0.000012817118,0.99483657,0.0013230828,0.0032333515,0.0004330153,0.000004073627],"about_ca_topic_score_codex":0.0039134813,"about_ca_topic_score_gemma":0.0052279932,"teacher_disagreement_score":0.0039134813,"about_ca_system_score_codex":0.0011365641,"about_ca_system_score_gemma":0.0010683271,"threshold_uncertainty_score":0.008246422},"labels":[],"label_agreement":null},{"id":"W2762847751","doi":"10.1109/infocom.2017.8057003","title":"BD-CAT: Balanced dynamic content addressing in trees","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Computer science; Embedding; Greedy algorithm; Routing (electronic design automation); Content (measure theory); Scheme (mathematics); Upper and lower bounds; Point (geometry); Range (aeronautics); Distributed computing; Theoretical computer science; Mathematical optimization; Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.08373228543276409,"score_gpt":0.2948293585801796,"score_spread":0.21109707314741552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762847751","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.1261279,0.0005843616,0.8633733,0.0004018122,0.00013480289,0.00020827094,0.00033805374,0.0028314195,0.0060000545],"genre_scores_gemma":[0.6460113,0.00027565574,0.34889197,0.00017828369,0.0000433522,0.00014051177,0.00066280965,0.00026701728,0.0035291892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953616,0.00012117453,0.000026920367,0.00007842934,0.00015060895,0.00008672367],"domain_scores_gemma":[0.9981329,0.0006294469,0.00018478492,0.00058146904,0.00031296277,0.00015844323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077955215,0.00042884512,0.0005538284,0.00077037467,0.00093008345,0.0012817833,0.0014377246,0.0010295586,0.0016280875],"category_scores_gemma":[0.003979128,0.00023620967,0.00026929373,0.0011163594,0.0007556039,0.0026306568,0.0019500519,0.0007785844,0.00075991056],"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.0007552191,0.0003376737,0.0042420044,0.0003804527,0.0000806794,0.0003469063,0.0008244829,0.36035666,0.072000735,0.113593005,0.017823163,0.429259],"study_design_scores_gemma":[0.00005165142,0.00015725484,0.00038904842,0.000027401193,0.000022517586,0.00028176888,0.0002065787,0.93536156,0.015584742,0.038394157,0.009496599,0.000026629541],"about_ca_topic_score_codex":0.0019840223,"about_ca_topic_score_gemma":0.0029321203,"teacher_disagreement_score":0.0019840223,"about_ca_system_score_codex":0.0008797093,"about_ca_system_score_gemma":0.0010767223,"threshold_uncertainty_score":0.0063827634},"labels":[],"label_agreement":null},{"id":"W2762911723","doi":"10.1109/iccchina.2017.8330444","title":"Improving handover of 5G networks by network function virtualization and fog computing","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"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 British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Handover; Computer network; Scalability; Edge computing; Virtualization; Overhead (engineering); Mobile edge computing; Cloud computing; Enhanced Data Rates for GSM Evolution; Distributed computing; Flexibility (engineering); Server; Operating system; Telecommunications","score_opus":0.008345692314555878,"score_gpt":0.2035877104478245,"score_spread":0.19524201813326864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762911723","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.4523046,0.0031886036,0.52838796,0.00040820197,0.0002301358,0.00011774562,0.000059977458,0.0012717568,0.014031021],"genre_scores_gemma":[0.9780788,0.00031485714,0.021048224,0.000051735544,0.000020492824,0.000008141313,0.00003037781,0.000012273991,0.00043511158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968445,0.000077951394,0.000012089923,0.000029285267,0.00008728977,0.000109004985],"domain_scores_gemma":[0.9998466,0.000049762355,0.000019115332,0.000033664215,0.00003363068,0.00001724014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034970036,0.00048435942,0.00031232866,0.00025061506,0.00043727897,0.0007110226,0.00048928685,0.0004729554,0.00048197902],"category_scores_gemma":[0.0007894472,0.00009153475,0.00022075976,0.00028716493,0.0002620109,0.0010954719,0.00077614543,0.0004106121,0.000136266],"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.0007038832,0.00040690188,0.0062186467,0.00020039311,0.000118665266,0.00067684037,0.00037899512,0.25074086,0.27101228,0.029668204,0.0038214233,0.43605295],"study_design_scores_gemma":[0.00002290048,0.00027129368,0.0033002398,0.000018487119,0.000040955427,0.00027627457,0.00013751785,0.94689775,0.039192222,0.0051912908,0.004618218,0.00003273158],"about_ca_topic_score_codex":0.0024265193,"about_ca_topic_score_gemma":0.002584271,"teacher_disagreement_score":0.0024265193,"about_ca_system_score_codex":0.00043937296,"about_ca_system_score_gemma":0.00043996455,"threshold_uncertainty_score":0.0048247576},"labels":[],"label_agreement":null},{"id":"W2763356328","doi":"10.1016/j.comcom.2017.10.002","title":"When 5G meets ICN: An ICN-based caching approach for mobile video in 5G networks","year":2017,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Handover; Cellular network; Quality of experience; Router; Base station; Video quality; Bandwidth (computing); Transmission (telecommunications); Quality of service; Telecommunications","score_opus":0.06781963484572784,"score_gpt":0.304871999234196,"score_spread":0.23705236438846816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763356328","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.3502191,0.0070146737,0.47050014,0.023852449,0.004649048,0.0006398834,0.0015214059,0.0027471678,0.13885616],"genre_scores_gemma":[0.97477007,0.0006046504,0.018008808,0.0010039373,0.00033115022,0.000037830352,0.00020647669,0.00010070215,0.004936366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709475,0.00052385783,0.00014513619,0.00043229922,0.0009488242,0.0008551272],"domain_scores_gemma":[0.9958079,0.0012154217,0.0004062347,0.0004948727,0.0016425085,0.00043307056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020588269,0.00059000787,0.0011298427,0.00052904285,0.0016968773,0.0036411243,0.0011299703,0.0022638494,0.0038632185],"category_scores_gemma":[0.011572464,0.00048229104,0.0003621156,0.0006099694,0.00095343497,0.006372746,0.0014221449,0.0017272242,0.0006622823],"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.002515636,0.0003978371,0.051627565,0.000780666,0.00033122342,0.006639051,0.0018146372,0.12075442,0.050997633,0.3918832,0.09487179,0.27738634],"study_design_scores_gemma":[0.00007843555,0.00034935045,0.0121946735,0.00025558757,0.00024599853,0.0031406283,0.0030396774,0.73977923,0.018408747,0.1703111,0.052025076,0.00017161759],"about_ca_topic_score_codex":0.011126602,"about_ca_topic_score_gemma":0.01915239,"teacher_disagreement_score":0.011126602,"about_ca_system_score_codex":0.0023436875,"about_ca_system_score_gemma":0.0025670682,"threshold_uncertainty_score":0.022123694},"labels":[],"label_agreement":null},{"id":"W2763922464","doi":"10.1007/s00521-017-3205-3","title":"Correction to: pART2: using adaptive resonance theory for web caching prefetching","year":2017,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; BAH Enterprises (Canada); Trent University","funders":"","keywords":"Computer science; Computational Science and Engineering; World Wide Web; Information retrieval; Machine learning","score_opus":0.04728556045832528,"score_gpt":0.30934526552220293,"score_spread":0.26205970506387766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763922464","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022002003,0.0012401323,0.0033162902,0.05837241,0.9294184,0.000035350487,0.0025128215,0.0011819913,0.003702538],"genre_scores_gemma":[0.033861015,0.0068597463,0.013118871,0.10946401,0.5359794,0.00038048276,0.0050430177,0.0042987703,0.29099455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933988,0.0010089321,0.0009065036,0.0012055569,0.002875979,0.00060419453],"domain_scores_gemma":[0.94078326,0.01240992,0.0024175993,0.004818985,0.03748417,0.0020860157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045396253,0.0028836587,0.002273199,0.005179644,0.0037423917,0.00484406,0.0041390243,0.0097888205,0.098447144],"category_scores_gemma":[0.095333636,0.001356633,0.0019355771,0.004372374,0.0031332567,0.0039279694,0.0028191078,0.011270057,0.058345657],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004861434,0.000005677971,0.00008893097,0.00011117612,0.000016187905,0.0000833908,0.000027519278,0.00014388685,0.00008170257,0.001832634,0.9925322,0.005028071],"study_design_scores_gemma":[0.00008256378,0.000024026194,0.0011652397,0.00027739097,0.000056914843,0.00033239875,0.00009270386,0.00227071,0.0010257621,0.0071297814,0.98744905,0.000093415976],"about_ca_topic_score_codex":0.03267345,"about_ca_topic_score_gemma":0.027625803,"teacher_disagreement_score":0.098447144,"about_ca_system_score_codex":0.0066605313,"about_ca_system_score_gemma":0.0062831403,"threshold_uncertainty_score":0.3293385},"labels":[],"label_agreement":null},{"id":"W2765170773","doi":"10.1109/isncc.2017.8072033","title":"Managing the mobile Ad-hoc cloud ecosystem using software defined networking principles","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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 Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Cloud computing; Adaptive quality of service multi-hop routing; Computer network; Delay-tolerant networking; Vehicular ad hoc network; Optimized Link State Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Mobile computing; Software-defined networking; Wireless; Telecommunications; Operating system","score_opus":0.051699896351142555,"score_gpt":0.25623798600802833,"score_spread":0.20453808965688577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765170773","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.12714453,0.002099297,0.8541147,0.0012953897,0.00023702496,0.0003485643,0.00003554369,0.000768278,0.013956661],"genre_scores_gemma":[0.8328934,0.0011144349,0.16266643,0.00017354333,0.00009772618,0.00011411388,0.00007014814,0.00005780529,0.0028124722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.00009762,0.0000403792,0.00006928708,0.00020255616,0.00012654322],"domain_scores_gemma":[0.9992835,0.0001140559,0.00011244012,0.00013904856,0.00018775235,0.00016324843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858998,0.0003908929,0.00030841658,0.0005460339,0.0011342257,0.0022502225,0.0012521544,0.0005523215,0.00036164728],"category_scores_gemma":[0.0011549295,0.00023736309,0.00034265636,0.00046516652,0.00061759225,0.0022571469,0.0020120917,0.0008501727,0.00015245765],"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.00029010093,0.00057017343,0.016715877,0.0005531778,0.0002671941,0.0026051255,0.0015434197,0.22204407,0.091200866,0.2718362,0.007070204,0.3853036],"study_design_scores_gemma":[0.000047348338,0.00021250003,0.0018685092,0.000074012416,0.00011811887,0.0009946176,0.000610956,0.86550504,0.015341069,0.06621897,0.048946578,0.00006232285],"about_ca_topic_score_codex":0.0020277288,"about_ca_topic_score_gemma":0.00267592,"teacher_disagreement_score":0.0022502225,"about_ca_system_score_codex":0.0007360865,"about_ca_system_score_gemma":0.0013911593,"threshold_uncertainty_score":0.0053406954},"labels":[],"label_agreement":null},{"id":"W2766607455","doi":"10.1007/978-3-319-68392-8_1","title":"On the Use of Matrix Bloom Filters in Data Leak Protection","year":2017,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Bloom filter; Computer science; Filter (signal processing); Leak; Matrix (chemical analysis); Data mining; Upload; Component (thermodynamics); Algorithm; Engineering; World Wide Web; Computer vision","score_opus":0.46898930441551884,"score_gpt":0.3894231302047477,"score_spread":0.07956617421077111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766607455","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.024061995,0.021185534,0.8585987,0.00754482,0.0010289903,0.0003012098,0.0003690044,0.0023417352,0.084567994],"genre_scores_gemma":[0.57017714,0.025095867,0.3560712,0.0024008728,0.0015162069,0.0003052903,0.0004037464,0.0008946705,0.043135036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732745,0.0007613831,0.00018525968,0.0002967253,0.0010595601,0.00036967435],"domain_scores_gemma":[0.987328,0.0070974985,0.00044613963,0.0036699458,0.0012576993,0.00020063095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039273184,0.0011172838,0.0013633416,0.0020035163,0.0020728044,0.0063939746,0.0021575717,0.0021861598,0.008209476],"category_scores_gemma":[0.015310214,0.0009977059,0.00085613027,0.004790941,0.004365975,0.018132359,0.003661396,0.0047188685,0.0018087347],"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.00014542975,0.00007309773,0.0003572575,0.00017893079,0.000029471381,0.00007731351,0.00032564855,0.008879203,0.0028092146,0.87394905,0.015822861,0.09735248],"study_design_scores_gemma":[0.000035387053,0.00008282633,0.00022141918,0.00029543665,0.00006371122,0.00047874506,0.00019966696,0.12557605,0.009834088,0.80373114,0.05941659,0.00006492557],"about_ca_topic_score_codex":0.0038219918,"about_ca_topic_score_gemma":0.003685637,"teacher_disagreement_score":0.008209476,"about_ca_system_score_codex":0.0049199,"about_ca_system_score_gemma":0.002427779,"threshold_uncertainty_score":0.035696566},"labels":[],"label_agreement":null},{"id":"W2768147779","doi":"10.1109/lwc.2017.2776920","title":"A Game-Theoretic Approach for Optimal Distributed Cooperative Hybrid Caching in D2D Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":27,"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":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Nash equilibrium; Cache; Base station; Potential game; Aggregate (composite); Function (biology); Mathematical optimization; Computer network; Distributed computing; Mathematics","score_opus":0.030209561253599512,"score_gpt":0.2682377018568233,"score_spread":0.23802814060322375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768147779","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.014047988,0.00023051894,0.9808303,0.00038874577,0.000035867302,0.00006566858,0.000052623065,0.00007585334,0.0042724493],"genre_scores_gemma":[0.90162075,0.00039175706,0.091839515,0.00024107363,0.00005978166,0.00027539747,0.0000712872,0.000044410583,0.005456046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934727,0.0002503719,0.000026451287,0.00012140701,0.00013480068,0.00011959843],"domain_scores_gemma":[0.99874085,0.00085636775,0.000097770426,0.0000508471,0.0001586966,0.000095551666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011792296,0.0009851712,0.0013191126,0.00070419157,0.0007225457,0.001444224,0.0021924379,0.0015328608,0.0020792414],"category_scores_gemma":[0.0027869933,0.0005452031,0.00069675903,0.0009956891,0.0014476638,0.0019602224,0.001565349,0.0012352114,0.00021733712],"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.000026872758,0.000030354304,0.00020069256,0.00004282582,0.000019873189,0.00006354746,0.00004448338,0.9518894,0.0005164283,0.040472288,0.00081289484,0.005880403],"study_design_scores_gemma":[0.0000061664114,0.000007751811,0.000019478648,0.0000017386363,0.0000030903752,0.000008750783,0.000008518709,0.9920134,0.000050838466,0.007720607,0.0001565175,0.0000032084017],"about_ca_topic_score_codex":0.0087301945,"about_ca_topic_score_gemma":0.006638801,"teacher_disagreement_score":0.0087301945,"about_ca_system_score_codex":0.0029611192,"about_ca_system_score_gemma":0.0016653262,"threshold_uncertainty_score":0.021484494},"labels":[],"label_agreement":null},{"id":"W2768488374","doi":"10.1109/lcn.2017.107","title":"Geographically-Distinct Request Patterns for Caching in Information-Centric Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Zipf's law; Computer science; The Internet; Information-centric networking; Architecture; Computer network; Distribution (mathematics); Distributed computing; World Wide Web; Geography","score_opus":0.013634019060150515,"score_gpt":0.23953903277222816,"score_spread":0.22590501371207763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768488374","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.8481024,0.0001968173,0.14784957,0.00035625687,0.000022495693,0.0001926938,0.00025142654,0.0005855062,0.0024427231],"genre_scores_gemma":[0.98138005,0.00006534538,0.018005181,0.000021327223,0.0000056544077,0.000049933373,0.000109450666,0.000021917098,0.00034119055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991775,0.0003882301,0.000037596074,0.00011234567,0.00015351264,0.00013068269],"domain_scores_gemma":[0.9953511,0.002916963,0.000524977,0.00053559616,0.00049729354,0.00017410224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013748967,0.00039807303,0.0005019856,0.00076877885,0.00094220205,0.00080747897,0.0010412466,0.000929427,0.00053243095],"category_scores_gemma":[0.008517221,0.00035837103,0.00036718362,0.0012404019,0.0008985393,0.0013555192,0.0005207473,0.00054589234,0.00011480292],"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.00022229244,0.00015993741,0.0131646525,0.000067859786,0.00003464055,0.00031247849,0.00026088642,0.941391,0.0056484686,0.023177093,0.0014342988,0.014126359],"study_design_scores_gemma":[0.0000146828015,0.000028739058,0.0010901103,0.0000035382645,0.000007349509,0.00008666534,0.000056700086,0.9939872,0.0012808815,0.0032302057,0.0002047074,0.000009118219],"about_ca_topic_score_codex":0.009670535,"about_ca_topic_score_gemma":0.011897172,"teacher_disagreement_score":0.009670535,"about_ca_system_score_codex":0.002802627,"about_ca_system_score_gemma":0.00103522,"threshold_uncertainty_score":0.020334542},"labels":[],"label_agreement":null},{"id":"W2769502403","doi":"10.1109/infcomw.2017.8116363","title":"Energy-efficient resource allocation in software-defined mobile networks with mobile edge computing and caching","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":38,"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; Ministerio de Economía y Competitividad","keywords":"Computer science; Provisioning; Mobile edge computing; Computer network; Base station; Distributed computing; Bandwidth allocation; Backhaul (telecommunications); Resource allocation; Bandwidth (computing); Radio access network; Optimization problem; Mobile computing; Server; Mobile station","score_opus":0.009395821363395193,"score_gpt":0.22063544414458902,"score_spread":0.21123962278119382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769502403","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.067228876,0.0015584159,0.9272813,0.00033383345,0.000066562796,0.000048272246,0.000026850748,0.00009013026,0.0033657467],"genre_scores_gemma":[0.94193715,0.00057316065,0.05581829,0.000077930774,0.000040704675,0.00006686956,0.00002360808,0.000019680772,0.0014425131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993389,0.0002683508,0.000023713046,0.00009378844,0.00013838315,0.00013681113],"domain_scores_gemma":[0.99924195,0.00047301303,0.00008791139,0.000048226626,0.00010983026,0.000039065544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070891296,0.00065918604,0.0009632366,0.00038723132,0.00049694366,0.000962788,0.001109834,0.00067630224,0.0005505725],"category_scores_gemma":[0.0016282566,0.00033244354,0.00036684494,0.0010272284,0.0006810338,0.0012482688,0.00080101535,0.00054198375,0.00008071886],"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.0000943963,0.00006126438,0.0006111047,0.00008862209,0.000047217265,0.00015653406,0.0000584343,0.9404114,0.004082602,0.028463196,0.0007452547,0.025179926],"study_design_scores_gemma":[0.0000047387734,0.000015977614,0.000050421357,0.0000023551343,0.000005403093,0.00001799781,0.000011025968,0.99687225,0.0003283624,0.0024316006,0.00025702224,0.0000028720854],"about_ca_topic_score_codex":0.003735296,"about_ca_topic_score_gemma":0.004451356,"teacher_disagreement_score":0.003735296,"about_ca_system_score_codex":0.0011232108,"about_ca_system_score_gemma":0.0009684344,"threshold_uncertainty_score":0.008149445},"labels":[],"label_agreement":null},{"id":"W2770140678","doi":"10.1109/lcn.2017.61","title":"Utility-Gradient Implicit Cache Coordination Policy for Information-Centric Ad-Hoc Vehicular Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"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 Ottawa","funders":"","keywords":"Cache; Computer science; Smart Cache; Cache invalidation; Cache algorithms; Cache coloring; Page cache; Computer network; Cache pollution; Wireless ad hoc network; Mobile ad hoc network; Communication source; CPU cache; Operating system; Wireless","score_opus":0.016946184374611428,"score_gpt":0.2549271674059795,"score_spread":0.23798098303136805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770140678","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.110378556,0.0013589575,0.88061637,0.00049391616,0.0001287363,0.00010365384,0.00009540282,0.00044301213,0.0063813473],"genre_scores_gemma":[0.9847994,0.00021217467,0.013652922,0.000045236713,0.000019622095,0.000031964122,0.00004357427,0.000014787189,0.0011803241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995553,0.00015348224,0.000019800602,0.000070893664,0.000105473424,0.00009512522],"domain_scores_gemma":[0.99890494,0.00048795796,0.00013286031,0.0000919613,0.0002814539,0.00010073962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009183248,0.0004671603,0.00076153554,0.00050197606,0.0005077871,0.00078436953,0.0015589991,0.00048419397,0.00079061865],"category_scores_gemma":[0.0032838287,0.00022063055,0.00020448603,0.00075156917,0.00058793253,0.0010969103,0.00063271733,0.00052509987,0.0001377757],"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.00024698288,0.000099356526,0.0014298671,0.00009663821,0.000038501585,0.00015561662,0.00015041397,0.9157816,0.0025909145,0.0360196,0.0031541565,0.040236287],"study_design_scores_gemma":[0.000009528964,0.000042378448,0.0001271758,0.000004442636,0.000006358832,0.000029977886,0.000021888745,0.9954841,0.00032051947,0.003404337,0.00054316083,0.0000061101455],"about_ca_topic_score_codex":0.0077710077,"about_ca_topic_score_gemma":0.008247728,"teacher_disagreement_score":0.0077710077,"about_ca_system_score_codex":0.0012738906,"about_ca_system_score_gemma":0.0013096175,"threshold_uncertainty_score":0.0154515505},"labels":[],"label_agreement":null},{"id":"W2770671463","doi":"10.1109/mass.2017.34","title":"LISIC: A Link Stability-Based Protocol for Vehicular Information-Centric Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":51,"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 Ottawa","funders":"","keywords":"Computer science; Computer network; Vehicular ad hoc network; Broadcast radiation; Network packet; Network topology; Protocol (science); Communication source; Routing protocol; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications","score_opus":0.03689944607296808,"score_gpt":0.28235664092345997,"score_spread":0.2454571948504919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770671463","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.011933863,0.0011582079,0.96757466,0.0007361399,0.000496781,0.0010022441,0.00049354555,0.0056272857,0.010977275],"genre_scores_gemma":[0.6840411,0.0018354316,0.29356077,0.0012148563,0.0003841415,0.0028708542,0.0034378688,0.000547892,0.012107111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988613,0.00031029814,0.0001287568,0.00013108188,0.00040372284,0.0001647849],"domain_scores_gemma":[0.99813604,0.00048456114,0.0002512407,0.0002588708,0.00072523777,0.00014411697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019461819,0.0007316442,0.0009793988,0.0021515244,0.0017131055,0.0015387163,0.00243079,0.0010980086,0.0019990192],"category_scores_gemma":[0.004276874,0.000358778,0.0005229476,0.001516641,0.0012076279,0.0016309307,0.0029747994,0.0016710883,0.00092286133],"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.001252573,0.0003726784,0.002491604,0.001376467,0.00026053147,0.0012461698,0.0017739133,0.2702344,0.057295408,0.1911122,0.0653278,0.40725622],"study_design_scores_gemma":[0.00018127704,0.0006444981,0.0004708789,0.00013080014,0.00016733963,0.0007253439,0.0002789671,0.84322006,0.024911383,0.026680324,0.10242287,0.00016613654],"about_ca_topic_score_codex":0.0035412752,"about_ca_topic_score_gemma":0.0048641823,"teacher_disagreement_score":0.0035412752,"about_ca_system_score_codex":0.0020427832,"about_ca_system_score_gemma":0.003002898,"threshold_uncertainty_score":0.014821529},"labels":[],"label_agreement":null},{"id":"W2771854560","doi":"10.1109/access.2017.2782776","title":"Dynamic QoS-Aware Resource Assignment in Cloud-Based Content-Delivery Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Provisioning; Computer science; Quality of service; Resource (disambiguation); Computer network; Resource allocation; Resource management (computing); Lease; Distributed computing; Operating system; Business","score_opus":0.05682590928387501,"score_gpt":0.2925922464985071,"score_spread":0.2357663372146321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771854560","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.16976672,0.0011937862,0.82478946,0.00051757036,0.00009872913,0.00011159504,0.000093247734,0.00025266124,0.0031762999],"genre_scores_gemma":[0.9588253,0.0003476248,0.039673373,0.000039610233,0.00003751506,0.000035367855,0.000038337184,0.00002916592,0.00097380835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931765,0.00025465104,0.000021898688,0.00011841457,0.00010657469,0.00018078931],"domain_scores_gemma":[0.9988004,0.0007666437,0.00016119271,0.000059200884,0.00010870448,0.00010382125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906112,0.00064748246,0.00096939865,0.00048745226,0.0008240043,0.0011481429,0.0015071478,0.0008298118,0.0007140896],"category_scores_gemma":[0.002521375,0.0004492026,0.00025302076,0.0010527396,0.00068411237,0.001081572,0.00064683764,0.00054516905,0.000110369794],"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.00012430517,0.000053696247,0.0007585145,0.000052193245,0.000014780994,0.00012742761,0.00004634224,0.96563065,0.0034348117,0.009239179,0.00081183796,0.019706227],"study_design_scores_gemma":[0.0000036919366,0.0000104222445,0.00010931928,0.0000017609523,0.0000034984869,0.000018319926,0.000014494742,0.9978956,0.00043984636,0.0013359098,0.00016415589,0.0000028293161],"about_ca_topic_score_codex":0.007996977,"about_ca_topic_score_gemma":0.0062618623,"teacher_disagreement_score":0.007996977,"about_ca_system_score_codex":0.0021200508,"about_ca_system_score_gemma":0.0012300583,"threshold_uncertainty_score":0.01590085},"labels":[],"label_agreement":null},{"id":"W2773421688","doi":"10.1109/wcsp.2017.8171154","title":"Utility function optimization based joint user association and content placement in heterogeneous networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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":"Backhaul (telecommunications); Cache; Computer science; Optimization problem; Lagrangian relaxation; Mathematical optimization; Convex optimization; Heterogeneous network; Lagrange multiplier; Computer network; Wireless network; Wireless; Base station; Algorithm; Regular polygon; Mathematics","score_opus":0.043104583807549016,"score_gpt":0.22154335098406527,"score_spread":0.17843876717651624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773421688","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.040499654,0.0003837295,0.9564728,0.00022084898,0.000028031483,0.000047877274,0.000037453185,0.0001591641,0.0021505337],"genre_scores_gemma":[0.89890283,0.00045660406,0.09697804,0.00008210008,0.00003981438,0.00012635521,0.00010448427,0.00007583066,0.0032339334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903214,0.00048630434,0.000029131272,0.00012412395,0.00013320953,0.00019501423],"domain_scores_gemma":[0.99890256,0.0007379041,0.00010529152,0.000061616454,0.00012001676,0.00007258477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017246807,0.0011537997,0.0018327563,0.00056603964,0.0005822692,0.0013303985,0.001220636,0.0010476256,0.00098397],"category_scores_gemma":[0.0028719285,0.0005797692,0.00064284174,0.0013413618,0.0009367102,0.0013886715,0.001154627,0.0009085122,0.00023317274],"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.000059769332,0.000039618117,0.00030158233,0.000024555942,0.000017281087,0.00007308614,0.000022960518,0.9814804,0.00069554336,0.0060745142,0.00048965035,0.010721055],"study_design_scores_gemma":[0.00000360209,0.000008575422,0.000034959816,0.0000010010153,0.0000030863243,0.0000069728785,0.000006230677,0.99838424,0.00016737734,0.0013188142,0.00006324461,0.0000018412455],"about_ca_topic_score_codex":0.007902878,"about_ca_topic_score_gemma":0.0053574643,"teacher_disagreement_score":0.007902878,"about_ca_system_score_codex":0.0020196193,"about_ca_system_score_gemma":0.0014214369,"threshold_uncertainty_score":0.015713751},"labels":[],"label_agreement":null},{"id":"W2775998236","doi":"10.1109/twc.2017.2785250","title":"Multi-Hop Cooperative Caching in Social IoT Using Matching Theory","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":86,"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":"Army Research Office; National Natural Science Foundation of China; Beijing Nova Program; National Science Foundation","keywords":"Computer science; Internet of Things; Wireless; Scheme (mathematics); Computer network; Coding (social sciences); Matching (statistics); Distributed computing; Computer security; Telecommunications","score_opus":0.0811028264004305,"score_gpt":0.3296931984993503,"score_spread":0.24859037209891982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775998236","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.049592104,0.00063064107,0.9411777,0.00041496434,0.00005737588,0.00008143007,0.00005620971,0.0001698758,0.007819688],"genre_scores_gemma":[0.9418628,0.000528235,0.05271302,0.00014604656,0.000044190037,0.00012132419,0.000059333575,0.000032164055,0.004492823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915624,0.00035507543,0.000029825518,0.00009202497,0.0002096532,0.00015730521],"domain_scores_gemma":[0.9983005,0.0011219622,0.00016540162,0.00012085633,0.0001978315,0.00009355884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015699458,0.00053263456,0.001154329,0.0010032696,0.00081466703,0.0013465701,0.0015806622,0.0010921656,0.0017631366],"category_scores_gemma":[0.0047616605,0.00035679474,0.0008446822,0.0016345084,0.0012244525,0.002068031,0.001516701,0.00067705486,0.00032171124],"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.00009861686,0.00007104941,0.0006009686,0.00009548488,0.000052040534,0.00017650508,0.00011121553,0.79658675,0.0025276293,0.17955776,0.0017157546,0.018406264],"study_design_scores_gemma":[0.00000596329,0.0000102094655,0.00004392773,0.0000032470982,0.0000046541154,0.000016375256,0.000013452534,0.9821876,0.00014108323,0.017322658,0.0002455027,0.000005448669],"about_ca_topic_score_codex":0.005642355,"about_ca_topic_score_gemma":0.004077689,"teacher_disagreement_score":0.005642355,"about_ca_system_score_codex":0.0023494454,"about_ca_system_score_gemma":0.00135266,"threshold_uncertainty_score":0.01704657},"labels":[],"label_agreement":null},{"id":"W2779923543","doi":"10.1109/rtuwo.2017.8228538","title":"A waste city management system for smart cities applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Garbage; Geolocation; Truck; Bin; Waste collection; Computer science; Smart city; Internet of Things; Transport engineering; Real-time computing; Database; Waste management; Engineering; Municipal solid waste; Computer security; World Wide Web; Automotive engineering","score_opus":0.033113656647255775,"score_gpt":0.24690913133179415,"score_spread":0.21379547468453838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779923543","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.15013178,0.0013741415,0.7378316,0.0013502152,0.0004495169,0.0007824804,0.0012691703,0.072858006,0.03395302],"genre_scores_gemma":[0.75157815,0.00090556906,0.21165413,0.0008196374,0.00017584715,0.00057951274,0.0028786145,0.00079350703,0.03061497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978644,0.000035546833,0.00001828594,0.00004110787,0.00008362414,0.00003502638],"domain_scores_gemma":[0.99973804,0.000029193308,0.000016944618,0.00007020449,0.00010724179,0.000038345053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031188232,0.0005882028,0.00059023034,0.0007914372,0.0010305714,0.0010461102,0.0010558385,0.0008905097,0.0062015336],"category_scores_gemma":[0.0004469772,0.00026001013,0.0003528528,0.001102169,0.0002022775,0.0018523962,0.00090140937,0.00060451834,0.0025770417],"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.0011221711,0.0011853409,0.010060707,0.0005828513,0.0002091867,0.0012349068,0.0007166001,0.04947126,0.12635572,0.0219537,0.09183146,0.69527614],"study_design_scores_gemma":[0.00022739518,0.0006941113,0.008162182,0.00008251856,0.0002260419,0.0007783878,0.00027946488,0.66517144,0.09309511,0.010526657,0.2206037,0.00015300712],"about_ca_topic_score_codex":0.002823029,"about_ca_topic_score_gemma":0.0029375232,"teacher_disagreement_score":0.0062015336,"about_ca_system_score_codex":0.0005551986,"about_ca_system_score_gemma":0.0006957634,"threshold_uncertainty_score":0.020746231},"labels":[],"label_agreement":null},{"id":"W2781157877","doi":"10.1109/cloudcom.2017.18","title":"A Novel Game Map Preloading and Resource Provisioning Scheme in Cooperative Cloud Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Provisioning; Server; Cloud computing; Upload; Computer network; Wireless; Cellular network; Mobile device; Wireless network; Cache; Scheme (mathematics); Potential game; Mobile telephony; Latency (audio); Distributed computing; Game theory; Mobile radio; Telecommunications; World Wide Web; Operating system","score_opus":0.020887043612486555,"score_gpt":0.24580087463313763,"score_spread":0.22491383102065107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781157877","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.085847944,0.001316689,0.9034064,0.0004716945,0.00021091377,0.00030544793,0.00021132773,0.0008681401,0.0073615406],"genre_scores_gemma":[0.9250343,0.00037521592,0.072087094,0.00017214978,0.00005415895,0.00009748556,0.0001217452,0.000048899943,0.0020088928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988211,0.00026057079,0.000043721062,0.00022253819,0.00021235229,0.00043984558],"domain_scores_gemma":[0.9985267,0.00050920015,0.0001361109,0.00020633043,0.0003629956,0.0002586606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009823748,0.001321571,0.0015428168,0.00079951505,0.0021582567,0.0016127549,0.0035344905,0.00093011087,0.0017944213],"category_scores_gemma":[0.002672823,0.00043988903,0.00060382794,0.0018517781,0.00086021476,0.001990061,0.0021934563,0.0009894298,0.00038104883],"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.00084272824,0.00061519694,0.0035257363,0.00027634116,0.00013532101,0.0013641429,0.0006411899,0.73324597,0.020615771,0.047903806,0.016312893,0.17452092],"study_design_scores_gemma":[0.000013505676,0.000042511627,0.00012765905,0.000005482984,0.000013866996,0.00012250431,0.00006187528,0.9953816,0.00078998617,0.0026352215,0.0007911404,0.000014743936],"about_ca_topic_score_codex":0.023864461,"about_ca_topic_score_gemma":0.032788314,"teacher_disagreement_score":0.023864461,"about_ca_system_score_codex":0.0018742498,"about_ca_system_score_gemma":0.0029348193,"threshold_uncertainty_score":0.04745108},"labels":[],"label_agreement":null},{"id":"W2783130023","doi":"10.1109/glocom.2017.8254717","title":"A Big Data Deep Reinforcement Learning Approach to Next Generation Green Wireless Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reinforcement learning; Computer science; Orchestration; Wireless network; Distributed computing; Wireless; Network packet; Resource allocation; Deep learning; Computer network; Artificial intelligence; Telecommunications","score_opus":0.16206080145693258,"score_gpt":0.2675777754917703,"score_spread":0.10551697403483773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783130023","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.03872336,0.0007421145,0.9557796,0.0011131278,0.000104249135,0.000034228935,0.00008038221,0.00043259692,0.0029904463],"genre_scores_gemma":[0.9361481,0.00027028495,0.060208853,0.00025619392,0.000073411225,0.00008210236,0.00012044659,0.00004536077,0.0027951454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997503,0.000087434084,0.000011221476,0.00005002649,0.000047157344,0.00005382467],"domain_scores_gemma":[0.99901676,0.0005751825,0.00009391428,0.00004780205,0.00019153544,0.00007473773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012036775,0.00064898405,0.0008371801,0.00038226877,0.00037838568,0.0007128841,0.0012842298,0.0009444076,0.0016367175],"category_scores_gemma":[0.0027426695,0.00032953636,0.0003456624,0.00040579017,0.000826525,0.0010103119,0.0008790871,0.0015460287,0.0001424794],"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.000031781805,0.000026395373,0.00043339052,0.000021114949,0.000019812895,0.000030573534,0.000018138662,0.97809577,0.00022680368,0.006575215,0.0006650574,0.013855951],"study_design_scores_gemma":[0.0000012159057,0.000002909569,0.00001539999,7.550753e-7,0.0000010001168,0.0000010047811,9.97914e-7,0.998594,0.000028345316,0.001308307,0.00004537303,7.226407e-7],"about_ca_topic_score_codex":0.011810716,"about_ca_topic_score_gemma":0.010452911,"teacher_disagreement_score":0.011810716,"about_ca_system_score_codex":0.0013849502,"about_ca_system_score_gemma":0.0012414953,"threshold_uncertainty_score":0.023483932},"labels":[],"label_agreement":null},{"id":"W2783339603","doi":"10.1109/glocom.2017.8254726","title":"Robust Proactive Mobility Management in Named Data Networking under Erroneous Content Prediction","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Mobility management; Benchmark (surveying); Handover; Overhead (engineering); Exploit; Constraint (computer-aided design); The Internet; Cellular network; Scheme (mathematics); Computer network; Big data; Distributed computing; Data mining; Computer security","score_opus":0.2555159984421157,"score_gpt":0.28616126255004515,"score_spread":0.03064526410792945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783339603","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.17994253,0.00040443134,0.8171177,0.0005089639,0.000036920224,0.000029789417,0.000070783775,0.00019983547,0.001689063],"genre_scores_gemma":[0.98892957,0.00008655276,0.010580297,0.000030347896,0.000008979277,0.000010750796,0.000023910556,0.000011246834,0.00031846948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.00023925409,0.000025634934,0.0001273493,0.00011283685,0.00014727328],"domain_scores_gemma":[0.99831665,0.001101138,0.0002490072,0.00010421597,0.0001461351,0.00008288577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013293992,0.000551396,0.0007296712,0.00028654656,0.0005435639,0.0009104299,0.0010712955,0.0007817366,0.00034783644],"category_scores_gemma":[0.003606304,0.0003333725,0.00037707257,0.00050861057,0.0008206188,0.0013003784,0.0010988824,0.0005775273,0.000039588274],"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.000043886266,0.000010608481,0.00055248215,0.000016969014,0.000014240625,0.0000845271,0.000025661548,0.9872896,0.0013994505,0.005665397,0.00015537709,0.0047417176],"study_design_scores_gemma":[0.0000019730442,0.000008763322,0.00008590714,9.766645e-7,0.0000030482904,0.000009892855,0.000007678332,0.99818027,0.00028434937,0.0013653351,0.00004899264,0.000002784238],"about_ca_topic_score_codex":0.008008777,"about_ca_topic_score_gemma":0.005275223,"teacher_disagreement_score":0.008008777,"about_ca_system_score_codex":0.0015786256,"about_ca_system_score_gemma":0.0010594988,"threshold_uncertainty_score":0.015924335},"labels":[],"label_agreement":null},{"id":"W2783525692","doi":"10.1109/glocom.2017.8254998","title":"Incentive Mechanism for Cached-Enabled Small Cell Sharing: A Stackelberg Game Approach","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"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":"Stackelberg competition; Cache; Computer science; Profit (economics); Incentive; Leverage (statistics); Computer network; Base station; Revenue; Game theory; Small cell; Microeconomics; Business; Finance","score_opus":0.049316936208627586,"score_gpt":0.2424852739397666,"score_spread":0.193168337731139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783525692","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.03662094,0.00047129707,0.9514406,0.0009595288,0.00015561676,0.00023826184,0.00013339224,0.00012030224,0.009860043],"genre_scores_gemma":[0.9287886,0.000765269,0.061182298,0.00025740717,0.00014959289,0.00040170044,0.000067995694,0.000032917964,0.008354159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974976,0.001138327,0.000090080466,0.00040418166,0.00037051277,0.0004991503],"domain_scores_gemma":[0.9970993,0.0018147911,0.0002947803,0.00014744168,0.00033367577,0.000310038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032668593,0.0016704084,0.0021929303,0.0009479423,0.0016128086,0.0027432682,0.0040145903,0.0034389077,0.004939644],"category_scores_gemma":[0.005294213,0.0008051163,0.0015486608,0.001114226,0.0024941603,0.0047625327,0.0019171769,0.002530139,0.0004832496],"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.00024253524,0.00025122048,0.0008808426,0.0002189686,0.00013776569,0.0008303716,0.00039498034,0.50666046,0.004747713,0.46758002,0.0029654438,0.015089697],"study_design_scores_gemma":[0.00006993315,0.000092702416,0.00010856454,0.000016244965,0.000036152396,0.00013658339,0.00007875149,0.918816,0.00042388742,0.078550905,0.0016365353,0.000033858254],"about_ca_topic_score_codex":0.004536041,"about_ca_topic_score_gemma":0.0028835216,"teacher_disagreement_score":0.004939644,"about_ca_system_score_codex":0.0028132908,"about_ca_system_score_gemma":0.0029082834,"threshold_uncertainty_score":0.020411968},"labels":[],"label_agreement":null},{"id":"W2783853749","doi":"10.1109/access.2017.2783120","title":"IEEE Access Special Section Editorial: Future Networks: Architectures, Protocols, and Applications","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","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; Cloud computing; Information-centric networking; Computer network; Architecture; Special section; Wireless network; Focus (optics); Data access; Host (biology); Wireless; Telecommunications; World Wide Web; The Internet; Engineering","score_opus":0.030126892735265906,"score_gpt":0.32521522277207804,"score_spread":0.2950883300368121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783853749","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007810625,0.0049558114,0.00041059675,0.026302513,0.9646722,0.000027063088,0.000059021375,0.00010953226,0.003385113],"genre_scores_gemma":[0.00055485475,0.00479245,0.00016939203,0.0104441345,0.9762423,0.000017621738,0.000038755054,0.000031462296,0.007708929],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736387,0.00033662518,0.00035668426,0.0004183449,0.0012596964,0.00026474035],"domain_scores_gemma":[0.98426753,0.0046216054,0.0009793018,0.00056580635,0.0073479046,0.0022178798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034017118,0.0025174231,0.003102893,0.0022361097,0.0020834405,0.0070021236,0.0031772947,0.011797428,0.018654782],"category_scores_gemma":[0.011187808,0.0009470031,0.0022006482,0.0016798434,0.0027744186,0.003954359,0.0010270248,0.018828975,0.017197909],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000032435393,0.000024794059,0.00004755647,0.00020004349,0.000015383637,0.000108173575,0.000009509888,0.000059796297,0.00011065692,0.0006467532,0.9892999,0.009444981],"study_design_scores_gemma":[0.000020256295,0.000041432417,0.00024294402,0.00022839113,0.000030839652,0.00030052298,0.000028424642,0.00023423914,0.00014931704,0.0011638864,0.9975426,0.00001723708],"about_ca_topic_score_codex":0.00096455176,"about_ca_topic_score_gemma":0.0018542794,"teacher_disagreement_score":0.018654782,"about_ca_system_score_codex":0.0018989742,"about_ca_system_score_gemma":0.0017344796,"threshold_uncertainty_score":0.06240648},"labels":[],"label_agreement":null},{"id":"W2784652038","doi":"10.1007/978-3-319-74439-1_15","title":"Caching and Computing at the Edge for Mobile Augmented Reality and Virtual Reality (AR/VR) in 5G","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Backhaul (telecommunications); Augmented reality; Computer network; Mobile edge computing; Cellular network; Wireless network; Bottleneck; Radio access network; Server; Cloud computing; Mobile broadband; Mobile computing; Quality of experience; Edge computing; Wireless; Enhanced Data Rates for GSM Evolution; Quality of service; Telecommunications; Human–computer interaction; Mobile station; Base station; Embedded system","score_opus":0.03086577486068195,"score_gpt":0.2612776000090855,"score_spread":0.23041182514840355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784652038","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.04483056,0.11682645,0.72591436,0.0051617366,0.0021230553,0.00013005799,0.00052662037,0.0039845346,0.10050261],"genre_scores_gemma":[0.6874329,0.05433066,0.1870416,0.0014482915,0.0011212676,0.00010917019,0.0006625117,0.0009544428,0.06689917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.00020309341,0.000044828314,0.00010570053,0.00019738515,0.00013929696],"domain_scores_gemma":[0.9989712,0.0004933327,0.000040428342,0.0002736357,0.00017021388,0.000051231233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070337934,0.0012785261,0.0010156715,0.00074820407,0.0009285069,0.0042254315,0.0020528038,0.0014253998,0.011268023],"category_scores_gemma":[0.0020239651,0.00065591856,0.0005146344,0.0023946967,0.0011170582,0.005512985,0.0017385771,0.0018454399,0.0021110384],"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.0004101187,0.00009378615,0.00090359803,0.0008095151,0.000100995756,0.00050033606,0.0007321057,0.029501315,0.013852018,0.4329324,0.077433124,0.44273064],"study_design_scores_gemma":[0.000043656015,0.0003038929,0.0013695665,0.0008708713,0.00029855728,0.0027406919,0.0008814054,0.3952254,0.023691453,0.21600707,0.35835737,0.00021003986],"about_ca_topic_score_codex":0.0065915138,"about_ca_topic_score_gemma":0.010596569,"teacher_disagreement_score":0.011268023,"about_ca_system_score_codex":0.001954327,"about_ca_system_score_gemma":0.0009994627,"threshold_uncertainty_score":0.03769529},"labels":[],"label_agreement":null},{"id":"W2785313737","doi":"10.1109/pimrc.2017.8292229","title":"A distance-based interest forwarding protocol for vehicular information-centric networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":36,"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 Ottawa","funders":"","keywords":"Computer science; Computer network; Network packet; Broadcast radiation; Vehicular ad hoc network; Information-centric networking; Protocol (science); Forwarder; Routing protocol; Wireless ad hoc network; Wireless; Telecommunications; Cache","score_opus":0.042555249047423305,"score_gpt":0.2889885475986695,"score_spread":0.24643329855124618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785313737","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.01829325,0.001190168,0.9732949,0.00040681523,0.0002820574,0.0003386211,0.00015117643,0.00078612054,0.0052568945],"genre_scores_gemma":[0.70265126,0.0015877364,0.28521445,0.00032421577,0.00015542207,0.00069975655,0.00087960355,0.000073085765,0.008414378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994863,0.00011062004,0.000064572676,0.00006672206,0.00021306086,0.0000586425],"domain_scores_gemma":[0.99911195,0.00030376675,0.00011522594,0.0001318141,0.00028942752,0.000047880334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877764,0.0004255796,0.0005149318,0.00090358616,0.0008278314,0.0007739603,0.0013784316,0.0006416016,0.0008137368],"category_scores_gemma":[0.0023549362,0.00020874213,0.0003754649,0.00079766393,0.0004594298,0.0013444492,0.0012901803,0.0007800455,0.0002892044],"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.00055080175,0.00027527587,0.0019213653,0.0005431956,0.00016341014,0.00094811997,0.0008320539,0.1538145,0.06778538,0.23201689,0.0144967,0.5266523],"study_design_scores_gemma":[0.00013340484,0.0005752763,0.0007926527,0.00006800469,0.00016528109,0.0010553097,0.00019921461,0.85295206,0.029606314,0.046455916,0.06786604,0.00013051451],"about_ca_topic_score_codex":0.0028975687,"about_ca_topic_score_gemma":0.0031873249,"teacher_disagreement_score":0.0028975687,"about_ca_system_score_codex":0.0009401445,"about_ca_system_score_gemma":0.0011372474,"threshold_uncertainty_score":0.0068212748},"labels":[],"label_agreement":null},{"id":"W2785771072","doi":"10.1109/vtcfall.2017.8288091","title":"Cache Placement Solutions in Software-Defined Radio Access Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Cache; Computer network; Network packet; Throughput; Cache algorithms; CPU cache; Wireless; Operating system","score_opus":0.05923149954847326,"score_gpt":0.28245740592840984,"score_spread":0.22322590637993658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785771072","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.011968218,0.0008754319,0.98512506,0.000194916,0.000043716067,0.00004880444,0.00002302065,0.00028069055,0.0014401065],"genre_scores_gemma":[0.4728392,0.0011887529,0.52269584,0.00013531589,0.000098351884,0.00020991941,0.00012669321,0.00010357254,0.0026023106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991937,0.00032558094,0.00003599845,0.00010103934,0.00025194627,0.000091748356],"domain_scores_gemma":[0.9985636,0.00089982845,0.00014380847,0.000121389916,0.00022924843,0.000042188545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095142913,0.00080923253,0.00079651666,0.0006663193,0.0007480704,0.0011176952,0.0014724307,0.0011182358,0.0012341106],"category_scores_gemma":[0.0033470353,0.0004986635,0.00033306342,0.0010692715,0.0005851358,0.0013417138,0.0010524046,0.0009819734,0.00030273027],"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.00007776972,0.00006792595,0.00036844847,0.00017861526,0.000039169754,0.000081559585,0.00009682891,0.85814565,0.0041753156,0.035524726,0.0021151577,0.09912891],"study_design_scores_gemma":[0.00001429092,0.00003614922,0.00005369739,0.000011286627,0.000007648983,0.000036570695,0.000026889322,0.98278123,0.001234705,0.014456917,0.0013342369,0.0000063281036],"about_ca_topic_score_codex":0.0026451151,"about_ca_topic_score_gemma":0.0031312853,"teacher_disagreement_score":0.0026451151,"about_ca_system_score_codex":0.0013073065,"about_ca_system_score_gemma":0.0011879806,"threshold_uncertainty_score":0.009485245},"labels":[],"label_agreement":null},{"id":"W2785976574","doi":"10.1109/vtcfall.2017.8288092","title":"Content Caching for Heterogeneous Small-Cell Networks with Intelligent Content Access","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Cache; Base station; Small cell; Computer network; False sharing; Macro; Quality of service; Distributed computing; Algorithm; CPU cache; Cache algorithms","score_opus":0.15188922588072504,"score_gpt":0.2816167875034726,"score_spread":0.12972756162274754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785976574","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.23520201,0.0013574905,0.75956535,0.00033061192,0.00004783172,0.00009152647,0.000107849475,0.0004131526,0.0028841614],"genre_scores_gemma":[0.9665141,0.0003178472,0.03217099,0.000040112092,0.000025201025,0.00003177007,0.0000854103,0.000016679847,0.0007979092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996674,0.00011107376,0.000014283039,0.000053433112,0.000083347564,0.00007049264],"domain_scores_gemma":[0.99898404,0.00055701315,0.00011191065,0.00011400096,0.00018480392,0.00004812717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055569946,0.00045409403,0.0006933556,0.0004766715,0.00056804507,0.00094702246,0.0010107096,0.0006316412,0.0005486633],"category_scores_gemma":[0.0026361623,0.00021979322,0.00032058882,0.0009906103,0.00048510914,0.0012398727,0.000447156,0.00030978926,0.00010974871],"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.00017817327,0.000061388986,0.0023890252,0.00008458222,0.000057799556,0.00036442306,0.000064941494,0.9313919,0.009262944,0.012027803,0.0014061269,0.042710964],"study_design_scores_gemma":[0.0000050317126,0.000013392026,0.0001656113,0.0000013886134,0.000008639732,0.000021246757,0.000010204996,0.9974482,0.0006667694,0.0014667662,0.00019018292,0.0000025538536],"about_ca_topic_score_codex":0.012064033,"about_ca_topic_score_gemma":0.013005621,"teacher_disagreement_score":0.012064033,"about_ca_system_score_codex":0.0017114672,"about_ca_system_score_gemma":0.00078358734,"threshold_uncertainty_score":0.02398765},"labels":[],"label_agreement":null},{"id":"W2786879814","doi":"10.1109/vtcfall.2017.8288168","title":"Performance of Data Caching in Cloud Sensing","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Computer science; Cloud computing; Server; Energy consumption; Response time; Interval (graph theory); Reading (process); Wireless sensor network; Real-time computing; Cloud server; Energy (signal processing); Computer network; Distributed computing; Operating system; Engineering","score_opus":0.07795806802152244,"score_gpt":0.28901868638870654,"score_spread":0.2110606183671841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786879814","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.98006904,0.001047429,0.016021607,0.00027290915,0.00004476546,0.000053424024,0.00014362989,0.00046662276,0.0018805078],"genre_scores_gemma":[0.9975278,0.00008438154,0.002101963,0.00002473612,0.000004523798,0.000007775894,0.00005629547,0.000015129008,0.00017739895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977368,0.00043691785,0.00014781044,0.00041847822,0.00065814896,0.0006018838],"domain_scores_gemma":[0.98915744,0.0065595927,0.00083252386,0.0010406728,0.0018569115,0.00055288424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002528273,0.0007261609,0.0010430253,0.00046794806,0.0010660345,0.0012828552,0.0012430187,0.0010577816,0.00067594403],"category_scores_gemma":[0.012624533,0.00033001992,0.00033741942,0.0010792207,0.0011382261,0.0014103255,0.00071753585,0.0005218185,0.0001410994],"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.0058997585,0.0006811416,0.030080564,0.0002914307,0.00021366376,0.00056736934,0.0002099574,0.8496302,0.06762648,0.004715582,0.0019949244,0.038089],"study_design_scores_gemma":[0.00005390163,0.000253122,0.004019566,0.000010314891,0.000033726083,0.00010625057,0.000059907812,0.9778364,0.016826488,0.0006276458,0.00015528606,0.000017466416],"about_ca_topic_score_codex":0.026797142,"about_ca_topic_score_gemma":0.011727008,"teacher_disagreement_score":0.026797142,"about_ca_system_score_codex":0.003230434,"about_ca_system_score_gemma":0.0028958335,"threshold_uncertainty_score":0.05328232},"labels":[],"label_agreement":null},{"id":"W2787041099","doi":"10.1109/pimrc.2017.8292548","title":"Joint coding for proactive caching with changing file popularities","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Base station; Cache; Linear network coding; Computer network; Scheme (mathematics); Coding (social sciences); Cellular network; Joint (building); Encoding (memory); Distributed computing; Mathematics","score_opus":0.05002886683281992,"score_gpt":0.24611878089436484,"score_spread":0.1960899140615449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787041099","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.09808849,0.000658701,0.8976923,0.00033287943,0.000052154,0.00004569388,0.00008994034,0.00026468612,0.002775222],"genre_scores_gemma":[0.9542698,0.00036811747,0.042935852,0.000085211155,0.00003128358,0.00006703658,0.00005840748,0.00002458731,0.0021597606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993901,0.00020141501,0.000023800154,0.00007356456,0.0001560521,0.00015498175],"domain_scores_gemma":[0.9959947,0.002692502,0.00033647913,0.00035523117,0.000523371,0.000097675256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010455124,0.00076101825,0.0005809142,0.0004858018,0.00048541487,0.00067321904,0.001161078,0.00066499144,0.0008737185],"category_scores_gemma":[0.0057512308,0.00026921928,0.0003778628,0.0009572402,0.0011809714,0.0012357562,0.0010493351,0.0007587434,0.00016732073],"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.0003085199,0.000078432284,0.0015970877,0.000111571855,0.000050718372,0.00032028597,0.0002820949,0.8344888,0.020199697,0.08304763,0.001587356,0.057927866],"study_design_scores_gemma":[0.000011232642,0.000042989122,0.00013566331,0.0000073076026,0.00001839247,0.00006828036,0.000024573967,0.9890003,0.0021762361,0.008171732,0.00032902032,0.000014188804],"about_ca_topic_score_codex":0.00622121,"about_ca_topic_score_gemma":0.008576005,"teacher_disagreement_score":0.00622121,"about_ca_system_score_codex":0.0012563159,"about_ca_system_score_gemma":0.0013115285,"threshold_uncertainty_score":0.01236999},"labels":[],"label_agreement":null},{"id":"W2787254525","doi":"10.1109/vtcfall.2017.8288104","title":"Keep Pets and Elephants Away: Dynamic Process Location Management in 5G Zoo","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"École de Technologie Supérieure; Université du Québec à Montréal; Ericsson (Canada)","funders":"","keywords":"Computer science; Latency (audio); Quality of service; Orchestration; Distributed computing; Minification; Wireless; Process (computing); Throughput; Wireless network; Computer network; Real-time computing; Operating system; Telecommunications","score_opus":0.010964228067595881,"score_gpt":0.2725398721213353,"score_spread":0.2615756440537394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787254525","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.10986077,0.0011311951,0.8801088,0.000893745,0.00014064793,0.00007907999,0.00005160163,0.00094160775,0.0067925164],"genre_scores_gemma":[0.9641751,0.00017434642,0.034006234,0.00007949783,0.00003387062,0.00001935539,0.000028561197,0.00001533771,0.0014676409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955636,0.00011534274,0.000022079586,0.00010948419,0.0000745619,0.00012220358],"domain_scores_gemma":[0.9996593,0.000089967645,0.000062832405,0.000075418364,0.00006534452,0.000047200654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000609713,0.00044400184,0.0005513666,0.0003053463,0.00086340716,0.0012179629,0.0011757677,0.00069589337,0.0010941979],"category_scores_gemma":[0.0011355446,0.00017571005,0.0002316067,0.0004541802,0.00048240623,0.0016362095,0.001188952,0.00047215447,0.0002682032],"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.0008270434,0.00022146193,0.0052458346,0.00016153786,0.000091835274,0.00087766873,0.00082801096,0.5295116,0.034489956,0.058267087,0.0070150783,0.3624629],"study_design_scores_gemma":[0.000032111548,0.00015728179,0.0006485069,0.000012976664,0.000036609155,0.00018363306,0.00019284173,0.9771161,0.006483103,0.010167779,0.004949231,0.000019867639],"about_ca_topic_score_codex":0.0032013722,"about_ca_topic_score_gemma":0.0046179397,"teacher_disagreement_score":0.0032013722,"about_ca_system_score_codex":0.00075419573,"about_ca_system_score_gemma":0.0009489151,"threshold_uncertainty_score":0.006365478},"labels":[],"label_agreement":null},{"id":"W2787857691","doi":"10.1109/vtcfall.2017.8288171","title":"A Study of Multicast Message Allocation for Content Distribution with Device-to-Device Communications","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Multicast; Computer science; Knapsack problem; Lagrangian relaxation; Cache; Computer network; Approximation algorithm; Greedy algorithm; Mathematical optimization; Polynomial-time approximation scheme; Base station; Heuristic; Wireless; Distributed computing; Algorithm; Mathematics","score_opus":0.14910310363245155,"score_gpt":0.33814111260546914,"score_spread":0.1890380089730176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787857691","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.067919225,0.0027838368,0.9159322,0.0012796475,0.00018626389,0.00020032981,0.000110987494,0.00012976656,0.01145774],"genre_scores_gemma":[0.85362345,0.0023473771,0.13876675,0.00023262425,0.00022672421,0.00019885361,0.00009049396,0.000072302224,0.0044414815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894947,0.0005351038,0.0000205721,0.0001374297,0.00017259177,0.00018490381],"domain_scores_gemma":[0.9974831,0.002019148,0.00017000506,0.000075163676,0.00016209377,0.00009048313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537953,0.00090191665,0.0011942094,0.00079104106,0.0008159979,0.0013598424,0.0015108753,0.0015481985,0.002495023],"category_scores_gemma":[0.005198065,0.0004716772,0.0007261172,0.0014611649,0.00090950564,0.0017382774,0.00075176836,0.00096583046,0.00016527539],"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.000105431005,0.0000882654,0.00043543955,0.00021630523,0.00004247879,0.00013130251,0.000069233145,0.940147,0.0023378893,0.03618795,0.0017569875,0.018481692],"study_design_scores_gemma":[0.000010490088,0.000051260013,0.0000960766,0.000008039701,0.0000122919055,0.000044738863,0.000026614578,0.994494,0.0004515807,0.003974957,0.00082563394,0.000004246786],"about_ca_topic_score_codex":0.0059441957,"about_ca_topic_score_gemma":0.0029704957,"teacher_disagreement_score":0.0059441957,"about_ca_system_score_codex":0.0025741372,"about_ca_system_score_gemma":0.001602452,"threshold_uncertainty_score":0.018676698},"labels":[],"label_agreement":null},{"id":"W2787874044","doi":"10.1109/pimrc.2017.8292662","title":"Towards efficient monitoring in a sensor cloud","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Reading (process); Class (philosophy); Wireless sensor network; Operationalization; Reduction (mathematics); Energy consumption; Real-time computing; Distributed computing; Computer network; Operating system; Artificial intelligence; Engineering","score_opus":0.0349007564768533,"score_gpt":0.27386929365098545,"score_spread":0.23896853717413213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787874044","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.08981831,0.001038585,0.90194225,0.0019980473,0.00010232943,0.00014744772,0.00006792379,0.00084434514,0.004040669],"genre_scores_gemma":[0.79068464,0.0008965993,0.20561603,0.00027802435,0.000097511525,0.00007595589,0.00006831797,0.00008977607,0.0021931801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987149,0.00035279663,0.00006583535,0.00019216338,0.00042830757,0.00024594553],"domain_scores_gemma":[0.9981263,0.0007074825,0.0002071525,0.00042990549,0.00037446135,0.00015465547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001910175,0.00044826834,0.0009834906,0.00033057225,0.00076150213,0.0023548354,0.001899729,0.0010071486,0.0008196403],"category_scores_gemma":[0.003741071,0.0003923255,0.0003500708,0.00095872045,0.00082623755,0.0032385576,0.0018905795,0.001245654,0.00031811843],"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.0007912009,0.00047546154,0.0043186345,0.00031831968,0.00009174751,0.00063697307,0.0004984094,0.6032406,0.08484762,0.16474386,0.006993329,0.13304384],"study_design_scores_gemma":[0.000019329287,0.000036456164,0.000267567,0.000009068834,0.000013124957,0.000066530636,0.000090080524,0.9719087,0.007047639,0.017861968,0.0026723382,0.0000071849863],"about_ca_topic_score_codex":0.004065451,"about_ca_topic_score_gemma":0.0028317377,"teacher_disagreement_score":0.004065451,"about_ca_system_score_codex":0.0011204957,"about_ca_system_score_gemma":0.001770223,"threshold_uncertainty_score":0.010102093},"labels":[],"label_agreement":null},{"id":"W2789766054","doi":"10.1109/lcomm.2018.2810211","title":"Distributed Caching Enabled Peak Traffic Reduction in Ultra-Dense IoT Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Telecommunications link; Computer network; Scheduling (production processes); Cache; Reduction (mathematics); Transmission (telecommunications); Internet of Things; Wireless network; Distributed computing; Wireless; Real-time computing; Embedded system","score_opus":0.024575150984852082,"score_gpt":0.24983360906833982,"score_spread":0.22525845808348774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789766054","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.3025054,0.0006657771,0.69282645,0.0002030272,0.000046643156,0.000026780108,0.000050783667,0.00045963682,0.0032154906],"genre_scores_gemma":[0.9850095,0.000105416875,0.014545435,0.000023711527,0.000007775922,0.000007878754,0.000019456118,0.000011348134,0.00026949964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998259,0.000047999158,0.0000059701947,0.000024371184,0.000050748007,0.000045003315],"domain_scores_gemma":[0.9995995,0.000180593,0.000046466805,0.000052388423,0.00009224904,0.000028823566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031486424,0.00029679068,0.0005014175,0.00021035149,0.00031602356,0.0004509017,0.0007191175,0.000308646,0.00032617289],"category_scores_gemma":[0.00084454217,0.0001412658,0.00016751052,0.0004505,0.0003022259,0.0006259961,0.0003835877,0.00033045598,0.00006672486],"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.00027885666,0.00013917878,0.0027642718,0.000091500006,0.000033112126,0.00031504282,0.00011173329,0.8456746,0.055374578,0.01912999,0.0018189541,0.07426823],"study_design_scores_gemma":[0.0000030720348,0.00002046072,0.00018542747,0.0000016186635,0.0000036719684,0.000026973017,0.000014967299,0.99523664,0.0026936696,0.0016172341,0.00019308513,0.0000030712702],"about_ca_topic_score_codex":0.0026028783,"about_ca_topic_score_gemma":0.0038574245,"teacher_disagreement_score":0.0026028783,"about_ca_system_score_codex":0.00064481294,"about_ca_system_score_gemma":0.00062605605,"threshold_uncertainty_score":0.0051754713},"labels":[],"label_agreement":null},{"id":"W2791006513","doi":"10.1109/ccnc.2018.8319230","title":"Multimedia streaming using D2D in 5G ultra dense networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Multimedia; Computer network","score_opus":0.023472374780032654,"score_gpt":0.24607222048135322,"score_spread":0.22259984570132058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791006513","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.25425535,0.013606554,0.7072013,0.0011786483,0.00034242152,0.00022832827,0.000376926,0.0013762368,0.02143425],"genre_scores_gemma":[0.95339274,0.0028149541,0.042123653,0.00011891782,0.000067112174,0.00004345789,0.00013608341,0.000016136071,0.001286983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998029,0.000067917725,0.000011052668,0.000034044417,0.000050568862,0.00003358489],"domain_scores_gemma":[0.99970466,0.00014026812,0.00003067651,0.000038405105,0.000064190404,0.00002175863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003775596,0.00046083383,0.00037259434,0.00046166923,0.0006501544,0.000658505,0.00059409905,0.00038337454,0.0008166607],"category_scores_gemma":[0.00067526405,0.00015211583,0.00016473918,0.00092324615,0.00035046416,0.0007670869,0.0004828106,0.00032416562,0.00014275682],"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.0007521335,0.0001926153,0.005502411,0.0007955311,0.00011424057,0.00089895615,0.00034853586,0.4313847,0.06947174,0.047250208,0.011884285,0.43140456],"study_design_scores_gemma":[0.000037816128,0.00020550325,0.0011184297,0.00002980271,0.0000453112,0.00034555962,0.0001741331,0.96685946,0.011981744,0.009739334,0.009436806,0.000026089605],"about_ca_topic_score_codex":0.0053498135,"about_ca_topic_score_gemma":0.005732363,"teacher_disagreement_score":0.0053498135,"about_ca_system_score_codex":0.00075777224,"about_ca_system_score_gemma":0.00048203304,"threshold_uncertainty_score":0.010637343},"labels":[],"label_agreement":null},{"id":"W2791811651","doi":"10.1002/spy2.16","title":"DADI: Defending against distributed denial of service in information‐centric networking routing and caching","year":2018,"lang":"en","type":"article","venue":"Security and Privacy","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Denial-of-service attack; Computer science; Computer network; Cache; The Internet; Routing (electronic design automation); Routing protocol; Computer security; Application layer DDoS attack; World Wide Web","score_opus":0.012743624273048135,"score_gpt":0.2218341155108205,"score_spread":0.20909049123777235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791811651","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.2201169,0.004925958,0.73689526,0.0014878473,0.0005095231,0.00069800805,0.00038601746,0.018490333,0.016490128],"genre_scores_gemma":[0.850845,0.0007511168,0.14322363,0.00037393943,0.00008562538,0.00017237966,0.00045566162,0.00012178075,0.0039710556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984565,0.00031914725,0.00013062375,0.00021255128,0.00064450095,0.00023671883],"domain_scores_gemma":[0.9969874,0.00065949134,0.00041037984,0.0010471215,0.00062991376,0.00026575272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018747092,0.0008063437,0.0009506095,0.0013739838,0.0011539985,0.0018798618,0.0022469182,0.0011216331,0.0007854638],"category_scores_gemma":[0.0041454877,0.00030258024,0.00041567365,0.00082602305,0.0007458765,0.0017138036,0.0017309305,0.0009736486,0.00031599554],"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.0017620329,0.0013280192,0.02671768,0.0007708282,0.00051434047,0.0005361281,0.00058325886,0.15765457,0.14088787,0.0551297,0.025106061,0.5890095],"study_design_scores_gemma":[0.0001599944,0.0006612505,0.004344006,0.000057900168,0.0001861608,0.0006587724,0.00019791369,0.8653239,0.091143616,0.009751734,0.027410608,0.000104205894],"about_ca_topic_score_codex":0.003014879,"about_ca_topic_score_gemma":0.0027828484,"teacher_disagreement_score":0.003014879,"about_ca_system_score_codex":0.001376117,"about_ca_system_score_gemma":0.0020048756,"threshold_uncertainty_score":0.009984493},"labels":[],"label_agreement":null},{"id":"W2791890302","doi":"10.1109/tvt.2018.2817210","title":"Cache-Enabled Adaptive Video Streaming Over Vehicular Networks: A Dynamic Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":80,"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 British Columbia; Carleton University","funders":"","keywords":"Computer science; Cache; Computer network; Backhaul (telecommunications); Real-time computing; Video quality; Base station; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.009455320865318804,"score_gpt":0.21663251752511364,"score_spread":0.20717719665979484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791890302","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.08169177,0.0010961505,0.91380864,0.00022773111,0.000050840586,0.00003998115,0.00003670399,0.00022734163,0.002820804],"genre_scores_gemma":[0.9733568,0.00034487364,0.025436739,0.000032987864,0.000021149799,0.00002176588,0.000027775073,0.000018367624,0.00073954323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972254,0.00006596,0.00001318214,0.000054984914,0.00008316144,0.00006008757],"domain_scores_gemma":[0.9995049,0.00019677033,0.00007276386,0.00004266119,0.00013340506,0.000049415976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045900568,0.00055251183,0.0006260954,0.0004465696,0.0003604902,0.00063964754,0.0011383427,0.00046521708,0.00037252653],"category_scores_gemma":[0.0011340097,0.00022318728,0.00028937735,0.00052118924,0.00041169047,0.00077333517,0.0005707981,0.00052009796,0.000065563036],"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.000084621075,0.00004150221,0.00078674784,0.000052657397,0.000035737925,0.000100012745,0.000051812105,0.9432507,0.008350898,0.010709566,0.00042311448,0.036112595],"study_design_scores_gemma":[0.0000028007566,0.000021166408,0.00007550035,0.0000017838145,0.0000051981337,0.000019370778,0.000010380244,0.997983,0.0004919099,0.0011917847,0.00019343689,0.0000036751198],"about_ca_topic_score_codex":0.0058150394,"about_ca_topic_score_gemma":0.0063592843,"teacher_disagreement_score":0.0058150394,"about_ca_system_score_codex":0.0008470434,"about_ca_system_score_gemma":0.0008894323,"threshold_uncertainty_score":0.011562347},"labels":[],"label_agreement":null},{"id":"W2792354310","doi":"10.1109/lcomm.2018.2804928","title":"An Optimal Real-Time Distributed Algorithm for Utility Maximization of Mobile Ad Hoc Cloud","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Wireless ad hoc network; Utility maximization; Distributed computing; Mobile ad hoc network; Maximization; Algorithm; Computer network; Wireless; Mathematical optimization; Telecommunications; Mathematics; Operating system","score_opus":0.025658116954062952,"score_gpt":0.28064813046438725,"score_spread":0.2549900135103243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792354310","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.011808349,0.00030465695,0.98597336,0.0001863281,0.000042466112,0.000051028735,0.000013506937,0.00010233216,0.0015179677],"genre_scores_gemma":[0.7150064,0.00032954084,0.28206864,0.00012586168,0.000059845243,0.00015448112,0.000045495006,0.0000563124,0.0021534595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999275,0.00027682318,0.000029880655,0.00014075299,0.00013087767,0.0001466332],"domain_scores_gemma":[0.99927694,0.00042135204,0.00006302125,0.000055861958,0.00012378965,0.000059021408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012102103,0.0008198942,0.0011180403,0.00037514357,0.0005744893,0.0009661544,0.001463643,0.0008704052,0.001469585],"category_scores_gemma":[0.0023915332,0.00031283614,0.00041114967,0.0008762814,0.00066012435,0.0011866721,0.00096245465,0.00097577524,0.00023383464],"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.000171093,0.00010413451,0.00040419443,0.00008138112,0.000036021025,0.000094797826,0.000080267644,0.918977,0.0026722413,0.027119704,0.0017755949,0.048483487],"study_design_scores_gemma":[0.000016992903,0.000014603717,0.00002040129,0.0000016865592,0.0000028532447,0.000014938619,0.000008342663,0.99660313,0.00021762204,0.002894872,0.00020216452,0.0000024604014],"about_ca_topic_score_codex":0.0027005917,"about_ca_topic_score_gemma":0.0022880014,"teacher_disagreement_score":0.0027005917,"about_ca_system_score_codex":0.0013051336,"about_ca_system_score_gemma":0.0014827593,"threshold_uncertainty_score":0.0094694495},"labels":[],"label_agreement":null},{"id":"W2792488777","doi":"10.1002/itl2.31","title":"Accuracy or delay? A game in detecting interest flooding attacks","year":2018,"lang":"en","type":"article","venue":"Internet Technology Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"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":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Flooding (psychology); Network packet; Computer network; Router; Computer security; Real-time computing","score_opus":0.034369380443686835,"score_gpt":0.27580047360710297,"score_spread":0.24143109316341613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792488777","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.40833846,0.0014992126,0.5671587,0.0056352853,0.00030816547,0.00027187885,0.00012182585,0.0009153703,0.015751086],"genre_scores_gemma":[0.9793124,0.000103975886,0.01953843,0.0001577516,0.00004356867,0.000025653919,0.000014482679,0.000025342059,0.00077832764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578696,0.0018272866,0.00022205566,0.00060602435,0.0010076185,0.0005500445],"domain_scores_gemma":[0.97385097,0.018930938,0.0022827731,0.0018354103,0.0021038337,0.0009961177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058644293,0.00074328657,0.000806791,0.0012647194,0.0011092526,0.0030226372,0.001621868,0.0017622522,0.0015135111],"category_scores_gemma":[0.035115242,0.00038656316,0.00031938503,0.0005754297,0.0019378295,0.0061087357,0.0020310818,0.0021454287,0.00025431515],"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.0029708778,0.0006577112,0.03905816,0.0003421359,0.000279158,0.0011835381,0.002036149,0.32805845,0.054420132,0.29623452,0.0075771976,0.26718193],"study_design_scores_gemma":[0.00005054616,0.00042771723,0.0022671989,0.000029070457,0.00006683391,0.00048255638,0.00032166453,0.9234514,0.010058755,0.06041004,0.002366786,0.00006738251],"about_ca_topic_score_codex":0.0023386367,"about_ca_topic_score_gemma":0.0014907754,"teacher_disagreement_score":0.0058644293,"about_ca_system_score_codex":0.0018829169,"about_ca_system_score_gemma":0.001060948,"threshold_uncertainty_score":0.031014442},"labels":[],"label_agreement":null},{"id":"W2792692675","doi":"10.1049/iet-com.2017.1093","title":"Enhanced Bloom filter utilisation scheme for string matching using a splitting approach","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Caching and Content Delivery","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":"Queen's University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bloom filter; Computer science; Bloom; Matching (statistics); Filter (signal processing); Scheme (mathematics); String (physics); Algorithm; Mathematical optimization; Mathematics; Statistics; Biology; Ecology; Mathematical analysis; Computer vision","score_opus":0.10986510650441123,"score_gpt":0.3213686138936641,"score_spread":0.2115035073892529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792692675","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.07033912,0.0007054755,0.9184554,0.00022828749,0.00009802766,0.00030487645,0.00023486838,0.0037155447,0.0059183827],"genre_scores_gemma":[0.47485787,0.00041606196,0.5135356,0.00025911783,0.00007557674,0.00027045206,0.00055745937,0.00012589009,0.009902011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987463,0.00023406594,0.00015408809,0.00016838552,0.00054955395,0.00014763481],"domain_scores_gemma":[0.99798703,0.0003914333,0.00014943884,0.0007099259,0.0006840987,0.00007814545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009768956,0.00053677394,0.00075009983,0.0017478424,0.0008466121,0.0011646304,0.0014586631,0.0008033717,0.0032265948],"category_scores_gemma":[0.0020450135,0.00030891184,0.0004673227,0.0021339355,0.00053219986,0.002744072,0.0012121104,0.00060487166,0.0013782267],"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.0013906591,0.00029280025,0.0030051046,0.00023937917,0.00011707905,0.00031116893,0.0004301595,0.019733205,0.221866,0.042424534,0.0067510377,0.7034388],"study_design_scores_gemma":[0.00021530171,0.0008279475,0.0020989857,0.000074884374,0.00016614395,0.0014922427,0.00020562443,0.65423673,0.26207075,0.02879099,0.04967616,0.00014423924],"about_ca_topic_score_codex":0.002813204,"about_ca_topic_score_gemma":0.0030302554,"teacher_disagreement_score":0.0032265948,"about_ca_system_score_codex":0.0014630313,"about_ca_system_score_gemma":0.0015523642,"threshold_uncertainty_score":0.010794103},"labels":[],"label_agreement":null},{"id":"W2793000811","doi":"10.4108/eai.15-1-2018.153566","title":"Secure ID-Based Routing for Data Communication in IoT","year":2017,"lang":"en","type":"article","venue":"EAI Endorsed Transactions on Internet of Things","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"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":"Institute for Information and Communications Technology Promotion; Fonds de Recherche du Québec - Santé; Ministry of Science, ICT and Future Planning","keywords":"Internet of Things; Computer science; Authentication (law); Scope (computer science); Computer security; Computer network; Authorization; Routing (electronic design automation); Wireless; Secure communication; The Internet; World Wide Web; Telecommunications; Encryption","score_opus":0.05137526173561943,"score_gpt":0.29623835008369925,"score_spread":0.24486308834807982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793000811","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.01329818,0.008729289,0.9374857,0.0028438915,0.0015717313,0.0004430254,0.00026090833,0.0017443066,0.033622935],"genre_scores_gemma":[0.53445584,0.011395564,0.42028552,0.0013179183,0.0005760156,0.0007036835,0.0013258869,0.00022512363,0.029714389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861383,0.00037875582,0.00012712408,0.00016973451,0.00060420163,0.00010640563],"domain_scores_gemma":[0.9990243,0.0002078984,0.000107593994,0.0002841775,0.0003327106,0.00004339101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008811,0.00043468166,0.0005057662,0.0010567683,0.0012328558,0.0016691397,0.0011130659,0.0009787476,0.0020069527],"category_scores_gemma":[0.0018544056,0.00029735087,0.0006491839,0.0012563153,0.0007712083,0.0022920107,0.0014087202,0.0014751928,0.0010933018],"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.00025880666,0.00023339046,0.002165447,0.001098415,0.00014616328,0.0007149977,0.0005900078,0.04467805,0.034708392,0.4701794,0.046858925,0.398368],"study_design_scores_gemma":[0.00010276235,0.00046884883,0.0014935908,0.0003832911,0.00014663213,0.0021880723,0.00043314308,0.39053625,0.03231813,0.25464106,0.317102,0.00018622343],"about_ca_topic_score_codex":0.0013298298,"about_ca_topic_score_gemma":0.0014120714,"teacher_disagreement_score":0.0020069527,"about_ca_system_score_codex":0.0012868599,"about_ca_system_score_gemma":0.0015456945,"threshold_uncertainty_score":0.009336889},"labels":[],"label_agreement":null},{"id":"W2793311175","doi":"10.1145/3164536","title":"Disk Prefetching Mechanisms for Increasing HTTP Streaming Video Server Throughput","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Server; Serialization; Operating system; Web server; Throughput; Real Time Streaming Protocol; Cache; Hypertext Transfer Protocol; Video server; File server; Computer network; The Internet","score_opus":0.06755542350674362,"score_gpt":0.3016723969552645,"score_spread":0.23411697344852087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793311175","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.7859477,0.0017697231,0.13309862,0.00036622578,0.00012156241,0.00024557125,0.0003719345,0.06918169,0.008897132],"genre_scores_gemma":[0.9462744,0.0002981862,0.050106686,0.00017933374,0.000078107354,0.00011356872,0.00040921543,0.00072807673,0.0018125138],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991812,0.00011781451,0.00009246388,0.00012370285,0.00033671164,0.00014813626],"domain_scores_gemma":[0.99728024,0.0006608985,0.00043288525,0.00081901165,0.000659743,0.0001472537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012318175,0.0011243364,0.0005676329,0.0012217723,0.00050478126,0.0009989837,0.0027124356,0.00043960422,0.0022339097],"category_scores_gemma":[0.004515589,0.0006943898,0.00036270486,0.0013179164,0.0005687678,0.0017638443,0.0013297201,0.00084936345,0.0007127373],"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.0025234506,0.0014032092,0.05406323,0.0011047072,0.00022835501,0.00061549107,0.00078379334,0.07511651,0.47388542,0.0073995176,0.015533443,0.36734292],"study_design_scores_gemma":[0.0005195271,0.0017203669,0.027404545,0.000085310574,0.0004188383,0.0006920989,0.0002757925,0.4793086,0.47317994,0.002904609,0.01330081,0.00018959442],"about_ca_topic_score_codex":0.0018793743,"about_ca_topic_score_gemma":0.0020451897,"teacher_disagreement_score":0.0027124356,"about_ca_system_score_codex":0.00082919485,"about_ca_system_score_gemma":0.0012937328,"threshold_uncertainty_score":0.0074732304},"labels":[],"label_agreement":null},{"id":"W2793413705","doi":"10.1007/978-3-319-78130-3_45","title":"Proactive Edge Caching Strategy Based on Mobility Prediction in Dense Small Cell Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Computer network; Distributed computing; Artificial intelligence","score_opus":0.025263061167989927,"score_gpt":0.21829250347336893,"score_spread":0.193029442305379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793413705","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.41896045,0.0059847883,0.5642278,0.00068877166,0.00030799131,0.00015004803,0.0003058934,0.0013955018,0.007978729],"genre_scores_gemma":[0.9883662,0.00037416798,0.010201594,0.000053107135,0.000042096664,0.00001534476,0.00006333099,0.000014883139,0.00086927327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.00007856874,0.000016780194,0.00006115771,0.0000840626,0.00010983358],"domain_scores_gemma":[0.9985384,0.00084427453,0.00009575888,0.000118743315,0.0003006509,0.00010228087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047440143,0.0005894223,0.0010724799,0.00054206117,0.0006076087,0.00096682704,0.0012149082,0.0005612827,0.00078325474],"category_scores_gemma":[0.002075408,0.00029398742,0.00021854817,0.00081277196,0.00041104853,0.0010588458,0.0006420715,0.000411875,0.00015520258],"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.001086981,0.00036518864,0.010523638,0.0002935977,0.00017843937,0.0007738984,0.00029737968,0.7017379,0.034640312,0.016840216,0.0095270015,0.22373551],"study_design_scores_gemma":[0.0000109164475,0.000056478482,0.0006653509,0.000006280871,0.000037762467,0.00010916026,0.000038560916,0.9955503,0.0014143339,0.0018111961,0.0002891898,0.0000105299505],"about_ca_topic_score_codex":0.006126566,"about_ca_topic_score_gemma":0.012168406,"teacher_disagreement_score":0.006126566,"about_ca_system_score_codex":0.00086718454,"about_ca_system_score_gemma":0.0008350859,"threshold_uncertainty_score":0.012181759},"labels":[],"label_agreement":null},{"id":"W2794305977","doi":"10.1109/mnet.2018.1700395","title":"Protocol Architectures for IoT Domains","year":2018,"lang":"en","type":"preprint","venue":"IEEE Network","topic":"Caching and Content Delivery","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":"Computer science; Scalability; Proxy (statistics); Computer network; Internet of Things; Cache; Energy consumption; Interconnection; Modular design; Distributed computing; Efficient energy use; Embedded system; Database; Operating system","score_opus":0.03334129681505626,"score_gpt":0.2947185330342564,"score_spread":0.2613772362192001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794305977","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.022697266,0.0017133424,0.9360383,0.0015111213,0.0005387344,0.0004920892,0.0002300813,0.0011406797,0.035638265],"genre_scores_gemma":[0.39449254,0.003528908,0.57388425,0.00079290435,0.0003075927,0.0014825489,0.0009540986,0.00027622306,0.024281021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904174,0.00024781495,0.00014585876,0.00014048575,0.00031432265,0.00010969991],"domain_scores_gemma":[0.99835384,0.00033065048,0.00015716422,0.00065311365,0.0004137049,0.00009156726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018212153,0.0005613527,0.00037040724,0.00072586193,0.0011714145,0.0029895,0.0014315124,0.0012454167,0.005071051],"category_scores_gemma":[0.0032994351,0.0004298167,0.00052532717,0.0011418136,0.0009115501,0.0046445876,0.002198352,0.0020108789,0.0015168873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00006014669,0.000053009455,0.00035090765,0.0002699866,0.00002782424,0.00013112035,0.00024243715,0.022405876,0.007571482,0.92869186,0.004538738,0.035656612],"study_design_scores_gemma":[0.00007853084,0.00016855192,0.0004703069,0.00023560286,0.00011717767,0.00054954254,0.00046879964,0.2538541,0.015773993,0.48378873,0.2444234,0.00007130198],"about_ca_topic_score_codex":0.0008150879,"about_ca_topic_score_gemma":0.0012985546,"teacher_disagreement_score":0.005071051,"about_ca_system_score_codex":0.0012508585,"about_ca_system_score_gemma":0.001080796,"threshold_uncertainty_score":0.016964316},"labels":[],"label_agreement":null},{"id":"W2796240652","doi":"10.1109/tit.2019.2946361","title":"Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base (topology); Cache; Cover (algebra); Coding (social sciences); Clique; Mathematical optimization; Set cover problem; Set (abstract data type); Base station; Time complexity; Algorithm; Parallel computing; Mathematics; Computer network","score_opus":0.010654967407908342,"score_gpt":0.2184766131450712,"score_spread":0.20782164573716286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796240652","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.1885298,0.00043181868,0.79019684,0.00083685084,0.000045363242,0.00021592776,0.00063394767,0.00032906563,0.01878039],"genre_scores_gemma":[0.89562297,0.0004953692,0.09731001,0.00014202937,0.00006237375,0.00025957506,0.000520983,0.0001914651,0.0053952606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923754,0.0001922027,0.000025075835,0.00012586942,0.00022026588,0.00019898586],"domain_scores_gemma":[0.9964223,0.0024299829,0.00038192575,0.00023680861,0.000358227,0.00017076395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010503978,0.0006962373,0.0010131708,0.000612971,0.00066757976,0.0017911232,0.0013263703,0.0013321006,0.004050512],"category_scores_gemma":[0.010109118,0.0005122247,0.00048690313,0.0011498963,0.0011627626,0.0016881204,0.0009912371,0.0008652981,0.00043217538],"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.00016548552,0.000064564105,0.00058384216,0.00012394588,0.000020873982,0.00015365938,0.000117207994,0.91805345,0.0043031555,0.062284734,0.0026215306,0.011507459],"study_design_scores_gemma":[0.000009178341,0.000020696241,0.00012364496,0.0000093094895,0.000004008531,0.000039562594,0.00002572181,0.98226285,0.0007749649,0.016342008,0.00038215768,0.0000059240556],"about_ca_topic_score_codex":0.0050050337,"about_ca_topic_score_gemma":0.0035155637,"teacher_disagreement_score":0.0050050337,"about_ca_system_score_codex":0.0032274965,"about_ca_system_score_gemma":0.002019034,"threshold_uncertainty_score":0.023417294},"labels":[],"label_agreement":null},{"id":"W2799906449","doi":"10.1016/j.comnet.2018.05.001","title":"Greedy Caching: An optimized content placement strategy for information-centric networks","year":2018,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cache; Latency (audio); Information-centric networking; Computer network; The Internet; Internet topology; Network topology; Download; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Distributed computing; Core network; Network performance; Operating system; Algorithm","score_opus":0.045879713052084284,"score_gpt":0.25050472081307035,"score_spread":0.20462500776098608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799906449","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.06907572,0.0012234235,0.91973263,0.0005504983,0.00032535437,0.00026306097,0.00039814314,0.004113257,0.004317945],"genre_scores_gemma":[0.7680325,0.0005184097,0.22727497,0.00020444566,0.00016692463,0.000115292234,0.0003503587,0.00028165107,0.0030554775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991196,0.00022093515,0.000040607196,0.00013034877,0.000257365,0.00023116937],"domain_scores_gemma":[0.99860066,0.000488299,0.00013181877,0.00029843795,0.00033609045,0.00014479533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090560183,0.0013939389,0.001846633,0.0012011474,0.0013020528,0.0015321691,0.0027437287,0.001328729,0.0022427838],"category_scores_gemma":[0.0033755118,0.0006169557,0.0004734924,0.0025522655,0.00074726954,0.0015213485,0.0013015623,0.00071119,0.0006977381],"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.0012664866,0.00030369742,0.0018027632,0.00019095319,0.00012544352,0.00024752266,0.00018523693,0.71256834,0.021213876,0.019749591,0.026262434,0.21608366],"study_design_scores_gemma":[0.000029738894,0.000054970595,0.00013083991,0.0000044836756,0.0000212558,0.000057433586,0.000025647681,0.9938127,0.0018066044,0.0033916454,0.00065276923,0.000011986837],"about_ca_topic_score_codex":0.013031697,"about_ca_topic_score_gemma":0.023935836,"teacher_disagreement_score":0.013031697,"about_ca_system_score_codex":0.0023805313,"about_ca_system_score_gemma":0.0034866384,"threshold_uncertainty_score":0.025911689},"labels":[],"label_agreement":null},{"id":"W2800544763","doi":"10.5539/mas.v12n5p128","title":"PPUSTMAN: Privacy-Aware PUblish/Subscribe IoT MVC Architecture Using Information Centric Networking","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Information-centric networking; Architecture; Publication; Computer network; Distributed computing; Database","score_opus":0.019564533115877605,"score_gpt":0.22546971736642069,"score_spread":0.20590518425054308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800544763","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.021615304,0.0004941247,0.9414322,0.0007425104,0.00032878545,0.00046705513,0.00034954163,0.017227883,0.017342601],"genre_scores_gemma":[0.6049312,0.00077036966,0.36679542,0.00093798246,0.00021345369,0.00050281524,0.0019003776,0.0006262942,0.023322029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992453,0.00011339355,0.000066590364,0.00016395628,0.00032471737,0.0000860866],"domain_scores_gemma":[0.9992349,0.00011920593,0.000059692014,0.00028979572,0.00021113631,0.00008529905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013106433,0.00042520912,0.0005566669,0.00052293786,0.0009412389,0.0029344175,0.0022088513,0.0009329684,0.0028523782],"category_scores_gemma":[0.0015365544,0.0003727704,0.00054645486,0.00060401356,0.0006819915,0.0026393372,0.0018344406,0.0012980743,0.0008854589],"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.0010134677,0.00073189,0.004062108,0.0007430392,0.0002970523,0.0018279807,0.0009891154,0.13313626,0.08076241,0.33605602,0.05835053,0.3820302],"study_design_scores_gemma":[0.00005985369,0.00020921176,0.0005293081,0.000035236375,0.00008865641,0.0005148428,0.00012453423,0.8712933,0.028899753,0.03910397,0.059064746,0.0000766341],"about_ca_topic_score_codex":0.0040619755,"about_ca_topic_score_gemma":0.0038420074,"teacher_disagreement_score":0.0040619755,"about_ca_system_score_codex":0.0010915004,"about_ca_system_score_gemma":0.0022972976,"threshold_uncertainty_score":0.009542167},"labels":[],"label_agreement":null},{"id":"W2804391341","doi":"10.1186/s13638-018-1138-x","title":"Network utility optimization-based joint user association and content placement in heterogeneous networks","year":2018,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science and Technology Planning Project; Special Fund of Chongqing Key Laboratory; Chongqing Municipal Education Commission; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Backhaul (telecommunications); Computer science; Cache; Subgradient method; Optimization problem; Lagrange multiplier; Mathematical optimization; Lagrangian relaxation; Heterogeneous network; Computer network; Quality of service; Convex optimization; Wireless network; Wireless; Base station; Algorithm; Regular polygon","score_opus":0.06073362375891907,"score_gpt":0.25557303235547546,"score_spread":0.1948394085965564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804391341","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.1093203,0.00068041024,0.8844898,0.00027537678,0.00003870178,0.00007348442,0.000059876216,0.00021311696,0.004848952],"genre_scores_gemma":[0.9566901,0.0003499049,0.04115964,0.000042473508,0.000015758873,0.00006649968,0.00005691329,0.00003300605,0.001585719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993218,0.00031074512,0.000018996907,0.000096396354,0.00010405065,0.00014817137],"domain_scores_gemma":[0.99933857,0.0003840959,0.00009281074,0.00003871171,0.00009749438,0.00004832346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011302098,0.0008436125,0.0011559707,0.00040351364,0.0004992278,0.0010038237,0.0008707212,0.0006448095,0.0007444921],"category_scores_gemma":[0.0020305908,0.00040068806,0.00053465436,0.0009633055,0.00080334337,0.0011927605,0.0009329159,0.0006310402,0.0001409379],"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.000041097283,0.00002419683,0.00030942712,0.00001694655,0.000009992335,0.000051449504,0.00001694012,0.9897199,0.0006893108,0.0035699347,0.00027352019,0.005277267],"study_design_scores_gemma":[0.0000025980755,0.000008777877,0.000051986495,8.1477015e-7,0.0000022340257,0.000005880062,0.0000064180213,0.9990004,0.00016384562,0.00069950946,0.000055849003,0.0000016332875],"about_ca_topic_score_codex":0.011147645,"about_ca_topic_score_gemma":0.0074567217,"teacher_disagreement_score":0.011147645,"about_ca_system_score_codex":0.0017612828,"about_ca_system_score_gemma":0.0013333135,"threshold_uncertainty_score":0.022165537},"labels":[],"label_agreement":null},{"id":"W2806446964","doi":"10.1109/jsac.2018.2844658","title":"Hierarchical Edge Caching in Device-to-Device Aided Mobile Networks: Modeling, Optimization, and Design","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":143,"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 British Columbia","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Cellular traffic; Computer network; Enhanced Data Rates for GSM Evolution; Cache; Network topology; Mobile device; Distributed computing; Cellular network; Mobile computing; Operating system; Telecommunications","score_opus":0.05401710974622137,"score_gpt":0.30357154807563136,"score_spread":0.24955443832941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806446964","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.06706128,0.0009950019,0.9248123,0.00039942798,0.000032548403,0.0001169063,0.00018225877,0.00027025642,0.006130061],"genre_scores_gemma":[0.94786906,0.00094269123,0.048473425,0.00007053038,0.00002668355,0.00016852592,0.00008868843,0.000036693662,0.00232369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957114,0.00016865018,0.000014742617,0.000065322,0.00008955927,0.00009050338],"domain_scores_gemma":[0.99932265,0.00040154267,0.00009882717,0.000041948104,0.000103800776,0.000031211082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953226,0.00071332004,0.0009027094,0.0005033318,0.00049308443,0.0010291032,0.0012146374,0.0011440329,0.0010527831],"category_scores_gemma":[0.0018705844,0.00043593277,0.0005332375,0.0008935601,0.0008125904,0.0009862572,0.00074934185,0.0005656794,0.00018209833],"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.000011829144,0.0000094183415,0.00031040335,0.000021851572,0.0000072650323,0.00002669234,0.000011945046,0.989972,0.0005112708,0.0065861368,0.00018821369,0.0023429862],"study_design_scores_gemma":[0.000001334902,0.000006239146,0.00004903838,0.0000014803888,0.0000033214412,0.000005394708,0.0000041398216,0.99854255,0.0000755491,0.0012089792,0.00010038501,0.0000015884707],"about_ca_topic_score_codex":0.010693031,"about_ca_topic_score_gemma":0.010988084,"teacher_disagreement_score":0.010693031,"about_ca_system_score_codex":0.0019733198,"about_ca_system_score_gemma":0.0013673044,"threshold_uncertainty_score":0.021261632},"labels":[],"label_agreement":null},{"id":"W2807588753","doi":"10.1109/access.2018.2845740","title":"Stochastic QoE-Aware Optimization in Cloud-Based Content Delivery Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Markov decision process; Mathematical optimization; Probabilistic logic; Optimization problem; Bandwidth (computing); Resource allocation; Markov process; Computational complexity theory; Quality of experience; Distributed computing; Linear programming; Quality of service; Algorithm; Computer network; Artificial intelligence","score_opus":0.052074197660517525,"score_gpt":0.270707057947191,"score_spread":0.2186328602866735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807588753","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.054433275,0.0006246778,0.9415535,0.00068577076,0.000069474656,0.00006155596,0.00009424462,0.00017108109,0.0023063428],"genre_scores_gemma":[0.95918304,0.0004314407,0.03852866,0.000108725006,0.000058968,0.00007495814,0.00006120006,0.0000489193,0.0015041028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887496,0.00047497504,0.00003614298,0.00017388252,0.00020860271,0.00023137586],"domain_scores_gemma":[0.99731845,0.002076851,0.00025158637,0.0000665891,0.00018553663,0.00010093688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016743443,0.00078705593,0.0014950202,0.00046500756,0.00059495436,0.001339489,0.0013452171,0.0010084555,0.00092972507],"category_scores_gemma":[0.0041907025,0.00067334995,0.0004980588,0.0010545754,0.0011329661,0.0012085474,0.0009967098,0.0009821118,0.00010609023],"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.000031957166,0.000018986033,0.0001522008,0.000021369422,0.000008876893,0.000026812517,0.000012093822,0.9883875,0.00041878564,0.007233735,0.00026416688,0.0034235208],"study_design_scores_gemma":[0.0000026771352,0.0000052651635,0.000038843973,0.0000010990095,0.0000012544132,0.0000036323963,0.0000027649814,0.9977944,0.000062941974,0.002042435,0.00004321234,0.0000014809848],"about_ca_topic_score_codex":0.010748636,"about_ca_topic_score_gemma":0.0064648003,"teacher_disagreement_score":0.010748636,"about_ca_system_score_codex":0.0027668786,"about_ca_system_score_gemma":0.0018729629,"threshold_uncertainty_score":0.02137214},"labels":[],"label_agreement":null},{"id":"W2808068568","doi":"10.14778/3213880.3213884","title":"Morton filters","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Bloom filter; Computer science; Hash function; Filter (signal processing); Parallel computing; Set (abstract data type); Cache; Metadata; Data structure; Computer hardware; Algorithm; Operating system; Programming language","score_opus":0.010008721895973577,"score_gpt":0.20012860783806471,"score_spread":0.19011988594209114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808068568","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.0370978,0.0022807966,0.89570165,0.0017075536,0.00084359787,0.00058270036,0.0031324457,0.013194701,0.045458723],"genre_scores_gemma":[0.30549216,0.0019495974,0.6029725,0.0017852342,0.0009097256,0.0009598236,0.006063655,0.0016905337,0.078176886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687225,0.0003618011,0.00027098178,0.00047899075,0.0016488029,0.00036717055],"domain_scores_gemma":[0.99357444,0.0015590184,0.00040352778,0.0028584609,0.0014356092,0.00016892485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020585114,0.00083008147,0.0012511333,0.0023243532,0.0017157438,0.003463093,0.0026314235,0.0016092162,0.023649668],"category_scores_gemma":[0.010924239,0.00065636286,0.0010320079,0.0027191201,0.0013301763,0.0064389165,0.0030331698,0.0014306982,0.009019312],"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.0015480997,0.00024030452,0.0027694728,0.00057900633,0.000119937264,0.00023472155,0.00054311904,0.023036659,0.021110635,0.30149442,0.07544649,0.57287705],"study_design_scores_gemma":[0.00025476934,0.00069266505,0.001270368,0.0003038435,0.00014329368,0.0010936942,0.0005057782,0.26138753,0.086107284,0.24097511,0.40707472,0.00019097346],"about_ca_topic_score_codex":0.0034368313,"about_ca_topic_score_gemma":0.0051608593,"teacher_disagreement_score":0.023649668,"about_ca_system_score_codex":0.0025204879,"about_ca_system_score_gemma":0.0024968404,"threshold_uncertainty_score":0.07911599},"labels":[],"label_agreement":null},{"id":"W2808454856","doi":"10.1109/icdcs.2018.00049","title":"Speeding Up Multi-CDN Content Delivery via Traffic Demand Reshaping","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Content delivery; Multihoming; Content delivery network; Computer science; Computer network; Latency (audio); Peering; Content distribution; Server; Delivery Performance; The Internet; Telecommunications; World Wide Web; Business","score_opus":0.09742156189527564,"score_gpt":0.26333262560642706,"score_spread":0.16591106371115144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808454856","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.18627198,0.0006007466,0.80116826,0.0005796441,0.00022041718,0.00020176893,0.00019530022,0.0030445808,0.007717356],"genre_scores_gemma":[0.869142,0.00017609549,0.12834597,0.0001417932,0.00005873744,0.000058665843,0.00019782265,0.00011471786,0.0017641244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994374,0.00013107482,0.000024221696,0.00011309295,0.00013943012,0.00015488711],"domain_scores_gemma":[0.9988783,0.00035767394,0.00015431672,0.0002099608,0.00029993517,0.00009975758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248794,0.00075029075,0.00062628253,0.00087771413,0.00089808786,0.0008962214,0.0011659036,0.00067481154,0.0016900806],"category_scores_gemma":[0.0021615783,0.0002973843,0.00036455307,0.00086091703,0.00041895622,0.0014544396,0.0013983626,0.0007859872,0.00057326275],"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.00061183824,0.00047218992,0.0033266037,0.00019308896,0.0000725721,0.00045026097,0.00037772997,0.52227384,0.091126025,0.008758146,0.010085675,0.36225206],"study_design_scores_gemma":[0.000015336032,0.00007121258,0.0004951517,0.0000060499983,0.000011209536,0.00011169386,0.00008717055,0.9871278,0.0072911386,0.0021843002,0.0025856444,0.00001319313],"about_ca_topic_score_codex":0.0047590784,"about_ca_topic_score_gemma":0.0051478464,"teacher_disagreement_score":0.0047590784,"about_ca_system_score_codex":0.00083686906,"about_ca_system_score_gemma":0.00096380664,"threshold_uncertainty_score":0.009462774},"labels":[],"label_agreement":null},{"id":"W2810219908","doi":"10.14778/3358701.3358704","title":"Online density bursting subgraph detection from temporal graphs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Scalability; Duration (music); Bounded function; Indecomposable module; Set (abstract data type); Burstiness; Combinatorics; Mathematics; Network packet; Computer network","score_opus":0.010226559624712495,"score_gpt":0.19241496182112253,"score_spread":0.18218840219641003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810219908","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.28442642,0.0012122801,0.7045707,0.0004875454,0.00005218476,0.0001710247,0.0030249483,0.0038638778,0.0021910323],"genre_scores_gemma":[0.80374235,0.0005378391,0.1882124,0.00016470515,0.000067570756,0.000111499096,0.0049309377,0.00022784043,0.0020048574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00007283796,0.00003032249,0.00015678733,0.00014728762,0.00007249284],"domain_scores_gemma":[0.9978453,0.00096782326,0.0003691029,0.00031775446,0.0003218547,0.00017807931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824087,0.0006886711,0.00078063895,0.0026825236,0.00049565407,0.00085008924,0.0010900052,0.00051932345,0.0007300569],"category_scores_gemma":[0.0039131637,0.0004239266,0.000573647,0.0024262236,0.00042117425,0.0013489685,0.0009329564,0.00056636834,0.00027828527],"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.00066246616,0.0002763878,0.05394806,0.00079802354,0.00034737156,0.0012528754,0.00077633164,0.3434278,0.060669053,0.022980016,0.017104138,0.49775746],"study_design_scores_gemma":[0.000014238803,0.000031594354,0.0037688992,0.000013162626,0.000031999014,0.00034948005,0.00014487928,0.9709434,0.0050608125,0.017647108,0.001980725,0.000013676305],"about_ca_topic_score_codex":0.010218556,"about_ca_topic_score_gemma":0.020783115,"teacher_disagreement_score":0.010218556,"about_ca_system_score_codex":0.0008115612,"about_ca_system_score_gemma":0.0007931787,"threshold_uncertainty_score":0.02031815},"labels":[],"label_agreement":null},{"id":"W2810303059","doi":"10.1109/mipr.2018.00023","title":"Game-Aware and SDN-Assisted Bandwidth Allocation for Data Center Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bandwidth allocation; Bandwidth (computing); Data center; Computer network; Center (category theory); Dynamic bandwidth allocation; Channel allocation schemes; Telecommunications; Wireless","score_opus":0.054709861477677604,"score_gpt":0.277212515175345,"score_spread":0.22250265369766742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810303059","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.041513648,0.00026368076,0.95614594,0.00016095609,0.000064655724,0.00007316831,0.000028630395,0.00022283397,0.0015265105],"genre_scores_gemma":[0.9367057,0.00013587624,0.0620981,0.000061171195,0.000026941918,0.00006011724,0.00003224049,0.000018956784,0.00086089957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995136,0.00018399791,0.000020539872,0.00007410899,0.00010896962,0.00009878876],"domain_scores_gemma":[0.9990977,0.00047269178,0.000088538596,0.00004778345,0.00019180283,0.00010158652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011081088,0.00050322525,0.00072138367,0.00042234742,0.00049149554,0.00070228585,0.0012909158,0.0004425731,0.00055520865],"category_scores_gemma":[0.0018673463,0.00023902277,0.0003704332,0.000393212,0.00070108654,0.0007560595,0.00060124794,0.0007078164,0.000062713785],"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.00013664456,0.0000892897,0.0009133138,0.00004253138,0.000035486653,0.00006053928,0.000055695447,0.9498226,0.0038071405,0.013135198,0.000658973,0.031242624],"study_design_scores_gemma":[0.0000020716461,0.000007188951,0.0000330652,7.854531e-7,0.000001756799,0.0000034162613,0.0000027121257,0.9984914,0.00022312596,0.0011462987,0.00008696314,0.0000012829795],"about_ca_topic_score_codex":0.009876404,"about_ca_topic_score_gemma":0.007809439,"teacher_disagreement_score":0.009876404,"about_ca_system_score_codex":0.0014577744,"about_ca_system_score_gemma":0.0013967695,"threshold_uncertainty_score":0.019637823},"labels":[],"label_agreement":null},{"id":"W2810614671","doi":"10.1109/tii.2018.2849984","title":"A Secure Content Caching Scheme for Disaster Backup in Fog Computing Enabled Mobile Social Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Server; Backup; Computer network; Mobile edge computing; Cloud computing; Edge computing; Encryption; Enhanced Data Rates for GSM Evolution; Reliability (semiconductor); Distributed computing; Operating system","score_opus":0.07805123800443294,"score_gpt":0.2745633072270414,"score_spread":0.1965120692226085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810614671","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.2087384,0.001404216,0.7810965,0.00064099696,0.00025958323,0.00031083278,0.00017728782,0.0008215613,0.006550624],"genre_scores_gemma":[0.96690136,0.00024392628,0.03154157,0.00008770843,0.000031145864,0.000045521545,0.000053547483,0.000014909983,0.0010803337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993637,0.00013403222,0.000045622914,0.00010262151,0.00019335291,0.00016070619],"domain_scores_gemma":[0.99918336,0.00013512232,0.00010951977,0.00020697257,0.00028886,0.000076188466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522187,0.0005041379,0.00083640154,0.00058529055,0.0015413939,0.00088415085,0.0012332515,0.00085653784,0.0007520707],"category_scores_gemma":[0.0014390601,0.0001864964,0.0006447911,0.00080036727,0.00073001796,0.0015979961,0.0010494667,0.00049671775,0.00020862692],"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.001859639,0.00047790213,0.006675718,0.00050162873,0.00035368928,0.002738847,0.001032693,0.3989519,0.13865955,0.16872104,0.019937264,0.26009017],"study_design_scores_gemma":[0.000051978794,0.00019596996,0.00069607,0.000019799721,0.00007605087,0.0005690287,0.00014234036,0.9703106,0.010897556,0.013108334,0.0038712607,0.000060950224],"about_ca_topic_score_codex":0.006697294,"about_ca_topic_score_gemma":0.007523089,"teacher_disagreement_score":0.006697294,"about_ca_system_score_codex":0.0016081057,"about_ca_system_score_gemma":0.00177866,"threshold_uncertainty_score":0.013316631},"labels":[],"label_agreement":null},{"id":"W2811068755","doi":"10.1002/ett.3461","title":"A user‐centric cooperative edge caching scheme for minimizing delay in 5G content delivery networks","year":2018,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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":"China Scholarship Council","keywords":"Computer science; Computer network; Base station; Cache; Provisioning; Leverage (statistics); Enhanced Data Rates for GSM Evolution; Scheme (mathematics); Bandwidth (computing); Content delivery; Content delivery network; Distributed computing; Server; Telecommunications","score_opus":0.040284126866729025,"score_gpt":0.273171321825179,"score_spread":0.23288719495844998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811068755","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.16975087,0.0009223642,0.8258615,0.00024282953,0.000060889623,0.00011056727,0.00006832678,0.00031815373,0.0026645507],"genre_scores_gemma":[0.9626587,0.00017324234,0.036173277,0.0000571121,0.000023691426,0.000036547455,0.000029916195,0.000011575782,0.0008358938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917185,0.0002696138,0.000039896204,0.00014719473,0.00018808241,0.00018340742],"domain_scores_gemma":[0.99882823,0.00041436194,0.00015931997,0.00018621543,0.0003174275,0.00009443033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097541785,0.00060419546,0.00089466776,0.00062302925,0.0008910138,0.0008174283,0.001962757,0.0010018946,0.0006868869],"category_scores_gemma":[0.0023896566,0.00023748532,0.00037653447,0.0011413101,0.00051024114,0.0011670747,0.0009776042,0.0003654231,0.00014319363],"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.0008610183,0.00030218792,0.0031591575,0.00022967179,0.00016203671,0.0005732135,0.00038361366,0.7489956,0.05136358,0.048817705,0.0047886157,0.14036362],"study_design_scores_gemma":[0.000013871153,0.00011802112,0.00019583572,0.0000050832987,0.000030160305,0.00011112336,0.000041642303,0.9923678,0.0034068443,0.002959878,0.00073742773,0.00001226724],"about_ca_topic_score_codex":0.0044136844,"about_ca_topic_score_gemma":0.0050737388,"teacher_disagreement_score":0.0044136844,"about_ca_system_score_codex":0.0014555799,"about_ca_system_score_gemma":0.0012140585,"threshold_uncertainty_score":0.010560989},"labels":[],"label_agreement":null},{"id":"W2811286101","doi":"10.1007/978-3-030-02738-4_7","title":"Reduced Transmission in Multi-server Coded Caching","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Server; Computer science; Computer network; Transmission (telecommunications); Scheme (mathematics); Telecommunications","score_opus":0.033751713742044706,"score_gpt":0.2611019808695779,"score_spread":0.2273502671275332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811286101","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.18290578,0.0033107037,0.78048575,0.0007569593,0.00052829063,0.00016271061,0.00042102335,0.0023817774,0.029047009],"genre_scores_gemma":[0.89270455,0.0008085617,0.09272796,0.00016809025,0.00013226901,0.00011216088,0.00023459994,0.00040384656,0.01270796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871814,0.0003521144,0.00004663359,0.00013702243,0.0004689621,0.0002771342],"domain_scores_gemma":[0.99527526,0.0027492852,0.00014023988,0.00097607076,0.00072282064,0.00013628781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873901,0.00084180414,0.0013217246,0.0006358818,0.00081867207,0.0019807364,0.0023318457,0.0011429279,0.0050216406],"category_scores_gemma":[0.006292364,0.0005242317,0.00039947176,0.0015919617,0.0010624876,0.0024586397,0.0012863525,0.0016218086,0.0006150124],"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.001600081,0.00039817163,0.0008088109,0.0006243457,0.0000839288,0.00044188436,0.00030990614,0.61329544,0.038418755,0.17762798,0.015436516,0.15095413],"study_design_scores_gemma":[0.000023558225,0.000045936045,0.00013725091,0.000019792944,0.000026674505,0.0001131346,0.000024050172,0.980316,0.003911849,0.014323175,0.0010401085,0.000018494678],"about_ca_topic_score_codex":0.0077167624,"about_ca_topic_score_gemma":0.008828612,"teacher_disagreement_score":0.0077167624,"about_ca_system_score_codex":0.0027926194,"about_ca_system_score_gemma":0.0025227785,"threshold_uncertainty_score":0.020262003},"labels":[],"label_agreement":null},{"id":"W2832447695","doi":"10.1142/s1793351x1840010x","title":"Towards Update-Efficient and Parallel-Friendly Content-Based Indexing Scheme in Cloud Computing","year":2018,"lang":"en","type":"article","venue":"International Journal of Semantic Computing","topic":"Caching and Content Delivery","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":"McMaster University; McGill University","funders":"","keywords":"Computer science; Search engine indexing; Metadata; Cloud computing; Information retrieval; Metadata management; Database; Distributed computing; Data mining; Operating system","score_opus":0.024537326216980748,"score_gpt":0.2752903597464074,"score_spread":0.2507530335294267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2832447695","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.1119373,0.0037069106,0.8681928,0.000491036,0.00027086592,0.00039706225,0.0004020685,0.00733673,0.0072652437],"genre_scores_gemma":[0.5483067,0.0009534185,0.44540122,0.00024506662,0.00015833249,0.00017438014,0.00088480813,0.0003117658,0.0035643573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991423,0.00009883986,0.00007247096,0.00010719414,0.00040750668,0.00017179635],"domain_scores_gemma":[0.9986664,0.00021207797,0.000115904106,0.00040445325,0.00050100597,0.00010018169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617318,0.0005427232,0.00081462896,0.0011268996,0.0011901224,0.00185061,0.002392852,0.0005327594,0.0019895781],"category_scores_gemma":[0.0021928719,0.00025655693,0.00039098648,0.003057959,0.000675849,0.0036969483,0.0011909804,0.0006991006,0.0010816942],"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.0015307893,0.00061068696,0.0069828797,0.0005818786,0.00011562931,0.0005571998,0.0006098003,0.063576035,0.13747731,0.05602306,0.034497943,0.6974368],"study_design_scores_gemma":[0.00017428386,0.00040857567,0.001739594,0.000044643843,0.00013160054,0.0008384215,0.00024807637,0.8630691,0.080577075,0.027834885,0.024816794,0.00011686101],"about_ca_topic_score_codex":0.007882488,"about_ca_topic_score_gemma":0.00688878,"teacher_disagreement_score":0.007882488,"about_ca_system_score_codex":0.0015497494,"about_ca_system_score_gemma":0.0031506123,"threshold_uncertainty_score":0.01567316},"labels":[],"label_agreement":null},{"id":"W2862647314","doi":"10.1109/infcomw.2018.8406921","title":"When more may not be better: Toward cost-efficient CDN selection","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Selection (genetic algorithm); Computer science; Content delivery; Footprint; Content delivery network; TRACE (psycholinguistics); Point (geometry); Computer network; Server; Artificial intelligence; Mathematics","score_opus":0.041622990563167955,"score_gpt":0.2676015213544068,"score_spread":0.22597853079123884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2862647314","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.34509426,0.0016053335,0.6284039,0.0053169075,0.00015820398,0.0005876021,0.00031300334,0.000985435,0.017535325],"genre_scores_gemma":[0.7567219,0.00030972494,0.24009706,0.00040051428,0.00007187506,0.00008812205,0.00013827537,0.00011533271,0.0020572322],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99663275,0.0014322734,0.00012458857,0.0005009491,0.00096118404,0.00034828717],"domain_scores_gemma":[0.9907127,0.004881011,0.0009186598,0.0009876183,0.0019767839,0.000523178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313666,0.0006806789,0.0008573311,0.0014559992,0.00147738,0.0028405397,0.0013307604,0.0012550182,0.0017619309],"category_scores_gemma":[0.018105252,0.00042729182,0.00020256024,0.0016705896,0.000837973,0.0037969728,0.0014450839,0.0010512302,0.00054581196],"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.0010454737,0.0007967271,0.03985493,0.0003688924,0.00014393337,0.0010972548,0.0013678698,0.17444368,0.045697175,0.063125014,0.01794326,0.6541158],"study_design_scores_gemma":[0.00013552695,0.0003080841,0.005283173,0.00008820908,0.00009245282,0.0008701322,0.0019620468,0.8940478,0.021243833,0.058370307,0.0175021,0.00009628041],"about_ca_topic_score_codex":0.0038579465,"about_ca_topic_score_gemma":0.007463889,"teacher_disagreement_score":0.004313666,"about_ca_system_score_codex":0.0015422975,"about_ca_system_score_gemma":0.0021561782,"threshold_uncertainty_score":0.022813082},"labels":[],"label_agreement":null},{"id":"W2867293403","doi":"10.1109/tcc.2018.2855160","title":"Risk-Averse Caching Policies for YouTube Content in Femtocell Networks using Density Forecasting","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Caching and Content Delivery","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 British Columbia","funders":"Army Research Office; Air Force Office of Scientific Research","keywords":"Femtocell; Computer science; CVAR; Cache; Computer network; Cumulative distribution function; Protocol (science); False sharing; CPU cache; Risk management; Probability density function; Expected shortfall; Base station; Cache algorithms; Statistics","score_opus":0.08930869046746939,"score_gpt":0.270856586316491,"score_spread":0.18154789584902162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2867293403","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.3256608,0.0011654827,0.66673994,0.00080408796,0.00007608593,0.00010278131,0.00017659561,0.00041773915,0.00485644],"genre_scores_gemma":[0.9824882,0.00023388796,0.01584885,0.00005742674,0.000016820864,0.000027057073,0.00006121609,0.000024240346,0.0012422672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.00012366501,0.000014657578,0.000075186595,0.000072523224,0.000117013464],"domain_scores_gemma":[0.99694294,0.0023213415,0.0002556541,0.000068667425,0.00030279465,0.00010854642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012292273,0.0006747346,0.00092326594,0.0004840029,0.00050641334,0.00089226867,0.0009061016,0.0008186322,0.00094334595],"category_scores_gemma":[0.0056017083,0.00042430463,0.00048218324,0.00052383257,0.0005697053,0.001355592,0.00061670115,0.00083040894,0.00009057686],"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.000019554,0.000011294399,0.00054817385,0.000008122584,0.000009012601,0.000028468625,0.000014119143,0.99296325,0.0002126985,0.00282732,0.00022837854,0.0031296532],"study_design_scores_gemma":[0.000001085057,0.000004058177,0.000060409802,0.0000010799407,0.0000023844532,0.0000032959472,0.000004894783,0.9990746,0.00006985886,0.00074428983,0.000031993175,0.0000019844044],"about_ca_topic_score_codex":0.04522036,"about_ca_topic_score_gemma":0.025578598,"teacher_disagreement_score":0.04522036,"about_ca_system_score_codex":0.0028976805,"about_ca_system_score_gemma":0.0014648784,"threshold_uncertainty_score":0.08991432},"labels":[],"label_agreement":null},{"id":"W2885702286","doi":"10.1186/s13638-018-1204-4","title":"Energy-efficient proactive edge caching with sleep scheduling for green networks","year":2018,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Computer science; Markov decision process; Cache; Energy consumption; Scheduling (production processes); Sleep mode; Enhanced Data Rates for GSM Evolution; Efficient energy use; Distributed computing; Computer network; Real-time computing; Mathematical optimization; Markov process; Artificial intelligence","score_opus":0.03272639557185773,"score_gpt":0.25759773497343513,"score_spread":0.22487133940157739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885702286","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.16456968,0.0011264011,0.8294821,0.00037418626,0.00008216176,0.00007065172,0.000105398525,0.00045650103,0.003732863],"genre_scores_gemma":[0.98030204,0.00016982738,0.01882538,0.000052267307,0.000010383968,0.000021663938,0.000034172084,0.000013705009,0.0005706629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997509,0.00006416332,0.00001036321,0.000041994987,0.00005046882,0.00008218903],"domain_scores_gemma":[0.9994708,0.00028352396,0.00006882093,0.000046587713,0.000083165716,0.000047078425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004920473,0.00047580758,0.00052423344,0.0002907363,0.00042522192,0.00060533243,0.00087775383,0.00039890115,0.00071097317],"category_scores_gemma":[0.0009994593,0.00020438098,0.00028598518,0.00038377018,0.00039680625,0.000751165,0.0005517814,0.000421678,0.000088087196],"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.00029119814,0.00016459303,0.0015802324,0.00008799072,0.00004512404,0.0001726551,0.00008615972,0.894673,0.015380219,0.02047159,0.002302,0.064745255],"study_design_scores_gemma":[0.000007411015,0.000023886187,0.00014721882,0.0000024131048,0.0000070257684,0.000014381075,0.000012521262,0.9954194,0.000945668,0.0032053469,0.00021091198,0.0000037698906],"about_ca_topic_score_codex":0.005756345,"about_ca_topic_score_gemma":0.01154277,"teacher_disagreement_score":0.005756345,"about_ca_system_score_codex":0.0009602061,"about_ca_system_score_gemma":0.0012487771,"threshold_uncertainty_score":0.011445701},"labels":[],"label_agreement":null},{"id":"W2885822698","doi":"10.1155/2018/1818690","title":"Transcoding Based Video Caching Systems: Model and Algorithm","year":2018,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Transcoding; Cache; Video quality; Video post-processing; Computer network; Server; Cellular network; Video processing; Redundancy (engineering); Video tracking; Real-time computing; Video compression picture types; Operating system; Computer hardware","score_opus":0.027148545463523296,"score_gpt":0.26581618269444274,"score_spread":0.23866763723091944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885822698","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.016174097,0.002902577,0.9686946,0.00071614655,0.00013186473,0.00017972554,0.00021859739,0.00044758755,0.010534798],"genre_scores_gemma":[0.8570699,0.003662382,0.12196152,0.0003698236,0.00016068833,0.00067960506,0.00043218123,0.00013050344,0.0155333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995283,0.000114518894,0.000022227276,0.00012503458,0.00010935371,0.0001004867],"domain_scores_gemma":[0.9980915,0.0011336557,0.0001732985,0.00006212462,0.00047932033,0.00005993161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082976505,0.0014528083,0.002007048,0.0008155665,0.0008890883,0.002198466,0.00271235,0.002791942,0.0042622294],"category_scores_gemma":[0.0032122936,0.0006540293,0.0008972833,0.0015332745,0.0010329399,0.0016187716,0.001262452,0.002171901,0.00081439456],"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.000045801433,0.000033970224,0.00049439154,0.000096861535,0.000024098767,0.00014510482,0.00006229184,0.9661145,0.00075112836,0.01645373,0.0018596599,0.0139183635],"study_design_scores_gemma":[0.000003836295,0.0000070352976,0.00002754788,0.0000047483823,0.0000049368487,0.000025080979,0.00000691434,0.9979662,0.0000654763,0.0017109044,0.000173777,0.000003599823],"about_ca_topic_score_codex":0.021959633,"about_ca_topic_score_gemma":0.01071295,"teacher_disagreement_score":0.021959633,"about_ca_system_score_codex":0.00249923,"about_ca_system_score_gemma":0.0016850558,"threshold_uncertainty_score":0.04366362},"labels":[],"label_agreement":null},{"id":"W2886170439","doi":"10.1109/icc.2018.8422100","title":"IoT Data Lifetime-Based Cooperative Caching Scheme for ICN-IoT Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Internet of Things; Energy consumption; Information-centric networking; Leverage (statistics); Efficient energy use; Scheme (mathematics); Sleep mode; Base station; Reduction (mathematics); Distributed computing; Cache; Embedded system; Power consumption","score_opus":0.05748084969683477,"score_gpt":0.29576407396314464,"score_spread":0.23828322426630988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886170439","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.19338565,0.0023087708,0.79420686,0.00038766445,0.000261661,0.00035790208,0.00018377893,0.0012879603,0.0076198704],"genre_scores_gemma":[0.9631658,0.0002652516,0.034942165,0.00009886174,0.00003743372,0.00008249776,0.000097597185,0.000021731856,0.0012886117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936396,0.00012249168,0.00006192173,0.0001348406,0.00017558793,0.00014120786],"domain_scores_gemma":[0.9977216,0.00047054875,0.0002908705,0.0005475591,0.00080995675,0.00015937371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008979513,0.00074384565,0.0008842735,0.0007682464,0.0012441357,0.00076673354,0.0018530928,0.00061599736,0.00073319476],"category_scores_gemma":[0.0027194824,0.00024397958,0.0004067299,0.0010988441,0.00060172495,0.0016040769,0.001021858,0.00047209935,0.00017063913],"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.0013410838,0.0007817133,0.011240666,0.0006779034,0.00029115457,0.0013812733,0.0009920704,0.44573727,0.13384034,0.0597725,0.013392728,0.33055136],"study_design_scores_gemma":[0.000032091513,0.00019814924,0.00065114413,0.000020745167,0.00007364155,0.00048442924,0.000085695625,0.9785583,0.011987321,0.0048572617,0.00300963,0.000041602325],"about_ca_topic_score_codex":0.0063988925,"about_ca_topic_score_gemma":0.01272275,"teacher_disagreement_score":0.0063988925,"about_ca_system_score_codex":0.0020092232,"about_ca_system_score_gemma":0.0015249802,"threshold_uncertainty_score":0.014578044},"labels":[],"label_agreement":null},{"id":"W2886588140","doi":"10.1109/icc.2018.8422115","title":"Efficient Interference-Aware D2D Pairing for Collaborative Data Dissemination","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Pairing; Exploit; Cache; Interference (communication); Lagrangian relaxation; Mobile device; Enhanced Data Rates for GSM Evolution; Key (lock); Distributed computing; Upper and lower bounds; Computer network; Focus (optics); Scheme (mathematics); Mathematical optimization; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.05914446560441326,"score_gpt":0.3129038478038159,"score_spread":0.25375938219940264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886588140","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.013012081,0.00026911436,0.9823141,0.00014377465,0.00003539215,0.000057367793,0.00004638689,0.00012183055,0.003999929],"genre_scores_gemma":[0.74593323,0.000528553,0.24908227,0.00013710417,0.00005548159,0.0002353527,0.00013939333,0.000048435577,0.0038401815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863344,0.00061508734,0.000053625972,0.00017418449,0.00032535027,0.00019828665],"domain_scores_gemma":[0.998539,0.00089545967,0.00013859518,0.00020475656,0.00012426778,0.00009804204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014998527,0.0008582764,0.0016381635,0.0007758278,0.00095029117,0.0013060482,0.001315317,0.0011920932,0.002466401],"category_scores_gemma":[0.0040793796,0.0004943322,0.00082747766,0.0018131335,0.00078587746,0.0018981239,0.0029573082,0.0011439502,0.000678164],"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.0003035152,0.00016601477,0.00084602594,0.00020698698,0.00005715053,0.00042481485,0.0003261402,0.83364516,0.008284969,0.0830028,0.0039876583,0.06874882],"study_design_scores_gemma":[0.000025682099,0.000077395474,0.00007215551,0.000010008743,0.000011461934,0.00013195002,0.000056172263,0.9818571,0.0014467005,0.014033729,0.002264725,0.000012896687],"about_ca_topic_score_codex":0.0009091114,"about_ca_topic_score_gemma":0.0012536228,"teacher_disagreement_score":0.002466401,"about_ca_system_score_codex":0.0009426528,"about_ca_system_score_gemma":0.0011662812,"threshold_uncertainty_score":0.008250952},"labels":[],"label_agreement":null},{"id":"W2886647656","doi":"10.1109/icc.2018.8422823","title":"Software-Defined Vehicular Networks with Caching and Computing for Delay-Tolerant Data Traffic","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cloud computing; Edge computing; Distributed computing; Software-defined networking; Computer network; Overhead (engineering); Node (physics); Mobile edge computing; Resource allocation; Operating system","score_opus":0.02698227096856611,"score_gpt":0.23971661589802903,"score_spread":0.21273434492946292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886647656","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.062437456,0.0015094863,0.9299088,0.0003905135,0.00014471135,0.00007009298,0.000065849774,0.0003189355,0.0051541566],"genre_scores_gemma":[0.9761656,0.00052982394,0.02187728,0.00005305426,0.00003180108,0.000048573565,0.00005222875,0.0000146391085,0.0012270187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946934,0.00012448682,0.000023010709,0.00008569581,0.00014321748,0.00015434029],"domain_scores_gemma":[0.999571,0.00013794196,0.00006415355,0.000049367616,0.00013584858,0.00004172947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005027671,0.00056196627,0.00059675553,0.0004171199,0.00073767843,0.0009153324,0.001410024,0.000531107,0.0005860949],"category_scores_gemma":[0.0010463888,0.00024341125,0.0004584499,0.0006929434,0.0005345991,0.0010153349,0.00073809293,0.00058217265,0.00011380398],"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.00009838143,0.00005033681,0.00090279744,0.00009392798,0.000044060074,0.00013533563,0.000075762284,0.9087939,0.0057547083,0.05491609,0.0012691462,0.027865542],"study_design_scores_gemma":[0.000004760978,0.000024491774,0.00007976314,0.0000036263505,0.000010117706,0.0000196239,0.000015912467,0.9924394,0.0006095342,0.005730688,0.0010563689,0.0000056216445],"about_ca_topic_score_codex":0.012626566,"about_ca_topic_score_gemma":0.01801976,"teacher_disagreement_score":0.012626566,"about_ca_system_score_codex":0.0015533647,"about_ca_system_score_gemma":0.002328211,"threshold_uncertainty_score":0.025106132},"labels":[],"label_agreement":null},{"id":"W2887041669","doi":"10.1002/spy2.33","title":"Preventing unauthorized access in information centric networking","year":2018,"lang":"en","type":"article","venue":"Security and Privacy","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Scalability; The Internet; Access control; Overhead (engineering); Node (physics); Information-centric networking; Cache; Protocol (science); Computer security; Operating system; Engineering","score_opus":0.019542089529079182,"score_gpt":0.26653588459595,"score_spread":0.24699379506687083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887041669","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.38429344,0.0029284703,0.59313667,0.0011042628,0.0001026229,0.00029699507,0.00005919126,0.0011494125,0.016928941],"genre_scores_gemma":[0.9689265,0.0006102908,0.029325975,0.00007284874,0.000032455122,0.000054345826,0.000028341057,0.000022231196,0.0009270126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966679,0.0013097109,0.00013903208,0.00022108834,0.0012503262,0.00041188876],"domain_scores_gemma":[0.9869147,0.006413043,0.0015992759,0.0037794109,0.0010461075,0.00024742787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029123847,0.00063472404,0.0007154612,0.0011216908,0.0014167676,0.0016279666,0.0009993636,0.00093779655,0.00087333226],"category_scores_gemma":[0.010149499,0.00039136704,0.0003373261,0.0010669454,0.0019906596,0.004074166,0.0017805938,0.00083930395,0.00017876066],"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.00095606147,0.00045957195,0.011801698,0.0005938563,0.00019825487,0.00065711467,0.000981701,0.40770787,0.04674067,0.28693074,0.0040721623,0.23890023],"study_design_scores_gemma":[0.000053382137,0.00036179236,0.0018365097,0.00007994204,0.000116183386,0.000614378,0.00031362192,0.84592974,0.040010538,0.102197185,0.008431747,0.000054993478],"about_ca_topic_score_codex":0.0009528869,"about_ca_topic_score_gemma":0.0006522708,"teacher_disagreement_score":0.0029123847,"about_ca_system_score_codex":0.0012822108,"about_ca_system_score_gemma":0.0016135981,"threshold_uncertainty_score":0.015402377},"labels":[],"label_agreement":null},{"id":"W2887483433","doi":"10.1109/icc.2018.8422307","title":"Priority-Based Caching Policy at a Hybrid IoT Proxy","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Proxy (statistics); Computer network; 6LoWPAN; Cache; Default gateway; Internet of Things; Queue; Queueing theory; Computer security; The Internet; Operating system","score_opus":0.012973963015414536,"score_gpt":0.25081307110366496,"score_spread":0.23783910808825043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887483433","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.24354753,0.0011113905,0.7454469,0.0004421074,0.00015038317,0.0002814921,0.0002225769,0.0020201283,0.0067774905],"genre_scores_gemma":[0.952425,0.00018799455,0.04403696,0.00006044346,0.000022686065,0.00007132625,0.00006297809,0.000046564146,0.0030860875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935573,0.00013620651,0.00007980683,0.00014183793,0.00017328169,0.00011301374],"domain_scores_gemma":[0.9990528,0.0002047008,0.00012732364,0.00021705232,0.0002945112,0.00010359851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075051066,0.00047673302,0.00061667524,0.00042715762,0.0006388732,0.0017601112,0.0018062649,0.00090741256,0.0011567324],"category_scores_gemma":[0.0014975201,0.00027469342,0.0005177998,0.0005962865,0.00056706724,0.0019063161,0.00054289034,0.0005321461,0.00027933472],"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.00085969135,0.00045165763,0.01184427,0.0004113582,0.00018427664,0.0018683395,0.0004841747,0.7261362,0.099869885,0.08357811,0.003950489,0.07036158],"study_design_scores_gemma":[0.000025202908,0.00012889627,0.0007421664,0.00001347812,0.00006786289,0.00031589516,0.000041097028,0.9788936,0.012712662,0.004239496,0.0027810999,0.000038548922],"about_ca_topic_score_codex":0.0039648716,"about_ca_topic_score_gemma":0.0028085061,"teacher_disagreement_score":0.0039648716,"about_ca_system_score_codex":0.0011418859,"about_ca_system_score_gemma":0.0010797576,"threshold_uncertainty_score":0.008285046},"labels":[],"label_agreement":null},{"id":"W2887534524","doi":"10.1109/twc.2018.2864985","title":"Joint Frequency Reuse and Cache Optimization in Backhaul-Limited Small-Cell Wireless Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"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":"Research Grants Council, University Grants Committee","keywords":"Backhaul (telecommunications); Computer science; Cache; Computer network; Base station; Reuse; Antenna diversity; Wireless; Small cell; Wireless network; Frequency reuse; Key (lock); Distributed computing; Telecommunications","score_opus":0.037783906006979916,"score_gpt":0.23920987892219459,"score_spread":0.20142597291521466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887534524","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.14259763,0.0015407496,0.85327196,0.00019749741,0.000025177147,0.000055460052,0.000043271575,0.00032230347,0.0019459234],"genre_scores_gemma":[0.9773811,0.00033248463,0.02173872,0.000032876073,0.0000167699,0.00003392737,0.000015114711,0.000011798592,0.00043716142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927,0.00026759296,0.000029373072,0.000072589035,0.00020858354,0.00015178653],"domain_scores_gemma":[0.99812025,0.0012259361,0.0002567988,0.0001382877,0.00019850972,0.000060225317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009273037,0.00068641215,0.00089370867,0.00046444876,0.00046378843,0.0007355535,0.0009832175,0.0006195956,0.00043005703],"category_scores_gemma":[0.003938087,0.0003147937,0.0003097931,0.0009189939,0.0007298994,0.00088909507,0.0006287897,0.00033788374,0.00010855374],"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.00011257541,0.000044485285,0.00073639926,0.000059433096,0.00003747116,0.00010396819,0.000042100113,0.96355,0.004943875,0.004785254,0.00034793466,0.025236508],"study_design_scores_gemma":[0.000009045305,0.000036156005,0.00012743492,0.0000027126005,0.000011622235,0.000036235262,0.000008572928,0.996804,0.00098126,0.0018544864,0.00012363354,0.000004735549],"about_ca_topic_score_codex":0.004784695,"about_ca_topic_score_gemma":0.0049241483,"teacher_disagreement_score":0.004784695,"about_ca_system_score_codex":0.001032711,"about_ca_system_score_gemma":0.00087047607,"threshold_uncertainty_score":0.009513736},"labels":[],"label_agreement":null},{"id":"W2888896501","doi":"10.1109/tsc.2018.2867482","title":"A Double Deep Q-Learning Model for Energy-Efficient Edge Scheduling","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Science Foundation of Sri Lanka","keywords":"Computer science; Sigmoid function; Edge device; Energy consumption; Frequency scaling; Deep learning; Efficient energy use; Scheduling (production processes); Energy (signal processing); Algorithm; Artificial intelligence; Mathematical optimization; Artificial neural network; Mathematics; Electrical engineering","score_opus":0.02310774106076888,"score_gpt":0.2503590141494647,"score_spread":0.22725127308869583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888896501","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.038718965,0.0005528194,0.954625,0.0004934733,0.00009959488,0.000054351556,0.00019248086,0.0011249961,0.0041384124],"genre_scores_gemma":[0.8896839,0.0003903918,0.10049032,0.00048684276,0.000045275745,0.00019195865,0.0004927243,0.000106093285,0.008112526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997912,0.000030264971,0.000011574877,0.000073985844,0.00004156151,0.00005138871],"domain_scores_gemma":[0.9997272,0.000089447254,0.000024537032,0.00002441244,0.000115863906,0.00001856593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004653705,0.00075474475,0.0006113362,0.00024626643,0.00028151908,0.00059913425,0.0014998992,0.00076454476,0.0031142815],"category_scores_gemma":[0.0011029153,0.00034800675,0.0004589359,0.00035936182,0.00045136787,0.0010715415,0.0006802826,0.0013496482,0.00049858884],"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.00009475432,0.00007999656,0.0010407371,0.000056566958,0.000027109923,0.000057275898,0.00004354475,0.9052005,0.0031318872,0.00495263,0.0026035493,0.08271138],"study_design_scores_gemma":[0.0000027729732,0.000011015236,0.000044464232,0.0000021534072,0.0000028777988,0.0000039845454,0.0000021025912,0.9985239,0.00035458128,0.00083194795,0.00021866617,0.0000015431418],"about_ca_topic_score_codex":0.009441471,"about_ca_topic_score_gemma":0.012234595,"teacher_disagreement_score":0.009441471,"about_ca_system_score_codex":0.0008687493,"about_ca_system_score_gemma":0.0011284057,"threshold_uncertainty_score":0.01877302},"labels":[],"label_agreement":null},{"id":"W2888980102","doi":"10.1002/cpe.4667","title":"Design considerations for GPU‐aware collective communications in MPI","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; CUDA; Parallel computing; Message passing; Efficient energy use; Process (computing); Distributed computing; Operating system","score_opus":0.12639618549631798,"score_gpt":0.37804482261956185,"score_spread":0.25164863712324387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888980102","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.14978819,0.0012102812,0.8157056,0.0029378226,0.00031782236,0.00013286222,0.0001191677,0.006896385,0.022891827],"genre_scores_gemma":[0.79592925,0.00034708733,0.19464566,0.00028295518,0.000099811215,0.00015724971,0.00015022742,0.0006569347,0.0077308044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922466,0.00022363568,0.000041827512,0.00006978273,0.00031359628,0.00012645229],"domain_scores_gemma":[0.99874324,0.00035612652,0.00007136994,0.00034835,0.00039166602,0.00008927829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011444,0.00031937193,0.00039365474,0.00036948305,0.0008283691,0.0013085584,0.0018760953,0.00054359453,0.002807167],"category_scores_gemma":[0.0030470395,0.00031271897,0.00030699465,0.00055562897,0.00051246816,0.0013808326,0.00084649114,0.0010571157,0.00093538675],"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.001079787,0.0003178649,0.010780554,0.00067046785,0.00015258628,0.0008534629,0.0013809041,0.271991,0.19024791,0.24598475,0.032386202,0.24415442],"study_design_scores_gemma":[0.00006818445,0.00023116005,0.00160523,0.00005309395,0.00005549667,0.00026092766,0.00024033267,0.8557526,0.059573196,0.033733003,0.04837032,0.000056492347],"about_ca_topic_score_codex":0.0029569722,"about_ca_topic_score_gemma":0.003788494,"teacher_disagreement_score":0.0029569722,"about_ca_system_score_codex":0.0008811329,"about_ca_system_score_gemma":0.0010506735,"threshold_uncertainty_score":0.009390891},"labels":[],"label_agreement":null},{"id":"W2891130876","doi":"10.1109/netsoft.2018.8459986","title":"PCPV: Pattern-based Cost-efficient Proactive VNF placement and chaining for value-added services in content delivery networks","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Concordia University; Université du Québec à Montréal","funders":"","keywords":"Chaining; Computer science; Server; Quality of service; Distributed computing; Computer network; Virtual network","score_opus":0.0531557431650916,"score_gpt":0.2583449808759334,"score_spread":0.2051892377108418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891130876","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.056194358,0.00030741395,0.93765724,0.0002948656,0.000075330216,0.00020956233,0.00015912707,0.0008605815,0.0042414754],"genre_scores_gemma":[0.52439004,0.00021666237,0.4716217,0.000111765876,0.000032344706,0.00022476882,0.00031737305,0.000119299664,0.0029660787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996145,0.000080907084,0.000015545644,0.00007426002,0.0001246112,0.00009017406],"domain_scores_gemma":[0.9994122,0.00025928437,0.00008619307,0.00007856798,0.0001120974,0.000051787578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698976,0.0007204758,0.0007418084,0.0005001497,0.00063735584,0.00086510635,0.001402956,0.0009599554,0.00204866],"category_scores_gemma":[0.0018879467,0.00036758638,0.0003649209,0.00095488864,0.00048421725,0.00080355967,0.00094164786,0.0006496577,0.0003091272],"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.00010887762,0.00011623002,0.0012990576,0.000090033085,0.000023607752,0.00007119969,0.00005555449,0.8823531,0.0049448055,0.007386044,0.003656491,0.09989494],"study_design_scores_gemma":[0.000013351267,0.000037892045,0.000089410045,0.0000036118015,0.000003676858,0.000026226133,0.000011778575,0.9963186,0.0011284034,0.0017989394,0.00056499563,0.0000031002166],"about_ca_topic_score_codex":0.008401041,"about_ca_topic_score_gemma":0.007971092,"teacher_disagreement_score":0.008401041,"about_ca_system_score_codex":0.0011198769,"about_ca_system_score_gemma":0.0020143786,"threshold_uncertainty_score":0.016704261},"labels":[],"label_agreement":null},{"id":"W2891286892","doi":"10.1109/tmm.2018.2870521","title":"Content Popularity Prediction Towards Location-Aware Mobile Edge Caching","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":197,"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 Waterloo","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Backhaul (telecommunications); Cache; Algorithm; Exploit; Regret; Data mining; Machine learning; Base station; Computer network","score_opus":0.03979363620046616,"score_gpt":0.2607314566692937,"score_spread":0.22093782046882754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891286892","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.115197085,0.00084333366,0.879298,0.0004962802,0.00006846437,0.000062651845,0.00027441932,0.0012196129,0.0025401504],"genre_scores_gemma":[0.93095887,0.00036717177,0.06658846,0.00012410407,0.0000983173,0.000050937557,0.00029331498,0.00005166555,0.0014671591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995047,0.00015287935,0.000020389061,0.00012723698,0.000114654635,0.00008023726],"domain_scores_gemma":[0.99716055,0.0015307664,0.0003578484,0.00026796607,0.00057952834,0.00010349009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088124,0.00062250067,0.0009925857,0.0007291121,0.0003674205,0.0010142757,0.0014797823,0.00081771886,0.0007315981],"category_scores_gemma":[0.006168875,0.00035450395,0.0003342977,0.0012525951,0.0004267099,0.0011765822,0.0007905376,0.0007602445,0.00043805435],"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.00029031208,0.000106947125,0.005495819,0.00007131379,0.00004430766,0.0001831494,0.00006473335,0.90305704,0.0037895206,0.0059545822,0.0037139433,0.07722826],"study_design_scores_gemma":[0.0000018902425,0.000004657943,0.0001188771,0.0000016248495,0.0000021880173,0.000007941941,0.000003888737,0.99889815,0.00026783365,0.0006096816,0.00008157433,0.000001674769],"about_ca_topic_score_codex":0.009420457,"about_ca_topic_score_gemma":0.00803992,"teacher_disagreement_score":0.009420457,"about_ca_system_score_codex":0.0009054409,"about_ca_system_score_gemma":0.0010878822,"threshold_uncertainty_score":0.018731236},"labels":[],"label_agreement":null},{"id":"W2891357051","doi":"10.1109/netsoft.2018.8459910","title":"A Security Orchestration System for CDN Edge Servers","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Waterloo","funders":"","keywords":"Server; Computer science; Computer network; Quality of service; Overhead (engineering); Enhanced Data Rates for GSM Evolution; Throughput; Computer security; Task (project management); Orchestration; Edge device; Operating system; Cloud computing; Telecommunications; Engineering","score_opus":0.023880840271678933,"score_gpt":0.23884328892474538,"score_spread":0.21496244865306643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891357051","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.112582415,0.00043186484,0.72677773,0.00055864954,0.00028077513,0.0008341729,0.0005866199,0.1395402,0.018407537],"genre_scores_gemma":[0.7668337,0.00022185955,0.21508068,0.00069598085,0.00009606322,0.00042660147,0.0013463516,0.0023279737,0.01297068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986853,0.00021394441,0.0001711795,0.0004071333,0.00034139902,0.00018095427],"domain_scores_gemma":[0.9981065,0.0003583452,0.00014750773,0.00060343987,0.00047150865,0.0003126392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013963239,0.00094299595,0.000619857,0.00079297874,0.0011691449,0.0020092863,0.0017608629,0.00089667056,0.005966717],"category_scores_gemma":[0.0029318419,0.0006015558,0.00040712036,0.00047183124,0.00078356155,0.0020636339,0.0019833946,0.00120465,0.0020998549],"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.005103783,0.0018462337,0.038401708,0.0005806361,0.00038502784,0.0020584671,0.0020619023,0.078852504,0.3057829,0.04865668,0.06558966,0.4506804],"study_design_scores_gemma":[0.0003299586,0.00038887633,0.0035153902,0.00006180871,0.00017306516,0.000600076,0.00013321402,0.81699705,0.10434857,0.008627006,0.06465677,0.00016826794],"about_ca_topic_score_codex":0.0038608888,"about_ca_topic_score_gemma":0.0025672575,"teacher_disagreement_score":0.005966717,"about_ca_system_score_codex":0.0016536635,"about_ca_system_score_gemma":0.0017628748,"threshold_uncertainty_score":0.019960701},"labels":[],"label_agreement":null},{"id":"W2891906560","doi":"10.1109/netsoft.2018.8459970","title":"Dynamic Security Orchestration for CDN Edge-Servers","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Waterloo","funders":"","keywords":"Server; Computer science; Computer network; Quality of service; Enhanced Data Rates for GSM Evolution; Overhead (engineering); Orchestration; Cache; Computer security; Operating system; Telecommunications","score_opus":0.01718458389869168,"score_gpt":0.2563595333333833,"score_spread":0.2391749494346916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891906560","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.3765656,0.00032503004,0.5802749,0.00051843177,0.00018465203,0.00054317946,0.0002211561,0.024285298,0.017081803],"genre_scores_gemma":[0.9042818,0.000090038,0.09081358,0.00017193193,0.000025700941,0.00012370394,0.0002092526,0.0005889575,0.0036951506],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987991,0.00025555084,0.000116226794,0.00032197437,0.00028543363,0.00022172873],"domain_scores_gemma":[0.9982558,0.00036942048,0.00016485502,0.00056253636,0.0003225437,0.00032499316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014119705,0.00071240903,0.00035764612,0.0005224235,0.0009320968,0.0018664508,0.0012604959,0.0006932122,0.002095798],"category_scores_gemma":[0.0026192577,0.0004061114,0.0003062828,0.00023133103,0.0008905352,0.0014394727,0.0021161414,0.00106872,0.00068573473],"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.0030703018,0.0020842697,0.057525966,0.00035156912,0.0002308968,0.0021239256,0.0031643999,0.27002263,0.3221476,0.06428361,0.014805716,0.26018915],"study_design_scores_gemma":[0.00008127662,0.000117188,0.001904705,0.000026749556,0.000048285405,0.0002070359,0.00013200226,0.9226659,0.053079102,0.007322309,0.01437197,0.00004352142],"about_ca_topic_score_codex":0.0033356862,"about_ca_topic_score_gemma":0.003106196,"teacher_disagreement_score":0.0033356862,"about_ca_system_score_codex":0.0013447419,"about_ca_system_score_gemma":0.0013288852,"threshold_uncertainty_score":0.0097568035},"labels":[],"label_agreement":null},{"id":"W2896368254","doi":"10.48550/arxiv.1810.06017","title":"Linear Coded Caching Scheme for Centralized Networks","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Lakehead University","funders":"","keywords":"Network packet; Computer science; Scheme (mathematics); Construct (python library); Linear subspace; Transmission (telecommunications); Combinatorial design; Theoretical computer science; Algorithm; Computer network; Mathematics; Discrete mathematics","score_opus":0.08961021973828685,"score_gpt":0.20011005142395205,"score_spread":0.1104998316856652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896368254","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.048498306,0.00035370153,0.94415504,0.00016345864,0.000036635418,0.00008351373,0.000108502136,0.00036566675,0.006235162],"genre_scores_gemma":[0.81837213,0.00042048533,0.17450613,0.00014701433,0.000054175747,0.00016514976,0.00018593873,0.00005331824,0.006095801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999238,0.00022950568,0.00003894914,0.00013425815,0.00023984576,0.0001194267],"domain_scores_gemma":[0.9982564,0.00061870186,0.00026628544,0.00037126557,0.00040282626,0.000084443585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067831454,0.00047536334,0.00051592523,0.00047092044,0.0005688434,0.0011037183,0.0010174147,0.00054209377,0.0021526783],"category_scores_gemma":[0.0028289305,0.00018690298,0.0003263505,0.0010202393,0.00088400557,0.0014324145,0.0008084247,0.0007230368,0.0004483981],"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.00025866355,0.00009517897,0.0004843254,0.00021121957,0.000034286622,0.00018771445,0.00026406322,0.35846776,0.025668131,0.5240911,0.0040576207,0.08617995],"study_design_scores_gemma":[0.000024148734,0.00011743293,0.00014319055,0.00002368441,0.00001828832,0.00013474144,0.00003637115,0.9265955,0.008024174,0.06191013,0.002935118,0.00003720783],"about_ca_topic_score_codex":0.0028267296,"about_ca_topic_score_gemma":0.0026262489,"teacher_disagreement_score":0.0028267296,"about_ca_system_score_codex":0.001831212,"about_ca_system_score_gemma":0.0013037527,"threshold_uncertainty_score":0.013286471},"labels":[],"label_agreement":null},{"id":"W2896751036","doi":"10.1109/mcom.2018.1800134","title":"Design Guidelines for Information-Centric Connected and Autonomous Vehicles","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":49,"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 Ottawa","funders":"","keywords":"Computer science; Unicast; Service (business); Information flow; Process (computing); Telecommunications; Computer security; Multicast","score_opus":0.09882968425666548,"score_gpt":0.31369086065774815,"score_spread":0.21486117640108265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896751036","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.0022427565,0.0018612053,0.9235158,0.005717889,0.00053895864,0.0015121856,0.00022440712,0.0009676298,0.06341924],"genre_scores_gemma":[0.07124964,0.004280739,0.8888172,0.002205085,0.00022864544,0.004076796,0.00057999394,0.00050518144,0.028056733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99395084,0.0022780416,0.0008618122,0.000504222,0.002034203,0.00037100175],"domain_scores_gemma":[0.99407285,0.001578369,0.00043375106,0.00059954054,0.0030596256,0.00025585017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060212323,0.0014806731,0.00066468416,0.0020379024,0.0018008746,0.0041085985,0.004453341,0.0057393764,0.0061607882],"category_scores_gemma":[0.0115215825,0.00140412,0.0009025112,0.0012221006,0.002523472,0.0044337274,0.0028525558,0.0035524687,0.005576833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000026590995,0.000106007625,0.00041164085,0.00056660164,0.000020554395,0.00066117477,0.001928737,0.033354346,0.0047092307,0.8740432,0.022222918,0.061949007],"study_design_scores_gemma":[0.000055643046,0.00013063484,0.00020249355,0.0009188676,0.000042124284,0.0005032566,0.0011243265,0.045579482,0.003981796,0.21230657,0.7350875,0.00006722127],"about_ca_topic_score_codex":0.005614906,"about_ca_topic_score_gemma":0.0076665347,"teacher_disagreement_score":0.0061607882,"about_ca_system_score_codex":0.0024761127,"about_ca_system_score_gemma":0.0039556758,"threshold_uncertainty_score":0.031843722},"labels":[],"label_agreement":null},{"id":"W2896908943","doi":"10.1145/3308897.3308914","title":"Worst-case Bounds and Optimized Cache on Mth Request Cache Insertion Policies under Elastic Conditions","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Cache; Computer science; Cache algorithms; Parallel computing; Smart Cache; Cache invalidation; CPU cache; Arithmetic; Mathematics","score_opus":0.07209332620444928,"score_gpt":0.3327206799919905,"score_spread":0.2606273537875412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896908943","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.10161922,0.047966953,0.74428284,0.007287766,0.0012636267,0.00041220742,0.0038652078,0.0039793644,0.089322746],"genre_scores_gemma":[0.8620891,0.012464154,0.11028528,0.0011539331,0.0019776083,0.00032974902,0.0017607213,0.0011750406,0.00876446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9790757,0.005995205,0.00081738026,0.0018718918,0.0070904656,0.0051494287],"domain_scores_gemma":[0.927949,0.052421514,0.004200315,0.007331966,0.0069273054,0.0011698728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014246124,0.0024809572,0.0033347113,0.0037159456,0.0013467054,0.0072369594,0.005061883,0.0022660552,0.0075495094],"category_scores_gemma":[0.0575748,0.0011639472,0.0011937807,0.005850859,0.0019090207,0.013419692,0.0025735167,0.0040441267,0.0016329101],"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.001433423,0.00037696393,0.0019903402,0.00072635897,0.00022438378,0.00012434076,0.00016577258,0.74516124,0.0035831935,0.13317436,0.021722745,0.09131686],"study_design_scores_gemma":[0.000043880053,0.00021863371,0.0009179182,0.00016832931,0.00013341024,0.00016189924,0.00011511468,0.9301652,0.0025356237,0.06194091,0.0035469264,0.00005217643],"about_ca_topic_score_codex":0.009277212,"about_ca_topic_score_gemma":0.010035083,"teacher_disagreement_score":0.014246124,"about_ca_system_score_codex":0.0071952795,"about_ca_system_score_gemma":0.007678675,"threshold_uncertainty_score":0.07534158},"labels":[],"label_agreement":null},{"id":"W2898441673","doi":"10.1145/3242102.3277846","title":"Information-Centric Intelligent Vehicular Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Vehicular ad hoc network; Computer network; Vehicular communication systems; Quality of service; Host (biology); Content distribution; Content delivery; Intelligent transportation system; Dissemination; Telecommunications; Multimedia; Wireless ad hoc network; Engineering; Transport engineering; Wireless","score_opus":0.010320199438559923,"score_gpt":0.2064395655835849,"score_spread":0.19611936614502498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898441673","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.020171463,0.023139983,0.8621883,0.0038264364,0.0018909405,0.0002101237,0.000741853,0.0017380915,0.08609288],"genre_scores_gemma":[0.8521802,0.02028708,0.08874997,0.0010617925,0.0011021831,0.00017493054,0.001772129,0.0000941567,0.034577392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996569,0.000063046355,0.000017492253,0.00006435915,0.00014631664,0.000051867642],"domain_scores_gemma":[0.9997038,0.000067551395,0.000041973228,0.00004419706,0.000113339076,0.000029075503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003327178,0.00041843872,0.0003212019,0.00043543853,0.0004187947,0.0013963784,0.0011957843,0.0007355245,0.0025868497],"category_scores_gemma":[0.0008816427,0.00012919042,0.00013498505,0.0008776092,0.0003617554,0.0012283097,0.00088453427,0.00051843096,0.0012359899],"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.00014456193,0.00007122367,0.001696102,0.00058954576,0.000047951202,0.00042726824,0.00015750718,0.093148746,0.015208821,0.30317318,0.045915134,0.53942],"study_design_scores_gemma":[0.00003391153,0.0002019782,0.0008732901,0.00016722974,0.0000701327,0.000608733,0.00018078121,0.42643934,0.009661625,0.18225664,0.37946552,0.000040798866],"about_ca_topic_score_codex":0.0014896508,"about_ca_topic_score_gemma":0.0020819006,"teacher_disagreement_score":0.0025868497,"about_ca_system_score_codex":0.00066807616,"about_ca_system_score_gemma":0.00083405245,"threshold_uncertainty_score":0.00865382},"labels":[],"label_agreement":null},{"id":"W2898447952","doi":"10.1145/3242102.3242147","title":"Content-centric Edge Caching for 5G Mobile Internet and Beyond","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer network; Cellular network; Cellular traffic; Quality of experience; Quality of service; Edge device; The Internet; Mobile edge computing; Core network; Multimedia; Telecommunications; World Wide Web; Cloud computing","score_opus":0.029155159230630636,"score_gpt":0.24160145486906698,"score_spread":0.21244629563843634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898447952","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.10612601,0.014109713,0.8374293,0.005025344,0.00032547355,0.00038846608,0.00016723022,0.0013704321,0.035058],"genre_scores_gemma":[0.79254323,0.0073454515,0.1918597,0.0006329766,0.00013059076,0.00013030886,0.00014660916,0.000080270474,0.0071308855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994093,0.00023242719,0.00003372531,0.00005111897,0.0001701408,0.00010333182],"domain_scores_gemma":[0.99911004,0.0002035414,0.000080106816,0.00020413799,0.0003486122,0.00005353197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011710358,0.00036253873,0.00041752448,0.00041458086,0.0008808475,0.0022362787,0.00107018,0.0013994536,0.0011140406],"category_scores_gemma":[0.0018693615,0.0002717193,0.0003782149,0.0010106614,0.0007777869,0.002030075,0.0006117626,0.0008346786,0.00022777797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00023622735,0.00012140603,0.004152876,0.00047774104,0.00006386254,0.00074201665,0.00090144237,0.08722936,0.046405133,0.63976616,0.01200598,0.2078978],"study_design_scores_gemma":[0.00003691249,0.00044008918,0.0031150917,0.0003973329,0.00020363124,0.0014542631,0.00093583943,0.6424817,0.03137954,0.17957982,0.1398554,0.000120370896],"about_ca_topic_score_codex":0.006538723,"about_ca_topic_score_gemma":0.012917378,"teacher_disagreement_score":0.006538723,"about_ca_system_score_codex":0.0024612527,"about_ca_system_score_gemma":0.0019988841,"threshold_uncertainty_score":0.01785773},"labels":[],"label_agreement":null},{"id":"W2898652425","doi":"10.1109/jiot.2018.2878435","title":"Joint Optimization of Caching, Computing, and Radio Resources for Fog-Enabled IoT Using Natural Actor–Critic Deep Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":324,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Reinforcement learning; Backhaul (telecommunications); Markov decision process; Distributed computing; Radio access network; Wireless network; Optimization problem; Computation offloading; Cloud computing; Computer network; Lyapunov optimization; Wireless; Edge computing; Artificial intelligence; Markov process; Base station; Telecommunications","score_opus":0.019443248267652813,"score_gpt":0.2544993342877386,"score_spread":0.23505608602008576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898652425","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.070452735,0.0006123626,0.92258114,0.000616583,0.00009391896,0.000050031245,0.00004859175,0.00034970016,0.005194898],"genre_scores_gemma":[0.9693471,0.00017837538,0.027783448,0.00016964789,0.000027818376,0.00007672759,0.000065304805,0.000035151374,0.0023162889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997743,0.00006265526,0.000011098837,0.00005576491,0.0000433125,0.000052949337],"domain_scores_gemma":[0.9992686,0.0004829274,0.000077631405,0.000025997266,0.00009524489,0.000049515278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237159,0.0008091531,0.0009802842,0.00024138374,0.0002794546,0.0007418201,0.0007414363,0.0010537684,0.00094787596],"category_scores_gemma":[0.0019911171,0.00041136937,0.00043989386,0.00027839013,0.0008198539,0.0006300696,0.0007716575,0.0012089245,0.00011232028],"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.00002214799,0.000019229736,0.00030681933,0.00001653261,0.000014057082,0.00003610972,0.00001212277,0.99344134,0.00033555028,0.0019719487,0.0002658183,0.003558296],"study_design_scores_gemma":[0.0000021640994,0.000003182392,0.000019238734,9.1218106e-7,0.0000015859429,0.0000016107517,0.0000011172035,0.9994161,0.000033982407,0.00049082714,0.000028552839,7.945971e-7],"about_ca_topic_score_codex":0.011760468,"about_ca_topic_score_gemma":0.009193203,"teacher_disagreement_score":0.011760468,"about_ca_system_score_codex":0.0010371197,"about_ca_system_score_gemma":0.0012668781,"threshold_uncertainty_score":0.023384035},"labels":[],"label_agreement":null},{"id":"W2899411552","doi":"10.1145/3272036.3272048","title":"Information-Centric Strategies for Content Delivery in Intelligent Vehicular Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Vehicular ad hoc network; Content delivery; Network topology; Implementation; Quality of service; Information-centric networking; Computer network; Intelligent transportation system; Distributed computing; Wireless ad hoc network; Telecommunications; Engineering; Transport engineering; Wireless","score_opus":0.031060349641120758,"score_gpt":0.23103845269219792,"score_spread":0.19997810305107716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899411552","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.017198406,0.0060776924,0.9565713,0.0015836338,0.00026290066,0.00016476431,0.00007402595,0.00030100576,0.017766336],"genre_scores_gemma":[0.87384254,0.0061301403,0.11180122,0.0004409771,0.00027652888,0.0001990878,0.00016077112,0.00008145541,0.0070672603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992925,0.00025494787,0.00006127116,0.00009110469,0.00017738683,0.00012279952],"domain_scores_gemma":[0.9985876,0.0006857753,0.00012487559,0.00013247515,0.00039154055,0.00007775182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012085664,0.0006943326,0.0008384507,0.0014772451,0.0011318199,0.0024713592,0.0020331608,0.0012552715,0.0015674155],"category_scores_gemma":[0.0033126052,0.0002907446,0.00038821838,0.0014909904,0.0009966196,0.0030259702,0.0015457842,0.0006538037,0.00052406534],"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.00019562941,0.0001190967,0.0010089217,0.0005960992,0.000106926534,0.0005080362,0.0008108359,0.24453366,0.01222174,0.567796,0.009950841,0.16215219],"study_design_scores_gemma":[0.000039282502,0.00015268246,0.0002730082,0.00010782479,0.000100923295,0.0003580847,0.000474285,0.75767994,0.0070810537,0.20170249,0.031970542,0.000059894657],"about_ca_topic_score_codex":0.0026410045,"about_ca_topic_score_gemma":0.0034305851,"teacher_disagreement_score":0.0026410045,"about_ca_system_score_codex":0.0018751007,"about_ca_system_score_gemma":0.0010793287,"threshold_uncertainty_score":0.013604879},"labels":[],"label_agreement":null},{"id":"W2899458107","doi":"10.1109/cluster.2018.00053","title":"Graph Partitioning Algorithm with LSH: Poster Extended Abstract","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Algorithm; Hash function; Graph; Locality; Graph bandwidth; Theoretical computer science; Voltage graph; Line graph","score_opus":0.014510249644935438,"score_gpt":0.22577913277882056,"score_spread":0.21126888313388512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899458107","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.02450704,0.00046195977,0.96573454,0.00027875352,0.00017205407,0.00015673113,0.00029566776,0.004653113,0.0037401333],"genre_scores_gemma":[0.23005193,0.00022462917,0.76120734,0.00020616394,0.00010622049,0.00015933378,0.0014605521,0.00041013872,0.0061736517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995919,0.00006646978,0.000026823303,0.0001132365,0.00014718136,0.000054444175],"domain_scores_gemma":[0.9995902,0.00006258395,0.000029369485,0.0001476211,0.00014033623,0.000029918941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024187258,0.00048761794,0.00049501925,0.0011014664,0.00075989176,0.0007844248,0.0010608374,0.00050957256,0.0051366985],"category_scores_gemma":[0.0009627862,0.00028141146,0.00043430767,0.0014055428,0.0004049321,0.0015939114,0.0012653141,0.00051867065,0.001725364],"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.00035527334,0.00013000001,0.0015672981,0.00027711946,0.00007098741,0.00013472175,0.00020079187,0.051452644,0.041762203,0.026907835,0.021209806,0.85593134],"study_design_scores_gemma":[0.00012450032,0.00015992257,0.0014259244,0.00002458991,0.00004470797,0.00048418605,0.00021454462,0.879106,0.051135197,0.042325284,0.024891779,0.00006334843],"about_ca_topic_score_codex":0.004239604,"about_ca_topic_score_gemma":0.0041846256,"teacher_disagreement_score":0.0051366985,"about_ca_system_score_codex":0.0006902273,"about_ca_system_score_gemma":0.00091848325,"threshold_uncertainty_score":0.01718396},"labels":[],"label_agreement":null},{"id":"W2899725445","doi":"10.1109/mwc.2018.1700360","title":"A Dynamic Edge Caching Framework for Mobile 5G Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Division of Electrical, Communications and Cyber Systems; Israel Science Foundation; Ministry of Education, India; National Science Foundation","keywords":"Computer science; Mobile edge computing; Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Distributed computing; Edge device; Mobile computing; Cellular network; Key (lock); Node (physics); Server; Cloud computing; Telecommunications; Computer security; Operating system","score_opus":0.029775924894170948,"score_gpt":0.3076696010495464,"score_spread":0.2778936761553754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899725445","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.016969847,0.0016908894,0.9703076,0.0005075968,0.00010621412,0.0000896016,0.00018606028,0.00047826424,0.009663891],"genre_scores_gemma":[0.7606609,0.0019636117,0.22951567,0.0002498984,0.00015422187,0.00014738426,0.00025386838,0.000107142965,0.0069472687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964607,0.00013545499,0.00001365069,0.000042532094,0.000089088666,0.00007313733],"domain_scores_gemma":[0.9996717,0.00011380668,0.000030214034,0.000048646743,0.00010586292,0.000029729557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874618,0.0005818601,0.00062883314,0.00044356438,0.0007247204,0.001127254,0.0015462574,0.0009437968,0.0022126092],"category_scores_gemma":[0.0011642682,0.00019045653,0.0004540875,0.0009025941,0.00055408076,0.0014960065,0.00084474945,0.0007140093,0.00037166578],"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.000091296286,0.00006359082,0.0006930492,0.000086960456,0.00003680519,0.00030366806,0.00012453126,0.65362114,0.0037263716,0.28574443,0.009644893,0.045863204],"study_design_scores_gemma":[0.000006482245,0.000019284153,0.00006238444,0.0000071392133,0.000009410713,0.000052584983,0.000020180227,0.9825717,0.00027420477,0.013823232,0.0031437026,0.000009619596],"about_ca_topic_score_codex":0.017260564,"about_ca_topic_score_gemma":0.020157192,"teacher_disagreement_score":0.017260564,"about_ca_system_score_codex":0.0016789713,"about_ca_system_score_gemma":0.0014993637,"threshold_uncertainty_score":0.034320176},"labels":[],"label_agreement":null},{"id":"W2900381967","doi":"10.1109/icmcs.2018.8525877","title":"A Survey of Routing Mechanisms in ICNs","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Scalability; The Internet; Routing (electronic design automation); Enabling; Key (lock); Host (biology); Task (project management); Computer network; Policy-based routing; Routing protocol; Distributed computing; World Wide Web; Link-state routing protocol; Computer security; Engineering","score_opus":0.03974941451451059,"score_gpt":0.25156027405235815,"score_spread":0.21181085953784756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900381967","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011400721,0.46442518,0.45433876,0.0029534004,0.002363039,0.00061105046,0.00040526132,0.0019958415,0.06150686],"genre_scores_gemma":[0.13812722,0.5617182,0.2749825,0.0021584162,0.0028807456,0.0007954665,0.0012737645,0.00058113714,0.017482597],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793327,0.0004768274,0.00036483593,0.00030534217,0.00073131913,0.00018848831],"domain_scores_gemma":[0.99760854,0.0012251907,0.00022780363,0.00036474297,0.00050782796,0.00006584966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034095985,0.0010950884,0.001409206,0.0035584997,0.0013021964,0.0048377565,0.003108432,0.0019250436,0.0039795646],"category_scores_gemma":[0.00497389,0.0010446063,0.0008521033,0.0050929687,0.0012173142,0.005674876,0.0013392257,0.0016420215,0.001450463],"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.00014552493,0.00013123982,0.0011060046,0.0048199277,0.00009419239,0.00017397679,0.0003593321,0.027828604,0.0045698984,0.33177018,0.017740166,0.61126095],"study_design_scores_gemma":[0.00004166432,0.000340106,0.0010746979,0.0032933366,0.00028444495,0.0013924373,0.00040127273,0.07331643,0.008108959,0.11415967,0.7974092,0.00017784705],"about_ca_topic_score_codex":0.0023584475,"about_ca_topic_score_gemma":0.0014063335,"teacher_disagreement_score":0.0048377565,"about_ca_system_score_codex":0.0026582263,"about_ca_system_score_gemma":0.0016772657,"threshold_uncertainty_score":0.01928693},"labels":[],"label_agreement":null},{"id":"W2900861556","doi":"10.1109/iscc.2018.8538481","title":"A Novel Location-Based Content Distribution Protocol for Vehicular Named-Data Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":37,"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 Ottawa","funders":"","keywords":"Computer science; Computer network; Network packet; Broadcast radiation; Flooding (psychology); Network topology; Vehicular ad hoc network; Protocol (science); User Datagram Protocol; Wireless; Internet Protocol; Wireless ad hoc network; The Internet; Telecommunications; Operating system","score_opus":0.11167904688639527,"score_gpt":0.31202089544564005,"score_spread":0.20034184855924478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900861556","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.017274767,0.00086431147,0.97419536,0.00035657288,0.0003942175,0.0003378987,0.00013941586,0.0014257263,0.0050118202],"genre_scores_gemma":[0.657498,0.0014534432,0.32745442,0.000430478,0.00027592396,0.00094683527,0.0011344213,0.00015145363,0.010655022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951637,0.0001033353,0.000067146335,0.00007784537,0.00018421772,0.00005106933],"domain_scores_gemma":[0.99931526,0.00015609221,0.00009079156,0.00012645376,0.00025595594,0.000055445013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006331345,0.00041944394,0.0005590059,0.00081094314,0.0008369002,0.0008869966,0.0015089528,0.00062541134,0.0008879174],"category_scores_gemma":[0.0015866199,0.00024309073,0.00033506282,0.00083325687,0.0005323427,0.0020494529,0.0019178706,0.00073950144,0.00049328187],"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.0006763701,0.0003128894,0.0023441687,0.0007714267,0.00018260261,0.0017867662,0.0009695394,0.07520082,0.13456418,0.19812445,0.026820134,0.5582466],"study_design_scores_gemma":[0.00019978789,0.0005352251,0.00071487797,0.00006754101,0.00019007816,0.0019178678,0.00029746824,0.7798369,0.049956493,0.029767906,0.13635132,0.00016455293],"about_ca_topic_score_codex":0.0012798748,"about_ca_topic_score_gemma":0.0017918719,"teacher_disagreement_score":0.0015089528,"about_ca_system_score_codex":0.00085419865,"about_ca_system_score_gemma":0.0009780383,"threshold_uncertainty_score":0.0061976314},"labels":[],"label_agreement":null},{"id":"W2901322284","doi":"10.1109/iscc.2018.8538613","title":"Social Pre-caching for Location-dependent Requests in Vehicular Information-Centric Ad-hoc Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Cache; Computer network; Node (physics); Information-centric networking; Locality; Wireless ad hoc network; Content delivery; Provisioning; Vehicular ad hoc network; Wireless; Telecommunications","score_opus":0.013192708355649318,"score_gpt":0.2509067570640794,"score_spread":0.23771404870843008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901322284","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.33259717,0.0017394524,0.6583372,0.0006506203,0.00011786769,0.00017444053,0.00017242928,0.0006389551,0.0055718403],"genre_scores_gemma":[0.9867198,0.0002594434,0.011644785,0.000038258342,0.000023717566,0.000029697527,0.000072961535,0.000016421129,0.001194805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992538,0.00025635472,0.000046074747,0.00011667716,0.00016729513,0.00015975322],"domain_scores_gemma":[0.99691594,0.0014309313,0.00034407075,0.0005871303,0.0005658018,0.00015612412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011926816,0.00046215532,0.00090051576,0.0006132562,0.0011197473,0.0010286332,0.0014162982,0.0007068386,0.0005098913],"category_scores_gemma":[0.004079676,0.00031566762,0.0003412531,0.0008720759,0.00057622907,0.001413328,0.0008827746,0.00043909517,0.00014799305],"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.0005389261,0.00035318907,0.0149091305,0.00038513527,0.00020589159,0.0010792069,0.0010318455,0.73301685,0.02863637,0.07218745,0.0066181505,0.14103793],"study_design_scores_gemma":[0.0000075242187,0.000059930007,0.000872793,0.000008042126,0.000024490764,0.00011634255,0.0001376129,0.9874921,0.002594268,0.0071743107,0.001498909,0.000013791264],"about_ca_topic_score_codex":0.011857763,"about_ca_topic_score_gemma":0.023762584,"teacher_disagreement_score":0.011857763,"about_ca_system_score_codex":0.0016248272,"about_ca_system_score_gemma":0.0017838702,"threshold_uncertainty_score":0.023577452},"labels":[],"label_agreement":null},{"id":"W2902319104","doi":"10.1109/mmul.2018.2879591","title":"Edge Caching and Computing in 5G for Mobile AR/VR and Tactile Internet","year":2018,"lang":"en","type":"article","venue":"IEEE Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":167,"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 Ottawa","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Augmented reality; The Internet; Virtual reality; Edge computing; Mobile edge computing; Multimedia; Popularity; Mobile computing; Mobile device; Computer network; Wireless; Wireless network; Enhanced Data Rates for GSM Evolution; Server; Human–computer interaction; Telecommunications; World Wide Web","score_opus":0.01826729718281969,"score_gpt":0.26372204013589395,"score_spread":0.24545474295307426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902319104","genre_codex":"review","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.10535396,0.41606635,0.34107158,0.01315767,0.0023115731,0.0003205886,0.0006138798,0.0014546112,0.11964985],"genre_scores_gemma":[0.75920516,0.14997444,0.07038856,0.0022655982,0.0012361692,0.00013623764,0.00042415908,0.00013604522,0.016233603],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943095,0.00016127188,0.000035602716,0.00008107249,0.00016531785,0.00012564346],"domain_scores_gemma":[0.99910116,0.00042915405,0.000058953534,0.0001399274,0.0002221332,0.000048657937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005583184,0.0005459134,0.00075010775,0.0009338698,0.00090540294,0.003206593,0.0013881398,0.0013129526,0.0031144354],"category_scores_gemma":[0.0017082975,0.00029823952,0.00042226206,0.0029251196,0.0006382224,0.003789522,0.00080815057,0.0010406951,0.0007983871],"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.00032379632,0.00016485674,0.005255135,0.0020500238,0.00012595134,0.00096290675,0.0008991427,0.028487626,0.012786533,0.4043459,0.049947184,0.494651],"study_design_scores_gemma":[0.000042167238,0.0003483678,0.0047759875,0.001497729,0.00028467513,0.0028600625,0.0018846688,0.3423461,0.015565692,0.17697285,0.45325264,0.00016909286],"about_ca_topic_score_codex":0.0048585194,"about_ca_topic_score_gemma":0.0072172387,"teacher_disagreement_score":0.0048585194,"about_ca_system_score_codex":0.0019848316,"about_ca_system_score_gemma":0.0012731258,"threshold_uncertainty_score":0.014401078},"labels":[],"label_agreement":null},{"id":"W2902698307","doi":"10.1109/tnet.2018.2881169","title":"Tapping the Knowledge of Dynamic Traffic Demands for Optimal CDN Design","year":2018,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Cache; Software deployment; Distributed computing; Scalability; Computer network; Internet traffic; TRACE (psycholinguistics); Content delivery network; The Internet; Server; Database; Operating system","score_opus":0.045638838684408024,"score_gpt":0.2784231943188788,"score_spread":0.23278435563447078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902698307","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.03690897,0.00031453793,0.95841527,0.00056144904,0.000041055435,0.00006856928,0.000098362405,0.0002486587,0.003343078],"genre_scores_gemma":[0.813241,0.00041542973,0.18491453,0.00016011012,0.000040916424,0.00009148292,0.0001360284,0.00010297647,0.0008974356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911004,0.00029806243,0.00003999793,0.00017101715,0.00022936404,0.00015149055],"domain_scores_gemma":[0.99835265,0.0009363108,0.00018791405,0.00011858759,0.0003215206,0.00008293462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011595958,0.00091881974,0.0007837382,0.000546226,0.0005078865,0.0012430442,0.0010811734,0.00086962135,0.0013719127],"category_scores_gemma":[0.0047984244,0.0006022029,0.0003101403,0.0008865589,0.0006086044,0.002057819,0.0008489426,0.0012514604,0.00024682799],"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.000029746048,0.00004098606,0.0008526061,0.000059040194,0.000011271501,0.000045905013,0.00004181816,0.96735984,0.002813956,0.0058672717,0.0008667102,0.022010885],"study_design_scores_gemma":[0.0000037624218,0.000014105093,0.0000631368,0.000003968138,0.000004250225,0.000017020384,0.000024207298,0.996555,0.00040885032,0.0025855012,0.00031777335,0.0000024159156],"about_ca_topic_score_codex":0.0056813667,"about_ca_topic_score_gemma":0.009797786,"teacher_disagreement_score":0.0056813667,"about_ca_system_score_codex":0.0019928785,"about_ca_system_score_gemma":0.0025935795,"threshold_uncertainty_score":0.014459431},"labels":[],"label_agreement":null},{"id":"W2902906771","doi":"10.1109/cloudnet.2018.8549459","title":"Purging-Aware Content Placement in Fog-Based Content Delivery Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Computer science; Content delivery; Cache; Latency (audio); Cloud computing; Content delivery network; Computer network; Enhanced Data Rates for GSM Evolution; Content distribution; Content (measure theory); Set (abstract data type); Distributed computing; Server; Operating system; Artificial intelligence","score_opus":0.05770247749814796,"score_gpt":0.2322552338638593,"score_spread":0.17455275636571133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902906771","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.15509681,0.00058437226,0.84073853,0.00018405808,0.00006496023,0.00012314161,0.000065556866,0.0003922029,0.0027504135],"genre_scores_gemma":[0.88777894,0.0002550842,0.1107087,0.00005709872,0.00001580012,0.00004251468,0.00004979598,0.00002284758,0.0010693398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997236,0.0000687204,0.0000104761875,0.00005966889,0.00007216811,0.00006523166],"domain_scores_gemma":[0.99972993,0.00011094742,0.000047643178,0.000025626014,0.000052620144,0.000033164295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042300782,0.00040464484,0.0005258567,0.00045876528,0.0007965109,0.00070964574,0.0010770295,0.0007367865,0.0003394655],"category_scores_gemma":[0.0008919886,0.00030884027,0.00032094415,0.0006869645,0.0005264871,0.00073590624,0.0005061721,0.00037398256,0.000083021965],"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.00007986889,0.00008458473,0.0013550379,0.00006139889,0.0000316014,0.00018269275,0.00009988746,0.9287568,0.011938808,0.006144924,0.000982966,0.050281517],"study_design_scores_gemma":[0.0000064684536,0.000029893457,0.00026402037,0.0000034941509,0.000011038019,0.00004020192,0.000034126573,0.9949399,0.0019960299,0.0021748587,0.0004935849,0.000006303108],"about_ca_topic_score_codex":0.014816432,"about_ca_topic_score_gemma":0.015353701,"teacher_disagreement_score":0.014816432,"about_ca_system_score_codex":0.001590723,"about_ca_system_score_gemma":0.0013370565,"threshold_uncertainty_score":0.02946037},"labels":[],"label_agreement":null},{"id":"W2904036678","doi":"10.1109/tvt.2018.2886010","title":"Optimizing Content Dissemination for Real-Time Traffic Management in Large-Scale Internet of Vehicle Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":91,"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 British Columbia","funders":"National Key Research and Development Program of China; Tianjin University; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"The Internet; Scale (ratio); Computer science; Computer network; Internet traffic; Multimedia; World Wide Web","score_opus":0.013394090656294164,"score_gpt":0.239966894607757,"score_spread":0.22657280395146284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904036678","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.17768107,0.00081071147,0.81744,0.00048467124,0.000061032664,0.0001357621,0.0000840552,0.0005874553,0.0027152444],"genre_scores_gemma":[0.9798346,0.00018762177,0.019170154,0.00003373916,0.000017420232,0.000036094938,0.000040875464,0.00003763179,0.00064199447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995165,0.00017779907,0.000020815452,0.00009257407,0.000092010756,0.00010030493],"domain_scores_gemma":[0.99883527,0.0006738132,0.000142589,0.00007967966,0.00019525473,0.00007330906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008305447,0.00073789957,0.0009833659,0.00062156963,0.00059728127,0.0010617089,0.0011484354,0.00085826864,0.0005372428],"category_scores_gemma":[0.002917145,0.000312009,0.0003096233,0.0008886551,0.00048988796,0.0013104166,0.0007352392,0.00039205595,0.00010982954],"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.00006443135,0.00005811834,0.0005930316,0.0000655438,0.000024329296,0.00006421982,0.000051671857,0.97203773,0.0069935196,0.003724325,0.0006516346,0.015671397],"study_design_scores_gemma":[0.0000038928742,0.000017579096,0.000079062826,8.832174e-7,0.000005619908,0.000006183019,0.000017066037,0.9981602,0.00062921795,0.00092207233,0.00015550565,0.000002680258],"about_ca_topic_score_codex":0.0071870345,"about_ca_topic_score_gemma":0.0049549867,"teacher_disagreement_score":0.0071870345,"about_ca_system_score_codex":0.0017206242,"about_ca_system_score_gemma":0.0010812748,"threshold_uncertainty_score":0.014290392},"labels":[],"label_agreement":null},{"id":"W2904283960","doi":"10.1109/spects.2018.8574197","title":"Dash-Based Device-to-Device Video Streaming for Cellular Networks with High User Density","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"Universidade Federal de Pernambuco; Ministry of Education, India; Ministry of Earth Sciences","keywords":"Computer science; Dynamic Adaptive Streaming over HTTP; Computer network; Quality of experience; Cellular network; DEVS; Video quality; Implementation; Architecture; Quality of service; Dash; Multimedia; Operating system; Simulation","score_opus":0.015628936195516703,"score_gpt":0.2213345097681752,"score_spread":0.2057055735726585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904283960","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.16184346,0.0005830336,0.82600176,0.00038871943,0.00008456614,0.00027840398,0.00020112931,0.0024622348,0.008156683],"genre_scores_gemma":[0.9292932,0.00039186198,0.066143796,0.000101255864,0.000023838944,0.00010584003,0.0002681871,0.00005935627,0.0036126196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949765,0.00021239462,0.0000410459,0.00006510171,0.0001302913,0.000053493324],"domain_scores_gemma":[0.99923766,0.00025580596,0.000059497524,0.00013822247,0.0002629744,0.000045833927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774164,0.00035490753,0.0003918249,0.000263455,0.00049540255,0.0010859253,0.00095508056,0.0005611342,0.0010232944],"category_scores_gemma":[0.0011666118,0.00020125539,0.00039993454,0.0002858396,0.0004895899,0.0009146912,0.0005636259,0.0006404668,0.00025760257],"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.000734381,0.00046535395,0.008029837,0.000592499,0.00014488566,0.0013971274,0.0007642081,0.59218985,0.08643455,0.18242744,0.0051921816,0.12162768],"study_design_scores_gemma":[0.00001651402,0.00010869007,0.00040023145,0.000011713243,0.000025741467,0.00008387648,0.00004592021,0.98424894,0.0072198147,0.0045935563,0.003234021,0.000011063456],"about_ca_topic_score_codex":0.005363334,"about_ca_topic_score_gemma":0.006557962,"teacher_disagreement_score":0.005363334,"about_ca_system_score_codex":0.0011143406,"about_ca_system_score_gemma":0.00081682875,"threshold_uncertainty_score":0.010664225},"labels":[],"label_agreement":null},{"id":"W2904319831","doi":"10.1109/mass.2018.00019","title":"Q-Learning Based Edge Caching Optimization for D2D Enabled Hierarchical Wireless Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Wireless network; Computer network; Wireless; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.012660067925121051,"score_gpt":0.22768877812667157,"score_spread":0.2150287102015505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904319831","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.073254466,0.0008113274,0.9216656,0.00064719655,0.00005719259,0.00011359362,0.00016354797,0.0002743666,0.0030126737],"genre_scores_gemma":[0.9537948,0.00031304694,0.043003604,0.00016703943,0.00003681999,0.00010142232,0.00011861926,0.000030872943,0.0024337354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936074,0.00020266032,0.00003182029,0.0001351284,0.00010655154,0.0001632022],"domain_scores_gemma":[0.9964978,0.0026884787,0.00026600552,0.00009386948,0.00029102174,0.0001628306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015040032,0.0007777795,0.0017574873,0.0005338401,0.00050026074,0.00095175457,0.0014886481,0.0012190139,0.0021521233],"category_scores_gemma":[0.004078051,0.0004424664,0.00045324254,0.0009933643,0.0008407948,0.0011323565,0.0010451219,0.000934906,0.00018638227],"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.00006204724,0.00006507545,0.0006204977,0.00005335973,0.00001807094,0.00004868449,0.000024418707,0.98123276,0.00045599774,0.0054442547,0.0007185409,0.011256166],"study_design_scores_gemma":[0.0000055604983,0.000011027199,0.000046768862,0.0000012877018,0.0000025142272,0.000003924676,0.0000037032744,0.998386,0.000050624978,0.00143656,0.00005042213,0.0000015136978],"about_ca_topic_score_codex":0.01208167,"about_ca_topic_score_gemma":0.0072307647,"teacher_disagreement_score":0.01208167,"about_ca_system_score_codex":0.0020662437,"about_ca_system_score_gemma":0.001763275,"threshold_uncertainty_score":0.024022698},"labels":[],"label_agreement":null},{"id":"W2907331177","doi":"10.1109/lcomm.2018.2890223","title":"A Cache-Level Quality of Experience Metric to Characterize ICNs for Adaptive Streaming","year":2018,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Quality of experience; Metric (unit); Benchmark (surveying); Computer network; Cache algorithms; CPU cache; Quality of service","score_opus":0.23308534621945545,"score_gpt":0.3574024185030219,"score_spread":0.12431707228356645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907331177","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.2917125,0.0014307332,0.69413596,0.00039313958,0.00012992007,0.00031475953,0.0007323715,0.00087160134,0.010278983],"genre_scores_gemma":[0.95703655,0.00024479366,0.041448563,0.000060532584,0.000039730126,0.00009675016,0.0003158387,0.000052737167,0.0007045289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865603,0.00031793443,0.00015381371,0.0001563762,0.0005896249,0.00012620389],"domain_scores_gemma":[0.9938928,0.002490632,0.0009268097,0.0006260519,0.0017882494,0.0002756117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388917,0.0007524743,0.00063170714,0.0011261308,0.00041272122,0.0012734181,0.00070724287,0.00066435424,0.0009087472],"category_scores_gemma":[0.0115992855,0.00014473825,0.00028034137,0.001318418,0.0005270098,0.0016650201,0.00057816226,0.00068689015,0.00024252842],"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.0006351332,0.00047768693,0.055004325,0.000547518,0.00020239303,0.00047855443,0.0004788758,0.6471166,0.06611112,0.053014502,0.0040375204,0.17189582],"study_design_scores_gemma":[0.0000125847155,0.00068772334,0.012685518,0.000059795468,0.000055690874,0.0005569239,0.00011065803,0.95882076,0.01389342,0.009006084,0.004057239,0.000053568732],"about_ca_topic_score_codex":0.0020585437,"about_ca_topic_score_gemma":0.002680017,"teacher_disagreement_score":0.0020585437,"about_ca_system_score_codex":0.0011859846,"about_ca_system_score_gemma":0.00069366756,"threshold_uncertainty_score":0.010782838},"labels":[],"label_agreement":null},{"id":"W2907697336","doi":"10.1109/tvt.2018.2872966","title":"Cache-Aware Multicast Beamforming Design for Multicell Multigroup Multicast","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"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":"University of British Columbia","keywords":"Multicast; Computer science; Protocol Independent Multicast; Xcast; Computer network; Source-specific multicast; Distributed computing; Cache; Pragmatic General Multicast; Beamforming; Distance Vector Multicast Routing Protocol; IP multicast; Telecommunications","score_opus":0.029633580865692875,"score_gpt":0.25793639152249936,"score_spread":0.2283028106568065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907697336","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.008092399,0.00017411882,0.9892924,0.0000919867,0.000020026826,0.00002104068,0.000024820603,0.00006432813,0.0022189766],"genre_scores_gemma":[0.7246428,0.0007281647,0.27096933,0.00015268146,0.00006951178,0.00024202716,0.000121363024,0.000045039895,0.0030290743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997451,0.00007476405,0.000011253621,0.000035533398,0.00010405144,0.000029428375],"domain_scores_gemma":[0.999777,0.00006654807,0.00003984692,0.000013511269,0.00009074987,0.000012436177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032840765,0.0007213163,0.00044648536,0.0002990929,0.00030919115,0.00043438343,0.00058900076,0.00066988525,0.0013680306],"category_scores_gemma":[0.0007079013,0.0002277163,0.00029910062,0.00043982678,0.0002651145,0.00060159474,0.0004423633,0.0004188929,0.0003907372],"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.00016762372,0.00007078862,0.0009577641,0.00020895353,0.000058363505,0.00019832911,0.00014957738,0.7410871,0.101829596,0.0307127,0.0028134391,0.12174582],"study_design_scores_gemma":[0.0000096088015,0.00006773211,0.000102077065,0.00000892581,0.000009862292,0.00004162111,0.000022011887,0.9924211,0.0041841217,0.0021321434,0.0009900912,0.000010721785],"about_ca_topic_score_codex":0.0012523851,"about_ca_topic_score_gemma":0.0018586162,"teacher_disagreement_score":0.0013680306,"about_ca_system_score_codex":0.0004942152,"about_ca_system_score_gemma":0.00045368512,"threshold_uncertainty_score":0.0045764446},"labels":[],"label_agreement":null},{"id":"W2908062222","doi":"10.1109/wimob.2018.8589159","title":"Joint Caching and Resource Allocation in D2D-Assisted Heterogeneous Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Heterogeneous network; Macro; Computer network; Resource allocation; Cache; Transmission (telecommunications); Spectral efficiency; Context (archaeology); Greedy algorithm; Channel (broadcasting); Cellular network; Distributed computing; Wireless; Wireless network; Algorithm; Telecommunications","score_opus":0.022562551726183464,"score_gpt":0.2217455244156609,"score_spread":0.19918297268947743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908062222","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.075829014,0.0015693185,0.918042,0.00032916167,0.000059245882,0.00006762377,0.00011129504,0.000279074,0.0037133037],"genre_scores_gemma":[0.93541366,0.00045892518,0.062520236,0.00007326993,0.000025117173,0.00006161985,0.0000698988,0.000027671556,0.0013497557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955183,0.00018077513,0.000020418747,0.00007379059,0.000074824835,0.000098319106],"domain_scores_gemma":[0.99899954,0.0007080808,0.00008703726,0.00006599633,0.000086002176,0.000053302323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008381096,0.0006865115,0.0010145458,0.00051269995,0.000550412,0.0010671279,0.0010746374,0.00085588393,0.00059390964],"category_scores_gemma":[0.0020580834,0.00038282038,0.00038477927,0.001159348,0.0005412199,0.0009090122,0.00081744505,0.00036612313,0.00013072118],"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.000089648194,0.000035298297,0.00053281436,0.00004646476,0.000028816637,0.0001141232,0.000021928816,0.9702856,0.0016495519,0.005829827,0.0007563551,0.020609507],"study_design_scores_gemma":[0.000008376245,0.000011462177,0.00006462579,0.0000016707098,0.0000070143974,0.000015682816,0.0000075750254,0.99769044,0.00034730328,0.001678983,0.00016315318,0.0000037967293],"about_ca_topic_score_codex":0.00934464,"about_ca_topic_score_gemma":0.009931245,"teacher_disagreement_score":0.00934464,"about_ca_system_score_codex":0.0014928501,"about_ca_system_score_gemma":0.0010690922,"threshold_uncertainty_score":0.018580496},"labels":[],"label_agreement":null},{"id":"W2909444676","doi":"10.1109/tmc.2019.2893917","title":"Cooperative Caching for Multiple Bitrate Videos in Small Cell Edges","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":52,"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":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Server; Quality of experience; Function (biology); Mobile device; Enhanced Data Rates for GSM Evolution; Constant bitrate; Mobile edge computing; Software deployment; Computer network; Variable bitrate; Bit rate; Quality of service; Artificial intelligence","score_opus":0.019722116296718113,"score_gpt":0.23126746341815335,"score_spread":0.21154534712143525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909444676","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.2729119,0.00093304215,0.7206033,0.0005277873,0.000053781707,0.00018639506,0.00020477978,0.0003885865,0.004190387],"genre_scores_gemma":[0.94889784,0.00029381647,0.0494221,0.00006791717,0.00002056045,0.000055838806,0.00007575755,0.000018610228,0.0011476293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944514,0.00016405697,0.000023661507,0.000102751306,0.000076485536,0.0001878445],"domain_scores_gemma":[0.9979913,0.001345837,0.00017675877,0.00013560231,0.00022039794,0.00013006528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008791969,0.000706782,0.0010872968,0.00048659524,0.00075792,0.0010955011,0.0014726297,0.0011151709,0.0011556185],"category_scores_gemma":[0.003300842,0.00029130894,0.00054203096,0.0010205465,0.0005227303,0.0012367583,0.0010294366,0.0005891563,0.0001844348],"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.00072289933,0.00022753343,0.002706036,0.00022592857,0.000071675946,0.0007909074,0.00025499452,0.9041959,0.015128826,0.019367157,0.0032494566,0.053058725],"study_design_scores_gemma":[0.00001658374,0.000052295618,0.00019805264,0.00000473706,0.000010917262,0.00006499884,0.000053445736,0.99508345,0.0011455255,0.0031462654,0.0002183317,0.000005496705],"about_ca_topic_score_codex":0.0075263963,"about_ca_topic_score_gemma":0.009684868,"teacher_disagreement_score":0.0075263963,"about_ca_system_score_codex":0.0011581503,"about_ca_system_score_gemma":0.00082206784,"threshold_uncertainty_score":0.014965177},"labels":[],"label_agreement":null},{"id":"W2909545649","doi":"10.1109/twc.2018.2890469","title":"Joint Sponsored and Edge Caching Content Service Market: A Game-Theoretic Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Air Force Office of Scientific Research; Division of Electrical, Communications and Cyber Systems; Multidisciplinary University Research Initiative; Israel Science Foundation; Ministry of Education, India; National Science Foundation","keywords":"Stackelberg competition; Computer science; Backward induction; Service provider; Computer network; Bilevel optimization; Enhanced Data Rates for GSM Evolution; Wireless network; Game theory; Mobile network operator; Service (business); Cache; Cellular network; Wireless; Optimization problem; Telecommunications; Algorithm; Business; Microeconomics","score_opus":0.042369405178914424,"score_gpt":0.23446393814940547,"score_spread":0.19209453297049106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909545649","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.029647322,0.0004961108,0.94669354,0.0011104702,0.00009597967,0.00021533236,0.0001480504,0.00008498366,0.021508198],"genre_scores_gemma":[0.8904603,0.0009553106,0.093659125,0.00029466892,0.00014402573,0.00045957245,0.00010122619,0.000043469383,0.013882307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866724,0.0006537833,0.00003209495,0.00020519026,0.00020501559,0.00023667038],"domain_scores_gemma":[0.9985518,0.0009518705,0.00013482381,0.000051990562,0.00016537133,0.00014413535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016805913,0.0014199641,0.0016692176,0.0008926007,0.0010966199,0.0026929125,0.0027712635,0.0027586624,0.0048607606],"category_scores_gemma":[0.0039597927,0.00080647244,0.0013389603,0.0009302651,0.0025895725,0.0038542575,0.0019256355,0.002280222,0.00041217505],"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.00007065124,0.0000983306,0.0003670443,0.00009164153,0.00004925924,0.00031207857,0.00016275645,0.5398505,0.0010374675,0.4506487,0.0016843189,0.0056272536],"study_design_scores_gemma":[0.000017409744,0.000027876462,0.00006386849,0.000007751275,0.000013096223,0.000034544417,0.00004645322,0.9385385,0.00010871744,0.06036708,0.0007613734,0.000013337481],"about_ca_topic_score_codex":0.007931189,"about_ca_topic_score_gemma":0.006908194,"teacher_disagreement_score":0.007931189,"about_ca_system_score_codex":0.0036165407,"about_ca_system_score_gemma":0.0033922878,"threshold_uncertainty_score":0.026239991},"labels":[],"label_agreement":null},{"id":"W2911350551","doi":"10.1109/hpcc/smartcity/dss.2018.00091","title":"Cluster-Based Cache Placement in 5G Network","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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; Cache; Backhaul (telecommunications); Cache algorithms; Computer network; Bottleneck; Parallel computing; Distributed computing; CPU cache; Base station","score_opus":0.01802422966518205,"score_gpt":0.23462660915042297,"score_spread":0.21660237948524091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911350551","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.111144215,0.0005072825,0.8832198,0.00024215004,0.00007518339,0.00012647398,0.000109415596,0.00074565876,0.0038298576],"genre_scores_gemma":[0.8614117,0.00019933388,0.13586159,0.0000778351,0.000030268859,0.00006418412,0.000107835825,0.000037734273,0.002209413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993942,0.00016090063,0.000029461677,0.0001452621,0.00016362658,0.00010661783],"domain_scores_gemma":[0.99933475,0.00018008276,0.000091102454,0.00014406072,0.0001902708,0.00005964875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258356,0.00043203164,0.00072936644,0.00078747043,0.0011726845,0.0006245301,0.0018116246,0.00088052364,0.0013367166],"category_scores_gemma":[0.0014977041,0.0002417967,0.0003817977,0.00154257,0.0005005565,0.0014733593,0.0009317194,0.00041068095,0.0002809094],"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.00028759017,0.00010261572,0.0021342486,0.00011782231,0.000086036875,0.00030063547,0.00033489187,0.80807304,0.015403314,0.04381998,0.0042853407,0.12505451],"study_design_scores_gemma":[0.00001907616,0.00008480328,0.00028929388,0.0000061888777,0.000020433888,0.00012967226,0.00008558993,0.98280334,0.0043421206,0.010243476,0.00196001,0.00001599832],"about_ca_topic_score_codex":0.0060197655,"about_ca_topic_score_gemma":0.0062373,"teacher_disagreement_score":0.0060197655,"about_ca_system_score_codex":0.0014992915,"about_ca_system_score_gemma":0.0011062277,"threshold_uncertainty_score":0.011969447},"labels":[],"label_agreement":null},{"id":"W2911641194","doi":"10.1109/lcn.2018.8638116","title":"FCTree: A Space Efficient FIB Data Structure for NDN Routers","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Bloom filter; Router; Computer network; Hash function; Routing table; Latency (audio); Data structure; Prefix; Hash table; Routing protocol; Distributed computing; Routing (electronic design automation); Operating system","score_opus":0.03528415153386113,"score_gpt":0.2689739565103221,"score_spread":0.23368980497646094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911641194","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.05454204,0.002055801,0.91273016,0.00074323197,0.00031080708,0.000831431,0.00419643,0.014226999,0.010363176],"genre_scores_gemma":[0.26998097,0.0010086232,0.70561856,0.00058993435,0.00013584894,0.0011003476,0.0122930845,0.0007293289,0.0085432865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994735,0.00005938027,0.000069194,0.00006000109,0.00028317532,0.00005467128],"domain_scores_gemma":[0.9982224,0.00034479037,0.00019585963,0.00054941955,0.000589007,0.0000984583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415805,0.0004924627,0.0005798471,0.0019010738,0.000988302,0.0013655715,0.0023986755,0.0007914874,0.0050643],"category_scores_gemma":[0.003130617,0.00036640718,0.00041799562,0.0022157666,0.00061305455,0.0024451588,0.0015731533,0.0006617652,0.0014670659],"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.0014139911,0.00027445972,0.0043250984,0.0008908308,0.00009231272,0.0005331176,0.00065265823,0.038956974,0.082107075,0.054961715,0.07190857,0.7438832],"study_design_scores_gemma":[0.0005298941,0.0016263776,0.0038542312,0.00033630987,0.00014334079,0.0018208398,0.00068340095,0.52582794,0.13642617,0.04842799,0.28000906,0.00031443115],"about_ca_topic_score_codex":0.0045519853,"about_ca_topic_score_gemma":0.0064124735,"teacher_disagreement_score":0.0050643,"about_ca_system_score_codex":0.0014683378,"about_ca_system_score_gemma":0.0019232817,"threshold_uncertainty_score":0.016941786},"labels":[],"label_agreement":null},{"id":"W2911675240","doi":"10.1007/s11066-020-09139-3","title":"Media delivery competition with edge cloud, remote cloud and networking","year":2020,"lang":"en","type":"article","venue":"NETNOMICS Economic Research and Electronic Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Division of Computer and Network Systems","keywords":"Cloud computing; Competition (biology); Enhanced Data Rates for GSM Evolution; Computer science; Business; Internet privacy; Telecommunications","score_opus":0.049671257273234126,"score_gpt":0.2594943357424513,"score_spread":0.20982307846921716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911675240","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.80597097,0.0018880352,0.0056302333,0.006087673,0.00015572102,0.000060317125,0.00049581664,0.00008988494,0.17962132],"genre_scores_gemma":[0.99257517,0.00016247728,0.00023644272,0.00013643832,0.000058255282,0.0000058902724,0.000041698375,0.0000130846765,0.0067705424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858934,0.00044462085,0.000029401419,0.00019431346,0.00027586712,0.00046644724],"domain_scores_gemma":[0.99111193,0.005668876,0.000858257,0.0002585843,0.00081540045,0.0012870411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021791842,0.0003237271,0.00072884216,0.0007170192,0.0012310381,0.005437318,0.0012887924,0.0016229431,0.023991343],"category_scores_gemma":[0.007581492,0.0002582811,0.00041818313,0.0011382701,0.0012633102,0.004323407,0.0011301043,0.0016267945,0.00061592046],"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.005765995,0.0015046245,0.033314183,0.00030687504,0.0001561708,0.0012877913,0.0006314943,0.10932282,0.008515512,0.7504665,0.029238122,0.059489965],"study_design_scores_gemma":[0.0010242407,0.0020654162,0.063589066,0.00016881376,0.00036406194,0.0011595386,0.0053212345,0.5522281,0.008185284,0.3153257,0.0503249,0.0002436802],"about_ca_topic_score_codex":0.016689813,"about_ca_topic_score_gemma":0.021437665,"teacher_disagreement_score":0.023991343,"about_ca_system_score_codex":0.0061040153,"about_ca_system_score_gemma":0.0027152463,"threshold_uncertainty_score":0.080259025},"labels":[],"label_agreement":null},{"id":"W2911893217","doi":"10.1109/tcomm.2019.2894797","title":"Collaborative Multicast Beamforming for Content Delivery by Cache-Enabled Ultra Dense Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"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":"Institute for Information and Communications Technology Promotion; Institute for Computational Science and Technology; Ministry of Science and ICT, South Korea; Queen's University; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Multicast; Computer science; Backhaul (telecommunications); Computer network; Beamforming; Cache; Distributed computing; Base station; Telecommunications","score_opus":0.02909364837865125,"score_gpt":0.2518763374289379,"score_spread":0.22278268905028664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911893217","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.011025557,0.00023457859,0.986767,0.000134627,0.000022090684,0.000012863466,0.00002435641,0.000103356666,0.0016755672],"genre_scores_gemma":[0.705828,0.0011428013,0.2888359,0.00018918246,0.00007538016,0.00015033226,0.000105030136,0.00003869322,0.0036346528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978,0.00008492704,0.000006915488,0.000026920361,0.000072989504,0.000028319744],"domain_scores_gemma":[0.9997002,0.00017073784,0.000040348874,0.000019555515,0.000057652527,0.000011487984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041314733,0.00048006972,0.00044817524,0.00031654313,0.0003315232,0.00045793797,0.00058950565,0.00062269653,0.0012363296],"category_scores_gemma":[0.0011272368,0.00023733753,0.00029641544,0.0006174754,0.00046659133,0.00078460504,0.0006114321,0.0005540314,0.00037451184],"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.00013091347,0.000054635962,0.0006210151,0.0001471372,0.00003548239,0.000171325,0.00012614523,0.80184555,0.034632754,0.048855685,0.0030935898,0.11028575],"study_design_scores_gemma":[0.0000068991435,0.000029394869,0.00006659758,0.000006176525,0.0000045693364,0.000026860836,0.000014722397,0.99146515,0.0016485774,0.0060121,0.0007133294,0.000005631991],"about_ca_topic_score_codex":0.0016055417,"about_ca_topic_score_gemma":0.002484326,"teacher_disagreement_score":0.0016055417,"about_ca_system_score_codex":0.00060324895,"about_ca_system_score_gemma":0.00048976537,"threshold_uncertainty_score":0.0043768883},"labels":[],"label_agreement":null},{"id":"W2912015862","doi":"10.1007/978-981-13-2721-6_1","title":"Backgrounds of Searchable Storage","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bloom filter; Computer science; Search engine indexing; Tree (set theory); Data structure; Node (physics); Context (archaeology); Tree structure; Range query (database); Trie; Data mining; R-tree; Theoretical computer science; Information retrieval; Computer network; Search engine; Mathematics; Engineering; Geography; Operating system; Web search query; Sargable; Spatial analysis","score_opus":0.030441619488648524,"score_gpt":0.22242157860311806,"score_spread":0.19197995911446955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912015862","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001800676,0.15341568,0.05408,0.008276351,0.002301192,0.000054118405,0.00035886976,0.0004316517,0.77928144],"genre_scores_gemma":[0.06702376,0.24963889,0.030544667,0.0036167179,0.0062513426,0.00020368412,0.0005893213,0.00048391195,0.6416478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994831,0.00011371297,0.0000297417,0.000086859436,0.00023137701,0.000055085413],"domain_scores_gemma":[0.9990594,0.00052732223,0.00003677893,0.00015378385,0.00017504829,0.000047610632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006084336,0.0010604816,0.00072722737,0.002700715,0.0013824268,0.0060697473,0.001978451,0.0026495857,0.03602375],"category_scores_gemma":[0.0024100638,0.0006549212,0.00045549407,0.0062239314,0.004438421,0.011265717,0.0015674476,0.0030969193,0.011806215],"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.0000073724677,0.000016170077,0.000020977524,0.00016059006,0.0000021461303,0.000032719636,0.0001761066,0.00046544292,0.00019868577,0.92718256,0.035646662,0.036090646],"study_design_scores_gemma":[0.000003702887,0.000013212252,0.00007491185,0.0003341229,0.000004980152,0.00020267317,0.0001283519,0.0017426416,0.00029022846,0.42291328,0.57427937,0.000012520841],"about_ca_topic_score_codex":0.005422606,"about_ca_topic_score_gemma":0.004235316,"teacher_disagreement_score":0.03602375,"about_ca_system_score_codex":0.0045443275,"about_ca_system_score_gemma":0.0021690456,"threshold_uncertainty_score":0.12051153},"labels":[],"label_agreement":null},{"id":"W2912078769","doi":"10.1109/iwqos.2018.8624176","title":"Toward Smart and Cooperative Edge Caching for 5G Networks: A Deep Learning Based Approach","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Backhaul (telecommunications); Base station; Computer network; Cache; Mobile edge computing; Edge device; Edge computing; Software deployment; Cellular network; Mobile broadband; Bandwidth (computing); Latency (audio); The Internet; Broadband; Enhanced Data Rates for GSM Evolution; Server; Telecommunications; Wireless; Cloud computing; Operating system","score_opus":0.029774482421271738,"score_gpt":0.2343641885229783,"score_spread":0.20458970610170657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912078769","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.13304451,0.0041709878,0.8518344,0.0019257303,0.00014275515,0.00008579145,0.0003364618,0.0017999079,0.0066595143],"genre_scores_gemma":[0.902665,0.00084757694,0.09088202,0.0006004995,0.00009371613,0.00006846749,0.00052033225,0.00006188272,0.0042604115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997403,0.00005024967,0.000011773971,0.00006491377,0.000056356606,0.0000763619],"domain_scores_gemma":[0.99957734,0.00015671135,0.00004269888,0.000050220977,0.00012521434,0.000047812773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052594364,0.0008473788,0.00095373025,0.00049393676,0.00047375655,0.00090594875,0.0018683029,0.0013128782,0.00092420983],"category_scores_gemma":[0.001317875,0.000307134,0.0004581017,0.0007951963,0.00058771996,0.0014429052,0.0009106286,0.0012355578,0.0002734178],"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.00021751515,0.0003377446,0.003995639,0.00012001105,0.00014619176,0.000117148295,0.00013653078,0.75561374,0.006063075,0.010672728,0.0073168487,0.21526277],"study_design_scores_gemma":[0.0000046316563,0.000022510303,0.00010867953,0.000004138057,0.000008265219,0.000008013996,0.0000125175475,0.99693453,0.00043786244,0.0021240367,0.00033159883,0.000003231956],"about_ca_topic_score_codex":0.017372407,"about_ca_topic_score_gemma":0.02344133,"teacher_disagreement_score":0.017372407,"about_ca_system_score_codex":0.0010753061,"about_ca_system_score_gemma":0.0014599848,"threshold_uncertainty_score":0.03454256},"labels":[],"label_agreement":null},{"id":"W2912852555","doi":"10.1109/twc.2019.2895076","title":"Double Auction Mechanism Design for Video Caching in Heterogeneous Ultra-Dense Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kensington Health","funders":"China Academy of Space Technology; Singapore University of Technology and Design; China Postdoctoral Science Foundation; National Natural Science Foundation of China; Ministry of Education, Libya","keywords":"Backhaul (telecommunications); Computer science; Computer network; Cellular network; Base station; Mobile broadband; User equipment; Cellular traffic; Wireless; Service (business); Latency (audio); Telecommunications","score_opus":0.04081075352338844,"score_gpt":0.26023257263821925,"score_spread":0.2194218191148308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912852555","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.028711567,0.00055924105,0.9656663,0.00020644006,0.000091581016,0.000222756,0.000067642584,0.0001343959,0.0043399893],"genre_scores_gemma":[0.91597056,0.00050487934,0.07896979,0.00013269017,0.000056282686,0.000306153,0.000058830323,0.000032562057,0.0039682495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731183,0.001267532,0.00014667306,0.0003563194,0.0004757005,0.00044192994],"domain_scores_gemma":[0.9970536,0.0014946926,0.00042279405,0.00020954647,0.0005059226,0.0003133273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004151179,0.00091142923,0.0019320329,0.0008979107,0.0008094797,0.0028207533,0.0036271424,0.001520827,0.0029894374],"category_scores_gemma":[0.005804618,0.00072680856,0.0011292251,0.0013413465,0.0012453272,0.0028028148,0.0016073303,0.0013997516,0.0003361747],"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.0005558315,0.00036145473,0.0011714478,0.000406192,0.00027277297,0.0008007684,0.00025173058,0.7452699,0.0063515194,0.19755548,0.0028493414,0.04415354],"study_design_scores_gemma":[0.00009471912,0.00012344634,0.000119993616,0.000013180876,0.000042579562,0.00015190894,0.00004583315,0.9715945,0.00047645168,0.02623502,0.0010796053,0.000022696951],"about_ca_topic_score_codex":0.0025878933,"about_ca_topic_score_gemma":0.001985595,"teacher_disagreement_score":0.004151179,"about_ca_system_score_codex":0.002429292,"about_ca_system_score_gemma":0.0027043717,"threshold_uncertainty_score":0.021953821},"labels":[],"label_agreement":null},{"id":"W2912980532","doi":"10.1109/lcn.2018.8638236","title":"Intelligent Caching in Dense Small-Cell Networks with Limited External Resources","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Small cell; Backhaul (telecommunications); Computer network; False sharing; Wireless network; Wireless; Distributed computing; The Internet; Enhanced Data Rates for GSM Evolution; Cache algorithms; Cellular network; CPU cache; Base station; World Wide Web; Operating system","score_opus":0.01895206633712989,"score_gpt":0.20914872703447615,"score_spread":0.19019666069734625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912980532","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.23260722,0.0008976801,0.76043516,0.00050697866,0.00005405122,0.000121877994,0.00014536365,0.0006059237,0.0046257554],"genre_scores_gemma":[0.97296417,0.00023099288,0.025194287,0.000066785746,0.000019392271,0.000055532375,0.00006598118,0.00001858713,0.0013842739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955267,0.00017179432,0.00001540929,0.000076433826,0.00007093826,0.00011277866],"domain_scores_gemma":[0.997512,0.0017512137,0.00025500893,0.00013970204,0.0002094242,0.00013264833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209793,0.0005422087,0.001035536,0.00039243404,0.00061176927,0.0011292052,0.0012613192,0.00075148215,0.0006841619],"category_scores_gemma":[0.0038221732,0.00038675687,0.0002448761,0.0007303391,0.0008776396,0.0011308058,0.0006931303,0.00051478215,0.0001556454],"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.00010051759,0.000038015864,0.0007939616,0.00003193688,0.000016722155,0.0000928328,0.00002813347,0.98337364,0.0011803318,0.0050505567,0.00051213556,0.00878122],"study_design_scores_gemma":[0.0000060089833,0.000011629503,0.00008316642,0.0000015790042,0.0000033546962,0.00001279781,0.000009060133,0.9977604,0.0002054118,0.0018169316,0.00008787938,0.0000018077219],"about_ca_topic_score_codex":0.009031266,"about_ca_topic_score_gemma":0.009464611,"teacher_disagreement_score":0.009031266,"about_ca_system_score_codex":0.0013999316,"about_ca_system_score_gemma":0.0008713291,"threshold_uncertainty_score":0.01795739},"labels":[],"label_agreement":null},{"id":"W2913330947","doi":"10.1109/tcomm.2019.2896960","title":"A Generalized Grouping Scheme in Coded Caching","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":53,"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; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Scheme (mathematics); Transmission rate; Wireless; Wireless network; Algorithm; Computer network; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.037457749790339986,"score_gpt":0.2701184905180824,"score_spread":0.2326607407277424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913330947","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.069825105,0.0009129698,0.92127675,0.00021628795,0.00012712901,0.00014090296,0.00007869897,0.0005401909,0.006881918],"genre_scores_gemma":[0.7085897,0.00066722464,0.28554922,0.00016215415,0.00008159176,0.000200063,0.00011503441,0.00007628972,0.004558712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926955,0.00025939994,0.000040555504,0.00010644757,0.00020305929,0.00012095635],"domain_scores_gemma":[0.99864906,0.00030408212,0.00014859559,0.00057660387,0.00024286928,0.000078860525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006659686,0.0005718804,0.0007273906,0.0006424216,0.0008386057,0.0007484444,0.0012729724,0.0010484763,0.001638318],"category_scores_gemma":[0.0024965496,0.00022679953,0.0004806066,0.0015436485,0.0012500731,0.0021902649,0.0016147246,0.00088004547,0.000364875],"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.0005087756,0.00018451054,0.0010638769,0.00041257698,0.00007161968,0.00050605123,0.00085371913,0.17893323,0.07896436,0.48967433,0.006111223,0.24271575],"study_design_scores_gemma":[0.00007959758,0.00038917174,0.000592895,0.000071391034,0.000075158925,0.00062204595,0.00012465275,0.8929287,0.019137666,0.06941263,0.0164579,0.00010822421],"about_ca_topic_score_codex":0.0016263624,"about_ca_topic_score_gemma":0.0014535749,"teacher_disagreement_score":0.001638318,"about_ca_system_score_codex":0.0009620686,"about_ca_system_score_gemma":0.0008708681,"threshold_uncertainty_score":0.0069803},"labels":[],"label_agreement":null},{"id":"W2913729121","doi":"10.1109/tvt.2019.2896906","title":"Beef Up mmWave Dense Cellular Networks With D2D-Assisted Cooperative Edge Caching","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":73,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Computer network; Computer science; Cache; Cellular network; Base station; Stochastic geometry; Network topology; Exploit; Enhanced Data Rates for GSM Evolution; Distributed computing; Telecommunications","score_opus":0.009036383164494809,"score_gpt":0.2002074451952589,"score_spread":0.1911710620307641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913729121","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.24495117,0.0018401061,0.74182355,0.0005683168,0.00014099087,0.00008460868,0.00018941768,0.00059959816,0.009802273],"genre_scores_gemma":[0.979878,0.00040923222,0.018604625,0.00012780126,0.000022719169,0.000024822537,0.0000560538,0.000008653607,0.0008681646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975866,0.000040213934,0.0000091950005,0.000040546733,0.00007087003,0.000080465645],"domain_scores_gemma":[0.9994849,0.00019950356,0.00006743466,0.00008394965,0.000124409,0.00003974144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025478308,0.00057987584,0.0005103299,0.00041003348,0.00073766365,0.00083485077,0.00077525503,0.00059837755,0.00069449574],"category_scores_gemma":[0.0012282857,0.00022286832,0.00029290974,0.0008550867,0.0003479039,0.0011543091,0.001096423,0.00037616421,0.00021214271],"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.00030696756,0.00011868765,0.008898476,0.00020929675,0.00010206897,0.0015427624,0.0003214548,0.7459178,0.03724097,0.024355896,0.0050670956,0.17591852],"study_design_scores_gemma":[0.000012143225,0.000062778265,0.0006195186,0.000009084592,0.000026767952,0.00017025352,0.0001055458,0.98988146,0.002479675,0.0049795057,0.0016406542,0.000012685059],"about_ca_topic_score_codex":0.0076991324,"about_ca_topic_score_gemma":0.013743018,"teacher_disagreement_score":0.0076991324,"about_ca_system_score_codex":0.0008117484,"about_ca_system_score_gemma":0.0004438355,"threshold_uncertainty_score":0.015308619},"labels":[],"label_agreement":null},{"id":"W2914482263","doi":"10.1109/hpcc/smartcity/dss.2018.00095","title":"Fuzzy Soft-Set Based Approach for Femto-Caching in Wireless Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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; Wireless network; Wireless; Computer network; Fuzzy logic; Set (abstract data type); Fuzzy set; Femto-; Distributed computing; Artificial intelligence; Programming language; Telecommunications","score_opus":0.030080264990443285,"score_gpt":0.24540485856695451,"score_spread":0.21532459357651124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914482263","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.01445037,0.0003124252,0.9813849,0.00022660871,0.000055179044,0.000089585104,0.000047475583,0.00012327025,0.0033102345],"genre_scores_gemma":[0.74814683,0.00043086466,0.24693437,0.00023218681,0.000080524405,0.0002728856,0.00012319406,0.000025654612,0.0037535217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993337,0.00012768123,0.00005058226,0.00013847959,0.0002683834,0.00008111981],"domain_scores_gemma":[0.99914336,0.0004891133,0.00007693277,0.000027607059,0.00022055536,0.000042400898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011335873,0.00072309235,0.0011480094,0.0011063789,0.00083077344,0.0013540984,0.0017695053,0.0011386338,0.002320348],"category_scores_gemma":[0.0017392591,0.00040315473,0.001269827,0.0008146259,0.0009172038,0.00095605565,0.00077422,0.0011883604,0.00024136],"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.00008456005,0.00007872533,0.0011800643,0.00014266836,0.00008868783,0.00019596331,0.00015420346,0.90660375,0.002578208,0.021653634,0.00087478134,0.06636481],"study_design_scores_gemma":[0.0000059777617,0.000027744494,0.000121214296,0.000012701737,0.000011263498,0.000023269815,0.000018382132,0.99368346,0.00052677904,0.0052303737,0.00033130802,0.000007522452],"about_ca_topic_score_codex":0.010683069,"about_ca_topic_score_gemma":0.007635707,"teacher_disagreement_score":0.010683069,"about_ca_system_score_codex":0.0020507474,"about_ca_system_score_gemma":0.0014903673,"threshold_uncertainty_score":0.021241784},"labels":[],"label_agreement":null},{"id":"W2914576459","doi":"10.1109/tnse.2018.2865183","title":"Trust-Based Social Networks with Computing, Caching and Communications: A Deep Reinforcement Learning Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":102,"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; Ministerio de Economía y Competitividad","keywords":"Computer science; Reinforcement learning; Exploit; Leverage (statistics); Mobile edge computing; Distributed computing; Computation; Mobile device; Social network (sociolinguistics); Scheme (mathematics); Mobile social network; Artificial intelligence; Mobile computing; Computer network; Enhanced Data Rates for GSM Evolution; Social media; Computer security; World Wide Web","score_opus":0.01240932805343792,"score_gpt":0.20963964084445558,"score_spread":0.19723031279101766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914576459","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.078190096,0.00070979376,0.9150102,0.0016709035,0.00008063699,0.00006017734,0.00008975988,0.0003103069,0.003878049],"genre_scores_gemma":[0.96194845,0.00024450177,0.035078097,0.00019335136,0.000053944404,0.00007106951,0.00006184296,0.000024266858,0.00232442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948883,0.00020230199,0.000022098908,0.000105045416,0.000078840996,0.000102841084],"domain_scores_gemma":[0.9978988,0.0013582355,0.00022992384,0.00008579958,0.0002721784,0.00015501547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00129131,0.000721864,0.0010667309,0.00054196693,0.00048707137,0.0009282199,0.0014619562,0.0012962136,0.0016041839],"category_scores_gemma":[0.0042712204,0.0004404238,0.0005158569,0.00045012566,0.0012939742,0.0014955207,0.0011281951,0.001650183,0.00014605143],"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.00005436008,0.000053906297,0.0015257975,0.00003731282,0.000043363325,0.00006941716,0.000059607744,0.96313995,0.000399851,0.014739594,0.00074721273,0.019129641],"study_design_scores_gemma":[0.000002206162,0.0000056424606,0.000043967193,0.0000018127329,0.000002641866,0.0000029680077,0.0000027901563,0.99728537,0.00003656658,0.002555967,0.000058541442,0.0000015219622],"about_ca_topic_score_codex":0.014765528,"about_ca_topic_score_gemma":0.012769686,"teacher_disagreement_score":0.014765528,"about_ca_system_score_codex":0.001990993,"about_ca_system_score_gemma":0.0013993224,"threshold_uncertainty_score":0.029359162},"labels":[],"label_agreement":null},{"id":"W2914704971","doi":"","title":"Block mason","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"","keywords":"Computer science; Block (permutation group theory); Virtual machine; Virtualization; Control reconfiguration; Operating system; Address space; Simple (philosophy); Agile software development; Embedded system; Software engineering; Cloud computing","score_opus":0.02323160964935793,"score_gpt":0.1946161089115976,"score_spread":0.1713844992622397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914704971","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144463135,0.0007150213,0.20643304,0.0017099592,0.00059951213,0.00036899486,0.004072967,0.056560174,0.71509403],"genre_scores_gemma":[0.09848425,0.0011137726,0.13401698,0.00080478506,0.00017928623,0.0005030084,0.011062494,0.010733278,0.74310213],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945325,0.00007419913,0.00002156305,0.00010212748,0.0002527253,0.000096142765],"domain_scores_gemma":[0.99897206,0.00018799584,0.00005602634,0.00032094843,0.00027797426,0.00018510455],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005288619,0.00053495466,0.00037201954,0.00091838,0.000846031,0.0017307667,0.0014042812,0.000759491,0.21011156],"category_scores_gemma":[0.0022839697,0.0006007482,0.00037641657,0.0006580882,0.00048250423,0.0025277894,0.0021833656,0.0011865891,0.07677193],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000500524,0.00014118601,0.001603598,0.0002389804,0.000018980281,0.00032528886,0.00046234918,0.0036813193,0.015185577,0.19323017,0.5359799,0.24863213],"study_design_scores_gemma":[0.000031543677,0.000047338173,0.00044293157,0.000032445132,0.000008008217,0.0002121139,0.000032159624,0.006461014,0.002596393,0.0089036655,0.98121613,0.000016257902],"about_ca_topic_score_codex":0.003472025,"about_ca_topic_score_gemma":0.008761868,"teacher_disagreement_score":0.78988844,"about_ca_system_score_codex":0.00082596554,"about_ca_system_score_gemma":0.001340129,"threshold_uncertainty_score":0.7028932},"labels":[],"label_agreement":null},{"id":"W2916425158","doi":"10.1109/glocom.2018.8647443","title":"Enabling Adaptive Data Prefetching in 5G Mobile Networks with Edge Caching","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Carleton University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer network; Edge device; Operating system; Telecommunications; Cloud computing","score_opus":0.04303594260969475,"score_gpt":0.25422477082670947,"score_spread":0.21118882821701473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916425158","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.20679568,0.0010970519,0.78701794,0.00040173807,0.0000775588,0.00008600251,0.000059009028,0.00049549,0.0039694957],"genre_scores_gemma":[0.9710562,0.00020143807,0.027881382,0.00005927569,0.000022659016,0.000022844422,0.000025106805,0.0000074992427,0.00072366686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996538,0.00010337819,0.000021392765,0.00005183079,0.0000785645,0.000090971414],"domain_scores_gemma":[0.9995023,0.00022199066,0.000058625155,0.000079286554,0.000113022776,0.000024688645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034026758,0.00041114673,0.0004907783,0.00024362278,0.00055401534,0.000452585,0.00083556265,0.00060460996,0.00056381105],"category_scores_gemma":[0.0011521165,0.00017149451,0.00020778798,0.00059870956,0.00037346256,0.0010559271,0.000613819,0.00039575735,0.00011187391],"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.000623405,0.00019951479,0.00478343,0.00020050722,0.000073569856,0.0010390218,0.00022767643,0.7162041,0.059930384,0.041598983,0.0036349057,0.1714845],"study_design_scores_gemma":[0.000008420788,0.00004916787,0.00020206695,0.0000049568407,0.000012132066,0.000057702873,0.000022176811,0.9927838,0.0034877462,0.0027282082,0.0006357597,0.000007927872],"about_ca_topic_score_codex":0.0046009817,"about_ca_topic_score_gemma":0.008014419,"teacher_disagreement_score":0.0046009817,"about_ca_system_score_codex":0.00069209404,"about_ca_system_score_gemma":0.0007134485,"threshold_uncertainty_score":0.009148359},"labels":[],"label_agreement":null},{"id":"W2917506592","doi":"10.1109/glocom.2018.8647302","title":"Probabilistic Cooperative Caching in VANETs for Social Networking","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Computer network; Cache; Probabilistic logic; Network packet; Path (computing); Closeness; Vehicular ad hoc network; Exploit; Scheme (mathematics); Mobile social network; Cellular network; Cellular traffic; Content delivery; Mobile computing; Wireless; Wireless ad hoc network; Computer security; Artificial intelligence","score_opus":0.04227147088244484,"score_gpt":0.28104752670224287,"score_spread":0.23877605581979802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917506592","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.021668663,0.0032193696,0.9650239,0.0008200519,0.0003270624,0.00023902292,0.00039444203,0.0006354123,0.007672082],"genre_scores_gemma":[0.8731521,0.0039120144,0.11250532,0.00030050243,0.00026224213,0.0005231732,0.00058770523,0.00011963208,0.008637398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876946,0.0006016902,0.00005656252,0.0001541487,0.0002684192,0.00014972525],"domain_scores_gemma":[0.9983064,0.00090375857,0.00020047318,0.00022543652,0.00028456893,0.00007937936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013826374,0.00089479506,0.0011892183,0.000983092,0.0009889812,0.001586632,0.0019488399,0.0011082481,0.0020581246],"category_scores_gemma":[0.0051992587,0.00052041805,0.00093787245,0.0019120415,0.0008097733,0.0018574153,0.0015678388,0.0011655211,0.00049107475],"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.00006728767,0.000034968863,0.0009917018,0.00014955754,0.000059453465,0.0002120181,0.000099208584,0.8461123,0.0012107214,0.12107627,0.0033393034,0.026647173],"study_design_scores_gemma":[0.000006707296,0.000026790476,0.00014676421,0.000018352412,0.000013506176,0.000066134715,0.00004333508,0.9591872,0.00022312254,0.036985926,0.0032658295,0.000016377391],"about_ca_topic_score_codex":0.016311051,"about_ca_topic_score_gemma":0.021301106,"teacher_disagreement_score":0.016311051,"about_ca_system_score_codex":0.0018345113,"about_ca_system_score_gemma":0.0015714944,"threshold_uncertainty_score":0.0324322},"labels":[],"label_agreement":null},{"id":"W2918686014","doi":"10.1109/ccnc.2019.8651773","title":"A Bee Colony-based Algorithm for Micro-cache Placement Close to End Users in Fog-based Content Delivery Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"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; Cache; Server; Latency (audio); Replica; Cloud computing; Computer network; Content delivery; Distributed computing; Quality of service; Operating system","score_opus":0.023622670920867492,"score_gpt":0.23245964731403518,"score_spread":0.20883697639316767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918686014","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.048363548,0.00044852844,0.9464421,0.00026392122,0.00007163931,0.00015919149,0.00004765794,0.00046690385,0.0037365167],"genre_scores_gemma":[0.60952127,0.0003016585,0.38567433,0.00018874819,0.000029399449,0.00037016108,0.000114745424,0.00006713639,0.0037324827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997745,0.000057794223,0.000012668783,0.000050043258,0.00006399,0.000041001083],"domain_scores_gemma":[0.9996743,0.00015400992,0.000046431473,0.000019138522,0.00007080643,0.000035326906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038930055,0.0008717518,0.0009880159,0.00048453675,0.00067659625,0.00057186186,0.0017275574,0.001049624,0.001122707],"category_scores_gemma":[0.0009530485,0.00039072862,0.00043252096,0.0005491807,0.0004286861,0.00062057696,0.00075133605,0.0005406726,0.00018317347],"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.000059502698,0.00006525042,0.0007819182,0.00004605631,0.000043567372,0.000120929784,0.0000916771,0.93998086,0.0041037234,0.0026219108,0.0016151152,0.050469562],"study_design_scores_gemma":[0.000013215839,0.000026249621,0.0000964057,0.0000036861288,0.000007769902,0.000020260375,0.000015032688,0.9985936,0.00036058138,0.00053852564,0.00032031388,0.000004260618],"about_ca_topic_score_codex":0.009524131,"about_ca_topic_score_gemma":0.010274453,"teacher_disagreement_score":0.009524131,"about_ca_system_score_codex":0.0007667376,"about_ca_system_score_gemma":0.001044882,"threshold_uncertainty_score":0.018937409},"labels":[],"label_agreement":null},{"id":"W2920618578","doi":"10.1109/infocom.2019.8737635","title":"Joint Content Distribution and Traffic Engineering of Adaptive Videos in Telco-CDNs","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Traffic engineering; The Internet; Network topology; Distributed computing; Service (business); Software deployment; Server; Popularity; World Wide Web; Operating system","score_opus":0.022121324922416228,"score_gpt":0.18007733642791823,"score_spread":0.157956011505502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920618578","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.5728149,0.00015158791,0.42198858,0.0001291268,0.00002465173,0.00012917114,0.00007544905,0.0014166476,0.0032699145],"genre_scores_gemma":[0.9479259,0.00003960446,0.05122307,0.00002255828,0.0000056596405,0.00002702686,0.000067364446,0.00005072957,0.0006381573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951386,0.0001470715,0.000023986038,0.00009288617,0.00012350811,0.00009872643],"domain_scores_gemma":[0.9981969,0.0009759201,0.00012847694,0.0001715248,0.00041088788,0.000116221105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007940389,0.00048310796,0.00044109183,0.000949821,0.00045962518,0.00092168385,0.0009897117,0.0005974097,0.00071712676],"category_scores_gemma":[0.0035019757,0.00019882676,0.00020820346,0.00067320623,0.00071230176,0.0009593021,0.00056920166,0.0004592422,0.0001129107],"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.00022607148,0.00020147716,0.004928279,0.00003667517,0.000020776797,0.00019093111,0.00014270068,0.9032885,0.020721601,0.0064125527,0.00067129533,0.06315907],"study_design_scores_gemma":[0.0000068848526,0.000016948783,0.00019466068,9.197548e-7,0.000002327791,0.00001865419,0.000013756481,0.99496573,0.003882202,0.0007311679,0.00016423492,0.0000024287144],"about_ca_topic_score_codex":0.008925238,"about_ca_topic_score_gemma":0.0068231826,"teacher_disagreement_score":0.008925238,"about_ca_system_score_codex":0.0017705467,"about_ca_system_score_gemma":0.00091078295,"threshold_uncertainty_score":0.017746568},"labels":[],"label_agreement":null},{"id":"W2921250680","doi":"10.48550/arxiv.1812.09459","title":"Optimal Cache Placement for Modified Coded Caching with Arbitrary Cache Size","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Cache; Computer science; Cache invalidation; Smart Cache; Cache algorithms; Cache coloring; Scheme (mathematics); Parallel computing; CPU cache; Cache-oblivious algorithm; Linear programming; Algorithm; Mathematics","score_opus":0.07680420736718181,"score_gpt":0.19111187315071018,"score_spread":0.11430766578352837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921250680","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.18754409,0.00067075866,0.80304736,0.0007007182,0.00008638418,0.00012421339,0.00022342763,0.00019113,0.007411958],"genre_scores_gemma":[0.90584654,0.00035238088,0.089982435,0.00011106434,0.000036107413,0.000114162634,0.0001025609,0.00006022498,0.0033945714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994073,0.00021865896,0.00002045801,0.00010120117,0.0001125124,0.0001398798],"domain_scores_gemma":[0.9977028,0.0014415694,0.00024702586,0.00014664789,0.00034295683,0.00011899942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836978,0.0007764391,0.00083810993,0.0004987117,0.000428075,0.0010746113,0.0014160244,0.001173427,0.0015253013],"category_scores_gemma":[0.006149671,0.0004172778,0.00044081968,0.0010481422,0.0010075661,0.001463112,0.0008376265,0.0008758578,0.00015346607],"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.000075907345,0.000041259053,0.00049080374,0.00006054049,0.000017745499,0.00014817131,0.000043947766,0.96092254,0.002596831,0.02814977,0.00094442145,0.0065080305],"study_design_scores_gemma":[0.000008143058,0.000017577635,0.00007546407,0.0000038244298,0.000005340419,0.00002084573,0.00001456269,0.99562365,0.00041254755,0.003630072,0.0001829357,0.00000512022],"about_ca_topic_score_codex":0.011463387,"about_ca_topic_score_gemma":0.007500433,"teacher_disagreement_score":0.011463387,"about_ca_system_score_codex":0.002779176,"about_ca_system_score_gemma":0.0018948753,"threshold_uncertainty_score":0.022793293},"labels":[],"label_agreement":null},{"id":"W2921833176","doi":"10.1109/jsac.2019.2906791","title":"Cloud-Edge Coordinated Processing: Low-Latency Multicasting Transmission","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":51,"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":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Latency (audio); Cloud computing; Multicast; Baseband; Transmission (telecommunications); Enhanced Data Rates for GSM Evolution; Data transmission; Distributed computing; Operating system; Bandwidth (computing); Telecommunications","score_opus":0.029403774276318823,"score_gpt":0.27966179202223246,"score_spread":0.2502580177459136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921833176","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.091221154,0.0008677338,0.8996734,0.00026112475,0.00008522827,0.00011277911,0.00014095278,0.00082520203,0.0068124314],"genre_scores_gemma":[0.9280886,0.0002628883,0.070108175,0.00010039872,0.00003832482,0.000059612048,0.000096877724,0.000031166146,0.0012140607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992945,0.00012923444,0.000024759614,0.00012650057,0.00020452785,0.00022041483],"domain_scores_gemma":[0.9991283,0.00027520984,0.00012744406,0.00016214851,0.00023848157,0.00006850927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071271794,0.0007507763,0.00091087975,0.00042843318,0.0009812411,0.0008772806,0.0016633541,0.00059114327,0.0014677354],"category_scores_gemma":[0.0015515479,0.00018716906,0.0003755843,0.0009635212,0.00047863933,0.001187082,0.0011205444,0.0006204962,0.00022522513],"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.00097298634,0.00023698446,0.0019742907,0.00032140594,0.00009987733,0.00062012766,0.00022479046,0.71398056,0.048312,0.041318,0.008984509,0.18295458],"study_design_scores_gemma":[0.00001864695,0.0001242115,0.00019835071,0.000006969358,0.00001606096,0.000087188004,0.00003953595,0.9893378,0.0059098843,0.003249124,0.0010029264,0.000009323435],"about_ca_topic_score_codex":0.005863287,"about_ca_topic_score_gemma":0.0070264824,"teacher_disagreement_score":0.005863287,"about_ca_system_score_codex":0.0012969275,"about_ca_system_score_gemma":0.0014035319,"threshold_uncertainty_score":0.011658311},"labels":[],"label_agreement":null},{"id":"W2926243032","doi":"10.1007/s00530-019-00611-1","title":"Joint optimization of routing and VM resource allocation for multimedia cloud","year":2019,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Quality of service; Resource allocation; Computer network; Routing (electronic design automation); Heuristic; Distributed computing","score_opus":0.020370282889644327,"score_gpt":0.21809871367151298,"score_spread":0.19772843078186866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926243032","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.2288126,0.0019943826,0.75613576,0.0010331103,0.00022337167,0.00014209651,0.00020766888,0.000618639,0.010832331],"genre_scores_gemma":[0.95802426,0.00023619739,0.03928869,0.000058276022,0.000046214755,0.000032178596,0.000048850135,0.00006089525,0.0022043453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994804,0.00015228253,0.000012096496,0.00006759572,0.00008306791,0.0002045505],"domain_scores_gemma":[0.99944407,0.0002789862,0.00007392039,0.000038183418,0.00009192963,0.00007292254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085141056,0.00076859456,0.0011524716,0.00051308743,0.0005079456,0.0011148608,0.0010658995,0.00086698454,0.0022292454],"category_scores_gemma":[0.0016347605,0.0004044354,0.00041962953,0.0008490203,0.00039554143,0.0008719039,0.0006634472,0.0005693731,0.00018643381],"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.00013088773,0.00006623528,0.00045073702,0.000041078132,0.000028005186,0.000035901423,0.000011081142,0.97149414,0.0029765517,0.0031513334,0.0012817914,0.020332297],"study_design_scores_gemma":[0.0000044679664,0.000014188487,0.000085865155,9.5006186e-7,0.000005913818,0.0000059207196,0.000005172552,0.99891496,0.00026178194,0.00061274343,0.0000864431,0.0000015889661],"about_ca_topic_score_codex":0.009706973,"about_ca_topic_score_gemma":0.010435032,"teacher_disagreement_score":0.009706973,"about_ca_system_score_codex":0.001561933,"about_ca_system_score_gemma":0.0023375978,"threshold_uncertainty_score":0.019300938},"labels":[],"label_agreement":null},{"id":"W2929710725","doi":"10.1109/tsipn.2019.2932678","title":"Integrating PHY Security Into NDN-IoT Networks By Exploiting MEC: Authentication Efficiency, Robustness, and Accuracy Enhancement","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Spoofing attack; Authentication (law); Robustness (evolution); Authentication protocol; Challenge–response authentication; Exploit; Replay attack; Data Authentication Algorithm","score_opus":0.0054402516824490574,"score_gpt":0.2095002343177927,"score_spread":0.20405998263534364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929710725","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.0571037,0.0005642378,0.9347679,0.00028821937,0.00010801828,0.00008663874,0.000025802368,0.0006633533,0.0063921404],"genre_scores_gemma":[0.9102971,0.0002717647,0.08789832,0.0001377787,0.00003072869,0.000030479583,0.000038510705,0.000019867955,0.0012754835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880767,0.00033220224,0.00011183265,0.00016888705,0.00046869073,0.000110769186],"domain_scores_gemma":[0.9986186,0.00030516193,0.00015582654,0.00046996027,0.0004106418,0.000039915165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014014769,0.00050636,0.00047607618,0.00046398077,0.00046222867,0.0010437727,0.0008396055,0.00061015657,0.0007966449],"category_scores_gemma":[0.0032134585,0.00016956704,0.0002653965,0.00040498847,0.0007231251,0.0020674968,0.0019326122,0.0006749765,0.00037405815],"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.0007780433,0.00020416954,0.0077787233,0.00035455753,0.00009070662,0.0008463476,0.00035837584,0.15257083,0.25773212,0.093270004,0.0020461532,0.48396993],"study_design_scores_gemma":[0.00002555821,0.0002651478,0.001353058,0.000047261732,0.00005394675,0.0010365859,0.00006681284,0.87146366,0.10318166,0.012101986,0.0103581725,0.000046155074],"about_ca_topic_score_codex":0.00040132453,"about_ca_topic_score_gemma":0.0004667121,"teacher_disagreement_score":0.0014014769,"about_ca_system_score_codex":0.00061049225,"about_ca_system_score_gemma":0.00046626522,"threshold_uncertainty_score":0.0074118376},"labels":[],"label_agreement":null},{"id":"W2936312117","doi":"10.1109/icassp.2019.8682723","title":"Latency Driven Fronthaul Bandwidth Allocation and Cooperative Beamforming for Cache-enabled Cloud-based Small Cell Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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 British Columbia","funders":"","keywords":"Computer science; Multicast; Computer network; Cache; Small cell; Quality of service; Latency (audio); Bandwidth allocation; Karush–Kuhn–Tucker conditions; Base station; Integer programming; Bandwidth (computing); Distributed computing; Mathematical optimization; Algorithm; Telecommunications","score_opus":0.010133448545272736,"score_gpt":0.19408274639848302,"score_spread":0.1839492978532103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936312117","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.034958772,0.00042370855,0.9624031,0.00016067752,0.000035142974,0.000031215102,0.000032902375,0.00007445113,0.001879948],"genre_scores_gemma":[0.91782266,0.0005731901,0.07861049,0.00007745545,0.00005051566,0.00008848897,0.0000520298,0.00003041014,0.002694829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966586,0.00009495564,0.0000094199395,0.00005465427,0.000093021226,0.0000820119],"domain_scores_gemma":[0.99963,0.00020336495,0.000055274548,0.000017550967,0.00006411268,0.00002973223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049045566,0.00075989973,0.00064718234,0.00028657034,0.00048352036,0.000594131,0.000847269,0.0005949748,0.0008012834],"category_scores_gemma":[0.0011203699,0.00023895122,0.00024762424,0.00071618013,0.000507289,0.00089674484,0.0006101979,0.00054777914,0.0001304103],"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.00008786526,0.000061493236,0.0004931006,0.0000821246,0.000018948791,0.00010679519,0.000059332975,0.94301915,0.009775281,0.01417995,0.000913138,0.031202838],"study_design_scores_gemma":[0.0000026719395,0.000018825485,0.000035292873,0.0000013018939,0.0000026502921,0.000009915084,0.000008921283,0.9982817,0.00048373837,0.0010102065,0.00014241364,0.0000023856894],"about_ca_topic_score_codex":0.005065006,"about_ca_topic_score_gemma":0.0058502075,"teacher_disagreement_score":0.005065006,"about_ca_system_score_codex":0.000998166,"about_ca_system_score_gemma":0.001043903,"threshold_uncertainty_score":0.010071039},"labels":[],"label_agreement":null},{"id":"W2936366530","doi":"10.1109/icin.2019.8685875","title":"Optimal Cache Budget Distribution for Hierarchical ICN Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Cache; Computer science; Network topology; Computer network; Locality; Information-centric networking; Smart Cache; Cache algorithms; False sharing; Distributed computing; Path (computing); CPU cache","score_opus":0.009438872937393782,"score_gpt":0.22078149651321738,"score_spread":0.2113426235758236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936366530","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.4596603,0.0015847042,0.52286094,0.00066162314,0.000043689117,0.00018439567,0.0005532936,0.00045288083,0.013998241],"genre_scores_gemma":[0.9794223,0.0003187048,0.018621206,0.000040529783,0.000010713933,0.00004702582,0.00011238171,0.000045148794,0.0013820867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994178,0.00023821127,0.000019393578,0.00009526465,0.00008311706,0.00014614177],"domain_scores_gemma":[0.9979646,0.0011332841,0.0003052254,0.00015622577,0.00029087698,0.00014979135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015092087,0.000747126,0.00079293305,0.00090375246,0.00055914465,0.001232531,0.0013046545,0.00075733516,0.0010697662],"category_scores_gemma":[0.0061543044,0.00043135247,0.00026849282,0.0013226981,0.00067577296,0.0018985332,0.0007923031,0.0004785027,0.00012751564],"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.000040746138,0.000025052337,0.0009536616,0.00004032839,0.00001164964,0.00003431921,0.000041825533,0.9834699,0.00087326905,0.0085286945,0.0006134315,0.0053670797],"study_design_scores_gemma":[0.0000044079657,0.000020011837,0.00032687938,0.0000066643843,0.00000716982,0.000018344675,0.000045340163,0.9948015,0.00033038642,0.004162757,0.000271692,0.000004834089],"about_ca_topic_score_codex":0.015982166,"about_ca_topic_score_gemma":0.016663484,"teacher_disagreement_score":0.015982166,"about_ca_system_score_codex":0.0047088484,"about_ca_system_score_gemma":0.0013623681,"threshold_uncertainty_score":0.034165204},"labels":[],"label_agreement":null},{"id":"W2940299710","doi":"10.1109/tmc.2019.2911935","title":"<i>Razor</i>: Scaling Backend Capacity for Mobile Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","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 Toronto","funders":"Wuhan University; National Natural Science Foundation of China","keywords":"Computer science; Burstiness; Schedule; Mobile device; Computer network; Real-time computing; Key (lock); Distributed computing; Term (time); Operating system; Network packet","score_opus":0.016744550679614365,"score_gpt":0.24322299262574373,"score_spread":0.22647844194612937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940299710","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.10463462,0.002979437,0.7790868,0.001950013,0.00065094477,0.0007842093,0.0011883795,0.0964841,0.012241381],"genre_scores_gemma":[0.714573,0.0008564099,0.27377534,0.0014373667,0.00025126064,0.00031240296,0.0012637307,0.001979355,0.0055510476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852496,0.00026538037,0.00012922894,0.0004019759,0.00040732138,0.00027106426],"domain_scores_gemma":[0.99651426,0.0006741302,0.00039887484,0.0011712331,0.0008599021,0.0003815445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017938893,0.0024075944,0.00075824105,0.0013214647,0.0007987699,0.0018245728,0.005741793,0.0012097481,0.004565156],"category_scores_gemma":[0.0057837004,0.0007095284,0.0006585788,0.000954377,0.001042319,0.0034736225,0.00244917,0.0016581116,0.0019966254],"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.002517645,0.0007583281,0.012757721,0.00078810414,0.0002784141,0.0005436189,0.00058005186,0.15695582,0.11633108,0.013603994,0.071593516,0.62329173],"study_design_scores_gemma":[0.00015887848,0.0008146133,0.0023774488,0.00007405974,0.00008885355,0.0003444944,0.00011138825,0.9108654,0.057411063,0.0055884547,0.021986423,0.0001788504],"about_ca_topic_score_codex":0.0065128626,"about_ca_topic_score_gemma":0.0071007065,"teacher_disagreement_score":0.0065128626,"about_ca_system_score_codex":0.001392111,"about_ca_system_score_gemma":0.0014066215,"threshold_uncertainty_score":0.015271962},"labels":[],"label_agreement":null},{"id":"W2941475555","doi":"10.1007/s10922-019-09497-w","title":"Latency Control of ICN Enabled 5G Networks","year":2019,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Ericsson (Canada)","funders":"","keywords":"Computer science; Backhaul (telecommunications); Computer network; Latency (audio); Network congestion; Cache; Wireless; Wireless network; Distributed computing; Base station; Telecommunications","score_opus":0.006926113298285255,"score_gpt":0.18450193165091877,"score_spread":0.17757581835263353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941475555","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.5663855,0.008166153,0.38139004,0.0013198081,0.0009428367,0.00015730137,0.0003875718,0.0018372207,0.039413556],"genre_scores_gemma":[0.9964276,0.00018626619,0.0023982853,0.00003795402,0.000030047935,0.000008016477,0.000020601463,0.000014221361,0.0008769573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.00009387802,0.00003055675,0.000119166165,0.0002499919,0.0002644672],"domain_scores_gemma":[0.99843377,0.0005814452,0.00015647191,0.000089569105,0.00065182155,0.000086980675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474902,0.00064112915,0.0004633644,0.0005376429,0.00083597243,0.0015057328,0.0007529211,0.000325113,0.00194992],"category_scores_gemma":[0.0024810738,0.00016651872,0.00012154757,0.0005762439,0.00039154297,0.0007512215,0.0006049826,0.00051804096,0.0001721656],"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.0019079561,0.0003303244,0.0044929665,0.00044633172,0.00008538308,0.00045793568,0.00063987926,0.6026158,0.14532012,0.056163654,0.0075507564,0.17998894],"study_design_scores_gemma":[0.000016743996,0.00017724313,0.00077731593,0.00002141077,0.000035921494,0.000058521204,0.000100021265,0.98422897,0.008858579,0.0038221518,0.0018842621,0.000018854906],"about_ca_topic_score_codex":0.008539186,"about_ca_topic_score_gemma":0.015920378,"teacher_disagreement_score":0.008539186,"about_ca_system_score_codex":0.0021860048,"about_ca_system_score_gemma":0.0013441651,"threshold_uncertainty_score":0.01697898},"labels":[],"label_agreement":null},{"id":"W2944716998","doi":"10.1109/twc.2019.2908398","title":"Joint Minimization of Wired and Wireless Traffic for Content Delivery by Multicast Pushing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Multicast; Wireless network; Wireless; Wi-Fi array; Distributed computing; Telecommunications","score_opus":0.04852126626453998,"score_gpt":0.24573600718592772,"score_spread":0.19721474092138774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944716998","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.057718977,0.00023396665,0.93901145,0.00014131682,0.000015007237,0.00006966596,0.000025141575,0.000110246634,0.002674183],"genre_scores_gemma":[0.7371471,0.00042102512,0.25980857,0.00005639572,0.00004721633,0.000206627,0.00006162948,0.00010430314,0.0021470939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927324,0.00027768468,0.000023934112,0.00006257443,0.00024589954,0.00011664539],"domain_scores_gemma":[0.9992955,0.00039195994,0.000098877834,0.000044620683,0.00012996861,0.00003914166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011865353,0.0010422822,0.0009560484,0.00071547856,0.00055221224,0.0008954552,0.0011024341,0.00071339787,0.0009756367],"category_scores_gemma":[0.0023464218,0.00039695285,0.0005087541,0.0009293013,0.00055527006,0.0011229604,0.0009877143,0.00065069686,0.00024416996],"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.00013651873,0.0001692431,0.0010580044,0.00019847623,0.000053784443,0.00015195397,0.00013659988,0.83496666,0.046527635,0.030679625,0.0010337965,0.0848877],"study_design_scores_gemma":[0.000005734596,0.00005529044,0.000116846204,0.000004544805,0.000010240958,0.0000361337,0.000022692277,0.99288565,0.0042115594,0.0022794849,0.00036629435,0.000005561427],"about_ca_topic_score_codex":0.0011580129,"about_ca_topic_score_gemma":0.0012551496,"teacher_disagreement_score":0.0011865353,"about_ca_system_score_codex":0.0010756484,"about_ca_system_score_gemma":0.0012825821,"threshold_uncertainty_score":0.0078044534},"labels":[],"label_agreement":null},{"id":"W2945400041","doi":"10.1016/j.comnet.2019.05.008","title":"Coded multicasting in cache-enabled vehicular ad hoc network","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multicast; Computer network; Wireless ad hoc network; Cache; Vehicular ad hoc network; Source-specific multicast; Distributed computing; Wireless","score_opus":0.01063141649255198,"score_gpt":0.20280210028855528,"score_spread":0.1921706837960033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945400041","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.4127597,0.0026077188,0.5760472,0.00054997497,0.00028357178,0.00010032623,0.0002776943,0.0007480643,0.00662577],"genre_scores_gemma":[0.979006,0.0003033549,0.018910322,0.000034718185,0.00002891268,0.00001850039,0.000073495525,0.00001564804,0.0016090244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995142,0.00014358139,0.000021629781,0.00005466636,0.00015274047,0.00011307512],"domain_scores_gemma":[0.9981839,0.0008345006,0.00012073198,0.00018048589,0.0006183411,0.00006198525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006307506,0.00031907062,0.00066658796,0.0008950018,0.0007817534,0.0006810231,0.0010908258,0.0005767648,0.0006248391],"category_scores_gemma":[0.0025890283,0.00022148862,0.00018767516,0.0011216139,0.000456342,0.0008342178,0.00053970335,0.0003875888,0.00009719554],"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.0008998957,0.00018277937,0.0037264102,0.00031306536,0.000101908685,0.00093707396,0.00044678597,0.7330589,0.042309027,0.07924992,0.0059883604,0.13278581],"study_design_scores_gemma":[0.0000086925065,0.000056946672,0.00018961544,0.000008661095,0.000017356644,0.00010610961,0.00004244314,0.99104464,0.0029610791,0.004803456,0.0007501124,0.000010851353],"about_ca_topic_score_codex":0.008496331,"about_ca_topic_score_gemma":0.00994164,"teacher_disagreement_score":0.008496331,"about_ca_system_score_codex":0.0013095195,"about_ca_system_score_gemma":0.0009956345,"threshold_uncertainty_score":0.016893804},"labels":[],"label_agreement":null},{"id":"W2946574388","doi":"10.1109/jsac.2019.2916280","title":"Economically Optimal MS Association for Multimedia Content Delivery in Cache-Enabled Heterogeneous Cloud Radio Access Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":101,"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":"National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Cloud computing; Quality of service; Radio access network; Wireless network; Wireless; Base station; Mobile station; Telecommunications; Operating system","score_opus":0.04163894882783781,"score_gpt":0.273207789333327,"score_spread":0.2315688405054892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946574388","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.21343914,0.0012133551,0.78016716,0.0004909395,0.00006768551,0.00009525373,0.00006865313,0.00015093875,0.0043068645],"genre_scores_gemma":[0.9792864,0.00030603848,0.019468153,0.00003902783,0.000022487759,0.00002344019,0.000023358874,0.000015054291,0.0008160527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993142,0.0002566021,0.00002123539,0.0000955975,0.00014505944,0.00016730477],"domain_scores_gemma":[0.99912554,0.00050560274,0.0001379698,0.0000435319,0.00011602332,0.000071400114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009075475,0.000713711,0.00091271894,0.0005414421,0.00071988004,0.0009934807,0.0011405075,0.0006922807,0.0008135453],"category_scores_gemma":[0.0024970034,0.00032933758,0.00036508605,0.0008909459,0.0005830458,0.0015557418,0.0008607694,0.0005712629,0.00010330121],"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.00019527548,0.00011598756,0.0018239237,0.000076011165,0.000039236194,0.00030861425,0.00007691384,0.9222518,0.005563998,0.026744174,0.0014404069,0.041363683],"study_design_scores_gemma":[0.0000041886565,0.000021975895,0.0001412694,0.0000021453611,0.000008566236,0.00003185345,0.000020180296,0.99628437,0.0004195007,0.0028709176,0.00019058795,0.0000043499012],"about_ca_topic_score_codex":0.0055159847,"about_ca_topic_score_gemma":0.006299876,"teacher_disagreement_score":0.0055159847,"about_ca_system_score_codex":0.0020391112,"about_ca_system_score_gemma":0.0012133694,"threshold_uncertainty_score":0.0147948265},"labels":[],"label_agreement":null},{"id":"W2947759080","doi":"10.1016/j.peva.2018.09.006","title":"Worst-case bounds and optimized cache on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e2260\" altimg=\"si453.gif\"><mml:mi>M</mml:mi></mml:math>th request cache insertion policies under elastic conditions","year":2018,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Cache; Bandwidth (computing); Cloud computing; Online algorithm; CPU cache; Upper and lower bounds; Competitive analysis; Average cost","score_opus":0.03297753809922176,"score_gpt":0.2783680073841614,"score_spread":0.24539046928493963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947759080","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.75596535,0.0090503255,0.13373706,0.0034118053,0.00059020374,0.0005315094,0.011670314,0.010398335,0.07464522],"genre_scores_gemma":[0.9596687,0.0006968968,0.031087,0.00023713638,0.00011113712,0.00015422916,0.0027170156,0.0008016198,0.004526319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9841652,0.0042053596,0.00081382773,0.001613391,0.004401563,0.004800616],"domain_scores_gemma":[0.9415887,0.037703916,0.0034812074,0.007899008,0.0076253833,0.0017018508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009361381,0.002106903,0.001930473,0.002924348,0.0018127201,0.005153146,0.0033280712,0.0017869344,0.010480522],"category_scores_gemma":[0.03760803,0.0008324371,0.00085726246,0.004880225,0.0018548454,0.0054892953,0.0019619705,0.0016728537,0.0016688425],"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.0037211182,0.00043391946,0.00284395,0.00037823094,0.00015023668,0.00012571001,0.00015215845,0.9266325,0.004959615,0.01582532,0.016356485,0.028420731],"study_design_scores_gemma":[0.00012074797,0.0003084257,0.0014187015,0.000044025313,0.00008026514,0.00009046538,0.00018664394,0.9849526,0.0050960425,0.0063783573,0.001277904,0.000045818346],"about_ca_topic_score_codex":0.027601628,"about_ca_topic_score_gemma":0.038450595,"teacher_disagreement_score":0.027601628,"about_ca_system_score_codex":0.009076434,"about_ca_system_score_gemma":0.009892692,"threshold_uncertainty_score":0.06585443},"labels":[],"label_agreement":null},{"id":"W2948129794","doi":"10.1109/cybermatics_2018.2018.00073","title":"Context-Aware Proactive Caching for Heterogeneous Networks with Energy Harvesting: An Online Learning Approach","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Manitoba","funders":"","keywords":"Computer science; Context (archaeology); Energy (signal processing); Computer network","score_opus":0.039886402491655856,"score_gpt":0.23882833063243442,"score_spread":0.19894192814077855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948129794","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.050273612,0.00081995636,0.9460138,0.000560749,0.0000611508,0.000065302425,0.00004087566,0.00026712654,0.0018974562],"genre_scores_gemma":[0.95040953,0.0003095739,0.04738674,0.00023016178,0.00008672784,0.00011249081,0.000055028453,0.000028056,0.0013817248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953866,0.00013970514,0.000025079684,0.00013246281,0.00007878179,0.00008544509],"domain_scores_gemma":[0.99738413,0.0019310755,0.00023142106,0.000115387935,0.00022032225,0.000117653544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011195184,0.00093159464,0.0016830692,0.00046010606,0.00046796325,0.00091108156,0.0019351358,0.0015454207,0.0011768271],"category_scores_gemma":[0.0041975174,0.0005237727,0.00054054434,0.000579583,0.00093363936,0.0014493805,0.0011546485,0.0013416096,0.00015163778],"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.00005312144,0.00009081496,0.0008078799,0.000046915284,0.00004032454,0.000067801346,0.000034827663,0.9752303,0.0005460764,0.0036383884,0.00029498758,0.019148557],"study_design_scores_gemma":[0.0000043376804,0.000009961335,0.000036795922,0.000001696164,0.000004148354,0.00000484535,0.0000035869698,0.9988416,0.00006180938,0.0009906498,0.000039031012,0.0000016536536],"about_ca_topic_score_codex":0.007246534,"about_ca_topic_score_gemma":0.005428658,"teacher_disagreement_score":0.007246534,"about_ca_system_score_codex":0.0010306534,"about_ca_system_score_gemma":0.0012886119,"threshold_uncertainty_score":0.014408708},"labels":[],"label_agreement":null},{"id":"W2949509433","doi":"","title":"Internet of Drones","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Drone; Architecture; The Internet; Key (lock); Computer science; Computer network; Network architecture; Control (management); Internet traffic; Computer security; World Wide Web; Artificial intelligence; Geography","score_opus":0.07991774525682262,"score_gpt":0.16872428669734402,"score_spread":0.0888065414405214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949509433","genre_codex":"other","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.05606685,0.0088361455,0.41217345,0.007610455,0.0011156239,0.00045302088,0.0027828757,0.0045945765,0.506367],"genre_scores_gemma":[0.73052555,0.015136388,0.10660919,0.0019604587,0.0006529994,0.0004147096,0.00479335,0.00044121995,0.13946623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964154,0.0000752874,0.000024889163,0.0000937639,0.000118580334,0.00004588868],"domain_scores_gemma":[0.99908924,0.00016669255,0.00007176081,0.00034933945,0.00021199988,0.00011087653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034105126,0.00037614917,0.00031686138,0.0010173052,0.0009722715,0.003579202,0.0008941406,0.0011938125,0.013530812],"category_scores_gemma":[0.002261552,0.00028016075,0.00028694162,0.0013650436,0.00084473455,0.0050316714,0.0016759711,0.0012684496,0.0030474407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000042855183,0.00003329915,0.0006603739,0.00014298104,0.000018973575,0.00018101906,0.00025673807,0.0056647337,0.0025814055,0.9092764,0.019725448,0.06141578],"study_design_scores_gemma":[0.000028162889,0.00005590987,0.0008396816,0.00020600847,0.00002847517,0.0005470138,0.00032797345,0.04401871,0.0031305877,0.23223943,0.71853954,0.000038547303],"about_ca_topic_score_codex":0.004381001,"about_ca_topic_score_gemma":0.0030562384,"teacher_disagreement_score":0.013530812,"about_ca_system_score_codex":0.0011143857,"about_ca_system_score_gemma":0.00091325433,"threshold_uncertainty_score":0.04526508},"labels":[],"label_agreement":null},{"id":"W2949740658","doi":"10.48550/arxiv.1612.07889","title":"Information-Centric Wireless Networks with Virtualization and D2D Communications","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Program for Changjiang Scholars and Innovative Research Team in University; Natural Sciences and Engineering Research Council of Canada; Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; National Science Foundation; State Key Laboratory of Networking and Switching Technology; China Scholarship Council; Beijing University of Posts and Telecommunications","keywords":"Computer science; Backhaul (telecommunications); Computer network; Cellular network; Wireless; Virtualization; Wireless network; Radio access network; Distributed computing; Telecommunications; Cloud computing; Base station; Mobile station","score_opus":0.037089097427271206,"score_gpt":0.1632252713741255,"score_spread":0.1261361739468543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949740658","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.045998003,0.003682134,0.93303335,0.0010163669,0.0002559327,0.00009939022,0.00010101866,0.00038263624,0.015431238],"genre_scores_gemma":[0.94232595,0.0018157682,0.053487066,0.00015619326,0.00010241363,0.00006595077,0.00007800794,0.000019165518,0.0019494001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993049,0.00027444307,0.000028323893,0.00008897719,0.00015733253,0.00014595689],"domain_scores_gemma":[0.9994987,0.00019326105,0.00005661338,0.000105062485,0.000091584705,0.000054764656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059279555,0.0006413962,0.0004795655,0.00041378386,0.00067385036,0.0017960268,0.0011413123,0.00068465015,0.0007819802],"category_scores_gemma":[0.0012548162,0.00019654137,0.00040827776,0.0011066594,0.00073897233,0.0018791185,0.0015225918,0.0008192425,0.00014579625],"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.00018702837,0.0001209886,0.001928473,0.0002475631,0.00009929915,0.000584191,0.0001850535,0.5479022,0.009532501,0.32373732,0.007681609,0.10779367],"study_design_scores_gemma":[0.000012721672,0.000047757912,0.00023396048,0.0000150903115,0.000025421166,0.00022840765,0.000064677806,0.9612734,0.0020026315,0.027536264,0.008542031,0.000017543856],"about_ca_topic_score_codex":0.0055005136,"about_ca_topic_score_gemma":0.0039473395,"teacher_disagreement_score":0.0055005136,"about_ca_system_score_codex":0.0013282418,"about_ca_system_score_gemma":0.0013186982,"threshold_uncertainty_score":0.010937035},"labels":[],"label_agreement":null},{"id":"W2950210752","doi":"","title":"Had You Looked Where I'm Looking: Cross-user Similarities in Viewing Behavior for 360$^{\\circ}$ Video and Caching Implications","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Bandwidth (computing); Cache; Context (archaeology); Video on demand; Quality of experience; Computer network; Multimedia; Quality of service","score_opus":0.07778554618279203,"score_gpt":0.2258054911774496,"score_spread":0.1480199449946576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950210752","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.9897822,0.00025262026,0.0038091417,0.00026312858,0.000011314725,0.000014180764,0.00025734422,0.000043170694,0.0055669006],"genre_scores_gemma":[0.9981369,0.00009721644,0.00089555455,0.000047963567,0.000005791961,0.000005371595,0.00016978002,0.000012101845,0.00062934763],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99938774,0.00027691305,0.000026226715,0.0001385867,0.00011190848,0.000058646954],"domain_scores_gemma":[0.99334246,0.0038995005,0.00079800433,0.0005307841,0.0010490861,0.000380261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089470606,0.00013715714,0.00027619186,0.00074617297,0.00042039584,0.001158281,0.0002614781,0.00036020714,0.0024882928],"category_scores_gemma":[0.00946796,0.00011109309,0.00013102581,0.0010050428,0.0003958379,0.0012520427,0.00046693085,0.00043492683,0.0004036185],"study_design_candidate":"observational","study_design_consensus":"observational","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.00097995,0.00021939352,0.85821337,0.00011583586,0.00012904198,0.00069289736,0.012016157,0.0017970456,0.0073271566,0.004928807,0.003378494,0.110201925],"study_design_scores_gemma":[0.000007947623,0.00022387541,0.9567791,0.000040295785,0.000055164754,0.001332113,0.012396786,0.019671382,0.0023749701,0.0031087345,0.0039505055,0.00005915657],"about_ca_topic_score_codex":0.0125830285,"about_ca_topic_score_gemma":0.02002211,"teacher_disagreement_score":0.0125830285,"about_ca_system_score_codex":0.0004906361,"about_ca_system_score_gemma":0.0002540716,"threshold_uncertainty_score":0.025019526},"labels":[],"label_agreement":null},{"id":"W2950329549","doi":"10.1145/3326285.3329059","title":"Proactive inter-datacenter multicast with realtime and bulk transfers","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Multicast; Computer science; Distributed computing; Network topology; Transfer (computing); Computer network; Key (lock); Routing (electronic design automation); Interconnection; File transfer; Network delay; Parallel computing; Operating system","score_opus":0.007403696832012225,"score_gpt":0.19129244696927822,"score_spread":0.183888750137266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950329549","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.23369417,0.0006158046,0.76096606,0.00042720957,0.000074615564,0.0001502739,0.00005629943,0.0016156097,0.0023999633],"genre_scores_gemma":[0.8905413,0.00009890472,0.1080618,0.00007938128,0.00004014902,0.000054095395,0.000059303486,0.000038894843,0.0010262317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992155,0.00028856122,0.000037876125,0.00014305946,0.00019790672,0.00011719246],"domain_scores_gemma":[0.9977424,0.0011867142,0.00029091514,0.00045238613,0.0001898776,0.00013776487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020389073,0.000695963,0.0008268905,0.00045688607,0.0007889546,0.00085053523,0.0013928256,0.0010520512,0.0006588817],"category_scores_gemma":[0.0038060795,0.0003275643,0.00033332896,0.00046417254,0.0005550936,0.0015220707,0.001448632,0.00082554104,0.0001490454],"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.0009933268,0.00032385872,0.003856359,0.00016961193,0.000091139096,0.00021616397,0.0003553634,0.7330228,0.026281795,0.020352786,0.0027464428,0.21159036],"study_design_scores_gemma":[0.000030014293,0.000104768675,0.00023173164,0.000005520007,0.000011133751,0.00006142755,0.000046352558,0.98972744,0.004480136,0.0046358993,0.0006591072,0.0000065645363],"about_ca_topic_score_codex":0.0017710667,"about_ca_topic_score_gemma":0.0016335269,"teacher_disagreement_score":0.0020389073,"about_ca_system_score_codex":0.0009989467,"about_ca_system_score_gemma":0.0010832126,"threshold_uncertainty_score":0.0107828975},"labels":[],"label_agreement":null},{"id":"W2950945524","doi":"10.48550/arxiv.1102.3059","title":"Profit-Aware Server Allocation for Green Internet Services","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"Eurostars; European Commission","keywords":"Server; Profit (economics); Computer science; The Internet; Computer network; Quality of service; Service provider; Electricity; Environmental economics; Service (business); Business; Operations research; Microeconomics; World Wide Web; Economics; Marketing; Engineering","score_opus":0.09316671526196685,"score_gpt":0.18203647430077827,"score_spread":0.08886975903881142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950945524","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.31249955,0.0010672191,0.6765578,0.0007990331,0.000100122896,0.00017029367,0.00010248453,0.0015537381,0.007149721],"genre_scores_gemma":[0.9615329,0.00012861809,0.036775228,0.000052222065,0.000023741208,0.000023896922,0.00003033282,0.00004956178,0.0013834607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992956,0.0002927777,0.000022408141,0.00008075934,0.0001597453,0.00014870429],"domain_scores_gemma":[0.9984092,0.00083694357,0.00014452009,0.00022322591,0.00021864066,0.00016747223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013651932,0.0005300046,0.0008511433,0.00075184426,0.00090505404,0.0011734136,0.0012326714,0.00087165425,0.001689968],"category_scores_gemma":[0.002945552,0.00027179753,0.00019629118,0.0011533442,0.00072435377,0.0015082195,0.0008900482,0.0006325033,0.0003682293],"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.0011398806,0.00053513295,0.0032567682,0.00014163785,0.00006730034,0.00039036313,0.00026601215,0.69467825,0.035775825,0.045385752,0.0066137183,0.21174935],"study_design_scores_gemma":[0.000017078579,0.000044058517,0.0003457172,0.000003221271,0.000011671417,0.00006061613,0.00003837421,0.98771113,0.002841357,0.008260106,0.00065673114,0.000009997422],"about_ca_topic_score_codex":0.0030599006,"about_ca_topic_score_gemma":0.004170765,"teacher_disagreement_score":0.0030599006,"about_ca_system_score_codex":0.002140634,"about_ca_system_score_gemma":0.0012045141,"threshold_uncertainty_score":0.01553154},"labels":[],"label_agreement":null},{"id":"W2951543943","doi":"10.1145/3329785.3329922","title":"Performance Analysis and Automatic Tuning of Hash Aggregation on GPUs","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"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":"Horizon 2020; Banting and Best Diabetes Centre, University of Toronto; Deutsche Forschungsgemeinschaft; Nvidia","keywords":"Computer science; Hash function; Parallel computing; Heuristics; Execution time; Replicate; CUDA; Graphics; Dependency (UML); General-purpose computing on graphics processing units; Algorithm; Computer graphics (images); Programming language; Operating system","score_opus":0.009039321772734662,"score_gpt":0.20226553353726112,"score_spread":0.19322621176452645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951543943","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.9415224,0.0008914013,0.044262525,0.00021243063,0.0000947308,0.00009125468,0.00024330009,0.007163885,0.0055180793],"genre_scores_gemma":[0.9567036,0.000115009985,0.041820128,0.000043636803,0.000013298817,0.00004003101,0.00036448095,0.00039317078,0.00050662993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99789304,0.00045364432,0.00015876572,0.00033850383,0.00071240286,0.0004435957],"domain_scores_gemma":[0.99632984,0.0014828027,0.00023118085,0.00094659755,0.0008296799,0.0001800057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018614054,0.0010228452,0.0007099454,0.0010956372,0.0006907188,0.0013197452,0.0015610809,0.0006971389,0.0013906234],"category_scores_gemma":[0.008382582,0.0005151302,0.0004300349,0.001594747,0.0005653148,0.0013132636,0.00084880873,0.0007835452,0.00043146446],"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.0029703006,0.00056134386,0.035770964,0.00036480775,0.00023377685,0.00033154222,0.0006078712,0.5152749,0.15807107,0.004054788,0.008725408,0.27303326],"study_design_scores_gemma":[0.00009543946,0.0002483904,0.0057255733,0.000009882563,0.00003237038,0.00005334918,0.00008848916,0.9582463,0.033077434,0.0007865894,0.0016084703,0.000027646007],"about_ca_topic_score_codex":0.008323725,"about_ca_topic_score_gemma":0.007199232,"teacher_disagreement_score":0.008323725,"about_ca_system_score_codex":0.0013437702,"about_ca_system_score_gemma":0.0017279973,"threshold_uncertainty_score":0.01655054},"labels":[],"label_agreement":null},{"id":"W2951591356","doi":"","title":"Vous avez dit «outperform» ! En êtes-vous sûr ?","year":2017,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Caching and Content Delivery","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":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Humanities; Philosophy; Physics","score_opus":0.023286243658391836,"score_gpt":0.2331209866450692,"score_spread":0.20983474298667737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951591356","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016003067,0.020519836,0.019249365,0.7971058,0.024450472,0.00002653915,0.0010207614,0.0021605128,0.11946364],"genre_scores_gemma":[0.4639956,0.020422766,0.029528476,0.16151474,0.031690367,0.000111206995,0.0011942125,0.00456864,0.28697398],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950917,0.0014714797,0.0001787547,0.0007047371,0.0017906225,0.0007627074],"domain_scores_gemma":[0.983424,0.0055564106,0.0006759437,0.0027159315,0.0056093363,0.002018281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006763925,0.0010420976,0.0013346608,0.0011717828,0.0041734083,0.010705604,0.0014793989,0.005265618,0.04268004],"category_scores_gemma":[0.03658527,0.00037616157,0.000538931,0.002060899,0.0048898514,0.020791763,0.0039440654,0.0081165815,0.017651226],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0003728717,0.000055992637,0.0014740162,0.00021261054,0.0000583359,0.000105861494,0.0006492284,0.00091935525,0.001607173,0.3318986,0.5061342,0.1565117],"study_design_scores_gemma":[0.0000383115,0.00008280265,0.0013278465,0.0002782422,0.000042493033,0.00021317026,0.0016191948,0.0029285762,0.0017076316,0.27049264,0.7211771,0.00009200484],"about_ca_topic_score_codex":0.011443572,"about_ca_topic_score_gemma":0.013943223,"teacher_disagreement_score":0.04268004,"about_ca_system_score_codex":0.0044175857,"about_ca_system_score_gemma":0.0037622524,"threshold_uncertainty_score":0.142779},"labels":[],"label_agreement":null},{"id":"W2951800620","doi":"10.48550/arxiv.1707.09662","title":"Adaptive Delivery in Caching Networks","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Redundancy (engineering); Computer network; Upper and lower bounds; Transmission (telecommunications); Popularity; Transmission rate; Content delivery; Distributed computing; Real-time computing; Mathematics; Telecommunications; Operating system","score_opus":0.0925739385889539,"score_gpt":0.1810849314283024,"score_spread":0.0885109928393485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951800620","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.054271683,0.0016203837,0.93937004,0.00046757635,0.00007558522,0.00008782367,0.000101636564,0.00042343486,0.0035818613],"genre_scores_gemma":[0.8155155,0.00144537,0.17777875,0.00021981275,0.00011292524,0.00016811314,0.00017732594,0.00013008504,0.0044520237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989022,0.0004886631,0.000045937813,0.00017729388,0.0002572123,0.00012861285],"domain_scores_gemma":[0.99564016,0.0031484624,0.00032162893,0.00031287147,0.00047629877,0.00010053819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016643474,0.00070047274,0.0009841195,0.00086701795,0.00079668587,0.0012932806,0.0015792752,0.0015385646,0.0016026649],"category_scores_gemma":[0.009462336,0.00056308816,0.00047647272,0.0014034336,0.0011149617,0.001846576,0.0010654218,0.0012842751,0.00026985529],"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.0002992998,0.000058814177,0.0009994145,0.00025006052,0.0000703982,0.00029578464,0.00020280185,0.8454282,0.00858072,0.08159473,0.0036801836,0.05853957],"study_design_scores_gemma":[0.00001519443,0.0000323092,0.00012014209,0.000009491833,0.000013350864,0.000078320474,0.000022703764,0.9824462,0.0013175907,0.014970588,0.0009654682,0.000008646155],"about_ca_topic_score_codex":0.0034590224,"about_ca_topic_score_gemma":0.0016814066,"teacher_disagreement_score":0.0034590224,"about_ca_system_score_codex":0.002201117,"about_ca_system_score_gemma":0.00068650476,"threshold_uncertainty_score":0.01597023},"labels":[],"label_agreement":null},{"id":"W2957995827","doi":"10.1109/icc.2019.8761491","title":"Collaborative Content Distribution in 5G Mobile Networks with Edge Caching","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Cache; Computer network; Exploit; Enhanced Data Rates for GSM Evolution; Bandwidth (computing); Network topology; Cellular network; Context (archaeology); Core network; Distributed computing; Content distribution; Computer security; Telecommunications","score_opus":0.007483707611125926,"score_gpt":0.19887218659639339,"score_spread":0.19138847898526745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957995827","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.32573378,0.0031911703,0.6626738,0.0005363499,0.0001058049,0.00016072507,0.00018823003,0.0011573927,0.006252714],"genre_scores_gemma":[0.9713842,0.00024152292,0.027351944,0.000076000375,0.000034300672,0.000023024211,0.000055156048,0.000018869789,0.00081502175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926454,0.00021852953,0.000034113098,0.00015442584,0.00014692465,0.00018157312],"domain_scores_gemma":[0.99912804,0.00029519026,0.000094547,0.00016982078,0.00022003643,0.00009235753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008205535,0.00065282336,0.0011439447,0.0006952685,0.00091877993,0.001092895,0.0017503368,0.0010652584,0.0006489027],"category_scores_gemma":[0.002019973,0.00026839098,0.00039504477,0.0012888709,0.00044022023,0.0016985589,0.0012422818,0.00045463647,0.00016747204],"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.0010262874,0.00044650413,0.007973412,0.00022476575,0.00024247699,0.0011118746,0.000520505,0.66888857,0.02527025,0.025982838,0.007115169,0.26119733],"study_design_scores_gemma":[0.00003593865,0.00007951757,0.00050532154,0.000008380234,0.00004943488,0.00014498063,0.00010335323,0.99005413,0.0031207683,0.0043401048,0.0015448843,0.000013264991],"about_ca_topic_score_codex":0.010548304,"about_ca_topic_score_gemma":0.013561206,"teacher_disagreement_score":0.010548304,"about_ca_system_score_codex":0.0013974853,"about_ca_system_score_gemma":0.00092363055,"threshold_uncertainty_score":0.020973802},"labels":[],"label_agreement":null},{"id":"W2958397769","doi":"10.1109/icc.2019.8762067","title":"Smart Caching: Empower the Video Delivery for 5G-ICN Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Popularity; Quality of experience; Computer network; Non-negative matrix factorization; Feature (linguistics); Multimedia; Matrix decomposition; Quality of service","score_opus":0.010344589595223606,"score_gpt":0.20919327457267498,"score_spread":0.19884868497745137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958397769","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.06086164,0.002881143,0.9303634,0.0007598243,0.00019136477,0.00009142994,0.00021420968,0.00088145817,0.0037555303],"genre_scores_gemma":[0.8844278,0.001513431,0.11117082,0.00030462755,0.0001547433,0.000055572702,0.00025341244,0.000038732447,0.00208092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996822,0.00010167444,0.000014341506,0.00006806981,0.00007858785,0.000055266257],"domain_scores_gemma":[0.9994747,0.0001957744,0.000073434174,0.00008793866,0.0001339579,0.00003433447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057514815,0.00063800183,0.0006272392,0.00034621285,0.00038378374,0.0005621371,0.00083085574,0.00063787843,0.0008747398],"category_scores_gemma":[0.0018513262,0.00017636636,0.0002940334,0.00071038125,0.00031622458,0.0014710418,0.0004256532,0.0005244141,0.00020181919],"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.00045004464,0.00021216637,0.0066121155,0.00034932914,0.00015819959,0.00041447126,0.0002861389,0.39309835,0.038728427,0.034547858,0.014498723,0.5106442],"study_design_scores_gemma":[0.000010646052,0.00007900109,0.0005108012,0.000013649233,0.000027570655,0.00010984848,0.000030508998,0.987705,0.002748928,0.0058070873,0.0029429279,0.0000139800195],"about_ca_topic_score_codex":0.009867245,"about_ca_topic_score_gemma":0.012579291,"teacher_disagreement_score":0.009867245,"about_ca_system_score_codex":0.0007750021,"about_ca_system_score_gemma":0.00085765304,"threshold_uncertainty_score":0.019619644},"labels":[],"label_agreement":null},{"id":"W2960485398","doi":"10.48550/arxiv.1904.10882","title":"Joint Long-Term Cache Allocation and Short-Term Content Delivery in Green Cloud Small Cell Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Cache; Computer network; Multicast; Cloud computing; Small cell; Distributed computing; Quality of service; Enhanced Data Rates for GSM Evolution; Radio access network; Mobile edge computing; Cellular network; Base station; Server; Mobile station","score_opus":0.10638256661349955,"score_gpt":0.18047148375553068,"score_spread":0.07408891714203113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960485398","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.19769278,0.00082847604,0.79867953,0.00036254615,0.000042430813,0.00004547328,0.000057832996,0.00012978121,0.0021612274],"genre_scores_gemma":[0.9786927,0.00025289782,0.020142177,0.000042289314,0.000014839001,0.000028941631,0.000022831679,0.000013866575,0.000789502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969554,0.00009963042,0.000008239563,0.000048581136,0.00007461604,0.00007349258],"domain_scores_gemma":[0.9994716,0.000297578,0.000070247865,0.000027436596,0.00008629123,0.000046792666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007641587,0.00045657152,0.0005846725,0.0002321344,0.00039782983,0.00061373913,0.0007203498,0.00056089496,0.00047486607],"category_scores_gemma":[0.0015547852,0.00023029013,0.00022261728,0.00048389655,0.0005530925,0.00073943136,0.0004948185,0.00035573592,0.000063314576],"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.00009740823,0.000032954456,0.0006630769,0.00003766925,0.000017370601,0.000073385585,0.000032813274,0.9718046,0.004998863,0.00667735,0.00038733592,0.015177078],"study_design_scores_gemma":[0.0000029292873,0.000015582966,0.000081827406,0.0000010825574,0.0000036924046,0.000006316228,0.000006929845,0.9982582,0.0005392598,0.0010090177,0.00007332891,0.0000018836652],"about_ca_topic_score_codex":0.0073787645,"about_ca_topic_score_gemma":0.0067956,"teacher_disagreement_score":0.0073787645,"about_ca_system_score_codex":0.0012930606,"about_ca_system_score_gemma":0.0011186992,"threshold_uncertainty_score":0.014671624},"labels":[],"label_agreement":null},{"id":"W2962424639","doi":"10.1109/icc.2019.8761705","title":"An Optimal Peak Hour Content Server Cache Update Scheduling Algorithm for 5G HetNets","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"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 British Columbia","funders":"","keywords":"Computer science; Cache; Markov decision process; Heuristics; Scheduling (production processes); Server; Computer network; Distributed computing; Algorithm; Markov process; Real-time computing; Mathematical optimization; Operating system","score_opus":0.031107820179499392,"score_gpt":0.2515341022006478,"score_spread":0.22042628202114842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962424639","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.14384581,0.00047834613,0.8508073,0.000340746,0.00006448693,0.00008620684,0.00015634118,0.00045645368,0.003764307],"genre_scores_gemma":[0.89869106,0.00016996126,0.09960828,0.00007334299,0.0000239825,0.00006532139,0.00014782527,0.000036498564,0.0011838286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997003,0.00007111646,0.000012723585,0.00006513851,0.0000638352,0.00008687964],"domain_scores_gemma":[0.99961483,0.0001908829,0.00006640054,0.000022278695,0.00006766602,0.0000379055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004497973,0.00044406235,0.00077490933,0.0003642116,0.00046654732,0.00057123345,0.00078740856,0.00050833286,0.001017031],"category_scores_gemma":[0.0009155758,0.00029129896,0.00030199176,0.0005793251,0.00037292502,0.0005483159,0.00035455936,0.00041035592,0.00012481965],"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.00012537622,0.000046252306,0.00073448656,0.000025907017,0.000019857425,0.000040948675,0.000047076384,0.96111333,0.0021864157,0.005040284,0.0013528235,0.029267171],"study_design_scores_gemma":[0.000010243438,0.000015285897,0.00010319924,0.000001245647,0.0000035175235,0.000008612145,0.000011628609,0.99824995,0.00029710005,0.0011571735,0.00013937327,0.0000026880532],"about_ca_topic_score_codex":0.009922932,"about_ca_topic_score_gemma":0.010611807,"teacher_disagreement_score":0.009922932,"about_ca_system_score_codex":0.0012659095,"about_ca_system_score_gemma":0.0024027652,"threshold_uncertainty_score":0.01973033},"labels":[],"label_agreement":null},{"id":"W2962576838","doi":"10.1109/icc.2019.8761840","title":"Cutting Down Idle Listening Time: A NDN-Enabled Power Saving Mode Design for WLAN","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Idle; Wireless; Power consumption; Computer network; Real-time computing; State (computer science); Power (physics); Transmission (telecommunications); Energy consumption; Channel (broadcasting); Embedded system; Throughput; Operating system; Telecommunications; Electrical engineering","score_opus":0.014813675293226457,"score_gpt":0.23081574504502225,"score_spread":0.21600206975179578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962576838","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.16865097,0.002321551,0.81456405,0.0006980676,0.0002398689,0.00019870928,0.00015400849,0.0023413075,0.0108314445],"genre_scores_gemma":[0.9323332,0.00041688338,0.06406916,0.0002501538,0.000058016434,0.00010762469,0.00007459624,0.00006400868,0.0026263788],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997342,0.000045695575,0.000023947165,0.000063753105,0.00007600283,0.000056273508],"domain_scores_gemma":[0.9997241,0.00003998089,0.0000453713,0.000031413096,0.00012340164,0.00003574763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033005045,0.00042874657,0.0003561102,0.00041186734,0.00034109224,0.0006114787,0.0017806379,0.00027582503,0.0014363021],"category_scores_gemma":[0.000458046,0.00021611319,0.00025513847,0.00024249328,0.00028099644,0.00085254596,0.00061668234,0.000382001,0.00034083155],"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.0010487258,0.00041640247,0.0072322167,0.00057610485,0.00014905228,0.0005995092,0.0006871585,0.056890566,0.49594322,0.015285801,0.008308337,0.4128629],"study_design_scores_gemma":[0.00015508852,0.0010446743,0.0028241454,0.00007720117,0.00018047684,0.000730894,0.0001845456,0.8344693,0.13513713,0.003025754,0.022074299,0.00009651233],"about_ca_topic_score_codex":0.0019491572,"about_ca_topic_score_gemma":0.00346801,"teacher_disagreement_score":0.0019491572,"about_ca_system_score_codex":0.00082725583,"about_ca_system_score_gemma":0.00056169793,"threshold_uncertainty_score":0.0060021877},"labels":[],"label_agreement":null},{"id":"W2962718958","doi":"10.1109/jsac.2018.2844638","title":"Optimized Base-Station Cache Allocation for Cloud Radio Access Network With Multicast Backhaul","year":2018,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":59,"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; National Natural Science Foundation of China","keywords":"Backhaul (telecommunications); Computer science; Computer network; Multicast; Cache; Base station; Radio access network; Distributed computing; Mobile station","score_opus":0.06321244226432866,"score_gpt":0.31924059348996614,"score_spread":0.2560281512256375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962718958","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.0990979,0.0005329735,0.89783114,0.00013708211,0.000025710338,0.00004320236,0.00006426166,0.00021448109,0.0020532953],"genre_scores_gemma":[0.9284045,0.00024383779,0.07040741,0.000043958433,0.000020852145,0.000060596143,0.000060769875,0.000028497156,0.00072962494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960417,0.00012493465,0.00001548408,0.000055209166,0.000107080785,0.000093144736],"domain_scores_gemma":[0.9992962,0.0003812165,0.000103752405,0.000049461094,0.00013484084,0.00003453883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006890331,0.0006661837,0.0006442113,0.0003322132,0.00033230474,0.00060239114,0.00078369863,0.0004629962,0.000654915],"category_scores_gemma":[0.0020972576,0.00023376821,0.00028464574,0.00063532783,0.0003878085,0.0007405186,0.0005089442,0.00039954585,0.0001377736],"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.00011521888,0.000046587546,0.000756628,0.000051265168,0.000024098688,0.000062073465,0.00003255764,0.95749664,0.008124614,0.0060678404,0.0007034023,0.026519002],"study_design_scores_gemma":[0.0000033612935,0.000014011949,0.000058198897,0.0000013308539,0.0000037109244,0.000007202876,0.0000054635457,0.9986563,0.0005735324,0.0006071788,0.000067868496,0.0000019338768],"about_ca_topic_score_codex":0.0049664755,"about_ca_topic_score_gemma":0.0076009906,"teacher_disagreement_score":0.0049664755,"about_ca_system_score_codex":0.0010461106,"about_ca_system_score_gemma":0.0010750674,"threshold_uncertainty_score":0.009875119},"labels":[],"label_agreement":null},{"id":"W2962907855","doi":"10.1109/glocom.2017.8254675","title":"Secure Video Streaming in Heterogeneous Small Cell Networks with Untrusted Cache Helpers","year":2017,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"","keywords":"Computer science; Cache; Computer network; Eavesdropping; Transmitter power output; Scalable Video Coding; Integer programming; Exploit; Base station; Scalability; Distributed computing; Algorithm; Operating system","score_opus":0.013789266152424502,"score_gpt":0.19929903472098204,"score_spread":0.18550976856855753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962907855","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.19725226,0.0009224968,0.7979721,0.0003435614,0.000047120542,0.000070092465,0.00007875043,0.00015372175,0.0031598846],"genre_scores_gemma":[0.96858895,0.00047327793,0.029822866,0.00003971465,0.00002763939,0.000035510537,0.00004317399,0.000010799819,0.00095818203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994823,0.00019322507,0.000018422541,0.00008340495,0.00011136893,0.00011122712],"domain_scores_gemma":[0.99891543,0.0007057958,0.00013066037,0.0000750421,0.00011833453,0.00005471819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095984,0.0008805383,0.00077667995,0.00032268683,0.0005233964,0.00077029434,0.00063905894,0.000538638,0.0005304546],"category_scores_gemma":[0.001933823,0.00028799076,0.0003325846,0.00080608285,0.00076234544,0.0011465969,0.00066484674,0.0006069014,0.0001231037],"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.0002654421,0.00004444456,0.00073112757,0.000063754545,0.000040409537,0.00027585743,0.00005986775,0.9519879,0.010753395,0.0114159295,0.00042919474,0.023932729],"study_design_scores_gemma":[0.000008637301,0.0000423277,0.00006547139,0.0000021761634,0.0000073687074,0.000025517098,0.000018061713,0.996732,0.0012452631,0.0017494974,0.00010044592,0.0000032311575],"about_ca_topic_score_codex":0.0043639895,"about_ca_topic_score_gemma":0.0040990375,"teacher_disagreement_score":0.0043639895,"about_ca_system_score_codex":0.0010546733,"about_ca_system_score_gemma":0.00067855965,"threshold_uncertainty_score":0.008677185},"labels":[],"label_agreement":null},{"id":"W2963101645","doi":"10.1109/iccw.2018.8403707","title":"When Exploiting Individual User Preference Is Beneficial for Caching at Base Stations","year":2018,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Locality; Download; Preference; Popularity; Base station; Computer network; Base (topology); Locality of reference; Distributed computing; World Wide Web; Cache","score_opus":0.10583052765325474,"score_gpt":0.27182308285538864,"score_spread":0.1659925552021339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963101645","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.5043286,0.000930105,0.48813152,0.00050248404,0.00008704546,0.0001509975,0.0002578783,0.00038022271,0.00523113],"genre_scores_gemma":[0.9834223,0.00015561859,0.015592463,0.00007719756,0.00002999325,0.00002490116,0.00004866157,0.000020241081,0.0006286142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836165,0.0004775838,0.00009502024,0.00045487282,0.00022475411,0.00038626778],"domain_scores_gemma":[0.99634546,0.0015699732,0.0004833412,0.00086479855,0.00045527305,0.00028123168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016456955,0.001023199,0.0016744822,0.00039080778,0.00086148496,0.00149487,0.0015076539,0.0011762667,0.0009942771],"category_scores_gemma":[0.0074584186,0.0004179478,0.00048508047,0.0014198979,0.0005734748,0.0022043136,0.000602842,0.00071212766,0.00034710715],"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.0015009278,0.0010001387,0.061202094,0.0005990571,0.0009329922,0.0018785341,0.00057721906,0.64773315,0.09831251,0.034961727,0.0036238553,0.14767781],"study_design_scores_gemma":[0.00008911657,0.0009679197,0.012885894,0.00003136477,0.00040530483,0.0013656475,0.00077234476,0.9302253,0.023584858,0.026297027,0.0032769402,0.00009826428],"about_ca_topic_score_codex":0.0034694753,"about_ca_topic_score_gemma":0.0073082726,"teacher_disagreement_score":0.0034694753,"about_ca_system_score_codex":0.0007432856,"about_ca_system_score_gemma":0.0013476362,"threshold_uncertainty_score":0.008703411},"labels":[],"label_agreement":null},{"id":"W2963148427","doi":"10.1109/tvt.2019.2930885","title":"Analysis of a Distance-Based Pairing Scheme for Collaborative Content Distribution via Device-to-Device Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairing; Scheme (mathematics); Content distribution; Computer science; Computer network; Electronic engineering; Engineering; Physics; Mathematics","score_opus":0.03168064577762774,"score_gpt":0.2617060696043504,"score_spread":0.23002542382672264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963148427","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.038330708,0.0007170163,0.95134974,0.00037141083,0.000076776385,0.00018024816,0.000057513607,0.00014081114,0.00877583],"genre_scores_gemma":[0.93294305,0.00072557776,0.062484503,0.00009306697,0.000061324194,0.00017198733,0.00005617602,0.00003458469,0.0034297688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768865,0.00094545627,0.00007118105,0.00021143112,0.00073933444,0.00034405728],"domain_scores_gemma":[0.9940486,0.0038149422,0.0005337781,0.00048487072,0.00091390155,0.00020402696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025917252,0.0008929167,0.0012503433,0.001227481,0.001198424,0.001637041,0.0018572818,0.0012917552,0.0032870078],"category_scores_gemma":[0.009353252,0.0004926712,0.00073716126,0.001839898,0.0015262236,0.0017506952,0.0018299635,0.0008783609,0.00051120674],"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.00015239426,0.000068219495,0.0006598917,0.00013661014,0.000040541323,0.00020540241,0.00016934221,0.8600495,0.0051935576,0.114187784,0.0015418277,0.01759492],"study_design_scores_gemma":[0.000006288737,0.00004768006,0.000079457706,0.000006244989,0.000009199468,0.00008740923,0.000022133927,0.99357975,0.00049003644,0.0051840986,0.00047859055,0.000009169512],"about_ca_topic_score_codex":0.0025651264,"about_ca_topic_score_gemma":0.0017152098,"teacher_disagreement_score":0.0035577556,"about_ca_system_score_codex":0.0035577556,"about_ca_system_score_gemma":0.002050408,"threshold_uncertainty_score":0.02581346},"labels":[],"label_agreement":null},{"id":"W2963254016","doi":"10.1109/isit.2016.7541415","title":"Caching and delivery via interference elimination","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":51,"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; Decoding methods; Scheme (mathematics); Cache; Interference (communication); Metric (unit); Rank (graph theory); Separable space; Computer network; Theoretical computer science; Algorithm; Channel (broadcasting); Mathematics","score_opus":0.015045525494692673,"score_gpt":0.20523234800336257,"score_spread":0.1901868225086699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963254016","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.032782882,0.00092005945,0.9599203,0.00031379197,0.00006774298,0.000098114535,0.00009161771,0.0007222046,0.0050832927],"genre_scores_gemma":[0.6858166,0.0012054621,0.30532673,0.00031753958,0.00016278954,0.00020660074,0.00023183641,0.00011917867,0.006613333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981154,0.0004922993,0.000106790765,0.0002128965,0.00080345996,0.00026908846],"domain_scores_gemma":[0.9962071,0.0010780006,0.0003608685,0.0012238093,0.00096611644,0.00016411633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013259047,0.0010777992,0.0014665136,0.00093082053,0.00089139893,0.0016993565,0.0020073843,0.0009942524,0.0017097726],"category_scores_gemma":[0.0056542275,0.00042555892,0.0005028469,0.0020728507,0.0011343937,0.0033364885,0.002702924,0.0013031376,0.00074446265],"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.0010816652,0.00039700873,0.0019780335,0.00063626515,0.00019187918,0.0008845469,0.0008689165,0.2634952,0.09086581,0.33827183,0.009134575,0.2921943],"study_design_scores_gemma":[0.00007911768,0.00030299535,0.00030966758,0.000034397828,0.00008313569,0.0007086945,0.00009427482,0.91075724,0.033214033,0.044658426,0.009691173,0.00006681981],"about_ca_topic_score_codex":0.0020735038,"about_ca_topic_score_gemma":0.0017518162,"teacher_disagreement_score":0.0020735038,"about_ca_system_score_codex":0.0017018846,"about_ca_system_score_gemma":0.0016623915,"threshold_uncertainty_score":0.012348115},"labels":[],"label_agreement":null},{"id":"W2963997272","doi":"10.1109/twc.2017.2770097","title":"Cache-Enabled Physical Layer Security for Video Streaming in Backhaul-Limited Cellular Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":76,"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 British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Backhaul (telecommunications); Cache; Computer network; Physical layer; Optimization problem; Transmitter power output; Base station; Wireless; Channel (broadcasting); Transmitter; Algorithm; Telecommunications","score_opus":0.03852227659712773,"score_gpt":0.28097494174509197,"score_spread":0.24245266514796424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963997272","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.07855729,0.001173587,0.9178563,0.00021785623,0.00004111708,0.000042269505,0.000046037963,0.00024401907,0.0018215092],"genre_scores_gemma":[0.9616327,0.000583347,0.036996864,0.000050631144,0.00003573687,0.000036013724,0.000039364506,0.000016403936,0.0006087769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995931,0.00011510599,0.000021010412,0.000059986356,0.00013356692,0.000077248886],"domain_scores_gemma":[0.99914265,0.00043672664,0.00011400362,0.00013351145,0.00013826457,0.000034851535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046012778,0.0006229221,0.0006597784,0.00028138785,0.00045545524,0.0007166509,0.00082231784,0.0005793776,0.0004630889],"category_scores_gemma":[0.0016642847,0.00020524139,0.00034578436,0.0005516005,0.00068432296,0.0011392512,0.00073147484,0.00070738484,0.00011126495],"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.00032253412,0.00009746958,0.0016028018,0.00033628318,0.00009484936,0.0006333524,0.0002325458,0.771819,0.07147248,0.05497288,0.0014740715,0.09694183],"study_design_scores_gemma":[0.0000067545257,0.000055681172,0.00012038793,0.0000072382804,0.000014428259,0.00006453975,0.000013363252,0.991927,0.0038340345,0.0035400402,0.00040949014,0.000007074781],"about_ca_topic_score_codex":0.0020680015,"about_ca_topic_score_gemma":0.0026398906,"teacher_disagreement_score":0.0020680015,"about_ca_system_score_codex":0.00069239386,"about_ca_system_score_gemma":0.0007697978,"threshold_uncertainty_score":0.005023718},"labels":[],"label_agreement":null},{"id":"W2964007775","doi":"10.48550/arxiv.1907.08756","title":"Joint Fronthaul Multicast and Cooperative Beamforming for Cache-Enabled Cloud-Based Small Cell Networks: An MDS Codes-Aided Approach","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Multicast; Computer network; Base station; Beamforming; Distributed computing; Transmission (telecommunications); Telecommunications","score_opus":0.08957252394911491,"score_gpt":0.1835136221165288,"score_spread":0.09394109816741389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964007775","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.015875082,0.00015253252,0.98147696,0.0001408402,0.000017756212,0.00002532044,0.000034321176,0.000072920746,0.0022042901],"genre_scores_gemma":[0.750652,0.00053357956,0.24294047,0.000106020336,0.000053487995,0.00014957895,0.00009900482,0.000039422128,0.0054264707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973494,0.000087416985,0.0000072024086,0.000033188666,0.000098736964,0.00003859765],"domain_scores_gemma":[0.9996057,0.00018524246,0.000058854184,0.00003303288,0.00009217795,0.000024983156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043045142,0.00067725003,0.00047618986,0.0003224734,0.00029738148,0.0005223428,0.00064953323,0.0005668406,0.0012755449],"category_scores_gemma":[0.0010673231,0.00025466093,0.00029085382,0.00061148335,0.000558046,0.0006315444,0.0007024629,0.0005802134,0.00028339095],"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.00006767613,0.000022654183,0.00027863166,0.000050465012,0.000014607124,0.00007333098,0.00005382198,0.9348209,0.008850451,0.0274851,0.000680176,0.027602078],"study_design_scores_gemma":[0.0000034823872,0.000017943523,0.00002293375,0.0000032868797,0.0000023231041,0.000013112596,0.000008569871,0.99619305,0.0010518353,0.0022873825,0.00039275188,0.00000325275],"about_ca_topic_score_codex":0.0030769564,"about_ca_topic_score_gemma":0.004030753,"teacher_disagreement_score":0.0030769564,"about_ca_system_score_codex":0.00089000707,"about_ca_system_score_gemma":0.0011097123,"threshold_uncertainty_score":0.006457448},"labels":[],"label_agreement":null},{"id":"W2964421893","doi":"10.1109/tnse.2019.2932727","title":"Repairable Fountain Coded Storage Systems for Multi-Tier Mobile Edge Caching Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Cloud computing; Exploit; Upload; Locality; Enhanced Data Rates for GSM Evolution; Base station; Mobile edge computing; Distributed computing; Server; Operating system; Computer security; Telecommunications","score_opus":0.014328571936968699,"score_gpt":0.21765231862568615,"score_spread":0.20332374668871744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964421893","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.14072588,0.0024688127,0.8509367,0.0003111187,0.00015140533,0.000107110056,0.000104454986,0.0015989768,0.003595484],"genre_scores_gemma":[0.9600273,0.00025386916,0.038007263,0.000083771716,0.00002437224,0.00004183055,0.000047639594,0.000021315418,0.001492654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.00010254817,0.000028878843,0.00006478855,0.00012794937,0.00010018029],"domain_scores_gemma":[0.9984883,0.0004390014,0.00019947007,0.00028857184,0.000494933,0.000089726105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060388516,0.00050752965,0.00069842703,0.0005620428,0.00090568425,0.0008624882,0.0016106924,0.0007012155,0.0013756349],"category_scores_gemma":[0.0023919311,0.00015387901,0.00023137471,0.00067834754,0.0006384614,0.0013747338,0.0009978713,0.00054441404,0.00027473402],"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.0011099812,0.00018991332,0.0027110565,0.00030412961,0.000105990766,0.0008702585,0.0005064126,0.6740475,0.04219955,0.06802203,0.008106134,0.20182699],"study_design_scores_gemma":[0.00001111156,0.00007369941,0.00013405152,0.000011400628,0.000013094989,0.00013011815,0.000033354823,0.9902626,0.0044458066,0.003694931,0.0011686011,0.000021131853],"about_ca_topic_score_codex":0.007000702,"about_ca_topic_score_gemma":0.008309532,"teacher_disagreement_score":0.007000702,"about_ca_system_score_codex":0.0016904379,"about_ca_system_score_gemma":0.0010169196,"threshold_uncertainty_score":0.0139199495},"labels":[],"label_agreement":null},{"id":"W2967475164","doi":"10.1109/eucnc.2019.8801991","title":"Co-Operative and Hybrid Replacement Caching for Multi-Access Mobile Edge Computing","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Exfo Electro-Optical Engineering (Canada)","funders":"","keywords":"Computer science; Cache; Computer network; Mobile edge computing; Latency (audio); Enhanced Data Rates for GSM Evolution; Distributed computing; Reachability; Server; Algorithm","score_opus":0.03848171304982284,"score_gpt":0.3325439145304664,"score_spread":0.29406220148064355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967475164","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.24745528,0.0019080526,0.74615544,0.00019201223,0.000079249556,0.00007994892,0.000057403944,0.0011876517,0.002884941],"genre_scores_gemma":[0.94848126,0.00017749303,0.05029262,0.000035117137,0.00001858649,0.000018030989,0.00004420431,0.000017289405,0.00091541675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995772,0.00010526491,0.000028416418,0.000075095115,0.00013240805,0.00008163594],"domain_scores_gemma":[0.9989931,0.00022567142,0.00010102185,0.00035074286,0.0002635497,0.00006591388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038122377,0.00034312674,0.0006031572,0.0005481578,0.0005982866,0.0006657572,0.001241075,0.0005226528,0.00043958263],"category_scores_gemma":[0.001424745,0.0001513952,0.0003524314,0.0009104381,0.00032121598,0.0013027722,0.00059168553,0.00041492577,0.00017160688],"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.0013920191,0.00046582535,0.014519175,0.00025463317,0.00025967057,0.0010572395,0.00041230614,0.30022445,0.11088864,0.025753813,0.0059616542,0.53881055],"study_design_scores_gemma":[0.000018708544,0.0001576407,0.00093114655,0.0000082903625,0.00003699981,0.0004359267,0.000053194024,0.97894806,0.015073358,0.0020719147,0.0022449538,0.000019698522],"about_ca_topic_score_codex":0.004135311,"about_ca_topic_score_gemma":0.0072358013,"teacher_disagreement_score":0.004135311,"about_ca_system_score_codex":0.0006154343,"about_ca_system_score_gemma":0.00078003627,"threshold_uncertainty_score":0.008222461},"labels":[],"label_agreement":null},{"id":"W2968000510","doi":"10.1109/tmm.2019.2935683","title":"An SDN-Based Caching Decision Policy for Video Caching in Information-Centric Networking","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":36,"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","keywords":"Computer science; Cache; Software-defined networking; Information-centric networking; Computer network; Leverage (statistics); Network packet; The Internet; Latency (audio); Integer programming; Distributed computing; Algorithm; Telecommunications; Artificial intelligence","score_opus":0.011053392754361456,"score_gpt":0.2563936685861719,"score_spread":0.24534027583181045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968000510","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.061257467,0.0010941537,0.9317984,0.00045728995,0.00020839457,0.00012178208,0.000085554406,0.00033631685,0.0046407217],"genre_scores_gemma":[0.9553122,0.00038664023,0.042970125,0.00015037082,0.000045942543,0.000057911115,0.0000786565,0.000019030698,0.0009791929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932826,0.0001566245,0.000051746752,0.00016511699,0.00017705938,0.00012130597],"domain_scores_gemma":[0.99876225,0.0005471804,0.00013634168,0.000046102617,0.00040897937,0.00009912732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010781556,0.0006518069,0.0007802823,0.0003540264,0.0005964885,0.00096943235,0.0012306834,0.00068947,0.001010789],"category_scores_gemma":[0.002737486,0.00027873696,0.00033557,0.000487028,0.000520492,0.0010071128,0.0005939847,0.00077883,0.00010779475],"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.0002342783,0.00013317484,0.0015570888,0.00015764292,0.000045443005,0.00017157126,0.00009939172,0.9133616,0.0073522497,0.014663799,0.0025994878,0.059624176],"study_design_scores_gemma":[0.00000966296,0.000025940733,0.00006355362,0.000006109197,0.000008884184,0.000017068725,0.000010052469,0.9974353,0.0007632303,0.0013679118,0.00028704616,0.0000052755404],"about_ca_topic_score_codex":0.008910979,"about_ca_topic_score_gemma":0.0104941055,"teacher_disagreement_score":0.008910979,"about_ca_system_score_codex":0.0016612641,"about_ca_system_score_gemma":0.0022736522,"threshold_uncertainty_score":0.017718256},"labels":[],"label_agreement":null},{"id":"W2968757017","doi":"10.20381/ruor-23503","title":"Service-Oriented Information-Centric Vehicular Ad-hoc Networks","year":2019,"lang":"en","type":"dissertation","venue":"uO Research (University of Ottawa)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universidade de Brasília; University of Ottawa","keywords":"Vehicular ad hoc network; Wireless ad hoc network; Mobile ad hoc network; Computer science; Service (business); Computer network; Telecommunications; Business; Wireless","score_opus":0.019496443261513792,"score_gpt":0.2495368411279411,"score_spread":0.23004039786642733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968757017","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038018394,0.0027063289,0.93063396,0.0009936922,0.0003768181,0.00027457703,0.0002747088,0.0007455959,0.025976012],"genre_scores_gemma":[0.83830917,0.0050754547,0.14534964,0.0003096738,0.00018589637,0.0002552431,0.0006472834,0.000051716903,0.009815895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994295,0.00015980829,0.000035568046,0.00006275863,0.00022384607,0.000088394256],"domain_scores_gemma":[0.9995098,0.00012251493,0.000060560797,0.00007342898,0.00019506284,0.000038717608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005805093,0.00047298538,0.0003702586,0.00047140973,0.0005715545,0.0017254116,0.001194603,0.00064193073,0.0011047439],"category_scores_gemma":[0.00093350635,0.0001821909,0.00029406926,0.0011191698,0.0006898058,0.0011123477,0.00079429505,0.00062635384,0.00055732415],"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.000115985145,0.000080703016,0.0019700662,0.00037025096,0.00006385955,0.0003995432,0.00028616234,0.4884376,0.014387652,0.4022268,0.007847929,0.08381348],"study_design_scores_gemma":[0.000021967508,0.00014121966,0.00029878956,0.00003283848,0.000033338565,0.0002249893,0.00014517523,0.8919449,0.0036118526,0.061979264,0.04154258,0.00002312773],"about_ca_topic_score_codex":0.0032024651,"about_ca_topic_score_gemma":0.004331831,"teacher_disagreement_score":0.0032024651,"about_ca_system_score_codex":0.0008811728,"about_ca_system_score_gemma":0.0012102252,"threshold_uncertainty_score":0.0063934326},"labels":[],"label_agreement":null},{"id":"W2970227064","doi":"10.1109/spawc.2019.8815475","title":"Optimal Cache Placement for Modified Coded Caching with Arbitrary Cache Size","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Cache; Computer science; Smart Cache; Cache invalidation; Cache algorithms; Cache coloring; Cache-oblivious algorithm; Scheme (mathematics); Parallel computing; CPU cache; Distributed computing; Mathematics","score_opus":0.031862979384557996,"score_gpt":0.2484780207292654,"score_spread":0.21661504134470738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970227064","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.20015483,0.00059627305,0.7914077,0.0005643443,0.00007487439,0.00011096099,0.00019954587,0.00017175716,0.006719722],"genre_scores_gemma":[0.9022762,0.00031186658,0.09389947,0.00009463783,0.000032717813,0.0001116269,0.00010286681,0.000055634708,0.0031149979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944144,0.00020463948,0.000018579078,0.000092992,0.00011084286,0.00013151308],"domain_scores_gemma":[0.9978986,0.0013002363,0.00023555051,0.00013257326,0.00032278607,0.00011032062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079684384,0.0007348239,0.00078774063,0.00047970196,0.00038732504,0.0010169031,0.0013370235,0.0011177186,0.0013679184],"category_scores_gemma":[0.005421953,0.00039284574,0.00040955556,0.0010351706,0.0009758538,0.0013491252,0.0007908168,0.0007874573,0.0001403299],"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.00006598207,0.000034249006,0.00041443654,0.000048146343,0.00001476211,0.00012958492,0.000035498448,0.9687673,0.0024296318,0.021829069,0.0007311818,0.0055002053],"study_design_scores_gemma":[0.000007887416,0.000015572037,0.000069835434,0.0000032209855,0.000004554758,0.000018601579,0.000012276791,0.996267,0.00041107394,0.0030236351,0.0001615895,0.000004694213],"about_ca_topic_score_codex":0.011291811,"about_ca_topic_score_gemma":0.007084477,"teacher_disagreement_score":0.011291811,"about_ca_system_score_codex":0.0025108997,"about_ca_system_score_gemma":0.0017500244,"threshold_uncertainty_score":0.022452176},"labels":[],"label_agreement":null},{"id":"W2970532730","doi":"10.1109/tpds.2019.2938158","title":"The Network-Integrated Storage System","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 Waterloo","funders":"Canada Foundation for Innovation","keywords":"Computer science; Scalability; Distributed computing; Load balancing (electrical power); Storage area network; Computer network; Multicast; Replication (statistics); Key (lock); Consistency (knowledge bases); Routing (electronic design automation); Computer data storage; Operating system","score_opus":0.010254500150417878,"score_gpt":0.19577275175244518,"score_spread":0.1855182516020273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970532730","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.10795636,0.0025028796,0.768369,0.0015380398,0.00073966035,0.0004530172,0.0016236573,0.029019171,0.08779824],"genre_scores_gemma":[0.72008926,0.0010757544,0.23757671,0.0006736626,0.00016404358,0.0003001436,0.002377498,0.0005753276,0.037167598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999559,0.00005065324,0.000031672393,0.00008197186,0.00020596113,0.000070818045],"domain_scores_gemma":[0.99957293,0.000031389427,0.000023323259,0.00012265617,0.00020970685,0.00003999978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041259726,0.00030778503,0.0004172674,0.0004233828,0.00067932345,0.001600924,0.0018994713,0.00044247488,0.007750937],"category_scores_gemma":[0.0006234385,0.00026155065,0.00025057874,0.0005141726,0.00041217427,0.0026486823,0.0019012737,0.00067192526,0.0024966092],"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.0015577595,0.0003307643,0.004835992,0.0010151417,0.00018642437,0.0006465054,0.0006849492,0.08223853,0.19269694,0.1736403,0.0988227,0.44334397],"study_design_scores_gemma":[0.00021605038,0.0010156857,0.0020421022,0.00014096203,0.00023200474,0.0012073058,0.00020784755,0.4131436,0.12526889,0.02185133,0.4344818,0.00019239921],"about_ca_topic_score_codex":0.0022655074,"about_ca_topic_score_gemma":0.0028399848,"teacher_disagreement_score":0.007750937,"about_ca_system_score_codex":0.0010989974,"about_ca_system_score_gemma":0.0015076747,"threshold_uncertainty_score":0.025929451},"labels":[],"label_agreement":null},{"id":"W2970544907","doi":"","title":"Data Lifetime Estimation in a Multicast-Based CoAP Proxy","year":2019,"lang":"en","type":"article","venue":"RonPub -- Research Online Publishing (RonPub UG)","topic":"Caching and Content Delivery","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":"Multicast; Computer science; Computer network; Erlang (programming language); Traffic intensity; Protocol Independent Multicast; Proxy (statistics); Source-specific multicast; Exponential distribution; Provisioning; Theoretical computer science; Statistics","score_opus":0.12120221758529809,"score_gpt":0.3850274464326183,"score_spread":0.26382522884732024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970544907","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.45864126,0.00063746236,0.5385147,0.00016564019,0.00002592356,0.000052844534,0.00007953092,0.00048729283,0.001395322],"genre_scores_gemma":[0.9799977,0.0000768348,0.019511597,0.00001177527,0.00000530991,0.000010910076,0.000031501444,0.000011207298,0.00034321402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.00021792893,0.000051424973,0.00020817445,0.00018075579,0.00012273944],"domain_scores_gemma":[0.9986016,0.0005668658,0.00026390786,0.00019422136,0.0002873018,0.00008618372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012688532,0.00056086417,0.0007799389,0.0005684017,0.00052680913,0.0011615665,0.0012998509,0.0012674243,0.00035624448],"category_scores_gemma":[0.0035443318,0.00028327477,0.00041755312,0.0006967494,0.0004738961,0.00193911,0.0008476877,0.00044704453,0.000104185216],"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.00033373162,0.0001364127,0.011136813,0.00011379623,0.000067438246,0.0004617214,0.0001427417,0.9322122,0.019022087,0.004391644,0.00026170598,0.03171982],"study_design_scores_gemma":[0.000001417159,0.000022204405,0.0004370587,0.0000020752527,0.000006756414,0.000058187667,0.000021656473,0.9969222,0.0021152936,0.00034659545,0.000061792765,0.0000047473345],"about_ca_topic_score_codex":0.0035129052,"about_ca_topic_score_gemma":0.0013679406,"teacher_disagreement_score":0.0035129052,"about_ca_system_score_codex":0.0011027167,"about_ca_system_score_gemma":0.00056927,"threshold_uncertainty_score":0.008000791},"labels":[],"label_agreement":null},{"id":"W2971032560","doi":"10.1109/tii.2019.2938529","title":"Modeling and Analysis of a Shared Edge Caching System for Connected Cars and Industrial IoT-Based Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":72,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Content delivery; Edge computing; Internet of Things; Distributed computing; Computer network; Embedded system; Telecommunications","score_opus":0.05300024585065749,"score_gpt":0.24572573367269396,"score_spread":0.19272548782203647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971032560","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.1690221,0.002251912,0.79985756,0.0013931327,0.00014123392,0.00017827659,0.0005018871,0.0005252674,0.026128631],"genre_scores_gemma":[0.9790111,0.0007138644,0.011578525,0.00011247797,0.000042694915,0.00010739418,0.000119355274,0.000056112684,0.008258433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941695,0.000124605,0.000028155508,0.00010475875,0.00015759286,0.00016797188],"domain_scores_gemma":[0.99865675,0.00056936336,0.00024191852,0.000054667824,0.00041947688,0.000057764966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008331406,0.00091665646,0.0011639782,0.0009407986,0.00083377125,0.0018199413,0.0018235364,0.0018225558,0.0030117764],"category_scores_gemma":[0.0025314726,0.00050636026,0.001052187,0.00091542315,0.0010587651,0.0016847438,0.0011126571,0.0009255599,0.00039256312],"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.000029040148,0.000023706307,0.00059284735,0.000045761084,0.000019471732,0.00013243633,0.00005529034,0.9690701,0.0016118521,0.025896158,0.0005808306,0.001942504],"study_design_scores_gemma":[0.0000018082908,0.0000045197935,0.000055431752,0.0000016847571,0.00000414993,0.000010386206,0.0000069696043,0.9987847,0.000059281876,0.0009779187,0.00009073514,0.000002417945],"about_ca_topic_score_codex":0.032320738,"about_ca_topic_score_gemma":0.0137197655,"teacher_disagreement_score":0.032320738,"about_ca_system_score_codex":0.003199658,"about_ca_system_score_gemma":0.001921772,"threshold_uncertainty_score":0.06426519},"labels":[],"label_agreement":null},{"id":"W2971348907","doi":"10.1109/sescps.2019.00013","title":"Decentralized Access Control for Smart Buildings Using Metadata and Smart Contracts","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Access control; Computer science; Metadata; Overhead (engineering); Building automation; Control (management); Role-based access control; Computer access control; Resource (disambiguation); Computer security; World Wide Web; Computer network","score_opus":0.038232515164197914,"score_gpt":0.2862335468911756,"score_spread":0.24800103172697768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971348907","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.03919841,0.00014641641,0.9534562,0.00038523457,0.000036244408,0.00028663062,0.000094088056,0.0013380393,0.005058689],"genre_scores_gemma":[0.79682565,0.00018254638,0.1960587,0.000101284175,0.000041817995,0.00032299483,0.00021579672,0.00014234878,0.0061089518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99631387,0.0014173113,0.00034543587,0.0004181128,0.0011348409,0.00037051536],"domain_scores_gemma":[0.9937266,0.0024800694,0.00058454083,0.0022140937,0.0006867019,0.00030802988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050613573,0.00034644164,0.0006556707,0.0010499276,0.0014563522,0.002657718,0.0012845761,0.0011256776,0.0026096462],"category_scores_gemma":[0.0066249697,0.00039181332,0.0006508646,0.0011980485,0.0021066212,0.0063662063,0.0031701608,0.001316981,0.00047825443],"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.0003500333,0.00032986427,0.0032964647,0.0001893924,0.000054750766,0.0006176479,0.0015902552,0.22013089,0.02252532,0.59305376,0.0029199657,0.15494174],"study_design_scores_gemma":[0.000099702236,0.000077558034,0.00041172796,0.000030895004,0.000023911907,0.00013827864,0.00020013654,0.8350026,0.010741335,0.13632593,0.016900053,0.000047965066],"about_ca_topic_score_codex":0.0050825058,"about_ca_topic_score_gemma":0.0059031947,"teacher_disagreement_score":0.0050825058,"about_ca_system_score_codex":0.0017328655,"about_ca_system_score_gemma":0.0032793884,"threshold_uncertainty_score":0.026767313},"labels":[],"label_agreement":null},{"id":"W2973372523","doi":"10.1109/tvt.2019.2921444","title":"Toward Dynamic Link Utilization for Efficient Vehicular Edge Content Distribution","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":67,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backhaul (telecommunications); Computer science; Computer network; Scheduling (production processes); Vehicular ad hoc network; Edge computing; Content delivery; Content distribution; Base station; Enhanced Data Rates for GSM Evolution; Wireless; Wireless ad hoc network; Engineering; Telecommunications","score_opus":0.030133538848366368,"score_gpt":0.242981980017777,"score_spread":0.21284844116941062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973372523","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.13461888,0.00092430256,0.855924,0.0002130637,0.00003227388,0.00004962237,0.00007343355,0.00033728764,0.007827155],"genre_scores_gemma":[0.95606947,0.00039357698,0.041997693,0.00004303596,0.000016880887,0.00002794934,0.000054244076,0.00003326047,0.0013639431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962664,0.000082604296,0.000009406679,0.000058248334,0.00008508943,0.00013796121],"domain_scores_gemma":[0.9996271,0.00011782415,0.000050710394,0.00004951382,0.00012060286,0.000034115747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004653501,0.00053890917,0.00051141996,0.0007191056,0.00045835093,0.0010082154,0.00094699673,0.00042061953,0.0011127049],"category_scores_gemma":[0.0010836873,0.00021111361,0.0001973466,0.0010099068,0.00031976888,0.000996199,0.00077250396,0.00039028673,0.000298015],"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.0001834127,0.00018493782,0.002386486,0.00012114797,0.000045710534,0.00024597134,0.00017843721,0.7852321,0.041310154,0.054718137,0.0033372343,0.1120563],"study_design_scores_gemma":[0.0000056988524,0.000045762816,0.00027278514,0.0000060102907,0.000011894158,0.00006257524,0.00006982569,0.98694545,0.0038052925,0.007107711,0.0016593118,0.000007786778],"about_ca_topic_score_codex":0.0028133392,"about_ca_topic_score_gemma":0.004131615,"teacher_disagreement_score":0.0028133392,"about_ca_system_score_codex":0.00088569097,"about_ca_system_score_gemma":0.00095790345,"threshold_uncertainty_score":0.006426215},"labels":[],"label_agreement":null},{"id":"W2975887878","doi":"10.1109/mascots.2019.00032","title":"Campus-Level Instagram Traffic: A Case Study","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Encryption; Dynamic Host Configuration Protocol; Key (lock); Computer network; Campus network; Traffic volume; Computer security; Telecommunications; Ip address; Transport engineering; Engineering","score_opus":0.03213344997776232,"score_gpt":0.25214670129695704,"score_spread":0.22001325131919472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975887878","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.9947508,0.000043818414,0.0018899664,0.0001859217,0.000012295501,0.00005033781,0.0006944707,0.00017205904,0.002200273],"genre_scores_gemma":[0.996639,0.000073698655,0.0016702375,0.000046549958,0.000022329441,0.000019877345,0.00064149866,0.000031479773,0.00085527205],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993266,0.00022953565,0.000028207409,0.000097414595,0.00018686529,0.00013139442],"domain_scores_gemma":[0.99764675,0.0010676001,0.00021872802,0.00026777707,0.0004910073,0.00030810022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054116116,0.00033804966,0.00031855726,0.001088904,0.0010461869,0.00084825134,0.0008871674,0.0011018997,0.0009542634],"category_scores_gemma":[0.0021748128,0.00012722051,0.00024096409,0.0017928343,0.00048740552,0.001036574,0.00064958865,0.00078582315,0.0004772923],"study_design_candidate":"observational","study_design_consensus":"observational","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.0014448608,0.005604035,0.59522533,0.00046124382,0.0003439998,0.021181867,0.012796404,0.11942018,0.035016418,0.013103422,0.049960244,0.14544204],"study_design_scores_gemma":[0.0001164589,0.0011492799,0.40281802,0.00008931599,0.00013442857,0.009296708,0.031803757,0.49446824,0.024007227,0.00479877,0.031075438,0.00024235618],"about_ca_topic_score_codex":0.01968392,"about_ca_topic_score_gemma":0.026906654,"teacher_disagreement_score":0.01968392,"about_ca_system_score_codex":0.0010979159,"about_ca_system_score_gemma":0.0004303977,"threshold_uncertainty_score":0.039138734},"labels":[],"label_agreement":null},{"id":"W2976097931","doi":"10.1109/mascots.2019.00030","title":"Characterization of IMAPS Email Traffic","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Cloud computing; Computer network; Enhanced Data Rates for GSM Evolution; Protocol (science); Transfer (computing); Telecommunications; Operating system","score_opus":0.007076561282301446,"score_gpt":0.18216812154185935,"score_spread":0.1750915602595579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976097931","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.98913705,0.00014090037,0.0060701263,0.00006022687,0.000014353689,0.0000332102,0.0011215783,0.0004886532,0.0029339695],"genre_scores_gemma":[0.9970395,0.000097725424,0.0010982049,0.00002785554,0.000013441032,0.000027316348,0.0010725467,0.000045705416,0.0005776114],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991499,0.0001732718,0.00005353375,0.00015844381,0.00029199864,0.00017281054],"domain_scores_gemma":[0.9967526,0.0011802337,0.0004445172,0.00036004774,0.0010236837,0.00023893637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055890065,0.00065870624,0.00054600165,0.0028182918,0.0006474541,0.0009020581,0.0007366451,0.0006293533,0.0011258846],"category_scores_gemma":[0.002764489,0.00015747095,0.00018703027,0.0021712738,0.00044435097,0.0010700302,0.0007042479,0.0005254175,0.0005928241],"study_design_candidate":"observational","study_design_consensus":"observational","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.002441429,0.0009980757,0.33602104,0.00045391585,0.00025824973,0.002839095,0.002282251,0.289905,0.22487131,0.01187651,0.011041182,0.117011935],"study_design_scores_gemma":[0.0000206299,0.0004793017,0.20285985,0.000052267387,0.000065344524,0.0021746212,0.001892673,0.67701256,0.10518169,0.0040861345,0.006056848,0.000118105614],"about_ca_topic_score_codex":0.0028597359,"about_ca_topic_score_gemma":0.0017312429,"teacher_disagreement_score":0.0028597359,"about_ca_system_score_codex":0.0010608374,"about_ca_system_score_gemma":0.00036641557,"threshold_uncertainty_score":0.007696986},"labels":[],"label_agreement":null},{"id":"W2978579878","doi":"10.1109/ism.workshops.2007.32","title":"A Prefetching Server for Reducing Startup Time of Embedded Multimedia","year":2007,"lang":"en","type":"article","venue":"Ninth IEEE International Symposium on Multimedia Workshops (ISMW 2007)","topic":"Caching and Content Delivery","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":"Computer science; Instruction prefetch; Cache; Web page; Static web page; World Wide Web; Web server; Operating system; Multimedia; Web API; Web development; The Internet","score_opus":0.02161653922834587,"score_gpt":0.2796815746052441,"score_spread":0.25806503537689823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978579878","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.73213357,0.00078603474,0.25298062,0.00017935415,0.00008606909,0.00035679853,0.00026038944,0.009854451,0.0033626836],"genre_scores_gemma":[0.9598146,0.00013141397,0.03703344,0.00003488445,0.000023344119,0.00007008437,0.00030245094,0.00013774613,0.002451967],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.000051664956,0.00003073913,0.000061353014,0.00009961027,0.000051604387],"domain_scores_gemma":[0.9990089,0.00027075424,0.00007266175,0.00017417457,0.00036612648,0.00010735742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034802646,0.00056218693,0.00046605326,0.0006148155,0.00051122304,0.00047800192,0.0009585416,0.00047291035,0.0015124148],"category_scores_gemma":[0.0015045088,0.00024118565,0.00015138177,0.00091327174,0.0002112046,0.0010125755,0.0002951754,0.00035560215,0.0005390995],"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.001997522,0.0006489654,0.012076138,0.0003255274,0.000046741923,0.0008454371,0.000294928,0.050690107,0.68932104,0.0035046304,0.005139306,0.23510966],"study_design_scores_gemma":[0.00009138013,0.0006974365,0.0064690164,0.000013321768,0.00005717315,0.0004956054,0.00007908939,0.71176976,0.2759714,0.00085033244,0.003470973,0.000034515306],"about_ca_topic_score_codex":0.0029717574,"about_ca_topic_score_gemma":0.0028589487,"teacher_disagreement_score":0.0029717574,"about_ca_system_score_codex":0.0007130559,"about_ca_system_score_gemma":0.00084226666,"threshold_uncertainty_score":0.005908966},"labels":[],"label_agreement":null},{"id":"W2978924428","doi":"10.1016/j.comnet.2019.106937","title":"A functional taxonomy of caching schemes: Towards guided designs in information-centric networks","year":2019,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Queen's University","keywords":"Computer science; Scalability; The Internet; Benchmark (surveying); Distributed computing; Domain (mathematical analysis); Information-centric networking; Taxonomy (biology); Architecture; Internet of Things; Computer network; World Wide Web; Database","score_opus":0.03709930418390768,"score_gpt":0.214658890796357,"score_spread":0.1775595866124493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978924428","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.008889059,0.0005005926,0.9859794,0.00061346055,0.000044879656,0.0001619715,0.00009967153,0.00038812225,0.0033229722],"genre_scores_gemma":[0.23611665,0.0015778006,0.7572058,0.00033931748,0.00011146188,0.0005872727,0.00036321647,0.0002656082,0.0034328385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950629,0.0021541466,0.0005793446,0.000544371,0.0012308595,0.00042848082],"domain_scores_gemma":[0.98617727,0.004419575,0.00093579706,0.0042052874,0.0036258537,0.0006362964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006305858,0.0012601473,0.0012297999,0.0023733838,0.002010966,0.0063615777,0.0038973542,0.0029777025,0.0025165812],"category_scores_gemma":[0.016300704,0.0011573822,0.0010703284,0.0026440886,0.003399587,0.0089764865,0.0023057328,0.0032872302,0.0008435675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00009543646,0.0001097447,0.0015432335,0.00029120676,0.00003624018,0.000085297695,0.00056657667,0.038342923,0.0037025525,0.8892672,0.0026197592,0.06333975],"study_design_scores_gemma":[0.00003137391,0.00023083093,0.00043834667,0.00026313582,0.00009586766,0.000298252,0.00036780894,0.40633282,0.004543368,0.56320786,0.02413164,0.000058692098],"about_ca_topic_score_codex":0.0026706022,"about_ca_topic_score_gemma":0.0031548277,"teacher_disagreement_score":0.0063615777,"about_ca_system_score_codex":0.002760027,"about_ca_system_score_gemma":0.003864263,"threshold_uncertainty_score":0.033348978},"labels":[],"label_agreement":null},{"id":"W2980080427","doi":"10.1109/access.2019.2947067","title":"Toward Edge-Assisted Video Content Intelligent Caching With Long Short-Term Memory Learning","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fundamental Research Funds for the Central Universities; Hong Kong Polytechnic University; Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Computer science; Cache; Enhanced Data Rates for GSM Evolution; Architecture; Edge device; Deep learning; Term (time); Computer network; The Internet; Artificial intelligence; World Wide Web; Operating system","score_opus":0.08257202957653051,"score_gpt":0.28506909890072313,"score_spread":0.20249706932419262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980080427","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.19237621,0.0014132462,0.79451954,0.0005372479,0.000112230846,0.00009925964,0.0003723042,0.006279675,0.004290237],"genre_scores_gemma":[0.790751,0.0003516592,0.20527855,0.00041148192,0.00006175888,0.00008753297,0.00061228767,0.00007380667,0.0023719673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997626,0.00003827756,0.000014029933,0.00007122372,0.00005046209,0.00006337337],"domain_scores_gemma":[0.99955803,0.00010148746,0.00004782457,0.000079439924,0.0001728653,0.00004035537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005365019,0.00061700627,0.0007385306,0.00054552825,0.00039618617,0.00088927516,0.0018474542,0.001135357,0.0006960479],"category_scores_gemma":[0.0012180425,0.00020827155,0.0003901097,0.00081223925,0.00036901346,0.0019505899,0.00083374936,0.00075269083,0.00041628652],"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.0007479673,0.00062802044,0.010563452,0.00015850386,0.00015291608,0.00023839674,0.00018521764,0.4106673,0.03555302,0.009560959,0.012259451,0.5192849],"study_design_scores_gemma":[0.000009557079,0.000035222445,0.0002575736,0.0000036489628,0.000011572174,0.0000146985485,0.0000147081955,0.9936261,0.004116166,0.001443212,0.00046167374,0.0000057871493],"about_ca_topic_score_codex":0.011799707,"about_ca_topic_score_gemma":0.012887044,"teacher_disagreement_score":0.011799707,"about_ca_system_score_codex":0.0008114065,"about_ca_system_score_gemma":0.0014537908,"threshold_uncertainty_score":0.023461998},"labels":[],"label_agreement":null},{"id":"W2981216466","doi":"10.1109/mvt.2019.2936087","title":"Transmission Protocol Customization for Network Slicing: A Case Study of Video Streaming","year":2019,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Magazine","topic":"Caching and Content Delivery","field":"Computer Science","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":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Packet loss; Network traffic control; Scalable Video Coding; Network packet; Quality of experience; Cache; Linear network coding; Quality of service; Scalability; Operating system","score_opus":0.012269483658724694,"score_gpt":0.26018599820903143,"score_spread":0.24791651455030675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981216466","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.8787283,0.0010448463,0.10784036,0.00064035703,0.00008044068,0.0003737812,0.00018017094,0.00036106753,0.010750633],"genre_scores_gemma":[0.96732146,0.00037450143,0.030341115,0.000057683716,0.00003137424,0.000055466164,0.00011502451,0.00005000472,0.0016532006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859864,0.0005885253,0.00007454596,0.0001433231,0.00038238813,0.00021267541],"domain_scores_gemma":[0.9950983,0.0030133717,0.00043621915,0.00056351256,0.00060454925,0.00028407056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002475305,0.0005481492,0.00038868884,0.0005015432,0.0013793587,0.0010580058,0.0012555035,0.0014785547,0.0010922904],"category_scores_gemma":[0.0054195924,0.00020419418,0.00042133767,0.00089072814,0.0009688658,0.0012547451,0.0005924795,0.0008801545,0.00011025546],"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.0015457319,0.0016572706,0.05958876,0.0010761669,0.00032580012,0.043459963,0.007694448,0.47931314,0.09665085,0.082099944,0.009675854,0.21691205],"study_design_scores_gemma":[0.00017973124,0.0020502566,0.014318416,0.0001415303,0.00022954855,0.012993671,0.005250917,0.8628093,0.05862974,0.014231302,0.029007662,0.00015785926],"about_ca_topic_score_codex":0.008437102,"about_ca_topic_score_gemma":0.008769923,"teacher_disagreement_score":0.008437102,"about_ca_system_score_codex":0.001276068,"about_ca_system_score_gemma":0.0008956754,"threshold_uncertainty_score":0.016775966},"labels":[],"label_agreement":null},{"id":"W2982615441","doi":"10.1109/icdcs.2019.00154","title":"Intelligent Caching Algorithms in Heterogeneous Wireless Networks with Uncertainty","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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; Cache; Wireless network; Base station; Small cell; Enhanced Data Rates for GSM Evolution; Computer network; Wireless; Distributed computing; The Internet; Popularity; Heterogeneous network; Spectral efficiency; World Wide Web; Artificial intelligence; Telecommunications","score_opus":0.010248708527640637,"score_gpt":0.21054935172713213,"score_spread":0.20030064319949148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982615441","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.08168591,0.0012846382,0.9125624,0.00094314624,0.000070176524,0.00007674495,0.000115994306,0.00044989647,0.0028111923],"genre_scores_gemma":[0.93956435,0.00050701713,0.0573413,0.00023079453,0.00009667893,0.00011702814,0.00015424693,0.000053391785,0.0019352147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990637,0.0003475212,0.000054100285,0.00018898312,0.00015923554,0.00018648524],"domain_scores_gemma":[0.99133927,0.0069504827,0.0007002558,0.00026677214,0.0005165086,0.00022668508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689141,0.0010878195,0.0023284312,0.00083871797,0.00091738114,0.0015546365,0.0022249965,0.0018813522,0.0009488192],"category_scores_gemma":[0.010942653,0.0006667757,0.0006145434,0.001382592,0.001514456,0.002411948,0.0016046336,0.0015367271,0.00016511786],"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.000054720378,0.000026266744,0.00048739358,0.00002263957,0.000020992764,0.00003466982,0.000026705131,0.98414075,0.00017914578,0.0066420343,0.00040117354,0.007963485],"study_design_scores_gemma":[0.000005114838,0.0000056368267,0.000037265985,0.0000014998568,0.000002793587,0.0000040052137,0.0000037894606,0.9973743,0.00004848738,0.0024749257,0.000040159022,0.0000020655586],"about_ca_topic_score_codex":0.009868316,"about_ca_topic_score_gemma":0.0064086528,"teacher_disagreement_score":0.009868316,"about_ca_system_score_codex":0.002367386,"about_ca_system_score_gemma":0.0014058021,"threshold_uncertainty_score":0.01962179},"labels":[],"label_agreement":null},{"id":"W2983141401","doi":"","title":"Optimizing Time to Exhaustion in Service Providers Using Information-centric Networking","year":2016,"lang":"en","type":"article","venue":"IEEE Conference Proceedings","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Service provider; Popularity; Software deployment; Computer science; Cache; Service (business); Capital expenditure; Information-centric networking; Order (exchange); Computer network; Business; Marketing; Finance","score_opus":0.028095686514140735,"score_gpt":0.22396686146197392,"score_spread":0.19587117494783318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983141401","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.5804685,0.0013496936,0.40512773,0.0018448029,0.00012464734,0.00023257805,0.00011382004,0.0005814565,0.010156858],"genre_scores_gemma":[0.9829379,0.00022769881,0.016021851,0.000081379665,0.000017902503,0.00002613575,0.000029405483,0.000030253479,0.00062746863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897754,0.00037216608,0.000048707585,0.0001214128,0.00014738353,0.00033282163],"domain_scores_gemma":[0.995568,0.0023516114,0.0006947914,0.000250396,0.00054446375,0.00059070863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028315561,0.00083081936,0.00085829437,0.0006557669,0.0011205316,0.0017291757,0.0011230005,0.00077429565,0.0016528851],"category_scores_gemma":[0.008897968,0.00039846846,0.0002652657,0.0008908084,0.00066745153,0.0023366115,0.0014640968,0.0007400136,0.00020079078],"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.00095025066,0.00043014533,0.0072498717,0.00018367136,0.000072809016,0.00034784153,0.0005642919,0.8448961,0.023505153,0.030746063,0.003575214,0.087478645],"study_design_scores_gemma":[0.000036905043,0.00029749254,0.0009393414,0.00001905072,0.00004231285,0.000099162906,0.00028460508,0.981897,0.004242583,0.010739571,0.0013837842,0.000018227902],"about_ca_topic_score_codex":0.0033125423,"about_ca_topic_score_gemma":0.003881402,"teacher_disagreement_score":0.0033125423,"about_ca_system_score_codex":0.0015662556,"about_ca_system_score_gemma":0.0021710508,"threshold_uncertainty_score":0.014974892},"labels":[],"label_agreement":null},{"id":"W2986150680","doi":"10.1186/s13174-019-0119-6","title":"Evaluating CRoS-NDN: a comparative performance analysis of a controller-based routing scheme for named-data networking","year":2019,"lang":"en","type":"article","venue":"Journal of Internet Services and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Universidade Federal do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Latency (audio); Scalability; Computer network; Network packet; Routing (electronic design automation); Content delivery; Upper and lower bounds; Content distribution; Information-centric networking; Scheme (mathematics); Routing protocol; Distributed computing; Routing table; Cache","score_opus":0.08022352282153901,"score_gpt":0.355903498317606,"score_spread":0.275679975496067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986150680","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.92275167,0.0017571613,0.06068455,0.00034967746,0.0001412271,0.00035734184,0.00037080556,0.0013244108,0.01226312],"genre_scores_gemma":[0.9875673,0.00016920298,0.011240638,0.00003122627,0.000016697139,0.000044722397,0.0002986455,0.000033215605,0.00059833034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997623,0.0008986752,0.00016717908,0.00020994728,0.0008537138,0.00024740357],"domain_scores_gemma":[0.9892948,0.006574383,0.0006775699,0.0009611039,0.00226095,0.00023124188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033292861,0.000738789,0.00058571185,0.0019100577,0.00049257284,0.0011057752,0.0012179085,0.0007473554,0.0016293034],"category_scores_gemma":[0.008109329,0.00015040798,0.00023999307,0.0011803422,0.0006138886,0.0016779631,0.0006842137,0.00041155572,0.00020963489],"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.003971088,0.0010350044,0.015391433,0.0006603217,0.00035936967,0.00026476962,0.00015652612,0.7435875,0.07471263,0.010596791,0.0041405167,0.14512411],"study_design_scores_gemma":[0.000052944855,0.0010644861,0.0018675134,0.00000955628,0.000053612748,0.00009716444,0.000066987,0.97762114,0.017842632,0.0005320784,0.000767416,0.000024426869],"about_ca_topic_score_codex":0.0030641246,"about_ca_topic_score_gemma":0.0030578894,"teacher_disagreement_score":0.0033292861,"about_ca_system_score_codex":0.0026317805,"about_ca_system_score_gemma":0.00074352324,"threshold_uncertainty_score":0.019095004},"labels":[],"label_agreement":null},{"id":"W2986387496","doi":"10.1109/tvt.2019.2952665","title":"Named Data Networking Enabled Power Saving Mode Design for WLAN","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Hunan Province","keywords":"Computer science; Computer network; State (computer science); Energy consumption; Channel (broadcasting); Power consumption; Wireless; Power (physics); Embedded system; Real-time computing; Engineering; Telecommunications; Electrical engineering","score_opus":0.032095653784244206,"score_gpt":0.25434646770132957,"score_spread":0.22225081391708537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986387496","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.08946344,0.0016712679,0.87924844,0.0006076761,0.00039045943,0.00026922015,0.0002353118,0.0022261473,0.025888],"genre_scores_gemma":[0.9257075,0.0005121956,0.06853802,0.00024950135,0.000063117644,0.00024748396,0.00013363712,0.000077400786,0.0044711973],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997867,0.000048067453,0.000015791367,0.000045569195,0.00007127321,0.0000326636],"domain_scores_gemma":[0.9998584,0.000019055493,0.000025496807,0.000019836927,0.00006213739,0.000015058963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003342018,0.00034870245,0.00020873557,0.00029656437,0.00023065227,0.0005914572,0.0012119631,0.0002894422,0.0019656678],"category_scores_gemma":[0.00037246136,0.0001587491,0.00026906453,0.00018538901,0.00024725904,0.00063843554,0.0005123839,0.00033661537,0.00044593835],"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.00058637536,0.000295024,0.00499777,0.00085533527,0.0001568043,0.0006618305,0.00058951194,0.18546069,0.3660648,0.080612674,0.015282955,0.3444363],"study_design_scores_gemma":[0.00006448987,0.0005682656,0.0011647472,0.00005720197,0.00007444623,0.00033434597,0.00007878087,0.8952518,0.06278089,0.00523153,0.034332342,0.00006119087],"about_ca_topic_score_codex":0.00086998724,"about_ca_topic_score_gemma":0.001188146,"teacher_disagreement_score":0.0019656678,"about_ca_system_score_codex":0.00064074155,"about_ca_system_score_gemma":0.00038204127,"threshold_uncertainty_score":0.006575823},"labels":[],"label_agreement":null},{"id":"W2989643311","doi":"10.1109/mnet.001.1900333","title":"SDATP: An SDN-Based Adaptive Transmission Protocol for Time-Critical Services","year":2019,"lang":"en","type":"article","venue":"IEEE Network","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"","keywords":"Computer science; Computer network; Retransmission; Distributed computing; Quality of service; Network packet; Network congestion; Latency (audio); Packet loss","score_opus":0.021830844679035243,"score_gpt":0.28353845603062156,"score_spread":0.2617076113515863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989643311","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.00657713,0.0006723576,0.98883027,0.00018932803,0.00023387902,0.00017069263,0.00006822241,0.0007586459,0.0024994735],"genre_scores_gemma":[0.615823,0.0015461608,0.3766056,0.0004274658,0.00019962063,0.00053888676,0.00044494664,0.00010336665,0.0043109646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996544,0.00009041835,0.00003712082,0.000057928366,0.00012509998,0.000035011104],"domain_scores_gemma":[0.99964523,0.00010822664,0.00004626592,0.000043604086,0.00012816847,0.000028434235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006285291,0.0005007712,0.00049954816,0.0005224379,0.0005193123,0.0007215711,0.0014298515,0.00050327077,0.0010776104],"category_scores_gemma":[0.0011623334,0.0001647161,0.00027596604,0.0005776109,0.00036663358,0.00084833655,0.0008676937,0.00075024174,0.00022342766],"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.00040021416,0.00022523924,0.0015265507,0.0006292334,0.0001763116,0.000563353,0.00024238293,0.30233654,0.04602367,0.09592507,0.018639755,0.5333117],"study_design_scores_gemma":[0.000029042652,0.00013710702,0.00017872118,0.00002593296,0.000037028833,0.00030630938,0.00003013864,0.972624,0.003968284,0.008682558,0.013959112,0.000021742027],"about_ca_topic_score_codex":0.0016865628,"about_ca_topic_score_gemma":0.0027836664,"teacher_disagreement_score":0.0016865628,"about_ca_system_score_codex":0.0005701407,"about_ca_system_score_gemma":0.00106714,"threshold_uncertainty_score":0.004136622},"labels":[],"label_agreement":null},{"id":"W2991446828","doi":"10.48550/arxiv.1911.08517","title":"Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Reinforcement learning; Stream processing; Encoder; Computation; Distributed computing; Leverage (statistics); Embedding; Graph; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.04354141671482983,"score_gpt":0.17841372392478802,"score_spread":0.1348723072099582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991446828","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.07391303,0.00027468227,0.92238647,0.0003937059,0.00003632657,0.000042398035,0.00009899045,0.001277069,0.001577355],"genre_scores_gemma":[0.9228686,0.00015406385,0.07433092,0.00017645187,0.000025036677,0.00007812677,0.00018001773,0.00011778771,0.0020688972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997687,0.00006535616,0.000010106263,0.000073779076,0.000042908523,0.00003918986],"domain_scores_gemma":[0.99928564,0.00044760996,0.00006743485,0.00006883351,0.000087547596,0.000042938496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064752845,0.00077436725,0.0007646249,0.00031354532,0.00022606376,0.0005500228,0.0010957583,0.0008201059,0.0010039151],"category_scores_gemma":[0.0024697704,0.00044924158,0.00032942486,0.0004002019,0.0007947963,0.0013229953,0.0006393337,0.0014555702,0.0001987447],"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.000035888315,0.000030955896,0.00027767074,0.000019000685,0.000010834961,0.000023265413,0.000021148739,0.9779994,0.001162354,0.0026985481,0.00047557717,0.017245354],"study_design_scores_gemma":[0.0000020970645,0.0000034083967,0.000014605976,6.5730177e-7,8.175371e-7,0.00000131945,0.0000010325988,0.9983746,0.00014337376,0.0014241149,0.000033388067,5.8208616e-7],"about_ca_topic_score_codex":0.007976512,"about_ca_topic_score_gemma":0.008658905,"teacher_disagreement_score":0.007976512,"about_ca_system_score_codex":0.0012657052,"about_ca_system_score_gemma":0.0011223716,"threshold_uncertainty_score":0.01586014},"labels":[],"label_agreement":null},{"id":"W2994431616","doi":"10.1002/dac.4063","title":"Dynamic process location management in 5G","year":2019,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Caching and Content Delivery","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":"Université du Québec à Montréal; Ericsson (Canada)","funders":"","keywords":"Computer science; Latency (audio); Distributed computing; Cloud computing; Mobile edge computing; Wireless network; Radio access network; Computer network; Orchestration; Quality of service; Software-defined networking; Wireless; Virtualization; Operating system; Base station","score_opus":0.011801745855884976,"score_gpt":0.2856843815322308,"score_spread":0.27388263567634585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994431616","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.0572176,0.0009383386,0.9352329,0.00053385133,0.00011526377,0.000061297804,0.000064902255,0.0008125028,0.005023362],"genre_scores_gemma":[0.95641905,0.00028906975,0.041193236,0.000060966348,0.000035139346,0.000028221742,0.000054928063,0.000019126808,0.0019003969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994691,0.00010981835,0.00002995537,0.00013668678,0.00013051105,0.0001240786],"domain_scores_gemma":[0.9996076,0.0001227633,0.000073262614,0.00006925835,0.00009599837,0.000031015603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005537186,0.00058881025,0.0006251253,0.0005031703,0.0009390908,0.0015809513,0.0009204508,0.00074217253,0.0017531685],"category_scores_gemma":[0.0010996803,0.0002274108,0.00040597163,0.00074249436,0.0005497215,0.0013510726,0.0010752933,0.0006024118,0.00032363422],"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.00017296601,0.000057775134,0.001417282,0.000074424046,0.000027178372,0.00020346044,0.00012456777,0.85583586,0.00885246,0.028924467,0.0019441927,0.102365404],"study_design_scores_gemma":[0.000013186674,0.000045821613,0.00021254791,0.000005640056,0.00001515019,0.000044411663,0.000036858542,0.9896348,0.00246715,0.00558633,0.0019267617,0.000011369617],"about_ca_topic_score_codex":0.0071021095,"about_ca_topic_score_gemma":0.0058622668,"teacher_disagreement_score":0.0071021095,"about_ca_system_score_codex":0.0014650912,"about_ca_system_score_gemma":0.0013159084,"threshold_uncertainty_score":0.014121532},"labels":[],"label_agreement":null},{"id":"W2994941531","doi":"10.1145/3376122","title":"Xor Filters","year":2020,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bloom filter; Filter (signal processing); Cuckoo; Generalization; Set (abstract data type); Bitwise operation; Filter design","score_opus":0.03599654909467832,"score_gpt":0.2578440371868842,"score_spread":0.2218474880922059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994941531","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.029220391,0.0019234743,0.8982734,0.0014878093,0.00070287107,0.00093901064,0.003691741,0.012672704,0.05108849],"genre_scores_gemma":[0.32749853,0.0025958049,0.5888689,0.001880688,0.0006149513,0.0011523989,0.005328514,0.001540268,0.070519924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99678624,0.0003964319,0.00034864622,0.00066189514,0.0013403996,0.00046649014],"domain_scores_gemma":[0.99245197,0.0022741691,0.00054747536,0.0025938784,0.0018870461,0.00024547844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021078566,0.0011013341,0.001574673,0.0019668646,0.0019829366,0.0040244693,0.0021287187,0.0016170362,0.030293768],"category_scores_gemma":[0.012486165,0.0007962909,0.0011258557,0.0024520806,0.0011771556,0.008318209,0.0026695114,0.0015976796,0.010483293],"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.0016070892,0.00025059193,0.0032858958,0.00065166084,0.00012923186,0.0003465273,0.00040016836,0.01583508,0.022447336,0.30511233,0.06679122,0.58314294],"study_design_scores_gemma":[0.0003216401,0.0005493909,0.0014466975,0.00034325555,0.00023933682,0.0015968782,0.00040964963,0.23158067,0.084634036,0.29216686,0.38652366,0.00018788173],"about_ca_topic_score_codex":0.0038749895,"about_ca_topic_score_gemma":0.0045846063,"teacher_disagreement_score":0.030293768,"about_ca_system_score_codex":0.0026828095,"about_ca_system_score_gemma":0.0031032586,"threshold_uncertainty_score":0.10134274},"labels":[],"label_agreement":null},{"id":"W2996819921","doi":"10.1609/aaai.v34i01.5431","title":"Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Reinforcement learning; Stream processing; Encoder; Computation; Distributed computing; Leverage (statistics); Embedding; Theoretical computer science; Graph; Artificial intelligence; Algorithm","score_opus":0.06652245181908237,"score_gpt":0.2652637011071084,"score_spread":0.19874124928802603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996819921","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.07579771,0.00027877226,0.92041206,0.00040556796,0.000039970673,0.000045492052,0.00009667688,0.0013165213,0.0016073016],"genre_scores_gemma":[0.9232959,0.00014791783,0.07401308,0.00019360373,0.000025189172,0.00007878876,0.00017482585,0.00011428831,0.0019562806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997603,0.000065473454,0.000010508191,0.00007720082,0.00004493115,0.00004152655],"domain_scores_gemma":[0.9993038,0.00042531808,0.000068649824,0.00006598899,0.000092750706,0.00004345455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068060175,0.0008099149,0.00078467117,0.00031786226,0.00023519657,0.0005566178,0.0011135198,0.0008094168,0.0009847409],"category_scores_gemma":[0.0023650448,0.00045611907,0.00034117434,0.00038633496,0.00081541255,0.0013539457,0.0006551613,0.0015138268,0.0001926756],"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.0000348364,0.000031551735,0.00027347435,0.000017728718,0.000010578984,0.000023605027,0.00002084321,0.9782559,0.0011710065,0.0023510896,0.00045731428,0.017351998],"study_design_scores_gemma":[0.0000021230005,0.000003608089,0.000014930902,6.427224e-7,8.2711085e-7,0.0000013503702,0.0000010586003,0.9984536,0.00013897852,0.0013497272,0.000032361044,6.155095e-7],"about_ca_topic_score_codex":0.008105595,"about_ca_topic_score_gemma":0.009093919,"teacher_disagreement_score":0.008105595,"about_ca_system_score_codex":0.0012491774,"about_ca_system_score_gemma":0.0011518258,"threshold_uncertainty_score":0.016116858},"labels":[],"label_agreement":null},{"id":"W2997749137","doi":"10.1109/tccn.2019.2963149","title":"SDATP: An SDN-Based Traffic-Adaptive and Service-Oriented Transmission Protocol","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Computer network; Retransmission; Network packet; Distributed computing; Transmission delay; Packet loss","score_opus":0.04065389638978855,"score_gpt":0.2828174567223354,"score_spread":0.24216356033254682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997749137","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.010326835,0.0007341996,0.9846144,0.00022551007,0.00028183626,0.00017879902,0.00009921492,0.0010647539,0.002474509],"genre_scores_gemma":[0.70315737,0.0014217143,0.29034805,0.000472265,0.00019506493,0.0006435084,0.0006622023,0.000118480086,0.0029813927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.00017414943,0.000060077207,0.00010153225,0.00023307704,0.00006231921],"domain_scores_gemma":[0.99923587,0.00022375405,0.000097029144,0.00008964029,0.00030105838,0.00005268656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009945509,0.0005457464,0.0006501938,0.0006399305,0.00057907635,0.00088843284,0.0020880906,0.00059596996,0.00080624374],"category_scores_gemma":[0.0019013361,0.00020050495,0.00034500004,0.00088693073,0.0005351122,0.0011621951,0.0010597879,0.00096714206,0.00019970188],"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.00047278896,0.0002581621,0.0017826167,0.0006143421,0.00018095814,0.0006086789,0.00024219562,0.38611856,0.04406605,0.10641438,0.020184554,0.43905666],"study_design_scores_gemma":[0.000036038047,0.00015363122,0.00017392037,0.000022384236,0.00003512449,0.00029178587,0.000023337427,0.9782193,0.0034881406,0.007208644,0.010320404,0.000027343865],"about_ca_topic_score_codex":0.00244212,"about_ca_topic_score_gemma":0.0029810085,"teacher_disagreement_score":0.00244212,"about_ca_system_score_codex":0.0007629898,"about_ca_system_score_gemma":0.0013502211,"threshold_uncertainty_score":0.005535841},"labels":[],"label_agreement":null},{"id":"W2998178972","doi":"10.1109/tit.2019.2962495","title":"Optimization of Heterogeneous Coded Caching","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":47,"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; Defence Research and Development Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Optimization problem; Scheme (mathematics); Function (biology); Mathematical optimization; CPU cache; Perspective (graphical); Encoding (memory); Distributed computing; Algorithm; Parallel computing; Mathematics","score_opus":0.006795102457840474,"score_gpt":0.19685538488288654,"score_spread":0.19006028242504605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998178972","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.071720466,0.0005392423,0.91146195,0.0004953639,0.00006640379,0.00010868178,0.00021389071,0.00019193748,0.015202001],"genre_scores_gemma":[0.91749567,0.0003011429,0.075582355,0.000117676595,0.000039953564,0.00012584862,0.00015020723,0.000091864764,0.006095304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898654,0.00038520544,0.000032072225,0.00015769228,0.00024496453,0.0001935701],"domain_scores_gemma":[0.99752396,0.0016015637,0.00020805452,0.00020662649,0.00033942645,0.00012041709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015669074,0.00079096487,0.0010084746,0.0005159889,0.00045584858,0.0016481784,0.0014207574,0.0009327866,0.0023386087],"category_scores_gemma":[0.0066708177,0.00038564374,0.00033853733,0.0008187087,0.001321184,0.0018732598,0.0013163796,0.001030332,0.00021890875],"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.000053299136,0.00002404168,0.00019464824,0.000043187665,0.0000112954685,0.000050846946,0.000018345672,0.95082814,0.0010536421,0.04020005,0.000712448,0.006809988],"study_design_scores_gemma":[0.000006796474,0.00001448774,0.000077884324,0.000005163182,0.000004162985,0.000012994978,0.000010727991,0.98968375,0.0003550218,0.009432321,0.00039203936,0.0000046223754],"about_ca_topic_score_codex":0.005052641,"about_ca_topic_score_gemma":0.0029425358,"teacher_disagreement_score":0.005052641,"about_ca_system_score_codex":0.002816719,"about_ca_system_score_gemma":0.001670491,"threshold_uncertainty_score":0.020436823},"labels":[],"label_agreement":null},{"id":"W2999263473","doi":"10.1109/tmc.2020.2967038","title":"The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":83,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Probabilistic logic; Popularity; Dynamic web page; Markov chain; Exploit; Markov decision process; Markov process; Mathematical optimization; Artificial intelligence; Machine learning; Computer security; Mathematics; Statistics","score_opus":0.03543056412763705,"score_gpt":0.23232863268019663,"score_spread":0.1968980685525596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999263473","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.0080547305,0.00010324935,0.99065065,0.000097616,0.000017443048,0.000049046273,0.000019776537,0.00021493417,0.00079264765],"genre_scores_gemma":[0.8606416,0.0002932613,0.13729398,0.000123414,0.000040377246,0.00023782205,0.00006349435,0.0000603145,0.0012457647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982817,0.00048433084,0.000100297075,0.00044981766,0.00047430195,0.00020953004],"domain_scores_gemma":[0.9969387,0.0012137133,0.0004692064,0.00036978215,0.0008533409,0.00015536427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015550673,0.0007951447,0.001021951,0.00046657288,0.0005288976,0.0010359919,0.0022890456,0.0010811507,0.0009294027],"category_scores_gemma":[0.007512134,0.0006947208,0.0005021715,0.00071788166,0.00081710285,0.0017447651,0.0010578779,0.0009612293,0.00026918334],"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.00011301825,0.00007507188,0.001289092,0.00012694461,0.00004486339,0.00015334845,0.00010746803,0.9165619,0.011653093,0.028011063,0.0011517648,0.040712364],"study_design_scores_gemma":[0.000008817599,0.00003235717,0.00007548695,0.0000042642737,0.000011268947,0.000053009786,0.000007969874,0.9957098,0.0012536017,0.002371268,0.00046510552,0.0000070430415],"about_ca_topic_score_codex":0.003541837,"about_ca_topic_score_gemma":0.0031462768,"teacher_disagreement_score":0.003541837,"about_ca_system_score_codex":0.0012471848,"about_ca_system_score_gemma":0.0021328125,"threshold_uncertainty_score":0.009048998},"labels":[],"label_agreement":null},{"id":"W2999562137","doi":"10.1109/ojvt.2020.2965100","title":"AI-Assisted Network-Slicing Based Next-Generation Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Open Journal of Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":343,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Orchestration; Radio access network; Slicing; Wireless network; Network architecture; Architecture; Computer network; Wireless; Automation; Distributed computing; Telecommunications; Engineering; Base station; World Wide Web","score_opus":0.0607936568170919,"score_gpt":0.2628497776990235,"score_spread":0.20205612088193162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999562137","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.020424742,0.00069186307,0.97041863,0.0004439894,0.00006722341,0.000067642955,0.00004741174,0.00068942737,0.0071490705],"genre_scores_gemma":[0.63205636,0.00094934786,0.36363813,0.0001751479,0.000042714928,0.000076844066,0.00018134335,0.00007465903,0.002805432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958676,0.000121874655,0.000030959607,0.00006957772,0.00012664587,0.00006413725],"domain_scores_gemma":[0.9990902,0.00036862743,0.00010074446,0.00015812763,0.00020423034,0.0000780876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011196843,0.00039003027,0.00036127013,0.0004748278,0.00060538785,0.0010336407,0.0012492524,0.00046685096,0.0010671808],"category_scores_gemma":[0.001798589,0.00016547108,0.00031041985,0.0005160799,0.0009036943,0.0016952254,0.0010138192,0.0007821315,0.00019299149],"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.00014770699,0.00008160252,0.0015749651,0.0001780854,0.00006827893,0.00031966905,0.0004923933,0.6330375,0.025661662,0.1658975,0.0035275312,0.16901307],"study_design_scores_gemma":[0.0000061568653,0.00002837281,0.0001592874,0.000014060276,0.000016074773,0.000054003245,0.00005692832,0.9556677,0.004461299,0.03402904,0.005496569,0.000010584386],"about_ca_topic_score_codex":0.007193526,"about_ca_topic_score_gemma":0.009183072,"teacher_disagreement_score":0.007193526,"about_ca_system_score_codex":0.0014009539,"about_ca_system_score_gemma":0.0015286658,"threshold_uncertainty_score":0.014303327},"labels":[],"label_agreement":null},{"id":"W3001143102","doi":"10.1109/tpds.2020.2968321","title":"Scalable and Adaptive Data Replica Placement for Geo-Distributed Cloud Storages","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":37,"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; University of Victoria","funders":"British Columbia Knowledge Development Fund; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Replica; Computer science; Scalability; Cloud computing; Distributed computing; Overhead (engineering); Node (physics); Big data; Replication (statistics); Distributed database; Scheme (mathematics); Computer network; Database; Data mining; Operating system","score_opus":0.06786269001036657,"score_gpt":0.257614554196899,"score_spread":0.18975186418653242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001143102","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.063016,0.0014411077,0.92775965,0.00047225566,0.00028443203,0.00017916797,0.0002295837,0.0039760885,0.0026417626],"genre_scores_gemma":[0.8219447,0.00038103302,0.1750711,0.00011284699,0.000113879236,0.00011326976,0.00025544292,0.00012916951,0.0018785694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988366,0.00023934986,0.00009291897,0.00024260256,0.00044536905,0.0001432624],"domain_scores_gemma":[0.9979735,0.00035414696,0.00020035874,0.00075291045,0.0005449558,0.00017415904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009509877,0.0005323229,0.00091242674,0.0007254329,0.0014036535,0.0010073128,0.002682988,0.00069078204,0.0012937948],"category_scores_gemma":[0.0030973873,0.00037564014,0.00042461517,0.0014557061,0.0006576944,0.0018208416,0.0016006588,0.0006503837,0.0007130733],"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.001104427,0.00033187616,0.005542728,0.0004169497,0.00014017626,0.0011192359,0.0006907444,0.4682475,0.100006185,0.023834875,0.018494597,0.38007072],"study_design_scores_gemma":[0.00003066316,0.000071673974,0.00042896805,0.000008429837,0.00001802106,0.0002457494,0.00009975461,0.97717786,0.012610826,0.0052781715,0.004002399,0.000027459713],"about_ca_topic_score_codex":0.003423989,"about_ca_topic_score_gemma":0.004819769,"teacher_disagreement_score":0.003423989,"about_ca_system_score_codex":0.0010031569,"about_ca_system_score_gemma":0.0011551303,"threshold_uncertainty_score":0.007278502},"labels":[],"label_agreement":null},{"id":"W3001474836","doi":"10.1109/tnsm.2020.2969172","title":"FCTrees: A Front-Coded Family of Compressed Tree-Based FIB Structures for NDN Routers","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Forwarding plane; Routing table; Routing (electronic design automation); Routing protocol","score_opus":0.024015985158536316,"score_gpt":0.21327631186938098,"score_spread":0.18926032671084467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001474836","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.057110514,0.0015221712,0.9251505,0.00044108386,0.00025374963,0.0005048156,0.0013942183,0.00417763,0.009445357],"genre_scores_gemma":[0.3136291,0.0009519819,0.6733522,0.00049197645,0.00015618533,0.00064178393,0.003977476,0.000359665,0.00643974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995577,0.000050529085,0.000031029853,0.000042436848,0.00027490334,0.000043493994],"domain_scores_gemma":[0.99831367,0.00041929598,0.00017626886,0.00048504805,0.00053107063,0.00007468356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053328474,0.00047610115,0.00040423943,0.001673655,0.00077226874,0.000903498,0.0014503,0.0006165457,0.0036455884],"category_scores_gemma":[0.0029849696,0.00025780773,0.00033006837,0.0019163978,0.0005948875,0.0016655719,0.0010995064,0.00076814723,0.0009325547],"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.00078975974,0.00020301812,0.002913351,0.0004273748,0.000054434786,0.00064685737,0.0004362506,0.060805965,0.08637471,0.068031825,0.032078914,0.7472375],"study_design_scores_gemma":[0.00022369347,0.001060417,0.0026692946,0.00019732652,0.000081397586,0.0023197206,0.00041074798,0.70183843,0.119252376,0.045858566,0.12590663,0.00018141873],"about_ca_topic_score_codex":0.0024459334,"about_ca_topic_score_gemma":0.0039205155,"teacher_disagreement_score":0.0036455884,"about_ca_system_score_codex":0.0009230442,"about_ca_system_score_gemma":0.0012447123,"threshold_uncertainty_score":0.012195766},"labels":[],"label_agreement":null},{"id":"W3001623914","doi":"10.1109/tnet.2019.2963792","title":"Steganographic-Based Header Size Reduction Technique for Multimedia Streams","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","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":"CMC Microsystems (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Network packet; Header; Overhead (engineering); Hypertext Transfer Protocol; Internet Protocol; Transmission Control Protocol; Multimedia; The Internet; Node (physics); Link Control Protocol; User Datagram Protocol; Quality of service; Operating system","score_opus":0.042193796324499905,"score_gpt":0.25227943749033716,"score_spread":0.21008564116583725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001623914","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.12384772,0.0005791811,0.8712556,0.00014076261,0.00007769359,0.000078282865,0.000037008125,0.00096764154,0.0030162276],"genre_scores_gemma":[0.6959006,0.0006903477,0.29832545,0.00008315521,0.00006580051,0.00006827426,0.00013516899,0.000067180576,0.0046639373],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984705,0.000026548036,0.000007793883,0.00001960199,0.00008331389,0.000015683894],"domain_scores_gemma":[0.99974626,0.00009046297,0.000038974038,0.000044693374,0.00007130854,0.000008394409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022498067,0.0003668796,0.00025209755,0.0004990715,0.00017742698,0.00021174965,0.0004236959,0.00024371523,0.00079131586],"category_scores_gemma":[0.0006378584,0.00010815295,0.0002747086,0.0003091944,0.00022606463,0.0006479853,0.00029556543,0.0003897623,0.00025792696],"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.0003329664,0.000113864284,0.0006056547,0.00017540307,0.000031604894,0.00017609495,0.00015103885,0.02938637,0.6541484,0.008538543,0.0011490413,0.30519107],"study_design_scores_gemma":[0.000030433153,0.00032030517,0.0007570847,0.000022373031,0.00003611797,0.00044596702,0.000041950232,0.46433932,0.52729213,0.0014401539,0.0052531045,0.000020992897],"about_ca_topic_score_codex":0.00026904605,"about_ca_topic_score_gemma":0.0003526436,"teacher_disagreement_score":0.00079131586,"about_ca_system_score_codex":0.00019103289,"about_ca_system_score_gemma":0.00023639623,"threshold_uncertainty_score":0.002647221},"labels":[],"label_agreement":null},{"id":"W3004172495","doi":"10.1109/tcomm.2020.2970986","title":"Joint Long-Term Cache Updating and Short-Term Content Delivery in Cloud-Based Small Cell Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"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 British Columbia","funders":"","keywords":"Computer science; Cache; Computer network; Cloud computing; Small cell; Quality of service; Distributed computing; Radio access network; Base station; Multicast; Mobile station","score_opus":0.10543574234773788,"score_gpt":0.2522205997933782,"score_spread":0.1467848574456403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004172495","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.07983964,0.00041348528,0.91849226,0.00015675808,0.000023076635,0.000027397855,0.000039729748,0.00014399586,0.00086367293],"genre_scores_gemma":[0.951317,0.00027570772,0.047196224,0.000038869286,0.00001934198,0.00005055601,0.00004972017,0.000019233104,0.001033382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970466,0.00008170501,0.00001255846,0.000057993577,0.00008732859,0.00005572073],"domain_scores_gemma":[0.99941695,0.0002966864,0.00008739151,0.000042899363,0.00011364451,0.000042362142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062306935,0.00043815482,0.0006696019,0.00021004566,0.00036614528,0.0005708359,0.00097178307,0.00057164003,0.0003652991],"category_scores_gemma":[0.0017516252,0.0002770181,0.00024064012,0.00056443067,0.0005413154,0.00084798865,0.00055881805,0.0004076143,0.000088848654],"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.000096554875,0.000025183519,0.0008799847,0.000038594757,0.000015369982,0.000077517536,0.00004494597,0.96193045,0.004246861,0.0038418837,0.00041846157,0.028384287],"study_design_scores_gemma":[0.0000023328532,0.000011085184,0.00007810988,9.53452e-7,0.0000031989819,0.0000068483237,0.000005269262,0.99889404,0.0004949226,0.0004214566,0.000080039325,0.000001810556],"about_ca_topic_score_codex":0.011666336,"about_ca_topic_score_gemma":0.010606191,"teacher_disagreement_score":0.011666336,"about_ca_system_score_codex":0.0010020675,"about_ca_system_score_gemma":0.0012129026,"threshold_uncertainty_score":0.023196816},"labels":[],"label_agreement":null},{"id":"W3004248581","doi":"10.1109/iscc47284.2019.8969643","title":"Tutorial Information-Centric Vehicular Networking: Why and Wherefores, Challenges, and Design Guidelines","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Content distribution; Vehicular ad hoc network; Information-centric networking; Network packet; Service (business); Wireless; Cache; Telecommunications; Wireless ad hoc network; Computer network","score_opus":0.04272929270169635,"score_gpt":0.2243030673054921,"score_spread":0.18157377460379576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004248581","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033112527,0.59498173,0.14431041,0.035196934,0.035523824,0.0005297655,0.0008893462,0.0016033029,0.1836535],"genre_scores_gemma":[0.041285913,0.6344302,0.073754154,0.011779666,0.03325854,0.00053380395,0.0018415666,0.0005358845,0.20258029],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969614,0.000063944484,0.000023053233,0.00004431988,0.00013309177,0.000039513543],"domain_scores_gemma":[0.9994386,0.00015114273,0.00003348973,0.00001864523,0.00027636596,0.00008168186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603314,0.0013260469,0.00064212776,0.0011397527,0.0006459329,0.0022280398,0.0011608574,0.0016721572,0.013390607],"category_scores_gemma":[0.0014745825,0.00030303147,0.00038579118,0.0013656444,0.0005612516,0.0031318616,0.00080776337,0.0025526092,0.009851205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000062031446,0.0001190104,0.00033205526,0.0020538685,0.00003056026,0.00028754317,0.0002826803,0.006591385,0.0026712262,0.13338776,0.5012464,0.3529355],"study_design_scores_gemma":[0.0000050707536,0.00008358382,0.0001664044,0.00072153565,0.00001785358,0.00031651361,0.0001068074,0.003755926,0.00033362722,0.023196783,0.971272,0.000024020128],"about_ca_topic_score_codex":0.0023818668,"about_ca_topic_score_gemma":0.00355053,"teacher_disagreement_score":0.013390607,"about_ca_system_score_codex":0.0009679086,"about_ca_system_score_gemma":0.0011186705,"threshold_uncertainty_score":0.04479605},"labels":[],"label_agreement":null},{"id":"W3005936311","doi":"10.1145/1925861.1925879","title":"How internet concepts and technologies can help green and smarten the electrical grid","year":2011,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":41,"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":"Smart grid; Computer science; The Internet; Grid; Carbon footprint; Renewable energy; Distributed computing; Telecommunications; World Wide Web; Electrical engineering; Greenhouse gas; Engineering","score_opus":0.05004288804101078,"score_gpt":0.25322221066476797,"score_spread":0.20317932262375718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005936311","genre_codex":"other","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.020061247,0.12944128,0.09573165,0.3571456,0.0056818114,0.00011219018,0.00022335249,0.00072603376,0.3908769],"genre_scores_gemma":[0.49452996,0.2463025,0.09036856,0.05019039,0.010639014,0.00029877157,0.00026094238,0.0005211986,0.10688864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984497,0.0008333321,0.000059969134,0.00012421378,0.0003913308,0.00014135489],"domain_scores_gemma":[0.99776256,0.0012486597,0.00014340742,0.00034749488,0.00032526624,0.00017256236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250713,0.00045630024,0.00032795614,0.0017019276,0.0013996009,0.008536599,0.000779626,0.0038723624,0.007132246],"category_scores_gemma":[0.0049404786,0.00033811075,0.00043889158,0.001836469,0.0051010014,0.019204201,0.0016947963,0.0036181835,0.0023740488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000016015198,0.000037326154,0.00035770025,0.00013610307,0.000018020182,0.00012877554,0.0006503731,0.0016317868,0.00032293887,0.9272791,0.02457933,0.044842504],"study_design_scores_gemma":[0.000015873286,0.000021580567,0.00022707174,0.0001874145,0.00001764734,0.00018950527,0.00073258067,0.0017825946,0.00035204086,0.56336594,0.43308052,0.000027265074],"about_ca_topic_score_codex":0.0026696662,"about_ca_topic_score_gemma":0.0036733677,"teacher_disagreement_score":0.008536599,"about_ca_system_score_codex":0.0019282462,"about_ca_system_score_gemma":0.0020438938,"threshold_uncertainty_score":0.02385968},"labels":[],"label_agreement":null},{"id":"W3006284155","doi":"10.1109/menacomm46666.2019.8988556","title":"A Mechanism for Copyright Protection under Information-Centric Networking","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Canadian Imperial Bank of Commerce (Canada); University of New Brunswick","funders":"","keywords":"Hash function; Computer science; The Internet; Scheme (mathematics); Architecture; Information-centric networking; Computer network; Function (biology); Mechanism (biology); Similarity (geometry); Computer security; Distributed computing; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.015996126138701983,"score_gpt":0.20082462323120656,"score_spread":0.18482849709250457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006284155","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.14034061,0.001661638,0.81735414,0.002212692,0.00049042737,0.00071811967,0.00011242628,0.0034110832,0.0336988],"genre_scores_gemma":[0.89205587,0.00047038886,0.0987516,0.00045720622,0.00022260881,0.00016210109,0.000067587454,0.000068381414,0.0077443183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950629,0.0014581183,0.00040084508,0.00056204776,0.0020726756,0.0004434379],"domain_scores_gemma":[0.98211306,0.0040543852,0.0022696066,0.0077482755,0.0031365317,0.00067804183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058161505,0.00052204815,0.0008728722,0.0018758096,0.0031100684,0.0036788897,0.0025930207,0.0025663357,0.0027931253],"category_scores_gemma":[0.012930595,0.0004600105,0.0005264956,0.0016326654,0.003423768,0.00751981,0.0040119183,0.0017155046,0.0007639239],"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.0011763835,0.00078437827,0.004426162,0.0004932681,0.00012878519,0.0008505232,0.0014289998,0.022322787,0.070238486,0.6268977,0.008386472,0.26286605],"study_design_scores_gemma":[0.00056546566,0.0025480473,0.0034061281,0.00029072858,0.000322041,0.004151873,0.0007005093,0.4963063,0.17722164,0.20762631,0.10644785,0.00041305044],"about_ca_topic_score_codex":0.0010687012,"about_ca_topic_score_gemma":0.00069611723,"teacher_disagreement_score":0.0058161505,"about_ca_system_score_codex":0.0020011428,"about_ca_system_score_gemma":0.0024735301,"threshold_uncertainty_score":0.030759096},"labels":[],"label_agreement":null},{"id":"W3006504285","doi":"10.48550/arxiv.2002.06251","title":"The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity","year":2020,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; State Key Laboratory of Software Development Environment","keywords":"Computer science; Popularity; Probabilistic logic; Exploit; Markov chain; Dynamic web page; Content (measure theory); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Computer security","score_opus":0.08948868830741302,"score_gpt":0.25111274121592747,"score_spread":0.16162405290851445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006504285","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.009024419,0.000100039644,0.98964256,0.000111023095,0.00001713067,0.00005054743,0.000021762145,0.00022365553,0.0008090289],"genre_scores_gemma":[0.84842795,0.00029756056,0.14943367,0.00013219996,0.000041581545,0.0002321038,0.00006913092,0.00006984369,0.0012959373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981943,0.0005587852,0.00010112481,0.00045809068,0.00048083573,0.00020686672],"domain_scores_gemma":[0.99649197,0.0015056791,0.0005094863,0.00043501775,0.0008823622,0.00017545256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016956151,0.0007453052,0.00096405926,0.0004653406,0.00050687237,0.0010659868,0.0022045653,0.0010603499,0.0009058145],"category_scores_gemma":[0.00885327,0.0007038708,0.0004605236,0.0007343849,0.0008534392,0.0017990274,0.0010782969,0.0010045713,0.00027021495],"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.00012558763,0.000083129395,0.0014678558,0.00013844842,0.00004878232,0.00015557239,0.00012174262,0.90373147,0.012860301,0.037355594,0.001309665,0.042601887],"study_design_scores_gemma":[0.000010146287,0.00003325853,0.00008593409,0.000004583665,0.000011960894,0.00005566628,0.000008885572,0.9945722,0.0014428935,0.0032302996,0.0005365874,0.000007456118],"about_ca_topic_score_codex":0.0033215943,"about_ca_topic_score_gemma":0.0028608334,"teacher_disagreement_score":0.0033215943,"about_ca_system_score_codex":0.0013380628,"about_ca_system_score_gemma":0.0021763926,"threshold_uncertainty_score":0.009708405},"labels":[],"label_agreement":null},{"id":"W3008115664","doi":"10.1007/978-3-030-40783-4_18","title":"Linear Hashing Implementations for Flash Memory","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hash function; Computer science; Flash memory; Hash table; Flash (photography); Linear hashing; Search engine indexing; Parallel computing; Universal hashing; Implementation; Memory management; Double hashing; Dynamic perfect hashing; Computer hardware; Semiconductor memory; Programming language; Information retrieval","score_opus":0.02799625538510061,"score_gpt":0.2597046319881146,"score_spread":0.231708376603014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008115664","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.048651263,0.0074450513,0.86422086,0.00070372666,0.0008203232,0.00029667313,0.0016802212,0.026238505,0.049943354],"genre_scores_gemma":[0.5310347,0.001962087,0.38538155,0.0006236971,0.00037424464,0.00050130027,0.003383367,0.0016613549,0.07507763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923563,0.00012412368,0.000073866,0.000105824,0.00027925966,0.00018133012],"domain_scores_gemma":[0.9986563,0.00027241517,0.000054715627,0.00068396656,0.00028315757,0.000049462524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063204713,0.00069079717,0.0007209692,0.0008203158,0.0007403712,0.002218941,0.0029526034,0.0008628342,0.048963208],"category_scores_gemma":[0.0021928803,0.0005119765,0.00046128168,0.001995439,0.00060586835,0.0039865617,0.002312634,0.0009792312,0.010347633],"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.0012044014,0.0002584718,0.0008914471,0.0007925735,0.00010626848,0.00016517635,0.0003088191,0.016209226,0.021712488,0.14077285,0.08048318,0.7370952],"study_design_scores_gemma":[0.0006200259,0.00081351155,0.0010841365,0.00042346818,0.00017328458,0.0006939744,0.00065696717,0.34018826,0.09532014,0.40459317,0.15524738,0.00018569971],"about_ca_topic_score_codex":0.0014745691,"about_ca_topic_score_gemma":0.0026851774,"teacher_disagreement_score":0.048963208,"about_ca_system_score_codex":0.0012853196,"about_ca_system_score_gemma":0.0010666216,"threshold_uncertainty_score":0.16379821},"labels":[],"label_agreement":null},{"id":"W3008987547","doi":"10.1109/globecom38437.2019.9013389","title":"Edge Caching and Content Delivery with Minimized Delay for Both High-Speed Train and Local Users","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Lagrange multiplier; Mathematical optimization; Knapsack problem; Benchmark (surveying); Optimization problem; Lagrangian relaxation; Enhanced Data Rates for GSM Evolution; Integer programming; Power (physics); Content delivery; Bisection method; Algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.02042827656662569,"score_gpt":0.2029692810388149,"score_spread":0.1825410044721892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008987547","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.18458228,0.0008746519,0.80450994,0.00049590395,0.00006007271,0.00012278101,0.0001951655,0.00032097113,0.008838251],"genre_scores_gemma":[0.94871455,0.00040307385,0.04541745,0.00008839887,0.000041971027,0.00006550179,0.00013705881,0.00005481654,0.0050771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996056,0.00008927923,0.000012741637,0.00009293014,0.00006941221,0.00012996147],"domain_scores_gemma":[0.9994796,0.00023411922,0.00007452689,0.000046935253,0.000105287654,0.000059426857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046387772,0.000844881,0.00087533926,0.00028694927,0.00059097284,0.0010252045,0.00090922054,0.00115593,0.00245993],"category_scores_gemma":[0.0014309257,0.00026963284,0.00048891903,0.0008982813,0.00044432256,0.0013328139,0.0006855995,0.0005487935,0.0003342171],"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.0003212454,0.00014974487,0.0022372361,0.00023787073,0.0000797961,0.0004940533,0.000112214395,0.9088883,0.017991453,0.020463128,0.0036146662,0.045410343],"study_design_scores_gemma":[0.000013504997,0.000063276515,0.00031825705,0.000003762791,0.000024766756,0.00010194404,0.00005667772,0.993704,0.0029148967,0.0021539105,0.0006371497,0.000007712695],"about_ca_topic_score_codex":0.008127484,"about_ca_topic_score_gemma":0.00727135,"teacher_disagreement_score":0.008127484,"about_ca_system_score_codex":0.00158506,"about_ca_system_score_gemma":0.0013802457,"threshold_uncertainty_score":0.016160369},"labels":[],"label_agreement":null},{"id":"W3009149236","doi":"10.1145/2534169.2491714","title":"Smart in-network deduplication for storage-aware SDN","year":2013,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Data deduplication; Computer science; Bottleneck; Computer network; Search engine indexing; Distributed computing; Overhead (engineering); Software-defined networking; Operating system; Embedded system","score_opus":0.032118283155579574,"score_gpt":0.27151683949083083,"score_spread":0.23939855633525126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009149236","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.16438854,0.0028756063,0.8203885,0.00045148868,0.00053668657,0.00035004684,0.0002652826,0.004776497,0.0059673055],"genre_scores_gemma":[0.84457815,0.00067653955,0.15170312,0.00023717471,0.000111426896,0.00011749736,0.00033165698,0.00012845085,0.0021159342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949026,0.00009449256,0.000075965145,0.000097850876,0.00018842319,0.000052938387],"domain_scores_gemma":[0.9979808,0.00042660595,0.00015770293,0.00082371413,0.00052676914,0.000084346226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011917095,0.00043787068,0.00048377368,0.0005616663,0.00073442305,0.0009989053,0.0015763659,0.00031186893,0.000782527],"category_scores_gemma":[0.002083637,0.00023050803,0.0002431691,0.0005324716,0.0004941504,0.0018171058,0.0009087108,0.00065501366,0.00017182415],"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.0013641135,0.00059787364,0.0126344105,0.0011972398,0.00024987423,0.000727869,0.0006960062,0.074423574,0.280872,0.052043427,0.01589925,0.55929434],"study_design_scores_gemma":[0.00011275376,0.00035115928,0.002160575,0.00006918394,0.0001446269,0.0008781594,0.00015467285,0.7534733,0.19877541,0.014476688,0.029323507,0.00008005045],"about_ca_topic_score_codex":0.00086265715,"about_ca_topic_score_gemma":0.0017449867,"teacher_disagreement_score":0.0015763659,"about_ca_system_score_codex":0.0008321223,"about_ca_system_score_gemma":0.00096470345,"threshold_uncertainty_score":0.0063024163},"labels":[],"label_agreement":null},{"id":"W3009189291","doi":"10.1109/globecom38437.2019.9014224","title":"Adaptive Content Placement in Edge Networks Based on Hybrid User Preference Learning","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Victoria","funders":"","keywords":"Computer science; Backhaul (telecommunications); Stochastic gradient descent; Enhanced Data Rates for GSM Evolution; Hybrid learning; Latency (audio); Gradient descent; Cloud computing; Artificial intelligence; Content delivery; Artificial neural network; Machine learning; Computer network; Base station","score_opus":0.047328783008222845,"score_gpt":0.2101738533164994,"score_spread":0.16284507030827655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009189291","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.08014718,0.0002486032,0.91795594,0.00018206803,0.000031362724,0.0000450132,0.000050305196,0.00037676873,0.0009626857],"genre_scores_gemma":[0.931594,0.00013365557,0.06628251,0.00015965858,0.000037816888,0.000057996927,0.00008259172,0.000027822001,0.0016238664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999373,0.00018292601,0.000029335279,0.0001611569,0.00013479374,0.00011884699],"domain_scores_gemma":[0.99851257,0.00076961843,0.00015363828,0.00011020759,0.00035747464,0.00009650255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008224322,0.0007160242,0.0011088194,0.00046442638,0.0004014351,0.00070257735,0.001662268,0.0009367722,0.00070796144],"category_scores_gemma":[0.0028924113,0.00038858788,0.0003467073,0.0008378999,0.00060484547,0.0015125574,0.00088301516,0.0007303965,0.00021115085],"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.00022689575,0.00014958868,0.0038212892,0.000050862134,0.000060436978,0.00011014053,0.00008312837,0.9004107,0.004097403,0.0037923055,0.0014859268,0.0857113],"study_design_scores_gemma":[0.0000039051447,0.00001375357,0.00008356586,7.5277035e-7,0.0000024722133,0.000009794078,0.0000038785884,0.99892575,0.00034717892,0.00055956707,0.00004689377,0.0000025151091],"about_ca_topic_score_codex":0.006964699,"about_ca_topic_score_gemma":0.007906862,"teacher_disagreement_score":0.006964699,"about_ca_system_score_codex":0.00084739615,"about_ca_system_score_gemma":0.00090873736,"threshold_uncertainty_score":0.013848364},"labels":[],"label_agreement":null},{"id":"W3010743140","doi":"10.48550/arxiv.2003.05111","title":"Constellation: A High Performance Geo-Distributed Middlebox Framework","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 Waterloo","funders":"","keywords":"Constellation; Computer science; Physics; Astronomy","score_opus":0.07669618885899973,"score_gpt":0.17244892670588882,"score_spread":0.09575273784688909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010743140","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.021450108,0.0008264053,0.89498883,0.00043440383,0.0002370081,0.00048479575,0.00080999616,0.072078295,0.008690124],"genre_scores_gemma":[0.52398103,0.0010377822,0.45334485,0.0004022464,0.0002064636,0.0009492255,0.003325373,0.0038226289,0.012930394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897075,0.00021180864,0.000092880684,0.00013353967,0.00042526596,0.00016576558],"domain_scores_gemma":[0.9987832,0.0002419367,0.00008413331,0.0005104788,0.00015237989,0.00022787314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138491,0.0010072557,0.0010598132,0.0012692333,0.0010777859,0.002780683,0.003742452,0.0014206222,0.006713965],"category_scores_gemma":[0.0038573637,0.0008190743,0.0008858281,0.00090768724,0.0011221247,0.005122203,0.0055601345,0.0019084703,0.0026788916],"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.0030411852,0.0007496033,0.005649813,0.0009163413,0.00046274418,0.0014680147,0.0015202713,0.18276946,0.054674555,0.3917638,0.1262478,0.23073636],"study_design_scores_gemma":[0.0004910917,0.00027200827,0.0007432283,0.000090434056,0.00016129365,0.00039120438,0.0001403355,0.74669796,0.020092247,0.084861964,0.14589995,0.0001583063],"about_ca_topic_score_codex":0.0036479083,"about_ca_topic_score_gemma":0.0029045646,"teacher_disagreement_score":0.006713965,"about_ca_system_score_codex":0.0015463914,"about_ca_system_score_gemma":0.0018504602,"threshold_uncertainty_score":0.022460401},"labels":[],"label_agreement":null},{"id":"W3010947255","doi":"10.1109/access.2020.2981665","title":"Collaborative Content Distribution With an End-to-End Caching Framework","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Enhanced Data Rates for GSM Evolution; Distributed computing; Bandwidth (computing); Core network; Key (lock); Load balancing (electrical power); Routing (electronic design automation); Edge device; Network congestion; Computer security; Network packet","score_opus":0.05009248106149478,"score_gpt":0.29235032344250417,"score_spread":0.2422578423810094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010947255","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.022041086,0.00017200214,0.974081,0.0001834295,0.00002617703,0.00009703924,0.000044029544,0.000794906,0.0025604474],"genre_scores_gemma":[0.79877925,0.00018074561,0.19630317,0.00014062501,0.00005263249,0.00012355107,0.00010081522,0.00006725907,0.004251948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895406,0.00027841257,0.00005917008,0.00021996538,0.0002883666,0.00019997901],"domain_scores_gemma":[0.99851745,0.00041951955,0.00012611083,0.00039778338,0.00039862606,0.00014053285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012475087,0.0006810831,0.0012614946,0.0007670705,0.0010333586,0.0019271483,0.0036355532,0.0020894522,0.0014720017],"category_scores_gemma":[0.0026223087,0.00038337914,0.000735241,0.0011297286,0.0010426954,0.0027116938,0.0018552231,0.0010812156,0.00038303446],"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.00030249034,0.0004395494,0.0015497988,0.000081333936,0.000118583404,0.00040320738,0.00025565695,0.8199797,0.012555401,0.087811545,0.0048361197,0.071666546],"study_design_scores_gemma":[0.000009787684,0.000023146258,0.000057078563,0.0000020881455,0.000012934266,0.000047496207,0.000015831956,0.993646,0.0012351465,0.0043322076,0.0006104287,0.000007863583],"about_ca_topic_score_codex":0.01019534,"about_ca_topic_score_gemma":0.0104723815,"teacher_disagreement_score":0.01019534,"about_ca_system_score_codex":0.0020399021,"about_ca_system_score_gemma":0.0022886242,"threshold_uncertainty_score":0.020272017},"labels":[],"label_agreement":null},{"id":"W3011047918","doi":"10.1109/twc.2020.2979958","title":"Improving Caching Efficiency in Content-Aware C-RAN-Based Cooperative Beamforming: A Joint Design Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Radio access network; Cache; Telecommunications link; C-RAN; Beamforming; Baseband; Optimization problem; Computer network; Real-time computing; Distributed computing; Base station; Algorithm; Telecommunications","score_opus":0.10598150894021491,"score_gpt":0.25678812000848406,"score_spread":0.15080661106826915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011047918","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.0060571027,0.000103097256,0.9929046,0.000041249223,0.000009375431,0.000020801017,0.00000770638,0.00007716018,0.00077900337],"genre_scores_gemma":[0.56859,0.00044926623,0.42849803,0.00014025303,0.000052180418,0.00020045135,0.0000639828,0.00006949031,0.0019362823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.000340762,0.000030634088,0.00013232946,0.00022497252,0.00010242454],"domain_scores_gemma":[0.99879175,0.00060643733,0.00013797067,0.00009746575,0.0003046527,0.0000616597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013272706,0.0011738659,0.0007462576,0.00042235202,0.00034993948,0.0009863258,0.0011557896,0.00092576636,0.000913207],"category_scores_gemma":[0.0028983748,0.0004639885,0.0004919628,0.0008026964,0.0006872863,0.0009342244,0.0009214542,0.000747817,0.00038846937],"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.00012471694,0.000075056974,0.0005818355,0.00009960479,0.000041621322,0.00008277207,0.000060057893,0.91490775,0.01753856,0.009595994,0.0005861096,0.056305934],"study_design_scores_gemma":[0.0000065490626,0.000055374017,0.000046455956,0.0000040269033,0.000009113108,0.000025194131,0.000008688403,0.99690646,0.0017567148,0.00089412264,0.00028245745,0.000004812581],"about_ca_topic_score_codex":0.0021071716,"about_ca_topic_score_gemma":0.0031118502,"teacher_disagreement_score":0.0021071716,"about_ca_system_score_codex":0.0006903678,"about_ca_system_score_gemma":0.0013584438,"threshold_uncertainty_score":0.0070194006},"labels":[],"label_agreement":null},{"id":"W3011065733","doi":"10.1109/tifs.2020.2980823","title":"Game Theory and Reinforcement Learning Based Secure Edge Caching in Mobile Social Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":95,"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 New Brunswick","funders":"Higher Education Discipline Innovation Project; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Stackelberg competition; Computer network; Enhanced Data Rates for GSM Evolution; Service provider; Mobile device; Payment; Edge device; Server; Edge computing; Service (business); Computer security; Telecommunications; World Wide Web; Cloud computing","score_opus":0.00881855331969114,"score_gpt":0.2068326833982626,"score_spread":0.19801413007857147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011065733","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.070525885,0.00074019365,0.9149326,0.0011924988,0.00011594577,0.00012224133,0.0001744552,0.00017894589,0.012017269],"genre_scores_gemma":[0.97358793,0.000413715,0.02052648,0.0001495557,0.00004946873,0.00013843886,0.00007344569,0.00001892407,0.005042037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987575,0.0005759698,0.00004425353,0.00022024217,0.00016244115,0.00023964814],"domain_scores_gemma":[0.996874,0.0021932377,0.0003301254,0.000081366496,0.00030777583,0.00021342405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014387812,0.000995846,0.001345255,0.0005760476,0.0006553165,0.001253809,0.0013879972,0.0014141088,0.002749742],"category_scores_gemma":[0.0047317003,0.00040251363,0.00080801814,0.0005418017,0.0015565827,0.001599599,0.0012129176,0.0017322733,0.00026200915],"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.00007222542,0.00007197787,0.0014460107,0.00008803325,0.0000638417,0.0003403035,0.00015449668,0.85835034,0.00074211974,0.12810299,0.0016021173,0.008965556],"study_design_scores_gemma":[0.000009746079,0.000014766147,0.00008701942,0.0000040341915,0.0000063388225,0.000014440949,0.000016371605,0.98354614,0.00004199233,0.01602143,0.00023247152,0.0000052096507],"about_ca_topic_score_codex":0.011639152,"about_ca_topic_score_gemma":0.008004093,"teacher_disagreement_score":0.011639152,"about_ca_system_score_codex":0.0022000032,"about_ca_system_score_gemma":0.001693571,"threshold_uncertainty_score":0.023142815},"labels":[],"label_agreement":null},{"id":"W3011415141","doi":"","title":"{FLAIR}: Accelerating Reads with Consistency-Aware Network Routing","year":2020,"lang":"en","type":"article","venue":"Networked Systems Design and Implementation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Routing (electronic design automation); Consistency (knowledge bases); Computer network; Artificial intelligence","score_opus":0.06289443451404012,"score_gpt":0.2629196290944399,"score_spread":0.20002519458039977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011415141","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.04029195,0.0014402258,0.7780392,0.0009185517,0.0011028859,0.00038770912,0.0012145285,0.15550153,0.021103399],"genre_scores_gemma":[0.47571418,0.000516489,0.48734438,0.0008370497,0.00026309278,0.00034691504,0.0027440975,0.007772255,0.024461553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745005,0.00061137753,0.00016296632,0.00041790993,0.0009996225,0.00035802327],"domain_scores_gemma":[0.99397534,0.0012822741,0.00027305173,0.0031655822,0.0010240959,0.00027967684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024106496,0.0015611588,0.0011297308,0.0012503738,0.0012938171,0.003187464,0.006396828,0.0012316698,0.015596309],"category_scores_gemma":[0.009474833,0.0008482391,0.0005983622,0.0013719916,0.0011459214,0.0043297173,0.003130312,0.0024858946,0.0036421884],"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.003025744,0.00075771427,0.0037764101,0.0008052147,0.000334896,0.00025909775,0.0004732083,0.109610684,0.036759093,0.065888084,0.15479825,0.6235117],"study_design_scores_gemma":[0.00031792064,0.0003359622,0.00048084153,0.000072778836,0.00013802543,0.00015445531,0.00013519605,0.8725919,0.05716143,0.03209466,0.036419492,0.000097333876],"about_ca_topic_score_codex":0.010056987,"about_ca_topic_score_gemma":0.015828721,"teacher_disagreement_score":0.015596309,"about_ca_system_score_codex":0.001834755,"about_ca_system_score_gemma":0.0028586413,"threshold_uncertainty_score":0.052174807},"labels":[],"label_agreement":null},{"id":"W3014076369","doi":"10.1109/ieeeconf44664.2019.9048950","title":"Subpacketization Level in Optimal Placement for Coded Caching with Nonuniform File Popularities","year":2019,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Cache; Computer science; Parallel computing; Scheme (mathematics); Cache algorithms; CPU cache; Mathematics","score_opus":0.023038195823981533,"score_gpt":0.2224883612478606,"score_spread":0.19945016542387906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014076369","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.6192557,0.00046890648,0.37558272,0.00033535052,0.000032516044,0.00008491086,0.00016525724,0.00024503504,0.0038296098],"genre_scores_gemma":[0.9603526,0.00014607751,0.038500287,0.000033461827,0.000012533332,0.000042891985,0.000079358426,0.000040717434,0.00079205283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895275,0.00031206597,0.000039451897,0.00015057847,0.00021524042,0.00032992908],"domain_scores_gemma":[0.9937383,0.003972158,0.00075211533,0.00056069635,0.00069140916,0.00028526314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012619644,0.00062178023,0.00079132983,0.0006104088,0.0008513474,0.0012437984,0.0009888983,0.0008417929,0.0015096392],"category_scores_gemma":[0.010955728,0.00049150607,0.00035105352,0.0011575762,0.0012797931,0.0022759908,0.0009019408,0.0007180523,0.00015780132],"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.0003134746,0.000053120726,0.0030992196,0.000072431896,0.000021885839,0.00022281484,0.00012038636,0.9570089,0.0052421326,0.02173643,0.00074733485,0.011361889],"study_design_scores_gemma":[0.0000088946845,0.000051678075,0.00053961086,0.0000057664993,0.0000094840225,0.000059710597,0.000064614906,0.99081355,0.0021268693,0.0061322083,0.00017812627,0.000009462394],"about_ca_topic_score_codex":0.0059826095,"about_ca_topic_score_gemma":0.0060537793,"teacher_disagreement_score":0.0059826095,"about_ca_system_score_codex":0.0030106653,"about_ca_system_score_gemma":0.0015587274,"threshold_uncertainty_score":0.02184397},"labels":[],"label_agreement":null},{"id":"W3014297757","doi":"10.1109/tmc.2020.2984261","title":"LeaD: Large-Scale Edge Cache Deployment Based on Spatio-Temporal WiFi Traffic Statistics","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":144,"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 Waterloo","funders":"National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Software deployment; Backhaul (telecommunications); Bottleneck; Enhanced Data Rates for GSM Evolution; Telecommunications; Operating system; Embedded system; Base station","score_opus":0.023736029891642318,"score_gpt":0.2440994077803274,"score_spread":0.2203633778886851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014297757","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.77993494,0.00073854957,0.2027857,0.0005215365,0.00012119295,0.00040010692,0.002864643,0.009113332,0.0035200329],"genre_scores_gemma":[0.96203375,0.00016676403,0.035229266,0.0000608595,0.00002116157,0.000096990814,0.001860916,0.000078177654,0.00045208144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.00010963231,0.000040152096,0.00018362408,0.00014774829,0.00013154071],"domain_scores_gemma":[0.99840826,0.00041620477,0.0001940449,0.00034387788,0.00039018082,0.00024751146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076341344,0.001197968,0.00077172334,0.0012562554,0.0007696834,0.0009957474,0.0016947243,0.0005868714,0.0004969891],"category_scores_gemma":[0.0042777397,0.0003725196,0.00041044594,0.0016982784,0.00043851958,0.0017164497,0.0013532424,0.00058184593,0.0002983462],"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.0008310114,0.00068682595,0.21903603,0.0004791275,0.0003563719,0.0015189119,0.00082924357,0.56393063,0.04007931,0.004947465,0.016465608,0.15083948],"study_design_scores_gemma":[0.0000294576,0.00015005685,0.015372006,0.000013292517,0.000047314934,0.00028723545,0.0002662779,0.97653925,0.0046455236,0.0012493777,0.0013641901,0.000035954406],"about_ca_topic_score_codex":0.015079475,"about_ca_topic_score_gemma":0.032037336,"teacher_disagreement_score":0.015079475,"about_ca_system_score_codex":0.0008301087,"about_ca_system_score_gemma":0.0012175344,"threshold_uncertainty_score":0.029983401},"labels":[],"label_agreement":null},{"id":"W3014396412","doi":"10.1145/3390251.3390254","title":"A survey on the current internet interconnection practices","year":2020,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Peering; Interconnection; Computer science; The Internet; Process (computing); Internet topology; Network topology; Computer network; Distributed computing; Telecommunications; Topology (electrical circuits); World Wide Web; Electrical engineering; Engineering","score_opus":0.2042575570085859,"score_gpt":0.3480534236731794,"score_spread":0.14379586666459349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014396412","genre_codex":"review","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.25419062,0.5088583,0.026386155,0.013480818,0.00074355333,0.00021420953,0.0023768465,0.0009826359,0.19276692],"genre_scores_gemma":[0.37515217,0.5812924,0.018168772,0.002710867,0.0009140137,0.00018287955,0.003943235,0.00039706693,0.017238636],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9967933,0.00081347045,0.0004380464,0.000381165,0.0013258193,0.0002481291],"domain_scores_gemma":[0.9866801,0.007117119,0.0019244362,0.0008615513,0.0030274563,0.00038941263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035568802,0.00045525774,0.0004129843,0.0059287925,0.0008093567,0.0033744613,0.0008933708,0.0011073801,0.004279714],"category_scores_gemma":[0.010047027,0.00039037678,0.00033819024,0.018947512,0.0007658839,0.006624085,0.001034015,0.0008804976,0.0015242936],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001220023,0.00012425633,0.031800304,0.0039290898,0.00005061928,0.00033896122,0.0050305873,0.002333244,0.003121746,0.036619477,0.05699836,0.8595314],"study_design_scores_gemma":[0.0000080404825,0.00015466519,0.041593608,0.002652662,0.00008559705,0.0014965012,0.005797658,0.0021300626,0.0017956472,0.0053158356,0.9389038,0.00006588107],"about_ca_topic_score_codex":0.0027562575,"about_ca_topic_score_gemma":0.0029183575,"teacher_disagreement_score":0.0059287925,"about_ca_system_score_codex":0.0013269938,"about_ca_system_score_gemma":0.0012240363,"threshold_uncertainty_score":0.018810809},"labels":[],"label_agreement":null},{"id":"W3014642337","doi":"10.1145/2534169.2486023","title":"Less pain, most of the gain","year":2013,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Replica; Latency (audio); Computer network; Information-centric networking; Architecture; Routing (electronic design automation); TRACE (psycholinguistics); Simple (philosophy); Service (business); Content centric networking; Computer security; Distributed computing; Cache; Telecommunications","score_opus":0.03447428129802163,"score_gpt":0.2477086548005272,"score_spread":0.21323437350250557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014642337","genre_codex":"other","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.019552322,0.031601068,0.04577947,0.3139223,0.011242704,0.000098665405,0.0014262589,0.0020462333,0.574331],"genre_scores_gemma":[0.41105205,0.03461585,0.03648687,0.10591989,0.010469907,0.00016085923,0.0015035971,0.0013832743,0.3984078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875665,0.00028790763,0.000041240808,0.00019911671,0.0005106262,0.00020444857],"domain_scores_gemma":[0.99674416,0.00072111026,0.00021029792,0.00095552317,0.00088500575,0.00048389073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001991212,0.00095279113,0.0007422822,0.0009580211,0.0014972592,0.004592379,0.0013136582,0.0024667683,0.0763917],"category_scores_gemma":[0.009353455,0.0002998747,0.00057389494,0.0009316879,0.0027773026,0.009929843,0.003534059,0.003404238,0.029011454],"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.0004465112,0.00021305392,0.0020532191,0.0008638296,0.00010020385,0.000321648,0.0005985782,0.0013068054,0.0062808245,0.36322528,0.29846206,0.326128],"study_design_scores_gemma":[0.000041333842,0.000118258504,0.0010832463,0.0004920453,0.00005758888,0.0005924537,0.0008221679,0.0007387577,0.0013026096,0.08799286,0.90672654,0.00003215585],"about_ca_topic_score_codex":0.0029205228,"about_ca_topic_score_gemma":0.0035785595,"teacher_disagreement_score":0.0763917,"about_ca_system_score_codex":0.0023331316,"about_ca_system_score_gemma":0.0021826655,"threshold_uncertainty_score":0.2555557},"labels":[],"label_agreement":null},{"id":"W3016083407","doi":"10.1109/tetc.2020.2986238","title":"HCP: Heterogeneous Computing Platform for Federated Learning Based Collaborative Content Caching Towards 6G Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Thunder Bay Regional Research Institute","funders":"","keywords":"Computer science; Base station; Computer network; Asynchronous communication; Distributed computing; Cloud computing; User equipment; Enhanced Data Rates for GSM Evolution; Quality of experience; Wireless; Heterogeneous network; Wireless network; Quality of service; Artificial intelligence","score_opus":0.05172493754323914,"score_gpt":0.2740669852737742,"score_spread":0.22234204773053506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016083407","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.05551878,0.00028592086,0.9400021,0.00029286824,0.00007861188,0.00007151976,0.00004431147,0.000886943,0.0028190257],"genre_scores_gemma":[0.85802054,0.00016805135,0.1398841,0.00013309953,0.00003613887,0.00008200572,0.00010601202,0.000029150995,0.0015409109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996754,0.00008604074,0.000013017169,0.000078052384,0.000082795166,0.000064655265],"domain_scores_gemma":[0.9996537,0.000097288714,0.000035527104,0.00009609514,0.00006979664,0.00004753331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006627628,0.00046638484,0.00052295456,0.00022084922,0.00053537934,0.0008068148,0.0012812171,0.00070312864,0.0010067319],"category_scores_gemma":[0.0010728186,0.00015982306,0.00040891813,0.00032102282,0.0005202831,0.0010485082,0.0013730205,0.00086239004,0.0002228781],"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.00019946902,0.00012371925,0.0016415801,0.00004955696,0.000052074563,0.0002682826,0.000070175105,0.88527787,0.009153497,0.024220815,0.0028262732,0.076116666],"study_design_scores_gemma":[0.000005374311,0.000021435748,0.0000773882,0.0000015388733,0.0000033944168,0.000015820115,0.000006257433,0.9961494,0.0009034836,0.002387657,0.00042574288,0.0000024612757],"about_ca_topic_score_codex":0.0031295337,"about_ca_topic_score_gemma":0.0026438662,"teacher_disagreement_score":0.0031295337,"about_ca_system_score_codex":0.0006190257,"about_ca_system_score_gemma":0.0008321714,"threshold_uncertainty_score":0.0062226653},"labels":[],"label_agreement":null},{"id":"W3016207298","doi":"10.1109/jiot.2020.2986803","title":"Federated Deep Reinforcement Learning for Internet of Things With Decentralized Cooperative Edge Caching","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":410,"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 British Columbia","funders":"Academy of Finland; Natural Sciences and Engineering Research Council of Canada; Chongqing Research Program of Basic Research and Frontier Technology; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Backhaul (telecommunications); Upload; Computer network; Base station; The Internet; Enhanced Data Rates for GSM Evolution; Distributed computing; Edge device; Edge computing; Telecommunications; Artificial intelligence","score_opus":0.022878292584923448,"score_gpt":0.2434020510802703,"score_spread":0.22052375849534686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016207298","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.054516777,0.00058119925,0.94107574,0.00045041286,0.00008350398,0.00004119736,0.000054160762,0.00059671595,0.0026002582],"genre_scores_gemma":[0.9708477,0.000108571636,0.027148725,0.00014400645,0.000022350307,0.00006306722,0.000062437175,0.000025866771,0.0015772815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996518,0.000091701004,0.000016134958,0.00008380088,0.0000682429,0.0000883577],"domain_scores_gemma":[0.9988109,0.00070728007,0.00012116676,0.00007804396,0.00020547103,0.00007708707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010961138,0.00078886026,0.0011053681,0.0002683925,0.00036246324,0.0006071543,0.0011944108,0.0010870823,0.0011492901],"category_scores_gemma":[0.003043079,0.00038917863,0.0004175933,0.0003316357,0.00085604296,0.0006996411,0.0010817003,0.0013519047,0.00016249095],"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.000046683705,0.00004693185,0.000539503,0.000024490282,0.000023135026,0.000045277266,0.000026438925,0.97889334,0.00056172645,0.0031428263,0.00048601092,0.016163543],"study_design_scores_gemma":[0.0000032430576,0.000008821625,0.00002734062,0.0000012759446,0.0000020024231,0.0000027261742,0.0000018465438,0.9988061,0.000069493355,0.001031561,0.000044222103,0.0000013341036],"about_ca_topic_score_codex":0.010118842,"about_ca_topic_score_gemma":0.010320897,"teacher_disagreement_score":0.010118842,"about_ca_system_score_codex":0.00097079005,"about_ca_system_score_gemma":0.0013341372,"threshold_uncertainty_score":0.020119905},"labels":[],"label_agreement":null},{"id":"W3021708214","doi":"10.1109/ojcoms.2020.2992305","title":"Traffic Offloading for Content Distribution Assisted With Device-to-Device Communications","year":2020,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer network; Mobile device; Cellular traffic; Focus (optics); Mobile edge computing; Channel (broadcasting); Content distribution; Cellular network; Distributed computing; Content delivery; Transmission (telecommunications); Server; Telecommunications","score_opus":0.24567030545160098,"score_gpt":0.3392056590038508,"score_spread":0.09353535355224982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021708214","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.1103442,0.0006406799,0.875242,0.00046127525,0.00016777316,0.00027626977,0.00024081058,0.0013685276,0.011258485],"genre_scores_gemma":[0.9281583,0.00023094572,0.06834061,0.000082601466,0.000053476717,0.000100989855,0.00018527161,0.000089855566,0.002758089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932957,0.00021286661,0.00002415786,0.00011864128,0.00013247045,0.00018224298],"domain_scores_gemma":[0.9988073,0.000593936,0.000084867155,0.00023268229,0.00016645904,0.00011471711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069556216,0.0008516808,0.0010305886,0.00070116203,0.0010565952,0.0011090116,0.0015213564,0.0009882649,0.0030835413],"category_scores_gemma":[0.0025549873,0.00028214892,0.00049848197,0.0015226267,0.0006159912,0.0011983281,0.0013669104,0.00073783274,0.00054088834],"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.00048437456,0.00041685472,0.0019950997,0.0002718321,0.00005897582,0.00041206344,0.00020510492,0.7279967,0.018716546,0.031224404,0.010240402,0.20797755],"study_design_scores_gemma":[0.000013622645,0.00003285991,0.00016893077,0.0000048650736,0.0000074594413,0.00006134404,0.00004195158,0.9901406,0.0018793076,0.006287872,0.0013544481,0.0000066907082],"about_ca_topic_score_codex":0.0037142213,"about_ca_topic_score_gemma":0.004968151,"teacher_disagreement_score":0.0037142213,"about_ca_system_score_codex":0.0011972453,"about_ca_system_score_gemma":0.0014873567,"threshold_uncertainty_score":0.010315418},"labels":[],"label_agreement":null},{"id":"W3023209583","doi":"10.1145/3380613","title":"Content Delivery Networks","year":2020,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Cloud computing; Bridge (graph theory); Standardization; Data science; Subject (documents); Knowledge management; World Wide Web","score_opus":0.13813819357378515,"score_gpt":0.3047190134333348,"score_spread":0.16658081985954964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023209583","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005518939,0.69808334,0.04637765,0.008958537,0.0036554367,0.00048259148,0.0015213051,0.0011101499,0.23429202],"genre_scores_gemma":[0.056148045,0.84345484,0.027819317,0.0036784715,0.002714682,0.00032906455,0.0022702445,0.0002465894,0.06333867],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985526,0.00034324802,0.00007970255,0.00021793257,0.0006673457,0.00013914204],"domain_scores_gemma":[0.995996,0.0019443539,0.00029993177,0.0003575525,0.0012191524,0.00018308268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014304202,0.000625931,0.0006775864,0.003815817,0.0008236737,0.0037804744,0.0015956379,0.0016748608,0.018837307],"category_scores_gemma":[0.006041921,0.00031025326,0.00038416497,0.0067990096,0.0006590686,0.0072827316,0.0016354799,0.0011734628,0.011451144],"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.000046909998,0.000057721747,0.00055077294,0.0038096958,0.000031803887,0.00012397693,0.0001788463,0.000900191,0.0013538152,0.09065518,0.09258859,0.8097025],"study_design_scores_gemma":[0.0000052554333,0.00002950125,0.00035183653,0.0010205102,0.000021470783,0.0005194221,0.000115090384,0.0009358189,0.00069906487,0.009559645,0.986728,0.0000144868245],"about_ca_topic_score_codex":0.0026362825,"about_ca_topic_score_gemma":0.0018562715,"teacher_disagreement_score":0.018837307,"about_ca_system_score_codex":0.0025879757,"about_ca_system_score_gemma":0.0020722374,"threshold_uncertainty_score":0.06301707},"labels":[],"label_agreement":null},{"id":"W3024137225","doi":"10.1109/tvt.2020.2994181","title":"Smart Proactive Caching: Empower the Video Delivery for Autonomous Vehicles in ICN-Based Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":82,"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","keywords":"Computer science; Cache; Quality of experience; Computer network; Augmented reality; Popularity; Multimedia; Quality of service; Human–computer interaction","score_opus":0.016673880663216976,"score_gpt":0.21861771780351116,"score_spread":0.20194383714029418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024137225","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.15892056,0.0043168184,0.8255417,0.0007693539,0.00037956896,0.00021577034,0.00025037673,0.002123436,0.007482475],"genre_scores_gemma":[0.9350071,0.00084579864,0.061284482,0.00023781019,0.00008834124,0.000053275795,0.00020541051,0.000037510308,0.0022402876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996414,0.00007003743,0.000019077395,0.00008233763,0.00008007638,0.00010707129],"domain_scores_gemma":[0.9993856,0.00014286416,0.000062296174,0.000097343356,0.0002531489,0.000058714206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005366026,0.00064442435,0.0007159993,0.0004926353,0.0007296845,0.00089060393,0.0014024442,0.0006560651,0.0005747725],"category_scores_gemma":[0.0015372678,0.00021996975,0.00029357907,0.0007285616,0.00038825924,0.0016713295,0.0006125426,0.0004931075,0.00020940734],"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.0006737935,0.00030582788,0.008787371,0.0003573878,0.00016506974,0.0009985493,0.0007524381,0.45997095,0.064607866,0.030738927,0.019042095,0.41359976],"study_design_scores_gemma":[0.000008204285,0.00006254066,0.00036662683,0.000011454913,0.0000255538,0.00011649976,0.00008516551,0.9903515,0.0031132177,0.0028527654,0.0029891322,0.000017312972],"about_ca_topic_score_codex":0.021136362,"about_ca_topic_score_gemma":0.028031949,"teacher_disagreement_score":0.021136362,"about_ca_system_score_codex":0.0011392328,"about_ca_system_score_gemma":0.0013205205,"threshold_uncertainty_score":0.0420267},"labels":[],"label_agreement":null},{"id":"W3027857024","doi":"10.1109/tvt.2020.2996238","title":"Delay-Oriented Caching Strategies in D2D Mobile Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"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":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Utility maximization problem; Submodular set function; Backhaul (telecommunications); Mathematical optimization; Distributed computing; Base station; Utility maximization","score_opus":0.00976787472000711,"score_gpt":0.21815278670569854,"score_spread":0.20838491198569142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027857024","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.06890194,0.004010462,0.92064226,0.00051435136,0.00008641162,0.000073016134,0.00017915442,0.0003139449,0.005278475],"genre_scores_gemma":[0.95291346,0.0013604568,0.04358029,0.00009228292,0.000034556757,0.000062909465,0.00009341988,0.000023913333,0.0018386216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995427,0.00013207344,0.000026096664,0.000094535564,0.000095656476,0.000108941415],"domain_scores_gemma":[0.99929035,0.0003679359,0.00009768885,0.00006103763,0.00013501389,0.00004799203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056759425,0.0007775564,0.0007971028,0.0005424127,0.0006764985,0.0010933715,0.0013960905,0.00083819183,0.0007465008],"category_scores_gemma":[0.0016100943,0.00039453144,0.0004222854,0.0012021621,0.0005188895,0.0012906307,0.00068348704,0.00047811426,0.00014763308],"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.00011733073,0.00004591351,0.0010261303,0.0001492889,0.00004257262,0.00024308662,0.00008238316,0.9272894,0.0047048745,0.027654719,0.0020982486,0.036546048],"study_design_scores_gemma":[0.000008323143,0.000025491709,0.00011058075,0.000006368461,0.000013537124,0.000051516472,0.000023955967,0.99280167,0.0008480385,0.0053192885,0.0007822509,0.0000090697695],"about_ca_topic_score_codex":0.011697056,"about_ca_topic_score_gemma":0.010054399,"teacher_disagreement_score":0.011697056,"about_ca_system_score_codex":0.001981471,"about_ca_system_score_gemma":0.0011629288,"threshold_uncertainty_score":0.023257911},"labels":[],"label_agreement":null},{"id":"W3033206125","doi":"10.1007/s11036-020-01583-7","title":"Security Aware Caching Placement Optimization Strategy in Cooperative Networks","year":2020,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Distributed computing; Computer security","score_opus":0.011554341521506094,"score_gpt":0.22914541888519013,"score_spread":0.21759107736368405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033206125","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.21262541,0.0010858112,0.7784542,0.0004569793,0.000120047735,0.00011622106,0.00011201274,0.00047882958,0.0065505635],"genre_scores_gemma":[0.95599896,0.00019550996,0.041736085,0.000050002523,0.000029059656,0.000028006001,0.000054269363,0.000027935952,0.0018801749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994584,0.00013261344,0.000020382946,0.000106470834,0.00011787034,0.00016434463],"domain_scores_gemma":[0.99893266,0.00042235025,0.00011307325,0.00013428382,0.00029443984,0.00010307963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069729576,0.00080988207,0.0009900677,0.0007465418,0.0008683102,0.0009838345,0.0013146613,0.0009076807,0.0012300689],"category_scores_gemma":[0.0021624628,0.00037074197,0.00033996848,0.0012132423,0.00043828052,0.0011931033,0.0007804545,0.00041985238,0.00024820288],"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.00032670522,0.0001830096,0.0025336137,0.000107632586,0.00006633645,0.0003114197,0.00017688132,0.8856995,0.01856385,0.015038119,0.004263946,0.072728984],"study_design_scores_gemma":[0.000007629701,0.00004223525,0.00019614701,0.0000034499276,0.000016475991,0.000063386426,0.000040827344,0.9958419,0.0012414092,0.002223345,0.0003182062,0.000004935812],"about_ca_topic_score_codex":0.005821226,"about_ca_topic_score_gemma":0.010036376,"teacher_disagreement_score":0.005821226,"about_ca_system_score_codex":0.0012921423,"about_ca_system_score_gemma":0.0015169393,"threshold_uncertainty_score":0.011574686},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W3034750446","doi":"10.48550/arxiv.2006.07505","title":"PLVER: Joint Stable Allocation and Content Replication for Edge-assisted Live Video Delivery","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Server; Computer science; Cache; Enhanced Data Rates for GSM Evolution; Computer network; Cloud computing; Quality of experience; Replication (statistics); Quality of service; Content delivery; Popularity; Operating system; Artificial intelligence","score_opus":0.1880662327341948,"score_gpt":0.1986603807202383,"score_spread":0.010594147986043523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034750446","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.06960328,0.00060237304,0.921188,0.00018076121,0.00010976997,0.00020034963,0.0000941247,0.0054556145,0.0025657816],"genre_scores_gemma":[0.8247915,0.000193349,0.17186277,0.00016018789,0.00007069179,0.00012021971,0.00018770703,0.00020168567,0.002411855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989241,0.0003266726,0.000059556838,0.0002137296,0.00030037577,0.00017568715],"domain_scores_gemma":[0.9982438,0.0005281789,0.000153094,0.00055270776,0.00034985898,0.00017224332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562966,0.000650133,0.0008541747,0.00061738334,0.00075182883,0.0009026461,0.002111827,0.00073691015,0.001483192],"category_scores_gemma":[0.003318669,0.00031343204,0.00038079187,0.0006208293,0.00052135694,0.0015925058,0.0018381148,0.00083747454,0.0005502578],"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.0016920432,0.00077609805,0.0037315374,0.00025137147,0.00018858866,0.00086053234,0.00053088716,0.29892564,0.09782712,0.020651087,0.014027557,0.5605376],"study_design_scores_gemma":[0.000064137,0.00018216525,0.00039099096,0.0000063965263,0.000019567788,0.00023366648,0.000057412864,0.98139876,0.010955307,0.0040364363,0.0026284398,0.000026709036],"about_ca_topic_score_codex":0.0029571997,"about_ca_topic_score_gemma":0.0027927575,"teacher_disagreement_score":0.0029571997,"about_ca_system_score_codex":0.0006068754,"about_ca_system_score_gemma":0.000918292,"threshold_uncertainty_score":0.0066440105},"labels":[],"label_agreement":null},{"id":"W3037117000","doi":"10.1109/twc.2020.3003339","title":"Delay-Minimized Edge Caching in Heterogeneous Vehicular Networks: A Matching-Based Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Backhaul (telecommunications); Linear network coding; Computer network; Base station; Cache; Integer programming; Wireless network; Enhanced Data Rates for GSM Evolution; Core network; Wireless; Cellular network; Telecommunications; Algorithm","score_opus":0.03631803382446653,"score_gpt":0.2447961317513048,"score_spread":0.20847809792683827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037117000","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.020387463,0.00030714372,0.9767849,0.00016189381,0.000037262645,0.00006094843,0.00005318096,0.00014835343,0.002058835],"genre_scores_gemma":[0.8718951,0.000531663,0.12286612,0.00016031189,0.00007711812,0.00012886188,0.00014816757,0.000089465066,0.004103248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992118,0.00023370808,0.000032790344,0.00015807479,0.00016400989,0.00019959918],"domain_scores_gemma":[0.9989716,0.0005034882,0.00014988288,0.00008465944,0.00017907163,0.00011123159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011097515,0.0010075211,0.0014491072,0.0008656148,0.00060501177,0.001306022,0.0023364872,0.0013092246,0.0016499244],"category_scores_gemma":[0.0025375746,0.00048184948,0.000813505,0.0019070939,0.0008058693,0.00159243,0.0013712451,0.0007423292,0.00029429983],"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.00006901944,0.00006534461,0.0004224705,0.00005019701,0.000027646018,0.0000666,0.000032062453,0.96289665,0.0018259073,0.013677813,0.00069332053,0.020172969],"study_design_scores_gemma":[0.0000039313677,0.000023398705,0.00003218436,0.0000021750452,0.0000066698135,0.000011832742,0.000010029482,0.9966569,0.00032916298,0.002726166,0.00019348224,0.000003965627],"about_ca_topic_score_codex":0.006390273,"about_ca_topic_score_gemma":0.0047946027,"teacher_disagreement_score":0.006390273,"about_ca_system_score_codex":0.0021754692,"about_ca_system_score_gemma":0.0017750772,"threshold_uncertainty_score":0.015784204},"labels":[],"label_agreement":null},{"id":"W3037713526","doi":"10.1109/tvt.2020.3004720","title":"Cooperative Edge Caching With Location-Based and Popular Contents for Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":111,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Server; Computer network; Transmission (telecommunications); Knapsack problem; Upload; Cache; Enhanced Data Rates for GSM Evolution; Optimization problem; Upper and lower bounds; Service (business); Mathematical optimization; Distributed computing; Algorithm; Mathematics","score_opus":0.016501304802865803,"score_gpt":0.21820468622708686,"score_spread":0.20170338142422106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037713526","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.12682955,0.00095473015,0.86864007,0.00015961747,0.000052899646,0.000064566615,0.000055891654,0.00029044546,0.0029522337],"genre_scores_gemma":[0.94980526,0.00030215931,0.04795459,0.000037696416,0.000022891349,0.00003772907,0.00007307969,0.00001906334,0.0017474997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993505,0.00017835796,0.00003121249,0.00012753758,0.00015551332,0.00015691205],"domain_scores_gemma":[0.99893147,0.00042417244,0.00013287537,0.00019684526,0.00023727522,0.00007732891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195576,0.00081917533,0.0009032242,0.00062927714,0.00083865883,0.00094236905,0.0018811506,0.00085613434,0.0005283837],"category_scores_gemma":[0.001893469,0.00031986495,0.00052771805,0.0013356253,0.0005124232,0.0015609441,0.0010334379,0.00047558112,0.00016257277],"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.00023959656,0.00012168279,0.0030996697,0.00015598236,0.00009517821,0.0006237569,0.00023724505,0.87652534,0.019710958,0.029043112,0.0017951088,0.068352364],"study_design_scores_gemma":[0.0000042741335,0.000038295417,0.00018605223,0.000003116338,0.000019092015,0.00008307671,0.000043351378,0.9947573,0.0016421346,0.0026087763,0.0006063956,0.000008090862],"about_ca_topic_score_codex":0.008697107,"about_ca_topic_score_gemma":0.013572717,"teacher_disagreement_score":0.008697107,"about_ca_system_score_codex":0.0011843645,"about_ca_system_score_gemma":0.0010036946,"threshold_uncertainty_score":0.017292917},"labels":[],"label_agreement":null},{"id":"W3039245001","doi":"10.1109/tcomm.2020.3005712","title":"Improved Constructions of Coded Caching Schemes for Combination Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Scheme (mathematics); Computer science; Cache; Transmission (telecommunications); Algorithm; Focus (optics); Theoretical computer science; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Telecommunications","score_opus":0.04293471852267657,"score_gpt":0.26394967175355966,"score_spread":0.22101495323088308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039245001","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.0791472,0.0002674195,0.90979534,0.00014771194,0.000058590955,0.00022283681,0.0002208382,0.0007448544,0.009395224],"genre_scores_gemma":[0.4181734,0.00021326996,0.5762336,0.00009385396,0.000032564054,0.00029339644,0.0002888961,0.00007801556,0.0045929644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899036,0.00027851723,0.00007955868,0.0001888651,0.00030370255,0.00015904795],"domain_scores_gemma":[0.99797076,0.0007034942,0.00024564067,0.00055667904,0.0003794167,0.00014398212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007406852,0.00064165756,0.0006607339,0.00095299305,0.0008674424,0.0015620474,0.0013422021,0.00079990976,0.002442708],"category_scores_gemma":[0.0032319177,0.00040440436,0.0005498902,0.0016300116,0.0008797181,0.0019604436,0.0019326885,0.0011704062,0.00057840423],"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.0006228999,0.00019019327,0.0016186051,0.00028417577,0.00007338816,0.00039836328,0.00066027837,0.17514384,0.05001144,0.5144756,0.0058131577,0.25070813],"study_design_scores_gemma":[0.000111793015,0.00027862017,0.0004600202,0.00005093652,0.000058183534,0.00046104527,0.0001588437,0.85066557,0.033664554,0.095686935,0.018316306,0.000087224296],"about_ca_topic_score_codex":0.0013822068,"about_ca_topic_score_gemma":0.001615342,"teacher_disagreement_score":0.002442708,"about_ca_system_score_codex":0.0018401518,"about_ca_system_score_gemma":0.0012855572,"threshold_uncertainty_score":0.013351381},"labels":[],"label_agreement":null},{"id":"W3043432218","doi":"10.1016/j.phycom.2020.101172","title":"Delivery phase in cache-based wireless networks with modified LT codes","year":2020,"lang":"en","type":"article","venue":"Physical Communication","topic":"Caching and Content Delivery","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; Encoding (memory); Cache; Coding (social sciences); Decoding methods; Wireless; Latency (audio); Computer network; Erasure code; Channel (broadcasting); Theoretical computer science; Algorithm; Telecommunications; Artificial intelligence","score_opus":0.035165049886444345,"score_gpt":0.25815750422731354,"score_spread":0.2229924543408692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043432218","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.2993635,0.0015400447,0.69317883,0.00046822036,0.00010889788,0.00013194866,0.00025416963,0.00079316064,0.004161258],"genre_scores_gemma":[0.9627263,0.00038260923,0.035338797,0.00009050481,0.000021524058,0.00006931664,0.000103119986,0.000027225,0.0012404996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993494,0.00022269094,0.000036817404,0.000060896284,0.00017046712,0.00015965702],"domain_scores_gemma":[0.99704945,0.0016181654,0.0004445478,0.000341714,0.00046672657,0.000079383215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089103467,0.00043385994,0.00055253395,0.00086990604,0.00063716335,0.00086323684,0.0009115556,0.00064150686,0.00066785974],"category_scores_gemma":[0.0048241923,0.00021393201,0.00029203945,0.0013451434,0.0010605307,0.0015405216,0.00076940295,0.0005419925,0.0001867993],"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.0008664079,0.00013312214,0.0024614285,0.000267714,0.00006148538,0.00081762427,0.00048542712,0.74638027,0.036887474,0.12327567,0.0020730342,0.08629038],"study_design_scores_gemma":[0.000021488273,0.00013261368,0.00015513059,0.000019783978,0.000014573955,0.00016940922,0.000045048208,0.98200583,0.007252383,0.009309865,0.0008555801,0.00001825179],"about_ca_topic_score_codex":0.004782321,"about_ca_topic_score_gemma":0.004009541,"teacher_disagreement_score":0.004782321,"about_ca_system_score_codex":0.0014373618,"about_ca_system_score_gemma":0.0014012074,"threshold_uncertainty_score":0.010428846},"labels":[],"label_agreement":null},{"id":"W3044418975","doi":"10.1051/epjconf/202024507026","title":"Web Proxy Auto Discovery for Dynamically Created Web Proxies","year":2020,"lang":"en","type":"article","venue":"EPJ Web of Conferences","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Fermilab; Office of Science; University of Victoria; U.S. Department of Energy","keywords":"Computer science; Cache; Proxy (statistics); Operating system; World Wide Web; Database","score_opus":0.025807667715748342,"score_gpt":0.24199687163533606,"score_spread":0.21618920391958774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044418975","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.04357706,0.0014599292,0.732544,0.000784273,0.00081223255,0.00088546943,0.0013059847,0.18545209,0.033179063],"genre_scores_gemma":[0.49284098,0.0010118086,0.41850302,0.00088302285,0.0004183171,0.0005426792,0.0053309496,0.010862884,0.0696064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994743,0.00087014545,0.0005922685,0.0007356297,0.0023007367,0.0007582204],"domain_scores_gemma":[0.98798466,0.0014155281,0.0005584487,0.0075380406,0.0017339006,0.00076933927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00411479,0.0008203584,0.0014925146,0.0024754521,0.0015909448,0.0064627705,0.0034549139,0.0017602753,0.0060593626],"category_scores_gemma":[0.008547494,0.0012720574,0.0009812822,0.0018654792,0.0014143654,0.0063467235,0.0062224246,0.0024328125,0.004532922],"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.00345609,0.0010155117,0.01784416,0.0008618942,0.00030850273,0.0022168516,0.0019154575,0.024420185,0.06648065,0.14562115,0.12028287,0.61557674],"study_design_scores_gemma":[0.0003909915,0.0003017927,0.003904345,0.00020154753,0.00015119172,0.001340583,0.00039548046,0.37576434,0.12950021,0.02657509,0.4610433,0.00043112616],"about_ca_topic_score_codex":0.0042782165,"about_ca_topic_score_gemma":0.005550157,"teacher_disagreement_score":0.0064627705,"about_ca_system_score_codex":0.002506778,"about_ca_system_score_gemma":0.0029037404,"threshold_uncertainty_score":0.021761358},"labels":[],"label_agreement":null},{"id":"W3045880028","doi":"10.1109/icc40277.2020.9148813","title":"Achieving Efficient and Privacy-Preserving Range Query in Fog-enhanced IoT with Bloom Filter","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"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 New Brunswick","funders":"","keywords":"Bloom filter; Computer science; Range query (database); Paillier cryptosystem; Homomorphic encryption; Cloud computing; Ciphertext; Enhanced Data Rates for GSM Evolution; Computer network; Scheme (mathematics); Security analysis; Information privacy; Filter (signal processing); Encryption; Cryptosystem; Computer security; Search engine; Web search query; Hybrid cryptosystem; Telecommunications; Information retrieval; Sargable","score_opus":0.01767162840941817,"score_gpt":0.20218593856570483,"score_spread":0.18451431015628666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045880028","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.08283887,0.0008339664,0.9095679,0.00056033634,0.00008269933,0.00025953935,0.00031531276,0.0008825649,0.004658861],"genre_scores_gemma":[0.86967236,0.0005703343,0.12593378,0.00031991742,0.00006732417,0.00014773855,0.0003690862,0.000030092924,0.0028894485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981536,0.00027920742,0.00015416727,0.00028822158,0.00082626217,0.00029845344],"domain_scores_gemma":[0.9986675,0.00036508136,0.00017081559,0.00049183465,0.00023711391,0.00006759048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010582801,0.00039959728,0.0010138564,0.000719244,0.0012050678,0.0012718587,0.0013314728,0.0010317754,0.0009735267],"category_scores_gemma":[0.0023011512,0.00024326696,0.0006779284,0.0016240854,0.0007719458,0.004645831,0.0023123887,0.00082785345,0.00025772786],"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.0026367293,0.00054278993,0.008805701,0.0006269178,0.00035198257,0.0018276931,0.001763108,0.12015997,0.21941818,0.21754088,0.013863283,0.41246274],"study_design_scores_gemma":[0.00021215845,0.00040284178,0.0019143954,0.000051050134,0.00012858602,0.0018548543,0.0004846733,0.82677215,0.08395013,0.07038038,0.0136840865,0.00016462078],"about_ca_topic_score_codex":0.0030859841,"about_ca_topic_score_gemma":0.0027042893,"teacher_disagreement_score":0.0030859841,"about_ca_system_score_codex":0.00151849,"about_ca_system_score_gemma":0.0014872454,"threshold_uncertainty_score":0.011017442},"labels":[],"label_agreement":null},{"id":"W3045943094","doi":"","title":"Optimized Dynamic Cache Instantiation","year":2020,"lang":"en","type":"article","venue":"2020 IFIP Networking Conference (Networking)","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"","keywords":"Computer science; Cache; Scalability; Cloud computing; Cache algorithms; Smart Cache; Cache invalidation; Server; Distributed computing; Context (archaeology); Computer network; CPU cache; Operating system","score_opus":0.03364387990585066,"score_gpt":0.23110715598727652,"score_spread":0.19746327608142586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045943094","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.38551494,0.0018508307,0.5913505,0.00080666033,0.000093180046,0.00025149784,0.0005546287,0.0018425473,0.0177351],"genre_scores_gemma":[0.97334665,0.0002261327,0.02523854,0.000068666,0.000011513343,0.000050869305,0.00010510593,0.00006827883,0.00088418176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834955,0.00048271634,0.000067512534,0.00022027339,0.00035254547,0.0005274593],"domain_scores_gemma":[0.994586,0.0030599472,0.00069134886,0.00090322044,0.00057855545,0.00018086973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001568766,0.0009532315,0.0010308822,0.0005766126,0.00057206466,0.001605647,0.0018019679,0.0009670266,0.0014199655],"category_scores_gemma":[0.009530689,0.00046969435,0.00037098577,0.0010927358,0.0007091441,0.0022731838,0.000900496,0.00084910565,0.00032891618],"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.00015627587,0.00010408996,0.0015550747,0.00006970378,0.000025839861,0.0000653891,0.000054832777,0.95744514,0.005856086,0.013350855,0.0015433071,0.019773385],"study_design_scores_gemma":[0.000010243871,0.000042036972,0.00026448633,0.0000069908983,0.000015846103,0.000043335025,0.000030285546,0.9940294,0.0019726285,0.0029560716,0.00062060327,0.000008049628],"about_ca_topic_score_codex":0.00560633,"about_ca_topic_score_gemma":0.007087514,"teacher_disagreement_score":0.00560633,"about_ca_system_score_codex":0.0030638392,"about_ca_system_score_gemma":0.0026212004,"threshold_uncertainty_score":0.02222985},"labels":[],"label_agreement":null},{"id":"W3049325994","doi":"","title":"Optimal Uncoded Placement and File Grouping Structure for Improved Coded Caching under Nonuniform Popularity","year":2020,"lang":"en","type":"article","venue":"Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cache; Scheme (mathematics); Smart Cache; Cache algorithms; Parallel computing; Cache-oblivious algorithm; CPU cache; Set (abstract data type); Distributed computing; Algorithm; Mathematics","score_opus":0.0132615346609724,"score_gpt":0.2182595163203892,"score_spread":0.2049979816594168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049325994","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.11124659,0.0001816361,0.8863829,0.00014349482,0.00001599815,0.000049799673,0.000065030974,0.00012818805,0.0017865031],"genre_scores_gemma":[0.90574795,0.00014899144,0.09311735,0.000027128775,0.000013085956,0.00005036555,0.000051337967,0.000026492178,0.00081739086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948716,0.00018575843,0.00002023552,0.00007674009,0.00013581333,0.00009422653],"domain_scores_gemma":[0.99833554,0.00085883884,0.00026263506,0.00018043931,0.00030562346,0.000056957146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071733934,0.0004860163,0.0006282503,0.00042758495,0.00037930338,0.00061627576,0.0009042473,0.0006296628,0.000698657],"category_scores_gemma":[0.004599185,0.00027811422,0.00026032166,0.0008976635,0.00062409986,0.0013197277,0.0004962244,0.0003959951,0.000104828985],"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.000075087824,0.000027142307,0.000773156,0.000048941583,0.00001169569,0.00010886264,0.00005649438,0.95396996,0.007037551,0.019758034,0.0005665173,0.01756655],"study_design_scores_gemma":[0.0000050753574,0.000019123207,0.00010373857,0.0000027949802,0.000003790259,0.000025688927,0.000014836293,0.9966382,0.0010042178,0.002024177,0.00015364807,0.0000048398924],"about_ca_topic_score_codex":0.005275425,"about_ca_topic_score_gemma":0.005312883,"teacher_disagreement_score":0.005275425,"about_ca_system_score_codex":0.0017084097,"about_ca_system_score_gemma":0.001280926,"threshold_uncertainty_score":0.012395382},"labels":[],"label_agreement":null},{"id":"W3082442121","doi":"10.48550/arxiv.2005.06126","title":"Coded Caching Schemes with Linear Subpacketizations","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Lakehead University","funders":"","keywords":"Computer science; Transmission (telecommunications); Scheme (mathematics); Hamming distance; Code (set theory); Hamming code; Transmission rate; Computer network; Algorithm; Decoding methods; Block code; Mathematics; Telecommunications","score_opus":0.09031361242499604,"score_gpt":0.18154638539521176,"score_spread":0.09123277297021572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082442121","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.098670885,0.0005390116,0.893389,0.000212151,0.000094510164,0.00015091048,0.00015849558,0.00072738086,0.0060576675],"genre_scores_gemma":[0.766308,0.00043162738,0.22717689,0.00020465729,0.000056759072,0.00025347449,0.00019037265,0.000086259766,0.0052920394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901986,0.00025259788,0.00009314747,0.00014700949,0.00030485803,0.00018247236],"domain_scores_gemma":[0.99609107,0.0011979195,0.00034895106,0.00117138,0.0010319093,0.00015873027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069133425,0.0005194672,0.0004896543,0.00062910974,0.00057801214,0.0014022426,0.0010528939,0.0007092137,0.0018369771],"category_scores_gemma":[0.004911585,0.00026727226,0.0002684959,0.0012106287,0.0008922219,0.0021986105,0.0012431117,0.00089929596,0.0005080614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0011832294,0.00026723216,0.0018892821,0.00042132067,0.00007023257,0.00033496882,0.0005871602,0.21347907,0.11676473,0.39508468,0.004722757,0.2651953],"study_design_scores_gemma":[0.000097162716,0.00043349984,0.0005735573,0.000054523098,0.000047844664,0.0004019444,0.00013778036,0.83675843,0.08062803,0.06926022,0.011499976,0.00010695811],"about_ca_topic_score_codex":0.0018595267,"about_ca_topic_score_gemma":0.0013859847,"teacher_disagreement_score":0.0018595267,"about_ca_system_score_codex":0.0014784792,"about_ca_system_score_gemma":0.001030729,"threshold_uncertainty_score":0.010727167},"labels":[],"label_agreement":null},{"id":"W3084109717","doi":"10.1109/tcomm.2020.3022692","title":"Virtual Service Placement for Edge Computing Under Finite Memory and Bandwidth","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"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 Manitoba","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Server; Bandwidth (computing); Edge computing; Enhanced Data Rates for GSM Evolution; Knapsack problem; Distributed computing; Computer network; Wireless; Service (business); Algorithm; Telecommunications","score_opus":0.06974632060964614,"score_gpt":0.2741229558407045,"score_spread":0.20437663523105837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084109717","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.101867,0.000517194,0.89395386,0.0002033662,0.00007240451,0.000072434486,0.000064807864,0.0005414905,0.00270757],"genre_scores_gemma":[0.8752276,0.0001715553,0.1229492,0.00007591992,0.000025249565,0.00005047922,0.00006787567,0.00006754866,0.0013645622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992791,0.00021991694,0.00003241842,0.00013389834,0.0001267816,0.00020798892],"domain_scores_gemma":[0.9991967,0.00038415607,0.00009671586,0.00009811776,0.00010307808,0.000121251505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007885468,0.000918544,0.0010979176,0.0005459865,0.0008427146,0.001254374,0.0016413846,0.0008737194,0.0015096513],"category_scores_gemma":[0.0026696178,0.00042892873,0.00040814385,0.00087717234,0.000918516,0.0013175663,0.0013727668,0.0007763433,0.00028141038],"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.0002704943,0.00007587702,0.0007025737,0.000047410813,0.000023052324,0.00009045523,0.000063705564,0.94870263,0.0036053956,0.012356138,0.0012653824,0.032796867],"study_design_scores_gemma":[0.000007546257,0.000030182437,0.0000575649,0.0000026920047,0.0000035133974,0.000023095972,0.000017814687,0.99403316,0.00089632615,0.0047056777,0.00021795904,0.0000044246426],"about_ca_topic_score_codex":0.004745303,"about_ca_topic_score_gemma":0.004536463,"teacher_disagreement_score":0.004745303,"about_ca_system_score_codex":0.0014606438,"about_ca_system_score_gemma":0.0015538231,"threshold_uncertainty_score":0.010597765},"labels":[],"label_agreement":null},{"id":"W3085394716","doi":"10.1109/tmm.2020.3023282","title":"<i>NDN-MMRA</i>: Multi-Stage Multicast Rate Adaptation in Named Data Networking WLAN","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","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 Waterloo","funders":"National Key Research and Development Program of China Stem Cell and Translational Research; Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multicast; Computer science; Source-specific multicast; Xcast; Computer network; Pragmatic General Multicast; IP multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Reliable multicast; Reliability (semiconductor)","score_opus":0.184290102837671,"score_gpt":0.30088695674190535,"score_spread":0.11659685390423435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085394716","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.008501694,0.0022681963,0.9810115,0.0005961093,0.00038352874,0.00008375085,0.00005005243,0.0010988896,0.0060062343],"genre_scores_gemma":[0.59963435,0.0042449366,0.37798855,0.0010163801,0.0008273974,0.00027001367,0.0004831967,0.00021499138,0.015320201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939847,0.00018844774,0.000054185806,0.00011136872,0.0001785992,0.000068857706],"domain_scores_gemma":[0.9995689,0.00007663593,0.00005520174,0.00008517788,0.00018157526,0.000032473967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082123716,0.00047177455,0.00054949673,0.00040196913,0.0007110714,0.0009759189,0.0016393953,0.00094833574,0.0013350436],"category_scores_gemma":[0.0010094706,0.00023166787,0.00054506905,0.00062821043,0.00054919906,0.0011353678,0.0010138907,0.00088660745,0.00070624944],"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.0006332561,0.0002477817,0.0027245488,0.0006401131,0.00017107563,0.0013588242,0.00056804734,0.09939085,0.13331427,0.14054991,0.046786714,0.57361454],"study_design_scores_gemma":[0.000033714627,0.0002927607,0.0010861022,0.00004860067,0.00008084072,0.0010950555,0.00007349177,0.88807684,0.044829458,0.008681835,0.055598,0.000103370425],"about_ca_topic_score_codex":0.0016551749,"about_ca_topic_score_gemma":0.0017230068,"teacher_disagreement_score":0.0016551749,"about_ca_system_score_codex":0.00078029645,"about_ca_system_score_gemma":0.00047624524,"threshold_uncertainty_score":0.0056614876},"labels":[],"label_agreement":null},{"id":"W3087994323","doi":"10.1145/3405656.3418720","title":"ENDN","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"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 Ottawa","funders":"","keywords":"Computer science; Forwarding plane; Network packet; Computer network; Architecture; Metadata; Packet forwarding; The Internet; Content delivery; Packet processing; Distributed computing; Operating system","score_opus":0.03011621763323257,"score_gpt":0.18776440863299623,"score_spread":0.15764819099976365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087994323","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064441515,0.0015182272,0.164512,0.0021569738,0.0026710443,0.00063970825,0.012470744,0.061829526,0.74775755],"genre_scores_gemma":[0.060883213,0.0023418681,0.09472881,0.0042008273,0.0007996652,0.0008154625,0.06872212,0.011797298,0.7557107],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986702,0.00013850068,0.00009429365,0.00026916098,0.00062130357,0.000206467],"domain_scores_gemma":[0.9986461,0.00010702714,0.00005528021,0.00041412446,0.0006346717,0.00014291497],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011557759,0.0012333473,0.00059359585,0.0012317173,0.0011938432,0.003704058,0.0024183965,0.0018462727,0.20958522],"category_scores_gemma":[0.0019376886,0.00049062556,0.0006281758,0.0009287772,0.0003707174,0.0032296358,0.003801685,0.0015322355,0.21244605],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0005482473,0.00020276042,0.001448066,0.0005544454,0.00004762149,0.0005201593,0.00024774254,0.0023874594,0.012510747,0.06492911,0.48987937,0.4267244],"study_design_scores_gemma":[0.000026001637,0.000042799355,0.0003392568,0.000055174914,0.000012528063,0.00021332639,0.00004453273,0.003776225,0.0043893023,0.0066127493,0.9844675,0.000020700956],"about_ca_topic_score_codex":0.0019716844,"about_ca_topic_score_gemma":0.002053723,"teacher_disagreement_score":0.7904148,"about_ca_system_score_codex":0.00093473546,"about_ca_system_score_gemma":0.0013709912,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3090528777","doi":"10.4236/jsea.2020.139013","title":"Evaluation of an Evolutionary Algorithm to Dynamically Alter Partition Sizes in Web Caching Systems","year":2020,"lang":"en","type":"article","venue":"Journal of Software Engineering and Applications","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"Partition (number theory); Computer science; Web server; The Internet; Distributed computing; Evolutionary algorithm; Data mining; Operating system; Machine learning; Mathematics","score_opus":0.014890238194751876,"score_gpt":0.23702295805245832,"score_spread":0.22213271985770644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090528777","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.90604377,0.00032061007,0.0899946,0.00024406782,0.000051238105,0.00017522821,0.000045765188,0.00023105346,0.0028936933],"genre_scores_gemma":[0.9624009,0.00007579696,0.036871508,0.00003445298,0.0000059544486,0.00007075977,0.00003812099,0.000023264147,0.0004790922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.00046636458,0.00005603448,0.00009435231,0.0001804735,0.00010846388],"domain_scores_gemma":[0.99419564,0.0042335573,0.00031921596,0.00026631486,0.0008031815,0.00018220478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026741948,0.00089622685,0.0009837553,0.0008071762,0.0006327737,0.0009425971,0.0013301458,0.0015462325,0.00067404367],"category_scores_gemma":[0.010426016,0.00047480513,0.00042463597,0.00063877914,0.00071437034,0.0010775211,0.0007007181,0.0007392851,0.00009710022],"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.00009911122,0.00017197515,0.0015166849,0.00002496578,0.000029129722,0.000027112868,0.000045338224,0.98639005,0.0016126632,0.0007599631,0.00006773768,0.0092553245],"study_design_scores_gemma":[0.00001531403,0.00009129495,0.000139248,0.0000018054536,0.00000712375,0.0000044952117,0.000011951081,0.999213,0.00037515283,0.00010058729,0.00003751503,0.0000025109068],"about_ca_topic_score_codex":0.010609004,"about_ca_topic_score_gemma":0.004687285,"teacher_disagreement_score":0.010609004,"about_ca_system_score_codex":0.0016957241,"about_ca_system_score_gemma":0.001382328,"threshold_uncertainty_score":0.021094501},"labels":[],"label_agreement":null},{"id":"W3098011197","doi":"10.48550/arxiv.2011.08122","title":"Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Computer science; Cache; Popularity; Padding; Scheme (mathematics); CPU cache; Upper and lower bounds; Computer network; Cache algorithms; Parallel computing; Computer security; Mathematics","score_opus":0.10193239867379067,"score_gpt":0.1858123191945302,"score_spread":0.08387992052073953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098011197","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.44691253,0.0036330281,0.5375714,0.0009394621,0.000082585706,0.000109469765,0.00038012545,0.00053744076,0.009833956],"genre_scores_gemma":[0.98060936,0.0007593511,0.017444486,0.000078803176,0.00003393183,0.000055677465,0.0000689575,0.000045148023,0.0009044765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833554,0.00046994493,0.00008740682,0.00023723773,0.00037642228,0.00049348816],"domain_scores_gemma":[0.9874089,0.0076824226,0.0014953613,0.0016697933,0.0014739606,0.00026960665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772337,0.0011771276,0.0012160948,0.0010356782,0.0008470498,0.0020574469,0.002040509,0.0011930173,0.0012876336],"category_scores_gemma":[0.021124305,0.00048566246,0.0003847213,0.0018448329,0.0014913633,0.004117558,0.0014077815,0.001109111,0.00026772905],"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.0007952659,0.00013569884,0.0034156078,0.0003397536,0.00007985109,0.000500285,0.00033068584,0.83081126,0.026537435,0.10636375,0.00181477,0.028875655],"study_design_scores_gemma":[0.000018202338,0.00013041635,0.0005847576,0.000030273832,0.000032878583,0.00024271056,0.00008750256,0.9762306,0.009455171,0.01273598,0.0004085904,0.000042909982],"about_ca_topic_score_codex":0.003759812,"about_ca_topic_score_gemma":0.0030676078,"teacher_disagreement_score":0.003759812,"about_ca_system_score_codex":0.0037457782,"about_ca_system_score_gemma":0.0017219473,"threshold_uncertainty_score":0.027177632},"labels":[],"label_agreement":null},{"id":"W3100318176","doi":"10.1109/twc.2020.3035377","title":"Caching by User Preference With Delayed Feedback for Heterogeneous Cellular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":18,"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":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Cache; Wireless network; Enhanced Data Rates for GSM Evolution; Frame (networking); Popularity; Computer network; Wireless; Service (business); Base station; Session (web analytics); Distributed computing; Artificial intelligence; World Wide Web","score_opus":0.040523504770571685,"score_gpt":0.23193894799560424,"score_spread":0.19141544322503257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100318176","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.19708762,0.001017748,0.7983359,0.000644393,0.000078061836,0.00012634814,0.00014657059,0.0005064716,0.002056843],"genre_scores_gemma":[0.98671794,0.0002346007,0.011799463,0.00007049279,0.000027675995,0.000045018507,0.000052420775,0.000015876398,0.0010365851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985196,0.000557524,0.00006440326,0.00026289726,0.00024582355,0.0003497458],"domain_scores_gemma":[0.9937676,0.0044197254,0.0006463242,0.0003207795,0.0005467744,0.0002987591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024420077,0.0010676245,0.0017425101,0.0006659809,0.00093202485,0.0013459553,0.0018540563,0.0012505006,0.0011470453],"category_scores_gemma":[0.008651406,0.00062259444,0.00066983036,0.0013097647,0.0012412535,0.0016219884,0.0010453182,0.0010537766,0.00016002572],"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.00025773456,0.00006716723,0.0019399883,0.000050664334,0.000046328616,0.00013001487,0.00006301418,0.9730165,0.0011970868,0.00943292,0.0006123095,0.01318634],"study_design_scores_gemma":[0.000007779539,0.000021038517,0.00011523765,0.0000013956461,0.000009005346,0.00001461128,0.000008471002,0.99743783,0.00015746221,0.0021557384,0.00006694341,0.000004431925],"about_ca_topic_score_codex":0.017733367,"about_ca_topic_score_gemma":0.017097576,"teacher_disagreement_score":0.017733367,"about_ca_system_score_codex":0.0030228042,"about_ca_system_score_gemma":0.001514252,"threshold_uncertainty_score":0.03526032},"labels":[],"label_agreement":null},{"id":"W3101073082","doi":"","title":"Resource allocation mechanism for media handling services in cloud multimedia conferencing","year":2019,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Multimedia; Resource allocation; Mechanism (biology); Videoconferencing; Computer network; Operating system","score_opus":0.014782005661118971,"score_gpt":0.226967923035762,"score_spread":0.212185917374643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101073082","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.08880455,0.00035610108,0.90346116,0.00039704566,0.000086212465,0.00032712,0.00006414555,0.0008171658,0.005686421],"genre_scores_gemma":[0.8585869,0.000115286944,0.13945174,0.000088052315,0.000039055394,0.00015082727,0.000044277258,0.000058589576,0.001465199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982956,0.0005727668,0.00011774748,0.0002805158,0.0003156331,0.00041777603],"domain_scores_gemma":[0.99863106,0.0005407871,0.0001983868,0.00017439833,0.00026004686,0.00019539698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019363132,0.0006370658,0.0008778408,0.0008954074,0.0016157174,0.0017969229,0.0025897203,0.0011242989,0.0022287841],"category_scores_gemma":[0.0030861087,0.0003799447,0.0005074539,0.0010975328,0.00062209886,0.0018936312,0.001362945,0.0009279781,0.00034789857],"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.0013757002,0.001095831,0.0034828975,0.00030152302,0.00012978599,0.00079634157,0.0007233371,0.544613,0.07577814,0.099981435,0.008459721,0.2632623],"study_design_scores_gemma":[0.000034139008,0.00006828644,0.0003397319,0.0000099788585,0.000026279886,0.00011290132,0.00010326937,0.9850389,0.0076017636,0.004774579,0.0018608106,0.000029392386],"about_ca_topic_score_codex":0.00419673,"about_ca_topic_score_gemma":0.0035520063,"teacher_disagreement_score":0.00419673,"about_ca_system_score_codex":0.0018611666,"about_ca_system_score_gemma":0.0017646243,"threshold_uncertainty_score":0.01350379},"labels":[],"label_agreement":null},{"id":"W3103793971","doi":"10.1109/iccc49849.2020.9238811","title":"A Deep Reinforcement Learning-Based Caching Strategy for Internet of Things","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Reinforcement learning; Cache; Internet of Things; Popularity; Energy consumption; Quality of service; Transient (computer programming); Computer network; The Internet; Service (business); Distributed computing; Artificial intelligence; Computer security; World Wide Web","score_opus":0.03380763017064454,"score_gpt":0.24207726986714015,"score_spread":0.20826963969649562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103793971","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.04898125,0.0011189061,0.94497573,0.00047417285,0.00013842252,0.000042378237,0.00005076463,0.00056706916,0.003651315],"genre_scores_gemma":[0.9476252,0.000301672,0.048188105,0.00024798565,0.000050021932,0.00007295452,0.000074824035,0.000036000733,0.0034031656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978703,0.000053356143,0.0000129973605,0.00004929867,0.0000517952,0.000045440494],"domain_scores_gemma":[0.99949265,0.00023952032,0.000054666638,0.00002920995,0.0001383419,0.000045629364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005495863,0.000480286,0.0009124237,0.0002783832,0.00029158962,0.00049546536,0.0012093559,0.00093047833,0.0011916363],"category_scores_gemma":[0.001586601,0.00024475125,0.00041276624,0.00035632192,0.0005056481,0.00076547026,0.00057835184,0.0007980566,0.00018248385],"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.00010205861,0.00010384282,0.0008957653,0.00007612621,0.00005909748,0.00011324268,0.000049197955,0.91262656,0.0027745997,0.0071691712,0.0025077441,0.07352261],"study_design_scores_gemma":[0.0000044840676,0.000014323832,0.000040044044,0.0000024664103,0.0000042976335,0.000008694267,0.0000018045812,0.9989531,0.0001407314,0.0007192804,0.0001084502,0.0000023149503],"about_ca_topic_score_codex":0.009806519,"about_ca_topic_score_gemma":0.007847424,"teacher_disagreement_score":0.009806519,"about_ca_system_score_codex":0.00082072004,"about_ca_system_score_gemma":0.0009562046,"threshold_uncertainty_score":0.019498885},"labels":[],"label_agreement":null},{"id":"W3106623147","doi":"10.1109/ccece47787.2020.9255719","title":"Honeybee Algorithm for Content Delivery Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Content delivery; Content (measure theory); Algorithm design; Algorithm; Computer network; Mathematics","score_opus":0.05742420360498541,"score_gpt":0.21702724242310656,"score_spread":0.15960303881812116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106623147","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.014661651,0.0018821489,0.9788969,0.00019865646,0.00011905704,0.00013559732,0.000035895395,0.00074454275,0.0033254584],"genre_scores_gemma":[0.37461707,0.0011856741,0.61696273,0.00015295956,0.00007001143,0.00060009817,0.00016814662,0.0000928841,0.006150396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974114,0.00008962525,0.000021308217,0.000036779817,0.000091012604,0.000020028063],"domain_scores_gemma":[0.99979955,0.00007765977,0.000023847537,0.000023348577,0.00006618032,0.000009445543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037403533,0.00042952178,0.0004208,0.00036913666,0.00030436768,0.00054301915,0.00073145184,0.00053731963,0.0011644125],"category_scores_gemma":[0.00077442214,0.00013591225,0.00026402858,0.00035497267,0.00025239287,0.0005066753,0.00029697322,0.00045331815,0.00031787282],"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.00022362874,0.00014338197,0.001308582,0.00031075755,0.00014917941,0.00015593738,0.00016155619,0.4436389,0.03200015,0.026734335,0.006740004,0.48843363],"study_design_scores_gemma":[0.00004571531,0.00008418394,0.00042749115,0.000016141134,0.000017766446,0.00008934548,0.000024658033,0.9824922,0.004755069,0.004990534,0.007041457,0.000015448892],"about_ca_topic_score_codex":0.0012693476,"about_ca_topic_score_gemma":0.0010943193,"teacher_disagreement_score":0.0012693476,"about_ca_system_score_codex":0.00037737124,"about_ca_system_score_gemma":0.00034887737,"threshold_uncertainty_score":0.0038953424},"labels":[],"label_agreement":null},{"id":"W3107107426","doi":"10.18280/isi.250513","title":"Recombinant Sort: N-Dimensional Cartesian Spaced Algorithm Designed from Synergetic Combination of Hashing, Bucket, Counting and Radix Sort","year":2020,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sorting algorithm; sort; Computer science; Algorithm; Merge sort; Sorting; Mathematics; Database","score_opus":0.012895880233498564,"score_gpt":0.19763126762868688,"score_spread":0.18473538739518833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107107426","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.01761993,0.00051590963,0.97218204,0.00018496547,0.00018361288,0.00020762518,0.00032364117,0.003981263,0.0048009283],"genre_scores_gemma":[0.10283661,0.00046178047,0.8874333,0.00014607485,0.000073651936,0.00021616275,0.00074531004,0.00019391863,0.007893242],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993831,0.00009431292,0.000056915324,0.00013193139,0.00025599895,0.000077656005],"domain_scores_gemma":[0.99951625,0.000064453285,0.00006283977,0.0001431241,0.00017043964,0.000043047887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060553354,0.0005029339,0.00088760274,0.001240011,0.00093964307,0.0013989112,0.0018796363,0.0005631013,0.005548954],"category_scores_gemma":[0.0010416842,0.00029968092,0.0005307882,0.0025186804,0.00070475583,0.0019450427,0.001288337,0.0005938499,0.0023747561],"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.0009786485,0.0001887928,0.0021969022,0.00050785544,0.00008709943,0.00015964979,0.0002446436,0.035743076,0.03506699,0.07039172,0.02128569,0.8331491],"study_design_scores_gemma":[0.00044390542,0.0009823088,0.0017071362,0.00008351751,0.00012675625,0.0018592495,0.00038283915,0.72174525,0.07800563,0.05945861,0.13503493,0.00016996058],"about_ca_topic_score_codex":0.003072643,"about_ca_topic_score_gemma":0.0032728268,"teacher_disagreement_score":0.005548954,"about_ca_system_score_codex":0.0008811934,"about_ca_system_score_gemma":0.002973029,"threshold_uncertainty_score":0.018563092},"labels":[],"label_agreement":null},{"id":"W3107196760","doi":"10.1109/ccece47787.2020.9255813","title":"Content Delivery Networks - Q-Learning Approach for Optimization of the Network Cost and the Cache Hit Ratio","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"British Columbia Institute of Technology","funders":"","keywords":"Cache; Computer science; Content delivery; Computer network; Content delivery network; Operating expense; Operating system; Server; Business","score_opus":0.03762655045735799,"score_gpt":0.19720185300489557,"score_spread":0.15957530254753757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107196760","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.010255762,0.0006336633,0.9839662,0.0005752122,0.00006216238,0.00009522529,0.000079304176,0.00016157389,0.00417097],"genre_scores_gemma":[0.70116574,0.0015197314,0.27854428,0.0007017379,0.000271104,0.0007431842,0.00031027527,0.00022661786,0.016517388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905664,0.0004669028,0.000027108665,0.00014981545,0.00017020263,0.00012924631],"domain_scores_gemma":[0.9953061,0.003741906,0.00022371585,0.00008918989,0.00052358204,0.000115470706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031175253,0.0012037078,0.0019421356,0.000934466,0.00054735795,0.0013497773,0.0024570662,0.002298195,0.0062029175],"category_scores_gemma":[0.007480507,0.0006256817,0.0007590494,0.0014240037,0.0011219061,0.001777745,0.0013336012,0.001910807,0.000503945],"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.000036443456,0.00004989317,0.00023124157,0.00006025915,0.000022878665,0.000036948863,0.000021641014,0.97019404,0.00023631704,0.016246201,0.00102766,0.011836492],"study_design_scores_gemma":[0.00000481808,0.000008168098,0.000028010616,0.000004847873,0.000004548356,0.000005287358,0.0000034076531,0.9956858,0.00004347734,0.004009773,0.00019971006,0.0000021847782],"about_ca_topic_score_codex":0.008756548,"about_ca_topic_score_gemma":0.0051867696,"teacher_disagreement_score":0.008756548,"about_ca_system_score_codex":0.0032473616,"about_ca_system_score_gemma":0.0022935376,"threshold_uncertainty_score":0.023561418},"labels":[],"label_agreement":null},{"id":"W3113024443","doi":"10.1109/jsac.2020.3036946","title":"Attention-Weighted Federated Deep Reinforcement Learning for Device-to-Device Assisted Heterogeneous Collaborative Edge Caching","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":150,"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 British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; Chongqing Research Program of Basic Research and Frontier Technology; Shenzhen University","keywords":"Computer science; Reinforcement learning; Markov decision process; Edge device; Cache; Enhanced Data Rates for GSM Evolution; Distributed computing; Base station; Computer network; Node (physics); Cloud computing; Integer programming; Mobile edge computing; Quality of service; Server; Markov process; Artificial intelligence","score_opus":0.05197815145586125,"score_gpt":0.302713714603654,"score_spread":0.2507355631477927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113024443","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.070166655,0.00046992576,0.92613965,0.0003244028,0.00007042768,0.000044007375,0.000060230686,0.00056099077,0.002163653],"genre_scores_gemma":[0.97394466,0.000095499,0.023857474,0.00015409444,0.000019891586,0.00005499738,0.000060229206,0.00002077753,0.0017923681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996094,0.00009868513,0.00001859695,0.000103131075,0.00006917338,0.00010110972],"domain_scores_gemma":[0.9989145,0.0006037984,0.00011428147,0.00007315325,0.00021902393,0.000075302116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010220264,0.00079072674,0.0011218506,0.0002675267,0.000314533,0.0006330681,0.0015981399,0.0011699159,0.00125327],"category_scores_gemma":[0.002704994,0.00034713955,0.00039787934,0.00037321044,0.00078421336,0.00091745594,0.0009412138,0.0013106775,0.00018666612],"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.00008628682,0.00009628322,0.00091004465,0.000032230517,0.0000290722,0.00008392047,0.00003557031,0.9671172,0.0011033332,0.0033651944,0.00080396293,0.026336947],"study_design_scores_gemma":[0.0000037509187,0.0000107737615,0.00003128201,0.0000011648474,0.000002635766,0.000003347182,0.0000014980134,0.9991684,0.00009239271,0.0006424344,0.00004104365,0.0000013007931],"about_ca_topic_score_codex":0.010679305,"about_ca_topic_score_gemma":0.009853029,"teacher_disagreement_score":0.010679305,"about_ca_system_score_codex":0.0010680071,"about_ca_system_score_gemma":0.0011199409,"threshold_uncertainty_score":0.021234274},"labels":[],"label_agreement":null},{"id":"W3114259864","doi":"10.1109/bdcat50828.2020.00019","title":"A Data Indexing Technique to Improve the Search Latency of AND Queries for Large Scale Textual Documents","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Telus (Canada); Carleton University","funders":"","keywords":"Search engine indexing; Computer science; Inverted index; Latency (audio); Workload; Graph; Search engine; Hash function; Data mining; Hash table; Information retrieval; Theoretical computer science; Operating system","score_opus":0.04571766267515183,"score_gpt":0.3017729559559621,"score_spread":0.2560552932808103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114259864","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.1917815,0.0042023323,0.75271213,0.0013535405,0.0003784482,0.0008953991,0.0030296033,0.03355678,0.012090291],"genre_scores_gemma":[0.55423933,0.0009426425,0.43574458,0.000305728,0.000119628254,0.00027356058,0.0032479926,0.000567312,0.004559252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923646,0.00007839955,0.000078811994,0.000120750534,0.00038792662,0.00009759521],"domain_scores_gemma":[0.9971276,0.00089868606,0.0002322613,0.0007135726,0.0009078987,0.00011996127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005432599,0.00084930315,0.0006878312,0.0023551323,0.001012195,0.0012124971,0.0017414493,0.00064293056,0.0028771767],"category_scores_gemma":[0.0036311788,0.00026818787,0.0005139994,0.005324265,0.0006248626,0.003368352,0.00092712924,0.0007362251,0.0010499891],"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.0012045118,0.0007417942,0.006062081,0.00101045,0.00015204008,0.00037514407,0.00057203724,0.029726326,0.22907344,0.021664064,0.03154328,0.6778748],"study_design_scores_gemma":[0.00035965114,0.0019390321,0.0061669233,0.0000738548,0.00026703614,0.0017983877,0.00063380663,0.65576667,0.26602885,0.021199126,0.045532893,0.00023376156],"about_ca_topic_score_codex":0.011464154,"about_ca_topic_score_gemma":0.012767905,"teacher_disagreement_score":0.011464154,"about_ca_system_score_codex":0.0013900925,"about_ca_system_score_gemma":0.003065825,"threshold_uncertainty_score":0.022794843},"labels":[],"label_agreement":null},{"id":"W3117176175","doi":"10.1109/mwc.001.2000329","title":"Security and Privacy for Mobile Edge Caching: Challenges and Solutions","year":2020,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Cache; Computer network; Computer security; Mobile edge computing; Enhanced Data Rates for GSM Evolution; Cloud computing; Edge device; Server; Telecommunications; Operating system","score_opus":0.10538060743852004,"score_gpt":0.28600912869086015,"score_spread":0.1806285212523401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117176175","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0415378,0.04846851,0.53562325,0.3275944,0.0022684361,0.0003166163,0.0003672351,0.0006729194,0.04315086],"genre_scores_gemma":[0.7888544,0.043731134,0.13533455,0.0146638965,0.0040609376,0.00035978717,0.0003467207,0.00014870477,0.012499731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99313366,0.0023918203,0.00041598815,0.0008701165,0.002284185,0.000904119],"domain_scores_gemma":[0.9724672,0.014248494,0.0021618407,0.005737679,0.004154827,0.0012299601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008435199,0.00078226085,0.001424266,0.00096712745,0.0036426312,0.008811754,0.0029893294,0.007537672,0.002667728],"category_scores_gemma":[0.016584776,0.0007623563,0.0011667701,0.0016406063,0.005024794,0.01692114,0.00561559,0.009516128,0.0007791845],"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.0001283492,0.00014178727,0.0024016872,0.0007076286,0.00009415705,0.00075080676,0.0010492419,0.015049245,0.003978417,0.79879814,0.029435799,0.14746472],"study_design_scores_gemma":[0.000046381756,0.00013210514,0.0010538495,0.0007272917,0.00008419117,0.001825652,0.002245613,0.13997503,0.0043152375,0.74536353,0.10408961,0.00014148073],"about_ca_topic_score_codex":0.0026113593,"about_ca_topic_score_gemma":0.0023403172,"teacher_disagreement_score":0.008811754,"about_ca_system_score_codex":0.0036868856,"about_ca_system_score_gemma":0.00482019,"threshold_uncertainty_score":0.044610143},"labels":[],"label_agreement":null},{"id":"W3117943700","doi":"10.1109/jproc.2020.3028611","title":"Bridging the digital divide: success depends on content provider and application developer involvement [point of view]","year":2020,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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":"Bridging (networking); Digital divide; The Internet; Internet privacy; Point (geometry); Phenomenon; Digital content; Digital ecosystem; Population; World Wide Web; Politics; Computer science; Internet access; Business; Knowledge management; Political science; Sociology; Computer security; Mathematics","score_opus":0.03249626426446881,"score_gpt":0.21643078932217905,"score_spread":0.18393452505771024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117943700","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3183263,0.0068183797,0.008442144,0.10209876,0.0006279492,0.00013958133,0.000353178,0.00018030398,0.5630134],"genre_scores_gemma":[0.9790323,0.0025913136,0.0016477833,0.0034123529,0.00027485035,0.000050614344,0.00014281286,0.00009319663,0.012754868],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99611425,0.001361287,0.00013017326,0.00041481762,0.0011916053,0.000787899],"domain_scores_gemma":[0.9825897,0.0069960747,0.0018704629,0.0005984845,0.0021792871,0.005765955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005659723,0.0002546653,0.00024401772,0.002026144,0.003625347,0.009658474,0.0011255655,0.0019555078,0.0227112],"category_scores_gemma":[0.019099258,0.0001507421,0.00013859186,0.0024448878,0.0026155706,0.012372877,0.005267839,0.0013860216,0.0044224076],"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.00029115082,0.00085329585,0.17064965,0.0004940765,0.000041342846,0.0009420098,0.031055212,0.00028369995,0.001211534,0.19933511,0.1068802,0.48796272],"study_design_scores_gemma":[0.000064985885,0.0004984425,0.16506632,0.0025465104,0.000096284835,0.0026228891,0.17791261,0.0027242368,0.0020788047,0.16073804,0.4855429,0.00010798857],"about_ca_topic_score_codex":0.0023094874,"about_ca_topic_score_gemma":0.0043216976,"teacher_disagreement_score":0.0227112,"about_ca_system_score_codex":0.0016801049,"about_ca_system_score_gemma":0.004068632,"threshold_uncertainty_score":0.07597649},"labels":[],"label_agreement":null},{"id":"W3120643467","doi":"10.1109/tits.2020.3043593","title":"ICN-Based Enhanced Cooperative Caching for Multimedia Streaming in Resource Constrained Vehicular Environment","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Deanship of Scientific Research, King Saud University","keywords":"Computer science; Cache; Computer network; Overhead (engineering); Quality of experience; Node (physics); Enhanced Data Rates for GSM Evolution; Information-centric networking; Heterogeneous network; False sharing; Distributed computing; Cache algorithms; Wireless; Wireless network; Quality of service; CPU cache","score_opus":0.02097988360922051,"score_gpt":0.23702931582927644,"score_spread":0.21604943222005593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120643467","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.17091452,0.0013602106,0.81852174,0.0002911663,0.000162875,0.000106226325,0.00011248158,0.0009024451,0.0076283333],"genre_scores_gemma":[0.95769536,0.0002428615,0.039628413,0.00006351082,0.00002524393,0.000030032044,0.00009818435,0.000014503448,0.0022017718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996561,0.00006176729,0.000018711855,0.00007987285,0.00011701179,0.00006649104],"domain_scores_gemma":[0.9995016,0.00011126438,0.00004505806,0.000058637972,0.00023694694,0.00004645445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039900822,0.0004132968,0.0005907304,0.00042304653,0.00059090916,0.0005186408,0.0012718702,0.00047540208,0.0005282641],"category_scores_gemma":[0.0009648073,0.00018181257,0.00031671248,0.0006039002,0.00031405268,0.00085506064,0.00048356483,0.0002996446,0.00015741643],"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.0005411611,0.00022656187,0.005271976,0.00018857718,0.00012897022,0.00085788936,0.00034488374,0.74981576,0.07074393,0.014557415,0.0056851665,0.15163778],"study_design_scores_gemma":[0.0000043409036,0.000034280885,0.000165398,0.0000025571476,0.000008904033,0.000048642272,0.000019871688,0.9967393,0.0018950618,0.0006389883,0.00043529592,0.0000072843022],"about_ca_topic_score_codex":0.02265263,"about_ca_topic_score_gemma":0.04040137,"teacher_disagreement_score":0.02265263,"about_ca_system_score_codex":0.001080326,"about_ca_system_score_gemma":0.0009867642,"threshold_uncertainty_score":0.04504156},"labels":[],"label_agreement":null},{"id":"W31239732","doi":"10.2147/idr.s202440","title":"Locality Characteristics of Web Streams Revisited","year":2005,"lang":"en","type":"article","venue":"Infection and Drug Resistance","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Locality; STREAMS; Computer science; Locality of reference; TRACE (psycholinguistics); Data stream mining; Data mining; Computer network; Cache","score_opus":0.0072477487252725235,"score_gpt":0.21911590180670676,"score_spread":0.21186815308143422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31239732","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.9790563,0.0008398244,0.00047838475,0.0007767862,0.000034944296,0.000113682596,0.0038975796,0.000052581912,0.014749939],"genre_scores_gemma":[0.997059,0.000283668,0.00037529622,0.00009497747,0.000020021207,0.000033365322,0.0010075999,0.000015984751,0.0011101502],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989712,0.00026729415,0.00014387652,0.00015143554,0.00023620501,0.00023003551],"domain_scores_gemma":[0.9960343,0.0006405677,0.0018221182,0.00021490733,0.0007610739,0.00052699755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897365,0.00021229505,0.00030840392,0.0027145853,0.0010841603,0.0019451049,0.000736888,0.0004727902,0.013893708],"category_scores_gemma":[0.005391242,0.00017524323,0.00033461498,0.0056747035,0.0007587825,0.0017124953,0.0014446649,0.00041833104,0.0016078807],"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.000043328666,0.000030374,0.98934424,0.00006689655,0.000021846465,0.00055952126,0.0008388722,0.00006901507,0.00011435359,0.00049930596,0.0013986472,0.007013634],"study_design_scores_gemma":[0.000006301052,0.000029388517,0.9855951,0.000118876706,0.000024271218,0.0017722801,0.006144028,0.00046995786,0.00010580406,0.0004420632,0.0052783326,0.000013597481],"about_ca_topic_score_codex":0.02462633,"about_ca_topic_score_gemma":0.037087053,"teacher_disagreement_score":0.02462633,"about_ca_system_score_codex":0.0011898233,"about_ca_system_score_gemma":0.001267568,"threshold_uncertainty_score":0.04896593},"labels":[],"label_agreement":null},{"id":"W3126035479","doi":"10.1109/jiot.2021.3127150","title":"Joint Transmission Scheme and Coded Content Placement in Cluster-Centric UAV-Aided Cellular Networks","year":2021,"lang":"en","type":"preprint","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of Toronto; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Cache; Node (physics); Real-time computing; Cellular network; Cluster analysis","score_opus":0.03548938173767595,"score_gpt":0.2308679630689854,"score_spread":0.19537858133130948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126035479","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.5049189,0.00047689656,0.49079865,0.0001011627,0.00005732856,0.00007742911,0.00012289498,0.00035463306,0.0030921607],"genre_scores_gemma":[0.9818479,0.000056278874,0.017654426,0.000013248094,0.0000046794894,0.000014528318,0.000031072435,0.000006024196,0.00037189302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960035,0.00011693789,0.000012245902,0.00007230718,0.000103990555,0.00009409226],"domain_scores_gemma":[0.99888176,0.00045576086,0.0001730836,0.0001386495,0.00029463833,0.000056120625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038191123,0.00049693533,0.00044471433,0.0005480113,0.00046006334,0.00065758283,0.00083922397,0.000430917,0.00048816463],"category_scores_gemma":[0.002086137,0.00019579376,0.00020888289,0.0008718511,0.00055465515,0.0005746925,0.00050624297,0.00023700783,0.000109130175],"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.00015223982,0.00002614396,0.0011947026,0.00003221155,0.000021439597,0.00011608533,0.000057303485,0.9721863,0.007308275,0.0033419349,0.00039001353,0.015173419],"study_design_scores_gemma":[0.000004448902,0.000045782584,0.00022773037,0.0000020600876,0.000007563199,0.00003432095,0.000023204604,0.9966145,0.0023082222,0.0005677154,0.00015803905,0.000006332036],"about_ca_topic_score_codex":0.011187105,"about_ca_topic_score_gemma":0.0106007485,"teacher_disagreement_score":0.011187105,"about_ca_system_score_codex":0.0011227733,"about_ca_system_score_gemma":0.0007508887,"threshold_uncertainty_score":0.022243977},"labels":[],"label_agreement":null},{"id":"W3129281276","doi":"10.1109/globecom42002.2020.9348257","title":"Mobility-Aware Content Caching and User Association for Ultra-Dense Mobile Edge Computing Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"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 British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Chongqing Research Program of Basic Research and Frontier Technology; National Natural Science Foundation of China","keywords":"Computer science; Backhaul (telecommunications); Computer network; Mobile edge computing; Core network; Enhanced Data Rates for GSM Evolution; Distributed computing; Cellular network; Edge computing; Base station; Server; Artificial intelligence","score_opus":0.032317630147929294,"score_gpt":0.23586417301676738,"score_spread":0.20354654286883808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129281276","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.2036082,0.0011371877,0.79167557,0.0005347196,0.000045860797,0.00010809235,0.00006820843,0.00037784464,0.0024442675],"genre_scores_gemma":[0.93597376,0.0002707327,0.06277175,0.000070498885,0.000018519919,0.000034936405,0.00005330825,0.00001869806,0.0007877063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994368,0.00019314773,0.00002209228,0.00009389751,0.00011575549,0.00013833866],"domain_scores_gemma":[0.99892837,0.0005131243,0.00014617766,0.00014542359,0.00016608213,0.000100748126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008632952,0.0005532564,0.0009072017,0.00040235498,0.00075941364,0.00081702607,0.001402887,0.00080068765,0.000629395],"category_scores_gemma":[0.0024538715,0.00031048732,0.0002661643,0.0009606026,0.0005349225,0.0016979947,0.0010724642,0.0006873535,0.00009681342],"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.00028941297,0.0002704181,0.0037282002,0.00010922723,0.000057557165,0.00023673315,0.00013973092,0.87015146,0.010678051,0.020976579,0.0024181672,0.09094449],"study_design_scores_gemma":[0.0000052139594,0.00002321174,0.00020518767,0.0000021923815,0.000005644327,0.000037852737,0.00002075336,0.9959943,0.0007040478,0.002762258,0.00023575798,0.0000035052037],"about_ca_topic_score_codex":0.008680293,"about_ca_topic_score_gemma":0.013931866,"teacher_disagreement_score":0.008680293,"about_ca_system_score_codex":0.0015262724,"about_ca_system_score_gemma":0.0014910139,"threshold_uncertainty_score":0.017259538},"labels":[],"label_agreement":null},{"id":"W3130337813","doi":"10.1007/978-3-030-62124-7_19","title":"Online Social Media Sharing","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Social media; World Wide Web; Computer science; Social media optimization; Internet privacy; The Internet; User-generated content; Multimedia; Web 2.0; Field (mathematics); Service (business); Web service; Business","score_opus":0.04825372190782228,"score_gpt":0.26261797040642915,"score_spread":0.21436424849860686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130337813","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02512037,0.0052256566,0.045155596,0.0031061084,0.0006398503,0.00010451207,0.00037681675,0.00057952123,0.91969156],"genre_scores_gemma":[0.40190595,0.0064208535,0.01551692,0.00061901513,0.0011036164,0.0001549634,0.0006447226,0.0003046908,0.57332927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950767,0.00013560451,0.000014793042,0.000076523735,0.00020211162,0.00006332061],"domain_scores_gemma":[0.9989496,0.00042606925,0.000060071867,0.00037616387,0.00011124601,0.000076922464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005178928,0.00042700738,0.00036304787,0.0010871161,0.0014772578,0.0033036594,0.0008748227,0.001042319,0.037758227],"category_scores_gemma":[0.0023517981,0.00027815028,0.00029618913,0.0023123182,0.0008798757,0.007925184,0.0019364338,0.0010233739,0.0069576385],"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.000042735122,0.000108963126,0.0004776378,0.0001172713,0.000017613096,0.00010540391,0.0010075351,0.0017058782,0.0011812206,0.6766934,0.06297766,0.2555646],"study_design_scores_gemma":[0.000011945926,0.000064081956,0.0010791078,0.00019238533,0.000027594415,0.00054113433,0.0011389463,0.015217055,0.0023776104,0.31494632,0.6643755,0.000028294202],"about_ca_topic_score_codex":0.0013837828,"about_ca_topic_score_gemma":0.0019433321,"teacher_disagreement_score":0.037758227,"about_ca_system_score_codex":0.0011262031,"about_ca_system_score_gemma":0.00076717144,"threshold_uncertainty_score":0.12631387},"labels":[],"label_agreement":null},{"id":"W3131730915","doi":"10.1109/globecom42002.2020.9347965","title":"Cache Management in Information-Centric Networks using Convolutional Neural Network","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Cache; Convolutional neural network; Cache algorithms; CPU cache; Parallel computing; Machine learning","score_opus":0.02686050693024687,"score_gpt":0.2128015561476709,"score_spread":0.18594104921742405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131730915","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.5037022,0.0041767377,0.47084445,0.0015536491,0.00022039644,0.000114438946,0.0014495958,0.011350259,0.006588324],"genre_scores_gemma":[0.9265824,0.00051391515,0.06709472,0.00024762785,0.00005247741,0.00006705668,0.0012501151,0.000091062095,0.0041005877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998247,0.000021834268,0.0000132249925,0.00006218054,0.000033272237,0.000044810666],"domain_scores_gemma":[0.99924517,0.00033343508,0.00009156802,0.000080018384,0.00020993357,0.000039899052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068982586,0.0006973828,0.0006902076,0.0007969687,0.0005060734,0.0009506317,0.0016222717,0.0009557569,0.00089508115],"category_scores_gemma":[0.002891805,0.00039890135,0.00038219386,0.0011529553,0.00038418733,0.0019226172,0.0004627652,0.0009053201,0.0002858012],"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.00026944364,0.00020196143,0.0053313836,0.00010669886,0.00010948122,0.00008966944,0.000081407896,0.8165509,0.0039249444,0.0037870228,0.006100607,0.1634465],"study_design_scores_gemma":[0.0000040407954,0.000011569011,0.0002177716,0.0000034277894,0.0000067030282,0.000007114639,0.000004522926,0.9978417,0.0007304414,0.00097836,0.00019136033,0.0000029888618],"about_ca_topic_score_codex":0.061184656,"about_ca_topic_score_gemma":0.081249095,"teacher_disagreement_score":0.061184656,"about_ca_system_score_codex":0.0031868673,"about_ca_system_score_gemma":0.0016014796,"threshold_uncertainty_score":0.121657014},"labels":[],"label_agreement":null},{"id":"W3138307748","doi":"10.1109/tit.2022.3193316","title":"Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Popularity; Cache; Computer science; Upper and lower bounds; Parallel computing; Theoretical computer science; Algorithm; Mathematics","score_opus":0.010605159614481403,"score_gpt":0.20613410890999112,"score_spread":0.1955289492955097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138307748","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.3618911,0.002883283,0.62527865,0.0007672702,0.00006823913,0.000096889555,0.00034973523,0.00050945947,0.008155325],"genre_scores_gemma":[0.97218376,0.0008658002,0.025301063,0.0000801311,0.000046657846,0.00007192433,0.00010798944,0.0000688096,0.0012739474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976937,0.00061055843,0.00013001187,0.00037656902,0.0005632524,0.0006258551],"domain_scores_gemma":[0.9874334,0.008064812,0.0013560372,0.0015737697,0.0013121115,0.00025991243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002670136,0.0012654575,0.001462238,0.0010636182,0.0007847026,0.0023799764,0.0024602343,0.0013121958,0.0013904851],"category_scores_gemma":[0.021425921,0.0006296863,0.00044532627,0.0021619205,0.0012840091,0.0044169105,0.0013911885,0.0010892438,0.0003096989],"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.00069121126,0.0001151025,0.0022618764,0.00027185207,0.00006995728,0.00037530938,0.00022970399,0.8683937,0.015884722,0.084035575,0.0012079071,0.02646291],"study_design_scores_gemma":[0.00001702118,0.00008086139,0.00041361942,0.000020752272,0.000024768624,0.00014144434,0.00005650809,0.98318416,0.005075745,0.010615922,0.00034072535,0.000028465856],"about_ca_topic_score_codex":0.004054261,"about_ca_topic_score_gemma":0.0030053586,"teacher_disagreement_score":0.004054261,"about_ca_system_score_codex":0.0040118056,"about_ca_system_score_gemma":0.0016671037,"threshold_uncertainty_score":0.029107869},"labels":[],"label_agreement":null},{"id":"W3138954746","doi":"10.1109/tmm.2021.3067205","title":"Design and Analysis of MEC- and Proactive Caching-Based $360^{\\circ }$ Mobile VR Video Streaming","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":78,"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":"National Natural Science Foundation of China","keywords":"Computer science; Video streaming; Multimedia; Mobile computing; Server; Computer network","score_opus":0.018291561687785625,"score_gpt":0.2392927899908476,"score_spread":0.221001228303062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138954746","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.055301197,0.000986993,0.9359704,0.00033190558,0.000060790946,0.00015566178,0.00006240677,0.000392392,0.0067381375],"genre_scores_gemma":[0.9632121,0.00056115456,0.034365047,0.00007810652,0.000022084154,0.000074244366,0.000040555886,0.0000266584,0.0016202015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991702,0.00015386884,0.000037152797,0.0001782661,0.00030809903,0.00015243996],"domain_scores_gemma":[0.99930525,0.0001935536,0.00010318989,0.000047592024,0.00029513735,0.00005523857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000804281,0.000659526,0.0007441874,0.00042038184,0.0004986267,0.0010061743,0.0016643553,0.0007265228,0.0013385103],"category_scores_gemma":[0.001581025,0.0004237054,0.000438277,0.0005609153,0.0005764994,0.0007489938,0.0006497967,0.00047539186,0.00020160069],"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.00016081156,0.00007574599,0.0016704759,0.0001832224,0.000053418837,0.00033364206,0.00011159209,0.901306,0.034100726,0.021136604,0.0014129692,0.03945477],"study_design_scores_gemma":[0.0000034767024,0.00004429812,0.00009125498,0.000002973747,0.0000085241345,0.000029943407,0.000011022133,0.9978835,0.0012150379,0.00045302563,0.0002527819,0.000004157478],"about_ca_topic_score_codex":0.009362618,"about_ca_topic_score_gemma":0.005248741,"teacher_disagreement_score":0.009362618,"about_ca_system_score_codex":0.001983606,"about_ca_system_score_gemma":0.0014967652,"threshold_uncertainty_score":0.0186162},"labels":[],"label_agreement":null},{"id":"W3139466609","doi":"10.1109/mwc.001.2000264","title":"A Novel Centralized Cloud-Based Mobile Data Rollover Management","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Computer science; Roaming; Cloud computing; Service (business); The Internet; Mobile broadband; Service provider; Data as a service; Computer network; Computer security; Telecommunications; World Wide Web; Wireless; Business","score_opus":0.07438900779313735,"score_gpt":0.301127743917429,"score_spread":0.22673873612429168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139466609","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.0877183,0.0023352907,0.8906518,0.00092012854,0.0004896109,0.00049525546,0.0004351692,0.005333221,0.011621069],"genre_scores_gemma":[0.92904216,0.00040331695,0.06569862,0.00024474616,0.00017094966,0.00008627771,0.00027448617,0.00004551783,0.0040337928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990282,0.000096165415,0.000044620363,0.00023822607,0.00029463824,0.00029813437],"domain_scores_gemma":[0.999308,0.000070265705,0.00009234289,0.0001568086,0.0002498952,0.00012269372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047167068,0.0005381933,0.001022115,0.0005861681,0.0014110357,0.0017208133,0.0027341065,0.0006204324,0.0020468857],"category_scores_gemma":[0.00063366967,0.00024700598,0.00045077922,0.0013348713,0.00043422965,0.0015912502,0.0012755127,0.0005934377,0.0005318112],"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.0017428094,0.00091345207,0.008019478,0.0003473232,0.00021052941,0.0013645695,0.00031250907,0.23093684,0.07784972,0.035059772,0.0525494,0.59069365],"study_design_scores_gemma":[0.00006792398,0.00011075366,0.000870711,0.000012475957,0.000039739592,0.00024057295,0.00006723529,0.98143756,0.008557502,0.0017695009,0.006794492,0.000031481966],"about_ca_topic_score_codex":0.012868708,"about_ca_topic_score_gemma":0.010713091,"teacher_disagreement_score":0.012868708,"about_ca_system_score_codex":0.0016188279,"about_ca_system_score_gemma":0.0031332595,"threshold_uncertainty_score":0.025587618},"labels":[],"label_agreement":null},{"id":"W3152252545","doi":"","title":"Two Time-Scale Content Caching and User Association in 5G Heterogeneous Networks","year":2017,"lang":"en","type":"article","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Scale (ratio); Association (psychology); Content (measure theory); Geography; Mathematics; Psychology","score_opus":0.016908264136478085,"score_gpt":0.2343791845733045,"score_spread":0.21747092043682642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152252545","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.14082953,0.0006757202,0.8543352,0.00048131522,0.00005829949,0.00007959223,0.00006383924,0.00020149775,0.0032749088],"genre_scores_gemma":[0.9539181,0.00023651113,0.044090856,0.00008350561,0.00003921238,0.000036473215,0.000035609562,0.000017801649,0.001542009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998953,0.00040169095,0.000028440463,0.00019721873,0.00017971499,0.0002398899],"domain_scores_gemma":[0.9984262,0.00083469,0.00023369255,0.0001694964,0.00021347521,0.00012246803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014318969,0.00072198414,0.00089555123,0.0004408153,0.0007260328,0.0012294832,0.0013491611,0.0011371126,0.00075606816],"category_scores_gemma":[0.004029407,0.00033673042,0.0005134059,0.0009718984,0.0010391636,0.0019554715,0.0010044804,0.0007605354,0.000093397815],"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.00011177098,0.00005963262,0.0017049648,0.00003206537,0.000035646455,0.00014350488,0.000060005033,0.94498104,0.0025575706,0.030934455,0.00062433846,0.018754989],"study_design_scores_gemma":[0.0000051736056,0.000019365058,0.00022629308,0.0000012897848,0.000007753684,0.000021234328,0.000014366316,0.9965148,0.00038396314,0.002628134,0.00017283013,0.0000047803146],"about_ca_topic_score_codex":0.01033512,"about_ca_topic_score_gemma":0.00924388,"teacher_disagreement_score":0.01033512,"about_ca_system_score_codex":0.0027444633,"about_ca_system_score_gemma":0.0016460088,"threshold_uncertainty_score":0.020549893},"labels":[],"label_agreement":null},{"id":"W3157556801","doi":"10.1155/2021/8864004","title":"Cluster‐Based Cooperative Cache Deployment and Coded Delivery Strategy in C‐V2X Networks","year":2021,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Software deployment; Cache; Cluster (spacecraft); Computer network; Operating system","score_opus":0.026033436148941106,"score_gpt":0.26513170638608324,"score_spread":0.23909827023714214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157556801","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.26051652,0.00090944563,0.7330479,0.0003267446,0.0000762305,0.00015804911,0.000064545005,0.0006786489,0.004221888],"genre_scores_gemma":[0.9691793,0.00016915394,0.029074611,0.000046470952,0.000010263996,0.000063077954,0.000034788278,0.000014382101,0.0014079341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999503,0.00014378695,0.000019493793,0.00011433986,0.00012057581,0.000098687335],"domain_scores_gemma":[0.9993113,0.00022238703,0.00008563136,0.00007108052,0.00024073673,0.00006885603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004956023,0.00064239465,0.00047359758,0.0007224631,0.0008679525,0.000564647,0.0014007358,0.0006267907,0.00041127764],"category_scores_gemma":[0.0012843442,0.00028099644,0.00028185933,0.00082180585,0.0005549864,0.0010253316,0.0008421346,0.0002947755,0.000111246896],"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.0002874452,0.00010956369,0.002765593,0.00011562933,0.00007184615,0.0004508536,0.00040998418,0.8674704,0.024122538,0.01766048,0.003449252,0.08308645],"study_design_scores_gemma":[0.000012020207,0.00007509606,0.00028661007,0.0000049730443,0.000016144151,0.00010091634,0.00009917986,0.99389136,0.0035052716,0.0012090523,0.0007848834,0.000014521763],"about_ca_topic_score_codex":0.015067476,"about_ca_topic_score_gemma":0.012769679,"teacher_disagreement_score":0.015067476,"about_ca_system_score_codex":0.0012855167,"about_ca_system_score_gemma":0.0011092669,"threshold_uncertainty_score":0.02995956},"labels":[],"label_agreement":null},{"id":"W3157658125","doi":"10.1109/hpcc-smartcity-dss50907.2020.00102","title":"Mobility-Aware Latency-Efficient Cache Placement in Mobile Edge Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Computer network; Quality of service; Latency (audio); Mobile computing; Enhanced Data Rates for GSM Evolution; Cache algorithms; Popularity; Distributed computing; CPU cache; Telecommunications","score_opus":0.020992449726271387,"score_gpt":0.226311545201948,"score_spread":0.20531909547567662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157658125","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.18738005,0.001181775,0.80753356,0.00033782993,0.000039553124,0.00009416869,0.00008786817,0.0002383578,0.003106764],"genre_scores_gemma":[0.94712967,0.00042862972,0.050758056,0.000045023004,0.00001905138,0.00004095242,0.000045699664,0.000019011759,0.0015139807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999529,0.00020392913,0.000023262191,0.00006830288,0.00008642393,0.00008920099],"domain_scores_gemma":[0.99935037,0.00036291103,0.000101551756,0.000035952013,0.00010924252,0.000040016825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073363085,0.00046148134,0.00073207624,0.00040636267,0.0005019105,0.0008897951,0.00095474126,0.00075160246,0.0004405015],"category_scores_gemma":[0.0019093197,0.00031371842,0.00030067426,0.0009684635,0.00037950123,0.0009949773,0.00052075373,0.00037390503,0.00009502058],"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.0000949877,0.00003619696,0.00079116615,0.000041426472,0.000019687737,0.00012390374,0.000057209818,0.9735526,0.0041482477,0.0059664077,0.0004909656,0.014677187],"study_design_scores_gemma":[0.000004315639,0.000033619544,0.00011881599,0.0000029195394,0.000006279254,0.000031251657,0.000023813922,0.9974025,0.0008050644,0.0013721981,0.00019512551,0.00000409904],"about_ca_topic_score_codex":0.005984776,"about_ca_topic_score_gemma":0.00798991,"teacher_disagreement_score":0.005984776,"about_ca_system_score_codex":0.001213191,"about_ca_system_score_gemma":0.0008413189,"threshold_uncertainty_score":0.0118998885},"labels":[],"label_agreement":null},{"id":"W3158739534","doi":"10.36227/techrxiv.14461760.v1","title":"Energy and Latency Efficient Caching in Mobile Edge Networks: Survey, Solutions, and Challenges","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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; Cache; Computer network; Base station; Enhanced Data Rates for GSM Evolution; Efficient energy use; Latency (audio); Wireless; Wireless network; Macrocell; Telecommunications; Engineering","score_opus":0.045910354816226205,"score_gpt":0.23104439558819065,"score_spread":0.18513404077196444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158739534","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009704751,0.91065955,0.06001901,0.003797681,0.00063074025,0.00007309493,0.00017579402,0.0003605721,0.014578882],"genre_scores_gemma":[0.09996904,0.84840083,0.04035091,0.0010883296,0.0015136419,0.00010618792,0.0004327386,0.00009910544,0.008039229],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994136,0.00012692485,0.000056829842,0.00008340924,0.00023294591,0.00008635388],"domain_scores_gemma":[0.99882454,0.0005206422,0.00007540946,0.00009833015,0.00043040692,0.000050635914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076966546,0.00071730244,0.0012634564,0.0015199505,0.0006880419,0.002540652,0.0017415722,0.0016635149,0.0018901305],"category_scores_gemma":[0.0015704616,0.00047462506,0.0005075132,0.0049824845,0.00054132025,0.003945868,0.00093958573,0.0013377647,0.00090845546],"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.00013331807,0.00022769574,0.0020815928,0.005906824,0.00010767881,0.0002166832,0.00028221443,0.027338948,0.0062274626,0.10077937,0.03557324,0.821125],"study_design_scores_gemma":[0.00004007944,0.0006244126,0.0025661106,0.0036286244,0.0002952384,0.0024524513,0.0012409142,0.14332114,0.0107052745,0.099767245,0.73516387,0.00019466333],"about_ca_topic_score_codex":0.003143988,"about_ca_topic_score_gemma":0.0028924209,"teacher_disagreement_score":0.003143988,"about_ca_system_score_codex":0.0012819775,"about_ca_system_score_gemma":0.0015895307,"threshold_uncertainty_score":0.009301424},"labels":[],"label_agreement":null},{"id":"W3159173436","doi":"10.1109/tvt.2022.3160586","title":"Probabilistic Analysis of Operating Modes in Cache-Enabled Full-Duplex D2D Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Polytechnique Montréal","funders":"","keywords":"Backhaul (telecommunications); Cache; Computer science; Computer network; Probabilistic logic; Popularity; Cellular network; Key (lock); Transmission (telecommunications); Core network; Duplex (building); Base station; Telecommunications; Computer security","score_opus":0.011560436336485673,"score_gpt":0.21950096007708994,"score_spread":0.20794052374060426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159173436","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.48440036,0.001564276,0.5055969,0.00053258566,0.000028415066,0.00016523457,0.0007794904,0.00034480233,0.0065879207],"genre_scores_gemma":[0.9924176,0.00041936422,0.0059417863,0.00002358565,0.000013313901,0.000054528613,0.00012508762,0.000023715702,0.0009810813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985683,0.0004865094,0.00007512341,0.00022068377,0.0003741662,0.00027525556],"domain_scores_gemma":[0.987604,0.009058783,0.0013239612,0.0005429574,0.001207654,0.0002625758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023466048,0.0005922334,0.00070624944,0.0013449764,0.00062594685,0.0015349173,0.0013041527,0.0007987646,0.0012850479],"category_scores_gemma":[0.010084744,0.00080992136,0.0006303035,0.0012684411,0.0014037049,0.0020462808,0.0009533573,0.00080649473,0.00024044908],"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.00022481989,0.00006125297,0.010702797,0.00010781844,0.00006312711,0.00025896853,0.0002740433,0.9217709,0.004751344,0.04809413,0.0008726434,0.012818125],"study_design_scores_gemma":[0.000004171156,0.000022735687,0.0016648894,0.000009082405,0.000013844048,0.00009323036,0.000058368612,0.9894733,0.0006566135,0.0077401847,0.00024686477,0.00001680463],"about_ca_topic_score_codex":0.0049543288,"about_ca_topic_score_gemma":0.004311602,"teacher_disagreement_score":0.0049543288,"about_ca_system_score_codex":0.0022351693,"about_ca_system_score_gemma":0.00070066605,"threshold_uncertainty_score":0.01621741},"labels":[],"label_agreement":null},{"id":"W3159345041","doi":"10.1145/3447786.3456230","title":"DZiG","year":2021,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation; Graph; Theoretical computer science; Graph algorithms; Stream processing; Parallel computing; Algorithm","score_opus":0.011994114531745625,"score_gpt":0.19735597257975704,"score_spread":0.18536185804801142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159345041","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022413973,0.0013493128,0.5562311,0.0013530755,0.0006817896,0.0006170809,0.014436254,0.265314,0.13760339],"genre_scores_gemma":[0.30005062,0.0019348619,0.46675315,0.0018936131,0.00027838332,0.0009791246,0.06597476,0.023619052,0.1385164],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995672,0.000046778936,0.000028482711,0.00014018532,0.00014729398,0.000070031165],"domain_scores_gemma":[0.99921787,0.00010632367,0.00003432388,0.00036114402,0.0002012595,0.000079040554],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047059287,0.00087918475,0.0004799526,0.00068923377,0.0005497584,0.0015545061,0.0022170371,0.0007454349,0.05198176],"category_scores_gemma":[0.001884591,0.00043779347,0.00042543618,0.00068977725,0.0003913605,0.0022246568,0.002277296,0.0012669729,0.029956969],"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.0010465442,0.0002322184,0.0021770685,0.00075005466,0.000091500624,0.00030589633,0.00025649185,0.015976926,0.048842993,0.078473054,0.36963093,0.48221633],"study_design_scores_gemma":[0.0002854664,0.0002162148,0.0014675647,0.000063372674,0.000056226472,0.00047725727,0.00010251497,0.19848955,0.044228964,0.054248177,0.7002873,0.00007745959],"about_ca_topic_score_codex":0.0032433295,"about_ca_topic_score_gemma":0.003931706,"teacher_disagreement_score":0.94801825,"about_ca_system_score_codex":0.00083649514,"about_ca_system_score_gemma":0.0010672016,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3159475051","doi":"10.1109/tmc.2021.3074917","title":"QoE-Aware Efficient Content Distribution Scheme For Satellite-Terrestrial Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Cache; Quality of experience; Computer network; Network topology; Distributed computing; Real-time computing; Quality of service","score_opus":0.035296122757390865,"score_gpt":0.2549687856965256,"score_spread":0.21967266293913473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159475051","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.114960045,0.0006389799,0.8794103,0.00024340251,0.000103796774,0.00016103749,0.00011558768,0.00072060514,0.003646126],"genre_scores_gemma":[0.96321905,0.00022540313,0.0350147,0.000067479654,0.000041014602,0.00005698801,0.000103396254,0.00002959574,0.0012423826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994911,0.00008931899,0.00003199684,0.00011488983,0.00016943415,0.00010319776],"domain_scores_gemma":[0.99890363,0.00030735251,0.00011352399,0.00012906358,0.0004442148,0.00010231537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005038965,0.00060949224,0.000838106,0.0007186568,0.00090329186,0.00074334966,0.0015415157,0.00040803998,0.0010284489],"category_scores_gemma":[0.002260271,0.00022335138,0.00031564117,0.0009684551,0.00042207938,0.0014550781,0.000945815,0.00043992887,0.00019477209],"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.0010471508,0.00050432753,0.0061160997,0.00034734793,0.00014201952,0.0006741364,0.00070298364,0.51228946,0.10778216,0.024579903,0.00888894,0.33692545],"study_design_scores_gemma":[0.000022296528,0.00009000921,0.00043502852,0.0000048151933,0.000022625734,0.00011053725,0.000054710046,0.9916523,0.004295986,0.0023450488,0.0009525395,0.000014062258],"about_ca_topic_score_codex":0.0046674856,"about_ca_topic_score_gemma":0.006794728,"teacher_disagreement_score":0.0046674856,"about_ca_system_score_codex":0.0012506322,"about_ca_system_score_gemma":0.0009543456,"threshold_uncertainty_score":0.009280622},"labels":[],"label_agreement":null},{"id":"W3161670757","doi":"10.1109/mwc.001.2000303","title":"Wireless Virtual Reality in Beyond 5G Systems with the Internet of Intelligence","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless; Virtual reality; Wireless network; Computer network; The Internet; Provisioning; Wi-Fi array; Multimedia; Distributed computing; Human–computer interaction; Telecommunications; World Wide Web","score_opus":0.04276580302992703,"score_gpt":0.27270846119876374,"score_spread":0.22994265816883672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161670757","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.062226057,0.002543623,0.906646,0.0017267661,0.00021808581,0.000074541036,0.000052482847,0.0005790819,0.025933295],"genre_scores_gemma":[0.935814,0.0009766021,0.05974872,0.00027194663,0.00006671926,0.000045404042,0.00003520014,0.000027293536,0.0030140385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999585,0.00018972803,0.000013168014,0.00005196897,0.00009979864,0.000060249946],"domain_scores_gemma":[0.99959856,0.00019788065,0.00004089827,0.00006219564,0.00005698658,0.00004353715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051800563,0.00043524933,0.0004512902,0.00025959546,0.00050989765,0.0012207266,0.00073102984,0.0006370992,0.0019886694],"category_scores_gemma":[0.0015473518,0.00017792487,0.0003208059,0.00042983555,0.0006776129,0.0017850796,0.0013317011,0.0009205991,0.0002694753],"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.00031528118,0.00019943673,0.0020646686,0.00025916818,0.00013321408,0.0006125473,0.0004243988,0.5379109,0.01976596,0.21241967,0.009382584,0.21651216],"study_design_scores_gemma":[0.000019838735,0.00008807077,0.00033938105,0.000015117839,0.000022067976,0.00016095274,0.0000629507,0.9745935,0.0014680506,0.017966585,0.005244959,0.000018582106],"about_ca_topic_score_codex":0.002624642,"about_ca_topic_score_gemma":0.0022740923,"teacher_disagreement_score":0.002624642,"about_ca_system_score_codex":0.0005827008,"about_ca_system_score_gemma":0.0004688451,"threshold_uncertainty_score":0.0066527724},"labels":[],"label_agreement":null},{"id":"W3172196691","doi":"10.1109/tnsm.2021.3086721","title":"Deep Reinforcement Learning-Based Content Migration for Edge Content Delivery Networks With Vehicular Nodes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"CHIST-ERA; Fonds Québécois de la Recherche sur la Nature et les Technologies; Concordia University; Agence Nationale de la Recherche","keywords":"Computer science; Server; Reinforcement learning; Upload; Cache; Computer network; Enhanced Data Rates for GSM Evolution; Quality of experience; Content delivery network; Content delivery; Process (computing); Edge device; Cloud computing; Quality of service; Operating system; Artificial intelligence","score_opus":0.023044868425251778,"score_gpt":0.19902911930316913,"score_spread":0.17598425087791736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172196691","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.2878809,0.0007293826,0.7056444,0.00052741886,0.000110530134,0.00007566228,0.00006213212,0.0006746028,0.00429482],"genre_scores_gemma":[0.9852894,0.000074911826,0.01358924,0.00004232373,0.0000057606917,0.000020955222,0.00002435401,0.00001033272,0.00094269513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.000067162786,0.000008478677,0.000037739243,0.000030977535,0.00006960387],"domain_scores_gemma":[0.9994685,0.0002689272,0.000058983704,0.00003047151,0.00011440474,0.00005872361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058972905,0.00046368255,0.00052961474,0.00025954968,0.0003033101,0.00044709485,0.0009261708,0.0005363766,0.0008130497],"category_scores_gemma":[0.0015956288,0.00017932268,0.0002592094,0.00027457273,0.00050550763,0.00064814556,0.00064318307,0.0007423433,0.00011146777],"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.0000638485,0.00005300859,0.0006945437,0.000019792456,0.000011161833,0.000037570626,0.000023715751,0.9801516,0.0015261511,0.0015728915,0.00038911897,0.015456578],"study_design_scores_gemma":[0.0000021369592,0.000014420273,0.000043162556,8.299323e-7,0.0000015915751,0.000003149264,0.000004350243,0.99929166,0.00022706587,0.0003510609,0.000059482525,0.0000010701443],"about_ca_topic_score_codex":0.012174746,"about_ca_topic_score_gemma":0.008439572,"teacher_disagreement_score":0.012174746,"about_ca_system_score_codex":0.0012368284,"about_ca_system_score_gemma":0.00093289244,"threshold_uncertainty_score":0.02420777},"labels":[],"label_agreement":null},{"id":"W3172734515","doi":"10.1109/ieeeconf51394.2020.9443377","title":"Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity","year":2020,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Computer science; Cache; Padding; Popularity; Upper and lower bounds; Scheme (mathematics); CPU cache; Computer network; Parallel computing; Computer security; Mathematics","score_opus":0.03647315637668974,"score_gpt":0.22231487742142378,"score_spread":0.18584172104473404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172734515","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.44788226,0.003734425,0.53785163,0.0006999019,0.000074252675,0.00009907672,0.00031624376,0.0004912286,0.00885097],"genre_scores_gemma":[0.9823251,0.00067668065,0.016062913,0.00006232412,0.000027512528,0.000045264773,0.000055419114,0.000035320954,0.00070947886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844474,0.00042721722,0.00008318737,0.00022096687,0.00035121193,0.00047266812],"domain_scores_gemma":[0.98941666,0.0063270135,0.0013033267,0.0014222624,0.0013165927,0.00021408583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021356805,0.0011697726,0.0011437066,0.00096064433,0.000751908,0.001904895,0.0018194658,0.001110642,0.0011649844],"category_scores_gemma":[0.018298518,0.0004283162,0.0003590428,0.0018167217,0.0013785792,0.0038834468,0.0012375194,0.00096457836,0.00024246621],"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.0007046015,0.00012295824,0.003178021,0.00031866643,0.0000737868,0.00051328185,0.0003031108,0.85391515,0.028582018,0.083779626,0.0013407711,0.027167998],"study_design_scores_gemma":[0.000015728108,0.00013611473,0.00059715915,0.000029509001,0.000031524258,0.0002541157,0.00008569876,0.9784793,0.01002396,0.009943792,0.00036016855,0.000042852873],"about_ca_topic_score_codex":0.003527256,"about_ca_topic_score_gemma":0.0028582963,"teacher_disagreement_score":0.003527256,"about_ca_system_score_codex":0.003298684,"about_ca_system_score_gemma":0.0015292407,"threshold_uncertainty_score":0.023933768},"labels":[],"label_agreement":null},{"id":"W3172943015","doi":"10.1049/ntw2.12029","title":"Performance of cache placement using supervised learning techniques in mobile edge networks","year":2021,"lang":"en","type":"article","venue":"IET Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"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; Cache; Enhanced Data Rates for GSM Evolution; Cache algorithms; Computer architecture; Artificial intelligence; Computer network; CPU cache","score_opus":0.017925108509412077,"score_gpt":0.23540745682291342,"score_spread":0.21748234831350133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172943015","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.8866412,0.00090443675,0.108519636,0.0002629986,0.00007302678,0.00005234231,0.0000924814,0.0009131217,0.0025406897],"genre_scores_gemma":[0.9903536,0.000049628605,0.009104077,0.000027973387,0.000007597181,0.000012749119,0.00006813328,0.00000949281,0.00036663772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994506,0.00020741172,0.000034248744,0.000097013355,0.000098081306,0.000112722424],"domain_scores_gemma":[0.99762386,0.0013037792,0.0002785211,0.00012932587,0.00055214646,0.00011229663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010164198,0.00067408703,0.0008935883,0.0005100724,0.0003803812,0.0005072044,0.00076691044,0.00072906236,0.0004865257],"category_scores_gemma":[0.0032519363,0.00020289638,0.00032461312,0.0005063798,0.00033246985,0.00063913874,0.00046535232,0.00045874694,0.00013709348],"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.00027607923,0.00018913131,0.0033016733,0.00003252879,0.000034428067,0.00004254008,0.000020288031,0.9554047,0.0013635148,0.00026824538,0.00048010435,0.038586758],"study_design_scores_gemma":[0.0000025132294,0.000037668127,0.00016477416,0.0000010092712,0.0000020349278,0.0000040260147,0.000004025232,0.99940693,0.00030453206,0.000057624784,0.000013774507,0.0000010051714],"about_ca_topic_score_codex":0.009633857,"about_ca_topic_score_gemma":0.0071694995,"teacher_disagreement_score":0.009633857,"about_ca_system_score_codex":0.0010013512,"about_ca_system_score_gemma":0.00072868314,"threshold_uncertainty_score":0.019155562},"labels":[],"label_agreement":null},{"id":"W3176102505","doi":"10.1109/cscn53733.2021.9686113","title":"A Pure HTTP/3 Alternative to MQTT-over-QUIC in Resource-Constrained IoT","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"MQTT; Computer science; Scalability; Computer network; Overhead (engineering); Exploit; Key (lock); Implementation; Distributed computing; Internet of Things; Computer security; Operating system","score_opus":0.02314142734377581,"score_gpt":0.2570460111875517,"score_spread":0.2339045838437759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176102505","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.18303096,0.0029007597,0.76514876,0.0032094074,0.0010547803,0.000664662,0.00045998362,0.01732053,0.026210198],"genre_scores_gemma":[0.8970248,0.0006305067,0.09221686,0.0012525575,0.00021037113,0.0001724548,0.0003927408,0.00050109084,0.0075987354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847704,0.00037725325,0.00014099566,0.00021159154,0.0005230133,0.00027004266],"domain_scores_gemma":[0.9962269,0.00068501564,0.00019051628,0.0014391768,0.0011967719,0.0002616378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832542,0.00058655936,0.00072595326,0.0008411923,0.0011995535,0.0025198597,0.002506449,0.0018298102,0.0020397885],"category_scores_gemma":[0.005036964,0.00039848857,0.0005013367,0.001363461,0.0009390581,0.0040041157,0.0019821508,0.0017905001,0.00074986793],"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.0037575138,0.0011892699,0.012414829,0.0012429489,0.00038352542,0.0038490186,0.0018237343,0.04227201,0.26433828,0.14307578,0.039905798,0.48574725],"study_design_scores_gemma":[0.00046032277,0.0016686876,0.009705732,0.00028279453,0.00045461467,0.0038838016,0.0012471781,0.6015959,0.17089048,0.07478471,0.13448513,0.00054073083],"about_ca_topic_score_codex":0.00477505,"about_ca_topic_score_gemma":0.0031765744,"teacher_disagreement_score":0.00477505,"about_ca_system_score_codex":0.0009861247,"about_ca_system_score_gemma":0.0015164217,"threshold_uncertainty_score":0.014980137},"labels":[],"label_agreement":null},{"id":"W3176760417","doi":"10.13052/jcsm2245-1439.1043","title":"Evaluating and Improving a Content Delivery Network (CDN) Workflow using Stochastic Modelling","year":2021,"lang":"en","type":"article","venue":"Journal of Cyber Security and Mobility","topic":"Caching and Content Delivery","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":"Workflow; Computer science; Reliability (semiconductor); Component (thermodynamics); Content delivery network; Process (computing); Content delivery; Reliability engineering; The Internet; Computer network; Database; Server; Engineering; Operating system","score_opus":0.0815722565650304,"score_gpt":0.28473105858288206,"score_spread":0.20315880201785166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176760417","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.35246363,0.00076642184,0.64221007,0.0005815117,0.00006297013,0.00026673015,0.00014553849,0.0008148752,0.0026882046],"genre_scores_gemma":[0.90664905,0.00031243503,0.0920877,0.000029753497,0.000014826121,0.00007865497,0.00013242447,0.0000496276,0.0006455716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978429,0.0010185958,0.00013464101,0.00026979114,0.0004984719,0.00023553267],"domain_scores_gemma":[0.9910738,0.0064728693,0.00071527215,0.00029619556,0.0011415713,0.00030040953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005311606,0.0010882107,0.001193957,0.0013883488,0.0006624373,0.0020209835,0.0009820473,0.0015169105,0.00071338017],"category_scores_gemma":[0.011945358,0.00068891427,0.000965679,0.0009035514,0.0006743756,0.0018192927,0.0008842423,0.0010044298,0.00014259003],"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.000050849212,0.000056337733,0.0014367944,0.000054600445,0.000025520232,0.00002561049,0.000025162439,0.9871019,0.001162258,0.0012356812,0.00010897945,0.008716257],"study_design_scores_gemma":[0.0000032940284,0.000035493227,0.00013117594,0.000003307583,0.000007772143,0.000004429156,0.00000813717,0.998992,0.00041940366,0.0003468942,0.00004482077,0.0000032103353],"about_ca_topic_score_codex":0.023017026,"about_ca_topic_score_gemma":0.011961667,"teacher_disagreement_score":0.023017026,"about_ca_system_score_codex":0.0036686764,"about_ca_system_score_gemma":0.003716615,"threshold_uncertainty_score":0.045766115},"labels":[],"label_agreement":null},{"id":"W3187080754","doi":"10.1109/iwcmc51323.2021.9498856","title":"Performance of Learning Based Classification Techniques for Cache Placement in MENs","year":2021,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Computer science; Cache; Cache algorithms; Cache invalidation; Cache coloring; Smart Cache; Computer network; Cache pollution; CPU cache","score_opus":0.035820266743885915,"score_gpt":0.2582475972855589,"score_spread":0.222427330541673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187080754","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.7060417,0.003007214,0.28172538,0.00085480296,0.0002692485,0.00013630142,0.00027705616,0.0023776977,0.0053105243],"genre_scores_gemma":[0.95848894,0.00019119283,0.039743185,0.00009141481,0.000034833614,0.000042508673,0.00026348932,0.00003168024,0.001112618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987857,0.00040010596,0.00010057746,0.00021032027,0.0002803095,0.00022301682],"domain_scores_gemma":[0.9907471,0.005895373,0.000644774,0.0005292516,0.0019545595,0.00022903684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023725089,0.0008632574,0.001318948,0.0011926378,0.00083743624,0.0010398494,0.0013190893,0.0016947815,0.0010824079],"category_scores_gemma":[0.012369568,0.00025231251,0.0003920838,0.0013202324,0.0005704573,0.0015321143,0.00070291053,0.0009042339,0.00040507686],"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.0010457545,0.00057155074,0.013930246,0.00011319672,0.00008984502,0.00008813298,0.00010816624,0.6922892,0.0029170304,0.002497263,0.0028251451,0.28352448],"study_design_scores_gemma":[0.0000050680687,0.000052817137,0.00040164593,0.0000030165775,0.000004847339,0.000014577155,0.000011972992,0.99826777,0.0008589612,0.00031009628,0.000066047425,0.000003172448],"about_ca_topic_score_codex":0.011684708,"about_ca_topic_score_gemma":0.0072133653,"teacher_disagreement_score":0.011684708,"about_ca_system_score_codex":0.001972529,"about_ca_system_score_gemma":0.0013772701,"threshold_uncertainty_score":0.023233414},"labels":[],"label_agreement":null},{"id":"W3189232707","doi":"10.1109/tnet.2021.3094839","title":"Graph-Based Namespaces and Load Sharing for Efficient Information Dissemination","year":2021,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Institute of Standards and Technology; National Science Foundation","keywords":"Computer science; Scalability; Namespace; Distributed computing; Graph; Dissemination; Load balancing (electrical power); Computer network; Workload; Theoretical computer science; Operating system; Grid","score_opus":0.016498251722111865,"score_gpt":0.24520414887140804,"score_spread":0.22870589714929618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189232707","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.016935319,0.00017494503,0.9743532,0.0002933446,0.00006028964,0.00018235906,0.00010441724,0.003153988,0.0047420715],"genre_scores_gemma":[0.39167485,0.0004602255,0.5978157,0.00019689712,0.000089634115,0.00041833575,0.0005636586,0.0005224025,0.0082584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.0003022573,0.000091944275,0.00018305228,0.0003754288,0.00010253135],"domain_scores_gemma":[0.99765116,0.0005487541,0.0002547304,0.0010255957,0.00035588306,0.0001639139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011312244,0.00047116762,0.0005391393,0.0012693645,0.001014962,0.002041724,0.0019201675,0.00082469115,0.002377539],"category_scores_gemma":[0.0033650198,0.00032674716,0.0005725744,0.0015531797,0.0010379737,0.0041296515,0.002416484,0.0009264797,0.0010691029],"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.00036838884,0.00029965313,0.0018303103,0.00038556854,0.000098509416,0.00029325488,0.0012417553,0.18208328,0.08088462,0.3375917,0.013719358,0.38120362],"study_design_scores_gemma":[0.00007759191,0.00023119025,0.0009262112,0.000033348322,0.000061780775,0.00031403903,0.00028608623,0.77447915,0.046211824,0.09968436,0.07759471,0.00009973284],"about_ca_topic_score_codex":0.0017258971,"about_ca_topic_score_gemma":0.0026392958,"teacher_disagreement_score":0.002377539,"about_ca_system_score_codex":0.0009510661,"about_ca_system_score_gemma":0.0012221605,"threshold_uncertainty_score":0.007953644},"labels":[],"label_agreement":null},{"id":"W3193395005","doi":"10.1109/jiot.2021.3097628","title":"Learning-Based Transmission Protocol Customization for VoD Streaming in Cybertwin-Enabled Next-Generation Core Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Quality of service; Goodput; Throughput; Network congestion; Provisioning; Core network; Network packet; Distributed computing; Wireless","score_opus":0.04141755293517921,"score_gpt":0.27342699067592724,"score_spread":0.23200943774074803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193395005","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.121973164,0.0003847553,0.87285185,0.00022728008,0.00008884422,0.000099888624,0.000027780401,0.00096157234,0.0033848605],"genre_scores_gemma":[0.9692536,0.00012127737,0.029647687,0.00006362038,0.000021324591,0.000036359485,0.00003007628,0.000019236119,0.0008068243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996842,0.000072576055,0.000023630315,0.00007123058,0.000090225425,0.000058189613],"domain_scores_gemma":[0.9995784,0.00012491868,0.000064455446,0.00006277845,0.0001398216,0.000029696605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058879284,0.00031449372,0.0003616316,0.00028436419,0.0003474132,0.0004690952,0.0008865699,0.00035915652,0.00049102725],"category_scores_gemma":[0.0010849744,0.000115878895,0.00022581473,0.00022539764,0.00039379683,0.00071652187,0.00050831586,0.0006838014,0.00010711275],"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.00021783647,0.00036645445,0.002272208,0.00010651793,0.00005241659,0.00032662228,0.00018925274,0.6623697,0.074306644,0.017879743,0.0023311642,0.23958144],"study_design_scores_gemma":[0.0000044723147,0.000056664336,0.00016792228,0.0000029443772,0.00000702434,0.000040517076,0.00001231837,0.9936608,0.0046462184,0.00097177114,0.00042218677,0.0000070731703],"about_ca_topic_score_codex":0.0029655825,"about_ca_topic_score_gemma":0.0031498142,"teacher_disagreement_score":0.0029655825,"about_ca_system_score_codex":0.00067870226,"about_ca_system_score_gemma":0.0006868008,"threshold_uncertainty_score":0.005896628},"labels":[],"label_agreement":null},{"id":"W3194478758","doi":"10.14722/madweb.2021.23009","title":"Empirical Scanning Analysis of Censys and Shodan","year":2021,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"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","keywords":"Computer science","score_opus":0.03609295841711972,"score_gpt":0.2878056126999547,"score_spread":0.25171265428283496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194478758","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.99144334,0.0005763862,0.0013685093,0.00027456143,0.0000066269813,0.000047359794,0.0016649507,0.000055107757,0.0045631444],"genre_scores_gemma":[0.9960742,0.00014845762,0.00086649955,0.0000607183,0.000008434014,0.000023958999,0.0019840444,0.000020404876,0.0008134287],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99614346,0.0018017536,0.00033528486,0.00054239953,0.0009330386,0.00024413648],"domain_scores_gemma":[0.8857454,0.08320896,0.010946238,0.0094412435,0.009181541,0.0014766814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005412506,0.00024513353,0.00049640745,0.0027833749,0.00061950175,0.0014702975,0.0012139591,0.0007406528,0.0038205506],"category_scores_gemma":[0.060170867,0.00023120095,0.00031653317,0.0034544903,0.0011902773,0.0019102341,0.00082136004,0.00094162405,0.0010093801],"study_design_candidate":"observational","study_design_consensus":"observational","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.00058673136,0.00046434772,0.94761777,0.00023553909,0.0001799971,0.0005057357,0.003711069,0.0038609975,0.00108875,0.005771292,0.0058675236,0.030110242],"study_design_scores_gemma":[0.000053167383,0.00030026585,0.9197179,0.00018088403,0.0001571804,0.0014390633,0.007972017,0.049173694,0.0029782916,0.0025600432,0.0153768,0.00009070023],"about_ca_topic_score_codex":0.017180363,"about_ca_topic_score_gemma":0.013543248,"teacher_disagreement_score":0.017180363,"about_ca_system_score_codex":0.0011738585,"about_ca_system_score_gemma":0.00075921573,"threshold_uncertainty_score":0.034160733},"labels":[],"label_agreement":null},{"id":"W3197054949","doi":"10.1109/tvt.2021.3109868","title":"Repair Delay Analysis of Mobile Storage Systems Using Erasure Codes and Relay Cooperation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Erasure; Relay; Erasure code; Computer science; Data loss; Reliability (semiconductor); Computer network; Base station; Path loss; Mobile device; Decoding methods; Real-time computing; Reliability engineering; Engineering; Telecommunications; Wireless","score_opus":0.012573366535521885,"score_gpt":0.2327537328803898,"score_spread":0.22018036634486793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197054949","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.30265304,0.004612043,0.6833117,0.00066353276,0.00011041238,0.00010651024,0.00026680343,0.00033747833,0.00793846],"genre_scores_gemma":[0.9886192,0.00088387757,0.008246553,0.000033981963,0.000024763913,0.000036923677,0.000055264216,0.000035091478,0.0020644746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993673,0.0001413606,0.00003226604,0.00010706613,0.00016195097,0.00019010395],"domain_scores_gemma":[0.9941401,0.0038363715,0.00072347873,0.00018133671,0.00093755114,0.00018109856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013445241,0.0009610686,0.00069451984,0.0012533284,0.0005626032,0.00097450835,0.0010297471,0.00079629273,0.0020794808],"category_scores_gemma":[0.006144274,0.00041947074,0.00061223883,0.0010316063,0.0010415884,0.0012833623,0.00082733267,0.00083736924,0.00026418042],"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.00015728596,0.000020261206,0.000775623,0.00012299824,0.000027926888,0.00014430906,0.00013145644,0.9693159,0.0042241216,0.019206578,0.00053365063,0.0053399275],"study_design_scores_gemma":[0.0000040343725,0.00003464263,0.00016584134,0.000006851608,0.000010958176,0.000037163565,0.00004248051,0.9966509,0.00074476056,0.0021216772,0.00017307808,0.00000767553],"about_ca_topic_score_codex":0.010623624,"about_ca_topic_score_gemma":0.0036614516,"teacher_disagreement_score":0.010623624,"about_ca_system_score_codex":0.003241699,"about_ca_system_score_gemma":0.0015276333,"threshold_uncertainty_score":0.02352029},"labels":[],"label_agreement":null},{"id":"W3200081493","doi":"10.1109/tit.2021.3112492","title":"A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":44,"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":"Guangxi Higher Institutions Scientific Research Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Notation; Matrix (chemical analysis); Mathematical notation; Computer science; Mathematics; Algorithm; Discrete mathematics; Combinatorics; Arithmetic","score_opus":0.01486356533431173,"score_gpt":0.23907085925973967,"score_spread":0.22420729392542793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200081493","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.0010527179,0.000055169017,0.99633515,0.000046479305,0.00002140883,0.00004866541,0.000045929348,0.0008560095,0.0015384078],"genre_scores_gemma":[0.058518622,0.00018937288,0.9369678,0.000083181425,0.000052453765,0.0002819493,0.00024604533,0.00033712198,0.00332342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979596,0.0005163797,0.00015716343,0.000495167,0.0006174801,0.0002542162],"domain_scores_gemma":[0.99781215,0.0004862217,0.00017047246,0.00089401804,0.0005362361,0.0001009029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016513002,0.0011103029,0.0013295816,0.001103075,0.0015298321,0.0037124397,0.0040199556,0.0016258917,0.00697046],"category_scores_gemma":[0.005809066,0.00095608755,0.0014221545,0.002201974,0.0017975885,0.0033728017,0.0032261668,0.0021803023,0.002617695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00018564225,0.000095312105,0.0006992344,0.00026112888,0.00004895623,0.00025831885,0.000555627,0.26126802,0.0115344655,0.55138284,0.009371258,0.16433924],"study_design_scores_gemma":[0.000048069585,0.000108655695,0.00013118384,0.000056446494,0.00004447516,0.00016381616,0.00014405652,0.8397217,0.009779564,0.119525716,0.03020744,0.0000688919],"about_ca_topic_score_codex":0.0065154023,"about_ca_topic_score_gemma":0.005348885,"teacher_disagreement_score":0.00697046,"about_ca_system_score_codex":0.0028126235,"about_ca_system_score_gemma":0.0032287685,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W3200962337","doi":"10.1007/s10586-021-03395-0","title":"Replication management in peer-to-peer cloud storage systems","year":2021,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"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; Replication (statistics); Cloud computing; Cloud storage; Distributed computing; Load balancing (electrical power); Computer data storage; Peer-to-peer; Popularity; Computer network; Data management; Database; Operating system","score_opus":0.02324836695857902,"score_gpt":0.2641101334585464,"score_spread":0.24086176649996738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200962337","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.32198393,0.011565961,0.64422333,0.0040375274,0.0010980397,0.0005595547,0.00048306584,0.0045946427,0.011454015],"genre_scores_gemma":[0.96125114,0.001048138,0.03364386,0.00009136091,0.00024117932,0.00008500924,0.0001522848,0.00012822224,0.0033587771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973781,0.0007383335,0.00027316337,0.00042173782,0.000879757,0.00030897753],"domain_scores_gemma":[0.99193794,0.0030013844,0.000719693,0.0017813696,0.0021278355,0.00043178885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003404343,0.00043982427,0.0013148254,0.0009388778,0.0026013511,0.0034434933,0.0028593743,0.0014932296,0.0014454921],"category_scores_gemma":[0.010863671,0.00058173423,0.0003475568,0.0015517126,0.0010653842,0.0037756485,0.0014363431,0.000987108,0.0004857761],"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.0011442987,0.0005605233,0.010417573,0.00093894836,0.00034209865,0.0016627376,0.0025793072,0.4362907,0.05465577,0.15573423,0.027875714,0.307798],"study_design_scores_gemma":[0.000068804206,0.00015359186,0.001448034,0.000042410553,0.00009387789,0.0005321162,0.0006103015,0.9244345,0.010930892,0.05224753,0.009368399,0.00006957543],"about_ca_topic_score_codex":0.009160543,"about_ca_topic_score_gemma":0.006639584,"teacher_disagreement_score":0.009160543,"about_ca_system_score_codex":0.0019636312,"about_ca_system_score_gemma":0.0023119575,"threshold_uncertainty_score":0.018214464},"labels":[],"label_agreement":null},{"id":"W3202596384","doi":"10.23919/wiopt52861.2021.9589876","title":"Memory-Rate Tradeoff for Decentralized Caching under Nonuniform File Popularity","year":2021,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ontario Tech University","funders":"","keywords":"Computer science; Upper and lower bounds; Cache; Optimization problem; Mathematical optimization; Point (geometry); Convergence (economics); Scheme (mathematics); Parallel computing; Algorithm; Mathematics","score_opus":0.02770560743619066,"score_gpt":0.24790935461421054,"score_spread":0.22020374717801988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202596384","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.26890343,0.0007203772,0.72417724,0.00048640356,0.00003409423,0.00005566551,0.00012725167,0.00027496257,0.0052205687],"genre_scores_gemma":[0.97420734,0.00023780909,0.024421263,0.000039151764,0.00002279983,0.000046337656,0.00004635158,0.000033878598,0.00094509294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991242,0.0002791923,0.00003216861,0.00015487254,0.0002209604,0.00018858425],"domain_scores_gemma":[0.994802,0.0034640797,0.0005515041,0.00054609735,0.0005140542,0.00012222344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015421397,0.000576429,0.0010440114,0.00046923096,0.00049639045,0.0008775653,0.0013583563,0.0008059595,0.0012316938],"category_scores_gemma":[0.010596244,0.0002754062,0.00034873871,0.0010436792,0.00074960757,0.0022758858,0.0008700047,0.000761881,0.00015373659],"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.00016272825,0.000052451705,0.0011868039,0.00008328865,0.000023698653,0.00012477498,0.00007797072,0.945294,0.0069247517,0.030096848,0.0007902792,0.015182458],"study_design_scores_gemma":[0.00000786832,0.000030774507,0.00019504735,0.0000027867206,0.0000051500483,0.00004012168,0.000015399886,0.9943423,0.0012176837,0.0040101944,0.00012684532,0.000005844513],"about_ca_topic_score_codex":0.0030658979,"about_ca_topic_score_gemma":0.0030275974,"teacher_disagreement_score":0.0030658979,"about_ca_system_score_codex":0.0015963749,"about_ca_system_score_gemma":0.0011018435,"threshold_uncertainty_score":0.011582553},"labels":[],"label_agreement":null},{"id":"W3209234001","doi":"10.3390/e23111459","title":"Cryptography in Hierarchical Coded Caching: System Model and Cost Analysis","year":2021,"lang":"en","type":"article","venue":"Entropy","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"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 Guelph","funders":"","keywords":"Computer science; Computer network; Cache; Throughput; Transmission (telecommunications); Simple (philosophy); Multiplicative function; Cryptography; Service (business); Distributed computing; Computer security; Wireless; Operating system; Telecommunications","score_opus":0.01331067537641045,"score_gpt":0.22782997527646448,"score_spread":0.21451929990005403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209234001","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.12022295,0.0022875136,0.8354652,0.0023105808,0.00011928219,0.0002888437,0.00066014664,0.00038426553,0.03826128],"genre_scores_gemma":[0.95947707,0.0013041643,0.023604773,0.00016100303,0.000109340195,0.00020640201,0.0001604399,0.00008495728,0.014891916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848205,0.0005702375,0.000039890183,0.00015936168,0.00039429023,0.0003541661],"domain_scores_gemma":[0.9933314,0.004528564,0.00064020406,0.00041393223,0.00091783266,0.00016810081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020902816,0.0014870578,0.0017203989,0.0016134215,0.0010827988,0.0028358488,0.002682419,0.0024988556,0.0074703596],"category_scores_gemma":[0.007708964,0.00076299085,0.0010059347,0.0017592694,0.0023244063,0.004278883,0.0021813326,0.0023081242,0.0012015393],"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.00007794325,0.000047965612,0.00051274744,0.00007956987,0.00002553467,0.00017478524,0.00010914254,0.7567355,0.0015530905,0.23398268,0.0018412764,0.0048597646],"study_design_scores_gemma":[0.0000054726124,0.000013448684,0.00009252719,0.000007875656,0.000008761705,0.000055711247,0.000018041917,0.9783181,0.00015682034,0.021060366,0.00025242328,0.000010464461],"about_ca_topic_score_codex":0.006868727,"about_ca_topic_score_gemma":0.0047897655,"teacher_disagreement_score":0.0074703596,"about_ca_system_score_codex":0.0060529476,"about_ca_system_score_gemma":0.0019446383,"threshold_uncertainty_score":0.043917358},"labels":[],"label_agreement":null},{"id":"W3211570189","doi":"10.1109/tmm.2021.3125803","title":"Towards Real-Time Video Caching at Edge Servers: A Cost-Aware Deep Q-Learning Solution","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Server; Cache; Popularity; Enhanced Data Rates for GSM Evolution; Context (archaeology); Computer network; Video quality; Quality of service; Artificial intelligence","score_opus":0.019707513507182903,"score_gpt":0.2438425595940053,"score_spread":0.2241350460868224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211570189","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.072366074,0.0011209553,0.9219203,0.001041885,0.000091307054,0.000090788155,0.00015057347,0.0006920226,0.0025260444],"genre_scores_gemma":[0.8723738,0.0003601733,0.123035975,0.0006734624,0.00009476437,0.00012272665,0.00031791074,0.00008889216,0.0029323227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00012983332,0.000030210234,0.00015580533,0.00008775474,0.0001323337],"domain_scores_gemma":[0.9976216,0.0014491252,0.00017470571,0.00012662877,0.00048579284,0.00014208053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014813282,0.0008991045,0.0016901909,0.000451656,0.00043827135,0.0008384466,0.0025269326,0.001769182,0.0018599887],"category_scores_gemma":[0.00411547,0.00048072415,0.00051429926,0.00084961264,0.0008486179,0.0017024355,0.0011219558,0.0016921624,0.00024553703],"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.00018787612,0.00026091927,0.0018677504,0.00009951217,0.000049644634,0.00008809533,0.000061377046,0.89382344,0.0013654865,0.005806108,0.003097685,0.09329221],"study_design_scores_gemma":[0.0000069977577,0.000011995838,0.000046437744,0.0000024036128,0.0000032877783,0.000005036817,0.0000040078576,0.9982316,0.00010295927,0.0015018685,0.000081949394,0.0000015768961],"about_ca_topic_score_codex":0.021800814,"about_ca_topic_score_gemma":0.015503183,"teacher_disagreement_score":0.021800814,"about_ca_system_score_codex":0.0018035141,"about_ca_system_score_gemma":0.0028077692,"threshold_uncertainty_score":0.043347836},"labels":[],"label_agreement":null},{"id":"W3211937876","doi":"10.48550/arxiv.1701.06884","title":"Combination Networks with End-user-caches: Novel Achievable and Converse\\n Bounds under Uncoded Cache Placement","year":2017,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Converse; Computer science; Cache; Linear network coding; Computer network; Upper and lower bounds; CPU cache; Mathematics; Network packet","score_opus":0.06834338848647915,"score_gpt":0.17982056285572368,"score_spread":0.11147717436924452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211937876","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.07368355,0.0055984203,0.85502654,0.0030744162,0.0003439853,0.00020672972,0.00069967314,0.00068446156,0.060682252],"genre_scores_gemma":[0.90164566,0.004882221,0.081844635,0.0011160604,0.0006223879,0.0005144523,0.000535553,0.00019025498,0.008648829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950553,0.0015698234,0.00017421276,0.00066383684,0.0013770328,0.0011596703],"domain_scores_gemma":[0.9682369,0.02374561,0.0020343985,0.001935746,0.0030229609,0.001024392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049109133,0.004246375,0.0027241418,0.0023095643,0.0026692778,0.005631723,0.0037322715,0.0029739283,0.0044535603],"category_scores_gemma":[0.02698363,0.0017002214,0.0016446954,0.0026594617,0.0048828167,0.0088843955,0.008480262,0.0050429273,0.001249666],"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.00094694505,0.0003185729,0.0019152217,0.0011489841,0.00023952262,0.0015815633,0.0011355979,0.4673027,0.016048606,0.45740214,0.013330399,0.03862976],"study_design_scores_gemma":[0.000028707287,0.00015169175,0.0002589149,0.00014505677,0.00011246295,0.0006553475,0.00021371678,0.84652686,0.0046362397,0.14382453,0.003348985,0.00009746297],"about_ca_topic_score_codex":0.002892971,"about_ca_topic_score_gemma":0.00368694,"teacher_disagreement_score":0.005631723,"about_ca_system_score_codex":0.0043573505,"about_ca_system_score_gemma":0.0020969983,"threshold_uncertainty_score":0.03161496},"labels":[],"label_agreement":null},{"id":"W4200401992","doi":"10.1109/smartcloud52277.2021.00013","title":"Optimizing the Performance of Web Applications in Mobile Cloud Computing","year":2021,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Winnipeg","funders":"","keywords":"Computer science; Cloud computing; Mobile cloud computing; Computer network; Scalability; Mobile computing; Cache; Distributed computing; Mobile device; Database; Operating system","score_opus":0.013579010058142587,"score_gpt":0.23092947746759454,"score_spread":0.21735046740945196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200401992","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.95599395,0.0021941145,0.03276131,0.00032021123,0.00006427965,0.00013758933,0.000110149274,0.0018165266,0.0066019204],"genre_scores_gemma":[0.9885949,0.00038259316,0.010248303,0.000044238415,0.000017920258,0.000018803978,0.00007646848,0.000073547926,0.00054326945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989391,0.00022647376,0.00006509854,0.00010955336,0.00035199284,0.0003077424],"domain_scores_gemma":[0.9984469,0.0005614137,0.00016592833,0.00018551042,0.00047448065,0.00016590222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488383,0.0008678892,0.00071086205,0.0007238552,0.0008744185,0.0017674405,0.000737221,0.00065649825,0.00067106384],"category_scores_gemma":[0.0033702257,0.00026442358,0.00024008185,0.0011855627,0.00035223507,0.001240074,0.00046302137,0.00050271704,0.0005621508],"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.0025673793,0.0014709561,0.024618128,0.00056117214,0.00019175418,0.0014032972,0.00031111008,0.35050228,0.33255133,0.0043113804,0.005542266,0.27596897],"study_design_scores_gemma":[0.00005346546,0.0006335689,0.008987534,0.000026737509,0.000071676695,0.0002034134,0.00019390878,0.9122711,0.07427276,0.0012328083,0.0020176007,0.00003552107],"about_ca_topic_score_codex":0.008327556,"about_ca_topic_score_gemma":0.008744768,"teacher_disagreement_score":0.008327556,"about_ca_system_score_codex":0.0009998226,"about_ca_system_score_gemma":0.0010443476,"threshold_uncertainty_score":0.01655817},"labels":[],"label_agreement":null},{"id":"W4200451818","doi":"10.1007/978-3-030-88878-7_3","title":"Delay-Minimized Mobile Edge Caching in the Terrestrial HetVNet","year":2021,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Cache; Linear network coding; White spaces; Base station; Coding (social sciences); Cellular network; Enhanced Data Rates for GSM Evolution; Integer programming; Content centric networking; Scheme (mathematics); Distributed computing; Wireless; Algorithm; Telecommunications","score_opus":0.02497564638987004,"score_gpt":0.24545827266883816,"score_spread":0.2204826262789681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200451818","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.16017978,0.012730191,0.76084757,0.0012022854,0.00054034474,0.00008551158,0.0010167597,0.0011795699,0.062217984],"genre_scores_gemma":[0.9320454,0.0033595255,0.04324287,0.00015613108,0.00015457752,0.000027980748,0.00026632217,0.00013319265,0.02061412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998153,0.000042175416,0.000005355379,0.000027087885,0.00004854305,0.00006163119],"domain_scores_gemma":[0.9997156,0.00014242249,0.000017728224,0.000030161784,0.00007596728,0.000018076691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022882063,0.0005153563,0.0009251966,0.00031655547,0.00041787428,0.0010760028,0.0010370342,0.00055059197,0.0031824366],"category_scores_gemma":[0.00073738885,0.00024691274,0.00017549205,0.0013632417,0.0003852788,0.00075579516,0.0004692021,0.00038167232,0.00052141305],"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.00055916375,0.00008255094,0.0009037213,0.0002693693,0.000058127833,0.0003457375,0.000112300746,0.75930655,0.02166346,0.0686615,0.023527343,0.124510095],"study_design_scores_gemma":[0.0000124564485,0.00011122457,0.0004630993,0.00002559766,0.000031779182,0.0002721861,0.00006840738,0.9765313,0.002781406,0.014453214,0.005232608,0.00001660471],"about_ca_topic_score_codex":0.007318135,"about_ca_topic_score_gemma":0.0120798545,"teacher_disagreement_score":0.007318135,"about_ca_system_score_codex":0.0011544373,"about_ca_system_score_gemma":0.0008306401,"threshold_uncertainty_score":0.014551103},"labels":[],"label_agreement":null},{"id":"W4205148537","doi":"10.1007/978-3-030-86356-2_16","title":"On Computing in the Network: Covid-19 Coughs Detection Case Study","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Edge computing; Cloud computing; Quality of service; Latency (audio); Enhanced Data Rates for GSM Evolution; Mist; Edge device; Computer network; Distributed computing; Operating system; Artificial intelligence; Telecommunications","score_opus":0.03593698811021508,"score_gpt":0.2800680999908639,"score_spread":0.24413111188064882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205148537","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.850462,0.0018675381,0.05266884,0.0050101485,0.00020746564,0.0007191718,0.0018356247,0.0006881351,0.086541034],"genre_scores_gemma":[0.96235436,0.0006722362,0.025606558,0.0003032426,0.00006051447,0.00008860906,0.0007241097,0.0000829484,0.010107595],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978362,0.00063525385,0.00010564265,0.00029289039,0.00064617576,0.000483874],"domain_scores_gemma":[0.99273527,0.004467491,0.00036094154,0.0006365965,0.0012230792,0.0005765904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015661123,0.00049428886,0.00051397097,0.0013631689,0.0026469573,0.0020575693,0.0014414424,0.0033609106,0.0030588736],"category_scores_gemma":[0.008537249,0.00029171974,0.00038760024,0.0027654476,0.0012375755,0.0021351064,0.001311513,0.0011241189,0.00053938606],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024963298,0.0047540553,0.209255,0.0013368576,0.00026946506,0.03397255,0.008646371,0.12050577,0.014718793,0.12596947,0.10247021,0.3756051],"study_design_scores_gemma":[0.00025352728,0.0013942446,0.050631013,0.0004334316,0.00022036603,0.021920566,0.018832205,0.72280234,0.029004555,0.04425372,0.11007734,0.00017678645],"about_ca_topic_score_codex":0.027528668,"about_ca_topic_score_gemma":0.03300167,"teacher_disagreement_score":0.027528668,"about_ca_system_score_codex":0.001807696,"about_ca_system_score_gemma":0.0014617633,"threshold_uncertainty_score":0.054736853},"labels":[],"label_agreement":null},{"id":"W4205823760","doi":"10.1109/tmm.2021.3132156","title":"Caching in Dynamic Environments: A Near-Optimal Online Learning Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Regret; Dynamic web page; Sublinear function; Popularity; The Internet; Artificial intelligence; World Wide Web; Machine learning; Web page","score_opus":0.013097787125850736,"score_gpt":0.23073989068507492,"score_spread":0.21764210355922417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205823760","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.032449614,0.0009307814,0.9587113,0.0014431701,0.00009737474,0.0000886372,0.00012662182,0.0005403187,0.0056121903],"genre_scores_gemma":[0.8518485,0.000829021,0.13761246,0.00075814576,0.00039209749,0.0002662944,0.0003405603,0.00016611314,0.0077868477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865216,0.0005374855,0.00006112513,0.00030116353,0.0002040497,0.00024415358],"domain_scores_gemma":[0.9909017,0.007422808,0.00048565335,0.00032185836,0.00058620604,0.00028173023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647024,0.0014252017,0.002986203,0.0009585795,0.00081764255,0.0016929962,0.0033325648,0.0030071195,0.0032749013],"category_scores_gemma":[0.009978331,0.0009321563,0.0008239379,0.0011880306,0.0016942685,0.0026613215,0.001910336,0.0023611125,0.00047281542],"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.00008191231,0.00013341228,0.0005130938,0.000062233936,0.000043371776,0.00005540028,0.000035268204,0.9680475,0.00014308136,0.012760228,0.0011997364,0.016924638],"study_design_scores_gemma":[0.0000075679327,0.000012483482,0.00002588918,0.0000029675678,0.0000037202972,0.0000043540954,0.0000039977836,0.99594384,0.000032739626,0.0038580578,0.0001018148,0.0000026251132],"about_ca_topic_score_codex":0.009525535,"about_ca_topic_score_gemma":0.006704486,"teacher_disagreement_score":0.009525535,"about_ca_system_score_codex":0.002173669,"about_ca_system_score_gemma":0.0025884213,"threshold_uncertainty_score":0.01894021},"labels":[],"label_agreement":null},{"id":"W4206275890","doi":"10.1109/tnse.2021.3132556","title":"Ensuring Profit and QoS When Dynamically Embedding Delay-Constrained ICN and IP Slices for Content Delivery","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Agence Nationale de la Recherche","keywords":"Computer science; Quality of service; Computer network; Profit maximization; The Internet; Embedding; Integer programming; Profit (economics); Content delivery; Distributed computing; Algorithm","score_opus":0.018528268708078836,"score_gpt":0.2103121408699017,"score_spread":0.19178387216182285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206275890","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.24643202,0.00073088333,0.7393293,0.0006040513,0.00007464236,0.00024344302,0.0001246365,0.00046815738,0.011992963],"genre_scores_gemma":[0.9073463,0.0002997195,0.0910711,0.00004888579,0.000015815622,0.000040030227,0.000050442886,0.000053117583,0.0010746191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.00015601014,0.000018347258,0.00006025032,0.00010044771,0.0001890418],"domain_scores_gemma":[0.9991561,0.000428575,0.00012189513,0.00007622781,0.00011309693,0.00010411348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271797,0.00089790515,0.0005178257,0.0003907262,0.0007152474,0.0011787361,0.0007342656,0.0006962061,0.0011256321],"category_scores_gemma":[0.002135836,0.0002657862,0.00022772845,0.00047738766,0.0005318928,0.0014030186,0.00080284604,0.0005722203,0.00014917407],"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.00016431836,0.00012195858,0.0014205449,0.000111153895,0.00002383864,0.00033469216,0.0001082397,0.89380467,0.018188119,0.019353397,0.0015487487,0.06482034],"study_design_scores_gemma":[0.0000139009535,0.00011637517,0.00035231354,0.000014043395,0.000021257012,0.00015449864,0.00017192066,0.98073375,0.0073216604,0.009430993,0.0016578757,0.000011485016],"about_ca_topic_score_codex":0.0039878455,"about_ca_topic_score_gemma":0.005864624,"teacher_disagreement_score":0.0039878455,"about_ca_system_score_codex":0.0016443447,"about_ca_system_score_gemma":0.0020132698,"threshold_uncertainty_score":0.011930585},"labels":[],"label_agreement":null},{"id":"W4206534637","doi":"10.1109/jiot.2021.3134964","title":"Real-Time Search-Driven Caching for Sensing Data in Vehicular Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"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 Waterloo; McMaster University","funders":"Natural Science Foundation of Hunan Province; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Cache; Search engine indexing; Benchmark (surveying); Telecommunications link; Process (computing); Distributed computing; Resource allocation; Cloud computing; Computer network; Information retrieval","score_opus":0.036400908206654745,"score_gpt":0.2774925794287073,"score_spread":0.24109167122205255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206534637","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.17474584,0.0015545788,0.81995475,0.00035602378,0.000054838085,0.000055773628,0.00008610967,0.00054162287,0.0026505173],"genre_scores_gemma":[0.9826096,0.00016188814,0.016626254,0.000027134998,0.00000870129,0.000023088196,0.00004049632,0.000012308655,0.00049060123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996315,0.00011138726,0.000022957274,0.00006145208,0.00007729091,0.00009524823],"domain_scores_gemma":[0.9987808,0.00070735964,0.00012737275,0.00010453584,0.0001970757,0.00008287481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077338493,0.00038683743,0.0008123229,0.00037330418,0.00040988286,0.00066125457,0.0014083466,0.00065809756,0.00044426048],"category_scores_gemma":[0.0026166358,0.00021832697,0.00033887877,0.000623045,0.0005600002,0.0009917133,0.0006026536,0.0005530925,0.00006654731],"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.000066173845,0.000030625262,0.00080381567,0.000037335845,0.000014164603,0.00004585394,0.000031815754,0.9743119,0.0013582259,0.0039423346,0.00040013308,0.01895767],"study_design_scores_gemma":[0.0000019136783,0.0000072060056,0.000054527918,9.4213715e-7,0.0000018998093,0.0000053201547,0.000003840543,0.9990521,0.00018639275,0.00063404965,0.00005038845,0.0000014772423],"about_ca_topic_score_codex":0.024904706,"about_ca_topic_score_gemma":0.019245947,"teacher_disagreement_score":0.024904706,"about_ca_system_score_codex":0.0013068196,"about_ca_system_score_gemma":0.0016661087,"threshold_uncertainty_score":0.04951948},"labels":[],"label_agreement":null},{"id":"W4210321152","doi":"10.1109/globecom46510.2021.9685872","title":"A GNN-based Approach to Optimize Cache Hit Ratio in NDN Networks","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":15,"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; University of Ottawa","funders":"","keywords":"Computer science; Cache; Computer network; Latency (audio); Node (physics); Workload; False sharing; Cache algorithms; CPU cache; Operating system","score_opus":0.059842611684011754,"score_gpt":0.2807018240140678,"score_spread":0.22085921233005604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210321152","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.1267924,0.0009952275,0.8642389,0.0005421162,0.00008500516,0.00007651855,0.00021731226,0.001363129,0.005689346],"genre_scores_gemma":[0.92064863,0.00022278047,0.07629215,0.00014356257,0.00002642526,0.00004835356,0.00019888757,0.00007146193,0.0023476726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976414,0.000046576595,0.000013181759,0.000059490732,0.00006165344,0.000055005454],"domain_scores_gemma":[0.9995277,0.00016876125,0.000052482865,0.000033012006,0.00018842935,0.000029741834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052732736,0.0006054516,0.000571341,0.0006407007,0.00037087366,0.0006502099,0.0012995673,0.00068086607,0.0009610013],"category_scores_gemma":[0.0018695545,0.00022261983,0.000268069,0.00069732364,0.0003884223,0.0010318982,0.0005071034,0.0004821587,0.00015272305],"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.000063287596,0.000045686356,0.0013987026,0.000036018082,0.000028056236,0.000056121487,0.000023025248,0.948848,0.003937143,0.00335676,0.0011742278,0.04103281],"study_design_scores_gemma":[0.0000016281704,0.000008159397,0.00007406879,0.0000012890234,0.000004671248,0.0000073755714,0.0000029410776,0.99858665,0.00042472334,0.00078719633,0.00009970372,0.0000016632896],"about_ca_topic_score_codex":0.019716958,"about_ca_topic_score_gemma":0.03128956,"teacher_disagreement_score":0.019716958,"about_ca_system_score_codex":0.002200089,"about_ca_system_score_gemma":0.0011136476,"threshold_uncertainty_score":0.03920436},"labels":[],"label_agreement":null},{"id":"W4210427263","doi":"10.1109/globecom46510.2021.9685928","title":"Learning-based Cache Placement and Content Delivery for Satellite-Terrestrial Integrated Networks","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Global Communications Conference (GLOBECOM)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Backhaul (telecommunications); Markov decision process; Content delivery; Benchmark (surveying); Key (lock); Content delivery network; Computer network; Distributed computing; Markov process; Server; Base station; Operating system","score_opus":0.08690335063813394,"score_gpt":0.28487472653727625,"score_spread":0.19797137589914232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210427263","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.17271455,0.001119208,0.82172745,0.0007992119,0.00008042505,0.00008603296,0.00013194293,0.0006176297,0.00272346],"genre_scores_gemma":[0.95301306,0.00026175595,0.044055723,0.00016264536,0.000031791777,0.000066024164,0.00012990092,0.000032615924,0.002246404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997098,0.00007304879,0.000013381605,0.000073075054,0.000052744734,0.000077912046],"domain_scores_gemma":[0.998988,0.00062192074,0.000122000674,0.000038905724,0.000156253,0.000073041374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009576273,0.0005631861,0.00090288656,0.00033497278,0.00036657415,0.0005585457,0.001379959,0.00090737327,0.0012660887],"category_scores_gemma":[0.0027762584,0.00036869576,0.0002918079,0.0005843769,0.00062999694,0.0010395626,0.0007520696,0.0010841861,0.0001389209],"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.000072037205,0.00007101383,0.0008623156,0.00003336754,0.000015703452,0.00002718452,0.000019735142,0.97003627,0.0006409395,0.0022468346,0.0007200908,0.02525455],"study_design_scores_gemma":[0.000003578343,0.000010138005,0.000038260976,8.674551e-7,0.0000021831438,0.000002155336,0.000002042313,0.9992656,0.0001106107,0.00052748184,0.00003645036,7.316521e-7],"about_ca_topic_score_codex":0.01984297,"about_ca_topic_score_gemma":0.01681513,"teacher_disagreement_score":0.01984297,"about_ca_system_score_codex":0.0019623814,"about_ca_system_score_gemma":0.0022699977,"threshold_uncertainty_score":0.039454937},"labels":[],"label_agreement":null},{"id":"W4214926007","doi":"10.1145/3510449","title":"Binary Fuse Filters: Fast and Smaller Than Xor Filters","year":2022,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Bloom filter; Cuckoo; Binary number; Fuse (electrical); Computer science; Cuckoo search; Algorithm; Upper and lower bounds; Quotient; Mathematics; Arithmetic; Engineering; Electrical engineering","score_opus":0.020872648572750205,"score_gpt":0.24265433205716438,"score_spread":0.22178168348441418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214926007","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.12287324,0.0021281794,0.84677607,0.0010853683,0.00024478917,0.00048459382,0.0009940555,0.009217025,0.016196761],"genre_scores_gemma":[0.5734394,0.0008799904,0.4112615,0.0006120712,0.00015650677,0.00030198813,0.0013607563,0.00054247404,0.01144533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970541,0.0003179837,0.00019460882,0.00036890502,0.0016851245,0.00037929116],"domain_scores_gemma":[0.9915338,0.0032230704,0.00077285623,0.0021833119,0.0019577753,0.00032921607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024231214,0.0008470018,0.0013176284,0.0019475697,0.0015355744,0.0034366336,0.001675751,0.0019562505,0.006701977],"category_scores_gemma":[0.014074924,0.000586473,0.000790067,0.002233915,0.0011678454,0.008185149,0.0020828994,0.0012825845,0.0020159772],"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.0025223843,0.00040509054,0.006339058,0.00047250572,0.00014562483,0.00017186573,0.00061246287,0.057098154,0.06588234,0.1562636,0.02844092,0.68164593],"study_design_scores_gemma":[0.0002195841,0.00076047826,0.0030388613,0.0001524574,0.000157747,0.0008236592,0.00043196965,0.69934696,0.11731863,0.11323297,0.064329684,0.00018705838],"about_ca_topic_score_codex":0.01176799,"about_ca_topic_score_gemma":0.009167544,"teacher_disagreement_score":0.01176799,"about_ca_system_score_codex":0.004004656,"about_ca_system_score_gemma":0.0026467268,"threshold_uncertainty_score":0.029055953},"labels":[],"label_agreement":null},{"id":"W4221138932","doi":"10.1109/tvt.2022.3199677","title":"A Deep Reinforcement Learning-Based Caching Strategy for IoT Networks With Transient Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Reinforcement learning; Cache; Computer network; Energy consumption; Quality of service; Enhanced Data Rates for GSM Evolution; Distributed computing; Scheme (mathematics); Edge computing; Transient (computer programming); Internet of Things; Efficient energy use; Artificial intelligence; Embedded system; Engineering","score_opus":0.02363732700672317,"score_gpt":0.23777767269035438,"score_spread":0.21414034568363122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221138932","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.053511135,0.00066799956,0.9415496,0.00035082767,0.00009190282,0.000047043337,0.00006166475,0.0007484594,0.0029714052],"genre_scores_gemma":[0.9563375,0.00018459532,0.040296983,0.00020954589,0.00003249854,0.000065673405,0.00008734664,0.000038429826,0.002747465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997559,0.000048032158,0.000015870351,0.00006372495,0.000050752296,0.00006571306],"domain_scores_gemma":[0.99935216,0.00026170004,0.00007940796,0.000047918253,0.00019447468,0.00006437513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097168,0.00056704675,0.00093801005,0.00029882556,0.00034221646,0.00051663583,0.0014457895,0.0007885461,0.001378788],"category_scores_gemma":[0.0017801387,0.00025402824,0.00037576264,0.00037881333,0.00052550394,0.0009305315,0.00065751135,0.00079981185,0.00022734751],"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.00015057495,0.00013214869,0.001492044,0.00007767673,0.000045673896,0.00011465445,0.00006585413,0.8953986,0.0039646993,0.006417887,0.0027979722,0.08934224],"study_design_scores_gemma":[0.0000048781053,0.000013029522,0.000041521784,0.000002002463,0.000003612069,0.0000065984395,0.0000026286955,0.99901175,0.0001776986,0.0006425815,0.00009159056,0.0000020849125],"about_ca_topic_score_codex":0.011169033,"about_ca_topic_score_gemma":0.010676887,"teacher_disagreement_score":0.011169033,"about_ca_system_score_codex":0.0010406049,"about_ca_system_score_gemma":0.0012897116,"threshold_uncertainty_score":0.022208095},"labels":[],"label_agreement":null},{"id":"W4223484661","doi":"10.1155/2022/6903450","title":"A Content Dissemination Technique Based on Priority to Improve Quality of Service of Vehicular Ad Hoc Networks","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Centennial College","funders":"King Saud University","keywords":"Computer science; Computer network; Quality of service; Cloud computing; Mobile ad hoc network; Network packet; The Internet; Wireless ad hoc network; Dissemination; Content delivery; Service (business); Vehicular ad hoc network; Wireless; World Wide Web; Telecommunications","score_opus":0.014939098907517618,"score_gpt":0.27242291609394115,"score_spread":0.25748381718642355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4223484661","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.028052688,0.0031199763,0.96309084,0.00031132976,0.00045794292,0.00021832685,0.00006954249,0.0010678008,0.0036115658],"genre_scores_gemma":[0.6763663,0.0025511617,0.31632254,0.00026484748,0.0003570076,0.00017337345,0.00024776254,0.00013686839,0.0035801088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992286,0.00013287179,0.000053849144,0.00012561445,0.00035968432,0.00009930146],"domain_scores_gemma":[0.9986203,0.00036853526,0.000112163674,0.000118154785,0.0006927997,0.00008809178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180021,0.00068188785,0.0007247708,0.0018358855,0.0008794813,0.0009305776,0.0013345019,0.00052247825,0.000803056],"category_scores_gemma":[0.0027802403,0.00024362022,0.0005038477,0.0014406774,0.00037208977,0.0015809746,0.00071590074,0.0007878735,0.00026873816],"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.0005728944,0.00032243942,0.0026868954,0.0007085534,0.00016206077,0.0006080287,0.00056533463,0.08903526,0.186915,0.030558951,0.010004986,0.67785966],"study_design_scores_gemma":[0.00018515863,0.0008328949,0.0014628861,0.00006525323,0.00020948611,0.0011967362,0.00022032882,0.8958813,0.06084062,0.008790293,0.030193366,0.00012164767],"about_ca_topic_score_codex":0.0036706512,"about_ca_topic_score_gemma":0.0032013478,"teacher_disagreement_score":0.0036706512,"about_ca_system_score_codex":0.0009324596,"about_ca_system_score_gemma":0.0011591181,"threshold_uncertainty_score":0.0072985888},"labels":[],"label_agreement":null},{"id":"W4224096756","doi":"10.1016/j.jpdc.2022.04.012","title":"Coordinate-based efficient indexing mechanism for intelligent IoT systems in heterogeneous edge computing","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Search engine indexing; Latency (audio); Server; Edge device; Distributed computing; Node (physics); Cloud computing; Operating system","score_opus":0.022555593930466314,"score_gpt":0.24663818719179215,"score_spread":0.22408259326132585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224096756","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.12665388,0.0013242809,0.8453172,0.0003769362,0.0003724176,0.0003218693,0.0006733201,0.010725929,0.014234204],"genre_scores_gemma":[0.8903482,0.00028875793,0.10291201,0.00011212821,0.00012067518,0.00013932706,0.00086883816,0.00021551346,0.004994552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990953,0.0001224362,0.00010766467,0.00018403846,0.00031598812,0.00017458759],"domain_scores_gemma":[0.9982798,0.00021245997,0.00013546764,0.00073295296,0.00050898007,0.00013034407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008896798,0.00061781623,0.0011860325,0.001464154,0.0018747385,0.0033154674,0.0027440654,0.00077938876,0.004293081],"category_scores_gemma":[0.002165459,0.00035637696,0.00040800462,0.0019153438,0.0005935636,0.003461686,0.0020932558,0.00067618047,0.0014583583],"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.0033187058,0.0011411386,0.011429405,0.0005550913,0.0003241786,0.001171036,0.0015598758,0.10605404,0.18489227,0.19091345,0.051671393,0.44696933],"study_design_scores_gemma":[0.00015569861,0.00036420266,0.0020543607,0.000024047336,0.00019587381,0.0005013282,0.00038843314,0.87867785,0.06958387,0.027603956,0.020337915,0.00011255094],"about_ca_topic_score_codex":0.003351191,"about_ca_topic_score_gemma":0.0033205952,"teacher_disagreement_score":0.004293081,"about_ca_system_score_codex":0.0011018073,"about_ca_system_score_gemma":0.0016238666,"threshold_uncertainty_score":0.014361799},"labels":[],"label_agreement":null},{"id":"W4225849263","doi":"10.1109/access.2022.3158753","title":"Mapping Applications Intents to Programmable NDN Data-Planes via Event-B Machines","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Semantics (computer science); Event (particle physics); Forwarding plane; Computer network; Distributed computing; Content delivery; Programming language","score_opus":0.06508792739659432,"score_gpt":0.32301190358607434,"score_spread":0.25792397618948004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225849263","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.012465129,0.00003787225,0.9815638,0.00015139037,0.00003203796,0.00012736657,0.00010845166,0.0022532104,0.0032608062],"genre_scores_gemma":[0.43330598,0.00023944881,0.5602687,0.00017904025,0.000041308736,0.00044743204,0.00049434736,0.00038460144,0.0046391743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889946,0.000353941,0.00010276242,0.00020696627,0.00033896804,0.000097878874],"domain_scores_gemma":[0.9987198,0.00056952966,0.00014121135,0.00035929278,0.00014742534,0.00006277802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012849107,0.00064409035,0.000371432,0.00047951657,0.00044741883,0.0024057855,0.0014898621,0.000887758,0.0022289876],"category_scores_gemma":[0.0038123387,0.00046473125,0.0010139903,0.00033096832,0.0012188915,0.0028548287,0.0015325602,0.0015906472,0.00069560524],"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.00024954724,0.00021246115,0.0032104321,0.00023499606,0.000047256763,0.00087509066,0.0014082617,0.35723266,0.02528814,0.52824175,0.004296053,0.0787033],"study_design_scores_gemma":[0.00002824056,0.000042656167,0.00020992255,0.000031596723,0.000016035623,0.000102420156,0.000112340516,0.88181394,0.01191434,0.08896227,0.016745385,0.000020901693],"about_ca_topic_score_codex":0.0031831963,"about_ca_topic_score_gemma":0.0025135537,"teacher_disagreement_score":0.0031831963,"about_ca_system_score_codex":0.0010256554,"about_ca_system_score_gemma":0.0010607116,"threshold_uncertainty_score":0.0074566603},"labels":[],"label_agreement":null},{"id":"W4229646394","doi":"10.1109/glocom.2014.7417836","title":"A Hierarchical Architecture for Distributed EPCglobal Discovery Services","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Scalability; Computer science; PlanetLab; Identifier; Computer network; Distributed computing; Emulation; Chord (peer-to-peer); Architecture; Overlay network; Neighbor Discovery Protocol; The Internet; Internet Protocol; World Wide Web; Database","score_opus":0.030443706645368263,"score_gpt":0.2906933659029355,"score_spread":0.2602496592575672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229646394","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.08732691,0.0007413409,0.8839123,0.00062142726,0.00015696081,0.0004390815,0.00039705154,0.011160896,0.01524395],"genre_scores_gemma":[0.5902909,0.0003800785,0.39932632,0.00030562744,0.0000559213,0.00021611118,0.00097358745,0.00016126537,0.0082902415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00013121859,0.00008742127,0.00012262733,0.00023657831,0.000102364036],"domain_scores_gemma":[0.9989002,0.000140502,0.000068450725,0.00040197474,0.00032499645,0.00016392687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077475695,0.00030602535,0.00037459863,0.0010190444,0.0010346905,0.0018725599,0.0016741977,0.00091857114,0.0017707051],"category_scores_gemma":[0.0014158519,0.00027530798,0.0004066171,0.0013411139,0.00055978855,0.0017156065,0.001993127,0.0009375656,0.0011146824],"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.0013619855,0.0007358391,0.007856072,0.00061785005,0.0001944424,0.0013943264,0.0015572923,0.12671666,0.12220077,0.16392434,0.032645494,0.5407949],"study_design_scores_gemma":[0.00015558535,0.0003941668,0.0033091297,0.000064731066,0.00013376375,0.0008159707,0.00042608578,0.84057456,0.032302193,0.039824966,0.081852935,0.00014589848],"about_ca_topic_score_codex":0.0074864603,"about_ca_topic_score_gemma":0.006586848,"teacher_disagreement_score":0.0074864603,"about_ca_system_score_codex":0.0012429749,"about_ca_system_score_gemma":0.0016969516,"threshold_uncertainty_score":0.014885783},"labels":[],"label_agreement":null},{"id":"W4229764152","doi":"10.22215/etd/2020-14232","title":"Non-Cooperative and Cooperative Caching Schemes for Vehicular Networks","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Exploit; Computer science; A priori and a posteriori; Latency (audio); Computer network; Vehicular ad hoc network; Distributed computing; Information transfer; Wireless ad hoc network; Computer security; Wireless; Telecommunications","score_opus":0.012767940619408787,"score_gpt":0.24760179302548757,"score_spread":0.2348338524060788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229764152","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.042922385,0.0021222574,0.94801015,0.00042836423,0.00007769886,0.00010337982,0.00008116875,0.0001833062,0.0060713817],"genre_scores_gemma":[0.9281073,0.0015164766,0.063442074,0.000101338264,0.000063168816,0.0001251758,0.000105807936,0.000038496622,0.006500204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991549,0.0003223069,0.00003923545,0.00012872614,0.00019196536,0.00016285814],"domain_scores_gemma":[0.9982785,0.00094767625,0.00017456952,0.00023369139,0.00030338368,0.00006220616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011925692,0.0007367507,0.00084775273,0.0004914159,0.00057876296,0.001124385,0.0018396527,0.0008144862,0.0011709583],"category_scores_gemma":[0.0037272184,0.00032683904,0.00057756057,0.0011348466,0.0007782258,0.0014050846,0.00096927764,0.0007473746,0.00025516597],"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.00011581955,0.00006983384,0.0006002497,0.0001452305,0.000047529164,0.00010790844,0.00017241122,0.8310869,0.004141466,0.116066426,0.0029867664,0.04445942],"study_design_scores_gemma":[0.000008493782,0.000042588148,0.000119596894,0.000008457957,0.000013461543,0.000036649544,0.000028129833,0.98095185,0.00060784956,0.016871946,0.0013020538,0.0000088316965],"about_ca_topic_score_codex":0.0059539103,"about_ca_topic_score_gemma":0.0072383364,"teacher_disagreement_score":0.0059539103,"about_ca_system_score_codex":0.0022938258,"about_ca_system_score_gemma":0.0013909135,"threshold_uncertainty_score":0.016642928},"labels":[],"label_agreement":null},{"id":"W4230246245","doi":"10.1007/978-3-319-78262-1_124","title":"Integrated System of Networking, Caching, and Computing","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Distributed computing; Computer network","score_opus":0.021239563558120088,"score_gpt":0.19488364796549956,"score_spread":0.17364408440737947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230246245","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038439797,0.06444159,0.33581176,0.0045999126,0.0043633,0.00024108349,0.00082357775,0.0043635163,0.5815113],"genre_scores_gemma":[0.045865584,0.04090718,0.15240243,0.0019651575,0.0021993928,0.0003774637,0.0014249625,0.0011132638,0.75374454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956316,0.00006710966,0.000020472598,0.00009214264,0.00021560107,0.000041542047],"domain_scores_gemma":[0.9995939,0.000120188044,0.000012963508,0.00011089192,0.00012219057,0.00003987737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004470929,0.0008841231,0.0008173364,0.0015519282,0.001034587,0.0054712542,0.0017578037,0.001526024,0.028568834],"category_scores_gemma":[0.00086969795,0.0007257015,0.000538484,0.0036356999,0.0012536192,0.0049474807,0.0016592977,0.0024328597,0.011118243],"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.000036764857,0.000071050046,0.0002463867,0.0002592202,0.00002606661,0.00008184036,0.00019836264,0.0023837765,0.0038757361,0.6249431,0.152866,0.21501166],"study_design_scores_gemma":[0.00001032335,0.00004763128,0.0003698244,0.00017512352,0.000033232336,0.00056937005,0.00008421171,0.015651386,0.0022114331,0.13049786,0.85032374,0.00002583703],"about_ca_topic_score_codex":0.0038842957,"about_ca_topic_score_gemma":0.0058177835,"teacher_disagreement_score":0.028568834,"about_ca_system_score_codex":0.002304257,"about_ca_system_score_gemma":0.0027373182,"threshold_uncertainty_score":0.09557229},"labels":[],"label_agreement":null},{"id":"W4230333365","doi":"10.36227/techrxiv.14461760","title":"Energy and Latency Efficient Caching in Mobile Edge Networks: Survey, Solutions, and Challenges","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Computer network; Base station; Enhanced Data Rates for GSM Evolution; Efficient energy use; Wireless; Wireless network; Latency (audio); Macrocell; Telecommunications; Engineering","score_opus":0.045910354816226205,"score_gpt":0.23104439558819065,"score_spread":0.18513404077196444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230333365","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009431125,0.9137745,0.049609207,0.0046261395,0.000962054,0.00008470307,0.00023694722,0.00040439182,0.020870954],"genre_scores_gemma":[0.09386667,0.8508344,0.03884742,0.0017072619,0.0017227456,0.0001172956,0.0006216463,0.00010180162,0.012180766],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995167,0.00009749838,0.000048687092,0.00006441226,0.00019318676,0.00007948863],"domain_scores_gemma":[0.9989128,0.00043719553,0.000073669944,0.00008919098,0.00043158108,0.00005558445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006686383,0.00072169484,0.0010733773,0.0014391087,0.00065250456,0.0022238935,0.0020344122,0.0015109393,0.0027980465],"category_scores_gemma":[0.0014159355,0.00040232026,0.00048946997,0.004439928,0.00043128745,0.0042008013,0.0009880672,0.0011907332,0.0012211052],"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.00011368587,0.00020564329,0.0017779918,0.0052942205,0.000086389315,0.00023543504,0.00023164882,0.016273638,0.006711451,0.067721836,0.04754213,0.85380584],"study_design_scores_gemma":[0.000031494834,0.0005250513,0.0019970157,0.003439734,0.0002264732,0.0021109625,0.0011005417,0.09735128,0.00897616,0.050585404,0.8334982,0.0001577411],"about_ca_topic_score_codex":0.0032434005,"about_ca_topic_score_gemma":0.0035998502,"teacher_disagreement_score":0.0032434005,"about_ca_system_score_codex":0.001002005,"about_ca_system_score_gemma":0.0015157864,"threshold_uncertainty_score":0.009360433},"labels":[],"label_agreement":null},{"id":"W4231124889","doi":"10.22215/etd/2007-08171","title":"Adaptive admission control policy for web caching","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Caching and Content Delivery","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":"Carleton University; Canadian Heritage","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Control (management); World Wide Web; Political science; Humanities; Library science; Art; Artificial intelligence","score_opus":0.018149033520895058,"score_gpt":0.30850567521616074,"score_spread":0.29035664169526565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231124889","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.1266524,0.0022668573,0.8493914,0.0021280902,0.0006890786,0.00028493037,0.00017135004,0.0032068181,0.015209094],"genre_scores_gemma":[0.9770955,0.00025329425,0.018965581,0.00012988407,0.0001314032,0.00005734195,0.00004835653,0.000040474122,0.0032782967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985745,0.00045509718,0.0000741793,0.0002049129,0.00038812755,0.00030325286],"domain_scores_gemma":[0.9964437,0.0018229235,0.00019185201,0.00033948742,0.00091318757,0.00028887487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017516412,0.0004522792,0.00068451924,0.00076041225,0.0008492011,0.0018440755,0.0014424215,0.0007096985,0.0023996695],"category_scores_gemma":[0.0073687686,0.00023653894,0.00024441406,0.0007484497,0.00069571997,0.0012622621,0.00074941077,0.0017073562,0.00047073828],"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.0019741505,0.000836254,0.004661844,0.00018355886,0.0001242676,0.00030222815,0.00047209932,0.53180724,0.029105918,0.073996976,0.016669607,0.33986595],"study_design_scores_gemma":[0.000034320317,0.00004633731,0.0003126798,0.0000065247227,0.000015013039,0.00003341803,0.000025713654,0.9915263,0.0014772661,0.0056385626,0.0008678972,0.000015959304],"about_ca_topic_score_codex":0.010175256,"about_ca_topic_score_gemma":0.0069685983,"teacher_disagreement_score":0.010175256,"about_ca_system_score_codex":0.0022868447,"about_ca_system_score_gemma":0.0021369804,"threshold_uncertainty_score":0.020232081},"labels":[],"label_agreement":null},{"id":"W4231461540","doi":"10.1145/2377677.2377719","title":"It's not easy being green","year":2012,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":158,"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":"Hewlett-Packard Development Company","keywords":"Carbon footprint; Computer science; Software deployment; Electricity; Upgrade; Latency (audio); The Internet; Computer network; Workload; Environmental economics; Greenhouse gas; Telecommunications; Operating system","score_opus":0.05759352750242262,"score_gpt":0.29578543281255343,"score_spread":0.2381919053101308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231461540","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02948495,0.012046761,0.020366121,0.5739395,0.019139078,0.000101536476,0.00063324184,0.0014221707,0.34286657],"genre_scores_gemma":[0.39889964,0.019332267,0.019484023,0.20817709,0.003941316,0.0001456035,0.00070265203,0.0015401118,0.34777737],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793327,0.0005567996,0.000058352427,0.00038130535,0.00066280534,0.00040735767],"domain_scores_gemma":[0.99480224,0.0011637675,0.0003885942,0.0010325653,0.0016396609,0.00097324327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027087708,0.000598535,0.00059339276,0.000710188,0.0057605524,0.007585906,0.0010444392,0.0036489088,0.021927731],"category_scores_gemma":[0.007972219,0.0003311476,0.0006101208,0.0008918071,0.0063017514,0.013074434,0.0031298506,0.0069923736,0.010596109],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00016151213,0.00022628058,0.0029888072,0.00034719656,0.00009136939,0.00043067787,0.0027136079,0.00086978043,0.002803465,0.28570837,0.56260794,0.14105096],"study_design_scores_gemma":[0.000018943461,0.000058669302,0.0008893029,0.00019656021,0.000020261517,0.00020800592,0.0029577774,0.00037836516,0.0008352717,0.081613965,0.91278684,0.00003600079],"about_ca_topic_score_codex":0.0056428234,"about_ca_topic_score_gemma":0.009056946,"teacher_disagreement_score":0.021927731,"about_ca_system_score_codex":0.0024593498,"about_ca_system_score_gemma":0.0034812782,"threshold_uncertainty_score":0.073355615},"labels":[],"label_agreement":null},{"id":"W4233356637","doi":"10.1007/978-1-4614-6170-8_100896","title":"Caching","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01753957384583838,"score_gpt":0.1934943202985236,"score_spread":0.17595474645268522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233356637","genre_codex":"other","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.0040541263,0.023385238,0.10789503,0.002554298,0.0020093725,0.00017312451,0.0009206361,0.003884975,0.8551231],"genre_scores_gemma":[0.039967824,0.021454142,0.035587523,0.0010689608,0.0008850839,0.00012717785,0.0015749282,0.0008339235,0.8985005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969196,0.00003513595,0.000012501707,0.00006351022,0.00015601306,0.00004088049],"domain_scores_gemma":[0.9995516,0.00008326513,0.000016854116,0.00017419191,0.00014858089,0.000025587111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737697,0.0012423717,0.000706685,0.0012716486,0.0010357576,0.0029429065,0.0014915932,0.0012918708,0.065497845],"category_scores_gemma":[0.0010917255,0.00052982505,0.0004745832,0.0023289388,0.00077122933,0.0042127967,0.0011643176,0.0014962765,0.029367704],"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.00004853538,0.00008422783,0.0001590848,0.00035377237,0.000016425203,0.000085649415,0.00017948805,0.0022334422,0.0052513513,0.29894966,0.29816386,0.39447445],"study_design_scores_gemma":[0.000009767136,0.000027354343,0.00021136155,0.00021242062,0.000026178428,0.00055704516,0.00006666204,0.0064725284,0.0061549386,0.07132845,0.91490644,0.00002682429],"about_ca_topic_score_codex":0.0045542065,"about_ca_topic_score_gemma":0.0059951525,"teacher_disagreement_score":0.065497845,"about_ca_system_score_codex":0.0022416967,"about_ca_system_score_gemma":0.0016113259,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4236777019","doi":"10.32920/ryerson.14651574","title":"Matching-based cache placement decision for 5G network caching","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Computer science; Cache; Backhaul (telecommunications); Cache algorithms; Cache invalidation; Cache pollution; Bottleneck; Computer network; Matching (statistics); Smart Cache; Page cache; Parallel computing; CPU cache; Mathematics; Base station","score_opus":0.02924919318287178,"score_gpt":0.2690654106091593,"score_spread":0.2398162174262875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236777019","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.07208899,0.00019381326,0.9252988,0.00017803801,0.000042572563,0.00010995258,0.00007416401,0.00034274405,0.0016710615],"genre_scores_gemma":[0.8188022,0.00012852874,0.17889507,0.00009210631,0.000041955576,0.00007159981,0.00014581029,0.000043507316,0.0017792034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910694,0.00021733688,0.000061988634,0.00022814449,0.00022622188,0.00015941428],"domain_scores_gemma":[0.9986884,0.0005236306,0.00017669609,0.00015367502,0.00036428182,0.00009338006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780851,0.00047353664,0.0009845213,0.0006795352,0.00084361486,0.0009218596,0.0016691588,0.0011152937,0.0018516892],"category_scores_gemma":[0.0036414324,0.00030427138,0.00044814745,0.0012152288,0.0004775124,0.0017084392,0.0008247009,0.00053032726,0.00033435956],"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.000559855,0.00020757187,0.004087309,0.00014313983,0.00007545112,0.00028033933,0.00029692802,0.72399664,0.024236297,0.0320393,0.004237847,0.20983936],"study_design_scores_gemma":[0.000015191803,0.000057848163,0.0002119219,0.0000043855994,0.000013141732,0.000052025454,0.000039434384,0.9913551,0.0031741562,0.0045032566,0.0005633644,0.000010113015],"about_ca_topic_score_codex":0.0039903866,"about_ca_topic_score_gemma":0.0042004804,"teacher_disagreement_score":0.0039903866,"about_ca_system_score_codex":0.0013866494,"about_ca_system_score_gemma":0.001673694,"threshold_uncertainty_score":0.010060847},"labels":[],"label_agreement":null},{"id":"W4236937966","doi":"10.32920/ryerson.14655603.v1","title":"Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Cache; Mobile ad hoc network; Distributed computing; Vehicular ad hoc network; Overlay network; Peer-to-peer; Software deployment; Ad hoc wireless distribution service; Node (physics); Optimized Link State Routing Protocol; Wireless; The Internet; Network packet; World Wide Web; Telecommunications","score_opus":0.022878792848660897,"score_gpt":0.2646890071011802,"score_spread":0.2418102142525193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236937966","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.22602856,0.0049739974,0.754747,0.00064463867,0.00016590777,0.00033125386,0.00011594475,0.0017060734,0.011286647],"genre_scores_gemma":[0.9495796,0.0010914879,0.046080098,0.000055365555,0.00006791168,0.00012260588,0.00006092012,0.00004014944,0.002901887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992112,0.00026659708,0.000039695748,0.00011991149,0.00026195502,0.000100671175],"domain_scores_gemma":[0.99840194,0.00082379306,0.00010728933,0.0002487548,0.00033595308,0.000082297986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002055,0.00053057476,0.0011043593,0.0006776778,0.0011019963,0.0010425304,0.0014148585,0.0007565612,0.00079315226],"category_scores_gemma":[0.003468015,0.00039116692,0.00037755206,0.0010571047,0.000612381,0.0017446756,0.0008843446,0.00047040655,0.00019976379],"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.00032492055,0.000145128,0.0018177361,0.00022579834,0.00013852914,0.0008647847,0.00047682584,0.8431083,0.0161018,0.050853327,0.0041680103,0.08177479],"study_design_scores_gemma":[0.000022242271,0.000052605425,0.00021529774,0.000008485568,0.000023889708,0.00008842224,0.00004212136,0.98866874,0.0015101908,0.0073304162,0.002025072,0.000012555373],"about_ca_topic_score_codex":0.0096417265,"about_ca_topic_score_gemma":0.0066303597,"teacher_disagreement_score":0.0096417265,"about_ca_system_score_codex":0.001002554,"about_ca_system_score_gemma":0.0008938659,"threshold_uncertainty_score":0.019171238},"labels":[],"label_agreement":null},{"id":"W4237166251","doi":"10.1109/hicss.2016.730","title":"Introduction to Social Networking and Communities Minitrack","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Computer science; Knowledge management","score_opus":0.02539480258245635,"score_gpt":0.2246115277283771,"score_spread":0.19921672514592073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237166251","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020253144,0.24564075,0.112855725,0.10087551,0.1175912,0.00040053428,0.003792177,0.0031736372,0.41364515],"genre_scores_gemma":[0.023333963,0.19516021,0.039437808,0.034068353,0.101746075,0.000622974,0.0048716567,0.0018102118,0.5989487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988543,0.00021812569,0.000065578024,0.00026001918,0.0004703537,0.00013164368],"domain_scores_gemma":[0.9955383,0.0017874431,0.00015274883,0.00040943958,0.0013258496,0.00078623387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015752518,0.0009370164,0.0007970345,0.0032468215,0.0017461035,0.0047991555,0.0021326472,0.0037952163,0.1051294],"category_scores_gemma":[0.0056647942,0.00076448685,0.0008331727,0.0046297424,0.0016343778,0.010279207,0.003911391,0.0054103113,0.05510104],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000026679378,0.00004933539,0.00024037558,0.00048542666,0.000010062179,0.000054777418,0.00013291636,0.00029565222,0.0003214914,0.09930565,0.7295327,0.16954488],"study_design_scores_gemma":[0.0000031665782,0.000013788861,0.00015106014,0.00016563534,0.0000032563862,0.00012363774,0.00004750436,0.00022263433,0.00008401511,0.02095755,0.97821665,0.0000111780555],"about_ca_topic_score_codex":0.0029515112,"about_ca_topic_score_gemma":0.0037913877,"teacher_disagreement_score":0.1051294,"about_ca_system_score_codex":0.0019849308,"about_ca_system_score_gemma":0.0022724732,"threshold_uncertainty_score":0.35169286},"labels":[],"label_agreement":null},{"id":"W4238261333","doi":"10.1145/1269899.1254916","title":"Building high accuracy bloom filters using partitioned hashing","year":2007,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Bloom filter; Hash function; Computer science; False positive paradox; Network packet; Probabilistic logic; Bit array; Set (abstract data type); Filter (signal processing); Algorithm; Artificial intelligence; Computer network; Computer security","score_opus":0.11630709567044449,"score_gpt":0.36705051738648337,"score_spread":0.25074342171603886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238261333","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.029313035,0.00031396316,0.9644467,0.00018839954,0.000049188595,0.00023863182,0.00028689008,0.0033639835,0.0017993429],"genre_scores_gemma":[0.25179043,0.00026141774,0.74356985,0.00019891652,0.000058315938,0.00025266365,0.0006349347,0.00013913654,0.003094392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497813,0.0011312278,0.000533176,0.0006230072,0.0022337218,0.00050079206],"domain_scores_gemma":[0.9809967,0.0069619124,0.001403606,0.0062905024,0.0039939834,0.00035325813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050536525,0.0006956885,0.0014660263,0.0025758874,0.001364332,0.0029934293,0.0019478218,0.0013753028,0.0026576335],"category_scores_gemma":[0.0203777,0.00090135913,0.00072980125,0.0024618087,0.00096662535,0.006012799,0.0029952403,0.0010487675,0.0020034371],"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.0012093078,0.00027282268,0.009937874,0.0003456652,0.00021480247,0.00024376872,0.00090033683,0.1129852,0.063263334,0.059755515,0.009213068,0.7416583],"study_design_scores_gemma":[0.00019657573,0.00041829905,0.0016032847,0.00006983276,0.000096850694,0.0005589869,0.00027271645,0.78501695,0.14062181,0.05258419,0.01843815,0.00012241429],"about_ca_topic_score_codex":0.0039681457,"about_ca_topic_score_gemma":0.004246617,"teacher_disagreement_score":0.0050536525,"about_ca_system_score_codex":0.0024352088,"about_ca_system_score_gemma":0.0024243374,"threshold_uncertainty_score":0.026726604},"labels":[],"label_agreement":null},{"id":"W4238693818","doi":"10.1109/wwc.2001.990756","title":"Synthetic trace generation for the Internet","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Alberta","funders":"","keywords":"Computer science; Locality; Locality of reference; Router; The Internet; Computer network; TRACE (psycholinguistics); Network packet; IP forwarding; Routing (electronic design automation); Aggregate (composite); Internet traffic; Routing table; Routing protocol; Cache; World Wide Web","score_opus":0.034229690584480596,"score_gpt":0.23655760808950735,"score_spread":0.20232791750502677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238693818","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.8447157,0.00023953093,0.14366104,0.0007196826,0.00011096018,0.00030117467,0.0046506217,0.0018656034,0.003735657],"genre_scores_gemma":[0.95117927,0.00013416282,0.043206707,0.00006837196,0.000016150923,0.00021667583,0.0042899316,0.000091468064,0.00079723855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994282,0.00023699962,0.000030782012,0.00007080318,0.00017119906,0.00006196057],"domain_scores_gemma":[0.99440175,0.0032975576,0.00030769172,0.00088969973,0.00088323414,0.00022000851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422913,0.0005428893,0.00037878356,0.0010623609,0.0003662329,0.00055524334,0.0014167486,0.0010048379,0.0012831294],"category_scores_gemma":[0.00813344,0.00024218942,0.0003833539,0.0012785693,0.0005950579,0.0007010257,0.0005905815,0.0008854695,0.0001826966],"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.00029225738,0.00045683948,0.010830993,0.00013134097,0.000074678406,0.00037178138,0.00027145352,0.943052,0.0061100614,0.016087722,0.0039135804,0.018407226],"study_design_scores_gemma":[0.000025139325,0.00005731112,0.00079895393,0.00000606633,0.000007497915,0.00006152739,0.000052823318,0.9912123,0.0023626764,0.0044411416,0.0009658796,0.000008688862],"about_ca_topic_score_codex":0.005589379,"about_ca_topic_score_gemma":0.004663993,"teacher_disagreement_score":0.005589379,"about_ca_system_score_codex":0.0009536967,"about_ca_system_score_gemma":0.0005887275,"threshold_uncertainty_score":0.011113644},"labels":[],"label_agreement":null},{"id":"W4240152675","doi":"10.32920/ryerson.14663040","title":"Cluster-discovery of Twitter messages for event detection and trending","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Event (particle physics); Computer science; Locality-sensitive hashing; Cluster (spacecraft); Big data; Hash function; Social media; Data mining; Key (lock); Process (computing); Locality; Hash table; Computer security; World Wide Web","score_opus":0.02842525887803826,"score_gpt":0.2689567114933181,"score_spread":0.24053145261527986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240152675","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.4218708,0.0014688261,0.5410861,0.0010601262,0.00030386276,0.0009577063,0.013841554,0.011030019,0.008381087],"genre_scores_gemma":[0.70616126,0.0005232437,0.2748735,0.00008426925,0.00012994622,0.0002531435,0.012008191,0.00023465525,0.0057318145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993518,0.00006852459,0.0000488014,0.00021682924,0.00020689577,0.00010705752],"domain_scores_gemma":[0.9987375,0.00025292198,0.00020032788,0.00030730377,0.00037610266,0.00012578414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619518,0.00060619414,0.00078308687,0.0036904782,0.0009948887,0.0009963167,0.0009874974,0.0005078515,0.0015615849],"category_scores_gemma":[0.002937505,0.0003465295,0.0007060812,0.0036718373,0.00025883378,0.0015959677,0.001260535,0.000626298,0.0015400449],"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.0014070619,0.00049190014,0.077391066,0.0008256145,0.00035112098,0.0006454156,0.0018721728,0.027189441,0.09100705,0.011200604,0.029135363,0.7584833],"study_design_scores_gemma":[0.00006876739,0.00035993618,0.042167176,0.000049027818,0.00013310427,0.0007578706,0.002135552,0.855869,0.05932433,0.013505623,0.025529847,0.000099834055],"about_ca_topic_score_codex":0.0066823605,"about_ca_topic_score_gemma":0.012742314,"teacher_disagreement_score":0.0066823605,"about_ca_system_score_codex":0.0007048311,"about_ca_system_score_gemma":0.001027756,"threshold_uncertainty_score":0.013286948},"labels":[],"label_agreement":null},{"id":"W4241760437","doi":"10.1007/978-3-319-32903-1_124-1","title":"Integrated System of Networking, Caching, and Computing","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Distributed computing; Computer network","score_opus":0.019382448349116243,"score_gpt":0.20350662878540654,"score_spread":0.1841241804362903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241760437","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005573494,0.10583355,0.37176284,0.007174484,0.0051344675,0.00020450182,0.00072214496,0.0034786202,0.5001159],"genre_scores_gemma":[0.087556794,0.08613408,0.2210779,0.0027829686,0.0042018546,0.00043683208,0.0015929068,0.0011925908,0.5950241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00006357144,0.000022245615,0.00009870674,0.00020656925,0.00004261582],"domain_scores_gemma":[0.9995597,0.00012679119,0.000014635801,0.0001268755,0.00013084068,0.00004110239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046095857,0.0008131841,0.0007723737,0.0013994398,0.0009884943,0.005217685,0.0016523619,0.0015063006,0.018442791],"category_scores_gemma":[0.0009617158,0.0006792215,0.00055215805,0.0033856265,0.0014559465,0.005616435,0.001664792,0.0026464362,0.007586114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000026360618,0.000052301602,0.00021568437,0.00029132096,0.000024941313,0.000059673424,0.00018829106,0.0022314584,0.0028902993,0.7247703,0.09304638,0.17620304],"study_design_scores_gemma":[0.00001019742,0.00004086198,0.00037923202,0.00023194573,0.00003650033,0.00055490446,0.00008527502,0.014592191,0.0024568907,0.20626445,0.77531785,0.000029649778],"about_ca_topic_score_codex":0.0030713405,"about_ca_topic_score_gemma":0.004093805,"teacher_disagreement_score":0.018442791,"about_ca_system_score_codex":0.002680718,"about_ca_system_score_gemma":0.0027957228,"threshold_uncertainty_score":0.061697245},"labels":[],"label_agreement":null},{"id":"W4241846435","doi":"10.4108/icst.mobilware2008.2762","title":"A Pro-active Mobility Extension for Pub/Sub Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extension (predicate logic); Computer science; Context (archaeology); Transfer (computing); Distributed computing; Mobile telephony; Computer network; Theoretical computer science; Mobile radio; Programming language; Geography; Operating system","score_opus":0.056455472774708144,"score_gpt":0.2434432359735637,"score_spread":0.18698776319885557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241846435","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.060601402,0.0015530403,0.9242018,0.00085309806,0.0004340311,0.0002684597,0.00012164099,0.0018128161,0.010153826],"genre_scores_gemma":[0.76379573,0.0013141937,0.22293364,0.00038049385,0.00063859916,0.0002450492,0.0002855563,0.00014366172,0.010263061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.00019747808,0.000091050366,0.00012683791,0.00029086226,0.00013511782],"domain_scores_gemma":[0.99819833,0.00034183465,0.00016609425,0.00077311933,0.0003614448,0.000159245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096359645,0.00052755483,0.0005498719,0.00061219797,0.0010239142,0.001147582,0.0016190606,0.0006581653,0.0016224679],"category_scores_gemma":[0.0019369196,0.00039328658,0.00037849302,0.0005601117,0.0006282317,0.0035090384,0.0019270574,0.00158378,0.0008330962],"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.00085788144,0.0006068923,0.0049579917,0.00054106035,0.00009168388,0.0012182551,0.0011124358,0.049665287,0.14724682,0.3399217,0.014111485,0.43966848],"study_design_scores_gemma":[0.0002075356,0.0011126298,0.0024404596,0.00014508354,0.00025962296,0.0038262703,0.00039814756,0.68198293,0.054145213,0.06462425,0.19068593,0.00017192069],"about_ca_topic_score_codex":0.00074735074,"about_ca_topic_score_gemma":0.00064805016,"teacher_disagreement_score":0.0016224679,"about_ca_system_score_codex":0.00043092665,"about_ca_system_score_gemma":0.0005960035,"threshold_uncertainty_score":0.005427718},"labels":[],"label_agreement":null},{"id":"W4242355438","doi":"10.7873/date.2013.032","title":"A Dual Grain Hit-Miss Detector for Large Die-Stacked DRAM Caches","year":2013,"lang":"en","type":"article","venue":"Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2013","topic":"Caching and Content Delivery","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":"Dram; Static random-access memory; Cache; Computer science; Latency (audio); CAS latency; Embedded system; Computer hardware; CPU cache; Filter (signal processing); Energy consumption; Parallel computing; Operating system; Semiconductor memory; Electrical engineering; Engineering; Telecommunications; Memory controller","score_opus":0.06609829335444932,"score_gpt":0.2686641679908078,"score_spread":0.20256587463635845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242355438","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.61783344,0.0007933269,0.37058446,0.00023537654,0.00013849986,0.00010525546,0.0004887072,0.006993108,0.0028279377],"genre_scores_gemma":[0.9136924,0.0000766345,0.08460848,0.00009016206,0.000015021794,0.00003369277,0.0002062805,0.000036848825,0.0012404919],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99965525,0.00003973267,0.000019699437,0.00006973967,0.00015706157,0.00005851168],"domain_scores_gemma":[0.9989807,0.00030992823,0.00016929467,0.00016489357,0.0003006544,0.000074360934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034822844,0.00038362187,0.0004031328,0.00069125585,0.00050154654,0.00072117575,0.0009167036,0.0006433109,0.00094048807],"category_scores_gemma":[0.001501446,0.00040581473,0.00020742415,0.00050731056,0.00017789588,0.00069781893,0.0003328355,0.00035693866,0.00046185762],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0021125244,0.0005371418,0.046203952,0.00021537792,0.00019635966,0.0006988421,0.00023458559,0.0856096,0.47389615,0.0038747753,0.010445096,0.37597558],"study_design_scores_gemma":[0.00003363835,0.00047772838,0.0062877983,0.000012143343,0.00005945366,0.00029603907,0.000044154032,0.8487165,0.14081243,0.0006393297,0.0025619753,0.000058806014],"about_ca_topic_score_codex":0.0032111194,"about_ca_topic_score_gemma":0.007941243,"teacher_disagreement_score":0.0032111194,"about_ca_system_score_codex":0.00080917584,"about_ca_system_score_gemma":0.0010855787,"threshold_uncertainty_score":0.0063848495},"labels":[],"label_agreement":null},{"id":"W4242687760","doi":"10.22215/etd/2008-08899","title":"A pre-fetching and caching system for web service registries","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Caching and Content Delivery","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":"Library and Archives Canada","funders":"","keywords":"Computer science; World Wide Web; Service (business); Business","score_opus":0.016012691227605604,"score_gpt":0.2369218232281417,"score_spread":0.2209091320005361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242687760","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.032489248,0.0009641262,0.6514799,0.00058406097,0.0002661935,0.0014151593,0.002915107,0.29853117,0.0113549465],"genre_scores_gemma":[0.2759373,0.0016836673,0.63460404,0.00077410403,0.00026676068,0.0013429435,0.0210762,0.016164362,0.048150618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975182,0.0004862639,0.00047969096,0.00037690427,0.0008617232,0.00027717423],"domain_scores_gemma":[0.98875916,0.0020200973,0.00046606068,0.0060709068,0.0017748922,0.00090887473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004741384,0.0009783487,0.0017955737,0.0033645222,0.0023841055,0.0055362564,0.0036582889,0.001566114,0.011078391],"category_scores_gemma":[0.010034922,0.0014497918,0.000938335,0.004088423,0.00091858726,0.0073022493,0.003931454,0.002032238,0.0069140033],"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.0035334209,0.0010248448,0.014739826,0.0007260941,0.00034971663,0.0010414843,0.0017413193,0.013899979,0.057234574,0.062952,0.18131402,0.6614427],"study_design_scores_gemma":[0.0011370484,0.00090008945,0.009914763,0.00031928718,0.0005992144,0.0018257821,0.00082325336,0.5069244,0.15451321,0.031874444,0.29059327,0.00057520845],"about_ca_topic_score_codex":0.016743658,"about_ca_topic_score_gemma":0.017083837,"teacher_disagreement_score":0.016743658,"about_ca_system_score_codex":0.0019950904,"about_ca_system_score_gemma":0.00523593,"threshold_uncertainty_score":0.037060916},"labels":[],"label_agreement":null},{"id":"W4242817817","doi":"10.1007/978-3-319-03807-0_3","title":"Naming","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Domain Name System; Computer science; Name server; Dynamism; World Wide Web; Domain name; Resolver; The Internet; Hyperlink; Web page; Computer network","score_opus":0.017333095011391596,"score_gpt":0.2121882895841561,"score_spread":0.19485519457276448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242817817","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013699629,0.0009648191,0.10808095,0.0022647716,0.003398548,0.00039440673,0.0041012904,0.010938052,0.86848724],"genre_scores_gemma":[0.032802075,0.002361091,0.056112073,0.001891768,0.0008819589,0.0006437786,0.012493781,0.0065987455,0.8862148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978777,0.00048167145,0.00016597044,0.000444326,0.00075727276,0.00027305636],"domain_scores_gemma":[0.9967253,0.00036746883,0.00008733894,0.0018008618,0.0008405759,0.00017841764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018807326,0.001218303,0.00091881404,0.0026177359,0.0032532443,0.0077180774,0.0029994622,0.0019543022,0.22550686],"category_scores_gemma":[0.006505579,0.00074276584,0.00090569333,0.0036655369,0.0016349365,0.012637384,0.0045191166,0.0028846285,0.17177835],"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.000065162894,0.000053444837,0.00014626683,0.00014951942,0.000006256882,0.000076160926,0.0005083692,0.00024653008,0.0018231511,0.50073856,0.3498905,0.14629604],"study_design_scores_gemma":[0.000005149279,0.00000670749,0.000037825233,0.00003650677,0.000004664816,0.0000889952,0.00009266383,0.00030538774,0.00093618926,0.0413714,0.957104,0.000010545883],"about_ca_topic_score_codex":0.002914303,"about_ca_topic_score_gemma":0.0026336773,"teacher_disagreement_score":0.22550686,"about_ca_system_score_codex":0.0018906092,"about_ca_system_score_gemma":0.0027197872,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4242936112","doi":"10.32920/ryerson.14651574.v1","title":"Matching-based cache placement decision for 5G network caching","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Computer science; Cache; Backhaul (telecommunications); Cache algorithms; Computer network; Cache invalidation; Bottleneck; Matching (statistics); Cache pollution; Smart Cache; Parallel computing; Page cache; CPU cache; Mathematics; Base station","score_opus":0.02924919318287178,"score_gpt":0.2690654106091593,"score_spread":0.2398162174262875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242936112","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.07208899,0.00019381326,0.9252988,0.00017803801,0.000042572563,0.00010995258,0.00007416401,0.00034274405,0.0016710615],"genre_scores_gemma":[0.8188022,0.00012852874,0.17889507,0.00009210631,0.000041955576,0.00007159981,0.00014581029,0.000043507316,0.0017792034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910694,0.00021733688,0.000061988634,0.00022814449,0.00022622188,0.00015941428],"domain_scores_gemma":[0.9986884,0.0005236306,0.00017669609,0.00015367502,0.00036428182,0.00009338006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780851,0.00047353664,0.0009845213,0.0006795352,0.00084361486,0.0009218596,0.0016691588,0.0011152937,0.0018516892],"category_scores_gemma":[0.0036414324,0.00030427138,0.00044814745,0.0012152288,0.0004775124,0.0017084392,0.0008247009,0.00053032726,0.00033435956],"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.000559855,0.00020757187,0.004087309,0.00014313983,0.00007545112,0.00028033933,0.00029692802,0.72399664,0.024236297,0.0320393,0.004237847,0.20983936],"study_design_scores_gemma":[0.000015191803,0.000057848163,0.0002119219,0.0000043855994,0.000013141732,0.000052025454,0.000039434384,0.9913551,0.0031741562,0.0045032566,0.0005633644,0.000010113015],"about_ca_topic_score_codex":0.0039903866,"about_ca_topic_score_gemma":0.0042004804,"teacher_disagreement_score":0.0039903866,"about_ca_system_score_codex":0.0013866494,"about_ca_system_score_gemma":0.001673694,"threshold_uncertainty_score":0.010060847},"labels":[],"label_agreement":null},{"id":"W4243535781","doi":"10.1007/978-1-4939-7131-2_100080","title":"Caching","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Business","score_opus":0.02398501730554542,"score_gpt":0.20902659496604573,"score_spread":0.1850415776605003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243535781","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004540067,0.0236867,0.10696121,0.0031995864,0.0025651953,0.00019166502,0.0011228102,0.0045026746,0.85323006],"genre_scores_gemma":[0.04887722,0.023498079,0.03797002,0.0013843636,0.0011950018,0.00014718574,0.0020538634,0.001001042,0.8838733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965334,0.00004036372,0.000014329882,0.00007267653,0.00017109496,0.000048138198],"domain_scores_gemma":[0.99942505,0.00010308295,0.000020442674,0.0002355435,0.00018248371,0.00003330166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003219355,0.0012823573,0.0007296139,0.00127379,0.0010818203,0.0033092175,0.0015887326,0.0013721066,0.06866344],"category_scores_gemma":[0.001308564,0.0005307533,0.0005078626,0.0023789373,0.0007741289,0.004570958,0.0012346591,0.0016340938,0.0313843],"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.000054988966,0.00009291224,0.00017265062,0.00038358095,0.000018021788,0.00008377447,0.00016739496,0.0022609069,0.005324968,0.30735523,0.31685874,0.36722687],"study_design_scores_gemma":[0.0000105896215,0.000029221714,0.00021285085,0.00021319497,0.000028871214,0.0005326894,0.000064504464,0.006842866,0.0062310146,0.07146393,0.9143434,0.000026875463],"about_ca_topic_score_codex":0.004535955,"about_ca_topic_score_gemma":0.0055644237,"teacher_disagreement_score":0.06866344,"about_ca_system_score_codex":0.0024122177,"about_ca_system_score_gemma":0.0018040256,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4244505267","doi":"10.1145/2597176.2578278","title":"Understand Instant Video Clip Sharing on Mobile Platforms","year":2014,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multimedia; Scalability; Cloud computing; Service (business); Mobile device; Exploit; CLIPS; Video tracking; BitTorrent tracker; World Wide Web; File sharing; Video processing; Database; The Internet; Computer security; Artificial intelligence; Eye tracking","score_opus":0.023336508810151396,"score_gpt":0.22793305909437817,"score_spread":0.20459655028422677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244505267","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.9481903,0.0013016078,0.02285525,0.002261189,0.000053120562,0.00013240009,0.0018555954,0.0002775581,0.023072949],"genre_scores_gemma":[0.992941,0.0005560992,0.0040045385,0.00009916925,0.00005047137,0.000028656756,0.00043856713,0.00003183293,0.001849765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997149,0.00006723228,0.000011167496,0.000071129034,0.00005620902,0.00007924127],"domain_scores_gemma":[0.9989825,0.00044889277,0.00017825418,0.00012455534,0.00016542294,0.000100341254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004061133,0.00029378542,0.00025969153,0.0009795233,0.0007263353,0.0019726867,0.00066409976,0.000736999,0.0017316386],"category_scores_gemma":[0.0029750112,0.00020602076,0.00019156915,0.0011241302,0.0005134069,0.0031363366,0.0007670168,0.00052774115,0.00045143368],"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.0011194284,0.000579604,0.29526415,0.00096991524,0.00025636828,0.004166667,0.026355242,0.101310365,0.057552673,0.13417642,0.029652514,0.34859657],"study_design_scores_gemma":[0.00004336654,0.0003882304,0.23859672,0.0002083566,0.00010243009,0.0020184529,0.029858986,0.59757555,0.011319302,0.05464788,0.065078504,0.00016231164],"about_ca_topic_score_codex":0.018943653,"about_ca_topic_score_gemma":0.01522893,"teacher_disagreement_score":0.018943653,"about_ca_system_score_codex":0.0009567213,"about_ca_system_score_gemma":0.00032968502,"threshold_uncertainty_score":0.037666798},"labels":[],"label_agreement":null},{"id":"W4246345223","doi":"10.1109/cns.2013.6682676","title":"Program","year":2013,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"U.S. Army; Army Research Laboratory; Télécom Paris; University of Illinois at Urbana-Champaign; National Institute of Informatics; National Institute of Standards and Technology; Università di Pisa; University of British Columbia; Kungliga Tekniska Högskolan; Tsinghua University; Bar-Ilan University","keywords":"Computer science","score_opus":0.009612997847025665,"score_gpt":0.2108643998043617,"score_spread":0.20125140195733604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246345223","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026662871,0.00040845422,0.015573948,0.010535363,0.0037825464,0.0006690658,0.007854791,0.004020401,0.95448923],"genre_scores_gemma":[0.009844311,0.0003288471,0.0055390485,0.002993643,0.00047553563,0.00047918165,0.0046282294,0.0007449948,0.97496617],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894315,0.00016401007,0.00003214352,0.0002698803,0.00038187308,0.00020897777],"domain_scores_gemma":[0.99680436,0.00029340986,0.00009533321,0.00045823,0.0014242352,0.00092447235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016521622,0.000554552,0.00043263414,0.0012382859,0.002247521,0.003546234,0.0017730024,0.001391419,0.6919914],"category_scores_gemma":[0.004141745,0.00028786337,0.00049791473,0.0011411645,0.00049095,0.0021712985,0.0031999468,0.0015408451,0.38779393],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00011916772,0.00015177931,0.00078879384,0.00010258018,0.0000050848594,0.00006043303,0.0002650822,0.00018468553,0.0006724605,0.042067703,0.8122451,0.14333725],"study_design_scores_gemma":[0.000010254078,0.00002570976,0.00040818882,0.000028328108,0.0000019842885,0.000044678633,0.00011184405,0.00011384373,0.00027179287,0.0035910546,0.99538815,0.000004051741],"about_ca_topic_score_codex":0.0029963467,"about_ca_topic_score_gemma":0.005017918,"teacher_disagreement_score":0.3080086,"about_ca_system_score_codex":0.0019167308,"about_ca_system_score_gemma":0.00422268,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4246690268","doi":"10.1109/lpe.2006.4271845","title":"L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"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; Semiconductor Research Corporation","keywords":"Bloom filter; Computer science; Parallel computing; Latency (audio); Static random-access memory; Energy (signal processing); Computer hardware; Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.0048379300338522654,"score_gpt":0.1816530303819941,"score_spread":0.17681510034814182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246690268","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.69103175,0.0013291071,0.2894799,0.0004786287,0.00009620631,0.00019712505,0.0008094916,0.00774652,0.008831301],"genre_scores_gemma":[0.90981203,0.00022586841,0.08659815,0.000118154916,0.000021098142,0.00006296615,0.0002722244,0.00007786183,0.0028116845],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966156,0.00004751646,0.000019301153,0.000054551605,0.000119750184,0.00009731481],"domain_scores_gemma":[0.9990152,0.00037190336,0.00017542776,0.00013398573,0.00025940168,0.00004404245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004262164,0.00040514543,0.00036568343,0.00064753985,0.00039647557,0.00066486694,0.0015719158,0.0005377433,0.0026737931],"category_scores_gemma":[0.0013428535,0.00018401428,0.00017968382,0.0008476837,0.00030841597,0.0013859604,0.00022744355,0.00030959613,0.0003757329],"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.0029636538,0.0004917828,0.014593627,0.0007142839,0.00016493394,0.00051712285,0.00031946972,0.1519902,0.4136942,0.018115496,0.01632469,0.3801106],"study_design_scores_gemma":[0.00028664357,0.0022177796,0.0052811066,0.00003807086,0.0001265262,0.0008335262,0.00010826551,0.67527646,0.29842606,0.0042225607,0.013084048,0.00009898931],"about_ca_topic_score_codex":0.008204787,"about_ca_topic_score_gemma":0.01147758,"teacher_disagreement_score":0.008204787,"about_ca_system_score_codex":0.0013266254,"about_ca_system_score_gemma":0.0015055478,"threshold_uncertainty_score":0.01631409},"labels":[],"label_agreement":null},{"id":"W4247988984","doi":"10.1109/infcom.2012.6195813","title":"Scaling social media applications into geo-distributed clouds","year":2012,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cloud computing; Computer science; Distributed computing; Social media; Key (lock); Bandwidth (computing); Big data; Data science; Data mining; Computer network; World Wide Web; Computer security","score_opus":0.022982785792926265,"score_gpt":0.25024557455850377,"score_spread":0.2272627887655775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247988984","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.21246947,0.00053766207,0.7747945,0.0013076838,0.00027080972,0.00029497102,0.00026452125,0.002742733,0.0073176385],"genre_scores_gemma":[0.9207202,0.00011723445,0.07782567,0.00014128044,0.00005063185,0.00007502954,0.00009852464,0.00007889935,0.00089255464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993124,0.00014174268,0.00003635743,0.0001687019,0.0001785004,0.00016241426],"domain_scores_gemma":[0.998754,0.00041695585,0.00016417212,0.00028638597,0.0002289109,0.00014951976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096952333,0.00090841396,0.00063392665,0.0005134382,0.0011760981,0.0012415189,0.0017115062,0.0008905564,0.00094213075],"category_scores_gemma":[0.0030789387,0.00033813107,0.0004956824,0.0007848555,0.00067555404,0.0017769751,0.0018122775,0.0009257425,0.00034653165],"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.00020124963,0.00020899724,0.0030991212,0.000063033054,0.000049644987,0.0002313115,0.00016210637,0.91040874,0.011501341,0.013007887,0.004005943,0.057060655],"study_design_scores_gemma":[0.000007450893,0.000013213379,0.0001788755,0.0000018643514,0.0000036574147,0.000016403248,0.00004631647,0.995581,0.0009754632,0.0026758104,0.00049616635,0.0000036846766],"about_ca_topic_score_codex":0.010474323,"about_ca_topic_score_gemma":0.01052925,"teacher_disagreement_score":0.010474323,"about_ca_system_score_codex":0.0013408426,"about_ca_system_score_gemma":0.001260227,"threshold_uncertainty_score":0.020826697},"labels":[],"label_agreement":null},{"id":"W4249902410","doi":"10.1145/3009925.3009928","title":"AdaptCache","year":2016,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"McGill University","funders":"","keywords":"Computer science; Server; Locality; Distributed computing; Replication (statistics); Workload; Middleware (distributed applications); Cache; Distributed object; Replicate; Locality of reference; Load balancing (electrical power); File server; Operating system; Object (grammar); Consistency (knowledge bases); Distributed database; Common Object Request Broker Architecture","score_opus":0.015274959703470838,"score_gpt":0.18886941247549052,"score_spread":0.17359445277201968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249902410","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.027167976,0.015186119,0.4397395,0.0053734477,0.005624412,0.0020273563,0.007968813,0.25169784,0.24521448],"genre_scores_gemma":[0.26171225,0.013124754,0.36561903,0.0077133575,0.0019852053,0.0024551905,0.0373277,0.035187878,0.2748746],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974239,0.0003162523,0.00015585488,0.0002833013,0.0014738303,0.00034685255],"domain_scores_gemma":[0.99663204,0.00048309538,0.00011945971,0.0013893788,0.0010427852,0.00033328668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013187634,0.0011671409,0.0013036993,0.0016077048,0.0017142833,0.0033393232,0.0058313105,0.0016973489,0.033668693],"category_scores_gemma":[0.0060348865,0.00085152703,0.00075581425,0.0026052846,0.0007133785,0.0059532244,0.0041328943,0.0030126583,0.011441119],"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.0010374648,0.0004337783,0.0023874945,0.00071372755,0.00017870376,0.00026827582,0.00032575335,0.013337671,0.0062587536,0.061914146,0.4987745,0.4143697],"study_design_scores_gemma":[0.0001743149,0.00014894738,0.0007913165,0.00013659461,0.00008110858,0.0004967191,0.000103587,0.07615199,0.0077980356,0.02332945,0.89066094,0.00012695255],"about_ca_topic_score_codex":0.0076418407,"about_ca_topic_score_gemma":0.008565114,"teacher_disagreement_score":0.033668693,"about_ca_system_score_codex":0.0018210998,"about_ca_system_score_gemma":0.0029092846,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4252010839","doi":"10.47749/t/unicamp.2020.1157604","title":"Protocolos eficientes para comunicação V2V em redes veiculares de dados nomeados","year":2020,"lang":"pt","type":"dissertation","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cache; Computer science; Computer network","score_opus":0.04732482167103342,"score_gpt":0.3033965543916164,"score_spread":0.256071732720583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252010839","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.051500633,0.005806027,0.8839899,0.0015830996,0.00094244094,0.001493129,0.00076040503,0.0061946902,0.04772964],"genre_scores_gemma":[0.747815,0.0055107344,0.207906,0.0012307432,0.0005326926,0.0015145937,0.002725541,0.0006351657,0.032129604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99472964,0.0013531958,0.0007112852,0.00084764377,0.0018972128,0.00046105965],"domain_scores_gemma":[0.99370956,0.0015058529,0.0005073767,0.0014400652,0.0025413267,0.0002959011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059221108,0.0012179415,0.0010032309,0.0016631846,0.0017891651,0.0069911517,0.002431535,0.0017490035,0.006225872],"category_scores_gemma":[0.012239834,0.0007973687,0.00061157136,0.0015726546,0.0012199433,0.005544312,0.0035154552,0.0024651121,0.0027974118],"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.0013080747,0.0005558178,0.008452809,0.0020070758,0.00039115283,0.0010260404,0.0029390312,0.093302116,0.08053477,0.21571317,0.03052567,0.5632443],"study_design_scores_gemma":[0.00039269187,0.0012556198,0.0041914904,0.000832632,0.00037786027,0.0017528493,0.002751165,0.47145668,0.09033434,0.085068986,0.34123313,0.00035260883],"about_ca_topic_score_codex":0.006423189,"about_ca_topic_score_gemma":0.0043097576,"teacher_disagreement_score":0.0069911517,"about_ca_system_score_codex":0.0017792926,"about_ca_system_score_gemma":0.0027754821,"threshold_uncertainty_score":0.0313195},"labels":[],"label_agreement":null},{"id":"W4252044800","doi":"10.32920/ryerson.14663040.v1","title":"Cluster-discovery of Twitter messages for event detection and trending","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Event (particle physics); Computer science; Locality-sensitive hashing; Cluster (spacecraft); Big data; Social media; Hash function; Key (lock); Data mining; Process (computing); Hash table; Computer security; World Wide Web; Computer network","score_opus":0.02842525887803826,"score_gpt":0.2689567114933181,"score_spread":0.24053145261527986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252044800","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.4218708,0.0014688261,0.5410861,0.0010601262,0.00030386276,0.0009577063,0.013841554,0.011030019,0.008381087],"genre_scores_gemma":[0.70616126,0.0005232437,0.2748735,0.00008426925,0.00012994622,0.0002531435,0.012008191,0.00023465525,0.0057318145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993518,0.00006852459,0.0000488014,0.00021682924,0.00020689577,0.00010705752],"domain_scores_gemma":[0.9987375,0.00025292198,0.00020032788,0.00030730377,0.00037610266,0.00012578414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619518,0.00060619414,0.00078308687,0.0036904782,0.0009948887,0.0009963167,0.0009874974,0.0005078515,0.0015615849],"category_scores_gemma":[0.002937505,0.0003465295,0.0007060812,0.0036718373,0.00025883378,0.0015959677,0.001260535,0.000626298,0.0015400449],"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.0014070619,0.00049190014,0.077391066,0.0008256145,0.00035112098,0.0006454156,0.0018721728,0.027189441,0.09100705,0.011200604,0.029135363,0.7584833],"study_design_scores_gemma":[0.00006876739,0.00035993618,0.042167176,0.000049027818,0.00013310427,0.0007578706,0.002135552,0.855869,0.05932433,0.013505623,0.025529847,0.000099834055],"about_ca_topic_score_codex":0.0066823605,"about_ca_topic_score_gemma":0.012742314,"teacher_disagreement_score":0.0066823605,"about_ca_system_score_codex":0.0007048311,"about_ca_system_score_gemma":0.001027756,"threshold_uncertainty_score":0.013286948},"labels":[],"label_agreement":null},{"id":"W4252365374","doi":"10.22215/etd/2019-13976","title":"Performance Improvements of In-Network Caching in ICN-Based Networks","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Caching and Content Delivery","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":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; The Internet; Information-centric networking; Wireless network; Host (biology); Content delivery network; Wireless; Server; Telecommunications; Cache; World Wide Web","score_opus":0.007781509236146909,"score_gpt":0.21871197569096695,"score_spread":0.21093046645482005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252365374","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.9146794,0.0074994606,0.03521721,0.0015322685,0.0006680634,0.00011211523,0.001168121,0.0032371697,0.035886295],"genre_scores_gemma":[0.986177,0.0011739335,0.006462068,0.00012577407,0.00009215799,0.000015699321,0.0004895888,0.000120597986,0.005343224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998379,0.00037812293,0.000059681,0.00018285702,0.00041116079,0.0005891713],"domain_scores_gemma":[0.9943619,0.002320169,0.00027521086,0.00083725067,0.0018748618,0.0003305738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648319,0.00092306983,0.0008779061,0.00073462114,0.0009808004,0.001861917,0.0013431739,0.0006474285,0.004641841],"category_scores_gemma":[0.006395007,0.00028403904,0.00023543845,0.001625261,0.00041082682,0.002256827,0.00066232716,0.0007575741,0.0006926496],"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.0074600414,0.0018858584,0.023693705,0.0009318562,0.00038379655,0.000514417,0.00074292603,0.48446995,0.0864344,0.014797305,0.059504524,0.31918126],"study_design_scores_gemma":[0.000092657916,0.0010534015,0.0056005176,0.00005825288,0.00022734524,0.00026813528,0.0002652286,0.9423762,0.04044264,0.003575461,0.0059929094,0.00004725702],"about_ca_topic_score_codex":0.022590611,"about_ca_topic_score_gemma":0.027695248,"teacher_disagreement_score":0.022590611,"about_ca_system_score_codex":0.003915657,"about_ca_system_score_gemma":0.0017328004,"threshold_uncertainty_score":0.04491824},"labels":[],"label_agreement":null},{"id":"W4252579873","doi":"10.1145/2377677.2377681","title":"HyperDex","year":2012,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Key (lock); Hash function; Chaining; Distributed computing; Consistency (knowledge bases); Object (grammar); Overhead (engineering); Block (permutation group theory); Hash table; Implementation; Database; Software engineering; Operating system","score_opus":0.044920305062780524,"score_gpt":0.2853808686881626,"score_spread":0.24046056362538207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252579873","genre_codex":"other","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.015576207,0.0044352384,0.22081347,0.0033730513,0.0036516208,0.0012134789,0.03083559,0.1914204,0.528681],"genre_scores_gemma":[0.15976915,0.0065459916,0.15118498,0.004227992,0.0012278458,0.001667181,0.10293535,0.03358271,0.53885883],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981828,0.00026647793,0.00020497966,0.00031714732,0.0007511801,0.0002774523],"domain_scores_gemma":[0.9965927,0.0004931463,0.00013844235,0.0015951107,0.00081547746,0.00036518107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014122698,0.00094198936,0.000975818,0.0014628515,0.0013121689,0.0062845876,0.0032407576,0.0015811214,0.13579422],"category_scores_gemma":[0.005222865,0.0008683197,0.00090031844,0.0024747823,0.000915329,0.010081622,0.0076008392,0.0021383944,0.09687919],"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.0013817697,0.0002263614,0.00183791,0.00095829123,0.00009463029,0.00051088346,0.0005183362,0.0026194765,0.008099722,0.15580937,0.598323,0.2296203],"study_design_scores_gemma":[0.00010801035,0.00006892025,0.00030527887,0.000092568356,0.000028073026,0.000339484,0.0001225984,0.0048510465,0.008308107,0.031293124,0.9544316,0.000051206876],"about_ca_topic_score_codex":0.0015105068,"about_ca_topic_score_gemma":0.0013158275,"teacher_disagreement_score":0.13579422,"about_ca_system_score_codex":0.0010245421,"about_ca_system_score_gemma":0.0020801588,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4253204215","doi":"10.1109/perser.2004.16","title":"Hybrid Cache Invalidation Schemes in Mobile Environments","year":2005,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Calgary","funders":"","keywords":"Computer science; Cache; Cache invalidation; Stateless protocol; Stateful firewall; Computer network; Cache algorithms; Broadcasting (networking); Smart Cache; Page cache; CPU cache; Network packet","score_opus":0.014146313448257489,"score_gpt":0.2207247716011096,"score_spread":0.2065784581528521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253204215","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.46265268,0.0031624604,0.5240542,0.0004378517,0.00011373196,0.00024667688,0.00023713002,0.0039919033,0.0051034046],"genre_scores_gemma":[0.95397747,0.00025644686,0.044330508,0.00007062143,0.000047112342,0.00007889946,0.00013796432,0.000046141355,0.0010549249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762577,0.00080535753,0.00021865606,0.0001735179,0.0007933118,0.00038330618],"domain_scores_gemma":[0.9901452,0.0031163162,0.0012706738,0.003288593,0.0018309763,0.000348325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021965338,0.0006060988,0.0009462693,0.0011513425,0.0011968474,0.001435442,0.002365352,0.0012187167,0.0006940475],"category_scores_gemma":[0.0065069357,0.00050388,0.00037542838,0.001989009,0.0010693789,0.0027212002,0.0017762596,0.00080030697,0.00030957285],"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.0033754178,0.00065081316,0.017684178,0.0006129791,0.00041562837,0.0017631957,0.0018367148,0.5026165,0.08834394,0.060105298,0.008124844,0.31447044],"study_design_scores_gemma":[0.00030606103,0.0007500639,0.0019844205,0.000037838992,0.00013694752,0.0010560371,0.00022782104,0.93866575,0.027402453,0.02037657,0.008936294,0.000119667355],"about_ca_topic_score_codex":0.003251964,"about_ca_topic_score_gemma":0.0028581629,"teacher_disagreement_score":0.003251964,"about_ca_system_score_codex":0.001174646,"about_ca_system_score_gemma":0.00084606814,"threshold_uncertainty_score":0.011616528},"labels":[],"label_agreement":null},{"id":"W4253874112","doi":"10.4018/9781605661483.ch014","title":"Cooperative Data Caching and Prefetching in Wireless Ad Hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Caching and Content Delivery","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 Guelph","funders":"","keywords":"Instruction prefetch; Computer science; Cache; Computer network; Mobile ad hoc network; Consistency (knowledge bases); Overhead (engineering); False sharing; Wireless ad hoc network; Scheme (mathematics); Data access; CPU cache; Distributed computing; Cache algorithms; Wireless; Operating system; Database","score_opus":0.044235038132027574,"score_gpt":0.2435163268167965,"score_spread":0.1992812886847689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253874112","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.1144828,0.07700943,0.7625263,0.0016094517,0.00043841742,0.00022787804,0.00014006221,0.0025471626,0.041018464],"genre_scores_gemma":[0.7914279,0.019197663,0.15141222,0.0002675186,0.00026356932,0.0001968058,0.00024906904,0.00014183139,0.036843438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973613,0.000080171165,0.000012831361,0.00003587518,0.00010234459,0.000032597753],"domain_scores_gemma":[0.99966896,0.00015710268,0.000020834597,0.000073182535,0.000061395105,0.000018571649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042487856,0.0003363464,0.00047342564,0.0005775077,0.00045359088,0.00089637504,0.0010149186,0.0006993998,0.0010694645],"category_scores_gemma":[0.00086795294,0.00033118168,0.00022115603,0.0019716918,0.00036680003,0.0016597473,0.0005873003,0.00044689197,0.0005102813],"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.00023775514,0.00016172275,0.002379644,0.0007302343,0.00009363018,0.0007543934,0.00066247163,0.11168453,0.022777406,0.06883286,0.016744038,0.77494127],"study_design_scores_gemma":[0.00006804812,0.0003101976,0.0018583238,0.00018178346,0.00011726037,0.0011945238,0.00037964384,0.83585125,0.01318466,0.05607996,0.09071164,0.00006276962],"about_ca_topic_score_codex":0.0028755125,"about_ca_topic_score_gemma":0.0035936725,"teacher_disagreement_score":0.0028755125,"about_ca_system_score_codex":0.0005543808,"about_ca_system_score_gemma":0.00055340707,"threshold_uncertainty_score":0.005717516},"labels":[],"label_agreement":null},{"id":"W4255289664","doi":"10.5539/mas.v12n5p119","title":"PPUSTMAN: Privacy-Aware PUblish/Subscribe IoT MVC Architecture Using Information Centric Networking","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Information-centric networking; Publication; Architecture; Computer network; Distributed computing; Database","score_opus":0.019564533115877605,"score_gpt":0.22546971736642069,"score_spread":0.20590518425054308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255289664","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.021615304,0.0004941247,0.9414322,0.0007425104,0.00032878545,0.00046705513,0.00034954163,0.017227883,0.017342601],"genre_scores_gemma":[0.6049312,0.00077036966,0.36679542,0.00093798246,0.00021345369,0.00050281524,0.0019003776,0.0006262942,0.023322029],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992453,0.00011339355,0.000066590364,0.00016395628,0.00032471737,0.0000860866],"domain_scores_gemma":[0.9992349,0.00011920593,0.000059692014,0.00028979572,0.00021113631,0.00008529905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013106433,0.00042520912,0.0005566669,0.00052293786,0.0009412389,0.0029344175,0.0022088513,0.0009329684,0.0028523782],"category_scores_gemma":[0.0015365544,0.0003727704,0.00054645486,0.00060401356,0.0006819915,0.0026393372,0.0018344406,0.0012980743,0.0008854589],"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.0010134677,0.00073189,0.004062108,0.0007430392,0.0002970523,0.0018279807,0.0009891154,0.13313626,0.08076241,0.33605602,0.05835053,0.3820302],"study_design_scores_gemma":[0.00005985369,0.00020921176,0.0005293081,0.000035236375,0.00008865641,0.0005148428,0.00012453423,0.8712933,0.028899753,0.03910397,0.059064746,0.0000766341],"about_ca_topic_score_codex":0.0040619755,"about_ca_topic_score_gemma":0.0038420074,"teacher_disagreement_score":0.0040619755,"about_ca_system_score_codex":0.0010915004,"about_ca_system_score_gemma":0.0022972976,"threshold_uncertainty_score":0.009542167},"labels":[],"label_agreement":null},{"id":"W4256065040","doi":"10.32920/ryerson.14655603","title":"Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Cache; Mobile ad hoc network; Distributed computing; Vehicular ad hoc network; Overlay network; Software deployment; Ad hoc wireless distribution service; Peer-to-peer; Optimized Link State Routing Protocol; Node (physics); Wireless; Network packet; The Internet; World Wide Web; Telecommunications","score_opus":0.022878792848660897,"score_gpt":0.2646890071011802,"score_spread":0.2418102142525193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256065040","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.22602856,0.0049739974,0.754747,0.00064463867,0.00016590777,0.00033125386,0.00011594475,0.0017060734,0.011286647],"genre_scores_gemma":[0.9495796,0.0010914879,0.046080098,0.000055365555,0.00006791168,0.00012260588,0.00006092012,0.00004014944,0.002901887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992112,0.00026659708,0.000039695748,0.00011991149,0.00026195502,0.000100671175],"domain_scores_gemma":[0.99840194,0.00082379306,0.00010728933,0.0002487548,0.00033595308,0.000082297986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002055,0.00053057476,0.0011043593,0.0006776778,0.0011019963,0.0010425304,0.0014148585,0.0007565612,0.00079315226],"category_scores_gemma":[0.003468015,0.00039116692,0.00037755206,0.0010571047,0.000612381,0.0017446756,0.0008843446,0.00047040655,0.00019976379],"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.00032492055,0.000145128,0.0018177361,0.00022579834,0.00013852914,0.0008647847,0.00047682584,0.8431083,0.0161018,0.050853327,0.0041680103,0.08177479],"study_design_scores_gemma":[0.000022242271,0.000052605425,0.00021529774,0.000008485568,0.000023889708,0.00008842224,0.00004212136,0.98866874,0.0015101908,0.0073304162,0.002025072,0.000012555373],"about_ca_topic_score_codex":0.0096417265,"about_ca_topic_score_gemma":0.0066303597,"teacher_disagreement_score":0.0096417265,"about_ca_system_score_codex":0.001002554,"about_ca_system_score_gemma":0.0008938659,"threshold_uncertainty_score":0.019171238},"labels":[],"label_agreement":null},{"id":"W4287366753","doi":"10.48550/arxiv.2101.11787","title":"Joint Transmission Scheme and Coded Content Placement in Cluster-centric\\n UAV-aided Cellular Networks","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Ministère de la Défense Nationale","keywords":"Computer science; Computer network; Cache; Node (physics); Cellular network; Real-time computing","score_opus":0.0820377160552444,"score_gpt":0.17053243192819637,"score_spread":0.08849471587295196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287366753","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.52973443,0.00044745833,0.4661246,0.00008220883,0.000055159035,0.00006898372,0.00010737257,0.0003224065,0.003057461],"genre_scores_gemma":[0.98076594,0.000059520553,0.01865973,0.0000111067975,0.000004506392,0.00001311408,0.000030051138,0.0000050455146,0.0004509421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996525,0.00009536948,0.000010889797,0.000062581705,0.00009387184,0.000084756095],"domain_scores_gemma":[0.99919194,0.00029994926,0.00013834986,0.00011258819,0.0002096255,0.000047443977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032779423,0.0004494172,0.000383226,0.00045882983,0.00041648318,0.000599597,0.0007449672,0.00038344198,0.00045321858],"category_scores_gemma":[0.001705082,0.00017360273,0.00017911248,0.0007616444,0.0005184307,0.00049958576,0.00041978672,0.00020375504,0.000098401],"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.00017329858,0.00003180927,0.0013513856,0.000032638414,0.000021002441,0.00013104388,0.000055557626,0.9657827,0.009432231,0.0039640074,0.00042958863,0.018594783],"study_design_scores_gemma":[0.0000042421993,0.00005154123,0.00024013364,0.0000017989328,0.0000071884742,0.000032325548,0.000019808718,0.9962471,0.0027802896,0.00044618506,0.00016359503,0.0000058147903],"about_ca_topic_score_codex":0.011057613,"about_ca_topic_score_gemma":0.012039098,"teacher_disagreement_score":0.011057613,"about_ca_system_score_codex":0.001044563,"about_ca_system_score_gemma":0.0007486131,"threshold_uncertainty_score":0.021986485},"labels":[],"label_agreement":null},{"id":"W4287556996","doi":"10.48550/arxiv.2012.03005","title":"Optimal Caching for Low Latency in Distributed Coded Storage Systems","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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 Toronto; University of Victoria","funders":"","keywords":"Erasure code; Computer science; Latency (audio); Distributed data store; Distributed computing; Computer network; Computer data storage; Data retrieval; Decoding methods; Algorithm; Data mining","score_opus":0.07345067531008968,"score_gpt":0.18448845288909035,"score_spread":0.11103777757900067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287556996","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.27004558,0.0009795727,0.7244008,0.00038386174,0.00006220194,0.00008427222,0.00011143419,0.00080864347,0.0031236263],"genre_scores_gemma":[0.9704728,0.00013197823,0.028575953,0.000027218342,0.000011750532,0.00003000512,0.000030882566,0.00002113388,0.0006982187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946815,0.00012958694,0.000032839915,0.00007550484,0.00017575284,0.000118101605],"domain_scores_gemma":[0.997799,0.0011982787,0.00021528194,0.00026641556,0.000422575,0.000098345794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072534574,0.00040727988,0.00067746243,0.00041950092,0.00072937156,0.0010111256,0.0009907193,0.0006289279,0.0008238817],"category_scores_gemma":[0.0051170127,0.000237585,0.00015155351,0.00066453376,0.0007457635,0.0013942762,0.00082151464,0.0005003683,0.00012992424],"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.00034605514,0.00009107514,0.001127927,0.00013813635,0.000020952117,0.00019447009,0.00013730746,0.91639555,0.018937392,0.030350221,0.001587209,0.030673733],"study_design_scores_gemma":[0.000011173744,0.000018919447,0.000064198066,0.0000035648773,0.00000321871,0.000017404845,0.000013067765,0.99270004,0.0020175634,0.004972646,0.00017332536,0.0000049655014],"about_ca_topic_score_codex":0.0066188565,"about_ca_topic_score_gemma":0.005421796,"teacher_disagreement_score":0.0066188565,"about_ca_system_score_codex":0.0018461515,"about_ca_system_score_gemma":0.0018384228,"threshold_uncertainty_score":0.013394833},"labels":[],"label_agreement":null},{"id":"W4287902791","doi":"10.48550/arxiv.2001.06959","title":"Non-Orthogonal Multiple Access with Wireless Caching for 5G-Enabled\\n Vehicular Networks","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Noma; Computer network; Spectral efficiency; Key (lock); Wireless network; Vehicular ad hoc network; Latency (audio); Wireless; Computer architecture; Telecommunications; Channel (broadcasting); Wireless ad hoc network; Computer security; Telecommunications link","score_opus":0.0699085729145547,"score_gpt":0.1890172181635141,"score_spread":0.11910864524895941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287902791","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.09553948,0.009267966,0.8731603,0.0015041386,0.00034814765,0.00008381505,0.00009249326,0.0007163105,0.019287426],"genre_scores_gemma":[0.95113343,0.0031515295,0.041121855,0.0001778621,0.00010979858,0.000038118782,0.000075566735,0.000020182004,0.0041717747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997402,0.000085543696,0.000009618216,0.00002999852,0.00007468743,0.000059917307],"domain_scores_gemma":[0.99969685,0.00009435692,0.0000282036,0.00006493312,0.00009761784,0.000018004486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039527589,0.0003143867,0.00035378936,0.0003645355,0.0005128085,0.00071920257,0.00067077775,0.00043927162,0.0011087032],"category_scores_gemma":[0.0008899926,0.00015396178,0.00014353512,0.0007074478,0.00041886317,0.00087547564,0.00061143644,0.00046236702,0.00024969585],"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.00041389975,0.00017914399,0.004437384,0.00043993222,0.00016015524,0.00076976715,0.00037237673,0.18683879,0.08395232,0.38693762,0.017432665,0.31806603],"study_design_scores_gemma":[0.000019359048,0.00016976272,0.0006853833,0.000048257763,0.000052240575,0.00034801336,0.00016306392,0.9033365,0.013669859,0.055146024,0.026326893,0.000034569275],"about_ca_topic_score_codex":0.0038774202,"about_ca_topic_score_gemma":0.011349536,"teacher_disagreement_score":0.0038774202,"about_ca_system_score_codex":0.0007952724,"about_ca_system_score_gemma":0.0009444939,"threshold_uncertainty_score":0.0077097416},"labels":[],"label_agreement":null},{"id":"W4288312810","doi":"10.1145/3507917","title":"Cross-User Similarities in Viewing Behavior for 360° Video and Caching Implications","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Caching and Content Delivery","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 Saskatchewan","funders":"Vetenskapsrådet","keywords":"Viewport; Computer science; Bandwidth (computing); Quality of experience; TRACE (psycholinguistics); Computer network; Multimedia; Quality of service; Artificial intelligence","score_opus":0.04357720769560798,"score_gpt":0.3203986641969808,"score_spread":0.27682145650137285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288312810","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.9415764,0.00017357292,0.05458132,0.00006494779,0.000013952157,0.00006959785,0.00026964766,0.00029905542,0.0029515713],"genre_scores_gemma":[0.99485046,0.000048622005,0.0045554214,0.000012129226,0.000004170627,0.000014461221,0.00015400373,0.000029417759,0.0003313291],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980666,0.00063806016,0.00011456187,0.0004423857,0.00056591677,0.00017255438],"domain_scores_gemma":[0.9833951,0.00885712,0.0016168732,0.0026030077,0.002947325,0.0005806988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013785982,0.00042955927,0.00051444466,0.0010370016,0.00046094894,0.0012729561,0.0005132119,0.0004498117,0.0015545372],"category_scores_gemma":[0.0151001755,0.0002804205,0.00039133322,0.0010218847,0.00038845066,0.0015723155,0.0008693367,0.0006506001,0.00032115227],"study_design_candidate":"observational","study_design_consensus":"observational","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.0023927633,0.000633629,0.6576227,0.00037791702,0.00049156445,0.0012090934,0.0061158487,0.039314147,0.08632697,0.00687586,0.0014568637,0.19718261],"study_design_scores_gemma":[0.000019021878,0.0009920523,0.6222283,0.000060715785,0.00022176404,0.004065186,0.0054827463,0.3097048,0.046091825,0.0069214846,0.0040164003,0.00019570495],"about_ca_topic_score_codex":0.005469954,"about_ca_topic_score_gemma":0.006004959,"teacher_disagreement_score":0.005469954,"about_ca_system_score_codex":0.0005633926,"about_ca_system_score_gemma":0.00044682747,"threshold_uncertainty_score":0.010876238},"labels":[],"label_agreement":null},{"id":"W4293067430","doi":"10.1007/978-3-030-98120-4_10","title":"The Carbon Footprint of Streaming Media: Problems, Calculations, Solutions","year":2022,"lang":"en","type":"book-chapter","venue":"Palgrave studies in media and environmental communication","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Carbon footprint; Footprint; Computer science; Environmental science; Geology; Paleontology; Oceanography; Greenhouse gas","score_opus":0.052295746729833406,"score_gpt":0.2440327500165247,"score_spread":0.1917370032866913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293067430","genre_codex":"other","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.056674603,0.2098888,0.24002068,0.113244995,0.005015592,0.00021573728,0.0045074387,0.0010555704,0.36937654],"genre_scores_gemma":[0.6136696,0.18486135,0.09656444,0.0033279022,0.0031948467,0.00028626024,0.0012851238,0.00073014316,0.09608035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995388,0.0001280014,0.00001629262,0.0000584975,0.00020077903,0.000057594534],"domain_scores_gemma":[0.99808264,0.0012892352,0.000064663895,0.00011403885,0.0003858282,0.00006369526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009649714,0.0013449833,0.0008871061,0.0018706421,0.00082327,0.0039862436,0.0017246421,0.0027593656,0.0105067445],"category_scores_gemma":[0.00392049,0.0005599807,0.00050481065,0.0056993077,0.00275071,0.006593556,0.0009503098,0.0028458366,0.0010983642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000027653015,0.0000835592,0.0009892189,0.00039788627,0.000025279362,0.00012919115,0.00013265968,0.035711024,0.0005404744,0.83538425,0.040439516,0.086139366],"study_design_scores_gemma":[0.000004405438,0.000017170521,0.0007703114,0.00023897238,0.000014201507,0.00014572634,0.0004924379,0.046518866,0.0007003529,0.91253614,0.03852357,0.000037838483],"about_ca_topic_score_codex":0.021495376,"about_ca_topic_score_gemma":0.027915847,"teacher_disagreement_score":0.021495376,"about_ca_system_score_codex":0.004407591,"about_ca_system_score_gemma":0.0022531857,"threshold_uncertainty_score":0.042740524},"labels":[],"label_agreement":null},{"id":"W4293078542","doi":"10.21203/rs.3.rs-1713271/v1","title":"A GNN-based Proactive Caching Strategy in NDN Networks","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"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 Waterloo; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; False sharing; Computer network; Latency (audio); Cache algorithms; Smart Cache; Network topology; CPU cache","score_opus":0.10315462003968622,"score_gpt":0.3870020600279918,"score_spread":0.2838474399883056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293078542","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.34132275,0.0027551292,0.64656854,0.0010885358,0.00022165665,0.00019943858,0.00067644665,0.0023793716,0.004788231],"genre_scores_gemma":[0.94845194,0.00031300297,0.04918562,0.00015583701,0.000024721983,0.0000443812,0.00037106764,0.00003563063,0.0014178571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962914,0.000089431145,0.000024398943,0.000093669776,0.00007402797,0.00008931403],"domain_scores_gemma":[0.9986582,0.0004825797,0.00013820807,0.0001470157,0.00047562362,0.00009839857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008679864,0.0007614688,0.0009157914,0.00076363643,0.00070726004,0.00082828704,0.0022062568,0.00083054864,0.0007666054],"category_scores_gemma":[0.0034284047,0.0002752232,0.0004069725,0.0009286091,0.0005219225,0.0018878423,0.00078897004,0.0005239572,0.00016845636],"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.00041179932,0.00017339985,0.0057942374,0.00014661426,0.0000793768,0.00021344051,0.00011672275,0.8646639,0.0057772426,0.006298982,0.005808486,0.110515796],"study_design_scores_gemma":[0.000007462097,0.000026020478,0.00022044628,0.000004931731,0.000012315197,0.00003388403,0.000016921242,0.99721307,0.0009273088,0.0012401718,0.00029113318,0.000006342622],"about_ca_topic_score_codex":0.024839528,"about_ca_topic_score_gemma":0.03610622,"teacher_disagreement_score":0.024839528,"about_ca_system_score_codex":0.0027316073,"about_ca_system_score_gemma":0.001210099,"threshold_uncertainty_score":0.0493899},"labels":[],"label_agreement":null},{"id":"W4293198317","doi":"10.1109/tmc.2022.3199876","title":"Multi-Objective Parallel Task Offloading and Content Caching in D2D-aided MEC Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Task (project management); Computer network; Distributed computing","score_opus":0.027613079849307456,"score_gpt":0.2406868773261701,"score_spread":0.21307379747686267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293198317","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.1435231,0.0011620249,0.8470461,0.00049869565,0.00012424638,0.00011188366,0.00012805304,0.0005401094,0.006865805],"genre_scores_gemma":[0.92000556,0.00031233413,0.07602761,0.00011305818,0.00003112464,0.00009840254,0.00012528348,0.000045754317,0.0032408182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996007,0.000118059936,0.000018086837,0.00008405399,0.000074716976,0.00010434146],"domain_scores_gemma":[0.99923754,0.0004572199,0.00007148518,0.00004747597,0.00011874433,0.00006750875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064078247,0.0010368851,0.0013557154,0.00040067642,0.0007261311,0.001088553,0.0010596354,0.0011508282,0.0011459898],"category_scores_gemma":[0.0013279092,0.00050886004,0.00048211162,0.00083578326,0.00054787105,0.0010706307,0.000852105,0.0006895442,0.00016848672],"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.000080952275,0.000041913863,0.00037716937,0.000044014043,0.000020164378,0.00008715794,0.00002735619,0.9794948,0.0013377409,0.0015350444,0.0007006614,0.016253017],"study_design_scores_gemma":[0.00000524606,0.000012755412,0.000055149092,0.0000015030487,0.000003106324,0.000008424817,0.000008953805,0.9991423,0.00021810016,0.00042615205,0.000116127776,0.0000022282852],"about_ca_topic_score_codex":0.015752362,"about_ca_topic_score_gemma":0.010923286,"teacher_disagreement_score":0.015752362,"about_ca_system_score_codex":0.0012510349,"about_ca_system_score_gemma":0.0011766439,"threshold_uncertainty_score":0.031321347},"labels":[],"label_agreement":null},{"id":"W4295832404","doi":"10.1109/jiot.2022.3206146","title":"Complementing IoT Services Using Software-Defined Information Centric Networks: A Comprehensive Survey","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Provisioning; Computer science; Computer network; Software-defined networking; Information-centric networking; Service (business); Internet of Things; The Internet; Computer security; World Wide Web","score_opus":0.03145829676868901,"score_gpt":0.24671599406051187,"score_spread":0.21525769729182287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295832404","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093680015,0.91709346,0.031044334,0.0013764122,0.0011815821,0.00010235032,0.00016525653,0.00022884048,0.039439816],"genre_scores_gemma":[0.03896833,0.93908125,0.015148812,0.0008243334,0.0012568505,0.0000792435,0.00051192864,0.000060067945,0.004069251],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936146,0.00008658439,0.000078398436,0.0000978475,0.00029589658,0.00007982204],"domain_scores_gemma":[0.99923706,0.0003765652,0.000071666036,0.000056877165,0.00020405513,0.000053762265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007451384,0.0009281196,0.00068592303,0.004310306,0.00052355306,0.00245328,0.00093318574,0.0012005463,0.0020860378],"category_scores_gemma":[0.001303101,0.0005088164,0.00059703796,0.0061418572,0.0004464277,0.005608148,0.0012764672,0.0011880011,0.00092702673],"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.000046753023,0.00009340208,0.0017478977,0.0056628915,0.000039891438,0.00022245373,0.0002993573,0.003155411,0.0022698548,0.053949434,0.012310964,0.9202018],"study_design_scores_gemma":[0.000007792019,0.00017911031,0.0019917437,0.0037057155,0.0001016692,0.00150641,0.00063002744,0.008987121,0.0022641718,0.02333706,0.9572195,0.00006975377],"about_ca_topic_score_codex":0.0009979018,"about_ca_topic_score_gemma":0.0008491077,"teacher_disagreement_score":0.004310306,"about_ca_system_score_codex":0.00059676234,"about_ca_system_score_gemma":0.001110451,"threshold_uncertainty_score":0.006978512},"labels":[],"label_agreement":null},{"id":"W4295934955","doi":"10.1109/access.2022.3206813","title":"Optimal Caching Policy for D2D Assisted Cellular Networks With Different Cache Size Devices","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cache; Computer network; Base station; Cache algorithms; Cellular network; Smart Cache; CPU cache; Heuristic; Cache invalidation; Distributed computing","score_opus":0.030031680703486014,"score_gpt":0.2730350507093662,"score_spread":0.24300337000588015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295934955","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.2536797,0.0028291398,0.7345804,0.00075571716,0.00011802677,0.00015401554,0.00023665707,0.0003661552,0.0072800685],"genre_scores_gemma":[0.9769378,0.0004863056,0.021198377,0.00006188994,0.000025558542,0.000040676612,0.000057829657,0.000020404193,0.0011712685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943906,0.00018475184,0.000025887091,0.00010247961,0.000084030944,0.00016382722],"domain_scores_gemma":[0.9977228,0.0015838251,0.00020581798,0.00010029868,0.0002568812,0.00013034242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006208843,0.0009613067,0.0012023122,0.00077570067,0.00083391776,0.0014326901,0.0012127657,0.001275724,0.00096692564],"category_scores_gemma":[0.0035834883,0.0005508927,0.0004266528,0.001338822,0.0007091218,0.0012841834,0.00067906163,0.00050357747,0.00015746089],"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.00017610534,0.00006445743,0.0012558303,0.00010706734,0.00004097519,0.0001876907,0.00005554623,0.97056997,0.0033385572,0.0070435056,0.0012931628,0.015867222],"study_design_scores_gemma":[0.000010603606,0.000034513214,0.00016533892,0.0000050544418,0.000013935319,0.000036061527,0.000029145669,0.9973768,0.00044900508,0.0017290022,0.00014466613,0.0000058810124],"about_ca_topic_score_codex":0.011070135,"about_ca_topic_score_gemma":0.010137448,"teacher_disagreement_score":0.011070135,"about_ca_system_score_codex":0.0023536112,"about_ca_system_score_gemma":0.0014373036,"threshold_uncertainty_score":0.0220114},"labels":[],"label_agreement":null},{"id":"W4297095015","doi":"10.1109/jiot.2022.3209256","title":"iCache: An Intelligent Caching Scheme for Dynamic Network Environments in ICN-Based IoT Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Carleton University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Scheme (mathematics); Internet of Things; Intelligent Network; Distributed computing; Embedded system","score_opus":0.01738348445367328,"score_gpt":0.247687785612544,"score_spread":0.23030430115887074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297095015","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.07203235,0.0017128354,0.9099032,0.00046151655,0.000480715,0.0004474593,0.00021350497,0.006742816,0.008005625],"genre_scores_gemma":[0.83194536,0.00058526534,0.16274358,0.00045862645,0.0001493666,0.00020751504,0.00030086882,0.00020894864,0.0034005654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.0001370045,0.00006502884,0.00013401841,0.00016524308,0.00016535309],"domain_scores_gemma":[0.9976398,0.00052180333,0.0002186781,0.0006859296,0.0006853744,0.00024844546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012335125,0.000947475,0.0011536112,0.0010213124,0.0014148867,0.0014110603,0.003003115,0.0011046623,0.0013352819],"category_scores_gemma":[0.004205877,0.00033312468,0.00036815208,0.001093991,0.0008049534,0.0025651373,0.0017435638,0.0010415323,0.0003890514],"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.0013663835,0.0005566809,0.00667039,0.00041399992,0.00020485271,0.0008100289,0.0007540984,0.41559184,0.06308363,0.07267834,0.03492881,0.40294093],"study_design_scores_gemma":[0.000044515044,0.00008276296,0.00038919153,0.00002024738,0.000047611513,0.00017555825,0.000055010594,0.98157203,0.006748153,0.0054420745,0.0053746966,0.000048086036],"about_ca_topic_score_codex":0.008694835,"about_ca_topic_score_gemma":0.015113037,"teacher_disagreement_score":0.008694835,"about_ca_system_score_codex":0.002172052,"about_ca_system_score_gemma":0.0019770872,"threshold_uncertainty_score":0.017288446},"labels":[],"label_agreement":null},{"id":"W4297685043","doi":"10.48550/arxiv.1206.6185","title":"Performance Evaluation of A Proposed Variant of Frequency Count (VFC)\\n List Accessing Algorithm","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Algorithm; Computer science; Count data; Data set; Mathematics; Artificial intelligence; Statistics; Programming language","score_opus":0.110242484601647,"score_gpt":0.21495353212996,"score_spread":0.10471104752831299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297685043","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.7841027,0.0052694343,0.16665591,0.0012073506,0.00039668268,0.00055994414,0.0017667118,0.028303022,0.011738248],"genre_scores_gemma":[0.80661726,0.0005674386,0.18651125,0.00019083369,0.00007986473,0.00015722543,0.0026452583,0.00037960245,0.0028511973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962727,0.0009601186,0.00036289467,0.0006327927,0.0012396058,0.0005318627],"domain_scores_gemma":[0.9916122,0.0034593302,0.0003978539,0.0019841848,0.0021517575,0.00039466872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026930342,0.000844438,0.0014704108,0.0021130252,0.0014232716,0.00222778,0.0035005447,0.0017098505,0.0021946065],"category_scores_gemma":[0.011665864,0.00026612345,0.00035848672,0.004097971,0.0008297703,0.002985858,0.0012074572,0.00085551944,0.0007224166],"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.0055864393,0.0015100967,0.024150645,0.0006480725,0.00032491836,0.00026251207,0.00044589865,0.22248067,0.034249842,0.010368178,0.029049238,0.6709235],"study_design_scores_gemma":[0.00017678113,0.00048353817,0.002319407,0.000011575995,0.000047122056,0.00022656952,0.00014812201,0.97430927,0.017931554,0.0013178944,0.0029844835,0.0000435772],"about_ca_topic_score_codex":0.02499906,"about_ca_topic_score_gemma":0.016988996,"teacher_disagreement_score":0.02499906,"about_ca_system_score_codex":0.0033239962,"about_ca_system_score_gemma":0.0040979963,"threshold_uncertainty_score":0.049707055},"labels":[],"label_agreement":null},{"id":"W4297802369","doi":"10.1109/iccworkshops53468.2022.9882165","title":"Dynamic Caching in a Hybrid Millimeter-wave/Microwave C-RAN","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Communications Workshops (ICC Workshops)","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Computer science; Radio access network; Cache; Markov decision process; Computer network; Latency (audio); Cloud computing; Wireless; Optimization problem; Wireless network; Cellular network; Access network; Markov chain; Markov process; Distributed computing; Base station; Telecommunications; Algorithm","score_opus":0.07471750352792537,"score_gpt":0.30280581484313285,"score_spread":0.22808831131520746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297802369","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.15602873,0.00081256963,0.8345859,0.00053969683,0.00006420446,0.000101117286,0.00014198569,0.00043515873,0.007290715],"genre_scores_gemma":[0.9301992,0.00018060757,0.06594033,0.00011917855,0.000021670066,0.000074343356,0.00005298305,0.000033135522,0.003378594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994211,0.00017719662,0.000017597275,0.00013283291,0.00010060335,0.00015071605],"domain_scores_gemma":[0.9990715,0.00055297825,0.000118125114,0.000060142604,0.00012285927,0.0000742771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009789426,0.0007133098,0.00096342945,0.00038837106,0.00063661917,0.0011996032,0.0017035634,0.0012126352,0.0014850391],"category_scores_gemma":[0.0015929403,0.00045311483,0.00046210116,0.00077259744,0.00081321667,0.0009369012,0.00081350957,0.0007328912,0.00015779606],"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.000092300324,0.00003984063,0.0003648128,0.000017899993,0.000017355556,0.00008473282,0.000014598435,0.98628914,0.0011094783,0.0059759472,0.00028570698,0.0057081813],"study_design_scores_gemma":[0.000004782941,0.000014879838,0.000039415296,0.0000014578313,0.000004716181,0.000012081692,0.0000036772728,0.9990534,0.00018907996,0.00060617196,0.000067669695,0.000002736663],"about_ca_topic_score_codex":0.02010024,"about_ca_topic_score_gemma":0.023546146,"teacher_disagreement_score":0.02010024,"about_ca_system_score_codex":0.0018217813,"about_ca_system_score_gemma":0.0018134044,"threshold_uncertainty_score":0.039966464},"labels":[],"label_agreement":null},{"id":"W4297802385","doi":"10.1109/iccworkshops53468.2022.9882153","title":"GNN-GM: A Proactive Caching Scheme for Named Data Networking","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Communications Workshops (ICC Workshops)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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; University of Ottawa","funders":"","keywords":"Computer science; Cache; False sharing; Latency (audio); Smart Cache; Quality of experience; Scheme (mathematics); Computer network; Cache algorithms; Maximization; CPU cache; Quality of service","score_opus":0.24003915832986808,"score_gpt":0.36973489875653714,"score_spread":0.12969574042666906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297802385","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.10461802,0.0024372207,0.8801941,0.00056731334,0.00027247003,0.00021363118,0.0004977319,0.006612923,0.004586541],"genre_scores_gemma":[0.88031834,0.0005538461,0.11525215,0.00026335413,0.00006607668,0.00007751433,0.00056311756,0.00011742406,0.0027881367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996401,0.000095572424,0.000024429013,0.00008355675,0.00009417366,0.00006216473],"domain_scores_gemma":[0.99892265,0.0002457983,0.00012464199,0.00026970467,0.00034345427,0.00009370379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073910336,0.0008447547,0.000918544,0.0007489384,0.0006546792,0.00061782834,0.0022676792,0.000861519,0.0008699926],"category_scores_gemma":[0.0024342407,0.00021595682,0.0003945619,0.0010412426,0.00049545587,0.001774736,0.0010264702,0.000704692,0.0002943071],"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.0009432611,0.0005506972,0.006671217,0.00040419216,0.00025114376,0.0005420036,0.00023274067,0.46885535,0.032656487,0.018813426,0.02467441,0.44540513],"study_design_scores_gemma":[0.000021310665,0.000087768654,0.00047498246,0.000009617587,0.000030951647,0.00015018634,0.000021185375,0.9887371,0.0045976816,0.0041455263,0.0017003036,0.000023375385],"about_ca_topic_score_codex":0.009716159,"about_ca_topic_score_gemma":0.021560121,"teacher_disagreement_score":0.009716159,"about_ca_system_score_codex":0.0014328853,"about_ca_system_score_gemma":0.0010783955,"threshold_uncertainty_score":0.019319177},"labels":[],"label_agreement":null},{"id":"W4297917719","doi":"10.48550/arxiv.1806.04580","title":"Online VNF Placement and Chaining for Value-added Services in Content\\n Delivery Networks","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Computer science; Virtual network; Provisioning; Computer network; Chaining; Content delivery network; Control reconfiguration; Quality of service; Distributed computing; Server","score_opus":0.09967209607776854,"score_gpt":0.19432837358075955,"score_spread":0.09465627750299101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297917719","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.08440624,0.00092319504,0.90326107,0.0005450707,0.00022377614,0.0002584259,0.0002421797,0.00051979447,0.009620345],"genre_scores_gemma":[0.77739793,0.0009468015,0.21345012,0.000092095004,0.000086009066,0.00012838162,0.00033475872,0.00022014731,0.007343799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982845,0.00045731603,0.000076521115,0.0004041575,0.00034080632,0.0004366552],"domain_scores_gemma":[0.9977894,0.000996772,0.00034699027,0.00034064235,0.00026347046,0.0002627536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015859341,0.0012834166,0.0011933254,0.0010819178,0.0014149683,0.00306162,0.0026200477,0.0018390012,0.0060162204],"category_scores_gemma":[0.0062346673,0.0009052705,0.0008595265,0.0015870158,0.0009731019,0.0032843922,0.0025386624,0.0012317074,0.000847399],"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.00013756454,0.0001301443,0.0018313843,0.00019055918,0.000028483644,0.0003800442,0.00014642302,0.8501814,0.0038392092,0.0385119,0.0035993466,0.10102361],"study_design_scores_gemma":[0.000005875342,0.000052497067,0.00032377796,0.000026606984,0.000013946827,0.00012825117,0.0001022061,0.9865428,0.0011439135,0.009119383,0.0025259657,0.0000148176905],"about_ca_topic_score_codex":0.010398918,"about_ca_topic_score_gemma":0.010987705,"teacher_disagreement_score":0.010398918,"about_ca_system_score_codex":0.0029916493,"about_ca_system_score_gemma":0.0019211473,"threshold_uncertainty_score":0.021706045},"labels":[],"label_agreement":null},{"id":"W4306177155","doi":"10.48550/arxiv.2210.05874","title":"Multi-Content Time-Series Popularity Prediction with Multiple-Model Transformers in MEC Networks","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","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":"Ministère de la Défense Nationale","keywords":"Computer science; Cache; Popularity; Boosting (machine learning); Mobile device; Generalization; Enhanced Data Rates for GSM Evolution; Transformer; Artificial intelligence; Data mining; Computer network; World Wide Web; Engineering; Mathematics","score_opus":0.07717167065124027,"score_gpt":0.17402345974110414,"score_spread":0.09685178908986387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306177155","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.08226902,0.000987635,0.91309226,0.0004804836,0.00006790431,0.000044381755,0.00025172622,0.0006243977,0.0021821],"genre_scores_gemma":[0.9748555,0.00046729593,0.022136567,0.00011770836,0.000043149874,0.00004601703,0.00025221903,0.000042156382,0.0020394565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00011877518,0.000020480386,0.00010923294,0.00007606615,0.000081089376],"domain_scores_gemma":[0.9977991,0.001502683,0.00019995078,0.00010532456,0.00032277976,0.000070145696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011596355,0.000848164,0.0010020427,0.0005502622,0.00034640022,0.00083181786,0.0016336326,0.00091522036,0.0011510119],"category_scores_gemma":[0.0045529096,0.0004895311,0.00072656927,0.00079855643,0.0006250142,0.0015346636,0.0008317394,0.0012413793,0.00026299097],"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.000072062445,0.000019642544,0.0011745347,0.0000311966,0.000023863462,0.00007227925,0.000032741118,0.9779664,0.0005066444,0.005675886,0.00049206876,0.013932557],"study_design_scores_gemma":[9.347845e-7,0.0000035577002,0.000038446036,8.907773e-7,0.0000022150343,0.0000048871843,0.0000022100546,0.99920505,0.00004267834,0.00066908856,0.000028650094,0.0000014017129],"about_ca_topic_score_codex":0.025598776,"about_ca_topic_score_gemma":0.01675126,"teacher_disagreement_score":0.025598776,"about_ca_system_score_codex":0.0015750786,"about_ca_system_score_gemma":0.0008002952,"threshold_uncertainty_score":0.050899506},"labels":[],"label_agreement":null},{"id":"W4306763675","doi":"10.1145/3551661.3561372","title":"Cache-Aided Delivery Network in a Shared Cache Framework with Correlated Sources","year":2022,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Cache; Computer science; Smart Cache; Computer network; Cache algorithms; Cluster analysis; Distributed computing; CPU cache","score_opus":0.011581784455626883,"score_gpt":0.19057838576933125,"score_spread":0.17899660131370437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306763675","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.054746483,0.00070375385,0.94115365,0.0002596822,0.00003019489,0.00007248394,0.00012213906,0.00039531905,0.0025161738],"genre_scores_gemma":[0.85619515,0.000627256,0.13710131,0.00014172464,0.000053549993,0.00017761916,0.00015372272,0.000049191625,0.0055004624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992459,0.00028554822,0.000035347348,0.00016380839,0.00017950933,0.0000899385],"domain_scores_gemma":[0.9986594,0.0006151578,0.00018652428,0.00016056429,0.00031468755,0.00006373645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010403686,0.0006966136,0.0013565879,0.00086373376,0.00095298456,0.0013238759,0.0022156527,0.0011041957,0.0013395253],"category_scores_gemma":[0.002277245,0.0004560463,0.00054249744,0.0015819902,0.0008026253,0.0018396983,0.0016657336,0.0007266104,0.00034338853],"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.00033959278,0.0000737501,0.00066419796,0.000112038004,0.00009540988,0.0004151881,0.0002367914,0.89958996,0.009303366,0.042832963,0.0020623526,0.044274487],"study_design_scores_gemma":[0.0000171209,0.000060780425,0.00007984835,0.000007802021,0.000025635227,0.00013114318,0.000025115241,0.99247885,0.0015388693,0.004742699,0.0008775876,0.000014549677],"about_ca_topic_score_codex":0.00425113,"about_ca_topic_score_gemma":0.0049882825,"teacher_disagreement_score":0.00425113,"about_ca_system_score_codex":0.0022102166,"about_ca_system_score_gemma":0.0011946185,"threshold_uncertainty_score":0.016036332},"labels":[],"label_agreement":null},{"id":"W4306763796","doi":"10.1145/3551661.3561373","title":"Modeling of Edge Server Cache-Reservation for Virtual Reality Applications","year":2022,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Computer science; Cache; Computer network; Server; Cache coloring; Cache algorithms; Cloud computing; Bottleneck; Operating system; CPU cache; Embedded system","score_opus":0.06740304601893043,"score_gpt":0.2765487511104973,"score_spread":0.20914570509156688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306763796","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.1833937,0.0018366132,0.7856927,0.00096974696,0.00017763037,0.00021407602,0.00062564603,0.00076031144,0.02632953],"genre_scores_gemma":[0.9667987,0.00076351466,0.02064316,0.000102177684,0.000041115352,0.00015746162,0.00016142138,0.00008923859,0.01124317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952114,0.00011638837,0.000022384404,0.00009278362,0.00011618156,0.00013115782],"domain_scores_gemma":[0.9993881,0.00022187766,0.00008642426,0.00004268534,0.00022378408,0.000037212572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056898355,0.00073303055,0.0009097349,0.0005957306,0.0006601338,0.0016812114,0.00276017,0.0015218251,0.003933716],"category_scores_gemma":[0.001487669,0.00050017063,0.00070205337,0.00080871914,0.00061492575,0.0016528425,0.000679184,0.0009374307,0.0007266205],"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.00004596917,0.000034647695,0.0005406552,0.000032260912,0.00001142745,0.00010326919,0.00004325873,0.98206747,0.0020598045,0.012046043,0.00054229505,0.002472839],"study_design_scores_gemma":[0.000001780736,0.0000043445084,0.000043609325,0.0000013819194,0.0000024033234,0.000008995688,0.000005692848,0.99927336,0.00010703014,0.00041430493,0.00013464861,0.0000024130518],"about_ca_topic_score_codex":0.02649577,"about_ca_topic_score_gemma":0.01589869,"teacher_disagreement_score":0.02649577,"about_ca_system_score_codex":0.002234724,"about_ca_system_score_gemma":0.0018481171,"threshold_uncertainty_score":0.052683055},"labels":[],"label_agreement":null},{"id":"W4307818237","doi":"10.32920/21453783.v1","title":"Performance of cache placement using supervised learning techniques in mobile edge networks","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Cache; Computer science; Cache algorithms; Smart Cache; Support vector machine; Computer network; Enhanced Data Rates for GSM Evolution; Cache invalidation; CPU cache; Machine learning; Artificial intelligence","score_opus":0.02970217564353441,"score_gpt":0.25913160433834065,"score_spread":0.22942942869480623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307818237","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.86532414,0.0014780122,0.12685896,0.0003705877,0.000108994,0.00006345915,0.00013699073,0.0015435928,0.004115123],"genre_scores_gemma":[0.986027,0.00011040891,0.012991968,0.00004502759,0.000011532049,0.00002046013,0.00012736525,0.000016168757,0.000650061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994205,0.00020802987,0.000035640594,0.00010245992,0.00011601696,0.00011739763],"domain_scores_gemma":[0.9979583,0.0010927304,0.00023822843,0.00011171677,0.00050021923,0.00009880732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010777059,0.00070614746,0.00094004686,0.00046553288,0.00041593722,0.000556259,0.00082994346,0.0007279814,0.00055147137],"category_scores_gemma":[0.003206131,0.00021753176,0.00033544475,0.0005356307,0.0003646017,0.0006898298,0.0004949034,0.0004995729,0.00015646381],"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.0003096168,0.0002268874,0.0030880482,0.000040505704,0.00003575223,0.000055655895,0.000029965177,0.9394842,0.0015288553,0.0003229355,0.0007748552,0.054102812],"study_design_scores_gemma":[0.0000024197036,0.000031900072,0.00019553544,0.000001036146,0.0000018285099,0.0000045078455,0.0000051033303,0.9993863,0.00028388496,0.00006864993,0.00001759042,0.000001218752],"about_ca_topic_score_codex":0.013260966,"about_ca_topic_score_gemma":0.009329226,"teacher_disagreement_score":0.013260966,"about_ca_system_score_codex":0.0009986255,"about_ca_system_score_gemma":0.00078840787,"threshold_uncertainty_score":0.026367545},"labels":[],"label_agreement":null},{"id":"W4307818238","doi":"10.32920/21453783","title":"Performance of cache placement using supervised learning techniques in mobile edge networks","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Cache; Computer science; Cache algorithms; Smart Cache; Support vector machine; Enhanced Data Rates for GSM Evolution; Computer network; Cache invalidation; Base station; CPU cache; Machine learning; Artificial intelligence","score_opus":0.02970217564353441,"score_gpt":0.25913160433834065,"score_spread":0.22942942869480623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307818238","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.86532414,0.0014780122,0.12685896,0.0003705877,0.000108994,0.00006345915,0.00013699073,0.0015435928,0.004115123],"genre_scores_gemma":[0.986027,0.00011040891,0.012991968,0.00004502759,0.000011532049,0.00002046013,0.00012736525,0.000016168757,0.000650061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994205,0.00020802987,0.000035640594,0.00010245992,0.00011601696,0.00011739763],"domain_scores_gemma":[0.9979583,0.0010927304,0.00023822843,0.00011171677,0.00050021923,0.00009880732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010777059,0.00070614746,0.00094004686,0.00046553288,0.00041593722,0.000556259,0.00082994346,0.0007279814,0.00055147137],"category_scores_gemma":[0.003206131,0.00021753176,0.00033544475,0.0005356307,0.0003646017,0.0006898298,0.0004949034,0.0004995729,0.00015646381],"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.0003096168,0.0002268874,0.0030880482,0.000040505704,0.00003575223,0.000055655895,0.000029965177,0.9394842,0.0015288553,0.0003229355,0.0007748552,0.054102812],"study_design_scores_gemma":[0.0000024197036,0.000031900072,0.00019553544,0.000001036146,0.0000018285099,0.0000045078455,0.0000051033303,0.9993863,0.00028388496,0.00006864993,0.00001759042,0.000001218752],"about_ca_topic_score_codex":0.013260966,"about_ca_topic_score_gemma":0.009329226,"teacher_disagreement_score":0.013260966,"about_ca_system_score_codex":0.0009986255,"about_ca_system_score_gemma":0.00078840787,"threshold_uncertainty_score":0.026367545},"labels":[],"label_agreement":null},{"id":"W4308087770","doi":"10.1109/ds-rt55542.2022.9932076","title":"Mobility-based Multi-layered Caching and Data Distribution in Vehicular Fog Computing","year":2022,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Brock University","funders":"","keywords":"Computer science; Cache; Vehicular ad hoc network; Computer network; Distributed computing; Smart Cache; Distributive property; Server; Data access; Cache invalidation; Cache algorithms; CPU cache; Database; Operating system; Wireless ad hoc network; Wireless","score_opus":0.05060366321348817,"score_gpt":0.28088800071129816,"score_spread":0.23028433749781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308087770","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.18319283,0.00075746776,0.81105065,0.00031466156,0.00006589594,0.00007572774,0.000049819868,0.00025613382,0.0042368537],"genre_scores_gemma":[0.97935474,0.00013850418,0.01995641,0.000024956362,0.000006458102,0.000014946986,0.000013792152,0.000009387831,0.00048081923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993912,0.00023092897,0.000031886942,0.00008449186,0.00010677553,0.00015470783],"domain_scores_gemma":[0.9992811,0.00023864592,0.00008709037,0.00014015897,0.000180974,0.00007202549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353911,0.00027330575,0.00042596867,0.00045063204,0.0007724013,0.0011877351,0.0010871586,0.0005402312,0.0002546738],"category_scores_gemma":[0.0022315534,0.00022465528,0.00039429456,0.00059664657,0.00074810785,0.0013352546,0.0008791911,0.0003931807,0.000055217242],"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.00014396067,0.00008000508,0.0046661077,0.00006148387,0.0000899408,0.00043820188,0.00042823039,0.8550499,0.012311907,0.096037,0.0010146765,0.02967864],"study_design_scores_gemma":[0.0000040032915,0.000021706328,0.00050269667,0.000007064447,0.000018550618,0.000070536924,0.00007423134,0.98846346,0.0015461694,0.00851298,0.00076446723,0.00001413444],"about_ca_topic_score_codex":0.018768705,"about_ca_topic_score_gemma":0.018239202,"teacher_disagreement_score":0.018768705,"about_ca_system_score_codex":0.0018710358,"about_ca_system_score_gemma":0.0014279146,"threshold_uncertainty_score":0.037318885},"labels":[],"label_agreement":null},{"id":"W4312305523","doi":"10.1109/tmc.2022.3226448","title":"Fine-Grained Spatio-Temporal Distribution Prediction of Mobile Content Delivery in 5G Ultra-Dense Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Provisioning; Distributed computing; Dependency (UML); Feature (linguistics); Data mining; Computer network; Artificial intelligence","score_opus":0.020296553853010362,"score_gpt":0.21829247684625547,"score_spread":0.19799592299324512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312305523","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.40264964,0.0013518803,0.59176606,0.0005307017,0.00009466165,0.000050653318,0.00061433215,0.0012355112,0.0017065401],"genre_scores_gemma":[0.9713978,0.0003748448,0.026940186,0.00006822861,0.000042450898,0.00002109413,0.0004535521,0.000017634238,0.00068399566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998386,0.00002803382,0.000008687107,0.00005105847,0.00004035592,0.000033135148],"domain_scores_gemma":[0.9996306,0.00016442529,0.000060337854,0.000037780253,0.000081225895,0.000025657064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030616543,0.0005829486,0.00044931585,0.000607255,0.0002434059,0.0004070951,0.00075872353,0.00046720443,0.00027900975],"category_scores_gemma":[0.0013545287,0.00022669273,0.00028436037,0.0006974998,0.00028289424,0.00084561115,0.00042154876,0.0005901432,0.00013636713],"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.00020643472,0.000099715224,0.016015952,0.00006829324,0.000050296283,0.00023769602,0.00010013242,0.84366786,0.006358559,0.0030715507,0.0023546715,0.1277689],"study_design_scores_gemma":[0.0000011514973,0.0000052463974,0.0007521438,0.000001299775,0.0000029161195,0.000011665101,0.0000062102004,0.9983912,0.0003143601,0.0004135042,0.00009859561,0.0000017199051],"about_ca_topic_score_codex":0.018169416,"about_ca_topic_score_gemma":0.015841702,"teacher_disagreement_score":0.018169416,"about_ca_system_score_codex":0.0006315001,"about_ca_system_score_gemma":0.00043501722,"threshold_uncertainty_score":0.03612727},"labels":[],"label_agreement":null},{"id":"W4312807099","doi":"10.1007/978-3-031-06947-5_15","title":"Semi-supervised Learning with Self-training Classifier for Cache Placement in Mobile Edge Networks","year":2022,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"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; Cache; Classifier (UML); Machine learning; Artificial intelligence; Training set; Enhanced Data Rates for GSM Evolution; Popularity; Data mining; Computer network","score_opus":0.026575911952448527,"score_gpt":0.23188174493931699,"score_spread":0.20530583298686847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312807099","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.035533667,0.0008610653,0.9598311,0.00020123017,0.00013741667,0.000059107304,0.00018740783,0.0021120703,0.0010769791],"genre_scores_gemma":[0.6491065,0.00043093273,0.34056434,0.00028246775,0.00027212786,0.00021433702,0.0011322306,0.00025052548,0.007746433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905056,0.0002901382,0.00006486762,0.00028804675,0.00015433272,0.00015200015],"domain_scores_gemma":[0.996997,0.0016696564,0.00016584071,0.0002825006,0.0008063788,0.00007866567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016159752,0.0009120157,0.0017315594,0.00064514426,0.0005900267,0.0008548753,0.0023734898,0.0016381931,0.001259194],"category_scores_gemma":[0.0034914315,0.0005201557,0.0007347801,0.0010005983,0.00058085326,0.0015625547,0.00088280067,0.001609076,0.00091574946],"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.00031113927,0.00031257575,0.002045329,0.00013053976,0.000102436534,0.00010777293,0.00010345906,0.4199797,0.004439603,0.002866393,0.0107947225,0.55880636],"study_design_scores_gemma":[0.000002398081,0.000017709064,0.00008886654,0.0000026535731,0.0000038700464,0.000010414961,0.00000590151,0.9984982,0.00053050875,0.00068002805,0.00015682504,0.0000026599935],"about_ca_topic_score_codex":0.0074837613,"about_ca_topic_score_gemma":0.007800278,"teacher_disagreement_score":0.0074837613,"about_ca_system_score_codex":0.00093567465,"about_ca_system_score_gemma":0.0010720142,"threshold_uncertainty_score":0.014880359},"labels":[],"label_agreement":null},{"id":"W4313167004","doi":"10.1109/tcomm.2022.3226186","title":"Optimizing Caching in a C-RAN With a Hybrid Millimeter-Wave/Microwave Fronthaul Link via Dynamic Programming","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Radio access network; Cache; Computer network; Backup; Latency (audio); Cellular network; Cloud computing; Key (lock); Markov decision process; Distributed computing; Markov process; Base station; Telecommunications","score_opus":0.025801369291841035,"score_gpt":0.2385912547649464,"score_spread":0.21278988547310534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313167004","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.1437797,0.00076257024,0.8449136,0.00085070945,0.00007182274,0.00010856417,0.00017108102,0.00045533478,0.008886569],"genre_scores_gemma":[0.89782983,0.00027536307,0.09693321,0.00022021796,0.00003475977,0.00014516398,0.00011987735,0.00007488067,0.004366733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960095,0.000121416284,0.0000115727735,0.00008236917,0.00006734531,0.00011638424],"domain_scores_gemma":[0.99828964,0.0012852693,0.0001270066,0.000034437864,0.00018625085,0.000077385725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097116706,0.0010857546,0.0011315106,0.00043309692,0.00054924877,0.0014135797,0.0010552302,0.001340039,0.0017715784],"category_scores_gemma":[0.002391732,0.0006688352,0.0006201031,0.00070640893,0.0008462556,0.00079380773,0.00076368265,0.0011367898,0.0001819489],"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.000018170691,0.00001916758,0.00015715385,0.000008689133,0.0000067313936,0.00001974802,0.0000037980865,0.9971481,0.00018137474,0.0008865202,0.000106995285,0.0014436239],"study_design_scores_gemma":[0.0000029350772,0.00000620341,0.00001990754,0.0000010463165,0.0000023542143,0.0000022621505,0.0000024635863,0.999579,0.00005453176,0.00030220498,0.000025960639,0.0000010901593],"about_ca_topic_score_codex":0.02719469,"about_ca_topic_score_gemma":0.022615964,"teacher_disagreement_score":0.02719469,"about_ca_system_score_codex":0.0016090279,"about_ca_system_score_gemma":0.0025261191,"threshold_uncertainty_score":0.054072797},"labels":[],"label_agreement":null},{"id":"W4313886758","doi":"10.23919/jcn.2022.000054","title":"Slicing-based resource optimization in multi-access edge network using ensemble learning aided DDPG algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","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":"Carleton University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Mobile edge computing; Wireless network; Distributed computing; Virtual network; Resource allocation; Wireless; Edge computing; Computer network; Server; Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence","score_opus":0.07294231477596194,"score_gpt":0.31744040555547004,"score_spread":0.2444980907795081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313886758","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.046007644,0.00053957256,0.9497892,0.00029134253,0.000051507566,0.00004169432,0.00006304312,0.0004251085,0.0027907572],"genre_scores_gemma":[0.8911342,0.00026795524,0.10564318,0.00020248246,0.000035620367,0.000103466264,0.00017612158,0.0000659205,0.0023711238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.0000958221,0.000016649494,0.00007556211,0.00007245417,0.00009580939],"domain_scores_gemma":[0.999183,0.00047963037,0.00007082719,0.000042926597,0.00015516537,0.00006834491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008908113,0.0008295651,0.0013897258,0.00050877954,0.00041437123,0.0007795871,0.0011081758,0.00091625913,0.0018520445],"category_scores_gemma":[0.0018284329,0.00041631746,0.0005632022,0.00054693554,0.0005927944,0.0010525725,0.0008700561,0.00092505914,0.00020965269],"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.000030578005,0.00001946151,0.00046491774,0.000014897442,0.000017159677,0.000025597828,0.000016169972,0.98212564,0.00031082993,0.0015870304,0.00045837864,0.014929346],"study_design_scores_gemma":[0.0000022881898,0.0000047884337,0.000021056796,8.8537604e-7,0.0000015729273,0.0000021196654,0.0000016907071,0.99944574,0.000041362408,0.0004461835,0.000031477157,7.7030865e-7],"about_ca_topic_score_codex":0.013980798,"about_ca_topic_score_gemma":0.009361329,"teacher_disagreement_score":0.013980798,"about_ca_system_score_codex":0.0010756883,"about_ca_system_score_gemma":0.0016437959,"threshold_uncertainty_score":0.027798831},"labels":[],"label_agreement":null},{"id":"W4313887358","doi":"10.23919/jcn.2022.000051","title":"HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Heuristic; Clique; Network topology; Algorithm; Theoretical computer science; Genetic algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.051666683221326996,"score_gpt":0.29256302870495576,"score_spread":0.24089634548362876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313887358","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.055890594,0.0007866255,0.93273765,0.00033319002,0.00013761349,0.00025285446,0.00018478456,0.0020152319,0.007661419],"genre_scores_gemma":[0.47651178,0.00062943983,0.5145491,0.0003394537,0.000066549495,0.0004934286,0.0006516398,0.00030863401,0.006450011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995123,0.00014696192,0.000015477046,0.00010084846,0.00009759023,0.00012677697],"domain_scores_gemma":[0.9993198,0.00039840283,0.000061029536,0.00007258365,0.00009635986,0.000051912193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057211425,0.0011340674,0.0012734388,0.0013537807,0.0007579203,0.0008250496,0.0020658171,0.0017701784,0.0027298033],"category_scores_gemma":[0.0018798466,0.00044254973,0.0009896321,0.0013817265,0.00073600025,0.0010148499,0.00084621523,0.0010074453,0.00045901004],"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.00009675331,0.00018167494,0.0010020618,0.00014285365,0.00007918721,0.00017461582,0.00016219117,0.8815055,0.003936068,0.014564327,0.0054208646,0.09273399],"study_design_scores_gemma":[0.00004088215,0.000055348057,0.00014128366,0.000014916004,0.00003143638,0.000048616956,0.000047952584,0.992331,0.0010606425,0.0042167683,0.0019990834,0.000012074971],"about_ca_topic_score_codex":0.011788209,"about_ca_topic_score_gemma":0.009343912,"teacher_disagreement_score":0.011788209,"about_ca_system_score_codex":0.0014078813,"about_ca_system_score_gemma":0.002747566,"threshold_uncertainty_score":0.023439229},"labels":[],"label_agreement":null},{"id":"W4313892828","doi":"10.1109/jiot.2023.3235661","title":"Collaborative Caching Strategy for RL-Based Content Downloading Algorithm in Clustered Vehicular Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":22,"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; Upload; Backhaul (telecommunications); Reinforcement learning; Markov decision process; Computer network; Base station; Cache; Popularity; Algorithm; Markov process; Artificial intelligence; Operating system","score_opus":0.038933571582774155,"score_gpt":0.2726665633793238,"score_spread":0.23373299179654966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313892828","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.0734695,0.00034049668,0.9225123,0.0002659229,0.000049009857,0.00005752533,0.00004503801,0.00058612775,0.0026741165],"genre_scores_gemma":[0.95210916,0.0001304107,0.0448528,0.00010988596,0.000031439227,0.00010217776,0.00009962973,0.000037040507,0.00252747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995066,0.00010252778,0.000033491404,0.00014130292,0.00009766862,0.00011833332],"domain_scores_gemma":[0.99857616,0.0008001661,0.00014680818,0.0000792523,0.00031372946,0.00008382894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008141028,0.00063680514,0.0010659406,0.00047928514,0.00056565163,0.00074760534,0.0018655244,0.0009766105,0.0012067857],"category_scores_gemma":[0.0031555118,0.00038253362,0.00046659823,0.0004524944,0.00071049633,0.00080787495,0.0007391883,0.00067734014,0.00026809532],"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.000087357366,0.000044489967,0.0009336256,0.000030493697,0.000032916785,0.000056247507,0.000063750755,0.9693513,0.0012633742,0.0032109607,0.0006784123,0.024247043],"study_design_scores_gemma":[0.0000058904593,0.0000095954965,0.000044076693,0.0000011208599,0.000003424729,0.0000043776267,0.000003442021,0.99922955,0.00016346379,0.0004873774,0.00004570048,0.0000019349516],"about_ca_topic_score_codex":0.01842318,"about_ca_topic_score_gemma":0.011101317,"teacher_disagreement_score":0.01842318,"about_ca_system_score_codex":0.0013561829,"about_ca_system_score_gemma":0.0013795734,"threshold_uncertainty_score":0.036631882},"labels":[],"label_agreement":null},{"id":"W4315474764","doi":"10.1109/lcomm.2023.3235834","title":"A Novel Nested Coded Delivery Strategy for Coded Caching Under Nonuniform File Popularity","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Caching and Content Delivery","field":"Computer Science","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":"Ontario Tech University; St. Francis Xavier University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Scheme (mathematics); Popularity; Multicast; Computer network; Mathematics","score_opus":0.10726911798425552,"score_gpt":0.3046086345453457,"score_spread":0.19733951656109017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315474764","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.04346981,0.00047478397,0.95242953,0.00016810455,0.00007809532,0.00009519208,0.00009367248,0.00049528084,0.0026955341],"genre_scores_gemma":[0.8123028,0.00036914888,0.18442117,0.00014169444,0.000057874826,0.00011511967,0.00011828587,0.000072466304,0.0024013834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993868,0.00014318133,0.00003185288,0.000089779955,0.0002405339,0.00010792114],"domain_scores_gemma":[0.99807215,0.00060088723,0.00021881127,0.00035694265,0.00063258916,0.00011855472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688079,0.0007229084,0.00077565,0.0005413636,0.0006274993,0.00070741883,0.0016449741,0.0005760918,0.0009937132],"category_scores_gemma":[0.0031121888,0.00022515406,0.0002847076,0.00080792303,0.00068362645,0.0015746091,0.00093679235,0.00062030734,0.0002284546],"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.0005420159,0.00018049192,0.0024564383,0.0003255388,0.000086023945,0.0006681562,0.0004445855,0.54672235,0.112927936,0.11519032,0.0091368295,0.21131928],"study_design_scores_gemma":[0.000017766002,0.00008080957,0.00013126824,0.000010383177,0.000018658215,0.00018042001,0.00003181849,0.985061,0.0072596087,0.005150527,0.002032941,0.000024678126],"about_ca_topic_score_codex":0.0051637026,"about_ca_topic_score_gemma":0.0067012287,"teacher_disagreement_score":0.0051637026,"about_ca_system_score_codex":0.0014591077,"about_ca_system_score_gemma":0.001755942,"threshold_uncertainty_score":0.010586619},"labels":[],"label_agreement":null},{"id":"W4315783404","doi":"10.1109/icnsc55942.2022.10004115","title":"Content Placement in a Cluster-Centric Mobile Edge Caching Network","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Networking, Sensing and Control (ICNSC)","topic":"Caching and Content Delivery","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":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Computer science; Computer network; Cache; Enhanced Data Rates for GSM Evolution; Latency (audio); Focus (optics); Distributed computing; Telecommunications","score_opus":0.04485879933440324,"score_gpt":0.25599269140647934,"score_spread":0.2111338920720761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783404","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.58453006,0.0009885,0.40716186,0.0003099268,0.00008286946,0.00017230367,0.00020239023,0.0009045916,0.0056476137],"genre_scores_gemma":[0.9588252,0.00015614957,0.039285384,0.000041210988,0.000013637497,0.000029377043,0.00006859279,0.000013235855,0.0015672882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973327,0.00006368607,0.000011325538,0.00006401196,0.000062213396,0.00006551822],"domain_scores_gemma":[0.999433,0.00016403745,0.000077519064,0.00007874815,0.00018261677,0.00006401861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042682,0.00041605384,0.0005399776,0.0006559223,0.00091072614,0.00086888834,0.0011793369,0.0008259793,0.0005570106],"category_scores_gemma":[0.0009950356,0.00027371437,0.00021543076,0.0011684452,0.00047970377,0.0008066038,0.0006746025,0.00027919363,0.00019640556],"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.00076508604,0.00014849858,0.0054365145,0.000090317524,0.00007801927,0.0010174157,0.00025017743,0.862408,0.041293416,0.013403766,0.0036096445,0.07149918],"study_design_scores_gemma":[0.000009594647,0.00006964724,0.00042324045,0.0000042448564,0.000014998201,0.00013217243,0.00006471809,0.99392265,0.0037776472,0.0010515956,0.0005192294,0.000010210732],"about_ca_topic_score_codex":0.01428613,"about_ca_topic_score_gemma":0.017364742,"teacher_disagreement_score":0.01428613,"about_ca_system_score_codex":0.0018100163,"about_ca_system_score_gemma":0.0009477753,"threshold_uncertainty_score":0.028405964},"labels":[],"label_agreement":null},{"id":"W4315783855","doi":"10.1109/jsac.2023.3235443","title":"Federated Deep Reinforcement Learning for Recommendation-Enabled Edge Caching in Mobile Edge-Cloud Computing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":90,"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 British Columbia","funders":"National Key Research and Development Program of China; Chongqing Research Program of Basic Research and Frontier Technology; Fundamental Research Funds for the Key Research Program of Chongqing Science and Technology Commission; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Server; Cloud computing; Edge computing; Enhanced Data Rates for GSM Evolution; Distributed computing; Markov decision process; Mobile edge computing; Edge device; Reinforcement learning; Computer network; Base station; Recommender system; Markov process; Artificial intelligence; Machine learning; Operating system","score_opus":0.03701572615767868,"score_gpt":0.2985865757943792,"score_spread":0.2615708496367005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783855","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.13759774,0.0009185218,0.856549,0.00057590025,0.000096401774,0.000060496877,0.00010386188,0.0008536706,0.0032442885],"genre_scores_gemma":[0.9775088,0.0001099316,0.020797411,0.000108742184,0.000018799601,0.000030540472,0.000060640963,0.000020017264,0.0013452413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.00012789354,0.00001981726,0.00010797885,0.00007276363,0.00012027407],"domain_scores_gemma":[0.99849045,0.0009150284,0.00014686813,0.000093692724,0.00025620236,0.00009779719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010307182,0.0006003764,0.0012884832,0.0002711262,0.00040149156,0.0006967102,0.00143161,0.0009713938,0.0011411313],"category_scores_gemma":[0.002981023,0.00039154408,0.00039080816,0.000409877,0.00058953685,0.00076363713,0.00070035824,0.0011787652,0.00018217422],"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.00007987876,0.00005961644,0.0007820416,0.00002798892,0.00002712104,0.000046766578,0.000019699222,0.9808462,0.0005521386,0.0018216578,0.000533486,0.015203416],"study_design_scores_gemma":[0.000003169719,0.0000071209806,0.00004070398,9.217154e-7,0.000002471237,0.0000023544146,0.0000017137048,0.999461,0.00006988049,0.00038051326,0.000029035473,0.0000010622912],"about_ca_topic_score_codex":0.025704522,"about_ca_topic_score_gemma":0.027901376,"teacher_disagreement_score":0.025704522,"about_ca_system_score_codex":0.0013330018,"about_ca_system_score_gemma":0.0014724777,"threshold_uncertainty_score":0.05110985},"labels":[],"label_agreement":null},{"id":"W4317418858","doi":"10.1109/vtc2022-fall57202.2022.10012719","title":"Joint Caching and Computing of Software-Defined Space-Air-Ground Integrated Networks for Video Streaming Service Improvement","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Chongqing Municipal Education Commission","keywords":"Computer science; Scheduling (production processes); Software; Distributed computing; Bandwidth (computing); Quality of service; Real-time computing; Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Telecommunications","score_opus":0.01567346405603021,"score_gpt":0.21517667346992944,"score_spread":0.19950320941389924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317418858","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.19167992,0.00077949214,0.8009402,0.00041603533,0.00006300466,0.000054240067,0.000023226095,0.00028028805,0.0057636267],"genre_scores_gemma":[0.9332846,0.00021823992,0.06550852,0.000048320453,0.000017949485,0.000028210081,0.000019781262,0.000014737567,0.00085962407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997241,0.00012804699,0.0000093306035,0.000030702657,0.000060387134,0.0000474615],"domain_scores_gemma":[0.9996145,0.00017791727,0.000051078285,0.00003905019,0.000082742845,0.000034676155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004622428,0.0004167757,0.00041044105,0.00018902188,0.0003399604,0.00054443197,0.00061530585,0.00028074018,0.00064944226],"category_scores_gemma":[0.0012219726,0.00014442515,0.00024262833,0.00050225266,0.0003192176,0.00077946595,0.00053253246,0.00041414532,0.00005728775],"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.00038577954,0.00019453772,0.0031076875,0.00012026259,0.00007965704,0.00017765594,0.00011871773,0.83687925,0.020936029,0.035801332,0.0023924215,0.099806614],"study_design_scores_gemma":[0.000005280885,0.000023634939,0.00010697557,0.0000013874381,0.000005694749,0.000010328531,0.000009142284,0.99704605,0.0011490411,0.0013341267,0.00030632198,0.000002089773],"about_ca_topic_score_codex":0.0053452225,"about_ca_topic_score_gemma":0.009673043,"teacher_disagreement_score":0.0053452225,"about_ca_system_score_codex":0.00069532654,"about_ca_system_score_gemma":0.0009819088,"threshold_uncertainty_score":0.010628223},"labels":[],"label_agreement":null},{"id":"W4317796724","doi":"10.1109/tifs.2023.3235152","title":"Incentivizing Secure Edge Caching for Scalable Coded Videos in Heterogeneous Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Scalability; Computer network; Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence; Database","score_opus":0.013180621257575055,"score_gpt":0.22270010562418044,"score_spread":0.2095194843666054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317796724","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.10814549,0.00045890667,0.8829229,0.00085723033,0.00007503837,0.00011390771,0.000080026,0.00020517882,0.007141383],"genre_scores_gemma":[0.9715631,0.00020890012,0.0267977,0.00009500619,0.00002314192,0.000044698943,0.000030772862,0.000015538291,0.0012211251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880826,0.00055079284,0.000042940464,0.00015369493,0.00024329679,0.00020099043],"domain_scores_gemma":[0.9977919,0.0013266248,0.000264603,0.00029834444,0.00020651314,0.000111997455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394541,0.0005937251,0.00065612077,0.00032561272,0.0006178739,0.001154252,0.0010414087,0.0012334096,0.0010705716],"category_scores_gemma":[0.0050600586,0.00026914306,0.0003879248,0.0005352793,0.0009786283,0.0019165046,0.001736197,0.001092575,0.00016860645],"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.00039158732,0.0001378091,0.0019446815,0.00018355587,0.00006857477,0.00096873887,0.00022730068,0.6888088,0.021871433,0.23861279,0.003421003,0.043363787],"study_design_scores_gemma":[0.000015642292,0.00002926127,0.00010953535,0.000008327262,0.000009739429,0.00009027395,0.000030702562,0.97927654,0.0015909367,0.018136539,0.0006925013,0.000010049281],"about_ca_topic_score_codex":0.0020181108,"about_ca_topic_score_gemma":0.0029367958,"teacher_disagreement_score":0.0020181108,"about_ca_system_score_codex":0.0012918629,"about_ca_system_score_gemma":0.0014329698,"threshold_uncertainty_score":0.009373128},"labels":[],"label_agreement":null},{"id":"W4318147159","doi":"10.1109/bigdata55660.2022.10020959","title":"Adaptive Content Forwarding Mechanism for Platoon based Vehicular Named Data Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Big Data (Big Data)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Platoon; Computer science; Computer network; Overhead (engineering); Scheme (mathematics); Throughput; The Internet; Vehicular ad hoc network; Data exchange; Electronic data interchange; Protocol (science); Distributed computing; Wireless ad hoc network; Telecommunications; Control (management); Wireless; Database; Operating system","score_opus":0.47588963696264636,"score_gpt":0.33149483326991913,"score_spread":0.14439480369272722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318147159","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.11240073,0.00077538716,0.87643963,0.0004357568,0.00037650912,0.00035377685,0.00025914607,0.0023840335,0.006575055],"genre_scores_gemma":[0.9280716,0.00029478836,0.06892936,0.00010077175,0.000048990045,0.000114494454,0.0003419272,0.000034478864,0.0020635182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959356,0.00008512679,0.000031477066,0.00008297485,0.0001288791,0.000078008416],"domain_scores_gemma":[0.9989766,0.0002747771,0.00013138712,0.00018845427,0.0003422638,0.00008654725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085181434,0.00039542493,0.0004712314,0.0010841334,0.0009482296,0.00058394537,0.0014345618,0.00053440145,0.00096633844],"category_scores_gemma":[0.0018426724,0.0001698763,0.00034308716,0.00070135517,0.00044525365,0.0011269973,0.00084207684,0.00037699766,0.00024616194],"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.0017488736,0.0004955978,0.010505963,0.00042335657,0.00028547508,0.001470641,0.0014171004,0.32778275,0.1272301,0.12455093,0.019500209,0.38458902],"study_design_scores_gemma":[0.000051636882,0.0001432011,0.00074042956,0.000012530566,0.000049005703,0.00023858304,0.00009561182,0.96708995,0.013054249,0.009558567,0.008929804,0.00003645568],"about_ca_topic_score_codex":0.005108405,"about_ca_topic_score_gemma":0.004444557,"teacher_disagreement_score":0.005108405,"about_ca_system_score_codex":0.0011654173,"about_ca_system_score_gemma":0.0009251614,"threshold_uncertainty_score":0.010157347},"labels":[],"label_agreement":null},{"id":"W4320015905","doi":"10.1109/jiot.2023.3240423","title":"Mobility-Aware Proactive Edge Caching for Large Files in the Internet of Vehicles","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"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":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Computer network; Upload; Cache; Scheduling (production processes); Enhanced Data Rates for GSM Evolution; Quality of service; Quality of experience; The Internet; Latency (audio); Edge computing","score_opus":0.03174095502456745,"score_gpt":0.27566336809138997,"score_spread":0.24392241306682252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320015905","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.79160154,0.0010817272,0.20398295,0.00036735326,0.0000496021,0.0000749491,0.00020332921,0.00065295846,0.0019854556],"genre_scores_gemma":[0.9935323,0.00011261136,0.0060216533,0.00001644446,0.0000054604097,0.0000088174165,0.00005484153,0.000008055768,0.0002398461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995939,0.00008607049,0.000019035455,0.000080852435,0.000089105946,0.0001309885],"domain_scores_gemma":[0.99895215,0.000419118,0.00016185189,0.00012155754,0.00025797644,0.00008738352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005425192,0.0005261322,0.0006529715,0.0007118586,0.00092072185,0.00072817213,0.0014256502,0.0006316746,0.0002691374],"category_scores_gemma":[0.0017224008,0.0002520098,0.00034898182,0.0008689898,0.00049385655,0.0012362718,0.00066436053,0.0003599308,0.00007775409],"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.00028672622,0.000098891585,0.009519884,0.00007272468,0.00007080085,0.00051808666,0.00016180499,0.93356127,0.01623093,0.0042940388,0.001660154,0.033524767],"study_design_scores_gemma":[0.0000053299977,0.000021406171,0.00083683,0.0000021108706,0.00001074986,0.000039240666,0.000053924385,0.99689096,0.0014183066,0.00051382015,0.000198207,0.000009230337],"about_ca_topic_score_codex":0.03318383,"about_ca_topic_score_gemma":0.03771511,"teacher_disagreement_score":0.03318383,"about_ca_system_score_codex":0.0018676246,"about_ca_system_score_gemma":0.001031763,"threshold_uncertainty_score":0.06598139},"labels":[],"label_agreement":null},{"id":"W4322503064","doi":"10.1007/s11277-023-10187-9","title":"Energy and Latency Efficient Caching in Mobile Edge Networks: Survey, Solutions, and Challenges","year":2023,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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; Cache; Computer network; Base station; Enhanced Data Rates for GSM Evolution; Wireless; Wireless network; Mobile device; Latency (audio); Efficient energy use; Edge computing; Telecommunications; Operating system","score_opus":0.07933215785684548,"score_gpt":0.2658035410488182,"score_spread":0.1864713831919727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322503064","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063437684,0.9348529,0.045035984,0.005226292,0.00042949922,0.00004866265,0.00012944508,0.00016346251,0.007770028],"genre_scores_gemma":[0.100625195,0.8611216,0.030498445,0.0012497273,0.0023345186,0.00007437084,0.0002917145,0.000058850357,0.0037457566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871445,0.00028449172,0.00011578065,0.00020133296,0.00048704626,0.00019695966],"domain_scores_gemma":[0.99539137,0.0027687992,0.00029556832,0.00030357298,0.0011018201,0.0001387812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002460266,0.0009823748,0.0022733763,0.0017323368,0.00074811705,0.003248215,0.002788303,0.0023441112,0.0018070809],"category_scores_gemma":[0.003959885,0.0006989388,0.00054813636,0.00617459,0.0010370397,0.0052891453,0.0014614662,0.0018338164,0.0007111202],"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.00019233265,0.00030310854,0.0023621647,0.0052852,0.00014496807,0.000089612986,0.00015900885,0.032080892,0.0036700207,0.08620969,0.025591973,0.84391093],"study_design_scores_gemma":[0.00009474289,0.00091256626,0.0032219468,0.0048837275,0.0005381054,0.002175948,0.0012866806,0.29751837,0.01069248,0.11926051,0.5591821,0.00023285723],"about_ca_topic_score_codex":0.0031333966,"about_ca_topic_score_gemma":0.0037882116,"teacher_disagreement_score":0.003248215,"about_ca_system_score_codex":0.0017138305,"about_ca_system_score_gemma":0.0025179437,"threshold_uncertainty_score":0.013011336},"labels":[],"label_agreement":null},{"id":"W4322775678","doi":"10.1007/s12083-023-01464-2","title":"A GNN-based proactive caching strategy in NDN networks","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Computer science; Cache; Computer network; False sharing; Latency (audio); Cache algorithms; Smart Cache; Network topology; CPU cache","score_opus":0.02789617127673743,"score_gpt":0.27700096165956145,"score_spread":0.24910479038282402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322775678","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.120208986,0.004701858,0.8577539,0.0009849734,0.00076790055,0.00029659845,0.00026515304,0.0022789624,0.012741726],"genre_scores_gemma":[0.9100963,0.0008589603,0.08448007,0.00020626355,0.00009688412,0.000055105545,0.00016832525,0.000062726394,0.0039752293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999496,0.0001145201,0.00003315951,0.000109290435,0.00015274365,0.000094349205],"domain_scores_gemma":[0.9991849,0.00016776481,0.000048993985,0.0001417876,0.0003790807,0.00007745927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008004176,0.0004556172,0.0009586666,0.0007318708,0.0009859444,0.0013471107,0.0015181943,0.0008168408,0.0009386641],"category_scores_gemma":[0.0018586947,0.0002551976,0.00029241643,0.0008276938,0.00061525486,0.001133406,0.0010458536,0.0005075468,0.00030361649],"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.001104096,0.00034279106,0.005350339,0.00051776593,0.00016910647,0.00069907564,0.00038691322,0.4416993,0.080700316,0.07617936,0.016393399,0.37645757],"study_design_scores_gemma":[0.00002293977,0.00007127915,0.00042452037,0.000021731184,0.000049937862,0.0002298875,0.00006153432,0.9810069,0.0075991633,0.006736059,0.0037443703,0.00003169186],"about_ca_topic_score_codex":0.008863552,"about_ca_topic_score_gemma":0.015983777,"teacher_disagreement_score":0.008863552,"about_ca_system_score_codex":0.0019166716,"about_ca_system_score_gemma":0.0013724191,"threshold_uncertainty_score":0.017623901},"labels":[],"label_agreement":null},{"id":"W4327778761","doi":"10.1109/ccnc51644.2023.10060380","title":"Cache-Aided Networks with Shared Caches and Correlated Content under Non-Uniform Demands","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Computer science; Multicast; Cache; Cluster analysis; Cache coherence; False sharing; Distributed computing; Scheme (mathematics); Perspective (graphical); Coding (social sciences); Content delivery; Computer network; CPU cache; Parallel computing; Cache algorithms; Artificial intelligence","score_opus":0.036400665142744634,"score_gpt":0.21144902438846547,"score_spread":0.17504835924572082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327778761","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.17823853,0.0008071086,0.8164596,0.00047079017,0.0000439631,0.000065858236,0.00017967222,0.0005380965,0.0031963438],"genre_scores_gemma":[0.9447687,0.00030506897,0.051550377,0.000090005604,0.000034560882,0.00007539409,0.0000919434,0.000028763678,0.0030550673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.00025071605,0.000023695422,0.00013742942,0.00014556723,0.000094869676],"domain_scores_gemma":[0.9980203,0.0010540981,0.000224287,0.00022006407,0.0004232177,0.000058152073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007320665,0.00065049407,0.0012099964,0.00055341335,0.0007561618,0.0010449145,0.0020914825,0.0010347841,0.00084348104],"category_scores_gemma":[0.002702338,0.00043306206,0.00033549737,0.0012643563,0.0008798946,0.0021369846,0.0010913346,0.0006868037,0.00023662466],"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.00028182208,0.000056448007,0.00072491635,0.00009965952,0.000052640775,0.00037855917,0.00017424508,0.9358746,0.008803804,0.027481696,0.0016089224,0.024462704],"study_design_scores_gemma":[0.000012448767,0.000044015258,0.00008619479,0.000004208109,0.000015377043,0.00009928758,0.000025977943,0.99369824,0.0015128934,0.004004508,0.00048574677,0.000011092984],"about_ca_topic_score_codex":0.0040428247,"about_ca_topic_score_gemma":0.0049114544,"teacher_disagreement_score":0.0040428247,"about_ca_system_score_codex":0.0019286467,"about_ca_system_score_gemma":0.0009141032,"threshold_uncertainty_score":0.013993323},"labels":[],"label_agreement":null},{"id":"W4328007772","doi":"10.1109/twc.2023.3257178","title":"Joint Optimization of Caching Placement and Power Allocation in Virtualized Satellite-Terrestrial Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":62,"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 British Columbia","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Cache; Overhead (engineering); Power optimization; Wireless; Enhanced Data Rates for GSM Evolution; Optimization problem; Computer network; Joint (building); Wireless network; Distributed computing; Real-time computing; Power (physics); Power consumption; Telecommunications; Algorithm; Operating system","score_opus":0.040870932942583,"score_gpt":0.2679403220259719,"score_spread":0.2270693890833889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328007772","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.22043797,0.001111292,0.77049416,0.00051450223,0.00007457272,0.00010104923,0.00017843557,0.00024882526,0.006839117],"genre_scores_gemma":[0.96785843,0.0002592347,0.029900072,0.000058699203,0.000014956247,0.000054940963,0.00006545772,0.000027385378,0.0017607252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995567,0.00017679628,0.000014451898,0.00008420201,0.00006113227,0.000106766034],"domain_scores_gemma":[0.9993235,0.00042136887,0.00008723372,0.00002806286,0.000082035906,0.000057819245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005888147,0.0008411931,0.0010813664,0.00044936425,0.0004089604,0.0010306392,0.00088673894,0.0008628449,0.001087593],"category_scores_gemma":[0.0015480195,0.0004259378,0.00033482845,0.0010166058,0.0006404155,0.00092492433,0.0006877971,0.0004196281,0.00010723682],"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.000041544277,0.00001639554,0.00027141295,0.000022541117,0.0000138671685,0.000051357998,0.000012246816,0.9906722,0.00083974027,0.0019280761,0.0003990423,0.0057315524],"study_design_scores_gemma":[0.0000067992755,0.000017850965,0.00011133683,0.000001868081,0.0000061013448,0.000015982834,0.000012919061,0.99844354,0.00022282054,0.0010436827,0.00011428709,0.0000028203656],"about_ca_topic_score_codex":0.00811781,"about_ca_topic_score_gemma":0.006937239,"teacher_disagreement_score":0.00811781,"about_ca_system_score_codex":0.0014982668,"about_ca_system_score_gemma":0.001110368,"threshold_uncertainty_score":0.016141117},"labels":[],"label_agreement":null},{"id":"W4328027908","doi":"10.1109/iccc56324.2022.10065638","title":"Task Scheduling for ICN-Based Computing First Network: A Deep Reinforcement Learning Approach","year":2022,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Computer science; Reinforcement learning; Distributed computing; Scheduling (production processes); Markov decision process; Computer network; Dynamic priority scheduling; Edge computing; Schedule; Task analysis; Markov process; Task (project management); Enhanced Data Rates for GSM Evolution; Quality of service; Artificial intelligence","score_opus":0.02194853964973241,"score_gpt":0.22211549370635514,"score_spread":0.20016695405662271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328027908","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.078816436,0.0004614259,0.9142506,0.0006323769,0.00009669135,0.00006911399,0.00006796543,0.00032070721,0.0052845734],"genre_scores_gemma":[0.9510019,0.00017167632,0.04570872,0.0001522737,0.000037690384,0.00006685659,0.00007373679,0.000028938155,0.0027583397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996673,0.00007064217,0.000014096402,0.00008397346,0.00006786578,0.00009627439],"domain_scores_gemma":[0.9992943,0.00028756334,0.00010890936,0.000041399187,0.00018486078,0.00008294684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092777784,0.0006307302,0.0007622427,0.00039667782,0.0004918597,0.00066959194,0.001238772,0.00068689766,0.001294378],"category_scores_gemma":[0.0017732439,0.0002707178,0.00030849333,0.0004477109,0.0006121283,0.0009454083,0.00069178344,0.0009343232,0.00011368554],"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.00005751776,0.000047072575,0.0007052938,0.000024601177,0.000013549015,0.000028223012,0.000030654206,0.9715575,0.00085080235,0.0051154476,0.0007109143,0.020858426],"study_design_scores_gemma":[0.0000018182566,0.000005999895,0.000028723874,8.197088e-7,0.0000015718151,0.00000216842,0.0000022095946,0.99909437,0.00007160627,0.000725359,0.0000643338,0.0000010113754],"about_ca_topic_score_codex":0.020678105,"about_ca_topic_score_gemma":0.018020393,"teacher_disagreement_score":0.020678105,"about_ca_system_score_codex":0.002034635,"about_ca_system_score_gemma":0.0021815838,"threshold_uncertainty_score":0.041115463},"labels":[],"label_agreement":null},{"id":"W4361741212","doi":"10.2139/ssrn.4392120","title":"Measuring Performance of Web Protocol with Updated Transport Layer Techniques for Faster Web Browsing","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Computer science; World Wide Web; Transport layer; Application layer; Protocol (science); Layer (electronics); Computer network; Chemistry; Operating system","score_opus":0.023437395676351464,"score_gpt":0.242822056311715,"score_spread":0.21938466063536352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361741212","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.99004984,0.0002072165,0.0076289414,0.000026511972,0.00002851971,0.00004857922,0.00020102122,0.0008521094,0.00095720263],"genre_scores_gemma":[0.9919199,0.00007359914,0.0070736683,0.000010812395,0.000014948265,0.000019378134,0.0002626132,0.00007726125,0.0005477953],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978677,0.00039314435,0.00021226474,0.00026528665,0.001054234,0.00020740222],"domain_scores_gemma":[0.99001956,0.004355406,0.0006747345,0.0018335345,0.002771866,0.0003448227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014235616,0.000524113,0.00046523457,0.001294976,0.00037034863,0.0008563277,0.0007938906,0.0007380634,0.0014527929],"category_scores_gemma":[0.0084167095,0.00026688393,0.00025693097,0.0016153313,0.00028953163,0.0016620741,0.00035342074,0.0008675783,0.0003748728],"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.008895434,0.0030178018,0.07969125,0.00060655636,0.000522077,0.00053348613,0.0005649455,0.05703078,0.60576445,0.0020509567,0.002324933,0.23899728],"study_design_scores_gemma":[0.00019996906,0.0053179865,0.11443988,0.000026683883,0.00046314838,0.0010489598,0.000261303,0.43665126,0.43924326,0.00060005736,0.0016302723,0.00011723018],"about_ca_topic_score_codex":0.0023929656,"about_ca_topic_score_gemma":0.0016126243,"teacher_disagreement_score":0.0023929656,"about_ca_system_score_codex":0.00061933615,"about_ca_system_score_gemma":0.00056602486,"threshold_uncertainty_score":0.0075286627},"labels":[],"label_agreement":null},{"id":"W4365441266","doi":"10.48550/arxiv.2304.04954","title":"An Associativity Threshold Phenomenon in Set-Associative Caches","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Cache; Computer science; Cache algorithms; Paging; Parallel computing; Hash function; Associative property; Cache pollution; Page cache; Cache coloring; CPU cache; Combinatorics; Mathematics; Computer network","score_opus":0.16239224954404524,"score_gpt":0.21566551856072275,"score_spread":0.053273269016677505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365441266","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.5895563,0.004874484,0.38335583,0.0017139,0.00023247501,0.0002079636,0.0003907843,0.002080878,0.017587481],"genre_scores_gemma":[0.98568416,0.00055470935,0.010692975,0.00039111206,0.00007300251,0.00012620828,0.00008462256,0.00007625919,0.0023170358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633646,0.00047346915,0.00024830652,0.0005943028,0.0015733705,0.0007740114],"domain_scores_gemma":[0.982249,0.009601922,0.0026024682,0.0032511705,0.0017449317,0.00055045204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002150105,0.000574604,0.0012578652,0.0007843075,0.0013030637,0.0030382494,0.0022327332,0.0016998346,0.0039115115],"category_scores_gemma":[0.019852474,0.00085018604,0.0005627333,0.0021277466,0.0025985555,0.0087784575,0.0022175193,0.0022968845,0.0008727733],"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.0023730015,0.00084167835,0.025907297,0.0009308999,0.0002998838,0.0020924325,0.0016573906,0.22996454,0.10708614,0.54275,0.008703802,0.07739293],"study_design_scores_gemma":[0.00017634594,0.00078278384,0.005236693,0.00013030393,0.00018763497,0.0032556327,0.00042934634,0.7742448,0.05161793,0.1555739,0.0082121575,0.00015242954],"about_ca_topic_score_codex":0.001230305,"about_ca_topic_score_gemma":0.00066842453,"teacher_disagreement_score":0.0039115115,"about_ca_system_score_codex":0.0022890738,"about_ca_system_score_gemma":0.0016990135,"threshold_uncertainty_score":0.016608477},"labels":[],"label_agreement":null},{"id":"W4376456756","doi":"10.1109/jiot.2023.3274653","title":"In-Network Caching for ICN-Based IoT (ICN-IoT): A Comprehensive Survey","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Jiangsu Provincial Key Research and Development Program; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Internet of Things; Computer network; Information-centric networking; Embedded system; Cache","score_opus":0.05604942312596684,"score_gpt":0.29168864017214824,"score_spread":0.2356392170461814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376456756","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01695474,0.8757698,0.078172356,0.0013533401,0.0010911614,0.00031268204,0.0006004408,0.0007672017,0.024978315],"genre_scores_gemma":[0.15069437,0.8001285,0.036484566,0.0013178312,0.0017388524,0.00035165955,0.0016196622,0.00023827923,0.0074263164],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987262,0.00022982409,0.00017820133,0.00022113752,0.000446495,0.00019810564],"domain_scores_gemma":[0.99745184,0.0012431808,0.00019694622,0.00023722676,0.00074797956,0.00012279084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242823,0.0017099548,0.001823967,0.0024743055,0.0009376995,0.0030208877,0.002479842,0.0018323341,0.0034270366],"category_scores_gemma":[0.003661074,0.00077005464,0.0010972264,0.0052380613,0.0006182032,0.005733048,0.0015282743,0.0010481497,0.0012010175],"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.00022444692,0.0003112917,0.0056606,0.009477605,0.00021568759,0.00041346054,0.0003876494,0.024301197,0.0056357463,0.040619005,0.043515217,0.86923814],"study_design_scores_gemma":[0.000072832096,0.0008280817,0.007153554,0.006666768,0.00092536927,0.0039531644,0.0011853173,0.15657425,0.010513539,0.030153925,0.781619,0.00035426897],"about_ca_topic_score_codex":0.0062065898,"about_ca_topic_score_gemma":0.004492671,"teacher_disagreement_score":0.0062065898,"about_ca_system_score_codex":0.0015120339,"about_ca_system_score_gemma":0.0026776511,"threshold_uncertainty_score":0.012340963},"labels":[],"label_agreement":null},{"id":"W4376851419","doi":"10.1109/jstsp.2023.3276595","title":"User Dynamics-Aware Edge Caching and Computing for Mobile Virtual Reality","year":2023,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Signal Processing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":21,"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; Carleton University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Scalability; Scheduling (production processes); Computer network; Virtual reality; Mobile edge computing; Frame (networking); Enhanced Data Rates for GSM Evolution; Server; Real-time computing; Multimedia; Artificial intelligence; Operating system","score_opus":0.024619112589854667,"score_gpt":0.28670996603880816,"score_spread":0.2620908534489535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376851419","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.076327026,0.001680456,0.9159288,0.00039325675,0.00007044831,0.00005217838,0.000058245678,0.00095822214,0.0045314655],"genre_scores_gemma":[0.91620517,0.00054400164,0.08130662,0.00012545797,0.000046537625,0.000032197757,0.000060303013,0.000055359218,0.0016242793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963963,0.000100216705,0.000014986822,0.00007601034,0.00009760955,0.00007154915],"domain_scores_gemma":[0.9994999,0.00016547769,0.000047494188,0.00011455977,0.00012439497,0.000048051832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031117335,0.00048405112,0.0005501785,0.00035997917,0.0005385736,0.00083434774,0.0012308242,0.0005481398,0.00080315705],"category_scores_gemma":[0.0012310816,0.00020751079,0.00030241182,0.0006302657,0.00037707406,0.0013713758,0.0008171814,0.00056314317,0.00022242949],"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.00071402855,0.00028852196,0.005015367,0.00022425251,0.00013671184,0.0007851551,0.0004258456,0.530115,0.091427796,0.05690284,0.007865277,0.30609924],"study_design_scores_gemma":[0.0000067238307,0.000044540608,0.00044454547,0.0000044801136,0.000014144402,0.000115645504,0.00004050567,0.98995763,0.0041132187,0.0036769246,0.0015681951,0.000013350171],"about_ca_topic_score_codex":0.005352062,"about_ca_topic_score_gemma":0.0071235094,"teacher_disagreement_score":0.005352062,"about_ca_system_score_codex":0.00081999926,"about_ca_system_score_gemma":0.0005987492,"threshold_uncertainty_score":0.010641813},"labels":[],"label_agreement":null},{"id":"W4377092191","doi":"10.1016/j.laa.2023.05.015","title":"Coordination and discoordination in linear algebra, linear information theory, and coded caching","year":2023,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Mathematics; Vector space; Basis (linear algebra); Linear algebra; Linear span; Linear space; Notation; Subspace topology; Intersection (aeronautics); Discrete mathematics; Algebra over a field; Invariant (physics); Theoretical computer science; Pure mathematics; Computer science; Arithmetic","score_opus":0.010808825028303987,"score_gpt":0.24964274730413347,"score_spread":0.23883392227582947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377092191","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.07823596,0.0025976906,0.89230555,0.0033354084,0.00026915112,0.000062873434,0.00029525024,0.0002984219,0.022599636],"genre_scores_gemma":[0.8929984,0.0016389178,0.09084753,0.00051823654,0.00058352767,0.00018329809,0.00032538193,0.00019525942,0.0127094155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99470913,0.0025842935,0.0002988423,0.00085920066,0.0010048173,0.0005437653],"domain_scores_gemma":[0.9800537,0.013403244,0.001880908,0.0023108548,0.001664164,0.0006871888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004208622,0.000819545,0.0021244083,0.0015542227,0.0019628727,0.0046537514,0.0022967805,0.0014417109,0.0045093987],"category_scores_gemma":[0.01836038,0.00072663464,0.0014097382,0.004539106,0.0059733866,0.0068938155,0.0030873546,0.0034610413,0.0005674146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00006288721,0.000047544196,0.00027057968,0.000046321147,0.000018296687,0.000036272446,0.00018587838,0.019291127,0.0003096152,0.97178125,0.0012513244,0.0066990224],"study_design_scores_gemma":[0.000016447548,0.000016799448,0.00007953905,0.000009548979,0.0000077143195,0.000019682622,0.000033520915,0.08488739,0.00025466166,0.9138823,0.00077729294,0.000015042236],"about_ca_topic_score_codex":0.010638419,"about_ca_topic_score_gemma":0.0054388107,"teacher_disagreement_score":0.010638419,"about_ca_system_score_codex":0.0035943985,"about_ca_system_score_gemma":0.0030588869,"threshold_uncertainty_score":0.026079297},"labels":[],"label_agreement":null},{"id":"W4378191501","doi":"10.1109/synasc57785.2022.00024","title":"Fully-adaptive Model for Broadcasting with Universal Lists","year":2022,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Communication source; Theoretical computer science; Upper and lower bounds; Vertex (graph theory); Distributed computing; Computer network; Graph; Mathematics","score_opus":0.03036180340974852,"score_gpt":0.2078353265113317,"score_spread":0.1774735231015832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378191501","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.048208207,0.00054342207,0.9347274,0.0006550444,0.000068270245,0.00017506456,0.00042397255,0.00077476125,0.014423813],"genre_scores_gemma":[0.8344391,0.001135822,0.14393261,0.00044352718,0.0001597129,0.00051430875,0.00067240384,0.00018612893,0.01851632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910635,0.00021171944,0.00004559542,0.0001894479,0.00021208623,0.00023471171],"domain_scores_gemma":[0.9974953,0.0012624067,0.0002796053,0.0004169955,0.00038755283,0.00015827951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009497961,0.00065787934,0.00071139,0.00062516733,0.00095727755,0.0016829876,0.0030108844,0.0012954028,0.006654401],"category_scores_gemma":[0.0039910683,0.00035779053,0.0006626684,0.0011663751,0.0012807479,0.004763525,0.0014616213,0.0014128052,0.0009713998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00039635683,0.000095355346,0.00056917046,0.00027563184,0.000035680656,0.0002443948,0.00042285118,0.40167466,0.005908421,0.55311906,0.0076430542,0.029615335],"study_design_scores_gemma":[0.000046899902,0.0000985134,0.00009982162,0.000014917322,0.00002479324,0.00011310796,0.000073787705,0.8701269,0.0011334736,0.12364348,0.0046002776,0.000024080193],"about_ca_topic_score_codex":0.0057321703,"about_ca_topic_score_gemma":0.0046042805,"teacher_disagreement_score":0.006654401,"about_ca_system_score_codex":0.0018873978,"about_ca_system_score_gemma":0.0015961156,"threshold_uncertainty_score":0.022261202},"labels":[],"label_agreement":null},{"id":"W4379523196","doi":"10.21428/594757db.622f126e","title":"A Communication-Efficient Protocol for Federated Learning in Energy Storage Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Computer science; Protocol (science); Distributed computing; Computer network; Medicine","score_opus":0.038971717087834326,"score_gpt":0.2881571789105118,"score_spread":0.24918546182267748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379523196","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.01677036,0.0001715083,0.97994643,0.00028815822,0.000087523214,0.00013750017,0.00006164262,0.0013891994,0.0011475743],"genre_scores_gemma":[0.8285617,0.00018377602,0.1674827,0.0002709964,0.00006387502,0.0005232467,0.00021037861,0.000121437966,0.0025819193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971205,0.0010097697,0.00033735685,0.0005577696,0.00067516585,0.0002994602],"domain_scores_gemma":[0.99395627,0.0026637507,0.00047225092,0.0017527561,0.0009635264,0.0001913627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034811837,0.00083942193,0.0011145757,0.00076906424,0.0014151576,0.0016687186,0.0024675943,0.0016408118,0.001963038],"category_scores_gemma":[0.011121473,0.00037933353,0.00057633565,0.0009798439,0.0011501581,0.003460992,0.003811728,0.0021066985,0.0004616723],"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.0014970322,0.00035882628,0.0012465557,0.0002810806,0.00014999346,0.0006600354,0.00068287714,0.5077426,0.030771488,0.13203862,0.008358136,0.31621277],"study_design_scores_gemma":[0.000038269525,0.0000963349,0.00008519381,0.0000142275285,0.000015779828,0.000107212814,0.000044951215,0.9608572,0.010545944,0.026494747,0.0016778321,0.000022298396],"about_ca_topic_score_codex":0.0011106303,"about_ca_topic_score_gemma":0.000937591,"teacher_disagreement_score":0.0034811837,"about_ca_system_score_codex":0.0011474196,"about_ca_system_score_gemma":0.0016558408,"threshold_uncertainty_score":0.018410444},"labels":[],"label_agreement":null},{"id":"W4381378213","doi":"10.21203/rs.3.rs-3069205/v1","title":"Intelligent Edge CDN with Smart Contract-Aided Local IoT Sharing","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Caching and Content Delivery","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; Cache; Server; Content delivery network; Computer network; End user; Schedule; Smart contract; Content delivery; Database transaction; Database; Operating system","score_opus":0.1486090027207287,"score_gpt":0.3776586628759356,"score_spread":0.2290496601552069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381378213","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.24847762,0.00032167375,0.73545516,0.0005753216,0.00012233508,0.0001640932,0.0001550381,0.0010326854,0.013696088],"genre_scores_gemma":[0.97635955,0.00003741067,0.021488113,0.00008303356,0.00001105657,0.00002603914,0.000042514355,0.000024345354,0.0019279149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990638,0.0002501975,0.000048895585,0.00022456177,0.00021257147,0.00019989115],"domain_scores_gemma":[0.9988286,0.00038674194,0.00014226057,0.00025492988,0.00022445044,0.00016305123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929037,0.00038783994,0.0006802599,0.0003589667,0.00095627294,0.0014458878,0.0016828657,0.00089345884,0.003666437],"category_scores_gemma":[0.002089155,0.00018913204,0.0003153656,0.00053994596,0.00089415634,0.00229163,0.0028054481,0.00078175747,0.00050456845],"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.00065748626,0.00032998936,0.0024244231,0.00006874215,0.000042344225,0.00042823024,0.00021696344,0.8656787,0.009521606,0.045163926,0.0036408613,0.07182675],"study_design_scores_gemma":[0.000016058388,0.000026726831,0.00007931626,0.000002592466,0.000004609101,0.000038289603,0.000033635613,0.9917618,0.001116172,0.0059576193,0.0009557496,0.0000075087137],"about_ca_topic_score_codex":0.0034412437,"about_ca_topic_score_gemma":0.0026465105,"teacher_disagreement_score":0.003666437,"about_ca_system_score_codex":0.0013767789,"about_ca_system_score_gemma":0.00108634,"threshold_uncertainty_score":0.012265444},"labels":[],"label_agreement":null},{"id":"W4382653138","doi":"10.1002/9781119873747.ch8","title":"DRL at the Application and Service Layer","year":2023,"lang":"en","type":"other","venue":"","topic":"Caching and Content Delivery","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 Manitoba","funders":"","keywords":"Computer science; Computation offloading; Internet of Things; Edge computing; Distributed computing; Computer network; Layer (electronics); Service (business); Server; Application layer; Enhanced Data Rates for GSM Evolution; Focus (optics); Computation; Task (project management); Analytics; Embedded system; Operating system; Telecommunications; Engineering; Database; Software deployment","score_opus":0.01849986129848976,"score_gpt":0.23156688789650592,"score_spread":0.21306702659801616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382653138","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03284577,0.0055711986,0.8506334,0.0066807475,0.0008861358,0.000614336,0.00086552766,0.014226886,0.087676086],"genre_scores_gemma":[0.58255297,0.0049295095,0.33155873,0.0044275536,0.0005715581,0.00046416273,0.0020135522,0.0025464587,0.07093555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975593,0.00039344135,0.00018952384,0.00034817003,0.00091572653,0.0005938108],"domain_scores_gemma":[0.9964791,0.00043827266,0.00015408265,0.0016243383,0.0011068608,0.00019740201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00207945,0.0013044471,0.0009577072,0.00071074313,0.0011124638,0.0045708283,0.0027792607,0.0012032572,0.007308909],"category_scores_gemma":[0.0042921635,0.0006105897,0.0005668603,0.0011499866,0.0010634881,0.005805317,0.004149947,0.0028150692,0.0047535417],"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.0003556217,0.00044517496,0.0026154206,0.0010786646,0.000120564895,0.0008699618,0.000747261,0.04764416,0.09976754,0.28669602,0.0887995,0.4708602],"study_design_scores_gemma":[0.00005096389,0.00019648527,0.0011225366,0.00019522011,0.00010809386,0.00078501075,0.00057990826,0.55067396,0.05984279,0.102705814,0.28362513,0.00011409617],"about_ca_topic_score_codex":0.005988993,"about_ca_topic_score_gemma":0.008076086,"teacher_disagreement_score":0.007308909,"about_ca_system_score_codex":0.0025502162,"about_ca_system_score_gemma":0.0035948576,"threshold_uncertainty_score":0.02445072},"labels":[],"label_agreement":null},{"id":"W4384787174","doi":"10.1109/tgcn.2023.3296646","title":"DRL-Based Green Resource Provisioning for 5G and Beyond Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Provisioning; Resource (disambiguation); Computer science; Environmental science; Computer network","score_opus":0.03812678723632439,"score_gpt":0.2608570580642792,"score_spread":0.22273027082795482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384787174","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.04069877,0.0012632123,0.94518673,0.0011145849,0.00018028393,0.000089502035,0.00018782423,0.0023811245,0.008897949],"genre_scores_gemma":[0.83071184,0.00045119566,0.16357459,0.00049435045,0.00006927392,0.00007383297,0.00026856188,0.00015934969,0.004196904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995647,0.000122037934,0.000013938054,0.00008562996,0.000113806,0.00009984269],"domain_scores_gemma":[0.9994294,0.0002179817,0.00006855959,0.00009261297,0.00013054433,0.00006088693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010217538,0.0007768779,0.0007709001,0.0004990546,0.000563918,0.000827227,0.0015906563,0.0008215722,0.0022803175],"category_scores_gemma":[0.001859894,0.00023554509,0.00036685824,0.00063605455,0.0006422881,0.0015858837,0.001300818,0.0010394146,0.00046999415],"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.00011857725,0.00012703563,0.00090781914,0.00009432558,0.000034490447,0.00009304324,0.000062442276,0.786916,0.0042304588,0.010852932,0.00677275,0.18979016],"study_design_scores_gemma":[0.000005771202,0.000019414327,0.00007418937,0.0000052305254,0.000004389105,0.000017968507,0.000015564661,0.9944817,0.0007631112,0.003459853,0.0011481654,0.0000045666247],"about_ca_topic_score_codex":0.0067814733,"about_ca_topic_score_gemma":0.013005302,"teacher_disagreement_score":0.0067814733,"about_ca_system_score_codex":0.0017331699,"about_ca_system_score_gemma":0.001447588,"threshold_uncertainty_score":0.013484001},"labels":[],"label_agreement":null},{"id":"W4385270603","doi":"10.1109/icde55515.2023.00076","title":"SASPAR: Shared Adaptive Stream Partitioning","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stream processing; Partition (number theory); Heuristics; Latency (audio); Distributed computing; Data stream; Query plan; Bandwidth (computing); Throughput; Parallel computing; Computer network; Search engine; Operating system; Sargable","score_opus":0.04336431057814042,"score_gpt":0.24045838095330319,"score_spread":0.19709407037516277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385270603","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.11327165,0.0005969019,0.8521235,0.00030887197,0.00016170922,0.0003988689,0.00072954956,0.026993196,0.005415749],"genre_scores_gemma":[0.6475404,0.00025528535,0.34563652,0.0002137208,0.00007027146,0.0002955496,0.0019529844,0.0011435163,0.0028917764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886084,0.0001739426,0.00009294711,0.00031235078,0.00039123575,0.00016856263],"domain_scores_gemma":[0.998412,0.00040896912,0.00011990063,0.00060054404,0.0003260036,0.0001326392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992503,0.0012145704,0.00076740974,0.0005988083,0.00071765354,0.0012074175,0.0027089112,0.0005524682,0.0022281066],"category_scores_gemma":[0.0031866326,0.00041334133,0.0005910013,0.0010354868,0.0006381767,0.0022350706,0.002209975,0.001086289,0.0006999383],"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.0019775021,0.00071997923,0.009874707,0.00037894965,0.00031538,0.0005393434,0.00043292684,0.33558095,0.14397141,0.016186632,0.03387592,0.4561463],"study_design_scores_gemma":[0.00010490965,0.000216525,0.0011084257,0.0000070529168,0.000032926615,0.00017183102,0.0000740279,0.95439583,0.03176535,0.0051891254,0.00690191,0.000032135726],"about_ca_topic_score_codex":0.003945774,"about_ca_topic_score_gemma":0.006011155,"teacher_disagreement_score":0.003945774,"about_ca_system_score_codex":0.0009298973,"about_ca_system_score_gemma":0.0018015244,"threshold_uncertainty_score":0.007845581},"labels":[],"label_agreement":null},{"id":"W4385287558","doi":"10.1109/tmc.2023.3298641","title":"UAV-Assisted Wireless Cooperative Communication and Coded Caching: A Multiagent Two-Timescale DRL Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"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 Calgary","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Aggregate (composite); Wireless; Computer network; Wireless network; Base station; Cluster analysis; Cache; Transmission (telecommunications); Scalability; Distributed computing; Artificial intelligence; Telecommunications; Database","score_opus":0.027949167263826815,"score_gpt":0.2689508654677831,"score_spread":0.24100169820395625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385287558","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.029414985,0.00049123866,0.9657754,0.00043062068,0.000064019354,0.000051171253,0.000049331346,0.0002865356,0.0034368322],"genre_scores_gemma":[0.9407456,0.00018845714,0.055209536,0.0002630542,0.00004694632,0.000098362754,0.00007852527,0.000038131395,0.0033314284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999501,0.00013247346,0.000021947326,0.00014514163,0.0000982321,0.00010133891],"domain_scores_gemma":[0.9989932,0.00048021408,0.00014543138,0.00007501331,0.00021517361,0.00009099891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000910406,0.00080161786,0.0009522956,0.00033558137,0.0004581526,0.0008134018,0.002058858,0.0011471534,0.0015139463],"category_scores_gemma":[0.0022244216,0.00040974436,0.0004898758,0.00040889825,0.0007508744,0.0013487848,0.001300034,0.0010658675,0.00023006363],"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.00005554869,0.00004698037,0.00088879775,0.000057384026,0.000035447363,0.0001319798,0.00008347488,0.9617701,0.0014611724,0.007811323,0.0009289371,0.026728703],"study_design_scores_gemma":[0.00000440184,0.000012684694,0.000035615976,0.0000017865347,0.000004191821,0.000009446416,0.0000069408356,0.9986902,0.00010320568,0.0009986825,0.00013065693,0.000002216542],"about_ca_topic_score_codex":0.011491193,"about_ca_topic_score_gemma":0.009041227,"teacher_disagreement_score":0.011491193,"about_ca_system_score_codex":0.001191533,"about_ca_system_score_gemma":0.0011311771,"threshold_uncertainty_score":0.022848606},"labels":[],"label_agreement":null},{"id":"W4385357917","doi":"10.3390/fi15080251","title":"Intelligent Caching with Graph Neural Network-Based Deep Reinforcement Learning on SDN-Based ICN","year":2023,"lang":"en","type":"article","venue":"Future Internet","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Computer science; Cache; Reinforcement learning; Benchmark (surveying); Computer network; Information-centric networking; Software-defined networking; Robustness (evolution); Context (archaeology); False sharing; Distributed computing; CPU cache; Cache algorithms; Artificial intelligence","score_opus":0.014138587903758012,"score_gpt":0.22095757742380362,"score_spread":0.2068189895200456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385357917","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.16620375,0.0016395838,0.82269776,0.0009860483,0.00025441215,0.000080032274,0.0001851112,0.0012627057,0.0066906917],"genre_scores_gemma":[0.97646856,0.0001840835,0.021274243,0.00021146116,0.00003069144,0.000044062515,0.0001178158,0.000031394346,0.0016377287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997898,0.000052488216,0.000012344593,0.000056224486,0.00003708112,0.00005205135],"domain_scores_gemma":[0.99890053,0.0006480094,0.00009673949,0.000047735582,0.00024381149,0.00006329904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072361727,0.00067394384,0.0009172453,0.00033736072,0.00028629016,0.0006391881,0.0012013305,0.00082289043,0.0011654061],"category_scores_gemma":[0.00273267,0.0003242151,0.00036660756,0.00038425287,0.00056520564,0.00077067164,0.0006177253,0.0010591096,0.00013410853],"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.00003316027,0.0000311904,0.00066691317,0.000021513115,0.000019257548,0.000028682634,0.00001335637,0.9842152,0.0003584357,0.0016923636,0.00052862766,0.0123912655],"study_design_scores_gemma":[0.0000018612999,0.000004714227,0.000025264273,9.868683e-7,0.0000019889123,0.0000015588777,9.592836e-7,0.9994923,0.000039307542,0.0004013549,0.000028895223,8.2151786e-7],"about_ca_topic_score_codex":0.023200247,"about_ca_topic_score_gemma":0.022315552,"teacher_disagreement_score":0.023200247,"about_ca_system_score_codex":0.001390456,"about_ca_system_score_gemma":0.0012181492,"threshold_uncertainty_score":0.04613042},"labels":[],"label_agreement":null},{"id":"W4385569495","doi":"10.1109/jiot.2023.3302160","title":"An Experimental Investigation of Tuning QUIC-Based Publish–Subscribe Architectures in IoT","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; MQTT; Computer network; Latency (audio); Internet of Things; Byte; Distributed computing; Embedded system; Telecommunications; Operating system","score_opus":0.03148723702741118,"score_gpt":0.2694414449601345,"score_spread":0.23795420793272332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385569495","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.98819655,0.00017916362,0.007119429,0.00013823107,0.00009589095,0.000121878955,0.00020469265,0.0009863616,0.0029577438],"genre_scores_gemma":[0.9925841,0.00006579413,0.0063772146,0.00006169692,0.000012158278,0.00007192507,0.00017739867,0.00007223164,0.00057746755],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978041,0.0005242093,0.00020270969,0.00031242584,0.00074387447,0.00041270847],"domain_scores_gemma":[0.9916779,0.0047119227,0.000469539,0.0015371267,0.0012098195,0.00039374537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021067385,0.00069535477,0.00056455174,0.0006942019,0.00059689285,0.0008866937,0.0015741894,0.0008396203,0.0016940194],"category_scores_gemma":[0.008482291,0.00033382542,0.000278014,0.0007201593,0.00078890804,0.0014614578,0.0007770012,0.0012124481,0.00036216166],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00782315,0.008696512,0.032148898,0.002144003,0.00046795688,0.0015515139,0.001706449,0.26204154,0.5389371,0.011995507,0.008127969,0.124359384],"study_design_scores_gemma":[0.00056008674,0.008696334,0.027386539,0.00011758331,0.00020589925,0.0005978707,0.00088423793,0.6871047,0.2631399,0.0046640323,0.0065051983,0.00013753674],"about_ca_topic_score_codex":0.0014668145,"about_ca_topic_score_gemma":0.0013172106,"teacher_disagreement_score":0.0021067385,"about_ca_system_score_codex":0.00061614625,"about_ca_system_score_gemma":0.00048399623,"threshold_uncertainty_score":0.011141658},"labels":[],"label_agreement":null},{"id":"W4385614768","doi":"10.1016/j.comnet.2023.109966","title":"SoftCaching: A framework for caching node selection and routing in Software-Defined Information Centric Internet of Things","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Computer network; Cache; Node (physics); Software-defined networking; The Internet; Provisioning; Routing (electronic design automation); Distributed computing","score_opus":0.012629286823528148,"score_gpt":0.22367562899437776,"score_spread":0.2110463421708496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385614768","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.005054418,0.00038483093,0.98043925,0.0001909473,0.00013625217,0.00017926517,0.00015426648,0.011767283,0.0016934313],"genre_scores_gemma":[0.27323815,0.00079849525,0.7158393,0.00048529898,0.00015928547,0.0004834203,0.00093431125,0.001770518,0.006291208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.00024249822,0.000095300355,0.0001622874,0.0005329955,0.00015147752],"domain_scores_gemma":[0.9984491,0.00046138756,0.000102345875,0.0005300401,0.0002753382,0.00018175556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024361904,0.0008017584,0.0012096622,0.0010414945,0.0016102744,0.0032385127,0.0043604667,0.0017447767,0.0028304725],"category_scores_gemma":[0.0036858667,0.0007965151,0.00095015357,0.0011776591,0.0014745151,0.0028753087,0.0028605831,0.0022960103,0.0006441987],"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.00077180436,0.0004986571,0.003097101,0.00068809366,0.0003869811,0.0006775737,0.0010554427,0.27937636,0.021023272,0.33918974,0.044266045,0.30896905],"study_design_scores_gemma":[0.000051504776,0.000065818596,0.00024211747,0.00003966926,0.00006179983,0.00014135576,0.00006109103,0.9357967,0.004779907,0.04217291,0.016528657,0.00005836957],"about_ca_topic_score_codex":0.012221331,"about_ca_topic_score_gemma":0.021714887,"teacher_disagreement_score":0.012221331,"about_ca_system_score_codex":0.0014133165,"about_ca_system_score_gemma":0.002513977,"threshold_uncertainty_score":0.024300396},"labels":[],"label_agreement":null},{"id":"W4386473147","doi":"10.1109/tnse.2023.3312369","title":"Intelligent Content Caching and User Association in Mobile Edge Computing Networks for Smart Cities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":30,"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 British Columbia; Western University","funders":"Chongqing Research Program of Basic Research and Frontier Technology","keywords":"Computer science; Latency (audio); Computer network; Association (psychology); Enhanced Data Rates for GSM Evolution; Handover; Frame (networking); Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.0219091136189821,"score_gpt":0.22182303068734469,"score_spread":0.1999139170683626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386473147","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.24757889,0.00075918675,0.7493868,0.0005608516,0.000030005596,0.000058681413,0.000048387865,0.0002302078,0.0013470133],"genre_scores_gemma":[0.9747679,0.0001859732,0.024305316,0.000042314106,0.000011760853,0.00001796527,0.000028805065,0.000016377451,0.00062364014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991264,0.00033699902,0.00003457336,0.00016753882,0.00012450154,0.00021007784],"domain_scores_gemma":[0.9987935,0.00063674164,0.00020542182,0.000116851195,0.00015617297,0.00009126053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012240887,0.00045457826,0.00087449147,0.0003675461,0.0006827576,0.0010425345,0.0011048396,0.00101725,0.00048706002],"category_scores_gemma":[0.0034408777,0.00042109212,0.00041171737,0.0010010866,0.00072241185,0.002147316,0.0008855171,0.0007100219,0.00008840217],"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.0001334855,0.000106672975,0.00371825,0.000048290363,0.000043248747,0.00014916684,0.00012414422,0.9391298,0.0050187325,0.019896017,0.00087757845,0.03075457],"study_design_scores_gemma":[0.000003413946,0.000013284921,0.00020504853,0.0000011875757,0.0000067226347,0.000015368332,0.000020090112,0.9968712,0.00040220094,0.0023325172,0.00012488726,0.000004175588],"about_ca_topic_score_codex":0.01481955,"about_ca_topic_score_gemma":0.015863977,"teacher_disagreement_score":0.01481955,"about_ca_system_score_codex":0.002247968,"about_ca_system_score_gemma":0.0016169355,"threshold_uncertainty_score":0.029466629},"labels":[],"label_agreement":null},{"id":"W4386857726","doi":"10.1109/jiot.2023.3314667","title":"CLSA: Contrastive-Learning-Based Survival Analysis for Popularity Prediction in MEC Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","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 Toronto; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Popularity; Encoder; Deep learning; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Architecture; Artificial neural network; Latency (audio); Network architecture; Machine learning; Computer network; Operating system","score_opus":0.025543598015360977,"score_gpt":0.25793059837495474,"score_spread":0.23238700035959375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386857726","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.13260359,0.0009997789,0.8604426,0.000678835,0.000106620544,0.00009159169,0.0007009538,0.0019961814,0.0023798032],"genre_scores_gemma":[0.93205804,0.00038832505,0.061648212,0.00033406523,0.000075951284,0.00013400402,0.0015277031,0.00011154803,0.0037220835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997669,0.000050920793,0.000015952937,0.00006953075,0.000048919173,0.000047782494],"domain_scores_gemma":[0.9983493,0.0009742914,0.00015917161,0.00008723399,0.00035301203,0.00007702543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009610952,0.0009643541,0.0007396138,0.0008774302,0.00034429785,0.0005290678,0.0013629262,0.00088683394,0.0020352083],"category_scores_gemma":[0.0044144806,0.0003228653,0.00069960346,0.0006379073,0.00063737313,0.0012192996,0.00086043245,0.0014490176,0.00045790372],"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.0002499671,0.00013531231,0.009440283,0.00011806235,0.00009229874,0.00019516848,0.00010777302,0.8423315,0.0037049153,0.0073724505,0.004107465,0.13214469],"study_design_scores_gemma":[0.0000017056371,0.0000091371485,0.00017586541,0.0000029822284,0.0000031076197,0.0000068014097,0.0000033538088,0.9983864,0.00018070835,0.0011400249,0.000087846674,0.0000019999425],"about_ca_topic_score_codex":0.015271895,"about_ca_topic_score_gemma":0.014455553,"teacher_disagreement_score":0.015271895,"about_ca_system_score_codex":0.0012790364,"about_ca_system_score_gemma":0.00086370006,"threshold_uncertainty_score":0.030366004},"labels":[],"label_agreement":null},{"id":"W4386987358","doi":"10.1016/j.adhoc.2023.103305","title":"Multi-Agent Deep Reinforcement Learning for content caching within the Internet of Vehicles","year":2023,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Université Mohammed VI Polytechnique","keywords":"Computer science; Reinforcement learning; The Internet; Process (computing); Quality (philosophy); Computer network; Multimedia; Distributed computing; Artificial intelligence; World Wide Web; Operating system","score_opus":0.047586976462550466,"score_gpt":0.2528018810073125,"score_spread":0.20521490454476202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386987358","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.21208471,0.0011104137,0.7814843,0.0010480571,0.00014772822,0.000060421768,0.00011646723,0.0006248979,0.003322974],"genre_scores_gemma":[0.98312724,0.00010605936,0.014308685,0.00007820416,0.000023065884,0.000028490933,0.00005492473,0.000023974113,0.0022492309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970263,0.00009884108,0.000011778402,0.00006178089,0.0000406728,0.0000842727],"domain_scores_gemma":[0.9980751,0.0013279938,0.0001471813,0.000059946862,0.0002770612,0.0001126532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899584,0.00061396876,0.0013338953,0.0004077571,0.0004595174,0.0007096741,0.0013718709,0.0012108836,0.0013166601],"category_scores_gemma":[0.0036093432,0.00046493424,0.0003163974,0.0004767083,0.00085302134,0.0009626114,0.00080111274,0.0012359063,0.00014352663],"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.000041096762,0.000034435518,0.0004087555,0.000015765745,0.000015301317,0.000018849718,0.00001472923,0.989131,0.00020168185,0.0020205737,0.00043915753,0.007658697],"study_design_scores_gemma":[0.0000016945953,0.0000037464922,0.000016624235,5.9510916e-7,0.0000010806972,8.6814754e-7,0.0000015102187,0.9995246,0.000022746355,0.00040956135,0.000016408292,6.237148e-7],"about_ca_topic_score_codex":0.028407961,"about_ca_topic_score_gemma":0.020318497,"teacher_disagreement_score":0.028407961,"about_ca_system_score_codex":0.0016922686,"about_ca_system_score_gemma":0.0014172068,"threshold_uncertainty_score":0.056485236},"labels":[],"label_agreement":null},{"id":"W4387090558","doi":"10.1109/dcoss-iot58021.2023.00099","title":"Zone-based Popularity-Oriented Multi-Layer Content Caching in Vehicular Fogs","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Brock University","funders":"","keywords":"Computer science; Cache; Latency (audio); Smart Cache; Computer network; Cache algorithms; Popularity; Distributed computing; CPU cache; Telecommunications","score_opus":0.08933913068314778,"score_gpt":0.27745049165257313,"score_spread":0.18811136096942535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387090558","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.5041994,0.0015383913,0.4885151,0.00013576922,0.000094672876,0.00008966663,0.00015273041,0.0012801847,0.003994053],"genre_scores_gemma":[0.9893288,0.000115265495,0.010195498,0.000013490078,0.000004703543,0.000007536797,0.00003363935,0.000010647661,0.0002904035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996933,0.00006446611,0.000017485685,0.000044855395,0.000079127036,0.00010072657],"domain_scores_gemma":[0.9993268,0.00013716977,0.00006162083,0.0001523162,0.0002769614,0.000045142602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044037428,0.0003314154,0.00049319584,0.0006325955,0.0006410097,0.0008441653,0.0011461229,0.00040253915,0.0003156511],"category_scores_gemma":[0.00083227176,0.00022214824,0.0004765497,0.0007594987,0.00041842696,0.0010341055,0.0004791652,0.00025230073,0.00009014017],"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.0005613739,0.00017114347,0.013495921,0.00024753815,0.0002932679,0.00077057077,0.0004650942,0.7638407,0.10250077,0.023361778,0.0026872396,0.09160464],"study_design_scores_gemma":[0.000009102404,0.00006621992,0.0014033305,0.000005785901,0.00004664533,0.00013271072,0.00009105535,0.9834885,0.012042047,0.0016509795,0.001042723,0.000020781039],"about_ca_topic_score_codex":0.02426637,"about_ca_topic_score_gemma":0.02412511,"teacher_disagreement_score":0.02426637,"about_ca_system_score_codex":0.0013357094,"about_ca_system_score_gemma":0.0009700116,"threshold_uncertainty_score":0.048250258},"labels":[],"label_agreement":null},{"id":"W4387522974","doi":"10.1155/2023/9835028","title":"Retracted: A Content Dissemination Technique Based on Priority to Improve Quality of Service of Vehicular Ad Hoc Networks","year":2023,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":true,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Quality of service; Computer network; Wireless ad hoc network; Service (business); Vehicular ad hoc network; Service quality; Quality (philosophy); Transport engineering; Telecommunications; Engineering; Business; Marketing","score_opus":0.019133960054881806,"score_gpt":0.28839065667774727,"score_spread":0.26925669662286544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387522974","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.24584036,0.0071620913,0.72658443,0.0015873088,0.004867222,0.0005582741,0.0005458198,0.0064377943,0.0064166053],"genre_scores_gemma":[0.84572256,0.0011406315,0.14345661,0.00056832016,0.00058004353,0.00007852851,0.0005522607,0.0003231484,0.007577956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987723,0.00027086673,0.000094234514,0.00022794632,0.0004508115,0.00018393212],"domain_scores_gemma":[0.9943821,0.0011724199,0.00026742162,0.0010794156,0.002597487,0.00050128694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019666932,0.0010095999,0.0013838006,0.0015143731,0.001299425,0.001499533,0.0029128015,0.000921845,0.0025433395],"category_scores_gemma":[0.007180607,0.0004067584,0.0005333183,0.0012299301,0.0005616907,0.0020209844,0.0015444887,0.0017245666,0.0006092643],"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.003516995,0.00091022387,0.0062632705,0.00080983655,0.00030952212,0.0012494029,0.001089187,0.056374475,0.123292685,0.010633555,0.022667218,0.7728836],"study_design_scores_gemma":[0.00048139313,0.002477344,0.0045757014,0.00008286734,0.0003854,0.0013000665,0.0004775103,0.9054415,0.060769074,0.0060519627,0.017812008,0.00014511308],"about_ca_topic_score_codex":0.006379797,"about_ca_topic_score_gemma":0.008168574,"teacher_disagreement_score":0.006379797,"about_ca_system_score_codex":0.00096158293,"about_ca_system_score_gemma":0.0022712627,"threshold_uncertainty_score":0.012685299},"labels":[],"label_agreement":null},{"id":"W4387717447","doi":"10.1109/twc.2023.3323464","title":"Joint Optimization of Preference-Aware Caching and Content Migration in Cost-Efficient Mobile Edge Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":30,"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 British Columbia; Carleton University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Cache; Lyapunov optimization; Mobile edge computing; Computer network; Optimization problem; Enhanced Data Rates for GSM Evolution; Quality of experience; Latency (audio); Cellular network; Server; Quality of service; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.09242371203400757,"score_gpt":0.26821249455465984,"score_spread":0.17578878252065228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387717447","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.16372408,0.00062933954,0.8321342,0.00045073972,0.00005434904,0.000055912777,0.00004519025,0.00020410775,0.0027021456],"genre_scores_gemma":[0.9834563,0.00010619245,0.0153903,0.00005156026,0.000010544189,0.000041220166,0.000020511992,0.000013202025,0.000910156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.00016152064,0.000018641662,0.00007738037,0.00007528972,0.00010723352],"domain_scores_gemma":[0.9991652,0.00047026505,0.00013546448,0.00003915481,0.00012413054,0.000065936554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008163171,0.0007056399,0.00097186916,0.00030520864,0.0003247184,0.00065217813,0.0009580723,0.00081632065,0.000597752],"category_scores_gemma":[0.0021846592,0.0003377575,0.0003079406,0.00041909463,0.0005622555,0.0007353272,0.00073302846,0.00053970335,0.00008649091],"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.000037031983,0.000025996334,0.00031118747,0.0000186069,0.000013385264,0.000041739626,0.00001273798,0.99097276,0.00081693474,0.0018415923,0.00023341698,0.00567463],"study_design_scores_gemma":[0.0000030745814,0.000010510491,0.000043249627,7.8240595e-7,0.000002141936,0.0000042583424,0.0000027855046,0.99936897,0.00007483641,0.00045308235,0.00003513307,0.0000012540763],"about_ca_topic_score_codex":0.006240416,"about_ca_topic_score_gemma":0.0038287607,"teacher_disagreement_score":0.006240416,"about_ca_system_score_codex":0.0010160165,"about_ca_system_score_gemma":0.00084276724,"threshold_uncertainty_score":0.012408197},"labels":[],"label_agreement":null},{"id":"W4387869830","doi":"10.1109/icc45041.2023.10278575","title":"Spatial-Temporal Graph Attention-Based Multi-Agent Reinforcement Learning in Cooperative Edge Caching","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Graph; Multi-agent system; Artificial intelligence; Distributed computing; Theoretical computer science","score_opus":0.033580463475914854,"score_gpt":0.26163628957879415,"score_spread":0.22805582610287928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387869830","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.22138575,0.00098238,0.7707452,0.00062302867,0.0001377895,0.000057330628,0.00008894814,0.0007564047,0.0052232305],"genre_scores_gemma":[0.9882875,0.00009388961,0.0100535005,0.00011897408,0.000015256447,0.000030567982,0.00004016369,0.00001676323,0.0013434659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997396,0.00007744507,0.00001244379,0.00006321274,0.000037627484,0.00006973305],"domain_scores_gemma":[0.99890196,0.00068872445,0.000106383864,0.00004392455,0.00018284605,0.00007610267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070020545,0.00067529007,0.0009757687,0.000270959,0.0003064814,0.0005218205,0.0011345255,0.0008261864,0.0011411877],"category_scores_gemma":[0.002404218,0.00033638807,0.00034655991,0.0003085492,0.0005991543,0.00072478503,0.0006839764,0.00081506727,0.00013699858],"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.00008004377,0.00006180197,0.0011209969,0.000032819902,0.00003662592,0.00007624207,0.000051402476,0.9734832,0.000987971,0.0030879201,0.00072076096,0.020260328],"study_design_scores_gemma":[0.0000036701456,0.000009961602,0.000054201446,8.6222275e-7,0.000003610328,0.0000029915432,0.0000026367768,0.99922466,0.00006357268,0.00059362175,0.000038820865,0.0000013574308],"about_ca_topic_score_codex":0.023178898,"about_ca_topic_score_gemma":0.018254949,"teacher_disagreement_score":0.023178898,"about_ca_system_score_codex":0.0009788554,"about_ca_system_score_gemma":0.0010203122,"threshold_uncertainty_score":0.04608798},"labels":[],"label_agreement":null},{"id":"W4387870560","doi":"10.1109/icc45041.2023.10278905","title":"Reverse Auction-Based Dynamic Caching and Pricing Scheme in Producer-Driven ICN","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Queen's University","funders":"","keywords":"Cache; Computer science; Scheme (mathematics); Computer network; Smart Cache; Cache algorithms; False sharing; Information-centric networking; Service provider; Service (business); CPU cache; Business","score_opus":0.01345313506099758,"score_gpt":0.23944965075816868,"score_spread":0.2259965156971711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870560","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.10254434,0.00057079707,0.88772756,0.0005158294,0.00013449266,0.00020250521,0.00009650002,0.00043655068,0.0077714035],"genre_scores_gemma":[0.94145006,0.00015136992,0.055879597,0.00010063976,0.000037163594,0.000047132482,0.000046325535,0.000039898332,0.0022477931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766976,0.0010084835,0.000104637256,0.00036869445,0.00047605936,0.00037228173],"domain_scores_gemma":[0.9965223,0.0014618433,0.00036543777,0.0005684717,0.0007843103,0.00029768905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034719838,0.0006203602,0.0013860038,0.0007153411,0.0010448368,0.0022748767,0.003678184,0.0014390169,0.0018816503],"category_scores_gemma":[0.0064790635,0.0005004277,0.00066555676,0.0014299374,0.0010545683,0.0030937218,0.0013377907,0.0013928529,0.0002835628],"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.000545819,0.00038922345,0.002907457,0.00019345639,0.00014042624,0.0007724726,0.0003195229,0.7600207,0.015181741,0.12395098,0.0049298857,0.090648435],"study_design_scores_gemma":[0.000017661883,0.00005186786,0.0001210437,0.0000036457718,0.000015017104,0.00013586548,0.000024812298,0.9873103,0.00079695444,0.010782475,0.0007247134,0.000015533642],"about_ca_topic_score_codex":0.003987183,"about_ca_topic_score_gemma":0.0039421176,"teacher_disagreement_score":0.003987183,"about_ca_system_score_codex":0.0023237704,"about_ca_system_score_gemma":0.0019715296,"threshold_uncertainty_score":0.018361807},"labels":[],"label_agreement":null},{"id":"W4388081324","doi":"10.1109/pimrc56721.2023.10293855","title":"An Efficient Bloom Filter-based Range Query Scheme Under Local Differential Privacy","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 New Brunswick","funders":"","keywords":"Bloom filter; Computer science; Differential privacy; Overhead (engineering); Range query (database); Filter (signal processing); Scheme (mathematics); Information privacy; Domain (mathematical analysis); Information retrieval; Web search query; Sargable; Data mining; Computer network; Computer security; Search engine","score_opus":0.027680340502395564,"score_gpt":0.25328392235168595,"score_spread":0.22560358184929039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388081324","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.026455063,0.0006442223,0.9645572,0.0006629161,0.00009535887,0.0005539148,0.00056300464,0.0019391013,0.004529283],"genre_scores_gemma":[0.7275832,0.0005675268,0.26089874,0.0007477464,0.00013844085,0.0007673601,0.00089140714,0.00010539782,0.008300144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931074,0.0015880527,0.0005517778,0.0011826479,0.0027889898,0.000781146],"domain_scores_gemma":[0.99267185,0.0021279606,0.00076383963,0.0027513732,0.0013508867,0.00033406634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029697518,0.00077314617,0.0022487734,0.0014750395,0.0020845057,0.0021170396,0.003366139,0.0019337559,0.002623581],"category_scores_gemma":[0.009684562,0.00047461982,0.0010012834,0.003390639,0.0013947143,0.006688142,0.0056947563,0.0017175815,0.0012903615],"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.0032456003,0.0005937705,0.004697925,0.0008053576,0.00029501587,0.0012073949,0.002269624,0.10768614,0.1332497,0.23167968,0.017709233,0.49656054],"study_design_scores_gemma":[0.0004529268,0.00060103537,0.0009817295,0.00007754126,0.00015228346,0.0016186069,0.00055487984,0.820314,0.05587081,0.09489271,0.024206538,0.00027693858],"about_ca_topic_score_codex":0.0027245032,"about_ca_topic_score_gemma":0.0019825576,"teacher_disagreement_score":0.003366139,"about_ca_system_score_codex":0.0026239268,"about_ca_system_score_gemma":0.0032430121,"threshold_uncertainty_score":0.019038022},"labels":[],"label_agreement":null},{"id":"W4389077472","doi":"10.23919/cnsm59352.2023.10327791","title":"Data Fabrics for Multi-Domain Information Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Computer science; Interoperability; Scalability; Middleware (distributed applications); Latency (audio); Distributed computing; Cloud computing; Domain (mathematical analysis); Key (lock); Computer network; Message oriented middleware; Information exchange; Data exchange; Database; World Wide Web; Operating system","score_opus":0.13684971197816206,"score_gpt":0.3020420972885357,"score_spread":0.16519238531037364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389077472","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.1883308,0.0071438877,0.7238339,0.0040559433,0.0017369608,0.00062048645,0.000915558,0.0073754443,0.06598701],"genre_scores_gemma":[0.79700994,0.0016797358,0.1885061,0.0004705893,0.00016528433,0.00025121693,0.0007204886,0.00034833193,0.010848284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991054,0.00021871779,0.00011577958,0.00012817649,0.00028283923,0.00014903044],"domain_scores_gemma":[0.9983197,0.00034656058,0.00019109172,0.00076941913,0.00022415603,0.00014893114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012507216,0.0003889485,0.00038460802,0.00059470406,0.0012630618,0.0027560256,0.0012205994,0.00064663176,0.005345641],"category_scores_gemma":[0.002416437,0.00038386293,0.00048563333,0.0007805073,0.0006935972,0.0027269362,0.0021112533,0.0012457975,0.0014042117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0010440985,0.0004766652,0.008417823,0.0016188403,0.00016523946,0.0011393233,0.0011234023,0.08527301,0.11081222,0.5179843,0.029844875,0.24210024],"study_design_scores_gemma":[0.00015003263,0.0005662132,0.0058246558,0.00034868167,0.00015518792,0.0014263686,0.0008493915,0.38671938,0.074435875,0.12014992,0.4092483,0.00012612034],"about_ca_topic_score_codex":0.0011336597,"about_ca_topic_score_gemma":0.0014362467,"teacher_disagreement_score":0.005345641,"about_ca_system_score_codex":0.0018522367,"about_ca_system_score_gemma":0.0009811686,"threshold_uncertainty_score":0.017882943},"labels":[],"label_agreement":null},{"id":"W4389083295","doi":"10.1007/978-3-031-47627-3_5","title":"Hash Tables on Non-Volatile Memory","year":2023,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hash function; Dram; Computer science; Non-volatile memory; Hash table; Parallel computing; Embedded system; Computer hardware; Programming language","score_opus":0.025150784321949497,"score_gpt":0.2291310040640321,"score_spread":0.2039802197420826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389083295","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058970895,0.028063938,0.79756284,0.0017912769,0.0035115709,0.00038539834,0.0031238424,0.020146433,0.08644377],"genre_scores_gemma":[0.4946335,0.016123962,0.2901895,0.0010047171,0.0017644655,0.0007008937,0.005115173,0.0041411696,0.18632661],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989298,0.00018060647,0.00011833949,0.00011737861,0.00047294647,0.00018085224],"domain_scores_gemma":[0.9963433,0.0013817237,0.00013901596,0.0015508537,0.0004519491,0.00013321055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009805172,0.0013291866,0.001719947,0.0017082846,0.0013785609,0.005371903,0.0035392598,0.00092049164,0.032846324],"category_scores_gemma":[0.0040122457,0.0012712163,0.0006534013,0.0051222197,0.001322991,0.0099689895,0.0033366994,0.0015497849,0.008009232],"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.0011513607,0.0001351046,0.0010513505,0.0010253403,0.0001152285,0.00039945127,0.00052390987,0.027157705,0.010406907,0.42742535,0.09294256,0.4376657],"study_design_scores_gemma":[0.0002752892,0.00030602905,0.0009528268,0.00043032182,0.00016637488,0.00071350444,0.00042121657,0.1400968,0.022823246,0.64488137,0.18879281,0.00014020408],"about_ca_topic_score_codex":0.0016580377,"about_ca_topic_score_gemma":0.0025986468,"teacher_disagreement_score":0.032846324,"about_ca_system_score_codex":0.0019308435,"about_ca_system_score_gemma":0.0016252301,"threshold_uncertainty_score":0.10988194},"labels":[],"label_agreement":null},{"id":"W4389219633","doi":"10.1016/j.comcom.2023.11.030","title":"Prediction-Based Cooperative Cache Discovery in VANETs for Social Networking","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Computer network; Network packet; Data mining; Cluster analysis; Exploit; Vehicular ad hoc network; Wireless; Computer security; Machine learning; Wireless ad hoc network","score_opus":0.11623881224486594,"score_gpt":0.3029798801223548,"score_spread":0.1867410678774889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389219633","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.13524829,0.0022270216,0.8543624,0.0010614378,0.00032977056,0.00017759936,0.0003677769,0.0009909561,0.005234801],"genre_scores_gemma":[0.96768904,0.00033641158,0.02926793,0.000074475225,0.0000612529,0.000050430583,0.00020367627,0.00003490547,0.0022818157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883837,0.00034378725,0.000051636514,0.00024113597,0.00024860975,0.00027645167],"domain_scores_gemma":[0.9964265,0.002100841,0.00030310862,0.00032707505,0.00063390343,0.00020846084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019938431,0.0007194339,0.0017736448,0.0011575922,0.0013734265,0.0016216828,0.002587882,0.0013689715,0.0012349983],"category_scores_gemma":[0.006722534,0.00067643565,0.0004909063,0.0019475132,0.0009215408,0.002435202,0.001798482,0.0010150776,0.00026606358],"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.00025952,0.00015625279,0.0026784425,0.00009305568,0.0000846453,0.00013174604,0.0002121298,0.91937363,0.002315345,0.01938252,0.0038946958,0.05141795],"study_design_scores_gemma":[0.000005309063,0.000027784148,0.00011364124,0.000004176441,0.00000917323,0.000023766199,0.00004172104,0.99499834,0.00028533407,0.0041194926,0.0003648066,0.0000064971873],"about_ca_topic_score_codex":0.020729704,"about_ca_topic_score_gemma":0.03364707,"teacher_disagreement_score":0.020729704,"about_ca_system_score_codex":0.0014784089,"about_ca_system_score_gemma":0.002202783,"threshold_uncertainty_score":0.041218042},"labels":[],"label_agreement":null},{"id":"W4389319229","doi":"10.1109/access.2023.3339154","title":"Phoenix: Transformative Reconfigurability for Edge IoT Devices in Small-Scale IoT Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reconfigurability; Computer science; Flexibility (engineering); Embedded system; Edge device; Control reconfiguration; Enhanced Data Rates for GSM Evolution; Testbed; Edge computing; Provisioning; Upgrade; Distributed computing; Internet of Things; Computer network; Cloud computing; Operating system; Telecommunications","score_opus":0.07721863445146829,"score_gpt":0.3078069531042833,"score_spread":0.230588318652815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389319229","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.17835626,0.00086254644,0.63087416,0.0007496071,0.0004618336,0.0011818396,0.0013220889,0.1386297,0.047561947],"genre_scores_gemma":[0.84333444,0.00047960514,0.13633017,0.00059779605,0.00008967047,0.0004906405,0.0021427139,0.004103646,0.0124313785],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937576,0.00009009082,0.000045524193,0.00015446455,0.00020323743,0.00013101663],"domain_scores_gemma":[0.99919564,0.00017320323,0.000093535986,0.00033313726,0.0000902104,0.000114333045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010490882,0.00093088753,0.00032546374,0.00046359704,0.00040647486,0.0014159638,0.0015716074,0.0005404529,0.005604767],"category_scores_gemma":[0.0019485321,0.00043105916,0.0004537563,0.00027669503,0.00068964635,0.0021702885,0.0019720485,0.0014740047,0.0015846126],"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.0027419238,0.0009339176,0.01626557,0.001325251,0.00024248456,0.0034264163,0.0021479,0.0708322,0.34720957,0.048487943,0.09970559,0.40668136],"study_design_scores_gemma":[0.0005106658,0.0012207825,0.0124971345,0.00021839874,0.00013584101,0.0025340123,0.00030175896,0.37613353,0.3411498,0.016263569,0.2487771,0.00025742425],"about_ca_topic_score_codex":0.000678961,"about_ca_topic_score_gemma":0.000600159,"teacher_disagreement_score":0.005604767,"about_ca_system_score_codex":0.0004239197,"about_ca_system_score_gemma":0.00043259663,"threshold_uncertainty_score":0.018749833},"labels":[],"label_agreement":null},{"id":"W4389609976","doi":"10.1145/3626739","title":"NOCAP: Near-Optimal Correlation-Aware Partitioning Joins","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Caching and Content Delivery","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 Waterloo","funders":"Universitas Brawijaya","keywords":"Joins; Computer science; Join (topology); Skew; Exploit; Hash function; Key (lock); Relation (database); Parallel computing; Hash join; Theoretical computer science; Algorithm; Data mining; Mathematics","score_opus":0.07309228208787909,"score_gpt":0.28231069972847156,"score_spread":0.20921841764059246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389609976","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.066339046,0.0010818454,0.9232761,0.00024326077,0.000121231846,0.00014346463,0.00023172537,0.0024473818,0.0061160363],"genre_scores_gemma":[0.44770423,0.00036141076,0.54745275,0.00019851098,0.00007007952,0.00016336625,0.0008482967,0.00037224768,0.0028291338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981171,0.00036461372,0.000121041034,0.0003030495,0.0008806339,0.00021368427],"domain_scores_gemma":[0.9972907,0.0009722587,0.00027316783,0.0008186423,0.0005108867,0.00013428973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012974334,0.0008176316,0.00087891717,0.00074929436,0.0010156846,0.0012338326,0.0019856924,0.0005827884,0.0017143943],"category_scores_gemma":[0.005264302,0.00046874434,0.00044666053,0.0013559374,0.00071320584,0.0021768059,0.002157996,0.0007667255,0.0006394842],"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.0012230957,0.00027783052,0.0042210124,0.00035092293,0.00010189194,0.00023581002,0.00042418574,0.44984224,0.037658736,0.051930755,0.02080492,0.43292847],"study_design_scores_gemma":[0.000045102865,0.0001162957,0.0003421079,0.000014734428,0.000018331659,0.00020845175,0.00008381171,0.9606369,0.010244896,0.023132984,0.0051382985,0.000018120267],"about_ca_topic_score_codex":0.0020482838,"about_ca_topic_score_gemma":0.0040509966,"teacher_disagreement_score":0.0020482838,"about_ca_system_score_codex":0.0010741665,"about_ca_system_score_gemma":0.0020148472,"threshold_uncertainty_score":0.007793665},"labels":[],"label_agreement":null},{"id":"W4391634998","doi":"10.1145/3629526.3645037","title":"A Learning-Based Caching Mechanism for Edge Content Delivery","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya","keywords":"Cache; Computer science; Cache algorithms; Smart Cache; Byte; Enhanced Data Rates for GSM Evolution; Computer network; Cache invalidation; Edge device; Cache coloring; Overhead (engineering); Distributed computing; CPU cache; Operating system; Cloud computing; Artificial intelligence","score_opus":0.05124993487789213,"score_gpt":0.25292529015135257,"score_spread":0.20167535527346042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391634998","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.10832387,0.00072067615,0.88208497,0.00044575005,0.00007546836,0.00017675958,0.00026644833,0.0052671717,0.002638921],"genre_scores_gemma":[0.91049856,0.00017854868,0.08687133,0.00019315329,0.000055847144,0.00009379666,0.00028008866,0.00007670427,0.0017519246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990398,0.00019942023,0.000070749615,0.00026266923,0.00028687937,0.00014037793],"domain_scores_gemma":[0.99622715,0.0014319936,0.00043368404,0.00068873516,0.0010142499,0.00020427647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016118737,0.0006663577,0.0010705853,0.00096678094,0.0008033583,0.0010727099,0.0031249821,0.001134061,0.0011135335],"category_scores_gemma":[0.008550958,0.0003139018,0.00044331647,0.0009934618,0.000839162,0.0022613185,0.0011707838,0.0013460835,0.00042590045],"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.0004777444,0.0005373874,0.007935064,0.000112110305,0.000077809105,0.00018422234,0.00016505399,0.72970927,0.007418369,0.009272266,0.004932442,0.2391782],"study_design_scores_gemma":[0.000005566319,0.000030016832,0.00018238583,0.0000026458717,0.0000058463793,0.00002117201,0.000005319322,0.9972319,0.0009593737,0.0013349284,0.0002154123,0.0000054772418],"about_ca_topic_score_codex":0.009964689,"about_ca_topic_score_gemma":0.009057369,"teacher_disagreement_score":0.009964689,"about_ca_system_score_codex":0.0017943914,"about_ca_system_score_gemma":0.001634012,"threshold_uncertainty_score":0.019813359},"labels":[],"label_agreement":null},{"id":"W4392000009","doi":"10.4236/jsea.2024.172004","title":"Framework to Model User Request Access Patterns in the World Wide Web","year":2024,"lang":"en","type":"article","venue":"Journal of Software Engineering and Applications","topic":"Caching and Content Delivery","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":"Trent University","funders":"","keywords":"World Wide Web; Computer science; Web application","score_opus":0.017517867359745448,"score_gpt":0.27411986407072314,"score_spread":0.2566019967109777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392000009","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.034716815,0.00042058938,0.95376617,0.0008894584,0.00007880228,0.00043703898,0.00073012273,0.0011813046,0.007779628],"genre_scores_gemma":[0.5577475,0.0010202382,0.4284733,0.00036289662,0.00012086919,0.0012834799,0.0011200892,0.00029055454,0.009581069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979931,0.00077092735,0.00015112174,0.00031190747,0.0005220768,0.00025097196],"domain_scores_gemma":[0.99756795,0.0009775675,0.000309169,0.00042885076,0.0005392065,0.00017722414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023716716,0.0011809516,0.0009395294,0.001874032,0.00090507086,0.002204038,0.0037115351,0.0027428716,0.0021981786],"category_scores_gemma":[0.0046694507,0.0008555186,0.0016905747,0.0021620987,0.0013529473,0.0033097272,0.0012574244,0.0027448966,0.0009127842],"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.00007299849,0.00028673175,0.0037414671,0.00009237763,0.00009651998,0.0003394582,0.00032783384,0.7593316,0.0026166772,0.21949083,0.0025105707,0.011093015],"study_design_scores_gemma":[0.000014635443,0.000025783731,0.00030129307,0.000011390662,0.000013076233,0.00007626684,0.00004137199,0.97710013,0.00026568814,0.01909963,0.0030378776,0.000012811874],"about_ca_topic_score_codex":0.029885795,"about_ca_topic_score_gemma":0.02487327,"teacher_disagreement_score":0.029885795,"about_ca_system_score_codex":0.0026005076,"about_ca_system_score_gemma":0.0026614976,"threshold_uncertainty_score":0.059423685},"labels":[],"label_agreement":null},{"id":"W4392114198","doi":"10.1109/lca.2024.3365149","title":"Improving Energy-Efficiency of Capsule Networks on Modern GPUs","year":2024,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Caching and Content Delivery","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":"Lakehead University","funders":"","keywords":"Computer science; Computer architecture; Efficient energy use; Parallel computing; Energy (signal processing); Embedded system; Electrical engineering; Engineering","score_opus":0.006455408577077102,"score_gpt":0.18835891221101583,"score_spread":0.18190350363393873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392114198","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.61163205,0.0052144406,0.32721132,0.0015233263,0.00051563914,0.00017879746,0.00075701694,0.016514204,0.036453247],"genre_scores_gemma":[0.91677153,0.00064216624,0.07568448,0.000286288,0.000034375156,0.00006910248,0.0008509637,0.0004107938,0.0052501406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951994,0.00009221075,0.00003150478,0.00007324787,0.00015814797,0.00012501555],"domain_scores_gemma":[0.9993309,0.00017441223,0.000049984523,0.00020750538,0.00018368289,0.00005348822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538284,0.0010049097,0.0005705443,0.00066452834,0.00041053104,0.0010768895,0.0019647456,0.00040363063,0.0038878287],"category_scores_gemma":[0.0021478513,0.00023081042,0.00033665018,0.0011537848,0.00041016936,0.0025303506,0.0010199847,0.0007271164,0.00095849263],"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.0021234527,0.00051462,0.008128852,0.00066304946,0.00023773241,0.00067867484,0.00026950857,0.2654885,0.08577271,0.022135966,0.06328087,0.55070615],"study_design_scores_gemma":[0.00009124651,0.00030291927,0.0013904332,0.000037097478,0.00006669177,0.00015625967,0.00009944876,0.94289196,0.034925133,0.005891891,0.014121261,0.000025756535],"about_ca_topic_score_codex":0.0061137495,"about_ca_topic_score_gemma":0.010884499,"teacher_disagreement_score":0.0061137495,"about_ca_system_score_codex":0.0012448292,"about_ca_system_score_gemma":0.0011110917,"threshold_uncertainty_score":0.013006091},"labels":[],"label_agreement":null},{"id":"W4392152857","doi":"10.1109/globecom54140.2023.10436966","title":"A Graph-Based Spatial-Temporal Deep Reinforcement Learning Model for Edge Caching","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Graph; Theoretical computer science","score_opus":0.03593950672580272,"score_gpt":0.2518820076292137,"score_spread":0.215942500903411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392152857","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.07078958,0.0007538465,0.92111117,0.0007252171,0.0001416123,0.000038131373,0.00022835839,0.00077132357,0.005440747],"genre_scores_gemma":[0.9647217,0.00022528438,0.028945228,0.0002100849,0.000036641497,0.0000652358,0.00022011565,0.000042533266,0.0055332184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997888,0.000055514738,0.000009841414,0.000060696828,0.00003600056,0.000049098926],"domain_scores_gemma":[0.9994474,0.00028849195,0.000058179994,0.000029135597,0.00013804148,0.00003877209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005059044,0.0006419696,0.0007077836,0.0003183578,0.0002261377,0.00061629567,0.0012929055,0.0009061676,0.0019921265],"category_scores_gemma":[0.001733698,0.00031079148,0.00042936686,0.00041441686,0.00055784633,0.00071468053,0.00062415405,0.0012044493,0.00029397872],"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.00007101709,0.000034806133,0.0007504263,0.000029528426,0.000029307548,0.00005005916,0.000023925644,0.97389066,0.00091758015,0.0055425186,0.0012861663,0.017374065],"study_design_scores_gemma":[0.0000021094086,0.000004707331,0.000035301982,9.60315e-7,0.0000028307502,0.0000027065225,0.0000010125116,0.99905664,0.000053858985,0.00077863416,0.000060123875,0.0000011412247],"about_ca_topic_score_codex":0.018718723,"about_ca_topic_score_gemma":0.021724198,"teacher_disagreement_score":0.018718723,"about_ca_system_score_codex":0.0011160579,"about_ca_system_score_gemma":0.0009961107,"threshold_uncertainty_score":0.037219524},"labels":[],"label_agreement":null},{"id":"W4392153185","doi":"10.1109/globecom54140.2023.10436720","title":"Leveraging Graph Theory for Efficient Cache Policy Design in $360^{\\circ}$ Video Streaming","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; CPU cache; Graph theory; Video streaming; Parallel computing; Theoretical computer science; Computer network; Mathematics; Combinatorics","score_opus":0.04429179884129555,"score_gpt":0.2688747795082542,"score_spread":0.22458298066695867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392153185","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.009678203,0.00016462275,0.9887135,0.00012776622,0.000021469225,0.00006788351,0.00004965213,0.00037489,0.0008020926],"genre_scores_gemma":[0.34403497,0.00072731666,0.6526061,0.00017985585,0.00006802539,0.00018906574,0.00035553874,0.00027483236,0.0015642497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998987,0.0003681353,0.000056902154,0.00020224632,0.00027387892,0.00011170892],"domain_scores_gemma":[0.9973888,0.0015889106,0.00020585919,0.00029254472,0.00038691584,0.0001371021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012557644,0.0009904734,0.00088014663,0.0014769047,0.00069914456,0.0012263388,0.0015930906,0.0009891023,0.0016427352],"category_scores_gemma":[0.0051461984,0.0006624006,0.00078981323,0.0016892698,0.0010079973,0.0022176176,0.0009677389,0.0011932458,0.0003833888],"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.00012891376,0.00013397868,0.0009522727,0.00020665352,0.000069721726,0.00014365578,0.00021465486,0.8160741,0.0106675625,0.044019584,0.0029640414,0.124424994],"study_design_scores_gemma":[0.00000829956,0.000032466494,0.0000698487,0.000007429971,0.000010942388,0.000021461192,0.000023230697,0.9837198,0.0009650571,0.014377844,0.0007553349,0.000008252394],"about_ca_topic_score_codex":0.009682859,"about_ca_topic_score_gemma":0.014772008,"teacher_disagreement_score":0.009682859,"about_ca_system_score_codex":0.0017038975,"about_ca_system_score_gemma":0.0023460991,"threshold_uncertainty_score":0.019253016},"labels":[],"label_agreement":null},{"id":"W4392905833","doi":"10.32920/25413808","title":"Latency Efficient Cache Placement Using Learning Techniques in Mobile Edge Networks","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Computer science; Cache; Computer network; Cache algorithms; Mobile edge computing; Base station; Edge device; Enhanced Data Rates for GSM Evolution; Radio access network; Distributed computing; Wireless network; Wireless; CPU cache; Server; Cloud computing; Mobile station; Operating system; Telecommunications","score_opus":0.023231200258216695,"score_gpt":0.26910849961032296,"score_spread":0.24587729935210625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392905833","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.04986278,0.0005666995,0.9472533,0.0002399362,0.000030347252,0.00003965199,0.000031172636,0.0002682956,0.0017078458],"genre_scores_gemma":[0.8075756,0.00059345306,0.18858173,0.00014882596,0.000060137547,0.0000905992,0.00008600877,0.000051295083,0.002812377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.0000780922,0.00001592172,0.000056666915,0.000074577874,0.00006606478],"domain_scores_gemma":[0.99891365,0.0006483323,0.0001578949,0.00004990508,0.00019269697,0.00003759647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068471604,0.0005703505,0.00080791034,0.00050451286,0.00043478364,0.00075610925,0.0009523905,0.0007020587,0.0006806137],"category_scores_gemma":[0.0024957494,0.00035470203,0.0004017077,0.0008183682,0.00050969695,0.0012206335,0.0006472015,0.0008286554,0.00017610406],"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.000038847,0.000048381156,0.00068759365,0.000033255117,0.000013999412,0.000046966426,0.00003319124,0.9513739,0.0017827892,0.0032593128,0.00041589976,0.04226588],"study_design_scores_gemma":[0.0000014826725,0.000013590329,0.000049522652,0.0000023768628,0.0000019760191,0.000006342927,0.0000064558894,0.9983353,0.0003511927,0.0011388392,0.00009141313,0.0000016015634],"about_ca_topic_score_codex":0.005016195,"about_ca_topic_score_gemma":0.005185377,"teacher_disagreement_score":0.005016195,"about_ca_system_score_codex":0.00097274035,"about_ca_system_score_gemma":0.0009498644,"threshold_uncertainty_score":0.009974003},"labels":[],"label_agreement":null},{"id":"W4392906046","doi":"10.32920/25413808.v1","title":"Latency Efficient Cache Placement Using Learning Techniques in Mobile Edge Networks","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Computer science; Cache; Computer network; Mobile edge computing; Base station; Cache algorithms; Edge device; Enhanced Data Rates for GSM Evolution; Wireless network; Radio access network; Latency (audio); Distributed computing; Wireless; CPU cache; Server; Cloud computing; Mobile station; Telecommunications; Operating system","score_opus":0.023231200258216695,"score_gpt":0.26910849961032296,"score_spread":0.24587729935210625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392906046","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.04986278,0.0005666995,0.9472533,0.0002399362,0.000030347252,0.00003965199,0.000031172636,0.0002682956,0.0017078458],"genre_scores_gemma":[0.8075756,0.00059345306,0.18858173,0.00014882596,0.000060137547,0.0000905992,0.00008600877,0.000051295083,0.002812377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.0000780922,0.00001592172,0.000056666915,0.000074577874,0.00006606478],"domain_scores_gemma":[0.99891365,0.0006483323,0.0001578949,0.00004990508,0.00019269697,0.00003759647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068471604,0.0005703505,0.00080791034,0.00050451286,0.00043478364,0.00075610925,0.0009523905,0.0007020587,0.0006806137],"category_scores_gemma":[0.0024957494,0.00035470203,0.0004017077,0.0008183682,0.00050969695,0.0012206335,0.0006472015,0.0008286554,0.00017610406],"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.000038847,0.000048381156,0.00068759365,0.000033255117,0.000013999412,0.000046966426,0.00003319124,0.9513739,0.0017827892,0.0032593128,0.00041589976,0.04226588],"study_design_scores_gemma":[0.0000014826725,0.000013590329,0.000049522652,0.0000023768628,0.0000019760191,0.000006342927,0.0000064558894,0.9983353,0.0003511927,0.0011388392,0.00009141313,0.0000016015634],"about_ca_topic_score_codex":0.005016195,"about_ca_topic_score_gemma":0.005185377,"teacher_disagreement_score":0.005016195,"about_ca_system_score_codex":0.00097274035,"about_ca_system_score_gemma":0.0009498644,"threshold_uncertainty_score":0.009974003},"labels":[],"label_agreement":null},{"id":"W4393003732","doi":"10.3390/app14062589","title":"Optimized Two-Tier Caching with Hybrid Millimeter-Wave and Microwave Communications for 6G Networks","year":2024,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Multimedia University","keywords":"Computer science; Backhaul (telecommunications); Cache; Computer network; Base station; Exploit; Data transmission","score_opus":0.036580156025216325,"score_gpt":0.2563270457599049,"score_spread":0.21974688973468856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393003732","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.076832056,0.0009805338,0.91864944,0.00024903458,0.00005523385,0.000036871163,0.000049214585,0.00030582797,0.0028418477],"genre_scores_gemma":[0.9729639,0.00018403924,0.025404818,0.000075163305,0.0000229149,0.000032422366,0.000039843657,0.000012813643,0.0012640324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996712,0.0000791508,0.000015062967,0.00006782276,0.00009140155,0.00007535737],"domain_scores_gemma":[0.9995565,0.00018979826,0.00007700289,0.000043611904,0.00010146804,0.000031639556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045644664,0.0005503763,0.0007301422,0.00020858318,0.00030960087,0.0005456255,0.0010438508,0.0006869776,0.00082144846],"category_scores_gemma":[0.0011689618,0.00024234373,0.00034891645,0.0003277733,0.00040600394,0.0007682593,0.0005728755,0.0005321337,0.000161978],"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.00008679386,0.00006221639,0.0009891758,0.00003621804,0.00003563331,0.00009269527,0.000027320093,0.96053284,0.004881652,0.005565221,0.0006926102,0.026997643],"study_design_scores_gemma":[0.0000042240263,0.000018659508,0.00007196835,0.0000015817349,0.0000048441866,0.000009586451,0.0000022236966,0.99892175,0.0002933058,0.0005698902,0.000099114885,0.0000028131478],"about_ca_topic_score_codex":0.0072843516,"about_ca_topic_score_gemma":0.009701034,"teacher_disagreement_score":0.0072843516,"about_ca_system_score_codex":0.00079088577,"about_ca_system_score_gemma":0.0008583798,"threshold_uncertainty_score":0.014483869},"labels":[],"label_agreement":null},{"id":"W4393028378","doi":"10.1109/gcwkshps58843.2023.10464723","title":"Learning When and How to Forget in Variable Window LFU Caching","year":2023,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Ericsson (Canada); University of Toronto","funders":"","keywords":"Computer science; Window (computing); Variable (mathematics); Operating system; Mathematics","score_opus":0.01565765651557434,"score_gpt":0.21258504490960486,"score_spread":0.1969273883940305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393028378","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.13325714,0.00059579464,0.8626138,0.0005780298,0.0001072799,0.00008616738,0.00009565506,0.0014132049,0.0012529332],"genre_scores_gemma":[0.90014577,0.00021311536,0.09747319,0.00023194445,0.00010759686,0.00009589825,0.00013170413,0.00009522985,0.0015054697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988701,0.0003052146,0.000068650734,0.000380165,0.00017548677,0.00020029007],"domain_scores_gemma":[0.99292845,0.00421806,0.00079946755,0.0010053035,0.00070082734,0.0003478914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021956102,0.00096879294,0.0015684853,0.00055746763,0.0007646573,0.001283926,0.0031734323,0.0015965528,0.0010639178],"category_scores_gemma":[0.015388994,0.00065827544,0.0004891999,0.00060899754,0.0009839099,0.003599643,0.0010164441,0.0015297484,0.00040980318],"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.0010202907,0.0004449076,0.02117283,0.00019409909,0.00020755154,0.0002990544,0.00036708728,0.5820709,0.0122065935,0.016743647,0.0059859846,0.3592871],"study_design_scores_gemma":[0.000025038733,0.00007519071,0.0006776832,0.000008439777,0.000022519444,0.00006275567,0.000029006158,0.99073774,0.0023452044,0.005593433,0.00040793026,0.000015060127],"about_ca_topic_score_codex":0.0046105087,"about_ca_topic_score_gemma":0.0062774294,"teacher_disagreement_score":0.0046105087,"about_ca_system_score_codex":0.0009770767,"about_ca_system_score_gemma":0.0015929989,"threshold_uncertainty_score":0.01161164},"labels":[],"label_agreement":null},{"id":"W4394874558","doi":"10.1109/tmlcn.2024.3388975","title":"Online Learning to Cache and Recommend in the Next Generation Cellular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Machine Learning in Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Science and Engineering Research Board; Soochow University","keywords":"Cache; Computer science; Cellular network; Computer network","score_opus":0.0782671458954929,"score_gpt":0.2863839221895266,"score_spread":0.2081167762940337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394874558","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.16190284,0.0016862397,0.82870567,0.0024006928,0.0000981733,0.000097581324,0.00031053307,0.0010063772,0.0037919201],"genre_scores_gemma":[0.9289136,0.0007285005,0.065188944,0.0004253115,0.00013801859,0.00011027207,0.00037679827,0.00005423856,0.0040644356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877244,0.0004964487,0.000049362057,0.00025550215,0.00020816083,0.00021806559],"domain_scores_gemma":[0.9928163,0.0057532173,0.000415954,0.0003437559,0.00048323302,0.0001874274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531611,0.00075130095,0.0017272722,0.0005682097,0.00059708435,0.001090526,0.0016078707,0.0015608052,0.0010747827],"category_scores_gemma":[0.010421102,0.0006888795,0.00048357013,0.0011029284,0.0009372124,0.0019353734,0.0008675358,0.001418116,0.0003166035],"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.00018877795,0.00008078943,0.0019058972,0.00004521718,0.000045872606,0.000068006746,0.00004390778,0.9565982,0.0002673314,0.0050970977,0.0015040928,0.03415477],"study_design_scores_gemma":[0.000007060105,0.000013276652,0.00015500728,0.0000025210531,0.000006306376,0.000007081414,0.0000073787173,0.99635136,0.00009790229,0.003229294,0.00011945443,0.0000032715393],"about_ca_topic_score_codex":0.029504208,"about_ca_topic_score_gemma":0.026235692,"teacher_disagreement_score":0.029504208,"about_ca_system_score_codex":0.0020496997,"about_ca_system_score_gemma":0.0021154496,"threshold_uncertainty_score":0.058664978},"labels":[],"label_agreement":null},{"id":"W4399169020","doi":"10.1109/tsc.2024.3407485","title":"Server-Assisted Data Sharing System Supporting Conjunctive Keyword Search for Vehicular Social Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Caching and Content Delivery","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 New Brunswick","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Keyword search; Computer network; File server; Information retrieval","score_opus":0.06109360921267264,"score_gpt":0.3071085501188956,"score_spread":0.24601494090622295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399169020","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.29144445,0.00058509386,0.69723344,0.00034507207,0.00013126658,0.00035425284,0.00024542937,0.005961339,0.003699655],"genre_scores_gemma":[0.96690214,0.0000758645,0.03083021,0.00006252303,0.000035155925,0.000089332,0.00020086174,0.000025261805,0.0017785856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.00033090636,0.00018483185,0.0003608789,0.0003496651,0.00021410118],"domain_scores_gemma":[0.9972767,0.00052195374,0.00023835288,0.0010118344,0.000644278,0.0003069222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058632,0.0004955447,0.0012375189,0.00065247103,0.0016219252,0.001263253,0.002299944,0.0009418493,0.0018636573],"category_scores_gemma":[0.0022483927,0.00032441266,0.00053563016,0.0009100652,0.0006452494,0.0028260264,0.003047851,0.0005941981,0.0009609886],"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.0061317664,0.0014862193,0.018441265,0.0009311284,0.0007429885,0.004429402,0.0034034941,0.14442353,0.25471747,0.08662718,0.019943617,0.458722],"study_design_scores_gemma":[0.00015309207,0.000504938,0.0009805763,0.000015907803,0.00012757455,0.0010602083,0.0003315697,0.9264869,0.050395817,0.011691651,0.008148567,0.00010312588],"about_ca_topic_score_codex":0.0016382976,"about_ca_topic_score_gemma":0.0010967968,"teacher_disagreement_score":0.002299944,"about_ca_system_score_codex":0.00081137946,"about_ca_system_score_gemma":0.00158746,"threshold_uncertainty_score":0.0062345862},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4399801074","doi":"10.1109/ichms59971.2024.10555670","title":"FedStar Caching: Decision Center Assisted Federated Cooperative Edge Caching","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto; Concordia University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Center (category theory); Computer network; Edge device; Operating system; Telecommunications; Cloud computing","score_opus":0.02383044025611283,"score_gpt":0.26635794335163104,"score_spread":0.2425275030955182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399801074","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.08177378,0.00042077596,0.91339684,0.00018808487,0.000086518914,0.00009505135,0.0000981514,0.0014213262,0.0025195302],"genre_scores_gemma":[0.94008595,0.00008671997,0.057794407,0.00014221198,0.000025048386,0.00004959127,0.000111669244,0.000020018157,0.0016843056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993604,0.00015723491,0.000029612054,0.00015919792,0.0001459064,0.00014755112],"domain_scores_gemma":[0.9987185,0.00044641405,0.00012904238,0.00022958069,0.00035347618,0.0001229959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010331268,0.000546234,0.0010802493,0.00047414552,0.00060007296,0.0008292245,0.001779555,0.0009734139,0.00096734625],"category_scores_gemma":[0.00206588,0.00016550989,0.000434949,0.0008219594,0.0005135319,0.0011179327,0.00095063663,0.0005557741,0.00022729159],"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.00072303554,0.0005447057,0.0045392276,0.000086103304,0.00012015248,0.00038282754,0.00013618721,0.7412949,0.008378465,0.008940311,0.0050270455,0.22982703],"study_design_scores_gemma":[0.00001235295,0.000050506394,0.000112053654,0.0000023070525,0.000008449824,0.000040704854,0.000010833267,0.997148,0.0010909636,0.0011932094,0.00032534442,0.00000534261],"about_ca_topic_score_codex":0.006831075,"about_ca_topic_score_gemma":0.0075062714,"teacher_disagreement_score":0.006831075,"about_ca_system_score_codex":0.0007639239,"about_ca_system_score_gemma":0.0013758582,"threshold_uncertainty_score":0.013582647},"labels":[],"label_agreement":null},{"id":"W4400034284","doi":"10.1109/rtas61025.2024.00023","title":"Exclusive Hierarchies for Predictable Sharing in Last-Level Cache","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Cache algorithms; Parallel computing; CPU cache","score_opus":0.050451278302638715,"score_gpt":0.273571611580943,"score_spread":0.2231203332783043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400034284","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.39776638,0.0021751449,0.5882853,0.0004423114,0.00010089162,0.0001958168,0.00013622468,0.0030077777,0.007890112],"genre_scores_gemma":[0.9272216,0.00019323258,0.07024804,0.00019643735,0.000036197212,0.00011523005,0.000103555096,0.00009877452,0.0017871229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989851,0.00016967299,0.00010143354,0.00012518349,0.00039809724,0.00022041803],"domain_scores_gemma":[0.9968251,0.000500398,0.0004143906,0.0015607025,0.00051815965,0.00018133468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007971362,0.00037194276,0.0004109222,0.00048771995,0.0010106441,0.0011486285,0.0019340382,0.00042516054,0.0013565529],"category_scores_gemma":[0.0023053929,0.0003547176,0.00030642474,0.0007930154,0.00064875156,0.0025988359,0.0020154363,0.00097290764,0.000280382],"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.0014898255,0.00082123664,0.017644592,0.0007253701,0.00032862986,0.0012877722,0.0019027574,0.13461326,0.28334513,0.14166383,0.012032043,0.40414557],"study_design_scores_gemma":[0.00021199683,0.0010601453,0.003798151,0.00010800893,0.00025454373,0.0013267245,0.00044844777,0.7633161,0.13705482,0.049628653,0.042661294,0.00013103089],"about_ca_topic_score_codex":0.0020681107,"about_ca_topic_score_gemma":0.0048527983,"teacher_disagreement_score":0.0020681107,"about_ca_system_score_codex":0.00088204263,"about_ca_system_score_gemma":0.0018129185,"threshold_uncertainty_score":0.006399691},"labels":[],"label_agreement":null},{"id":"W4400512539","doi":"10.61091/ars159-13","title":"Construction of Coded Caching Scheme Based on Vector Space over Finite Field","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission; Civil Aviation University of China","keywords":"Scheme (mathematics); Cache; Computer science; Space (punctuation); Finite field; Field (mathematics); Transmission (telecommunications); Class (philosophy); Computer network; Algorithm; Mathematics; Discrete mathematics; Telecommunications","score_opus":0.009957352580260814,"score_gpt":0.22956339593889946,"score_spread":0.21960604335863865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400512539","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.14624636,0.00032380808,0.8412704,0.00018157075,0.00009110347,0.00014185034,0.00013676901,0.0005285167,0.011079559],"genre_scores_gemma":[0.80981773,0.0002395482,0.1856975,0.00006977562,0.000024702964,0.000108319684,0.00014428109,0.00002461635,0.003873473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997173,0.00007964452,0.000020689595,0.00004654209,0.00008378352,0.00005202147],"domain_scores_gemma":[0.9994504,0.00013182178,0.000078332465,0.00014217017,0.00015203808,0.00004527944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029093842,0.00027776125,0.00038163827,0.00065560517,0.00047803405,0.00062176667,0.00052542955,0.00041255084,0.0017532436],"category_scores_gemma":[0.0008773191,0.00012069014,0.0002992093,0.0009930019,0.0005729754,0.0010363617,0.00053723255,0.00039827707,0.00027940905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00033551472,0.00015836355,0.0020752226,0.00024134068,0.000049637598,0.000321226,0.00026251865,0.15487517,0.1081466,0.5709027,0.003992314,0.15863933],"study_design_scores_gemma":[0.00008769452,0.0003757164,0.0006223884,0.000031247222,0.00002876417,0.00052236434,0.00008413849,0.89999264,0.040088914,0.047216862,0.010874878,0.00007446982],"about_ca_topic_score_codex":0.0014739156,"about_ca_topic_score_gemma":0.001063602,"teacher_disagreement_score":0.0017532436,"about_ca_system_score_codex":0.0007448032,"about_ca_system_score_gemma":0.00069520035,"threshold_uncertainty_score":0.0058651567},"labels":[],"label_agreement":null},{"id":"W4400682098","doi":"10.1145/3672198.3673804","title":"OmNICCL: Zero-cost Sparse AllReduce with Direct Cache Access and SmartNICs","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Computer science; Cache; Zero (linguistics); Parallel computing","score_opus":0.03393921950321384,"score_gpt":0.26679316336652165,"score_spread":0.23285394386330782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400682098","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.08981029,0.001162188,0.7788504,0.001015192,0.0005535111,0.00063190586,0.002444503,0.10080542,0.0247266],"genre_scores_gemma":[0.56830996,0.00044730605,0.40446132,0.00074973743,0.00016542948,0.00056852377,0.008087147,0.0039688484,0.013241659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917716,0.000089738176,0.000046520403,0.00015162025,0.00038692672,0.00014803383],"domain_scores_gemma":[0.99903286,0.00012128087,0.000050480303,0.0004427973,0.00023647113,0.000116091585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000722428,0.00087060966,0.00061978993,0.0006547343,0.0007968534,0.0011769218,0.0033542581,0.0004810411,0.0034229024],"category_scores_gemma":[0.0018505377,0.00042306105,0.0006985502,0.0010043307,0.00075501157,0.0018993845,0.0022695581,0.0010305385,0.001984077],"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.0012405261,0.0008266503,0.007764643,0.0011774946,0.00034780067,0.00065792137,0.00080957287,0.10627129,0.09395741,0.044289064,0.23260088,0.5100567],"study_design_scores_gemma":[0.0004662347,0.00036213774,0.0018308543,0.000046791065,0.00007259759,0.00048504458,0.00032487148,0.8141595,0.07752795,0.026163938,0.07842286,0.00013723467],"about_ca_topic_score_codex":0.0080261845,"about_ca_topic_score_gemma":0.014819844,"teacher_disagreement_score":0.0080261845,"about_ca_system_score_codex":0.001039724,"about_ca_system_score_gemma":0.002488167,"threshold_uncertainty_score":0.015958905},"labels":[],"label_agreement":null},{"id":"W4400700169","doi":"10.4995/carma2024.2024.17768","title":"TikTok vs. the Fourth Estate: Engagement With News on TikTok","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"McGill University","funders":"","keywords":"Real estate; Business; Computer science; Finance","score_opus":0.020471850540947436,"score_gpt":0.23048476730746828,"score_spread":0.21001291676652084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400700169","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.9911247,0.0001656867,0.000245414,0.00014820477,0.000019680163,0.000031154,0.0015844975,0.000025349724,0.0066552665],"genre_scores_gemma":[0.9934995,0.00017102694,0.00037350162,0.00009720948,0.000018877367,0.00006449742,0.0020531553,0.000051310773,0.003670947],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99911255,0.00025000484,0.00006421488,0.00018156506,0.00018260174,0.00020905706],"domain_scores_gemma":[0.9923883,0.0043544397,0.0018596102,0.00040981482,0.0004685678,0.00051923975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084814057,0.00027504694,0.00040379612,0.001538988,0.001090082,0.0038317845,0.00035232707,0.0006492102,0.008151968],"category_scores_gemma":[0.010205355,0.00018643595,0.00025969968,0.0023072788,0.00079281896,0.004140129,0.0020809923,0.0009561786,0.002056471],"study_design_candidate":"observational","study_design_consensus":"observational","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.0017018052,0.00028706985,0.7790375,0.0009386079,0.00010974438,0.0007144275,0.16204879,0.00036926416,0.0049744328,0.0022123966,0.0061570304,0.041448995],"study_design_scores_gemma":[0.000021679192,0.00017980646,0.80994606,0.0002286507,0.000072607305,0.00046343185,0.16727048,0.0012922334,0.0013610761,0.0006060776,0.018491225,0.000066621156],"about_ca_topic_score_codex":0.0075596166,"about_ca_topic_score_gemma":0.014193894,"teacher_disagreement_score":0.008151968,"about_ca_system_score_codex":0.0008945751,"about_ca_system_score_gemma":0.00035904505,"threshold_uncertainty_score":0.027271092},"labels":[],"label_agreement":null},{"id":"W4401352266","doi":"10.29007/bw69","title":"Analysis of METIS graph partitioning algorithms for trust and recommendation systems","year":2024,"lang":"en","type":"article","venue":"Kalpa publications in computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metis; Computer science; Partition (number theory); Node (physics); Enhanced Data Rates for GSM Evolution; Graph; Graph partition; Theoretical computer science; Data mining; Artificial intelligence; World Wide Web; Mathematics; Engineering","score_opus":0.04656680759486676,"score_gpt":0.3117516599965326,"score_spread":0.26518485240166584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401352266","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.38397148,0.004123263,0.58467436,0.0020880292,0.00022858831,0.0007903927,0.0020690789,0.004544626,0.017510133],"genre_scores_gemma":[0.7111996,0.00077956717,0.2807477,0.00016167978,0.00006218853,0.00030047426,0.0036818755,0.00025145002,0.0028154086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972549,0.000899815,0.00018612843,0.00043855153,0.000955732,0.00026491447],"domain_scores_gemma":[0.99192774,0.0043762117,0.0004360558,0.0013038636,0.0017321653,0.00022392861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034274599,0.0011441512,0.00095675373,0.0023693654,0.0011682409,0.002248934,0.0015597274,0.0011256315,0.0018106677],"category_scores_gemma":[0.016237173,0.00040898006,0.0008072682,0.0020914397,0.0005047069,0.0026327455,0.0011884669,0.0009434241,0.00066294475],"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.0009780264,0.00038423866,0.011880245,0.0005188279,0.00030125145,0.00012779752,0.00050416176,0.5649369,0.008379061,0.030091403,0.010281059,0.37161708],"study_design_scores_gemma":[0.000031668584,0.0001445104,0.0012354366,0.000020471458,0.000021322116,0.00007025955,0.00014249756,0.9884084,0.002051648,0.006109941,0.0017555135,0.000008251905],"about_ca_topic_score_codex":0.0111536225,"about_ca_topic_score_gemma":0.015582198,"teacher_disagreement_score":0.0111536225,"about_ca_system_score_codex":0.002727171,"about_ca_system_score_gemma":0.0023169355,"threshold_uncertainty_score":0.022177398},"labels":[],"label_agreement":null},{"id":"W4401507681","doi":"10.1109/tits.2024.3429305","title":"Joint Cooperative Caching and UAV Trajectory Optimization Based on Mobility Prediction in the Internet of Connected Vehicles","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":4,"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":"Shandong Provincial Postdoctoral Science Foundation; British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Trajectory; Joint (building); Computer science; The Internet; Computer network; Simulation; Engineering; Operating system","score_opus":0.028198400600946253,"score_gpt":0.23651569805637054,"score_spread":0.2083172974554243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401507681","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.3990019,0.0007181176,0.5963531,0.0005304769,0.000046131045,0.000043324082,0.0001129959,0.00028566323,0.0029081865],"genre_scores_gemma":[0.98833036,0.000098237615,0.010815274,0.000027271693,0.000004777974,0.000017996752,0.000044785054,0.000012380517,0.0006489421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979025,0.000066078435,0.000008232935,0.00004528361,0.00003515425,0.000054973327],"domain_scores_gemma":[0.9995053,0.0002610496,0.00008196292,0.000027357855,0.00008628615,0.00003802263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048479735,0.0005430443,0.00066564424,0.0003136293,0.000395177,0.00050381914,0.00082650763,0.00072059175,0.0004095286],"category_scores_gemma":[0.0015250609,0.0003232506,0.0003873223,0.00056033785,0.00051395944,0.0007695731,0.0004451066,0.0004502184,0.000051192874],"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.000014170433,0.0000052979885,0.00032808137,0.000004602827,0.000005185027,0.000014509006,0.000006614059,0.9969562,0.00018247981,0.00076990464,0.00006439669,0.0016485049],"study_design_scores_gemma":[0.0000011835257,0.0000032110563,0.00004024697,4.6502845e-7,0.0000014885934,0.0000019355666,0.0000024728763,0.99964154,0.00005832608,0.00023007357,0.000018285451,7.84284e-7],"about_ca_topic_score_codex":0.043033365,"about_ca_topic_score_gemma":0.026319213,"teacher_disagreement_score":0.043033365,"about_ca_system_score_codex":0.0017239692,"about_ca_system_score_gemma":0.0012813165,"threshold_uncertainty_score":0.085565746},"labels":[],"label_agreement":null},{"id":"W4401596688","doi":"10.1109/ojcs.2024.3442921","title":"Publish Subscribe System Security Requirement: A Case Study for V2V Communication","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Computer Society","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Publication; Computer science; Computer security; Computer network; Internet privacy; Business; Advertising","score_opus":0.05452727997526256,"score_gpt":0.3062279448934664,"score_spread":0.2517006649182038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401596688","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.8993636,0.00031365282,0.064744964,0.0020989135,0.00007067227,0.00076621276,0.00043548312,0.00042550694,0.031780977],"genre_scores_gemma":[0.9730664,0.00020243514,0.01938047,0.00016062516,0.000019292607,0.00012574796,0.00023928582,0.00008212595,0.006723598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956038,0.0014080026,0.00026212155,0.0003069396,0.0019138445,0.00050529634],"domain_scores_gemma":[0.9871611,0.008776952,0.0007595699,0.0009805915,0.0018976929,0.00042405364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750311,0.0004962769,0.00037255476,0.00073961803,0.0020421545,0.0016749185,0.0012818567,0.0030848298,0.0023458449],"category_scores_gemma":[0.007782138,0.00028514606,0.00062669395,0.0008038043,0.0010981681,0.0023591397,0.0010093465,0.0015711385,0.0005083142],"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.001728281,0.0042188657,0.11872311,0.0024452398,0.00026723236,0.14975142,0.03351652,0.2366839,0.10468259,0.11526329,0.028784566,0.203935],"study_design_scores_gemma":[0.0003275024,0.003503612,0.04313108,0.00039707992,0.00026389092,0.04297332,0.039980438,0.5659812,0.13842084,0.025210883,0.13950029,0.00030997462],"about_ca_topic_score_codex":0.010404228,"about_ca_topic_score_gemma":0.0099166,"teacher_disagreement_score":0.010404228,"about_ca_system_score_codex":0.001736812,"about_ca_system_score_gemma":0.0013223932,"threshold_uncertainty_score":0.020687342},"labels":[],"label_agreement":null},{"id":"W4401692380","doi":"10.1109/isit57864.2024.10619539","title":"Subset Adaptive Relaying for Streaming Erasure Codes","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Erasure; Erasure code; Online codes; Computer network; Decoding methods; Algorithm; Block code; Programming language; Concatenated error correction code","score_opus":0.03234283740478306,"score_gpt":0.2541689741761917,"score_spread":0.22182613677140867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401692380","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.102042004,0.00080720254,0.88946587,0.00022157881,0.00004456616,0.00007942921,0.00010438443,0.00022079053,0.0070142075],"genre_scores_gemma":[0.88958436,0.0012257111,0.10566188,0.00011468286,0.00010854963,0.00012258935,0.00014595044,0.00004358495,0.0029926747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944264,0.0002013382,0.000027039647,0.00009738522,0.00017237588,0.000059226524],"domain_scores_gemma":[0.99795973,0.0011990028,0.00019902024,0.0003507709,0.00023580073,0.000055716067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007166366,0.00056754553,0.00046480814,0.0003791976,0.00035508486,0.00056029327,0.0006852699,0.00051085994,0.0009306521],"category_scores_gemma":[0.0033363963,0.00017551765,0.00041038604,0.00046418956,0.0007691317,0.0009516266,0.000682808,0.0006000117,0.0002711859],"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.00025166373,0.000062666346,0.0009758593,0.0001798803,0.0000494197,0.00049488485,0.00031681967,0.5568125,0.034696624,0.32761246,0.001669594,0.07687763],"study_design_scores_gemma":[0.000017352564,0.00015340414,0.00023604087,0.000016571279,0.000018323502,0.00023469074,0.000030386553,0.9500659,0.0060024504,0.039880082,0.0033263855,0.000018474755],"about_ca_topic_score_codex":0.0010441935,"about_ca_topic_score_gemma":0.0008702663,"teacher_disagreement_score":0.0010441935,"about_ca_system_score_codex":0.000627705,"about_ca_system_score_gemma":0.00048256537,"threshold_uncertainty_score":0.004554391},"labels":[],"label_agreement":null},{"id":"W4401806271","doi":"10.1109/ojcoms.2024.3449241","title":"Predictive Caching in Non-Stationary Environments: A Time Series Prediction and Survival Analysis Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Caching and Content Delivery","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":"Ericsson (Canada); University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Time series; Series (stratigraphy); Computer science; Survival analysis; Statistics; Machine learning; Mathematics; Geology","score_opus":0.02187451916402614,"score_gpt":0.26230095177785234,"score_spread":0.2404264326138262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401806271","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.17255631,0.0020530354,0.8201046,0.0013307147,0.00013744163,0.00007432068,0.00090542855,0.000828815,0.0020093769],"genre_scores_gemma":[0.9681349,0.0009562339,0.027587904,0.00014699914,0.00013213172,0.000088090164,0.0008267563,0.000050188144,0.0020768354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963033,0.0000907704,0.000027186592,0.00012637822,0.00006314306,0.0000621726],"domain_scores_gemma":[0.99657756,0.0023635363,0.0003945289,0.00017202209,0.00038403404,0.00010818653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018260899,0.00096620544,0.0011178704,0.0009986236,0.00039642683,0.00091189705,0.0016417955,0.0010539406,0.0012928538],"category_scores_gemma":[0.0061217602,0.00041759695,0.0008632783,0.0010550045,0.000552336,0.0014678373,0.00069787115,0.0015976751,0.00021723559],"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.0000688523,0.00005400945,0.008620428,0.00007955519,0.000077635996,0.00017712514,0.00008002797,0.9567058,0.0006408324,0.009037215,0.0013265396,0.023131968],"study_design_scores_gemma":[8.492716e-7,0.0000052764044,0.00028086448,0.0000031424595,0.000005120679,0.0000074462537,0.000004939744,0.9982838,0.00005234207,0.0012779935,0.00007536338,0.0000027765348],"about_ca_topic_score_codex":0.024038216,"about_ca_topic_score_gemma":0.014297078,"teacher_disagreement_score":0.024038216,"about_ca_system_score_codex":0.0011138715,"about_ca_system_score_gemma":0.00088349654,"threshold_uncertainty_score":0.047796607},"labels":[],"label_agreement":null},{"id":"W4402043624","doi":"10.14778/3681954.3682027","title":"Aleph Filter: To Infinity in Constant Time","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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":"Infinity; Constant (computer programming); Aleph; Mathematics; Filter (signal processing); Mathematical analysis; Physics; Computer science; Programming language; Particle physics","score_opus":0.010547553289931642,"score_gpt":0.21081831526496186,"score_spread":0.20027076197503021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402043624","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.0102986945,0.00095031934,0.9454395,0.0011817096,0.00031935915,0.00018273488,0.0009181191,0.027127512,0.013581971],"genre_scores_gemma":[0.12048478,0.0007460403,0.84959877,0.0016289908,0.00047105155,0.0006185319,0.00198211,0.0047289855,0.01974076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943897,0.0008672194,0.00040478702,0.0011859178,0.0024179365,0.0007343113],"domain_scores_gemma":[0.9857496,0.0052835597,0.00057417597,0.006078322,0.0019383698,0.0003760042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005165143,0.0021294907,0.0025341157,0.0026985263,0.0021574066,0.0059351,0.004413158,0.0025104687,0.018893803],"category_scores_gemma":[0.028731473,0.0011145454,0.0019040178,0.0033367404,0.0028460745,0.014321688,0.0069827293,0.0033371972,0.010597553],"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.00189218,0.00027242763,0.0030347796,0.00059661665,0.00012206751,0.000326798,0.00072776806,0.029902248,0.013052123,0.23638134,0.08615798,0.6275336],"study_design_scores_gemma":[0.0002733208,0.00023349958,0.0004496086,0.00018106936,0.00010880933,0.0006341659,0.00024750843,0.45355374,0.022272974,0.43730554,0.08461997,0.00011971766],"about_ca_topic_score_codex":0.0055117565,"about_ca_topic_score_gemma":0.006422203,"teacher_disagreement_score":0.018893803,"about_ca_system_score_codex":0.0030945044,"about_ca_system_score_gemma":0.0044766665,"threshold_uncertainty_score":0.06320608},"labels":[],"label_agreement":null},{"id":"W4402124114","doi":"10.1007/978-981-97-5204-1_8","title":"Delivery Networks with Shared Caches and Correlated Content","year":2024,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Content (measure theory); Content delivery; Computer network; Mathematics","score_opus":0.12334691164395688,"score_gpt":0.29118708063694243,"score_spread":0.16784016899298554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402124114","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.057299443,0.015317947,0.8252636,0.0060961824,0.0007468376,0.0001475011,0.0005196839,0.00092207274,0.09368684],"genre_scores_gemma":[0.72952074,0.020388816,0.1337456,0.0009987182,0.001053733,0.00030304992,0.00054588023,0.00038525005,0.11305825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00017248637,0.000024296089,0.00011722738,0.00016224655,0.00007346803],"domain_scores_gemma":[0.9972519,0.0018794459,0.00019747486,0.00035744475,0.00024813865,0.000065661414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094947673,0.0006394845,0.00095249753,0.00076569855,0.000843485,0.0028394284,0.0018641683,0.0011528356,0.00593515],"category_scores_gemma":[0.0050073876,0.00071920187,0.0003928407,0.0028750012,0.0014589222,0.0056086057,0.0013742003,0.0018230199,0.0010447367],"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.00010977757,0.000052726635,0.00035256826,0.00020491435,0.00004191616,0.0001550365,0.00022156483,0.08743734,0.001886658,0.80234003,0.026777664,0.08041984],"study_design_scores_gemma":[0.000034151715,0.000057601872,0.00031963477,0.00012599753,0.000082952625,0.00051332446,0.00021399201,0.48148236,0.002866934,0.4581414,0.05612508,0.000036597638],"about_ca_topic_score_codex":0.0022622147,"about_ca_topic_score_gemma":0.002474607,"teacher_disagreement_score":0.00593515,"about_ca_system_score_codex":0.0032755581,"about_ca_system_score_gemma":0.0009351278,"threshold_uncertainty_score":0.023765922},"labels":[],"label_agreement":null},{"id":"W4402151199","doi":"10.32604/cmc.2024.051611","title":"Information Centric Networking Based Cooperative Caching Framework for 5G Communication Systems","year":2024,"lang":"en","type":"article","venue":"Computers, materials & continua/Computers, materials & continua (Print)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":23,"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":"Natural Sciences and Engineering Research Council of Canada; New Brunswick Innovation Foundation","keywords":"Computer science; Information-centric networking; Computer network; Distributed computing; Cache","score_opus":0.015100327068094794,"score_gpt":0.24126579469599732,"score_spread":0.22616546762790252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402151199","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.027982276,0.005791712,0.9409399,0.0014037647,0.00039616172,0.00019426142,0.00029357587,0.0010273654,0.021970956],"genre_scores_gemma":[0.8851983,0.0032468922,0.09964304,0.0003966169,0.00024315837,0.00020382529,0.00026670142,0.00007077203,0.010730702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.0001254916,0.000018626406,0.00007229402,0.000111159155,0.00008824967],"domain_scores_gemma":[0.99967563,0.00007469386,0.000024258683,0.00006381006,0.00012731228,0.00003432801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740313,0.0004949046,0.0006799722,0.00044949626,0.0007574319,0.00164706,0.0015259541,0.0007394405,0.0025052284],"category_scores_gemma":[0.00068643724,0.00018897397,0.00034395518,0.00073810987,0.00052489043,0.0017648267,0.0010737255,0.00070068,0.0005438757],"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.00030982547,0.00014861379,0.0008634033,0.00036134492,0.000110728826,0.00058302016,0.00050966017,0.2570069,0.017811598,0.57524973,0.02803462,0.11901058],"study_design_scores_gemma":[0.00001874329,0.00012109018,0.00025333939,0.00004682135,0.00006142495,0.00022193104,0.00012918767,0.8909621,0.0022072003,0.08571414,0.020228336,0.000035580764],"about_ca_topic_score_codex":0.006450247,"about_ca_topic_score_gemma":0.0087298555,"teacher_disagreement_score":0.006450247,"about_ca_system_score_codex":0.0013621612,"about_ca_system_score_gemma":0.0015546852,"threshold_uncertainty_score":0.01282537},"labels":[],"label_agreement":null},{"id":"W4402426760","doi":"10.1145/3698820","title":"Memento Filter: A Fast, Dynamic, and Robust Range Filter","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"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":"Natural Sciences and Engineering Research Council of Canada; Universitas Brawijaya","keywords":"Computer science; Range query (database); Filter (signal processing); Bloom filter; Key (lock); Range (aeronautics); Data mining; Information retrieval; Artificial intelligence; Algorithm; Computer vision; Search engine; Computer security; Web search query","score_opus":0.053170123164911785,"score_gpt":0.2665536884634266,"score_spread":0.2133835652985148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402426760","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.05009426,0.0030037414,0.8588315,0.00072507624,0.00031673306,0.00039551026,0.0035548618,0.07214289,0.010935448],"genre_scores_gemma":[0.41744038,0.0008783995,0.55792433,0.001238479,0.00021554937,0.000620263,0.0065526417,0.002553058,0.01257689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997474,0.00018717961,0.00023821389,0.0004365246,0.0014115518,0.0002525423],"domain_scores_gemma":[0.99441296,0.0016789889,0.0005318301,0.0017377377,0.0014458103,0.00019274087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018310681,0.0009973404,0.0012399158,0.0024944902,0.001046283,0.0025774979,0.0030301851,0.0014319126,0.005982],"category_scores_gemma":[0.011472814,0.00069404586,0.0006838584,0.0022930577,0.0009327604,0.0059981747,0.00279922,0.0010574491,0.0036618935],"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.002314446,0.00028472094,0.010185171,0.0005392072,0.00014822479,0.00046092013,0.00052010285,0.018097362,0.05744437,0.026969958,0.07530449,0.80773103],"study_design_scores_gemma":[0.00042661556,0.0009205572,0.004141358,0.00018818009,0.00014113002,0.0016560914,0.00049059594,0.6293814,0.1950389,0.04762153,0.11963395,0.00035967462],"about_ca_topic_score_codex":0.0047856444,"about_ca_topic_score_gemma":0.0056317337,"teacher_disagreement_score":0.005982,"about_ca_system_score_codex":0.0011756434,"about_ca_system_score_gemma":0.0018756979,"threshold_uncertainty_score":0.020011842},"labels":[],"label_agreement":null},{"id":"W4402472206","doi":"10.55662/jst.2023.4606","title":"Evaluating the Efficiency of Caching Strategies in Reducing Application Latency","year":2023,"lang":"en","type":"article","venue":"Journal of Science & Technology","topic":"Caching and Content Delivery","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":"Schlumberger (Canada)","funders":"","keywords":"Latency (audio); Computer science; Telecommunications","score_opus":0.0369041766710271,"score_gpt":0.34293726689443277,"score_spread":0.3060330902234057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402472206","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.9743139,0.0028618257,0.018970067,0.000108437955,0.00004610815,0.00019183537,0.00018502207,0.00092196616,0.002400711],"genre_scores_gemma":[0.9825262,0.00057406974,0.016164966,0.000024701912,0.000011571924,0.00006416532,0.00013515262,0.000057971687,0.00044126308],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979208,0.00063798885,0.00026234725,0.00021750158,0.0005083727,0.00045310133],"domain_scores_gemma":[0.99036986,0.00622444,0.00074639585,0.00080235285,0.0015673406,0.00028958428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017820877,0.0012262377,0.0007462988,0.00163397,0.00054265157,0.0011189572,0.0011065392,0.00076956936,0.00054520596],"category_scores_gemma":[0.0096399505,0.00027536444,0.00040806804,0.0016009421,0.00030733203,0.0016745477,0.0004360265,0.00044052815,0.00022110372],"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.004921249,0.002519027,0.067308225,0.001990628,0.00064554065,0.00049077184,0.00063685334,0.1974426,0.3825726,0.0026228959,0.0015626503,0.33728692],"study_design_scores_gemma":[0.00023088043,0.009084052,0.04739752,0.00015843789,0.0009826488,0.0007937776,0.0008250011,0.52608174,0.4079699,0.0016477079,0.004626738,0.00020151927],"about_ca_topic_score_codex":0.0035918974,"about_ca_topic_score_gemma":0.004188144,"teacher_disagreement_score":0.0035918974,"about_ca_system_score_codex":0.0007695338,"about_ca_system_score_gemma":0.0011815897,"threshold_uncertainty_score":0.009424686},"labels":[],"label_agreement":null},{"id":"W4402811035","doi":"10.1109/iccc62479.2024.10681793","title":"Viewing Distance-Aware Volumetric Video Caching and Rendering for XR Services","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Rendering (computer graphics); Computer graphics (images); Computer vision; Multimedia","score_opus":0.015340908394520675,"score_gpt":0.23852362779579425,"score_spread":0.22318271940127357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811035","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.017764898,0.000806092,0.9774495,0.00015975279,0.000054670785,0.000083522624,0.00007870769,0.0010456097,0.00255742],"genre_scores_gemma":[0.658517,0.0011500154,0.33608067,0.00019070598,0.00016075693,0.000101792706,0.0002760125,0.00034129442,0.0031817385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890304,0.00027504103,0.000051150797,0.00017026557,0.00041900852,0.00018136055],"domain_scores_gemma":[0.9987463,0.0004288916,0.00012272316,0.00034300136,0.00027185006,0.00008725602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007488,0.0013198629,0.0013172325,0.0005582096,0.0005085536,0.0014369915,0.0025935697,0.00081218284,0.0021078356],"category_scores_gemma":[0.002892246,0.0003995289,0.0008621928,0.0010815262,0.00056722783,0.0020568871,0.0014872426,0.0015033567,0.00063473557],"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.00061216357,0.00036093377,0.0023507942,0.00041206644,0.0001664883,0.0006482208,0.00045882832,0.56293577,0.07879356,0.030033968,0.009039464,0.3141877],"study_design_scores_gemma":[0.000014777935,0.00006306873,0.00029254856,0.000012599859,0.000027046142,0.00024092935,0.000056658206,0.98878354,0.005497371,0.002716078,0.0022676808,0.000027660657],"about_ca_topic_score_codex":0.007852314,"about_ca_topic_score_gemma":0.00747794,"teacher_disagreement_score":0.007852314,"about_ca_system_score_codex":0.0010269451,"about_ca_system_score_gemma":0.0011280478,"threshold_uncertainty_score":0.015613198},"labels":[],"label_agreement":null},{"id":"W4402845312","doi":"10.21203/rs.3.rs-4971579/v1","title":"Hadoop-Oriented SVM-LRU (H-SVM-LRU): An Intelligent Cache Replacement Algorithm to Improve MapReduce Performance","year":2024,"lang":"en","type":"preprint","venue":"Research Square","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Support vector machine; Cache; Cache algorithms; Parallel computing; Operating system; Algorithm; CPU cache; Artificial intelligence","score_opus":0.05798085691527283,"score_gpt":0.37066795622891874,"score_spread":0.3126870993136459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402845312","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.21540885,0.0026701523,0.7045087,0.0012299644,0.002067906,0.00044157146,0.0016031009,0.06343929,0.008630479],"genre_scores_gemma":[0.70179754,0.0002545906,0.29033995,0.00036478334,0.00024352656,0.00011716155,0.0013521379,0.0008708713,0.004659507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991721,0.00018382526,0.000047298246,0.00019419446,0.00024695898,0.0001557738],"domain_scores_gemma":[0.998643,0.00018081877,0.00007136732,0.00047394968,0.00046990722,0.00016101937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010369518,0.00075207744,0.0010640774,0.00059943844,0.0014248821,0.00090633164,0.0023334967,0.0006113295,0.0014012755],"category_scores_gemma":[0.002400553,0.00033772225,0.0004592801,0.0011502359,0.0005349531,0.001314078,0.00093074655,0.0011851917,0.0006409636],"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.0018547323,0.0014170553,0.00867817,0.00043470162,0.00029087512,0.00023197246,0.00027806047,0.12275782,0.0583894,0.009420874,0.08891731,0.7073291],"study_design_scores_gemma":[0.00014768082,0.00037103947,0.0017688216,0.000012825943,0.000060590115,0.0001737908,0.00009520907,0.9576466,0.023238437,0.006563899,0.009861867,0.00005920377],"about_ca_topic_score_codex":0.008980542,"about_ca_topic_score_gemma":0.018639164,"teacher_disagreement_score":0.008980542,"about_ca_system_score_codex":0.00094812794,"about_ca_system_score_gemma":0.0031176792,"threshold_uncertainty_score":0.017856538},"labels":[],"label_agreement":null},{"id":"W4402897391","doi":"10.1109/iwqos61813.2024.10682957","title":"SCALM: Towards Semantic Caching for Automated Chat Services with Large Language Models","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; World Wide Web","score_opus":0.01141670330680146,"score_gpt":0.252786900540906,"score_spread":0.24137019723410458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402897391","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.16757011,0.0019186073,0.6893021,0.0015178607,0.00018080435,0.0006916505,0.0031482552,0.13025439,0.0054163355],"genre_scores_gemma":[0.5337779,0.0006099199,0.4500156,0.0005688983,0.000082362894,0.00041212921,0.007654258,0.002581064,0.004297992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795413,0.00070313766,0.00018256962,0.0002849869,0.0006328598,0.00024227523],"domain_scores_gemma":[0.9925581,0.0024147884,0.00034547815,0.0029975213,0.0013023067,0.00038181982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003306556,0.0011573303,0.0011304563,0.0017363789,0.0013554307,0.0029273566,0.0038510317,0.0016089021,0.0030524575],"category_scores_gemma":[0.01757434,0.0006194235,0.0009888714,0.0023478398,0.0010340613,0.006562887,0.004049414,0.00194416,0.0017711646],"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.0037350422,0.0013251666,0.035848897,0.0018640648,0.00068123237,0.0014758183,0.003401197,0.11829171,0.05333319,0.05577582,0.10064488,0.6236231],"study_design_scores_gemma":[0.000113324044,0.00013620587,0.0013356009,0.000051193412,0.00008763537,0.0002055665,0.00055889646,0.9550091,0.012646584,0.014787393,0.01501277,0.000055659508],"about_ca_topic_score_codex":0.032920893,"about_ca_topic_score_gemma":0.038869876,"teacher_disagreement_score":0.032920893,"about_ca_system_score_codex":0.0024465965,"about_ca_system_score_gemma":0.005291441,"threshold_uncertainty_score":0.065458536},"labels":[],"label_agreement":null},{"id":"W4403180126","doi":"10.36227/techrxiv.172833141.18423812/v1","title":"Enhancing Video Streaming Performance Using Network Digital Twins: Buffer Control and Video Caching Strategies","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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; Digital video; Computer network; Buffer (optical fiber); Video streaming; Control (management); Real-time computing; Video on demand; Telecommunications; Artificial intelligence","score_opus":0.014926323337318876,"score_gpt":0.23303098141644366,"score_spread":0.21810465807912477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403180126","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.24598575,0.0012093779,0.7472117,0.00030246258,0.000104439285,0.000096395095,0.00004797337,0.00080035196,0.0042415764],"genre_scores_gemma":[0.91962636,0.0003126152,0.07874108,0.00005498906,0.000024448438,0.000021963311,0.000033462402,0.000029260447,0.0011559326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975294,0.000066238936,0.000015998865,0.000054235174,0.000076667595,0.00003394112],"domain_scores_gemma":[0.9996076,0.000116834744,0.00005955623,0.00005616645,0.0001050591,0.000054671575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272159,0.0005003747,0.0004891798,0.00045983092,0.00038181644,0.0010154896,0.0011233441,0.00044610183,0.00048434973],"category_scores_gemma":[0.0016236394,0.00018067511,0.00022451695,0.00033622453,0.00043654826,0.0014698424,0.00085671584,0.00048855797,0.00006949639],"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.0008367805,0.0006318101,0.008085365,0.00018473585,0.00016282596,0.00042900073,0.0002789693,0.4483873,0.18582888,0.044006053,0.0018769351,0.3092914],"study_design_scores_gemma":[0.000023177188,0.00012781197,0.00043225047,0.000007122032,0.000042300217,0.00008329449,0.00003224857,0.97594154,0.019577613,0.0027378837,0.0009777817,0.000016914188],"about_ca_topic_score_codex":0.0052429256,"about_ca_topic_score_gemma":0.005260141,"teacher_disagreement_score":0.0052429256,"about_ca_system_score_codex":0.0010682701,"about_ca_system_score_gemma":0.0008480695,"threshold_uncertainty_score":0.010424793},"labels":[],"label_agreement":null},{"id":"W4403420245","doi":"10.1109/tnet.2024.3474888","title":"A Resource-Efficient Content Sharing Mechanism in Large-Scale UAV Named Data Networking","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Caching and Content Delivery","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":"Carleton University","funders":"Beijing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Computer science; Mechanism (biology); Resource (disambiguation); Scale (ratio); Shared resource; Content (measure theory); Data sharing; World Wide Web; Distributed computing; Computer network; Geography; Mathematics","score_opus":0.07088437641741967,"score_gpt":0.2639037212132092,"score_spread":0.19301934479578953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403420245","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.07926288,0.0004665213,0.9155591,0.00036495202,0.000082978375,0.00021585812,0.00007632423,0.000286308,0.0036850995],"genre_scores_gemma":[0.9008756,0.00021640949,0.09692144,0.000093425704,0.00004273899,0.00014876202,0.00006397205,0.000023904493,0.0016137258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983103,0.0007255561,0.000095446194,0.00034096243,0.00036023767,0.00016752623],"domain_scores_gemma":[0.9974362,0.0009729715,0.0005302091,0.00048998836,0.00032900937,0.00024166756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026779543,0.0005574543,0.00088447065,0.0008349749,0.0013299469,0.0011999038,0.0024589451,0.0011887165,0.0012831796],"category_scores_gemma":[0.0040015304,0.0003153049,0.0006030845,0.0011980331,0.0011650365,0.0029158706,0.0018241353,0.00061415345,0.00019961491],"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.00073757116,0.0004206327,0.002532023,0.0005015414,0.00020478018,0.0009845811,0.00073135627,0.45356306,0.036812346,0.3812776,0.006706161,0.1155284],"study_design_scores_gemma":[0.00005549562,0.0001638172,0.00033686336,0.0000193235,0.000028245438,0.0002668336,0.00008573464,0.9533211,0.0032690098,0.037804645,0.004612307,0.000036582132],"about_ca_topic_score_codex":0.0011379957,"about_ca_topic_score_gemma":0.0007045648,"teacher_disagreement_score":0.0026779543,"about_ca_system_score_codex":0.0015261983,"about_ca_system_score_gemma":0.0011804142,"threshold_uncertainty_score":0.014162481},"labels":[],"label_agreement":null},{"id":"W4403420284","doi":"10.1109/tmc.2024.3481276","title":"Deep Reinforcement Learning-Based Joint Caching and Routing in AI-Driven Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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 British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Reinforcement learning; Joint (building); Routing (electronic design automation); Computer network; Artificial intelligence; Distributed computing","score_opus":0.012709366229248538,"score_gpt":0.23611230977656303,"score_spread":0.2234029435473145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403420284","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.13159381,0.0007628561,0.86216325,0.00074103737,0.00008717671,0.00006264819,0.000085346044,0.00077198166,0.003731972],"genre_scores_gemma":[0.9718777,0.000138431,0.026160162,0.00016262697,0.000022601127,0.000053593456,0.000059135127,0.000023507417,0.0015021915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996153,0.00011849831,0.000018622579,0.00008512702,0.00006572162,0.000096708594],"domain_scores_gemma":[0.99850357,0.00097218633,0.00015315591,0.000062190586,0.00020796015,0.00010096531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010925423,0.00062512886,0.0011545578,0.00032939127,0.00039979807,0.0006215924,0.0014584007,0.0010258578,0.0011203848],"category_scores_gemma":[0.0027875816,0.0004132113,0.00033993102,0.0004441157,0.0008897057,0.000958842,0.0006977328,0.0011367021,0.0001340317],"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.000044098946,0.000034705947,0.00035866193,0.00001768348,0.000014614807,0.000022404105,0.000016820899,0.9866348,0.00034019194,0.0024003396,0.00031061014,0.009805048],"study_design_scores_gemma":[0.000003465133,0.0000060602606,0.000021219104,6.8014094e-7,0.0000017137496,0.0000016886839,0.0000010592789,0.9991498,0.000051820272,0.0007329393,0.000028686565,8.362829e-7],"about_ca_topic_score_codex":0.019469028,"about_ca_topic_score_gemma":0.014434422,"teacher_disagreement_score":0.019469028,"about_ca_system_score_codex":0.0015858223,"about_ca_system_score_gemma":0.001677364,"threshold_uncertainty_score":0.03871143},"labels":[],"label_agreement":null},{"id":"W4404058574","doi":"10.1016/j.hcc.2024.100277","title":"Learning-based cooperative content caching and sharing for multi-layer vehicular networks","year":2024,"lang":"en","type":"article","venue":"High-Confidence Computing","topic":"Caching and Content Delivery","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 Victoria","funders":"State Key Laboratory of Industrial Control Technology; Zhejiang University; National Natural Science Foundation of China","keywords":"Computer science; Layer (electronics); Computer network; Content (measure theory); Multimedia; Materials science","score_opus":0.06331262196225164,"score_gpt":0.28566169268509334,"score_spread":0.2223490707228417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404058574","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.087521724,0.0007568294,0.9093008,0.00020867721,0.00006301509,0.000049866445,0.000033096945,0.00036397492,0.0017020673],"genre_scores_gemma":[0.9790725,0.00016578958,0.01961508,0.000049110095,0.000023214168,0.00004036525,0.000040056544,0.00001399743,0.0009799766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952924,0.00011244707,0.000024781544,0.000102007536,0.00010540129,0.00012612597],"domain_scores_gemma":[0.9988959,0.0005400067,0.0001701027,0.00008572361,0.00022529834,0.000082894956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008843084,0.0006548626,0.0010840157,0.0004951535,0.0006611039,0.00074077415,0.0021181572,0.00075039297,0.000599641],"category_scores_gemma":[0.0024140726,0.00036799032,0.00045459662,0.0006053099,0.00064688944,0.0009530186,0.0008522852,0.000668696,0.0001442849],"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.0000660706,0.000050020986,0.0008899296,0.000035109748,0.00003080249,0.00006388514,0.00006195043,0.9678724,0.0017439196,0.0030370585,0.00052242575,0.025626369],"study_design_scores_gemma":[0.0000024306735,0.0000130960725,0.000045376088,9.2232796e-7,0.0000040264194,0.000006683897,0.0000052644086,0.9990804,0.00016683692,0.00060891535,0.00006394564,0.000002081172],"about_ca_topic_score_codex":0.017262375,"about_ca_topic_score_gemma":0.014619558,"teacher_disagreement_score":0.017262375,"about_ca_system_score_codex":0.0014812583,"about_ca_system_score_gemma":0.0012991744,"threshold_uncertainty_score":0.03432381},"labels":[],"label_agreement":null},{"id":"W4404259379","doi":"10.36227/techrxiv.173145101.12229004/v1","title":"Enhancing User-Centric Multimedia Services Using Digital Twin-Based Caching and Computing Optimization","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"Simon Fraser University; University of Victoria","funders":"","keywords":"Computer science; Multimedia; World Wide Web; Human–computer interaction","score_opus":0.013132893546468202,"score_gpt":0.23695736855750732,"score_spread":0.2238244750110391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404259379","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.10098705,0.00056120683,0.89087963,0.0002028368,0.000050563172,0.000052755837,0.000045712353,0.00050830684,0.006712022],"genre_scores_gemma":[0.908109,0.00032625778,0.0896538,0.00006347044,0.0000231064,0.000026981934,0.000051888353,0.000046656893,0.0016989678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997217,0.00007907468,0.00001576473,0.00004806543,0.0000879442,0.000047497615],"domain_scores_gemma":[0.99959344,0.0001313883,0.000047892583,0.000086190375,0.000098963275,0.000042117146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046516382,0.00045301943,0.0005471303,0.00044930278,0.00039119282,0.001007921,0.00086773164,0.0003707473,0.00096653926],"category_scores_gemma":[0.0016124884,0.00017305947,0.00022243566,0.00090964994,0.0005078495,0.0018014868,0.0010965122,0.00048394428,0.00015959705],"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.00041845,0.00018801747,0.0027214424,0.00012178258,0.00006997141,0.00017944464,0.00015063719,0.70544904,0.06666672,0.08397144,0.0027703026,0.1372927],"study_design_scores_gemma":[0.000006256443,0.00003864935,0.00012346415,0.0000028041584,0.000009416841,0.000045280696,0.000014353081,0.9900823,0.004384067,0.0041613933,0.0011242636,0.000007723687],"about_ca_topic_score_codex":0.0035696612,"about_ca_topic_score_gemma":0.003999235,"teacher_disagreement_score":0.0035696612,"about_ca_system_score_codex":0.0011015208,"about_ca_system_score_gemma":0.0008203627,"threshold_uncertainty_score":0.007992148},"labels":[],"label_agreement":null},{"id":"W4404562827","doi":"10.1109/ojvt.2024.3502803","title":"Enhancing Information Freshness and Energy Efficiency in D2D Networks Through DRL-Based Scheduling and Resource Management","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of Vehicular Technology","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Computer science; Scheduling (production processes); Efficient energy use; Operations management; Engineering; Electrical engineering","score_opus":0.007589536680285987,"score_gpt":0.22993721548747464,"score_spread":0.22234767880718867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404562827","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.03886236,0.0005633816,0.9564449,0.00035212006,0.00007324817,0.000040264462,0.0000441621,0.00023836359,0.0033812632],"genre_scores_gemma":[0.95298356,0.0002454606,0.044903576,0.00010784576,0.000037491984,0.000039342143,0.000036919915,0.000028249011,0.0016176263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968076,0.00008178826,0.000012881617,0.00008498885,0.00007535112,0.000064317246],"domain_scores_gemma":[0.9990369,0.0005532873,0.00013920701,0.00006811884,0.0001251938,0.00007726439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085940206,0.0006295423,0.00066464016,0.00034161538,0.00040927474,0.00082499377,0.0011913367,0.00062116515,0.0009904584],"category_scores_gemma":[0.0025275094,0.0002666446,0.00022663482,0.0004557245,0.0007351709,0.0013872095,0.0009946896,0.00077799556,0.00019222237],"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.00007887897,0.00009164346,0.00094131037,0.000071114024,0.000021605974,0.000066754365,0.00005353735,0.9342898,0.005401839,0.007865846,0.0010451197,0.050072577],"study_design_scores_gemma":[0.0000037133198,0.000013182602,0.00005608863,0.0000019742631,0.0000029000753,0.000008436607,0.0000061298647,0.99806184,0.00045844266,0.0011789803,0.00020588792,0.0000024577366],"about_ca_topic_score_codex":0.0040355683,"about_ca_topic_score_gemma":0.004671557,"teacher_disagreement_score":0.0040355683,"about_ca_system_score_codex":0.0011007814,"about_ca_system_score_gemma":0.0011056067,"threshold_uncertainty_score":0.008024156},"labels":[],"label_agreement":null},{"id":"W4404847697","doi":"10.23919/jcc.fa.2024-0216.202411","title":"Multilayer satellite network collaborative mobile edge caching: A GCN-based multi-agent approach","year":2024,"lang":"en","type":"article","venue":"China Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Satellite; Computer network; Distributed computing; Telecommunications","score_opus":0.040526564299071685,"score_gpt":0.29401101569440385,"score_spread":0.25348445139533216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404847697","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.072468,0.0011861272,0.91481555,0.0006622247,0.00014875423,0.0000744903,0.000120346005,0.00036199283,0.010162478],"genre_scores_gemma":[0.95411015,0.00034430294,0.040938303,0.00015648305,0.000050716342,0.000070347494,0.000080303435,0.00003067079,0.004218687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.000069750415,0.000011724046,0.00006929631,0.000058030244,0.00006958664],"domain_scores_gemma":[0.9995192,0.00020477333,0.00007484667,0.0000252839,0.00011802286,0.00005781877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004775051,0.000758399,0.0009958897,0.00039498584,0.0005462364,0.0009199603,0.0016646761,0.0011903504,0.0017035056],"category_scores_gemma":[0.0011692775,0.00034889203,0.0005687488,0.000568616,0.0006343389,0.00087492773,0.0009209464,0.00079172873,0.00017520247],"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.0000327395,0.000016881144,0.00048617955,0.000024559626,0.00002581297,0.000087419394,0.00002683282,0.98698854,0.00052971876,0.004820767,0.0005189093,0.006441708],"study_design_scores_gemma":[0.0000026613704,0.0000056349277,0.000027184426,0.0000013319175,0.0000045221555,0.000004953948,0.00000347332,0.99920756,0.000040615923,0.0006010116,0.000099484205,0.0000014721472],"about_ca_topic_score_codex":0.028238468,"about_ca_topic_score_gemma":0.023855673,"teacher_disagreement_score":0.028238468,"about_ca_system_score_codex":0.0015007171,"about_ca_system_score_gemma":0.0011471611,"threshold_uncertainty_score":0.05614823},"labels":[],"label_agreement":null},{"id":"W4405056259","doi":"10.1109/tcomm.2024.3511940","title":"Online Digital Twin-Empowered Content Resale Mechanism in Age of Information-Aware Edge Caching Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Mechanism (biology); Computer network; Telecommunications","score_opus":0.04553048250129581,"score_gpt":0.2670242672641039,"score_spread":0.22149378476280807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056259","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.11663471,0.00068547664,0.8776814,0.00036291807,0.0001109601,0.00013726408,0.00015646896,0.000782843,0.003448146],"genre_scores_gemma":[0.90577,0.00017771445,0.09209299,0.00010593502,0.000044494926,0.000052198142,0.00009637669,0.000032547716,0.0016277051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.00018237058,0.000045403856,0.00020228287,0.0001401643,0.00017455111],"domain_scores_gemma":[0.99801564,0.0007296587,0.00026610697,0.0003942145,0.00035291677,0.00024149338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501778,0.00058959104,0.0012816034,0.0005161077,0.00081907545,0.0011286003,0.0021227964,0.00091677177,0.0010723145],"category_scores_gemma":[0.0038094495,0.00029061156,0.000403227,0.00085331313,0.0005647011,0.0023478186,0.0015202014,0.0008639881,0.00020877976],"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.0006470997,0.00036434905,0.005686958,0.000229283,0.00009803324,0.0006058656,0.00039229324,0.7119948,0.017016105,0.04839909,0.007100093,0.20746593],"study_design_scores_gemma":[0.000008938302,0.000037725695,0.00016001258,0.0000029982937,0.000012654699,0.00009548602,0.000031069652,0.9938176,0.0013478806,0.0037744446,0.00070192176,0.000009230755],"about_ca_topic_score_codex":0.004102097,"about_ca_topic_score_gemma":0.005603446,"teacher_disagreement_score":0.004102097,"about_ca_system_score_codex":0.0010997589,"about_ca_system_score_gemma":0.0014613597,"threshold_uncertainty_score":0.008156478},"labels":[],"label_agreement":null},{"id":"W4405522014","doi":"10.1109/icue63019.2024.10795637","title":"P2P Energy Sharing with Federated Learning and Blockchain","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"","keywords":"Blockchain; Computer science; Energy (signal processing); Computer security","score_opus":0.008598549629601016,"score_gpt":0.20389958339979192,"score_spread":0.1953010337701909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405522014","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.064652026,0.00026570496,0.92276686,0.000534291,0.00008061373,0.00024182307,0.00017260082,0.0012295533,0.010056609],"genre_scores_gemma":[0.95008594,0.000099595294,0.04612244,0.00006895659,0.000025151392,0.000116387964,0.00009032504,0.000032450287,0.00335877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819916,0.00064909365,0.00008652189,0.0002910561,0.0005455002,0.00022870759],"domain_scores_gemma":[0.9977379,0.0009579889,0.00018264099,0.0006950471,0.00027170693,0.00015466916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020973533,0.00055234804,0.0009525506,0.00052799226,0.001014818,0.0015095645,0.0020595393,0.0014130198,0.0035742042],"category_scores_gemma":[0.0045462153,0.00029522047,0.0004373013,0.0010429736,0.0011536084,0.003280637,0.0030267944,0.0010007556,0.0006595756],"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.0004384334,0.00025543725,0.0009961165,0.00011426421,0.00006447849,0.0004946654,0.00016300345,0.81685185,0.0043328274,0.07451186,0.0023171117,0.099459946],"study_design_scores_gemma":[0.000033869987,0.000044236513,0.00008463683,0.0000069884672,0.000006120165,0.00006747707,0.00001957015,0.950764,0.0014804015,0.04577376,0.0017076243,0.000011357723],"about_ca_topic_score_codex":0.0025312894,"about_ca_topic_score_gemma":0.0024123865,"teacher_disagreement_score":0.0035742042,"about_ca_system_score_codex":0.000811821,"about_ca_system_score_gemma":0.001868102,"threshold_uncertainty_score":0.011956871},"labels":[],"label_agreement":null},{"id":"W4405907916","doi":"10.1109/wf-iot62078.2024.10811226","title":"A Connectivity-aware Method for Infrastructure-less Vehicular Cloud Service Discovery","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Carleton University","funders":"","keywords":"Cloud computing; Computer science; Computer security; Vehicular ad hoc network; Computer network; Service (business); Wireless ad hoc network; Telecommunications; Business; Wireless; Operating system","score_opus":0.017297581708285013,"score_gpt":0.27174345936351746,"score_spread":0.25444587765523247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405907916","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.035773017,0.0003157842,0.9585702,0.00017463724,0.00006962448,0.00015032449,0.000092960254,0.0016366357,0.0032166627],"genre_scores_gemma":[0.6777845,0.00021365388,0.31725323,0.00009171628,0.00005133736,0.00013296495,0.00030148381,0.00008452219,0.004086618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946934,0.00009875838,0.000032863765,0.00010720346,0.00021228088,0.00007947501],"domain_scores_gemma":[0.99923813,0.00020687658,0.000072873314,0.00018119434,0.00023534836,0.00006551075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044307,0.00029574134,0.00052718614,0.00117235,0.0011261259,0.00096671464,0.0010153654,0.0005410033,0.0015645362],"category_scores_gemma":[0.0019273822,0.00018477348,0.00031864597,0.0011414167,0.00035857182,0.0010230396,0.0010166392,0.00038969595,0.0003647046],"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.0004230255,0.00028076945,0.005170638,0.00020326083,0.00009268892,0.00034433807,0.00045882506,0.13108177,0.051768716,0.038517736,0.009008135,0.76265],"study_design_scores_gemma":[0.000028340784,0.000118793345,0.0013611487,0.0000103799475,0.000034407723,0.00040090026,0.00016972651,0.9765053,0.009169031,0.0044102287,0.0077497396,0.000041971492],"about_ca_topic_score_codex":0.0068193087,"about_ca_topic_score_gemma":0.013059557,"teacher_disagreement_score":0.0068193087,"about_ca_system_score_codex":0.0008813353,"about_ca_system_score_gemma":0.0014589292,"threshold_uncertainty_score":0.013559222},"labels":[],"label_agreement":null},{"id":"W4406266179","doi":"10.1109/vtc2024-fall63153.2024.10757623","title":"Maximizing Efficiency: Relocation and Deduplication for Result Caching in Distributed and Collaborative Edge Computing Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Relocation; Data deduplication; Computer science; Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Distributed database; Parallel computing; Database; Operating system; Telecommunications","score_opus":0.010631140239913232,"score_gpt":0.24834577092435173,"score_spread":0.2377146306844385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406266179","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.17977598,0.00069021754,0.81513834,0.00039724275,0.00006670804,0.0001452721,0.000059830585,0.00037885344,0.0033474925],"genre_scores_gemma":[0.87139434,0.00022787967,0.12694791,0.000076997574,0.000018931865,0.000058441303,0.000054284763,0.000034842687,0.0011864331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999483,0.00017663409,0.000028857417,0.000096120595,0.0001236548,0.000091673624],"domain_scores_gemma":[0.99881303,0.00062193815,0.00014490113,0.0001511575,0.00019899961,0.000069988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012963543,0.00054469507,0.00067288487,0.00057590567,0.0006027464,0.001029566,0.0014961404,0.00070489116,0.00049756834],"category_scores_gemma":[0.0034439005,0.00021721197,0.0003455593,0.00065650954,0.00054347847,0.0011628008,0.00083380967,0.0005253226,0.00008944618],"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.00017926499,0.00018043337,0.0021674659,0.00010018073,0.00004916416,0.0001532937,0.00015279862,0.8907364,0.010367629,0.014871289,0.0012591516,0.079782896],"study_design_scores_gemma":[0.000015568725,0.00005784207,0.00023183961,0.0000057085185,0.000014554682,0.000060085807,0.000049124814,0.99177355,0.00302765,0.004157074,0.0006001689,0.000006770453],"about_ca_topic_score_codex":0.0030487347,"about_ca_topic_score_gemma":0.0047913115,"teacher_disagreement_score":0.0030487347,"about_ca_system_score_codex":0.0009491615,"about_ca_system_score_gemma":0.0012952664,"threshold_uncertainty_score":0.006886661},"labels":[],"label_agreement":null},{"id":"W4406873089","doi":"10.1016/j.jnca.2025.104106","title":"A survey on the state-of-the-art CDN architectures and future directions","year":2025,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Korea Research Council of Fundamental Science and Technology; China Scholarship Council; Carleton University","keywords":"Computer science; State (computer science); Telecommunications; Computer network; Algorithm","score_opus":0.009652477367472186,"score_gpt":0.2251843150163875,"score_spread":0.21553183764891531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406873089","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013159674,0.9073905,0.041201938,0.0028482517,0.0011953241,0.00011838021,0.0005292412,0.0005013485,0.033055477],"genre_scores_gemma":[0.054514933,0.8998226,0.03354207,0.0012320174,0.0017720193,0.000085149855,0.0010889056,0.00011508783,0.007827226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986357,0.00021259632,0.00015282656,0.00023952549,0.0005651729,0.00019418112],"domain_scores_gemma":[0.99666554,0.0018288525,0.00021149528,0.0002141059,0.00089922745,0.00018068633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021310193,0.0011197723,0.0012581263,0.0029318836,0.0008863794,0.0041527404,0.0020684593,0.0014346658,0.011407897],"category_scores_gemma":[0.0044880416,0.0006882613,0.0004606878,0.005788451,0.0006275283,0.0070884773,0.0013440652,0.0015289314,0.002818135],"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.00028708202,0.00017975569,0.0020125993,0.0054507386,0.00004571021,0.000090784844,0.0001338047,0.008339045,0.00477684,0.035040572,0.03243941,0.9112036],"study_design_scores_gemma":[0.00003641335,0.00052648404,0.00206746,0.0039270986,0.0002037383,0.0013058422,0.00047226413,0.043805692,0.007958369,0.031925764,0.907634,0.0001367692],"about_ca_topic_score_codex":0.0035867658,"about_ca_topic_score_gemma":0.0043114894,"teacher_disagreement_score":0.011407897,"about_ca_system_score_codex":0.0018926637,"about_ca_system_score_gemma":0.0025704193,"threshold_uncertainty_score":0.038163185},"labels":[],"label_agreement":null},{"id":"W4406949338","doi":"10.1109/tcomm.2025.3535878","title":"Personalized Federated Learning for Cellular VR: Online Learning and Dynamic Caching","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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":"Queen's University","funders":"King Abdullah University of Science and Technology","keywords":"Computer science; Human–computer interaction; Online learning; Multimedia","score_opus":0.02282307567392406,"score_gpt":0.2909144032025605,"score_spread":0.26809132752863646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949338","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.027839564,0.0005511708,0.9684284,0.00019992965,0.000044812878,0.00003930546,0.00005542768,0.0007344806,0.002106953],"genre_scores_gemma":[0.86068535,0.00046014076,0.135825,0.00014033058,0.000053442123,0.00007054865,0.00014384926,0.00006937215,0.00255188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.00021100252,0.00004021972,0.00017950794,0.0001715219,0.0001272312],"domain_scores_gemma":[0.9979481,0.0008118774,0.00015011479,0.00058654783,0.0003971545,0.00010624194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008701975,0.0006257897,0.00093370385,0.00038799562,0.00060871174,0.0014892302,0.0020711736,0.0011864918,0.0016097358],"category_scores_gemma":[0.004230605,0.00025715816,0.00044069364,0.0008915735,0.0005747147,0.0020883835,0.0012765646,0.0009685055,0.00041752247],"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.00037337316,0.00025556385,0.0017076436,0.00013385608,0.00006995792,0.00022309912,0.00016574831,0.67122984,0.009865723,0.048871044,0.0050848583,0.26201925],"study_design_scores_gemma":[0.0000068305294,0.000028470206,0.000119347096,0.000004862727,0.000006709066,0.00004241939,0.000014827575,0.9907651,0.0012314123,0.007098507,0.0006753647,0.0000061732235],"about_ca_topic_score_codex":0.006245981,"about_ca_topic_score_gemma":0.00748499,"teacher_disagreement_score":0.006245981,"about_ca_system_score_codex":0.0014558155,"about_ca_system_score_gemma":0.0011294655,"threshold_uncertainty_score":0.012419224},"labels":[],"label_agreement":null},{"id":"W4407084552","doi":"10.22541/au.173858963.32270698/v1","title":"Intelligent Information Retrieval Using a Mobile Agents: A Proximal Policy Optimization Approach in Dynamic Networks","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Caching and Content Delivery","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":"SAIT Polytechnic","funders":"","keywords":"Computer science; Mobile agent; Distributed computing; Information retrieval; Artificial intelligence","score_opus":0.021196955581238394,"score_gpt":0.27681707009269857,"score_spread":0.25562011451146016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407084552","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.011250891,0.0004049774,0.98607475,0.00036469699,0.000037070306,0.000033623168,0.000015177855,0.00013841802,0.0016804035],"genre_scores_gemma":[0.7642984,0.0009387895,0.22820498,0.00031686382,0.0001365424,0.00021373709,0.000071654846,0.00009068652,0.0057282695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948823,0.00020650214,0.00002445805,0.00010792767,0.00010872531,0.000064126034],"domain_scores_gemma":[0.99861467,0.0009512802,0.00012312652,0.00007574032,0.0001648833,0.00007036947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012246601,0.0006617561,0.0012218452,0.0006157881,0.0005858765,0.0011800325,0.0012717363,0.0013717813,0.0012920838],"category_scores_gemma":[0.0038028718,0.0005070686,0.000549879,0.00076275674,0.00121442,0.0015029116,0.0014153712,0.0012991064,0.00029134616],"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.000040097315,0.000033749453,0.00021286822,0.000044964716,0.000030512545,0.000040466297,0.000047920777,0.96402544,0.0007909874,0.014975952,0.0005789841,0.019178115],"study_design_scores_gemma":[0.000005553501,0.000012938137,0.00001875265,0.0000022355853,0.0000037410348,0.0000053867616,0.0000051554744,0.9955096,0.00014712127,0.0040240833,0.00026296603,0.0000025135769],"about_ca_topic_score_codex":0.005413022,"about_ca_topic_score_gemma":0.0029776192,"teacher_disagreement_score":0.005413022,"about_ca_system_score_codex":0.0011369474,"about_ca_system_score_gemma":0.0015297009,"threshold_uncertainty_score":0.010763049},"labels":[],"label_agreement":null},{"id":"W4408047577","doi":"10.1109/access.2025.3546620","title":"Energy Routing Protocols for Energy Internet: A Review on Multi-Agent Systems, Metaheuristics, and Artificial Intelligence Approaches","year":2025,"lang":"en","type":"review","venue":"IEEE Access","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Conseil National de la Recherche Scientifique; Saint Joseph University; Centre National de la Recherche Scientifique; Agence Universitaire de la Francophonie","keywords":"Computer science; Metaheuristic; Swarm intelligence; The Internet; Energy (signal processing); Routing (electronic design automation); Multi-agent system; Artificial intelligence; Distributed computing; Computer network; Machine learning; Particle swarm optimization; World Wide Web","score_opus":0.36245574176540774,"score_gpt":0.4078156944115184,"score_spread":0.045359952646110646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408047577","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020396309,0.98980755,0.004810914,0.00081525894,0.0005445265,0.000026754213,0.00003451571,0.000031507876,0.0037250156],"genre_scores_gemma":[0.0018936651,0.99225897,0.0039910693,0.00033719023,0.0004247377,0.00003172826,0.00006156622,0.000013612178,0.0009874153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999382,0.00013108694,0.00008361192,0.0000867768,0.0002770903,0.00003932814],"domain_scores_gemma":[0.9983077,0.0010790357,0.00011553763,0.000066460656,0.00039214425,0.000039065995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014295445,0.0013023478,0.0014094796,0.0027266613,0.00046100936,0.0017319468,0.0015650995,0.001695122,0.0036341818],"category_scores_gemma":[0.002578968,0.00056125695,0.0008280559,0.0047114836,0.0007259066,0.0032262234,0.0008138221,0.0022846926,0.002287159],"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.000035120538,0.00009799578,0.0002529559,0.016133847,0.0001091809,0.00014851308,0.00014397592,0.0044744834,0.0012197882,0.051359903,0.040207762,0.8858165],"study_design_scores_gemma":[0.000010352134,0.00008938445,0.0002546938,0.0052245273,0.00012961095,0.00048537526,0.00008895772,0.0018510761,0.00065119273,0.013681223,0.9774924,0.000041155272],"about_ca_topic_score_codex":0.0017226074,"about_ca_topic_score_gemma":0.0016620591,"teacher_disagreement_score":0.0036341818,"about_ca_system_score_codex":0.0009896066,"about_ca_system_score_gemma":0.0021913864,"threshold_uncertainty_score":0.012157559},"labels":[],"label_agreement":null},{"id":"W4408324406","doi":"10.1109/globecom52923.2024.10901190","title":"QoE-oriented Soft Caching with Content Recommendation for Edge Computing Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 British Columbia","funders":"HORIZON EUROPE Framework Programme; National Science Foundation","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Content (measure theory); Computer network; Edge device; Cloud computing; Operating system; Artificial intelligence","score_opus":0.03378270130568795,"score_gpt":0.24950810137399812,"score_spread":0.21572540006831017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324406","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.14071706,0.0010597579,0.85020345,0.00083946955,0.000105781764,0.00016287056,0.00018610214,0.0017543333,0.004971186],"genre_scores_gemma":[0.9229733,0.00021227013,0.07409574,0.0002298337,0.000047572154,0.000049666032,0.00014146432,0.000048648813,0.0022014831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960524,0.00009979419,0.000018848,0.00009677792,0.000075415446,0.000103977276],"domain_scores_gemma":[0.99856025,0.00067828206,0.00011704226,0.00018001081,0.00036082233,0.00010363221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044598,0.00060648425,0.00097419973,0.0005628781,0.00063563633,0.00085902953,0.0020817441,0.0011155003,0.0015873875],"category_scores_gemma":[0.004011465,0.0002690689,0.0003697648,0.0008623929,0.0005846967,0.0017460438,0.00081792224,0.000984543,0.0003108564],"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.0003740877,0.00040651258,0.00555328,0.00011278907,0.000074697826,0.0001618644,0.00009742565,0.77288646,0.006598178,0.008387006,0.0062139365,0.19913384],"study_design_scores_gemma":[0.000009280926,0.000019742534,0.00015726114,0.0000025870897,0.000005991519,0.000015554044,0.0000060163115,0.99725914,0.0004793611,0.0018693338,0.00017241412,0.000003308055],"about_ca_topic_score_codex":0.022601128,"about_ca_topic_score_gemma":0.034983598,"teacher_disagreement_score":0.022601128,"about_ca_system_score_codex":0.0015495429,"about_ca_system_score_gemma":0.0015652387,"threshold_uncertainty_score":0.04493916},"labels":[],"label_agreement":null},{"id":"W4408325194","doi":"10.1109/globecom52923.2024.10901700","title":"Federated Deep Reinforcement Learning Enhanced Dynamic Vehicular Edge Caching Management","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Memorial University of Newfoundland","funders":"National Science and Technology Council","keywords":"Reinforcement learning; Computer science; Enhanced Data Rates for GSM Evolution; Edge device; Distributed computing; Computer network; Artificial intelligence; Operating system; Cloud computing","score_opus":0.007096136443016413,"score_gpt":0.22398312051373134,"score_spread":0.21688698407071494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408325194","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.06919034,0.0004782889,0.9261105,0.00040049956,0.00010156463,0.000055127544,0.000082194805,0.00075516495,0.0028262378],"genre_scores_gemma":[0.9617573,0.000089578105,0.035699397,0.00020368108,0.00002631555,0.000050896382,0.000109279215,0.00003159499,0.002031912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996437,0.00009859002,0.000015587386,0.000083400206,0.00006275159,0.00009592231],"domain_scores_gemma":[0.9989221,0.0005459963,0.00010392752,0.00008409793,0.00025215175,0.00009175683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092225353,0.00071562344,0.0009581307,0.000311556,0.0003339435,0.0007143452,0.001618891,0.0010552618,0.0011721088],"category_scores_gemma":[0.0029533445,0.00029592268,0.00032388422,0.00032921266,0.00067678484,0.0008507177,0.00087331067,0.0010173707,0.00024009122],"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.00008034375,0.000067120054,0.001222112,0.000031687672,0.000024851763,0.00005659837,0.00002862964,0.96540225,0.00082833605,0.0025981078,0.0008276013,0.028832283],"study_design_scores_gemma":[0.000003969323,0.000014931048,0.000038840226,0.0000016367308,0.000002462107,0.0000052136074,0.0000033408573,0.9991264,0.00013922398,0.0005749226,0.00008769173,0.0000014570537],"about_ca_topic_score_codex":0.009440382,"about_ca_topic_score_gemma":0.009049134,"teacher_disagreement_score":0.009440382,"about_ca_system_score_codex":0.0009894883,"about_ca_system_score_gemma":0.0015195617,"threshold_uncertainty_score":0.018770874},"labels":[],"label_agreement":null},{"id":"W4408441590","doi":"10.1109/jiot.2025.3551237","title":"QoE-Aware Volumetric Video Caching and Rendering for Mobile Extended Reality Services","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rendering (computer graphics); Mobile telephony; Virtual reality; Augmented reality; Mobile computing; Multimedia; Computer graphics (images); Computer network; Mobile radio; Human–computer interaction","score_opus":0.014753995684062122,"score_gpt":0.272279712687759,"score_spread":0.2575257170036969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408441590","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.02170197,0.0007570265,0.9739896,0.00016988702,0.00004810868,0.00006704072,0.000045975634,0.00077247515,0.0024478617],"genre_scores_gemma":[0.79065245,0.00081788667,0.20531023,0.00016189207,0.000102280545,0.000063178806,0.00012439727,0.00015191144,0.0026158474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918026,0.00024112102,0.000033496246,0.00011219843,0.00030845994,0.00012439338],"domain_scores_gemma":[0.99908507,0.00032673802,0.00008603701,0.00015664852,0.00027840686,0.00006708038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067714386,0.00096743985,0.0009806709,0.00045567108,0.0004250258,0.0011071971,0.0017226614,0.0007148434,0.0014177124],"category_scores_gemma":[0.0023522638,0.0003162225,0.0005786036,0.000666324,0.000431513,0.0014450592,0.0010225889,0.0009443343,0.0004006434],"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.0006834809,0.00041621792,0.0027512999,0.00028463177,0.00017998875,0.00066511135,0.0003779918,0.5173449,0.111920714,0.024336405,0.007013119,0.33402613],"study_design_scores_gemma":[0.000013245639,0.000067344896,0.00025196662,0.0000075651824,0.000022019727,0.00016431767,0.000029580973,0.9912664,0.0050086943,0.0016522065,0.0014962443,0.000020480413],"about_ca_topic_score_codex":0.0057295808,"about_ca_topic_score_gemma":0.0069178184,"teacher_disagreement_score":0.0057295808,"about_ca_system_score_codex":0.0007670705,"about_ca_system_score_gemma":0.0008901588,"threshold_uncertainty_score":0.011392474},"labels":[],"label_agreement":null},{"id":"W4408848453","doi":"10.1145/3712676.3719268","title":"A Multi-CDN Playground for Dash.js: Enabling Integration of CDN Switching Strategies","year":2025,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Dash; Computer science; Computer network; Operating system","score_opus":0.03863317991281951,"score_gpt":0.3024586648249197,"score_spread":0.26382548491210017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408848453","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.07633756,0.0011180949,0.82642436,0.0009265708,0.0007254405,0.00068509544,0.00088370347,0.049708594,0.04319051],"genre_scores_gemma":[0.43761742,0.000797142,0.5113626,0.0014683037,0.00024816042,0.0004686129,0.0025741386,0.003221952,0.04224158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.00012766926,0.000050596485,0.0001766444,0.0003172209,0.00009728251],"domain_scores_gemma":[0.99915016,0.00016385081,0.000044815428,0.00019940251,0.0003045938,0.00013720558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014904446,0.0011374771,0.00057628757,0.00094087975,0.00079443323,0.0020962898,0.0025158753,0.0010157761,0.00989611],"category_scores_gemma":[0.0021258714,0.00042330835,0.00041659872,0.0005588415,0.0006685816,0.0028364516,0.002818336,0.0017316896,0.0026540323],"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.0017186278,0.0012267389,0.003982198,0.0004400629,0.0001428036,0.0011151752,0.001169914,0.021544568,0.16024473,0.029028239,0.06167768,0.71770924],"study_design_scores_gemma":[0.0005127148,0.00088384113,0.0020284143,0.00016501108,0.000112035435,0.0009105711,0.0006761868,0.65378255,0.12414138,0.018894339,0.19762535,0.00026758478],"about_ca_topic_score_codex":0.004072162,"about_ca_topic_score_gemma":0.006555806,"teacher_disagreement_score":0.00989611,"about_ca_system_score_codex":0.0008637539,"about_ca_system_score_gemma":0.0008833879,"threshold_uncertainty_score":0.03310573},"labels":[],"label_agreement":null},{"id":"W4408860680","doi":"10.1109/jiot.2025.3554775","title":"Transcoding-Enabled Edge Caching Strategy Optimization: A Dual-Timescale Meta-Learning-Based Stackelberg Game Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","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":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Stackelberg competition; Transcoding; Dual (grammatical number); Enhanced Data Rates for GSM Evolution; Game theory; Distributed computing; Computer network; Artificial intelligence","score_opus":0.026136195302137736,"score_gpt":0.24696439424876263,"score_spread":0.2208281989466249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408860680","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.035702225,0.0005050883,0.9566552,0.0005388335,0.00007472824,0.00008800605,0.00007979298,0.0001535286,0.0062024985],"genre_scores_gemma":[0.9513034,0.00037396647,0.043972004,0.00025654587,0.00004906285,0.00019133794,0.000069097194,0.000040779127,0.003743667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933076,0.00022747445,0.000027250491,0.00012311967,0.00011604427,0.00017532575],"domain_scores_gemma":[0.9983386,0.0010798803,0.0001688158,0.000047288002,0.0002340648,0.00013143376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015238145,0.0015228776,0.001937979,0.0006408851,0.00046539446,0.0016070235,0.0019551793,0.0019549169,0.0026547823],"category_scores_gemma":[0.0035597305,0.0006165225,0.0009443757,0.0005355166,0.0011017412,0.0013104866,0.0014129955,0.0018793707,0.00027422083],"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.00004028962,0.00004018003,0.0003620948,0.000038655282,0.000035270292,0.00007749891,0.000033198274,0.9835398,0.0005493447,0.009516621,0.0004257561,0.005341177],"study_design_scores_gemma":[0.0000054075686,0.00001607631,0.000024218012,0.0000028927325,0.000005966705,0.000005891952,0.0000054437114,0.99780744,0.00005707722,0.0019880664,0.000079279096,0.0000023812654],"about_ca_topic_score_codex":0.0070947255,"about_ca_topic_score_gemma":0.0047007455,"teacher_disagreement_score":0.0070947255,"about_ca_system_score_codex":0.0016228666,"about_ca_system_score_gemma":0.0019212672,"threshold_uncertainty_score":0.01410681},"labels":[],"label_agreement":null},{"id":"W4409019497","doi":"10.1109/mie.2025.3552885","title":"Graph/Game Theory-Based Energy Routing Methods in the Energy Internet: A Review","year":2025,"lang":"en","type":"review","venue":"IEEE Industrial Electronics Magazine","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; The Internet; Graph theory; Computer network; Theoretical computer science; World Wide Web; Mathematics; Combinatorics","score_opus":0.06385186309875512,"score_gpt":0.3481695211510874,"score_spread":0.2843176580523323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409019497","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003003779,0.98391324,0.010524219,0.00053079723,0.00033092464,0.000027204183,0.000024701447,0.000049726237,0.0042989226],"genre_scores_gemma":[0.0024784831,0.9882754,0.007556874,0.00017076175,0.00034105722,0.000028560511,0.000044982193,0.0000160758,0.0010878511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994392,0.00013348818,0.000059185044,0.000100928926,0.00023477423,0.000032365813],"domain_scores_gemma":[0.99840575,0.0010618808,0.000086224696,0.000053365628,0.00035114025,0.000041692674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015208075,0.0014618621,0.0018862707,0.0032970496,0.0004606151,0.001811103,0.0022175277,0.0017759334,0.0035331708],"category_scores_gemma":[0.0025208031,0.0008009818,0.000894614,0.006276359,0.0011231069,0.0037985565,0.0007181841,0.0017657208,0.002887823],"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.000033088712,0.00017018798,0.00028885668,0.010981919,0.00008467365,0.0001327776,0.0000973383,0.006968583,0.00056160486,0.038713012,0.022686062,0.9192818],"study_design_scores_gemma":[0.000030803894,0.0001835968,0.0009272969,0.0067077167,0.00017866369,0.0011735347,0.00021487662,0.01205236,0.0011764083,0.039314788,0.937932,0.000108005544],"about_ca_topic_score_codex":0.0031101804,"about_ca_topic_score_gemma":0.0027961151,"teacher_disagreement_score":0.0035331708,"about_ca_system_score_codex":0.0013274123,"about_ca_system_score_gemma":0.0017552135,"threshold_uncertainty_score":0.011819661},"labels":[],"label_agreement":null},{"id":"W4409102440","doi":"10.1109/tvt.2025.3552084","title":"Attention-Enhanced Prioritized Proximal Policy Optimization for Adaptive Edge Caching","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Caching and Content Delivery","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":"York University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Computer network; Optimization problem; Distributed computing; Mathematical optimization; Telecommunications; Algorithm; Mathematics","score_opus":0.009605485166038047,"score_gpt":0.24987896853383026,"score_spread":0.24027348336779222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409102440","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.029066695,0.00062984123,0.96714103,0.0003664041,0.00007984473,0.00004617424,0.000048573973,0.00041627223,0.0022052051],"genre_scores_gemma":[0.9347076,0.00034031426,0.061317194,0.0002984772,0.000069707356,0.00010628494,0.00008674318,0.00007521114,0.0029983236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993789,0.00020855415,0.000030708128,0.00011924437,0.000110767876,0.0001517368],"domain_scores_gemma":[0.99713707,0.002166255,0.00017644215,0.00007492693,0.00029832215,0.00014703443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570017,0.0008802556,0.0016439572,0.0006118235,0.00039053126,0.00084562774,0.0013106912,0.0012641059,0.0022578181],"category_scores_gemma":[0.004555128,0.0005551655,0.00057831104,0.0006047287,0.00086287456,0.0009806541,0.0011181585,0.0016366022,0.0002667351],"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.00009847924,0.0000639298,0.00042500472,0.00005971832,0.000035094574,0.00005650993,0.000044055832,0.9747556,0.0006677845,0.005912563,0.0008070686,0.017074151],"study_design_scores_gemma":[0.00000584291,0.000013163697,0.00002552027,0.0000021740173,0.0000038191956,0.0000041437374,0.0000025259912,0.9985353,0.00006766247,0.0012685145,0.00006955167,0.0000017121437],"about_ca_topic_score_codex":0.010233908,"about_ca_topic_score_gemma":0.006710458,"teacher_disagreement_score":0.010233908,"about_ca_system_score_codex":0.0013217895,"about_ca_system_score_gemma":0.0020986153,"threshold_uncertainty_score":0.020348668},"labels":[],"label_agreement":null},{"id":"W4409216846","doi":"10.32628/cseit25112783","title":"Optimizing Continuous Delivery Pipelines for Faster Time-to-Market","year":2025,"lang":"en","type":"article","venue":"International Journal of Scientific Research in Computer Science Engineering and Information Technology","topic":"Caching and Content Delivery","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":"Object Research Systems (Canada)","funders":"","keywords":"Pipeline transport; Computer science; Environmental science; Environmental engineering","score_opus":0.014349119165143044,"score_gpt":0.28273871558409713,"score_spread":0.2683895964189541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409216846","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.13329504,0.0014775812,0.8313853,0.0023791615,0.00018695038,0.00090216147,0.00041043758,0.01712623,0.0128371725],"genre_scores_gemma":[0.6058626,0.0010384344,0.37867695,0.00041530284,0.0001227331,0.0005635085,0.0010957175,0.004042852,0.008181942],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946149,0.0013772815,0.00045759213,0.0008314419,0.0019215493,0.00079732604],"domain_scores_gemma":[0.9802663,0.005892741,0.0034352294,0.003969837,0.004894184,0.0015416559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00971126,0.0012785571,0.00092660374,0.0036948256,0.0013997796,0.0042843474,0.002176552,0.001064165,0.0083872555],"category_scores_gemma":[0.032007396,0.0013378991,0.0005958354,0.0025634165,0.0009807798,0.0089079775,0.002761051,0.0020578376,0.004080236],"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.0018309193,0.0013086856,0.0138922455,0.00057666,0.00011074385,0.00049345894,0.0017687494,0.13422097,0.12613334,0.055226095,0.023262769,0.6411754],"study_design_scores_gemma":[0.00096593244,0.0024955194,0.017124968,0.00027214654,0.00026729514,0.0009355123,0.0014543753,0.6644309,0.10748257,0.09218266,0.112050265,0.00033778895],"about_ca_topic_score_codex":0.00430505,"about_ca_topic_score_gemma":0.0028863556,"teacher_disagreement_score":0.00971126,"about_ca_system_score_codex":0.0027615763,"about_ca_system_score_gemma":0.004874888,"threshold_uncertainty_score":0.0513587},"labels":[],"label_agreement":null},{"id":"W4409426900","doi":"10.1109/icicml63543.2024.10958084","title":"Adaptive Cache Management for Complex Storage Systems Using CNN-LSTM-Based Spatiotemporal Prediction","year":2024,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Cache; Storage management; Artificial intelligence; Data mining; Parallel computing; Database","score_opus":0.08989878617688772,"score_gpt":0.2719589862420218,"score_spread":0.18206020006513407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409426900","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.3004929,0.0031199502,0.6824936,0.0008253885,0.00030172674,0.00007686415,0.00055766775,0.005343865,0.006788059],"genre_scores_gemma":[0.9644041,0.0003965241,0.032861717,0.00013291484,0.000033775916,0.0000352191,0.000294173,0.000046153084,0.0017952826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998989,0.000010101383,0.000007907478,0.000030909523,0.000026001857,0.00002619025],"domain_scores_gemma":[0.9998036,0.00004344263,0.000027859285,0.000022664239,0.000088837216,0.000013666884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021810144,0.00066110684,0.0004829335,0.000340938,0.0002674094,0.00046086393,0.00097479956,0.0004176427,0.0009827174],"category_scores_gemma":[0.0007865885,0.00020010845,0.00033079166,0.00055734994,0.0002288562,0.0011940825,0.00035417796,0.0004374174,0.00021934017],"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.00021368415,0.00015783001,0.0069227493,0.00016340945,0.00012174659,0.00015226904,0.00008248022,0.7446666,0.028872602,0.0028192017,0.005577121,0.2102504],"study_design_scores_gemma":[0.0000021526628,0.000014724198,0.00019774037,0.000002345123,0.0000091900865,0.000009325867,0.0000042872584,0.99754095,0.0016970236,0.00032671657,0.0001925256,0.0000030225335],"about_ca_topic_score_codex":0.021466712,"about_ca_topic_score_gemma":0.026467817,"teacher_disagreement_score":0.021466712,"about_ca_system_score_codex":0.00096263614,"about_ca_system_score_gemma":0.0010123372,"threshold_uncertainty_score":0.042683482},"labels":[],"label_agreement":null},{"id":"W4409959019","doi":"10.2139/ssrn.5234624","title":"Adaptive Priority-Based Edge-Centric Resource Management for the Internet of Vehicles","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; The Internet; Resource (disambiguation); Business; Computer science; Adaptive management; Computer network; Telecommunications; Environmental resource management; World Wide Web; Environmental science","score_opus":0.01400075128021893,"score_gpt":0.23718255404060362,"score_spread":0.22318180276038468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409959019","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.123955004,0.0014073675,0.86752516,0.0006299668,0.0002486365,0.00016950992,0.0001796395,0.0009424239,0.004942391],"genre_scores_gemma":[0.9722693,0.00022391457,0.025708327,0.00006361651,0.000054100274,0.000023779172,0.000073870746,0.00004284298,0.0015402865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929404,0.00015258759,0.00004016987,0.00015322366,0.00016431713,0.00019566585],"domain_scores_gemma":[0.9981433,0.0007135615,0.00018140797,0.00015508599,0.00061662326,0.00018993035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012696311,0.00049981155,0.0010490188,0.00087860355,0.00084009167,0.0016340199,0.0019363464,0.000708337,0.0013353041],"category_scores_gemma":[0.0036597,0.00036272922,0.00023135905,0.0010598777,0.000526151,0.0012064575,0.00083938916,0.0007677284,0.00024357888],"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.00068487827,0.00025664523,0.002103964,0.0001581462,0.00007957568,0.0001735211,0.00020621867,0.80446786,0.015485661,0.027714675,0.008145489,0.14052334],"study_design_scores_gemma":[0.000011556509,0.00003967301,0.00022081261,0.000003094516,0.000011019918,0.000024695371,0.000026671574,0.9939546,0.0007143615,0.004544683,0.00044103852,0.0000078165285],"about_ca_topic_score_codex":0.01118537,"about_ca_topic_score_gemma":0.010400478,"teacher_disagreement_score":0.01118537,"about_ca_system_score_codex":0.0016390667,"about_ca_system_score_gemma":0.001351214,"threshold_uncertainty_score":0.02224052},"labels":[],"label_agreement":null},{"id":"W4410086935","doi":"10.1109/ccnc54725.2025.10976083","title":"Optimization of Decentralized Caching with Improved Coded Delivery Under Heterogeneous File Popularity","year":2025,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Lakehead University","funders":"","keywords":"Computer science; Popularity; Distributed computing; Computer network","score_opus":0.009118271147179152,"score_gpt":0.21691982940594523,"score_spread":0.2078015582587661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410086935","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.07715502,0.0001651276,0.9198251,0.00019238745,0.00002326995,0.00005299159,0.000056130153,0.00014977265,0.002380183],"genre_scores_gemma":[0.9344894,0.00013994523,0.063604474,0.00004642113,0.000022933733,0.00006504776,0.00005147144,0.00003316635,0.0015470361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.0002384397,0.000021169288,0.00013312338,0.00018404082,0.00011595736],"domain_scores_gemma":[0.998033,0.0010452654,0.000278579,0.00016314742,0.00038349794,0.00009660746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009531489,0.0005910027,0.0008787513,0.00027859377,0.00036912624,0.0007368167,0.0010930133,0.00064796,0.00072614907],"category_scores_gemma":[0.003912669,0.00030735898,0.00027170609,0.0005663,0.0007023662,0.0012494809,0.00082068134,0.0005589009,0.00010184938],"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.00005660549,0.00002889695,0.0004028482,0.00003783696,0.000012688874,0.00006914013,0.000027432628,0.96944696,0.0052142176,0.012211928,0.0005459049,0.011945501],"study_design_scores_gemma":[0.0000053624462,0.00001642974,0.000059513284,0.0000012637469,0.0000026534822,0.000012749402,0.000006975364,0.997869,0.0005268913,0.0013798367,0.00011609919,0.0000031640639],"about_ca_topic_score_codex":0.0045787864,"about_ca_topic_score_gemma":0.0044818018,"teacher_disagreement_score":0.0045787864,"about_ca_system_score_codex":0.0014174883,"about_ca_system_score_gemma":0.0016198994,"threshold_uncertainty_score":0.010284662},"labels":[],"label_agreement":null},{"id":"W4410124353","doi":"10.1016/j.aej.2025.04.057","title":"Multi-rate selection and power allocation assisted probabilistic edge caching for cooperative video transmission in dense D2D networks","year":2025,"lang":"en","type":"article","venue":"Alexandria Engineering Journal","topic":"Caching and Content Delivery","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":"Memorial University of Newfoundland","funders":"National Foundation for Science and Technology Development","keywords":"Selection (genetic algorithm); Probabilistic logic; Enhanced Data Rates for GSM Evolution; Computer science; Transmission (telecommunications); Power (physics); Computer network; Real-time computing; Mathematical optimization; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.01072614080689819,"score_gpt":0.22937414713410706,"score_spread":0.21864800632720888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410124353","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.067522645,0.0004908767,0.9271904,0.00017867578,0.000030082745,0.00004764821,0.000056422155,0.0000958776,0.0043873996],"genre_scores_gemma":[0.9708954,0.000298502,0.026672302,0.000049414986,0.000014198708,0.00005140806,0.000029972074,0.000015822998,0.0019729007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996284,0.00013260754,0.000010056287,0.00006200171,0.00008864411,0.00007831676],"domain_scores_gemma":[0.9994498,0.0003410262,0.000075118405,0.00002489355,0.000081777864,0.000027486987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000556507,0.0006718378,0.0007448579,0.00034146605,0.0003770785,0.0008239158,0.00092647487,0.0007588002,0.00077691424],"category_scores_gemma":[0.0013572858,0.0003243508,0.0004133914,0.0007231509,0.0005943607,0.00071526214,0.000611918,0.00051863334,0.00010666835],"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.00001832308,0.00001313118,0.00022642377,0.000020726247,0.000009294828,0.00007339787,0.000022989327,0.9904855,0.0010938874,0.0037286158,0.00018387593,0.004123812],"study_design_scores_gemma":[0.0000024430508,0.000014471001,0.00005624142,0.0000014558768,0.0000039441757,0.000015742917,0.0000090521025,0.9986517,0.00015205558,0.0009970845,0.00009351921,0.0000023558466],"about_ca_topic_score_codex":0.0071558063,"about_ca_topic_score_gemma":0.007563918,"teacher_disagreement_score":0.0071558063,"about_ca_system_score_codex":0.0010661631,"about_ca_system_score_gemma":0.00072418194,"threshold_uncertainty_score":0.014228284},"labels":[],"label_agreement":null},{"id":"W4411142946","doi":"10.1109/jiot.2025.3577904","title":"Edge Caching Optimization With PPO and Transfer Learning for Dynamic Environments","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","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":"York University","funders":"","keywords":"Computer science; Transfer of learning; Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence","score_opus":0.006477261336592703,"score_gpt":0.2138051071482775,"score_spread":0.20732784581168479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411142946","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.027369661,0.00044713693,0.96766907,0.00044406913,0.000081049395,0.00005818271,0.000042679207,0.0006496346,0.0032385057],"genre_scores_gemma":[0.91293716,0.0002710606,0.081284754,0.0004465506,0.0001007817,0.00017214008,0.00011445369,0.00012859848,0.004544509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946374,0.00017421014,0.000028290598,0.00012539883,0.00009572192,0.000112704554],"domain_scores_gemma":[0.9976585,0.0016031741,0.00018483348,0.00014039442,0.00029255575,0.00012050938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422594,0.0010583098,0.0014862189,0.0004908892,0.00042911337,0.00089292525,0.0017579752,0.0015844542,0.0019767757],"category_scores_gemma":[0.0055781687,0.0005609022,0.00048161825,0.00062724337,0.0011437633,0.0015974029,0.0014453069,0.001942388,0.00041935855],"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.000044003213,0.000065085085,0.00044023595,0.000034084573,0.000020015572,0.000047352303,0.00002274694,0.97454166,0.0003541385,0.0037243697,0.00078185723,0.019924486],"study_design_scores_gemma":[0.000003000492,0.000007977182,0.00002120965,0.0000014126346,0.0000016688329,0.0000033452068,0.0000019180359,0.9986455,0.000056409524,0.0011977305,0.000058380432,0.0000014354854],"about_ca_topic_score_codex":0.0073204385,"about_ca_topic_score_gemma":0.004630261,"teacher_disagreement_score":0.0073204385,"about_ca_system_score_codex":0.0010335122,"about_ca_system_score_gemma":0.0016580281,"threshold_uncertainty_score":0.014555633},"labels":[],"label_agreement":null},{"id":"W4411411508","doi":"10.1145/3744970.3727299","title":"Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare","year":2025,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Caching and Content Delivery","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 Waterloo; University of Alberta","funders":"Universitas Brawijaya","keywords":"Fairness measure; Computer science; Max-min fairness; Resource allocation; Pareto principle; Set (abstract data type); Class (philosophy); Pareto optimal; Mathematical optimization; Resource (disambiguation); Range (aeronautics); Fair division; Microeconomics; Computer network; Economics; Artificial intelligence; Mathematics","score_opus":0.07345515778983039,"score_gpt":0.3304113782632325,"score_spread":0.25695622047340216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411411508","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.043633666,0.00040104325,0.9507553,0.0010610516,0.00010103049,0.0001711893,0.00009504777,0.0001696384,0.0036119907],"genre_scores_gemma":[0.8435158,0.00040020628,0.15092894,0.00039204344,0.00028428555,0.00032276814,0.000104474246,0.00014171323,0.0039097527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949367,0.0023930944,0.00016724058,0.00097456796,0.00078375754,0.0007445986],"domain_scores_gemma":[0.985707,0.010122823,0.0012422663,0.0013055854,0.00083272706,0.00078962767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009124853,0.0011378602,0.0026152744,0.0008867296,0.0013829147,0.0034114593,0.0039710966,0.0026918435,0.0026485552],"category_scores_gemma":[0.01934317,0.0005086523,0.0009220858,0.0017487985,0.0020746656,0.0059522907,0.0019284025,0.0022462362,0.0004025489],"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.0005010783,0.0005713567,0.0033065004,0.00021064932,0.00013820716,0.00022195576,0.00031124178,0.73974156,0.0022318314,0.16594884,0.0039034423,0.082913324],"study_design_scores_gemma":[0.00003386276,0.00007340085,0.00034051432,0.000013326023,0.000016778204,0.000073222014,0.000052325566,0.9455251,0.0006462501,0.052167036,0.001045766,0.000012372888],"about_ca_topic_score_codex":0.0028298723,"about_ca_topic_score_gemma":0.0017682323,"teacher_disagreement_score":0.009124853,"about_ca_system_score_codex":0.0031866143,"about_ca_system_score_gemma":0.002593683,"threshold_uncertainty_score":0.04825747},"labels":[],"label_agreement":null},{"id":"W4411552971","doi":"10.1145/3736548.3737836","title":"PaperCache: In-Memory Caching with Dynamic Eviction Policies","year":2025,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Eviction; Computer science; Computer network; Computer security; Political science","score_opus":0.005029596589708506,"score_gpt":0.22633389516164026,"score_spread":0.22130429857193176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411552971","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5720244,0.005598076,0.31223682,0.0008713869,0.00087099185,0.0008954325,0.0027801746,0.08552761,0.019195128],"genre_scores_gemma":[0.89933556,0.00084409845,0.08789075,0.00046736866,0.00009849799,0.00023359577,0.0019870016,0.0012826655,0.007860506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847704,0.00027703797,0.0001901423,0.00022352763,0.0005502102,0.00028200113],"domain_scores_gemma":[0.99370956,0.0010388923,0.00048082648,0.0029689593,0.0014671459,0.00033464783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011132138,0.0010718349,0.00078779884,0.0009657412,0.0007018436,0.0017637326,0.003369194,0.001083098,0.0022077144],"category_scores_gemma":[0.0057816687,0.0005368605,0.0003489,0.0019687393,0.0005858188,0.00273095,0.0010997097,0.001083195,0.00064168975],"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.0066479966,0.0025584558,0.04335516,0.0014554596,0.0008651455,0.00097290176,0.0010112964,0.17831945,0.13807768,0.023564981,0.08439512,0.51877636],"study_design_scores_gemma":[0.0005659786,0.0015227777,0.006555978,0.00011915498,0.00033392102,0.00091462047,0.00018604568,0.74488187,0.17192703,0.008054227,0.06471431,0.00022416451],"about_ca_topic_score_codex":0.008348243,"about_ca_topic_score_gemma":0.01058219,"teacher_disagreement_score":0.008348243,"about_ca_system_score_codex":0.001263889,"about_ca_system_score_gemma":0.0022945188,"threshold_uncertainty_score":0.016599357},"labels":[],"label_agreement":null},{"id":"W4412429706","doi":"10.1016/j.disc.2025.114680","title":"On optimal placement delivery arrays","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Mathematical optimization","score_opus":0.013573838745498203,"score_gpt":0.2442872188727287,"score_spread":0.2307133801272305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412429706","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.03298977,0.0026685137,0.9093048,0.0028467688,0.00044823284,0.00010989688,0.00045008754,0.00053313957,0.05064886],"genre_scores_gemma":[0.59840214,0.009433666,0.31441185,0.0016574506,0.0012824702,0.00055611617,0.0010800372,0.0011184362,0.07205778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986739,0.00051310804,0.00005585898,0.00018756176,0.00036688507,0.0002027218],"domain_scores_gemma":[0.99413764,0.0043163863,0.000386909,0.0004503289,0.0005070814,0.00020154672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267644,0.0015831414,0.0020590425,0.0016997983,0.0011312077,0.0026578761,0.0020245153,0.0018450095,0.01583014],"category_scores_gemma":[0.013849561,0.0011527555,0.0007915429,0.0038317626,0.0018999821,0.004582002,0.002889904,0.0025872374,0.00203201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0002740908,0.00013079551,0.0004362431,0.00022087924,0.000033493114,0.000087455424,0.0001466326,0.34603482,0.0026785831,0.5677932,0.020472454,0.061691485],"study_design_scores_gemma":[0.000042090134,0.00007479494,0.00016776976,0.0000540763,0.000021504735,0.00009012051,0.00008846984,0.5711924,0.0011407579,0.41891256,0.008194384,0.000021023814],"about_ca_topic_score_codex":0.0024132964,"about_ca_topic_score_gemma":0.0019908443,"teacher_disagreement_score":0.01583014,"about_ca_system_score_codex":0.0025359641,"about_ca_system_score_gemma":0.0015682866,"threshold_uncertainty_score":0.052957058},"labels":[],"label_agreement":null},{"id":"W4413872235","doi":"10.5267/j.ijiec.2025.6.007","title":"An auxiliary caching strategy for mobile cache networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province","keywords":"Cache; Computer science; Cache invalidation; Smart Cache; Cache algorithms; Computer network; CPU cache","score_opus":0.030998510189378384,"score_gpt":0.29573596224032855,"score_spread":0.2647374520509502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872235","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.067222916,0.0034283649,0.9088727,0.00062420283,0.00022955419,0.00018682996,0.00022985716,0.0007345559,0.0184709],"genre_scores_gemma":[0.94261986,0.0014384416,0.04881479,0.00019431653,0.000105322615,0.00016047168,0.00019420554,0.000064723055,0.0064079096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996971,0.000074886826,0.000016976208,0.00005501215,0.00008103262,0.00007507053],"domain_scores_gemma":[0.99918944,0.00026083525,0.00006470512,0.000104574916,0.00032106147,0.000059417594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047443417,0.0007368459,0.00097573106,0.00086999056,0.0011300839,0.0012573494,0.0019384716,0.0007628673,0.0027317177],"category_scores_gemma":[0.0021923606,0.00023876288,0.0005496332,0.0011803072,0.00068107893,0.0017573652,0.00095200574,0.00056786777,0.00048160495],"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.000553469,0.00016052528,0.001965311,0.0004686541,0.00011611751,0.0008019103,0.000434566,0.52785504,0.020018222,0.2792597,0.014921811,0.15344472],"study_design_scores_gemma":[0.00001646299,0.00006306763,0.00009733996,0.000017937216,0.000024882445,0.00015726534,0.00003589704,0.9811793,0.0009523768,0.014857173,0.0025845831,0.000013746006],"about_ca_topic_score_codex":0.0063297735,"about_ca_topic_score_gemma":0.00812701,"teacher_disagreement_score":0.0063297735,"about_ca_system_score_codex":0.0016424935,"about_ca_system_score_gemma":0.001474265,"threshold_uncertainty_score":0.012585878},"labels":[],"label_agreement":null},{"id":"W4413966964","doi":"10.1109/tnse.2025.3605822","title":"Joint Deterministic and Probabilistic Edge Caching Minimized Service Time for Cooperative Video Transmission in VANETs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","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":"Memorial University of Newfoundland","funders":"National Foundation for Science and Technology Development","keywords":"Computer science; Probabilistic logic; Computer network; Joint (building); Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Service (business); Real-time computing; Distributed computing; Telecommunications; Engineering; Artificial intelligence","score_opus":0.011236819168433821,"score_gpt":0.21549381182947838,"score_spread":0.20425699266104455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966964","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.06347188,0.000596283,0.9328131,0.00024096033,0.000045405952,0.00005402946,0.00007538921,0.0001758063,0.00252717],"genre_scores_gemma":[0.96779925,0.00026764764,0.030547407,0.000059264043,0.000022389715,0.00006529685,0.000058701884,0.000034652185,0.0011454076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991015,0.0002842979,0.00003869463,0.00017125446,0.00020455544,0.00019978949],"domain_scores_gemma":[0.9980539,0.0012013651,0.00021816781,0.000084680294,0.00034344158,0.00009840601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013226942,0.00091605395,0.0012393473,0.0006553802,0.00053456315,0.001106585,0.0013402265,0.0009339672,0.0008487821],"category_scores_gemma":[0.004821199,0.00054277806,0.0005979967,0.0011982943,0.0007907923,0.001025589,0.0008775147,0.00066883944,0.00010883619],"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.000029210705,0.0000109440425,0.00020283346,0.000024237963,0.00001103778,0.000027800203,0.000018713383,0.99148667,0.00053880486,0.0030061023,0.00020337694,0.004440317],"study_design_scores_gemma":[0.0000026216387,0.000015256829,0.000053089203,0.0000014941395,0.00000450391,0.0000076542665,0.000008235805,0.99886143,0.00013274941,0.00085071503,0.000059556172,0.0000026831772],"about_ca_topic_score_codex":0.0157719,"about_ca_topic_score_gemma":0.012652738,"teacher_disagreement_score":0.0157719,"about_ca_system_score_codex":0.0019458474,"about_ca_system_score_gemma":0.0021845482,"threshold_uncertainty_score":0.03136021},"labels":[],"label_agreement":null},{"id":"W4414272463","doi":"10.1109/ichms65439.2025.11154176","title":"CacheMamba: Popularity Prediction for Mobile Edge Caching Networks via Selective State Spaces","year":2025,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Popularity; Enhanced Data Rates for GSM Evolution; Latency (audio); Mobile edge computing; Benchmark (surveying); Mobile device; Edge device; State (computer science)","score_opus":0.008274963799450853,"score_gpt":0.23779125409610968,"score_spread":0.22951629029665882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414272463","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.09510627,0.001014161,0.89739877,0.000428848,0.000083176936,0.00008576677,0.00055490725,0.0028514497,0.0024766594],"genre_scores_gemma":[0.9506526,0.00030526664,0.047024675,0.00008226677,0.0000365794,0.000105522275,0.00034702674,0.00004161307,0.0014044957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998093,0.000048543687,0.000011165676,0.0000539156,0.000043379165,0.000033668162],"domain_scores_gemma":[0.9991604,0.00042994885,0.00008163272,0.00009973171,0.00018662818,0.00004167853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000584821,0.0005077774,0.0007902559,0.0006201761,0.0004557191,0.000786566,0.0015145895,0.000585704,0.0014750186],"category_scores_gemma":[0.0024153406,0.00026209286,0.00040376224,0.0007859647,0.00039005073,0.0013017537,0.000552312,0.0007019085,0.00037160164],"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.00025090898,0.000114194016,0.0045852736,0.00007223547,0.000054735003,0.0000705803,0.00005963466,0.88242656,0.003667145,0.011235062,0.002853638,0.094610065],"study_design_scores_gemma":[0.000001690455,0.000008284834,0.000077044795,0.0000011963207,0.000002334152,0.0000053952,0.000002466595,0.99888605,0.00017498454,0.00072248036,0.00011644139,0.0000016795934],"about_ca_topic_score_codex":0.019090505,"about_ca_topic_score_gemma":0.026424464,"teacher_disagreement_score":0.019090505,"about_ca_system_score_codex":0.0011072177,"about_ca_system_score_gemma":0.0012576453,"threshold_uncertainty_score":0.03795874},"labels":[],"label_agreement":null},{"id":"W4414538848","doi":"10.1109/icc52391.2025.11161006","title":"Adaptive Edge Caching in Dynamic Environments Using PPO and Transfer Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"York University","funders":"","keywords":"File transfer; Backhaul (telecommunications); Edge device; Enhanced Data Rates for GSM Evolution; Popularity; Rendering (computer graphics); Transfer of learning; Convergence (economics)","score_opus":0.012603070744235279,"score_gpt":0.22512402026030637,"score_spread":0.2125209495160711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414538848","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.03603701,0.00049087766,0.9594596,0.00029325404,0.00007484466,0.00006446828,0.0000297935,0.00045184352,0.0030983237],"genre_scores_gemma":[0.9186842,0.00030191283,0.07731069,0.0002630765,0.00009434254,0.00014180332,0.000073038034,0.00007278736,0.0030583518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948454,0.00018387484,0.000023848528,0.00012252294,0.000091682065,0.0000935923],"domain_scores_gemma":[0.99753904,0.0017901892,0.00016645089,0.0001358837,0.00025967977,0.000108667475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012696843,0.0009204364,0.0015442175,0.0005010329,0.00049057254,0.0009920038,0.0017475579,0.0015125507,0.0011085633],"category_scores_gemma":[0.0053210743,0.00047840987,0.0004970554,0.0006993182,0.0011829872,0.0017471354,0.0014789588,0.0013575236,0.00026238937],"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.000044050597,0.000066485874,0.0005030744,0.00003278202,0.000022758473,0.00004828581,0.000028130207,0.9750981,0.00042860385,0.0034299854,0.00044118514,0.019856576],"study_design_scores_gemma":[0.0000031715208,0.000010918631,0.000027255805,0.0000013857886,0.0000020524756,0.000004900011,0.000002640246,0.9987633,0.00006937655,0.0010552874,0.000057932062,0.0000017716816],"about_ca_topic_score_codex":0.006528203,"about_ca_topic_score_gemma":0.003305934,"teacher_disagreement_score":0.006528203,"about_ca_system_score_codex":0.0008375851,"about_ca_system_score_gemma":0.0014099107,"threshold_uncertainty_score":0.0129804015},"labels":[],"label_agreement":null},{"id":"W4414603650","doi":"10.1109/mvt.2025.3608414","title":"Adaptive Contextual Caching for Mobile-Edge Large Language Model Service: A Proposed Framework","year":2025,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Magazine","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"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":"Ministry of Education, India; Queen's University; Queen's University Belfast","keywords":"Cache; Smart Cache; Cache algorithms; Scalability; Cache invalidation; Latency (audio); Overhead (engineering); False sharing","score_opus":0.011127065270141106,"score_gpt":0.2684412493718088,"score_spread":0.2573141841016677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603650","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.035545636,0.0017011934,0.9383373,0.0010017715,0.0001365348,0.00038541408,0.0007052054,0.018026685,0.00416021],"genre_scores_gemma":[0.6677473,0.0007087064,0.3242942,0.00062401086,0.00012955768,0.00032778975,0.0016914267,0.0004343289,0.004042644],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993268,0.00015608018,0.000057101202,0.0001446256,0.00016762549,0.00014785817],"domain_scores_gemma":[0.998912,0.0002064512,0.00006401125,0.0003786944,0.00032826388,0.00011045963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097093766,0.00081864005,0.0011452618,0.0008308352,0.00076794124,0.0015291302,0.0028338092,0.001129945,0.0019179098],"category_scores_gemma":[0.0028820098,0.00031537047,0.0006280036,0.0011445186,0.0006060526,0.002782814,0.0021095523,0.0010791118,0.00096011505],"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.0012101192,0.0009977072,0.009521315,0.00056670373,0.0003008768,0.001426872,0.00085860724,0.24773185,0.042305928,0.072935134,0.063363455,0.5587813],"study_design_scores_gemma":[0.000027284708,0.00005059904,0.00022273984,0.000010708491,0.000039014347,0.00014052099,0.00007240606,0.9839246,0.003253406,0.0071329894,0.0050942693,0.00003136694],"about_ca_topic_score_codex":0.026871843,"about_ca_topic_score_gemma":0.0332884,"teacher_disagreement_score":0.026871843,"about_ca_system_score_codex":0.0014533043,"about_ca_system_score_gemma":0.0034792868,"threshold_uncertainty_score":0.053430855},"labels":[],"label_agreement":null},{"id":"W4414768814","doi":"10.35889/jutisi.v14i1.2634","title":"System Design of QR Code-Based Deterministic Cryptocurrency Wallet","year":2025,"lang":"en","type":"article","venue":"Jutisi Jurnal Ilmiah Teknik Informatika dan Sistem Informasi","topic":"Caching and Content Delivery","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":"Tellabs (Canada)","funders":"","keywords":"Cryptocurrency; Phrase; Key (lock); Code (set theory); Solidity","score_opus":0.016769846285650068,"score_gpt":0.23836223911890708,"score_spread":0.22159239283325702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414768814","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.044024967,0.0004643233,0.8908532,0.0005370738,0.00036689406,0.0012893097,0.00047213392,0.02170324,0.040288858],"genre_scores_gemma":[0.7110446,0.00038616828,0.229658,0.00038833282,0.000073269046,0.0009285632,0.0009127019,0.00073579315,0.05587251],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906236,0.00019810504,0.000080288235,0.0002015153,0.0003638147,0.00009389958],"domain_scores_gemma":[0.9991542,0.000118484895,0.000077594836,0.00017381224,0.00042309708,0.000052874126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006544443,0.00053894636,0.00047857457,0.00067177415,0.0005355607,0.0014359519,0.0012226158,0.0007825609,0.019454906],"category_scores_gemma":[0.002015347,0.00027950498,0.0003678749,0.00032888734,0.0004234599,0.001138069,0.00095465395,0.00043614578,0.008035521],"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.0018108089,0.0003131157,0.0058660726,0.0014575807,0.00010677432,0.0033937648,0.0021215016,0.044968475,0.27044323,0.07309152,0.0454653,0.5509618],"study_design_scores_gemma":[0.0003367048,0.0014246989,0.0030839643,0.00021203813,0.0001652005,0.0027256708,0.00047328547,0.48812002,0.23916306,0.008351449,0.25575107,0.0001928305],"about_ca_topic_score_codex":0.0020902667,"about_ca_topic_score_gemma":0.0012013322,"teacher_disagreement_score":0.019454906,"about_ca_system_score_codex":0.00067287975,"about_ca_system_score_gemma":0.00086993875,"threshold_uncertainty_score":0.06508309},"labels":[],"label_agreement":null},{"id":"W4414834436","doi":"10.48550/arxiv.2502.15746","title":"CacheMamba: Popularity Prediction for Mobile Edge Caching Networks via Selective State Spaces","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Popularity; Enhanced Data Rates for GSM Evolution; Latency (audio); Mobile edge computing; Benchmark (surveying); Mobile device; Edge device; State (computer science)","score_opus":0.027091634667367925,"score_gpt":0.26267997206537635,"score_spread":0.23558833739800844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414834436","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.09613967,0.0009922485,0.8964114,0.0004548971,0.00007745426,0.00008173118,0.000583007,0.0028841228,0.002375377],"genre_scores_gemma":[0.94555783,0.0003188133,0.051965345,0.000084060826,0.000036951664,0.00010467367,0.00038704358,0.000047842546,0.0014975184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998029,0.000053146894,0.000011714628,0.000055162716,0.000043520562,0.0000335813],"domain_scores_gemma":[0.9990833,0.0004876152,0.00008457633,0.00011633196,0.0001845792,0.00004358182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006208618,0.0005061711,0.00079048495,0.00062759133,0.00044633215,0.0008321833,0.0014850907,0.00061666174,0.0014510197],"category_scores_gemma":[0.0027278196,0.00026909687,0.00041211577,0.0008156209,0.00040817072,0.0013207677,0.0005711406,0.00073005137,0.00037630735],"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.00024728896,0.00011095925,0.0043628826,0.000072939765,0.0000548708,0.00006711131,0.000059690312,0.8831777,0.0035927272,0.012945213,0.0029511112,0.09235747],"study_design_scores_gemma":[0.0000017108713,0.000007740261,0.00007196793,0.000001172654,0.0000021528008,0.000005101613,0.0000023340433,0.99876815,0.0001810057,0.0008422365,0.000114760864,0.0000015128827],"about_ca_topic_score_codex":0.019109653,"about_ca_topic_score_gemma":0.025023611,"teacher_disagreement_score":0.019109653,"about_ca_system_score_codex":0.0011957752,"about_ca_system_score_gemma":0.0012870296,"threshold_uncertainty_score":0.03799689},"labels":[],"label_agreement":null},{"id":"W4414986814","doi":"10.1002/cpe.70337","title":"A Systematic Overview of Caching Mechanisms to Improve Hadoop Performance","year":2025,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Caching and Content Delivery","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":"McMaster University","funders":"","keywords":"Cache; Key (lock); Data access; Resource (disambiguation); Relational database; Distributed database; Cache algorithms","score_opus":0.02576432047012451,"score_gpt":0.3240513279266728,"score_spread":0.2982870074565483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414986814","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075008325,0.5472216,0.34490776,0.0028174808,0.0012485445,0.0011070763,0.0012279165,0.008091498,0.018369779],"genre_scores_gemma":[0.50612605,0.18275423,0.3020721,0.0009131104,0.00089157803,0.00074122724,0.0026658757,0.0008927479,0.0029430343],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99681085,0.0008700438,0.00041844486,0.000411027,0.001163548,0.00032606517],"domain_scores_gemma":[0.9920345,0.0029652368,0.0005223104,0.0007316944,0.003545715,0.00020058917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048371186,0.0014183086,0.0012571124,0.0049566682,0.0012846824,0.0027283537,0.0036526548,0.0010559517,0.00091730565],"category_scores_gemma":[0.01269589,0.000761811,0.0012121629,0.006139931,0.00070415396,0.00531407,0.001220851,0.0010642669,0.00043989575],"study_design_candidate":"systematic_review","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.00041417943,0.00022119505,0.010776957,0.0084082205,0.0004267152,0.00018229397,0.00064406823,0.022087531,0.012957082,0.025629494,0.02329463,0.89495754],"study_design_scores_gemma":[0.00027508332,0.0015779638,0.015805086,0.012828474,0.0019252053,0.0018837672,0.0023355202,0.37078843,0.08716925,0.046797205,0.45772824,0.00088583224],"about_ca_topic_score_codex":0.006680079,"about_ca_topic_score_gemma":0.005171091,"teacher_disagreement_score":0.006680079,"about_ca_system_score_codex":0.002007628,"about_ca_system_score_gemma":0.0042803986,"threshold_uncertainty_score":0.02558148},"labels":[],"label_agreement":null},{"id":"W4415114635","doi":"10.46300/9109.2025.19.16","title":"NFC-Based Smart Card Systems for Educational Applications: Design, Implementation, and Integration","year":2025,"lang":"en","type":"article","venue":"International Journal of Education and Information Technologies","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Smart card; Open Smart Card Development Platform; Key (lock); Access control; Software deployment; Microsoft Visual Studio; Software; Data access; Relational database; Attendance","score_opus":0.013067193284863124,"score_gpt":0.3077893890371669,"score_spread":0.2947221957523038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415114635","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.07464817,0.00061694015,0.88456553,0.0003606475,0.00026934186,0.000865146,0.00026832914,0.01165102,0.026754936],"genre_scores_gemma":[0.6073932,0.00053336355,0.35934848,0.00045267746,0.000081922364,0.00062417024,0.00046561874,0.00054620643,0.030554404],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988607,0.00015718178,0.00010006892,0.0001614728,0.00057987263,0.00014070323],"domain_scores_gemma":[0.9991793,0.000119783086,0.000070762326,0.000170351,0.0003826583,0.00007710836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536774,0.00046158364,0.0003376757,0.000865557,0.0003719605,0.0012331448,0.0015366297,0.00085291645,0.0057266997],"category_scores_gemma":[0.0015653231,0.00025952567,0.00020717827,0.00050735404,0.00032275546,0.0013510474,0.00071386,0.00047050876,0.0024606872],"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.00054307224,0.0005219801,0.009235939,0.000652176,0.00006343507,0.0011548552,0.0012305281,0.007919836,0.18817599,0.032368038,0.016625982,0.74150825],"study_design_scores_gemma":[0.00019471328,0.0018159394,0.016310578,0.0003426387,0.0001808344,0.004334237,0.00042086176,0.19300725,0.34372115,0.007500694,0.43192592,0.00024515053],"about_ca_topic_score_codex":0.0017803252,"about_ca_topic_score_gemma":0.0012710177,"teacher_disagreement_score":0.0057266997,"about_ca_system_score_codex":0.0006892101,"about_ca_system_score_gemma":0.0006598567,"threshold_uncertainty_score":0.019157708},"labels":[],"label_agreement":null},{"id":"W4415446232","doi":"10.1016/j.lisr.2025.101379","title":"TikTok as information space: A scoping review of information behavior on TikTok","year":2025,"lang":"en","type":"review","venue":"Library & Information Science Research","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"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 British Columbia","funders":"","keywords":"Variety (cybernetics); Multidisciplinary approach; Social media; Information behavior; Information sharing; Empirical research; Information system; Space (punctuation); Information seeking","score_opus":0.08675500856367496,"score_gpt":0.43377689468892144,"score_spread":0.3470218861252465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415446232","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030391826,0.9902473,0.00060847774,0.001606981,0.00028691784,0.00014390709,0.000182342,0.000014681475,0.0038702802],"genre_scores_gemma":[0.019200066,0.97753614,0.001168359,0.0009226224,0.00015100602,0.00029265688,0.00020840163,0.000023706123,0.0004971148],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9908064,0.0034840608,0.0024852473,0.00069994543,0.002168639,0.00035562963],"domain_scores_gemma":[0.90720236,0.07761806,0.005493777,0.0012936825,0.0077706347,0.00062142464],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013351272,0.0009051994,0.0021119076,0.018669825,0.0017924929,0.00632572,0.0013273199,0.0024368602,0.004468501],"category_scores_gemma":[0.05689896,0.0008509382,0.002414246,0.019816563,0.0034366846,0.00898036,0.0031298997,0.0022970636,0.00086805254],"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.0001748945,0.000081439255,0.0030405866,0.44797194,0.0006994337,0.0003857311,0.0135893915,0.00040070745,0.00068260834,0.012167031,0.009244962,0.5115613],"study_design_scores_gemma":[0.000016864353,0.00011077389,0.0065092104,0.7250438,0.0017745361,0.0005408245,0.01032443,0.00014791777,0.00056885724,0.0034966005,0.25139964,0.000066595574],"about_ca_topic_score_codex":0.011436552,"about_ca_topic_score_gemma":0.01893056,"teacher_disagreement_score":0.9936743,"about_ca_system_score_codex":0.004333757,"about_ca_system_score_gemma":0.017684529,"threshold_uncertainty_score":0.07060915},"labels":[],"label_agreement":null},{"id":"W4415934275","doi":"10.1109/nof66640.2025.11223322","title":"Prefetching Location-Based Metaverse Assets over Named Data Networking","year":2025,"lang":"","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"Instruction prefetch; sync; Bandwidth (computing); Latency (audio); Set (abstract data type); Namespace","score_opus":0.05349731514402617,"score_gpt":0.30382542743217933,"score_spread":0.25032811228815316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415934275","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.51541996,0.0009884874,0.46383932,0.00058447407,0.00015456868,0.00019064263,0.0004412967,0.007838899,0.01054235],"genre_scores_gemma":[0.9305233,0.00023659827,0.065572396,0.000072500734,0.00003366386,0.00004316066,0.00037715453,0.000107227235,0.0030341034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996542,0.00007634214,0.000026515489,0.00006841836,0.000114776165,0.00005978681],"domain_scores_gemma":[0.998185,0.0004454885,0.0001372122,0.00075023243,0.0003459355,0.00013619907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065607356,0.00037489692,0.000572042,0.0005747703,0.00082667073,0.0012986412,0.0013567145,0.00079438137,0.0013394565],"category_scores_gemma":[0.0026919253,0.0003451158,0.00027104348,0.0011489765,0.00043198635,0.0032123376,0.001534403,0.00050717976,0.00039445507],"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.0019725699,0.0004733267,0.031401187,0.00031188715,0.00020319104,0.0013261216,0.0011074255,0.4810677,0.07392992,0.049320314,0.01970848,0.33917785],"study_design_scores_gemma":[0.000020780653,0.000100282516,0.0009992957,0.000012328333,0.000023820776,0.00011051284,0.00008250887,0.97865,0.011410884,0.004674321,0.0038947458,0.000020519952],"about_ca_topic_score_codex":0.006303023,"about_ca_topic_score_gemma":0.01119275,"teacher_disagreement_score":0.006303023,"about_ca_system_score_codex":0.000983167,"about_ca_system_score_gemma":0.0010003457,"threshold_uncertainty_score":0.012532651},"labels":[],"label_agreement":null},{"id":"W4416078038","doi":"10.1109/comst.2025.3631362","title":"Trustworthy IoT Services With Blockchain and Information-Centric Networking: A Survey","year":2025,"lang":"","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Caching and Content Delivery","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 Ottawa; Ericsson (Canada)","funders":"","keywords":"Scalability; Blockchain; Trustworthiness; Access control; Authentication (law); Key (lock); Reliability (semiconductor); Internet of Things; Trust management (information system)","score_opus":0.02641882286379215,"score_gpt":0.2624652195986622,"score_spread":0.23604639673487005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416078038","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02304903,0.4842182,0.395161,0.007500218,0.0013032728,0.0005992674,0.00034103115,0.00105336,0.08677458],"genre_scores_gemma":[0.30097082,0.5806463,0.10278972,0.0013931841,0.0016849523,0.00046706738,0.00096997875,0.00022713248,0.010850859],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804544,0.0004307002,0.00020988038,0.00019704332,0.0009594652,0.00015749206],"domain_scores_gemma":[0.99787784,0.0010966033,0.00020204064,0.0002971828,0.0004109877,0.000115441195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019409069,0.0009085715,0.0009546476,0.002454746,0.0009936132,0.003137024,0.0015477276,0.0021039124,0.0021902148],"category_scores_gemma":[0.0039002725,0.0005250563,0.00076391915,0.0053920248,0.0012047488,0.0071111596,0.0021831496,0.0014271472,0.0010013841],"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.00011079085,0.00017916353,0.0032903869,0.0063918317,0.000086271575,0.0006780041,0.00086864625,0.02742931,0.0022560246,0.30849987,0.014549088,0.6356605],"study_design_scores_gemma":[0.00003745752,0.00021393751,0.0015376715,0.003562597,0.00009789254,0.0022130604,0.00096911774,0.15228634,0.003135308,0.22640526,0.60942143,0.00011990271],"about_ca_topic_score_codex":0.0024855614,"about_ca_topic_score_gemma":0.0016447885,"teacher_disagreement_score":0.003137024,"about_ca_system_score_codex":0.0013304848,"about_ca_system_score_gemma":0.0023304636,"threshold_uncertainty_score":0.010264635},"labels":[],"label_agreement":null},{"id":"W4416649853","doi":"10.1109/jiot.2025.3636738","title":"Optimized UAV Deployment and Blockchain-Based Caching: A Reinforcement Learning Framework","year":2025,"lang":"","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Reinforcement learning; Software deployment; Scalability; Popularity; Cache; Scheme (mathematics); Latency (audio); The Internet","score_opus":0.013984328801181918,"score_gpt":0.2541406322780641,"score_spread":0.2401563034768822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416649853","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.07127037,0.0003870539,0.921255,0.00051983754,0.00006753891,0.000102727936,0.00012076037,0.0004585936,0.005818094],"genre_scores_gemma":[0.97356725,0.00010706613,0.023915581,0.000058163067,0.000017607977,0.000062041465,0.000053564803,0.000023222168,0.0021954356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953353,0.00014405968,0.000019151601,0.00009994494,0.0000911025,0.00011211882],"domain_scores_gemma":[0.9978928,0.001271826,0.00028846794,0.0001297769,0.0002676297,0.00014945211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010465388,0.0006741963,0.0010718681,0.00039433478,0.00046237058,0.00084442797,0.0013836484,0.0011625903,0.002118504],"category_scores_gemma":[0.003885045,0.00034845373,0.0003717464,0.00047365722,0.0010046484,0.0011181415,0.0010995043,0.00092320266,0.0002556213],"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.00003251446,0.000016658805,0.00028029148,0.000015882017,0.000007149492,0.000047140675,0.000015144541,0.990973,0.0003574214,0.0028788366,0.00022644385,0.0051495545],"study_design_scores_gemma":[0.000005049226,0.000009709498,0.00002397824,0.0000015036492,0.0000016115011,0.0000047594763,0.0000028844513,0.99875927,0.00006815493,0.0010533672,0.00006843532,0.000001287612],"about_ca_topic_score_codex":0.008190718,"about_ca_topic_score_gemma":0.0071619647,"teacher_disagreement_score":0.008190718,"about_ca_system_score_codex":0.0010387938,"about_ca_system_score_gemma":0.0014105855,"threshold_uncertainty_score":0.016286075},"labels":[],"label_agreement":null},{"id":"W4416649891","doi":"10.1109/tnse.2025.3637123","title":"Intelligent Edge Caching Strategies for Optimized Content Delivery","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Cache; Enhanced Data Rates for GSM Evolution; Wireless; Content delivery; Volume (thermodynamics); Edge computing; Mobile device; Wireless network; Edge device; Graph","score_opus":0.02930854887855782,"score_gpt":0.23578528440124447,"score_spread":0.20647673552268664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416649891","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.07477096,0.0006760558,0.91739476,0.00036102795,0.00007302161,0.000056242934,0.00008460668,0.0011698784,0.005413403],"genre_scores_gemma":[0.90562785,0.00029955953,0.09001673,0.00019776294,0.00003629044,0.000046182737,0.00013647457,0.00009681965,0.0035423953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.000114935414,0.00001554841,0.000078392375,0.00007746002,0.000067309345],"domain_scores_gemma":[0.999154,0.0004240497,0.00007790788,0.00007837812,0.00020549183,0.000060212307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000654925,0.00067298074,0.00063610845,0.00048125113,0.00039458202,0.00069731736,0.0012474266,0.00076805544,0.0013303307],"category_scores_gemma":[0.002362734,0.00027750395,0.0002566805,0.0004745176,0.00046894274,0.001117913,0.00073671626,0.0007107919,0.00037476706],"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.00027838317,0.000131194,0.0014052738,0.00010658982,0.000049011185,0.00016752211,0.00012106992,0.86809945,0.016505593,0.018257545,0.0058171595,0.08906115],"study_design_scores_gemma":[0.000005406994,0.00001583511,0.00006597453,0.0000020943562,0.000005443818,0.000017370052,0.000007702754,0.99664587,0.0010920179,0.0018145724,0.00032485204,0.000002891995],"about_ca_topic_score_codex":0.004421601,"about_ca_topic_score_gemma":0.0072192415,"teacher_disagreement_score":0.004421601,"about_ca_system_score_codex":0.0011074677,"about_ca_system_score_gemma":0.0009809359,"threshold_uncertainty_score":0.008791685},"labels":[],"label_agreement":null},{"id":"W4417470002","doi":"10.1109/tccn.2025.3645473","title":"Adaptive Layer-Wise Personalized Federated Deep Reinforcement Learning for Heterogeneous Edge Caching","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Caching and Content Delivery","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":"Concordia University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province","keywords":"Reinforcement learning; Cache; Personalization; Adaptation (eye); Latency (audio); Edge device; Enhanced Data Rates for GSM Evolution; Edge computing","score_opus":0.062299901136815626,"score_gpt":0.2965203839878673,"score_spread":0.23422048285105165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417470002","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.074943736,0.00029676443,0.92156315,0.00026298943,0.000046906614,0.000052770723,0.00006667855,0.0010509319,0.0017160354],"genre_scores_gemma":[0.94507843,0.00007330771,0.05253196,0.00021764167,0.00001832322,0.00007238154,0.00009183681,0.00004428234,0.0018717734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967134,0.00008063161,0.000015747679,0.00008842568,0.000061905,0.00008201196],"domain_scores_gemma":[0.999253,0.0003496565,0.00007294637,0.000091912305,0.0001678545,0.000064673695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008178381,0.00067846203,0.00084587187,0.00023353429,0.00028999327,0.00047711923,0.0016272468,0.0008281084,0.0012396117],"category_scores_gemma":[0.0027893903,0.0003301754,0.00031862318,0.00026105688,0.0006152123,0.0010206413,0.0009618922,0.0013254294,0.00023418361],"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.00013407758,0.00017938741,0.0017409422,0.000043539872,0.00003773593,0.00008027225,0.00006635847,0.9084431,0.004259598,0.0034710565,0.0018371417,0.079706706],"study_design_scores_gemma":[0.0000049352966,0.00001319354,0.000049694554,0.0000012785086,0.0000026993077,0.0000048783013,0.000002611336,0.9986071,0.00030653542,0.0009388123,0.000066616914,0.000001649939],"about_ca_topic_score_codex":0.008100873,"about_ca_topic_score_gemma":0.011165805,"teacher_disagreement_score":0.008100873,"about_ca_system_score_codex":0.0010173707,"about_ca_system_score_gemma":0.0012656961,"threshold_uncertainty_score":0.01610744},"labels":[],"label_agreement":null},{"id":"W4417473613","doi":"10.1109/jiot.2025.3632391","title":"Hybrid Cognitive IoT With Cooperative Caching and SWIPT-EH: A Hierarchical Reinforcement Learning Framework","year":2025,"lang":"","type":"article","venue":"IEEE Internet of Things Journal","topic":"Caching and Content Delivery","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":"Concordia University","funders":"","keywords":"Cache; Reinforcement learning; Scalability; Benchmark (surveying); Underlay; Power control; Data transmission; Cognitive radio; Wireless","score_opus":0.012233660896365102,"score_gpt":0.25519110592974553,"score_spread":0.24295744503338043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417473613","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.02418447,0.00028615384,0.97106737,0.00025072196,0.000046274894,0.000026485897,0.000025761508,0.00024877462,0.0038639465],"genre_scores_gemma":[0.957887,0.00015488484,0.03919532,0.0001412283,0.000036909336,0.000068310736,0.00003009276,0.000022984108,0.0024632602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00009856786,0.00001379722,0.00008669547,0.0000848588,0.000074099284],"domain_scores_gemma":[0.999559,0.00021617234,0.000060905568,0.000032591477,0.000087589084,0.00004376613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006955018,0.00070653216,0.00078160584,0.0002354187,0.0003271589,0.00075343397,0.0014112009,0.00080529513,0.0010028261],"category_scores_gemma":[0.0012395191,0.00030984596,0.00048773506,0.000257296,0.0008364716,0.0007891219,0.00090402854,0.0010294357,0.00016306835],"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.00003159945,0.000034902198,0.0004871339,0.000031290278,0.000036790178,0.000085167485,0.000050953404,0.97058076,0.0013315749,0.0124502005,0.00038456346,0.014495127],"study_design_scores_gemma":[0.0000028148465,0.000008252215,0.000028607981,0.000001201551,0.0000033403483,0.000004702038,0.0000029209511,0.99809796,0.0000753283,0.0016712124,0.00010172187,0.0000018940765],"about_ca_topic_score_codex":0.007966388,"about_ca_topic_score_gemma":0.006526753,"teacher_disagreement_score":0.007966388,"about_ca_system_score_codex":0.0008004824,"about_ca_system_score_gemma":0.0010355997,"threshold_uncertainty_score":0.015840054},"labels":[],"label_agreement":null},{"id":"W46347509","doi":"","title":"Web prefetching with high accuracy and low memory cost","year":2008,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"Computer science; Latency (audio); Web application; Overhead (engineering); Parallel computing; Real-time computing; Operating system","score_opus":0.017175572814988337,"score_gpt":0.2066182008790059,"score_spread":0.18944262806401757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46347509","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.14517146,0.0031776368,0.83661723,0.0006305268,0.00012968213,0.00012985637,0.00029545676,0.0068319044,0.007016265],"genre_scores_gemma":[0.8331859,0.0008795317,0.16072866,0.00014928663,0.0002639121,0.000088947454,0.00039211247,0.00023176143,0.004079931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.00013013158,0.00006199684,0.000113838076,0.00061163655,0.00012613737],"domain_scores_gemma":[0.9962619,0.0016900024,0.0003155635,0.00084106857,0.00080280204,0.0000886752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006523395,0.0005533234,0.0008295896,0.001036293,0.0006827244,0.0011215627,0.0012013098,0.00088445377,0.0012949493],"category_scores_gemma":[0.007070477,0.00043410732,0.00019086739,0.001742724,0.0004944522,0.002794855,0.0007615812,0.0009454916,0.0007819135],"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.00088065193,0.0002992221,0.010864473,0.00032564288,0.000121791585,0.0003934356,0.00016376258,0.27257848,0.10092616,0.021332243,0.011350551,0.5807636],"study_design_scores_gemma":[0.000057561327,0.00018124786,0.0026442641,0.000016515045,0.00003813315,0.00020891048,0.000030117368,0.94617575,0.038208038,0.0094082635,0.0030007965,0.00003037553],"about_ca_topic_score_codex":0.0034601847,"about_ca_topic_score_gemma":0.0043389057,"teacher_disagreement_score":0.0034601847,"about_ca_system_score_codex":0.00074700854,"about_ca_system_score_gemma":0.0007870004,"threshold_uncertainty_score":0.0068801045},"labels":[],"label_agreement":null},{"id":"W4637398","doi":"10.1007/978-3-662-44300-2_10","title":"Category-Based YouTube Request Pattern Characterization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Popularity; Computer science; Upload; Workload; Cluster analysis; Data mining; Artificial intelligence; World Wide Web","score_opus":0.011889976283948124,"score_gpt":0.20378622785894032,"score_spread":0.1918962515749922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4637398","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.65307766,0.0019664338,0.17328547,0.0007685992,0.000333923,0.0014799963,0.11409382,0.020219056,0.0347751],"genre_scores_gemma":[0.77439076,0.0007224171,0.10007707,0.0001672159,0.00010113047,0.00072543754,0.10462585,0.0006946324,0.018495606],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99931705,0.0000375344,0.00008208625,0.00011568467,0.000318463,0.00012918784],"domain_scores_gemma":[0.99791175,0.00032644926,0.00016516593,0.00021542229,0.0012691064,0.000112197245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757998,0.0005649008,0.0005514327,0.0072229602,0.0005120919,0.0010018813,0.0005816447,0.0005237365,0.0046837847],"category_scores_gemma":[0.0024361473,0.00017252186,0.00043671054,0.004594982,0.00019196556,0.0010704146,0.0007093817,0.00040825384,0.0033183661],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016478954,0.00041808537,0.17424038,0.0009752012,0.00022049059,0.0010897572,0.0007249444,0.009294614,0.08745066,0.008183958,0.09931601,0.6164379],"study_design_scores_gemma":[0.00005835643,0.00035230504,0.20772518,0.00020559905,0.00017176445,0.002972598,0.0020120281,0.62938434,0.075435154,0.007177758,0.0743238,0.00018114383],"about_ca_topic_score_codex":0.028476536,"about_ca_topic_score_gemma":0.04445317,"teacher_disagreement_score":0.028476536,"about_ca_system_score_codex":0.0007343685,"about_ca_system_score_gemma":0.0010323579,"threshold_uncertainty_score":0.05662155},"labels":[],"label_agreement":null},{"id":"W5082126","doi":"","title":"Practical aspects of interacting garbage collectors","year":2003,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"Garbage collection; Uniprocessor system; Computer science; Garbage; Distributed computing; Tracing; Process (computing); Database; Operating system; Programming language","score_opus":0.03444722690740245,"score_gpt":0.2834512465339287,"score_spread":0.24900401962652627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5082126","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.01898636,0.00034655057,0.9710382,0.000449311,0.00004605373,0.00017202763,0.000027152353,0.0014658371,0.0074685044],"genre_scores_gemma":[0.34931564,0.00070637895,0.63994753,0.0002655799,0.000084180014,0.00049883185,0.00015471147,0.0008978199,0.008129256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887522,0.005009901,0.00089583977,0.0015049014,0.0028209733,0.0010163115],"domain_scores_gemma":[0.9796086,0.010278042,0.0010605288,0.006912889,0.0016448717,0.00049502024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009082698,0.0012111294,0.001399365,0.0013462098,0.0030674096,0.0070025353,0.0044927634,0.0032431106,0.0069877002],"category_scores_gemma":[0.025166456,0.001651445,0.0016977943,0.001439609,0.005168268,0.012643341,0.0075931177,0.00279981,0.0013200754],"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.0002939992,0.0001750777,0.0051868246,0.00074373616,0.00011457843,0.0007292769,0.006059171,0.085964724,0.012252604,0.7693645,0.0021821826,0.116933286],"study_design_scores_gemma":[0.00013709484,0.00034195356,0.0007698976,0.00036340224,0.00018365483,0.0014580468,0.0016395209,0.33171612,0.03769537,0.50802326,0.11750925,0.0001624013],"about_ca_topic_score_codex":0.0015127828,"about_ca_topic_score_gemma":0.0014255403,"teacher_disagreement_score":0.009082698,"about_ca_system_score_codex":0.0019774456,"about_ca_system_score_gemma":0.0021512595,"threshold_uncertainty_score":0.04803449},"labels":[],"label_agreement":null},{"id":"W67574747","doi":"","title":"Web Prefetching with Machine Learning Algorithms.","year":2008,"lang":"en","type":"article","venue":"International Conference on Internet Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Machine learning; Algorithm; Artificial intelligence","score_opus":0.047634791545291134,"score_gpt":0.25988662508669763,"score_spread":0.2122518335414065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67574747","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.08850197,0.0061921487,0.876839,0.0018277079,0.0007118564,0.00029837788,0.00096005166,0.014875629,0.009793204],"genre_scores_gemma":[0.58274776,0.0009249629,0.4069713,0.00039419642,0.0003997242,0.0002490701,0.0014091724,0.00037876688,0.0065250047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991959,0.00032769272,0.00006966801,0.0001486126,0.0001622068,0.00009589031],"domain_scores_gemma":[0.99523205,0.0031970143,0.00020511374,0.0005462782,0.0007136923,0.000105833424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014774055,0.0006689679,0.0011061128,0.0013170795,0.0005343215,0.0010921791,0.001448176,0.0012754148,0.003671588],"category_scores_gemma":[0.010391501,0.00047312968,0.00048649622,0.0019466422,0.00036501593,0.0021615175,0.0005853717,0.0018085343,0.0016009498],"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.0006783928,0.0007141437,0.004606171,0.00024169541,0.00017466789,0.000086037246,0.000054146698,0.43023142,0.0017278489,0.006793643,0.025681878,0.5290098],"study_design_scores_gemma":[0.000015987602,0.00001588397,0.00015148969,0.000005136005,0.0000067253436,0.000008540353,0.000004768246,0.99567634,0.00044005635,0.0032635524,0.0004089278,0.0000025998881],"about_ca_topic_score_codex":0.008845862,"about_ca_topic_score_gemma":0.0137621695,"teacher_disagreement_score":0.008845862,"about_ca_system_score_codex":0.00092283584,"about_ca_system_score_gemma":0.0013344199,"threshold_uncertainty_score":0.017588735},"labels":[],"label_agreement":null},{"id":"W6920419197","doi":"10.60692/taweh-x9g40","title":"A Content Dissemination Technique Based on Priority to Improve Quality of Service of Vehicular Ad Hoc Networks","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Caching and Content Delivery","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":"Centennial College","funders":"","keywords":"Quality of service; Cloud computing; Network packet; Vehicular ad hoc network; Mobile ad hoc network; Wireless ad hoc network; Cellular traffic; Content delivery; The Internet; Service (business)","score_opus":0.032887046545463525,"score_gpt":0.23432527307276663,"score_spread":0.2014382265273031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920419197","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.027761552,0.0031001512,0.963488,0.0003022916,0.00044625084,0.00021005108,0.000067110625,0.0010673461,0.0035572741],"genre_scores_gemma":[0.6682668,0.0025157952,0.32456297,0.00025566953,0.0003464033,0.00016607455,0.00024022946,0.00013565342,0.003510444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992593,0.00012898809,0.000051609328,0.00011989005,0.00034591748,0.00009429449],"domain_scores_gemma":[0.9986696,0.00035519322,0.00010889257,0.00011429705,0.00066661416,0.000085443615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009006706,0.0006667567,0.0007093637,0.0018021625,0.00087277865,0.00091044034,0.001313261,0.000510655,0.0007853961],"category_scores_gemma":[0.002701589,0.00024008988,0.0004894256,0.0014121891,0.00036687465,0.0015430386,0.00069833116,0.00076099037,0.00026212735],"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.00055735453,0.00031078735,0.0026402418,0.0006817827,0.00015672563,0.00058338384,0.0005421735,0.08776977,0.18471408,0.030128924,0.009791061,0.68212366],"study_design_scores_gemma":[0.0001844291,0.0008209009,0.0014816476,0.000063897605,0.0002091644,0.0011744859,0.00021440003,0.8946923,0.06177449,0.008830156,0.030434405,0.00011975204],"about_ca_topic_score_codex":0.0036064032,"about_ca_topic_score_gemma":0.0031627903,"teacher_disagreement_score":0.0036064032,"about_ca_system_score_codex":0.00092034915,"about_ca_system_score_gemma":0.001125379,"threshold_uncertainty_score":0.007170856},"labels":[],"label_agreement":null},{"id":"W6920425658","doi":"10.60692/y941n-2e251","title":"A Content Dissemination Technique Based on Priority to Improve Quality of Service of Vehicular Ad Hoc Networks","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Caching and Content Delivery","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":"Centennial College","funders":"","keywords":"Quality of service; Cloud computing; Network packet; Vehicular ad hoc network; Mobile ad hoc network; Wireless ad hoc network; Cellular traffic; Content delivery; The Internet; Service (business)","score_opus":0.032887046545463525,"score_gpt":0.23432527307276663,"score_spread":0.2014382265273031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920425658","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.027761552,0.0031001512,0.963488,0.0003022916,0.00044625084,0.00021005108,0.000067110625,0.0010673461,0.0035572741],"genre_scores_gemma":[0.6682668,0.0025157952,0.32456297,0.00025566953,0.0003464033,0.00016607455,0.00024022946,0.00013565342,0.003510444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992593,0.00012898809,0.000051609328,0.00011989005,0.00034591748,0.00009429449],"domain_scores_gemma":[0.9986696,0.00035519322,0.00010889257,0.00011429705,0.00066661416,0.000085443615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009006706,0.0006667567,0.0007093637,0.0018021625,0.00087277865,0.00091044034,0.001313261,0.000510655,0.0007853961],"category_scores_gemma":[0.002701589,0.00024008988,0.0004894256,0.0014121891,0.00036687465,0.0015430386,0.00069833116,0.00076099037,0.00026212735],"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.00055735453,0.00031078735,0.0026402418,0.0006817827,0.00015672563,0.00058338384,0.0005421735,0.08776977,0.18471408,0.030128924,0.009791061,0.68212366],"study_design_scores_gemma":[0.0001844291,0.0008209009,0.0014816476,0.000063897605,0.0002091644,0.0011744859,0.00021440003,0.8946923,0.06177449,0.008830156,0.030434405,0.00011975204],"about_ca_topic_score_codex":0.0036064032,"about_ca_topic_score_gemma":0.0031627903,"teacher_disagreement_score":0.0036064032,"about_ca_system_score_codex":0.00092034915,"about_ca_system_score_gemma":0.001125379,"threshold_uncertainty_score":0.007170856},"labels":[],"label_agreement":null},{"id":"W6977286276","doi":"10.6084/m9.figshare.16851378","title":"Additional file 1 of Sensitivity and specificity of self-reported psychiatric diagnoses amongst patients treated for opioid use disorder","year":2021,"lang":"en","type":"article","venue":"Open MIND","topic":"Caching and Content Delivery","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":"St Joseph's Health Centre; McMaster University","funders":"","keywords":"Medical diagnosis; Sensitivity (control systems); Contingency table; Opioid use disorder; Opioid; Psychiatric diagnosis","score_opus":0.024839807284270203,"score_gpt":0.24045406466840563,"score_spread":0.21561425738413542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977286276","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008493427,0.000016208296,0.0001851177,0.000109064364,0.000019995325,0.0001029412,0.9977215,0.00009009698,0.0009058368],"genre_scores_gemma":[0.039310653,0.00018587403,0.00429932,0.0008342221,0.00022562942,0.0042001847,0.9388,0.00042806345,0.011716083],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99898964,0.00021608999,0.00023241648,0.00023778199,0.00020635761,0.00011768592],"domain_scores_gemma":[0.9518963,0.03853191,0.0036215747,0.0014866146,0.003977723,0.00048587855],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016546824,0.0008380689,0.0009207864,0.001913835,0.0006533288,0.000900756,0.0012867962,0.0009270841,0.7953758],"category_scores_gemma":[0.04272015,0.0003937634,0.0006935211,0.0029201393,0.0001693518,0.001396967,0.0006035578,0.0008864052,0.06293137],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005732785,0.000164529,0.010459273,0.00175568,0.00009280733,0.00006581264,0.00006332997,0.00041137435,0.00007686613,0.0005567487,0.9760786,0.00970178],"study_design_scores_gemma":[0.021277769,0.0016117204,0.29086646,0.010677002,0.00093517127,0.002144797,0.001703607,0.009859411,0.0020247435,0.019981613,0.6385327,0.00038496288],"about_ca_topic_score_codex":0.007577026,"about_ca_topic_score_gemma":0.01052773,"teacher_disagreement_score":0.7953758,"about_ca_system_score_codex":0.0008578545,"about_ca_system_score_gemma":0.0013324047,"threshold_uncertainty_score":0.29187155},"labels":[],"label_agreement":null},{"id":"W7019803133","doi":"","title":"High Performance Content Centric Networking on Virtual Infrastructure","year":2013,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bottleneck; Scalability; Variety (cybernetics); Content centric networking; Throughput; Information-centric networking; Implementation; Routing (electronic design automation); Architecture; Next-generation network","score_opus":0.0037533248267414116,"score_gpt":0.1304543064006049,"score_spread":0.1267009815738635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019803133","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.31566617,0.0023006375,0.5652828,0.00096376287,0.00019667934,0.00033790886,0.00021823008,0.006288687,0.10874514],"genre_scores_gemma":[0.899828,0.0009038904,0.0870902,0.00013933855,0.000051457027,0.00009243099,0.0002206744,0.00015149396,0.011522493],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996088,0.00007584082,0.000013623923,0.00004625157,0.00017061434,0.00008485704],"domain_scores_gemma":[0.9992138,0.00021479011,0.00005421249,0.00016227456,0.0003099533,0.000045008117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006017338,0.00034716056,0.00028349957,0.00035617908,0.0007503583,0.0014685427,0.0010147546,0.00031309514,0.0019054189],"category_scores_gemma":[0.0012308822,0.00019719724,0.00010095863,0.00054930453,0.00043479522,0.0015842664,0.0006019762,0.0004667653,0.0004677026],"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.0006199419,0.0003375819,0.0065882555,0.0005108342,0.00008140264,0.0005412327,0.000870333,0.17489278,0.24114767,0.24272124,0.039757702,0.291931],"study_design_scores_gemma":[0.000031864205,0.0002150396,0.0024448403,0.000053549797,0.000055168566,0.000293634,0.00021035991,0.85549176,0.07506697,0.018132325,0.04796534,0.00003930398],"about_ca_topic_score_codex":0.007798278,"about_ca_topic_score_gemma":0.012978172,"teacher_disagreement_score":0.007798278,"about_ca_system_score_codex":0.0022616875,"about_ca_system_score_gemma":0.0017095681,"threshold_uncertainty_score":0.016409755},"labels":[],"label_agreement":null},{"id":"W7025360427","doi":"","title":"Transnational feminisms and the politics of international development in Ghana","year":2024,"lang":"en","type":"article","venue":"Saint Mary's University Institutional Repository (Saint Mary's University)","topic":"Caching and Content Delivery","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":"Saint Mary's University","funders":"","keywords":"Politics; International development; International relations; Government (linguistics); Human Development Report","score_opus":0.00786316759577343,"score_gpt":0.17949400610998245,"score_spread":0.17163083851420902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025360427","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.48882082,0.016641166,0.007456534,0.05855562,0.00036976274,0.000102360864,0.00007336871,0.000056808225,0.42792353],"genre_scores_gemma":[0.98390055,0.0029009264,0.0008692791,0.00068204186,0.000032970267,0.000040724226,0.000009475843,0.000036274872,0.011527813],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9969765,0.0024290702,0.000052391664,0.0001124777,0.00014601715,0.00028347145],"domain_scores_gemma":[0.99743736,0.0019172658,0.00029187088,0.00009663547,0.00008567301,0.00017106184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038661263,0.00028972796,0.00021442786,0.0009578003,0.0059285453,0.0059560444,0.00029117873,0.00091468304,0.0052246293],"category_scores_gemma":[0.0036535473,0.00023499395,0.00010375364,0.0021423753,0.022156684,0.0051879683,0.0043556397,0.0018037811,0.00023625989],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.000022728713,0.000011117635,0.0014829765,0.00011155992,0.0000018513988,0.0007333858,0.54659766,0.00008307597,0.00051052385,0.4323333,0.002716192,0.015395674],"study_design_scores_gemma":[0.0000111306135,0.000020817502,0.0027704532,0.0006525238,0.0000054871894,0.00047231087,0.6829066,0.00018713181,0.0004795232,0.040756945,0.27172807,0.000008961928],"about_ca_topic_score_codex":0.007445405,"about_ca_topic_score_gemma":0.013987458,"teacher_disagreement_score":0.007445405,"about_ca_system_score_codex":0.006719208,"about_ca_system_score_gemma":0.0032800026,"threshold_uncertainty_score":0.048751473},"labels":[],"label_agreement":null},{"id":"W7070041602","doi":"","title":"The Pair Cache Problem","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Caching and Content Delivery","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":"Blackberry (Canada)","funders":"","keywords":"Cache; Cache algorithms; Cache invalidation; Smart Cache; Cache coloring; Cache pollution; Page cache","score_opus":0.012564051096706455,"score_gpt":0.19071335166510556,"score_spread":0.17814930056839912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070041602","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.079022616,0.00379399,0.85819817,0.0077976673,0.0007263205,0.000612471,0.0020119168,0.0011084189,0.04672844],"genre_scores_gemma":[0.62741226,0.0038977885,0.31783652,0.002448718,0.0012034273,0.00094440667,0.00387876,0.00089335954,0.04148471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947824,0.0017724457,0.0002851008,0.0014439645,0.00095001573,0.00076606293],"domain_scores_gemma":[0.9879595,0.008130357,0.00076560525,0.0016167955,0.00091150455,0.0006162909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002893597,0.0017237106,0.0027271956,0.0008945006,0.0028275885,0.0055876807,0.004205919,0.0049582794,0.018452028],"category_scores_gemma":[0.016661102,0.0009778212,0.0015912214,0.0028335035,0.0023039412,0.014687525,0.004130687,0.004539552,0.0024841854],"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.0010519649,0.0006000098,0.002702021,0.0009545285,0.00026468965,0.00066501164,0.0005807552,0.14284758,0.0030237723,0.6222564,0.08014823,0.14490508],"study_design_scores_gemma":[0.00024671343,0.00032127733,0.00060939055,0.00012997042,0.000114149814,0.0016952318,0.0005474313,0.34582406,0.0029992468,0.59776795,0.049665626,0.00007884998],"about_ca_topic_score_codex":0.0019268666,"about_ca_topic_score_gemma":0.0012131152,"teacher_disagreement_score":0.018452028,"about_ca_system_score_codex":0.0023327942,"about_ca_system_score_gemma":0.002567526,"threshold_uncertainty_score":0.06172818},"labels":[],"label_agreement":null},{"id":"W7099318141","doi":"","title":"© 2010 Canadian Medical Association or its licensors","year":2010,"lang":"en","type":"article","venue":"","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Athletes; Endurance training; Hematocrit; Association (psychology); Cigarette smoking; Cardiovascular fitness","score_opus":0.0120868727687785,"score_gpt":0.2229276542466881,"score_spread":0.21084078147790958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099318141","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000457499,0.002810788,0.000820803,0.006760639,0.007123338,0.00013691849,0.001682147,0.0007467967,0.9794611],"genre_scores_gemma":[0.0011690763,0.0016772042,0.00054455886,0.0017960788,0.0003270475,0.000041504823,0.00070068665,0.00012830518,0.9936155],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979522,0.00013342705,0.00010422404,0.00028828986,0.0011352473,0.00038658947],"domain_scores_gemma":[0.99204904,0.000849241,0.00022067594,0.0007086605,0.004108034,0.0020642923],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018860418,0.0010394076,0.0007903056,0.0019207215,0.0039093643,0.005893021,0.0016210119,0.0066448855,0.8574236],"category_scores_gemma":[0.0069944668,0.0008781479,0.0009880974,0.0023015868,0.0015414292,0.002070746,0.0019129625,0.003788487,0.80076176],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000037053185,0.00009623043,0.0004570462,0.00022646667,0.0000072628604,0.00018661465,0.00007445472,0.000040762545,0.00045600344,0.0021226709,0.83868647,0.15760908],"study_design_scores_gemma":[0.000003838189,0.000003937883,0.00033268376,0.000105307,0.0000014971926,0.0000888261,0.000041333984,0.000019013822,0.00003591871,0.00011874439,0.99924576,0.000003141725],"about_ca_topic_score_codex":0.06790528,"about_ca_topic_score_gemma":0.16398853,"teacher_disagreement_score":0.1425764,"about_ca_system_score_codex":0.0033049895,"about_ca_system_score_gemma":0.013769718,"threshold_uncertainty_score":0.20336795},"labels":[],"label_agreement":null},{"id":"W7127417617","doi":"10.1109/ccece64018.2025.11364428","title":"SPASY: An NDN Sync Protocol for the Metaverse","year":2025,"lang":"","type":"article","venue":"","topic":"Caching and Content Delivery","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":"Western University","funders":"","keywords":"sync; Synchronizing; Latency (audio); Metaverse; Synchronization (alternating current); Protocol (science); Asset (computer security)","score_opus":0.05880221442642694,"score_gpt":0.35260102509857727,"score_spread":0.2937988106721503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127417617","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.030203385,0.0015641092,0.90058,0.0014738236,0.0014477763,0.001430512,0.0018689656,0.025946997,0.03548443],"genre_scores_gemma":[0.58474773,0.0019529983,0.36102703,0.002598152,0.0007049862,0.0024424181,0.0064808987,0.0034247173,0.036621068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980725,0.0003409056,0.00029117407,0.0002361339,0.000838708,0.00022054034],"domain_scores_gemma":[0.99547535,0.0008356087,0.00040766472,0.0017406447,0.0012861452,0.00025467397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003678462,0.0006176894,0.0006670452,0.0012818408,0.0014556055,0.003158786,0.0025071166,0.0012771575,0.006171311],"category_scores_gemma":[0.0066820844,0.00067618204,0.00044643387,0.0010252319,0.0011830537,0.0054209344,0.0048968266,0.0023056997,0.0022263888],"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.002788971,0.00049404067,0.006972866,0.0013159927,0.00032826353,0.001181409,0.0020457252,0.023636121,0.09712729,0.35191414,0.14498611,0.36720908],"study_design_scores_gemma":[0.00044710457,0.0005937352,0.0015101441,0.00037379973,0.00019227657,0.0011407343,0.00053873326,0.2595339,0.087476924,0.06901332,0.57886934,0.0003099767],"about_ca_topic_score_codex":0.0034120607,"about_ca_topic_score_gemma":0.0039606616,"teacher_disagreement_score":0.006171311,"about_ca_system_score_codex":0.0021409008,"about_ca_system_score_gemma":0.003251811,"threshold_uncertainty_score":0.020645082},"labels":[],"label_agreement":null},{"id":"W7132955618","doi":"","title":"Robust Fronthaul in Wireless Networks: A Caching and Traffic Prediction Approach","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Caching and Content Delivery","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 Toronto","funders":"","keywords":"Latency (audio); Wireless network; Wireless; Cloud computing; Markov decision process; Telecommunications link; Radio access network; Markov process; Process (computing)","score_opus":0.025710572020596838,"score_gpt":0.2561260744045028,"score_spread":0.23041550238390596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132955618","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.0149080735,0.0016730885,0.9795074,0.0007187294,0.00009894827,0.000048470072,0.00010498311,0.0001840451,0.0027562492],"genre_scores_gemma":[0.8557468,0.0040971534,0.13140857,0.0003657802,0.0005853781,0.00023875771,0.0003258592,0.0001344282,0.0070972517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.00026163884,0.00003469569,0.00014847078,0.00017158611,0.00013274887],"domain_scores_gemma":[0.99726546,0.0019560228,0.00023509529,0.00011342604,0.00033821288,0.00009171315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015774139,0.0013793783,0.0014155464,0.0008268125,0.0005336384,0.0016934703,0.0023858945,0.0015767433,0.0015775732],"category_scores_gemma":[0.0041862,0.00080651045,0.0009025971,0.0013032673,0.000998626,0.0018840107,0.0012716474,0.0019937502,0.0002904523],"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.000020890238,0.000027331625,0.00029942568,0.000034399895,0.000024067549,0.000037316848,0.00002046326,0.97972476,0.0003313326,0.010192121,0.00042051502,0.008867363],"study_design_scores_gemma":[0.0000011362962,0.0000053090375,0.000024682264,0.0000030793144,0.0000032676228,0.0000029405478,0.0000024822634,0.9977957,0.000043785734,0.0020328548,0.00008252143,0.0000022659626],"about_ca_topic_score_codex":0.01569542,"about_ca_topic_score_gemma":0.008337308,"teacher_disagreement_score":0.01569542,"about_ca_system_score_codex":0.0017620232,"about_ca_system_score_gemma":0.0017145372,"threshold_uncertainty_score":0.031208158},"labels":[],"label_agreement":null},{"id":"W7138941297","doi":"10.1109/globecom59602.2025.11432752","title":"A GCN and Recommender Based Approach for Optimizing Edge Caching Performance in IoV","year":2025,"lang":"","type":"article","venue":"","topic":"Caching and Content Delivery","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 Ottawa","funders":"","keywords":"Cache; Reinforcement learning; Recommender system; Latency (audio); Smart Cache; Cache algorithms; Enhanced Data Rates for GSM Evolution; The Internet; Graph","score_opus":0.03169188095559361,"score_gpt":0.2482773736662265,"score_spread":0.21658549271063288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7138941297","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.10719813,0.0014349229,0.8831975,0.00054276444,0.00014601678,0.000086539396,0.0002301449,0.0010445898,0.006119363],"genre_scores_gemma":[0.94479585,0.0002767819,0.051658113,0.00018492572,0.000041100666,0.000053396176,0.00018135639,0.00004579071,0.0027626583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996505,0.000056461016,0.0000154509,0.00010996373,0.00008581202,0.000081818],"domain_scores_gemma":[0.99945825,0.00017945709,0.00006272093,0.0000378957,0.0002063672,0.000055386197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709404,0.0008590561,0.00095616677,0.0004511201,0.000528032,0.0006647431,0.0021231177,0.0011854001,0.0009725616],"category_scores_gemma":[0.0014430616,0.00037744446,0.00032327033,0.0006316764,0.00052267354,0.00095984933,0.0006260948,0.0007517755,0.00023007198],"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.0000713792,0.000064378015,0.0022019225,0.00005255543,0.000042412226,0.000099521945,0.000052377556,0.9497884,0.003458322,0.0035565025,0.0021589412,0.038453285],"study_design_scores_gemma":[0.0000032918408,0.0000138084415,0.00009336662,0.000001603009,0.0000067759806,0.000009454087,0.0000063038797,0.998961,0.00022238435,0.00051601575,0.00016263146,0.0000033399253],"about_ca_topic_score_codex":0.039273627,"about_ca_topic_score_gemma":0.050799094,"teacher_disagreement_score":0.039273627,"about_ca_system_score_codex":0.001515479,"about_ca_system_score_gemma":0.0016111962,"threshold_uncertainty_score":0.07809007},"labels":[],"label_agreement":null},{"id":"W77538387","doi":"10.1007/978-3-319-05290-8_16","title":"Internet Multimedia Content Distribution","year":2014,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multicast; Multimedia; The Internet; Scalability; Download; Interactivity; World Wide Web; Computer network; Peer-to-peer; Operating system","score_opus":0.041217617193061266,"score_gpt":0.23305887458066538,"score_spread":0.1918412573876041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77538387","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052915644,0.021833712,0.11209365,0.0020061187,0.0016604605,0.000112355,0.00065112434,0.0034701622,0.8528808],"genre_scores_gemma":[0.047717016,0.019574001,0.018093305,0.0005112581,0.001100921,0.00007563529,0.0008918209,0.000802741,0.9112333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998692,0.000010345062,0.0000043979635,0.000025397827,0.000078627156,0.000011958029],"domain_scores_gemma":[0.9998363,0.000039675837,0.000007984426,0.000043000775,0.000060433496,0.000012521328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015230436,0.0006117996,0.00038061914,0.0015849024,0.00045054013,0.0016471917,0.0006919786,0.00050294545,0.057185795],"category_scores_gemma":[0.00057748513,0.00025081562,0.00015399893,0.0030657884,0.00043192008,0.0022404427,0.00068048725,0.0007906864,0.020589631],"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.000032198794,0.000058201374,0.00009464437,0.00016175624,0.000006638484,0.00005818145,0.00008350393,0.0014375028,0.004617006,0.10023661,0.19937319,0.6938405],"study_design_scores_gemma":[0.000009034178,0.000027408323,0.00042538278,0.00014828448,0.000014623,0.00037997353,0.00006535412,0.00929378,0.0056081708,0.03820823,0.9458052,0.000014550691],"about_ca_topic_score_codex":0.0010247456,"about_ca_topic_score_gemma":0.0011738468,"teacher_disagreement_score":0.057185795,"about_ca_system_score_codex":0.0008779764,"about_ca_system_score_gemma":0.00045240467,"threshold_uncertainty_score":0.19130558},"labels":[],"label_agreement":null}]}