{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.8002894e-7,0.0006232024,0.3448205,0.00016474888,0.0018988025,0.0002119495,0.0000055738474,0.0001915699,0.6520831],"genre_scores_gemma":[0.0016150933,0.00012250486,0.0036796718,0.0016964676,0.0012155396,0.00001569815,0.000105661864,0.000020600302,0.99152875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991556,0.0000038119297,0.0002469514,0.00014535118,0.00025783075,0.0001904915],"domain_scores_gemma":[0.9991021,0.00007212631,0.00014759054,0.00038203376,0.00020665473,0.00008950564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019584001,0.00016988012,0.00018034576,0.00014656867,0.00007254059,0.00022126189,0.00057021313,0.00013913609,0.000019008694],"category_scores_gemma":[0.000010098028,0.00015311727,0.00011996806,0.00002676803,0.00000996974,0.0005032253,0.00018176717,0.00013649843,0.00030035188],"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.000003607543,0.0000022082497,0.0000012335021,0.00001303853,0.000023809343,0.0000016006212,0.00006281368,0.00015069208,1.13372444e-7,0.6429525,0.22035684,0.13643156],"study_design_scores_gemma":[0.00020045442,0.0000327941,4.906301e-7,0.0000403438,0.000010423039,0.000008782369,0.0000022514753,0.04537578,2.458116e-7,0.023150504,0.93097585,0.00020206778],"about_ca_topic_score_codex":0.000012976725,"about_ca_topic_score_gemma":0.0000041034245,"teacher_disagreement_score":0.71061903,"about_ca_system_score_codex":0.00006437428,"about_ca_system_score_gemma":0.00010426461,"threshold_uncertainty_score":0.6243941},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94985706,0.00014439119,0.047576625,0.0016976509,0.00014691259,0.00023502209,0.00019974615,0.000106683656,0.00003588838],"genre_scores_gemma":[0.9953438,0.00006208417,0.0034828105,0.00009650368,0.000027929389,5.489496e-7,0.000052977895,0.000014895247,0.0009184207],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977614,0.00020375811,0.00028974173,0.0006817153,0.0005894888,0.00047386985],"domain_scores_gemma":[0.99736655,0.0003161022,0.0001419253,0.0016939669,0.00024367892,0.00023777888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575574,0.00022743612,0.0003271078,0.00020438997,0.0008352412,0.00017106101,0.0032545694,0.00012845366,0.000015661006],"category_scores_gemma":[0.0002485728,0.00022574326,0.00017069491,0.0008216297,0.0001956074,0.0023501122,0.0012285057,0.00034104893,0.000023364984],"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.0050699897,0.0012315199,0.6923388,0.0003713759,0.00075429503,0.0006856373,0.009184797,0.003996606,0.22404677,0.00057703553,0.0030189285,0.058724213],"study_design_scores_gemma":[0.005367925,0.00022507983,0.9269652,0.00054373924,0.00021689053,0.00012420022,0.0018461678,0.034141194,0.005934861,0.000072994604,0.023429979,0.001131818],"about_ca_topic_score_codex":0.0003461615,"about_ca_topic_score_gemma":0.0005455541,"teacher_disagreement_score":0.23462632,"about_ca_system_score_codex":0.000085032734,"about_ca_system_score_gemma":0.000110471854,"threshold_uncertainty_score":0.92055434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014330565,0.0005033415,0.9902458,0.00037895498,0.0033339118,0.00036260928,0.000081715196,0.00036531905,0.004585027],"genre_scores_gemma":[0.83830124,0.0004907553,0.14163873,0.013022045,0.0019543811,0.00006597892,0.00019220145,0.00017358393,0.004161104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947581,0.00006161859,0.0006641813,0.0022516341,0.001244681,0.0010197714],"domain_scores_gemma":[0.9962276,0.0004762677,0.0003954507,0.002292824,0.00026626256,0.000341573],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008011015,0.0008148107,0.00072161405,0.0009826135,0.00039887198,0.00078164885,0.00603195,0.00039791467,0.00010391234],"category_scores_gemma":[0.00007277308,0.0007668129,0.00029113292,0.00048842345,0.00095468224,0.0009437244,0.0015736659,0.0013036565,0.00024485585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028803785,0.00011379817,0.00025179246,0.00013278887,0.00005903209,0.0006520466,0.0025017858,0.005327009,0.00022435076,0.010962227,0.0021777442,0.9775686],"study_design_scores_gemma":[0.0019579832,0.0016487708,0.00033249197,0.0037715274,0.00009324516,0.00086432626,0.000002329874,0.79171497,0.004166937,0.15659603,0.032374702,0.00647672],"about_ca_topic_score_codex":0.00008947119,"about_ca_topic_score_gemma":0.00005657493,"teacher_disagreement_score":0.9710919,"about_ca_system_score_codex":0.00027052185,"about_ca_system_score_gemma":0.0006515127,"threshold_uncertainty_score":0.9994783},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036101937,0.001322847,0.99218285,0.00050162355,0.0017758089,0.0002490856,0.000008040558,0.00012236166,0.0002272171],"genre_scores_gemma":[0.7867949,0.0005697864,0.2084294,0.0024873067,0.001570343,0.00000824486,0.000041563344,0.000034262917,0.00006421112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756414,0.000043654298,0.0005146868,0.0005780395,0.0005892447,0.0007102542],"domain_scores_gemma":[0.9988784,0.00021961208,0.00022901518,0.00044815833,0.000098235614,0.00012653648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007423858,0.0003590176,0.0004244902,0.00049014913,0.00023898466,0.00044095318,0.0011043511,0.0002576183,0.000005202672],"category_scores_gemma":[0.000043751712,0.00034225636,0.000078064244,0.0003742417,0.0002102569,0.0011964445,0.00089303876,0.00075788883,0.000011651205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011076048,0.00001710982,0.0002917496,0.000028732893,0.000006642923,0.000021869277,0.0015576945,0.026433272,0.000015735955,0.0035190878,0.00002221033,0.9680748],"study_design_scores_gemma":[0.00066697487,0.0000628315,0.0033531396,0.00043894135,0.000010141038,0.000079800026,5.883396e-7,0.9645416,0.000021598102,0.027165823,0.0029719584,0.0006866131],"about_ca_topic_score_codex":0.000065090055,"about_ca_topic_score_gemma":0.00034021895,"teacher_disagreement_score":0.9673882,"about_ca_system_score_codex":0.00022822029,"about_ca_system_score_gemma":0.00018169435,"threshold_uncertainty_score":0.99990296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96907264,0.00006872831,0.01945833,0.00029020067,0.00062123,0.00035546123,0.0000034272293,0.00015412901,0.009975842],"genre_scores_gemma":[0.99849486,6.590395e-7,0.0008040159,0.00043769102,0.000023913128,0.000007258129,7.02258e-7,0.0000055191113,0.00022540493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99822074,0.000089428184,0.0003274609,0.00037120978,0.0007458186,0.0002453678],"domain_scores_gemma":[0.998465,0.000017694949,0.00009559949,0.0009500439,0.00036563518,0.00010601235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012086837,0.00013075446,0.00023864923,0.000061099585,0.00013212301,0.00011645041,0.00075275585,0.000049953538,0.000046136935],"category_scores_gemma":[0.000046238205,0.00010575401,0.000098945595,0.0001601199,0.000022706588,0.00024257033,0.0002560038,0.00025640428,0.00002735515],"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.000071551076,0.01089812,0.15699299,0.000057776728,0.0002754308,0.000062982646,0.0048816884,0.000009207363,0.23719077,0.58068025,0.0036487586,0.005230465],"study_design_scores_gemma":[0.034585588,0.012738011,0.74414754,0.0006208058,0.0004772629,0.00024083408,0.01898618,0.05185265,0.064319685,0.009253783,0.056773357,0.006004277],"about_ca_topic_score_codex":0.0013750488,"about_ca_topic_score_gemma":0.0017335219,"teacher_disagreement_score":0.58715457,"about_ca_system_score_codex":0.000023928884,"about_ca_system_score_gemma":0.000023472598,"threshold_uncertainty_score":0.43125233},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07886517,0.000052988154,0.91899633,0.00037003605,0.00015635196,0.00009293483,9.3948535e-7,0.000058787497,0.0014064336],"genre_scores_gemma":[0.9709488,0.000004010792,0.027777683,0.00057364744,0.000018323348,0.00001390965,0.0000040759073,0.0000032145838,0.00065632106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941736,0.000049513725,0.000108065615,0.00019830707,0.0000856481,0.00014107763],"domain_scores_gemma":[0.99952775,0.00014838343,0.000015578284,0.00024816382,0.00002678255,0.00003331287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002914313,0.000052900115,0.000061993676,0.00006922779,0.00005357489,0.000051821236,0.00019199018,0.000015245101,0.000004087391],"category_scores_gemma":[0.00011481426,0.000046496803,0.000023116472,0.00015243025,0.000008458943,0.0003240348,0.000027991271,0.000071894,0.000009534686],"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.0000067628634,0.00008969033,0.0057375603,0.000013571407,0.000004585662,0.000004545604,0.00021184311,0.0018700124,0.000986017,0.9787541,0.001701428,0.010619899],"study_design_scores_gemma":[0.0025037064,0.00016675047,0.010230491,0.00012519168,0.000010974186,0.000052041796,0.00017166274,0.8786728,0.005166641,0.012243529,0.08987713,0.0007790882],"about_ca_topic_score_codex":0.00018115116,"about_ca_topic_score_gemma":0.00018301714,"teacher_disagreement_score":0.96651053,"about_ca_system_score_codex":0.000020991396,"about_ca_system_score_gemma":0.000039472452,"threshold_uncertainty_score":0.18960845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002399594,0.0005382778,0.99298835,0.00036737602,0.0015897678,0.0004215993,0.000025152907,0.00024077082,0.0014291218],"genre_scores_gemma":[0.96767974,0.000029378889,0.030009044,0.0012198769,0.0003866806,0.0000095628775,0.000037102553,0.00003970714,0.00058893225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547136,0.000038230162,0.000534627,0.0016348716,0.0014641689,0.00085676485],"domain_scores_gemma":[0.9972161,0.00039940802,0.00033180264,0.0013340896,0.0004744948,0.00024410067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011816063,0.0006232699,0.0006180962,0.0005034644,0.00035670484,0.00068641064,0.0024534033,0.0002855728,0.000008594894],"category_scores_gemma":[0.000052855958,0.0004902175,0.00016101057,0.00058712234,0.00077466643,0.00031989565,0.000813163,0.00090151845,0.00003914928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010264224,0.00017183913,0.00032179835,0.00007317079,0.000060490183,0.0008258964,0.0008683461,0.17567046,0.00060166797,0.07979728,0.00007732279,0.7414291],"study_design_scores_gemma":[0.0010686879,0.0006216878,0.0008224414,0.001231127,0.000032275755,0.00034481837,0.0000013937223,0.9833715,0.0028914972,0.0060294485,0.0019482805,0.0016368283],"about_ca_topic_score_codex":0.00010019358,"about_ca_topic_score_gemma":0.00017585541,"teacher_disagreement_score":0.9652801,"about_ca_system_score_codex":0.0005965061,"about_ca_system_score_gemma":0.00044606073,"threshold_uncertainty_score":0.99975497},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043513812,0.000375145,0.005510053,0.00019342537,0.004123375,0.0003593063,0.000032296983,0.0004056153,0.9885656],"genre_scores_gemma":[0.025242299,9.0210705e-7,0.00046053305,0.0003724262,0.00033495878,0.000012625606,0.000026388803,0.00005837724,0.9734915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955775,0.000047582264,0.00050615094,0.0016105751,0.0015767972,0.0006813715],"domain_scores_gemma":[0.9969635,0.00021973433,0.00021348111,0.002178935,0.00016529021,0.00025902886],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000872564,0.0005398235,0.00046117054,0.0012670772,0.0008978768,0.0014020954,0.0023623616,0.00018832507,0.00009870003],"category_scores_gemma":[0.000005852128,0.00052449893,0.00039792518,0.00010138796,0.00041778098,0.00013097051,0.00040525018,0.00092979375,0.0019779361],"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.000021747022,0.000041292285,0.000009962433,0.000049810165,0.000043084492,0.0005239974,0.00023711241,0.00014837792,0.00042726492,0.68762195,0.28975454,0.021120865],"study_design_scores_gemma":[0.00066182145,0.00012272528,0.000059559443,0.001531361,0.000049474354,0.00006198751,0.0000056737945,0.0036522406,0.00068999693,0.052485693,0.93921447,0.0014649789],"about_ca_topic_score_codex":0.00008203969,"about_ca_topic_score_gemma":0.0038479262,"teacher_disagreement_score":0.64945996,"about_ca_system_score_codex":0.00022227969,"about_ca_system_score_gemma":0.00021535931,"threshold_uncertainty_score":0.99972063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019541972,0.00016642183,0.9947038,0.00010708468,0.0016446223,0.00023980312,0.000102572456,0.000041095347,0.0010403875],"genre_scores_gemma":[0.99071527,0.000035441844,0.008771323,0.00024870387,0.00009312393,0.000009252951,0.000028363407,0.00000504773,0.000093474424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818593,0.00006411706,0.0010474257,0.00009095771,0.00045862832,0.00015291364],"domain_scores_gemma":[0.99787843,0.00014087786,0.0007755366,0.0005084801,0.00060149207,0.00009519881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018390234,0.00010571036,0.00019124198,0.00029089217,0.000113197115,0.00042079965,0.0009122577,0.00005416306,0.0000013969394],"category_scores_gemma":[0.00029621093,0.000084925916,0.00011033672,0.00014873703,0.00000835362,0.0035679543,0.000048062953,0.00015427833,0.000014747961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043937016,0.000060735834,0.00020474968,0.00014919556,0.000080295475,0.0000011203919,0.0011864392,0.9532749,0.00013340371,0.02523168,0.013279189,0.0063543613],"study_design_scores_gemma":[0.00037081126,0.00007650615,0.0000024179053,0.00013150703,0.000012863321,0.000075036005,0.00026097993,0.9561417,0.00011099067,0.000102476704,0.04263553,0.000079147656],"about_ca_topic_score_codex":0.0000049054283,"about_ca_topic_score_gemma":9.815956e-7,"teacher_disagreement_score":0.98876107,"about_ca_system_score_codex":0.00009971287,"about_ca_system_score_gemma":0.0003884329,"threshold_uncertainty_score":0.40577808},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039741765,0.00019901602,0.98890984,0.00040138833,0.0017084783,0.00027922523,0.000003515336,0.00012655971,0.004397821],"genre_scores_gemma":[0.9564586,0.000051080253,0.04183312,0.0007898924,0.00021017814,0.000004148261,0.0000054594984,0.000023499635,0.00062401354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659115,0.000037135243,0.00068898586,0.0010833316,0.0011230098,0.00047637365],"domain_scores_gemma":[0.99759966,0.00040126865,0.0004681756,0.0011726841,0.00023814068,0.000120089964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005391762,0.00044157676,0.0006006285,0.00087980943,0.00021458088,0.00024681052,0.0022563646,0.00024857678,0.00001687771],"category_scores_gemma":[0.000055440705,0.00040954835,0.00015210593,0.00051656994,0.00040020258,0.00046352562,0.0005491721,0.0008161379,0.000052995787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017700471,0.00006923911,0.00029217906,0.00004741219,0.000009786281,0.000011802517,0.0010752152,0.19805065,0.00011470718,0.0021484257,0.000119246644,0.7980436],"study_design_scores_gemma":[0.000322529,0.00038908052,0.00019745393,0.0007529982,0.000008025852,0.000011269518,3.478513e-7,0.994861,0.0007450023,0.0020437855,0.00024135617,0.00042712063],"about_ca_topic_score_codex":0.000017982115,"about_ca_topic_score_gemma":0.000029746665,"teacher_disagreement_score":0.9524844,"about_ca_system_score_codex":0.00023267078,"about_ca_system_score_gemma":0.00016961468,"threshold_uncertainty_score":0.9998356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005935728,0.00044871413,0.98621947,0.00050995324,0.0018117228,0.00022186195,0.00003172535,0.00031648687,0.010380711],"genre_scores_gemma":[0.2958256,0.00006484542,0.6727073,0.0075647617,0.0042689727,0.00004112795,0.00012181526,0.00018076894,0.019224813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961547,0.000026552387,0.00049336447,0.0015914303,0.0009961897,0.0007377484],"domain_scores_gemma":[0.99744016,0.0005029239,0.00024700174,0.0014390509,0.00020546158,0.00016542486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056176406,0.0005359178,0.0005130749,0.0007922011,0.00032728285,0.00065811916,0.0034280962,0.00031060324,0.00012107454],"category_scores_gemma":[0.000079480444,0.00050792244,0.0002125506,0.0005289278,0.0006066914,0.00054331415,0.0014083829,0.00096353143,0.0001927058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010241159,0.000088506735,0.000062396655,0.000075972755,0.000030715233,0.00068037026,0.00059193344,0.12826216,0.000596609,0.019778011,0.0070435107,0.8427796],"study_design_scores_gemma":[0.00024959128,0.00013145395,0.000036779886,0.0005909635,0.00000824257,0.00012422704,8.161917e-8,0.95746017,0.0004858889,0.030133095,0.009916036,0.0008634653],"about_ca_topic_score_codex":0.00021940754,"about_ca_topic_score_gemma":0.00012772954,"teacher_disagreement_score":0.8419161,"about_ca_system_score_codex":0.00027750366,"about_ca_system_score_gemma":0.00042660005,"threshold_uncertainty_score":0.99973726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16155466,0.0051835445,0.004113866,0.0037348361,0.033696227,0.0011272528,0.000028288161,0.00021245769,0.7903489],"genre_scores_gemma":[0.8590553,0.0015021759,0.0011150131,0.0005786891,0.0013341907,0.000015185388,0.000008423062,0.00002709589,0.13636397],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878067,0.000012516832,0.00022568618,0.00044414212,0.00034647877,0.00019048565],"domain_scores_gemma":[0.99878085,0.000094039584,0.0004188232,0.00051436055,0.00015144868,0.00004048357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023841893,0.00019548809,0.00024001281,0.000057835605,0.0002711818,0.0005439529,0.0029168653,0.00011827283,0.000013806779],"category_scores_gemma":[0.00002172585,0.00013476651,0.0001109907,0.00006130065,0.00006994984,0.00017389287,0.0019675537,0.000355524,0.000049604085],"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.000059654314,0.00018249464,0.0011426943,0.00027567914,0.0003818228,0.0000056083136,0.002629858,0.001347682,0.0031592369,0.00553562,0.6561911,0.32908857],"study_design_scores_gemma":[0.0010192938,0.0004188384,0.001031957,0.0038123059,0.000052488627,0.00008605018,0.00018461578,0.15150371,0.0010511689,0.000346344,0.8394631,0.001030126],"about_ca_topic_score_codex":0.000026497459,"about_ca_topic_score_gemma":0.0000032453925,"teacher_disagreement_score":0.6975006,"about_ca_system_score_codex":0.000041260828,"about_ca_system_score_gemma":0.000040194576,"threshold_uncertainty_score":0.54956186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6601177,0.000030678977,0.3332754,0.0003407516,0.0002784282,0.00017450683,0.0000032426158,0.00009857311,0.0056807403],"genre_scores_gemma":[0.969323,0.000006795723,0.016765984,0.0002929801,0.00012360318,0.00001828966,0.0000050749927,0.000013467895,0.013450797],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992367,0.000013759423,0.00010961031,0.0003133187,0.00014148561,0.00018514696],"domain_scores_gemma":[0.99948287,0.000036607937,0.000027350816,0.0003163684,0.00001176903,0.00012505971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002579925,0.000086277265,0.00009235315,0.000029628261,0.00006008471,0.0001537415,0.00028389005,0.000023209777,0.000005697923],"category_scores_gemma":[0.000014068525,0.00007176525,0.000034571833,0.000035500223,0.00002554218,0.00015439877,0.0003322522,0.000034791236,0.00010012113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005875024,0.0021512776,0.0128964335,0.00017444878,0.00041946373,0.00017280834,0.026550135,0.007088299,0.5496439,0.12640539,0.11927784,0.15463254],"study_design_scores_gemma":[0.0009931773,0.00012850962,0.0006599728,0.000013545595,0.000010100698,0.000012746888,0.00008557842,0.99383444,0.0008276736,0.0006760135,0.0025325478,0.0002256802],"about_ca_topic_score_codex":0.000058493653,"about_ca_topic_score_gemma":0.0000017936063,"teacher_disagreement_score":0.98674613,"about_ca_system_score_codex":0.000028749315,"about_ca_system_score_gemma":0.000007983241,"threshold_uncertainty_score":0.2926502},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06043397,0.000103075545,0.78066,0.042581413,0.0004167375,0.00028282244,0.00006437938,0.0011402502,0.114317395],"genre_scores_gemma":[0.96527624,0.0000027794285,0.0056945663,0.0042847926,0.00023053767,0.000021883137,0.000017510994,0.0000057387383,0.02446597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879676,0.000059297498,0.00021540478,0.00040880995,0.00029364612,0.00022609232],"domain_scores_gemma":[0.99905014,0.00004231061,0.000054838725,0.00070670445,0.000047412614,0.00009859939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021090193,0.00013851175,0.00016956557,0.0004531708,0.00014171284,0.00016411999,0.0003323547,0.000043556855,0.0005961957],"category_scores_gemma":[0.000020955755,0.00011515805,0.00015375772,0.0012077554,0.00002072176,0.0003599069,0.00007302087,0.000100076424,0.00005709697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083364936,0.0024575775,0.028667625,0.00007036286,0.003611589,0.00007555683,0.0055503957,0.36568204,0.0025208835,0.124442294,0.112527646,0.3535604],"study_design_scores_gemma":[0.0005659769,0.00025837828,0.002677186,0.0000044856297,0.00007112839,0.00000598775,0.00006034951,0.95515245,0.0005537008,0.000040009178,0.040426616,0.00018371399],"about_ca_topic_score_codex":0.00023750527,"about_ca_topic_score_gemma":0.0010605362,"teacher_disagreement_score":0.90484226,"about_ca_system_score_codex":0.00011980325,"about_ca_system_score_gemma":0.00007008904,"threshold_uncertainty_score":0.65279245},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0720915e-7,0.936432,0.059695583,0.00041570893,0.0024002786,0.00048098876,0.000028903773,0.00012478327,0.00042153144],"genre_scores_gemma":[0.00005941941,0.9910442,0.007789468,0.0003243368,0.00019283251,0.00016673256,0.00008315499,0.000024965131,0.00031486587],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961256,0.00029339478,0.0012725549,0.0009283891,0.0009782851,0.00040177014],"domain_scores_gemma":[0.99387264,0.003919051,0.00052000146,0.00070400775,0.00087763026,0.00010665705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011356398,0.00056010514,0.0018778173,0.0003868111,0.00015907398,0.00011146608,0.0019363383,0.0001897824,0.000011698277],"category_scores_gemma":[0.0029143675,0.0004672235,0.00045863676,0.0012256692,0.00028285504,0.00019598046,0.00084973354,0.0011087602,0.00021549605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.888917e-7,0.00005553444,6.1028237e-7,0.009798307,0.00008978169,0.00009524355,0.00019893405,0.00012495698,8.017585e-9,0.016569689,0.0018156115,0.97125083],"study_design_scores_gemma":[0.000053024312,0.00004330201,0.000005723238,0.09299609,0.00025243714,0.0003289537,0.00007881921,0.004691048,7.697026e-8,0.013705094,0.8870303,0.00081511494],"about_ca_topic_score_codex":0.000021494563,"about_ca_topic_score_gemma":0.00004489311,"teacher_disagreement_score":0.97043574,"about_ca_system_score_codex":0.00024760104,"about_ca_system_score_gemma":0.0004395935,"threshold_uncertainty_score":0.999778},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5917743,0.00019531406,0.4051855,0.0003601489,0.00030789923,0.00009908445,9.434134e-7,0.00045454546,0.0016222765],"genre_scores_gemma":[0.9963283,0.00002452531,0.00094757805,0.0014667498,0.00023033921,0.000009355383,0.0000016088264,0.000010047585,0.0009815039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875104,0.00006116145,0.00020983632,0.0004276943,0.0002177734,0.00033247823],"domain_scores_gemma":[0.9990775,0.00006886531,0.000046179826,0.0006572752,0.000039095285,0.00011109289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020532537,0.00015030811,0.00015026187,0.0000516232,0.00014146749,0.00021267077,0.0006910915,0.000070194714,0.00005564295],"category_scores_gemma":[0.000004705091,0.00013052797,0.00011757298,0.00014258001,0.000019913845,0.00044794162,0.00030221403,0.00019511896,0.00006574307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036868725,0.00056265335,0.0066232104,0.00002808014,0.00011844357,0.00008466806,0.0006972642,0.25696698,0.0026452313,0.014693423,0.0073038554,0.7102393],"study_design_scores_gemma":[0.00021712258,0.000028921993,0.0003031721,0.000013501312,0.0000036647243,0.000029242434,0.00000669981,0.99626666,0.00021453838,0.00007347265,0.0026575555,0.00018543689],"about_ca_topic_score_codex":0.00009662276,"about_ca_topic_score_gemma":0.00017199494,"teacher_disagreement_score":0.7392997,"about_ca_system_score_codex":0.00006084745,"about_ca_system_score_gemma":0.00003186613,"threshold_uncertainty_score":0.53227764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5160255,0.021047046,0.40382245,0.009366324,0.0019903386,0.00044100618,0.000027456685,0.00068816927,0.046591725],"genre_scores_gemma":[0.9837025,0.000092442315,0.01596388,0.000106418214,0.000020903444,0.000007185161,0.00000780382,0.0000032243022,0.000095632255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993876,0.00011126145,0.000168867,0.00007614186,0.00011499513,0.00014109013],"domain_scores_gemma":[0.99767035,0.000106335494,0.00007362395,0.0020263721,0.000061660285,0.0000616702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030990038,0.00005460336,0.000085838234,0.000051532716,0.00014680337,0.00002546719,0.0015161952,0.000026617217,0.0000051977495],"category_scores_gemma":[0.000042124975,0.00005423378,0.000058650054,0.0001869637,0.000046443314,0.00030033092,0.00066519296,0.00013609178,0.00003656867],"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.0000042576944,0.0013267939,0.07657358,0.000027913797,0.000075683034,4.8287063e-7,0.004398678,0.0000768044,0.01061162,0.8389076,0.0049976744,0.06299893],"study_design_scores_gemma":[0.0018358321,0.0002340727,0.33179358,0.0004049114,0.00015778781,0.00009780153,0.001068466,0.3288083,0.007048584,0.013039532,0.3137555,0.0017556399],"about_ca_topic_score_codex":0.00018072907,"about_ca_topic_score_gemma":0.000019586767,"teacher_disagreement_score":0.82586807,"about_ca_system_score_codex":0.000020726757,"about_ca_system_score_gemma":0.000023274812,"threshold_uncertainty_score":0.28174934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73706645,0.000028505328,0.25578,0.0003193672,0.0001299998,0.00007152567,5.5960845e-7,0.0003122267,0.00629134],"genre_scores_gemma":[0.9947033,0.0000062950676,0.004210749,0.00041421806,0.000042714386,0.000006504907,6.2125343e-7,0.0000061951123,0.0006093932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991998,0.000012047155,0.00009166387,0.00027183778,0.00021526444,0.00020936363],"domain_scores_gemma":[0.9994854,0.000013021398,0.000037953407,0.00034567152,0.000053083724,0.000064886466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012120931,0.00010323225,0.00008304698,0.00005361709,0.0001427831,0.00011279772,0.00041595867,0.000027055627,0.0000043679356],"category_scores_gemma":[0.0000054601282,0.00007354872,0.00003035273,0.00016361436,0.000022289096,0.0008086232,0.00013315855,0.00014421127,0.00004250245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043272812,0.0011386739,0.12338008,0.00033561408,0.00046861483,0.0003519068,0.008796539,0.3009448,0.031574342,0.23649098,0.0010034422,0.29508227],"study_design_scores_gemma":[0.0026917602,0.0012279388,0.019621236,0.00015680426,0.000023211374,0.00020501405,0.00019689575,0.96929276,0.0051718936,0.0003097395,0.00043629357,0.00066644175],"about_ca_topic_score_codex":0.0004215928,"about_ca_topic_score_gemma":0.00008254695,"teacher_disagreement_score":0.66834795,"about_ca_system_score_codex":0.000063598134,"about_ca_system_score_gemma":0.0001270976,"threshold_uncertainty_score":0.29992297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036420333,0.0004114121,0.9815547,0.001348134,0.0005725122,0.00022715348,0.000010416155,0.0002625153,0.011971165],"genre_scores_gemma":[0.9292154,0.000081668346,0.069494955,0.00036971117,0.00035102482,0.00008515116,0.00021749434,0.000016463744,0.00016817723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824667,0.00017371816,0.00036803423,0.00055103365,0.0003728211,0.0002877367],"domain_scores_gemma":[0.99721104,0.00025501152,0.00026013382,0.0014547026,0.00059789617,0.00022119636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007337322,0.00022207838,0.0002045292,0.00017848065,0.00042586733,0.00047586183,0.00260306,0.000090003465,0.0000015395904],"category_scores_gemma":[0.000038170645,0.00022393613,0.000068988455,0.00019922257,0.00011406807,0.00018529933,0.00061598915,0.0002469739,0.000007094073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004082011,0.00070807495,0.0007919935,0.000006426062,0.00008741093,7.9653574e-7,0.0015657668,0.03667908,0.0002796382,0.6279423,0.002327481,0.3295702],"study_design_scores_gemma":[0.0005480185,0.00009665305,0.00013696976,0.000046550194,0.000010394971,0.000010770987,0.00027896956,0.9868931,0.000014529567,0.0021110717,0.009599472,0.0002534763],"about_ca_topic_score_codex":0.00020578802,"about_ca_topic_score_gemma":0.000025135645,"teacher_disagreement_score":0.950214,"about_ca_system_score_codex":0.00009838019,"about_ca_system_score_gemma":0.00012399988,"threshold_uncertainty_score":0.91318506},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3378841,0.00008754881,0.66033554,0.00008438084,0.00066390645,0.0001890037,0.0000011398229,0.00017589185,0.00057850423],"genre_scores_gemma":[0.97648144,0.0000054861425,0.021276155,0.0008584217,0.00008575076,0.000010091784,0.0000026888465,0.000008400165,0.0012715753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988966,0.000014081377,0.00023817278,0.0003280594,0.00018316868,0.00033993652],"domain_scores_gemma":[0.999196,0.00015940635,0.000060710965,0.00036111538,0.00010632336,0.00011643681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042154008,0.00010578737,0.00012544137,0.00007085944,0.00012338317,0.0001032923,0.0004288102,0.000046875222,0.0000030652666],"category_scores_gemma":[0.000031205418,0.00009162447,0.000116585616,0.000087725006,0.000020373322,0.00016874005,0.00011221077,0.00006145525,0.000022683013],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094342264,0.00022626754,0.0027844335,0.000019399613,0.00006310582,0.00008674151,0.0005892102,0.00008899308,0.063350126,0.011874636,0.00094186806,0.91988087],"study_design_scores_gemma":[0.0027596739,0.00042697447,0.0019497172,0.00007461714,0.00002269086,0.00016191148,0.00016107503,0.85663676,0.12747064,0.00053335074,0.009067707,0.00073490734],"about_ca_topic_score_codex":0.00008680446,"about_ca_topic_score_gemma":0.000041681953,"teacher_disagreement_score":0.91914594,"about_ca_system_score_codex":0.00004339279,"about_ca_system_score_gemma":0.00001537081,"threshold_uncertainty_score":0.3736337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28582376,0.00018948653,0.7081111,0.0046314253,0.00028291545,0.00038659363,0.000033961933,0.00016800851,0.00037272653],"genre_scores_gemma":[0.8985311,0.000006197802,0.097190484,0.0030053558,0.000039495855,0.000031420073,0.000059651044,0.000012799163,0.001123524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985728,0.00004352911,0.00030967384,0.00048767606,0.00020987159,0.00037641614],"domain_scores_gemma":[0.9990198,0.00019270727,0.000067024026,0.00054538005,0.00007908587,0.00009597495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033119068,0.00017239542,0.00019965538,0.0001660479,0.00008415967,0.00017362842,0.000628113,0.000033630386,0.00007727739],"category_scores_gemma":[0.000050150335,0.00015837915,0.00012203595,0.00019939753,0.000026147229,0.0008430998,0.00017122865,0.00012249834,0.00011006508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014412737,0.0035831693,0.041526165,0.0009627301,0.0004142002,0.00012519493,0.0023145138,0.402445,0.054822836,0.060666934,0.020191895,0.4115061],"study_design_scores_gemma":[0.0018916692,0.000040470626,0.0019562799,0.000099374665,0.0000055215974,0.0000032076473,0.000081898965,0.99345714,0.0006184426,0.000024330846,0.0015712943,0.00025039047],"about_ca_topic_score_codex":0.00046233906,"about_ca_topic_score_gemma":0.0026229965,"teacher_disagreement_score":0.6127073,"about_ca_system_score_codex":0.00013813708,"about_ca_system_score_gemma":0.00008411195,"threshold_uncertainty_score":0.6458514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030621238,0.00016166715,0.9635707,0.0036994123,0.00031991262,0.00007954543,1.6060122e-7,0.00006523699,0.0014821063],"genre_scores_gemma":[0.9867844,0.000014381609,0.0017079711,0.0006091929,0.000092869894,0.000015890339,3.3919338e-7,0.0000019031397,0.010773073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968636,0.0000116451865,0.00005530841,0.000115785064,0.000056627956,0.00007429944],"domain_scores_gemma":[0.9996615,0.00008177006,0.000012309282,0.0002090468,0.00002157192,0.000013821761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013908913,0.000034163135,0.00002926904,0.000013113406,0.000057217338,0.00011236636,0.00029173066,0.0000115397115,0.000014197058],"category_scores_gemma":[0.000015419386,0.000020243673,0.00003677014,0.00004295801,0.0000070354745,0.00010445212,0.000030059631,0.000025533576,0.000026999054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011021148,0.00006224834,0.00019783125,0.000002999995,0.000029760207,0.000004578374,0.0006756019,0.0008829924,0.012185418,0.29854238,0.05343207,0.6339731],"study_design_scores_gemma":[0.000072042276,0.00002288286,0.000065375054,0.0000016956941,0.0000028903182,0.000015596452,0.000013296618,0.97047776,0.00080648775,0.0002418291,0.028241523,0.000038599705],"about_ca_topic_score_codex":0.00006187865,"about_ca_topic_score_gemma":0.0000419183,"teacher_disagreement_score":0.9695948,"about_ca_system_score_codex":0.000007680761,"about_ca_system_score_gemma":0.000006253695,"threshold_uncertainty_score":0.108355135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024428263,0.00014567118,0.9904399,0.0007364827,0.0007055223,0.00023416356,0.0000055919413,0.00018666383,0.0051032067],"genre_scores_gemma":[0.8410873,0.000018676597,0.15110193,0.0007248956,0.00018657805,0.000023416806,0.00010853646,0.000013186748,0.006735469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912906,0.000026864333,0.00012994626,0.0003921614,0.00014811307,0.0001738711],"domain_scores_gemma":[0.9987358,0.000027705104,0.000039635674,0.0010742376,0.00004167379,0.00008095025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004153749,0.00008618345,0.00008561126,0.00005980452,0.00006671644,0.00019548101,0.001264743,0.000025167277,0.0000048537536],"category_scores_gemma":[0.000017605233,0.000079385456,0.000026611622,0.00011427794,0.000010324472,0.0006076987,0.00068169367,0.00003686077,0.000088869274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030140713,0.00014958574,0.00025746622,0.00004565943,0.00011010012,0.00001812886,0.00038383887,0.01974001,0.00005081003,0.28461292,0.24635491,0.44824645],"study_design_scores_gemma":[0.00048763317,0.000037188,0.00014529463,0.000013860443,0.000012312058,0.0000024718033,0.000046139303,0.9768775,0.000011100686,0.001550003,0.020685127,0.00013134626],"about_ca_topic_score_codex":0.000055083678,"about_ca_topic_score_gemma":0.000014337675,"teacher_disagreement_score":0.9571375,"about_ca_system_score_codex":0.00009149788,"about_ca_system_score_gemma":0.000041753465,"threshold_uncertainty_score":0.3237245},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5624493,0.000081195634,0.37506604,0.0006262625,0.00048958085,0.00004425626,0.0000024768908,0.00039419642,0.0608467],"genre_scores_gemma":[0.992638,0.0000041990625,0.0047751777,0.00021244938,0.00014377787,0.000002239019,0.000003352128,0.0000050771177,0.002215718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915653,0.000022156659,0.00013618436,0.00023869764,0.00023315761,0.00021324624],"domain_scores_gemma":[0.9995085,0.00004446909,0.000028339895,0.00032273965,0.000043391403,0.000052569554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001164343,0.00008965041,0.00009919385,0.00005742576,0.00006669822,0.0001441136,0.00047566617,0.000035671295,0.000025275704],"category_scores_gemma":[0.0000045264724,0.0000761013,0.000055968743,0.00015403274,0.000021257601,0.0002713697,0.00013378481,0.00007876425,0.0000806547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009457802,0.0002837849,0.009113716,0.00001900257,0.00002479064,0.00010999124,0.0010064014,0.00025894408,0.02402613,0.38521978,0.025626566,0.55430144],"study_design_scores_gemma":[0.0027768712,0.0002491862,0.12100758,0.0001411919,0.000043089847,0.0001476106,0.0009029076,0.7412147,0.07475189,0.033927117,0.022503,0.0023348413],"about_ca_topic_score_codex":0.0021243477,"about_ca_topic_score_gemma":0.00040629122,"teacher_disagreement_score":0.74095577,"about_ca_system_score_codex":0.000028542987,"about_ca_system_score_gemma":0.00003652058,"threshold_uncertainty_score":0.32113925},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14250676,0.00003562287,0.85089296,0.00065328873,0.00033846754,0.00009577146,3.248844e-7,0.00017376462,0.0053030606],"genre_scores_gemma":[0.9979128,0.0000061804167,0.0002503712,0.0011873232,0.00005816845,0.0000068602217,0.000011590619,0.0000029855948,0.0005637073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904853,0.00006766212,0.00024805535,0.00014703049,0.0002826624,0.00020604355],"domain_scores_gemma":[0.99938476,0.0000632688,0.00006003412,0.00029597472,0.00008457281,0.0001114116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004428924,0.000089379115,0.000096028474,0.00017712083,0.000044229695,0.00019021041,0.0004935564,0.000060959588,0.0000032758135],"category_scores_gemma":[0.000047425336,0.000082739694,0.000028030023,0.00050898956,0.000016068552,0.0013073758,0.00017326373,0.0001451947,0.00012359652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052793614,0.00012228613,0.0032157358,0.0000028733118,0.000013648696,0.000011043642,0.0036293434,0.19528762,0.000023586206,0.29853606,0.028122017,0.47098297],"study_design_scores_gemma":[0.0005856864,0.00008125676,0.0007614657,0.000010658314,0.0000012868256,0.0000067781443,0.0005254654,0.9916828,0.000015753949,0.00007691573,0.006121503,0.00013041032],"about_ca_topic_score_codex":0.00022940857,"about_ca_topic_score_gemma":0.000036884383,"teacher_disagreement_score":0.85540605,"about_ca_system_score_codex":0.00008828252,"about_ca_system_score_gemma":0.00007892357,"threshold_uncertainty_score":0.3374027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20678739,0.00009497608,0.7916242,0.00050127134,0.0005118715,0.00019910361,0.000023759363,0.00020204081,0.000055389653],"genre_scores_gemma":[0.8814758,0.0000076009005,0.11793716,0.000060413753,0.00009946775,0.000012189076,0.000009354346,0.000006803367,0.00039123083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990698,0.000018911282,0.00015854806,0.00031753152,0.00017910938,0.00025606592],"domain_scores_gemma":[0.99927026,0.00006547161,0.000047347632,0.00029110478,0.0002356755,0.000090161375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017209143,0.00012228423,0.00013484692,0.000043021635,0.00017710651,0.00019803138,0.00042601838,0.00005358874,0.0000024690119],"category_scores_gemma":[0.00007400037,0.000106813204,0.0000788479,0.00035864027,0.000021079471,0.00044408411,0.000116704694,0.00008676036,0.000016286725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026061302,0.0042732297,0.031492915,0.0002898886,0.0014010229,0.0005019948,0.014737832,0.25767678,0.3074897,0.33928928,0.009529752,0.030711481],"study_design_scores_gemma":[0.031822205,0.002448041,0.04097132,0.00037798606,0.000119648794,0.00006692906,0.0026645293,0.49685213,0.40906584,0.0034529755,0.009002894,0.003155489],"about_ca_topic_score_codex":0.00005306931,"about_ca_topic_score_gemma":0.0000068049662,"teacher_disagreement_score":0.6746884,"about_ca_system_score_codex":0.00010703261,"about_ca_system_score_gemma":0.000110166024,"threshold_uncertainty_score":0.4355716},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19720545,0.0000952589,0.798995,0.00014788788,0.0003799362,0.00011396633,0.0000011438184,0.0001498439,0.0029115041],"genre_scores_gemma":[0.99512476,0.000008239372,0.0043012756,0.00041110025,0.000017492173,0.0000042127576,0.000009145394,0.0000037850216,0.000119972676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989929,0.00006708908,0.0002435025,0.00017320368,0.00025082062,0.00027243662],"domain_scores_gemma":[0.99942625,0.000047931007,0.000074001706,0.0002788544,0.00006149348,0.000111447145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027908682,0.00011491941,0.00013165755,0.00022233726,0.00006658608,0.00020365533,0.0004428291,0.00006142389,0.000003022975],"category_scores_gemma":[0.000033885342,0.0001069737,0.00004492718,0.00040347563,0.000010819533,0.0018765647,0.0001890428,0.00025063113,0.000030043386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004373603,0.00015860779,0.07837084,0.000011100945,0.00004648447,0.00008048981,0.0048902533,0.7257137,0.000016097798,0.07589983,0.0015757793,0.11319311],"study_design_scores_gemma":[0.00049332716,0.000031408825,0.010492661,0.000021709919,0.000002462079,0.000007928266,0.00020221353,0.98809236,6.4476416e-7,0.00032740776,0.00018623237,0.00014164973],"about_ca_topic_score_codex":0.0023050169,"about_ca_topic_score_gemma":0.0006275304,"teacher_disagreement_score":0.79791933,"about_ca_system_score_codex":0.0002046193,"about_ca_system_score_gemma":0.00006123443,"threshold_uncertainty_score":0.43622607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146426745,0.000111654575,0.9316595,0.00041303836,0.0007021532,0.00013994171,8.2169873e-7,0.000469382,0.051860806],"genre_scores_gemma":[0.9873787,0.0000049544824,0.008443304,0.0038358483,0.00015597804,0.000008016703,0.000025047802,0.0000039065712,0.00014421012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990315,0.00008174626,0.0002029185,0.00016524568,0.0002918687,0.00022672527],"domain_scores_gemma":[0.99908006,0.000015024895,0.000068986235,0.0004151866,0.0002355905,0.00018515665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046200654,0.00010419743,0.000121142744,0.00009393916,0.00007651729,0.00040370272,0.0006778998,0.00005054316,0.0000033265942],"category_scores_gemma":[0.000014938989,0.000087410685,0.000034974695,0.0004729123,0.000007649821,0.00220098,0.00015027815,0.00009401986,0.00010001089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008153697,0.00026127623,0.0012017547,0.000042952535,0.000050299484,0.000006754124,0.014594705,0.0066497945,0.000094248244,0.1034743,0.021353384,0.852189],"study_design_scores_gemma":[0.00077366334,0.000045192737,0.00022766412,0.000005765919,0.0000042584406,0.00001664071,0.00056405657,0.9773807,0.000022259514,0.00027972207,0.020517541,0.00016252017],"about_ca_topic_score_codex":0.00068300933,"about_ca_topic_score_gemma":0.000013295518,"teacher_disagreement_score":0.97273606,"about_ca_system_score_codex":0.00005059735,"about_ca_system_score_gemma":0.00009882523,"threshold_uncertainty_score":0.38929147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25107747,0.0022946007,0.73731136,0.0011220807,0.00043553318,0.0014319726,0.0000045452784,0.00006523838,0.0062571936],"genre_scores_gemma":[0.9639173,0.00293161,0.032591328,0.000056271918,0.00005129767,0.00008503542,0.000068787434,0.000006144402,0.0002922271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982993,0.00023986121,0.00041378848,0.00051985297,0.00027634925,0.00025083835],"domain_scores_gemma":[0.99898046,0.00004668648,0.000076801094,0.00072197395,0.00011368445,0.00006041868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020560175,0.000143249,0.00025368822,0.00030520535,0.00018472587,0.00017627375,0.0004150967,0.000039940354,0.0000109235825],"category_scores_gemma":[0.0000028190107,0.00013308546,0.0000385419,0.0011883416,0.00003935752,0.0010759754,0.00025313563,0.00008654707,0.000001671949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013219512,0.00014463112,0.22303264,0.00006606402,0.00076865376,0.0000036831937,0.0005976257,0.108009,0.00034375052,0.006443865,0.00051401614,0.66006285],"study_design_scores_gemma":[0.00039747026,0.000027535018,0.10333352,0.000038824248,0.00038498722,0.0000018009644,0.00020609186,0.8950301,0.000007618359,0.000041279472,0.00039507932,0.00013570265],"about_ca_topic_score_codex":0.0002709712,"about_ca_topic_score_gemma":0.00016078578,"teacher_disagreement_score":0.7870211,"about_ca_system_score_codex":0.000025826395,"about_ca_system_score_gemma":0.000018257,"threshold_uncertainty_score":0.5427068},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014165958,0.00011387512,0.994215,0.0031622327,0.00019230782,0.0005022541,0.001216293,0.00027015895,0.00018620871],"genre_scores_gemma":[0.945989,0.00001130626,0.011576549,0.0031307163,0.00020037332,0.00024811504,0.03650745,0.000019200716,0.0023172938],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986817,0.000034196382,0.00021718713,0.00060096197,0.0002503365,0.00021560222],"domain_scores_gemma":[0.9956706,0.0001552622,0.000103287464,0.0027002287,0.0012412905,0.00012931698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057857984,0.000106587766,0.00013081025,0.00004147818,0.00013490117,0.00017523886,0.0028364968,0.000046634268,0.0000037959617],"category_scores_gemma":[0.00047990977,0.000097982105,0.000018904471,0.00029643707,0.000020638032,0.0006419297,0.0014602519,0.00007405889,0.00008411001],"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.000016609967,0.00018994532,0.00031861928,0.000014529604,0.0001300365,0.0000019490346,0.00011412695,0.0013671082,0.000041626063,0.011719764,0.9810228,0.0050629377],"study_design_scores_gemma":[0.0006572989,0.00004149687,0.00011595703,0.000012692542,0.000028487844,0.0000034190741,0.00047791924,0.93907887,0.000021916108,0.0005252071,0.05886815,0.00016861236],"about_ca_topic_score_codex":0.00029044348,"about_ca_topic_score_gemma":0.00015527495,"teacher_disagreement_score":0.9826385,"about_ca_system_score_codex":0.000094089744,"about_ca_system_score_gemma":0.0002593704,"threshold_uncertainty_score":0.5270964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4724484,0.0005778322,0.5255467,0.0002925863,0.000053098964,0.0009093411,0.000017047212,0.00008771611,0.00006724408],"genre_scores_gemma":[0.962617,0.0002644349,0.036510732,0.00020667382,0.000039415914,0.00022243327,0.000110783716,0.000021705719,0.000006868451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981328,0.00024009157,0.00037938624,0.0006842026,0.00015263508,0.0004108761],"domain_scores_gemma":[0.9968535,0.0002787704,0.00023356314,0.0023828151,0.0001270257,0.00012438328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090854964,0.00024713742,0.00032773998,0.0002049318,0.0005878778,0.0003195748,0.0025046756,0.00007666848,4.3988206e-7],"category_scores_gemma":[0.00001830117,0.00022724728,0.000033009463,0.00040130792,0.00012561437,0.0006394806,0.003395908,0.00028366907,3.6437407e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066997163,0.0014846167,0.05447195,0.00022988203,0.0003498533,0.000018490322,0.0061872373,0.031457372,0.00031877766,0.015352258,0.00030384422,0.88915575],"study_design_scores_gemma":[0.001620364,0.00030815275,0.0033471924,0.000250813,0.000025502271,0.0000134237725,0.00029756557,0.99353087,0.00007263475,0.00001870246,0.00022807374,0.0002866879],"about_ca_topic_score_codex":0.0009177552,"about_ca_topic_score_gemma":0.00018716963,"teacher_disagreement_score":0.9620735,"about_ca_system_score_codex":0.000073712006,"about_ca_system_score_gemma":0.00011267617,"threshold_uncertainty_score":0.9266875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91282606,0.0006549973,0.063857965,0.000053474836,0.0068343338,0.00062210084,0.000015193398,0.0004181612,0.01471771],"genre_scores_gemma":[0.91455954,0.000041022817,0.017690951,0.00034980348,0.0002484749,0.00004212789,0.00022342267,0.000038804916,0.066805854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986926,0.00001664081,0.00026945127,0.0004931605,0.00021743943,0.00031071893],"domain_scores_gemma":[0.99914813,0.00004915704,0.0001503635,0.00042712808,0.00016447187,0.000060778846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014404007,0.0002522483,0.00024623136,0.00014447309,0.00022892733,0.00022939565,0.0005906137,0.00023728571,0.00002729226],"category_scores_gemma":[0.000035711448,0.00022315922,0.00014655427,0.0001304229,0.0000050139856,0.00032823914,0.000029097191,0.00028276784,0.000012388877],"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.00006694678,0.000054063177,0.00018837005,0.0019299823,0.00012336666,0.0000055015457,0.0013406886,0.00011979719,0.44138104,0.020879606,0.0022942543,0.5316164],"study_design_scores_gemma":[0.0027702774,0.00082616956,0.00077729474,0.0007241626,0.00026599446,0.00008194936,0.0020094486,0.6074907,0.36274436,0.0015973479,0.016944412,0.0037678725],"about_ca_topic_score_codex":0.000026747734,"about_ca_topic_score_gemma":0.00026691536,"teacher_disagreement_score":0.6073709,"about_ca_system_score_codex":0.000053530322,"about_ca_system_score_gemma":0.0002679449,"threshold_uncertainty_score":0.9100169},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071612224,0.009932255,0.89589,0.008240165,0.012353246,0.00074267207,0.0000025535276,0.00010516419,0.0011217347],"genre_scores_gemma":[0.9913185,0.0017980114,0.004154087,0.0009579629,0.0011009434,0.0000056744902,0.000010542009,0.000011588717,0.0006426798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980516,0.00010950702,0.00057222525,0.00031724875,0.000669352,0.00028009372],"domain_scores_gemma":[0.99856675,0.00011998798,0.0005577401,0.00035525634,0.00028615666,0.00011409493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056751334,0.00015579176,0.00021031094,0.00028423115,0.0001594431,0.0009506307,0.0016190544,0.000038409013,0.00001621861],"category_scores_gemma":[0.00002290256,0.00013544918,0.00007310034,0.0003442022,0.000028410837,0.0015744009,0.0009879696,0.00020673788,0.000019225148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000970787,0.00015905566,0.01178405,0.00001838118,0.0006544223,0.0002870711,0.00018814162,0.0032349734,0.00003551838,0.0085444385,0.0809222,0.8940747],"study_design_scores_gemma":[0.0039018833,0.00022689454,0.037884478,0.0010724439,0.0001457434,0.000683561,0.0003538209,0.8082714,0.000009543252,0.0068229064,0.14009064,0.00053667475],"about_ca_topic_score_codex":0.00009597553,"about_ca_topic_score_gemma":0.000008028921,"teacher_disagreement_score":0.9197063,"about_ca_system_score_codex":0.00014577278,"about_ca_system_score_gemma":0.000031467564,"threshold_uncertainty_score":0.9166954},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95665956,0.0002313137,0.034216553,0.0008621683,0.0004595154,0.00010107461,2.1665016e-7,0.00018772915,0.007281883],"genre_scores_gemma":[0.99445826,0.0000041650674,0.0024395823,0.00086869055,0.000030632094,0.00000539587,6.798598e-7,0.000003986914,0.0021885925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909973,0.000051568153,0.00016788175,0.00024573522,0.00023512007,0.00019997553],"domain_scores_gemma":[0.99940586,0.000033789274,0.000029168206,0.00032513906,0.00009558173,0.00011048375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004105166,0.00008319583,0.00010751182,0.000079673635,0.000029624829,0.000117488074,0.00045865614,0.00003476855,0.000005519247],"category_scores_gemma":[0.000042992968,0.00006795119,0.00004182902,0.00019330312,0.0000118108055,0.00047110335,0.0002649812,0.00010863068,0.0001241859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019787428,0.000950102,0.2202326,0.000046774945,0.000084695406,0.0009070521,0.008181933,0.005040421,0.009313687,0.4218044,0.034808807,0.29843166],"study_design_scores_gemma":[0.0058608647,0.00064458017,0.0383247,0.00023115952,0.000011036522,0.00012203069,0.0020244275,0.9322416,0.0027246329,0.006679579,0.009919401,0.001215994],"about_ca_topic_score_codex":0.0012017739,"about_ca_topic_score_gemma":0.00014822694,"teacher_disagreement_score":0.92720115,"about_ca_system_score_codex":0.00006784305,"about_ca_system_score_gemma":0.00008081918,"threshold_uncertainty_score":0.2770969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3506667,0.0011680891,0.64656425,0.0005561252,0.00045065634,0.00002966569,2.7499533e-7,0.000017335762,0.0005469271],"genre_scores_gemma":[0.9989573,0.00041670154,0.0003832153,0.00010443572,0.000088733876,0.000003154641,0.0000013710072,0.000005616424,0.000039516264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867684,0.00027934884,0.00044399773,0.00010379644,0.00039435024,0.00010168834],"domain_scores_gemma":[0.9985895,0.00026853217,0.0004123106,0.00029880082,0.0003762534,0.00005460721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009871048,0.00008384858,0.00017267768,0.00025692553,0.00006450909,0.00033339896,0.0013070499,0.000039936902,5.247473e-7],"category_scores_gemma":[0.0000195732,0.00006832563,0.00003819036,0.00015443977,0.000042931075,0.00044778024,0.00012214255,0.00018622179,5.895812e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018400548,0.00032892905,0.0100704925,0.000009337814,0.00027154988,0.00006192024,0.002409259,0.38491026,0.0005114361,0.46088326,0.00046367993,0.1398959],"study_design_scores_gemma":[0.0006196006,0.00008012279,0.00062690733,0.00031633224,0.0000043423956,0.00039869198,0.000091366106,0.99622875,0.000009112893,0.000065083346,0.0014720393,0.00008762082],"about_ca_topic_score_codex":0.000121285215,"about_ca_topic_score_gemma":0.00005328865,"teacher_disagreement_score":0.6482906,"about_ca_system_score_codex":0.00007756387,"about_ca_system_score_gemma":0.00004469159,"threshold_uncertainty_score":0.32149738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062223324,0.0005857053,0.99071985,0.0007207706,0.0004545996,0.0003406271,0.0000026673176,0.000095656396,0.000857758],"genre_scores_gemma":[0.9045986,0.000082615355,0.09353278,0.001296894,0.00028246237,0.0000038866997,7.534631e-7,0.000022535176,0.0001794726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967914,0.000065646105,0.00034211105,0.0013118343,0.0009295892,0.0005593954],"domain_scores_gemma":[0.9977427,0.0005002643,0.00017457156,0.0012805592,0.00015642575,0.00014546883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012703872,0.00041537755,0.0003424055,0.0003637268,0.0005245091,0.0007912675,0.002631794,0.00013888856,0.00000968123],"category_scores_gemma":[0.00004920628,0.00027519383,0.00007581048,0.00042531107,0.0010488324,0.00058079313,0.0016086859,0.0010234679,0.000008347931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010650508,0.000028195034,0.000255143,0.000029932997,0.00001753846,0.00007325964,0.0012417429,0.09312539,0.00017522185,0.006329687,0.0000053485523,0.89870787],"study_design_scores_gemma":[0.00008872266,0.00009304579,0.00016470453,0.00033717058,0.000008563749,0.00018014568,6.791843e-7,0.98546726,0.00014491199,0.0128302965,0.00030541507,0.00037910423],"about_ca_topic_score_codex":0.00013378095,"about_ca_topic_score_gemma":0.0002740075,"teacher_disagreement_score":0.8983763,"about_ca_system_score_codex":0.00022611169,"about_ca_system_score_gemma":0.00045855425,"threshold_uncertainty_score":0.99997},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29738143,0.00028889938,0.6939218,0.0030336217,0.0013302739,0.00025782714,8.2150973e-7,0.0002736814,0.0035116381],"genre_scores_gemma":[0.98068976,0.0000037675916,0.0013102775,0.017454153,0.0003349327,0.000045831926,0.0000043284135,0.000013373919,0.00014357262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979267,0.00036707826,0.00028943768,0.00044419305,0.0005276091,0.00044495103],"domain_scores_gemma":[0.99810517,0.0006103559,0.00007687597,0.00096598984,0.00008535537,0.0001562279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015969952,0.00021257048,0.0002022587,0.00010673308,0.00019157722,0.00041081815,0.0018963628,0.00015334657,0.000012702255],"category_scores_gemma":[0.00012482415,0.0001487435,0.0000929835,0.00070483383,0.000028913384,0.00035360325,0.0002702269,0.0008543574,0.0001230587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034239518,0.0001803941,0.0020077627,0.000004705004,0.000012531658,0.00008180736,0.0035216045,0.9075973,0.000024976687,0.07462771,0.0032084538,0.008698513],"study_design_scores_gemma":[0.0005454408,0.00023120838,0.00029204463,0.00005924936,0.0000066459415,0.000023893464,0.0011453101,0.99146676,0.000014448234,0.0029602873,0.0029667395,0.00028799172],"about_ca_topic_score_codex":0.003730683,"about_ca_topic_score_gemma":0.00050168514,"teacher_disagreement_score":0.6926115,"about_ca_system_score_codex":0.000084562074,"about_ca_system_score_gemma":0.00016960563,"threshold_uncertainty_score":0.6065584},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96417713,0.000057368536,0.018732594,0.008620396,0.0016639881,0.0013185504,0.0000019087233,0.0001609609,0.005267078],"genre_scores_gemma":[0.9957272,0.00001661068,0.0007693325,0.00062574213,0.00015535482,0.000045720317,3.899057e-7,0.000008840179,0.0026508498],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991817,0.000007914201,0.00014764484,0.00025893206,0.0001656972,0.00023810376],"domain_scores_gemma":[0.99907714,0.00021527836,0.00011039424,0.00035920957,0.00017849098,0.000059488964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013149666,0.000113649294,0.00012555973,0.000053591208,0.00014612234,0.0003456459,0.0022987768,0.00005243635,0.000012537834],"category_scores_gemma":[0.000034555702,0.000076684824,0.00009945438,0.00024314337,0.000040602074,0.00067787856,0.0006999645,0.00009334121,0.000016056243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011038985,0.00046992785,0.036734466,0.0001052149,0.00015547816,0.000002184254,0.0013414008,0.0017736325,0.0075650397,0.13163398,0.5963466,0.22376171],"study_design_scores_gemma":[0.0038709308,0.00051996467,0.06059757,0.0012358343,0.000098840086,0.000025187217,0.0020831346,0.82115805,0.011445094,0.014997157,0.0822482,0.0017200264],"about_ca_topic_score_codex":0.00022503588,"about_ca_topic_score_gemma":0.000026245682,"teacher_disagreement_score":0.81938446,"about_ca_system_score_codex":0.00004621638,"about_ca_system_score_gemma":0.000028822762,"threshold_uncertainty_score":0.42717373},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011619088,0.000084327665,0.9752264,0.0022834428,0.00013185381,0.00027668348,0.0000019087727,0.00027889974,0.020554556],"genre_scores_gemma":[0.9557762,0.000004152545,0.034440026,0.0010842418,0.00021316097,0.000544323,0.000012976361,0.0000066212033,0.007918312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99946266,0.000009482337,0.000092600196,0.00025656208,0.00008228521,0.00009638019],"domain_scores_gemma":[0.9989672,0.00003819933,0.000029288152,0.0007450086,0.00014382826,0.000076494944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024141578,0.000045053082,0.00004937087,0.000036181475,0.000060644546,0.00007051649,0.0004087592,0.000022851314,0.0000013390585],"category_scores_gemma":[0.000035542227,0.000040277337,0.00003571205,0.00012940173,0.000009252974,0.00017772653,0.00006663154,0.000027761651,0.00012274986],"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.0000045759384,0.000070616705,0.00023583547,0.000005926072,0.000007715082,1.705467e-7,0.00009827402,0.000032824835,0.0043995017,0.7110776,0.13281502,0.15125197],"study_design_scores_gemma":[0.000515554,0.000067768226,0.00021499465,0.0000035821295,0.0000062585736,0.000008856131,0.000046323858,0.21329121,0.0013402296,0.01998133,0.76434743,0.00017647157],"about_ca_topic_score_codex":0.000013702978,"about_ca_topic_score_gemma":0.0000045776164,"teacher_disagreement_score":0.9546143,"about_ca_system_score_codex":0.000025830237,"about_ca_system_score_gemma":0.000070195165,"threshold_uncertainty_score":0.16424622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2979072,0.0027564943,0.6648486,0.00033010705,0.003670297,0.00058382814,0.000014198157,0.00013928536,0.02974996],"genre_scores_gemma":[0.9994297,0.00009549006,0.00018259231,0.00015834617,0.000006474648,0.0000111677855,0.0000010728102,0.0000015403934,0.000113604416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926686,0.00011443327,0.00025364474,0.00006135898,0.00021497475,0.00008871887],"domain_scores_gemma":[0.9994174,0.00007545789,0.0001557125,0.00024003102,0.00008374641,0.00002763977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005506331,0.00006654468,0.00012935598,0.000101031656,0.000082646846,0.00014413132,0.00020182542,0.00003028896,4.175459e-7],"category_scores_gemma":[0.000044962406,0.000043587715,0.00003702572,0.00010990429,0.000054921155,0.0008969954,0.000025966727,0.000054530265,0.000009942306],"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.00009394823,0.000020321688,0.0014020107,0.0001581866,0.00010255264,0.0000014745232,0.0052443705,0.0041146744,0.00006926936,0.92112887,0.04427473,0.023389574],"study_design_scores_gemma":[0.009683778,0.00024166897,0.0012240935,0.00037646928,0.000046258054,0.0001033356,0.014026904,0.8034047,0.0006496212,0.002568416,0.166941,0.0007337897],"about_ca_topic_score_codex":0.000044045977,"about_ca_topic_score_gemma":6.315326e-7,"teacher_disagreement_score":0.91856045,"about_ca_system_score_codex":0.000018815306,"about_ca_system_score_gemma":0.000037302172,"threshold_uncertainty_score":0.17774555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017466643,0.00039736822,0.9929461,0.00034785003,0.0012322452,0.0002589195,0.0000014303881,0.0001492379,0.0029202236],"genre_scores_gemma":[0.89726645,0.0001558002,0.091999106,0.007397982,0.0010809386,0.000011617309,0.0000052087858,0.000060789946,0.0020221148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687606,0.000027779257,0.00035579325,0.0013366494,0.0008842674,0.00051942974],"domain_scores_gemma":[0.9984884,0.00034496025,0.00015850004,0.0006984225,0.00014445398,0.00016526533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010942797,0.0004220426,0.0003492915,0.00077998097,0.00028928192,0.0005010839,0.0011814105,0.00024450052,0.000014219253],"category_scores_gemma":[0.000037551847,0.00038145986,0.00008479782,0.0003635182,0.00023092129,0.0004017793,0.0007078962,0.00071862864,0.000034711215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048179947,0.000067690984,0.00034409369,0.00006917062,0.00003729611,0.00015571523,0.0009146775,0.059007447,0.00046420316,0.047506064,0.0001596804,0.89122576],"study_design_scores_gemma":[0.000843099,0.00084706943,0.00054638536,0.00080273056,0.000018944584,0.00025512435,3.72078e-7,0.9302556,0.0017027782,0.06037304,0.003039155,0.0013157254],"about_ca_topic_score_codex":0.00003308962,"about_ca_topic_score_gemma":0.00014249643,"teacher_disagreement_score":0.900947,"about_ca_system_score_codex":0.00026523008,"about_ca_system_score_gemma":0.00018248905,"threshold_uncertainty_score":0.99986374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6501778,0.00009960769,0.34337202,0.0006791348,0.000130637,0.00005524906,0.0000049677587,0.0000458192,0.005434781],"genre_scores_gemma":[0.9966696,0.000019173478,0.0022058957,0.00090501655,0.000033635315,1.481383e-7,0.0000021452813,0.000004868825,0.00015953161],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99730474,0.0005672511,0.0009195744,0.000012171391,0.0008411952,0.00035508035],"domain_scores_gemma":[0.99583334,0.0016362027,0.0006825594,0.0008914838,0.00079527876,0.00016111403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009864227,0.00017183447,0.00030141894,0.00020761977,0.00085697474,0.00034042812,0.0030131247,0.000057176054,0.000005232629],"category_scores_gemma":[0.00021185566,0.0001046743,0.00009463014,0.00032511103,0.00026284507,0.001424055,0.0006718123,0.0018644469,0.000011040421],"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.00026866476,0.00033258152,0.0026617232,0.00022688754,0.0003708694,0.000008502846,0.89754975,0.007371983,0.000053008356,0.01539693,0.008438877,0.06732024],"study_design_scores_gemma":[0.002145423,0.0017270031,0.002196989,0.00025218277,0.000056871893,0.0030063144,0.9109876,0.032005858,0.00016709963,0.0030354967,0.043892354,0.00052681065],"about_ca_topic_score_codex":0.00025652384,"about_ca_topic_score_gemma":0.00013723555,"teacher_disagreement_score":0.34649178,"about_ca_system_score_codex":0.000119609394,"about_ca_system_score_gemma":0.00020513686,"threshold_uncertainty_score":0.8100198},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98145825,0.000024588508,0.00028704279,0.0044457344,0.0028734473,0.00010868868,0.0000023090954,0.000020276057,0.010779691],"genre_scores_gemma":[0.9994026,0.000013476623,0.000071239185,0.000048576545,0.00026429544,0.0000057625725,0.0000012428808,0.0000046500218,0.00018819183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987115,0.000020183452,0.00025378304,0.00020457484,0.00067985954,0.00013005889],"domain_scores_gemma":[0.9990703,0.00007966572,0.00011974611,0.00008262625,0.00062637887,0.000021285374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041301132,0.00007482827,0.000130985,0.00006704741,0.00007001052,0.000087677596,0.0010223847,0.000059998172,0.0000048162697],"category_scores_gemma":[0.00007430929,0.00006435417,0.00009996839,0.0003622435,0.0000386771,0.00022151486,0.0004322591,0.0002033356,0.0000015562188],"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.00009552395,0.0002789749,0.011293905,0.000016254446,0.000035010653,0.0000013796645,0.0004271712,0.0015987073,0.089402325,0.89541084,0.0008128915,0.0006270363],"study_design_scores_gemma":[0.004872672,0.0004857195,0.05210719,0.0005412674,0.000025050864,0.000028787292,0.00034426808,0.45240068,0.44994837,0.037181996,0.001493084,0.0005709234],"about_ca_topic_score_codex":0.00010381798,"about_ca_topic_score_gemma":0.000005328767,"teacher_disagreement_score":0.8582288,"about_ca_system_score_codex":0.000102254766,"about_ca_system_score_gemma":0.000060236827,"threshold_uncertainty_score":0.2624287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861715,0.00009107898,0.1110139,0.000124872,0.0013959223,0.00044726953,0.0000072167622,0.00013624602,0.00061196444],"genre_scores_gemma":[0.99907327,0.000022504659,0.000058405218,0.00024391458,0.00019127337,0.000020702193,0.000007082606,0.000025217254,0.00035765808],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9976139,0.00011081999,0.0006546629,0.0008240589,0.00044363848,0.00035290094],"domain_scores_gemma":[0.99757344,0.00020988465,0.000281519,0.0016896682,0.00013637728,0.00010912958],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012138119,0.00033799623,0.00046146,0.00020128138,0.000152408,0.00028086104,0.0020060132,0.00016843618,0.0000119560855],"category_scores_gemma":[0.00011872347,0.00026532632,0.00022353856,0.0002136987,0.000090480775,0.00016089588,0.003744331,0.0009799623,0.00002894091],"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.000035727968,0.00036901413,0.9738853,0.000082703395,0.00037817395,0.005451534,0.014985743,0.00006326819,0.00010912494,0.0022140678,0.00015818852,0.0022671747],"study_design_scores_gemma":[0.0034064802,0.0029251305,0.6578046,0.0033818774,0.0016562659,0.010790196,0.075539514,0.22942063,0.001165578,0.007440027,0.00073827204,0.005731439],"about_ca_topic_score_codex":0.0024584609,"about_ca_topic_score_gemma":0.00019890018,"teacher_disagreement_score":0.3160807,"about_ca_system_score_codex":0.0002375177,"about_ca_system_score_gemma":0.00010660787,"threshold_uncertainty_score":0.9999799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004510305,0.0029541831,0.98603904,0.00023245918,0.0034284915,0.00042270476,0.0000038257376,0.00023916936,0.002169836],"genre_scores_gemma":[0.9050057,0.0027367536,0.04335185,0.0055208374,0.0036381783,0.00020415595,0.00017320763,0.00022013391,0.039149176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948775,0.00013089823,0.0008496766,0.0018912798,0.0011216839,0.0011289672],"domain_scores_gemma":[0.99725914,0.00022702398,0.00035257006,0.0016630617,0.00024857887,0.00024961465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029862402,0.00053351145,0.00070938334,0.00068724965,0.00025174965,0.00086090167,0.0040572938,0.00032238875,0.0000039058255],"category_scores_gemma":[0.000083585204,0.000556235,0.00020601602,0.001169988,0.00045045602,0.000902959,0.0021948337,0.0012635634,0.000040807186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033781653,0.00022586517,0.0010868236,0.00015735735,0.000032300668,0.00078685605,0.0006318272,0.117637895,0.00022987682,0.072522074,0.0023246154,0.8043307],"study_design_scores_gemma":[0.0006074295,0.00012997758,0.002543256,0.0010750598,0.0000062742233,0.000038696548,0.0000020363188,0.96578926,0.000037830898,0.0014753959,0.027499618,0.0007951708],"about_ca_topic_score_codex":0.00006336839,"about_ca_topic_score_gemma":0.00014552932,"teacher_disagreement_score":0.94268715,"about_ca_system_score_codex":0.0012969344,"about_ca_system_score_gemma":0.00075328693,"threshold_uncertainty_score":0.9996889},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044061158,0.0005353508,0.91463715,0.0021883259,0.0018466326,0.00020335599,0.0000026356297,0.00013681833,0.036388583],"genre_scores_gemma":[0.9969754,0.000049756934,0.00083950744,0.0005751069,0.00012839587,0.000009744353,0.000001985039,0.000007085084,0.0014130147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989226,0.00009282768,0.00019952458,0.00036478118,0.00024428824,0.00017599888],"domain_scores_gemma":[0.99744564,0.0002856932,0.00022856027,0.001923425,0.00007667213,0.000040015217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064933306,0.00015701631,0.00021278857,0.000040203373,0.00018626278,0.00029634335,0.0025407646,0.00015583128,0.000012196492],"category_scores_gemma":[0.000070763854,0.00009492721,0.00019362886,0.000031013187,0.0000527236,0.000056897192,0.0017553341,0.00063063187,0.000016500024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023311115,0.0001295953,0.00040537847,0.000055591183,0.0002442185,0.00004237554,0.000679351,0.2637884,0.000078135,0.6136403,0.02355197,0.097361356],"study_design_scores_gemma":[0.000067382585,0.000017681095,0.00012229149,0.00019522074,0.0000117249065,0.000003533502,0.000008806691,0.98864037,0.00008357486,0.010296685,0.00039372128,0.00015898189],"about_ca_topic_score_codex":0.0006515441,"about_ca_topic_score_gemma":0.000031265005,"teacher_disagreement_score":0.95291424,"about_ca_system_score_codex":0.000021436203,"about_ca_system_score_gemma":0.00006069727,"threshold_uncertainty_score":0.4721415},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011545242,0.0004051457,0.992319,0.001490403,0.0015400294,0.00051043957,0.0000051075363,0.00018195051,0.003536391],"genre_scores_gemma":[0.03506151,0.000109575645,0.95374507,0.008316097,0.00067554926,0.000044383767,0.000010621413,0.00004977955,0.0019874412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971849,0.000016208729,0.00032087948,0.0012585247,0.0007290017,0.0004904947],"domain_scores_gemma":[0.998103,0.00032907748,0.00018227566,0.0010331897,0.00024387313,0.0001085879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004296164,0.00038082484,0.00032288823,0.00054543576,0.0002713134,0.0005288982,0.0024582807,0.00024699658,0.000019916579],"category_scores_gemma":[0.00003295424,0.00037223662,0.00014005658,0.0005369717,0.0001235116,0.00036940785,0.00075173425,0.0004204998,0.000049805283],"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.00000597514,0.000029043844,0.000009766985,0.00015364314,0.000022861552,0.000052360567,0.00086041656,0.010423601,0.000012512783,0.4480907,0.00006706775,0.54027206],"study_design_scores_gemma":[0.0001752687,0.000067298504,0.00001825183,0.000572263,0.000012000748,0.000020810397,2.2159126e-7,0.6497643,0.00002508628,0.34675413,0.0021769207,0.00041343117],"about_ca_topic_score_codex":0.000011151022,"about_ca_topic_score_gemma":0.000015364554,"teacher_disagreement_score":0.6393407,"about_ca_system_score_codex":0.00022150225,"about_ca_system_score_gemma":0.00007958798,"threshold_uncertainty_score":0.999873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05126651,0.0007372993,0.9410695,0.0007439713,0.0033617674,0.0008721962,0.0000023031819,0.00011801299,0.0018284817],"genre_scores_gemma":[0.9890946,0.000016149143,0.0078069707,0.00083202205,0.0005391913,0.00001872447,0.0000023270807,0.000021046906,0.0016689338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688786,0.000077248886,0.00049076555,0.0011087536,0.001027892,0.0004074761],"domain_scores_gemma":[0.9975187,0.00032791696,0.00032052255,0.0015120289,0.00023479109,0.00008602746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007217502,0.00038728255,0.00040826286,0.00038394606,0.00039793178,0.0006423224,0.0027542284,0.000165632,0.00006341969],"category_scores_gemma":[0.000032116433,0.00027011032,0.00012264907,0.00041043322,0.00029974905,0.00064672896,0.0016523239,0.00053277024,0.00006396451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016961329,0.00029567123,0.00037853676,0.00005121739,0.00010550392,0.00009402403,0.008733998,0.10991296,0.015188329,0.013862167,0.00081177586,0.85054886],"study_design_scores_gemma":[0.0007094652,0.0006747462,0.00033276452,0.00026530438,0.000034816014,0.000043886397,0.0000033358058,0.98633784,0.0017203634,0.008141516,0.0009193153,0.000816642],"about_ca_topic_score_codex":0.0002527905,"about_ca_topic_score_gemma":0.00036332678,"teacher_disagreement_score":0.9378281,"about_ca_system_score_codex":0.0002232268,"about_ca_system_score_gemma":0.00015201853,"threshold_uncertainty_score":0.9999751},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009313149,0.00059796043,0.98031414,0.0012195068,0.002246271,0.00037588304,0.0000053416666,0.0002655921,0.00566215],"genre_scores_gemma":[0.8794521,0.000083812534,0.11469806,0.0040088687,0.00074885937,0.000011494243,0.000002405402,0.000053928416,0.0009404514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957326,0.00004630097,0.00052247127,0.0020082626,0.00085314986,0.00083723455],"domain_scores_gemma":[0.99753195,0.00049780344,0.00022689204,0.0012623341,0.00014354725,0.00033749634],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011306556,0.0006054173,0.00057906203,0.001042762,0.00044640814,0.0011098362,0.0026057588,0.00027766253,0.0000075928756],"category_scores_gemma":[0.00012864624,0.00057216786,0.00012271857,0.0004997242,0.0002621636,0.00074502,0.0024558988,0.0009963814,0.000025517333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090332505,0.0000179971,0.0001873165,0.000037391514,0.00001618355,0.00019344117,0.0016681013,0.017043998,0.0037152697,0.004329857,0.000050779232,0.97273064],"study_design_scores_gemma":[0.00045365692,0.000312046,0.000074011696,0.0009140673,0.000016012675,0.0002752631,0.00000120285,0.9748373,0.00028871992,0.017922414,0.0037089807,0.0011963459],"about_ca_topic_score_codex":0.000087814486,"about_ca_topic_score_gemma":0.0002796469,"teacher_disagreement_score":0.9715343,"about_ca_system_score_codex":0.0002594976,"about_ca_system_score_gemma":0.00047586416,"threshold_uncertainty_score":0.9999271},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5296874,0.00002438258,0.4692268,0.0000716984,0.00025935905,0.00012331965,9.226893e-7,0.00003362885,0.0005724461],"genre_scores_gemma":[0.98396575,8.4212087e-7,0.0155006675,0.00006316428,0.000034403572,0.000015728332,0.000005327451,0.0000030923816,0.0004110417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992521,0.000039443974,0.00014895281,0.0001540925,0.00031557088,0.00008983062],"domain_scores_gemma":[0.9991153,0.000033505767,0.00007655609,0.00020946955,0.0005279466,0.000037242917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091788545,0.00005068585,0.00006692582,0.00007885471,0.00006639665,0.00004177582,0.0001314462,0.00002241138,0.0000034478996],"category_scores_gemma":[0.000086813336,0.00004685001,0.000040942705,0.00014290954,0.000012680973,0.0004685202,0.00003345528,0.000023577031,0.0000047294193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000948772,0.00021799734,0.00495289,0.00005318501,0.00009439696,5.7306175e-7,0.0029360994,0.3320354,0.015295607,0.003472373,0.006191626,0.634655],"study_design_scores_gemma":[0.0005711806,0.00009591187,0.000544902,0.0000168921,0.000033328015,0.000004414071,0.00012280369,0.9973096,0.00081702485,0.00033891827,0.00008523267,0.000059791633],"about_ca_topic_score_codex":0.000075263226,"about_ca_topic_score_gemma":0.00001039365,"teacher_disagreement_score":0.6652742,"about_ca_system_score_codex":0.000062869185,"about_ca_system_score_gemma":0.00015581286,"threshold_uncertainty_score":0.1910488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21113911,0.0000085372585,0.7866589,0.00028431567,0.0005453148,0.000098467004,0.000007961361,0.00016453602,0.0010928782],"genre_scores_gemma":[0.9913291,0.0000014429639,0.007896271,0.0004018717,0.000096334064,0.0000035805365,0.000010436797,0.000005784426,0.00025522872],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895746,0.000038833197,0.00022858626,0.00024287419,0.00038249142,0.00014977917],"domain_scores_gemma":[0.9991719,0.000032284264,0.000050514853,0.00032918883,0.00025808753,0.00015800375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016673427,0.00009598797,0.00013063883,0.000082004044,0.00004235219,0.00006157899,0.00040402074,0.000051018586,0.000006078746],"category_scores_gemma":[0.000015406853,0.00008193108,0.000041665844,0.00018122686,0.000014061845,0.000378956,0.00013728056,0.000063238054,0.000034024553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002902687,0.0007155071,0.020186914,0.00012394779,0.00014625785,0.000007757461,0.007842117,0.27699304,0.6066342,0.059861768,0.003700746,0.023497451],"study_design_scores_gemma":[0.00032522433,0.00013315273,0.0011098243,0.000014231076,0.000009103786,0.0000020593145,0.000039075887,0.9934393,0.0038299062,0.0009100983,0.00009731353,0.000090667614],"about_ca_topic_score_codex":0.00024402447,"about_ca_topic_score_gemma":0.000023119153,"teacher_disagreement_score":0.78018993,"about_ca_system_score_codex":0.000040036495,"about_ca_system_score_gemma":0.00005219123,"threshold_uncertainty_score":0.33410525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21915978,0.0038288776,0.7762544,0.00010105923,0.00007418999,0.0003726902,0.000004658876,0.00011361898,0.00009071585],"genre_scores_gemma":[0.9716127,0.00013004606,0.027927017,0.000054760807,0.000045155935,0.00008446634,0.00012475859,0.000013536826,0.000007556203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985495,0.00022063419,0.00036461873,0.00037454182,0.00013595246,0.00035474866],"domain_scores_gemma":[0.99806356,0.00035180015,0.00014585949,0.0011766801,0.00012657151,0.00013551748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008912685,0.00016709353,0.00025823532,0.00013315195,0.0004301893,0.0002449357,0.0012086076,0.000080450875,9.246625e-8],"category_scores_gemma":[0.00003957841,0.00017324188,0.000070373826,0.0004688689,0.000060314193,0.00022123821,0.0011229105,0.0003182054,4.409458e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015316311,0.00056163804,0.008903954,0.0000689205,0.000056045043,0.000008701212,0.0031201644,0.6622408,0.0006108043,0.023556685,0.00013901279,0.30071795],"study_design_scores_gemma":[0.0006616509,0.000043809447,0.00022907266,0.00007158908,0.000009911733,0.000009738655,0.0005375293,0.9972838,0.000018254812,0.00010480822,0.0008311905,0.00019861525],"about_ca_topic_score_codex":0.0002800494,"about_ca_topic_score_gemma":0.000018771665,"teacher_disagreement_score":0.7524529,"about_ca_system_score_codex":0.00009893646,"about_ca_system_score_gemma":0.00007063909,"threshold_uncertainty_score":0.7064598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117677316,0.00016039521,0.8778923,0.00043611001,0.0005122159,0.00010351636,0.0000016960224,0.00029568936,0.002920719],"genre_scores_gemma":[0.9907324,0.000013384108,0.007380749,0.0012060106,0.0000615132,0.000028612396,0.0000040231553,0.000009336044,0.0005639743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987086,0.00007829162,0.00023503107,0.00038162104,0.00021804533,0.00037843265],"domain_scores_gemma":[0.9990447,0.00022130058,0.00006736549,0.0004178045,0.0001333158,0.000115520605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539897,0.00015798565,0.00018791684,0.000080883256,0.00020861035,0.00038405534,0.0006019772,0.000047428824,0.0000074576506],"category_scores_gemma":[0.00003744699,0.00012959681,0.00016064756,0.0001000886,0.000025657817,0.0002760702,0.0001290153,0.00006649128,0.000009662355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024323666,0.00008125699,0.00013376308,0.000010207587,0.00002790611,0.0000020898742,0.00017153828,0.009016751,0.0057095606,0.9566899,0.0013982629,0.026734445],"study_design_scores_gemma":[0.0008842504,0.000100753896,0.00012578003,0.000019109577,0.00001049547,0.000007910465,0.00022421278,0.9850024,0.0012577842,0.0032742769,0.008849905,0.0002431517],"about_ca_topic_score_codex":0.0006978879,"about_ca_topic_score_gemma":0.00009929001,"teacher_disagreement_score":0.97598565,"about_ca_system_score_codex":0.00004091822,"about_ca_system_score_gemma":0.000055940414,"threshold_uncertainty_score":0.5284804},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920874,0.000108108674,0.0006995285,0.0031458675,0.0010159054,0.00029121325,0.00014405891,0.000108264205,0.0023996185],"genre_scores_gemma":[0.99036926,0.00034892434,0.006330089,0.00056555704,0.0005946545,0.00008154594,0.0010117602,0.000015010229,0.00068318774],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800414,0.00011508659,0.0005045757,0.00057837664,0.0005914969,0.00020634057],"domain_scores_gemma":[0.9975798,0.00015935322,0.00095912564,0.00046908707,0.0007819235,0.000050674927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003983286,0.00022530845,0.00019023193,0.00026089657,0.00021998992,0.00069801114,0.0009772225,0.000087902474,0.00008666064],"category_scores_gemma":[0.000051641953,0.00022038117,0.00008567357,0.00017461235,0.000031323456,0.0031754044,0.0001412894,0.00015279451,0.00005262257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043897147,0.00013428916,0.0007610709,0.000044643984,0.000037055892,0.0000017215568,0.00006576018,0.0003806812,0.9797579,0.017554792,0.0006495474,0.00056862907],"study_design_scores_gemma":[0.00057417405,0.0001773332,0.00004018196,0.000060153357,0.00002329212,0.000007995003,0.00005955214,0.98974943,0.008376386,0.00007340998,0.00062627834,0.00023180583],"about_ca_topic_score_codex":0.00015458291,"about_ca_topic_score_gemma":0.0019404187,"teacher_disagreement_score":0.98936874,"about_ca_system_score_codex":0.00007395682,"about_ca_system_score_gemma":0.0002515275,"threshold_uncertainty_score":0.8986884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7026539,7.243549e-7,0.2951608,0.00011719819,0.0002177057,0.000048243637,1.238108e-7,0.00002758288,0.0017737212],"genre_scores_gemma":[0.9981376,0.0000020709135,0.00048166479,0.00015707813,0.00001872572,0.0000033052092,0.0000011677172,0.0000014276316,0.0011969602],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997114,0.000010196224,0.00008269316,0.00008241329,0.00004973534,0.00006358073],"domain_scores_gemma":[0.9997678,0.000012326538,0.00002389821,0.00016310731,0.000017916425,0.000014974685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090071786,0.000029559365,0.000046834393,0.00003887272,0.000009268077,0.00002098973,0.00018825548,0.000027084236,0.000024958943],"category_scores_gemma":[0.0000042131187,0.0000257111,0.000015159361,0.00007818623,0.0000074687773,0.00016724748,0.000049117618,0.000079409714,0.0000103823395],"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.000002583635,0.000031096766,0.011530323,0.0000019361612,0.0000021087028,0.0000018755456,0.00012673564,0.00010134719,0.9156442,0.04739197,0.000059917966,0.025105892],"study_design_scores_gemma":[0.00036436156,0.0000301988,0.20060231,0.000015285237,0.0000014150547,0.000004729921,0.000006722331,0.7770442,0.017493691,0.00022541505,0.0040514474,0.00016026125],"about_ca_topic_score_codex":0.00004224165,"about_ca_topic_score_gemma":0.00006811747,"teacher_disagreement_score":0.8981505,"about_ca_system_score_codex":0.0000022068077,"about_ca_system_score_gemma":0.00000807992,"threshold_uncertainty_score":0.10484683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005915031,0.0000033795186,0.9582713,0.00012830182,0.00008593573,0.033707514,4.7098857e-7,0.00021179448,0.0016762564],"genre_scores_gemma":[0.8193147,1.2102244e-7,0.07462385,0.0008923343,0.0002323523,0.10397844,0.0000010220114,0.000015448273,0.00094171125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990253,0.000026171345,0.00017250876,0.00036542158,0.000111004476,0.00029961608],"domain_scores_gemma":[0.99929494,0.00013767346,0.000049932896,0.0003074025,0.000088061344,0.00012202184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042203555,0.0001175387,0.00013605053,0.000031140622,0.00025390723,0.00047692863,0.0003254269,0.000045496126,0.000005713121],"category_scores_gemma":[0.0000648181,0.0000998079,0.000045499928,0.00011390388,0.000019759438,0.00026946512,0.0002022976,0.00009419123,0.00000741862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019787758,0.000225625,0.01355508,0.00017099557,0.000053912303,0.000012239328,0.0034612487,0.107400835,0.0032207184,0.0661003,0.024048893,0.78155226],"study_design_scores_gemma":[0.00041944938,0.00034430003,0.00035274366,0.00006162548,0.0000021036567,0.000008753402,0.000035597914,0.99412763,0.00004157976,0.0000732897,0.0043819123,0.0001510394],"about_ca_topic_score_codex":0.00008882671,"about_ca_topic_score_gemma":0.000024275321,"teacher_disagreement_score":0.8867268,"about_ca_system_score_codex":0.000021436097,"about_ca_system_score_gemma":0.00002312031,"threshold_uncertainty_score":0.45990336},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2265989,0.00008468651,0.77145475,0.00016444248,0.0012592226,0.00017534131,0.00012152446,0.00012930456,0.000011796767],"genre_scores_gemma":[0.99779725,0.00001723971,0.0017481414,0.000052391155,0.00017931875,0.00006731234,0.000018249315,0.000011313249,0.00010879713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990008,0.000032642947,0.0001737631,0.0002801619,0.00016883652,0.00034379624],"domain_scores_gemma":[0.9991894,0.00035871673,0.00006115011,0.00016814591,0.00007458413,0.00014801715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024938583,0.00014969047,0.00016224626,0.00006996817,0.0003757162,0.00008820433,0.00020756663,0.00008261082,0.000007032856],"category_scores_gemma":[0.000022125181,0.0001478231,0.00010436932,0.000095355055,0.00005012662,0.00052056566,0.0000049980345,0.00018788043,0.000019251711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020397978,0.00088230596,0.00069234445,0.00008183438,0.00023043764,0.000009632888,0.02325862,0.0006657764,0.019996854,0.0020584946,0.0006660538,0.95125365],"study_design_scores_gemma":[0.004994715,0.00026970534,0.017728267,0.00014300614,0.00022192206,0.0000384612,0.0023045,0.9539352,0.018054023,0.00023872458,0.00094466354,0.0011268308],"about_ca_topic_score_codex":0.00007279064,"about_ca_topic_score_gemma":0.00003352544,"teacher_disagreement_score":0.9532694,"about_ca_system_score_codex":0.00009453655,"about_ca_system_score_gemma":0.000015418535,"threshold_uncertainty_score":0.60280514},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077698946,0.00010247041,0.91556126,0.0016447045,0.00029061883,0.00012288385,0.0000019338893,0.00018554229,0.0043916525],"genre_scores_gemma":[0.98452675,0.000004813604,0.012254011,0.0011747865,0.00010774691,0.00001511527,0.000001971395,0.000004709945,0.0019100859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992924,0.000014433013,0.00013791143,0.00023002988,0.00012265467,0.00020262315],"domain_scores_gemma":[0.9995938,0.000044767847,0.00002350768,0.0002480667,0.000023017852,0.00006686675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015044882,0.00007611949,0.00008504411,0.00004777439,0.00011146904,0.00008182257,0.00042560557,0.000023820796,0.000010549392],"category_scores_gemma":[0.0000071374216,0.00006513781,0.00008937755,0.00006083917,0.0000073693436,0.0002849716,0.000035122193,0.000056017765,0.000055320703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030667663,0.00035057732,0.0022038664,0.000028178387,0.000055890694,0.000006392509,0.0014904533,0.011587006,0.0061309747,0.1030174,0.011140946,0.86395764],"study_design_scores_gemma":[0.0012301643,0.00013040027,0.0016460357,0.000024401894,0.000013015304,0.000014236409,0.000027011567,0.92677844,0.0020070667,0.00069606415,0.06709986,0.0003332831],"about_ca_topic_score_codex":0.000051148443,"about_ca_topic_score_gemma":0.00006179929,"teacher_disagreement_score":0.9151915,"about_ca_system_score_codex":0.000031305688,"about_ca_system_score_gemma":0.000017194649,"threshold_uncertainty_score":0.26562425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05610498,0.0001479285,0.9410849,0.00003072924,0.0001526127,0.0013883873,0.000012182423,0.00009726926,0.0009810176],"genre_scores_gemma":[0.9965814,0.0000107353935,0.0023902012,0.000053278032,0.00003759445,0.00079429155,0.00011718447,0.0000096502445,0.0000056755807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751174,0.0016207239,0.00037388323,0.00017099155,0.00016170595,0.00016098039],"domain_scores_gemma":[0.99598217,0.002233104,0.00024466307,0.0013666527,0.00013094825,0.00004246232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002857208,0.000115407114,0.00025922302,0.00017360644,0.00018332504,0.0000596027,0.0009435202,0.000063669766,1.8201706e-7],"category_scores_gemma":[0.00021138917,0.00011264218,0.000063047395,0.0001987017,0.00003613881,0.00016061631,0.00011129994,0.0003277446,7.269522e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013747707,0.0010122752,0.009991726,0.0002879495,0.00004974009,2.2925906e-7,0.0019966797,0.8499938,0.000618509,0.009769602,0.00035180568,0.12579021],"study_design_scores_gemma":[0.0008445375,0.0001658171,0.0074430476,0.00015478385,0.0000063802368,0.000002210271,0.0001311674,0.99083793,0.0000998745,0.000055977915,0.00017461544,0.000083630584],"about_ca_topic_score_codex":0.00054430246,"about_ca_topic_score_gemma":0.000034129505,"teacher_disagreement_score":0.9404764,"about_ca_system_score_codex":0.000103535116,"about_ca_system_score_gemma":0.000021024449,"threshold_uncertainty_score":0.45934147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47729182,0.00044458435,0.52143943,0.0002650775,0.00039941122,0.000051977488,4.5021122e-7,0.000024768678,0.00008245306],"genre_scores_gemma":[0.9958579,0.00027478288,0.0031073724,0.00052843656,0.0002107478,9.3764626e-8,0.0000013098203,0.0000045253464,0.0000148391655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832296,0.000090704256,0.0007402161,0.0003146166,0.0002370498,0.00029443207],"domain_scores_gemma":[0.9987467,0.00014425236,0.00042675037,0.00046500048,0.00011523817,0.00010204221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014724829,0.00014847095,0.00034055547,0.00022406422,0.00015227405,0.0003194153,0.0016363712,0.000054282402,0.000003304714],"category_scores_gemma":[0.000037558435,0.00013445025,0.00007086697,0.0002248354,0.00003603362,0.0007024265,0.00047306594,0.00047409016,0.000002608278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008421926,0.00034366926,0.0019143503,0.000014301685,0.000053210046,0.0002608413,0.0023156377,0.015529892,0.0011555267,0.075989045,0.0005556124,0.9017837],"study_design_scores_gemma":[0.0002527658,0.00025382053,0.0035717343,0.00023237446,0.00001057955,0.00016830614,0.00015307743,0.9923317,0.00017154905,0.0025424177,0.00013746011,0.00017424006],"about_ca_topic_score_codex":0.000029990142,"about_ca_topic_score_gemma":0.000016445456,"teacher_disagreement_score":0.9768018,"about_ca_system_score_codex":0.000066490386,"about_ca_system_score_gemma":0.00006779963,"threshold_uncertainty_score":0.54827225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18107623,0.00003487237,0.80769825,0.0007737651,0.000138262,0.00009310333,1.3520402e-7,0.0002844979,0.009900884],"genre_scores_gemma":[0.9941139,0.0000029575,0.002503969,0.0013946816,0.00005434756,0.000012901215,0.0000011566253,0.000004918993,0.0019111509],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.000016632945,0.000078250945,0.00019805823,0.00011251618,0.00021667859],"domain_scores_gemma":[0.99946576,0.000029627285,0.000019805673,0.00036154146,0.00004725661,0.000076012635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054192715,0.000079297315,0.00007793876,0.00002983807,0.00006667572,0.00024088947,0.00035964942,0.000025088084,0.00013690778],"category_scores_gemma":[0.0000013394548,0.00005186449,0.000028966026,0.00012248363,0.000016282327,0.00041496722,0.00009778498,0.000076833596,0.00033193396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031725853,0.00033946696,0.065864116,0.000023523904,0.00020760331,0.0001282507,0.0010609791,0.014860716,0.0022835482,0.124511085,0.4119007,0.37878826],"study_design_scores_gemma":[0.0003878337,0.00015651135,0.01840389,0.000008578177,0.0000040360032,0.000032093893,0.000038745686,0.97609514,0.000067614295,0.0018698691,0.0026498563,0.0002858501],"about_ca_topic_score_codex":0.00046066704,"about_ca_topic_score_gemma":0.000032031898,"teacher_disagreement_score":0.9612344,"about_ca_system_score_codex":0.000008835298,"about_ca_system_score_gemma":0.000010587758,"threshold_uncertainty_score":0.426645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99225086,0.00013620991,0.0018806771,0.00044781293,0.00016741149,0.00031346356,0.000022440086,0.000045084125,0.004736038],"genre_scores_gemma":[0.88363266,0.000025351264,0.11579715,0.000042345117,0.000080159734,0.000032789056,0.000008813454,0.000023963827,0.00035677638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987179,4.6277005e-8,0.00031914067,0.00029035035,0.00047730008,0.00019523718],"domain_scores_gemma":[0.99912894,0.000064936154,0.00017894742,0.000102108475,0.00047056185,0.00005448824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000455279,0.000153908,0.00020814313,0.00008782063,0.000025366357,0.00004881491,0.0008734603,0.00007836969,0.000010358991],"category_scores_gemma":[0.00028603975,0.00011853674,0.00014223362,0.0002571926,0.000077961704,0.00020154017,0.00014077588,0.00018103504,0.000003268291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006748933,0.00028013665,0.00037617618,0.00037658357,0.00027419146,6.292482e-7,0.0007737302,0.0021577235,0.25848246,0.73233515,0.001709159,0.003166582],"study_design_scores_gemma":[0.0015113268,0.0002946546,0.0010908924,0.0005668146,0.00008405143,0.000027497787,0.0004591779,0.96909505,0.01977148,0.00064383,0.006026935,0.00042831156],"about_ca_topic_score_codex":0.000009671819,"about_ca_topic_score_gemma":6.8723415e-7,"teacher_disagreement_score":0.9669373,"about_ca_system_score_codex":0.00006658288,"about_ca_system_score_gemma":0.000046824498,"threshold_uncertainty_score":0.48337877},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69631875,0.00030859784,0.28851324,0.0016667745,0.00047762343,0.00033498043,2.748102e-7,0.0003331245,0.012046597],"genre_scores_gemma":[0.9830704,0.000019789253,0.012600658,0.0017983667,0.0000347715,0.00006882656,4.0608668e-7,0.0000042110046,0.0024026164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917305,0.00004266819,0.00013591725,0.0002470129,0.00013651577,0.00026485062],"domain_scores_gemma":[0.99933,0.00010269159,0.000026391966,0.00042480734,0.00003150642,0.000084632484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015356235,0.000077453966,0.00010968508,0.00008695001,0.000047325433,0.00014378274,0.00050085335,0.0000554595,0.00016769441],"category_scores_gemma":[0.000023042923,0.00006413019,0.000035818448,0.00028140884,0.000010914074,0.00038953483,0.00013307741,0.00017765634,0.00066527136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013725806,0.00078025216,0.057722643,0.000100997604,0.00003553022,0.000081377526,0.0043495987,0.0021032195,0.0023211534,0.4737987,0.051349867,0.40734294],"study_design_scores_gemma":[0.0016317574,0.00061421667,0.05502105,0.00034215802,0.0000068134755,0.000042713113,0.0011539938,0.7816828,0.00092912005,0.14424656,0.013009399,0.0013194495],"about_ca_topic_score_codex":0.0015425825,"about_ca_topic_score_gemma":0.000040460585,"teacher_disagreement_score":0.7795795,"about_ca_system_score_codex":0.000036813988,"about_ca_system_score_gemma":0.000038654918,"threshold_uncertainty_score":0.85509396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018536238,0.00045973272,0.9774187,0.0021181873,0.00031333556,0.0010466928,0.0000050428916,0.000050487226,0.000051583156],"genre_scores_gemma":[0.9841849,0.00009419125,0.015094112,0.00013554534,0.00018290977,0.00012383425,0.000035869936,0.000007786318,0.00014083889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814385,0.00020300811,0.00034772724,0.00040478804,0.00036341225,0.0005371993],"domain_scores_gemma":[0.9984353,0.0007374824,0.000025028019,0.0003725858,0.00033675623,0.00009284818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005131329,0.000114731214,0.00013564929,0.00013828554,0.0008620023,0.00071680377,0.0004580191,0.000052867497,8.962624e-7],"category_scores_gemma":[0.00011237325,0.00008634686,0.00004821689,0.00046602558,0.0000977272,0.00030207785,0.0003996489,0.00040040715,0.0000025222166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011436389,0.00040696724,0.0014449519,0.000046760655,0.00010848073,0.000056206805,0.004355731,0.4263882,0.0024358374,0.10829538,0.005107612,0.4512395],"study_design_scores_gemma":[0.00052908616,0.00017435908,0.0033282766,0.00007723519,0.0000024858418,0.000011414055,0.00035665842,0.9947027,0.00014027672,0.00005398556,0.0005161803,0.00010734816],"about_ca_topic_score_codex":0.00073556224,"about_ca_topic_score_gemma":0.00041325585,"teacher_disagreement_score":0.96564865,"about_ca_system_score_codex":0.00025994887,"about_ca_system_score_gemma":0.00009641521,"threshold_uncertainty_score":0.6912156},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02068357,0.00075389224,0.9760185,0.0013454662,0.0006394004,0.00030383738,0.0001498221,0.000013125463,0.00009239407],"genre_scores_gemma":[0.9147018,0.0000085296315,0.084046915,0.0007297223,0.0004222651,0.000020460999,0.000008001956,0.000008842937,0.00005343843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986352,0.00006888337,0.00035567998,0.00019463181,0.00035425468,0.00039139256],"domain_scores_gemma":[0.99892575,0.00024702516,0.00025386212,0.00023941051,0.00016848603,0.00016547654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696667,0.00016022229,0.0002450555,0.00015383624,0.00012376727,0.0001532091,0.0008594651,0.000059307094,0.0000012198724],"category_scores_gemma":[0.00012517002,0.00010185599,0.00018737654,0.00025249878,0.00002896834,0.00076755526,0.00012927435,0.0004346498,0.0000016082947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011010767,0.0032522208,0.0062254174,0.00028202962,0.0011129979,0.00012520379,0.09684152,0.01851226,0.19273022,0.0130267,0.03390146,0.6328889],"study_design_scores_gemma":[0.0065143765,0.0018385001,0.027945254,0.00071364344,0.00018921816,0.0011564288,0.0071742367,0.93464273,0.012059028,0.0010849027,0.0048950906,0.0017865587],"about_ca_topic_score_codex":0.000035832505,"about_ca_topic_score_gemma":0.0000015249004,"teacher_disagreement_score":0.9161305,"about_ca_system_score_codex":0.00007275698,"about_ca_system_score_gemma":0.00007281985,"threshold_uncertainty_score":0.41535667},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02027528,0.0020293626,0.97221404,0.0007077435,0.00015348638,0.00029788792,0.0000016009524,0.00010405551,0.004216514],"genre_scores_gemma":[0.98613155,0.00024098236,0.012874797,0.00036890118,0.00005678457,0.00019512862,0.0000388031,0.000014651623,0.00007838517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982023,0.00051057624,0.0003837731,0.00034085324,0.00012926014,0.00043322402],"domain_scores_gemma":[0.99706614,0.00061074935,0.00012390444,0.0020761997,0.000047559217,0.00007546405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116801,0.00016169954,0.00024746417,0.00018938168,0.00025139868,0.00013194213,0.0024601023,0.000076480435,6.5110805e-7],"category_scores_gemma":[0.00009231768,0.0001553815,0.00010870809,0.0006714607,0.000094126415,0.000119300545,0.0005469282,0.00036705454,0.0000016862218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008198392,0.00027003846,0.002125294,0.000008071229,0.0000073288134,3.8653147e-7,0.00063172675,0.4061511,0.000011964214,0.579975,0.000053102158,0.010757784],"study_design_scores_gemma":[0.0006514531,0.000028430763,0.004458297,0.00006714191,0.0000063954035,0.0000047479834,0.00004157415,0.9887244,0.000001591511,0.005203953,0.00063527416,0.00017671852],"about_ca_topic_score_codex":0.00032453286,"about_ca_topic_score_gemma":0.00015695613,"teacher_disagreement_score":0.9658563,"about_ca_system_score_codex":0.000102493046,"about_ca_system_score_gemma":0.000032241514,"threshold_uncertainty_score":0.63362736},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07890704,0.00010850109,0.6684296,0.0076171085,0.00019452252,0.000029212291,1.5051874e-7,0.0005182432,0.24419563],"genre_scores_gemma":[0.98089,0.0000025357672,0.009432205,0.0012161568,0.00005731992,7.193415e-7,1.0189967e-7,8.9362544e-7,0.008400107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975276,0.0000047064805,0.0000364211,0.000082420505,0.000056078592,0.000067589994],"domain_scores_gemma":[0.99977785,0.000009491998,0.000005654593,0.00017315116,0.000009013197,0.000024812469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003575199,0.000024776304,0.000023733503,0.00001706933,0.000024444189,0.000043151027,0.00022384436,0.00000835223,0.00003082172],"category_scores_gemma":[0.0000027115102,0.000019736213,0.000019926998,0.0000448116,0.0000035028304,0.00017532789,0.000050092727,0.000024143617,0.0004891525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6640075e-7,0.00003938876,0.00046591056,5.947256e-7,0.00000441852,0.00000395234,0.00010255815,0.000100387944,0.0013716815,0.25980377,0.02495079,0.71315587],"study_design_scores_gemma":[0.0005051007,0.00007324306,0.0030244102,0.00000838931,0.000003231925,0.000056082885,0.000028839762,0.63281053,0.0069464887,0.0025828057,0.35361177,0.0003490909],"about_ca_topic_score_codex":0.00002330034,"about_ca_topic_score_gemma":0.000009755498,"teacher_disagreement_score":0.9019829,"about_ca_system_score_codex":0.0000070013584,"about_ca_system_score_gemma":0.0000063147504,"threshold_uncertainty_score":0.6287229},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024374705,0.000724829,0.9504176,0.0050684125,0.018444015,0.00027477118,0.0000024852768,0.00017721638,0.0005159791],"genre_scores_gemma":[0.9811583,0.00002509549,0.006321032,0.0020791774,0.0076148654,0.00006126963,0.000012786201,0.000014727509,0.0027127075],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988647,0.000038046346,0.0002544896,0.00037627193,0.00016374039,0.00030276825],"domain_scores_gemma":[0.999,0.00017074849,0.00009820385,0.00056396355,0.00010498138,0.00006210312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040095326,0.00016696064,0.00012615828,0.000044141943,0.000120572055,0.00051797606,0.0014260153,0.00009419023,0.00006141783],"category_scores_gemma":[0.00005242314,0.000115815,0.00012869155,0.00015596095,0.00003819406,0.000368249,0.0002701089,0.0004173193,0.000072090836],"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.000028542418,0.000038838603,0.00026522626,0.000010878737,0.000066528686,0.0000061015726,0.0022504285,0.00052063685,0.005970461,0.26581335,0.41390643,0.3111226],"study_design_scores_gemma":[0.00008549733,0.000068122055,0.00011436105,0.000018732391,0.000012289741,0.000026038033,0.00007377974,0.6522051,0.0017297221,0.0014119623,0.34407094,0.00018344463],"about_ca_topic_score_codex":0.00011370259,"about_ca_topic_score_gemma":0.0005089608,"teacher_disagreement_score":0.95678365,"about_ca_system_score_codex":0.000018551527,"about_ca_system_score_gemma":0.000025638532,"threshold_uncertainty_score":0.4994855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92777306,0.00068915787,0.03097856,0.002832874,0.0011654173,0.0015726561,0.00018318498,0.00049004104,0.034315065],"genre_scores_gemma":[0.7359147,0.00022202358,0.25927177,0.00018903751,0.0006877262,0.0005489247,0.00002593377,0.00007398728,0.0030658918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998907,1.4530677e-8,0.000297032,0.00024802535,0.0003319863,0.00021589355],"domain_scores_gemma":[0.9989408,0.00006926278,0.00015529079,0.00005638991,0.00071920047,0.000059023136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026420006,0.00015609626,0.00018142338,0.000069792746,0.000061579456,0.00009889242,0.00068254134,0.00011784551,0.000033205557],"category_scores_gemma":[0.00016855546,0.00013927103,0.00033096885,0.00020647382,0.000061841136,0.0002988216,0.00009474571,0.000141797,0.0000149524685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010737754,0.00007033787,0.000007376887,0.0001327495,0.00010391482,9.167259e-8,0.00007621841,0.000087274755,0.363772,0.58081055,0.05289215,0.0020366013],"study_design_scores_gemma":[0.0007607875,0.00033295364,0.00003613637,0.00025940352,0.00008165549,0.000028762837,0.0001460072,0.80547404,0.040193643,0.0028905163,0.14934704,0.0004490757],"about_ca_topic_score_codex":0.0000014747677,"about_ca_topic_score_gemma":5.0281244e-8,"teacher_disagreement_score":0.8053867,"about_ca_system_score_codex":0.000093151095,"about_ca_system_score_gemma":0.000018693921,"threshold_uncertainty_score":0.56793076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614691,0.00015856218,0.03554026,0.00010719811,0.0005906587,0.000055022818,2.9403316e-7,0.00031201707,0.0017668749],"genre_scores_gemma":[0.98935664,0.00000546601,0.009039169,0.00047067238,0.00012030669,0.0000053304702,0.0000010086677,0.000006491452,0.000994913],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912524,0.000021429956,0.0001314951,0.00018613182,0.0001800095,0.0003557141],"domain_scores_gemma":[0.999377,0.000033553642,0.00003478955,0.00042200866,0.00002392054,0.000108729306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018849879,0.000117113996,0.00012466284,0.00007123184,0.00012116498,0.000072976014,0.00051752606,0.00003218636,0.000018390776],"category_scores_gemma":[0.000008670788,0.000091337046,0.00004668077,0.00013049705,0.000021547206,0.000326664,0.0002692654,0.0001521097,0.00021394616],"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.000017738674,0.00031468348,0.9092914,0.000043950502,0.000053111,0.000005807712,0.001140535,0.0039555314,0.01063142,0.037628338,0.0014525972,0.035464894],"study_design_scores_gemma":[0.00053928106,0.00003010332,0.48772368,0.000024298777,0.0000051184834,0.000024101419,0.000013935601,0.5080234,0.0024030467,0.00005508958,0.00089430786,0.00026365987],"about_ca_topic_score_codex":0.00018614854,"about_ca_topic_score_gemma":0.000039222803,"teacher_disagreement_score":0.50406784,"about_ca_system_score_codex":0.000020686788,"about_ca_system_score_gemma":0.000014248362,"threshold_uncertainty_score":0.37246168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54910594,0.000018232788,0.44807404,0.0023119291,0.00020276108,0.00016984428,0.0000054947036,0.000027125643,0.000084627565],"genre_scores_gemma":[0.9983422,0.00001073589,0.00052246323,0.0010438495,0.000058169917,0.000005694217,0.00001605577,6.8681925e-7,1.4871931e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990557,0.000037995404,0.00030180308,0.00011066629,0.0003143964,0.00017943003],"domain_scores_gemma":[0.99956214,0.000052229134,0.00013075753,0.00016766015,0.000055787572,0.000031426593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057185814,0.000066785105,0.0000836639,0.00014970182,0.00021618903,0.0004659088,0.0007199839,0.000018628687,0.0000029882667],"category_scores_gemma":[0.0000049997984,0.000050005372,0.000023001197,0.00074833306,0.00009799241,0.005799676,0.000245408,0.00009025729,0.0000049896184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004412359,0.00007650687,0.012330602,0.000045012282,0.00000844507,0.0000010909405,0.0810485,0.0006213009,0.00008379261,0.24301054,0.0031051182,0.6596647],"study_design_scores_gemma":[0.00039864716,0.000051746785,0.3443539,0.000016637492,0.0000017608807,0.000009272169,0.00058231264,0.6453286,0.000030374687,0.0067498493,0.002358545,0.00011834849],"about_ca_topic_score_codex":0.00017444936,"about_ca_topic_score_gemma":0.000007742482,"teacher_disagreement_score":0.6595463,"about_ca_system_score_codex":0.000021893578,"about_ca_system_score_gemma":0.000058166806,"threshold_uncertainty_score":0.44927692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3284363,0.00005529331,0.66849613,0.000076775126,0.0020911028,0.00042642283,0.000039251016,0.00033399047,0.00004471813],"genre_scores_gemma":[0.9937568,0.000035249654,0.0054284125,0.00019230103,0.0002263931,0.000099661076,0.000026116059,0.000024298057,0.00021077997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982744,0.000086786844,0.00038770842,0.0005401177,0.00035662774,0.00035435977],"domain_scores_gemma":[0.9983635,0.00053794915,0.00013545455,0.0005032302,0.00027246602,0.00018740368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003882807,0.00023941546,0.00025223923,0.00020045086,0.00035008133,0.000220372,0.0006471652,0.00010187766,0.0000055266646],"category_scores_gemma":[0.000020322206,0.00024696128,0.00019696938,0.00039714135,0.000040661103,0.0005474334,0.000008594696,0.00027810616,0.00003886011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016676034,0.00036846357,0.0000072422686,0.000012130336,0.00004830265,0.0000037856535,0.00071072334,0.7345579,0.00065729185,0.00006413698,0.00044240433,0.26296085],"study_design_scores_gemma":[0.0026317989,0.0020335102,0.000007467255,0.000051523646,0.000033952332,0.0000097852735,0.0009418698,0.9845195,0.00552211,0.000032017193,0.0038922129,0.0003242876],"about_ca_topic_score_codex":0.00010935337,"about_ca_topic_score_gemma":0.00015817254,"teacher_disagreement_score":0.6653205,"about_ca_system_score_codex":0.0001727686,"about_ca_system_score_gemma":0.00016336923,"threshold_uncertainty_score":0.9999983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88660717,0.000012111127,0.11075969,0.0016404581,0.00008099447,0.00041122103,0.0000010626443,0.00026720713,0.00022005997],"genre_scores_gemma":[0.99679846,0.0000015630652,0.001901875,0.0008799249,0.000013158075,0.000065883396,7.985798e-7,0.000005768271,0.0003325669],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921006,0.000020762009,0.00012025118,0.0003273764,0.0001379424,0.00018362147],"domain_scores_gemma":[0.99946606,0.00009043769,0.000027460293,0.00029661745,0.00007434048,0.00004510211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008710005,0.00009910038,0.00012153842,0.00013179939,0.00019959555,0.000043782646,0.00028728455,0.000047261154,0.0000013702492],"category_scores_gemma":[0.000036257028,0.000082343584,0.000020361233,0.00028701042,0.000020641863,0.00016046922,0.00017205217,0.00010061048,0.000012757292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014758268,0.017331606,0.41091707,0.00024040777,0.0015382597,0.0014264523,0.02664149,0.00036376112,0.09263208,0.26685035,0.006789649,0.17379305],"study_design_scores_gemma":[0.007462006,0.0033791324,0.048619088,0.00008745626,0.00004568279,0.0004300407,0.003917222,0.9298925,0.0021823875,0.0014688193,0.0016542843,0.00086142047],"about_ca_topic_score_codex":0.00008273294,"about_ca_topic_score_gemma":0.00002293478,"teacher_disagreement_score":0.9295287,"about_ca_system_score_codex":0.000026631378,"about_ca_system_score_gemma":0.000016984193,"threshold_uncertainty_score":0.3357874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55412555,0.000008430728,0.4404683,0.00031105653,0.00053510553,0.000045020148,1.3214631e-7,0.00022696439,0.004279432],"genre_scores_gemma":[0.95218414,7.410528e-7,0.046657614,0.00015999137,0.000057240402,0.0000023296227,0.0000010328664,0.000004334257,0.00093259587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939215,0.000013183832,0.00008554044,0.00019717215,0.00015846547,0.00015348043],"domain_scores_gemma":[0.9995668,0.00004025788,0.000037340833,0.00025167287,0.00004676599,0.000057143316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011244961,0.00006761764,0.000057912926,0.000047149348,0.00010230251,0.0001660802,0.0002482475,0.000027973801,0.000009778544],"category_scores_gemma":[0.00002232191,0.00004692839,0.000026160891,0.000116337214,0.000019287972,0.00044244895,0.00006333607,0.00016122515,0.000042090538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001667837,0.00011378641,0.06219961,0.000013021502,0.000047846206,0.00005521224,0.00089382747,0.0010230147,0.36618122,0.032342296,0.0012828896,0.5358306],"study_design_scores_gemma":[0.00042091773,0.00004290983,0.0200013,0.000017520639,0.000005475557,0.000040123756,0.000090949776,0.97798055,0.00068465166,0.00006297091,0.00046590072,0.0001867096],"about_ca_topic_score_codex":0.00025778238,"about_ca_topic_score_gemma":0.0000771767,"teacher_disagreement_score":0.97695756,"about_ca_system_score_codex":0.0000073458987,"about_ca_system_score_gemma":0.00001996762,"threshold_uncertainty_score":0.19136842},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15632708,0.0012444421,0.81418335,0.024308108,0.00081360736,0.00039008024,0.00005469971,0.00015171854,0.0025269235],"genre_scores_gemma":[0.9030893,0.0021326325,0.09401971,0.0005143254,0.000100529076,0.000008901361,0.00004776519,0.0000065452377,0.000080323596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986149,0.0001157743,0.0007096007,0.00010161336,0.00031331956,0.00014481458],"domain_scores_gemma":[0.99502045,0.0009292824,0.0006394849,0.000974599,0.0023419133,0.000094276984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004729598,0.00012102288,0.00020316962,0.0002946389,0.0006953088,0.00019394922,0.0032784443,0.000051977477,0.0000018281306],"category_scores_gemma":[0.0003178851,0.00011724069,0.00017837857,0.00014628249,0.00017143323,0.0011936838,0.0009396513,0.0002321876,0.000009890589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017949076,0.0012687896,0.011345937,0.000042233685,0.0014873332,0.000021585907,0.029100018,0.001991531,0.010817247,0.603308,0.012289636,0.32814816],"study_design_scores_gemma":[0.0037578999,0.0005135978,0.026602684,0.00038271514,0.00010692181,0.002322563,0.0012489097,0.9016664,0.00025687783,0.007820339,0.05470024,0.0006208673],"about_ca_topic_score_codex":0.000088867164,"about_ca_topic_score_gemma":0.00001001022,"teacher_disagreement_score":0.89967483,"about_ca_system_score_codex":0.00009936186,"about_ca_system_score_gemma":0.0001751687,"threshold_uncertainty_score":0.609222},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05001244,0.00008864388,0.7754015,0.006041926,0.0003533123,0.000033938337,1.10648195e-7,0.00050284306,0.1675653],"genre_scores_gemma":[0.98823225,0.0000026898153,0.0041918587,0.0031946742,0.000032324853,2.9380314e-7,1.4113968e-7,7.142148e-7,0.004345077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966097,0.000007023241,0.000047290465,0.000112489084,0.00008051949,0.0000917241],"domain_scores_gemma":[0.9997065,0.000008891389,0.0000069358107,0.00023049815,0.00001395048,0.00003319706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005263104,0.000034956334,0.000036695496,0.000024111268,0.000034205503,0.00006687532,0.00030166275,0.000012398249,0.000017137158],"category_scores_gemma":[0.000005036708,0.000027990312,0.000029887706,0.0000777159,0.0000029284276,0.00016357811,0.000027597092,0.000035785204,0.00019405627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023338196,0.00006675174,0.00015069285,6.7638445e-7,0.000004511231,0.000030987543,0.0001415719,0.000042272997,0.0066158,0.52408814,0.032177407,0.43667883],"study_design_scores_gemma":[0.0018834228,0.0008501072,0.036913857,0.000049228758,0.000013554583,0.00019884651,0.00007906783,0.71114546,0.013409596,0.08652897,0.14742178,0.0015061152],"about_ca_topic_score_codex":0.000013162219,"about_ca_topic_score_gemma":0.0000024145438,"teacher_disagreement_score":0.9382198,"about_ca_system_score_codex":0.0000058188093,"about_ca_system_score_gemma":0.000008145113,"threshold_uncertainty_score":0.24942654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94503546,0.000115104995,0.05339966,0.00016519145,0.0001605677,0.0000452375,1.11348335e-7,0.00009713379,0.0009815557],"genre_scores_gemma":[0.99756634,0.00004292478,0.0020612108,0.00022503892,0.000029178296,0.0000045562533,2.5361922e-7,0.0000044185335,0.00006605055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992196,0.000049473172,0.00010653543,0.0002650292,0.00015619492,0.0002031618],"domain_scores_gemma":[0.9992154,0.00050685665,0.000016607633,0.00018289624,0.000006835904,0.000071406605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106634674,0.00009292849,0.00012322294,0.00012517838,0.00008850613,0.00004474581,0.0002086954,0.000032060427,0.0000018673464],"category_scores_gemma":[0.00004236873,0.00008102399,0.000024276182,0.00015488171,0.000029723316,0.00016573544,0.00015355721,0.0001764178,0.0000068779045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004539155,0.00016475377,0.023786582,0.000052518135,0.000022646502,0.0015495752,0.006009809,0.0006414921,0.015263205,0.064158164,0.00019117579,0.8881147],"study_design_scores_gemma":[0.0021653993,0.00023582879,0.1656287,0.0010349175,0.000005175157,0.00022423148,0.000100621866,0.82096416,0.0048069973,0.004042759,0.00004585513,0.00074533874],"about_ca_topic_score_codex":0.00010982427,"about_ca_topic_score_gemma":0.000036188107,"teacher_disagreement_score":0.88736933,"about_ca_system_score_codex":0.000020070293,"about_ca_system_score_gemma":0.000012768185,"threshold_uncertainty_score":0.33040622},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7927806,0.00005960689,0.20175534,0.0008758221,0.000121867015,0.00084249914,4.931348e-7,0.00032420366,0.0032396205],"genre_scores_gemma":[0.99731904,1.5167939e-7,0.002090827,0.00028440825,0.00007332262,0.00009040706,0.0000011921982,0.0000038494873,0.00013678949],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901426,0.00013210239,0.00019524616,0.00022177474,0.00021792334,0.00021868605],"domain_scores_gemma":[0.99926716,0.0002126071,0.000048252998,0.00039192825,0.000049328322,0.000030732044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004690932,0.00009382766,0.0001299765,0.00006865473,0.00011831121,0.00035585687,0.00070534163,0.000030567626,0.0000031457505],"category_scores_gemma":[0.000009936475,0.000055669567,0.00004885094,0.00022263455,0.000021061718,0.00021649404,0.0001016697,0.0001235435,0.00011073775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016113943,0.00064401794,0.5428171,0.0008642277,0.00011579715,0.00010245216,0.016072972,0.00902023,0.0043632197,0.11760755,0.012695742,0.29568058],"study_design_scores_gemma":[0.0005386777,0.00011261107,0.020756278,0.00013621265,0.000004779534,0.000008494424,0.0010997929,0.97587407,0.0007414747,0.00014227675,0.0003764034,0.00020893295],"about_ca_topic_score_codex":0.00073433184,"about_ca_topic_score_gemma":0.000009443144,"teacher_disagreement_score":0.96685386,"about_ca_system_score_codex":0.000030004012,"about_ca_system_score_gemma":0.000034029687,"threshold_uncertainty_score":0.3431536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1514781,0.000035073106,0.839501,0.0014841078,0.00025517825,0.00009402529,6.003088e-7,0.0002776495,0.006874253],"genre_scores_gemma":[0.99296737,9.989596e-7,0.0038105908,0.0014511873,0.000080348436,0.000015783602,0.0000014923593,0.0000056851827,0.0016665718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924797,0.000050001254,0.00011727421,0.00026414008,0.00014124656,0.00017935781],"domain_scores_gemma":[0.9992887,0.0001509645,0.000040453295,0.00040559995,0.00005298798,0.00006131056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384073,0.000081385784,0.000105216466,0.00005945851,0.00016137511,0.00036881003,0.0009490781,0.0000349104,0.000004678173],"category_scores_gemma":[0.000070989794,0.00006466253,0.00008740049,0.0001074465,0.00001296078,0.00031872964,0.00019825864,0.000061050574,0.00001696978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060261584,0.0002840021,0.008866428,0.000112055866,0.00013745556,0.000013454668,0.0009617796,0.0037909437,0.013661735,0.35362002,0.035623394,0.58286846],"study_design_scores_gemma":[0.00073326,0.00013275936,0.0105439825,0.000025856245,0.000013136515,0.000014279437,0.00001449242,0.8683414,0.0011549337,0.003768026,0.114938356,0.00031955814],"about_ca_topic_score_codex":0.00022265961,"about_ca_topic_score_gemma":0.00003710658,"teacher_disagreement_score":0.8645504,"about_ca_system_score_codex":0.000012247979,"about_ca_system_score_gemma":0.0000106880025,"threshold_uncertainty_score":0.35564435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19674325,0.000167572,0.77055275,0.002291162,0.00073498674,0.00013419126,9.4110396e-7,0.0005244349,0.028850729],"genre_scores_gemma":[0.86679167,0.0000069656294,0.12741444,0.00031957935,0.00014593315,0.0000029838827,5.741601e-7,0.00000520643,0.005312627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993677,0.000015875481,0.00008180643,0.00026775053,0.000117752315,0.00014912429],"domain_scores_gemma":[0.99948174,0.000039550145,0.00002096517,0.0003259435,0.000011194765,0.00012060162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015447428,0.00008472565,0.00008276423,0.00005026992,0.00007533361,0.00022160381,0.00034306644,0.000042991862,0.000011407588],"category_scores_gemma":[0.000016148977,0.00006652493,0.00003392647,0.000088764995,0.000019613712,0.00029180798,0.00019267053,0.00019699609,0.000023934559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013763142,0.000028502793,0.00047418178,0.0000031191885,0.000012492862,0.0000053764793,0.00044137568,0.0000024436083,0.0047185626,0.038380276,0.0023478207,0.9535845],"study_design_scores_gemma":[0.00060650345,0.00007160098,0.0020548464,0.00000767247,0.000007963766,0.00013882264,0.0000621324,0.9762362,0.0010144837,0.00634649,0.013139077,0.00031420495],"about_ca_topic_score_codex":0.00023681614,"about_ca_topic_score_gemma":0.00008557247,"teacher_disagreement_score":0.9762338,"about_ca_system_score_codex":0.0000035279,"about_ca_system_score_gemma":0.000066810055,"threshold_uncertainty_score":0.2712808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016257264,0.000035172252,0.7241318,0.0003286847,0.0005604995,0.000044324963,6.5224145e-7,0.00034919666,0.25829238],"genre_scores_gemma":[0.96797633,0.0000033103709,0.018430902,0.0013903483,0.000020940246,0.0000019762208,8.6856164e-7,0.00000288552,0.012172416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957967,0.000013335202,0.00006542582,0.00016144721,0.00006044004,0.00011966849],"domain_scores_gemma":[0.9995261,0.000010217342,0.000014452061,0.00038787618,0.000013420772,0.00004793381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007462545,0.000047638645,0.000044260887,0.000056205263,0.000035130277,0.00004503226,0.00059382827,0.00000836325,0.000073567775],"category_scores_gemma":[0.0000035282085,0.000038917686,0.000030507103,0.00011081434,0.0000098518585,0.00021466373,0.00018764373,0.000045689903,0.00023373269],"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.000012159727,0.00016643527,0.013084507,0.0000062502163,0.00003876736,0.00007621883,0.0010139545,0.0000018289114,0.0009724888,0.8306922,0.03303319,0.12090202],"study_design_scores_gemma":[0.004693264,0.0008089174,0.09815292,0.00020476,0.00007758326,0.0002683324,0.00070117693,0.31115085,0.03751493,0.031086553,0.5115492,0.0037915136],"about_ca_topic_score_codex":0.00033464248,"about_ca_topic_score_gemma":0.0001710572,"teacher_disagreement_score":0.9517191,"about_ca_system_score_codex":0.000007041449,"about_ca_system_score_gemma":0.000008778904,"threshold_uncertainty_score":0.3004239},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058509838,0.00006340892,0.93797356,0.0010380686,0.0011182866,0.000085315325,0.0000018784782,0.00030756215,0.0009021101],"genre_scores_gemma":[0.99223894,0.0000266893,0.00582364,0.0014346046,0.00020510453,0.000021676973,0.0000035495375,0.000015423171,0.00023040066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998089,0.00021277837,0.0003194503,0.00055058696,0.00038799387,0.00044017626],"domain_scores_gemma":[0.99804544,0.0005145554,0.00008765436,0.001134146,0.00006565611,0.00015253616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047384205,0.00022403122,0.00030211773,0.00039349144,0.000604391,0.00018492958,0.00083095767,0.00010945723,0.000022363542],"category_scores_gemma":[0.00000789606,0.00021591311,0.00036114486,0.0012962731,0.000081600374,0.00020442932,0.000009962973,0.0005081796,0.00004423505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027943084,0.0001290279,0.0011558696,0.000010800032,0.0002660353,0.000004489587,0.00009417039,0.79897755,0.00016081471,0.00066144136,0.000059032354,0.19845282],"study_design_scores_gemma":[0.00040307041,0.00011807319,0.0019061421,0.00005183523,0.00021690082,0.000006744433,0.000008939345,0.9949713,0.00024926526,0.00041569243,0.0013577412,0.00029430416],"about_ca_topic_score_codex":0.000065750035,"about_ca_topic_score_gemma":0.00010225126,"teacher_disagreement_score":0.93372905,"about_ca_system_score_codex":0.00008022838,"about_ca_system_score_gemma":0.000070014175,"threshold_uncertainty_score":0.88046813},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3074393,0.00060679065,0.6565563,0.0010297737,0.0010188335,0.00018801702,0.000002209414,0.0002046765,0.032954082],"genre_scores_gemma":[0.9971056,0.0000022647703,0.001250077,0.00005068497,0.00013006135,0.000010511191,0.0000010541681,0.0000064354695,0.0014433142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883294,0.00008916178,0.00017780383,0.00015924995,0.0004563842,0.00028445275],"domain_scores_gemma":[0.99919957,0.00006447522,0.00009324981,0.00042801446,0.00014610299,0.00006856316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006559692,0.0001216209,0.00016782356,0.000049130438,0.00012827305,0.00031067588,0.0006264016,0.00003599441,0.0000035059745],"category_scores_gemma":[0.000013573826,0.000064758555,0.00005592236,0.00017959924,0.00004430909,0.00076544733,0.00014081699,0.00013112757,0.000008224589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056538705,0.00038881882,0.0019069307,0.00014599139,0.00033886172,0.000020889825,0.011608362,0.05638084,0.0044666296,0.8987908,0.0028296283,0.02306576],"study_design_scores_gemma":[0.0017726312,0.0010417682,0.023891235,0.00039160077,0.00013804524,0.0008168273,0.03546043,0.9265894,0.00354931,0.00026443598,0.004885567,0.0011987371],"about_ca_topic_score_codex":0.0017035052,"about_ca_topic_score_gemma":0.000020370138,"teacher_disagreement_score":0.8985263,"about_ca_system_score_codex":0.000021143966,"about_ca_system_score_gemma":0.000081330494,"threshold_uncertainty_score":0.2995855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6089522,0.0000051272327,0.3894215,0.00036181236,0.0007981122,0.00021672112,0.000009621494,0.000105637046,0.00012923917],"genre_scores_gemma":[0.99750966,7.9716995e-7,0.0020882108,0.00008429188,0.00012416339,0.00004741507,0.00003189997,0.0000031482364,0.00011040524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.00003174679,0.0003425758,0.00015350252,0.0005490496,0.00023565661],"domain_scores_gemma":[0.99857223,0.00004506401,0.00014679672,0.00035869726,0.0007541134,0.00012307167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010768562,0.00012338691,0.00016071339,0.00005992838,0.00023595593,0.00064233167,0.00027468038,0.000067503344,9.403768e-7],"category_scores_gemma":[0.000066859524,0.00009480404,0.000020792075,0.00028895,0.00003185893,0.0021531498,0.00010920459,0.00019312689,0.000021278402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029826612,0.00010669615,0.13328288,0.00065155746,0.00012960336,0.0000062142303,0.003201784,0.45242703,0.0012874498,0.24889345,0.011966036,0.14774904],"study_design_scores_gemma":[0.00072353263,0.00014568833,0.09095582,0.000151131,0.000009744906,0.00013095624,0.00016991691,0.8802037,0.0001313939,0.00001604331,0.027035924,0.00032612454],"about_ca_topic_score_codex":0.00026300934,"about_ca_topic_score_gemma":0.00001146642,"teacher_disagreement_score":0.4277767,"about_ca_system_score_codex":0.000049361424,"about_ca_system_score_gemma":0.00003878564,"threshold_uncertainty_score":0.61940193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05664826,0.00008526037,0.599674,0.0013396839,0.0002684201,0.000024662324,1.4876123e-7,0.0004279042,0.34153166],"genre_scores_gemma":[0.9869953,3.9077096e-7,0.0026070122,0.00056702015,0.000055676734,7.1330203e-7,4.62757e-7,9.608679e-7,0.009772455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997503,0.000003685188,0.000038111593,0.00008174984,0.000059264807,0.00006686624],"domain_scores_gemma":[0.99981564,0.000008073761,0.00000664925,0.00015183828,0.000009490395,0.00000831168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000032953652,0.000024675273,0.000023916195,0.000019746036,0.000024189045,0.000060122366,0.00019962237,0.000008420119,0.000014923111],"category_scores_gemma":[0.0000011122323,0.000020067006,0.000017062912,0.000054114727,0.000004035287,0.00012577823,0.000043925993,0.000019982572,0.0002548614],"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":[3.3982053e-7,0.0000180383,0.0009859203,6.953553e-7,0.0000010432605,0.000010255986,0.0000051525903,0.000057706784,0.0014948784,0.9341322,0.05519342,0.0081003215],"study_design_scores_gemma":[0.00084140245,0.00008991439,0.045466755,0.000011574653,0.0000056950903,0.00010719936,0.000015561705,0.49871886,0.0041471845,0.11337559,0.3365208,0.00069946755],"about_ca_topic_score_codex":0.00047104852,"about_ca_topic_score_gemma":0.00002165982,"teacher_disagreement_score":0.930347,"about_ca_system_score_codex":0.0000037765687,"about_ca_system_score_gemma":0.000004551677,"threshold_uncertainty_score":0.32758126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07675033,0.00027409714,0.9194571,0.00013210255,0.0026933055,0.00012305203,0.0000034713507,0.00028528064,0.0002812683],"genre_scores_gemma":[0.93665403,0.0000146525035,0.06228512,0.0002626022,0.0006002655,0.000012380948,0.000002653767,0.000021250096,0.00014701406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980134,0.00018493102,0.00037817075,0.00041652907,0.00037802974,0.0006289337],"domain_scores_gemma":[0.99846923,0.00029565912,0.00015536921,0.0008506572,0.0000534341,0.0001756757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060389686,0.00024919532,0.0003102507,0.00040531805,0.0007346865,0.00024890114,0.0006442996,0.00010560089,0.000022638258],"category_scores_gemma":[0.00001244884,0.00025955922,0.00029257758,0.001565106,0.000032849184,0.0005499008,0.000017355303,0.00041100403,0.000016589893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015763186,0.00011714602,0.0008957582,0.000009425746,0.00040148394,0.000027106953,0.0009145214,0.8162796,0.0011357932,0.00011118418,0.000025784713,0.1800664],"study_design_scores_gemma":[0.0001756767,0.000027273316,0.000112551235,0.000061130435,0.00030174782,0.00007746485,0.000048643993,0.9984078,0.00021724112,0.00006833655,0.00019857606,0.00030357737],"about_ca_topic_score_codex":0.000247891,"about_ca_topic_score_gemma":0.00009483286,"teacher_disagreement_score":0.85990375,"about_ca_system_score_codex":0.00021452138,"about_ca_system_score_gemma":0.00004662794,"threshold_uncertainty_score":0.99998564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093589894,0.00053913513,0.89491564,0.00007795064,0.0010603744,0.00004716552,4.4535892e-7,0.00012560429,0.009643813],"genre_scores_gemma":[0.9948117,0.00002962175,0.0043596434,0.00033595407,0.00017598188,0.0000038347584,0.0000016372572,0.000004836024,0.00027676794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884444,0.000085258886,0.00022297373,0.00019750981,0.0002903128,0.00035952879],"domain_scores_gemma":[0.9991842,0.000054444736,0.00009217294,0.00045538813,0.00006738505,0.0001464224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039743,0.00009961943,0.00014162374,0.000089928224,0.000080114136,0.000060506198,0.00056496944,0.00003282855,0.00001678012],"category_scores_gemma":[0.0000042201445,0.000080699305,0.00007338813,0.00027762493,0.000019467367,0.0005075151,0.00013486888,0.000069351496,0.00000388181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049914074,0.0011281016,0.11043853,0.000010487301,0.00003859389,0.000005567299,0.00037997597,0.0010637698,0.011456957,0.70478964,0.0007123004,0.16997108],"study_design_scores_gemma":[0.0004472699,0.00022265626,0.039347414,0.000028240484,0.000015222862,0.000017750328,0.00014475195,0.9544009,0.0014667198,0.000184902,0.0034054394,0.0003187337],"about_ca_topic_score_codex":0.0002919393,"about_ca_topic_score_gemma":0.000006851577,"teacher_disagreement_score":0.95333713,"about_ca_system_score_codex":0.000041575968,"about_ca_system_score_gemma":0.00003772806,"threshold_uncertainty_score":0.32908222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107266465,0.00012710741,0.97734463,0.010015603,0.00031326772,0.00086614443,0.000027411686,0.0003782466,0.0002009227],"genre_scores_gemma":[0.7799191,0.00008276026,0.21829268,0.00028211297,0.00012665725,0.0010043774,0.0000459789,0.00002119773,0.00022514904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853766,0.0000707501,0.000397704,0.00039519998,0.00023071821,0.00036799646],"domain_scores_gemma":[0.9957689,0.0013193358,0.00012512963,0.0021705588,0.00037521805,0.00024086675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007705807,0.00019765207,0.00020024828,0.000263701,0.0015161283,0.00022680948,0.0017692914,0.00007086063,0.0000033166523],"category_scores_gemma":[0.00015135275,0.00021940238,0.0001228371,0.0005173925,0.00007613151,0.0006402067,0.0002130285,0.00034479896,0.00006039275],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015130677,0.0005740568,0.00047698454,0.000022038528,0.00008401898,6.570536e-8,0.004884376,0.0022627192,0.0015613335,0.050032463,0.00023566658,0.93985116],"study_design_scores_gemma":[0.0011858451,0.00009860353,0.0025364526,0.00012375195,0.00010323731,0.000013346633,0.00094753073,0.8964143,0.00062541047,0.0018367555,0.09544502,0.0006697519],"about_ca_topic_score_codex":0.00009295673,"about_ca_topic_score_gemma":0.000030510137,"teacher_disagreement_score":0.9391814,"about_ca_system_score_codex":0.00009237654,"about_ca_system_score_gemma":0.00003044798,"threshold_uncertainty_score":0.99978375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34269702,0.00020510529,0.6546481,0.0015032905,0.00022506357,0.0003947424,0.000005134537,0.0001357035,0.00018584814],"genre_scores_gemma":[0.92272246,0.000047955782,0.07594178,0.0010754183,0.000021945985,0.00011732337,0.000018985225,0.000014825076,0.000039325376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777603,0.0006287588,0.0005742732,0.00044769433,0.00027059633,0.0003026438],"domain_scores_gemma":[0.99541134,0.00040621046,0.00017277381,0.0036705325,0.00016475204,0.00017437503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086773594,0.00019622695,0.00032961616,0.00029544625,0.0002075229,0.00015546389,0.0038762658,0.000065654356,0.000002486356],"category_scores_gemma":[0.00003302062,0.00020589143,0.00012020248,0.00043988126,0.00006874327,0.00052728143,0.0020426526,0.00030952756,0.000036177327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000751979,0.0028858418,0.022982895,0.00009904619,0.00020677707,0.000010009407,0.01547022,0.13012019,0.019885221,0.08798149,0.0016843565,0.7185987],"study_design_scores_gemma":[0.00053378084,0.00035107712,0.016041804,0.0001538417,0.00001031919,0.000006139786,0.00013472952,0.9789966,0.00009741639,0.0004914837,0.002914021,0.00026879756],"about_ca_topic_score_codex":0.0007765221,"about_ca_topic_score_gemma":0.00077337684,"teacher_disagreement_score":0.8488764,"about_ca_system_score_codex":0.00016604668,"about_ca_system_score_gemma":0.00005708802,"threshold_uncertainty_score":0.83960086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014389459,0.0008397424,0.98097414,0.0002366471,0.002721981,0.00033405452,0.000004351255,0.00044095432,0.00005868707],"genre_scores_gemma":[0.980323,0.000024421428,0.014805434,0.0016094854,0.002952283,0.000060584403,0.00014117219,0.00004064832,0.00004294543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963924,0.00037076548,0.0006525097,0.00103964,0.00030815104,0.0012365049],"domain_scores_gemma":[0.99760336,0.0004999388,0.00024268817,0.0011336587,0.00017493873,0.00034540935],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011021281,0.000432503,0.00055294734,0.0001672023,0.00039142897,0.00042491703,0.0017450774,0.00024556395,0.0000020509476],"category_scores_gemma":[0.000018029315,0.00042631576,0.00024594323,0.00082529034,0.000055964563,0.00033935535,0.00051548454,0.00046720548,0.0000036470842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003237438,0.0001400632,0.0027498514,0.000006851886,0.000029188635,0.000012198996,0.00003651247,0.8824218,0.0000064498945,0.019603377,0.0021558802,0.09280543],"study_design_scores_gemma":[0.0013206244,0.0002239001,0.0029135866,0.00011680184,0.000014087853,0.000017206528,0.000003879665,0.9906926,0.00000204567,0.00040729152,0.0037700466,0.00051790004],"about_ca_topic_score_codex":0.0002476645,"about_ca_topic_score_gemma":0.00009364981,"teacher_disagreement_score":0.9661687,"about_ca_system_score_codex":0.00013161985,"about_ca_system_score_gemma":0.000037465248,"threshold_uncertainty_score":0.99981886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6669219,0.000013829516,0.32940862,0.0026538519,0.0003858152,0.00011386629,0.00003073202,0.00020210087,0.00026928747],"genre_scores_gemma":[0.99499506,0.0000113280785,0.0036631934,0.0011860573,0.000010918886,0.000006255338,0.000001914517,0.0000071701165,0.000118130796],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994211,0.00005373157,0.00012752114,0.0001453878,0.00015293458,0.00009928858],"domain_scores_gemma":[0.9990585,0.00015972268,0.000057621,0.000616186,0.00007879253,0.000029217848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010200515,0.000076753975,0.000073579286,0.00008102914,0.00014690979,0.000049214323,0.00070904946,0.000030200234,0.00014393312],"category_scores_gemma":[0.0000100552725,0.00005688914,0.000059460905,0.0002720312,0.000026404787,0.00029606317,0.000010440374,0.00010134678,0.00005172718],"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.000303744,0.0024910301,0.009099275,0.00019272881,0.0005618626,0.00003084329,0.010837944,0.002556606,0.87300193,0.041059025,0.00045245857,0.059412565],"study_design_scores_gemma":[0.002432324,0.0005724136,0.032576904,0.00048788506,0.00019031457,0.000051360257,0.00049845164,0.5660351,0.3841289,0.004678033,0.0071968245,0.0011515252],"about_ca_topic_score_codex":0.00008369748,"about_ca_topic_score_gemma":0.000027705106,"teacher_disagreement_score":0.56347847,"about_ca_system_score_codex":0.000010943903,"about_ca_system_score_gemma":0.00005808122,"threshold_uncertainty_score":0.2319872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24602246,0.000073227915,0.68868804,0.0007706393,0.00026139646,0.000019737341,7.7751395e-8,0.00032473216,0.06383967],"genre_scores_gemma":[0.9874506,0.0000069381063,0.0032549037,0.0006199097,0.00002264829,7.645507e-7,9.0908465e-8,0.0000010038581,0.00864316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973196,0.0000067420688,0.00003375966,0.00008694195,0.000074059004,0.00006652236],"domain_scores_gemma":[0.99975735,0.0000106255275,0.0000061051514,0.00018648425,0.000012958224,0.0000264731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000027761464,0.000025478546,0.000028538234,0.000019207853,0.000060433133,0.000012848905,0.0002339325,0.000008651828,0.0000139503845],"category_scores_gemma":[0.0000037838,0.000020377545,0.000022190156,0.000058387748,0.000009397481,0.00012933381,0.000052229796,0.00002754386,0.00021255389],"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.0000054849593,0.00015901114,0.016775476,0.0000040388795,0.000026959891,0.0004192201,0.0017254265,0.00014357356,0.0091585005,0.6285665,0.2427103,0.1003055],"study_design_scores_gemma":[0.0019674643,0.00040016312,0.09551247,0.000024086208,0.0000071588584,0.001986116,0.00010676426,0.5738899,0.011330247,0.007762656,0.30559796,0.0014149866],"about_ca_topic_score_codex":0.000044874283,"about_ca_topic_score_gemma":0.0000016348132,"teacher_disagreement_score":0.74142814,"about_ca_system_score_codex":0.0000055556807,"about_ca_system_score_gemma":0.0000125455545,"threshold_uncertainty_score":0.27320212},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142849935,0.00009696353,0.9811882,0.00006931229,0.00023172663,0.00043842295,0.0000015662059,0.00013832295,0.003550492],"genre_scores_gemma":[0.80779564,0.00004131005,0.19007829,0.0005040448,0.00014073339,0.00005559754,0.000007289423,0.000008267593,0.0013688322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909717,0.00005162947,0.00019578001,0.00014688063,0.00015741022,0.00035111094],"domain_scores_gemma":[0.9994171,0.00015585466,0.000080129015,0.00020564985,0.000046747326,0.000094471994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705838,0.00012732604,0.00012599128,0.00006447653,0.0001923273,0.00018144942,0.00018185446,0.00003752944,0.000005966339],"category_scores_gemma":[0.000009663571,0.00010738141,0.00004604586,0.00008192658,0.000012149203,0.0018164377,0.00017430703,0.0000589074,0.000016326498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033960093,0.00021207758,0.0058593433,0.00013349253,0.0005626182,0.000007102918,0.005116657,0.124283075,0.0005003349,0.37600532,0.042703662,0.44427672],"study_design_scores_gemma":[0.0006568475,0.00010469554,0.012471849,0.00005653719,0.000033123004,0.00000629951,0.00025609173,0.9852058,0.00003661631,0.00028442458,0.00064816436,0.00023952183],"about_ca_topic_score_codex":0.00021874701,"about_ca_topic_score_gemma":0.0000034382804,"teacher_disagreement_score":0.86092275,"about_ca_system_score_codex":0.00005566858,"about_ca_system_score_gemma":0.000008073397,"threshold_uncertainty_score":0.43788868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3385793,0.0002709787,0.5249135,0.12408638,0.001101081,0.0025744943,0.000038904807,0.00037705342,0.008058329],"genre_scores_gemma":[0.9857105,0.000011139593,0.003122832,0.0017887487,0.00062591914,0.0006911437,0.000026841928,0.00002135442,0.008001534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754435,0.00007321458,0.0003366865,0.0004901752,0.0010881309,0.00046744777],"domain_scores_gemma":[0.99792504,0.00023685685,0.00010729679,0.00087865215,0.00054441893,0.00030770406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280408,0.00024184967,0.00023058038,0.00018339125,0.00044784893,0.0002445943,0.0006677863,0.000063721745,0.0000071757136],"category_scores_gemma":[0.000056946214,0.00018949565,0.000075184114,0.0010403742,0.000033449207,0.000117996926,0.00031031627,0.00019478383,0.00011901311],"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.000048279715,0.000719471,0.0010355226,0.000049219572,0.00016895446,0.0000017632467,0.0051165367,0.022004735,0.0010091332,0.47752377,0.20858446,0.28373817],"study_design_scores_gemma":[0.00043888655,0.00017246396,0.005931841,0.00015298615,0.00009164937,0.0000073280994,0.00069836015,0.025577001,0.000500939,0.0011973513,0.96461457,0.0006166221],"about_ca_topic_score_codex":0.0000149239895,"about_ca_topic_score_gemma":0.000015811558,"teacher_disagreement_score":0.75603014,"about_ca_system_score_codex":0.00007005197,"about_ca_system_score_gemma":0.000017970253,"threshold_uncertainty_score":0.77274084},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09119875,0.000054320106,0.79922456,0.049059562,0.000664615,0.00009463642,5.758057e-7,0.00025313502,0.059449837],"genre_scores_gemma":[0.9528495,5.602006e-7,0.0016196625,0.009072413,0.00008061786,0.000005156249,9.697468e-8,0.0000032322928,0.036368772],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993521,0.000049601258,0.000076423355,0.00020241467,0.00015884996,0.00016061938],"domain_scores_gemma":[0.999415,0.00014429387,0.0000148452355,0.0003317742,0.000026950876,0.00006713255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027336756,0.000068803514,0.000063634994,0.000052391057,0.000094050214,0.00017315657,0.00072329666,0.00001037411,0.00005114879],"category_scores_gemma":[0.000042267275,0.000041820327,0.00004966977,0.00020222245,0.000012781801,0.00011203892,0.000262453,0.000095793795,0.0007645023],"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.000023755729,0.00007376187,0.0028178268,0.000005867901,0.000040159914,0.000005717411,0.0031383892,0.0005322654,0.005297888,0.119958684,0.71193767,0.15616798],"study_design_scores_gemma":[0.00015610973,0.00006670025,0.0012072572,0.000020351317,0.0000030177264,0.000008759037,0.00006307319,0.49879837,0.0005138456,0.00026723635,0.49873838,0.00015692541],"about_ca_topic_score_codex":0.000077365556,"about_ca_topic_score_gemma":0.0007037121,"teacher_disagreement_score":0.86165076,"about_ca_system_score_codex":0.000015705795,"about_ca_system_score_gemma":0.000017588052,"threshold_uncertainty_score":0.9826386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59318805,0.000029065706,0.3979799,0.00036702564,0.00033788107,0.00048353104,0.0000061534593,0.0004317717,0.0071765957],"genre_scores_gemma":[0.98433393,0.0000016779207,0.013798416,0.0013403525,0.000042338994,0.000065745575,0.000002477985,0.000013427795,0.00040163661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988213,0.000057581223,0.00020632321,0.0004312618,0.00017310312,0.00031038508],"domain_scores_gemma":[0.99896014,0.0001404413,0.00010668128,0.0003883152,0.00030035037,0.000104085346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026382264,0.00016092809,0.00017042427,0.00008396681,0.0002480067,0.00021207418,0.0006573622,0.000048923524,0.0000073061833],"category_scores_gemma":[0.00003358064,0.00014497216,0.00006335736,0.00039194035,0.0000235617,0.0011602907,0.00017002042,0.00011146922,0.000011273851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005164567,0.0016378983,0.12629358,0.00091486145,0.0013245704,0.0002958819,0.19581118,0.002166276,0.025754733,0.3381338,0.027561622,0.27958912],"study_design_scores_gemma":[0.0021905233,0.00040324018,0.013309725,0.00022925876,0.0000720501,0.00002227758,0.008831452,0.95439744,0.014172891,0.0033551073,0.0016882392,0.0013277947],"about_ca_topic_score_codex":0.0029590463,"about_ca_topic_score_gemma":0.002039682,"teacher_disagreement_score":0.95223117,"about_ca_system_score_codex":0.000046164387,"about_ca_system_score_gemma":0.000112801354,"threshold_uncertainty_score":0.5911793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33831924,0.00015491142,0.6604609,0.000066022985,0.0006199503,0.0001649046,6.469597e-7,0.000051627096,0.00016179432],"genre_scores_gemma":[0.99902254,0.000021253565,0.0007978866,0.000041160547,0.000075607146,0.000013591215,9.8400925e-8,0.00000902851,0.000018838786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870646,0.000087247136,0.0002952121,0.00029284143,0.00043234203,0.00018587493],"domain_scores_gemma":[0.998966,0.000101806545,0.00012070598,0.00065761857,0.00009731201,0.00005656151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055576855,0.0001285726,0.0002323941,0.00012414691,0.00015074898,0.000036983045,0.0004422165,0.000041322186,0.00000254936],"category_scores_gemma":[0.000007164295,0.00012382933,0.00007598472,0.00027326486,0.000035005214,0.000120626624,0.000013913434,0.00016244297,0.0000014165529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007270762,0.0012162138,0.0044828807,0.000054463097,0.0002415926,0.000004265944,0.0018022902,0.061001573,0.0064035775,0.00026325366,0.000045729186,0.9244115],"study_design_scores_gemma":[0.0076072016,0.006514119,0.028010074,0.0015160615,0.0004910101,0.000050666593,0.0008605272,0.94007635,0.007289177,0.004304048,0.0019216702,0.0013590886],"about_ca_topic_score_codex":0.0002805377,"about_ca_topic_score_gemma":0.0007189698,"teacher_disagreement_score":0.9230524,"about_ca_system_score_codex":0.00002550254,"about_ca_system_score_gemma":0.000019866371,"threshold_uncertainty_score":0.5049614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94660753,0.000011715311,0.0145547055,0.010664245,0.0017538647,0.00012800301,0.00001625852,0.00054247753,0.025721205],"genre_scores_gemma":[0.9945422,4.841275e-7,0.0013818372,0.0031824124,0.00016067854,0.000008940651,0.000002964625,0.000004034187,0.0007164509],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994393,0.000024633111,0.00010080136,0.00016659153,0.00011457845,0.00015409826],"domain_scores_gemma":[0.9992388,0.00016340679,0.000044072767,0.00046205687,0.000053979566,0.00003766832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024041445,0.00006437961,0.000059250815,0.000020738147,0.00020023454,0.00026041875,0.0007659729,0.000026569753,0.00019802296],"category_scores_gemma":[0.000033795237,0.000040010895,0.000034286928,0.0001475175,0.0000041794106,0.00027031745,0.00022079995,0.00019604454,0.00033069574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054891525,0.00007533471,0.0015320368,0.00006530606,0.000048527192,0.000038387036,0.0038639945,0.000018151082,0.7667918,0.08265403,0.025638625,0.11926832],"study_design_scores_gemma":[0.0003026194,0.000036337395,0.013280958,0.000107350206,0.000008346804,0.0002504638,0.00039775317,0.810815,0.0083494745,0.00030366314,0.16562913,0.0005189127],"about_ca_topic_score_codex":0.0001787042,"about_ca_topic_score_gemma":0.00036298519,"teacher_disagreement_score":0.81079686,"about_ca_system_score_codex":0.0000048040333,"about_ca_system_score_gemma":0.000019582845,"threshold_uncertainty_score":0.4250535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018663747,0.0004032007,0.97561544,0.0037053933,0.00010689465,0.0006945005,0.0000066130074,0.00029361606,0.000510563],"genre_scores_gemma":[0.93585193,0.0013112873,0.061721224,0.00060108065,0.000049149516,0.00034809424,0.000021657586,0.000016243614,0.00007932916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998387,0.00016618255,0.0004355102,0.0004742023,0.00022931721,0.0003078258],"domain_scores_gemma":[0.9961013,0.0009823628,0.00012342751,0.0025792331,0.00008357115,0.00013011332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034583366,0.00020282052,0.00020013227,0.00023271632,0.001259041,0.00007677653,0.0016441698,0.00008137795,0.0000037990449],"category_scores_gemma":[0.000020869338,0.00021636834,0.00007326415,0.0006881641,0.00015399429,0.00019582541,0.00013924183,0.00043437356,0.00006323748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003198824,0.00260413,0.0036683755,0.000024843868,0.00013009425,0.0000054308607,0.0023663284,0.14050467,0.001317381,0.013635491,0.0005499111,0.8351613],"study_design_scores_gemma":[0.0015901766,0.0001801566,0.010696033,0.00017810162,0.000030021694,0.00004680043,0.0001211839,0.97389406,0.00027601534,0.0027514007,0.009646727,0.0005893285],"about_ca_topic_score_codex":0.00011734623,"about_ca_topic_score_gemma":0.000055184995,"teacher_disagreement_score":0.91718817,"about_ca_system_score_codex":0.00009412892,"about_ca_system_score_gemma":0.00006158573,"threshold_uncertainty_score":0.9683653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41514432,0.000019169413,0.583364,0.00021648983,0.0003312309,0.000033377375,2.9580778e-7,0.00018144556,0.0007096378],"genre_scores_gemma":[0.890579,0.0000017096114,0.10798684,0.0011871355,0.00010694237,8.2011206e-7,7.322931e-7,0.0000058673418,0.00013094315],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998945,0.000025536068,0.00020666236,0.00027796932,0.00021821503,0.0003266375],"domain_scores_gemma":[0.9992392,0.00021081445,0.00006719173,0.00034019098,0.000048298276,0.00009430961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050507666,0.00010207537,0.00010174187,0.000114449045,0.00023505761,0.0002894047,0.00044548797,0.000038336017,0.000021765862],"category_scores_gemma":[0.0000747545,0.00009589911,0.00006536541,0.000242951,0.000017767818,0.0008341215,0.00017509857,0.00011529012,0.000024728997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033514032,0.00018457852,0.0028426065,0.000025206067,0.00009576929,0.00029941148,0.000993569,0.008434823,0.44860026,0.42423514,0.0022466965,0.112008445],"study_design_scores_gemma":[0.0016725801,0.00012386878,0.005970029,0.00022219072,0.000046912683,0.00021503175,0.000283731,0.87476426,0.09527869,0.015315028,0.0048582735,0.0012493797],"about_ca_topic_score_codex":0.00059535884,"about_ca_topic_score_gemma":0.000022657634,"teacher_disagreement_score":0.86632943,"about_ca_system_score_codex":0.000054471286,"about_ca_system_score_gemma":0.000025108337,"threshold_uncertainty_score":0.3910652},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48500907,0.000011797374,0.51393604,0.00009359962,0.00004593017,0.00003268932,2.9673854e-8,0.000091008165,0.00077981636],"genre_scores_gemma":[0.99517995,6.575015e-7,0.004588986,0.00012798465,0.000015416646,0.0000030187762,4.866879e-7,0.0000037711472,0.000079706195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920386,0.000056112625,0.00013348756,0.00028491477,0.000095914955,0.0002257222],"domain_scores_gemma":[0.9994686,0.00010728039,0.000037015918,0.00031959836,0.00002680208,0.000040661078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049699814,0.000081143815,0.00009849617,0.000037116108,0.000056522586,0.00013749339,0.0003165924,0.000031233198,0.000002053096],"category_scores_gemma":[0.000026611886,0.000060766914,0.0000227809,0.00019408755,0.000021482663,0.00025909365,0.00008992343,0.00014027114,0.000004357381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002907981,0.00013930665,0.41816124,0.000027646098,0.000013548369,0.000016931857,0.0003990077,0.06021563,0.0024191518,0.03634144,0.000016822556,0.4822202],"study_design_scores_gemma":[0.0001669661,0.00003910341,0.04074885,0.00001549667,0.0000010162283,0.0000043291607,0.000024720359,0.95867217,0.00004787359,0.00018301267,0.0000019497595,0.000094520154],"about_ca_topic_score_codex":0.0008515619,"about_ca_topic_score_gemma":0.0013563236,"teacher_disagreement_score":0.8984565,"about_ca_system_score_codex":0.00003452817,"about_ca_system_score_gemma":0.000018229783,"threshold_uncertainty_score":0.24780029},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39998254,0.000015124456,0.58802754,0.0040865713,0.00011121019,0.00011231808,2.6020092e-7,0.00010769831,0.0075567435],"genre_scores_gemma":[0.9925825,5.3710556e-7,0.004182372,0.0018560562,0.0000102976755,0.000021526723,7.5565487e-7,0.000001637695,0.0013442886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995869,0.000024534489,0.00008401533,0.00012820036,0.00007671454,0.0000996437],"domain_scores_gemma":[0.9996998,0.000025448397,0.0000061587943,0.00020480412,0.00003134558,0.000032490374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056611414,0.000042020863,0.000047129222,0.00007765958,0.000035568937,0.00014040404,0.00023884946,0.00001843736,0.00009298796],"category_scores_gemma":[0.000011698923,0.000034806944,0.00002056448,0.00013616949,0.000007932645,0.00031812285,0.000044784305,0.000062036255,0.00033855683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000910287,0.00090473954,0.19225423,0.00002001771,0.000033206157,0.00006839683,0.0022155433,0.098242305,0.037285976,0.4619853,0.055088613,0.15189259],"study_design_scores_gemma":[0.0002153729,0.000015623518,0.028285185,0.000005589076,3.0454837e-7,9.4807166e-7,0.000023135615,0.9704161,0.0003275229,0.00047898802,0.00016076188,0.00007041393],"about_ca_topic_score_codex":0.0027235565,"about_ca_topic_score_gemma":0.0005003963,"teacher_disagreement_score":0.87217385,"about_ca_system_score_codex":0.000017255452,"about_ca_system_score_gemma":0.000038816954,"threshold_uncertainty_score":0.4351576},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006389744,0.00034399796,0.9902562,0.0017445212,0.000061431725,0.00053227146,0.00001551606,0.00011223394,0.00054408144],"genre_scores_gemma":[0.9379245,0.00010611021,0.05910071,0.0010928623,0.00051277335,0.0007492211,0.000049080467,0.0000042762313,0.00046045412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951845,0.0000065177996,0.0000988511,0.00021152775,0.000058748243,0.00010588489],"domain_scores_gemma":[0.9995931,0.00005611782,0.00002748221,0.00022319503,0.000045291617,0.00005483014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007315322,0.00006011041,0.00006355823,0.000026294856,0.00016685926,0.00016230387,0.00016303436,0.000030632997,0.0000016917759],"category_scores_gemma":[0.000014442665,0.00005515225,0.000031853346,0.00008692017,0.000011616665,0.00020187093,0.000018446974,0.000038638824,0.000012801048],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3149475e-7,0.000032176136,0.000023444243,0.0000012061992,0.0000026077375,9.8627105e-8,0.00006970488,0.00003134968,0.013801579,0.021054052,0.0011286231,0.96385425],"study_design_scores_gemma":[0.00071349286,0.00008890697,0.0034869835,0.00001197313,0.000016301428,0.0000057925017,0.000031738884,0.9270323,0.0019580151,0.005002399,0.061366193,0.0002859035],"about_ca_topic_score_codex":0.0000042187094,"about_ca_topic_score_gemma":0.0000017681886,"teacher_disagreement_score":0.96356833,"about_ca_system_score_codex":0.000008129858,"about_ca_system_score_gemma":0.000011988667,"threshold_uncertainty_score":0.22490434},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9184433,0.00018527108,0.07950503,0.00010229838,0.00019114648,0.000043142943,1.0259971e-7,0.00006300738,0.0014666588],"genre_scores_gemma":[0.9962689,0.00002579001,0.0034493913,0.000093997,0.000016517486,0.0000036748588,2.135076e-7,0.0000026975708,0.00013877475],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994294,0.000036174948,0.000118442615,0.00014393013,0.00013491117,0.00013711677],"domain_scores_gemma":[0.9995172,0.00020322559,0.000023107264,0.00020801183,0.0000139313,0.000034540484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009997691,0.000056464833,0.000113425966,0.00012155722,0.000028096905,0.0000089157475,0.0003016698,0.000019569861,0.0000033005872],"category_scores_gemma":[0.000057794987,0.00004961426,0.000037409685,0.00020489747,0.000020165679,0.00016693799,0.00013299042,0.000057876456,0.0000066266366],"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.00005158385,0.00047727305,0.06807449,0.00045006335,0.0000984894,0.0028314579,0.065537445,0.0022172693,0.5884541,0.058299433,0.0024861617,0.21102223],"study_design_scores_gemma":[0.004281377,0.0003394286,0.16564448,0.0006939919,0.000013864676,0.00034273227,0.000278429,0.5575594,0.26642814,0.0025257086,0.00075746246,0.0011349879],"about_ca_topic_score_codex":0.00037042098,"about_ca_topic_score_gemma":0.00003242656,"teacher_disagreement_score":0.55534214,"about_ca_system_score_codex":0.000014845656,"about_ca_system_score_gemma":0.000021244703,"threshold_uncertainty_score":0.20232108},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31491524,0.000027492673,0.63274217,0.0010252635,0.00021984223,0.00005179309,1.9976213e-7,0.0001405464,0.05087745],"genre_scores_gemma":[0.9958315,0.000002280073,0.0014264913,0.001124276,0.00002603073,0.0000023866507,5.6203686e-7,0.0000021192589,0.0015843657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946827,0.00006747392,0.000085086846,0.00017116181,0.00008339879,0.00012459522],"domain_scores_gemma":[0.9996689,0.00006211588,0.00001275392,0.00020946788,0.000015785006,0.00003096185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023228377,0.000054108936,0.00007178752,0.0000545884,0.000042114396,0.00008447503,0.0003046061,0.000018553597,0.000010840401],"category_scores_gemma":[0.000019759547,0.000044317676,0.000017341881,0.000107696455,0.000008050941,0.00021136436,0.0000673011,0.00009151126,0.00009348743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009072614,0.00016751474,0.008762578,0.000009561634,0.000014023811,0.000043227417,0.0026933146,0.007650878,0.0050528226,0.8608691,0.0055966447,0.10913123],"study_design_scores_gemma":[0.0005235019,0.000071900235,0.0043461565,0.000018821258,0.0000010124313,0.000012501967,0.000047003374,0.9881373,0.0004758407,0.0012621622,0.0049149226,0.00018888766],"about_ca_topic_score_codex":0.00045220638,"about_ca_topic_score_gemma":0.00025379917,"teacher_disagreement_score":0.9804864,"about_ca_system_score_codex":0.000014843595,"about_ca_system_score_gemma":0.0000095939895,"threshold_uncertainty_score":0.18072224},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.828552,0.00013237409,0.16930483,0.00022051226,0.000037559545,0.000024621198,1.6434493e-7,0.00007297921,0.001654934],"genre_scores_gemma":[0.99843615,0.000013560805,0.0010827143,0.0001945436,0.0000143578945,0.000002990715,2.1945915e-7,0.000003825927,0.00025161728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992896,0.00005677101,0.00010209062,0.00027359184,0.00010464187,0.00017332425],"domain_scores_gemma":[0.9996052,0.0001429987,0.000019705501,0.00016468742,0.0000129889795,0.00005441392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025839513,0.000090234804,0.00011896302,0.000099987534,0.000086335516,0.00012840725,0.0001468175,0.00002412398,0.0000012154212],"category_scores_gemma":[0.000014858392,0.00006724927,0.0000116126175,0.00010570369,0.00005092223,0.00022458081,0.00006970589,0.00007004731,4.5330341e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041395582,0.00018542276,0.03461382,0.000114888375,0.000033879976,0.000040031642,0.0188232,0.012405094,0.005171211,0.59453255,0.00015107312,0.33388743],"study_design_scores_gemma":[0.00045460512,0.00016300874,0.0025171658,0.000049502487,0.0000034669797,0.000065582564,0.00042831877,0.9954511,0.00009937841,0.00036861308,0.00019956107,0.0001997251],"about_ca_topic_score_codex":0.0011397235,"about_ca_topic_score_gemma":0.0010969787,"teacher_disagreement_score":0.983046,"about_ca_system_score_codex":0.000012868694,"about_ca_system_score_gemma":0.000014555664,"threshold_uncertainty_score":0.27423456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73202556,0.00043433395,0.26451486,0.0011901584,0.00027210457,0.00016719215,0.0000023712564,0.00006195479,0.001331488],"genre_scores_gemma":[0.99190956,0.0005455139,0.007259201,0.00020149216,0.00003686032,0.000008289251,0.0000038160088,0.000010072715,0.00002519759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781334,0.0009614095,0.0005462589,0.00019774065,0.00021695606,0.0002643073],"domain_scores_gemma":[0.99700314,0.0011604285,0.0002821086,0.0011363372,0.00032558804,0.00009239178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009049342,0.00014534013,0.00026352544,0.00043293205,0.00019293957,0.00009733058,0.0019645826,0.0000918432,0.0000030304577],"category_scores_gemma":[0.00015261797,0.00013741266,0.00007687765,0.0010918415,0.00007420648,0.0003408006,0.00019610884,0.000991295,0.00000551001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042270878,0.002371664,0.011844136,0.000008881388,0.00013831755,0.000037173566,0.0016950592,0.79666626,0.005058754,0.04117453,0.0011229465,0.13945954],"study_design_scores_gemma":[0.00085670484,0.00030694678,0.013704062,0.0002548747,0.0000071176396,0.000037033136,0.000084307234,0.9832776,0.00018315867,0.0010086992,0.00010929823,0.0001701658],"about_ca_topic_score_codex":0.00021272183,"about_ca_topic_score_gemma":0.0004781111,"teacher_disagreement_score":0.25988403,"about_ca_system_score_codex":0.00016734832,"about_ca_system_score_gemma":0.00018252298,"threshold_uncertainty_score":0.56035256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661938,0.0001012775,0.032453697,0.00016516108,0.00013209782,0.00014314595,0.0000011575617,0.00004716738,0.000762478],"genre_scores_gemma":[0.99835795,0.000008928716,0.0014064338,0.00009313965,0.000027335518,0.000021054431,0.000016369453,0.0000033185358,0.00006546109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.000081634564,0.00018014405,0.0001995602,0.0005196671,0.00013317584],"domain_scores_gemma":[0.9993095,0.000047999038,0.00009862259,0.00036841442,0.00014480679,0.000030686693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010278306,0.000081538936,0.00015876384,0.00029048056,0.00006924222,0.000029705425,0.00027317475,0.000034515902,0.000032697495],"category_scores_gemma":[0.000040726285,0.000073164425,0.00010117564,0.0008456957,0.000023377745,0.00041413825,0.000053250627,0.00006350199,0.00010132909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044554923,0.00027718474,0.011144875,0.000083085804,0.00092491147,0.0000033690644,0.0045438698,0.61144286,0.17024879,0.0012908066,0.00038498157,0.19961073],"study_design_scores_gemma":[0.00055191084,0.00008343224,0.03926744,0.000026397778,0.00023263904,0.0000010627051,0.000006646438,0.951845,0.007707334,0.00016383678,0.000022281127,0.000092049864],"about_ca_topic_score_codex":0.00001959796,"about_ca_topic_score_gemma":0.0000075751577,"teacher_disagreement_score":0.34040213,"about_ca_system_score_codex":0.000097775075,"about_ca_system_score_gemma":0.00009918885,"threshold_uncertainty_score":0.29835588},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41169593,0.00005506338,0.5766415,0.000018706009,0.004117665,0.0018803007,0.000025286481,0.00046621956,0.0050993417],"genre_scores_gemma":[0.99723005,7.5522e-7,0.0015970652,0.00008851839,0.00022547737,0.000722182,0.00002528273,0.000012717556,0.00009797082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973836,0.00016010331,0.0008637526,0.00039344447,0.00071800145,0.00048107438],"domain_scores_gemma":[0.9977619,0.000081750244,0.0004155018,0.0010031152,0.00047609746,0.00026165094],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017703983,0.00026614903,0.00036703292,0.00046663734,0.00043474263,0.0028352141,0.0009867082,0.0001628413,0.0000021407736],"category_scores_gemma":[0.0001479949,0.00024309538,0.0001108488,0.0007091543,0.000029524846,0.008031701,0.00032367598,0.0004949991,0.00009333831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009445489,0.0004758142,0.0027529157,0.0016040755,0.00021498567,0.000013161596,0.03789623,0.7928904,0.028352598,0.079297245,0.002566318,0.053841762],"study_design_scores_gemma":[0.00028723932,0.000057071,0.00025115057,0.00009091525,0.000008058073,0.00019478859,0.0036580362,0.9792661,0.00013709755,0.000007725601,0.015670586,0.00037122518],"about_ca_topic_score_codex":0.0022731747,"about_ca_topic_score_gemma":0.0000068462405,"teacher_disagreement_score":0.5855341,"about_ca_system_score_codex":0.00026178441,"about_ca_system_score_gemma":0.00014479595,"threshold_uncertainty_score":0.99819994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09252091,0.00011925495,0.9011764,0.00025822353,0.00037285476,0.0009245985,0.000002528536,0.00027077788,0.0043544644],"genre_scores_gemma":[0.98688513,0.0000049161104,0.012464275,0.00028509556,0.000050591534,0.00005418498,0.0000016673478,0.0000050373555,0.00024912145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879587,0.000034937486,0.00020627696,0.00045323378,0.00021224725,0.00029742144],"domain_scores_gemma":[0.9992061,0.00002992316,0.000070947666,0.0005154,0.00010078859,0.00007678582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026666903,0.0001400214,0.00016543415,0.00010299014,0.00015009243,0.00023484147,0.00044849256,0.00004100514,0.0000011924354],"category_scores_gemma":[0.000009372748,0.00012125387,0.000121469704,0.00026301865,0.000014127704,0.00046840683,0.00009401235,0.000072180126,0.00000536506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013176745,0.0010749027,0.0006465505,0.00023314422,0.0002820753,0.00003720548,0.0005086545,0.0017055835,0.018982986,0.82832474,0.0014747495,0.14659767],"study_design_scores_gemma":[0.00086498656,0.0002524721,0.0020348802,0.000075282376,0.000027545057,0.00001766182,0.00026918168,0.9855123,0.0014516646,0.008700025,0.0004081705,0.0003858113],"about_ca_topic_score_codex":0.000059434708,"about_ca_topic_score_gemma":0.000002041147,"teacher_disagreement_score":0.9838067,"about_ca_system_score_codex":0.000083081366,"about_ca_system_score_gemma":0.000024244702,"threshold_uncertainty_score":0.49445894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1904625,0.00034199576,0.8085539,0.00023530732,0.000025735355,0.00011491335,0.00001355843,0.000060237315,0.00019187325],"genre_scores_gemma":[0.9933899,0.000008728683,0.0064587505,0.00008957892,0.000020820442,0.000014108358,0.00001098487,0.0000047087783,0.0000024421201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.00008736858,0.0001981336,0.0003170568,0.0000823425,0.00015124037],"domain_scores_gemma":[0.9991734,0.00018721393,0.00005728302,0.00039635482,0.00003216977,0.00015354977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015696447,0.0001162072,0.00020342029,0.00007908437,0.00018628938,0.00009757072,0.00030606,0.00004083195,8.1715643e-7],"category_scores_gemma":[0.000008252128,0.00009456388,0.00004188172,0.0001884128,0.00012869261,0.00006171095,0.000099685734,0.00016850716,6.67656e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008119965,0.0003595801,0.0073087546,0.000024479887,0.000063604144,0.0000010608956,0.0008931824,0.0018239182,0.0025401358,0.80621517,0.00012950273,0.18063252],"study_design_scores_gemma":[0.00030679593,0.00009192299,0.004107359,0.000014430293,0.000012546996,0.00002931371,0.00006690371,0.9810038,0.00023482289,0.010346501,0.0036203,0.0001652806],"about_ca_topic_score_codex":0.000009936038,"about_ca_topic_score_gemma":0.0000034736088,"teacher_disagreement_score":0.9791799,"about_ca_system_score_codex":0.0000052934615,"about_ca_system_score_gemma":0.000024957637,"threshold_uncertainty_score":0.38562033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17505938,0.00001714282,0.822112,0.0015262238,0.0004584763,0.0003747678,0.0000015281221,0.00025101937,0.00019942016],"genre_scores_gemma":[0.94916564,0.0000048481133,0.048600193,0.0019265977,0.00017877006,0.000068663394,0.0000049085133,0.000009467594,0.00004090747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970241,0.00004639649,0.0004219388,0.0009217585,0.0006104635,0.00097530684],"domain_scores_gemma":[0.99859464,0.00008940885,0.00015334543,0.00070305774,0.00020697474,0.0002525565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006986284,0.00023930754,0.00022147699,0.0004998417,0.00025366998,0.00090828544,0.0021650004,0.000052460262,0.0000078160865],"category_scores_gemma":[0.000029507915,0.0002206398,0.00007255987,0.0023572226,0.00019417227,0.0011285164,0.0009577459,0.00023376361,0.000068623674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019124853,0.00066724885,0.03945611,0.00017855923,0.00004323425,0.00035411256,0.0012195143,0.10816077,0.0028580253,0.03103889,0.004236742,0.8117677],"study_design_scores_gemma":[0.00039017995,0.000041985513,0.017450275,0.00007073905,0.0000025862516,0.00001647817,0.000011971115,0.98093283,0.00033113832,0.0004085631,0.000059640024,0.00028363845],"about_ca_topic_score_codex":0.0002079237,"about_ca_topic_score_gemma":0.000009087733,"teacher_disagreement_score":0.87277204,"about_ca_system_score_codex":0.00015088817,"about_ca_system_score_gemma":0.00022702006,"threshold_uncertainty_score":0.899743},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4180825,0.000018724784,0.5804462,0.00032466586,0.00018947755,0.00009299986,0.0000028004342,0.00009962223,0.00074303464],"genre_scores_gemma":[0.9986656,0.0000055253868,0.00032775957,0.00039558846,0.00008370356,0.000007674146,0.000028596964,0.00000448991,0.0004810961],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99912,0.00003649357,0.0001431473,0.00018001297,0.0001756754,0.00034468915],"domain_scores_gemma":[0.9995079,0.000023457527,0.00004498265,0.00027080392,0.000044769167,0.000108084554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019148421,0.00011135988,0.0001271158,0.000033118657,0.00004749761,0.000058075355,0.00030703942,0.000057557514,0.000019430878],"category_scores_gemma":[0.000003495032,0.0000791652,0.00003221332,0.00020803466,0.000024756728,0.00053818437,0.00011430726,0.00016820409,0.0000104706305],"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.000060489412,0.00014693542,0.736279,0.000012537015,0.000038861865,0.000039862953,0.00056673685,0.00045263307,0.00035831175,0.17993549,0.0064356267,0.07567352],"study_design_scores_gemma":[0.001344983,0.00021266153,0.73408926,0.00006342946,0.000013112227,0.00015371284,0.00020509961,0.2613672,0.0002937067,0.00017059494,0.0015431994,0.0005430327],"about_ca_topic_score_codex":0.00050910073,"about_ca_topic_score_gemma":0.00012794945,"teacher_disagreement_score":0.58058304,"about_ca_system_score_codex":0.00006354895,"about_ca_system_score_gemma":0.000026027645,"threshold_uncertainty_score":0.3228263},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95599484,0.00007374081,0.029829578,0.0032007378,0.00061548426,0.00013945521,0.0000022004065,0.00020952833,0.0099344505],"genre_scores_gemma":[0.9973685,0.000014916511,0.00031393694,0.0010524453,0.00003992179,0.000007634267,0.0000021240069,0.0000048708293,0.0011956278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924755,0.00004130592,0.00012324548,0.00019036992,0.00025546548,0.00014204359],"domain_scores_gemma":[0.99913925,0.000083912186,0.0000811911,0.00053525553,0.00011933973,0.000041037998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030235673,0.00007637819,0.00008358572,0.00006742839,0.000075699296,0.0003473648,0.0009773595,0.000043303313,0.00010309867],"category_scores_gemma":[0.000048045746,0.00004628402,0.000054166576,0.00027740322,0.000033006283,0.0008620953,0.00027631037,0.00010381352,0.000021541473],"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.00002446273,0.00042686783,0.09938242,0.00007070642,0.00012358524,0.000009149109,0.0017989603,0.00003887903,0.12577458,0.715679,0.039811715,0.016859654],"study_design_scores_gemma":[0.0025423532,0.00034198447,0.19940868,0.00014399411,0.000086400476,0.000096982345,0.00070328807,0.5618891,0.13265498,0.0051616803,0.09568646,0.001284118],"about_ca_topic_score_codex":0.000562782,"about_ca_topic_score_gemma":0.0010159614,"teacher_disagreement_score":0.71051735,"about_ca_system_score_codex":0.0000042073443,"about_ca_system_score_gemma":0.00006035924,"threshold_uncertainty_score":0.3349647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9129677,0.00024294303,0.08263192,0.00024150757,0.00023626132,0.0000894305,4.4006939e-7,0.0000753751,0.0035144628],"genre_scores_gemma":[0.9944763,0.000015477059,0.0049345093,0.00026094881,0.000026957545,0.000001375761,2.3666038e-7,0.0000027739497,0.0002813908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992778,0.00003058861,0.00019173924,0.00015572383,0.00016229281,0.00018191125],"domain_scores_gemma":[0.99927753,0.0002746716,0.00005182769,0.00032385747,0.000041839678,0.000030295234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161999,0.00006393364,0.00008636487,0.000091919166,0.000033914697,0.000030769916,0.0005228214,0.000030750387,0.0000063203543],"category_scores_gemma":[0.000046233097,0.000041503998,0.000047957474,0.0002122386,0.00003106532,0.00017667767,0.00016973366,0.000108171036,0.0000117035115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002571992,0.00012575697,0.009262394,0.000016384894,0.000017490289,0.00005735803,0.002531691,0.00011134852,0.27562767,0.0053853136,0.0010787246,0.7057602],"study_design_scores_gemma":[0.00085467816,0.000075561475,0.024059452,0.00003627703,0.00000600797,0.000013176769,0.0011249414,0.93841934,0.034744736,0.00021242005,0.0002173396,0.00023607671],"about_ca_topic_score_codex":0.00042360695,"about_ca_topic_score_gemma":0.00065280043,"teacher_disagreement_score":0.938308,"about_ca_system_score_codex":0.00001601795,"about_ca_system_score_gemma":0.000037435406,"threshold_uncertainty_score":0.16924839},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018493576,0.00013189613,0.97142047,0.0058949534,0.000045262914,0.00014969394,0.00002841045,0.00015919693,0.0036765146],"genre_scores_gemma":[0.8776559,0.000028029343,0.11532657,0.0035754968,0.000053810127,0.00002169078,0.000049474293,0.00000955997,0.0032794324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990996,0.000010472625,0.00011263704,0.0005322347,0.00010336913,0.00014166727],"domain_scores_gemma":[0.9983136,0.00010131509,0.000022178116,0.0014810137,0.000024315954,0.000057583242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027845067,0.00008009815,0.00008592231,0.00003460928,0.00012947206,0.00016403978,0.00086530065,0.00002770552,0.000014637161],"category_scores_gemma":[0.00008336286,0.00006465821,0.000024186158,0.00008222524,0.000016413785,0.00030087453,0.00023700143,0.00007621571,0.00000436237],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001511841,0.000046055462,0.00016208613,0.000012463045,0.00002060042,0.0000012945915,0.0003270026,0.00040112156,0.0014866801,0.011028589,0.008296481,0.9782025],"study_design_scores_gemma":[0.0006969463,0.00007295385,0.0019160832,0.000028593931,0.000014782612,0.00009796292,0.000019786408,0.8401699,0.0001889574,0.004044603,0.15245348,0.00029592516],"about_ca_topic_score_codex":0.00033821506,"about_ca_topic_score_gemma":0.000051807994,"teacher_disagreement_score":0.9779066,"about_ca_system_score_codex":0.00000829957,"about_ca_system_score_gemma":0.00003240262,"threshold_uncertainty_score":0.26366854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31512487,0.000069345995,0.6710574,0.007318066,0.0011567106,0.00021594536,0.000008233687,0.0007490336,0.0043003806],"genre_scores_gemma":[0.9952066,0.000021356864,0.0022483927,0.0019649938,0.000033070315,0.000038024547,5.192249e-7,0.0000122739,0.00047479363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990351,0.0000567329,0.00016257692,0.00031663245,0.00018253933,0.00024637373],"domain_scores_gemma":[0.99841964,0.00015784349,0.000050551527,0.0012736394,0.00003247845,0.00006582866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029971244,0.00013644138,0.000108198394,0.00011938216,0.00036106256,0.00013000387,0.0015703051,0.000049592905,0.00016108077],"category_scores_gemma":[0.000018163206,0.0001031606,0.00014327704,0.00029695165,0.00003526975,0.00029497012,0.000023681785,0.0003031902,0.00026223093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003705214,0.0015852051,0.0021556467,0.00006652623,0.00048512587,0.00013488362,0.007914987,0.0012155034,0.27094904,0.022002188,0.0013137064,0.6918067],"study_design_scores_gemma":[0.004131069,0.00082961837,0.0118611725,0.0010653393,0.00024963683,0.00012393278,0.00063559145,0.78271604,0.16219884,0.013856667,0.019843668,0.0024884585],"about_ca_topic_score_codex":0.00006421359,"about_ca_topic_score_gemma":0.00002390792,"teacher_disagreement_score":0.7815005,"about_ca_system_score_codex":0.000033505803,"about_ca_system_score_gemma":0.00005225281,"threshold_uncertainty_score":0.4206767},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.205276,0.0028894367,0.7476231,0.034613147,0.00056383165,0.00039894,0.000030258665,0.00094715646,0.007658126],"genre_scores_gemma":[0.99546725,0.0008371406,0.0029097267,0.00045502573,0.000052385734,0.000053191634,0.00002961411,0.000011697876,0.00018398826],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891067,0.00024429391,0.00022494144,0.00024949014,0.00018731618,0.00018327891],"domain_scores_gemma":[0.9972037,0.00046704052,0.00009673068,0.001952115,0.00015736441,0.00012305602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033272966,0.00014024913,0.00017165576,0.000116683885,0.00038536923,0.00017349067,0.0019804235,0.00006514037,0.0000017218772],"category_scores_gemma":[0.000025000081,0.00014165844,0.000044123386,0.00020517067,0.00023484482,0.00044166922,0.0005396535,0.00019334671,0.000021078109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004527959,0.00015297803,0.00087541714,0.000055149467,0.00005868554,0.0000021675194,0.0062012565,0.0001262589,0.00024075189,0.44754001,0.0008892959,0.5438535],"study_design_scores_gemma":[0.00039234737,0.00004165129,0.0030152865,0.00009795524,0.000031084397,0.0000339209,0.0015092195,0.98283994,0.00014068192,0.0031076465,0.008354256,0.0004360154],"about_ca_topic_score_codex":0.00051187625,"about_ca_topic_score_gemma":0.0002440242,"teacher_disagreement_score":0.9827137,"about_ca_system_score_codex":0.000026784151,"about_ca_system_score_gemma":0.00007748835,"threshold_uncertainty_score":0.57766634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07268629,0.00052586995,0.87795633,0.04349503,0.00031588905,0.0009315486,0.0000111851095,0.0004879494,0.0035898914],"genre_scores_gemma":[0.99247557,0.000013781082,0.003095267,0.002499093,0.00044029974,0.00014289476,0.000016395175,0.000010777991,0.0013059492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983484,0.00005163458,0.0002592231,0.00056653324,0.00037538444,0.00039879128],"domain_scores_gemma":[0.99896383,0.000071169685,0.00004918243,0.0005760032,0.000121588935,0.00021819379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066344,0.00017187106,0.00019998493,0.00018616409,0.0003200055,0.0002910016,0.0006054803,0.00007086066,0.0000013900124],"category_scores_gemma":[0.000023260225,0.00018024335,0.000051641062,0.00076263363,0.000011835978,0.0001544893,0.00017099826,0.00029423836,0.000036705744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021111622,0.00028615422,0.022574646,0.000018911018,0.000021710537,0.00001759826,0.002271689,0.015967688,0.0005959691,0.032887936,0.013863766,0.9114728],"study_design_scores_gemma":[0.0012534168,0.00022716542,0.11342258,0.0003371592,0.000043952936,0.00007250556,0.00019002399,0.16613774,0.00005589196,0.017714724,0.699056,0.001488803],"about_ca_topic_score_codex":0.00029829724,"about_ca_topic_score_gemma":0.00011865916,"teacher_disagreement_score":0.91978925,"about_ca_system_score_codex":0.000053167543,"about_ca_system_score_gemma":0.00002289755,"threshold_uncertainty_score":0.73501104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47240874,0.000023293313,0.434503,0.00016825204,0.00031476573,0.00009427244,4.6566544e-7,0.0003236016,0.09216362],"genre_scores_gemma":[0.99659884,0.0000063910034,0.0006221593,0.0011276781,0.000040839073,0.0000047102067,6.6411354e-7,0.0000055723394,0.0015931225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991342,0.0000070152573,0.00013338745,0.0003135918,0.00020582518,0.00020599503],"domain_scores_gemma":[0.99930155,0.000072932744,0.000031994834,0.0004992674,0.000018936205,0.00007530498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026515295,0.00009563091,0.00010212403,0.000070671544,0.00011853528,0.00018064678,0.0005409487,0.00003578565,0.00001988995],"category_scores_gemma":[0.000015542915,0.00007073652,0.000054603443,0.000116001116,0.000015765892,0.000314476,0.0001887013,0.00011267586,0.00015730178],"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.000013496944,0.000050131322,0.0006312995,0.000006867562,0.000011816657,0.000005911206,0.00032411958,0.0008610755,0.000613599,0.9638239,0.0009568359,0.032700934],"study_design_scores_gemma":[0.0014821152,0.0009912685,0.0010402927,0.00011382468,0.00000791067,0.000025018373,0.00047983814,0.9043415,0.002373929,0.07107634,0.017385585,0.00068236736],"about_ca_topic_score_codex":0.000060103386,"about_ca_topic_score_gemma":0.000028549239,"teacher_disagreement_score":0.9034804,"about_ca_system_score_codex":0.000051422456,"about_ca_system_score_gemma":0.000013110718,"threshold_uncertainty_score":0.28845516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47231412,0.000031722895,0.509645,0.00016716596,0.00012453325,0.000110767374,7.3083027e-7,0.000027381508,0.017578604],"genre_scores_gemma":[0.99255556,0.0000017697522,0.007339115,0.00008427539,0.0000032948462,0.000002050216,4.139188e-7,6.1756356e-7,0.000012876636],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993793,0.000051346517,0.00024242887,0.000059370097,0.00018776092,0.000079813726],"domain_scores_gemma":[0.9995236,0.00010390594,0.000088449095,0.00022904892,0.000041260482,0.000013767313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032664606,0.000039960443,0.000092192,0.00007804664,0.000016720254,0.000014682266,0.0005540004,0.000021529042,0.0000046332916],"category_scores_gemma":[0.000038974784,0.000026154094,0.000030974395,0.00021779789,0.00003003766,0.00053107593,0.000078247205,0.00007016056,0.0000050285807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004926606,0.00053435244,0.56225777,0.00007387192,0.00002968588,0.0000033307401,0.18505968,0.000661263,0.00097262056,0.07473766,0.004961281,0.1706592],"study_design_scores_gemma":[0.0003599529,0.00021720536,0.13961849,0.000052044892,0.0000057430902,0.00000567687,0.004551898,0.8469116,0.0067147436,0.0011580465,0.00027562058,0.00012893957],"about_ca_topic_score_codex":0.0007825338,"about_ca_topic_score_gemma":0.000021566837,"teacher_disagreement_score":0.84625036,"about_ca_system_score_codex":0.0000065148506,"about_ca_system_score_gemma":0.000017073893,"threshold_uncertainty_score":0.11829622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.352192,0.00024211624,0.64460355,0.001067628,0.000104013016,0.00060081464,2.5388775e-7,0.000023671715,0.0011659187],"genre_scores_gemma":[0.9954856,0.0000069750613,0.0043060496,0.0001206685,0.0000069116227,0.000015670525,0.0000012393162,0.0000011584492,0.000055694505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990899,0.00024156556,0.00009261837,0.00022811386,0.0002825329,0.000065282584],"domain_scores_gemma":[0.9990018,0.000096366646,0.000026424445,0.0007930354,0.00006477527,0.000017599628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049818233,0.00004020226,0.000049239057,0.000025787804,0.000016813918,0.000033325967,0.00044537772,0.000011755509,0.0000026344032],"category_scores_gemma":[0.00010352786,0.000024481293,0.0000054282673,0.000113813614,0.000018167848,0.00015479115,0.0003253995,0.00004469965,0.0000014789745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011350925,0.00052597956,0.0023198617,0.000024727779,0.000076953605,0.0000033533388,0.0009520073,0.19335486,0.00011230752,0.13197117,0.019784201,0.65076107],"study_design_scores_gemma":[0.00022630363,0.000023823786,0.0018436267,0.000011772691,0.0000058388414,2.8768338e-7,0.000051792525,0.99451566,0.000051513518,0.0031998071,0.00003823007,0.000031364292],"about_ca_topic_score_codex":0.0000478434,"about_ca_topic_score_gemma":0.000010535875,"teacher_disagreement_score":0.8011608,"about_ca_system_score_codex":0.000021433725,"about_ca_system_score_gemma":0.000024754509,"threshold_uncertainty_score":0.17266105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07864003,0.000011108859,0.8770867,0.0032970665,0.0010887627,0.000039009727,1.3312398e-7,0.00039618387,0.03944103],"genre_scores_gemma":[0.96916455,0.0000015695504,0.028331714,0.00068193866,0.000057819823,0.0000016657228,3.1158584e-7,0.0000038949256,0.0017565279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993689,0.000011202003,0.00009820038,0.00019666449,0.00014428169,0.00018075724],"domain_scores_gemma":[0.99962234,0.00003773485,0.00002031865,0.00024575542,0.0000195437,0.000054307762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018292826,0.00007189662,0.00007027331,0.00012136138,0.00012492832,0.0002001507,0.00044895938,0.00002479001,0.000031506253],"category_scores_gemma":[0.000014059645,0.000061351275,0.000041948228,0.00029017177,0.000017772385,0.00026401636,0.00010948236,0.00017246814,0.000051704235],"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":[8.300436e-7,0.0000070209153,0.00008079633,0.0000023155503,0.0000056980443,0.000007243749,0.00014239446,0.00002802188,0.0014939653,0.96799123,0.0011229558,0.0291175],"study_design_scores_gemma":[0.0018388355,0.000109398105,0.005055045,0.00013391944,0.000022516986,0.00021617969,0.0008212064,0.8282712,0.0077550416,0.09266403,0.06088916,0.0022234872],"about_ca_topic_score_codex":0.000027549639,"about_ca_topic_score_gemma":0.0005072253,"teacher_disagreement_score":0.8905245,"about_ca_system_score_codex":0.000048499132,"about_ca_system_score_gemma":0.00007694144,"threshold_uncertainty_score":0.25018325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8267981,0.000018999766,0.16214082,0.00069555035,0.00047034872,0.00007610812,0.0000017487017,0.00010691705,0.009691449],"genre_scores_gemma":[0.99541366,0.0000014851728,0.0035762063,0.0004906237,0.00004618131,0.0000042526553,7.0600197e-7,0.0000022539996,0.00046463255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993917,0.000021734231,0.00014037298,0.00014208147,0.00019586149,0.000108296226],"domain_scores_gemma":[0.9995937,0.000026294936,0.0000404158,0.00016342284,0.00013002256,0.000046157173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013628519,0.000055750752,0.00009936785,0.000032623575,0.000032601038,0.000015990643,0.00031199108,0.00002720232,0.000030014528],"category_scores_gemma":[0.000032697964,0.000046619018,0.00005268447,0.000113307506,0.000014189428,0.0001141755,0.00007606515,0.0000362608,0.000052141622],"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.00017378751,0.0003982223,0.006341807,0.000021224134,0.000075636846,0.000015735128,0.07983909,0.0000075214575,0.23778522,0.5500324,0.033308398,0.09200096],"study_design_scores_gemma":[0.0046987403,0.0012751503,0.58222,0.00012015896,0.000068891626,0.00002586271,0.0048556956,0.040590703,0.34115008,0.012346076,0.01080312,0.0018454996],"about_ca_topic_score_codex":0.00052174064,"about_ca_topic_score_gemma":0.0004437102,"teacher_disagreement_score":0.5758782,"about_ca_system_score_codex":0.00002309418,"about_ca_system_score_gemma":0.000032260865,"threshold_uncertainty_score":0.19010684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9613806,0.00001161957,0.02467781,0.009123511,0.00013874634,0.00024731905,5.0198526e-7,0.00005987528,0.004360037],"genre_scores_gemma":[0.9883361,0.0000031426225,0.00026856325,0.010535565,0.00001806311,0.000091608745,7.70287e-7,0.0000013405702,0.00074485585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947,0.00005193382,0.00008370232,0.00015347594,0.00013488515,0.00010601651],"domain_scores_gemma":[0.9994843,0.00012771395,0.000011328969,0.0003063957,0.00004555661,0.000024689525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014090247,0.00005338669,0.00004444768,0.000044610057,0.000042448835,0.00022842693,0.00058943493,0.0000141185865,0.000026473232],"category_scores_gemma":[0.000014301278,0.00003196419,0.000016730455,0.00028449768,0.0000028391814,0.00031546844,0.00006765015,0.00005550285,0.0009953298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046761223,0.00087077526,0.003780402,0.00007673073,0.00003174859,0.000025830299,0.081350826,0.03732624,0.020915864,0.14243717,0.29176402,0.42137364],"study_design_scores_gemma":[0.0015451553,0.0017144503,0.083248146,0.00016944713,0.0000100864245,0.00002582009,0.009534266,0.75302285,0.0047628153,0.036944006,0.107551955,0.0014709933],"about_ca_topic_score_codex":0.0060964045,"about_ca_topic_score_gemma":0.0018677203,"teacher_disagreement_score":0.71569663,"about_ca_system_score_codex":0.000010910439,"about_ca_system_score_gemma":0.000008625531,"threshold_uncertainty_score":0.9997825},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8527784,0.00016474939,0.13711311,0.0009655915,0.00029315025,0.000104353676,8.233358e-7,0.00029039735,0.008289466],"genre_scores_gemma":[0.9961839,0.000017021834,0.0012845411,0.0006196197,0.000035019384,0.0000053109293,0.0000013535224,0.000004809244,0.0018484812],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909836,0.00006176249,0.00015366435,0.0002723624,0.00019268037,0.00022116849],"domain_scores_gemma":[0.9994874,0.000033714485,0.000023960629,0.0003746905,0.00002317497,0.000057074405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018583456,0.000090698304,0.00012269182,0.00010803115,0.000118737094,0.00004680114,0.00050702045,0.000044876033,0.000013267727],"category_scores_gemma":[0.000018074212,0.000081317354,0.00005553707,0.00021669957,0.000014015328,0.0004010644,0.00017625999,0.0001922647,0.000059958267],"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.00003668711,0.0005859493,0.8780713,0.00004934897,0.000039055547,0.0015905799,0.006046619,0.0014205964,0.0016917712,0.051019922,0.009743711,0.049704447],"study_design_scores_gemma":[0.0037214467,0.00021705839,0.45563784,0.00015744356,0.00001067519,0.00078888924,0.00024789525,0.52629477,0.000685877,0.00406804,0.0066654547,0.0015045886],"about_ca_topic_score_codex":0.0027625717,"about_ca_topic_score_gemma":0.00039550013,"teacher_disagreement_score":0.5248742,"about_ca_system_score_codex":0.00003960076,"about_ca_system_score_gemma":0.000032400374,"threshold_uncertainty_score":0.41762003},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54269207,0.000012219342,0.45617923,0.00009877774,0.0001288429,0.0000802132,0.0000040480777,0.00009080877,0.0007137753],"genre_scores_gemma":[0.9943647,0.0000074403306,0.004702014,0.00066483254,0.00004001294,0.000020854444,0.000006416889,0.000004675378,0.00018909693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988907,0.00006672134,0.00019582205,0.0004041296,0.00015754467,0.00028506812],"domain_scores_gemma":[0.99916935,0.0001557363,0.000055922388,0.0004794163,0.00006348259,0.000076096774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035111135,0.00012626941,0.00015825931,0.00006337366,0.00006127232,0.00034620994,0.00073961023,0.000041124564,0.0000024679637],"category_scores_gemma":[0.000030227779,0.00011091306,0.000050489154,0.00015979656,0.000018526162,0.001762755,0.00014746249,0.00009160311,0.000012657736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029327656,0.0012149658,0.055753853,0.00048479094,0.000067677924,0.0000141036635,0.0074660685,0.004109568,0.11749567,0.68359387,0.00033964854,0.12916648],"study_design_scores_gemma":[0.00075312634,0.0002229449,0.0060052457,0.00006534696,0.0000023697314,0.000001079182,0.000110938316,0.9469416,0.007334287,0.037796907,0.00040706652,0.0003591002],"about_ca_topic_score_codex":0.0011392045,"about_ca_topic_score_gemma":0.0024872932,"teacher_disagreement_score":0.942832,"about_ca_system_score_codex":0.000030459716,"about_ca_system_score_gemma":0.000044848068,"threshold_uncertainty_score":0.45229033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010718663,0.00001554656,0.9797121,0.00082912506,0.00031399808,0.0003004,0.000007856206,0.00025265673,0.007849623],"genre_scores_gemma":[0.8587036,0.0000041077983,0.13802925,0.003124921,0.000031709777,0.000023086697,0.000040597846,0.000005886309,0.0000368272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986329,0.00006982502,0.00031333792,0.0003460419,0.0004190932,0.00021878236],"domain_scores_gemma":[0.9986728,0.00008023567,0.00021672637,0.00084084837,0.00012313073,0.000066246306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770128,0.00016492115,0.00014989068,0.00017400633,0.0003389975,0.0009053102,0.0008722262,0.000049740323,0.00000474056],"category_scores_gemma":[0.000048056132,0.00014937832,0.000025013147,0.0002194896,0.000038947608,0.00690166,0.0004873674,0.00023596424,0.00001647411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005359496,0.00007257055,0.00007246694,0.0000907738,0.000020521675,0.000004321607,0.0011234055,0.0011665904,0.00006793936,0.042440552,0.00020226359,0.954685],"study_design_scores_gemma":[0.00088932127,0.000090947746,0.0014280125,0.00008738074,0.000021548769,0.0000071155837,0.00039042323,0.9886628,0.000103387465,0.0015956614,0.0065072156,0.00021620607],"about_ca_topic_score_codex":0.00009699359,"about_ca_topic_score_gemma":0.000021753385,"teacher_disagreement_score":0.9874962,"about_ca_system_score_codex":0.000027779699,"about_ca_system_score_gemma":0.000037932186,"threshold_uncertainty_score":0.8729927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08446736,0.000107450636,0.9122426,0.0028195742,0.000032476524,0.00017641198,4.3352796e-7,0.000015148467,0.00013854972],"genre_scores_gemma":[0.99391514,0.000081483464,0.0055615134,0.00028381002,0.000046659985,0.000029153354,3.0255438e-7,0.0000044603776,0.00007749912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992953,0.000019074616,0.00029039994,0.00013071585,0.00009293392,0.00017157926],"domain_scores_gemma":[0.9994122,0.0002378916,0.000103358594,0.00012376047,0.0000981741,0.000024613972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041544894,0.00007288497,0.00013389527,0.000039651088,0.0001403538,0.00012356903,0.00029735372,0.00003576372,0.00000241439],"category_scores_gemma":[0.00008752538,0.000052397754,0.00006110352,0.00011307556,0.000051967832,0.00014198718,0.00008974845,0.00010501706,0.000003761217],"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.0000039955694,0.00011212207,0.00003233787,0.00003288931,0.000010385878,3.5310805e-7,0.005172024,0.04248171,0.00054338865,0.669899,0.00047649437,0.28123534],"study_design_scores_gemma":[0.0000067330143,0.000021979175,0.000007708979,0.00001782351,0.0000013155341,4.8659405e-7,0.00049847836,0.7574095,0.0002914978,0.24168245,0.000013570979,0.00004842531],"about_ca_topic_score_codex":0.00008306479,"about_ca_topic_score_gemma":0.000037125552,"teacher_disagreement_score":0.9094478,"about_ca_system_score_codex":0.000001941386,"about_ca_system_score_gemma":0.000012141292,"threshold_uncertainty_score":0.21367185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2643855,0.000020194764,0.71435213,0.0006694034,0.0010303927,0.000028002512,1.533046e-7,0.0002484938,0.01926571],"genre_scores_gemma":[0.9282232,0.0000014673464,0.06887741,0.0004970672,0.00007915056,0.0000016805362,7.8986666e-8,0.0000017894414,0.0023181553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996576,0.0000052038317,0.000047076082,0.000121988924,0.00007814666,0.00009004234],"domain_scores_gemma":[0.9996284,0.000013688196,0.000008220065,0.0002899299,0.00001841262,0.000041312313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004851929,0.000034608645,0.00003129234,0.000023008175,0.00003677777,0.00007264121,0.00036713178,0.000018715833,0.000041142284],"category_scores_gemma":[0.000006306947,0.000027828919,0.00002431409,0.00005963898,0.000009294468,0.000089650304,0.000078347606,0.000085802865,0.0002291609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.0928587e-7,0.000050980805,0.0030849085,0.0000018290838,0.0000087920225,0.00003686379,0.00013446613,0.000015236662,0.069210365,0.14288953,0.0065204296,0.7780459],"study_design_scores_gemma":[0.00043753677,0.00007763887,0.04994787,0.0000035635765,0.0000044988583,0.00019168883,0.0000151648355,0.8893696,0.004696987,0.009960979,0.04487036,0.00042408844],"about_ca_topic_score_codex":0.000072862545,"about_ca_topic_score_gemma":0.00002097234,"teacher_disagreement_score":0.8893544,"about_ca_system_score_codex":0.000001683303,"about_ca_system_score_gemma":0.000011858744,"threshold_uncertainty_score":0.29454762},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902087,0.0001094401,0.008296858,0.00024304767,0.00021056428,0.0000362715,6.430066e-7,0.000056382087,0.000838086],"genre_scores_gemma":[0.99869907,0.000011785441,0.00044131308,0.0006014275,0.000024234794,0.000002053068,0.0000010422182,0.000002515291,0.00021658925],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99946743,0.00006666619,0.00008456399,0.000120777295,0.00007119614,0.00018934127],"domain_scores_gemma":[0.9996834,0.00007088412,0.00001624784,0.00015646768,0.0000082180795,0.00006478764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005400384,0.00005357548,0.000071656264,0.000060014674,0.00002768659,0.00007553766,0.00015274712,0.000021135513,0.0000035092505],"category_scores_gemma":[0.000033474073,0.00004582253,0.000012897183,0.0001170942,0.000008678923,0.0006595824,0.00011368863,0.0000625516,0.000021187916],"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.000004129104,0.00003084051,0.97772205,0.0000026859927,0.0000038513126,0.0000025321076,0.0010834944,3.6512074e-7,0.0037934927,0.0020662693,0.00013085057,0.01515942],"study_design_scores_gemma":[0.00013534911,0.000009333271,0.99435765,0.000008048181,6.3635673e-7,0.000007665042,0.000033535216,0.0048496965,0.00018615334,0.000016101487,0.0003071242,0.00008871965],"about_ca_topic_score_codex":0.0012317955,"about_ca_topic_score_gemma":0.00016386625,"teacher_disagreement_score":0.016635569,"about_ca_system_score_codex":0.000012027129,"about_ca_system_score_gemma":0.000007702664,"threshold_uncertainty_score":0.18685885},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96231127,0.00008212015,0.0044314265,0.0016866307,0.00021916413,0.0003387686,2.709868e-7,0.00025104685,0.030679286],"genre_scores_gemma":[0.99075377,0.0000054190814,0.0013521429,0.0012382909,0.000060433485,0.00007535456,4.5320238e-7,0.000005486749,0.0065086605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906033,0.000068214875,0.00017378031,0.0002480534,0.00020484916,0.0002447911],"domain_scores_gemma":[0.9992614,0.00013447994,0.00003767692,0.000482229,0.000037134414,0.00004710763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029671565,0.000096360345,0.00009683524,0.000048718422,0.00013857633,0.0005867472,0.0010697492,0.00003234521,0.00020974594],"category_scores_gemma":[0.000021048994,0.00005936358,0.0000523298,0.0001852264,0.000016312551,0.0006119901,0.0003371846,0.00017775122,0.00093803805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012747772,0.00074723404,0.026725717,0.00004924095,0.0001059537,0.000053817388,0.010741748,0.006823684,0.17699958,0.06847082,0.135028,0.57424146],"study_design_scores_gemma":[0.00029746033,0.000054517383,0.0030167059,0.000021276073,0.0000027807828,0.0000145818485,0.00023266836,0.9919494,0.00058564084,0.0009199614,0.002688368,0.00021668585],"about_ca_topic_score_codex":0.00048235393,"about_ca_topic_score_gemma":0.000029266039,"teacher_disagreement_score":0.98512566,"about_ca_system_score_codex":0.000022105749,"about_ca_system_score_gemma":0.000031991403,"threshold_uncertainty_score":0.99983984},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099061616,0.00013857782,0.8873058,0.0045114122,0.0004991093,0.00033979493,0.00001885861,0.0003802391,0.0077445772],"genre_scores_gemma":[0.98315173,0.0000036296217,0.010916599,0.004695449,0.00009849036,0.00003736293,0.000022112947,0.000004222483,0.0010704249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994277,0.000011764825,0.00008655843,0.0002547583,0.00008836697,0.0001308545],"domain_scores_gemma":[0.99911964,0.00009486667,0.000025255957,0.0006781271,0.00004008606,0.000042036743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013367507,0.000053325173,0.000056758614,0.000024716923,0.00010825667,0.00030339803,0.00085053674,0.000013607011,0.000034618784],"category_scores_gemma":[0.000009948204,0.00004187337,0.000020370739,0.000048286092,0.0000061056203,0.00084508496,0.00024837727,0.00003185436,0.00027938452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027973621,0.00036782908,0.006629648,0.00024221206,0.00017467304,0.000011830157,0.0009874513,0.001123583,0.009536478,0.40877184,0.40615848,0.16596797],"study_design_scores_gemma":[0.00026709918,0.00006178898,0.0011667211,0.00003300395,0.0000042003135,0.0000036500928,0.000056759243,0.965995,0.00034318093,0.008033718,0.02389669,0.00013816066],"about_ca_topic_score_codex":0.00016826179,"about_ca_topic_score_gemma":0.000035077268,"teacher_disagreement_score":0.96487147,"about_ca_system_score_codex":0.000004507521,"about_ca_system_score_gemma":0.000008757968,"threshold_uncertainty_score":0.3591016},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025438175,0.00024280157,0.97109354,0.0012271531,0.0004647967,0.00033231557,0.000045916186,0.00036708135,0.0007882114],"genre_scores_gemma":[0.99478436,0.0012309584,0.0029593362,0.00046186568,0.000038011098,0.0002576761,0.000058468697,0.000028643366,0.00018066025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773496,0.00043190437,0.00048994436,0.0006434527,0.00029408027,0.00040562995],"domain_scores_gemma":[0.99109006,0.0006246214,0.0001376488,0.007897264,0.0001099919,0.00014041021],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00061610935,0.00025412854,0.0003150757,0.00032019772,0.0006350647,0.00041161507,0.0096257785,0.00014446424,0.000013616421],"category_scores_gemma":[0.0000073014353,0.00027420837,0.00010340688,0.0010404756,0.0001763098,0.001450048,0.00018918108,0.00091010943,0.00006138096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032431322,0.0018611276,0.00048146828,0.000029792807,0.00010623302,0.000004370658,0.0006640713,0.12119241,0.0015985287,0.010903574,0.00069369737,0.8624323],"study_design_scores_gemma":[0.00048570853,0.00004859086,0.00025967648,0.000115250645,0.000015026211,0.000008372278,0.000071264214,0.9954287,0.00021864522,0.000095366406,0.0029376948,0.0003157178],"about_ca_topic_score_codex":0.00055058603,"about_ca_topic_score_gemma":0.0021082885,"teacher_disagreement_score":0.9693462,"about_ca_system_score_codex":0.00009663194,"about_ca_system_score_gemma":0.000087868975,"threshold_uncertainty_score":0.99997103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26164073,0.00006980617,0.7368081,0.0006870927,0.0004606625,0.00004502451,7.383312e-7,0.00002060131,0.00026723542],"genre_scores_gemma":[0.96251786,0.0000044780404,0.03689271,0.00039643148,0.00017652633,1.8229481e-7,1.9817273e-7,0.0000042250354,0.0000073942924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915755,0.00013839324,0.00025352268,0.000083340106,0.00020382967,0.00016336769],"domain_scores_gemma":[0.99913895,0.0002580322,0.0001514142,0.00016379217,0.00023648006,0.000051318235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013798752,0.0000806577,0.00013371243,0.000037676706,0.00018047831,0.00008182054,0.00066756445,0.000027928032,0.0000024947165],"category_scores_gemma":[0.00008646961,0.00005411097,0.000113460475,0.00014678182,0.000020865915,0.00036461413,0.00010698701,0.00011452504,0.0000023699179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012935374,0.0000746371,0.0012149417,0.0000127135945,0.00012225012,0.000005477276,0.0019124848,0.9245968,0.0010815203,0.035659637,0.0021123395,0.03307788],"study_design_scores_gemma":[0.00045147724,0.00023354308,0.00035203045,0.000048069287,0.000017423452,0.00012601214,0.00023323456,0.99725324,0.00003320032,0.0010377921,0.00014077572,0.000073213356],"about_ca_topic_score_codex":0.000015013892,"about_ca_topic_score_gemma":0.0000017579587,"teacher_disagreement_score":0.70087713,"about_ca_system_score_codex":0.000055710687,"about_ca_system_score_gemma":0.00005225133,"threshold_uncertainty_score":0.22065814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9961632,0.0002229123,0.00016314721,0.00027307012,0.00014413636,0.00035150966,0.0000025131976,0.00011701764,0.002562517],"genre_scores_gemma":[0.99902624,0.00019672004,0.00008372641,0.00017925684,0.00009460901,0.00004347368,0.000012285673,0.0000074924105,0.00035621732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984011,0.0001132936,0.00022071534,0.00036101532,0.0006362311,0.00026763705],"domain_scores_gemma":[0.99931824,0.000029177878,0.00007086087,0.0003589956,0.000137137,0.000085580024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014505609,0.00017140634,0.00014160226,0.00009012258,0.00024331972,0.00011990144,0.00028482845,0.00005954359,0.00014920087],"category_scores_gemma":[0.000021968322,0.00013501654,0.00004766893,0.00025198882,0.00002467467,0.0011285353,0.000042489144,0.00018633669,0.0002910885],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014782399,0.00011733814,0.07940768,0.00004251252,0.000023596831,0.0000011999748,0.0005921871,0.022402612,0.00068856694,0.000092609196,0.00040648665,0.8960774],"study_design_scores_gemma":[0.00046795027,0.00031720696,0.16044855,0.000047692683,0.0000099796525,0.00001146097,0.0000039118395,0.83765876,0.0006722006,0.000024388832,0.00018558415,0.00015230023],"about_ca_topic_score_codex":0.000029989107,"about_ca_topic_score_gemma":0.0000029202602,"teacher_disagreement_score":0.8959251,"about_ca_system_score_codex":0.0001418569,"about_ca_system_score_gemma":0.00016641457,"threshold_uncertainty_score":0.55058146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79792875,0.0008497377,0.19891876,0.00022176535,0.0005746302,0.00018328863,0.0000012110495,0.000023921672,0.0012979287],"genre_scores_gemma":[0.9962032,0.000047462865,0.003536001,0.00010673029,0.00006385141,0.000015807065,0.0000014072835,0.0000057478683,0.000019799743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869794,0.00035332126,0.00041603838,0.00013105024,0.00031214138,0.000089483445],"domain_scores_gemma":[0.9987885,0.0001079414,0.00026625858,0.0003559977,0.00040097802,0.000080347105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159643,0.00008522959,0.00016942727,0.0003629933,0.000041553383,0.00023912961,0.0016842231,0.000039221235,5.973458e-7],"category_scores_gemma":[0.000039142746,0.00007703814,0.00004554515,0.00013673703,0.000023178533,0.0010650678,0.00020014386,0.00019092603,0.000003628603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000874941,0.0032604893,0.043313265,0.00006492223,0.00096038956,0.00013218763,0.19372149,0.074576095,0.003652416,0.34775114,0.00079092185,0.33090174],"study_design_scores_gemma":[0.004437123,0.00074751413,0.2205272,0.0020046835,0.000034733275,0.001606412,0.00876964,0.756002,0.00031073135,0.001107066,0.0036072368,0.00084561924],"about_ca_topic_score_codex":0.00020945219,"about_ca_topic_score_gemma":0.000016411608,"teacher_disagreement_score":0.6814259,"about_ca_system_score_codex":0.00010323734,"about_ca_system_score_gemma":0.00002698231,"threshold_uncertainty_score":0.3141524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024751743,0.000049924893,0.96996975,0.0006844747,0.0006573551,0.00025764242,4.5773965e-7,0.00016866994,0.0034599805],"genre_scores_gemma":[0.9953783,0.0000022540357,0.003771467,0.000646574,0.00007697247,0.000031756164,0.000002968083,0.000001339378,0.00008835263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994671,0.00001146685,0.00013056425,0.000090697664,0.000114738395,0.00018544983],"domain_scores_gemma":[0.99959487,0.00005182498,0.000042558164,0.00016467008,0.000102223225,0.00004387393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014202604,0.00005255603,0.00005170803,0.000060782684,0.00013111404,0.0002261283,0.00022764974,0.000024484243,0.000008446943],"category_scores_gemma":[0.0000141960045,0.00004458388,0.000047896337,0.00015518085,0.000006316452,0.00039065976,0.000085003594,0.00004159205,0.0001741645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009168837,0.00014328782,0.0010020697,0.000049753646,0.000031927262,5.4137405e-7,0.0020048728,0.015171456,0.00027326,0.21293841,0.09426109,0.67411417],"study_design_scores_gemma":[0.00017182832,0.000015363847,0.00029792817,0.000004805452,0.0000014032564,0.0000017308013,0.000014444271,0.99213,0.000017240412,0.0008912268,0.0063870326,0.0000670041],"about_ca_topic_score_codex":0.0001620258,"about_ca_topic_score_gemma":0.0000025456322,"teacher_disagreement_score":0.9769585,"about_ca_system_score_codex":0.00003052965,"about_ca_system_score_gemma":0.00001709315,"threshold_uncertainty_score":0.22385903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001144113,0.000040259907,0.9903103,0.0005717999,0.00017293256,0.00057028665,6.795009e-7,0.00018830989,0.0070013013],"genre_scores_gemma":[0.8922938,0.0000024202031,0.10226833,0.0042344155,0.00005526318,0.0002862249,0.000031324555,0.000004454499,0.00082377944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.000026101232,0.00020462161,0.00016685751,0.00017289881,0.00024224684],"domain_scores_gemma":[0.9992688,0.000080012185,0.000065018925,0.00039489023,0.00011466903,0.000076626304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025704247,0.000093332674,0.00009119712,0.00008635436,0.00011379504,0.00033158672,0.00041564333,0.00004194585,0.000016535194],"category_scores_gemma":[0.000025955034,0.000074251,0.00007775721,0.00020734158,0.000009450392,0.0007619169,0.00007684066,0.000068027664,0.000053366028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059678532,0.00039111997,0.0020406106,0.000101538266,0.00009589987,6.1052333e-7,0.0005116751,0.40828538,0.00005235188,0.19327028,0.21340472,0.18178613],"study_design_scores_gemma":[0.00058544375,0.00006007905,0.0001806836,0.0000033497568,0.0000040824516,0.0000013787712,0.00003088264,0.99548924,0.000025862852,0.000099296405,0.0034091836,0.00011051706],"about_ca_topic_score_codex":0.00023763711,"about_ca_topic_score_gemma":5.728255e-7,"teacher_disagreement_score":0.8911497,"about_ca_system_score_codex":0.00004438323,"about_ca_system_score_gemma":0.00004560806,"threshold_uncertainty_score":0.31974983},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107381724,0.000021113663,0.8534022,0.0011832519,0.00008570073,0.000043130873,6.7048546e-8,0.00024605496,0.03763675],"genre_scores_gemma":[0.9854007,8.890874e-7,0.012090828,0.0012439043,0.00003237166,7.7058723e-7,6.9938625e-7,0.0000014515625,0.0012284123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995533,0.000012164945,0.000070915405,0.00014659825,0.00011919437,0.00009779186],"domain_scores_gemma":[0.999706,0.00001972766,0.000023317794,0.00018545614,0.00003541083,0.000030100091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007244912,0.000051035804,0.00004793911,0.000030424768,0.00008278739,0.00015010792,0.00018480496,0.000016425805,0.000008264828],"category_scores_gemma":[0.000007929336,0.000036299596,0.000017002672,0.00012153299,0.0000041981475,0.00046718703,0.000019207455,0.00006126968,0.0000353484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027146165,0.0001192019,0.009065705,0.000003230551,0.000018886163,0.000043463355,0.0015673763,0.00817833,0.00553584,0.3813878,0.0047649713,0.58928806],"study_design_scores_gemma":[0.0004523895,0.00032123807,0.018824385,0.000026482123,0.0000048770967,0.000043517928,0.000065022505,0.977263,0.0007090556,0.0016083028,0.00045264134,0.00022910663],"about_ca_topic_score_codex":0.000031620642,"about_ca_topic_score_gemma":0.000006741068,"teacher_disagreement_score":0.9690847,"about_ca_system_score_codex":0.000011436862,"about_ca_system_score_gemma":0.000014975045,"threshold_uncertainty_score":0.14802545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2495704,0.000010140772,0.7317711,0.00020884172,0.00018227039,0.00002105647,8.55119e-8,0.00007759517,0.018158507],"genre_scores_gemma":[0.9977048,0.0000011849677,0.0011351586,0.0003676688,0.000081334605,0.0000026960172,2.9390858e-7,0.0000017241368,0.00070510904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993102,0.000093000344,0.00016677381,0.00015077333,0.0001493019,0.00012998082],"domain_scores_gemma":[0.9995631,0.00007300163,0.000059291648,0.0002282415,0.000046725276,0.000029623992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035891286,0.000050646107,0.00012039998,0.000020731695,0.00007680441,0.00003818381,0.00040950673,0.00003235321,0.000017297212],"category_scores_gemma":[0.000028334378,0.000042215586,0.00006457767,0.00011439488,0.000030747702,0.00015121374,0.00011756927,0.000052502462,0.000006688702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014084094,0.000080111124,0.006237128,0.000009238622,0.000013859324,6.9913995e-7,0.0023592995,0.00039740562,0.0036411867,0.9072195,0.0032583578,0.07676912],"study_design_scores_gemma":[0.00089460646,0.00010224491,0.048140503,0.000011255937,0.0000034510263,0.0000024885014,0.00038919516,0.9397779,0.001399846,0.005671859,0.0032025105,0.00040415445],"about_ca_topic_score_codex":0.00021361705,"about_ca_topic_score_gemma":0.000011930707,"teacher_disagreement_score":0.93938047,"about_ca_system_score_codex":0.00000716838,"about_ca_system_score_gemma":0.0000095689775,"threshold_uncertainty_score":0.17215016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46837497,0.00012681872,0.5221706,0.0063175587,0.0006351253,0.00016622688,0.0000025481438,0.000823983,0.0013821714],"genre_scores_gemma":[0.9959159,0.00003369134,0.0019416056,0.00066267775,0.000010103767,0.000047974812,3.9530906e-7,0.000011752486,0.0013759151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989059,0.00006167032,0.00018775632,0.00041863925,0.00013204428,0.00029399217],"domain_scores_gemma":[0.99875325,0.00028924126,0.000034759127,0.000871326,0.000015177928,0.000036274927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077885554,0.00016595279,0.0001771393,0.0010799468,0.0000685204,0.000054161097,0.0012161353,0.00016033003,0.00006315147],"category_scores_gemma":[0.000063935004,0.00015782772,0.00008232739,0.00050219527,0.000071113864,0.00016905791,0.000037257654,0.0007317403,0.00033608646],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004797748,0.0008702391,0.0004560045,0.00003233124,0.00009662076,0.00033329675,0.0012324901,0.002755241,0.004827164,0.07394524,0.0022013015,0.9132021],"study_design_scores_gemma":[0.0055616675,0.005038115,0.00084065914,0.0013140929,0.000049462495,0.000585639,0.00019881869,0.81330293,0.055329286,0.1048266,0.011097988,0.0018547627],"about_ca_topic_score_codex":0.00006317455,"about_ca_topic_score_gemma":0.0001673455,"teacher_disagreement_score":0.9113473,"about_ca_system_score_codex":0.00007735327,"about_ca_system_score_gemma":0.0000066425932,"threshold_uncertainty_score":0.6436027},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5811718,0.003222967,0.38219172,0.0012056213,0.0030702087,0.00150756,0.00010889353,0.0006206823,0.026900554],"genre_scores_gemma":[0.9877044,0.00005045161,0.009616044,0.0011700469,0.0003743976,0.00013545754,0.00006691375,0.000022079641,0.00086021674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972929,0.00017156768,0.0010172838,0.00034494686,0.000571395,0.0006019502],"domain_scores_gemma":[0.9973029,0.00022876188,0.000859459,0.0004614737,0.0009513564,0.00019604551],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0008449444,0.0004193797,0.00038224575,0.00037243465,0.0009072024,0.0017586577,0.0005682594,0.0002555513,0.000026630192],"category_scores_gemma":[0.00039202432,0.0004487507,0.00014049304,0.0012101036,0.00025561138,0.0155553,0.00021900013,0.00045556325,0.0007284166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007897939,0.00013745656,0.00085256627,0.00067515613,0.00005568132,0.000014008264,0.038100503,0.08188944,0.00025279692,0.009134533,0.0027171953,0.86609167],"study_design_scores_gemma":[0.0010683282,0.0004385832,0.0007822468,0.0018814645,0.000027908798,0.00006445152,0.00439693,0.9760474,0.0012345462,0.0014213597,0.0119554885,0.00068128813],"about_ca_topic_score_codex":0.00046184566,"about_ca_topic_score_gemma":0.00015512768,"teacher_disagreement_score":0.89415795,"about_ca_system_score_codex":0.0009385203,"about_ca_system_score_gemma":0.0006880533,"threshold_uncertainty_score":0.99979645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008715915,0.0001495812,0.98834884,0.00070402364,0.00072784245,0.00038487333,0.000007866946,0.00026081887,0.00070026156],"genre_scores_gemma":[0.9182478,0.000084720574,0.079027735,0.0021044756,0.00007015105,0.00005251923,0.0000990821,0.0000059628646,0.00030750898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892515,0.000021289698,0.000269171,0.00027883213,0.0001759452,0.00032964168],"domain_scores_gemma":[0.99812764,0.00030253522,0.000094461655,0.0012189581,0.00016078523,0.000095605115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001757812,0.00012653616,0.00013017035,0.00009333142,0.00015054758,0.0005109649,0.0017901406,0.00009218837,0.00005762854],"category_scores_gemma":[0.00010645228,0.00010964076,0.000056714696,0.0002833059,0.000016542916,0.0034037381,0.00060769625,0.00015330668,0.00036893762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015500764,0.00008102122,0.00012621458,0.000032891025,0.00007558073,9.820033e-7,0.00026499285,0.004652067,0.00013571825,0.11248732,0.04270318,0.83942455],"study_design_scores_gemma":[0.00021490217,0.00002731493,0.00044158264,0.000019580359,0.0000057319803,0.0000021653539,0.00004160434,0.99371016,0.000017962484,0.0037310987,0.0016210488,0.00016682544],"about_ca_topic_score_codex":0.00014819403,"about_ca_topic_score_gemma":0.000009712329,"teacher_disagreement_score":0.98905814,"about_ca_system_score_codex":0.000034710854,"about_ca_system_score_gemma":0.000045225686,"threshold_uncertainty_score":0.49272463},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018707378,0.00032458222,0.98026294,0.0039528343,0.00011699291,0.00014717609,0.0000014690471,0.00055861875,0.012764647],"genre_scores_gemma":[0.96520567,0.000007696563,0.03130051,0.0015691813,0.000036466245,0.0000058811024,0.0000055892037,0.0000027392423,0.0018662459],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903584,0.000048454793,0.0001695882,0.00029199084,0.00018983062,0.0002642886],"domain_scores_gemma":[0.9994037,0.00003490867,0.000041471507,0.0004044728,0.00004918167,0.00006627493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029721324,0.000093779934,0.000085410364,0.00006144493,0.00027942972,0.00006731716,0.00042722467,0.00004277496,0.000012657867],"category_scores_gemma":[0.000015602931,0.00008779673,0.00005871033,0.00019727251,0.000016459153,0.00021572551,0.00014385377,0.00012911239,0.000038633185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011678322,0.00043665493,0.00042285246,0.0000052009736,0.000026423597,0.00001470786,0.00022177814,0.0005312755,0.06534326,0.2587488,0.6133686,0.06086883],"study_design_scores_gemma":[0.00086226047,0.0007583048,0.0037384615,0.00009001314,0.00001679553,0.000276087,0.00011202216,0.93143797,0.0057637747,0.013333037,0.042659827,0.0009514504],"about_ca_topic_score_codex":0.000094821946,"about_ca_topic_score_gemma":0.0000016294322,"teacher_disagreement_score":0.963335,"about_ca_system_score_codex":0.00008928925,"about_ca_system_score_gemma":0.00003887956,"threshold_uncertainty_score":0.3580247},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2159041,0.00015437219,0.78068805,0.00018633204,0.00046413168,0.00024836487,6.173052e-7,0.0002090998,0.002144919],"genre_scores_gemma":[0.9926159,0.000009622226,0.003952613,0.0025543259,0.00015767945,0.0001151617,0.0000025111449,0.000013738136,0.0005784886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985793,0.00008180029,0.000317103,0.00043470407,0.00015943662,0.0004276593],"domain_scores_gemma":[0.99896026,0.00036161687,0.0000780987,0.0004162499,0.00009649868,0.00008728463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008110459,0.00015651235,0.00022927432,0.00009312263,0.00012143496,0.00020681406,0.00059513125,0.000065122265,0.000010021481],"category_scores_gemma":[0.0001053041,0.00014411978,0.00012824245,0.00018380074,0.000020483738,0.0004592605,0.00023949028,0.00015486605,0.000019688989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049891245,0.00013422791,0.00877473,0.00002360329,0.00003207645,0.000010994797,0.0008025055,0.012442518,0.0005785817,0.10666891,0.005545157,0.8649368],"study_design_scores_gemma":[0.00081972324,0.00013577103,0.00083550246,0.00006032594,0.0000046681826,0.0000064217566,0.00027507226,0.9828356,0.00032612105,0.00046839062,0.013968914,0.00026352334],"about_ca_topic_score_codex":0.0008590851,"about_ca_topic_score_gemma":0.00032220272,"teacher_disagreement_score":0.97039306,"about_ca_system_score_codex":0.000052086758,"about_ca_system_score_gemma":0.000036663616,"threshold_uncertainty_score":0.5877034},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59071434,0.000010947537,0.32268974,0.0017964634,0.0010699935,0.000033892673,1.07835106e-7,0.00045861184,0.083225906],"genre_scores_gemma":[0.9861659,3.7256925e-7,0.011158335,0.0006370945,0.00006590121,0.000001137344,9.768802e-8,0.0000015747991,0.001969624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996582,0.0000065807426,0.000051681516,0.000115873554,0.00007511898,0.00009253868],"domain_scores_gemma":[0.99965066,0.000033596847,0.000011590186,0.00024945792,0.000019288063,0.0000353906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012246688,0.000032899963,0.00003248519,0.000023211338,0.000052009098,0.00008935097,0.00033975719,0.000017406806,0.00003238044],"category_scores_gemma":[0.000026281088,0.000026694044,0.000025436557,0.000060865314,0.0000072112102,0.00016121811,0.0000976521,0.00010837586,0.00018926071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010554651,0.000031527143,0.005085059,0.0000026040277,0.0000066918315,0.000016077522,0.00020475966,0.000008156118,0.33333346,0.4565058,0.006812205,0.1979926],"study_design_scores_gemma":[0.0011295843,0.00014008964,0.01941424,0.000029309165,0.00001070077,0.00022466536,0.00011739803,0.75302875,0.070720844,0.021981321,0.13202856,0.0011745086],"about_ca_topic_score_codex":0.000077964614,"about_ca_topic_score_gemma":0.000028258448,"teacher_disagreement_score":0.75302064,"about_ca_system_score_codex":0.0000018352753,"about_ca_system_score_gemma":0.000010061429,"threshold_uncertainty_score":0.24326266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014465416,0.0000071960476,0.97429407,0.0001666664,0.0006256379,0.000117355004,0.0000027181034,0.00017028795,0.010150672],"genre_scores_gemma":[0.99407804,0.0000017337381,0.0045871674,0.00028593538,0.000051083705,0.000016824082,0.0000059529725,0.0000048949714,0.00096837553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994413,0.00002014632,0.00011007321,0.00020252902,0.00009126347,0.00013465277],"domain_scores_gemma":[0.9996532,0.000043016007,0.000038118447,0.00019949707,0.00003140035,0.00003474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015874245,0.000067865,0.00006271249,0.00007243586,0.00010129432,0.00008432154,0.00022015943,0.00003300667,0.00004694772],"category_scores_gemma":[0.000018072082,0.00005923826,0.00006345012,0.00008185999,0.000012978513,0.00041287858,0.00006113133,0.000047427988,0.000021530528],"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.00013820383,0.00019117855,0.0031829556,0.00004269757,0.000112921305,0.0000074471336,0.009636154,0.000058344733,0.007643443,0.93021417,0.030652966,0.018119542],"study_design_scores_gemma":[0.002302798,0.00076373224,0.0042197853,0.000113995906,0.000054687192,0.00003649217,0.0027892578,0.8643423,0.011676178,0.11106312,0.0018129516,0.00082474545],"about_ca_topic_score_codex":0.00021049238,"about_ca_topic_score_gemma":0.00013012017,"teacher_disagreement_score":0.9796126,"about_ca_system_score_codex":0.00006842377,"about_ca_system_score_gemma":0.000010608833,"threshold_uncertainty_score":0.24156661},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6811284,0.0076604607,0.27339906,0.0014402607,0.021525012,0.001703503,0.00025024018,0.0006762579,0.012216822],"genre_scores_gemma":[0.9988084,0.0002123536,0.000707711,0.000059258655,0.0000906604,0.000022306847,0.00007766817,0.0000057904385,0.00001587548],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99400216,0.0044107414,0.0008009124,0.0001649967,0.00036852175,0.00025268467],"domain_scores_gemma":[0.9946552,0.0017008408,0.0003642378,0.0023902382,0.00078156614,0.00010794188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013409754,0.00013479842,0.0003319818,0.0002728808,0.00010588085,0.00015254009,0.0026225708,0.000094805575,0.0000015478436],"category_scores_gemma":[0.0011382471,0.00014289258,0.000058990194,0.0014496341,0.00009253217,0.0010920765,0.0005848935,0.000252019,0.00004393764],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000806128,0.0014408957,0.8237218,0.000070075526,0.00019531121,0.000006061513,0.023554899,0.0064906557,0.00025405825,0.01737245,0.025619134,0.10119405],"study_design_scores_gemma":[0.0057152803,0.00025838212,0.5886673,0.00035525224,0.00003962543,0.000018022176,0.00054382713,0.34398326,0.00029957131,0.005604293,0.0529261,0.0015890871],"about_ca_topic_score_codex":0.013545174,"about_ca_topic_score_gemma":0.0038966371,"teacher_disagreement_score":0.33749261,"about_ca_system_score_codex":0.0001344344,"about_ca_system_score_gemma":0.000377373,"threshold_uncertainty_score":0.9930237},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10110122,0.00012467956,0.86738807,0.0062700384,0.0004899046,0.00029678032,1.1471936e-7,0.00028269063,0.024046527],"genre_scores_gemma":[0.9934117,0.000052929212,0.0036322526,0.0018124451,0.00002416436,0.000018348397,9.396222e-7,0.0000027214758,0.0010445046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993943,0.000029032313,0.00010637928,0.00016147071,0.0000942935,0.00021455492],"domain_scores_gemma":[0.9997822,0.000008355961,0.000016621914,0.00014790206,0.0000128594975,0.000032058182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008129523,0.00005766256,0.000067594025,0.000046476183,0.000045030625,0.00014444698,0.0003630385,0.00002281824,0.00009609099],"category_scores_gemma":[8.371953e-7,0.000050170478,0.000034179953,0.00015555127,0.000008084383,0.0002451706,0.00016452112,0.000060008315,0.00022188785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057327,0.00009712365,0.0020869644,0.0000051155635,0.00003602773,0.000039559338,0.00020051746,0.0007679372,0.000048727656,0.46255308,0.04876074,0.48539847],"study_design_scores_gemma":[0.0010839353,0.000011852674,0.041465014,0.000008852068,0.0000042539446,0.0000028136628,0.00006748708,0.9415028,0.000013008296,0.0072213244,0.008361368,0.000257261],"about_ca_topic_score_codex":0.00019765725,"about_ca_topic_score_gemma":0.000028554436,"teacher_disagreement_score":0.9407349,"about_ca_system_score_codex":0.00002170439,"about_ca_system_score_gemma":0.0000032747118,"threshold_uncertainty_score":0.28519934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26048324,0.000019368854,0.69781464,0.0011451761,0.0002146607,0.000025619762,5.2457448e-8,0.00014658265,0.040150672],"genre_scores_gemma":[0.99593943,0.0000016113928,0.002050358,0.0010685922,0.000029052828,0.0000015891874,1.5095954e-7,0.0000019452325,0.00090728095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995152,0.00004117938,0.00008076718,0.00015403514,0.00008502354,0.00012382182],"domain_scores_gemma":[0.9996379,0.0000625227,0.000012403279,0.00024731286,0.000008759642,0.000031110278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027174776,0.0000435636,0.000058680263,0.00006235733,0.00003185492,0.00006619871,0.00033354555,0.000016879645,0.0000066668376],"category_scores_gemma":[0.000025297064,0.000037068763,0.000024285222,0.000104547005,0.0000050611256,0.00020263152,0.00006809869,0.000077203644,0.00008671096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052487094,0.00010165457,0.026589245,0.000010788905,0.000008519066,0.000025215502,0.0014134133,0.0039534224,0.007667427,0.6704315,0.004386906,0.28540665],"study_design_scores_gemma":[0.00041695486,0.000042868545,0.01184803,0.000022866467,0.0000010899656,0.000011677285,0.000020471818,0.9718575,0.00041313373,0.0059131384,0.00925221,0.00020007615],"about_ca_topic_score_codex":0.0005218931,"about_ca_topic_score_gemma":0.00019272765,"teacher_disagreement_score":0.96790403,"about_ca_system_score_codex":0.0000133195845,"about_ca_system_score_gemma":0.0000071053587,"threshold_uncertainty_score":0.15116203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.680803,0.001259764,0.31468102,0.0027205208,0.00044805213,0.00005291146,0.000001920658,0.000007052953,0.00002573117],"genre_scores_gemma":[0.998859,0.00018359435,0.00029920836,0.00031454331,0.0002923225,0.0000011100079,0.0000044688845,0.000005402022,0.000040355346],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986719,0.000028052234,0.0004852393,0.00011725615,0.00042692584,0.00027061562],"domain_scores_gemma":[0.9979314,0.0002939422,0.00044732203,0.00012958459,0.0011663451,0.000031394808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011258861,0.000095654934,0.00018421466,0.00013931979,0.00008905272,0.000057608257,0.00078152295,0.00003606525,0.0000029595674],"category_scores_gemma":[0.0000865279,0.00006996257,0.00008481404,0.0001948798,0.000056659115,0.00036433624,0.00008499948,0.0003053799,3.053557e-7],"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.0028225759,0.0018896871,0.14323546,0.00012636675,0.001602495,0.000012262928,0.0009994193,0.011014585,0.018785816,0.21640348,0.001746216,0.60136163],"study_design_scores_gemma":[0.0037265725,0.0012407594,0.7077255,0.00032000308,0.00011453517,0.0010803269,0.0002878071,0.2561535,0.0019913733,0.0061047305,0.020824648,0.00043020793],"about_ca_topic_score_codex":0.000021471855,"about_ca_topic_score_gemma":0.000058860893,"teacher_disagreement_score":0.6009314,"about_ca_system_score_codex":0.00016822538,"about_ca_system_score_gemma":0.00028048773,"threshold_uncertainty_score":0.28529906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16081575,0.000023737168,0.8340753,0.00046189516,0.00024247977,0.00020242162,0.000001937939,0.00029136313,0.0038851285],"genre_scores_gemma":[0.9152946,8.8379267e-7,0.08300886,0.00082917884,0.00017432461,0.000009926833,0.0000020542566,0.00001479234,0.00066537067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981965,0.00004787352,0.00033419093,0.000548388,0.00032933126,0.0005437236],"domain_scores_gemma":[0.99922943,0.000095376,0.000055957407,0.00035021803,0.00011892414,0.00015008406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029892966,0.00020039694,0.00022200216,0.000101921025,0.00021167334,0.00023495524,0.00062995317,0.000064347856,0.000022613513],"category_scores_gemma":[0.000019034629,0.00018394088,0.000115672054,0.0005157944,0.000029435841,0.000477096,0.00014340365,0.00015378567,0.00006464145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030107316,0.0006693816,0.008521632,0.000083895386,0.00016789258,0.0005810762,0.0024118784,0.6527282,0.05739382,0.18955672,0.009936669,0.077647746],"study_design_scores_gemma":[0.0003673817,0.00016835259,0.00097276823,0.00007406093,0.000017775565,0.000051236497,0.000054856635,0.996068,0.00038490753,0.001007516,0.0004450781,0.00038807714],"about_ca_topic_score_codex":0.0007114188,"about_ca_topic_score_gemma":0.00034498738,"teacher_disagreement_score":0.7544789,"about_ca_system_score_codex":0.000092584574,"about_ca_system_score_gemma":0.00008399734,"threshold_uncertainty_score":0.75008917},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026126647,0.001249332,0.9422876,0.001964895,0.026954819,0.0005448405,0.0000031232812,0.000313446,0.0005552984],"genre_scores_gemma":[0.9197115,0.000014664993,0.03607247,0.0012589302,0.041927624,0.00012992947,0.00003345194,0.000017975279,0.00083345454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983315,0.0001973373,0.00036293684,0.0004996866,0.00035009655,0.00025847752],"domain_scores_gemma":[0.9991705,0.000017045864,0.00010100022,0.0005732234,0.00006660726,0.00007163853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038244072,0.00019375954,0.00019885426,0.00026089812,0.000121974634,0.00047031644,0.00053816114,0.00008204251,0.0000025679963],"category_scores_gemma":[0.000001050018,0.0001800185,0.00007168103,0.00032207233,0.000008731649,0.0003717893,0.00010826786,0.00014123766,0.00006891885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012600517,0.00030626182,0.00091486465,0.00013758324,0.000081615945,0.00013618462,0.0012218301,0.54152876,0.0014860088,0.03191961,0.33013424,0.09212047],"study_design_scores_gemma":[0.0005738164,0.000037406637,0.00036490322,0.00003253269,0.0000036621716,0.000012073538,0.000021975653,0.8794632,0.00008249319,7.8194313e-7,0.119213365,0.0001937898],"about_ca_topic_score_codex":0.000037029036,"about_ca_topic_score_gemma":0.0001054288,"teacher_disagreement_score":0.90621513,"about_ca_system_score_codex":0.00016184938,"about_ca_system_score_gemma":0.000060453487,"threshold_uncertainty_score":0.73409414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022633018,0.00026450455,0.97513974,0.00017120155,0.00092323485,0.00017570576,0.00010293195,0.00022620235,0.00036347267],"genre_scores_gemma":[0.9985685,0.00014417645,0.00027856237,0.000065294036,0.00003944901,0.000041027582,0.000024052288,0.000006987122,0.00083199586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989064,0.00011771575,0.00025856408,0.00034105428,0.00018452847,0.00019174343],"domain_scores_gemma":[0.99939793,0.00008268488,0.00006292087,0.00024353164,0.000094580944,0.00011834376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012873227,0.00015114936,0.00019447634,0.0000858114,0.00060410413,0.00012241623,0.0001754545,0.00008714252,0.000005658065],"category_scores_gemma":[0.000004332512,0.00013745313,0.00006263398,0.00026226896,0.00004593498,0.00036753152,0.0000021098163,0.00022020562,0.00003232376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109955174,0.00034554556,0.00016897384,0.00006143768,0.00016643011,0.00012803584,0.0014869289,0.97371256,0.003045256,0.009189105,0.0028520373,0.008733725],"study_design_scores_gemma":[0.0014252684,0.00028269333,0.0005627405,0.00009722465,0.000024554845,0.00046562118,0.0003267822,0.9936681,0.00035961525,0.00008186025,0.0022202006,0.00048536895],"about_ca_topic_score_codex":0.00014161921,"about_ca_topic_score_gemma":0.0000074620702,"teacher_disagreement_score":0.97593546,"about_ca_system_score_codex":0.000042036307,"about_ca_system_score_gemma":0.00006562296,"threshold_uncertainty_score":0.5605176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030188146,0.000119336684,0.9830387,0.011860234,0.0000858423,0.0011554635,0.00007030425,0.00054842496,0.000102857826],"genre_scores_gemma":[0.93436205,0.00008049493,0.06364828,0.00048498774,0.000055600314,0.0010045774,0.0002526801,0.000019704194,0.000091623144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824125,0.00017573408,0.00048068693,0.0005048899,0.000271144,0.00032628977],"domain_scores_gemma":[0.9958643,0.0010696808,0.00019964126,0.0022434143,0.00044290177,0.0001800619],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00024880865,0.00025453375,0.00023204368,0.00016535369,0.001932713,0.00032796848,0.0018784818,0.00012144272,0.000019084024],"category_scores_gemma":[0.00004211464,0.00025708394,0.00013605435,0.000610116,0.0002775915,0.0003571062,0.00012158388,0.0004711299,0.00017909515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035111734,0.00070132245,0.00019013438,0.000021118562,0.000052138734,2.73462e-7,0.0004122239,0.0006695003,0.0019313593,0.0036670256,0.00028992613,0.9920615],"study_design_scores_gemma":[0.00067615014,0.000048984297,0.0036694116,0.000039817838,0.00003309865,0.000005049989,0.00023023339,0.9905882,0.00041399535,0.00045810774,0.0035075436,0.0003294308],"about_ca_topic_score_codex":0.00041252968,"about_ca_topic_score_gemma":0.000028415503,"teacher_disagreement_score":0.99173206,"about_ca_system_score_codex":0.00010819694,"about_ca_system_score_gemma":0.000093164264,"threshold_uncertainty_score":0.99998814},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09169643,0.000036462046,0.89274436,0.0027155115,0.0002106999,0.00011450728,0.0000014313997,0.00023618327,0.012244402],"genre_scores_gemma":[0.9819483,0.0000014359447,0.013445,0.0024040965,0.000108270186,0.000006892923,0.000001124316,0.0000028977636,0.0020819923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.000023349114,0.0001413743,0.0002498228,0.00012893103,0.00021470894],"domain_scores_gemma":[0.9994893,0.000046712903,0.00003186853,0.00031855318,0.00005601731,0.000057537272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025201275,0.000080769976,0.0001166399,0.000038588627,0.00011462173,0.00017298244,0.0003132081,0.000026239584,0.00000519727],"category_scores_gemma":[0.000027098378,0.00006924927,0.00012283145,0.00007864609,0.000007189029,0.00032322307,0.000056070076,0.00005812465,0.000023531693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027705191,0.00020358844,0.002149585,0.000028638093,0.000049914004,0.00002577609,0.0013689302,0.00014930141,0.027429791,0.35643137,0.03524034,0.57689506],"study_design_scores_gemma":[0.0056249467,0.0018497303,0.045487143,0.00025839914,0.000081798615,0.00018865676,0.0012560886,0.7490155,0.03136767,0.09302665,0.0690785,0.0027649312],"about_ca_topic_score_codex":0.00003712688,"about_ca_topic_score_gemma":0.000006184746,"teacher_disagreement_score":0.8902519,"about_ca_system_score_codex":0.000020558837,"about_ca_system_score_gemma":0.000018393908,"threshold_uncertainty_score":0.28239033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17416142,0.00017836207,0.8220911,0.0003244521,0.0015338999,0.000117269214,0.000010875953,0.00006552083,0.0015170808],"genre_scores_gemma":[0.95724976,0.000010992171,0.042006116,0.00017941823,0.0004591844,0.0000015084856,0.000015419759,0.000015523576,0.00006206676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982052,0.00006382146,0.0005682745,0.0003753359,0.0005164091,0.00027099164],"domain_scores_gemma":[0.99730235,0.00017333218,0.00077877555,0.00043055185,0.0011892689,0.00012568901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012043678,0.00016855537,0.00023892429,0.0002550831,0.0001682091,0.00031948503,0.002987921,0.00005478143,0.000010880573],"category_scores_gemma":[0.00016043342,0.00014140135,0.000084383115,0.00014337468,0.000035585595,0.0019076357,0.00015537081,0.00027710726,0.0000037063105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008455179,0.0006786992,0.0067917597,0.00007316416,0.00082422077,0.00034555048,0.005613806,0.00760946,0.0045865946,0.0077116177,0.0018231969,0.96309644],"study_design_scores_gemma":[0.0030814,0.0015504477,0.0019985996,0.0010503451,0.000088099325,0.0031703545,0.0009697453,0.9706215,0.008225375,0.0027306254,0.005833169,0.0006802888],"about_ca_topic_score_codex":0.00012665501,"about_ca_topic_score_gemma":0.000033144028,"teacher_disagreement_score":0.9630121,"about_ca_system_score_codex":0.00009006457,"about_ca_system_score_gemma":0.00025853,"threshold_uncertainty_score":0.576618},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007531551,0.000027582613,0.98897177,0.00027576828,0.00029962574,0.0002482829,0.000001868102,0.00026691888,0.0023766314],"genre_scores_gemma":[0.99002165,0.0000011068679,0.007815274,0.0019355486,0.00007234678,0.000032216132,0.0000202588,0.0000040842474,0.00009752938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990034,0.00006504711,0.00026800687,0.00020214432,0.00017251683,0.00028887088],"domain_scores_gemma":[0.9990489,0.00021006391,0.0000792373,0.0004579805,0.00011194684,0.00009188322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006416869,0.00011812355,0.00013737811,0.00011054601,0.00020171412,0.00039486343,0.00052140787,0.00006568069,0.000004841599],"category_scores_gemma":[0.000093665185,0.000103599494,0.00010925353,0.00021852931,0.000013852837,0.000888431,0.00007130484,0.00013643055,0.00001948773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002406317,0.00009334501,0.0017382309,0.000060364062,0.000020139229,7.768367e-7,0.00011864711,0.52834904,0.000019545956,0.3041512,0.0021053802,0.16331929],"study_design_scores_gemma":[0.000504314,0.00008385158,0.00034902198,0.000009288102,0.0000051511743,0.0000016645099,0.000018747212,0.9930277,0.000017631248,0.0010930185,0.0047466923,0.00014292415],"about_ca_topic_score_codex":0.0002839954,"about_ca_topic_score_gemma":0.000032403463,"teacher_disagreement_score":0.98249006,"about_ca_system_score_codex":0.000051338444,"about_ca_system_score_gemma":0.00006999338,"threshold_uncertainty_score":0.42246646},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.316935,0.000025088846,0.682635,0.00007122895,0.000039361297,0.000039802988,0.0000024571434,0.000023143786,0.0002289179],"genre_scores_gemma":[0.9321638,0.000008233025,0.06777729,0.0000269968,0.0000036914366,0.000002122033,0.000011418369,0.0000021478218,0.0000043334526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994604,0.00007826603,0.00019762348,0.00010048512,0.00009386386,0.00006935234],"domain_scores_gemma":[0.999361,0.00008416497,0.00010083289,0.00038800808,0.000050172825,0.000015826414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015159552,0.000054061526,0.00011973788,0.000084616666,0.000018422932,0.000011211199,0.00038956848,0.00002493383,0.0000035455903],"category_scores_gemma":[0.00006846681,0.000047127847,0.000028653365,0.00019147818,0.000022471955,0.00009222596,0.00013797586,0.00006846592,1.5483202e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013239795,0.000015399171,0.0022181694,0.000014742864,0.0000045262755,7.847356e-8,0.00018434589,0.96982527,0.005820131,0.0026440325,0.000015115982,0.019244963],"study_design_scores_gemma":[0.0003448169,0.000066702836,0.017529389,0.000053047206,0.000002478198,0.0000017677795,0.000023336626,0.9729667,0.0075358655,0.0013569037,0.00004448647,0.00007451711],"about_ca_topic_score_codex":0.000105583866,"about_ca_topic_score_gemma":0.000038945138,"teacher_disagreement_score":0.6152288,"about_ca_system_score_codex":0.000011371881,"about_ca_system_score_gemma":0.00000891522,"threshold_uncertainty_score":0.1921818},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29425606,0.00009213787,0.6979519,0.0065420154,0.00019486253,0.0002277822,6.481391e-7,0.00006752227,0.0006670625],"genre_scores_gemma":[0.99681515,0.0000069794655,0.0009431808,0.0016364836,0.00010746961,0.000007122455,0.0000025743434,0.000003289677,0.00047773728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993306,0.000089347785,0.00013049664,0.00020042514,0.00012275043,0.00012641249],"domain_scores_gemma":[0.99930334,0.00031710713,0.000035469904,0.00027098847,0.000047575762,0.000025494151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009990168,0.0000615226,0.00007729382,0.000035389992,0.00010383873,0.00016529864,0.00032156552,0.000031516032,4.2510763e-7],"category_scores_gemma":[0.00013114706,0.000041244883,0.00002649815,0.00009061625,0.000017659178,0.00013934812,0.000056244044,0.00007476407,0.0000020874409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021644037,0.00015739871,0.0066813654,0.00007704582,0.000027642165,0.0000064601854,0.0055715903,0.00033044227,0.009217784,0.89812183,0.007997028,0.071595],"study_design_scores_gemma":[0.0022300004,0.00052857975,0.0068937456,0.00013976467,0.000017022756,0.000029329336,0.0013661052,0.9026057,0.0020011824,0.0038794577,0.07990201,0.00040707336],"about_ca_topic_score_codex":0.00013221182,"about_ca_topic_score_gemma":0.00007344359,"teacher_disagreement_score":0.90227526,"about_ca_system_score_codex":0.000014402482,"about_ca_system_score_gemma":0.000010793607,"threshold_uncertainty_score":0.16819175},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30953932,0.000009315106,0.6858159,0.00017764399,0.00021612809,0.00006196919,1.1543623e-7,0.00016705536,0.0040125605],"genre_scores_gemma":[0.9955318,4.1579077e-7,0.0038619593,0.00015999991,0.00003604144,0.000006639458,9.366756e-7,0.0000028951752,0.00039931198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930984,0.00010615075,0.00014260938,0.00019435478,0.00012959415,0.00011743469],"domain_scores_gemma":[0.99958676,0.000035601002,0.000038947648,0.00028685515,0.000019966526,0.00003186697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034896636,0.0000607493,0.00008577473,0.000095370815,0.000035179553,0.00007413887,0.00027341564,0.00003162884,0.000005755422],"category_scores_gemma":[0.0000136284825,0.000051406987,0.00003705102,0.0001375979,0.000005407442,0.00016066254,0.00007585693,0.00005792896,0.000079089245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005497169,0.00031592773,0.013383633,0.00018680633,0.000012232498,0.000027743232,0.000397931,0.003697589,0.024096655,0.13276051,0.0015182503,0.8235477],"study_design_scores_gemma":[0.0004729485,0.0000919298,0.0058930544,0.00011252896,0.0000014610248,0.0000043833625,0.000028276741,0.9913006,0.0009698401,0.00020970452,0.0008107914,0.00010448675],"about_ca_topic_score_codex":0.00015026446,"about_ca_topic_score_gemma":0.00008988659,"teacher_disagreement_score":0.987603,"about_ca_system_score_codex":0.000042426374,"about_ca_system_score_gemma":0.000017851475,"threshold_uncertainty_score":0.2096316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83259153,0.00093378953,0.14604083,0.014616126,0.00074105884,0.0006984641,0.0000064317273,0.00034069142,0.0040310835],"genre_scores_gemma":[0.95301926,0.0001476484,0.04598552,0.00052689516,0.00008353072,0.00007411201,0.0000031842653,0.0000120398,0.0001478202],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987847,0.00019407982,0.00037399272,0.00016647532,0.0001871802,0.000293535],"domain_scores_gemma":[0.9972853,0.0008773562,0.00019444141,0.0010247534,0.0005134535,0.00010469766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044318408,0.000120339544,0.00015458044,0.00028771354,0.0005721725,0.0003959906,0.0020607112,0.000057843183,0.0000062186127],"category_scores_gemma":[0.00044344153,0.000114360315,0.00008125508,0.00066321867,0.000032806813,0.00053770246,0.00015383623,0.00070027,0.00003866519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011181722,0.0037157636,0.04298028,0.00008188345,0.0005802968,0.00005125473,0.0068913694,0.003790182,0.41519237,0.098571256,0.06552784,0.36250567],"study_design_scores_gemma":[0.0011752602,0.0001910993,0.0075296294,0.00042360957,0.0000108722315,0.000265305,0.00013759675,0.98111945,0.00045658278,0.0032356153,0.005086201,0.00036878636],"about_ca_topic_score_codex":0.000057324865,"about_ca_topic_score_gemma":0.00006838149,"teacher_disagreement_score":0.97732925,"about_ca_system_score_codex":0.00014338421,"about_ca_system_score_gemma":0.00018872606,"threshold_uncertainty_score":0.4663478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460672,0.0002441785,0.0051329983,0.0067278836,0.00056422374,0.00048569514,0.00002403837,0.00015722025,0.040596563],"genre_scores_gemma":[0.9199843,0.0004805471,0.07102269,0.0005900512,0.0014262022,0.00025156772,0.0000064158817,0.00010523332,0.0061330074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987809,2.1287816e-8,0.00027470454,0.00028756016,0.0003946727,0.00026216437],"domain_scores_gemma":[0.9987672,0.0001117026,0.0001339961,0.000069123234,0.0008593255,0.000058684243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036858852,0.00017795077,0.00019812073,0.000061786195,0.00010375064,0.0002465222,0.0013735464,0.00009116884,0.000030002015],"category_scores_gemma":[0.0001615165,0.00013126674,0.00044514053,0.0002306185,0.00010716609,0.00054509426,0.00014169607,0.00018740058,0.000011362052],"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.000019745366,0.000041869484,0.000026643967,0.00007536644,0.00014067792,1.18410725e-7,0.00014571677,0.000015885751,0.12585025,0.85505617,0.017739857,0.0008877239],"study_design_scores_gemma":[0.003017745,0.00058223127,0.00087196764,0.0008476995,0.00041362972,0.00010532084,0.0018735592,0.5696048,0.054697227,0.022020813,0.34443152,0.0015334944],"about_ca_topic_score_codex":0.0000051077136,"about_ca_topic_score_gemma":1.9072348e-7,"teacher_disagreement_score":0.83303535,"about_ca_system_score_codex":0.000107600215,"about_ca_system_score_gemma":0.000028986027,"threshold_uncertainty_score":0.53529024},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6810008,0.000038438335,0.31692803,0.000025627698,0.0010298606,0.0003803086,0.00000234217,0.00017859512,0.00041594234],"genre_scores_gemma":[0.8565972,0.000002188658,0.14285928,0.00044088563,0.000054911896,0.000020498535,4.03042e-7,0.000007817894,0.000016842117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976576,0.000031368545,0.00036531303,0.00078752753,0.00063662155,0.00052158075],"domain_scores_gemma":[0.9982695,0.000037902275,0.00017714928,0.0007453617,0.0004796182,0.00029047654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007322839,0.00018890075,0.00024362018,0.0003721646,0.00020500907,0.0001760213,0.0026424425,0.000042975375,0.000008045719],"category_scores_gemma":[0.00001890183,0.00017448215,0.00006535549,0.0016630677,0.00026007683,0.0010723848,0.0011671343,0.00011684634,0.000042671898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002792132,0.0019013404,0.25274113,0.0012751458,0.0001589642,0.0003081291,0.14890389,0.0031850256,0.2193829,0.033572976,0.0009443781,0.3373469],"study_design_scores_gemma":[0.00055111654,0.0012201719,0.008994035,0.0002455696,0.000020633513,0.00018040442,0.00018003992,0.9473411,0.039390307,0.00072480104,0.00044218788,0.00070966926],"about_ca_topic_score_codex":0.00026233363,"about_ca_topic_score_gemma":0.000012369043,"teacher_disagreement_score":0.94415605,"about_ca_system_score_codex":0.000051001854,"about_ca_system_score_gemma":0.00045911816,"threshold_uncertainty_score":0.7115176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008521011,0.008437132,0.9808099,0.0009021105,0.00007143871,0.0009933492,8.531283e-7,0.000030231182,0.00023393042],"genre_scores_gemma":[0.5447615,0.0056488914,0.44023198,0.0022926847,0.0029857024,0.0035453537,0.00000528598,0.000024904191,0.00050368765],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991178,0.000044994405,0.00033930028,0.00022393312,0.00011585832,0.00015810011],"domain_scores_gemma":[0.99899006,0.00009999388,0.00023677833,0.00033535113,0.00019579333,0.00014203772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024323205,0.00011096491,0.00021693611,0.00006243663,0.00025432598,0.000675291,0.00089399994,0.000040343486,0.000005988988],"category_scores_gemma":[8.0543407e-7,0.00009452873,0.000041283292,0.0002416192,0.000040449428,0.00058789685,0.00052922516,0.00013024593,0.00001782172],"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.000003920597,0.00014810052,0.003302814,0.000017826644,0.000084787294,0.0000017522899,0.00015095856,0.001422773,0.000094402065,0.02899865,0.04935894,0.9164151],"study_design_scores_gemma":[0.00064142264,0.0002595607,0.011233212,0.00005341098,0.000045809375,0.00035989963,0.000090867914,0.096234,0.000016275451,0.022697734,0.8680095,0.0003583009],"about_ca_topic_score_codex":0.000049594717,"about_ca_topic_score_gemma":0.0000018694739,"teacher_disagreement_score":0.91605675,"about_ca_system_score_codex":0.000013691859,"about_ca_system_score_gemma":0.0000351118,"threshold_uncertainty_score":0.6511847},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7777815,0.000010775631,0.21966575,0.0010728285,0.00037363873,0.00016010166,2.1167939e-7,0.00006955088,0.0008656268],"genre_scores_gemma":[0.9971901,7.095458e-7,0.0022155603,0.0005447651,0.000021391792,0.000007710882,0.000005379519,0.0000016393335,0.000012749325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.000071421586,0.00022213705,0.000110715904,0.00022852985,0.000111724556],"domain_scores_gemma":[0.99949425,0.000057719877,0.000075302945,0.00026932592,0.00007538401,0.0000280159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033245704,0.00006430014,0.00008955951,0.000118120384,0.000037983384,0.00004918541,0.00015524538,0.000035972345,0.000014350121],"category_scores_gemma":[0.000016462034,0.000055099583,0.00004467626,0.0002419582,0.000012434964,0.0004888714,0.00002982679,0.000080470185,0.000030442301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058767666,0.000347903,0.0073413984,0.00010041018,0.000014794654,0.0000038248754,0.00036622628,0.8936271,0.009770149,0.014649632,0.0028385858,0.07088118],"study_design_scores_gemma":[0.00027326413,0.000040026338,0.013003955,0.00006217252,0.0000014270195,7.358709e-7,0.000016825266,0.98532903,0.000764399,0.00038319765,0.00005960441,0.000065361426],"about_ca_topic_score_codex":0.00081852305,"about_ca_topic_score_gemma":0.000005169926,"teacher_disagreement_score":0.21940857,"about_ca_system_score_codex":0.00003740621,"about_ca_system_score_gemma":0.000034901106,"threshold_uncertainty_score":0.22468957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028556032,0.00018556358,0.96678615,0.00063552154,0.0030179673,0.0006835296,0.0000038662056,0.00010379212,0.00002757265],"genre_scores_gemma":[0.8247533,0.000036856465,0.17357768,0.000628543,0.00078219787,0.000121061494,0.0000016006248,0.000021333979,0.000077432545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982313,0.0000744596,0.00044541748,0.00038905538,0.00031044192,0.0005493098],"domain_scores_gemma":[0.99521226,0.0036884283,0.00016231186,0.0007248839,0.00013694771,0.00007515367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021382456,0.0001863165,0.00022383955,0.00010488352,0.00071261806,0.0000959895,0.00090903474,0.00014981507,0.0000018831036],"category_scores_gemma":[0.00003866002,0.00014747007,0.00028302666,0.00040995047,0.000068758105,0.00016443127,0.000014923073,0.0005024973,0.0000011325278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025808942,0.00005971229,0.000040629056,0.0000225325,0.000055734745,4.0826788e-7,0.0003323475,0.35128406,0.00009227249,0.0010401412,0.00005513283,0.6467589],"study_design_scores_gemma":[0.00054033933,0.0006384561,0.000078135265,0.00022228909,0.00004365869,0.000010090447,0.000028891749,0.99455434,0.00034327823,0.0027637854,0.0005986184,0.00017810769],"about_ca_topic_score_codex":0.000008757073,"about_ca_topic_score_gemma":0.0000121319135,"teacher_disagreement_score":0.79619724,"about_ca_system_score_codex":0.00005338209,"about_ca_system_score_gemma":0.000045417753,"threshold_uncertainty_score":0.60136545},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34253758,0.00006821264,0.6564191,0.00008985186,0.000099941964,0.00011854475,0.000012150627,0.00020524808,0.0004493341],"genre_scores_gemma":[0.86000043,7.428818e-7,0.13943638,0.00006678851,0.00008960096,0.0000067339897,0.000018653176,0.000010510316,0.0003701893],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890375,0.000015151097,0.0001654787,0.00047507562,0.00012634815,0.00031416968],"domain_scores_gemma":[0.9988738,0.0001504867,0.00007228447,0.0008224127,0.00004555878,0.0000354991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028929312,0.00011282617,0.0001200736,0.000064606225,0.00025143393,0.00032625557,0.0009922537,0.00003196962,0.0000029936202],"category_scores_gemma":[0.000032578835,0.000103410035,0.00004086471,0.00015399216,0.000014143218,0.00050338276,0.0004887271,0.00006140405,0.000004114447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000564118,0.0006197768,0.0095711835,0.00029185973,0.00017343574,0.000030069723,0.00037034412,0.026434084,0.55210835,0.047278605,0.007887061,0.35517883],"study_design_scores_gemma":[0.00021435128,0.000015197623,0.00010160128,0.000017797349,0.000010439198,0.00001046666,0.00005864098,0.9858453,0.012536263,0.0005926439,0.00043818378,0.00015906166],"about_ca_topic_score_codex":0.0022979162,"about_ca_topic_score_gemma":0.00008594105,"teacher_disagreement_score":0.95941126,"about_ca_system_score_codex":0.000027917227,"about_ca_system_score_gemma":0.000029746752,"threshold_uncertainty_score":0.42169386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25249475,0.00053675316,0.688049,0.02278543,0.0025348663,0.0008416076,0.000065049724,0.0018106631,0.030881856],"genre_scores_gemma":[0.9514112,0.000059562422,0.040843744,0.0030329314,0.00084615464,0.000051817355,0.000030555428,0.000034533336,0.0036895333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997909,0.000100007645,0.00028991545,0.0007453719,0.00048978836,0.0004658806],"domain_scores_gemma":[0.99834716,0.00003996153,0.000083968065,0.0012386054,0.000057119854,0.00023321103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032257586,0.00025464993,0.00019661027,0.00012379778,0.00019817935,0.0003478378,0.0010389532,0.000076516444,0.00007311129],"category_scores_gemma":[0.000006158427,0.00022171409,0.00013614216,0.00017002413,0.000040529158,0.00078799477,0.00018719911,0.0002192614,0.0003556858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009791845,0.0033628044,0.0009802654,0.00006871014,0.00061611953,0.00044730192,0.009192023,0.11018101,0.12151225,0.052549,0.05121813,0.6488932],"study_design_scores_gemma":[0.0011126507,0.0013191317,0.00025520416,0.000042196836,0.000021494068,0.000050468647,0.0000657363,0.9515504,0.013880329,0.00008627826,0.030986944,0.00062912755],"about_ca_topic_score_codex":0.00004045701,"about_ca_topic_score_gemma":0.000004396045,"teacher_disagreement_score":0.84136945,"about_ca_system_score_codex":0.00008691705,"about_ca_system_score_gemma":0.000040538078,"threshold_uncertainty_score":0.90412384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09318719,0.00039349476,0.900223,0.00052359846,0.003248334,0.00019463908,9.725538e-7,0.0006531708,0.0015755865],"genre_scores_gemma":[0.99416286,0.000023576982,0.002517786,0.0022119684,0.0008323032,0.000018417388,0.000027782291,0.00001960801,0.00018568279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827826,0.0001674437,0.00027666657,0.0004907239,0.00035337114,0.00043353465],"domain_scores_gemma":[0.99862885,0.00020846371,0.00017833221,0.00057559623,0.00013686247,0.00027188135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062989345,0.00021906539,0.00020745368,0.00008146341,0.0001671369,0.00024053307,0.0005493938,0.00013687635,8.718099e-7],"category_scores_gemma":[0.00015892336,0.00020605917,0.00009473274,0.00043435613,0.000042972075,0.0003847776,0.00021603468,0.0004471482,0.000042725766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059423415,0.00006395687,0.0068459334,0.0000033486544,0.000052327654,0.000047018842,0.000873678,0.82623017,0.000042246284,0.009177543,0.037276454,0.119327925],"study_design_scores_gemma":[0.0004362207,0.00012988265,0.0008702969,0.00011172637,0.000008394045,0.0000059055046,0.00003618816,0.99646,0.000032562686,0.0006297818,0.0010100775,0.0002689444],"about_ca_topic_score_codex":0.00008740501,"about_ca_topic_score_gemma":0.000015878924,"teacher_disagreement_score":0.9009757,"about_ca_system_score_codex":0.00017114921,"about_ca_system_score_gemma":0.00008503776,"threshold_uncertainty_score":0.8402849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749432,0.00021219917,0.021117555,0.001123147,0.0001587412,0.00026845976,0.000029927016,0.00008023391,0.0020665391],"genre_scores_gemma":[0.9992408,0.000006789758,0.0003187206,0.000025516407,0.000010566222,0.000012104981,0.000019131234,0.0000021565468,0.00036421264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937576,0.000020887725,0.00017421646,0.00020139624,0.00013161656,0.00009613237],"domain_scores_gemma":[0.9990854,0.00008343062,0.000042904372,0.00070294295,0.000052282852,0.000033016233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012874567,0.000044208457,0.00008182361,0.00006280505,0.000014435527,0.00010219238,0.0007043301,0.000021523865,0.000008260863],"category_scores_gemma":[0.000036408874,0.000036956393,0.000013724095,0.00014234132,0.000005255896,0.0011635573,0.0003142662,0.00004410386,0.000045086836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066546972,0.00032514916,0.061624933,0.0002175421,0.000015429225,0.000014552291,0.0014863935,0.00008410491,0.002530896,0.028930219,0.011860861,0.89290327],"study_design_scores_gemma":[0.00037362907,0.00027513152,0.043740686,0.00049276795,0.0000024953451,0.000025575104,0.0013781115,0.94863296,0.0006859255,0.0013755695,0.0026217813,0.00039535383],"about_ca_topic_score_codex":0.0007230005,"about_ca_topic_score_gemma":0.00027186936,"teacher_disagreement_score":0.94854885,"about_ca_system_score_codex":0.000018554227,"about_ca_system_score_gemma":0.000019541181,"threshold_uncertainty_score":0.1507038},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81229776,0.00005493811,0.1785714,0.002129555,0.0006229144,0.0001710872,6.1533734e-7,0.00046827333,0.005683431],"genre_scores_gemma":[0.98809814,5.124447e-7,0.0025751265,0.008938945,0.00017454647,0.0000011239486,0.0000013761017,0.0000066027214,0.00020362808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984708,0.000110612775,0.0002521554,0.00053808175,0.00027357097,0.00035481623],"domain_scores_gemma":[0.9988297,0.00019974774,0.000081552695,0.0006871404,0.00008053822,0.00012131336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034670535,0.0001788778,0.0001900665,0.0000858488,0.00025758264,0.00031373787,0.0008258919,0.000063416526,0.000008610819],"category_scores_gemma":[0.00009835164,0.0001654387,0.00012118607,0.00023863715,0.000019565427,0.00023828453,0.00026022916,0.00025526033,0.0002048685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013909287,0.0010136985,0.002763368,0.00007175808,0.000068135836,0.00022613067,0.006852194,0.010021054,0.0035547744,0.08786842,0.01294694,0.8744744],"study_design_scores_gemma":[0.001178255,0.0006813978,0.009043603,0.00019511231,0.000009361437,0.00008304518,0.00007552551,0.9697045,0.0008390879,0.016214518,0.0013226024,0.00065296877],"about_ca_topic_score_codex":0.000019908643,"about_ca_topic_score_gemma":0.0000015282643,"teacher_disagreement_score":0.9596835,"about_ca_system_score_codex":0.00007726221,"about_ca_system_score_gemma":0.000046443252,"threshold_uncertainty_score":0.67463946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08345371,0.0010729263,0.91442686,0.000062446365,0.0002645702,0.0003234909,0.00009967378,0.00018785283,0.000108452856],"genre_scores_gemma":[0.9949517,0.00000819622,0.0034365149,0.000051982046,0.00025939138,0.000027863933,0.000043219636,0.000015290136,0.0012057968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789196,0.00010759828,0.0005953972,0.0005609119,0.00040598086,0.00043813844],"domain_scores_gemma":[0.9983685,0.0003444107,0.00020735814,0.0005946523,0.00029690773,0.00018818646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015198074,0.00020328005,0.00050319143,0.00049068633,0.00032414933,0.00035636223,0.00035414315,0.000069068825,6.57554e-7],"category_scores_gemma":[0.0000740612,0.00018454061,0.0003207932,0.0007246047,0.000022591204,0.0002872221,0.00010081262,0.00012426559,0.000009934361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013751498,0.00005764826,0.001778683,0.00004778671,0.00041174778,0.000008276366,0.00010101868,0.994377,0.00020623577,0.0024551225,0.00009479005,0.00044791383],"study_design_scores_gemma":[0.00031354034,0.000033703738,0.0001417747,0.000019595873,0.0002974506,0.000019316529,0.00007058301,0.9974179,0.0000048834513,0.000019419585,0.0014453288,0.00021647767],"about_ca_topic_score_codex":0.0005214158,"about_ca_topic_score_gemma":0.00005743096,"teacher_disagreement_score":0.91149807,"about_ca_system_score_codex":0.00010676432,"about_ca_system_score_gemma":0.000080500555,"threshold_uncertainty_score":0.75253475},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023894606,0.05476424,0.9274448,0.015364212,0.00037152934,0.00070768106,0.00000355234,0.00042966582,0.00067537336],"genre_scores_gemma":[0.3002963,0.028525744,0.6372503,0.03271069,0.0003168221,0.0004895452,0.00013543981,0.000050697716,0.00022443749],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980711,0.0006058487,0.0004906986,0.00036602098,0.00020616013,0.0002601726],"domain_scores_gemma":[0.9931863,0.0017155801,0.00025777242,0.0045132125,0.00023277455,0.00009439119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013748283,0.00020425256,0.0004085715,0.0000724136,0.00035285173,0.00020229253,0.005276974,0.000052810316,0.0000067633914],"category_scores_gemma":[0.00040288112,0.00019067168,0.00022962585,0.00023550376,0.000043852146,0.00041572627,0.0017173893,0.00021876888,0.00006694897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033873712,0.00010741669,0.00011888197,0.00082605117,0.00004780807,4.4728722e-7,0.0002406385,0.00014025952,0.00006437054,0.06224779,0.05723613,0.8789668],"study_design_scores_gemma":[0.0006301193,0.00010102989,0.00045111356,0.0034118968,0.00003299385,0.000016399741,0.0000037090529,0.31608224,0.00003956212,0.0036363087,0.6751716,0.00042300185],"about_ca_topic_score_codex":0.00003183741,"about_ca_topic_score_gemma":0.000010025899,"teacher_disagreement_score":0.8785438,"about_ca_system_score_codex":0.000041752177,"about_ca_system_score_gemma":0.000029037277,"threshold_uncertainty_score":0.98060185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01492058,0.0000091386955,0.86632025,0.0009833472,0.00017496366,0.000009091779,2.1147534e-8,0.00018152728,0.1174011],"genre_scores_gemma":[0.9905556,6.9796283e-7,0.004148565,0.0014080704,0.000032696273,6.3812064e-7,7.7309274e-8,9.221953e-7,0.0038527383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997492,0.000012707117,0.000032627056,0.00008492719,0.0000568999,0.00006364477],"domain_scores_gemma":[0.999738,0.000021381462,0.0000062474674,0.00020005852,0.000010452263,0.000023859673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008654005,0.000023361841,0.000027256272,0.000014868945,0.000027642058,0.000047163794,0.00024873266,0.00000857051,0.000011952893],"category_scores_gemma":[0.000009959523,0.000018271403,0.000019289912,0.00004189566,0.0000039975125,0.000094696676,0.00005663147,0.000023580566,0.0002854409],"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":[3.3772832e-7,0.000010152312,0.0004624196,8.4109723e-7,0.0000021175422,8.4828645e-7,0.000040957308,0.000012445139,0.0011247403,0.839866,0.010390131,0.14808905],"study_design_scores_gemma":[0.00034265613,0.000089786154,0.0041636457,0.0000066520884,0.0000021222347,0.000016808028,0.000011077215,0.8205558,0.0016704864,0.021168582,0.15172727,0.00024512774],"about_ca_topic_score_codex":0.000026955942,"about_ca_topic_score_gemma":0.0000024921308,"teacher_disagreement_score":0.975635,"about_ca_system_score_codex":0.0000028043598,"about_ca_system_score_gemma":0.00000344138,"threshold_uncertainty_score":0.36688608},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54191506,0.0029144243,0.4492422,0.000042271633,0.00037642985,0.0047668004,0.00010193599,0.0004236,0.0002173105],"genre_scores_gemma":[0.9836153,0.00011171068,0.0005256429,0.000051815514,0.00030197366,0.014761417,0.000046756686,0.000027828477,0.0005575792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976409,0.00014529774,0.0006025855,0.0009313859,0.00028878206,0.00039105536],"domain_scores_gemma":[0.9979362,0.00026302642,0.00022293767,0.00090790377,0.00049429154,0.00017566312],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047408484,0.00028360263,0.0004587105,0.000096496995,0.0013525569,0.000381038,0.00049176737,0.00013029011,4.5878474e-7],"category_scores_gemma":[0.000030384614,0.0002568893,0.00009980043,0.00030287643,0.00011332965,0.00044160525,0.00015736821,0.00017624775,0.0000151631675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018542877,0.0050999876,0.008906666,0.007079132,0.0007759455,0.00008372428,0.016573168,0.12540565,0.2574902,0.3884494,0.0077888053,0.1821619],"study_design_scores_gemma":[0.0010760827,0.00030620143,0.0007989218,0.00041541923,0.000038709935,0.00044029971,0.0028494387,0.98042166,0.0017460542,0.000083275656,0.010960685,0.0008632274],"about_ca_topic_score_codex":0.00067393965,"about_ca_topic_score_gemma":0.00001417231,"teacher_disagreement_score":0.85501605,"about_ca_system_score_codex":0.00010122926,"about_ca_system_score_gemma":0.0001371862,"threshold_uncertainty_score":0.9999883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014170738,0.000087418746,0.9757507,0.008180953,0.000710716,0.00019708966,0.000023126006,0.00020324384,0.00067604636],"genre_scores_gemma":[0.9881135,0.0000020663938,0.0020524634,0.0091716405,0.00033813866,0.00003271286,0.000029627288,0.000006796765,0.00025301243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898654,0.00003806394,0.00015131652,0.0002975056,0.00019184864,0.00033472574],"domain_scores_gemma":[0.9986185,0.0004820263,0.000051983086,0.00070759474,0.00008235128,0.000057576126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041959775,0.00012803075,0.0001244027,0.00001243433,0.0003020742,0.00042445844,0.0010609948,0.000025019099,0.000004105554],"category_scores_gemma":[0.000032990294,0.00007952044,0.0001229903,0.00018852566,0.000021835005,0.00030326232,0.0001760298,0.00008373356,0.000024649742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001119664,0.0001360987,0.0031063294,0.000041021198,0.00009932313,0.000005530311,0.000036249305,0.19487979,0.00019000954,0.6148734,0.16293608,0.023584196],"study_design_scores_gemma":[0.00040747327,0.000046644025,0.0012816299,0.000015974303,0.000013143794,0.000003767298,0.000004693872,0.9720878,0.00011689068,0.0055985027,0.020281464,0.00014200351],"about_ca_topic_score_codex":0.00014922349,"about_ca_topic_score_gemma":0.00008581042,"teacher_disagreement_score":0.9739428,"about_ca_system_score_codex":0.0000246466,"about_ca_system_score_gemma":0.000045434335,"threshold_uncertainty_score":0.40930626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013733124,0.00073895673,0.98256594,0.0005137961,0.00010800067,0.001972928,0.00019663924,0.00014087721,0.000029740799],"genre_scores_gemma":[0.7449986,0.00026663858,0.2535272,0.000028587045,0.000049363014,0.0010365227,0.00004403769,0.00001658197,0.000032478823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985963,0.00010537636,0.0004845127,0.00041266825,0.00015345826,0.0002476908],"domain_scores_gemma":[0.99461055,0.0031493667,0.00027303613,0.0014470236,0.00042664487,0.00009335108],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004111814,0.00018840225,0.00029800393,0.00020276308,0.0018306406,0.000072870906,0.0012344708,0.00007837927,2.2361397e-7],"category_scores_gemma":[0.00015210394,0.00019778321,0.00012662167,0.00039412064,0.00019152375,0.00025315594,0.00010057375,0.00025357088,0.0000011330822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016037955,0.0030396855,0.0018336531,0.0008907526,0.0009440887,0.0000015191881,0.036123965,0.043462433,0.04676365,0.08006328,0.0003053196,0.7864113],"study_design_scores_gemma":[0.0009627127,0.00011602377,0.00011681099,0.00024905588,0.000052538566,0.00001433429,0.0007671258,0.994049,0.0010758785,0.0002827338,0.0020479434,0.00026585575],"about_ca_topic_score_codex":0.00014218815,"about_ca_topic_score_gemma":0.000023088653,"teacher_disagreement_score":0.95058656,"about_ca_system_score_codex":0.000070535774,"about_ca_system_score_gemma":0.00012009758,"threshold_uncertainty_score":0.99946886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93676054,0.00006285385,0.06184934,0.00026403792,0.00014695518,0.00012983422,6.593243e-7,0.000043579286,0.00074219034],"genre_scores_gemma":[0.99576956,0.0000035246467,0.0025744427,0.0014830927,0.000010926393,0.0000049508394,1.8545276e-7,0.000001196711,0.00015212984],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951404,0.000020572075,0.000113448645,0.00014633179,0.000111214315,0.000094377705],"domain_scores_gemma":[0.99956715,0.000021432179,0.00003181546,0.00027776262,0.00007082827,0.000031002062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009511195,0.00005152938,0.00006327132,0.00002701899,0.00008419858,0.00008349731,0.00038829085,0.000014600956,0.000006955943],"category_scores_gemma":[0.000004261773,0.000033606473,0.000023048317,0.000168989,0.000014780176,0.00024689944,0.000057994348,0.0000319655,0.000007412803],"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.000005724193,0.000030613846,0.00021128773,0.0000036037304,0.000004215653,0.0000010856902,0.004819363,0.001617422,0.9587547,0.006118021,0.0000539103,0.028380012],"study_design_scores_gemma":[0.00017231313,0.000181159,0.00028134283,0.000021755797,0.000004296834,0.000006783802,0.0015135838,0.93862104,0.058326237,0.00006271097,0.00067287736,0.00013588805],"about_ca_topic_score_codex":0.00038003558,"about_ca_topic_score_gemma":0.000032865388,"teacher_disagreement_score":0.9370036,"about_ca_system_score_codex":0.000010561555,"about_ca_system_score_gemma":0.000028459554,"threshold_uncertainty_score":0.13704322},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12918103,0.00009283599,0.8696773,0.00045552073,0.00023714337,0.000031836018,0.0000015797152,0.000027623473,0.00029511203],"genre_scores_gemma":[0.97777784,0.000010165943,0.021871641,0.00013851078,0.00017923427,0.0000012118203,7.2235343e-7,0.0000041714175,0.000016496993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.00005020262,0.0001919898,0.00008624865,0.0002895699,0.000218231],"domain_scores_gemma":[0.9990796,0.000024423223,0.00024316301,0.00018670814,0.00034436095,0.000121762736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016020515,0.00010565816,0.00016173211,0.000015794387,0.00008334025,0.0001770937,0.00032652722,0.000024262281,0.000007204049],"category_scores_gemma":[0.0000150381575,0.000080359416,0.00006031884,0.00019413896,0.0000571659,0.0018434869,0.000039968076,0.00010729633,0.000006367393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004263638,0.0010332204,0.05326479,0.000056260393,0.00021461176,0.000058931455,0.0024045573,0.34075156,0.0040350137,0.4153079,0.00031123043,0.18213555],"study_design_scores_gemma":[0.0055104196,0.0049832044,0.023181813,0.0006884464,0.00029588354,0.0008496471,0.0015432249,0.628391,0.31892285,0.013061381,0.00083638635,0.0017357243],"about_ca_topic_score_codex":0.000010555918,"about_ca_topic_score_gemma":0.0000024982705,"teacher_disagreement_score":0.8485968,"about_ca_system_score_codex":0.00005427853,"about_ca_system_score_gemma":0.00021419622,"threshold_uncertainty_score":0.32769617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119622145,0.000033733144,0.9836855,0.0009228438,0.00033577284,0.00032848763,0.0000012384163,0.00030105896,0.0024291503],"genre_scores_gemma":[0.91875976,0.000002511101,0.077342354,0.0028408293,0.00008855128,0.00006391505,0.000027371823,0.0000052238415,0.0008694824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909514,0.000021513375,0.00024086409,0.00015946636,0.00016503052,0.00031798088],"domain_scores_gemma":[0.99920344,0.00012209281,0.00009012943,0.00033120936,0.0001698912,0.00008323303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002357981,0.00010694123,0.00010490519,0.000094501534,0.00015578364,0.00049580174,0.00041802088,0.00005902809,0.000036016976],"category_scores_gemma":[0.000074513635,0.000092095404,0.00008883459,0.00024242407,0.000009303785,0.0015127335,0.00010205468,0.00009800417,0.0002475711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000340309,0.00015746616,0.007905545,0.000082055914,0.00006984123,0.000001126382,0.00082028634,0.021915492,0.0005577843,0.12336854,0.07418248,0.7709054],"study_design_scores_gemma":[0.0004301768,0.000021159369,0.0005941408,0.000014021691,0.0000026130072,0.0000019330118,0.00001886719,0.98025805,0.000018564691,0.000118245225,0.018384792,0.00013746296],"about_ca_topic_score_codex":0.00039966236,"about_ca_topic_score_gemma":0.000009265406,"teacher_disagreement_score":0.95834255,"about_ca_system_score_codex":0.00004739125,"about_ca_system_score_gemma":0.000042533477,"threshold_uncertainty_score":0.47810277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6158412,0.00018365037,0.37946168,0.0029751156,0.0001771967,0.00012665676,0.0000015642562,0.00015041434,0.0010825077],"genre_scores_gemma":[0.99671465,0.00001329695,0.002615026,0.00048215897,0.000017341765,0.000007069509,0.000004867031,0.0000045223355,0.0001410532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914384,0.00011962703,0.00014702203,0.00027297044,0.00013433304,0.0001822032],"domain_scores_gemma":[0.99933463,0.00019714124,0.000046045367,0.00035786518,0.00002079205,0.000043537504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056219933,0.00009790504,0.00010550613,0.000039185823,0.00016414793,0.00027397613,0.0005081455,0.000031907326,0.0000016763943],"category_scores_gemma":[0.00002900158,0.000060880076,0.000025126496,0.00013421575,0.000024554054,0.00036840973,0.00031702322,0.00016793466,0.0000046558866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008367191,0.00034910892,0.05650171,0.00034336216,0.00009701843,0.000096161304,0.015073188,0.051660832,0.0092319,0.093225196,0.00041338764,0.7729245],"study_design_scores_gemma":[0.00022168299,0.000019479,0.011143843,0.000056878172,0.0000029927196,0.00000837444,0.00021737092,0.9873456,0.000023762406,0.0007566094,0.000098935765,0.00010450898],"about_ca_topic_score_codex":0.0015437694,"about_ca_topic_score_gemma":0.0008089958,"teacher_disagreement_score":0.93568474,"about_ca_system_score_codex":0.000024421746,"about_ca_system_score_gemma":0.000012804287,"threshold_uncertainty_score":0.2641958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8990433,0.000020455811,0.09718118,0.0004574671,0.00035028096,0.0001288762,1.7026213e-7,0.000086125554,0.0027321314],"genre_scores_gemma":[0.9967906,0.0000017144762,0.002025099,0.00093293306,0.00012982225,0.000010102608,5.4670613e-7,0.0000042687293,0.000104925406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879587,0.00025668147,0.00015332678,0.00028694622,0.00031102184,0.00019615373],"domain_scores_gemma":[0.9984546,0.00086794223,0.000036540096,0.0005792859,0.00002515338,0.00003648243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010353551,0.00010297226,0.00011340477,0.00008484505,0.00010124952,0.00017390624,0.000842819,0.00002655914,0.000009054006],"category_scores_gemma":[0.00023322184,0.00006471301,0.000042016927,0.00018624056,0.000013627778,0.00012800442,0.00013560444,0.00021326223,0.00020627152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079665275,0.003514261,0.04618449,0.000022058173,0.000102356375,0.0000713445,0.15613101,0.0076319464,0.0013794637,0.55878216,0.0019993405,0.22410187],"study_design_scores_gemma":[0.0071266075,0.0028931887,0.12630075,0.0004589562,0.00007389881,0.00007072404,0.042781517,0.7693173,0.00014812489,0.043634035,0.004928721,0.002266124],"about_ca_topic_score_codex":0.00059621123,"about_ca_topic_score_gemma":0.0010861191,"teacher_disagreement_score":0.76168543,"about_ca_system_score_codex":0.000018855439,"about_ca_system_score_gemma":0.000014801786,"threshold_uncertainty_score":0.26512718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013082814,0.00026742194,0.98427445,0.0004038049,0.00089223246,0.00014394047,0.0000022840356,0.0001972956,0.0007357493],"genre_scores_gemma":[0.99639654,0.000009842139,0.002008436,0.0009932976,0.00024475795,0.000031495398,0.000021387246,0.000009552643,0.0002847071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984323,0.00010630449,0.00029905475,0.00042002698,0.00017300504,0.0005693294],"domain_scores_gemma":[0.9989376,0.0003748913,0.000082095095,0.00041945587,0.00007267067,0.00011329719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006306402,0.0001586618,0.00022126123,0.000083427585,0.00016991337,0.00015872178,0.0006093544,0.000070680115,0.000002889349],"category_scores_gemma":[0.00006224892,0.0001373144,0.0001220999,0.00042734318,0.000017609791,0.00011235617,0.00018952013,0.00012969857,0.000004387681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018103923,0.00008574637,0.0019975256,0.000004335008,0.000013179133,0.0000037464872,0.000024573348,0.75891304,0.00003830695,0.1977197,0.003115919,0.03806586],"study_design_scores_gemma":[0.0007222365,0.000052122596,0.0010251545,0.000027627746,0.0000050947388,0.000004428919,0.0000089081805,0.9926524,0.000017271934,0.00059465173,0.0046996195,0.0001904738],"about_ca_topic_score_codex":0.00028949752,"about_ca_topic_score_gemma":0.00010061123,"teacher_disagreement_score":0.98331374,"about_ca_system_score_codex":0.00007081748,"about_ca_system_score_gemma":0.000021513175,"threshold_uncertainty_score":0.5599519},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03502722,0.000028483651,0.95835406,0.00022802719,0.0002526172,0.00023844525,0.0000037922825,0.00009050761,0.0057768608],"genre_scores_gemma":[0.64247847,0.0000014655384,0.35661295,0.00044629336,0.00001686905,0.000025757892,0.0000011370954,0.000005221711,0.00041186935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931383,0.0000075479657,0.00014386137,0.00022452972,0.00014453901,0.00016566424],"domain_scores_gemma":[0.9994103,0.00003626357,0.000047819816,0.00038582017,0.00007180489,0.0000480139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014754603,0.00008373802,0.00009900331,0.00005318321,0.000036391415,0.000013589109,0.00059433613,0.000025045836,0.000009405212],"category_scores_gemma":[0.0000033462995,0.00006638933,0.00007508228,0.00016270555,0.000012832996,0.000030688123,0.00020956369,0.000043670476,0.000011689106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002847178,0.0024518967,0.00021131306,0.0008180033,0.0004746547,0.000024857463,0.015567717,0.0064498964,0.03584846,0.44635832,0.0015950206,0.48991513],"study_design_scores_gemma":[0.0020552424,0.0002038146,0.002848488,0.00010148883,0.000041017414,0.00001397787,0.00029520775,0.9822563,0.00907037,0.001334403,0.001447719,0.00033200355],"about_ca_topic_score_codex":0.00020265918,"about_ca_topic_score_gemma":0.000019239393,"teacher_disagreement_score":0.97580636,"about_ca_system_score_codex":0.000008834729,"about_ca_system_score_gemma":0.000009285895,"threshold_uncertainty_score":0.27072784},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03710456,0.00008158234,0.96009403,0.0003349744,0.00025485328,0.00009375876,0.0000029289436,0.00014880628,0.0018844925],"genre_scores_gemma":[0.9749043,0.000006907801,0.022718651,0.0010987526,0.000034851597,0.0000054062302,0.0000046085297,0.0000020075024,0.0012245062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995406,0.0000057399393,0.000105925545,0.000058460264,0.000114287875,0.00017496946],"domain_scores_gemma":[0.99963987,0.00002642357,0.000029872279,0.00018900784,0.000054747652,0.00006010434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021567079,0.0000490282,0.000050200666,0.000043982374,0.00006126238,0.00008327395,0.00021808047,0.000016024513,0.0000028133202],"category_scores_gemma":[0.000028795428,0.000041465973,0.000047739984,0.00004574374,0.000004846806,0.002059814,0.00006747823,0.00003669116,0.00007670087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019760705,0.00017648017,0.00024698753,0.00006479216,0.000046967525,6.3795954e-7,0.005572274,0.003847,0.002031707,0.47692335,0.089516155,0.42137605],"study_design_scores_gemma":[0.00018776383,0.00002141391,0.00003546949,0.0000022334048,0.0000021392184,0.0000047745175,0.000010769985,0.9914418,0.00042124602,0.0010474866,0.0067549883,0.00006990878],"about_ca_topic_score_codex":0.0000027602305,"about_ca_topic_score_gemma":3.2953008e-7,"teacher_disagreement_score":0.9875948,"about_ca_system_score_codex":0.000020112084,"about_ca_system_score_gemma":0.000022500866,"threshold_uncertainty_score":0.16909333},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6706465,0.0004156001,0.32572484,0.00005424351,0.00012549027,0.000067966284,0.000032116335,0.000065697444,0.002867545],"genre_scores_gemma":[0.985497,0.000013729097,0.014067756,0.00007371777,0.000012408357,0.000002546952,0.000004429683,0.0000041097446,0.00032429316],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919033,0.000044826535,0.00022097582,0.00019131154,0.00019189184,0.00016065728],"domain_scores_gemma":[0.99945116,0.00009342022,0.00009235649,0.000268739,0.000038688842,0.000055643166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014331767,0.000085657164,0.00020230829,0.00007702551,0.00012653712,0.000013595368,0.00028610288,0.000028871056,0.000044585286],"category_scores_gemma":[0.00001973396,0.00007657716,0.00005269167,0.00010187356,0.000039204824,0.00022517322,0.00024159174,0.000090807574,0.0000026639298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014110674,0.0057221255,0.27433735,0.00046225163,0.0009945487,0.00045981887,0.08852537,0.0055506476,0.25722027,0.10621817,0.19704802,0.06332032],"study_design_scores_gemma":[0.0021045445,0.00032532343,0.03369901,0.00017281047,0.000018787461,0.0002009106,0.0014104708,0.9173246,0.04145072,0.0001231328,0.002584658,0.00058501406],"about_ca_topic_score_codex":0.0010930792,"about_ca_topic_score_gemma":0.000014168576,"teacher_disagreement_score":0.911774,"about_ca_system_score_codex":0.00000927788,"about_ca_system_score_gemma":0.00002546561,"threshold_uncertainty_score":0.3122726},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9366626,0.00010470987,0.05737211,0.0005008349,0.00013598491,0.000032156302,2.4797828e-7,0.00041534906,0.004775995],"genre_scores_gemma":[0.9871755,0.00007069062,0.012614783,0.000032405285,0.0000032932044,0.0000017907437,2.2766503e-7,0.0000016591899,0.00009960032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995562,0.0000033794188,0.00009568439,0.00013173847,0.000103271734,0.00010977118],"domain_scores_gemma":[0.99963623,0.000011358353,0.00003231717,0.00028636237,0.00002456143,0.00000915409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075396485,0.00005076684,0.00006842094,0.00008159331,0.000041310945,0.000019415282,0.00047096197,0.000028913784,0.0000021268174],"category_scores_gemma":[0.0000073890983,0.000041452975,0.00003094124,0.00018447425,0.00003189649,0.0002035934,0.00016521617,0.00006288485,0.000012159004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055455557,0.00009831185,0.0054292725,0.000049009534,0.000024372257,0.000012338998,0.00031148986,0.0020772142,0.08223005,0.08787953,0.00009338222,0.8217895],"study_design_scores_gemma":[0.0006052977,0.00027716844,0.005974903,0.00014006745,0.0000052595924,0.000042109892,0.00021439798,0.972419,0.015857851,0.0039420384,0.0002323747,0.00028951745],"about_ca_topic_score_codex":0.00002519663,"about_ca_topic_score_gemma":0.000012910068,"teacher_disagreement_score":0.9703418,"about_ca_system_score_codex":0.000025446037,"about_ca_system_score_gemma":0.00003366211,"threshold_uncertainty_score":0.16904032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9650734,0.00014005262,0.022187702,0.00030748907,0.00049581495,0.0004758136,0.0000036392723,0.00025515835,0.011060922],"genre_scores_gemma":[0.9981817,0.00002004306,0.00020183677,0.00018089295,0.000044349734,0.00008399217,0.0000020925816,0.0000071159498,0.0012780025],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99843395,0.00015481077,0.00026358105,0.0005320464,0.00029488184,0.00032075972],"domain_scores_gemma":[0.99899244,0.00012330679,0.00007576642,0.0005793282,0.00013521069,0.0000939463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031495374,0.00016021851,0.00025846343,0.00012598324,0.000117123745,0.00008329809,0.000470276,0.00007409469,0.000005308269],"category_scores_gemma":[0.00006249999,0.00013396787,0.00008051988,0.00035853309,0.00006568268,0.0008363068,0.00016425204,0.00023782883,0.000080890626],"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.0037677716,0.014064433,0.38067538,0.0006406425,0.0010857017,0.005822088,0.07980626,0.0043587573,0.12363537,0.2170634,0.055458784,0.11362143],"study_design_scores_gemma":[0.007989415,0.0011488679,0.53378475,0.00044283696,0.000040679242,0.0013405797,0.002925468,0.36554977,0.07350155,0.0026197345,0.007588358,0.0030680078],"about_ca_topic_score_codex":0.0030218742,"about_ca_topic_score_gemma":0.0001764748,"teacher_disagreement_score":0.361191,"about_ca_system_score_codex":0.00019135854,"about_ca_system_score_gemma":0.000117744225,"threshold_uncertainty_score":0.5463051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051649503,0.0004945586,0.94108766,0.0048762225,0.00037880286,0.00052883005,0.000006052373,0.00015941882,0.00081892463],"genre_scores_gemma":[0.9944235,0.000004217547,0.0038528775,0.00027282775,0.00052683137,0.00018295702,0.00000572627,0.000009252166,0.00072178064],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865615,0.000038007514,0.00023851363,0.00033653833,0.0003358112,0.00039496226],"domain_scores_gemma":[0.9985407,0.00011685052,0.000078871664,0.0005954448,0.0003868254,0.00028131373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080575905,0.00012707032,0.0001595205,0.00009994147,0.00021989965,0.00009673412,0.00042576634,0.000042354375,0.0000014244765],"category_scores_gemma":[0.00006909782,0.00012466662,0.000052710308,0.0004949027,0.00003067902,0.00015071551,0.00035942826,0.00012571215,0.000012618516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009960858,0.00024845198,0.027174361,0.00006460539,0.000026074542,5.3039787e-7,0.0018421975,0.0019305715,0.0012915456,0.038500864,0.007132236,0.9217786],"study_design_scores_gemma":[0.00046412647,0.00015185456,0.036191314,0.00008156837,0.00006670808,0.000025273492,0.0005259073,0.062316753,0.000562448,0.0038521574,0.8948756,0.0008863211],"about_ca_topic_score_codex":0.00018085775,"about_ca_topic_score_gemma":0.0000069874823,"teacher_disagreement_score":0.942774,"about_ca_system_score_codex":0.00006185986,"about_ca_system_score_gemma":0.000042487245,"threshold_uncertainty_score":0.5083757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9303489,0.00048900355,0.010049004,0.056809306,0.00035451615,0.00013361649,0.000001681392,0.0005292073,0.0012847752],"genre_scores_gemma":[0.99703175,0.00002958031,0.00053599535,0.00040255286,0.0000389693,0.0000053159156,3.0951324e-7,0.000002457685,0.0019530943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947506,0.0000178632,0.00005480723,0.00021387098,0.00008891208,0.00014949968],"domain_scores_gemma":[0.9995822,0.000081156664,0.000021555259,0.00025930756,0.00002419523,0.000031604643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105642204,0.000077126395,0.00008020673,0.00003980506,0.00007209023,0.00030860462,0.00043563818,0.000055042983,0.000001009238],"category_scores_gemma":[0.00004513129,0.00004429479,0.000017377059,0.00009574568,0.00014842449,0.00013221904,0.00033303755,0.0002546658,0.0000014940855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006437815,0.00002140097,0.015015526,0.0000054214433,0.000031088584,0.000023090386,0.0006396188,9.108151e-8,0.014604708,0.19912185,0.008553588,0.7619772],"study_design_scores_gemma":[0.004646844,0.002652247,0.14745426,0.00010077033,0.00012828078,0.0033648578,0.0051447125,0.45127824,0.05384896,0.08224196,0.24586825,0.0032706182],"about_ca_topic_score_codex":0.00062884117,"about_ca_topic_score_gemma":0.00066963123,"teacher_disagreement_score":0.75870657,"about_ca_system_score_codex":0.0000042020765,"about_ca_system_score_gemma":0.000011698834,"threshold_uncertainty_score":0.29758814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8302639,0.000013365578,0.16326529,0.000295216,0.0004669427,0.00006864637,0.000001912927,0.00032461985,0.0053001046],"genre_scores_gemma":[0.9945615,0.0000013684261,0.0037202681,0.0005725777,0.00006306418,0.0000022841793,0.0000022235922,0.0000065373897,0.0010701584],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991113,0.000009577739,0.00016285118,0.00032733084,0.00017089481,0.00021807553],"domain_scores_gemma":[0.99906105,0.000043450258,0.000045558,0.00063793984,0.00011361599,0.00009838386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011036492,0.000102855345,0.000101467194,0.000065783344,0.00011505039,0.00042428417,0.00056188734,0.00005003586,0.00001778916],"category_scores_gemma":[0.00004053884,0.00008675016,0.000082796665,0.00015229233,0.000035698205,0.00074446644,0.0002457061,0.00018386495,0.000099843004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022210563,0.00023932358,0.01707603,0.000006958282,0.00006878918,0.000096652366,0.00021772902,0.000058745678,0.74472976,0.14023179,0.0016318545,0.095620185],"study_design_scores_gemma":[0.00122418,0.00015517144,0.008148904,0.000028295282,0.000020056377,0.00051654514,0.00017740208,0.9614535,0.013263489,0.002129949,0.011932735,0.0009497889],"about_ca_topic_score_codex":0.0003542151,"about_ca_topic_score_gemma":0.00003186249,"teacher_disagreement_score":0.9613947,"about_ca_system_score_codex":0.000021500402,"about_ca_system_score_gemma":0.000045734156,"threshold_uncertainty_score":0.4091382},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19958214,0.000012070144,0.7951185,0.0017759165,0.00090063544,0.000118491706,0.000015619336,0.00019475953,0.0022818751],"genre_scores_gemma":[0.9741225,0.0000019508914,0.023156472,0.0005894292,0.00016397625,0.000010821248,0.000020518506,0.0000059302297,0.0019283957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922234,0.000009505548,0.00009927975,0.0003652852,0.00011986977,0.00018369601],"domain_scores_gemma":[0.99853665,0.00009048647,0.00002966302,0.0012274522,0.000051620827,0.00006414174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002653731,0.00007353736,0.00008454508,0.000035186426,0.00010009019,0.00040160274,0.0034207306,0.00004257644,0.000022055605],"category_scores_gemma":[0.00003455182,0.000060323182,0.00003306449,0.00008700798,0.000019485158,0.0010139209,0.0011497792,0.00009745022,0.00002398917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034366363,0.0002475059,0.0026253513,0.000036710917,0.000075663054,0.000020854766,0.0002657859,0.000118604476,0.05017493,0.2713101,0.13687298,0.5382172],"study_design_scores_gemma":[0.0003485475,0.000027239565,0.0005746494,0.0000039389474,0.0000073800534,0.000015079051,0.0000126539635,0.97142226,0.0024445462,0.0004099315,0.024538511,0.00019529188],"about_ca_topic_score_codex":0.00022893756,"about_ca_topic_score_gemma":0.00017478706,"teacher_disagreement_score":0.97130364,"about_ca_system_score_codex":0.0000045185056,"about_ca_system_score_gemma":0.000050299088,"threshold_uncertainty_score":0.6356625},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4152876,0.00004394468,0.5808846,0.00038247637,0.00020153017,0.00004892531,3.9140073e-7,0.00009754837,0.0030529678],"genre_scores_gemma":[0.94985354,0.0000010884376,0.049207505,0.00020853132,0.0001300192,0.000004313479,0.000001594765,0.0000040722603,0.000589308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992495,0.00002982309,0.00019468545,0.00020725082,0.00017926571,0.00013946176],"domain_scores_gemma":[0.9995183,0.000045109628,0.00004894576,0.0002744905,0.00007736414,0.000035814366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019483795,0.00008374018,0.000108144995,0.00012703228,0.00006868954,0.000099573066,0.00034448595,0.000029630608,0.0000064082656],"category_scores_gemma":[0.000042794014,0.00007076212,0.000055810513,0.00020437416,0.000010809146,0.00034841744,0.00011625005,0.000080574326,0.000024815565],"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.000005752423,0.000062526604,0.0018617131,0.000010939707,0.000009542958,0.0000033659305,0.00022286174,0.0020637675,0.36589235,0.5865536,0.0011794319,0.042134184],"study_design_scores_gemma":[0.0007421692,0.00023003975,0.011073781,0.0003775752,0.00001962464,0.000019136725,0.00056447857,0.4903453,0.48472703,0.0055812043,0.005517263,0.00080238306],"about_ca_topic_score_codex":0.002103216,"about_ca_topic_score_gemma":0.00023754932,"teacher_disagreement_score":0.5809724,"about_ca_system_score_codex":0.000026235784,"about_ca_system_score_gemma":0.000024300738,"threshold_uncertainty_score":0.31794474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70624703,0.00007416084,0.28909585,0.0009571041,0.00013614187,0.000368868,0.0000017163106,0.0003482132,0.002770924],"genre_scores_gemma":[0.9841285,0.0000068859636,0.010844885,0.0009165575,0.00005380162,0.000035590532,0.0000022902186,0.0000059625268,0.004005522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.000014983045,0.00011966371,0.00034633058,0.00013893557,0.00024052229],"domain_scores_gemma":[0.999371,0.000038577906,0.00003732974,0.00038448226,0.00010011769,0.000068505346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009144973,0.00011117716,0.00012324823,0.0000620333,0.00014208724,0.0003046338,0.0006829769,0.000034128923,0.000015804178],"category_scores_gemma":[0.0000086999635,0.00007980868,0.0000635219,0.0001583249,0.00001150612,0.0007097779,0.00006347653,0.00005434423,0.000010815777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052781217,0.001564499,0.010139385,0.00018070544,0.00025806797,0.00019592576,0.014131056,0.017956737,0.07453297,0.062161222,0.040786788,0.7775648],"study_design_scores_gemma":[0.007695087,0.0063309134,0.115776815,0.0008495265,0.00013675536,0.00030408546,0.0016272543,0.828344,0.012215399,0.009815127,0.0135611445,0.0033439046],"about_ca_topic_score_codex":0.00013294432,"about_ca_topic_score_gemma":0.00002047799,"teacher_disagreement_score":0.81038725,"about_ca_system_score_codex":0.000022655924,"about_ca_system_score_gemma":0.000047093934,"threshold_uncertainty_score":0.32545033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87322533,0.00003725116,0.12410316,0.000042295156,0.0018311989,0.00030716963,0.000024756257,0.00032843073,0.00010043241],"genre_scores_gemma":[0.9995166,0.000010764331,0.0001127649,0.0000133459935,0.00013659285,0.000039112805,0.0000075406547,0.000016915352,0.00014636581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985552,0.000056110075,0.00034188363,0.0003763548,0.00027089988,0.00039956003],"domain_scores_gemma":[0.99925,0.000098273915,0.00009523234,0.0003917046,0.00007839997,0.00008638181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002175583,0.00018560103,0.0002034285,0.0002686163,0.00017685631,0.00028503512,0.00039501843,0.00027920242,0.000009216297],"category_scores_gemma":[0.000013351061,0.00019431223,0.000113995426,0.0008075189,0.000024527644,0.0006876298,0.000002558622,0.0012624941,0.000017361566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032332385,0.0013897576,0.00038589194,0.000013799288,0.00016727218,0.000049523413,0.0006059235,0.14097036,0.42376852,0.0016331263,0.0002698337,0.43042266],"study_design_scores_gemma":[0.0019814183,0.00043994776,0.000008115383,0.000074128504,0.000020394007,0.00006187872,0.000026892478,0.96767104,0.026700757,0.00019548807,0.0024385746,0.00038139557],"about_ca_topic_score_codex":0.00024814563,"about_ca_topic_score_gemma":0.0013280585,"teacher_disagreement_score":0.8267006,"about_ca_system_score_codex":0.00023026341,"about_ca_system_score_gemma":0.00040768605,"threshold_uncertainty_score":0.7923823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122994045,0.00065391854,0.98370224,0.0018247154,0.00016377559,0.00031968625,0.000002412784,0.00031819416,0.00071564515],"genre_scores_gemma":[0.91348827,0.000034785015,0.07701191,0.005319419,0.00021186708,0.00024922425,0.000020090389,0.000011644824,0.0036527629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911183,0.000022531032,0.00015699287,0.00037889872,0.00010335419,0.00022638259],"domain_scores_gemma":[0.9989306,0.000095905314,0.000048262336,0.00079651724,0.00006850414,0.000060243536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003429115,0.0000814528,0.00008775056,0.000039275277,0.00012251311,0.00009475948,0.00040744588,0.000051164126,0.000014421646],"category_scores_gemma":[0.000011563474,0.00007307408,0.00008940531,0.00011620785,0.0000068837767,0.0002234242,0.0000690194,0.00006384269,0.0000363358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057368194,0.0003392493,0.000225241,0.000013222005,0.000014056134,6.201609e-7,0.0002799128,0.067415684,0.00064093695,0.005727425,0.05599513,0.8692911],"study_design_scores_gemma":[0.00043475744,0.00007888325,0.00005889518,0.000005358045,0.0000029546875,0.0000012434195,0.000012863397,0.8266269,0.00029202728,0.000058361988,0.17233765,0.00009010643],"about_ca_topic_score_codex":0.0000027426574,"about_ca_topic_score_gemma":0.00005463616,"teacher_disagreement_score":0.90669036,"about_ca_system_score_codex":0.00003481529,"about_ca_system_score_gemma":0.000022844799,"threshold_uncertainty_score":0.29798746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15196,0.00003921051,0.84658086,0.000062778054,0.0003319841,0.00011399183,1.5993602e-7,0.00030410688,0.0006068803],"genre_scores_gemma":[0.8021464,4.6121755e-7,0.19631645,0.00075061055,0.00011933009,0.0000020753378,0.0000014326116,0.0000087138615,0.0006545698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998926,0.000033178367,0.00020841879,0.00030084501,0.0002475278,0.0002840368],"domain_scores_gemma":[0.999512,0.000048517588,0.00006525958,0.00016404592,0.00013010763,0.000080062964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005339929,0.000103950566,0.0001012325,0.00014124595,0.00018374676,0.00016119616,0.00018985999,0.000047672613,0.0000055004907],"category_scores_gemma":[0.000015255165,0.00009425596,0.00007068642,0.00031800344,0.000016976606,0.0003052087,0.00005356996,0.000113372225,0.000010541479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003937511,0.00032835413,0.006496587,0.000015243053,0.000042400447,0.000083310624,0.00017504142,0.0011866771,0.22680898,0.0050486126,0.0001912499,0.7595842],"study_design_scores_gemma":[0.0002797469,0.00009316688,0.00048301212,0.000021238253,0.000005356636,0.00004355068,0.00003052261,0.95874774,0.03982266,0.000037108548,0.0002938575,0.0001420481],"about_ca_topic_score_codex":0.00038951312,"about_ca_topic_score_gemma":0.000021725169,"teacher_disagreement_score":0.9575611,"about_ca_system_score_codex":0.000120388395,"about_ca_system_score_gemma":0.00007001973,"threshold_uncertainty_score":0.38436466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06684831,0.000044417116,0.92294544,0.00060403044,0.00048184206,0.00021948556,0.0000038919047,0.00029067634,0.008561923],"genre_scores_gemma":[0.9904253,0.0000045419442,0.0063293125,0.001757804,0.00006535368,0.000012559033,0.000005973527,0.0000035032822,0.0013956719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992213,0.0000141109085,0.00014066904,0.0002455484,0.00015730775,0.00022105411],"domain_scores_gemma":[0.99952495,0.00007120481,0.000023131443,0.0002655143,0.00003529986,0.00007986973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021041567,0.0000827662,0.00011048452,0.000053372805,0.00009305335,0.00008669557,0.0004341449,0.000033420507,0.000017404922],"category_scores_gemma":[0.000013665082,0.0000711281,0.0001013626,0.000084652056,0.0000069624084,0.0002886505,0.00002108673,0.00006459674,0.00003322309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004356952,0.00037613642,0.00042595746,0.000015025241,0.00003267235,0.00003651115,0.0033758595,0.0015638594,0.014688305,0.10508023,0.014719336,0.85964257],"study_design_scores_gemma":[0.0076085324,0.003899173,0.014336601,0.00009743338,0.00009801042,0.00017808903,0.00057851913,0.78850746,0.017188787,0.023205493,0.14183655,0.0024653662],"about_ca_topic_score_codex":0.000019825911,"about_ca_topic_score_gemma":0.000009527074,"teacher_disagreement_score":0.92357695,"about_ca_system_score_codex":0.000015232401,"about_ca_system_score_gemma":0.000025447682,"threshold_uncertainty_score":0.29005197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032568723,0.0001498767,0.9556881,0.0003380667,0.00042501467,0.000073133284,6.0802705e-7,0.00036545284,0.010391032],"genre_scores_gemma":[0.8617242,0.000005670135,0.12727475,0.0006812729,0.00015374176,0.0000025626364,0.0000011407489,0.000008234003,0.010148439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989891,0.000020374371,0.00017723994,0.00026705142,0.00023282242,0.00031342122],"domain_scores_gemma":[0.9993331,0.000093337716,0.00003852096,0.0003952821,0.00003946753,0.000100331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325352,0.00009961954,0.000099765304,0.000098294106,0.0001202162,0.00014727094,0.00056445925,0.000045392506,0.000015999294],"category_scores_gemma":[0.000017238928,0.00008381712,0.00008316472,0.00020693948,0.000011744964,0.00036416942,0.00021068305,0.00014215278,0.0000890299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071446816,0.00007293908,0.0006953081,0.000007098422,0.000029376657,0.00009855862,0.00091630634,0.00007626798,0.002245223,0.04421101,0.0030598012,0.948581],"study_design_scores_gemma":[0.000827879,0.0001514205,0.005402397,0.0000336248,0.000016050104,0.00021190691,0.00023471653,0.9649449,0.003448064,0.005160535,0.018950632,0.0006178459],"about_ca_topic_score_codex":0.00044520875,"about_ca_topic_score_gemma":0.000062913314,"teacher_disagreement_score":0.96486866,"about_ca_system_score_codex":0.00003796276,"about_ca_system_score_gemma":0.000027986558,"threshold_uncertainty_score":0.34179628},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014273159,0.00013018634,0.97423995,0.0008930228,0.00050286547,0.00017300535,5.118099e-7,0.00023449327,0.009552834],"genre_scores_gemma":[0.94778395,0.0000027896388,0.048911776,0.0014640961,0.00009550811,0.000022028435,0.00000101244,0.000008416997,0.0017104484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892473,0.00008141729,0.00019425913,0.00033812498,0.00013555154,0.0003259075],"domain_scores_gemma":[0.99927086,0.00023511065,0.00004607447,0.0003115043,0.000049827297,0.00008659789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042225936,0.00011733056,0.00013833813,0.000058083904,0.00011618777,0.00016582213,0.0004239574,0.000045311204,0.0000056581575],"category_scores_gemma":[0.00015371101,0.00009373414,0.00012989227,0.000108325614,0.000023113404,0.00010469864,0.00009178041,0.00018859054,0.00000810826],"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.000013113523,0.000034744702,0.0006592907,0.0000075370945,0.00002586118,0.00001053311,0.00041268545,0.0001493987,0.0016355949,0.9082162,0.0007625188,0.08807252],"study_design_scores_gemma":[0.004233514,0.00096453924,0.0006736711,0.00047004866,0.000046424004,0.00060895993,0.00039039232,0.678865,0.0063743326,0.13599895,0.16959848,0.0017756748],"about_ca_topic_score_codex":0.00003472255,"about_ca_topic_score_gemma":0.000022437383,"teacher_disagreement_score":0.9335108,"about_ca_system_score_codex":0.000029045717,"about_ca_system_score_gemma":0.00003239606,"threshold_uncertainty_score":0.38223672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9766361,0.00019383561,0.021430658,0.00009302553,0.0002086125,0.00032578493,5.430088e-7,0.000077073004,0.0010343706],"genre_scores_gemma":[0.99808306,0.00003753065,0.0015522209,0.000048428574,0.000037325535,0.00008336451,0.000012145249,0.0000057979537,0.00014011365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878645,0.00011983353,0.00021948482,0.00023732241,0.00045736655,0.00017956985],"domain_scores_gemma":[0.9995155,0.000016673834,0.000056765854,0.0003030694,0.00007294194,0.000035054734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078356103,0.00009310356,0.000108730856,0.00011548269,0.00014022406,0.00012052224,0.00020928422,0.000029233355,0.000032772332],"category_scores_gemma":[0.000006777972,0.00007904742,0.000023228773,0.00024853606,0.0000096545255,0.00058900885,0.000013988719,0.00009668016,0.000057925645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021076063,0.000024641553,0.003766917,0.000004288538,0.0000033352867,0.0000013433753,0.00034423053,0.9425266,0.000024441204,0.00005919108,0.000009003826,0.053214964],"study_design_scores_gemma":[0.00072550646,0.00006988948,0.015316202,0.00006244598,0.000008511268,0.000027415314,0.0000107445985,0.9835738,0.000025954043,0.000014262979,0.00005401751,0.00011124951],"about_ca_topic_score_codex":0.0001925815,"about_ca_topic_score_gemma":0.00003331393,"teacher_disagreement_score":0.053103715,"about_ca_system_score_codex":0.00013801325,"about_ca_system_score_gemma":0.000049763632,"threshold_uncertainty_score":0.32234603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5467555,0.000058207374,0.44953498,0.00085287844,0.000091397225,0.00009710347,0.000008484591,0.00039731522,0.0022041688],"genre_scores_gemma":[0.9953494,0.0000016550657,0.0024626073,0.00020855146,0.0000081814,0.00000903764,0.000006586006,0.0000085197735,0.0019454551],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986427,0.00029455379,0.00016797245,0.00035379955,0.00025594936,0.00028501364],"domain_scores_gemma":[0.9991386,0.0001731604,0.00003961083,0.00047463016,0.000054074637,0.00011992469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034591474,0.00014984306,0.00015487357,0.00008102295,0.00013960472,0.00013379098,0.00038632526,0.000038961076,0.00006082743],"category_scores_gemma":[0.000055058197,0.000112529575,0.00005874534,0.00033183006,0.000025390682,0.00023994749,0.000026863747,0.0001241454,0.000087214954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054010027,0.0023636818,0.011925739,0.000058340876,0.0007224534,0.0021063238,0.008509659,0.014269038,0.8217827,0.07476897,0.048668046,0.0094240345],"study_design_scores_gemma":[0.013221019,0.0028675604,0.014001784,0.00037920027,0.00014272689,0.0010530984,0.0013091603,0.84882563,0.040672664,0.0007990136,0.072754115,0.003974035],"about_ca_topic_score_codex":0.00002714233,"about_ca_topic_score_gemma":0.000017535023,"teacher_disagreement_score":0.8345566,"about_ca_system_score_codex":0.0000511802,"about_ca_system_score_gemma":0.000120442164,"threshold_uncertainty_score":0.4588823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054742914,0.00003217819,0.92896813,0.010739118,0.0007859493,0.00019833677,8.249935e-7,0.00042322985,0.004109335],"genre_scores_gemma":[0.9835411,0.0000023402802,0.0071111415,0.0033506157,0.0008408504,0.000044553173,0.0000039878782,0.000010104609,0.0050953077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984997,0.000011529807,0.00020241406,0.0004620905,0.0003826414,0.00044166128],"domain_scores_gemma":[0.99928355,0.000050054598,0.00002017306,0.00032700217,0.00019926735,0.00011996529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050353515,0.0001445626,0.00016624783,0.000084256746,0.00029161898,0.0003882691,0.0008090192,0.000055513992,0.000006629189],"category_scores_gemma":[0.000048465445,0.00013972452,0.00014010526,0.00023148261,0.000007177476,0.0005743615,0.00019585407,0.00014511663,0.000018324663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004706013,0.000091905786,0.0007725187,0.000006976112,0.00004362943,0.000019137784,0.001801576,0.01129268,0.0013018278,0.11571088,0.10368209,0.7652297],"study_design_scores_gemma":[0.0004493473,0.00023597559,0.005908657,0.000031247037,0.00001768006,0.000010546139,0.0001315327,0.95644665,0.0005194117,0.0023616944,0.033277802,0.00060947106],"about_ca_topic_score_codex":0.000035435387,"about_ca_topic_score_gemma":0.000012538038,"teacher_disagreement_score":0.94515395,"about_ca_system_score_codex":0.00005058343,"about_ca_system_score_gemma":0.000016177242,"threshold_uncertainty_score":0.5697801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66774625,0.00008103337,0.33029053,0.000765219,0.00029966174,0.00016630601,3.2207367e-7,0.00008256775,0.0005681355],"genre_scores_gemma":[0.9946068,0.000006252598,0.003933758,0.00082123815,0.000534833,0.0000034214536,0.0000015004352,0.00000934552,0.00008283135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885726,0.000029215613,0.0003566794,0.00019667111,0.00023523168,0.0003249196],"domain_scores_gemma":[0.9989543,0.00039890484,0.0002864001,0.00018939201,0.00008884542,0.0000821744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065171026,0.00015831532,0.00017186026,0.00026291184,0.0006362906,0.00084094953,0.00032922736,0.000044665147,2.6902694e-7],"category_scores_gemma":[0.00007233207,0.00012292239,0.00010019001,0.00016317224,0.000014020518,0.0006075872,0.000097923585,0.00029589597,0.0000054808934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006934339,0.00007638864,0.01186204,0.00010366581,0.00007692547,0.000020602394,0.00092378235,0.054160584,0.0035693815,0.09399565,0.0009046493,0.834237],"study_design_scores_gemma":[0.0032412712,0.0014415847,0.038261876,0.0013011296,0.000039919465,0.00052249717,0.00008298066,0.9271944,0.006761795,0.015263437,0.005011622,0.00087745296],"about_ca_topic_score_codex":0.00007022682,"about_ca_topic_score_gemma":0.0000024306746,"teacher_disagreement_score":0.8730338,"about_ca_system_score_codex":0.00009885125,"about_ca_system_score_gemma":0.00003091468,"threshold_uncertainty_score":0.8109296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59040254,0.00004216833,0.40646,0.0010762934,0.00005886834,0.000027276266,4.4549088e-7,0.00006226137,0.0018701366],"genre_scores_gemma":[0.98915434,7.384278e-7,0.008200448,0.00016620485,0.000031912306,0.0000011238833,7.2328163e-7,0.0000035466298,0.0024409688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926573,0.000015301835,0.00013758133,0.0001873617,0.00026745725,0.00012657852],"domain_scores_gemma":[0.9996219,0.000024242518,0.000015246408,0.00018773622,0.00010959169,0.000041229203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027483059,0.00006411562,0.00009283547,0.000078048724,0.000054538843,0.00007313373,0.00021608405,0.00002225013,0.000001980863],"category_scores_gemma":[0.00001964621,0.000055785236,0.00003222932,0.00010291381,0.000007305889,0.00016133736,0.000093863004,0.000060871167,0.0000056503477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004617025,0.000046584275,0.00028536358,0.000009936185,0.0000075559055,0.0000059671775,0.00055051217,0.9352294,0.0051689595,0.026859099,0.0016169995,0.030214984],"study_design_scores_gemma":[0.0001118928,0.000020760286,0.00013666396,0.000009338107,0.0000024421875,0.000006874328,0.000035598794,0.9989632,0.00016647263,0.00028577127,0.0001823168,0.00007866997],"about_ca_topic_score_codex":0.0011100855,"about_ca_topic_score_gemma":0.00009623346,"teacher_disagreement_score":0.39875177,"about_ca_system_score_codex":0.000008550815,"about_ca_system_score_gemma":0.000013145422,"threshold_uncertainty_score":0.2274856},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26475358,0.00006551036,0.71203786,0.0012995447,0.008038747,0.00036895263,0.000007985244,0.0009179917,0.012509827],"genre_scores_gemma":[0.9781187,0.0000016933666,0.018278291,0.00065190165,0.0006288762,0.00003182465,0.0000021045892,0.000010034552,0.0022765337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992046,0.000015129149,0.00011588837,0.00027146822,0.000119722805,0.00027319812],"domain_scores_gemma":[0.9991762,0.00026240584,0.0000327924,0.00040926316,0.00004448195,0.000074862044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018596875,0.0001110042,0.00011430076,0.00003326419,0.00016257391,0.00018727135,0.00046622535,0.000045206194,0.000030431518],"category_scores_gemma":[0.000052008472,0.00009251154,0.0000807719,0.00010389311,0.000021716376,0.00017976332,0.0001032084,0.00013155807,0.00003752113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103727805,0.00015564763,0.0016609392,0.00003437016,0.000075815784,0.000022485903,0.0006305444,0.0013635824,0.1839893,0.59554416,0.07047855,0.14594086],"study_design_scores_gemma":[0.0016885896,0.00091752113,0.004435292,0.000081736776,0.000024644945,0.000036571546,0.00003639496,0.75768644,0.026369708,0.011139512,0.19621152,0.001372088],"about_ca_topic_score_codex":0.000058296206,"about_ca_topic_score_gemma":0.00010805324,"teacher_disagreement_score":0.75632286,"about_ca_system_score_codex":0.000008082124,"about_ca_system_score_gemma":0.000022102056,"threshold_uncertainty_score":0.3772511},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006779422,0.00012583882,0.9275829,0.0024010672,0.0002308418,0.000053848238,1.2991158e-7,0.00026355532,0.06256236],"genre_scores_gemma":[0.98792475,0.000009396303,0.009555376,0.0015852633,0.0001545002,0.000001158607,9.759717e-7,0.0000014962453,0.0007670771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.00002383094,0.00008681045,0.00014402624,0.000116329225,0.00014554367],"domain_scores_gemma":[0.9997458,0.000024700597,0.000020592684,0.00015348436,0.000024334055,0.00003109079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010326098,0.000052394043,0.000062826824,0.00001642059,0.000084287974,0.000078158,0.00025460433,0.000029139237,0.000012921024],"category_scores_gemma":[0.0000027671722,0.000047593527,0.000047744248,0.00012780193,0.0000050641306,0.00022404135,0.000010472896,0.000053000007,0.000032992142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007483661,0.000029747878,0.000016277405,9.3845387e-7,0.0000064925466,0.0000029648158,0.00039889428,0.0012172456,0.009429198,0.1452336,0.0037165498,0.8399406],"study_design_scores_gemma":[0.0034408355,0.0009296223,0.027959362,0.00013360917,0.00004036293,0.00001979562,0.000094562485,0.673278,0.016420947,0.2597686,0.016050907,0.0018634052],"about_ca_topic_score_codex":0.000011215185,"about_ca_topic_score_gemma":0.000019301475,"teacher_disagreement_score":0.9811453,"about_ca_system_score_codex":0.000008617226,"about_ca_system_score_gemma":0.000026328635,"threshold_uncertainty_score":0.19408077},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61254454,0.000036101614,0.38671315,0.00016866018,0.000052326635,0.000042548552,0.0000015747672,0.00005184256,0.00038928416],"genre_scores_gemma":[0.9585579,0.000012477638,0.039730243,0.0002458135,0.000028956681,0.000004829253,0.0000017049338,0.0000034284924,0.0014146224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999316,0.000012497836,0.00018227182,0.00020334311,0.00012912705,0.00015679435],"domain_scores_gemma":[0.99944955,0.000053865846,0.000061080005,0.00030946336,0.00008924132,0.0000367699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018076636,0.0000728794,0.00017201221,0.00020586792,0.00006983688,0.000044754175,0.00036900846,0.00002834918,0.000011957579],"category_scores_gemma":[0.000007215351,0.00006223668,0.0001594517,0.00046248574,0.000015283918,0.00032296326,0.00006980133,0.00004260773,0.000008665728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045370925,0.00045453306,0.03121696,0.000066754124,0.0011889985,0.0000017234324,0.0014997639,0.040386878,0.18310821,0.008172048,0.0015387059,0.7323201],"study_design_scores_gemma":[0.00027288715,0.000022493678,0.0052964273,0.000007436532,0.00007235434,7.0991126e-7,0.00001645138,0.98947954,0.0041295607,0.000001903934,0.0006113863,0.000088875924],"about_ca_topic_score_codex":0.000045361583,"about_ca_topic_score_gemma":0.00011841688,"teacher_disagreement_score":0.9490926,"about_ca_system_score_codex":0.000020729121,"about_ca_system_score_gemma":0.000025153093,"threshold_uncertainty_score":0.2537938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60258526,0.000289833,0.01051621,0.034268387,0.0005135341,0.0002593438,0.000002252271,0.00025858814,0.3513066],"genre_scores_gemma":[0.99276465,0.000018808492,0.00019722032,0.0025996487,0.000023406488,0.0000067834703,1.0177392e-7,0.0000024856606,0.004386866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936604,0.00009149438,0.00008879099,0.00017185418,0.00014595396,0.0001358782],"domain_scores_gemma":[0.9994553,0.00018293524,0.000021269601,0.00029174748,0.00002432927,0.000024458015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002023075,0.0000661522,0.00006494513,0.000056726993,0.0000943615,0.00012060404,0.00042084153,0.00002021315,0.00007802806],"category_scores_gemma":[0.000041418563,0.000040098996,0.000023935007,0.0003615478,0.000014403077,0.00015641806,0.000075814554,0.0001467959,0.0003446277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010060296,0.0002663632,0.0020531625,0.0000037526556,0.000025204108,0.000105257386,0.0053820377,0.002152938,0.0031363538,0.8476955,0.10317391,0.035995457],"study_design_scores_gemma":[0.0003572198,0.00009555411,0.0007447008,0.00003146221,0.0000014818008,0.00000606641,0.0003998499,0.9858234,0.00035530463,0.0008761797,0.011124993,0.00018378886],"about_ca_topic_score_codex":0.0000903764,"about_ca_topic_score_gemma":0.00015962041,"teacher_disagreement_score":0.9836705,"about_ca_system_score_codex":0.000029113533,"about_ca_system_score_gemma":0.000013588594,"threshold_uncertainty_score":0.4429607},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3504025,0.000031039748,0.6476141,0.0012214641,0.0002026144,0.00026560822,0.000006864314,0.00012844632,0.00012737828],"genre_scores_gemma":[0.96940446,0.0000036998008,0.02848342,0.0018557496,0.000044006574,0.000020448648,0.000007676169,0.000005658807,0.00017485066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.000018946317,0.00030096076,0.00019823857,0.00017517705,0.0002654659],"domain_scores_gemma":[0.99943024,0.00005794121,0.000062892614,0.0002626653,0.00009373783,0.000092545786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023731035,0.00012747191,0.00014388161,0.00015001361,0.00014965642,0.00023612223,0.0003242081,0.000036819285,0.0000031868929],"category_scores_gemma":[0.00002778726,0.00011237913,0.000103516584,0.00011114879,0.0000073989513,0.0013611272,0.000064427535,0.000074883275,0.000032633816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078161414,0.0001535235,0.0008342043,0.00015994915,0.000091748625,0.0000027984822,0.003757432,0.110678844,0.5754756,0.014706764,0.00059700484,0.29346403],"study_design_scores_gemma":[0.00039930004,0.000067445035,0.0002034123,0.000031273976,0.0000114263075,0.0000069882362,0.000104536724,0.9967452,0.0015524774,0.000052155756,0.0006506805,0.00017508365],"about_ca_topic_score_codex":0.0002399642,"about_ca_topic_score_gemma":0.00037221503,"teacher_disagreement_score":0.8860664,"about_ca_system_score_codex":0.00013268602,"about_ca_system_score_gemma":0.00005167029,"threshold_uncertainty_score":0.4582688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14042221,0.0004669795,0.85557103,0.00034272196,0.000066511304,0.00012486082,0.0000011523466,0.00012028615,0.0028842282],"genre_scores_gemma":[0.9646538,0.000020194222,0.03409551,0.00028372646,0.000015177074,0.000021744789,8.4404604e-7,0.0000041536796,0.0009048647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.000033636163,0.00014810468,0.0003313267,0.00011790321,0.000205658],"domain_scores_gemma":[0.999472,0.000054510412,0.00002662559,0.00030880826,0.00006424011,0.00007377414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033180264,0.00009576987,0.00015490137,0.0001433603,0.0001186769,0.00017137962,0.00022291616,0.000039457183,0.0000058455034],"category_scores_gemma":[0.00004139244,0.00007955382,0.00012293019,0.00043717423,0.000010433822,0.0001925047,0.00004742102,0.00005887896,0.0000042262154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345499,0.00063891965,0.0414106,0.000119364966,0.0032791342,0.000040084687,0.003252201,0.18139336,0.010646466,0.5557972,0.0043477463,0.19899148],"study_design_scores_gemma":[0.0002314496,0.0000220621,0.00003717127,0.0000062568965,0.00007822005,0.0000037095815,0.00004578058,0.99769783,0.00006296365,0.0012708463,0.0004217508,0.000121969846],"about_ca_topic_score_codex":0.00005314927,"about_ca_topic_score_gemma":0.000046716523,"teacher_disagreement_score":0.82423156,"about_ca_system_score_codex":0.000014590969,"about_ca_system_score_gemma":0.000041726307,"threshold_uncertainty_score":0.32441106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121221036,0.00013050642,0.87070066,0.0012138229,0.0006238013,0.0004303707,0.0000031411532,0.00036759852,0.0053090923],"genre_scores_gemma":[0.9858874,0.000007475276,0.009877711,0.0014851851,0.000026584581,0.0000686361,0.0000067873243,0.000005476344,0.0026347383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992919,0.000025324403,0.00013819376,0.00024363556,0.00015820787,0.00014275692],"domain_scores_gemma":[0.9994328,0.00006581457,0.000028285374,0.0003304013,0.00010219798,0.000040493338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001492158,0.00007352052,0.00008029423,0.000073405776,0.00013486922,0.0000751231,0.0002829383,0.000023644563,0.000004273065],"category_scores_gemma":[0.000005238179,0.000065194225,0.000046782538,0.00016481538,0.0000064566866,0.00021868733,0.000045422705,0.000028252021,0.00006578581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032420715,0.0014518279,0.014349377,0.0026511971,0.00079345226,0.0006646384,0.003946752,0.066651545,0.02154621,0.48333335,0.29298374,0.1113037],"study_design_scores_gemma":[0.00059418235,0.000026865271,0.00062786805,0.000020699168,0.000008214198,0.000017642787,0.00006986254,0.9865699,0.00014400814,0.00004581607,0.011750866,0.00012409611],"about_ca_topic_score_codex":0.00016082721,"about_ca_topic_score_gemma":0.000013172128,"teacher_disagreement_score":0.91991836,"about_ca_system_score_codex":0.000025231155,"about_ca_system_score_gemma":0.00002861685,"threshold_uncertainty_score":0.26585433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29843706,0.00010585867,0.7003697,0.00034922958,0.00021731878,0.00019113864,0.000119068056,0.00011098667,0.000099612356],"genre_scores_gemma":[0.9975426,0.000017179309,0.001138138,0.000047905713,0.000031309057,0.000027913326,0.000017016218,0.000010365182,0.0011675765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983519,0.000057116544,0.0002787393,0.00047931852,0.00046834015,0.0003646316],"domain_scores_gemma":[0.99896693,0.00013515796,0.00006436385,0.00032611287,0.00021446857,0.00029298212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506559,0.00022430132,0.00026344327,0.00014103552,0.000354704,0.00033120302,0.00020362138,0.000085118525,0.0000014049477],"category_scores_gemma":[0.0000053564117,0.0001803169,0.000043638705,0.000287207,0.000059154267,0.00022334643,0.0000049982877,0.00019308385,0.000008634497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009411815,0.0005490333,0.0012443028,0.0001355573,0.00028251327,0.00033440252,0.0018967891,0.9623902,0.0029639388,0.0023591244,0.0018839099,0.025019085],"study_design_scores_gemma":[0.010154877,0.0039654113,0.015086901,0.0012814538,0.00033227412,0.0022196334,0.01397209,0.9319828,0.0048077,0.00007443557,0.012768434,0.00335396],"about_ca_topic_score_codex":0.0005858848,"about_ca_topic_score_gemma":0.00016359086,"teacher_disagreement_score":0.6992316,"about_ca_system_score_codex":0.000053813426,"about_ca_system_score_gemma":0.000034506913,"threshold_uncertainty_score":0.735311},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1234904,0.0013925164,0.8730821,0.00013289845,0.0009589396,0.0006644744,0.000008481225,0.00024161364,0.000028548146],"genre_scores_gemma":[0.9525571,0.000052002364,0.044895448,0.000704194,0.0014938491,0.00009051203,0.00014779324,0.000033606164,0.000025516421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977446,0.00014773545,0.0002690557,0.00082955096,0.0002089257,0.00080013764],"domain_scores_gemma":[0.9977687,0.00049310393,0.00016175443,0.0011694125,0.00012972318,0.00027731786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061492546,0.00034612895,0.00040176828,0.000090041045,0.0003022901,0.000701861,0.0018473543,0.00015327026,0.000001836471],"category_scores_gemma":[0.000008256773,0.0002803689,0.00006154965,0.0003886193,0.00009483306,0.0015972382,0.0023833988,0.0003878773,0.0000020321713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006038939,0.00061496167,0.08093143,0.00011150511,0.0008323641,0.000039240742,0.00090437784,0.20965399,0.00002313598,0.0058939904,0.042515773,0.65787536],"study_design_scores_gemma":[0.0010768063,0.00022835127,0.01173658,0.00011085759,0.000045796023,0.000057846766,0.0000062348645,0.98472065,0.000009215995,0.000015559772,0.0015882881,0.00040384085],"about_ca_topic_score_codex":0.000034025397,"about_ca_topic_score_gemma":0.0000142371255,"teacher_disagreement_score":0.8290667,"about_ca_system_score_codex":0.000044744815,"about_ca_system_score_gemma":0.000032794753,"threshold_uncertainty_score":0.99996483},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5768688,0.00032190228,0.42184561,0.00016919826,0.00017847696,0.00023781719,0.0000071972286,0.00009716843,0.00027384478],"genre_scores_gemma":[0.99616253,0.000008016086,0.0025935308,0.00015352036,0.0000140736765,0.00006316331,0.000008234099,0.0000048682723,0.0009920562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992096,0.000013151698,0.00016368915,0.00029025145,0.00012302538,0.00020029876],"domain_scores_gemma":[0.9996306,0.000050331895,0.000030079545,0.00019774752,0.000044773802,0.000046516296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011180994,0.00009578595,0.00011230055,0.000047190963,0.00009723011,0.000095755684,0.00021666395,0.000024899962,0.0000034603895],"category_scores_gemma":[0.0000026768873,0.00007651054,0.00006327253,0.000058823745,0.00002429584,0.00005083306,0.000047338013,0.00003553999,0.000007780456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002658609,0.0035263675,0.017219558,0.00028531905,0.00020889552,0.0000458785,0.00159752,0.12429913,0.114784695,0.3975917,0.008158869,0.3320162],"study_design_scores_gemma":[0.0008088528,0.00014583711,0.004596874,0.000014130478,0.0000094077,0.0000069284392,0.000055094388,0.9916559,0.00080731715,0.00049235445,0.0012402551,0.00016704401],"about_ca_topic_score_codex":0.00015440707,"about_ca_topic_score_gemma":0.000050657483,"teacher_disagreement_score":0.8673568,"about_ca_system_score_codex":0.000024119321,"about_ca_system_score_gemma":0.000009592383,"threshold_uncertainty_score":0.31200096},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71372104,0.000008370036,0.28535908,0.000097820805,0.000070242815,0.00022377801,8.5378207e-7,0.000068459965,0.0004503555],"genre_scores_gemma":[0.9952819,5.850398e-7,0.004323898,0.00006708632,0.00001699818,0.000009740035,8.081673e-7,0.000003542333,0.00029548968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991586,0.000031538035,0.00018525621,0.00021807887,0.00027985405,0.00012665881],"domain_scores_gemma":[0.99948573,0.00003464391,0.000056366483,0.0003151687,0.00006930672,0.00003875829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018726852,0.00008115918,0.00010326596,0.00006628408,0.000054188113,0.00004440352,0.0002837578,0.000022162545,0.000007577159],"category_scores_gemma":[0.000015384518,0.00006683045,0.000035353,0.0001555459,0.00000923933,0.00020082715,0.00013712997,0.00006051207,0.000015930298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027625934,0.0012897302,0.0020457618,0.0000065604645,0.000040857984,0.000009889087,0.0035474317,0.9839003,0.0014422189,0.0038382339,0.000054217115,0.003797172],"study_design_scores_gemma":[0.0024529935,0.0008973102,0.0031715755,0.00001691884,0.000012207359,0.0000027230108,0.001495832,0.9909075,0.0006704581,0.00017551231,0.0000365074,0.000160443],"about_ca_topic_score_codex":0.00030593137,"about_ca_topic_score_gemma":0.0000713535,"teacher_disagreement_score":0.28156084,"about_ca_system_score_codex":0.000045981615,"about_ca_system_score_gemma":0.0000645612,"threshold_uncertainty_score":0.27252665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06707501,0.00006985321,0.92833036,0.001884108,0.00026439794,0.0003023423,3.2388422e-7,0.00013577621,0.0019378111],"genre_scores_gemma":[0.988102,0.0000032387447,0.008588688,0.0011165502,0.00007339963,0.00012611311,0.0000027518875,0.0000039408214,0.0019832805],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944264,0.000015784342,0.00010721689,0.00019330274,0.00007000387,0.00017104235],"domain_scores_gemma":[0.9995173,0.00007192898,0.000025390573,0.00028981364,0.00005738182,0.00003815266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013436792,0.00005583741,0.0000665981,0.000034853307,0.000053927324,0.00009932201,0.0003150228,0.000029315705,0.000019222238],"category_scores_gemma":[0.000010907016,0.000048966896,0.00003564466,0.00013444017,0.000006317483,0.00029742558,0.00006457782,0.0000464658,0.00014296986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013352869,0.0002006189,0.026278388,0.000040786894,0.000029393728,0.000003615139,0.0005176122,0.006216839,0.0017117055,0.19655317,0.3990811,0.3693534],"study_design_scores_gemma":[0.00031933514,0.000051551466,0.02441624,0.00001755738,0.0000020060716,0.0000031162235,0.000028049571,0.95705485,0.00008545538,0.008869676,0.008977041,0.00017513383],"about_ca_topic_score_codex":0.00033024306,"about_ca_topic_score_gemma":0.00007475753,"teacher_disagreement_score":0.950838,"about_ca_system_score_codex":0.000025201953,"about_ca_system_score_gemma":0.000017886743,"threshold_uncertainty_score":0.19968121},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2404783,0.00014270595,0.7576377,0.00053616083,0.0000546467,0.00040720616,0.0000036634108,0.00010004289,0.00063959515],"genre_scores_gemma":[0.9720753,0.0000051051943,0.027651047,0.000110469875,0.000011607996,0.000060138507,0.0000042211514,0.0000024747583,0.000079679136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999172,0.000054886877,0.0002043529,0.00017741925,0.00028446602,0.00010688445],"domain_scores_gemma":[0.9993539,0.000053986983,0.000066792454,0.00017914484,0.00031815824,0.000028039694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062826276,0.000072533076,0.00014843508,0.0000634734,0.0000446047,0.000026287953,0.0002428778,0.000024506806,0.000006005602],"category_scores_gemma":[0.000009464073,0.000061791594,0.000089482826,0.000078009,0.00001782166,0.0002351339,0.000020398742,0.000036358757,0.000002120366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011109498,0.0005333913,0.00034416973,0.00007082482,0.00019359739,4.6156666e-7,0.006300617,0.022611607,0.10942678,0.033960503,0.00072117377,0.8257258],"study_design_scores_gemma":[0.00043940102,0.00007509992,0.0004968607,0.000034452347,0.000025598985,0.0000011442866,0.00018395417,0.96395725,0.03424654,0.00033371602,0.00012389214,0.00008207187],"about_ca_topic_score_codex":0.00006567137,"about_ca_topic_score_gemma":0.0001461794,"teacher_disagreement_score":0.94134563,"about_ca_system_score_codex":0.00008830651,"about_ca_system_score_gemma":0.00004511059,"threshold_uncertainty_score":0.2519788},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30615413,0.0003134316,0.6708353,0.014225797,0.0075743604,0.00037937635,0.0000058923474,0.00015533954,0.00035633752],"genre_scores_gemma":[0.9916353,0.0000023014181,0.0037367232,0.00014266,0.00029999344,0.000011403156,0.000007661743,0.0000065979325,0.0041573336],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985328,0.000104643055,0.00031779028,0.00025264136,0.00042506336,0.0003670818],"domain_scores_gemma":[0.9986458,0.0003160924,0.00020864327,0.00043895972,0.00028271653,0.00010780802],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022245294,0.000104002116,0.00011447126,0.00018716218,0.0013753559,0.0022023234,0.00096087944,0.000023182985,0.00003521261],"category_scores_gemma":[0.0002604271,0.00006793103,0.00014236907,0.00071440643,0.00010047441,0.0008433632,0.0001517551,0.0003138428,0.0001401522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050142116,0.00030748994,0.008216967,0.00004713453,0.00023743417,0.00003566334,0.008796726,0.0024360067,0.09729732,0.13497835,0.6063669,0.14122988],"study_design_scores_gemma":[0.00081444066,0.000028492306,0.012671783,0.00018240328,0.000031113093,0.00021457065,0.00031977528,0.9333381,0.0005997761,0.04252102,0.008945027,0.00033350513],"about_ca_topic_score_codex":0.000030440107,"about_ca_topic_score_gemma":0.00004127865,"teacher_disagreement_score":0.93090206,"about_ca_system_score_codex":0.000064398904,"about_ca_system_score_gemma":0.00008909595,"threshold_uncertainty_score":0.9999247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6963089,0.00006521055,0.29982406,0.00025957788,0.00047193235,0.00029372337,0.0000023555897,0.00021166312,0.0025625925],"genre_scores_gemma":[0.9581963,5.220447e-7,0.040079117,0.00047634778,0.000030143196,0.000022181592,0.0000023718385,0.000007755929,0.0011852739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987444,0.000043003907,0.0003297002,0.00035974232,0.00016334612,0.00035976482],"domain_scores_gemma":[0.99938995,0.0001237778,0.000090089234,0.00027655083,0.000048938044,0.000070686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000655646,0.00011694805,0.00015554944,0.00011002071,0.000091520116,0.00003781066,0.00037618744,0.00005199472,0.000025228317],"category_scores_gemma":[0.00007466395,0.00010168399,0.000094535,0.00011735916,0.000016295577,0.00028068922,0.00017527468,0.000113321774,0.00003028162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045703282,0.0028342374,0.36940005,0.0001532467,0.00015467717,0.00052476255,0.023825122,0.0016369277,0.03253011,0.15119189,0.010036275,0.40725565],"study_design_scores_gemma":[0.0015665169,0.00009854213,0.033410467,0.00005129278,0.000006212791,0.000016821532,0.00036897272,0.96217096,0.0014735928,0.00042216468,0.000105103856,0.0003093656],"about_ca_topic_score_codex":0.0010921962,"about_ca_topic_score_gemma":0.0006501097,"teacher_disagreement_score":0.96053404,"about_ca_system_score_codex":0.000037207705,"about_ca_system_score_gemma":0.000045163382,"threshold_uncertainty_score":0.41465527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70437723,0.00007173244,0.27478543,0.00041233448,0.00028298548,0.000059234902,5.287214e-7,0.00014948938,0.019861069],"genre_scores_gemma":[0.99674773,0.000029613459,0.0013210706,0.00043321995,0.000014263041,0.000004156519,0.0000014725043,0.000003058946,0.0014454424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993846,0.000078924124,0.00011443239,0.00017376312,0.000101040874,0.00014727189],"domain_scores_gemma":[0.999707,0.000031118958,0.000022393044,0.00019637277,0.000012338022,0.00003080896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020561645,0.000062251645,0.00006976483,0.00012623078,0.000052298226,0.00011232916,0.00020756014,0.000023453293,0.000016482274],"category_scores_gemma":[0.000030181931,0.000056581775,0.00002444732,0.00025703743,0.000008078257,0.0003787487,0.000040395258,0.00009945967,0.000034608747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009952067,0.00019523318,0.07132349,0.000014747451,0.000016036367,0.000065301196,0.0018007894,0.00052347756,0.21152858,0.4766766,0.00024947152,0.2375963],"study_design_scores_gemma":[0.0033902135,0.00021372565,0.19390635,0.0004666535,0.000011338609,0.00015031238,0.00037736786,0.7336039,0.0129117975,0.012129678,0.040846813,0.0019918685],"about_ca_topic_score_codex":0.000027516106,"about_ca_topic_score_gemma":0.00004058983,"teacher_disagreement_score":0.7330804,"about_ca_system_score_codex":0.000019691099,"about_ca_system_score_gemma":0.000031382817,"threshold_uncertainty_score":0.23073378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11126396,0.00019224205,0.8861993,0.0013998194,0.00013790019,0.00032111295,0.0000032993673,0.00022736617,0.00025497747],"genre_scores_gemma":[0.5381375,0.00004315235,0.46089593,0.00053732004,0.00006666763,0.000064979016,0.0000052989417,0.000009761214,0.00023938675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989963,0.000013289851,0.00013312153,0.00037667682,0.00015108757,0.0003295195],"domain_scores_gemma":[0.99952936,0.000051280036,0.000042544358,0.00024772796,0.000046453937,0.00008260313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015663385,0.00015435401,0.00015158256,0.00004828244,0.00023337213,0.00027464828,0.0003151593,0.000053793105,0.000002341013],"category_scores_gemma":[0.000005508515,0.00011103063,0.00004575966,0.00011568181,0.00010137935,0.00026202397,0.00010598599,0.00010368687,0.0000019625404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003076821,0.00018579299,0.00079560524,0.000024451398,0.00015744168,0.000070302565,0.00078688556,0.9369773,0.00012634884,0.048561655,0.0022524635,0.009754052],"study_design_scores_gemma":[0.002018375,0.0013566517,0.0001552912,0.000031938234,0.000016994454,0.00008004076,0.00034673017,0.994224,0.00017009852,0.00037230316,0.0009230409,0.00030453384],"about_ca_topic_score_codex":0.0001148639,"about_ca_topic_score_gemma":0.000020727126,"teacher_disagreement_score":0.42687353,"about_ca_system_score_codex":0.000026010768,"about_ca_system_score_gemma":0.00007195667,"threshold_uncertainty_score":0.4527698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8898401,0.0113567645,0.07356639,0.024075435,0.00025117552,0.00023431535,0.000006953142,0.000052538522,0.00061631517],"genre_scores_gemma":[0.9899497,0.00518716,0.0038341181,0.00079700665,0.00015306067,0.000004574234,0.000004586131,0.0000069354846,0.000062862186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893737,0.00022170557,0.00028020187,0.00017690835,0.00021120346,0.00017262994],"domain_scores_gemma":[0.9974893,0.00029661413,0.00020335657,0.0018743635,0.00005796624,0.00007842762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067463034,0.00010352482,0.00013591301,0.000055112607,0.00072117936,0.00017012621,0.003272858,0.000026454045,0.0000010328275],"category_scores_gemma":[0.0000076102656,0.000068349524,0.000029323475,0.00022162538,0.00006521741,0.0002583402,0.0012009392,0.0005450142,0.0000026704572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001861759,0.00007118291,0.00071035506,0.0000046081414,0.00001723921,4.7445616e-7,0.0006619597,0.0014685574,0.0037189184,0.00033101617,0.0020945761,0.9909025],"study_design_scores_gemma":[0.00013389728,0.00014877996,0.00036002838,0.0005988843,0.000009239755,0.00008521524,0.00003146819,0.84968495,0.0007863566,0.00003742252,0.1479723,0.00015142481],"about_ca_topic_score_codex":0.000007514517,"about_ca_topic_score_gemma":0.000011288456,"teacher_disagreement_score":0.9907511,"about_ca_system_score_codex":0.000016806682,"about_ca_system_score_gemma":0.00002376792,"threshold_uncertainty_score":0.6081839},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6872243,0.000032291293,0.11165362,0.04536959,0.00076853007,0.00015404126,0.0000020372058,0.0006061823,0.15418936],"genre_scores_gemma":[0.92385185,9.020987e-7,0.0037554274,0.0059828083,0.00012559841,0.000005462288,9.141001e-7,0.000005635918,0.06627138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987459,0.000013601774,0.00013047818,0.00036837763,0.00049780635,0.00024381641],"domain_scores_gemma":[0.9991907,0.00004074144,0.00001924573,0.00052193884,0.00009940014,0.0001279656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035094845,0.00009871125,0.00008674176,0.00009464128,0.000089474815,0.00019949391,0.0007190103,0.000031459233,0.00007434954],"category_scores_gemma":[0.000058257297,0.000081866194,0.00006336549,0.00015417379,0.000006298066,0.00019039038,0.0002934599,0.00013189972,0.0016949462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024065088,0.000324485,0.0017273949,0.000006151393,0.00003615905,0.00003733853,0.0016680717,0.012725795,0.0049267323,0.45152837,0.30500206,0.22199336],"study_design_scores_gemma":[0.0005794087,0.00019697209,0.0016333484,0.000035410412,0.0000061808364,0.00001921237,0.000058082685,0.7079548,0.001985298,0.0008560047,0.28621504,0.0004602529],"about_ca_topic_score_codex":0.00007711317,"about_ca_topic_score_gemma":0.000065389606,"teacher_disagreement_score":0.695229,"about_ca_system_score_codex":0.000064986816,"about_ca_system_score_gemma":0.000021287848,"threshold_uncertainty_score":0.9990823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1659866,0.00016328384,0.74217933,0.0012566233,0.00031556239,0.00006722757,4.417668e-7,0.00036480848,0.08966613],"genre_scores_gemma":[0.97694284,0.0000042656807,0.0017910271,0.0015120617,0.00011468603,0.0000010216181,9.044093e-7,0.0000062352624,0.019626977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989411,0.000022593018,0.00017196966,0.00030181583,0.00026017876,0.00030229284],"domain_scores_gemma":[0.99920565,0.00012367693,0.00003772085,0.0005240156,0.00002249631,0.00008643547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041682506,0.00010421498,0.00010632882,0.00010308205,0.000101737314,0.00024422517,0.0005697497,0.0000408428,0.00001735319],"category_scores_gemma":[0.000018698385,0.000080957805,0.00008877049,0.00024808422,0.000019595303,0.0005274906,0.00020985704,0.00011103141,0.00020006747],"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.00005836424,0.00032152605,0.009156185,0.000029500385,0.00008534619,0.0006264068,0.0012907479,0.000058905567,0.028782308,0.81901664,0.07507271,0.065501355],"study_design_scores_gemma":[0.0031760044,0.0006891149,0.05343975,0.0002900657,0.00006748862,0.00067403814,0.0006652881,0.0915502,0.06705251,0.015402335,0.76400256,0.0029906603],"about_ca_topic_score_codex":0.00009486999,"about_ca_topic_score_gemma":0.00004035869,"teacher_disagreement_score":0.81095624,"about_ca_system_score_codex":0.000029009994,"about_ca_system_score_gemma":0.000020570444,"threshold_uncertainty_score":0.33013633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50044954,0.0002269963,0.4821021,0.0009400364,0.00028698193,0.00010284261,7.193334e-7,0.00009157992,0.015799245],"genre_scores_gemma":[0.998527,0.00001955426,0.00019576328,0.000167493,0.00005066742,0.0000026175774,1.7402024e-7,0.0000025503948,0.0010341845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00005133144,0.00013559937,0.00011829826,0.00016085869,0.00011864079],"domain_scores_gemma":[0.9995628,0.000089151494,0.000045541456,0.00024419313,0.000036182642,0.000022129987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031848467,0.000060901384,0.00008313218,0.000036963902,0.00018113066,0.00009921953,0.0004048885,0.000016985343,0.0000041189815],"category_scores_gemma":[0.000007660513,0.000036075573,0.000029398516,0.00013653644,0.00002840513,0.00035737944,0.000086240965,0.00009350985,0.000015736801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109267985,0.000051921943,0.0027260294,0.00003313898,0.00006161182,0.0000024443027,0.0032663783,0.267802,0.011205422,0.709233,0.002676583,0.0029305408],"study_design_scores_gemma":[0.00011066833,0.000036072357,0.000058078665,0.000028585131,0.0000024119374,0.000011183726,0.00044014605,0.99842656,0.00043546717,0.000009736913,0.0003820999,0.000059021044],"about_ca_topic_score_codex":0.000054424123,"about_ca_topic_score_gemma":0.00002143187,"teacher_disagreement_score":0.73062456,"about_ca_system_score_codex":0.000065586624,"about_ca_system_score_gemma":0.00003913501,"threshold_uncertainty_score":0.14711192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98986983,0.00038328144,0.00548945,0.00015116116,0.00072561903,0.00008139643,0.0000024996666,0.0001645165,0.003132239],"genre_scores_gemma":[0.9980075,0.00003734747,0.0005721969,0.0002490318,0.00048612742,0.0000058956093,0.0000024340443,0.000006030655,0.0006334784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988578,0.000100390724,0.0002375646,0.0002892362,0.0002325177,0.00028248268],"domain_scores_gemma":[0.9992579,0.00009389233,0.000063787214,0.00048494968,0.000029795363,0.00006964807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093198,0.00010722441,0.00026303536,0.00015322275,0.00010635492,0.00006359962,0.00055513927,0.000045528814,0.000028814693],"category_scores_gemma":[0.0000041939506,0.000099212666,0.00022775293,0.0015754239,0.000028345854,0.00015824649,0.000027948281,0.00014765875,0.000025393503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015841071,0.000042380085,0.0006420927,0.000003185823,0.0002833098,0.000011652396,0.00031683262,0.9449342,0.00010715457,0.00017442365,0.003311562,0.050157372],"study_design_scores_gemma":[0.00016813088,0.000044878587,0.0013356425,0.000025829324,0.00015015596,0.0000035301423,0.0000033898211,0.9938309,0.000011857501,0.00012767795,0.00415911,0.00013885819],"about_ca_topic_score_codex":0.000061063416,"about_ca_topic_score_gemma":0.00006182781,"teacher_disagreement_score":0.05001851,"about_ca_system_score_codex":0.00002002103,"about_ca_system_score_gemma":0.000041696603,"threshold_uncertainty_score":0.4045775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100689,0.00024389388,0.07358003,0.0057828804,0.0007487809,0.00019228313,0.000005286581,0.00020720603,0.009170692],"genre_scores_gemma":[0.99516684,0.00043258377,0.0029402862,0.0011328824,0.0001479061,0.000016934386,0.00002635359,0.00001038447,0.00012583139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984365,0.000124157,0.00045402945,0.00036650873,0.00036654243,0.0002522222],"domain_scores_gemma":[0.9985072,0.000136856,0.00021745144,0.00089200574,0.00017076761,0.00007571314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004403729,0.00020905926,0.00019027259,0.00040801938,0.00033671912,0.0003459507,0.0018750542,0.0000750495,0.00001531647],"category_scores_gemma":[0.000023867819,0.0002110068,0.00006075921,0.00019990446,0.000057828554,0.0005883028,0.00027865273,0.00050420425,0.000049575698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013962286,0.001596002,0.07798336,0.000065078944,0.00011737091,0.0000067414658,0.0027602508,0.069683485,0.006018101,0.25588262,0.0014270117,0.58432037],"study_design_scores_gemma":[0.00080936594,0.00006363453,0.011697137,0.00022139028,0.000004237508,0.000008320474,0.0000348641,0.98459464,0.00019615021,0.00021103377,0.0019235334,0.0002357116],"about_ca_topic_score_codex":0.0001140265,"about_ca_topic_score_gemma":0.00022551352,"teacher_disagreement_score":0.91491115,"about_ca_system_score_codex":0.00016296556,"about_ca_system_score_gemma":0.00014969251,"threshold_uncertainty_score":0.8604608},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010239108,0.000042725445,0.93719095,0.00074462406,0.00008602006,0.00004599432,8.250323e-7,0.0003457144,0.051304057],"genre_scores_gemma":[0.97830427,0.0000024700817,0.01714596,0.0011588491,0.000019745574,0.0000054065617,2.9501325e-7,0.0000035008668,0.0033595075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938756,0.000020313117,0.00008128783,0.00021005483,0.0001587889,0.00014197124],"domain_scores_gemma":[0.99954623,0.00003422113,0.000019223045,0.0003183397,0.000027643704,0.00005433688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078423785,0.000066140004,0.000060152764,0.00004928526,0.000077131255,0.000081341284,0.00038339384,0.000023766414,0.00003470546],"category_scores_gemma":[0.000012027719,0.000055841585,0.000047947582,0.000091988644,0.000008958903,0.0003352857,0.000075746095,0.00008363363,0.000084000094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019850635,0.00058085565,0.0015321153,0.000023830933,0.000066452834,0.000045481313,0.0030001448,0.5906394,0.006454362,0.16163862,0.050299052,0.1856998],"study_design_scores_gemma":[0.0001535291,0.000026674792,0.00004998949,0.000006107731,0.000001917759,0.0000017260002,0.0000049297,0.99851,0.00015340776,0.0008974521,0.00011845672,0.00007582549],"about_ca_topic_score_codex":0.000019669442,"about_ca_topic_score_gemma":0.0000026067519,"teacher_disagreement_score":0.96806514,"about_ca_system_score_codex":0.00001938754,"about_ca_system_score_gemma":0.000010035218,"threshold_uncertainty_score":0.22771537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79486156,0.0001756619,0.19604419,0.004209319,0.0003834419,0.00043795886,0.000013272054,0.00033921053,0.0035354008],"genre_scores_gemma":[0.99777,0.00014642697,0.0014057307,0.0004914558,0.00009529367,0.000023647528,0.0000015203296,0.000013309536,0.000052592717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836206,0.000012783247,0.00027648217,0.00049003476,0.00031061715,0.0005480071],"domain_scores_gemma":[0.99893796,0.000121777906,0.000056667945,0.00021793155,0.00027840093,0.00038725688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015473571,0.00028430452,0.00029880466,0.00035463544,0.00022256668,0.00019123647,0.00082916033,0.0001078792,0.000012946831],"category_scores_gemma":[0.000071744435,0.00022309605,0.00007345766,0.0004176528,0.00006162768,0.00021638456,0.00009129931,0.00048824694,0.0000129172295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002833055,0.00009675757,0.0009069531,0.000056481305,0.00008818295,0.00006225146,0.0020445965,0.007276494,0.003332131,0.9400701,0.0014960454,0.044541676],"study_design_scores_gemma":[0.00018074481,0.00022562862,0.000464501,0.00012661038,0.0000048057527,0.000043019347,0.0000146516,0.9979295,0.00020889548,0.0003797078,0.00015031321,0.00027162136],"about_ca_topic_score_codex":0.0018239917,"about_ca_topic_score_gemma":0.00019222671,"teacher_disagreement_score":0.990653,"about_ca_system_score_codex":0.00007015482,"about_ca_system_score_gemma":0.00042839083,"threshold_uncertainty_score":0.90975934},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41169316,0.006195048,0.039942317,0.005522096,0.0014329444,0.0010069043,0.000015087704,0.0014122737,0.5327802],"genre_scores_gemma":[0.9963525,0.000020030246,0.0022680352,0.0002000094,0.00004352716,0.000014949934,9.1121433e-7,0.000006695031,0.0010933576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984878,0.00019773473,0.00025374437,0.0002471511,0.00063832616,0.00017529765],"domain_scores_gemma":[0.99902135,0.000120661345,0.00012062524,0.00046973408,0.00022157292,0.00004605601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012258001,0.000103363745,0.00014948695,0.00022699084,0.00009554984,0.000059213668,0.00040799592,0.000027334425,0.000087215245],"category_scores_gemma":[0.0001422072,0.00010087072,0.0000839697,0.0003224373,0.000037863232,0.0003030818,0.000107313455,0.0001408626,0.00003116625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008129497,0.0003431495,0.014350312,0.0000493799,0.00013963615,0.000022964621,0.0008923965,0.0011097648,0.042400353,0.074927405,0.036292072,0.82946444],"study_design_scores_gemma":[0.0004793648,0.000061300525,0.0009790052,0.00016231266,0.000078245335,0.0000112744565,0.000036241192,0.98576385,0.0027399855,0.0016771697,0.0077445135,0.00026674735],"about_ca_topic_score_codex":0.00007610298,"about_ca_topic_score_gemma":0.00027672318,"teacher_disagreement_score":0.98465407,"about_ca_system_score_codex":0.00008017695,"about_ca_system_score_gemma":0.000078492056,"threshold_uncertainty_score":0.41133884},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19458291,0.0015286397,0.80289465,0.000052113508,0.00021058747,0.00030642666,7.2715386e-7,0.000103557984,0.0003203982],"genre_scores_gemma":[0.9817597,0.00024784083,0.014364714,0.0005864564,0.000049241058,0.00012330236,0.0000017476864,0.000008578088,0.0028584045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.00007157814,0.00018487824,0.00032888618,0.000108674816,0.00028598923],"domain_scores_gemma":[0.99930286,0.00025802842,0.000032704927,0.00026717372,0.000082007675,0.00005721444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003326163,0.000116737145,0.000149693,0.00006483552,0.00023896439,0.00013043093,0.00040721084,0.000057734822,0.000011682649],"category_scores_gemma":[0.000023320159,0.00009924794,0.00006211072,0.00019431589,0.000034527096,0.00044967135,0.00007326809,0.00014622063,0.00001404805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009124647,0.0001522956,0.002560568,0.0000053562067,0.00002354905,0.00007648775,0.00276105,0.9404175,0.0011574801,0.0021349762,0.004177206,0.046442244],"study_design_scores_gemma":[0.00074429164,0.00021943451,0.0009191405,0.000013806064,0.0000015616772,0.000027910786,0.000035442354,0.994677,0.0005161015,0.00007257343,0.0025699423,0.00020280459],"about_ca_topic_score_codex":0.00003491484,"about_ca_topic_score_gemma":0.000044291613,"teacher_disagreement_score":0.78852993,"about_ca_system_score_codex":0.000045435903,"about_ca_system_score_gemma":0.000056349432,"threshold_uncertainty_score":0.40472135},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066683837,0.00005752967,0.9925747,0.00034125207,0.0000070024794,0.00012054282,0.0000019432164,0.000046108747,0.00018255066],"genre_scores_gemma":[0.97946024,0.000014333635,0.02038222,0.00005540879,0.000003906906,0.000022511176,0.0000018607533,9.588875e-7,0.000058583133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997238,0.000014334865,0.0000747647,0.00008590782,0.000051193027,0.000050013863],"domain_scores_gemma":[0.9997662,0.000043354346,0.000025049243,0.00011991184,0.00002589545,0.000019630379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005527786,0.000027204482,0.000035898902,0.000022381493,0.000032115284,0.000022880542,0.00009883572,0.000007794776,0.00002168382],"category_scores_gemma":[0.0000019647082,0.000024085075,0.000009113501,0.00010820718,0.000008746958,0.00009478765,0.00003078886,0.000014599479,0.0000060112443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002898906,0.00017157054,0.004656715,0.000021585056,0.000039002916,0.0000020489733,0.0009918171,0.00023339453,0.038901683,0.16451891,0.0088038435,0.7816565],"study_design_scores_gemma":[0.001052976,0.00018643218,0.009499695,0.000008061732,0.00001865943,0.000021867634,0.00026948174,0.96799415,0.013958839,0.004026617,0.0027151478,0.00024803888],"about_ca_topic_score_codex":0.000038983424,"about_ca_topic_score_gemma":0.0000022895613,"teacher_disagreement_score":0.97279185,"about_ca_system_score_codex":0.0000048243724,"about_ca_system_score_gemma":0.0000035117844,"threshold_uncertainty_score":0.09821609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.552345,0.00009632145,0.420139,0.000329547,0.0002655819,0.00016232628,9.43664e-7,0.00006111061,0.026600162],"genre_scores_gemma":[0.9991214,0.000007235616,0.00023575833,0.00044346938,0.000009933194,0.0000051080333,1.9695543e-7,0.0000028236611,0.0001740426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926937,0.00010851511,0.00014971026,0.00017838522,0.00014092312,0.00015311784],"domain_scores_gemma":[0.99930394,0.00021519224,0.000056162477,0.00034206922,0.000058172634,0.000024475516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003695545,0.00007609395,0.00009946905,0.0000626744,0.0000686774,0.000028351165,0.0005921476,0.000030671275,0.000023856444],"category_scores_gemma":[0.000031732794,0.00004642561,0.000033791544,0.00046325204,0.00003279409,0.000117302065,0.00008809071,0.00015030496,0.000010013315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006312963,0.00047313952,0.0055680266,0.000008851376,0.0000305535,0.000041890442,0.018745765,0.014385736,0.00044589548,0.94681615,0.003136065,0.010284796],"study_design_scores_gemma":[0.00038153087,0.0003022042,0.0044755344,0.00009351981,0.0000038326343,0.0000031498419,0.0010809738,0.98892146,0.0017027721,0.0027688749,0.000048232207,0.0002179191],"about_ca_topic_score_codex":0.0004904716,"about_ca_topic_score_gemma":0.00015145743,"teacher_disagreement_score":0.9745357,"about_ca_system_score_codex":0.000017629061,"about_ca_system_score_gemma":0.00003446293,"threshold_uncertainty_score":0.18931815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97562945,0.0000104364535,0.014094198,0.0030014785,0.00015949087,0.0001085927,0.0000016767617,0.00006609615,0.006928579],"genre_scores_gemma":[0.99649066,0.000012926076,0.00028957275,0.001514207,0.0000312242,0.0000042091315,1.1973216e-7,0.0000028869315,0.0016541781],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934214,0.00006586602,0.00011232993,0.00015736991,0.00018165384,0.00014063115],"domain_scores_gemma":[0.99925935,0.00018430717,0.00003891675,0.00042518092,0.000050946986,0.000041311196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003448547,0.00007420569,0.000093803246,0.000035951707,0.00007748162,0.000046351415,0.00026666778,0.000021496902,0.000028560884],"category_scores_gemma":[0.00006905742,0.000046394616,0.000037263442,0.00017911932,0.000018735758,0.00009049462,0.00011160745,0.000106722764,0.00020759246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006586484,0.00082276703,0.024172034,0.000059781672,0.000084316605,0.00006798378,0.0039625973,0.00058942265,0.055917263,0.088568464,0.03200257,0.7936869],"study_design_scores_gemma":[0.000092571325,0.00013101552,0.013297565,0.00007399792,0.0000032890612,0.000010685633,0.000016368274,0.98272693,0.0027618762,0.000037916678,0.0007119131,0.0001358687],"about_ca_topic_score_codex":0.000022698634,"about_ca_topic_score_gemma":0.0000049570076,"teacher_disagreement_score":0.9821375,"about_ca_system_score_codex":0.000014243939,"about_ca_system_score_gemma":0.000008929767,"threshold_uncertainty_score":0.26682505},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7599431,0.000085652835,0.07790802,0.0028509574,0.0005465576,0.000062903804,0.0000010202805,0.00052587164,0.1580759],"genre_scores_gemma":[0.9899962,0.0000011527804,0.0015819077,0.002120228,0.000060594324,0.0000019457746,0.0000014053732,0.0000026805997,0.006233869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945366,0.000013840892,0.00008809331,0.00017418871,0.0001294432,0.00014077731],"domain_scores_gemma":[0.9996113,0.000016178928,0.000018463728,0.00028507598,0.00003738716,0.000031585718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006678389,0.000055473745,0.000051720635,0.00004046547,0.00005752736,0.00009213121,0.0004265531,0.000020482337,0.000020567246],"category_scores_gemma":[0.0000017341762,0.000047637477,0.000030921252,0.0001962799,0.0000048984493,0.00019882801,0.00011297071,0.0000447781,0.0005985432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011486265,0.00053795194,0.038239617,0.000032201322,0.00003290325,0.00011276682,0.00018574182,0.00079781085,0.044046853,0.74357164,0.12858498,0.043846082],"study_design_scores_gemma":[0.001275674,0.00007543101,0.034476127,0.00002740603,0.000009704657,0.00006262599,0.000026309617,0.8662864,0.0016553181,0.0069142748,0.088608146,0.00058260333],"about_ca_topic_score_codex":0.00075219973,"about_ca_topic_score_gemma":0.00019678139,"teacher_disagreement_score":0.8654886,"about_ca_system_score_codex":0.000012935326,"about_ca_system_score_gemma":0.00002014633,"threshold_uncertainty_score":0.76932615},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026384968,0.000038086582,0.91442525,0.00029129922,0.00039166797,0.00003716066,2.0186842e-7,0.00019273654,0.058238596],"genre_scores_gemma":[0.9861758,0.0000032805774,0.009331597,0.00067853887,0.00006428215,7.184256e-7,0.0000017809477,0.000002721178,0.0037413056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994771,0.000019018895,0.00011377018,0.00016524828,0.00009779088,0.00012708217],"domain_scores_gemma":[0.9996563,0.00006282374,0.000022307824,0.00015222731,0.0000609616,0.000045376608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003982123,0.000050158753,0.000051414816,0.000056327535,0.00010234677,0.00008342364,0.00019957422,0.000027980803,0.000029532965],"category_scores_gemma":[0.00002755149,0.000043491644,0.000023295463,0.00018444666,0.00000874278,0.00033191606,0.00006107186,0.0000904441,0.000064326414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007800146,0.000035506193,0.0006692368,0.000003357214,0.000013254857,0.000027831304,0.00083541026,0.00013239063,0.018714342,0.65716916,0.0021453917,0.3202463],"study_design_scores_gemma":[0.0023989868,0.0006114998,0.027266061,0.000107551496,0.000021010937,0.00015431673,0.001333043,0.7841939,0.11895091,0.012649471,0.05061101,0.0017022729],"about_ca_topic_score_codex":0.000030260258,"about_ca_topic_score_gemma":0.000021892774,"teacher_disagreement_score":0.9597908,"about_ca_system_score_codex":0.000019274768,"about_ca_system_score_gemma":0.000028795106,"threshold_uncertainty_score":0.17735377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011044705,0.00008732106,0.9837428,0.00060431747,0.000470422,0.00032636017,0.000012782153,0.0011418998,0.0025694394],"genre_scores_gemma":[0.93035054,0.00006853964,0.068267845,0.0003675534,0.0004868289,0.00012447799,0.000065271444,0.000019207826,0.00024975868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780625,0.0000104194705,0.0004943457,0.00075760955,0.0005778646,0.00035352216],"domain_scores_gemma":[0.9981046,0.000097938864,0.00022066516,0.0002487742,0.0011669622,0.0001610695],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005370613,0.00024979954,0.00018618525,0.00037250944,0.00038516274,0.0010936509,0.0022617148,0.000100595855,0.000019989007],"category_scores_gemma":[0.000052967538,0.00026542944,0.00009918589,0.0004790411,0.000043253272,0.0017021734,0.0008602347,0.00046284398,0.000048722777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069145506,0.0003659744,0.05715781,0.00007429061,0.00019785874,0.000009714669,0.0011604945,0.013116315,0.0014408121,0.38969532,0.000791308,0.535921],"study_design_scores_gemma":[0.0003350566,0.000048007296,0.0011757595,0.000054082004,0.000010892039,0.00005837481,0.000018708137,0.9810319,0.0001723791,0.0063379696,0.010484046,0.00027284407],"about_ca_topic_score_codex":0.000090089816,"about_ca_topic_score_gemma":0.000008650436,"teacher_disagreement_score":0.9679156,"about_ca_system_score_codex":0.00014113596,"about_ca_system_score_gemma":0.00008594573,"threshold_uncertainty_score":0.9999798},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31270874,0.00193293,0.67751986,0.00007900621,0.00009681844,0.0002189368,6.515061e-7,0.00018122011,0.0072618476],"genre_scores_gemma":[0.9936553,0.00003505587,0.0049828333,0.0001971025,0.00004693428,0.00003890188,0.000002530229,0.000009107314,0.0010322279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988744,0.00009595856,0.00017786957,0.00038406096,0.00017294254,0.000294734],"domain_scores_gemma":[0.9994695,0.000100104386,0.000049744758,0.00028299537,0.00005406092,0.00004355107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020898503,0.00015267618,0.00016680972,0.00009212452,0.00013000942,0.00017199501,0.00036271405,0.000044812266,0.0000060499697],"category_scores_gemma":[0.000003881228,0.00011433938,0.000034595458,0.0003251932,0.000025973755,0.00059041055,0.00012910117,0.00028212837,0.000009658887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068041845,0.0001517933,0.0024147567,0.0000031297059,0.000021341684,0.00010743865,0.0010530999,0.919777,0.0003529825,0.017917601,0.0004659827,0.057666853],"study_design_scores_gemma":[0.00078399316,0.00039280285,0.0026184907,0.00008881602,0.000004876026,0.000026831236,0.00033858774,0.9941684,0.00014398545,0.00024247021,0.00084032625,0.00035044143],"about_ca_topic_score_codex":0.000600125,"about_ca_topic_score_gemma":0.002486187,"teacher_disagreement_score":0.6809466,"about_ca_system_score_codex":0.000070582646,"about_ca_system_score_gemma":0.00004714057,"threshold_uncertainty_score":0.46626246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032881603,0.00028658696,0.9292624,0.06311833,0.00024761277,0.0009739851,0.000017617176,0.0002556229,0.0025496986],"genre_scores_gemma":[0.9609837,0.00001635014,0.029264636,0.004350911,0.0009261627,0.0004857565,0.000022443806,0.000015508627,0.003934557],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985176,0.000032665812,0.00021076872,0.0005553463,0.00030818072,0.0003754423],"domain_scores_gemma":[0.99867326,0.00017245635,0.000069866226,0.0004594259,0.00036485953,0.0002601184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552093,0.00018098927,0.00019647426,0.00013837527,0.0006114717,0.0003991182,0.00048051082,0.00005915984,6.660215e-7],"category_scores_gemma":[0.000035076144,0.00017694608,0.00005997345,0.0007854793,0.000017028615,0.00014343554,0.000111558766,0.00014072786,0.00002220248],"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.00007163483,0.00023996642,0.00038435226,0.00002460596,0.00009210846,0.0000053461567,0.0060954937,0.030362608,0.0031658516,0.19159633,0.20087123,0.56709045],"study_design_scores_gemma":[0.00036919088,0.00016316703,0.0004429705,0.00005590984,0.000025496305,0.000009523253,0.00011027067,0.06446597,0.00013877604,0.0043244385,0.92950594,0.00038834807],"about_ca_topic_score_codex":0.000021142503,"about_ca_topic_score_gemma":0.000017288723,"teacher_disagreement_score":0.9576955,"about_ca_system_score_codex":0.00004773051,"about_ca_system_score_gemma":0.00004560171,"threshold_uncertainty_score":0.7215652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124402635,0.000078473546,0.8698784,0.004074029,0.00035850875,0.00066566473,0.00039142565,0.00007936428,0.000071510396],"genre_scores_gemma":[0.99880975,0.000005865277,0.00012491486,0.00025639118,0.000028366634,0.000109672765,0.000014436818,0.000006015231,0.00064458523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000089450616,0.00028008438,0.0003228348,0.00036312733,0.00022521382],"domain_scores_gemma":[0.9989086,0.00029238322,0.00007303008,0.00032702083,0.0002975573,0.00010139958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003920653,0.00017467834,0.0002410598,0.000082726765,0.00038160098,0.00016051492,0.00030926077,0.0000677841,0.0000012478016],"category_scores_gemma":[0.000026419124,0.00011955322,0.00010530964,0.00024417983,0.000023567638,0.00013045066,0.0000014583885,0.00016881185,0.0000067114843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009270425,0.00016258062,9.674555e-7,0.000011944855,0.000035338337,0.0000010025065,0.00050371577,0.983958,0.0003062033,0.009536528,0.0016515141,0.003739465],"study_design_scores_gemma":[0.0014510375,0.0017227737,0.00015062837,0.00025906583,0.000047830363,0.000030645053,0.0005111407,0.99352,0.0007154729,0.00012219942,0.0010687192,0.0004004783],"about_ca_topic_score_codex":0.000053898246,"about_ca_topic_score_gemma":0.000013308662,"teacher_disagreement_score":0.8744071,"about_ca_system_score_codex":0.00003539646,"about_ca_system_score_gemma":0.00003518849,"threshold_uncertainty_score":0.48752388},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78781366,0.00058594754,0.20689332,0.0009883565,0.0004266378,0.00009421195,0.0000042080273,0.0005396731,0.002653993],"genre_scores_gemma":[0.9644818,0.000013018113,0.019752543,0.0005991672,0.000031665786,0.0000034497098,0.0000029618884,0.0000059405716,0.0151094785],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991049,0.00004031315,0.00013546734,0.00028159213,0.00023430979,0.00020339075],"domain_scores_gemma":[0.99947834,0.000054873602,0.00003112819,0.00031356933,0.000036036152,0.00008603119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012347582,0.00010017207,0.00009799917,0.000047827813,0.00020251985,0.000046163288,0.000427275,0.00003999702,0.00003232379],"category_scores_gemma":[0.00001515609,0.00008250661,0.000066542605,0.00011059605,0.000022323948,0.00030351168,0.00019167428,0.00013420045,0.00022558516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039884,0.0011529177,0.022211008,0.000026836307,0.00016053856,0.000465125,0.0022339458,0.0031105939,0.36600274,0.021335196,0.55835104,0.024910187],"study_design_scores_gemma":[0.0010486952,0.00005427223,0.001644259,0.000014257011,0.0000048685183,0.00027485954,0.000017853517,0.9840603,0.0023889332,0.00008954628,0.010033408,0.00036873316],"about_ca_topic_score_codex":0.00024804336,"about_ca_topic_score_gemma":0.000011351672,"teacher_disagreement_score":0.9809497,"about_ca_system_score_codex":0.000023685783,"about_ca_system_score_gemma":0.00005593482,"threshold_uncertainty_score":0.3364522},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06723152,0.00015252487,0.9287489,0.0009733095,0.0003428832,0.00016441775,0.0000030498934,0.00036317942,0.0020202317],"genre_scores_gemma":[0.50719446,0.000006596238,0.49029055,0.0005630366,0.00010396867,0.000020324294,0.0000017684745,0.00000895311,0.0018103308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998941,0.000009936601,0.0001865016,0.0003676588,0.00018291928,0.00031196006],"domain_scores_gemma":[0.9991808,0.00014645267,0.000052027477,0.00042611753,0.000093008784,0.000101626174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017296693,0.00013068001,0.0001369986,0.000075617194,0.00015097868,0.0001815248,0.00063625816,0.000056299483,0.00004323517],"category_scores_gemma":[0.00009291589,0.00011816857,0.00010764954,0.0001828277,0.00001447216,0.00044674793,0.00018267406,0.000108755456,0.000082916966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002415335,0.0009466514,0.0020340625,0.00012377056,0.00017973773,0.00002188801,0.0033174478,0.0027458628,0.4305711,0.045240022,0.0058121844,0.50898314],"study_design_scores_gemma":[0.0006820301,0.000034119985,0.000037780384,0.000029168677,0.000004127239,0.0000091797365,0.00006570477,0.9964157,0.0019709242,0.00012914342,0.00044728525,0.00017486984],"about_ca_topic_score_codex":0.00012840894,"about_ca_topic_score_gemma":0.000026936903,"teacher_disagreement_score":0.9936698,"about_ca_system_score_codex":0.000028149867,"about_ca_system_score_gemma":0.000014571131,"threshold_uncertainty_score":0.48187748},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5587528,0.000010162521,0.43715152,0.0030171017,0.0002413919,0.00023735569,0.00000509367,0.00010795883,0.00047660785],"genre_scores_gemma":[0.98790455,0.0000017328242,0.0076250955,0.0006647658,0.00007548405,0.00008453143,0.000017541037,0.000007630237,0.0036186618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989375,0.0000103637285,0.000177851,0.00048908085,0.000169299,0.00021590674],"domain_scores_gemma":[0.99901044,0.00013399728,0.000042990185,0.0005603779,0.00016709161,0.00008512587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006052,0.000094482,0.00012192767,0.000078855,0.00010677364,0.00023570893,0.00042061933,0.000059447422,0.000014104483],"category_scores_gemma":[0.00023355319,0.00008621363,0.000036170804,0.000120311706,0.00001221708,0.00028843724,0.00024421923,0.00020400081,0.0000034770203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006400398,0.00015461139,0.03168105,0.00004062954,0.000041484884,0.000008481995,0.001475381,0.0005066965,0.056352284,0.4477372,0.034019083,0.42791912],"study_design_scores_gemma":[0.0004104731,0.000031983345,0.0063798474,0.000030454183,0.0000027363426,0.000008088124,0.000055452514,0.98684126,0.00095590414,0.00025913777,0.004849876,0.00017475903],"about_ca_topic_score_codex":0.0005072276,"about_ca_topic_score_gemma":0.0004579961,"teacher_disagreement_score":0.98633456,"about_ca_system_score_codex":0.000017618824,"about_ca_system_score_gemma":0.000013897756,"threshold_uncertainty_score":0.35156897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57209814,0.000028769735,0.41198978,0.0047352333,0.00007114852,0.004239801,0.0000020533228,0.0003251462,0.00650996],"genre_scores_gemma":[0.9980521,0.0000018740992,0.00076074206,0.0007715486,0.000042291984,0.00012191023,0.0000011371471,0.0000034183445,0.0002449402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991805,0.000042354997,0.000134132,0.00023272613,0.0001880239,0.00022224829],"domain_scores_gemma":[0.9995028,0.00010558694,0.000047563863,0.0002675312,0.00001566331,0.00006087278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028155322,0.00011004775,0.000102619786,0.000049925497,0.000337117,0.00034474267,0.00037125178,0.000029623929,0.000004147231],"category_scores_gemma":[0.0000073281676,0.000073402865,0.00003618717,0.00014151109,0.000035254314,0.00034970083,0.000052745025,0.00012483165,0.0000048193847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010980595,0.00041487886,0.2614038,0.00015312785,0.00014865532,0.00004829761,0.0038655926,0.0010783442,0.018573137,0.2787622,0.003705379,0.4317368],"study_design_scores_gemma":[0.002941275,0.0020249158,0.10400036,0.00047131925,0.000040963758,0.00004241431,0.0010394767,0.87146324,0.010181259,0.005413517,0.0013311101,0.0010501273],"about_ca_topic_score_codex":0.00000799191,"about_ca_topic_score_gemma":0.0000035913868,"teacher_disagreement_score":0.87038493,"about_ca_system_score_codex":0.00007817773,"about_ca_system_score_gemma":0.000035516838,"threshold_uncertainty_score":0.33243614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7662265,0.023933573,0.20356336,0.0041640704,0.00013675223,0.00027093996,0.000001126154,0.0011552233,0.00054849207],"genre_scores_gemma":[0.9949754,0.0012746446,0.0036372372,0.00007586084,0.000011621684,0.000006780141,0.000003948937,0.0000032679065,0.000011253666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935025,0.00012693391,0.00017524335,0.00013955293,0.00006238746,0.00014565949],"domain_scores_gemma":[0.9990172,0.0002834527,0.00012265414,0.00047342357,0.00009260668,0.000010688086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039718085,0.00007701376,0.00015049035,0.000037502443,0.0002783386,0.00010071618,0.000666606,0.000100714715,5.720215e-7],"category_scores_gemma":[0.00003161983,0.00007058683,0.000014474265,0.00023377039,0.0002038484,0.00014183672,0.0010688452,0.0001927191,9.586652e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003518785,0.000023450364,0.03737008,0.000010422277,0.000025539637,1.6746942e-7,0.00030775892,0.00032972358,0.000035187077,0.061485354,0.0038209765,0.89658785],"study_design_scores_gemma":[0.00029330215,0.00007995761,0.2796477,0.000063111926,0.0000071464237,0.0000061982187,0.0005452817,0.70239764,0.000022957878,0.016255239,0.00044415786,0.00023728397],"about_ca_topic_score_codex":0.00046784678,"about_ca_topic_score_gemma":0.00004746329,"teacher_disagreement_score":0.89635056,"about_ca_system_score_codex":0.000005645358,"about_ca_system_score_gemma":0.0000066596313,"threshold_uncertainty_score":0.28784475},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13304758,0.00027712883,0.6954388,0.0009697878,0.0007791888,0.000025826885,8.477908e-8,0.00032666165,0.16913496],"genre_scores_gemma":[0.991994,0.0000014805961,0.0039975364,0.0007518031,0.000062064384,7.964572e-7,7.055074e-8,9.882483e-7,0.003191253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997462,0.000007536934,0.000030091567,0.000047251287,0.000056189892,0.000112713446],"domain_scores_gemma":[0.9997706,0.0000139007825,0.0000049662326,0.00015766153,0.000007437198,0.000045458317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074293515,0.000023409135,0.00002382009,0.000014571227,0.000024959918,0.000025899397,0.00017241428,0.000008367977,0.000024738967],"category_scores_gemma":[0.000005266337,0.000017951446,0.000017688926,0.000044894194,0.000003449071,0.00027289442,0.000062292354,0.000022955857,0.00045092398],"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":[7.7671604e-7,0.00007578149,0.016572881,0.0000017884125,0.000007653684,0.0000019481029,0.0003595155,0.000003920314,0.0042343233,0.8541845,0.016891915,0.107665],"study_design_scores_gemma":[0.001408372,0.00019806708,0.13458233,0.000026804943,0.000023791017,0.0003736765,0.0003171506,0.235737,0.015274298,0.009028223,0.6014151,0.0016151718],"about_ca_topic_score_codex":0.000017839695,"about_ca_topic_score_gemma":3.9316816e-7,"teacher_disagreement_score":0.85894644,"about_ca_system_score_codex":0.0000043693753,"about_ca_system_score_gemma":0.0000034697755,"threshold_uncertainty_score":0.5795866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011862639,0.00004131227,0.97083753,0.0007920468,0.00055978517,0.00007450943,7.0166436e-7,0.00016759823,0.015663866],"genre_scores_gemma":[0.9794788,7.423946e-7,0.015859002,0.00051088363,0.000078814744,0.0000071484055,7.60563e-7,0.0000033037634,0.0040605417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995353,0.000008868178,0.00006524318,0.00014501474,0.00011071404,0.00013483159],"domain_scores_gemma":[0.9996368,0.00004190695,0.000013979646,0.00016997108,0.00005773952,0.000079588455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002088971,0.000047605237,0.00006151826,0.000034764318,0.000042352647,0.00008542604,0.0002970889,0.000020388714,0.000001963112],"category_scores_gemma":[0.000034613633,0.00003959668,0.000058144265,0.000061216975,0.0000061461637,0.00023869776,0.000064526845,0.00003111766,0.000037424757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003906788,0.000070856855,0.0006851024,0.0000137544375,0.000053270705,0.0000134941965,0.0017826981,0.0003837328,0.0020060353,0.65680903,0.17864461,0.15949833],"study_design_scores_gemma":[0.0017740838,0.00027870436,0.00011907795,0.000013077514,0.000011396664,0.00002978601,0.00041859437,0.8975586,0.0022717614,0.015613326,0.08157818,0.0003333549],"about_ca_topic_score_codex":0.000044948305,"about_ca_topic_score_gemma":0.0000067192404,"teacher_disagreement_score":0.96761614,"about_ca_system_score_codex":0.000023946348,"about_ca_system_score_gemma":0.000035104615,"threshold_uncertainty_score":0.16147059},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25497222,0.0007054685,0.6862654,0.0046917624,0.00019371924,0.040913425,0.00007150159,0.0005435054,0.011642992],"genre_scores_gemma":[0.9820088,0.0000010209903,0.0060101533,0.00012851418,0.00004173546,0.011021512,0.0000037498448,0.000008090659,0.0007764161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991068,0.000036323738,0.00020289831,0.00033419466,0.000108814806,0.000210962],"domain_scores_gemma":[0.99937433,0.00023086253,0.00007865716,0.00024741344,0.00003400792,0.000034704466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016509816,0.00011007971,0.00013335914,0.00021331251,0.000117305965,0.00012578025,0.00029871886,0.000018187344,9.656295e-7],"category_scores_gemma":[0.000019869305,0.000103946404,0.00004363345,0.00021934103,0.000047215453,0.00009694715,0.000092988725,0.00011527939,0.0000022900572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013604957,0.00056835095,0.0711867,0.00040996203,0.00007740105,0.00003667862,0.00080913625,0.008894687,0.045960467,0.71981686,0.0022626799,0.14984103],"study_design_scores_gemma":[0.001874582,0.0001011406,0.007858029,0.0002630351,0.0000114796,0.000015181646,0.000043049877,0.91447735,0.0005509993,0.054559246,0.019791199,0.0004546877],"about_ca_topic_score_codex":0.00016259485,"about_ca_topic_score_gemma":0.0033387712,"teacher_disagreement_score":0.90558267,"about_ca_system_score_codex":0.000053490305,"about_ca_system_score_gemma":0.000078615594,"threshold_uncertainty_score":0.4238811},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23619202,0.000036264453,0.7602723,0.0023575267,0.00020246225,0.00005647176,0.0000019858514,0.00014992594,0.00073102256],"genre_scores_gemma":[0.9976874,0.000029846951,0.000643641,0.0009854252,0.000116480296,0.0000016946765,0.0000624024,0.0000024296228,0.00047067594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994604,0.000021631766,0.000105408544,0.00022267451,0.00007473449,0.000115145645],"domain_scores_gemma":[0.99938846,0.000016351783,0.000021979497,0.0005381529,0.000010096967,0.00002498842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015035346,0.000046106798,0.00005355805,0.00005256203,0.000025231262,0.00021689042,0.001343603,0.000023498931,0.000015894639],"category_scores_gemma":[0.0000057349353,0.00004151208,0.000009319791,0.00019740858,0.0000046597047,0.0016748804,0.0004081857,0.00006568799,0.000027590106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037439859,0.00007897443,0.0017341219,0.0000018552331,0.0000036738727,0.0000059592694,0.00009098712,0.027163114,0.00044802175,0.0026069575,0.0016942099,0.9661684],"study_design_scores_gemma":[0.000102145415,0.0000025369895,0.011327004,0.00000520401,5.8277664e-7,0.0000022869792,0.0000013689128,0.984997,0.000010586295,0.000003900404,0.0034887467,0.00005866716],"about_ca_topic_score_codex":0.00001552928,"about_ca_topic_score_gemma":0.0001474729,"teacher_disagreement_score":0.9661097,"about_ca_system_score_codex":0.000012818987,"about_ca_system_score_gemma":0.000012988201,"threshold_uncertainty_score":0.24967709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096246436,0.00023676372,0.90211046,0.00072412664,0.00021321537,0.00016255288,6.971632e-7,0.00011149134,0.00019426046],"genre_scores_gemma":[0.9716469,0.000017859058,0.025381496,0.0027600115,0.000097948745,0.000021055668,0.0000013407351,0.0000067971273,0.00006660698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992778,0.000040285686,0.00011187579,0.00027506662,0.00010677823,0.000188213],"domain_scores_gemma":[0.9992553,0.00028473616,0.00004917715,0.00030002475,0.000049037026,0.00006170002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002602108,0.00010630501,0.00012591347,0.000025604995,0.000106397696,0.00026624688,0.00054733123,0.000056891815,0.0000026429273],"category_scores_gemma":[0.000006816841,0.00006651237,0.000048773447,0.00008206439,0.00006252964,0.00038550308,0.00015070793,0.00014990805,0.0000018412414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014083405,0.00004424299,0.00052609824,0.00001069105,0.000053825002,0.000004040389,0.0038207897,0.005812975,0.000025892145,0.9595374,0.000065188484,0.029958017],"study_design_scores_gemma":[0.0009770093,0.0000566601,0.0006384943,0.00006583173,0.000008839562,0.0000038420935,0.0003295631,0.9775249,0.00004811525,0.02019247,0.000044096432,0.00011021963],"about_ca_topic_score_codex":0.0009078546,"about_ca_topic_score_gemma":0.00016997034,"teacher_disagreement_score":0.9717119,"about_ca_system_score_codex":0.000015437834,"about_ca_system_score_gemma":0.000011829255,"threshold_uncertainty_score":0.2712296},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6114722,0.00006423434,0.38636196,0.00086011726,0.00023441996,0.000070128226,1.5273028e-7,0.00021536645,0.00072144956],"genre_scores_gemma":[0.99651027,0.0000114197355,0.0026864738,0.0005386214,0.000037867496,0.0000052750265,0.0000015466236,0.0000056978724,0.00020282248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.000026024245,0.0001915891,0.0002814467,0.00013889612,0.0002875719],"domain_scores_gemma":[0.9995298,0.000038224913,0.000028934182,0.00030616863,0.000021500848,0.00007541273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001579232,0.00010160814,0.00012051426,0.0000982081,0.00006037721,0.00009472338,0.0004125366,0.00004584025,0.000013361066],"category_scores_gemma":[0.000012271372,0.00008981932,0.00005783643,0.00031977735,0.000016218553,0.00026826278,0.00010514291,0.00015606309,0.000037916972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013176057,0.00029048827,0.0023095796,0.000007817717,0.000023186549,0.00030806643,0.0016171281,0.85999864,0.0012989286,0.028363261,0.00029105355,0.105478674],"study_design_scores_gemma":[0.0008738072,0.000029691468,0.006561638,0.000032717482,0.0000025750835,0.0000215183,0.00008894476,0.99183446,0.00007437463,0.00019131966,0.00011078577,0.00017814134],"about_ca_topic_score_codex":0.0002749507,"about_ca_topic_score_gemma":0.0002597419,"teacher_disagreement_score":0.3850381,"about_ca_system_score_codex":0.000049186277,"about_ca_system_score_gemma":0.000028449185,"threshold_uncertainty_score":0.36627257},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030963432,0.00008872822,0.9497556,0.0009469639,0.00047316178,0.000028414064,1.9555384e-7,0.00059668283,0.017146822],"genre_scores_gemma":[0.9640164,9.095875e-7,0.03123694,0.0011280435,0.000048332327,0.0000020811074,5.7835496e-7,0.0000037924783,0.0035629696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994277,0.000025348907,0.000078843426,0.00016540829,0.00016628664,0.00013642169],"domain_scores_gemma":[0.99948335,0.00003869256,0.000017529708,0.0003074144,0.000045521992,0.000107467655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022298445,0.000057134228,0.00006364595,0.00004176753,0.000045629422,0.000111014866,0.00041181812,0.000019897798,0.0000048251054],"category_scores_gemma":[0.0000949548,0.000046855344,0.00003320069,0.000104433275,0.000007381525,0.00029328692,0.00016452945,0.000066684916,0.00025790295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022477629,0.00020012379,0.016785948,0.000011616719,0.000055383578,0.00016120232,0.0023526985,0.0031831572,0.0018381017,0.5090265,0.14896232,0.31740046],"study_design_scores_gemma":[0.004627788,0.0007046744,0.0057247444,0.000077086755,0.000029633204,0.00040875553,0.00046185896,0.7697475,0.0023205518,0.08094501,0.13281646,0.0021359248],"about_ca_topic_score_codex":0.00032618424,"about_ca_topic_score_gemma":0.000013995027,"teacher_disagreement_score":0.9330529,"about_ca_system_score_codex":0.000023050605,"about_ca_system_score_gemma":0.000050029103,"threshold_uncertainty_score":0.33149067},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69612086,0.00007001701,0.2522635,0.029854672,0.00051882793,0.00012445184,8.1992005e-7,0.00032712694,0.020719755],"genre_scores_gemma":[0.9937164,0.000007524859,0.00038021294,0.004538991,0.000016075923,0.0000045357474,2.758237e-7,0.0000033511524,0.0013326328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939185,0.000028462562,0.00008624687,0.00017721552,0.00016745346,0.00014875503],"domain_scores_gemma":[0.9994507,0.00007139415,0.000022257014,0.00040006728,0.000020416623,0.00003520165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018448033,0.000072622504,0.00005864943,0.00003331414,0.00015181272,0.0001233814,0.0005558277,0.000017744645,0.000008602249],"category_scores_gemma":[0.00002373035,0.000040830706,0.00006078947,0.000087802604,0.000016593436,0.00011814192,0.00009879107,0.00013504537,0.00020833226],"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.0000047435565,0.00007239526,0.000076608296,0.000001710063,0.000018971361,0.000025465048,0.00029871866,0.003954306,0.011548159,0.9706037,0.00058687094,0.012808336],"study_design_scores_gemma":[0.003348306,0.00074422196,0.0077889403,0.00026931352,0.00002345517,0.00018301248,0.00091121154,0.9348328,0.005161574,0.038269978,0.0072594373,0.0012077515],"about_ca_topic_score_codex":0.00025804684,"about_ca_topic_score_gemma":0.00009694803,"teacher_disagreement_score":0.9323337,"about_ca_system_score_codex":0.000057263976,"about_ca_system_score_gemma":0.000035423247,"threshold_uncertainty_score":0.26777592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033993155,0.000059099366,0.94566005,0.00006215649,0.00014887574,0.00038442636,0.0000022689605,0.00045583278,0.01923413],"genre_scores_gemma":[0.94573134,0.0000030173794,0.052657995,0.0003556784,0.000024134852,0.00034887437,0.0000012579609,0.0000040949612,0.00087357825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953157,0.000010661142,0.000090245514,0.0001726199,0.000060415885,0.00013451892],"domain_scores_gemma":[0.999636,0.00002061114,0.000027329286,0.00023623856,0.00004608041,0.000033722423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014382497,0.00005715363,0.00006285426,0.000041679505,0.000088867055,0.000058308524,0.0003541624,0.000027628601,0.000042422544],"category_scores_gemma":[0.000001880432,0.00004914938,0.00005091285,0.000080139864,0.000008279801,0.0002899053,0.00008833235,0.00003526772,0.00004973161],"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.000067512585,0.0007201335,0.0079746265,0.00027200358,0.00013249756,0.000032984794,0.006690358,0.00006920665,0.39425486,0.54510766,0.00857011,0.03610805],"study_design_scores_gemma":[0.0015618018,0.0013234693,0.0014826966,0.00026943043,0.000046258647,0.00010104526,0.00072880165,0.6136593,0.29236785,0.050458014,0.036646575,0.0013547181],"about_ca_topic_score_codex":0.00013811317,"about_ca_topic_score_gemma":0.000026224334,"teacher_disagreement_score":0.9117382,"about_ca_system_score_codex":0.0000072078483,"about_ca_system_score_gemma":0.000016091413,"threshold_uncertainty_score":0.20042536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069794606,0.0002365531,0.84742355,0.0005454213,0.004013172,0.00021083905,0.0000028426423,0.0005143547,0.14635529],"genre_scores_gemma":[0.85078096,0.00006231468,0.048016384,0.0034002934,0.0048895865,0.000020230667,0.000010793045,0.00012115552,0.09269828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964621,0.000018560628,0.0004450527,0.0014136897,0.0010680809,0.0005924941],"domain_scores_gemma":[0.9981905,0.00019144654,0.00021495284,0.0010993673,0.00014580638,0.00015791567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001264779,0.00036863846,0.00044617348,0.00072213804,0.00034023137,0.00067479326,0.005363801,0.00019152167,0.000023276269],"category_scores_gemma":[0.000030167017,0.00037240505,0.0001481826,0.0002844514,0.0004858008,0.00049429864,0.0028036595,0.00062418997,0.0002891631],"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.0000014441757,0.000009464752,0.000017453918,0.000011985606,0.000004391434,0.00005310541,0.0008313841,0.000105783285,0.000018621311,0.6515187,0.0012196844,0.34620798],"study_design_scores_gemma":[0.0007106541,0.00010901256,0.0010005032,0.00064921123,0.000014168268,0.00010655306,0.0000019857493,0.6960626,0.000038916987,0.26990724,0.029592924,0.00180623],"about_ca_topic_score_codex":0.000013082173,"about_ca_topic_score_gemma":0.000039621278,"teacher_disagreement_score":0.850083,"about_ca_system_score_codex":0.00021516076,"about_ca_system_score_gemma":0.00023405619,"threshold_uncertainty_score":0.9998728},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011244749,0.000029004555,0.96462756,0.003575277,0.0004188339,0.0001236424,9.80075e-7,0.00032275627,0.019657206],"genre_scores_gemma":[0.95913076,0.0000043989667,0.019681675,0.0040609045,0.000083127445,0.000007187688,0.0000036954434,0.0000032580926,0.01702501],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999299,0.000009434843,0.00011672811,0.0002285361,0.00013758967,0.00020874054],"domain_scores_gemma":[0.9994931,0.000037671678,0.00002289763,0.00031944437,0.000060722738,0.000066149776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015777857,0.000073489195,0.00008625595,0.000044232365,0.00007453645,0.00009073775,0.0004157586,0.000030675525,0.00002811891],"category_scores_gemma":[0.000017294788,0.0000616464,0.000076071134,0.00015662065,0.0000067437786,0.00021294969,0.000043286553,0.00004963848,0.00006272243],"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.00003663705,0.00020084187,0.0006702239,0.0000050504686,0.000020308644,0.00002098685,0.0003280599,0.000040477382,0.0039083473,0.38727993,0.1372461,0.47024304],"study_design_scores_gemma":[0.004039516,0.0025738997,0.011113791,0.000067236855,0.000037092017,0.00010639367,0.00016562373,0.3415924,0.0089952275,0.027413744,0.602444,0.0014511027],"about_ca_topic_score_codex":0.000012337818,"about_ca_topic_score_gemma":0.0000032732034,"teacher_disagreement_score":0.947886,"about_ca_system_score_codex":0.000015260008,"about_ca_system_score_gemma":0.00003318466,"threshold_uncertainty_score":0.25138673},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34521592,0.00011312568,0.65276057,0.0007402262,0.0002905706,0.0002695297,0.000016404045,0.00056963024,0.000024006511],"genre_scores_gemma":[0.9961894,0.00010286206,0.0031515856,0.00025102388,0.000013359662,0.00019913063,0.0000055850205,0.000017309487,0.00006970193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982352,0.000062616324,0.00027587847,0.00077961665,0.00027261273,0.00037403114],"domain_scores_gemma":[0.99781287,0.00005340757,0.000065186796,0.0019431789,0.000066375316,0.000059000293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017555457,0.00020319519,0.0002629289,0.0008800734,0.00023042632,0.000055090775,0.002783416,0.00027035794,0.000008409724],"category_scores_gemma":[0.000004655857,0.00020418645,0.0000741068,0.0014711138,0.00016763853,0.0005392459,0.000027501363,0.00062268774,0.00005008848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009679308,0.0033412925,0.002212465,0.000070258764,0.00016124416,0.002589881,0.00028590465,0.12593172,0.021951789,0.0008991715,0.0004524951,0.842007],"study_design_scores_gemma":[0.001247091,0.00025448055,0.00035435654,0.00007167049,0.000015648584,0.00024312374,0.000031285042,0.95058835,0.04531163,0.00022174694,0.0012317135,0.000428937],"about_ca_topic_score_codex":0.00013110501,"about_ca_topic_score_gemma":0.00007773857,"teacher_disagreement_score":0.84157807,"about_ca_system_score_codex":0.00007841316,"about_ca_system_score_gemma":0.000151536,"threshold_uncertainty_score":0.83264816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022513587,0.00008188918,0.975563,0.00033978937,0.0010298102,0.00019413907,0.000006902146,0.00011145691,0.00015943516],"genre_scores_gemma":[0.9751242,0.000010955976,0.024060093,0.0004777464,0.0001762845,0.0000030056412,0.000011330707,0.000022628277,0.00011377572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971822,0.00004696529,0.00047672,0.0010630704,0.0008488204,0.0003822085],"domain_scores_gemma":[0.9980655,0.00049540115,0.0003837219,0.00080609083,0.00013931168,0.00011002041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008045127,0.00039992802,0.00047365666,0.00064670126,0.00020478808,0.0004653347,0.0013282842,0.00023981117,0.00000925982],"category_scores_gemma":[0.00009018111,0.00035607864,0.00013887402,0.00021760851,0.00032664335,0.0005465539,0.00057590945,0.0011783818,0.000003043864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027748612,0.00008930865,0.008242906,0.00014580393,0.00001541261,0.00012324323,0.00082716614,0.2514839,0.00079936953,0.0032149802,0.0000026406228,0.73502755],"study_design_scores_gemma":[0.0002910137,0.00041869143,0.0009969558,0.00085444166,0.000007306951,0.000024218865,2.292871e-7,0.9912792,0.0018577882,0.0037472302,0.00010890738,0.00041404576],"about_ca_topic_score_codex":0.000103880266,"about_ca_topic_score_gemma":0.00022603375,"teacher_disagreement_score":0.9526106,"about_ca_system_score_codex":0.00008776648,"about_ca_system_score_gemma":0.00029197126,"threshold_uncertainty_score":0.99988914},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034962304,0.00004927639,0.95003986,0.00012710162,0.00026626972,0.00025907534,9.002912e-7,0.0001563962,0.01413883],"genre_scores_gemma":[0.9738956,0.0000033556685,0.022327345,0.00034864657,0.000018564062,0.00009240465,7.55316e-7,0.0000052940245,0.0033080364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940807,0.000020823018,0.000105527695,0.00022248607,0.00007741394,0.00016568856],"domain_scores_gemma":[0.999641,0.000049831495,0.000020332058,0.00020762575,0.000039967606,0.000041217434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001760415,0.00006984544,0.00007813456,0.000042117903,0.000044221248,0.0003098564,0.0005413393,0.000020763637,0.000033782166],"category_scores_gemma":[0.000017252367,0.000058261103,0.00007372212,0.00008817063,0.000010893513,0.0005808872,0.00003997086,0.000035127872,0.000018039176],"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.000042705607,0.00046470916,0.002623646,0.00018489137,0.00010734945,0.00003038739,0.00285555,0.00015382595,0.0734524,0.77600455,0.035648555,0.10843141],"study_design_scores_gemma":[0.002275792,0.0005104348,0.00019433718,0.000081401435,0.000024940313,0.000061019895,0.00021061194,0.72796726,0.16120343,0.010602225,0.09596755,0.0009010046],"about_ca_topic_score_codex":0.000030135609,"about_ca_topic_score_gemma":0.0000055380156,"teacher_disagreement_score":0.9389333,"about_ca_system_score_codex":0.000013769986,"about_ca_system_score_gemma":0.000020962925,"threshold_uncertainty_score":0.29879522},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015525746,0.00032457875,0.99330825,0.00037274402,0.0033587927,0.00053494284,0.000011200582,0.00015620388,0.0003807421],"genre_scores_gemma":[0.698026,0.000058208872,0.29007676,0.009674046,0.0011724347,0.00002782437,0.00001253674,0.00013683536,0.0008153553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960688,0.000051456638,0.00054901885,0.0017021223,0.0007952518,0.00083336857],"domain_scores_gemma":[0.9973289,0.0005203024,0.0003273378,0.0013993593,0.00025103285,0.00017307307],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009862493,0.000591384,0.0006017241,0.0008621826,0.0004737043,0.0014956287,0.0039405804,0.00030003724,0.000008579321],"category_scores_gemma":[0.00009254371,0.0005615897,0.00022347133,0.00037423,0.00022349741,0.0012415966,0.0013295563,0.0007569426,0.0000068286486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025630552,0.00012226013,0.0025123362,0.00049806834,0.00010403765,0.00037665086,0.0011848959,0.44123432,0.0018547596,0.034173038,0.00018831652,0.5177257],"study_design_scores_gemma":[0.00037691245,0.000105774525,0.00008555537,0.0009068061,0.000026308142,0.00015469168,2.1009527e-7,0.9570315,0.0006857519,0.038696557,0.0009108335,0.0010191301],"about_ca_topic_score_codex":0.00020328519,"about_ca_topic_score_gemma":0.00020797065,"teacher_disagreement_score":0.70323145,"about_ca_system_score_codex":0.00036065676,"about_ca_system_score_gemma":0.00041945357,"threshold_uncertainty_score":0.99968356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10765566,0.00008254292,0.89153075,0.000427365,0.00021038766,0.000033434306,1.7078267e-7,0.000010986677,0.00004867914],"genre_scores_gemma":[0.4988423,0.0000055599626,0.5010314,0.00009286116,0.000026010022,3.9251313e-7,7.564884e-8,0.0000010901391,3.3482863e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925965,0.000037634443,0.000259825,0.00011496994,0.00021320966,0.000114709284],"domain_scores_gemma":[0.9993448,0.00040270705,0.00008780286,0.000041921423,0.00008277046,0.00004000074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020098898,0.00006774708,0.00012152411,0.00035083786,0.00009229586,0.00010986441,0.00022165888,0.000020726506,2.602081e-7],"category_scores_gemma":[0.00014640525,0.000057723275,0.000039770122,0.00027508396,0.000009685226,0.00045812412,0.000013025788,0.00010905079,3.3170824e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005886594,0.000009889397,0.00005894284,0.000006114654,0.0000012095776,7.095746e-7,0.000046124595,0.96950847,0.00022307494,0.0013949246,0.000001118558,0.02874351],"study_design_scores_gemma":[0.0002593325,0.00023150946,0.00047545976,0.000111912996,0.0000019048329,0.000016711236,0.0000074129352,0.99772525,0.000018377012,0.0010774629,0.000006185982,0.00006845443],"about_ca_topic_score_codex":7.387778e-7,"about_ca_topic_score_gemma":4.0276657e-8,"teacher_disagreement_score":0.39118662,"about_ca_system_score_codex":0.000028218597,"about_ca_system_score_gemma":0.00007573959,"threshold_uncertainty_score":0.23538868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027302869,0.000038411275,0.96985537,0.0004161145,0.0001394502,0.00020046963,0.000006287732,0.00007866002,0.0019623812],"genre_scores_gemma":[0.9935305,0.0000017001943,0.0051283306,0.00041359907,0.000023047183,0.000027054984,0.000015841031,0.0000034882453,0.00085642555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939317,0.000020154022,0.000112983864,0.0002569735,0.000099032964,0.0001176777],"domain_scores_gemma":[0.99908787,0.00007060347,0.000029626573,0.00076236174,0.000026751015,0.000022782797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043698278,0.000054110842,0.000047358186,0.000017897442,0.00009631783,0.000060221097,0.0007726526,0.00001762648,0.000007861959],"category_scores_gemma":[0.000016694565,0.0000356558,0.000035855912,0.000095005154,0.000011575475,0.00011339837,0.000065603104,0.00005140052,0.000015704756],"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.000002875305,0.00007835121,0.001071792,0.0000039032434,0.0000176055,4.0796033e-7,0.0003406152,0.002780784,0.0009921052,0.9825244,0.0029559962,0.009231163],"study_design_scores_gemma":[0.00014881999,0.000009058199,0.0013915168,0.000003897578,0.000007944274,0.0000037881684,0.000032850512,0.9751278,0.00023810819,0.0002659081,0.022700923,0.000069353984],"about_ca_topic_score_codex":0.00010883244,"about_ca_topic_score_gemma":0.000032378335,"teacher_disagreement_score":0.9822585,"about_ca_system_score_codex":0.0000124089975,"about_ca_system_score_gemma":0.000019339454,"threshold_uncertainty_score":0.14540014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029674765,0.00025950966,0.9682037,0.00014002161,0.00079665624,0.0004733261,0.00020627101,0.00020709459,0.00003865281],"genre_scores_gemma":[0.99791944,0.000018028146,0.0014331188,0.000055609118,0.0000765209,0.00025259508,0.0000337765,0.000012951318,0.0001979568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868935,0.00006644094,0.0002656341,0.00033690082,0.00022747174,0.000414172],"domain_scores_gemma":[0.99900603,0.00020662788,0.000096739066,0.00028881998,0.00018120262,0.00022059286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022630561,0.00021209389,0.00022882498,0.000119292105,0.00046249077,0.00015492002,0.0001843432,0.00008169535,9.829096e-7],"category_scores_gemma":[0.000007678362,0.00017755783,0.00008076721,0.00026444232,0.00004498308,0.00057027704,0.000003099751,0.0001400337,0.00000953882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071580784,0.0015636052,0.000888952,0.00040245245,0.0005372566,0.000022575512,0.0026644778,0.9631956,0.0022911143,0.00938927,0.00094091496,0.017387927],"study_design_scores_gemma":[0.002033973,0.000279519,0.00079952815,0.00019753243,0.000069950795,0.00014864551,0.0007501549,0.9942149,0.00014707896,0.000020985886,0.00091585534,0.00042190228],"about_ca_topic_score_codex":0.00014214678,"about_ca_topic_score_gemma":0.000013849627,"teacher_disagreement_score":0.9682447,"about_ca_system_score_codex":0.00006440564,"about_ca_system_score_gemma":0.0000321945,"threshold_uncertainty_score":0.7240598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017432977,0.000007699997,0.93849057,0.034168705,0.00009232468,0.00033824038,0.000002595811,0.00020270802,0.024953887],"genre_scores_gemma":[0.906666,6.6938816e-7,0.026059575,0.011184619,0.00009688362,0.00013342993,0.0000049161654,0.0000042493675,0.055849664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993209,0.000006491518,0.0000860861,0.00023462255,0.00021037277,0.00014149294],"domain_scores_gemma":[0.99928105,0.00007492541,0.000015627773,0.00040673095,0.00014950677,0.00007218242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017227777,0.000061348066,0.000060017974,0.00005833525,0.0001038184,0.00009164312,0.00042416053,0.000025434108,0.00000554768],"category_scores_gemma":[0.000044530003,0.000052459094,0.000054693166,0.00014246952,0.0000037881562,0.000087569344,0.000029025756,0.00005370136,0.00028322797],"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.0000054144293,0.00006046105,0.0000059599247,9.29023e-7,0.000002963569,5.311465e-7,0.00007487289,0.00043633766,0.00068934215,0.7765985,0.13076232,0.09136235],"study_design_scores_gemma":[0.00067048497,0.00077205535,0.0013813266,0.000016391316,0.000009984327,0.000009512114,0.00003654159,0.083546765,0.001419583,0.09112545,0.8205668,0.00044512862],"about_ca_topic_score_codex":0.0000108929235,"about_ca_topic_score_gemma":0.0000034213788,"teacher_disagreement_score":0.91243094,"about_ca_system_score_codex":0.000019414294,"about_ca_system_score_gemma":0.000014551263,"threshold_uncertainty_score":0.3640417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11385336,0.00036201952,0.8828313,0.002323786,0.00019254682,0.00020417849,0.0000041828453,0.00015298264,0.000075680626],"genre_scores_gemma":[0.9565566,0.000035225017,0.04069978,0.002415877,0.00004120289,0.000029697441,0.0000025137763,0.000005681547,0.00021343077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925405,0.000014395263,0.00014684546,0.00028013907,0.00012491911,0.00017964373],"domain_scores_gemma":[0.9994539,0.00014493936,0.00004562776,0.00018603598,0.00009010741,0.00007935841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107238484,0.00010208892,0.00011886413,0.00005138634,0.00012992765,0.00012936055,0.0002238345,0.00007486624,0.0000026433863],"category_scores_gemma":[0.00004977796,0.0000887264,0.000061999104,0.000072568146,0.000027745042,0.000346025,0.000073451425,0.00010446216,0.000011680619],"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.000028998984,0.000041768024,0.0002030966,0.000013428943,0.00002835413,0.000005565754,0.0012164947,0.00034271294,0.00050483696,0.90974736,0.00017991874,0.08768747],"study_design_scores_gemma":[0.009553707,0.0016697809,0.008878628,0.00067266496,0.00009084588,0.00015138778,0.009770909,0.4954027,0.0073213726,0.4586049,0.006054133,0.0018289725],"about_ca_topic_score_codex":0.00043535538,"about_ca_topic_score_gemma":0.00007208018,"teacher_disagreement_score":0.8427032,"about_ca_system_score_codex":0.00003639882,"about_ca_system_score_gemma":0.000045438934,"threshold_uncertainty_score":0.36181575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5440373,0.000023931107,0.45089552,0.001060112,0.0013040899,0.00014290496,0.0000017448599,0.00018397742,0.0023504428],"genre_scores_gemma":[0.9891573,0.000001963483,0.008905208,0.00024593776,0.00016484136,0.000020131281,0.0000090610365,0.000011142856,0.0014843745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987442,0.000032802116,0.00022757542,0.0003690915,0.00024154871,0.00038477735],"domain_scores_gemma":[0.9989079,0.00039701152,0.000054251785,0.00041757434,0.00012110598,0.000102133854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007018116,0.00013325707,0.00017951081,0.00011269193,0.00013286722,0.00023478406,0.0006472753,0.00010751384,0.000012020299],"category_scores_gemma":[0.0001218505,0.00011998979,0.000076449876,0.00025044187,0.000022625398,0.00039912958,0.0001619157,0.00036597755,0.000008320857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039427225,0.00033700187,0.018238844,0.000034857276,0.00003917865,0.000054686043,0.0010415472,0.0052861837,0.025317235,0.08042704,0.007330548,0.8618534],"study_design_scores_gemma":[0.0005649482,0.00002258314,0.005946917,0.000027104004,0.000004022656,0.000013175327,0.000069761,0.9915894,0.00045026478,0.00034726938,0.0007550459,0.00020947836],"about_ca_topic_score_codex":0.0008412191,"about_ca_topic_score_gemma":0.0041919467,"teacher_disagreement_score":0.98630327,"about_ca_system_score_codex":0.000027871365,"about_ca_system_score_gemma":0.000047134214,"threshold_uncertainty_score":0.48930416},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019324243,0.00011086886,0.9430381,0.0043655364,0.0004631274,0.00015531579,9.0756015e-7,0.00024418675,0.03229768],"genre_scores_gemma":[0.97624195,0.000051798164,0.0044874423,0.00096531754,0.00008295862,0.000012734907,4.801282e-7,0.000002747757,0.018154593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996053,0.000011553461,0.000064782245,0.00012417894,0.00008290195,0.000111293324],"domain_scores_gemma":[0.9994098,0.00019021388,0.000014764584,0.000338799,0.000021375614,0.000025073154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011096983,0.000041469408,0.00004469166,0.00002392615,0.00020604394,0.000037369595,0.00051206374,0.000009087358,0.000006203725],"category_scores_gemma":[0.0000068148797,0.0000243104,0.00005513277,0.00012244549,0.00002448725,0.000109710694,0.00009405052,0.000043477685,0.000022857253],"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.00001101107,0.000043735417,0.0014633205,0.0000020022114,0.000020270025,0.000010967031,0.00026024025,0.00003633681,0.00039232188,0.9103728,0.041683774,0.045703206],"study_design_scores_gemma":[0.0014772365,0.00024769543,0.03455871,0.000018108616,0.000019527895,0.000093653725,0.000115427014,0.63829064,0.00038447444,0.0064300243,0.31783757,0.00052689464],"about_ca_topic_score_codex":0.0003594354,"about_ca_topic_score_gemma":0.00028346278,"teacher_disagreement_score":0.9569177,"about_ca_system_score_codex":0.000009365201,"about_ca_system_score_gemma":0.000013029255,"threshold_uncertainty_score":0.15847443},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8308995,0.0003765908,0.16673219,0.0016424458,0.000109607696,0.00011307215,1.6692705e-7,0.000008364553,0.000118058466],"genre_scores_gemma":[0.99903536,0.0005559954,0.00009135831,0.00013236946,0.0000252465,0.000007974892,0.0000011246814,0.000002423956,0.00014812795],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.00008384412,0.00028451276,0.00007307456,0.00014499402,0.00051531097],"domain_scores_gemma":[0.99951047,0.000030344536,0.00020240076,0.00019562965,0.000033692013,0.000027442411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071913557,0.0000676339,0.00006971699,0.00011668007,0.00010671717,0.0000965636,0.0003440563,0.000029574794,0.0000053986564],"category_scores_gemma":[0.000029183097,0.000048094025,0.00004802017,0.00018882513,0.000019003457,0.0014537142,0.00004723597,0.00052564556,0.000053204018],"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.000008991209,0.00010489392,0.00874329,0.000006432671,0.00008322161,0.000013779755,0.0014667292,0.0010592265,0.001528897,0.21807028,0.0002784024,0.76863587],"study_design_scores_gemma":[0.0072386716,0.0016911454,0.05280533,0.00026635613,0.00012473545,0.026192326,0.048809256,0.29951492,0.0009247911,0.5562442,0.0046407585,0.0015475148],"about_ca_topic_score_codex":0.0013318817,"about_ca_topic_score_gemma":0.000610544,"teacher_disagreement_score":0.76708835,"about_ca_system_score_codex":0.0003036249,"about_ca_system_score_gemma":0.00022831456,"threshold_uncertainty_score":0.22836976},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54172534,0.000114422655,0.4524223,0.0028362232,0.00027518548,0.00021629341,0.0000023984876,0.00018271005,0.0022251343],"genre_scores_gemma":[0.9938385,0.0000055993314,0.0013141277,0.0011733942,0.00005792827,0.000021499374,7.061177e-7,0.0000037963714,0.003584484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994577,0.000042971722,0.0000936892,0.00018667163,0.00007085378,0.00014812646],"domain_scores_gemma":[0.9993817,0.00020189071,0.000019855235,0.00029462454,0.000061602106,0.000040312265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015865403,0.00007376289,0.000073504365,0.000023363074,0.0005678296,0.00007267712,0.00035994008,0.000020114861,0.0000058091546],"category_scores_gemma":[0.000032655644,0.000042843112,0.0000673357,0.000103423685,0.000038333066,0.00017613718,0.00006098752,0.00008166202,0.00002136101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007829595,0.0005401089,0.00016568601,0.00002548114,0.00022485478,0.0074353153,0.026670625,0.058088917,0.002112471,0.47559115,0.24545689,0.1836102],"study_design_scores_gemma":[0.00053534465,0.00015832687,0.000043667493,0.0000041715,0.0000070668707,0.006582254,0.00036840362,0.982707,0.00032451565,0.000119680444,0.008954095,0.00019542826],"about_ca_topic_score_codex":0.00014300202,"about_ca_topic_score_gemma":0.00011657915,"teacher_disagreement_score":0.9246181,"about_ca_system_score_codex":0.000013612454,"about_ca_system_score_gemma":0.000047000267,"threshold_uncertainty_score":0.43673438},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029746216,0.00024163623,0.96591204,0.00039544035,0.00059525,0.0001886075,7.468485e-7,0.00027100538,0.002649039],"genre_scores_gemma":[0.9624938,0.0000029461903,0.034845028,0.0003082474,0.00009133979,0.00003979427,0.0000010795399,0.0000068170307,0.0022109938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912107,0.000010023061,0.00016989218,0.0002738791,0.00017675693,0.0002483985],"domain_scores_gemma":[0.9994878,0.000045362212,0.000045864454,0.00027705065,0.000080316044,0.00006357623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002738233,0.00009843986,0.00013868063,0.000045833393,0.00006439592,0.00024802162,0.00045662312,0.000037336733,0.000001366795],"category_scores_gemma":[0.00003441336,0.00008374419,0.00010033582,0.00008813469,0.00000852229,0.00030987983,0.00012199697,0.00006549005,0.00004469837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027618382,0.00007302116,0.00078383624,0.000102091326,0.000095812815,0.000023675173,0.0010503718,0.009898376,0.006047759,0.9712456,0.006380708,0.004271132],"study_design_scores_gemma":[0.0021764732,0.00018127587,0.000084159044,0.00023543436,0.000010380432,0.000082361716,0.00022950424,0.9825074,0.0010521946,0.003768264,0.009247619,0.00042495245],"about_ca_topic_score_codex":0.00065321056,"about_ca_topic_score_gemma":0.00002504916,"teacher_disagreement_score":0.972609,"about_ca_system_score_codex":0.00014582211,"about_ca_system_score_gemma":0.00007274513,"threshold_uncertainty_score":0.34149888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87676257,0.00014253419,0.09868058,0.0012120423,0.00051291357,0.0001439563,0.0000017020016,0.00016004888,0.022383675],"genre_scores_gemma":[0.9859776,9.139787e-7,0.007775257,0.00069395796,0.00005114388,0.0000049005953,9.674659e-7,0.0000067717892,0.0054884856],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891496,0.000041937976,0.0002092821,0.0003244412,0.00020599437,0.00030336998],"domain_scores_gemma":[0.99941677,0.000037446058,0.00003202449,0.00038280216,0.000068958325,0.00006198807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022310136,0.00011327132,0.00014782294,0.0001337919,0.00007626965,0.00019276088,0.0004163651,0.000040403756,0.000026177548],"category_scores_gemma":[0.000027734959,0.00010137435,0.00004787616,0.00036603442,0.000020719257,0.0003945562,0.00019650621,0.00009665212,0.000051005947],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011494289,0.00073825126,0.045281887,0.000031620286,0.00005117858,0.00041332335,0.0023444896,0.02077533,0.5404531,0.3279479,0.052215032,0.009632931],"study_design_scores_gemma":[0.0075522754,0.0007206395,0.1288795,0.00071979786,0.000055914275,0.0004518401,0.0046986295,0.5087699,0.2859267,0.015602233,0.04164174,0.0049808184],"about_ca_topic_score_codex":0.008483146,"about_ca_topic_score_gemma":0.00072178786,"teacher_disagreement_score":0.48799458,"about_ca_system_score_codex":0.0000761177,"about_ca_system_score_gemma":0.000044590797,"threshold_uncertainty_score":0.9981195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36121893,0.00006925762,0.6371108,0.00073808467,0.00017309214,0.000166451,0.000005263888,0.000056727946,0.00046133786],"genre_scores_gemma":[0.9969032,0.0000024324759,0.0029046834,0.00007686814,0.000021231122,0.000015822487,0.00001848729,0.0000019120328,0.0000554085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992894,0.000029901998,0.00012044727,0.0001398211,0.0003325141,0.00008794851],"domain_scores_gemma":[0.9993467,0.000022104265,0.000047265756,0.00021037417,0.0003513204,0.000022261998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088305556,0.000046722565,0.00006051152,0.000023257768,0.000042095286,0.000030327237,0.00018754853,0.000025992393,0.0000037577097],"category_scores_gemma":[0.000091331065,0.000040923005,0.000054926957,0.00009191808,0.000012850604,0.0002837887,0.000040209296,0.000024578809,0.0000057671264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003774361,0.00029665985,0.0006653713,0.000055677614,0.00009457368,9.66818e-7,0.0002986143,0.006973235,0.02505152,0.78689826,0.0030017667,0.17662562],"study_design_scores_gemma":[0.004200664,0.0002690772,0.0029990396,0.000089493326,0.00009893451,0.000006679241,0.0000680289,0.9273769,0.027030323,0.034879457,0.0026990608,0.00028229412],"about_ca_topic_score_codex":0.000074626,"about_ca_topic_score_gemma":0.000035140114,"teacher_disagreement_score":0.9204037,"about_ca_system_score_codex":0.000101558515,"about_ca_system_score_gemma":0.00012517019,"threshold_uncertainty_score":0.16687918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13332939,0.000033438973,0.8553571,0.0014892457,0.0006467002,0.006465125,0.00029861435,0.00056436576,0.0018159891],"genre_scores_gemma":[0.96161896,0.0000139228705,0.035060562,0.0009818194,0.00043937238,0.0008286003,0.000033514276,0.000103847204,0.0009193785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99468213,0.000028437773,0.0014447833,0.0014205752,0.0014032917,0.0010207812],"domain_scores_gemma":[0.9948152,0.000578097,0.0012207817,0.00042161046,0.0025800606,0.000384252],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016416102,0.0007526296,0.00087615417,0.00047030745,0.0013763573,0.00037246363,0.00170076,0.00040294958,0.000015155652],"category_scores_gemma":[0.00015525678,0.0006872957,0.0005084201,0.0016693665,0.00014994189,0.0022956748,0.000797,0.0004223211,0.00001566432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051386084,0.0003355854,0.0014492853,0.000083736864,0.000060134542,4.0920682e-7,0.0055286204,0.86640483,0.123157606,0.001493866,0.00088041235,0.00009165927],"study_design_scores_gemma":[0.0034755538,0.0012537093,0.00028014113,0.00022392765,0.00011161567,0.000017229042,0.00092917646,0.9567969,0.023379277,0.00014692094,0.012437767,0.0009477887],"about_ca_topic_score_codex":0.0000137612415,"about_ca_topic_score_gemma":7.9553575e-7,"teacher_disagreement_score":0.82828957,"about_ca_system_score_codex":0.0004120708,"about_ca_system_score_gemma":0.00019807473,"threshold_uncertainty_score":0.9999237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06615544,0.00012531085,0.9304099,0.00041390397,0.000223795,0.00020173786,0.000001154674,0.00022954115,0.0022392338],"genre_scores_gemma":[0.6360436,0.00000977225,0.36312467,0.00039759334,0.000023204737,0.000022951752,7.9230426e-7,0.0000065819754,0.0003708428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892986,0.00001954865,0.00021256697,0.0004467137,0.00011411332,0.00027718124],"domain_scores_gemma":[0.99923974,0.00008205173,0.00007195,0.0004645853,0.000054472795,0.00008719189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046471154,0.00011256739,0.00013897556,0.00005285184,0.00019112458,0.00015466874,0.00028034954,0.000060358747,0.000015038803],"category_scores_gemma":[0.000118293734,0.00009949972,0.000054967142,0.000097376425,0.000020084584,0.00025003517,0.0002540677,0.00013474542,0.00001426594],"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.00005432491,0.00017718166,0.0012833606,0.0000731629,0.00006952643,0.000013837894,0.0027239546,0.00012984585,0.004884478,0.955731,0.0002791008,0.034580275],"study_design_scores_gemma":[0.0003746324,0.000193981,0.000624847,0.00020289399,0.00001283582,0.000017760662,0.00025423986,0.9699402,0.00132115,0.026627379,0.00014231123,0.00028776305],"about_ca_topic_score_codex":0.00012777066,"about_ca_topic_score_gemma":0.000010630344,"teacher_disagreement_score":0.96981037,"about_ca_system_score_codex":0.0000396377,"about_ca_system_score_gemma":0.000026436826,"threshold_uncertainty_score":0.40574807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047776893,0.000059571925,0.7170105,0.001060045,0.00018614419,0.000016895796,9.3184966e-8,0.0002941796,0.2335957],"genre_scores_gemma":[0.98361987,5.008942e-7,0.0035795348,0.00037346795,0.00004045807,7.226976e-7,2.3800048e-7,9.1461993e-7,0.012384302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975,0.0000052289065,0.000038457343,0.000081054066,0.00005888963,0.00006632271],"domain_scores_gemma":[0.9998117,0.000009572208,0.000006155694,0.00015105653,0.000010277077,0.000011212611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034951678,0.000023776796,0.000023544084,0.000017652112,0.000026786282,0.00005255711,0.0001888289,0.000008176884,0.000012846275],"category_scores_gemma":[0.0000013480251,0.000019119676,0.000019686113,0.00005805028,0.0000039077227,0.00010579547,0.000042641528,0.000019928848,0.00017690008],"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":[3.7206277e-7,0.000022933415,0.0012319131,6.5368033e-7,0.0000014243145,0.000009418855,0.000009845159,0.00005483731,0.0026588393,0.9408819,0.036688842,0.018439012],"study_design_scores_gemma":[0.0011597004,0.00013483866,0.05476247,0.000017757633,0.0000072606217,0.00011043872,0.00002996035,0.55757916,0.011723579,0.12871599,0.24486896,0.0008899007],"about_ca_topic_score_codex":0.00034940077,"about_ca_topic_score_gemma":0.000016835216,"teacher_disagreement_score":0.935843,"about_ca_system_score_codex":0.0000044192825,"about_ca_system_score_gemma":0.000005410891,"threshold_uncertainty_score":0.22737515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7203128,0.0000697451,0.20002441,0.0000633391,0.0001609621,0.00006489717,3.9912462e-7,0.00017808759,0.07912539],"genre_scores_gemma":[0.98720104,0.0000135826385,0.012292194,0.0000797853,0.000010569866,0.0000032043524,2.0755486e-7,0.0000028979025,0.0003965199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993666,0.000047260935,0.00016236091,0.00015079841,0.00015676927,0.00011621332],"domain_scores_gemma":[0.99956256,0.00004036572,0.00006842099,0.00024768297,0.000052460433,0.00002849319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021510551,0.00006892534,0.00012405778,0.00007156954,0.000058022437,0.000028772653,0.00036057044,0.000021624051,0.000008422616],"category_scores_gemma":[0.000019141238,0.000057667934,0.00003891666,0.00012149129,0.000019903917,0.000267758,0.000061431696,0.00009689484,0.000009457211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017113243,0.00046754468,0.15895304,0.00006993711,0.00007824691,0.000008337529,0.0030362236,0.0017038707,0.087520786,0.40502292,0.0030596869,0.34006232],"study_design_scores_gemma":[0.00019926854,0.00018659,0.00053993444,0.000052922634,0.000004455967,0.0000114137565,0.00010357551,0.68131495,0.313678,0.000411244,0.0032960384,0.00020157977],"about_ca_topic_score_codex":0.00007166243,"about_ca_topic_score_gemma":0.000006754372,"teacher_disagreement_score":0.6796111,"about_ca_system_score_codex":0.000017494795,"about_ca_system_score_gemma":0.000028172015,"threshold_uncertainty_score":0.23516302},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6173057,0.000220641,0.34744167,0.00022994605,0.0006064239,0.00011912846,0.0000061191167,0.00076832157,0.033302076],"genre_scores_gemma":[0.9803049,0.000009233614,0.017939152,0.00066023547,0.00006307907,0.0000023057348,0.0000064968003,0.000007728984,0.0010068729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.000027924458,0.00013809807,0.00045127238,0.00020644868,0.00023860225],"domain_scores_gemma":[0.9982097,0.000027314198,0.000047847,0.0015839038,0.000045600267,0.00008563904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025140846,0.00011575546,0.00012154095,0.000048953203,0.000093097944,0.00012218846,0.0022784325,0.000030805815,0.000051810264],"category_scores_gemma":[0.0000024071478,0.00008247784,0.000020807007,0.00019895841,0.00002045687,0.00093083666,0.00086706027,0.000096635675,0.00017483158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005141056,0.0017551284,0.10171238,0.0007220547,0.0010485857,0.0014025997,0.04342743,0.000110207184,0.035424195,0.5016598,0.008334929,0.3038886],"study_design_scores_gemma":[0.005651914,0.0024394079,0.05852155,0.00092509686,0.00023680666,0.0010509443,0.0058542974,0.84438926,0.035741013,0.018474024,0.021290204,0.005425475],"about_ca_topic_score_codex":0.0010855349,"about_ca_topic_score_gemma":0.00049555354,"teacher_disagreement_score":0.84427905,"about_ca_system_score_codex":0.000010188646,"about_ca_system_score_gemma":0.000034599358,"threshold_uncertainty_score":0.42339325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042600896,0.00024146908,0.9374171,0.003948412,0.0003202293,0.00005109604,0.0000064292663,0.00049999944,0.014914376],"genre_scores_gemma":[0.9976896,0.000019004176,0.0006762137,0.0004914381,0.000022739045,0.0000027258573,0.000002276511,0.000002821006,0.0010931798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993606,0.000025620102,0.000106802174,0.00019150399,0.00014503351,0.00017042899],"domain_scores_gemma":[0.99958974,0.000028173452,0.000016651027,0.00028241504,0.000016661088,0.00006633212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006940898,0.000071390146,0.000075369375,0.0000340634,0.00009085937,0.00010068397,0.0004090555,0.000021428274,0.00010479947],"category_scores_gemma":[0.0000072625194,0.00005960849,0.00005870793,0.0001343414,0.000009125078,0.0002160982,0.00004433181,0.00008615941,0.0001683475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013718681,0.001120532,0.01071247,0.00004496391,0.00017936775,0.00038603586,0.0030284268,0.011128843,0.02639573,0.28019404,0.21093069,0.45586517],"study_design_scores_gemma":[0.00027119703,0.000028220253,0.00055804034,0.000009286684,0.0000035425082,0.00001761292,0.000014104803,0.98340195,0.00021691459,0.00017336955,0.01515198,0.00015378703],"about_ca_topic_score_codex":0.000055313987,"about_ca_topic_score_gemma":0.00001930748,"teacher_disagreement_score":0.9722731,"about_ca_system_score_codex":0.00002005224,"about_ca_system_score_gemma":0.000004963416,"threshold_uncertainty_score":0.24307637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14661159,0.0000608345,0.7932308,0.0005773253,0.00015247581,0.00024588857,0.0000026392995,0.00039304487,0.05872545],"genre_scores_gemma":[0.85608757,4.2652835e-7,0.1398635,0.00039220214,0.00010684985,0.000033820063,0.000009328831,0.0000049387386,0.0035013857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989438,0.000040954084,0.00013727088,0.0003771867,0.000262972,0.00023780603],"domain_scores_gemma":[0.9993883,0.000011580114,0.000020547819,0.00043703042,0.000046797177,0.000095782474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016798658,0.00010314496,0.00008348091,0.00008230614,0.000114617396,0.000120547666,0.0005522308,0.00003272709,0.000010137974],"category_scores_gemma":[0.0000030746198,0.00008872237,0.00004192604,0.00019075208,0.000012789395,0.00031838246,0.00014636389,0.00007400561,0.000089920664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007121572,0.0028273144,0.0050743385,0.000022712642,0.000043628857,0.000029220202,0.0009646015,0.41523588,0.022951359,0.36803114,0.17867604,0.006072552],"study_design_scores_gemma":[0.0002230839,0.00012691152,0.0016268749,0.000003540584,0.0000029011821,0.00001945465,0.00009091098,0.9937493,0.00017716725,0.00014382048,0.003654679,0.00018135727],"about_ca_topic_score_codex":0.0003330496,"about_ca_topic_score_gemma":0.0000053380045,"teacher_disagreement_score":0.70947593,"about_ca_system_score_codex":0.00006561822,"about_ca_system_score_gemma":0.00006443558,"threshold_uncertainty_score":0.36179933},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012084469,0.0000734485,0.9829168,0.0002194397,0.0014253374,0.00034568305,0.00003903153,0.000505158,0.0023906354],"genre_scores_gemma":[0.994156,0.000007968093,0.0031263074,0.00018259912,0.00019903493,0.00003197351,0.0000437512,0.000009823909,0.0022425593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867684,0.000026943699,0.00027886874,0.00036496145,0.00025746983,0.00039491846],"domain_scores_gemma":[0.99909073,0.00015573355,0.00007401602,0.00037116787,0.00017885807,0.00012948981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008615985,0.00013715486,0.00017070548,0.00010241638,0.00021306604,0.00025433596,0.00039184786,0.000088413064,0.000004483215],"category_scores_gemma":[0.00005104975,0.000114203234,0.00009358978,0.00023823828,0.000011639238,0.00031791153,0.00008275353,0.00008945564,0.000015257124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013894847,0.00021933891,0.0035923983,0.00010954365,0.00012151125,0.000029892906,0.00022188407,0.00060905976,0.009559747,0.9507221,0.024155669,0.010519934],"study_design_scores_gemma":[0.0017737419,0.00030724335,0.0010706594,0.00008199103,0.000029145202,0.00007044001,0.000117883996,0.97189367,0.0030853695,0.005666531,0.015549387,0.00035394912],"about_ca_topic_score_codex":0.00021618823,"about_ca_topic_score_gemma":0.000029272018,"teacher_disagreement_score":0.9820715,"about_ca_system_score_codex":0.0000783647,"about_ca_system_score_gemma":0.000034503246,"threshold_uncertainty_score":0.46570727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0829088,0.000021394324,0.91453516,0.0010525628,0.00038533588,0.00012173883,0.0000011322725,0.0003237765,0.0006500894],"genre_scores_gemma":[0.977037,0.000007853865,0.020694707,0.0010732823,0.00013151413,0.00001782489,0.000002522284,0.000005279949,0.0010299946],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994394,0.000012684793,0.00009244269,0.00019973824,0.00010118378,0.0001545431],"domain_scores_gemma":[0.9996506,0.00006500455,0.000018548435,0.00012629498,0.00009329333,0.00004626881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007429115,0.00006746687,0.000072278024,0.00004737182,0.0001897525,0.000032548814,0.00024176145,0.00003282381,0.000009401837],"category_scores_gemma":[0.000007345463,0.0000615683,0.00005651382,0.0001911776,0.000005740857,0.00028498605,0.000018773157,0.000054661457,0.00003071249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000293661,0.0010600896,0.021358231,0.0004480824,0.00036482434,0.000068342844,0.030083815,0.0074761743,0.3787768,0.03697369,0.112140134,0.41095614],"study_design_scores_gemma":[0.00043810406,0.00004475016,0.000704916,0.000008183526,0.000003784351,0.000044348013,0.000032592034,0.9920741,0.0041559874,0.000060999442,0.0023060788,0.00012619265],"about_ca_topic_score_codex":0.00024037054,"about_ca_topic_score_gemma":0.000120597266,"teacher_disagreement_score":0.98459786,"about_ca_system_score_codex":0.00001895712,"about_ca_system_score_gemma":0.000029917468,"threshold_uncertainty_score":0.25106826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98362577,0.000070729264,0.009487015,0.0019918163,0.00043719134,0.00016331256,0.000014388528,0.000059208538,0.0041505885],"genre_scores_gemma":[0.9977362,0.00013472207,0.0005986104,0.0011775388,0.000049791965,0.000052301973,0.000048659884,0.0000062820873,0.00019589881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876934,0.000036413156,0.0002112336,0.00039351112,0.00042210065,0.00016739743],"domain_scores_gemma":[0.99947274,0.000028949495,0.00009747307,0.00027621654,0.00007133876,0.000053287327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119380704,0.00014343022,0.00011465448,0.00016965572,0.000054984546,0.00022236993,0.0010455931,0.000037998845,0.00008965989],"category_scores_gemma":[0.000010082838,0.00014071814,0.000052231488,0.000077385754,0.000024364013,0.0007654824,0.00019260545,0.0001569693,0.00029332965],"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.00014291609,0.0015084747,0.01654119,0.00007132751,0.00020581996,0.00036847603,0.005903489,0.02257498,0.119330324,0.7723065,0.00007199386,0.06097452],"study_design_scores_gemma":[0.014133307,0.0019372158,0.077122696,0.0028172988,0.000051753443,0.000245594,0.00579875,0.3501209,0.29614285,0.21138771,0.036442235,0.0037997009],"about_ca_topic_score_codex":0.00045498044,"about_ca_topic_score_gemma":0.00015426971,"teacher_disagreement_score":0.5609188,"about_ca_system_score_codex":0.00016054367,"about_ca_system_score_gemma":0.00006062134,"threshold_uncertainty_score":0.5738319},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7924537,0.00024012431,0.20198447,0.0002061588,0.00015392592,0.00020869575,6.762897e-7,0.00012913151,0.0046231095],"genre_scores_gemma":[0.99858963,0.0000028463699,0.0010831045,0.00009488692,0.000024873305,0.0000065101754,7.5379376e-7,0.0000034928155,0.00019386974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989592,0.00012322393,0.0001635831,0.00018177446,0.00046423604,0.00010797042],"domain_scores_gemma":[0.9993681,0.000085838474,0.000060353897,0.00028700096,0.00016751389,0.000031237825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048247294,0.00006264336,0.00007768418,0.00009255767,0.00005783083,0.0000456276,0.00022409865,0.000026634718,0.00006104028],"category_scores_gemma":[0.000085269596,0.000055708464,0.00005207698,0.00014700888,0.000010201695,0.00026469879,0.0000596453,0.00005331044,0.000027777876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022055456,0.00007168125,0.0006210466,0.0000056767976,0.000014862288,0.0000017702931,0.00049763813,0.8841156,0.0035087133,0.0013257676,0.00005279822,0.109782256],"study_design_scores_gemma":[0.00026919285,0.000040628882,0.00009845059,0.000009414427,0.000009222262,0.0000037200218,0.0000044240405,0.99843127,0.00047327898,0.0005282999,0.000066067056,0.000066044435],"about_ca_topic_score_codex":0.000048871374,"about_ca_topic_score_gemma":0.000008902063,"teacher_disagreement_score":0.20613596,"about_ca_system_score_codex":0.00003778659,"about_ca_system_score_gemma":0.000018922723,"threshold_uncertainty_score":0.22717252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776694,0.00010830963,0.71893156,0.00059726916,0.0014042765,0.00018506013,0.00069258414,0.00026063112,0.00015095023],"genre_scores_gemma":[0.99652064,0.000015676613,0.0007093776,0.00010313669,0.000075322896,0.00004203374,0.000097686905,0.000013343776,0.0024227712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981356,0.000088587294,0.00037278904,0.00054038345,0.00043353977,0.00042907312],"domain_scores_gemma":[0.99875164,0.000118064345,0.000115078714,0.0005652692,0.0001796104,0.00027034743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032185335,0.00025055194,0.00030329343,0.00011144082,0.0006774619,0.0002547004,0.00037815617,0.00016776418,0.0000118670305],"category_scores_gemma":[0.000011273024,0.0002241096,0.00017996073,0.000291509,0.000052179934,0.00023501612,0.00001135606,0.00045535652,0.000043704422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014648032,0.01509639,0.011812755,0.0012965796,0.0021026526,0.0008949707,0.009846733,0.6062235,0.25403246,0.00699133,0.034966618,0.055271193],"study_design_scores_gemma":[0.0023027824,0.00021531768,0.002921188,0.00013577567,0.00008206303,0.0006009526,0.00089935184,0.98291594,0.00019668975,0.000018324798,0.0090728095,0.0006388268],"about_ca_topic_score_codex":0.00027892875,"about_ca_topic_score_gemma":0.0005631948,"teacher_disagreement_score":0.71885127,"about_ca_system_score_codex":0.00007594431,"about_ca_system_score_gemma":0.000041042505,"threshold_uncertainty_score":0.9138924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.915056,0.00034492655,0.08174004,0.0003386632,0.0011382607,0.00014126577,0.000006157535,0.00006182645,0.0011728547],"genre_scores_gemma":[0.99950945,0.000021456364,0.0002569577,0.000036602058,0.00006808759,0.000007644825,0.0000029546131,0.0000040513714,0.00009280923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890715,0.000077994824,0.00030414874,0.00020422605,0.00017391691,0.0003325835],"domain_scores_gemma":[0.9991737,0.00027267414,0.00007790673,0.0003982824,0.00003746891,0.000039939663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011580177,0.00008626366,0.00015864057,0.000052122403,0.00012374546,0.00013177324,0.0006309338,0.000057216424,0.000001034958],"category_scores_gemma":[0.00004207041,0.0000615052,0.000040913714,0.0003887265,0.000017879696,0.00018093614,0.00016462548,0.00033075945,0.0000033505482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029400879,0.00019854262,0.30179867,0.000041339856,0.000022635923,0.00002155923,0.001810211,0.1740664,0.0030063584,0.5045882,0.0012037974,0.013212901],"study_design_scores_gemma":[0.00044072716,0.000018585608,0.061308187,0.00011466247,0.000001949929,0.000008893935,0.00020297858,0.93676686,0.000083341125,0.0002375458,0.00067878986,0.00013745832],"about_ca_topic_score_codex":0.00094367744,"about_ca_topic_score_gemma":0.010182771,"teacher_disagreement_score":0.7627005,"about_ca_system_score_codex":0.000023319359,"about_ca_system_score_gemma":0.00002287584,"threshold_uncertainty_score":0.5682225},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13122182,0.00013919639,0.8626302,0.0002425415,0.0037799398,0.00038385487,0.00009285562,0.00051874603,0.0009908816],"genre_scores_gemma":[0.9944519,0.000035767458,0.0007241823,0.00041414914,0.0001858436,0.00011629389,0.000012763817,0.000035273213,0.0040238653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970499,0.00025511693,0.0006462745,0.000744593,0.0007498451,0.0005542189],"domain_scores_gemma":[0.9983049,0.00016755787,0.00019432657,0.0008783988,0.00027355782,0.00018126413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042080536,0.00040089226,0.00041378775,0.00041720865,0.0008398446,0.00037317284,0.0006872083,0.00022434567,0.000056574703],"category_scores_gemma":[0.000011982629,0.00035477162,0.00035903425,0.0005999559,0.0000776664,0.0008007377,0.000006998469,0.0007557851,0.00032507494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011858322,0.009659397,0.0012744981,0.0009204893,0.0018128575,0.0013329749,0.07544699,0.50933653,0.21788931,0.0073368107,0.041214217,0.13259012],"study_design_scores_gemma":[0.0032699227,0.00069196615,0.00040419065,0.0013399103,0.000094375835,0.0016527486,0.0022931686,0.9457469,0.03005444,0.00009211384,0.012518604,0.0018416751],"about_ca_topic_score_codex":0.0003239395,"about_ca_topic_score_gemma":0.00028787283,"teacher_disagreement_score":0.86323005,"about_ca_system_score_codex":0.00016780001,"about_ca_system_score_gemma":0.00012226489,"threshold_uncertainty_score":0.99989045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90075445,0.00025172989,0.09502307,0.0007834657,0.00037851572,0.00024088245,0.0000096285,0.00010479239,0.0024534836],"genre_scores_gemma":[0.99522793,0.0005595669,0.0037967076,0.0001927978,0.000045583987,0.000013124815,0.000030357542,0.000010305953,0.00012363597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984932,0.00015389832,0.00048307452,0.0003353181,0.0003336206,0.00020087922],"domain_scores_gemma":[0.99812186,0.00014570895,0.00039021065,0.00088293874,0.00039115088,0.000068151814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036015135,0.0002007863,0.00023407774,0.0002696582,0.00033411462,0.00016817363,0.0015304113,0.000073108924,0.000007769881],"category_scores_gemma":[0.000025354699,0.0001942675,0.000078037214,0.00016665524,0.00014866213,0.00048079755,0.0003216688,0.00034805932,0.000014319651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001655185,0.001268357,0.018464554,0.0000914195,0.00039234,0.0000022702886,0.002996428,0.0068382462,0.09074304,0.1819621,0.00013848333,0.69693726],"study_design_scores_gemma":[0.00058152975,0.000094864474,0.031033479,0.0002577377,0.000014330876,0.00001614628,0.0001058072,0.9668075,0.00059569656,0.0001497435,0.00014728039,0.0001958724],"about_ca_topic_score_codex":0.000121320845,"about_ca_topic_score_gemma":0.000035852085,"teacher_disagreement_score":0.9599693,"about_ca_system_score_codex":0.00017571874,"about_ca_system_score_gemma":0.00007601952,"threshold_uncertainty_score":0.79219985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8652795,0.00033935288,0.088134326,0.00077920774,0.001959327,0.0003410994,0.000001981667,0.00029793364,0.042867254],"genre_scores_gemma":[0.99518514,0.00002629869,0.0014982208,0.0012193939,0.00005258553,0.00001075646,0.0000013290023,0.0000040607156,0.0020022013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991458,0.000043643046,0.00016069578,0.00028309482,0.00014654415,0.0002202052],"domain_scores_gemma":[0.99953884,0.000015558082,0.000043000135,0.0002931198,0.00004374166,0.00006574419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011759634,0.000103882245,0.00011364375,0.00013822736,0.000019765266,0.00004451748,0.0005888396,0.000041831274,0.00009943828],"category_scores_gemma":[0.0000065357435,0.0000836974,0.000055935387,0.00021699666,0.000014069543,0.00035404338,0.00023757106,0.00013935917,0.000112383656],"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.00024045071,0.0017335588,0.07220626,0.00003598936,0.00018587527,0.0004441006,0.048481572,0.000004781005,0.0038403233,0.49471992,0.0188018,0.35930535],"study_design_scores_gemma":[0.012757234,0.0018575429,0.70579547,0.00040560303,0.00006249631,0.0001284273,0.03301483,0.13009252,0.070706934,0.011719439,0.029951086,0.003508404],"about_ca_topic_score_codex":0.0016429506,"about_ca_topic_score_gemma":0.0003134159,"teacher_disagreement_score":0.6335892,"about_ca_system_score_codex":0.000068623805,"about_ca_system_score_gemma":0.000023521543,"threshold_uncertainty_score":0.3413081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016295175,0.000026177526,0.9894612,0.0039023617,0.0041026752,0.000516608,0.00008186113,0.00025997366,0.000019616493],"genre_scores_gemma":[0.97501045,0.00001532616,0.022333493,0.002304513,0.00017990918,0.000051321887,0.000021105025,0.0000145812655,0.00006929172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877816,0.00006293566,0.00021309977,0.00046835258,0.00023326799,0.00024415113],"domain_scores_gemma":[0.9980844,0.00065299845,0.0000679933,0.0009991074,0.0001173466,0.000078132645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017169083,0.00017141704,0.00014155392,0.00008970485,0.0005096542,0.0004042067,0.0016370295,0.00006738907,0.000010607268],"category_scores_gemma":[0.0000032465398,0.0001305131,0.000106722764,0.00022943808,0.00004997147,0.00065454503,0.000017760281,0.00027980297,0.000043594446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012042377,0.00007322528,0.0000054049924,0.00001433937,0.00010202921,0.0000016162659,0.00025246202,0.41339293,0.00010575017,0.0003040746,0.047565363,0.53817075],"study_design_scores_gemma":[0.0003954501,0.00007555225,0.00017884666,0.000020044494,0.000021924132,0.000013774113,0.000041994554,0.9955054,0.00009919135,0.0005834851,0.0029028135,0.00016153019],"about_ca_topic_score_codex":0.00012087129,"about_ca_topic_score_gemma":0.000024277557,"teacher_disagreement_score":0.9733809,"about_ca_system_score_codex":0.000043271968,"about_ca_system_score_gemma":0.00005043646,"threshold_uncertainty_score":0.532217},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33004814,0.00019878248,0.66801417,0.0004048482,0.00012580105,0.000039975337,0.000004686511,0.0001669455,0.0009966482],"genre_scores_gemma":[0.99641466,0.000008958565,0.0022667213,0.00026887914,0.000035369292,0.0000010318446,0.0000050441067,0.0000022620065,0.0009970556],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99943745,0.00001022423,0.0000997753,0.00017639487,0.00010048021,0.00017566475],"domain_scores_gemma":[0.9993477,0.0003403196,0.000021348342,0.00018859013,0.000033830773,0.000068223206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020434854,0.00006448289,0.00007411932,0.000036771144,0.000108879205,0.00013950851,0.00020680088,0.00002650836,0.000005932321],"category_scores_gemma":[0.00012923266,0.000052943073,0.000021472259,0.0001321253,0.000028571038,0.0002626341,0.00012579169,0.000054206284,0.000009222531],"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.00006372689,0.00028594598,0.6154666,0.000043075044,0.000086675645,0.00009683217,0.0009028064,0.00011887342,0.029809622,0.099082075,0.028725676,0.22531809],"study_design_scores_gemma":[0.0030600643,0.0002006108,0.60410917,0.00005122106,0.000019766567,0.000081719656,0.0004606237,0.20676893,0.011212778,0.0020252361,0.17113146,0.00087844394],"about_ca_topic_score_codex":0.0005907895,"about_ca_topic_score_gemma":0.00042546264,"teacher_disagreement_score":0.6663665,"about_ca_system_score_codex":0.000010614017,"about_ca_system_score_gemma":0.000010543879,"threshold_uncertainty_score":0.21589558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060868994,0.0020095154,0.98926824,0.00055974413,0.0008179388,0.00023755626,0.0000013783985,0.00005367142,0.0009650617],"genre_scores_gemma":[0.9898838,0.000024106153,0.008379799,0.0006884876,0.000314518,0.000040755185,7.94285e-7,0.0000046426967,0.0006631327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994342,0.000040826857,0.00011377167,0.00015405321,0.000118920725,0.00013827957],"domain_scores_gemma":[0.99906313,0.00034834733,0.000047439295,0.00034772625,0.00014170974,0.00005164012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032440067,0.00007431141,0.00010227862,0.00001712474,0.000103309816,0.000074312455,0.00053155277,0.0000540892,0.0000032849473],"category_scores_gemma":[0.000022648068,0.000043077933,0.00006448009,0.00014073981,0.00002056553,0.00013357164,0.0001196381,0.00015654699,0.0000032713176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006077585,0.00015381878,0.00038336718,0.000016182992,0.00006572131,0.0000035244939,0.0060209604,0.7278027,0.00023404603,0.16946083,0.04342102,0.05237707],"study_design_scores_gemma":[0.00026039843,0.00018684512,0.00002222462,0.0000131742345,0.0000087123,0.0000024955175,0.0011970174,0.98786193,0.00025777836,0.00093544147,0.009153915,0.00010006848],"about_ca_topic_score_codex":0.00006493253,"about_ca_topic_score_gemma":0.000017165465,"teacher_disagreement_score":0.98379683,"about_ca_system_score_codex":0.00001312772,"about_ca_system_score_gemma":0.00004908021,"threshold_uncertainty_score":0.17566672},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56450546,0.00011601423,0.4311138,0.0029213205,0.0000699524,0.0009752658,0.000003842648,0.00012978894,0.00016452376],"genre_scores_gemma":[0.97152436,0.00007179877,0.02690539,0.0006021619,0.000036678037,0.00049678696,0.00006267537,0.000018578326,0.0002815958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.000083950654,0.00039408758,0.00051315496,0.00022700774,0.0003359187],"domain_scores_gemma":[0.99653864,0.00028920636,0.00016802776,0.0021678652,0.0007063529,0.00012990009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103429,0.00019197754,0.00027049246,0.0001329465,0.00039888066,0.00034177466,0.001375062,0.00008442083,0.0000028933955],"category_scores_gemma":[0.000039471262,0.00017143111,0.00005050317,0.00034318434,0.00008790044,0.0002689774,0.0008368274,0.00029053935,0.000003834614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018147868,0.00016663992,0.01473588,0.0000364949,0.000048322512,0.0000011970893,0.0023024797,0.0025454005,0.001983463,0.043692634,0.0029080885,0.93156123],"study_design_scores_gemma":[0.0006216407,0.00017415672,0.007736496,0.00012538681,0.000008645801,0.00002048727,0.0005588203,0.98025703,0.000118423966,0.0001089023,0.0099825505,0.00028744875],"about_ca_topic_score_codex":0.0003648405,"about_ca_topic_score_gemma":0.000067652836,"teacher_disagreement_score":0.9777116,"about_ca_system_score_codex":0.00006143521,"about_ca_system_score_gemma":0.000058766662,"threshold_uncertainty_score":0.6990758},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11219031,0.0011093568,0.8844009,0.0006968156,0.0008079867,0.00034156776,0.000054393357,0.00035840494,0.000040275358],"genre_scores_gemma":[0.9962323,0.00012735979,0.003038407,0.00007565238,0.000030586296,0.00015163308,0.0000078059065,0.000012076266,0.00032421385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865836,0.000061511724,0.00031649775,0.00050818396,0.0001371101,0.00031834174],"domain_scores_gemma":[0.99885297,0.00022683413,0.000079283695,0.00061743136,0.00015222722,0.00007123706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022332948,0.00017331187,0.0002638727,0.00032350203,0.00031341374,0.00007141108,0.0006473931,0.0002587567,0.000018126435],"category_scores_gemma":[0.00001737237,0.00015837725,0.0000780428,0.00026371027,0.0001397494,0.00018894952,0.000028100452,0.0002459063,0.000017902743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022466955,0.0010320068,0.0071717687,0.00018456997,0.00070668204,0.000080135935,0.021158405,0.00082505215,0.0043926304,0.16190104,0.0005855259,0.8017375],"study_design_scores_gemma":[0.005288169,0.007232941,0.00087353395,0.0025602893,0.0004130676,0.0007417021,0.1622136,0.4313151,0.32249087,0.036312778,0.026966402,0.0035915382],"about_ca_topic_score_codex":0.001738773,"about_ca_topic_score_gemma":0.00023142382,"teacher_disagreement_score":0.88404197,"about_ca_system_score_codex":0.00004717635,"about_ca_system_score_gemma":0.00004507809,"threshold_uncertainty_score":0.6458437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13181101,0.00008055791,0.86562425,0.00027296835,0.00014697114,0.00002984654,0.0000040525556,0.000053736258,0.0019765948],"genre_scores_gemma":[0.97988945,0.000017178172,0.01914178,0.00028855642,0.000061643594,5.120894e-7,8.2306525e-7,0.0000017113705,0.00059837196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996347,0.00001608049,0.00008246665,0.000088488254,0.00009070984,0.000087563356],"domain_scores_gemma":[0.99978983,0.00004282201,0.000024754556,0.00008320014,0.000041004474,0.000018401199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057283334,0.000036386722,0.000071734336,0.000009599543,0.00009272251,0.000012434041,0.00012105749,0.000016313206,0.0000047528215],"category_scores_gemma":[0.0000063695315,0.00003138923,0.000015036024,0.000052372965,0.00003772841,0.000076790624,0.000077810786,0.000034950368,0.0000042337697],"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.000013883688,0.00006105282,0.018306896,0.000020694795,0.000040006904,0.000051068062,0.00317995,0.00013977947,0.0004937771,0.81037915,0.10486566,0.06244807],"study_design_scores_gemma":[0.003289552,0.0007675206,0.2496991,0.00005668433,0.00006050528,0.00037418713,0.00040858905,0.6566229,0.0008024632,0.06626674,0.020226588,0.0014251745],"about_ca_topic_score_codex":0.00008467892,"about_ca_topic_score_gemma":0.000008432166,"teacher_disagreement_score":0.8480784,"about_ca_system_score_codex":0.000004070221,"about_ca_system_score_gemma":0.000020199068,"threshold_uncertainty_score":0.12800157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10350136,0.00620248,0.83543235,0.048099134,0.0018886484,0.001444269,0.00019151998,0.0005834645,0.0026567716],"genre_scores_gemma":[0.9892959,0.00048255138,0.008522196,0.00037525475,0.00005659803,0.0001200149,0.000008406621,0.000011285112,0.0011278118],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988795,0.00034451296,0.00023570139,0.00022154434,0.00012066305,0.00019809256],"domain_scores_gemma":[0.9940591,0.0031172063,0.00010757204,0.0024627126,0.00019075446,0.00006269429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011519525,0.00011292958,0.00014295208,0.00006145351,0.00043016594,0.00012352069,0.002057803,0.00004081036,0.0000012786941],"category_scores_gemma":[0.00030227564,0.0000674742,0.00005765544,0.00019579304,0.00014439524,0.00023549116,0.00046593483,0.000102678445,0.0000683521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012010934,0.0005605464,0.020093216,0.00012061857,0.00034014756,0.000004565003,0.004805171,0.000025243915,0.07465907,0.07126753,0.09440674,0.73359704],"study_design_scores_gemma":[0.00829295,0.0005035521,0.20688528,0.0007026911,0.00016207629,0.00020119242,0.00027340802,0.56420255,0.0014465295,0.008755702,0.2066087,0.0019653758],"about_ca_topic_score_codex":0.00009375693,"about_ca_topic_score_gemma":0.00090170704,"teacher_disagreement_score":0.8857945,"about_ca_system_score_codex":0.00003271687,"about_ca_system_score_gemma":0.000047915957,"threshold_uncertainty_score":0.38239446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96807426,0.00021929106,0.019808583,0.0036762874,0.0012352014,0.001332649,0.0000042712795,0.000109441244,0.005539991],"genre_scores_gemma":[0.9900708,0.000008693403,0.008874674,0.000769817,0.00007820106,0.000111776906,1.37188e-7,0.0000068595973,0.00007901212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988817,0.000010044774,0.00029006784,0.00024023537,0.00028829454,0.00028964778],"domain_scores_gemma":[0.99931175,0.0001122018,0.00024739452,0.00021387122,0.000086188054,0.000028615135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091663736,0.00011631574,0.00014293352,0.000060687526,0.000121697034,0.00007936658,0.001662392,0.000048537924,0.0000032281362],"category_scores_gemma":[0.00017130666,0.000066442735,0.00013635072,0.00026770777,0.000041904168,0.00019959861,0.00032264856,0.00019639003,0.0000023524917],"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.00006702128,0.0003055325,0.024421643,0.00010919608,0.000048166494,0.0000014750032,0.024752783,0.0000048400207,0.0048850845,0.93058896,0.002135095,0.012680201],"study_design_scores_gemma":[0.0022500409,0.00080669427,0.02228553,0.0009230469,0.000107100714,0.00008164313,0.008515564,0.0092908405,0.07816207,0.8715952,0.005123303,0.0008589637],"about_ca_topic_score_codex":0.00012348965,"about_ca_topic_score_gemma":0.0000046635323,"teacher_disagreement_score":0.07327698,"about_ca_system_score_codex":0.000030144975,"about_ca_system_score_gemma":0.000022222946,"threshold_uncertainty_score":0.30891657},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3352419,0.00261165,0.65665525,0.004413497,0.00023876784,0.00014414558,0.0000018140978,0.00024012876,0.00045284367],"genre_scores_gemma":[0.9584052,0.0015491853,0.039691675,0.00028609342,0.000013160535,0.0000066019334,0.0000029218443,0.000008145736,0.000037040543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896556,0.00015610718,0.0003574479,0.00018336237,0.000114603936,0.00022290088],"domain_scores_gemma":[0.9987594,0.00006823612,0.00023614563,0.00080786366,0.0000732972,0.000055086006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048576502,0.00012075427,0.00017057407,0.00043900302,0.00021585738,0.00006935812,0.0011728725,0.00014524664,0.0000036845574],"category_scores_gemma":[0.00004058859,0.00011317111,0.00003384215,0.00035115087,0.000056101722,0.00020835697,0.00041115456,0.0008948949,0.0000029807788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004559951,0.000544659,0.0018757519,0.000003030223,0.00005897026,0.000063314656,0.0007513779,0.0023343256,0.00070658216,0.06066816,0.000104946375,0.93284327],"study_design_scores_gemma":[0.0007419317,0.00024218875,0.001956062,0.00010863034,0.000005570496,0.00023969324,0.000211772,0.99091953,0.00018685432,0.0049418006,0.00027383704,0.00017211195],"about_ca_topic_score_codex":0.00003629137,"about_ca_topic_score_gemma":0.000047759993,"teacher_disagreement_score":0.98858523,"about_ca_system_score_codex":0.00011629626,"about_ca_system_score_gemma":0.000032119446,"threshold_uncertainty_score":0.46149838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008615784,0.000029722543,0.97837913,0.0002475921,0.00020386597,0.00024754385,0.0000029969478,0.00030746646,0.01196592],"genre_scores_gemma":[0.9714153,0.0000016149833,0.026875189,0.00072897127,0.00006733994,0.00013225648,0.000002686279,0.0000062114414,0.00077042705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.000014788839,0.00012719822,0.00024417927,0.00008453322,0.00017370579],"domain_scores_gemma":[0.9993582,0.00005803754,0.000036755904,0.00042620904,0.000058745227,0.00006206478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015372006,0.00007694576,0.00007560505,0.00005809204,0.00014892398,0.000048584967,0.00054199423,0.000031579686,0.000018908155],"category_scores_gemma":[0.000008950687,0.000067110595,0.000082051585,0.00011972984,0.00001367407,0.00015531133,0.00005540455,0.0000603863,0.00007264067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032029668,0.0006345957,0.0018263166,0.0000747072,0.00004770509,0.000006592826,0.00062324974,0.000644801,0.015384596,0.86620474,0.006696319,0.10782433],"study_design_scores_gemma":[0.0011448145,0.00018154203,0.00066027517,0.000031857773,0.000022311098,0.0000074856707,0.000047634872,0.95884335,0.010361917,0.01371969,0.014445738,0.000533366],"about_ca_topic_score_codex":0.000109836066,"about_ca_topic_score_gemma":0.00002346925,"teacher_disagreement_score":0.9627995,"about_ca_system_score_codex":0.000015706568,"about_ca_system_score_gemma":0.00006108076,"threshold_uncertainty_score":0.27366906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018247264,0.00012652646,0.9773245,0.000342168,0.0004793247,0.0001504119,0.000002121061,0.00029821065,0.003029516],"genre_scores_gemma":[0.63933325,0.0000038523553,0.35025018,0.00069073506,0.00023060842,0.000011135197,0.0000020844777,0.000010410218,0.009467737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913883,0.000012906441,0.00015834859,0.00025041218,0.00015294891,0.0002865265],"domain_scores_gemma":[0.99938226,0.0001566042,0.00003553569,0.00029749912,0.000049570415,0.000078513876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063798105,0.000088063076,0.00009444719,0.000080926184,0.000117066425,0.00012451917,0.00045865588,0.000042055697,0.000006295916],"category_scores_gemma":[0.00001941689,0.00007490214,0.00009331311,0.00013301727,0.000009194812,0.0002546188,0.00011573918,0.00008463495,0.000025633568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007905584,0.000052148032,0.00016253756,0.0000082594,0.000021803075,0.000016162609,0.00038212058,0.000031730284,0.0050819367,0.0272117,0.0041891513,0.96283454],"study_design_scores_gemma":[0.0005442425,0.00008469813,0.0005356841,0.000012151201,0.000007195953,0.00003568773,0.00006553454,0.97917,0.0012895772,0.001423248,0.016618371,0.00021358849],"about_ca_topic_score_codex":0.00014135911,"about_ca_topic_score_gemma":0.000037644095,"teacher_disagreement_score":0.9791383,"about_ca_system_score_codex":0.00003091834,"about_ca_system_score_gemma":0.00003764672,"threshold_uncertainty_score":0.30544207},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007220236,0.0003285275,0.7565503,0.00023360405,0.00049329305,0.00009427128,0.0000018617505,0.0001840485,0.24210684],"genre_scores_gemma":[0.016172169,0.0001694552,0.0037784865,0.00078751205,0.00051114045,0.0000035320245,0.0000016554357,0.000088046036,0.978488],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925935,0.000050242048,0.00012246119,0.00020194131,0.00018891328,0.00017710446],"domain_scores_gemma":[0.9991358,0.00011946637,0.00013364392,0.0005722298,0.000010474867,0.00002840219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100601814,0.00012544487,0.00016910442,0.00006296524,0.000051058985,0.00010380385,0.00061872037,0.000094987816,0.00015876765],"category_scores_gemma":[0.0000045574416,0.000078353914,0.00008803927,0.00016375192,0.000045265326,0.000066860695,0.00016855597,0.00013643611,0.000021223785],"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.0000011911162,0.000008912256,0.00004044294,0.0000063538364,0.000047917107,0.0000036750585,0.00005621454,0.00060593145,0.0000024290073,0.108896464,0.88412905,0.006201422],"study_design_scores_gemma":[0.00020730891,0.000027488835,0.000016215297,0.00034743306,0.000028303222,0.000014703814,0.000041606025,0.12087877,0.0000020110908,0.000618211,0.8774822,0.0003357551],"about_ca_topic_score_codex":0.0005695858,"about_ca_topic_score_gemma":0.000606812,"teacher_disagreement_score":0.75277185,"about_ca_system_score_codex":0.000038840528,"about_ca_system_score_gemma":0.000034851215,"threshold_uncertainty_score":0.31951797},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17337298,0.000045451492,0.82230717,0.0024522382,0.00063739263,0.00026315087,0.000016143507,0.000808206,0.00009726679],"genre_scores_gemma":[0.9946526,0.000003293811,0.0037710988,0.0013397114,0.000017268336,0.00016103062,0.0000052578685,0.000011991858,0.0000376972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987706,0.000041664163,0.00026734528,0.00031913404,0.00028979787,0.000311453],"domain_scores_gemma":[0.99883515,0.00007802108,0.000112219954,0.00068291865,0.00020345258,0.00008822022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025474306,0.00019184207,0.00019495886,0.0005623976,0.00027493146,0.00012462914,0.0007260109,0.0002474295,0.0000013639057],"category_scores_gemma":[0.000013385899,0.00018798705,0.00012527002,0.00050363125,0.00005022368,0.00057196664,0.000004141216,0.00037555938,0.00008163526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045796126,0.0006035155,0.000039331986,0.00014889399,0.00014551454,0.000036704136,0.0005508517,0.5361322,0.006251497,0.020912498,0.00041075604,0.43431026],"study_design_scores_gemma":[0.0022201731,0.0011003638,0.000027558337,0.00012597498,0.00003503789,0.0000254816,0.00018068854,0.95684934,0.031366095,0.0031135997,0.0045422926,0.00041338877],"about_ca_topic_score_codex":0.000082931714,"about_ca_topic_score_gemma":0.000058999518,"teacher_disagreement_score":0.82127964,"about_ca_system_score_codex":0.00016282177,"about_ca_system_score_gemma":0.00010944839,"threshold_uncertainty_score":0.766589},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2972507,0.00009294029,0.70109254,0.00016688963,0.00007518116,0.00015006909,0.0000010182113,0.00010745104,0.0010632388],"genre_scores_gemma":[0.9808457,0.0000027481135,0.018509006,0.00051209005,0.00001539138,0.000032317585,0.000003717483,0.0000026589646,0.00007639778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995299,0.000012356815,0.00009678877,0.00011457542,0.0001318549,0.000114532595],"domain_scores_gemma":[0.99960566,0.000027543072,0.000050769293,0.00015847021,0.00009189709,0.000065682754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026179824,0.000065485685,0.00007546434,0.000044338794,0.00008372888,0.00028968137,0.00016264041,0.000020571078,1.2627795e-7],"category_scores_gemma":[0.0000057490756,0.000048721082,0.000016931497,0.00006682392,0.00000838067,0.002091701,0.000053957003,0.00003873806,0.0000021819915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007009658,0.00018161607,0.066300385,0.0017241096,0.00046498128,0.000043971722,0.055158626,0.17875078,0.0035806822,0.18219937,0.0050590336,0.5058355],"study_design_scores_gemma":[0.0012857332,0.00035801926,0.00063432497,0.00012126606,0.000016663811,0.000038695114,0.0018802533,0.98012656,0.0003790334,0.0006930324,0.0141647225,0.00030170864],"about_ca_topic_score_codex":0.00013083026,"about_ca_topic_score_gemma":0.000035222503,"teacher_disagreement_score":0.80137575,"about_ca_system_score_codex":0.000026163969,"about_ca_system_score_gemma":0.000022930773,"threshold_uncertainty_score":0.27934042},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84458226,0.00012516933,0.15453824,0.00005420511,0.00005299585,0.00003781886,4.672852e-8,0.000027904689,0.0005813564],"genre_scores_gemma":[0.998576,0.000007003431,0.0012828836,0.00002338545,0.000008963968,0.0000010465492,9.5774986e-8,0.0000015185431,0.000099107776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960256,0.00004847678,0.000101583806,0.000117352676,0.00006686401,0.00006315514],"domain_scores_gemma":[0.99981564,0.00001933733,0.00003595607,0.00007986671,0.000019961659,0.000029206942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040622623,0.000035777502,0.00005995787,0.000060797905,0.000020059211,0.00003409266,0.000051621068,0.000020925883,1.3505259e-7],"category_scores_gemma":[0.00003663407,0.000033062017,0.000008213935,0.000069067624,0.00000829984,0.00025510864,0.00006997002,0.000048903563,3.3704796e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003351858,0.00006561432,0.076914564,0.00004731154,0.000014544189,0.000018358647,0.004733277,0.00048475375,0.067864746,0.01939975,0.000022598862,0.83040094],"study_design_scores_gemma":[0.0018212592,0.0005318051,0.08627365,0.0002250808,0.00001174783,0.0001866172,0.0006684928,0.882603,0.011232136,0.016063776,0.00005540279,0.00032706698],"about_ca_topic_score_codex":0.001363162,"about_ca_topic_score_gemma":0.000521645,"teacher_disagreement_score":0.8821182,"about_ca_system_score_codex":0.000015641965,"about_ca_system_score_gemma":0.000010089869,"threshold_uncertainty_score":0.20607021},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98646694,0.00018642399,0.00212052,0.0011731735,0.0002944132,0.0003084979,8.9527725e-7,0.00007872068,0.009370391],"genre_scores_gemma":[0.99884355,0.000015982761,0.000771196,0.00016970084,0.000030065352,0.000018457597,3.1534825e-7,0.000005782942,0.00014494765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899274,0.00003895423,0.0002087159,0.00015333293,0.00035146924,0.00025478858],"domain_scores_gemma":[0.9993865,0.000042178573,0.00008796383,0.00025193082,0.0001537572,0.00007765728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013461441,0.00010249407,0.00014844346,0.00007331387,0.00010233389,0.000093815914,0.0015317929,0.00003721478,6.6101035e-7],"category_scores_gemma":[0.00006138361,0.00007303118,0.00006101358,0.00038134758,0.000055984645,0.0002628202,0.001057972,0.00041459536,0.0000036636386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003983334,0.0038952313,0.36171544,0.0005708845,0.0002297787,0.000012802464,0.046139665,0.018781038,0.038278054,0.4338373,0.022306388,0.07383508],"study_design_scores_gemma":[0.005202832,0.00080925535,0.02996845,0.00079080724,0.00003948416,0.00010362469,0.006622553,0.877474,0.044585016,0.03193763,0.0014937696,0.0009725695],"about_ca_topic_score_codex":0.0008669284,"about_ca_topic_score_gemma":0.000017755956,"teacher_disagreement_score":0.85869294,"about_ca_system_score_codex":0.00010306434,"about_ca_system_score_gemma":0.00003404179,"threshold_uncertainty_score":0.29781252},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034573425,0.001738527,0.9598354,0.0010586303,0.0005001742,0.0019936608,0.000036368576,0.000107895175,0.00015592888],"genre_scores_gemma":[0.9961946,0.000151983,0.0012170613,0.00023704807,0.0003988891,0.001214904,0.000043482723,0.000010089535,0.0005319492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988785,0.000057604244,0.00034677534,0.00030587733,0.0001781363,0.00023314172],"domain_scores_gemma":[0.99852484,0.0007433325,0.00013839977,0.00046939787,0.00007125969,0.00005275445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007863104,0.00013771177,0.00014261229,0.000086363325,0.00015083353,0.00026990921,0.00072021916,0.00007171117,0.0000018924834],"category_scores_gemma":[0.00004634433,0.000083942505,0.00006157734,0.00022414932,0.000058102898,0.00015613354,0.00007567527,0.00014547816,0.000018142957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004108902,0.00033865578,0.006764357,0.00010712337,0.00010532069,0.00000997821,0.010570229,0.000120663615,0.03619249,0.014987544,0.004935006,0.92582756],"study_design_scores_gemma":[0.00053636247,0.000028584529,0.014954772,0.000104564824,0.000019052082,0.000023103357,0.0011124602,0.9134239,0.00018612196,0.00006236538,0.06935164,0.00019708909],"about_ca_topic_score_codex":0.00027527276,"about_ca_topic_score_gemma":0.00017839471,"teacher_disagreement_score":0.96162117,"about_ca_system_score_codex":0.000022557046,"about_ca_system_score_gemma":0.000016964035,"threshold_uncertainty_score":0.3423076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021539181,0.000026615695,0.9699255,0.00043004716,0.00015944074,0.00009281256,5.853155e-7,0.00016002962,0.0076657794],"genre_scores_gemma":[0.9846657,8.7752466e-7,0.010822136,0.00053943327,0.00004975105,0.00004393824,0.0000031377272,0.0000023104737,0.0038727077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967414,0.0000015666321,0.000058113415,0.00010620238,0.00007912273,0.00008086251],"domain_scores_gemma":[0.9996784,0.000023045735,0.000015377447,0.00018471343,0.000054835007,0.00004368394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013474251,0.00003481844,0.000040067178,0.000024000494,0.00003408337,0.000054601784,0.00022577682,0.000015895497,7.1808523e-7],"category_scores_gemma":[0.000011332814,0.00002676383,0.000024567344,0.000045874578,0.000006877547,0.00022308054,0.000044700584,0.000018686329,0.000043558142],"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.000009107556,0.000020324367,0.0011664433,0.0000050569106,0.000007059546,3.269515e-7,0.0004047533,0.000067483335,0.0003422435,0.90958565,0.0256807,0.06271087],"study_design_scores_gemma":[0.00068698265,0.00013711571,0.00046772012,0.0000045559327,0.0000036478348,0.000009496846,0.0002779515,0.79998183,0.0014451598,0.13992177,0.056859963,0.00020379439],"about_ca_topic_score_codex":0.00006735889,"about_ca_topic_score_gemma":0.000010371698,"teacher_disagreement_score":0.96312654,"about_ca_system_score_codex":0.000014804323,"about_ca_system_score_gemma":0.000022910925,"threshold_uncertainty_score":0.10913973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02078863,0.00020689212,0.97568226,0.0021024058,0.0005519237,0.00024122791,0.000002255095,0.00020160213,0.00022279526],"genre_scores_gemma":[0.9808032,4.200738e-7,0.016860675,0.0018233603,0.00027201924,0.000020359217,0.0000058877017,0.000007639457,0.0002064333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989863,0.00007951656,0.00020523371,0.0002759688,0.00021562395,0.00023736653],"domain_scores_gemma":[0.99900323,0.00028270792,0.00007635814,0.00031457664,0.0002186867,0.000104461076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049636606,0.000107713146,0.00016475737,0.00014411431,0.0000708047,0.00023649921,0.00054464117,0.000069605994,5.8070316e-7],"category_scores_gemma":[0.00007116147,0.000097091535,0.000049801667,0.00046468974,0.000015008426,0.00015369471,0.00007784564,0.000092944385,0.000016565624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050634055,0.00011522669,0.0051295334,0.00030622882,0.000022217348,0.0000071401023,0.0043927464,0.059601534,0.000023805593,0.9270184,0.0008181259,0.002514425],"study_design_scores_gemma":[0.000718134,0.000043894368,0.00008510411,0.00022553637,0.0000024210651,0.0000034302607,0.0009507161,0.9936514,0.000012407111,0.003720113,0.00045160713,0.0001352216],"about_ca_topic_score_codex":0.0033092597,"about_ca_topic_score_gemma":0.00006836173,"teacher_disagreement_score":0.9600146,"about_ca_system_score_codex":0.00011006766,"about_ca_system_score_gemma":0.00027437182,"threshold_uncertainty_score":0.5002633},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020768315,0.0019879832,0.9745107,0.00035335816,0.00017439685,0.000420219,0.00000957578,0.00010267534,0.0016727297],"genre_scores_gemma":[0.9965231,0.0018967554,0.0009691861,0.00027561432,0.00005785301,0.00019163857,0.00002766799,0.000010990257,0.000047188412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747825,0.0012788108,0.00030486716,0.00035151286,0.00024801318,0.00033855802],"domain_scores_gemma":[0.99793375,0.0009977298,0.0001316375,0.00063127803,0.0002140936,0.000091490365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014681249,0.00019359095,0.00021330146,0.00008067329,0.00073459814,0.00022574874,0.00082307425,0.00007603406,6.5204046e-7],"category_scores_gemma":[0.000020138168,0.00015790762,0.000077994235,0.00060056837,0.00019642145,0.00032591552,0.000028033668,0.0009938688,0.000004225959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004915384,0.001297592,0.0022546698,0.000036175425,0.00026144483,0.000023779397,0.032381132,0.10141737,0.00004128519,0.028966375,0.00013868378,0.83268994],"study_design_scores_gemma":[0.0010167256,0.00028583643,0.0007104931,0.0004797601,0.00007017268,0.00005018385,0.0042987606,0.9911022,0.0000063410134,0.0013061111,0.0003788173,0.0002945783],"about_ca_topic_score_codex":0.00016523204,"about_ca_topic_score_gemma":0.0001241587,"teacher_disagreement_score":0.9757548,"about_ca_system_score_codex":0.00008807067,"about_ca_system_score_gemma":0.00005384074,"threshold_uncertainty_score":0.6439286},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029684639,0.000034361725,0.96730596,0.001584818,0.00052453566,0.00018727899,0.000039597588,0.00019330405,0.00044548276],"genre_scores_gemma":[0.9218467,0.00000350522,0.07384079,0.0015246167,0.000378695,0.000026083855,0.00036509786,0.00000971115,0.0020048043],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934167,0.000025575366,0.00015093846,0.00020056374,0.00012297402,0.00015826573],"domain_scores_gemma":[0.9993644,0.000059487305,0.000037464128,0.00022391518,0.00022075212,0.00009402543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017796365,0.000073102325,0.00008821129,0.00003010605,0.000086748456,0.00015404099,0.00030577552,0.000034380842,0.0000035252842],"category_scores_gemma":[0.00016499982,0.00006341847,0.0000370469,0.00013689909,0.000008601184,0.00024200656,0.00009784529,0.00004816119,0.000014066094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010509979,0.0015437623,0.00470219,0.00006620724,0.00014881752,0.000035925877,0.0030388923,0.08795979,0.005366631,0.22140343,0.4852868,0.19034246],"study_design_scores_gemma":[0.00066842075,0.00007281417,0.00010765694,0.000008883303,0.000004395035,0.0000064800374,0.00014277924,0.98765016,0.00027521362,0.000343472,0.010602992,0.000116753734],"about_ca_topic_score_codex":0.000087705754,"about_ca_topic_score_gemma":0.00004065714,"teacher_disagreement_score":0.89969033,"about_ca_system_score_codex":0.000039549082,"about_ca_system_score_gemma":0.00007288213,"threshold_uncertainty_score":0.258613},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5600759,0.00003492639,0.43780863,0.00038546242,0.000512748,0.000019385228,6.1936265e-7,0.000046668396,0.00111568],"genre_scores_gemma":[0.99868625,0.000008864118,0.00013392128,0.00012270563,0.00003654851,0.0000021547698,5.7319244e-8,0.0000022498266,0.0010072148],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995812,0.000016241558,0.00009307634,0.00012703487,0.000097428536,0.000085016094],"domain_scores_gemma":[0.99959576,0.000051779014,0.00002908305,0.00026291684,0.00003610082,0.000024334286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007019475,0.00004231346,0.00006774598,0.000043432396,0.000010200125,0.000047917405,0.0009704989,0.000016494712,0.000013957754],"category_scores_gemma":[0.000011191083,0.000026133572,0.000033766202,0.00007257282,0.000021069069,0.00051618734,0.00014377935,0.00001507109,0.00004034259],"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.000030694395,0.0001506479,0.051390167,0.000035741275,0.00006737078,0.000034898432,0.00051036396,0.000015650037,0.23921809,0.055978153,0.03272396,0.61984426],"study_design_scores_gemma":[0.0015189857,0.000222313,0.034313396,0.00040854176,0.000016055808,0.00003581222,0.000010794942,0.012662012,0.92415047,0.018169591,0.00790061,0.0005914415],"about_ca_topic_score_codex":0.00012373223,"about_ca_topic_score_gemma":0.000008540803,"teacher_disagreement_score":0.68493235,"about_ca_system_score_codex":0.000007800681,"about_ca_system_score_gemma":0.000011335928,"threshold_uncertainty_score":0.18034445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35853487,0.000015471394,0.64049643,0.00013277546,0.0004562211,0.00005512515,8.518475e-7,0.00030715874,0.0000010981826],"genre_scores_gemma":[0.91133136,0.0000054007955,0.08781704,0.00063281565,0.00016500837,0.000007242286,0.0000117669115,0.00001168166,0.000017663257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865365,0.00002763018,0.00016994726,0.00050124543,0.00034712578,0.00030042088],"domain_scores_gemma":[0.9990726,0.000094270545,0.00006429544,0.0003807959,0.00024502943,0.0001430218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041777914,0.0001793348,0.00015533317,0.00027531924,0.00021569555,0.000587986,0.0005352385,0.00004066976,9.560769e-7],"category_scores_gemma":[0.00007971289,0.00015410014,0.000024870184,0.0007852109,0.00005815931,0.0012440583,0.0001598023,0.000159681,0.0000050486365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029607356,0.00018623167,0.013235695,0.00010094495,0.000035370165,0.00003258549,0.000779619,0.29914623,0.06282401,0.0027163657,0.0001189605,0.62079436],"study_design_scores_gemma":[0.00024232097,0.00010647255,0.014765828,0.00012423002,0.0000042525226,0.000018877821,0.0000023244972,0.981539,0.0015188787,0.0000036161857,0.001444033,0.00023015623],"about_ca_topic_score_codex":0.000026102216,"about_ca_topic_score_gemma":0.0000053910503,"teacher_disagreement_score":0.6823928,"about_ca_system_score_codex":0.000059673002,"about_ca_system_score_gemma":0.00009991724,"threshold_uncertainty_score":0.6284022},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82245237,0.00010865218,0.16809188,0.00041966603,0.0008785089,0.00016513024,7.5942893e-7,0.00006755052,0.007815474],"genre_scores_gemma":[0.9955182,0.000008523566,0.004295074,0.00014815027,0.000018348064,0.0000041490534,4.870247e-7,9.061554e-7,0.0000061574547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743474,0.000049987433,0.00056833966,0.00028789614,0.0012374558,0.0004215667],"domain_scores_gemma":[0.9989034,0.00003737799,0.00019208004,0.00035097077,0.00035355246,0.00016261254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061585912,0.000107079395,0.00016333067,0.00065437943,0.00028426826,0.000475883,0.0020173618,0.000030527986,0.000001354779],"category_scores_gemma":[0.0005689843,0.00008577808,0.00004390229,0.0039210487,0.0005859099,0.008918367,0.00036649345,0.00011866602,0.000014662682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015298401,0.000079940866,0.031431764,0.000024692647,0.0000021855885,0.0000013561354,0.01152443,0.82707804,0.00048676427,0.0634526,0.000053493317,0.06584944],"study_design_scores_gemma":[0.00024281566,0.00005959511,0.0023714101,0.000034813296,7.2590126e-7,0.0000064026685,0.00073846476,0.9903346,0.00016177192,0.0058999346,0.000038412465,0.00011108379],"about_ca_topic_score_codex":0.00084359135,"about_ca_topic_score_gemma":0.000024311727,"teacher_disagreement_score":0.17306583,"about_ca_system_score_codex":0.00013530301,"about_ca_system_score_gemma":0.0007487247,"threshold_uncertainty_score":0.6465601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088820055,0.0024338216,0.8858709,0.0014819968,0.00081802666,0.0004620445,0.000038248512,0.0002918042,0.019783145],"genre_scores_gemma":[0.97860086,0.0004952145,0.020379148,0.00022444018,0.000030749063,0.00003849808,0.00004678104,0.000011898293,0.00017241322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737847,0.00049343647,0.0007731621,0.00047156238,0.0004195978,0.00046380112],"domain_scores_gemma":[0.9952274,0.00017652412,0.00037505236,0.0029189498,0.0010658542,0.00023624564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010364224,0.0002834271,0.00042175694,0.00016179227,0.0002231203,0.00036676566,0.0038059517,0.00020841694,0.000017095876],"category_scores_gemma":[0.00017778268,0.00029628404,0.000119800934,0.0010694751,0.00023895338,0.0012586577,0.0011740056,0.00043811576,0.00004567087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009531707,0.00057034247,0.058097225,0.000022865841,0.000082804574,0.000012387433,0.00094743405,0.8739213,0.0001852137,0.04207869,0.0051661297,0.018820286],"study_design_scores_gemma":[0.0010109579,0.00006145751,0.0027761373,0.00011999504,0.000017507704,0.000019086252,0.0002592207,0.99397683,0.000029661978,0.0008071944,0.00059601106,0.00032594136],"about_ca_topic_score_codex":0.0034365146,"about_ca_topic_score_gemma":0.0011182285,"teacher_disagreement_score":0.8897808,"about_ca_system_score_codex":0.00040439022,"about_ca_system_score_gemma":0.0005483745,"threshold_uncertainty_score":0.9999489},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85572714,0.01836677,0.11561809,0.0015554046,0.0036238877,0.0001937511,0.000006020218,0.000064149695,0.004844762],"genre_scores_gemma":[0.99850833,0.00030066492,0.0006525475,0.000116758434,0.00012251531,0.00000533429,0.0000017908004,0.0000040626,0.00028799483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987004,0.00020828198,0.0004591851,0.00008683784,0.00047284682,0.00007249299],"domain_scores_gemma":[0.997858,0.00009522443,0.00047217796,0.00032589465,0.0011346451,0.000114043694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009391787,0.000075653974,0.00015391414,0.00016248005,0.000025667954,0.00035245155,0.0016338365,0.000035291836,0.0000013530176],"category_scores_gemma":[0.00008423846,0.000064845866,0.000059323753,0.00005781464,0.000044826804,0.00072829326,0.00033534752,0.00018577842,0.000010155179],"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.0011039022,0.001963193,0.094606474,0.00005289581,0.0025638225,0.00089583313,0.100602314,0.004453647,0.0058029704,0.51763004,0.066373214,0.20395169],"study_design_scores_gemma":[0.00946182,0.0018738244,0.004113228,0.0018291498,0.00008048813,0.015637774,0.013926303,0.45980534,0.0010021871,0.01085422,0.4803928,0.0010228377],"about_ca_topic_score_codex":0.0001832734,"about_ca_topic_score_gemma":0.0000047052727,"teacher_disagreement_score":0.50677586,"about_ca_system_score_codex":0.00009227929,"about_ca_system_score_gemma":0.000070538,"threshold_uncertainty_score":0.33986983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054734956,0.0018491922,0.9413265,0.0008805924,0.000041517567,0.0004225065,0.000014411483,0.0006543957,0.00007591814],"genre_scores_gemma":[0.96579564,0.00015993515,0.033753347,0.000037571728,0.000023146451,0.00018934815,0.00003022571,0.0000051877223,0.0000055885434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990233,0.000012200863,0.0002325434,0.00040723168,0.000058757847,0.0002659426],"domain_scores_gemma":[0.9991433,0.00035754396,0.00008704042,0.000328801,0.00004232962,0.000041002026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021831781,0.00014335524,0.00020254256,0.0000998809,0.00029553438,0.000177635,0.00038370397,0.00012914215,2.471605e-7],"category_scores_gemma":[0.000082957406,0.00013000266,0.00003738742,0.00031565252,0.0001306315,0.00008971345,0.00031544897,0.0003097831,5.5741236e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043666074,0.00016552585,0.007911171,0.00006007023,0.00002960214,0.0000063670336,0.00010119279,0.00521004,0.0003373643,0.52420604,0.00030068448,0.4616283],"study_design_scores_gemma":[0.0012688783,0.00003492307,0.002825234,0.000024956074,0.000010247277,0.000040956853,0.00018778231,0.9601774,0.000023099064,0.03326784,0.001907716,0.00023093708],"about_ca_topic_score_codex":0.000023552246,"about_ca_topic_score_gemma":0.0000094361585,"teacher_disagreement_score":0.9549674,"about_ca_system_score_codex":0.000006480572,"about_ca_system_score_gemma":0.000015354903,"threshold_uncertainty_score":0.53013545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12183758,0.00013407752,0.85954314,0.00038651875,0.00033891824,0.0008251021,0.000004115526,0.00054611434,0.016384412],"genre_scores_gemma":[0.9476175,5.608699e-7,0.050061584,0.0009384523,0.000074140014,0.0001574283,0.000006742532,0.000010606907,0.0011329933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.00003879939,0.00016046553,0.00040538382,0.00025477452,0.00026595843],"domain_scores_gemma":[0.9992114,0.00006588154,0.00005685953,0.00041334322,0.00012776963,0.00012477815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037267408,0.00013540382,0.00014340703,0.000071686474,0.00009849793,0.00021041612,0.0005356084,0.000052839678,0.000002648286],"category_scores_gemma":[0.000028755176,0.000105648454,0.000089626745,0.00018778403,0.000018813716,0.00026822268,0.00006820466,0.00008870277,0.00003509616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012219747,0.009020716,0.02646036,0.0017123397,0.0003785516,0.0000988914,0.006016213,0.21069537,0.022863757,0.18053494,0.09795448,0.4430424],"study_design_scores_gemma":[0.00079171814,0.00035739425,0.000028599625,0.000031503623,0.0000052615787,0.0000032395358,0.00007545169,0.9945816,0.0010186519,0.0002314972,0.0026873795,0.00018774829],"about_ca_topic_score_codex":0.00004643241,"about_ca_topic_score_gemma":0.000007415574,"teacher_disagreement_score":0.8257799,"about_ca_system_score_codex":0.000044159173,"about_ca_system_score_gemma":0.00019427646,"threshold_uncertainty_score":0.4308219},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14767717,0.00018357603,0.83416426,0.0044115824,0.0008834243,0.00046215786,0.00006879367,0.00026654536,0.011882501],"genre_scores_gemma":[0.9710725,0.0000021760923,0.023369856,0.00055198284,0.00011779807,0.000008929845,0.000048934067,0.000007675844,0.0048201596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989585,0.000041116687,0.00014091012,0.00040126234,0.00021456898,0.00024361287],"domain_scores_gemma":[0.998717,0.00006900192,0.000017727527,0.0010381049,0.000056381497,0.00010179995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041338158,0.00008797036,0.00011776214,0.000093685616,0.000031713687,0.0001454374,0.0015824906,0.000040014278,0.000008377558],"category_scores_gemma":[0.000051075975,0.000070142894,0.00003063184,0.00016578229,0.00001786812,0.00045131377,0.00062616647,0.00009580178,0.00002743847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112574184,0.00016845076,0.006414599,0.00002245006,0.00004327973,0.000052191113,0.0020332905,0.0003422624,0.0034598308,0.014071074,0.12901393,0.84426606],"study_design_scores_gemma":[0.001882313,0.00012444286,0.0029006375,0.000013239034,0.0000051882157,0.000017019358,0.00020522326,0.98262364,0.0008287097,0.001565366,0.009600836,0.00023336141],"about_ca_topic_score_codex":0.00039935843,"about_ca_topic_score_gemma":0.00168994,"teacher_disagreement_score":0.9822814,"about_ca_system_score_codex":0.000025321853,"about_ca_system_score_gemma":0.00008325113,"threshold_uncertainty_score":0.29406878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009611714,0.000309299,0.9970395,0.0006426289,0.0004169137,0.00065682264,0.0000970776,0.0000715726,0.00067004515],"genre_scores_gemma":[0.026575256,0.000051431074,0.9727231,0.00016069565,0.00014089484,0.0000773374,0.00015355062,0.000015924352,0.00010176726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990019,0.0000032902378,0.0004762629,0.00014268521,0.00021377912,0.00016203379],"domain_scores_gemma":[0.9986783,0.00019659166,0.0003709242,0.00046859295,0.00024368145,0.000041853502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036783805,0.00019919855,0.00026102015,0.0001398491,0.00057233515,0.00014296424,0.0014185485,0.00016296313,1.4294125e-7],"category_scores_gemma":[0.00002631111,0.00016620946,0.00018329288,0.00012666394,0.00015884958,0.00038979523,0.00015562825,0.00021054986,3.735044e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031070927,0.000011139132,0.0000024142475,0.00017943466,0.000059873022,2.1256328e-8,0.0012084106,0.6460735,0.000018589275,0.30207735,0.0002134509,0.0501527],"study_design_scores_gemma":[0.00023691934,0.00006491167,0.000016491878,0.00009473779,0.000041521886,0.0000031483785,0.0000028463057,0.93266296,0.00003432408,0.0056641065,0.06095086,0.00022713795],"about_ca_topic_score_codex":0.000039442286,"about_ca_topic_score_gemma":0.00010069584,"teacher_disagreement_score":0.29641324,"about_ca_system_score_codex":0.000061616054,"about_ca_system_score_gemma":0.0001665188,"threshold_uncertainty_score":0.67778254},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37632483,0.00021760286,0.30318886,0.034217026,0.0014823243,0.00034131377,0.0000031676316,0.000745948,0.28347892],"genre_scores_gemma":[0.9908128,0.0000035088128,0.00032675086,0.0026183112,0.000054550233,0.000007660709,2.6663528e-7,0.000003549949,0.006172649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993428,0.000069324335,0.00006995152,0.0001812452,0.00020233224,0.00013435728],"domain_scores_gemma":[0.99935716,0.00012970972,0.00001702249,0.0003660973,0.000065105625,0.00006491533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021574688,0.0000718982,0.00006794551,0.00003557873,0.00011308425,0.00013364753,0.0005483083,0.000022806718,0.00001476756],"category_scores_gemma":[0.000053369055,0.000041141546,0.000039641865,0.00018970137,0.000024639668,0.00012263788,0.00009952665,0.00009977325,0.0001996129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006924489,0.00027523786,0.0021326845,0.000004806794,0.000068507776,0.000034726116,0.004931145,0.0006938893,0.0013654963,0.5020988,0.43688774,0.051437728],"study_design_scores_gemma":[0.003176238,0.0017257484,0.005976789,0.00011791796,0.00003031587,0.00015043089,0.004844569,0.7622875,0.014065365,0.049814943,0.15631382,0.001496333],"about_ca_topic_score_codex":0.000129104,"about_ca_topic_score_gemma":0.000024373221,"teacher_disagreement_score":0.76159364,"about_ca_system_score_codex":0.000033668646,"about_ca_system_score_gemma":0.00006772693,"threshold_uncertainty_score":0.25656867},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010171251,0.002676916,0.98546046,0.00008059989,0.00011740168,0.00044358845,0.000004113871,0.00028790164,0.0007577942],"genre_scores_gemma":[0.99402183,0.00016348307,0.0022962384,0.00046435648,0.00030623,0.002055261,0.00002060769,0.000010891288,0.0006611167],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925256,0.00002167424,0.00013489022,0.00029783836,0.00010736947,0.00018564738],"domain_scores_gemma":[0.9991934,0.000068487454,0.00004478229,0.00045903493,0.00007078518,0.00016353866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014932938,0.00009767255,0.0001086115,0.000029612112,0.00015992536,0.00013183328,0.0003354307,0.00005363368,0.0000034069756],"category_scores_gemma":[0.0000048416214,0.000090235866,0.000037957805,0.00023850492,0.00003720142,0.00012241323,0.00017734915,0.00010936504,0.00003739084],"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.000009914365,0.00026703702,0.0028645468,0.000012905632,0.000033088934,0.000005414914,0.00015587137,0.3335177,0.000069294336,0.07026761,0.038492724,0.5543039],"study_design_scores_gemma":[0.00056703,0.00017756593,0.00033182185,0.000015733409,0.00001812159,0.00003578416,0.00010751427,0.34420922,0.00001735462,0.004196018,0.6499531,0.00037074464],"about_ca_topic_score_codex":0.000034654782,"about_ca_topic_score_gemma":0.000005952113,"teacher_disagreement_score":0.98385054,"about_ca_system_score_codex":0.000016213302,"about_ca_system_score_gemma":0.00002884397,"threshold_uncertainty_score":0.36797118},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028394926,0.0000044387716,0.9667128,0.00073162746,0.0029146941,0.0006050565,0.00009398493,0.00021492028,0.00032757738],"genre_scores_gemma":[0.98939365,0.000030863994,0.008409923,0.00083032175,0.00021942212,0.000058869788,0.0000030695983,0.00001765043,0.0010362169],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860716,0.000036091908,0.0005466546,0.00016340772,0.00030642975,0.00034024272],"domain_scores_gemma":[0.9987203,0.00029267196,0.00017370043,0.00054279657,0.00012405837,0.00014646207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003414125,0.00018946579,0.00019627117,0.00017728999,0.00025724428,0.0001886533,0.00065523974,0.00017540694,0.000018003593],"category_scores_gemma":[0.000009608719,0.00013674943,0.00018580414,0.00023889617,0.00003816211,0.0005297766,0.000006273791,0.00021693375,0.00015158368],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022865756,0.000185038,0.0000038931266,0.000039678373,0.00008558414,0.0000017347331,0.0018949853,0.019847574,0.0004444608,0.00056130387,0.0016061267,0.97510093],"study_design_scores_gemma":[0.0060723927,0.00059935235,0.0000033267281,0.00050504965,0.00006803377,0.00002743946,0.0004919555,0.9443208,0.0146896,0.00021817608,0.03241536,0.0005884885],"about_ca_topic_score_codex":0.000040383737,"about_ca_topic_score_gemma":0.000008479992,"teacher_disagreement_score":0.97451246,"about_ca_system_score_codex":0.00013085364,"about_ca_system_score_gemma":0.00009262709,"threshold_uncertainty_score":0.557648},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33005932,0.029473957,0.5909802,0.0371518,0.0048516924,0.0019296036,0.00020011238,0.0011263309,0.0042269933],"genre_scores_gemma":[0.9947677,0.00041998632,0.00081680145,0.0011181624,0.00008399711,0.000014374242,0.000050491566,0.000025647665,0.0027027938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779415,0.00021312913,0.0003147821,0.0006523877,0.00044454934,0.00058099744],"domain_scores_gemma":[0.9966575,0.00025314972,0.00027031673,0.0025267892,0.00018638655,0.00010584542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746249,0.00025921356,0.00032340048,0.000105149855,0.00014857769,0.0003131347,0.0030433568,0.000071058144,0.000006102314],"category_scores_gemma":[0.000061429346,0.00020059152,0.00009193528,0.00031172196,0.00015140168,0.0007191191,0.0004685592,0.00038219398,0.00015196392],"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.00032984736,0.0009964806,0.015332936,0.00088639226,0.0017430553,0.00006533518,0.0009827577,0.00049555773,0.24333435,0.045226935,0.32647264,0.36413372],"study_design_scores_gemma":[0.0009792406,0.0001661259,0.00044068033,0.0000725276,0.000108151144,0.00006017361,0.000016171887,0.16761088,0.0027397864,0.00047401237,0.82691824,0.000414028],"about_ca_topic_score_codex":0.00005700391,"about_ca_topic_score_gemma":0.0004531084,"teacher_disagreement_score":0.66470844,"about_ca_system_score_codex":0.00004814426,"about_ca_system_score_gemma":0.00017453756,"threshold_uncertainty_score":0.81798846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42186284,0.00032469723,0.5665284,0.008240695,0.0005944188,0.0011669091,0.00007612064,0.0006532532,0.00055269327],"genre_scores_gemma":[0.9970858,0.00007947166,0.0012523758,0.00046503282,0.00013200528,0.0006477417,0.00002468223,0.000030026567,0.00028287325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823946,0.00016624507,0.00048253444,0.00045440838,0.00019023447,0.00046714608],"domain_scores_gemma":[0.99757797,0.0006219776,0.00018373375,0.0012973963,0.00019889224,0.00012004919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538661,0.0002033263,0.00031933322,0.0002044002,0.0009848585,0.00020372735,0.0031975294,0.00013258267,0.0000038068893],"category_scores_gemma":[0.000030592095,0.0001934265,0.00015861882,0.00060207123,0.00009355643,0.00035984398,0.00059938827,0.00024526136,0.000022682401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040148352,0.00061689323,0.00096686865,0.00006927564,0.00011426048,0.000009035875,0.0046172906,0.002352546,0.009672491,0.0360208,0.0028641946,0.9426562],"study_design_scores_gemma":[0.0015396507,0.00008219134,0.0048573236,0.00045098798,0.00005115462,0.000010287269,0.00059574837,0.98199296,0.00006468746,0.00031417736,0.009222134,0.00081871916],"about_ca_topic_score_codex":0.00006453157,"about_ca_topic_score_gemma":0.00069461507,"teacher_disagreement_score":0.97964036,"about_ca_system_score_codex":0.00025555096,"about_ca_system_score_gemma":0.00012608523,"threshold_uncertainty_score":0.7887704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14059934,0.00046411343,0.83172035,0.025953157,0.000306283,0.00011359266,0.000001941176,0.00017280618,0.00066842785],"genre_scores_gemma":[0.9911913,0.00021643827,0.0051699975,0.003296899,0.000034566747,0.000028565524,0.0000010845511,0.000007908622,0.000053198346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989617,0.00025255865,0.0002091242,0.00022423289,0.000116232535,0.00023619276],"domain_scores_gemma":[0.9973855,0.00047357238,0.00006847859,0.0019882193,0.00003459567,0.00004961744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998335,0.0001046145,0.00011282272,0.00015523036,0.00017030451,0.000064866064,0.0023160356,0.000038583297,0.0000018394885],"category_scores_gemma":[0.000020026497,0.00008450693,0.00006348014,0.0002715125,0.000093400915,0.0005343491,0.00041141902,0.0002197872,0.00004853069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006385562,0.0005520963,0.02335363,0.00000907344,0.00017868917,0.00009978146,0.0028349115,0.03503974,0.18293768,0.07052303,0.02798349,0.65642405],"study_design_scores_gemma":[0.0022638077,0.00009394385,0.018762179,0.0006154837,0.00002333354,0.000054994987,0.00013188737,0.9667969,0.0006101591,0.0011223491,0.008353713,0.001171256],"about_ca_topic_score_codex":0.00034318754,"about_ca_topic_score_gemma":0.00022105513,"teacher_disagreement_score":0.93175715,"about_ca_system_score_codex":0.00012409076,"about_ca_system_score_gemma":0.000023858465,"threshold_uncertainty_score":0.43038088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01614987,0.000034187142,0.97792256,0.0025597767,0.0000643622,0.00036156923,0.0000028527456,0.00094884937,0.0019559704],"genre_scores_gemma":[0.93059886,0.000010684967,0.06806341,0.00037337668,0.00013709579,0.00038039146,0.00001005359,0.00001195775,0.00041419128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988942,0.000042100884,0.00014364482,0.00044373874,0.00023292573,0.00024335932],"domain_scores_gemma":[0.99875456,0.00013856996,0.0000373389,0.0008571652,0.00017058634,0.00004177798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003573952,0.00009794974,0.00008202236,0.00033510645,0.00038875762,0.0002544761,0.0013407752,0.00010084864,0.0000041034514],"category_scores_gemma":[0.0000021677758,0.000093615236,0.000042572363,0.00076922285,0.00008848456,0.00017298588,0.0003901768,0.0005415878,0.000481621],"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.0000012687792,0.00012843293,0.000032274904,0.000004245424,0.0000059291924,0.0000017113947,0.000089850466,0.00014140754,0.0727059,0.59452534,0.008878332,0.32348529],"study_design_scores_gemma":[0.0002628476,0.00008504442,0.00065729517,0.000015562346,0.000002885243,0.000028081804,0.000089039546,0.03968106,0.017734576,0.01388761,0.92724794,0.0003080775],"about_ca_topic_score_codex":0.000014959129,"about_ca_topic_score_gemma":0.000008872425,"teacher_disagreement_score":0.9183696,"about_ca_system_score_codex":0.000029034774,"about_ca_system_score_gemma":0.000037702062,"threshold_uncertainty_score":0.6190424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08732924,0.0011636994,0.9098816,0.00025976417,0.000033751778,0.0010583082,0.00003889393,0.00012764588,0.00010710308],"genre_scores_gemma":[0.708611,0.00018081085,0.28840092,0.0007346277,0.00013663835,0.0016230473,0.0001746994,0.00002249009,0.00011572853],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891245,0.000066291504,0.00029968173,0.00037231972,0.00015573399,0.00019354027],"domain_scores_gemma":[0.99873906,0.00017591835,0.00017356678,0.0007555797,0.000090547626,0.00006531398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026915222,0.00014179118,0.0001610562,0.000098238015,0.00024779525,0.00014993186,0.00066970114,0.00005982356,0.0000066661005],"category_scores_gemma":[4.450795e-7,0.00014539403,0.00006486093,0.00033276988,0.00004667016,0.00027040148,0.00026707846,0.0002199168,0.000015794629],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079251495,0.00024349248,0.00009797752,0.000017811477,0.000019567846,4.2396655e-7,0.0004325394,0.0024084526,0.031955104,0.002987813,0.002311492,0.9595174],"study_design_scores_gemma":[0.0017287312,0.00033582957,0.002095542,0.000071779614,0.000032604992,0.000022743958,0.00016475449,0.46397808,0.015178711,0.0011138698,0.5146955,0.0005818504],"about_ca_topic_score_codex":0.00001844568,"about_ca_topic_score_gemma":0.000021061558,"teacher_disagreement_score":0.95893556,"about_ca_system_score_codex":0.000021566031,"about_ca_system_score_gemma":0.000042041134,"threshold_uncertainty_score":0.5928997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1151531,0.00012848525,0.8713495,0.012025814,0.0000125753495,0.00063072983,0.000006900312,0.00015147681,0.00054141297],"genre_scores_gemma":[0.88999397,0.000004644969,0.104567215,0.00511479,0.000083561914,0.00016409162,0.000004962357,0.0000047789717,0.00006197384],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988736,0.000050767147,0.00027200853,0.00044755256,0.00015329635,0.00020277634],"domain_scores_gemma":[0.9985484,0.00010777225,0.00008227409,0.0010063279,0.00018116334,0.000074068324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025452056,0.00012816674,0.00014975695,0.00005972634,0.00017391551,0.000106986234,0.0015181887,0.000037944093,0.0000029274695],"category_scores_gemma":[0.0000013665011,0.00010045024,0.00008215044,0.00077603944,0.000023230974,0.00013883978,0.0002585955,0.00012551616,0.00010122701],"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.000006061074,0.00033558538,0.00020353361,0.000024800695,0.000020036448,4.0205606e-7,0.0012989864,0.00074914726,0.5983424,0.013901345,0.0053950767,0.37972263],"study_design_scores_gemma":[0.00080838153,0.0003779772,0.052538134,0.00011494979,0.00006898624,0.000078090714,0.00014721393,0.20494422,0.12042741,0.02116614,0.5978824,0.0014460937],"about_ca_topic_score_codex":0.000045682264,"about_ca_topic_score_gemma":0.00002027226,"teacher_disagreement_score":0.7748409,"about_ca_system_score_codex":0.000027102113,"about_ca_system_score_gemma":0.000048049653,"threshold_uncertainty_score":0.4096242},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012969606,0.000027232652,0.98267895,0.0025501556,0.0004397078,0.00029013114,0.000019441633,0.0002906853,0.0007341176],"genre_scores_gemma":[0.9896094,0.0000025584561,0.0047922577,0.0006179246,0.00010671284,0.000045563895,0.0000058194405,0.000009357055,0.004810387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880666,0.000027218066,0.00018445426,0.0004246028,0.00015795331,0.00039913322],"domain_scores_gemma":[0.99898094,0.0001805202,0.000043723805,0.0005707995,0.00007523573,0.00014880282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026248881,0.00013125999,0.00013625095,0.00006730547,0.00012781154,0.00014904902,0.00071237027,0.000043729186,0.000027771974],"category_scores_gemma":[0.00006357991,0.00008613701,0.000105843246,0.00023914628,0.000016318423,0.0002641821,0.00035784644,0.000042017542,0.00008307291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014033812,0.00025900482,0.0016327063,0.000028739065,0.00024312052,0.000043208165,0.00034546797,0.012951042,0.0028792138,0.42704815,0.18745418,0.36697483],"study_design_scores_gemma":[0.0018274322,0.00019165865,0.0010752245,0.00005581045,0.0000284693,0.000003965364,0.000059438218,0.81408036,0.0005218782,0.002017669,0.17960212,0.0005359708],"about_ca_topic_score_codex":0.000026447908,"about_ca_topic_score_gemma":0.000015444255,"teacher_disagreement_score":0.9778867,"about_ca_system_score_codex":0.00004202912,"about_ca_system_score_gemma":0.000013742035,"threshold_uncertainty_score":0.35125655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067345686,0.000067729656,0.9193947,0.0013148243,0.000738647,0.000121409605,0.0000022338459,0.0008316605,0.0101831155],"genre_scores_gemma":[0.9919287,6.2375744e-7,0.0065047233,0.0011713776,0.00012461246,0.00000973791,0.0000028783752,0.000008504136,0.00024883728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988464,0.00007649293,0.00019216043,0.00036822472,0.00025691043,0.00025981702],"domain_scores_gemma":[0.99923825,0.00006353185,0.00004942524,0.00046741293,0.00007607536,0.00010533056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002939144,0.00015124981,0.00016080624,0.00009907107,0.00029538287,0.00027331713,0.00062594214,0.000044968503,0.0000043457894],"category_scores_gemma":[0.000025806861,0.00012257378,0.00008906463,0.00021679755,0.000021014264,0.00040256837,0.00011006193,0.00019074655,0.0001623108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013327149,0.00013531852,0.00032508583,0.000045472443,0.00004099922,0.00018506304,0.0007281985,0.23347166,0.0055402895,0.75535256,0.00064759847,0.0035144626],"study_design_scores_gemma":[0.0037770972,0.0004094189,0.00071309856,0.0004499378,0.000027379374,0.00018771931,0.00063945877,0.97494334,0.015200511,0.0005283967,0.00199625,0.0011273779],"about_ca_topic_score_codex":0.0010378893,"about_ca_topic_score_gemma":0.00006173033,"teacher_disagreement_score":0.924583,"about_ca_system_score_codex":0.0001807788,"about_ca_system_score_gemma":0.00015373131,"threshold_uncertainty_score":0.49984136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98297054,0.0005501777,0.015236445,0.0005688481,0.000083282684,0.000048831807,0.000001224468,0.000108481814,0.000432154],"genre_scores_gemma":[0.99839985,0.000030302635,0.0015056971,0.0000064504884,0.000007375387,0.0000044936464,3.1148235e-7,0.0000022484835,0.000043238073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991145,0.00000769876,0.00010619162,0.00026162431,0.00020609568,0.00030387487],"domain_scores_gemma":[0.99963546,0.00003395659,0.00001626317,0.00024679242,0.000044798595,0.000022713537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005803775,0.0000589914,0.00008234216,0.0017100959,0.00009676422,0.00003410687,0.00054566166,0.00007203488,8.467838e-7],"category_scores_gemma":[0.000054426913,0.00005703925,0.000010421616,0.002355403,0.00027939887,0.0002476021,0.00020879334,0.00025717035,0.000004193527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001149804,0.000064672335,0.003554015,0.000031655996,0.000002543185,0.000025073312,0.00017126628,0.051152356,0.37161532,0.54923344,0.000107156106,0.02403102],"study_design_scores_gemma":[0.00018767854,0.0001518699,0.010324213,0.000103880455,6.538982e-7,0.000015520849,0.00007968075,0.96551406,0.017656043,0.005611352,0.00023268061,0.00012234779],"about_ca_topic_score_codex":0.000062520776,"about_ca_topic_score_gemma":0.000023203429,"teacher_disagreement_score":0.9143617,"about_ca_system_score_codex":0.00004513791,"about_ca_system_score_gemma":0.000038790637,"threshold_uncertainty_score":0.23259932},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19943039,0.00038913116,0.7985898,0.0004751342,0.000624218,0.000045249813,1.3868457e-7,0.00013959473,0.0003063423],"genre_scores_gemma":[0.985749,0.000085196116,0.011909097,0.0017539517,0.00042525146,0.000002214234,0.0000010491658,0.0000069442253,0.00006726314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929214,0.000017442151,0.0001442042,0.00028338455,0.000040753006,0.0002220957],"domain_scores_gemma":[0.9995408,0.000039661183,0.000045883506,0.00027790447,0.000018216046,0.00007750726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009995191,0.0001130252,0.00013072943,0.00006269542,0.00006555054,0.00030688656,0.00042845862,0.000045108227,8.101122e-7],"category_scores_gemma":[0.0000015042843,0.000109105444,0.000043148837,0.00007768082,0.000033347485,0.00026118231,0.00048166915,0.00012943122,0.000011300535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073264077,0.00005416831,0.0028076265,0.000010919465,0.00006555819,0.00003286168,0.0018331419,0.35447183,0.000015835434,0.26961094,0.002341552,0.36874825],"study_design_scores_gemma":[0.00034297147,0.00006649556,0.00308435,0.00004765327,0.0000032691082,0.000069680464,0.0000048723846,0.9919715,0.00001716705,0.00283547,0.0013845377,0.0001720389],"about_ca_topic_score_codex":0.00013700673,"about_ca_topic_score_gemma":0.000015120919,"teacher_disagreement_score":0.7866807,"about_ca_system_score_codex":0.000039789822,"about_ca_system_score_gemma":0.000015936872,"threshold_uncertainty_score":0.44491908},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12032878,0.00069665565,0.87547433,0.0029771978,0.00028497545,0.00014986705,0.000010334003,0.00003798183,0.00003985283],"genre_scores_gemma":[0.99399006,0.00043091184,0.005000836,0.0004299355,0.00007032618,0.000023090373,0.000032555887,0.000003266792,0.000018988101],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999068,0.00007384684,0.00021049447,0.0003875878,0.00011351315,0.00014651794],"domain_scores_gemma":[0.9992451,0.0003806641,0.00011196572,0.00013880913,0.00008033528,0.000043090353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024560056,0.000090993664,0.00010555035,0.000048885504,0.00015505591,0.00012466729,0.00024348235,0.000040344632,0.0000016853653],"category_scores_gemma":[0.00020620518,0.000073116986,0.000011977294,0.00012906415,0.00005449769,0.0015847856,0.0001651761,0.000055253357,5.2859366e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053226486,0.000093625255,0.0001214863,0.000009960831,0.0000064538203,0.000002638751,0.0044392482,0.00047731356,0.000044468605,0.004046253,0.0005161382,0.9901892],"study_design_scores_gemma":[0.0010765393,0.000108260574,0.00066535035,0.00004243851,0.00000904131,0.000014467835,0.001530694,0.9913875,0.000006139037,0.00017366391,0.0048283455,0.00015754992],"about_ca_topic_score_codex":0.000014268294,"about_ca_topic_score_gemma":0.000006879258,"teacher_disagreement_score":0.9909102,"about_ca_system_score_codex":0.000014682803,"about_ca_system_score_gemma":0.000048500024,"threshold_uncertainty_score":0.29816243},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021833563,0.00018027976,0.9435155,0.030534416,0.0017974436,0.00014827405,0.0000048634706,0.000021493724,0.0019641637],"genre_scores_gemma":[0.98631185,0.00008372927,0.010400045,0.0016901221,0.00015733718,0.000011821375,0.000013793078,0.0000048193356,0.0013264595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984915,0.000021376289,0.00031729363,0.00018911061,0.00089239725,0.00008830448],"domain_scores_gemma":[0.9972232,0.000023391383,0.00013519455,0.00020547246,0.0023374665,0.00007528507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000765435,0.000087351975,0.0001147639,0.00038705114,0.000020274956,0.00034183447,0.0012321229,0.000025428271,0.000006360309],"category_scores_gemma":[0.00032356882,0.00007064552,0.000018943587,0.00027116833,0.000010249599,0.0010733529,0.0003732103,0.000114009,0.000006645031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002581168,0.00032668852,0.00083402323,0.000038796992,0.000120541175,0.00034794075,0.0030651658,0.018823419,0.000084616884,0.008197779,0.04539681,0.9225061],"study_design_scores_gemma":[0.0051140455,0.0005154082,0.0067112353,0.0012316221,0.000057517755,0.0004980396,0.0046270085,0.73048943,0.0007481518,0.009445089,0.2398496,0.00071281916],"about_ca_topic_score_codex":0.00006328724,"about_ca_topic_score_gemma":0.00006608347,"teacher_disagreement_score":0.9644783,"about_ca_system_score_codex":0.00005655972,"about_ca_system_score_gemma":0.00006660944,"threshold_uncertainty_score":0.32963178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98470324,0.00047942862,0.006393874,0.0008433705,0.0014908887,0.00009185468,0.0000012460463,0.0002015968,0.0057944683],"genre_scores_gemma":[0.9969291,0.000022648366,0.002654551,0.00020995433,0.000009104348,0.000001845032,0.0000012788408,0.000004884061,0.00016662851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.000051282725,0.00022848975,0.000263299,0.00024947338,0.00022909325],"domain_scores_gemma":[0.99915653,0.000069757705,0.00010482922,0.0004937814,0.00010417953,0.00007093161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021412043,0.00011636264,0.00020172048,0.00008581051,0.00009099287,0.00007784924,0.0006677889,0.000039779454,0.000003940898],"category_scores_gemma":[0.000040264757,0.000118356125,0.0000881922,0.00027106248,0.000032039527,0.00034527102,0.00010392227,0.0001355067,0.000015251202],"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.0000073736383,0.000110057765,0.00037598066,0.0000046966943,0.000012985182,0.000016490269,0.00022370133,0.00012364164,0.0069777234,0.98268247,0.00095404394,0.008510827],"study_design_scores_gemma":[0.0064893956,0.0019677866,0.022726318,0.0004890896,0.000069120106,0.00012316617,0.00028944606,0.10779304,0.03126277,0.82315516,0.0041131494,0.0015215423],"about_ca_topic_score_codex":0.00004999509,"about_ca_topic_score_gemma":0.0000011709312,"teacher_disagreement_score":0.1595273,"about_ca_system_score_codex":0.00003642464,"about_ca_system_score_gemma":0.000067554756,"threshold_uncertainty_score":0.48264226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16439995,0.000051362575,0.8307619,0.0036247913,0.00038347885,0.00025873684,0.0000021889302,0.00010642838,0.00041115994],"genre_scores_gemma":[0.9831575,0.000053426455,0.0005361193,0.00093583396,0.0000836997,0.000058168505,0.0000013498295,0.000006389033,0.015167511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905634,0.000041630174,0.00018486846,0.0002853967,0.00016928508,0.0002625026],"domain_scores_gemma":[0.9992568,0.00021392258,0.00010791131,0.00021203805,0.00013540557,0.000073951145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048506132,0.000100209014,0.00014618962,0.00004101049,0.000087248205,0.00027724818,0.00025216216,0.000058699105,0.00000790226],"category_scores_gemma":[0.000047456848,0.00006316478,0.00005601557,0.000059907165,0.000009150486,0.00052923517,0.00022183318,0.000045061646,0.0000048333977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031252735,0.0004997713,0.12886198,0.0000914136,0.00076565816,0.000016408392,0.00068132655,0.0012326763,0.04552615,0.2016622,0.21237096,0.40797892],"study_design_scores_gemma":[0.0112964045,0.00057839544,0.03912047,0.00031631126,0.000095039715,0.000013188633,0.00022363725,0.92294514,0.009753759,0.0016407222,0.0127169825,0.001299946],"about_ca_topic_score_codex":0.0001267549,"about_ca_topic_score_gemma":0.00006122696,"teacher_disagreement_score":0.92171246,"about_ca_system_score_codex":0.00015040144,"about_ca_system_score_gemma":0.000022248456,"threshold_uncertainty_score":0.26735106},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08226397,0.00003028307,0.9128321,0.0012776647,0.00092923257,0.0002028519,0.00008293849,0.00009470637,0.0022863022],"genre_scores_gemma":[0.9803149,0.000006253438,0.01945113,0.00006311791,0.000054410444,0.000034851204,0.000010630051,0.000009358223,0.000055323708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655265,0.0015718087,0.00047805818,0.00043814015,0.0007278111,0.0002315142],"domain_scores_gemma":[0.9948127,0.003926807,0.00027419897,0.0003484686,0.00057599426,0.00006182708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032864192,0.00019942159,0.00030121772,0.0002123388,0.000098015305,0.00009854419,0.0012803387,0.000061928535,0.00001710181],"category_scores_gemma":[0.00051225396,0.00012347719,0.00011609894,0.0002726546,0.00008750815,0.00031275756,0.00026198395,0.00020632759,0.000033440647],"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.00022319627,0.000097260585,0.0014034797,0.00006388459,0.00010560994,0.00001569953,0.0001834418,0.018942876,0.032664742,0.91485536,0.000034807515,0.03140964],"study_design_scores_gemma":[0.0015938618,0.000114806266,0.025337402,0.0017515088,0.00001065361,0.00004827976,0.000086426284,0.9266856,0.0021243023,0.041885618,0.00008888983,0.0002726783],"about_ca_topic_score_codex":0.00014939548,"about_ca_topic_score_gemma":0.000008551473,"teacher_disagreement_score":0.9077427,"about_ca_system_score_codex":0.00047338151,"about_ca_system_score_gemma":0.0003654125,"threshold_uncertainty_score":0.5035254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35474977,0.00022127495,0.6436563,0.000036939477,0.0005828027,0.00036322206,8.4609576e-7,0.00023387023,0.00015498386],"genre_scores_gemma":[0.99184304,0.00002080653,0.007688958,0.00018815529,0.00008140872,0.00009422917,0.0000013558999,0.000033798242,0.00004824955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973136,0.00026019342,0.000609726,0.00075209205,0.00037939235,0.0006849627],"domain_scores_gemma":[0.99855095,0.00035750872,0.00016614584,0.0006131788,0.00011472852,0.0001974752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011923658,0.00031995593,0.00041571725,0.00040111807,0.00024916962,0.00026817413,0.00067721796,0.000116536175,0.0000018724887],"category_scores_gemma":[0.000012235512,0.00030984887,0.00010955183,0.0008341156,0.00004660558,0.0005875683,0.000020074047,0.00095877785,0.000010130789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040824332,0.00017106473,0.0007073865,0.000007273118,0.0000141866185,0.00009661132,0.0016301357,0.95591056,0.00023138047,0.000055509925,0.0000058983246,0.041129142],"study_design_scores_gemma":[0.0017584123,0.00038818247,0.00014200619,0.0005327322,0.000009278936,0.000070134716,0.0010908265,0.9950622,0.00051421166,0.000011613654,0.000035472578,0.00038496693],"about_ca_topic_score_codex":0.0014861668,"about_ca_topic_score_gemma":0.0007458408,"teacher_disagreement_score":0.63709325,"about_ca_system_score_codex":0.00043270702,"about_ca_system_score_gemma":0.00012538284,"threshold_uncertainty_score":0.9999354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60366046,0.0004214876,0.39504772,0.00019416978,0.000117750824,0.00040325773,0.0000027063566,0.00012728058,0.000025127507],"genre_scores_gemma":[0.98312056,0.00008860839,0.01649643,0.000058686375,0.000039708353,0.00014924102,0.000005255324,0.000017668082,0.000023869714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839497,0.00019341536,0.0004467696,0.00042546794,0.000111195826,0.00042818702],"domain_scores_gemma":[0.99711865,0.0013996114,0.00017074433,0.0010968834,0.00012498176,0.000089119225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007867141,0.0001794298,0.00025325423,0.00011645038,0.00053481496,0.00016232832,0.000988269,0.00007693583,7.048036e-7],"category_scores_gemma":[0.000066356515,0.00014972276,0.0000840856,0.00029972702,0.000109669054,0.000184188,0.0007695738,0.00016726405,0.0000023155703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044432796,0.0005209891,0.0084187575,0.000048259106,0.00003582905,0.00000244644,0.0044715214,0.04569112,0.017055068,0.012603645,0.0000517053,0.9110562],"study_design_scores_gemma":[0.0011374073,0.00007902952,0.0030345302,0.0004021186,0.000005608692,0.000009304491,0.00017383025,0.9945407,0.000049058344,0.0000524302,0.00029601745,0.00021996823],"about_ca_topic_score_codex":0.00004877105,"about_ca_topic_score_gemma":0.000073034265,"teacher_disagreement_score":0.94884956,"about_ca_system_score_codex":0.000085156156,"about_ca_system_score_gemma":0.000040663683,"threshold_uncertainty_score":0.6105517},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84386635,0.000016868038,0.14759465,0.0019875574,0.00013451757,0.000066078355,0.0000017522691,0.000076200915,0.0062560267],"genre_scores_gemma":[0.9986443,0.0000014519202,0.00029056912,0.00039808877,0.000010209646,0.0000012238768,6.801383e-8,0.0000016266141,0.0006524928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.00004706665,0.0000979734,0.00015384056,0.00015298075,0.000093443814],"domain_scores_gemma":[0.9990348,0.0003344054,0.00004267628,0.0005194633,0.000045238958,0.000023399532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027888158,0.00004829285,0.00006373198,0.000017379254,0.000053780164,0.00002356073,0.00041482077,0.00001716941,0.00003565502],"category_scores_gemma":[0.00012414709,0.00001967005,0.00004739563,0.00007975009,0.000040631545,0.000088013694,0.000094661,0.000038253565,0.00002648433],"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.00003540266,0.00015096948,0.008426314,0.0000069991747,0.00001626016,0.0000058618602,0.00023382052,0.0000061657074,0.09468203,0.77520144,0.00806675,0.11316798],"study_design_scores_gemma":[0.0060268,0.0023118672,0.31792498,0.002091928,0.000043491513,0.000051000316,0.00031134076,0.17721665,0.106430724,0.38431406,0.0015120194,0.001765139],"about_ca_topic_score_codex":0.000050270057,"about_ca_topic_score_gemma":0.0000062974455,"teacher_disagreement_score":0.39088738,"about_ca_system_score_codex":0.000016513079,"about_ca_system_score_gemma":0.000021628948,"threshold_uncertainty_score":0.08021213},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004217535,0.031281833,0.020266462,0.000029929239,0.0064884336,0.0013521769,0.000062120176,0.00032357962,0.93597794],"genre_scores_gemma":[0.116237804,0.000043027958,0.00052255846,0.00004208785,0.000036024154,0.000028579718,0.000049561862,0.000027791844,0.8830126],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974857,0.000101006146,0.00063888374,0.00093169423,0.0005003692,0.00034234827],"domain_scores_gemma":[0.99749595,0.00013797387,0.0004308092,0.0014846706,0.00034614158,0.000104476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020845442,0.00030231857,0.00046868325,0.0008475345,0.00014386012,0.00022327038,0.0013544944,0.0001708939,0.00005201237],"category_scores_gemma":[0.000018399482,0.00030774897,0.00016799301,0.00019991359,0.00030411678,0.00014151467,0.00042965866,0.00047805044,0.000074818694],"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.000109142726,0.00017827653,0.00074423937,0.00019220263,0.00015173359,0.00007335963,0.004227319,0.00026843167,0.0006124358,0.26558658,0.030219374,0.6976369],"study_design_scores_gemma":[0.0008460333,0.00018482505,0.0019061066,0.0022190295,0.000054096632,0.000010105555,0.00001770665,0.016431883,0.0003424248,0.013187424,0.96316487,0.001635501],"about_ca_topic_score_codex":0.00007717542,"about_ca_topic_score_gemma":0.012422855,"teacher_disagreement_score":0.9329455,"about_ca_system_score_codex":0.0000827739,"about_ca_system_score_gemma":0.00021795006,"threshold_uncertainty_score":0.9999375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30982655,0.0003944882,0.6723698,0.014201188,0.00019704139,0.0005492301,0.0000643932,0.00023576144,0.0021615527],"genre_scores_gemma":[0.9657905,0.000057154917,0.03342245,0.00018570828,0.000009999366,0.000064275984,0.0000068716886,0.000009169857,0.00045388102],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993471,0.000060749808,0.0001739419,0.00016908639,0.000085253814,0.00016384905],"domain_scores_gemma":[0.9975311,0.00040011105,0.000113792514,0.0017802144,0.000116675816,0.000058077065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019227903,0.00009123247,0.00011946435,0.000064036365,0.0002306682,0.00006077957,0.0017183259,0.00003210614,0.0000013996253],"category_scores_gemma":[0.000039404396,0.00006345763,0.00007515511,0.00012279235,0.00013746318,0.00023015666,0.0002672336,0.000076204,0.000003724332],"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.00028690937,0.0013724377,0.021467801,0.00008457974,0.0006127229,0.0000018607901,0.00545329,0.00008614323,0.4387345,0.28498366,0.0030853436,0.24383074],"study_design_scores_gemma":[0.03955361,0.011255483,0.06959782,0.0030159745,0.00087173947,0.00025449978,0.0052844244,0.37179956,0.062179893,0.02613505,0.40358987,0.006462074],"about_ca_topic_score_codex":0.00022661962,"about_ca_topic_score_gemma":0.00045653287,"teacher_disagreement_score":0.65596396,"about_ca_system_score_codex":0.00005110511,"about_ca_system_score_gemma":0.00008468254,"threshold_uncertainty_score":0.31931058},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014288312,0.000038791553,0.98362523,0.0005228789,0.00032636442,0.00022470667,0.000012846585,0.00024305323,0.0007178201],"genre_scores_gemma":[0.9890576,0.000003483028,0.009691523,0.0008866587,0.00008050545,0.000023686745,0.00001135771,0.00000670139,0.00023851235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889886,0.00004243183,0.00025801183,0.00023310671,0.00021553022,0.0003520687],"domain_scores_gemma":[0.99897736,0.00032011696,0.00011268388,0.0003806402,0.00010754697,0.00010167328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026653794,0.00015302925,0.00014421574,0.00014830726,0.00020339263,0.00019020592,0.00046839382,0.00007402797,0.000012250463],"category_scores_gemma":[0.00007535142,0.00010434717,0.00012726187,0.00019815142,0.000016876553,0.001513565,0.00010996462,0.00009332169,0.000016469518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010572068,0.00015190449,0.013717876,0.00002605076,0.00009761638,0.000007723445,0.00021967769,0.021534625,0.0002566108,0.19880635,0.005144441,0.7599314],"study_design_scores_gemma":[0.0014335141,0.00010317002,0.0023217204,0.00006173199,0.000012897165,0.0000025685517,0.00002796888,0.99307996,0.00012821538,0.0005908991,0.001968133,0.00026920112],"about_ca_topic_score_codex":0.00031727605,"about_ca_topic_score_gemma":0.00003943149,"teacher_disagreement_score":0.97476923,"about_ca_system_score_codex":0.00010357264,"about_ca_system_score_gemma":0.00007102937,"threshold_uncertainty_score":0.42551544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762434,0.00016054852,0.022772785,0.00022253074,0.000031988788,0.00004579188,0.000011625147,0.000042822714,0.0004685447],"genre_scores_gemma":[0.99947464,0.000028460869,0.00032008465,0.000054747783,0.0000030312003,0.0000010942545,0.000002192306,0.000001569492,0.00011420144],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99927986,0.0000521941,0.00018024529,0.00026011176,0.00010314411,0.00012442724],"domain_scores_gemma":[0.9994417,0.00014283806,0.000044576147,0.00029970685,0.00002683846,0.000044354503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088989,0.00006541036,0.00019246385,0.0002284202,0.000024743165,0.00002315068,0.00022181745,0.000031848722,0.000013124862],"category_scores_gemma":[0.000019630892,0.00004242116,0.000036498386,0.0004495379,0.00002461133,0.00020235791,0.000086933665,0.00004043864,0.0000021199432],"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.000018303668,0.00007799685,0.94507223,0.000006705454,0.000104366336,0.0000044725753,0.00029167466,0.0006587248,0.004366572,0.0037526176,0.000058111244,0.04558822],"study_design_scores_gemma":[0.00070384913,0.000061608254,0.8859245,0.000036177375,0.00006134909,0.0000031017219,0.000038118724,0.11196031,0.0007429646,0.00026902911,0.000032162618,0.00016684251],"about_ca_topic_score_codex":0.0018839992,"about_ca_topic_score_gemma":0.00266029,"teacher_disagreement_score":0.11130158,"about_ca_system_score_codex":0.000025003465,"about_ca_system_score_gemma":0.00001022279,"threshold_uncertainty_score":0.28480557},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10018976,0.000029868992,0.8967094,0.0019419056,0.0003546529,0.00026590598,0.000008956669,0.00012365036,0.000375924],"genre_scores_gemma":[0.987964,0.0000054315396,0.010293214,0.00028565712,0.000100401645,0.000026106589,0.000009912204,0.0000058252112,0.0013094597],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987229,0.000043067324,0.00020247488,0.00061602634,0.00012028336,0.00029524384],"domain_scores_gemma":[0.998346,0.000177214,0.000037361828,0.0013427481,0.00003920868,0.000057490157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010998748,0.000092986906,0.00012644041,0.000045156237,0.00005484423,0.000071735056,0.0012488274,0.00004037453,0.00001718395],"category_scores_gemma":[0.00013739066,0.000059457518,0.000035797148,0.00009969553,0.000022366097,0.00076728285,0.0006395769,0.00007705604,0.00001100135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020826275,0.00075935974,0.036571205,0.000052933363,0.000076287615,0.000047467485,0.0005928667,0.015516906,0.0062255613,0.015617512,0.050377663,0.873954],"study_design_scores_gemma":[0.0008734737,0.00009336093,0.0047158445,0.000030066485,0.0000048377324,0.000010992149,0.000015486463,0.9886514,0.00021390566,0.00023681596,0.0048992913,0.0002545171],"about_ca_topic_score_codex":0.000168434,"about_ca_topic_score_gemma":0.00012937376,"teacher_disagreement_score":0.9731345,"about_ca_system_score_codex":0.000039435305,"about_ca_system_score_gemma":0.000065668406,"threshold_uncertainty_score":0.24246073},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98838943,0.0010276183,0.009456024,0.000078794634,0.00048975984,0.00023420605,0.000006271938,0.000115214454,0.00020265534],"genre_scores_gemma":[0.99961513,0.0000025471904,0.00014825621,0.000015099469,0.00016034476,0.0000041475428,0.000010750608,0.0000063148645,0.000037391692],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870324,0.00018311587,0.00029162626,0.0003526735,0.000291478,0.00017786513],"domain_scores_gemma":[0.99858755,0.00016619031,0.00013865411,0.0009044772,0.000086955944,0.00011616469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006391928,0.00009916241,0.0003062196,0.000058706803,0.00006592478,0.00013702539,0.0009096526,0.000037580357,2.555261e-7],"category_scores_gemma":[0.000048221456,0.000090871545,0.000013000135,0.00022870228,0.000024223742,0.00026978677,0.00075849524,0.000120409095,0.000004986086],"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.000046786685,0.0005532639,0.943151,0.000052843763,0.00025397737,0.000035939764,0.008948067,0.0009614422,0.00042655616,0.0012208048,0.006955405,0.037393894],"study_design_scores_gemma":[0.0023113799,0.00065421715,0.06252498,0.00010459941,0.00006547569,0.000009232574,0.0032764669,0.92806154,0.000024730743,0.00007229747,0.0026130772,0.0002819905],"about_ca_topic_score_codex":0.0015902519,"about_ca_topic_score_gemma":0.00006278622,"teacher_disagreement_score":0.9271001,"about_ca_system_score_codex":0.000017355642,"about_ca_system_score_gemma":0.000034214532,"threshold_uncertainty_score":0.3705634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034975942,0.00004928732,0.962696,0.000946252,0.00095665973,0.00015691982,0.000001776894,0.00014438486,0.00007277525],"genre_scores_gemma":[0.98305434,0.0000021690526,0.014756503,0.00019376096,0.0003423497,0.000011122239,6.7075416e-7,0.000009684634,0.0016294237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991189,0.000025736059,0.00014938213,0.0003184679,0.00011648239,0.00027102794],"domain_scores_gemma":[0.9993631,0.00013153763,0.000044017997,0.00032206147,0.00007148881,0.000067773115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014761377,0.00010634811,0.000106486856,0.000054821536,0.00012341318,0.000087524815,0.00023383871,0.00005170158,0.000018505312],"category_scores_gemma":[0.00003187874,0.00006995765,0.00008270841,0.00007965443,0.000028897093,0.00039920484,0.00008044969,0.00005402634,0.000014817416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024637356,0.0005066855,0.00019336754,0.00003893125,0.00027464467,0.000014641031,0.0011200114,0.09807092,0.19685952,0.05325339,0.022778312,0.6266432],"study_design_scores_gemma":[0.0005909782,0.000058480582,0.00006439375,0.000050218074,0.000012128784,0.000039580103,0.000021032436,0.99805033,0.00039702584,0.0002567191,0.0002958075,0.00016329247],"about_ca_topic_score_codex":0.000046606227,"about_ca_topic_score_gemma":0.0000035698927,"teacher_disagreement_score":0.9480784,"about_ca_system_score_codex":0.000046467416,"about_ca_system_score_gemma":0.000022187707,"threshold_uncertainty_score":0.285279},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46545705,0.00058877567,0.5300255,0.0008487704,0.0008070207,0.00014700876,3.548953e-7,0.00046842336,0.0016571071],"genre_scores_gemma":[0.99635327,0.0000584138,0.0013710832,0.0005133326,0.00020045445,0.000011190956,6.510138e-7,0.000011378507,0.0014802326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845517,0.000109430155,0.00027101033,0.00043224523,0.00016529365,0.00056688255],"domain_scores_gemma":[0.9991485,0.00017764213,0.000053611235,0.00047675226,0.00003229856,0.000111198104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034861322,0.00016171511,0.00020167537,0.000093630886,0.0000928753,0.000108227316,0.0006432765,0.00008879854,0.00004109968],"category_scores_gemma":[0.000011738322,0.00010735029,0.00009191381,0.00040294108,0.000022497825,0.00030238752,0.0001746331,0.000121907266,0.00007184146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009486545,0.0002456446,0.009044625,0.0000129561995,0.00012249537,0.0006244098,0.0003664892,0.3147435,0.0030404485,0.0238926,0.013628675,0.6341833],"study_design_scores_gemma":[0.0007805157,0.000062272964,0.0005160017,0.000094677955,0.0000045060196,0.00004909106,0.000004651758,0.9961828,0.00015718162,0.00048938394,0.0013542734,0.00030465206],"about_ca_topic_score_codex":0.000058011068,"about_ca_topic_score_gemma":0.00017543719,"teacher_disagreement_score":0.6814393,"about_ca_system_score_codex":0.00008070222,"about_ca_system_score_gemma":0.000030586685,"threshold_uncertainty_score":0.4377618},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009167279,0.0000023882635,0.94434005,0.0011704355,0.00022288664,0.05281577,0.0000020668422,0.00021680142,0.0011379377],"genre_scores_gemma":[0.66085196,0.0000053425924,0.0052300585,0.0045650294,0.0003138291,0.3284243,0.000003241303,0.000012485,0.00059375993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991171,0.000033711636,0.00023869408,0.0001474189,0.0001634531,0.00029966835],"domain_scores_gemma":[0.99927926,0.0001658564,0.00011137995,0.00025477752,0.00011586555,0.00007285123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022728684,0.00009338193,0.00010974431,0.00008212916,0.00010404835,0.00041054987,0.0006522436,0.00003629789,0.000017212027],"category_scores_gemma":[0.000045172015,0.00005541885,0.00007584021,0.00016960781,0.000010053061,0.0022401486,0.00010137673,0.000029921375,0.000030128933],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000316337,0.000063326974,0.004891662,0.00004427795,0.000040156036,0.0000016028912,0.00009799389,0.00010330644,0.00037039528,0.05943593,0.025194293,0.9094407],"study_design_scores_gemma":[0.018863004,0.00015324863,0.0016670506,0.00016190608,0.000011972776,0.000010947232,0.0000068873082,0.29160243,0.0007173444,0.0032188976,0.68315125,0.00043508972],"about_ca_topic_score_codex":0.0000222271,"about_ca_topic_score_gemma":0.0000042075185,"teacher_disagreement_score":0.93911,"about_ca_system_score_codex":0.00004594213,"about_ca_system_score_gemma":0.00005036004,"threshold_uncertainty_score":0.3958942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49543765,0.000017583468,0.5025454,0.0009134078,0.00021778973,0.000042353146,1.5390296e-7,0.00012984307,0.0006958392],"genre_scores_gemma":[0.99718285,0.0000014935077,0.0019368829,0.00078377756,0.000036484103,0.0000047336466,0.0000014839324,0.0000041668122,0.000048143567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992696,0.000031794676,0.00014304019,0.0002229185,0.00016509382,0.00016753838],"domain_scores_gemma":[0.99962074,0.000033118493,0.00003319647,0.00025610486,0.000016253087,0.000040602397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015598758,0.00008223717,0.00008510791,0.00014715562,0.00006551127,0.0001205392,0.0003272415,0.000031880183,0.0000057205175],"category_scores_gemma":[0.000018918376,0.000072303475,0.000047198642,0.00018415379,0.0000041380667,0.00029419578,0.000059502963,0.00013441073,0.00003479714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004622822,0.0011831442,0.07634895,0.000065663815,0.000041387106,0.00017892441,0.0025035974,0.30356747,0.18448216,0.35590097,0.00045223872,0.07522928],"study_design_scores_gemma":[0.0018885441,0.00005716091,0.022882614,0.00007471391,0.0000034958248,0.000005314354,0.000026884401,0.9678949,0.003135959,0.0036609317,0.000092942224,0.0002765152],"about_ca_topic_score_codex":0.000820407,"about_ca_topic_score_gemma":0.00067109225,"teacher_disagreement_score":0.66432744,"about_ca_system_score_codex":0.000083492436,"about_ca_system_score_gemma":0.00007117793,"threshold_uncertainty_score":0.294845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062308628,0.001404121,0.93333536,0.0000677234,0.0015099514,0.0003584541,0.0000011108812,0.00019629995,0.00081832113],"genre_scores_gemma":[0.98839426,0.00007728013,0.010705278,0.00024735765,0.0003075385,0.000032466676,0.000021621945,0.000019092919,0.00019512388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795777,0.000100952486,0.0005237988,0.0005666911,0.00032126438,0.0005295268],"domain_scores_gemma":[0.9985386,0.0001120154,0.00018456294,0.00085907406,0.000113596085,0.0001921655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062947156,0.00026187583,0.000382895,0.00012668647,0.000050336508,0.0001133274,0.0011434521,0.000120211545,0.0000033468086],"category_scores_gemma":[0.0000035741089,0.0002556098,0.0001328044,0.00060812937,0.000050824514,0.00024005728,0.0010016431,0.00031537504,0.000007994313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029982324,0.00014239216,0.003964003,0.000015000143,0.000054992088,0.0001322289,0.00025690853,0.7097124,0.0000016619754,0.004848506,0.0073747593,0.27346718],"study_design_scores_gemma":[0.0010985851,0.00021883637,0.0029978866,0.00021870718,0.000011855048,0.000011455901,0.00003530534,0.9936604,0.0000018329843,0.00037496703,0.0011075493,0.00026260142],"about_ca_topic_score_codex":0.00008954293,"about_ca_topic_score_gemma":0.000041521078,"teacher_disagreement_score":0.9260856,"about_ca_system_score_codex":0.00008523508,"about_ca_system_score_gemma":0.00003275242,"threshold_uncertainty_score":0.9999896},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010300475,0.019123405,0.8814539,0.016052473,0.06810482,0.0022189016,0.00011271272,0.0011978489,0.001435471],"genre_scores_gemma":[0.96508145,0.007434217,0.012432076,0.0005582617,0.012967738,0.00036290876,0.000073992764,0.000042427393,0.0010469201],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981936,0.00033750825,0.00051711925,0.00038236464,0.00019711802,0.00037229466],"domain_scores_gemma":[0.99254304,0.001917202,0.00027415686,0.0047090375,0.00040893996,0.00014764177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009577249,0.00021260808,0.00028080196,0.00013911385,0.0008652248,0.00023608547,0.0037373002,0.00010453854,0.0000012704313],"category_scores_gemma":[0.00021698189,0.00017409478,0.00010775719,0.0003080358,0.0002827857,0.00052078866,0.0014748005,0.0002685281,0.00004565488],"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.000057650475,0.0011346246,0.008844275,0.000056796544,0.00025433628,0.0000021814901,0.00061732717,0.00043235882,0.00855387,0.036153913,0.8138942,0.12999845],"study_design_scores_gemma":[0.0016356775,0.00014288792,0.00057399657,0.00020982517,0.000044180342,0.000020642261,0.000041835803,0.08650312,0.000054170465,0.0003422635,0.9100277,0.0004037136],"about_ca_topic_score_codex":0.000057628167,"about_ca_topic_score_gemma":0.00008516452,"teacher_disagreement_score":0.954781,"about_ca_system_score_codex":0.00009118143,"about_ca_system_score_gemma":0.000063148706,"threshold_uncertainty_score":0.70993793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09399078,0.00010634762,0.90231,0.0021197775,0.00060311274,0.00036142583,0.0000038110163,0.00015357221,0.00035117206],"genre_scores_gemma":[0.9929665,0.000014619412,0.0019878612,0.0021619736,0.00010591047,0.00008341082,0.0000026185226,0.00001030485,0.0026668573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856174,0.00006292197,0.00031084756,0.0004962073,0.00019297832,0.00037532594],"domain_scores_gemma":[0.9986586,0.00040292848,0.00007091505,0.0006626043,0.000104641374,0.000100332145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004982392,0.0001518123,0.00018567826,0.00008629109,0.000070148206,0.00007247614,0.00055164075,0.000060167957,0.000032028307],"category_scores_gemma":[0.0000608935,0.000101827354,0.000118861826,0.00013483493,0.000024916493,0.00019787702,0.00015895005,0.000070759925,0.00002877457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003006729,0.0025791216,0.06345607,0.00025237518,0.00039205884,0.00039241996,0.00059676485,0.041604504,0.02067816,0.2864216,0.23417944,0.34644076],"study_design_scores_gemma":[0.005318547,0.000489324,0.004275319,0.00023764343,0.00001624622,0.00000885621,0.000042672615,0.9824999,0.0007146492,0.0005293061,0.0053166603,0.0005508778],"about_ca_topic_score_codex":0.00024344002,"about_ca_topic_score_gemma":0.00017989498,"teacher_disagreement_score":0.9408954,"about_ca_system_score_codex":0.000117887925,"about_ca_system_score_gemma":0.000052389958,"threshold_uncertainty_score":0.4152399},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.824227,0.000016112537,0.16097014,0.008092687,0.00041034442,0.0001337075,0.000005678783,0.00034334508,0.0058010165],"genre_scores_gemma":[0.9840037,0.0000015426599,0.0031138302,0.011579611,0.00005335334,0.000019172196,0.0000025693794,0.000009324556,0.0012168635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863875,0.000035866142,0.00021627461,0.00043199674,0.00029880577,0.0003783322],"domain_scores_gemma":[0.9987851,0.00011049852,0.000032309308,0.0007085186,0.00016627336,0.00019733986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033305105,0.00015097417,0.00014814611,0.00026310823,0.000072970855,0.00034798722,0.0011135346,0.000062505314,0.000104314604],"category_scores_gemma":[0.000030051246,0.000104099156,0.00004844088,0.0004585758,0.000016215045,0.0018381799,0.00017002667,0.00008364139,0.00027999005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038043121,0.0009958439,0.10293849,0.000095784315,0.00007714042,0.00025505445,0.0069346875,0.0014137729,0.052081637,0.20334667,0.0531524,0.5783281],"study_design_scores_gemma":[0.010394226,0.0017978282,0.29960763,0.00087618566,0.000031625037,0.00006197174,0.0020395992,0.5892557,0.02586705,0.010298982,0.055542402,0.0042268117],"about_ca_topic_score_codex":0.0027081973,"about_ca_topic_score_gemma":0.004663485,"teacher_disagreement_score":0.5878419,"about_ca_system_score_codex":0.00008888363,"about_ca_system_score_gemma":0.00007647951,"threshold_uncertainty_score":0.42450404},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40690097,0.0021106193,0.0430582,0.023951035,0.0134726195,0.000986589,0.000018852797,0.00050317025,0.5089979],"genre_scores_gemma":[0.94072694,0.00002662024,0.00019533928,0.0004792691,0.00009967575,0.0000058878477,0.0000029538228,0.000007986443,0.05845532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991727,0.00008243341,0.00014321785,0.0001852517,0.00030834394,0.00010806245],"domain_scores_gemma":[0.9988612,0.00014543005,0.0001499786,0.00076536735,0.000064930326,0.000013086016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021108886,0.00010666612,0.000106785104,0.000036041794,0.00015366336,0.000057459507,0.0017194453,0.00009281136,0.0000138805735],"category_scores_gemma":[0.000042663734,0.00003860721,0.00016901316,0.00012138587,0.000023887971,0.000042340525,0.00011244384,0.00029785032,0.00000954973],"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.00005072719,0.00005586499,0.00035956566,0.00019343945,0.00024216785,0.000006581663,0.026599096,0.0000549025,0.063774675,0.37197602,0.0186685,0.5180184],"study_design_scores_gemma":[0.0020755655,0.00030059117,0.021661375,0.0071183797,0.0003614108,0.00012864312,0.00201001,0.018843047,0.07889178,0.78831536,0.077402085,0.0028917482],"about_ca_topic_score_codex":0.00007161813,"about_ca_topic_score_gemma":0.0003070837,"teacher_disagreement_score":0.533826,"about_ca_system_score_codex":0.000010484973,"about_ca_system_score_gemma":0.00011702361,"threshold_uncertainty_score":0.3195186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001423145,0.0009142486,0.99368596,0.00057312334,0.0026064385,0.0004848141,0.0000026027872,0.0002564275,0.000053252814],"genre_scores_gemma":[0.7125819,0.00021093224,0.286681,0.0002495238,0.00012803938,0.00008281642,6.447018e-7,0.000018197565,0.000046949586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980425,0.0005610565,0.0003729002,0.00035377167,0.0002522825,0.0004174376],"domain_scores_gemma":[0.996016,0.0028355313,0.00018358247,0.0006974354,0.00016586747,0.00010154741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017685492,0.00020242586,0.0003125334,0.00011775796,0.00034860236,0.00017986703,0.0010456878,0.00009701134,0.0000021596911],"category_scores_gemma":[0.000047210335,0.00015502995,0.00021327018,0.00029239614,0.000057479618,0.00033125494,0.000013020793,0.00028480036,0.0000025595657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023225138,0.00010857621,0.000013618731,0.000013702686,0.00026613873,0.0000040069444,0.002205968,0.9350753,0.0016733612,0.0023333922,0.00025957506,0.057814095],"study_design_scores_gemma":[0.0023149177,0.00041905843,0.00001339645,0.00010260663,0.0001851162,0.000044204342,0.0013132688,0.9862797,0.0022200295,0.0047291936,0.002067316,0.00031117108],"about_ca_topic_score_codex":0.00016516595,"about_ca_topic_score_gemma":0.000032525677,"teacher_disagreement_score":0.71115875,"about_ca_system_score_codex":0.00007043624,"about_ca_system_score_gemma":0.00017573757,"threshold_uncertainty_score":0.63219374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06736895,0.00007684066,0.9147017,0.0004909291,0.016283832,0.00022370224,0.000052133524,0.00047738757,0.00032450547],"genre_scores_gemma":[0.9869549,0.000003134174,0.010257183,0.0004601064,0.0015282151,0.000009246677,0.00000822919,0.0000240947,0.0007548836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979984,0.00007562422,0.00035696971,0.00077840145,0.00035123166,0.00043933303],"domain_scores_gemma":[0.9976211,0.0003405721,0.00010726474,0.0015154016,0.00020335196,0.00021227275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829007,0.00021833931,0.00022452747,0.0001266255,0.00046436538,0.00043914685,0.0019254824,0.00009085928,0.0000020222358],"category_scores_gemma":[0.000030967967,0.00022484282,0.00013075919,0.00035336183,0.000056146768,0.00032772406,0.00003264117,0.0003070128,0.00007373881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014731023,0.00058854144,0.00007322371,0.000060478073,0.00017402315,0.000027849152,0.0016761067,0.18241596,0.0015470335,0.0016513086,0.013345447,0.7982927],"study_design_scores_gemma":[0.0013813471,0.00021815138,0.000031058997,0.0000689263,0.000028572384,0.00006142045,0.00009347826,0.983648,0.0033121398,0.00060554023,0.010133488,0.00041788677],"about_ca_topic_score_codex":0.00014608302,"about_ca_topic_score_gemma":0.000020129784,"teacher_disagreement_score":0.91958594,"about_ca_system_score_codex":0.00008810522,"about_ca_system_score_gemma":0.0001815727,"threshold_uncertainty_score":0.9168824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44388756,0.00010180053,0.5541489,0.00072629505,0.00078723236,0.00012662965,0.0000030447668,0.00014901298,0.00006950651],"genre_scores_gemma":[0.9970167,0.0000073160113,0.0024706314,0.00035503155,0.000088939065,0.00000700821,0.0000018273722,0.000012538858,0.00004000373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984368,0.00022072159,0.00030054862,0.00043058954,0.00029936872,0.0003119793],"domain_scores_gemma":[0.998953,0.0003136505,0.00009639361,0.00044503217,0.00007146379,0.00012049889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008727543,0.00018928568,0.00018728072,0.00009084725,0.0004212555,0.00033399707,0.0005858308,0.00006714245,9.5208566e-7],"category_scores_gemma":[0.000009286947,0.00014738124,0.000065697954,0.00037656017,0.000040113962,0.00034200156,0.000024895895,0.00051491335,0.000007807797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047565783,0.00016961478,0.00060303765,0.00004958566,0.00004305954,0.000052416617,0.007988504,0.9154406,0.00025532927,0.0005118979,0.000051124818,0.07478727],"study_design_scores_gemma":[0.0006954152,0.000064381864,0.0005645341,0.00021871799,0.000013394317,0.000039211736,0.0009374604,0.9966116,0.00034610127,0.00024029808,0.000049935054,0.00021894141],"about_ca_topic_score_codex":0.0014117156,"about_ca_topic_score_gemma":0.00029539075,"teacher_disagreement_score":0.55312914,"about_ca_system_score_codex":0.00009740874,"about_ca_system_score_gemma":0.000060911614,"threshold_uncertainty_score":0.6010032},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03494905,0.00299333,0.9462652,0.008300316,0.00039366694,0.0009349821,0.000004086328,0.0006704563,0.0054888926],"genre_scores_gemma":[0.9833248,0.00024146431,0.0153661575,0.000864253,0.00005226179,0.000098634715,0.000009160947,0.000010261288,0.0000329564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.00019389238,0.00046475747,0.0002239179,0.00025359084,0.00049386034],"domain_scores_gemma":[0.9973235,0.0004788884,0.00028515182,0.0016550795,0.00017016458,0.00008720685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007488041,0.00016923873,0.00020337242,0.00014248659,0.00049569906,0.00024996322,0.0018616061,0.000054544897,0.0000034059142],"category_scores_gemma":[0.0000376014,0.000123743,0.000058816993,0.0010217583,0.000097576885,0.0010763934,0.0004760743,0.00029215735,0.000024406409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009308867,0.00035385252,0.11423633,0.000050081453,0.000068189205,0.000010767311,0.001709265,0.008808464,0.00030457677,0.06477459,0.00044268038,0.80914813],"study_design_scores_gemma":[0.0023620315,0.0000803903,0.008802873,0.001517211,0.000022372204,0.000020829575,0.00010602483,0.96682245,0.00004740808,0.0006957183,0.018987533,0.0005351627],"about_ca_topic_score_codex":0.000149832,"about_ca_topic_score_gemma":0.00032918647,"teacher_disagreement_score":0.958014,"about_ca_system_score_codex":0.00021551299,"about_ca_system_score_gemma":0.00031639368,"threshold_uncertainty_score":0.5046093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190348,0.00013352923,0.07171998,0.005621255,0.00027712272,0.00006584301,8.448712e-7,0.00011479763,0.0030318298],"genre_scores_gemma":[0.99666995,0.000022688067,0.00034565458,0.0005424935,0.000043875505,0.0000029065468,7.0808326e-8,0.0000029939056,0.0023693715],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99939555,0.000030488905,0.00013266868,0.0001557525,0.00014166685,0.00014384669],"domain_scores_gemma":[0.99928683,0.00014834068,0.000058815047,0.00044148456,0.000036040234,0.000028487733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002033647,0.000064048305,0.0000807072,0.000029046847,0.000057437992,0.000051090472,0.0005571136,0.000019919204,0.000031709427],"category_scores_gemma":[0.00002225029,0.000029368346,0.000060916973,0.000114107504,0.000024493962,0.00032537954,0.00019780852,0.000041125546,0.000043554097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074824648,0.000028577797,0.0046290057,0.0000057285015,0.000026910384,0.0000052140326,0.00037951727,0.0000018539811,0.22950229,0.019137766,0.0002855216,0.74599016],"study_design_scores_gemma":[0.0061590835,0.00086407637,0.5069577,0.00427353,0.00011469196,0.00022188638,0.0010066881,0.05013924,0.36443087,0.012948809,0.050017986,0.0028654162],"about_ca_topic_score_codex":0.00011336369,"about_ca_topic_score_gemma":0.000015558691,"teacher_disagreement_score":0.7431247,"about_ca_system_score_codex":0.000011379405,"about_ca_system_score_gemma":0.000017264812,"threshold_uncertainty_score":0.11976064},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000341456,0.0066572754,0.96737987,0.000038488477,0.001438584,0.0011958932,0.000014337722,0.000390895,0.022850486],"genre_scores_gemma":[0.009538729,0.0010157092,0.42018524,0.001308601,0.00086315937,0.00095303747,0.000019748659,0.0004615761,0.5656542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801636,0.00015115028,0.0002860531,0.0008301626,0.00020665217,0.0005096338],"domain_scores_gemma":[0.99822545,0.0006618842,0.0001779487,0.00073611987,0.0000895353,0.000109080844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046727524,0.0004095597,0.0004757376,0.00024875952,0.00013811502,0.0003829012,0.001070203,0.0008251889,0.00028507112],"category_scores_gemma":[0.000060584294,0.00035230033,0.00015690214,0.00026625954,0.00007142811,0.00019605,0.00017816537,0.0012455207,0.00004694885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041981548,0.0005478056,0.00013136043,0.00007546013,0.00050636585,0.0001447447,0.0033642126,0.14593309,0.00021551392,0.097085804,0.31903425,0.43254155],"study_design_scores_gemma":[0.0013029645,0.00071438606,0.000025790187,0.00083225605,0.000029958495,0.000012962809,0.00011164251,0.6735233,0.00008631595,0.002495127,0.31934217,0.0015231606],"about_ca_topic_score_codex":0.00015377141,"about_ca_topic_score_gemma":0.00075184135,"teacher_disagreement_score":0.54719466,"about_ca_system_score_codex":0.00006696614,"about_ca_system_score_gemma":0.0001259017,"threshold_uncertainty_score":0.9998929},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9314227,0.000054013384,0.040336654,0.002966758,0.00023395855,0.00014304162,0.0000026248586,0.00014980507,0.024690421],"genre_scores_gemma":[0.99799126,0.000012565775,0.00018648703,0.00043795502,0.0000463848,0.000004368153,0.0000011656272,0.0000035929286,0.001316217],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926454,0.000066892964,0.0001642606,0.00017911922,0.00018999063,0.00013521429],"domain_scores_gemma":[0.9990847,0.00012425333,0.00009128919,0.0005683874,0.0000916295,0.000039701546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035902526,0.00008828529,0.00011448775,0.000032336015,0.00007869648,0.00008290037,0.0005322158,0.000023731938,0.00004227895],"category_scores_gemma":[0.000042773943,0.00004743385,0.00012388828,0.00009986227,0.000025853878,0.00013911846,0.00007272452,0.000082254184,0.00011503578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055197084,0.00030375377,0.008117245,0.000015079103,0.0001273632,0.0000034046088,0.0010907891,0.00008191563,0.64436394,0.21100082,0.01044997,0.124390505],"study_design_scores_gemma":[0.001162838,0.0010545341,0.27876267,0.00013495433,0.000019690706,0.00002727882,0.0001229451,0.70321023,0.009743674,0.0014519321,0.0037685446,0.00054074096],"about_ca_topic_score_codex":0.00031171055,"about_ca_topic_score_gemma":0.000003484272,"teacher_disagreement_score":0.7031283,"about_ca_system_score_codex":0.000032725602,"about_ca_system_score_gemma":0.000045766457,"threshold_uncertainty_score":0.19342962},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050125755,0.000027463857,0.9894606,0.0043157986,0.00035797438,0.00019660075,0.000005863533,0.00020531655,0.00041782513],"genre_scores_gemma":[0.9527744,0.000011034624,0.03622146,0.010010368,0.00019026824,0.0000693197,0.000015024258,0.000009518223,0.0006986233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928427,0.000010259282,0.00016377392,0.00015324596,0.00014955201,0.00023893027],"domain_scores_gemma":[0.9992562,0.00011174254,0.000055592485,0.00033031753,0.00017148793,0.00007468065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012504074,0.000095987336,0.0000881279,0.000092587696,0.000092456925,0.000090246525,0.000419916,0.00005005346,0.0000057861785],"category_scores_gemma":[0.000034122906,0.000057459343,0.000072550414,0.0003114824,0.000007922858,0.0005632586,0.0001259809,0.00005275121,0.00003980559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096666496,0.00017031313,0.00077732635,0.00006051426,0.00012663343,0.0000034957905,0.0010826925,0.017733365,0.0047150557,0.28889126,0.011922516,0.6744202],"study_design_scores_gemma":[0.002147856,0.000072144205,0.00068189105,0.000054869597,0.000010044985,0.000029655319,0.000021491498,0.8666341,0.00020037421,0.00050460215,0.12936322,0.00027978604],"about_ca_topic_score_codex":0.000053507934,"about_ca_topic_score_gemma":0.000020057652,"teacher_disagreement_score":0.95323914,"about_ca_system_score_codex":0.000025118128,"about_ca_system_score_gemma":0.000031770982,"threshold_uncertainty_score":0.2343124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032839305,0.0001842882,0.9900378,0.00088545366,0.0045833336,0.00034982077,0.000034733734,0.0006029192,0.000037709848],"genre_scores_gemma":[0.9923529,0.00008854559,0.005560022,0.00052797666,0.0008733206,0.00014078511,0.000012707099,0.000030161174,0.0004135887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997948,0.00011877973,0.0003741659,0.0006591461,0.00027405212,0.00062587863],"domain_scores_gemma":[0.9980652,0.00055872404,0.00013099941,0.00092817994,0.00012734959,0.00018959926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056659314,0.00026220796,0.00025047152,0.00009731953,0.00073653244,0.00024116148,0.00086491316,0.00011738948,0.000006170953],"category_scores_gemma":[0.000017185977,0.00020693033,0.00025364046,0.00029787727,0.00004499068,0.00076251844,0.0000140341035,0.00025454993,0.000013920318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008569516,0.00013858912,0.000057293844,0.000006307389,0.00006913842,0.0000071824697,0.0000653126,0.09549526,0.0013641163,0.001203862,0.00042685526,0.90108037],"study_design_scores_gemma":[0.0019047385,0.00050874386,0.00016461503,0.0004291594,0.00006826128,0.00005090783,0.00003617185,0.9761207,0.002710634,0.0021310083,0.015183289,0.0006917373],"about_ca_topic_score_codex":0.00009957488,"about_ca_topic_score_gemma":0.00004980908,"teacher_disagreement_score":0.989069,"about_ca_system_score_codex":0.00021263245,"about_ca_system_score_gemma":0.000045761597,"threshold_uncertainty_score":0.84383744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012687749,0.000027933134,0.9484545,0.0045417626,0.00015189491,0.000013184527,1.307012e-7,0.00020885988,0.03391397],"genre_scores_gemma":[0.98234075,0.0000038762605,0.0024330083,0.00047643948,0.000022179443,0.0000010904067,1.7922877e-8,0.0000010953896,0.014721567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971485,0.000009014579,0.000036882953,0.00009930341,0.00006371167,0.000076236895],"domain_scores_gemma":[0.9997038,0.00003255558,0.000006955703,0.00021615466,0.000012692229,0.000027826487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055473112,0.000026760837,0.000026276966,0.000016785065,0.000020433332,0.000023024642,0.00026683405,0.00000971244,0.00003772293],"category_scores_gemma":[0.000009526385,0.000013380869,0.000022047247,0.00003922615,0.000006443667,0.00017335343,0.00006951971,0.000012139369,0.00045272656],"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.0000010946189,0.0000131502675,0.0006924789,3.8976887e-7,0.0000046695613,0.0000065882623,0.000027210965,4.2960895e-7,0.021261685,0.49117497,0.012498484,0.47431883],"study_design_scores_gemma":[0.0052345395,0.00067913777,0.032699943,0.00019281027,0.000018760116,0.00026349572,0.000093663286,0.077377535,0.079584114,0.116756596,0.68486184,0.0022375644],"about_ca_topic_score_codex":0.000015772592,"about_ca_topic_score_gemma":0.0000029163182,"teacher_disagreement_score":0.96965295,"about_ca_system_score_codex":0.000007011214,"about_ca_system_score_gemma":0.000008546446,"threshold_uncertainty_score":0.58190346},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98686,0.00006117504,0.0075163464,0.0018244213,0.00031548963,0.000061232065,8.898063e-7,0.000045649256,0.003314806],"genre_scores_gemma":[0.9963294,0.0000065154495,0.0005114226,0.0001088668,0.000057490626,0.000006585743,1.4012535e-7,0.000001931849,0.0029776162],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99937266,0.00003353148,0.00012235933,0.00016962948,0.00020895693,0.000092847455],"domain_scores_gemma":[0.9993133,0.00023278363,0.000036282396,0.00030553827,0.000071480616,0.000040630403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012573652,0.000050643328,0.0000732575,0.00006774725,0.000029038581,0.00002092323,0.0003523759,0.000013895343,0.00010595203],"category_scores_gemma":[0.000043156306,0.000030254563,0.000024527233,0.00016178214,0.00001258545,0.00016869421,0.000119598255,0.000026822616,0.00013772995],"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.000040880113,0.0040044705,0.5161761,0.000011183024,0.0001444585,0.000014020595,0.0097866515,0.000018281413,0.048966203,0.063830845,0.035257123,0.3217498],"study_design_scores_gemma":[0.010246002,0.0017274367,0.9472215,0.00044423624,0.00007732015,0.000056446203,0.0026457496,0.013899571,0.0032845843,0.01503058,0.0037768702,0.0015896716],"about_ca_topic_score_codex":0.00006305961,"about_ca_topic_score_gemma":0.00009750505,"teacher_disagreement_score":0.43104544,"about_ca_system_score_codex":0.000013112106,"about_ca_system_score_gemma":0.00006413664,"threshold_uncertainty_score":0.17702857},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40438363,0.00004735846,0.59463286,0.000022414397,0.00034555892,0.0004508144,0.000009294044,0.000031326108,0.00007676841],"genre_scores_gemma":[0.9944824,0.0000022315505,0.0050922274,0.00002058056,0.00031689,0.000053087868,0.000024788817,0.000005578488,0.0000021923395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789685,0.000106715146,0.0010549681,0.0001057307,0.0006419552,0.0001937689],"domain_scores_gemma":[0.9976166,0.00008074385,0.0010797884,0.00023516286,0.0009352554,0.00005243957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016865202,0.00013836533,0.000287758,0.00044208037,0.00015906288,0.00048406402,0.00044013074,0.000058340167,1.2908001e-7],"category_scores_gemma":[0.0000032478758,0.00011225482,0.000072313225,0.00043663464,0.000012580707,0.002897584,0.00003329417,0.0001475495,0.0000030704298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038329246,0.000035204204,0.0031197537,0.00027190865,0.000028588498,0.0000017273612,0.00027505617,0.98034084,0.0002667067,0.0032895333,0.00023407835,0.012098246],"study_design_scores_gemma":[0.0015182201,0.000097854405,0.0015067651,0.00054181827,0.000020734828,0.0004112445,0.0001623038,0.99412125,0.000016640395,0.0000033143494,0.0014641078,0.00013576089],"about_ca_topic_score_codex":0.00005652523,"about_ca_topic_score_gemma":0.0000058185124,"teacher_disagreement_score":0.5900988,"about_ca_system_score_codex":0.000448808,"about_ca_system_score_gemma":0.0003102723,"threshold_uncertainty_score":0.46678406},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014713015,0.00007396604,0.98297006,0.00034915024,0.0012708416,0.00012805048,7.173834e-7,0.00024951057,0.00024470384],"genre_scores_gemma":[0.9969319,0.00004522885,0.0014010301,0.0009151989,0.0005892497,0.0000074150307,0.000009140239,0.000007791174,0.00009305274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859947,0.00009694007,0.00039413184,0.00027070212,0.00016283408,0.00047592606],"domain_scores_gemma":[0.99905497,0.00020587344,0.0001474599,0.00043572375,0.00005914591,0.000096843745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036073365,0.00016967295,0.00020406848,0.00016097137,0.00008714423,0.00026622904,0.00069107825,0.000103011116,0.000011422875],"category_scores_gemma":[0.000015079645,0.00012979485,0.000072364,0.0004168882,0.000020620482,0.0012255688,0.00040400372,0.00019180957,0.00019712096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128665115,0.000031626347,0.0046971687,0.000003844495,0.000013325968,0.000026769552,0.00012762034,0.02952169,0.000013874142,0.0034973351,0.0033875157,0.9586664],"study_design_scores_gemma":[0.00045613784,0.00003298334,0.018838674,0.00013633195,0.0000024939384,0.000018239609,6.9870845e-7,0.97918576,0.0000011185084,0.00007151797,0.0010596907,0.00019636571],"about_ca_topic_score_codex":0.000012794018,"about_ca_topic_score_gemma":0.0000013307549,"teacher_disagreement_score":0.98221886,"about_ca_system_score_codex":0.0000936521,"about_ca_system_score_gemma":0.000021964479,"threshold_uncertainty_score":0.52928805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070355505,0.007776239,0.83816165,0.07882348,0.00075018173,0.0014821861,0.000020089083,0.00021232756,0.0024183337],"genre_scores_gemma":[0.9883571,0.0006520477,0.008366729,0.0013370764,0.00014075536,0.00019636843,0.000040926014,0.000023679171,0.0008852868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925203,0.00552325,0.00042864244,0.0006837034,0.0004107897,0.00043335336],"domain_scores_gemma":[0.9848215,0.011433458,0.00036069326,0.0027201462,0.0005930433,0.000071188486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015718201,0.00029064636,0.00027534523,0.00008646125,0.0011094653,0.0008427384,0.0040268637,0.00017307437,0.0000022854736],"category_scores_gemma":[0.0010739962,0.00017316546,0.00021532476,0.0003086389,0.00021854012,0.00015850326,0.0018329567,0.0010590616,0.00000487118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038983944,0.00037286867,0.004533784,0.00027115553,0.00030438395,0.000011710891,0.11004682,0.02778041,0.00047545446,0.12829909,0.006005202,0.7218601],"study_design_scores_gemma":[0.0004289127,6.3069797e-7,0.0044195987,0.0007096939,0.00005705397,0.000016346536,0.00037395963,0.9739915,0.0001649459,0.0048711817,0.014649635,0.00031650462],"about_ca_topic_score_codex":0.0076370016,"about_ca_topic_score_gemma":0.0067367754,"teacher_disagreement_score":0.9462111,"about_ca_system_score_codex":0.00005855108,"about_ca_system_score_gemma":0.00015179199,"threshold_uncertainty_score":0.9989712},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053138632,0.00005516151,0.94537705,0.0008710094,0.00008723814,0.00010027004,0.000042186948,0.000038662478,0.00028977255],"genre_scores_gemma":[0.9884538,0.000014092622,0.009926353,0.00006780983,0.000040787705,0.0000020419875,0.000012250746,0.000003885786,0.0014789901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999391,0.000020232384,0.000105650695,0.0002576042,0.00011327357,0.00011224298],"domain_scores_gemma":[0.99921906,0.00009364729,0.00002237096,0.0005702401,0.00005981137,0.00003487911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013708396,0.00005645839,0.00008237652,0.000046268135,0.00003795716,0.00004290065,0.00053457683,0.00002628996,0.0000131948145],"category_scores_gemma":[0.000032649536,0.000034317516,0.000017334964,0.00006489685,0.00003136695,0.0003521732,0.00031247103,0.000019607278,0.0000023195873],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014738226,0.0000170215,0.0014018756,0.000018424984,0.000019890424,8.1446257e-7,0.00011436128,0.0000058667947,0.028379524,0.0055171796,0.002346711,0.96216357],"study_design_scores_gemma":[0.0025572886,0.00028071043,0.010867035,0.00008786687,0.000026020332,0.000021557402,0.000056309163,0.9610143,0.021573368,0.0014541182,0.00175854,0.00030290365],"about_ca_topic_score_codex":0.000049123886,"about_ca_topic_score_gemma":0.00014182093,"teacher_disagreement_score":0.9618607,"about_ca_system_score_codex":0.000007798795,"about_ca_system_score_gemma":0.000026598867,"threshold_uncertainty_score":0.13994277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069275096,0.000018450228,0.9256266,0.0027924415,0.0002181079,0.00017505004,2.7600817e-7,0.00016427245,0.0017297461],"genre_scores_gemma":[0.9678522,0.000003865436,0.027988933,0.0036509056,0.00008262733,0.000007183631,9.5330523e-7,0.0000053809863,0.00040798186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992786,0.000024951449,0.00018887097,0.00013950591,0.00014649403,0.0002215574],"domain_scores_gemma":[0.99958414,0.000051157855,0.00004737941,0.00019307634,0.000064231295,0.000060019516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021363585,0.00007450117,0.00007555577,0.00020934158,0.000060765135,0.00017135468,0.00028914967,0.000029610723,0.000020238722],"category_scores_gemma":[0.000018583301,0.000055452685,0.000020861975,0.00058630505,0.000003189798,0.0019425013,0.00016676872,0.000042356223,0.00043509487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005012334,0.00006166788,0.002621477,0.00004101029,0.000023412505,0.000015393838,0.0035149008,0.16518857,0.015031047,0.0027554424,0.0029657267,0.8077312],"study_design_scores_gemma":[0.00035712996,0.000014925999,0.00024624896,0.00015648558,0.0000021443284,0.000007367595,0.000037374484,0.9962487,0.00012997733,0.00005319353,0.0025890924,0.00015732013],"about_ca_topic_score_codex":0.00026078077,"about_ca_topic_score_gemma":0.00001699389,"teacher_disagreement_score":0.8985771,"about_ca_system_score_codex":0.00011973363,"about_ca_system_score_gemma":0.000042052663,"threshold_uncertainty_score":0.55924094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057174265,0.0007095574,0.9287596,0.0069663594,0.00026767445,0.00043428584,0.000016584412,0.00036234173,0.0053093745],"genre_scores_gemma":[0.99147254,0.0030144113,0.004781439,0.00043555847,0.000027034674,0.00009487835,0.000061548824,0.000013232501,0.00009938369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.00018573816,0.00036092338,0.00018505158,0.00023412361,0.00025670548],"domain_scores_gemma":[0.9905724,0.00030107115,0.00044730082,0.008229076,0.00031904253,0.00013111878],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00031517012,0.00018666495,0.00021053547,0.00015370578,0.0030031698,0.0012986436,0.0060991924,0.000095032614,0.0000015352355],"category_scores_gemma":[0.000027510188,0.00017782762,0.00004858249,0.00026288757,0.00053271605,0.0026914803,0.0015896114,0.0003623047,0.000026858213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028788594,0.00047303463,0.022434888,0.00003936081,0.00018380779,0.0000026390487,0.004218628,0.0012398278,0.00028009486,0.53342044,0.0014904753,0.436188],"study_design_scores_gemma":[0.0006131975,0.000041760974,0.006515333,0.000104066305,0.000028115279,0.000025886646,0.00020017462,0.98647636,0.000029773772,0.0002530472,0.005412872,0.00029940676],"about_ca_topic_score_codex":0.00040067243,"about_ca_topic_score_gemma":0.0003584743,"teacher_disagreement_score":0.9852365,"about_ca_system_score_codex":0.000054405227,"about_ca_system_score_gemma":0.00009507446,"threshold_uncertainty_score":0.9997381},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91930526,0.000027801627,0.07707107,0.00066610536,0.00059194234,0.00010295096,0.0000013475318,0.00010672256,0.002126783],"genre_scores_gemma":[0.9991778,0.000011034527,0.00024482503,0.00043651188,0.000047483554,0.000003333087,0.000004034848,0.0000044462313,0.00007053099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.000057531204,0.00020719448,0.00017177187,0.00020957094,0.00028226705],"domain_scores_gemma":[0.9989219,0.00008046451,0.000155188,0.000728415,0.000043368545,0.00007069805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003024687,0.0001126894,0.00013436946,0.00015182485,0.00034534014,0.0005421113,0.0007957329,0.000060271333,0.0000022120978],"category_scores_gemma":[0.00006857633,0.000107992986,0.00006300057,0.000117484284,0.000028995315,0.00079623674,0.00010310816,0.00022217253,0.000036414403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030602467,0.000079571684,0.05236148,0.000022545295,0.000019988775,0.000110380206,0.00093016954,0.88330746,0.00006886193,0.010898794,0.00065562024,0.05151452],"study_design_scores_gemma":[0.0004708795,0.000012989491,0.022260664,0.00004583298,0.0000026102803,0.00000429627,0.000021306845,0.9765303,0.000036349018,0.00006538495,0.00041129955,0.00013805724],"about_ca_topic_score_codex":0.00089192734,"about_ca_topic_score_gemma":0.000046021836,"teacher_disagreement_score":0.093222864,"about_ca_system_score_codex":0.000057300826,"about_ca_system_score_gemma":0.00004358357,"threshold_uncertainty_score":0.5227592},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02409671,0.00025667885,0.97320426,0.0010756172,0.00007146704,0.0005793659,0.000107401305,0.000087587054,0.00052091625],"genre_scores_gemma":[0.98344475,0.000061288134,0.015826922,0.00009402542,0.00011850313,0.00029619367,0.000012648083,0.000006644447,0.00013901926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992997,0.000011127499,0.00011237486,0.00033477065,0.000082346436,0.00015965143],"domain_scores_gemma":[0.9990606,0.00023552908,0.00008901708,0.00046416163,0.00005583307,0.000094879455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013469711,0.00010019273,0.0001161241,0.000028813045,0.0010877262,0.00051107636,0.0003833595,0.00004980716,7.998534e-7],"category_scores_gemma":[0.00005712645,0.000094534895,0.000034096283,0.000022638918,0.000062898245,0.00048484848,0.00022258025,0.00010492679,0.0000029240987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005344108,0.000043578853,0.002657419,0.000019047993,0.00002194197,0.0000016946132,0.00028556053,0.000043801378,0.0010997264,0.021413352,0.000096868986,0.97431165],"study_design_scores_gemma":[0.001013437,0.000068222,0.036270827,0.000051165476,0.000039713766,0.000014718817,0.00022356959,0.94850105,0.00036598436,0.0065796208,0.006478195,0.00039351106],"about_ca_topic_score_codex":0.0001752307,"about_ca_topic_score_gemma":0.00008035428,"teacher_disagreement_score":0.97391814,"about_ca_system_score_codex":0.000010881157,"about_ca_system_score_gemma":0.0000231414,"threshold_uncertainty_score":0.8366021},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10817648,0.00014707123,0.88864154,0.0021871931,0.00026277697,0.00034232272,0.000005443569,0.0001470867,0.00009009043],"genre_scores_gemma":[0.982032,0.000014261264,0.013531792,0.002563337,0.000036942783,0.00009677959,0.000005039651,0.000011692973,0.0017081536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836326,0.00007699404,0.00035155215,0.00056256104,0.000244464,0.00040117634],"domain_scores_gemma":[0.9988134,0.00018673699,0.00010190186,0.00067414163,0.00011341111,0.00011044105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063737173,0.00018199979,0.00022090563,0.00012795653,0.000102797814,0.00007892636,0.00054040214,0.000052709882,0.000005413292],"category_scores_gemma":[0.00006908469,0.0001129001,0.00014802018,0.00008793309,0.000023209395,0.00033129257,0.00018315278,0.000104363775,0.0000066800853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004324224,0.0021568236,0.036890704,0.0001767865,0.00020315865,0.00030627646,0.0005007267,0.24672523,0.04196889,0.13277662,0.09220524,0.44176534],"study_design_scores_gemma":[0.0020136735,0.00011205821,0.00014846817,0.0001901746,0.000005887238,0.0000047942985,0.0000066304533,0.99512905,0.0009583424,0.00092792255,0.00029329612,0.00020968454],"about_ca_topic_score_codex":0.00029682045,"about_ca_topic_score_gemma":0.0001322554,"teacher_disagreement_score":0.87510973,"about_ca_system_score_codex":0.0001712194,"about_ca_system_score_gemma":0.00008867264,"threshold_uncertainty_score":0.46039325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08384486,0.000050784707,0.9140303,0.0010405357,0.00061414915,0.000054890803,0.0000075442886,0.00015045553,0.00020645556],"genre_scores_gemma":[0.9975334,0.000014464251,0.0006658004,0.00041347943,0.000091014306,0.000002083361,0.0000057872717,0.000004073693,0.0012699006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991748,0.000041226944,0.00016032973,0.0002648917,0.00011852859,0.00024022556],"domain_scores_gemma":[0.99936384,0.00004672734,0.000047131573,0.0004009116,0.00006776378,0.00007365185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001468597,0.00009583466,0.000095890384,0.00002474262,0.00007562275,0.00012518484,0.0004255546,0.00003747457,0.000027038272],"category_scores_gemma":[0.000021171045,0.000057153808,0.000072387535,0.00008354125,0.000028717262,0.00052800856,0.00028552525,0.00005703078,0.000054527845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117938434,0.00046814833,0.047454327,0.000015199045,0.00022319927,0.00012281182,0.00016552414,0.00031654208,0.074436076,0.20475864,0.04528481,0.6266368],"study_design_scores_gemma":[0.0019189835,0.00015176463,0.0042463094,0.00031092696,0.000023878254,0.00011341921,0.00003817632,0.9714481,0.0035114137,0.0005548836,0.017056504,0.00062558916],"about_ca_topic_score_codex":0.000098943616,"about_ca_topic_score_gemma":0.000010842772,"teacher_disagreement_score":0.9711316,"about_ca_system_score_codex":0.00008399419,"about_ca_system_score_gemma":0.000012670551,"threshold_uncertainty_score":0.23306647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3985787,0.000053013115,0.60051376,0.00018646952,0.00016149067,0.00011939124,0.0000026237647,0.0000890062,0.00029554561],"genre_scores_gemma":[0.99505615,0.000006695849,0.0045822896,0.00017288564,0.000035857265,0.0000037592963,0.000002373677,0.0000060229736,0.00013396467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984661,0.00013569977,0.00028674232,0.0005784352,0.00016043872,0.00037260124],"domain_scores_gemma":[0.99847037,0.00025739934,0.00009673234,0.0010668462,0.000040390143,0.00006828421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011379062,0.00011262355,0.00015622945,0.00006810677,0.00008915992,0.00009382054,0.0009636734,0.000049418763,0.000013572982],"category_scores_gemma":[0.00014781297,0.00007548454,0.000030549,0.00017715424,0.000041831026,0.0011879983,0.00065531506,0.00015163877,0.0000074101918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008296525,0.00050611456,0.32802716,0.00002821312,0.0001517967,0.00017746631,0.0014082077,0.0051796245,0.024725124,0.0061147227,0.00093716383,0.63266146],"study_design_scores_gemma":[0.00037733917,0.00001136321,0.0051828646,0.000052057527,0.0000052774303,0.000017170789,0.00005661267,0.99359775,0.00019332355,0.00022401853,0.00010368486,0.00017856501],"about_ca_topic_score_codex":0.0011643866,"about_ca_topic_score_gemma":0.00024502416,"teacher_disagreement_score":0.9884181,"about_ca_system_score_codex":0.00009220251,"about_ca_system_score_gemma":0.00007815694,"threshold_uncertainty_score":0.307817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8483013,0.00017534426,0.14276211,0.0017433887,0.0013479893,0.00035037188,0.000007734456,0.00035201703,0.0049597425],"genre_scores_gemma":[0.9854792,0.000012627553,0.010270888,0.0026012927,0.00016791253,0.000036129284,0.0000029296846,0.000007611364,0.0014214086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993152,0.000013189167,0.00008943662,0.00028485077,0.00011628935,0.00018104372],"domain_scores_gemma":[0.9985337,0.00002598082,0.00006505138,0.0011765006,0.000105800376,0.000092931834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011646854,0.00009245683,0.000097069904,0.000024983512,0.00041484958,0.0005756737,0.0015576349,0.000052369654,0.000026916494],"category_scores_gemma":[0.000018155986,0.000076004726,0.00005276052,0.000034287652,0.000015047594,0.00065677013,0.00020409799,0.00007405558,0.000060882398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001138054,0.00016596385,0.001358372,0.00007081115,0.00006880354,0.000026855645,0.0032978503,0.0007671465,0.017700518,0.09623003,0.026421988,0.8537779],"study_design_scores_gemma":[0.0024428691,0.0013894059,0.011720448,0.000055851957,0.000028587172,0.000086694934,0.00058781524,0.61305535,0.0032585815,0.04197436,0.3244419,0.00095812127],"about_ca_topic_score_codex":0.00013457703,"about_ca_topic_score_gemma":0.00012355286,"teacher_disagreement_score":0.85281974,"about_ca_system_score_codex":0.000013684289,"about_ca_system_score_gemma":0.000048079768,"threshold_uncertainty_score":0.5551235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24167636,0.00047215552,0.75421095,0.00026270523,0.00081425376,0.00039201998,0.0000039311185,0.00012340012,0.002044243],"genre_scores_gemma":[0.9930419,0.000014066672,0.005693174,0.00022753798,0.0002975036,0.00007835174,0.0000064003434,0.000018784049,0.0006222804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983553,0.000094572286,0.00026876217,0.0005505859,0.00022547424,0.0005053045],"domain_scores_gemma":[0.99871176,0.00010164968,0.00024909666,0.0007498843,0.00009561745,0.00009200014],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007964881,0.00020034438,0.00029543735,0.000088796296,0.00075715635,0.001048789,0.002427261,0.00008142253,0.0000016206977],"category_scores_gemma":[0.00011364036,0.00018386765,0.00013419021,0.00009224128,0.00004580601,0.0012217514,0.0005483415,0.00033387356,0.00000570734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009135214,0.0011551827,0.3415156,0.00034356824,0.0005822097,0.00041851937,0.005335363,0.41621178,0.021524483,0.058768388,0.0039467774,0.14928462],"study_design_scores_gemma":[0.0010468849,0.00006837757,0.002650312,0.000073012314,0.00000972732,0.0000058254955,0.00003870708,0.99422634,0.0005368255,0.00053212314,0.000523791,0.00028808136],"about_ca_topic_score_codex":0.0031319798,"about_ca_topic_score_gemma":0.0001845554,"teacher_disagreement_score":0.75136554,"about_ca_system_score_codex":0.00006348911,"about_ca_system_score_gemma":0.000043681117,"threshold_uncertainty_score":0.9999882},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029258497,0.00038972675,0.9648197,0.0032338426,0.0002439487,0.00036974676,0.0000046317555,0.00032603083,0.0013538318],"genre_scores_gemma":[0.95456976,0.0003364954,0.044289287,0.00048973714,0.00008082738,0.00007474166,0.000005715984,0.000016360393,0.00013707523],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988636,0.000008757215,0.00024037492,0.0004266593,0.00015148842,0.0003091344],"domain_scores_gemma":[0.99943525,0.00007417587,0.00011466467,0.00023601476,0.00009882049,0.000041078663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012410308,0.00018178909,0.00015455116,0.00033723327,0.0001832597,0.00010981085,0.0005031014,0.00022086728,0.0000027956748],"category_scores_gemma":[0.000015034171,0.00018996133,0.000051914365,0.00035005063,0.000091893045,0.00010176277,0.00010267248,0.00026826153,0.0000037474954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022333916,0.00007931284,0.000027463006,0.0000034182683,0.000022774857,0.0000021210353,0.000025358033,0.0004355606,0.8079717,0.17451005,0.000019983743,0.016879885],"study_design_scores_gemma":[0.0006214053,0.000375014,0.000036482354,0.000039852628,0.000015149,0.00017316476,0.00001728581,0.9770564,0.016113551,0.0040875045,0.0012099552,0.0002542703],"about_ca_topic_score_codex":0.000003874799,"about_ca_topic_score_gemma":0.0000033108668,"teacher_disagreement_score":0.9766208,"about_ca_system_score_codex":0.000062463354,"about_ca_system_score_gemma":0.000010559045,"threshold_uncertainty_score":0.77463984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82177156,0.00035552483,0.16387607,0.0074690697,0.0026999204,0.00058421446,0.000025350057,0.00037534552,0.0028429264],"genre_scores_gemma":[0.9942062,0.0000036336041,0.00030590058,0.0049490836,0.00026055617,0.00008507981,0.0000031582192,0.000027535896,0.0001588558],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974528,0.00017962091,0.0004589939,0.0007929922,0.0004919462,0.0006236385],"domain_scores_gemma":[0.9969436,0.00033823148,0.00042273634,0.0019001388,0.00019729488,0.00019801377],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006885402,0.00034255369,0.00048150876,0.00033454754,0.00075162144,0.00448591,0.006841266,0.00014181958,0.000021492879],"category_scores_gemma":[0.00022411543,0.0003173623,0.00015464323,0.0002036189,0.00015085081,0.002413659,0.0002792882,0.00039028184,0.00006250278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001367083,0.0033432853,0.69616795,0.00066193606,0.0004660468,0.0028154666,0.001520484,0.017739892,0.038090166,0.02908887,0.014236407,0.1945024],"study_design_scores_gemma":[0.012189349,0.00014269566,0.020831617,0.00062494044,0.00003783015,0.0000068823924,0.000014984015,0.93705344,0.021782182,0.00067302,0.0054555475,0.0011874827],"about_ca_topic_score_codex":0.0038484961,"about_ca_topic_score_gemma":0.0017331087,"teacher_disagreement_score":0.91931355,"about_ca_system_score_codex":0.0001268942,"about_ca_system_score_gemma":0.00031469887,"threshold_uncertainty_score":0.9999278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006381479,0.000012040728,0.98988724,0.00019880704,0.0027685352,0.00032355907,0.0000149742,0.00018581685,0.0002275325],"genre_scores_gemma":[0.99269915,0.000012314124,0.006597811,0.0004998083,0.000089908994,0.00003963658,0.0000024741462,0.000009891749,0.000049025417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893224,0.00004577296,0.00022879352,0.00029515135,0.00016808028,0.0003299525],"domain_scores_gemma":[0.9986572,0.00034197522,0.00019121265,0.0005860255,0.00012256783,0.00010097751],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002147886,0.00019138682,0.0001815712,0.00019890883,0.0013654354,0.000696469,0.00080780743,0.00007551796,0.0000019392867],"category_scores_gemma":[0.000009119125,0.00019400299,0.00018470948,0.00012781328,0.00003974103,0.0019850987,0.0000087175495,0.0002845258,0.000014297495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007110057,0.00006841131,0.000026186159,0.0000061489586,0.000105941,0.0000036752263,0.00044262872,0.75392324,0.000023516932,0.001004389,0.0007397117,0.24358504],"study_design_scores_gemma":[0.0008957307,0.0001623408,0.0007816197,0.000055858913,0.000020703208,0.0000056240306,0.000023568487,0.9971861,0.00029442005,0.00009814771,0.00024658948,0.00022925345],"about_ca_topic_score_codex":0.00028571187,"about_ca_topic_score_gemma":0.000040786068,"teacher_disagreement_score":0.98631763,"about_ca_system_score_codex":0.00013711436,"about_ca_system_score_gemma":0.000062742205,"threshold_uncertainty_score":0.9999347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053528314,0.00014411646,0.99196315,0.00015774331,0.00016021248,0.00029007348,4.5607013e-7,0.00039171198,0.0015397215],"genre_scores_gemma":[0.70989084,0.00004177282,0.2871044,0.00022764693,0.00006502188,0.00011847212,0.0000052585165,0.000017273751,0.0025292858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985908,0.00009411438,0.00026557763,0.00049190613,0.00020470736,0.00035284564],"domain_scores_gemma":[0.9991577,0.00016002938,0.00007218971,0.0004616109,0.00006890553,0.00007952255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044522373,0.0001533148,0.00018429708,0.00015054952,0.00010417366,0.00017101635,0.00051098154,0.000082525985,0.000025997744],"category_scores_gemma":[0.00008810804,0.00009965503,0.00006022682,0.00044056916,0.000021924188,0.0006956584,0.00022597423,0.00010843482,0.000010413993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011313284,0.00007879526,0.0018044569,0.0000050230133,0.000006015681,0.0000050018784,0.0000799229,0.97205365,0.00005239465,0.0011503862,0.00035964636,0.024393372],"study_design_scores_gemma":[0.00076789263,0.00006079438,0.00017137831,0.000056669458,0.00000300723,0.000008430443,0.000024681538,0.9985751,0.000020942023,0.00006215288,0.000060310816,0.0001886358],"about_ca_topic_score_codex":0.00015109293,"about_ca_topic_score_gemma":0.00001465931,"teacher_disagreement_score":0.7048587,"about_ca_system_score_codex":0.00008456973,"about_ca_system_score_gemma":0.000062595594,"threshold_uncertainty_score":0.40638143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1213878,0.00022168954,0.8713476,0.000042270534,0.00008881311,0.00024155465,6.568837e-7,0.00006762028,0.0066019725],"genre_scores_gemma":[0.75518644,0.00006845854,0.24227715,0.000057540485,0.0000064686164,0.0000032586536,0.0000040319555,0.0000069723956,0.0023896655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991491,0.000030277473,0.00010453329,0.00031700003,0.00015513819,0.00024397598],"domain_scores_gemma":[0.9992937,0.000040549367,0.00010096069,0.00042972088,0.000039433417,0.00009566396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015908535,0.00010567982,0.0001842513,0.00007279897,0.00019951708,0.0000103105285,0.00060388754,0.00007180093,0.00011554934],"category_scores_gemma":[0.0000072134935,0.00012799173,0.00014115861,0.000063953164,0.00009280657,0.00028320437,0.00027053387,0.00008948298,0.00006235055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031889914,0.0020459709,0.0027333323,0.00022820698,0.0004697311,0.00012090251,0.020361437,0.000012104725,0.06415148,0.07704319,0.0035185178,0.82899624],"study_design_scores_gemma":[0.009996509,0.0026258214,0.021979116,0.00019489352,0.00030065916,0.000033803517,0.0015988875,0.8717096,0.042228058,0.007056743,0.040110797,0.0021651017],"about_ca_topic_score_codex":0.00039864943,"about_ca_topic_score_gemma":0.0000039705437,"teacher_disagreement_score":0.8716975,"about_ca_system_score_codex":0.000060002898,"about_ca_system_score_gemma":0.00005979699,"threshold_uncertainty_score":0.5219351},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704846,0.00002052598,0.02752375,0.0007381349,0.00058484374,0.00033857877,0.0000024230346,0.00013168763,0.00017546123],"genre_scores_gemma":[0.98268217,0.0000012122794,0.016740782,0.00007295668,0.00013666267,3.745015e-7,2.9099257e-7,0.000007974394,0.00035759545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989798,0.000076857505,0.00016051119,0.00040695083,0.000153014,0.00022284164],"domain_scores_gemma":[0.9982304,0.00008820798,0.000106214335,0.0013839874,0.00011778172,0.00007343915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039309615,0.00012492073,0.00017073515,0.000042230047,0.0007757716,0.00046325158,0.00045030628,0.000042467822,0.0000010900322],"category_scores_gemma":[0.00032251002,0.00011105083,0.000085285945,0.000042447293,0.000058573907,0.00020687463,0.00023861854,0.00011264042,0.000007085148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049850143,0.00009378151,0.0065599717,0.000038297152,0.00009614243,0.0043977792,0.008495601,0.0006154974,0.0009490297,0.00047280334,0.0010836715,0.9771476],"study_design_scores_gemma":[0.0011507202,0.00027236767,0.009126382,0.00002817571,0.000035014593,0.0021179975,0.002223441,0.9768064,0.0004819112,0.006134598,0.0012176578,0.00040531572],"about_ca_topic_score_codex":0.0033602505,"about_ca_topic_score_gemma":0.0003954165,"teacher_disagreement_score":0.97674227,"about_ca_system_score_codex":0.000030788353,"about_ca_system_score_gemma":0.000024185014,"threshold_uncertainty_score":0.59666866},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822967,0.000031649008,0.016173821,0.000044945067,0.00019837015,0.00018664639,1.8677027e-7,0.000043632535,0.0010240206],"genre_scores_gemma":[0.99967366,0.0000037160714,0.00006924687,0.000034880104,0.000016792075,0.000010590242,1.4111085e-7,0.0000031929633,0.00018778937],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991047,0.00007543923,0.00020734845,0.00029094156,0.00014621047,0.00017537786],"domain_scores_gemma":[0.9985013,0.0000415872,0.00009982267,0.0012713429,0.00004426819,0.000041678297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003742017,0.0000837039,0.00018588665,0.0000405703,0.00012844792,0.00012834003,0.0011280212,0.000036485777,0.000003606798],"category_scores_gemma":[0.00001975734,0.000071264476,0.00004356002,0.000056750396,0.00002800926,0.0002277695,0.00044737724,0.00010687095,0.0000027293388],"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.00009643288,0.005738383,0.8365361,0.000031411542,0.00011746902,0.0004641802,0.0036724808,0.062081322,0.0010399679,0.0032604507,0.00019513236,0.08676665],"study_design_scores_gemma":[0.0013852248,0.00034136715,0.15691845,0.000021081412,0.0000065913964,0.000010712111,0.00027001355,0.84022516,0.00040378317,0.00020167214,0.0000081783,0.00020776852],"about_ca_topic_score_codex":0.00408395,"about_ca_topic_score_gemma":0.00257759,"teacher_disagreement_score":0.7781438,"about_ca_system_score_codex":0.000022042841,"about_ca_system_score_gemma":0.000017695093,"threshold_uncertainty_score":0.6173738},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026784742,0.0000535205,0.96349865,0.0076325396,0.0006700396,0.0005141267,0.000069250666,0.00019334361,0.0005837684],"genre_scores_gemma":[0.9966086,0.0000048266356,0.0009941972,0.00081688684,0.000113720715,0.00009609392,0.000018911735,0.0000066973803,0.0013400221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989708,0.00002757631,0.00016686975,0.0003788281,0.00017410787,0.0002817944],"domain_scores_gemma":[0.99850386,0.000084783635,0.00011872957,0.00067070563,0.0004894097,0.00013252442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029644024,0.00013403394,0.00016676291,0.000033934695,0.00074869284,0.0006129127,0.0009154533,0.000044703378,0.000002680603],"category_scores_gemma":[0.00017756292,0.000116183815,0.00007690766,0.00009405831,0.000023173641,0.0006024477,0.0003230409,0.000066174965,0.00005164305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008686418,0.0013319647,0.011851377,0.00057570846,0.000984829,0.00019494882,0.013987339,0.0049921493,0.019353058,0.4221874,0.20604098,0.3176316],"study_design_scores_gemma":[0.0046395552,0.0012046401,0.039727386,0.00053141784,0.000076054064,0.000022910886,0.0032618395,0.8241623,0.024393102,0.002109766,0.097952455,0.001918549],"about_ca_topic_score_codex":0.00021710193,"about_ca_topic_score_gemma":0.00019806382,"teacher_disagreement_score":0.9698239,"about_ca_system_score_codex":0.00007709802,"about_ca_system_score_gemma":0.00006090416,"threshold_uncertainty_score":0.5910331},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26998532,0.00010802139,0.72846955,0.0006368345,0.000104839564,0.00026313434,0.00000249418,0.00013503339,0.00029476426],"genre_scores_gemma":[0.9947431,0.0001964004,0.004779878,0.00009872208,0.000020180478,0.00007247032,0.000009901834,0.000021775977,0.00005758108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857575,0.00022098445,0.0003277817,0.00040580975,0.00020284098,0.00026683844],"domain_scores_gemma":[0.99714774,0.0003479689,0.00023831947,0.0020667918,0.000104242215,0.000094945884],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039623756,0.00019877056,0.00023336653,0.00021607881,0.0018712736,0.00049642153,0.0015403448,0.000098505494,8.6537904e-7],"category_scores_gemma":[0.0000033390927,0.00020756549,0.000055043358,0.00025479993,0.0002432744,0.00060089707,0.00004392235,0.0005547878,0.0000055333408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053129897,0.0006604958,0.0010986845,0.000038053877,0.00008313363,0.000011381926,0.002646287,0.49295208,0.004647304,0.005356564,0.000039386134,0.49241352],"study_design_scores_gemma":[0.0006294115,0.000084227584,0.0012378953,0.00023686285,0.000018363717,0.000013754797,0.00019810806,0.9962782,0.00094246346,0.00003641716,0.00007559263,0.00024865544],"about_ca_topic_score_codex":0.00043250786,"about_ca_topic_score_gemma":0.0005801093,"teacher_disagreement_score":0.7247578,"about_ca_system_score_codex":0.0000971893,"about_ca_system_score_gemma":0.00004982159,"threshold_uncertainty_score":0.99942815},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11164049,0.00007435884,0.884664,0.00018892935,0.002089403,0.0004070255,0.00000980345,0.00039686353,0.0005291089],"genre_scores_gemma":[0.89821285,8.95596e-7,0.10032061,0.000028468372,0.00013636371,0.00013551231,0.00006001715,0.000010756313,0.0010945143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979137,0.000057785423,0.00024301535,0.00075648836,0.0004606607,0.00056830444],"domain_scores_gemma":[0.9978714,0.00006590648,0.00035298688,0.001256105,0.00030352134,0.00015007815],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020954213,0.00014256545,0.00015765097,0.00015767799,0.0038449452,0.005461483,0.0013043819,0.00007339145,0.0000013492129],"category_scores_gemma":[0.0003604941,0.00014407076,0.00014810183,0.0002357288,0.0001107327,0.0018710411,0.00018055929,0.00013661815,0.0000066618672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019234414,0.00077209173,0.07744761,0.000092534276,0.00013055479,0.000010651907,0.0028014765,0.0005698482,0.008251264,0.060842022,0.0019537685,0.84710896],"study_design_scores_gemma":[0.0016915634,0.00025712795,0.0076601095,0.00014344224,0.00007845774,0.000012738878,0.0011553067,0.9445576,0.0033286281,0.0052891723,0.034705903,0.0011199216],"about_ca_topic_score_codex":0.00010822928,"about_ca_topic_score_gemma":0.000043114203,"teacher_disagreement_score":0.9439878,"about_ca_system_score_codex":0.00010057106,"about_ca_system_score_gemma":0.00008044378,"threshold_uncertainty_score":0.9974519},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22173654,0.000021216922,0.7766136,0.0002802827,0.00084945135,0.00012769586,0.00017744084,0.00014957001,0.000044183555],"genre_scores_gemma":[0.98738104,0.0000075335133,0.012221237,0.00028053953,0.00003964369,0.0000031112863,0.00004583355,0.000012769097,0.000008303828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982035,0.00007607814,0.00036415836,0.0006408547,0.0003937887,0.00032160035],"domain_scores_gemma":[0.9958115,0.00020664505,0.00037534657,0.003403586,0.00009318159,0.000109697874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037379988,0.00021092514,0.00025813616,0.00014743114,0.00086588267,0.0004381707,0.0039977925,0.00008840891,0.0000071684653],"category_scores_gemma":[0.0000064005985,0.00021449444,0.00011144889,0.00019275221,0.00008296443,0.00081094826,0.000072614836,0.00034319155,0.000011471716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003430444,0.002060869,0.016260536,0.00087233266,0.00087473984,0.00009531481,0.0020080472,0.8556064,0.0041431305,0.0010517264,0.00034916773,0.1163347],"study_design_scores_gemma":[0.00059660245,0.00007217789,0.0032574064,0.00055218424,0.000040984814,0.000002873105,0.00011738015,0.99337316,0.00160885,0.000040187195,0.000113438706,0.0002247576],"about_ca_topic_score_codex":0.00088948355,"about_ca_topic_score_gemma":0.0002299227,"teacher_disagreement_score":0.7656445,"about_ca_system_score_codex":0.00003215876,"about_ca_system_score_gemma":0.000046488807,"threshold_uncertainty_score":0.87468296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815302,0.0026521296,0.0040674605,0.0077620395,0.00036836707,0.0004883464,0.0009484222,0.000056748006,0.0021262695],"genre_scores_gemma":[0.9938866,0.0006523757,0.0010610422,0.00039254772,0.00016448059,0.000015807478,0.000038875693,0.000030027973,0.003758233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972163,0.000073154246,0.00074711075,0.0007415948,0.0006386164,0.00058325194],"domain_scores_gemma":[0.97330564,0.00031063164,0.0011203338,0.0006414589,0.024374727,0.0002472287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0010004827,0.00039619842,0.00059954193,0.00014255739,0.00026122655,0.0078041544,0.003742591,0.000245528,0.000023654928],"category_scores_gemma":[0.0048841643,0.00035580967,0.00011550661,0.0003814936,0.0005736237,0.022969048,0.0024361757,0.0005139153,0.000011337164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051797874,0.0013242267,0.10198945,0.0047747046,0.0009768452,0.000015002897,0.16481929,0.00041039294,0.10318233,0.060125712,0.18760054,0.37426353],"study_design_scores_gemma":[0.00082227803,0.00037753326,0.016626842,0.0019056008,0.00026498706,0.00008820687,0.0023227187,0.86620235,0.0026590663,0.002620181,0.10530777,0.00080247084],"about_ca_topic_score_codex":0.0017367649,"about_ca_topic_score_gemma":0.0000057370858,"teacher_disagreement_score":0.865792,"about_ca_system_score_codex":0.000047226047,"about_ca_system_score_gemma":0.00017977449,"threshold_uncertainty_score":0.9998894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042515406,0.0002906024,0.98690516,0.0003515718,0.0038998115,0.00084948126,0.000110518675,0.0004922481,0.0028490815],"genre_scores_gemma":[0.9603063,0.000032603013,0.036825653,0.0011846386,0.0004867022,0.00004782753,0.0002938824,0.00003473571,0.0007876878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722445,0.00019797214,0.00037283858,0.0013626147,0.00035250766,0.00048961595],"domain_scores_gemma":[0.99304813,0.00093978475,0.00037567932,0.0053884704,0.00011349649,0.00013442826],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001981309,0.00035490724,0.00047627033,0.00013150275,0.00034827722,0.0010798197,0.006715808,0.00020699597,0.000015417661],"category_scores_gemma":[0.0003221676,0.00031667057,0.00024769548,0.000042208703,0.000053329197,0.00021304945,0.0044360487,0.0005077983,0.000030100586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050456,0.0006930083,0.0003948127,0.0007631981,0.00046451748,0.00007924959,0.00096398435,0.11185199,0.00050167297,0.16103,0.04592517,0.67682785],"study_design_scores_gemma":[0.00074822124,0.000060297145,0.00003272623,0.0003923843,0.000033400487,0.0000024002113,0.000014875884,0.9851317,0.00016105414,0.0062765055,0.006738362,0.00040810017],"about_ca_topic_score_codex":0.00011439012,"about_ca_topic_score_gemma":0.000008068177,"teacher_disagreement_score":0.95605475,"about_ca_system_score_codex":0.00008269657,"about_ca_system_score_gemma":0.0002618816,"threshold_uncertainty_score":0.99995714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37947035,0.00014451503,0.6195581,0.00036013254,0.00019867098,0.00009862004,0.0000014360328,0.00011445095,0.000053744487],"genre_scores_gemma":[0.99517936,0.00021528134,0.00440808,0.000053826323,0.000009551182,0.000028034756,6.059319e-7,0.000012231023,0.00009303021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887466,0.00004328841,0.00027682725,0.00041386674,0.00013408173,0.00025725344],"domain_scores_gemma":[0.9987735,0.00004935418,0.00015114057,0.0008855936,0.000099761586,0.00004065594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002248314,0.00015793208,0.00024784505,0.00043351797,0.00041668542,0.00013588437,0.0006659706,0.00031981856,0.000005303012],"category_scores_gemma":[0.000017291015,0.00015847968,0.0000745546,0.0002585323,0.00020316907,0.0004759359,0.000019152803,0.00046369567,0.00000301756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034967106,0.00011982355,0.0019309007,0.000014842927,0.00004371768,0.00005033483,0.00008033513,0.9373514,0.0054567135,0.00076512224,0.0000049838613,0.05414686],"study_design_scores_gemma":[0.00086065906,0.0001124661,0.0011197546,0.000090266134,0.000018680592,0.000045250297,0.000034807166,0.9866963,0.010638156,0.00017357836,0.00002348773,0.00018661637],"about_ca_topic_score_codex":0.00028364494,"about_ca_topic_score_gemma":0.00009444312,"teacher_disagreement_score":0.615709,"about_ca_system_score_codex":0.000051328843,"about_ca_system_score_gemma":0.00002900073,"threshold_uncertainty_score":0.6462614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98383915,0.0000068801087,0.0020613417,0.00047751327,0.00031906276,0.00011816074,8.5106166e-7,0.0000041921526,0.013172827],"genre_scores_gemma":[0.9886272,0.0000016570214,0.010262818,0.000036087127,0.000038743507,0.000009345094,0.0000024065364,0.0000036244712,0.001018095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935037,0.000018654819,0.00014821424,0.0002144408,0.00011533827,0.00015295665],"domain_scores_gemma":[0.99959064,0.00004341339,0.00004785058,0.00025328857,0.000029337625,0.000035456622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044649257,0.000066465385,0.000086371336,0.00008778815,0.00008306796,0.0004270291,0.0007716814,0.000036187528,0.000045678797],"category_scores_gemma":[0.0000345317,0.00006396746,0.000030795047,0.00013491936,0.000018639756,0.0008584831,0.00021900979,0.00017617937,0.000119625794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005237209,0.000052573305,0.00016244638,0.0000022082083,0.0000032668936,0.00002552546,0.00368335,0.00018838383,0.014784888,0.0010410871,0.00006286756,0.97998816],"study_design_scores_gemma":[0.0022160998,0.0002565482,0.015391244,0.0002648357,0.000014506574,0.00015116051,0.005050298,0.9313819,0.028895209,0.0007160431,0.014698423,0.0009637381],"about_ca_topic_score_codex":0.000089041576,"about_ca_topic_score_gemma":0.00046107415,"teacher_disagreement_score":0.9790244,"about_ca_system_score_codex":0.000016210024,"about_ca_system_score_gemma":0.000054968637,"threshold_uncertainty_score":0.41178513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110549,0.00018059908,0.88634217,0.0016729397,0.00014198464,0.00019098593,7.702176e-7,0.00021559378,0.0007059383],"genre_scores_gemma":[0.983025,0.000056596582,0.015831131,0.0002813917,0.000047736627,0.00003157952,0.0000037294399,0.000009594979,0.00071324484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991241,0.00006754371,0.00017360297,0.00026184635,0.00014717432,0.00022572099],"domain_scores_gemma":[0.99885,0.00024965414,0.00009700903,0.0006154238,0.00012524173,0.000062682324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034496866,0.00010916642,0.0001116103,0.00005948212,0.00030128722,0.00012516182,0.00046132933,0.000052216565,0.000002369848],"category_scores_gemma":[0.000021792828,0.000067355904,0.000056898167,0.00012168071,0.000030499003,0.00050847314,0.0001050753,0.00009698349,0.0000050594326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003013386,0.000311777,0.018284671,0.000048123267,0.0002904664,0.0000139060285,0.0006770083,0.0071650986,0.22402012,0.5700286,0.00622353,0.17263533],"study_design_scores_gemma":[0.0030681158,0.00034395474,0.0013099059,0.00031679263,0.000030264668,0.000019193356,0.00032157954,0.98575133,0.004841657,0.0016613448,0.0017742012,0.00056163286],"about_ca_topic_score_codex":0.0004264707,"about_ca_topic_score_gemma":0.000075123964,"teacher_disagreement_score":0.97858626,"about_ca_system_score_codex":0.00009492592,"about_ca_system_score_gemma":0.000029632807,"threshold_uncertainty_score":0.2746694},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03667513,0.000051509272,0.9521501,0.0016578988,0.00056430197,0.0011299312,0.000004446405,0.00010805268,0.0076586492],"genre_scores_gemma":[0.98821175,0.0000075489065,0.010428241,0.0001480574,0.00006490321,0.00008120864,0.00000797299,0.000004676359,0.0010456489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988579,0.00003231926,0.00013733725,0.00062690297,0.000117291944,0.00022823113],"domain_scores_gemma":[0.9971031,0.000043415395,0.00007141971,0.0027162372,0.000029789093,0.000036070465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008917841,0.00008889498,0.00011060514,0.000038506896,0.00027246005,0.0003459475,0.0023250666,0.000027313481,0.0000014984645],"category_scores_gemma":[0.00007236586,0.00007476902,0.000028632365,0.000038989263,0.000024984258,0.0009848686,0.0015100528,0.0001107467,0.0000029583068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010081802,0.0005381313,0.007858426,0.0000685876,0.0001694338,0.00003177482,0.00047343207,0.005468701,0.00008118321,0.03617012,0.0045513576,0.94448805],"study_design_scores_gemma":[0.000451086,0.000021005879,0.02896603,0.000017637358,0.000007566769,0.0000012532263,0.000034931716,0.9685189,0.000030982872,0.00091467076,0.00090040517,0.00013554246],"about_ca_topic_score_codex":0.00050250965,"about_ca_topic_score_gemma":0.000289362,"teacher_disagreement_score":0.9630502,"about_ca_system_score_codex":0.00004303373,"about_ca_system_score_gemma":0.00001740139,"threshold_uncertainty_score":0.4320591},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52293277,0.000017234905,0.47601798,0.00007043246,0.00006374279,0.000023423194,3.4884917e-7,0.000020629177,0.00085343665],"genre_scores_gemma":[0.9992618,0.000010262904,0.00056748727,0.00013084375,0.000008494732,0.000001062309,0.0000041104995,8.409904e-7,0.000015121326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994614,0.000028481589,0.0001776693,0.00009340646,0.00012916958,0.000109888795],"domain_scores_gemma":[0.999063,0.00002239801,0.00012185868,0.00071329204,0.00004263318,0.000036793474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030617407,0.00004771828,0.0001292207,0.00030768212,0.00011452004,0.00026014762,0.0007896155,0.000028744234,0.0000048665524],"category_scores_gemma":[0.000023136901,0.000041548723,0.00006877518,0.00028357893,0.000011869908,0.0016878092,0.00007869683,0.00007093305,0.000002885351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029129333,0.000038758757,0.26387277,0.0000027117944,0.00008758841,0.0000049094892,0.0004881338,0.6926325,0.00003286234,0.012159288,0.000026036523,0.030651532],"study_design_scores_gemma":[0.00009396184,0.000007685165,0.21292901,0.0000033187305,0.000019310784,2.798476e-7,0.000019251142,0.78682995,0.000008378411,0.000019597172,0.000026928112,0.000042318752],"about_ca_topic_score_codex":0.002514064,"about_ca_topic_score_gemma":0.00033609863,"teacher_disagreement_score":0.476329,"about_ca_system_score_codex":0.000016519703,"about_ca_system_score_gemma":0.000012507874,"threshold_uncertainty_score":0.38005295},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7471667,0.000025463154,0.23003882,0.00058616116,0.00042475108,0.00011267574,8.0300026e-7,0.000049746763,0.021594869],"genre_scores_gemma":[0.9988453,0.000016565726,0.00014193995,0.0007575728,0.000027432952,0.000003088043,3.4972288e-7,0.000001606252,0.00020618663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994324,0.000023026963,0.00013724194,0.000084369145,0.00019080272,0.00013216658],"domain_scores_gemma":[0.99893963,0.00014479204,0.00016572862,0.0006712758,0.00005241884,0.000026152687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002769419,0.00006841846,0.00007445536,0.000041567153,0.0004457674,0.0002302131,0.0009440188,0.000024963061,0.00001388293],"category_scores_gemma":[0.00005961104,0.00004139743,0.00004753277,0.000055701457,0.00003261353,0.0012821109,0.00022694483,0.0001386559,0.00003187332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070458824,0.00006321105,0.012265644,0.00001344493,0.00006513946,0.0000025565976,0.0010608102,0.08400121,0.000042413994,0.7803773,0.01029338,0.11174439],"study_design_scores_gemma":[0.00014679735,0.000059191338,0.019294897,0.000028902403,0.0000022286788,0.0000013729508,0.000015639616,0.9799545,0.00007442791,0.000121901045,0.00023658486,0.00006355627],"about_ca_topic_score_codex":0.00025075822,"about_ca_topic_score_gemma":0.000006729765,"teacher_disagreement_score":0.8959533,"about_ca_system_score_codex":0.000017365097,"about_ca_system_score_gemma":0.000021241136,"threshold_uncertainty_score":0.34285274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054584075,0.00001725874,0.9408147,0.0035479455,0.00040449982,0.00031627866,0.00001568048,0.00017347552,0.00012610946],"genre_scores_gemma":[0.98235536,0.0000017088977,0.016421847,0.0008937428,0.000086966895,0.000037987582,0.000075392076,0.0000062384865,0.000120731675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990891,0.000037703372,0.00014441732,0.0005003584,0.00012083473,0.00010753779],"domain_scores_gemma":[0.99781334,0.00004197465,0.00017330737,0.0017420021,0.00018409138,0.000045277167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054075767,0.00008121397,0.00009551168,0.000036079975,0.00055913854,0.00064188166,0.0008217479,0.000049315215,3.5614963e-7],"category_scores_gemma":[0.000039756233,0.00007559877,0.000014821817,0.000044299504,0.000009399481,0.0006496925,0.00019429011,0.000056149405,0.0000040720315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011940383,0.0001590118,0.0008586524,0.00033214348,0.000074889846,0.0000025048712,0.00036409692,0.0012556078,0.27412936,0.71313685,0.0029005625,0.006666907],"study_design_scores_gemma":[0.0004017972,0.000039908045,0.00019342588,0.000036817946,0.000014589315,0.000016800604,0.000014058753,0.9923599,0.0056145284,0.0011012544,0.0001044277,0.00010254257],"about_ca_topic_score_codex":0.0028282795,"about_ca_topic_score_gemma":0.00024044972,"teacher_disagreement_score":0.99110425,"about_ca_system_score_codex":0.000028806016,"about_ca_system_score_gemma":0.000037984082,"threshold_uncertainty_score":0.61896795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6693217,0.00016563211,0.32900706,0.0001012944,0.00052261044,0.00011876055,0.0000021095914,0.00007224561,0.00068859226],"genre_scores_gemma":[0.99319077,0.000009762975,0.006514823,0.00012620058,0.000115677256,0.0000012175857,0.0000021248638,0.000008332797,0.00003108477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984762,0.00007621181,0.0002531113,0.000637251,0.00023683914,0.0003203777],"domain_scores_gemma":[0.9978927,0.000084400934,0.00015722969,0.0017544633,0.000028284876,0.00008292009],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011154861,0.00014613698,0.00020217622,0.00010869908,0.0007437153,0.0021410252,0.0033929828,0.00004458003,0.0000017993566],"category_scores_gemma":[0.00011608679,0.00013225553,0.000027391641,0.000081188155,0.000046148107,0.0013317456,0.00679259,0.0002457162,0.0000015685675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029344543,0.00027310423,0.07456972,0.00013404015,0.000056482917,0.00017919847,0.0056951684,0.28342855,0.0053045265,0.007428367,0.0001761314,0.62272537],"study_design_scores_gemma":[0.0002978369,0.000012722402,0.019774871,0.000112327565,0.000004725083,0.00002707735,0.000059269674,0.97928256,0.0000931112,0.00009518404,0.0000615794,0.00017872066],"about_ca_topic_score_codex":0.007054971,"about_ca_topic_score_gemma":0.00018332785,"teacher_disagreement_score":0.695854,"about_ca_system_score_codex":0.000049233226,"about_ca_system_score_gemma":0.0000673999,"threshold_uncertainty_score":0.99955714},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45605004,0.00014190939,0.5407619,0.0009907603,0.0005257655,0.00024888446,0.000002011592,0.00011170185,0.0011670284],"genre_scores_gemma":[0.9953215,0.000010191373,0.0040374165,0.00025971976,0.000098028235,0.000026620792,0.0000012835281,0.00000715962,0.000238079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990425,0.000050089457,0.00016930654,0.00033316293,0.000106701365,0.00029824546],"domain_scores_gemma":[0.9991291,0.00016098504,0.00007480247,0.00051586755,0.000045543366,0.00007368586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003208066,0.00011008866,0.00016505981,0.00007160465,0.00047913936,0.00052559684,0.0008786741,0.000059489445,0.0000018688613],"category_scores_gemma":[0.00008719825,0.00009903691,0.000070200666,0.00007140267,0.00003754798,0.00037262132,0.00018611766,0.00016234037,0.0000035386279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011618165,0.00018339258,0.0026525895,0.000020329564,0.000069291134,0.00016617084,0.001800272,0.62973666,0.000907863,0.045529954,0.001163314,0.31765398],"study_design_scores_gemma":[0.00047721405,0.00006443734,0.0006372434,0.000024744551,0.0000023702926,0.000010557265,0.00001683742,0.9978842,0.00008415406,0.00031582994,0.00033757323,0.00014484394],"about_ca_topic_score_codex":0.00006768732,"about_ca_topic_score_gemma":0.00038048328,"teacher_disagreement_score":0.5392715,"about_ca_system_score_codex":0.000041429277,"about_ca_system_score_gemma":0.00004640264,"threshold_uncertainty_score":0.5068342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34130347,0.0002105736,0.6562197,0.000048077498,0.0002976018,0.00029290825,3.3393954e-7,0.00025389518,0.0013734103],"genre_scores_gemma":[0.9865109,0.000013997172,0.012156268,0.00016605997,0.00008932859,0.00011161524,0.0000016601446,0.000017441505,0.00093273184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842066,0.00005489568,0.00026275488,0.00055349176,0.00024825844,0.00045992457],"domain_scores_gemma":[0.99838257,0.00016353985,0.00016365347,0.00112556,0.00005953328,0.00010515762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005673856,0.0002012783,0.00025633068,0.000112037254,0.00069943303,0.00083912193,0.0011528047,0.000073569405,0.0000114263985],"category_scores_gemma":[0.00007991672,0.00015533449,0.000063331616,0.00012278208,0.000045349447,0.0010755126,0.0005144876,0.00034390634,0.000018239625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013186231,0.00043412964,0.131184,0.0000855943,0.000080221216,0.00044574845,0.0030341865,0.35888517,0.0040527773,0.004835581,0.0006462216,0.49618453],"study_design_scores_gemma":[0.0023793257,0.0008294603,0.014862235,0.0007842127,0.000018143986,0.000080011014,0.00028723254,0.9761407,0.0020146314,0.000315785,0.0011828039,0.0011054693],"about_ca_topic_score_codex":0.001437908,"about_ca_topic_score_gemma":0.0010074842,"teacher_disagreement_score":0.64520746,"about_ca_system_score_codex":0.00006482024,"about_ca_system_score_gemma":0.00009153563,"threshold_uncertainty_score":0.8091672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07783155,0.00012575457,0.9176924,0.0019647246,0.0007545019,0.00038246546,0.000028422812,0.00081359694,0.00040654026],"genre_scores_gemma":[0.9920963,0.0005199292,0.006100062,0.00034044014,0.00007054387,0.00024664483,0.000014918622,0.00007528181,0.00053589884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971265,0.00032380794,0.00058348,0.00077770243,0.0005028545,0.00068566186],"domain_scores_gemma":[0.9903411,0.000713434,0.00046698004,0.007883457,0.0003153539,0.00027966365],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00049491203,0.00049373624,0.00053184154,0.00027800817,0.0058538197,0.0010921364,0.0061524934,0.00022779524,0.000010366587],"category_scores_gemma":[0.000013241059,0.00048062814,0.00026729534,0.00039026947,0.00044641487,0.0014333456,0.00010607198,0.0014105575,0.000060612663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031036578,0.0031774838,0.001849904,0.00017984406,0.0010586703,0.000107273016,0.004278994,0.116397284,0.011806563,0.021727921,0.0004673466,0.83863837],"study_design_scores_gemma":[0.0021129467,0.00030438707,0.0013080222,0.0011164187,0.00018692522,0.0001190503,0.00031852574,0.98438907,0.007870041,0.00018472942,0.0005438699,0.0015459992],"about_ca_topic_score_codex":0.0014790328,"about_ca_topic_score_gemma":0.0047983434,"teacher_disagreement_score":0.91426474,"about_ca_system_score_codex":0.00020632181,"about_ca_system_score_gemma":0.00024699804,"threshold_uncertainty_score":0.9999448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08931654,0.017264051,0.88778347,0.0034736989,0.00044651725,0.00031990386,0.0000047210074,0.000105851126,0.0012852612],"genre_scores_gemma":[0.99211425,0.0029829517,0.004716672,0.000090673115,0.00004035506,0.000018884388,0.0000127227795,0.0000069090693,0.000016615844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897224,0.00012564432,0.00030651226,0.00026698064,0.00010716886,0.00022148246],"domain_scores_gemma":[0.99746203,0.00016333791,0.00018383963,0.0020551446,0.000066861394,0.000068760026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054449885,0.0001358471,0.00022668172,0.00009453466,0.00065439125,0.00027259655,0.0013363807,0.000080004866,3.377871e-7],"category_scores_gemma":[0.000008528662,0.00013880589,0.0000448915,0.00011729342,0.00014670721,0.00024075372,0.00092679745,0.00024303107,4.258124e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014453325,0.0009758203,0.13193291,0.00019471164,0.00029550336,0.0000387446,0.0038352434,0.3277594,0.030641172,0.019736206,0.00020963978,0.48423612],"study_design_scores_gemma":[0.0005286272,0.000035153218,0.00027948545,0.00018469871,0.000014964215,0.0000022464676,0.000025054314,0.9982968,0.000046868554,0.00015543938,0.00028302043,0.00014762075],"about_ca_topic_score_codex":0.0004841715,"about_ca_topic_score_gemma":0.00014473405,"teacher_disagreement_score":0.9027977,"about_ca_system_score_codex":0.000022970946,"about_ca_system_score_gemma":0.000031401665,"threshold_uncertainty_score":0.566034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7889717,0.000014067879,0.19868912,0.0009859188,0.0001829321,0.000101738486,0.00001286609,0.00003629557,0.01100536],"genre_scores_gemma":[0.999341,0.0000050935,0.0001639597,0.000043166696,0.000011870278,0.0000037895757,0.0000029591656,0.00000121811,0.00042695514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995415,0.00002690132,0.00009661473,0.00014790522,0.00009304012,0.00009402817],"domain_scores_gemma":[0.99940157,0.00003710191,0.00006676737,0.0003996467,0.00007124229,0.000023656092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010684891,0.000050514664,0.00009260234,0.000023239474,0.000108776854,0.00008121035,0.00048268682,0.00002458659,0.0000061168234],"category_scores_gemma":[0.0001009677,0.000041558287,0.000029144581,0.000045812805,0.00004150866,0.00050053943,0.00016676598,0.00006898677,0.000013035963],"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.00013309653,0.0005726149,0.036574997,0.000022924687,0.00008006266,0.00007159489,0.0033204379,0.0004708086,0.03690425,0.64845204,0.0039675613,0.26942962],"study_design_scores_gemma":[0.0021045513,0.00034593788,0.69434357,0.00014624285,0.000009935385,0.0000125976485,0.00043179913,0.19429703,0.102788195,0.0035896166,0.0014319902,0.0004985515],"about_ca_topic_score_codex":0.0008892513,"about_ca_topic_score_gemma":0.00020688499,"teacher_disagreement_score":0.65776855,"about_ca_system_score_codex":0.000030901956,"about_ca_system_score_gemma":0.000033224092,"threshold_uncertainty_score":0.16946977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22261372,0.000028033877,0.77567065,0.00017935447,0.00054636155,0.00071772706,0.000010266667,0.00015532681,0.00007857595],"genre_scores_gemma":[0.994805,0.000019668627,0.0047863545,0.00011472276,0.00007649204,0.0001173075,0.0000016230102,0.000024031373,0.000054812528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829894,0.0000617819,0.00030014248,0.00077685475,0.0001953319,0.00036696743],"domain_scores_gemma":[0.9989777,0.000076018485,0.0002455216,0.00045669323,0.00012889026,0.00011514987],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005422694,0.0002609216,0.00029189218,0.00016593226,0.0029576684,0.0009015522,0.0005228788,0.000082871156,7.0389655e-7],"category_scores_gemma":[0.0000054085153,0.0002605785,0.000113094786,0.000059447317,0.0000679293,0.0007210392,0.000052447594,0.00036549353,9.0654015e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009562194,0.0004218447,0.00007353216,0.00021948817,0.0004887441,0.00004007421,0.017691806,0.006943555,0.008107212,0.016790336,0.0000074831178,0.9491203],"study_design_scores_gemma":[0.0009756391,0.00037040966,0.0004138273,0.00026859954,0.0000478724,0.000015554293,0.00332162,0.9891779,0.003781088,0.0012684431,0.00000697503,0.0003520925],"about_ca_topic_score_codex":0.00018803288,"about_ca_topic_score_gemma":0.000032647895,"teacher_disagreement_score":0.9822343,"about_ca_system_score_codex":0.00010930616,"about_ca_system_score_gemma":0.000017426024,"threshold_uncertainty_score":0.9999846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0934509,0.00009982314,0.9010855,0.0013979629,0.00048815474,0.0003508198,0.00008323846,0.00058237114,0.002461242],"genre_scores_gemma":[0.9871723,0.00017560452,0.010875606,0.00040131412,0.000009397058,0.0000895608,0.00002133156,0.000022246579,0.0012326459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984588,0.00025718022,0.00033611356,0.00036305367,0.00026369526,0.00032114954],"domain_scores_gemma":[0.9961157,0.00058270444,0.00012240396,0.0029624687,0.00010050201,0.00011626497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024746326,0.0001907657,0.00023930067,0.00017166806,0.0006718072,0.0002027812,0.0021420042,0.00008271116,0.00019962441],"category_scores_gemma":[0.000007199637,0.00019952831,0.00017624239,0.00041644936,0.000066916415,0.00049266324,0.000023927734,0.0005772114,0.00045914046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023263828,0.004698556,0.002624785,0.00018512098,0.0009854122,0.000017150804,0.010742433,0.12416156,0.15469177,0.08555522,0.004734535,0.6113708],"study_design_scores_gemma":[0.0012315944,0.00008687395,0.0003435646,0.0002484097,0.00003953678,0.000030248073,0.00022099851,0.98637885,0.0053280895,0.00023657412,0.0053078365,0.00054742803],"about_ca_topic_score_codex":0.0003502906,"about_ca_topic_score_gemma":0.00016083334,"teacher_disagreement_score":0.8937214,"about_ca_system_score_codex":0.00010198865,"about_ca_system_score_gemma":0.00008909122,"threshold_uncertainty_score":0.8136529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25286302,0.0004286013,0.7453124,0.00043618202,0.000117286996,0.00029325968,0.000006964995,0.0001473718,0.00039492964],"genre_scores_gemma":[0.98829406,0.000006117932,0.011075369,0.00025644433,0.00026533083,0.000028750168,0.0000013597911,0.00000959405,0.00006296164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.00005362173,0.00016112316,0.0004040381,0.00009513384,0.00022968685],"domain_scores_gemma":[0.9987995,0.0002915679,0.00017778997,0.0006048718,0.000059644895,0.000066643246],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003905912,0.00011990885,0.00013401292,0.00003758954,0.0024148703,0.00045375887,0.0006512318,0.00003639748,2.0309568e-7],"category_scores_gemma":[0.000051045026,0.00011461741,0.00006138133,0.000044757384,0.00006421888,0.000300815,0.0003357333,0.00016152419,0.0000015031345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023216815,0.00005152213,0.0017901763,0.000029857429,0.000023605257,0.0000022475758,0.00045331148,0.0061266636,0.008475455,0.33855283,0.0001565315,0.6443146],"study_design_scores_gemma":[0.00024641264,0.000026632022,0.0024929938,0.000044900673,0.000011803806,0.000017357315,0.00003381238,0.98792845,0.00009040729,0.0069420966,0.0020061375,0.00015897765],"about_ca_topic_score_codex":0.000054575485,"about_ca_topic_score_gemma":0.000005850153,"teacher_disagreement_score":0.9818018,"about_ca_system_score_codex":0.000018394707,"about_ca_system_score_gemma":0.00002898975,"threshold_uncertainty_score":0.99888384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10525008,0.000009140194,0.8908471,0.0026628019,0.00024044442,0.00010950181,0.000012652646,0.00009273959,0.000775566],"genre_scores_gemma":[0.995949,0.0000014421789,0.0026442478,0.00012992362,0.000056655867,0.000014203163,0.000018101213,0.000002728678,0.0011837016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945474,0.0000132590185,0.000068638605,0.00019651573,0.00009578861,0.00017105453],"domain_scores_gemma":[0.9991405,0.000053963486,0.000032572752,0.0006555079,0.00006422866,0.000053223248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020125945,0.000056301607,0.00006211722,0.000014821278,0.00049130386,0.00046708668,0.0008088741,0.00002606738,0.0000040322643],"category_scores_gemma":[0.000046783047,0.000045689932,0.00007217358,0.000017899036,0.00002890322,0.00018804499,0.00013210227,0.000047452984,0.00002095894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008457357,0.00029312636,0.03240229,0.000068202346,0.00004455239,0.000025328121,0.00013199124,0.00020637922,0.008740204,0.36017552,0.008176206,0.58965164],"study_design_scores_gemma":[0.0013099156,0.00017581016,0.06403529,0.000034541903,0.00000925658,0.0000038134424,0.000009545385,0.9193772,0.00999386,0.0016233968,0.0031347221,0.00029261824],"about_ca_topic_score_codex":0.00013188263,"about_ca_topic_score_gemma":0.000033934193,"teacher_disagreement_score":0.91917086,"about_ca_system_score_codex":0.000022223921,"about_ca_system_score_gemma":0.00003955034,"threshold_uncertainty_score":0.45041275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4504146,0.00006346127,0.548266,0.000029157123,0.00037873044,0.00017336909,0.000003899849,0.00016543208,0.00050537713],"genre_scores_gemma":[0.9976192,0.00008333319,0.00024678215,0.000026030431,0.00003548312,0.0000026469377,0.000041656334,0.00001512699,0.0019297139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985463,0.0000935252,0.00012498515,0.0008903855,0.00010399696,0.00024080792],"domain_scores_gemma":[0.9977763,0.000041444644,0.00034158654,0.0015597786,0.00018524508,0.00009563805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015326585,0.00025684375,0.00023753585,0.00020167789,0.00038932567,0.00034751478,0.0016082296,0.00017497099,0.000004197967],"category_scores_gemma":[0.00001492133,0.00026533502,0.00011186081,0.00015419228,0.00006228681,0.0005756385,0.0010182441,0.00049956684,0.000043918237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005489168,0.00017569473,0.007032833,0.00016588841,0.00018555508,0.00020535493,0.00050881965,0.9550964,0.00020772776,0.02995071,0.00008997344,0.0063261525],"study_design_scores_gemma":[0.00036956518,0.00005987661,0.006194521,0.000200354,0.00007166275,0.000005445277,0.000038129547,0.9887792,0.000022946464,0.0038296038,0.00005551821,0.00037321425],"about_ca_topic_score_codex":0.00051425217,"about_ca_topic_score_gemma":0.00024930172,"teacher_disagreement_score":0.5480192,"about_ca_system_score_codex":0.00026189905,"about_ca_system_score_gemma":0.00017291668,"threshold_uncertainty_score":0.9999799},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26589108,0.00014744904,0.7268995,0.0006802452,0.0053766123,0.00065635797,0.00006009851,0.0001422015,0.00014645113],"genre_scores_gemma":[0.99603206,0.00002451898,0.00042496357,0.0023976665,0.00040173111,0.00014055672,0.000026303798,0.000021221147,0.00053097244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793226,0.00012885773,0.00035558434,0.0006651684,0.00039520464,0.00052291097],"domain_scores_gemma":[0.9970827,0.00050153624,0.0003467752,0.0015005304,0.00038900526,0.00017941507],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009800184,0.00027446172,0.00034308218,0.000092215065,0.00076207466,0.0015910523,0.0028461502,0.00010229226,0.0000047167528],"category_scores_gemma":[0.00015229346,0.00023985746,0.00021346517,0.00007106427,0.00007637495,0.0006458043,0.00030579997,0.0001601207,0.000019479701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005055669,0.0034423552,0.15187149,0.0002080239,0.0012950867,0.00042731312,0.0004464719,0.17811464,0.004668724,0.0071884766,0.19609714,0.45118463],"study_design_scores_gemma":[0.003837958,0.0005437103,0.097061925,0.00016155856,0.000027678345,0.000002300717,0.000012179162,0.8937047,0.0030707798,0.000057044163,0.0009452473,0.00057489995],"about_ca_topic_score_codex":0.0033352906,"about_ca_topic_score_gemma":0.0005767656,"teacher_disagreement_score":0.730141,"about_ca_system_score_codex":0.000114745024,"about_ca_system_score_gemma":0.0000947316,"threshold_uncertainty_score":0.9994454},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32207453,0.0001885693,0.67510074,0.0000625356,0.0014672964,0.00028230133,0.000025375071,0.00021306034,0.0005855674],"genre_scores_gemma":[0.996572,0.00027706832,0.00026025908,0.00014221837,0.00021040287,0.000003587079,0.000016645765,0.000023056155,0.0024947375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980808,0.00007477504,0.00017118616,0.0011683429,0.00007138825,0.00043352443],"domain_scores_gemma":[0.997182,0.00011086526,0.00033305772,0.0020294937,0.00019010181,0.00015449166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020808958,0.00033027958,0.00038489446,0.00011931011,0.00042696914,0.00034168517,0.0030315146,0.0003286533,0.0000029758316],"category_scores_gemma":[0.000020921041,0.00038580326,0.00040837578,0.0001024716,0.00009852667,0.00031206707,0.0017593947,0.00048788873,0.000023947108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094647265,0.000111428446,0.004975057,0.00009310535,0.00023492007,0.0005476866,0.00010252241,0.9302691,0.00003358066,0.052303825,0.00096993113,0.010264147],"study_design_scores_gemma":[0.0005202724,0.00004216976,0.00062662474,0.00012695628,0.000039308557,0.000010877676,0.0000044298476,0.98861176,0.000036564325,0.008798709,0.0006765733,0.0005057593],"about_ca_topic_score_codex":0.00022373389,"about_ca_topic_score_gemma":0.000079818295,"teacher_disagreement_score":0.6748405,"about_ca_system_score_codex":0.00012320477,"about_ca_system_score_gemma":0.000114667746,"threshold_uncertainty_score":0.9998594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9302846,0.05376554,0.0087039,0.0023471145,0.0035890683,0.0006792264,0.000025658963,0.00010402075,0.00050084107],"genre_scores_gemma":[0.9796122,0.019647095,0.00038551854,0.000005406687,0.00025689937,0.000018350207,0.00001130056,0.000011738855,0.00005150754],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9897193,0.00871147,0.000553057,0.00038642003,0.00034183846,0.0002879286],"domain_scores_gemma":[0.9930986,0.0030806088,0.0003831808,0.0029455991,0.00042080253,0.00007120654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028702663,0.00014960933,0.0004293104,0.00024895405,0.00090076245,0.0006392931,0.002361483,0.000120230005,1.6760043e-7],"category_scores_gemma":[0.00086612365,0.00014941437,0.000028832894,0.00016455383,0.00043561825,0.00067940267,0.0013044737,0.0004332017,0.0000017032922],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006116624,0.000826353,0.17534582,0.0004860177,0.00023155744,0.000016130736,0.017341714,0.0003954562,0.016626712,0.39282206,0.00118262,0.3946644],"study_design_scores_gemma":[0.0013573391,0.00018063006,0.77613205,0.0017089712,0.00001577425,0.000019555873,0.0006064304,0.21308704,0.00023311883,0.0028856855,0.003130134,0.0006432688],"about_ca_topic_score_codex":0.048205774,"about_ca_topic_score_gemma":0.012755721,"teacher_disagreement_score":0.6007862,"about_ca_system_score_codex":0.00006112433,"about_ca_system_score_gemma":0.000085325555,"threshold_uncertainty_score":0.99478275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15472277,0.00013093228,0.8432886,0.00044968753,0.00035391125,0.0003169003,7.069723e-7,0.0006228576,0.000113619324],"genre_scores_gemma":[0.991275,0.000040874304,0.008306111,0.00011377283,0.000035186626,0.00006308472,0.0000035074186,0.000019995607,0.00014245957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856573,0.000057553596,0.00026737808,0.0005574242,0.00014846651,0.00040344935],"domain_scores_gemma":[0.9987761,0.00008514621,0.0002048205,0.0007479444,0.000116914234,0.000069117006],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00032162498,0.00022754988,0.00028224586,0.0003195386,0.0017545442,0.00029409924,0.0008287807,0.00025705242,0.0000010999296],"category_scores_gemma":[0.00003244776,0.00022089481,0.000113265065,0.00019327059,0.00017558396,0.00021373674,0.000021895545,0.00071117934,0.0000041316775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068523346,0.00018865874,0.0005775694,0.000059461116,0.00029286655,0.000029577426,0.00056665373,0.6059891,0.007093386,0.008081919,0.00004416468,0.3770081],"study_design_scores_gemma":[0.0009536198,0.00028034238,0.000054961918,0.00007420235,0.000034832712,0.00006642928,0.0001347904,0.9944767,0.0024702074,0.00027692816,0.0009251364,0.00025188172],"about_ca_topic_score_codex":0.00010349217,"about_ca_topic_score_gemma":0.000032261447,"teacher_disagreement_score":0.83655226,"about_ca_system_score_codex":0.00006562826,"about_ca_system_score_gemma":0.000033409502,"threshold_uncertainty_score":0.99954504},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12893301,0.00041668158,0.86391807,0.0057704225,0.00048242343,0.00028400644,0.000005416146,0.00012093323,0.00006906014],"genre_scores_gemma":[0.99017835,0.00028109326,0.0064614615,0.0027952169,0.0001449264,0.00007448227,0.000013487614,0.000018892386,0.000032112413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989254,0.0001268605,0.00024120584,0.00030841818,0.00011460306,0.00028354902],"domain_scores_gemma":[0.996584,0.00028458194,0.00018893041,0.00280754,0.00005293547,0.000081984566],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033745842,0.00015622292,0.0001737727,0.00005104203,0.0018532295,0.00066033076,0.002330296,0.00006619887,9.0032415e-7],"category_scores_gemma":[0.000031709977,0.00016636387,0.00009821111,0.000058074253,0.0001928002,0.0005056139,0.00031694185,0.00019075925,0.0000021987353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017498339,0.00065698964,0.042026695,0.00016600551,0.0008483218,0.000034379376,0.0065506613,0.48131683,0.062934324,0.111328945,0.04233201,0.25162986],"study_design_scores_gemma":[0.00054930366,0.000026628939,0.001947088,0.000070160255,0.000027856302,0.000013551075,0.000005477071,0.9931553,0.000081997016,0.00012498151,0.0037632342,0.00023444869],"about_ca_topic_score_codex":0.00018736198,"about_ca_topic_score_gemma":0.00023330869,"teacher_disagreement_score":0.86124533,"about_ca_system_score_codex":0.00003536062,"about_ca_system_score_gemma":0.000013223763,"threshold_uncertainty_score":0.9994462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90676534,0.00013190444,0.073701985,0.0027460076,0.0006289631,0.00011056733,0.0000011849013,0.0001672076,0.015746862],"genre_scores_gemma":[0.9948039,0.000012956352,0.0018506176,0.00029004266,0.00001767878,0.0000062784393,6.8527254e-7,0.000003895853,0.0030139366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992266,0.000025565536,0.000138533,0.0002634992,0.00013684355,0.00020892634],"domain_scores_gemma":[0.9990369,0.000032483927,0.000076482975,0.0007774436,0.00002804374,0.000048648144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016552105,0.00008784178,0.00013183363,0.000062260675,0.00021292843,0.0004708781,0.0010259232,0.000033240525,0.000008735166],"category_scores_gemma":[0.000052621115,0.0000730481,0.000052146548,0.000036138834,0.000037771744,0.0005434901,0.00026146628,0.00007798156,0.000045830435],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051347375,0.0003285624,0.13124946,0.000031310174,0.000051994695,0.00034132972,0.0014848512,0.00027953455,0.14717664,0.048378043,0.0014141101,0.6692128],"study_design_scores_gemma":[0.0008621572,0.000033495293,0.40993258,0.0001114652,0.000002495207,0.000011227003,0.000087250075,0.5872596,0.0005508296,0.00073602685,0.00018512303,0.00022773244],"about_ca_topic_score_codex":0.0010602665,"about_ca_topic_score_gemma":0.0015228882,"teacher_disagreement_score":0.66898507,"about_ca_system_score_codex":0.00004283287,"about_ca_system_score_gemma":0.000030131943,"threshold_uncertainty_score":0.4540688},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041383173,0.0002990491,0.9562796,0.000056055374,0.00058413245,0.000055363183,2.4884565e-7,0.000063251115,0.00127913],"genre_scores_gemma":[0.99823934,0.000015594673,0.0010666496,0.00019519356,0.00014731206,6.317106e-7,0.000002123564,0.0000043022164,0.0003288712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993749,0.000027999562,0.00014574599,0.00020286933,0.000103353465,0.00014508476],"domain_scores_gemma":[0.99932337,0.000057795645,0.00019052479,0.00034283585,0.00004867637,0.000036793303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757382,0.00007269022,0.000106681786,0.000017873945,0.0004031939,0.0002987844,0.00026335378,0.00004433346,0.0000020401214],"category_scores_gemma":[0.000030806394,0.00006578764,0.000028976381,0.000042092717,0.00003155028,0.00044408898,0.00020035914,0.00006399919,9.812709e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058922273,0.000064904954,0.04967652,0.000036656173,0.000072243456,0.0000035542582,0.00023316336,0.029161904,0.0055095716,0.067990676,0.01473034,0.83246154],"study_design_scores_gemma":[0.00030105456,0.00005805474,0.005770263,0.000024950477,0.00000749844,0.0000023422906,0.000006630584,0.9932215,0.00009232772,0.00022722657,0.0002029875,0.00008512375],"about_ca_topic_score_codex":0.00033397917,"about_ca_topic_score_gemma":0.000025812178,"teacher_disagreement_score":0.96405965,"about_ca_system_score_codex":0.000008073544,"about_ca_system_score_gemma":0.00000791104,"threshold_uncertainty_score":0.3101082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042731287,0.0006291771,0.99033636,0.0022030661,0.00036573148,0.0006157394,0.0000072719313,0.00023450116,0.0013350537],"genre_scores_gemma":[0.76645523,0.000025493282,0.23235326,0.00060950074,0.00013303832,0.00029053583,0.00006916008,0.000017525685,0.000046278878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982659,0.0003037198,0.00037409135,0.0005138744,0.00016563924,0.0003767536],"domain_scores_gemma":[0.99212784,0.0004035164,0.00023784896,0.0069596516,0.00013466747,0.00013648528],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079600094,0.00021148541,0.0002896154,0.0001573197,0.0014263676,0.0009689634,0.007803777,0.000108147346,0.0000013383709],"category_scores_gemma":[0.000035021425,0.00022252447,0.00014861213,0.00011021969,0.00014244442,0.00088046305,0.0010454422,0.00041199394,0.000005078905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037123114,0.0018223671,0.005795101,0.000059874164,0.000096496464,0.000007771896,0.0034642965,0.4783277,0.00024029672,0.0521915,0.005490937,0.45246655],"study_design_scores_gemma":[0.0006825992,0.00009107236,0.0029351315,0.00005662165,0.00000994644,0.0000046335686,0.000019564079,0.9887278,0.000011788591,0.0006473188,0.00654942,0.0002641018],"about_ca_topic_score_codex":0.000729374,"about_ca_topic_score_gemma":0.00036502947,"teacher_disagreement_score":0.7621821,"about_ca_system_score_codex":0.00008074865,"about_ca_system_score_gemma":0.00008914149,"threshold_uncertainty_score":0.99987364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19999589,0.00014319885,0.7981159,0.00040127838,0.00047690456,0.00034186427,0.0000042979414,0.00014572655,0.00037494578],"genre_scores_gemma":[0.99073666,0.0000028345999,0.008420193,0.00033866454,0.00030750816,0.00003875949,0.000001211479,0.000009224228,0.00014492385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990892,0.000051490148,0.00015181166,0.0004052352,0.00009203804,0.00021026513],"domain_scores_gemma":[0.9988575,0.00034442372,0.00014303542,0.00050553697,0.0000697405,0.00007976404],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00036710044,0.000112123074,0.00012108643,0.000048580583,0.0022529357,0.00042854593,0.0004986885,0.00002790116,1.7533242e-7],"category_scores_gemma":[0.000098120276,0.000110948204,0.000052379728,0.000064329965,0.000034588666,0.00025616717,0.00028503753,0.00015824233,0.0000022718102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003403518,0.000046459463,0.001503022,0.000016650674,0.000016634427,0.0000011933406,0.00059689226,0.020424988,0.011185768,0.0664059,0.0009090781,0.8988594],"study_design_scores_gemma":[0.00016506658,0.000041830834,0.0036815326,0.00006405484,0.000009453322,0.00001701947,0.000040789084,0.99177426,0.0001438462,0.0017347678,0.0021809074,0.0001464762],"about_ca_topic_score_codex":0.000109564324,"about_ca_topic_score_gemma":0.000017375207,"teacher_disagreement_score":0.97134924,"about_ca_system_score_codex":0.000027581407,"about_ca_system_score_gemma":0.000027484079,"threshold_uncertainty_score":0.99904597},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33501875,0.0023543127,0.6540731,0.0007611714,0.00339976,0.00032200722,0.0000015880493,0.0005611986,0.0035081182],"genre_scores_gemma":[0.9897617,0.000098294586,0.008733295,0.00025061748,0.0003557796,0.000014239971,5.597334e-7,0.000013514107,0.000772018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880546,0.00006707818,0.00020939356,0.00035427642,0.0002254684,0.0003382996],"domain_scores_gemma":[0.9981043,0.0001247951,0.00019675182,0.0014635589,0.00005075453,0.00005988677],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00053679704,0.00014540041,0.00015569585,0.000038652888,0.0015862299,0.0011989466,0.001886486,0.000040872303,0.000005299944],"category_scores_gemma":[0.00003188813,0.00009950641,0.00011034067,0.000066680885,0.00003058154,0.00043267987,0.0010078513,0.00014842393,0.00003425928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031805186,0.0000833785,0.017759174,0.000118335796,0.00019606236,0.00017657001,0.0018179469,0.043889876,0.0006788829,0.047348097,0.0016035748,0.8862963],"study_design_scores_gemma":[0.0002414816,0.000030836152,0.000716453,0.0001758833,0.000016861162,0.000055633394,0.00013537287,0.95845765,0.00006866297,0.00093465095,0.03889278,0.00027370965],"about_ca_topic_score_codex":0.00010475076,"about_ca_topic_score_gemma":0.00022609154,"teacher_disagreement_score":0.9145678,"about_ca_system_score_codex":0.000056408146,"about_ca_system_score_gemma":0.000044672703,"threshold_uncertainty_score":0.9998379},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010671017,0.005242584,0.9628526,0.0073383213,0.0042036036,0.00243269,0.0002996781,0.00015473338,0.016408717],"genre_scores_gemma":[0.8996013,0.0029984291,0.0122877,0.00095290155,0.00031333356,0.000113970724,0.00010774668,0.00007279405,0.08355186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982383,0.00006299388,0.000496816,0.00058429147,0.0004614143,0.00015616766],"domain_scores_gemma":[0.9966881,0.0015566294,0.00038179138,0.0011535134,0.00020136556,0.000018598796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252318,0.000232609,0.00033023796,0.00025772027,0.000150474,0.00009771961,0.0018914747,0.000087075605,0.000007801858],"category_scores_gemma":[0.00053283974,0.0001823554,0.000071120936,0.000057959878,0.00033096227,0.00032709722,0.0012292529,0.00049660687,0.00003636348],"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.0000413483,0.00005268497,0.000017674598,0.000078297366,0.00014569398,0.000057306283,0.0009192089,0.26361683,0.0000021163926,0.6978424,0.0028297536,0.034396686],"study_design_scores_gemma":[0.000104580875,0.00012846095,0.00007278498,0.0019425468,0.000015450692,0.000017246672,0.000078824,0.6281096,0.000012191643,0.36298907,0.006146377,0.00038290548],"about_ca_topic_score_codex":0.00017352091,"about_ca_topic_score_gemma":0.0004187432,"teacher_disagreement_score":0.95056486,"about_ca_system_score_codex":0.00010807431,"about_ca_system_score_gemma":0.00008848371,"threshold_uncertainty_score":0.74362373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2329923,0.000099551144,0.76179725,0.00436569,0.00015191815,0.0003489448,0.000027355603,0.00009179664,0.00012520746],"genre_scores_gemma":[0.9842338,0.00008597895,0.014330249,0.00084684644,0.00005277865,0.00028421817,0.00012860965,0.000018733977,0.000018796005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984797,0.0002686556,0.00032357176,0.00039995156,0.00014445648,0.00038364885],"domain_scores_gemma":[0.99555767,0.00033763607,0.00022384665,0.0037100997,0.000092442,0.0000783141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005597527,0.00020064911,0.00027342464,0.00010573492,0.0010553536,0.0006893977,0.0048768786,0.00005419036,4.4375125e-7],"category_scores_gemma":[0.00004058,0.00020660879,0.00011979931,0.00012795186,0.00037249314,0.0006093015,0.0005033068,0.00047989306,0.000003171202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012758854,0.0009544199,0.0041774134,0.00007869576,0.00023297506,0.00003799898,0.0037502488,0.8663547,0.010213304,0.073253155,0.004046969,0.03677255],"study_design_scores_gemma":[0.0006801654,0.000021960283,0.0004897472,0.000064981235,0.00001179332,0.000013947584,0.000052842133,0.99799275,0.00017032832,0.000058148595,0.00018815152,0.0002551837],"about_ca_topic_score_codex":0.00024354832,"about_ca_topic_score_gemma":0.000041373616,"teacher_disagreement_score":0.7512415,"about_ca_system_score_codex":0.00011783567,"about_ca_system_score_gemma":0.00004137537,"threshold_uncertainty_score":0.9062535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12591065,0.00002339043,0.8706529,0.0008770321,0.00043411876,0.0001700739,0.0000031024817,0.00009783655,0.0018309024],"genre_scores_gemma":[0.99809897,0.00002121636,0.001203101,0.0005028585,0.00006686747,0.000021966169,0.000009194251,0.0000031645322,0.00007269129],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991907,0.00002084901,0.0002327881,0.00016612158,0.00012588919,0.0002636434],"domain_scores_gemma":[0.99902993,0.00009400924,0.00012775074,0.00062386657,0.00006051435,0.00006393709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038987017,0.000093155424,0.00011406154,0.00013367798,0.00036610622,0.0007911578,0.000996315,0.000053703145,0.0000037903887],"category_scores_gemma":[0.000101451165,0.00008163953,0.00007520974,0.00007249901,0.000017136823,0.0015215061,0.00017580202,0.00014253097,0.000007735391],"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.000020406322,0.00007226229,0.771596,0.000034692992,0.000020753394,0.000016291531,0.0002899137,0.0024523828,0.000008165739,0.054831233,0.00096943474,0.16968848],"study_design_scores_gemma":[0.00060901284,0.000033495075,0.2592598,0.00004079717,0.0000030825959,0.00000538091,0.000011304909,0.73760384,0.0000029315593,0.0006367124,0.0016255536,0.00016809464],"about_ca_topic_score_codex":0.0014553859,"about_ca_topic_score_gemma":0.0006189397,"teacher_disagreement_score":0.87218827,"about_ca_system_score_codex":0.000023141547,"about_ca_system_score_gemma":0.000018732982,"threshold_uncertainty_score":0.7629153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37747648,0.00023599221,0.62121856,0.000062946296,0.00008435263,0.00010575447,2.0809904e-7,0.0001287547,0.0006869146],"genre_scores_gemma":[0.9946588,0.000009270768,0.004761701,0.00021410482,0.00005768249,0.00002421285,0.0000026633948,0.000010747949,0.00026080335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.00006436506,0.00019279015,0.00044711135,0.00018038964,0.00028785656],"domain_scores_gemma":[0.99889594,0.00014289832,0.00013661881,0.0007016155,0.000042975527,0.00007997294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044335437,0.0001462718,0.00016848043,0.000088801666,0.00054510386,0.0005042678,0.00059975,0.000055214994,0.000001317187],"category_scores_gemma":[0.000023356846,0.00012117677,0.000028735705,0.00009788256,0.000060103972,0.00022137276,0.00044730926,0.00016689504,0.0000017893306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015364176,0.00007770785,0.0072359256,0.000008449222,0.000009487034,0.00001848434,0.00049996306,0.8707216,0.00010024482,0.002545022,0.00012596529,0.118641794],"study_design_scores_gemma":[0.00044019747,0.00010486497,0.0041324366,0.00007433715,0.0000037340203,0.000019032435,0.000083873674,0.994246,0.000055459834,0.000017436445,0.0006358869,0.00018673623],"about_ca_topic_score_codex":0.0013925321,"about_ca_topic_score_gemma":0.00020525616,"teacher_disagreement_score":0.6171823,"about_ca_system_score_codex":0.000043913635,"about_ca_system_score_gemma":0.000030510188,"threshold_uncertainty_score":0.4941445},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029173063,0.00015337345,0.96110964,0.004856659,0.0005026331,0.00038416684,0.000005503914,0.00017003303,0.0036449449],"genre_scores_gemma":[0.99658275,0.00003352515,0.0016738364,0.00091085286,0.00012624077,0.000031775504,0.000016257165,0.000004491642,0.0006202515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903125,0.00002351708,0.00023772285,0.00020407181,0.0001851697,0.0003183017],"domain_scores_gemma":[0.9985897,0.00006790854,0.00017908082,0.00085098733,0.0002080154,0.0001043324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033675283,0.00012137857,0.00013248049,0.00014671314,0.00070508383,0.00077219174,0.00095822616,0.00007174067,0.0000037188368],"category_scores_gemma":[0.00014636114,0.00010644438,0.00012300035,0.00013773718,0.000028661123,0.0015121541,0.0002550096,0.00010005106,0.000028983419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025788948,0.000072768875,0.002092246,0.000026750062,0.000047633675,0.0000020250036,0.00043058107,0.0013492514,0.00004646884,0.39803073,0.012578142,0.58529764],"study_design_scores_gemma":[0.00066998607,0.00005989032,0.014441302,0.000010730169,0.000008611543,0.0000070024007,0.000026375958,0.8922702,0.000042487372,0.0009274744,0.091367126,0.00016883216],"about_ca_topic_score_codex":0.00040001917,"about_ca_topic_score_gemma":0.00004030093,"teacher_disagreement_score":0.96740973,"about_ca_system_score_codex":0.00006627429,"about_ca_system_score_gemma":0.00007795167,"threshold_uncertainty_score":0.7446263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031639036,0.0000014480431,0.94727063,0.0018459413,0.0001540047,0.04895668,0.0000016129666,0.00016207682,0.0012912388],"genre_scores_gemma":[0.6112601,5.000001e-7,0.03125761,0.0042676195,0.00043217998,0.3524309,0.000015741272,0.000014842564,0.00032046987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991664,0.000024604928,0.00022055638,0.00017843247,0.00017642463,0.00023354273],"domain_scores_gemma":[0.9984451,0.000090419904,0.00015821093,0.0010313721,0.00019624297,0.000078681434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004022733,0.0001024557,0.000112533475,0.000051736883,0.0004995604,0.000998727,0.0010132599,0.00006180591,0.000013332449],"category_scores_gemma":[0.00014125409,0.00008137573,0.00011345645,0.00006286761,0.000028510043,0.0013044489,0.00016012341,0.000102129256,0.000020337226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043075674,0.0005599275,0.027590783,0.00061438075,0.00010514536,0.000014588266,0.0006531169,0.03849478,0.00010725209,0.10905053,0.028767224,0.7936115],"study_design_scores_gemma":[0.0013033843,0.000076499564,0.0008972275,0.000021627944,0.0000021582823,7.173304e-7,0.0000037652721,0.95593095,0.00015865009,0.00027627792,0.04120278,0.00012594406],"about_ca_topic_score_codex":0.00007063678,"about_ca_topic_score_gemma":0.000008646386,"teacher_disagreement_score":0.9174362,"about_ca_system_score_codex":0.000031405536,"about_ca_system_score_gemma":0.00010310138,"threshold_uncertainty_score":0.9630748},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5203753,0.00022693604,0.47400367,0.0014072018,0.0027392635,0.00025974866,0.00000555733,0.00018040446,0.00080186233],"genre_scores_gemma":[0.9980031,0.00002243417,0.000099257595,0.001285213,0.0001753294,0.000031534848,0.0000049420305,0.000016539634,0.00036162295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981768,0.00011491119,0.0003105178,0.000570878,0.00035707993,0.00046977925],"domain_scores_gemma":[0.9978412,0.00012784437,0.00025354206,0.0015777891,0.00007104589,0.0001286123],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042351347,0.0002171112,0.00026550482,0.00013113285,0.00042578985,0.0013379658,0.0037216183,0.0001151618,0.000007882234],"category_scores_gemma":[0.000035104902,0.00020729998,0.00012339628,0.00012278826,0.000080738624,0.0010343601,0.0005128642,0.0002638486,0.000024589306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006014963,0.0013029273,0.17305487,0.00015956559,0.00023901324,0.00236331,0.0007053078,0.5128833,0.009774103,0.0018039785,0.03897995,0.25813216],"study_design_scores_gemma":[0.0013707558,0.000064833686,0.02879599,0.00019263786,0.000010719213,0.0000062920763,0.00003093978,0.96750325,0.0005042559,0.00008827257,0.001035516,0.0003965657],"about_ca_topic_score_codex":0.0010897261,"about_ca_topic_score_gemma":0.00041935724,"teacher_disagreement_score":0.47762778,"about_ca_system_score_codex":0.00016166462,"about_ca_system_score_gemma":0.0000695543,"threshold_uncertainty_score":0.99969876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069478184,0.00003884622,0.9284156,0.0008215225,0.00038267745,0.0001443106,5.566372e-7,0.000058879195,0.00065942365],"genre_scores_gemma":[0.99760985,0.000013684978,0.0014176529,0.00044813706,0.000023899422,0.000008590087,0.000003810079,0.0000030368242,0.0004713162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992154,0.000065813554,0.00016661498,0.00024574721,0.00015807408,0.00014831142],"domain_scores_gemma":[0.99935293,0.000034700708,0.00014585315,0.00035686023,0.000067393325,0.000042240496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499895,0.00007811104,0.00010186721,0.000043195974,0.00019948852,0.0003588301,0.00013916609,0.00005902989,0.000017473254],"category_scores_gemma":[0.00006467433,0.00007190178,0.000033434295,0.000029451849,0.000010208354,0.00034445274,0.00010836582,0.00007861738,0.0000023361429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006157291,0.00011272433,0.12482941,0.000006817007,0.00002544848,0.0000058697437,0.00004195267,0.86050135,0.00013024235,0.00073209225,0.0006599197,0.0128925955],"study_design_scores_gemma":[0.00057635596,0.000045142697,0.06527733,0.000011870555,0.0000046661507,7.065232e-7,0.000007369793,0.9338452,0.00006812237,0.00001453047,0.000072441624,0.000076229895],"about_ca_topic_score_codex":0.00036793074,"about_ca_topic_score_gemma":0.00025912197,"teacher_disagreement_score":0.9281317,"about_ca_system_score_codex":0.00009180314,"about_ca_system_score_gemma":0.000016316522,"threshold_uncertainty_score":0.3460207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19950011,0.00004758813,0.79847723,0.001069276,0.00026726868,0.0001582756,0.000014906392,0.00012308947,0.000342245],"genre_scores_gemma":[0.9865664,0.000075707074,0.012883324,0.00018560821,0.00002374708,0.000045502948,0.0000016143623,0.000019636707,0.00019844389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984287,0.0004979632,0.00030595865,0.00031831607,0.00017997612,0.00026906765],"domain_scores_gemma":[0.9969685,0.00032140902,0.00016944666,0.002381427,0.00009678665,0.00006241951],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005519549,0.00018623979,0.00022846575,0.00021925425,0.0045594554,0.0004902348,0.0029278784,0.000097747994,0.0000053570875],"category_scores_gemma":[0.000010582387,0.00019991402,0.00012998944,0.00018182815,0.00021915986,0.00065667677,0.000039640643,0.000794541,0.00002144608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014990395,0.004313839,0.0004964296,0.000059983235,0.00044731778,0.000049714254,0.059679005,0.3116138,0.17826921,0.13559027,0.00004853841,0.309282],"study_design_scores_gemma":[0.0010324533,0.000027259264,0.0010915824,0.00016673934,0.000028039176,0.000015217832,0.0007954331,0.9936895,0.001716209,0.0009660638,0.000056648358,0.00041487193],"about_ca_topic_score_codex":0.0012067899,"about_ca_topic_score_gemma":0.0017747248,"teacher_disagreement_score":0.7870663,"about_ca_system_score_codex":0.00016880842,"about_ca_system_score_gemma":0.00009995111,"threshold_uncertainty_score":0.99673647},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028913827,0.000018491844,0.9314394,0.000559859,0.0002196184,0.00032255487,0.0000029116513,0.00017789818,0.06436787],"genre_scores_gemma":[0.97469544,0.0000027793408,0.010037085,0.00010466566,0.00006146417,0.00031910834,0.0000010225504,0.0000029148227,0.014775534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995031,0.000006141867,0.000086094726,0.00019321634,0.00009111897,0.00012037163],"domain_scores_gemma":[0.99899477,0.000019600508,0.000054010976,0.0008583152,0.000039069604,0.00003422332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014233789,0.00005546426,0.00006845475,0.00003163766,0.0005509784,0.0003983922,0.00086719077,0.0000149186835,0.0000012482367],"category_scores_gemma":[0.0000026267217,0.00004799556,0.000057407968,0.000019482666,0.0000187516,0.00020051957,0.00026035245,0.00002324611,0.000025956106],"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.0000023458688,0.0000146740995,0.00033712137,0.00007633419,0.000025779313,0.0000016603725,0.00003737583,0.00001003877,0.000056302524,0.9693588,0.002355091,0.027724488],"study_design_scores_gemma":[0.004142446,0.00024499808,0.008703773,0.0004334436,0.00016329868,0.000057355155,0.0040083765,0.6027181,0.005334877,0.033172403,0.33931372,0.0017071917],"about_ca_topic_score_codex":0.00008541012,"about_ca_topic_score_gemma":0.000016377857,"teacher_disagreement_score":0.971804,"about_ca_system_score_codex":0.000024235253,"about_ca_system_score_gemma":0.0000072347957,"threshold_uncertainty_score":0.42377362},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30816975,0.00030886134,0.68429226,0.0015045556,0.0002731716,0.00019811536,4.2019968e-7,0.00011918108,0.005133689],"genre_scores_gemma":[0.99187046,0.000006964874,0.0059597273,0.0003067176,0.00008315378,0.000006733462,4.547134e-7,0.000005440911,0.0017603204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991666,0.00002653011,0.00013717684,0.00034065367,0.00011047589,0.00021852589],"domain_scores_gemma":[0.99928135,0.00007194983,0.0000708776,0.00047897425,0.000032950902,0.00006392864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003344428,0.00010056849,0.000127432,0.00005010193,0.00031205337,0.00072407094,0.00055576424,0.000050212788,0.0000025283873],"category_scores_gemma":[0.00008942989,0.00008523869,0.000022565946,0.00005259763,0.000049978957,0.0005122297,0.00059201784,0.00020623357,0.0000059207537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030037708,0.0006618283,0.09455201,0.00012386095,0.0001831619,0.00035221555,0.015199352,0.031894248,0.05481392,0.52101827,0.011014234,0.2698865],"study_design_scores_gemma":[0.0005806433,0.000045085864,0.004471079,0.0001409338,0.0000014290828,0.000014303781,0.00007493362,0.993113,0.00012348664,0.000068547386,0.0012105376,0.00015604429],"about_ca_topic_score_codex":0.00027349868,"about_ca_topic_score_gemma":0.00006430945,"teacher_disagreement_score":0.9612187,"about_ca_system_score_codex":0.000022140131,"about_ca_system_score_gemma":0.000023066696,"threshold_uncertainty_score":0.69822323},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009400064,0.000039024584,0.97848576,0.00047551727,0.0004949603,0.00012897323,1.3953255e-7,0.00011281734,0.01086274],"genre_scores_gemma":[0.9893659,0.000017423361,0.005005668,0.00060104235,0.00061924075,0.000010970634,0.000038009774,0.0000067350848,0.0043350332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887824,0.00003962427,0.00015698232,0.0004682119,0.00022318869,0.00023377698],"domain_scores_gemma":[0.99775565,0.000013565243,0.00009061451,0.0019880473,0.00004869631,0.00010340499],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003945622,0.00010749471,0.00011151483,0.000048072616,0.00066767685,0.001152309,0.002381037,0.00004334397,0.0000027760534],"category_scores_gemma":[0.000029268138,0.000094411334,0.000029108282,0.00006467789,0.000015662017,0.0009099813,0.0017979997,0.00014724085,0.0000346458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058821497,0.000028713599,0.00038475782,0.0000052494306,0.00002578157,0.0000044856392,0.00032142713,0.25165328,0.0010021745,0.010247005,0.0025723763,0.73374885],"study_design_scores_gemma":[0.00014598321,0.00003334478,0.00019948326,0.000006943865,0.000004594765,0.0000044389317,0.000022309914,0.99744093,0.000026709058,0.000008985449,0.0019641805,0.00014208206],"about_ca_topic_score_codex":0.001562633,"about_ca_topic_score_gemma":0.00018613956,"teacher_disagreement_score":0.9799658,"about_ca_system_score_codex":0.00002397377,"about_ca_system_score_gemma":0.00002340476,"threshold_uncertainty_score":0.9998846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11016395,0.00012959975,0.86524886,0.001533293,0.0017581676,0.0008208739,0.000008905095,0.00028110037,0.020055257],"genre_scores_gemma":[0.9956671,0.00003870026,0.002924407,0.00017122194,0.00007798613,0.000025351537,0.000011423063,0.000005110154,0.0010786982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986391,0.000059324164,0.00020036446,0.00061857887,0.00023426415,0.0002483895],"domain_scores_gemma":[0.99746335,0.00003210613,0.00010191987,0.0023142463,0.000034978577,0.000053415017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058405014,0.00011277548,0.0001285335,0.000054034743,0.00028233172,0.0003744633,0.0018239219,0.000041264062,0.0000044102208],"category_scores_gemma":[0.00001757402,0.00009900754,0.00003056301,0.000055612883,0.000048683167,0.0009335884,0.0016103766,0.0001553302,0.000010825031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026027238,0.001751099,0.055378895,0.00008603358,0.0006878614,0.00038860174,0.0010457418,0.038514663,0.00036890694,0.052147213,0.0057453844,0.8436253],"study_design_scores_gemma":[0.0005868102,0.00003327125,0.13603085,0.00003828719,0.000012759057,0.000008380966,0.00021991497,0.8619394,0.000013162619,0.00065320963,0.00032776123,0.00013623461],"about_ca_topic_score_codex":0.0011214188,"about_ca_topic_score_gemma":0.0006472245,"teacher_disagreement_score":0.8855032,"about_ca_system_score_codex":0.000121405224,"about_ca_system_score_gemma":0.000020460551,"threshold_uncertainty_score":0.40374103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06291567,0.000026688222,0.89766586,0.0004004436,0.00040863812,0.00043469688,0.000005052851,0.00030513055,0.03783784],"genre_scores_gemma":[0.93947184,0.000007004623,0.037912834,0.00038395158,0.00008334864,0.00007785727,0.000004992092,0.000014995841,0.0220432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985292,0.00002168654,0.00018892664,0.0006606854,0.00017915199,0.00042034764],"domain_scores_gemma":[0.9981245,0.000046522375,0.00016777277,0.0013642256,0.00017018973,0.00012680354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003327143,0.00018405389,0.00021285012,0.00006731439,0.0004786628,0.00091380865,0.002281485,0.00008193356,0.000006578491],"category_scores_gemma":[0.00005759408,0.00016085993,0.00015611747,0.00004772141,0.00003025697,0.0005338123,0.0008918401,0.00014134707,0.000035225883],"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.000040217157,0.0003383589,0.00056494825,0.00008666687,0.00006700469,0.000015481535,0.0011852288,0.00009060489,0.005622781,0.98729235,0.0015633237,0.003133036],"study_design_scores_gemma":[0.0016793328,0.00014148818,0.000274922,0.00002094651,0.000026450007,0.000006402858,0.0001869513,0.95123285,0.008319011,0.036847956,0.0008014655,0.00046222756],"about_ca_topic_score_codex":0.000586377,"about_ca_topic_score_gemma":0.000052506035,"teacher_disagreement_score":0.95114225,"about_ca_system_score_codex":0.00005318475,"about_ca_system_score_gemma":0.000058311267,"threshold_uncertainty_score":0.8811878},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021831904,0.00012552075,0.7399675,0.0018392539,0.21984464,0.01200004,0.000017825661,0.0006082173,0.0037650655],"genre_scores_gemma":[0.32289007,0.00004162345,0.00017974182,0.00029999428,0.6708593,0.0055097924,0.000003904577,0.00002353578,0.00019208148],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859035,0.00005705651,0.00020288679,0.00053766323,0.00032745604,0.00028460642],"domain_scores_gemma":[0.9983156,0.000050360297,0.00024880862,0.0011379947,0.00012330667,0.0001239685],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002428206,0.00018661714,0.00018709443,0.00008848819,0.001048753,0.0039693117,0.0030776423,0.00015891349,0.0000044597045],"category_scores_gemma":[0.000017881905,0.00016789834,0.000067372755,0.00013925243,0.0000768988,0.0013852986,0.0004562225,0.00032072072,0.0000061324918],"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.00016650722,0.00024207667,0.009882367,0.0001226901,0.000096399366,0.0000259738,0.00030491708,0.005805445,0.000861673,0.0028064055,0.5983458,0.3813397],"study_design_scores_gemma":[0.0016800836,0.00012655088,0.03057117,0.00013321299,0.000037336846,0.000053317424,0.0000128319925,0.020255053,0.001309479,0.006713941,0.9381922,0.0009148066],"about_ca_topic_score_codex":0.00032071403,"about_ca_topic_score_gemma":0.0003298689,"teacher_disagreement_score":0.7397878,"about_ca_system_score_codex":0.000036491983,"about_ca_system_score_gemma":0.000064399384,"threshold_uncertainty_score":0.99706465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012352003,0.00060171797,0.9843447,0.0009419016,0.00041348784,0.0008254126,0.00007997977,0.00005058915,0.00039016566],"genre_scores_gemma":[0.64528865,0.0003331813,0.35318148,0.0005651346,0.0003234295,0.000067834364,0.00007487517,0.000029065379,0.00013635564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988253,0.000025111633,0.0005394492,0.00020882457,0.00017655604,0.00022477214],"domain_scores_gemma":[0.998273,0.000693722,0.0003585967,0.0005205373,0.00011130304,0.00004283347],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010052491,0.00023202001,0.00032505297,0.00012419913,0.0013307163,0.0002568025,0.001122968,0.00014403464,2.4426373e-7],"category_scores_gemma":[0.000070249625,0.00016886815,0.000108053435,0.00013062145,0.00055619667,0.00027958574,0.0012211759,0.0003240576,1.1184209e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001208016,0.000027570379,0.000030857118,0.00038577808,0.00012590286,1.6437272e-7,0.011118803,0.8280009,0.000059706228,0.051358633,0.00026514908,0.108614445],"study_design_scores_gemma":[0.0002888239,0.000098605764,0.00015721149,0.00022733459,0.000028000986,0.00001386265,0.000017489227,0.98817164,0.000031853422,0.0009190838,0.009813588,0.00023248058],"about_ca_topic_score_codex":0.0002229648,"about_ca_topic_score_gemma":0.0006470625,"teacher_disagreement_score":0.63293666,"about_ca_system_score_codex":0.00008367216,"about_ca_system_score_gemma":0.00008791932,"threshold_uncertainty_score":0.9999694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021625808,0.0000015929357,0.96684813,0.0006345586,0.00018516168,0.03049121,0.0000011242972,0.0001230247,0.0014989359],"genre_scores_gemma":[0.8922653,1.9773248e-7,0.0067384155,0.0006938909,0.00009776086,0.09999236,0.0000041678836,0.000005633162,0.00020226088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930096,0.00001295029,0.000193791,0.00015069073,0.00011578423,0.00022579919],"domain_scores_gemma":[0.99891883,0.00005656767,0.00016977126,0.000680141,0.00011019019,0.00006449255],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022425503,0.00009879826,0.000107927895,0.000057476966,0.00051408826,0.0011259317,0.0009499998,0.000040930354,0.000004461936],"category_scores_gemma":[0.000092131566,0.00007909853,0.00011503098,0.000052023337,0.000022270828,0.0014055803,0.00015657322,0.000077755074,0.000014088039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004200459,0.00028766057,0.01729876,0.00045901258,0.00012498077,0.000021367734,0.00030971237,0.029301425,0.00007434368,0.44164678,0.047030322,0.46302557],"study_design_scores_gemma":[0.0012836988,0.000049979015,0.00051300577,0.000063671454,0.0000028276431,0.0000011779409,0.0000061373253,0.94801635,0.000082744504,0.00029557457,0.049559955,0.00012487097],"about_ca_topic_score_codex":0.000035974637,"about_ca_topic_score_gemma":0.000016966418,"teacher_disagreement_score":0.9601097,"about_ca_system_score_codex":0.000039810086,"about_ca_system_score_gemma":0.000045971752,"threshold_uncertainty_score":0.999911},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0158876,0.00016406448,0.9755032,0.0022270975,0.00071590545,0.00011625438,6.9653373e-7,0.00019271276,0.005192454],"genre_scores_gemma":[0.99488854,0.000028456292,0.0026642077,0.00039162152,0.0000664061,0.000018294972,0.0000015257582,0.0000047912954,0.0019361521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.000035451892,0.00015264744,0.00028045895,0.00014582224,0.00031576832],"domain_scores_gemma":[0.9988448,0.00006640807,0.0000698379,0.0009216983,0.000029153998,0.00006810658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033042516,0.000096208205,0.00011761746,0.00006778764,0.00047111284,0.00076726155,0.001713483,0.000047217833,0.000019470997],"category_scores_gemma":[0.00007883155,0.00008574313,0.0000541761,0.00007270874,0.000034332024,0.0007796169,0.00087339216,0.00014973374,0.000028469483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008447335,0.000807728,0.23013611,0.000031651147,0.00015625544,0.00026272936,0.0008983783,0.18079133,0.00028902502,0.19204107,0.10966575,0.2848355],"study_design_scores_gemma":[0.0008729808,0.00003798469,0.06938746,0.00003479922,0.0000059040985,0.000010328448,0.000013528879,0.9269719,0.00002620023,0.00091627677,0.0014489348,0.00027366143],"about_ca_topic_score_codex":0.0015209384,"about_ca_topic_score_gemma":0.00079869514,"teacher_disagreement_score":0.9790009,"about_ca_system_score_codex":0.00006263997,"about_ca_system_score_gemma":0.000049165883,"threshold_uncertainty_score":0.7398721},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.200469,0.0002503625,0.7961934,0.00068396144,0.00066997507,0.0004978575,0.0000022866682,0.00016060483,0.0010725368],"genre_scores_gemma":[0.99257934,0.00003819554,0.0034358264,0.0012156225,0.00013040104,0.00008409331,0.0000037670561,0.000021451595,0.0024912967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836403,0.000038653423,0.00029581838,0.00059416,0.00020787344,0.0004994363],"domain_scores_gemma":[0.9978617,0.00012291947,0.00026422183,0.0013345828,0.00022270577,0.00019389013],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032223068,0.0002569314,0.000290801,0.00006207073,0.0007857827,0.0018555243,0.0026421177,0.00007099676,0.000006012031],"category_scores_gemma":[0.000035923225,0.00018536035,0.00018267357,0.000037330014,0.000063470776,0.000567749,0.00073241326,0.0001406269,0.000009640235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016717962,0.0020685014,0.07360386,0.00035939127,0.0014038215,0.00084990216,0.0017448104,0.31386656,0.009310927,0.04988218,0.0040124375,0.5412258],"study_design_scores_gemma":[0.0027971247,0.0007275542,0.0019604315,0.00014559798,0.00006340009,0.00014047681,0.00010715543,0.9759683,0.015520744,0.00017835884,0.0015695206,0.0008213088],"about_ca_topic_score_codex":0.0015072229,"about_ca_topic_score_gemma":0.0007312687,"teacher_disagreement_score":0.7927576,"about_ca_system_score_codex":0.000061679195,"about_ca_system_score_gemma":0.000048239803,"threshold_uncertainty_score":0.9991807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95648044,0.000018629707,0.03633508,0.00028250375,0.00025577322,0.000023311317,7.3628917e-7,0.00002583114,0.0065776883],"genre_scores_gemma":[0.9945426,0.000012864704,0.0051515773,0.000056790523,0.000034144927,6.045177e-8,8.062429e-7,0.0000018277942,0.0001993143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948096,0.000016332106,0.00011071481,0.00018565632,0.00010132103,0.00010498504],"domain_scores_gemma":[0.9982551,0.000026144777,0.00006845405,0.0016156766,0.000016139176,0.000018525603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039751627,0.000043178912,0.00008081549,0.00003836594,0.0001255119,0.00010460137,0.0015469426,0.000016004675,0.0000011406983],"category_scores_gemma":[0.000030515674,0.00003781915,0.000012345097,0.000028691868,0.000021609898,0.001062915,0.00069409626,0.000078091674,0.000006717175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021752307,0.00007023694,0.15758121,0.000058904727,0.000020101215,0.000057614765,0.0011026809,0.0010719312,0.013103879,0.0075767622,0.0010095555,0.8183254],"study_design_scores_gemma":[0.00013874749,0.00001205459,0.016680295,0.000046267785,0.0000010347646,0.0000075127314,0.000011271137,0.9823994,0.00046193274,0.00004086046,0.00013976626,0.000060835304],"about_ca_topic_score_codex":0.0012129335,"about_ca_topic_score_gemma":0.00018365346,"teacher_disagreement_score":0.9813275,"about_ca_system_score_codex":0.000007765464,"about_ca_system_score_gemma":0.000019484716,"threshold_uncertainty_score":0.287463},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027483841,0.000017793076,0.9611975,0.0009886321,0.00022802391,0.00025281013,0.000015752272,0.00018767161,0.009627956],"genre_scores_gemma":[0.97768176,0.0000010214003,0.018403072,0.00018728348,0.00008056074,0.000055452318,0.0000049801297,0.0000073785545,0.0035784878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993077,0.000011251421,0.00007788569,0.000235376,0.00011810097,0.00024969236],"domain_scores_gemma":[0.9993255,0.00004389917,0.00008414247,0.00045136266,0.000054440563,0.000040662017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019432716,0.00008952004,0.00011428249,0.0000747276,0.001063943,0.00064540276,0.00045321655,0.000021913605,0.000012106258],"category_scores_gemma":[0.000063413216,0.00006823934,0.000051815747,0.000026674068,0.000024450079,0.00071428774,0.00020436067,0.000078762314,0.0000037614861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119179924,0.00019441247,0.0029783004,0.00020516515,0.00038798206,0.00010774931,0.013533241,0.0004973012,0.006733495,0.80381763,0.013356914,0.15806866],"study_design_scores_gemma":[0.0021272753,0.0005839955,0.008729689,0.00061154156,0.00004961112,0.00013318204,0.0036135076,0.9607255,0.013622183,0.005430315,0.003141243,0.0012319442],"about_ca_topic_score_codex":0.00039238067,"about_ca_topic_score_gemma":0.000050531624,"teacher_disagreement_score":0.9602282,"about_ca_system_score_codex":0.000028844664,"about_ca_system_score_gemma":0.00002553099,"threshold_uncertainty_score":0.8183097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8722601,0.00015028012,0.10722021,0.0011728356,0.00021697099,0.00019551553,2.6285673e-7,0.00009618321,0.01868762],"genre_scores_gemma":[0.9968663,0.00004935056,0.00061795814,0.0001423257,0.0000071336185,0.00001021721,5.4359225e-7,0.0000027489739,0.002303407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941444,0.00001077221,0.000087220054,0.00024070054,0.000118537966,0.00012831799],"domain_scores_gemma":[0.9994797,0.0000070570295,0.00004642914,0.0004067734,0.000028675207,0.000031378993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013552788,0.00006306537,0.00006493494,0.00006710877,0.00013886137,0.00027231962,0.00047622694,0.00001870435,0.0000018366383],"category_scores_gemma":[0.000008942453,0.000056879682,0.000010231925,0.000052352054,0.00001816163,0.00047324912,0.00013995953,0.00004637918,0.00002041124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013617581,0.00013011943,0.015784256,0.00012178332,0.000025779727,0.00009123403,0.0006605146,0.0001817387,0.00025773735,0.025199896,0.0001102127,0.9574231],"study_design_scores_gemma":[0.00063034805,0.00003167399,0.29584864,0.00007628934,0.0000049470755,0.000011320475,0.00011347552,0.6986874,0.00010300547,0.004189273,0.000116945324,0.00018669064],"about_ca_topic_score_codex":0.0002046661,"about_ca_topic_score_gemma":0.0003126156,"teacher_disagreement_score":0.9572364,"about_ca_system_score_codex":0.000022430197,"about_ca_system_score_gemma":0.0000110392875,"threshold_uncertainty_score":0.26259843},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47353503,0.000014713622,0.5229455,0.0022578877,0.00004741676,0.00077138847,0.000011922868,0.00005309927,0.00036299505],"genre_scores_gemma":[0.992599,0.0000025212714,0.0069229146,0.00010750399,0.000008727011,0.0001358449,0.000014724701,0.0000043114146,0.00020445845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.000046048754,0.00019087977,0.00021313339,0.00016213335,0.00012051436],"domain_scores_gemma":[0.9973466,0.000115377225,0.0001625977,0.0019220375,0.00039423496,0.000059189188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028882263,0.00008295957,0.00013669691,0.000030234505,0.00046671592,0.00017745158,0.0014679276,0.00001976788,6.636203e-7],"category_scores_gemma":[0.00010566293,0.00006455214,0.0000324972,0.000066577246,0.000038538565,0.00034266108,0.00037517122,0.000053122334,0.000005655802],"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.0008575878,0.01635653,0.15407896,0.0002590862,0.0012358663,0.000019273983,0.027185876,0.0012201921,0.04219557,0.506605,0.003053182,0.24693285],"study_design_scores_gemma":[0.009758208,0.0040229745,0.47762132,0.00033875383,0.00026119093,0.000018065197,0.011746461,0.48731458,0.0043729595,0.00022378557,0.0033881888,0.00093351933],"about_ca_topic_score_codex":0.001204473,"about_ca_topic_score_gemma":0.0021142983,"teacher_disagreement_score":0.51906395,"about_ca_system_score_codex":0.00003181329,"about_ca_system_score_gemma":0.000030072339,"threshold_uncertainty_score":0.35896486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9377986,0.00003825302,0.045768198,0.0009463381,0.0014739211,0.00004726343,2.069342e-7,0.00009790549,0.013829277],"genre_scores_gemma":[0.9957686,0.0000040645314,0.0031505371,0.00004181016,0.00012811863,0.0000026534622,3.84102e-8,0.0000024681854,0.0009016819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993907,0.000016006632,0.0000885791,0.00019473236,0.00014427648,0.00016570311],"domain_scores_gemma":[0.99923795,0.000015557276,0.000034604935,0.0006468647,0.000022078993,0.00004296379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019551074,0.00005948791,0.00007564495,0.00004619881,0.00015841822,0.00031457125,0.0007371141,0.00002321917,0.000002632407],"category_scores_gemma":[0.00004614845,0.000050396273,0.000037394693,0.000036244717,0.000015235184,0.00012524602,0.00029961363,0.000082513965,0.000054731117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046206314,0.0005758931,0.19546862,0.000045244255,0.000049898525,0.00087456434,0.00488463,0.008959921,0.027250933,0.12654188,0.0015845181,0.6337177],"study_design_scores_gemma":[0.0013446639,0.000083658786,0.409771,0.00014436313,0.0000046316736,0.00003522703,0.00023827505,0.5724973,0.013307026,0.00072306226,0.0012966855,0.000554116],"about_ca_topic_score_codex":0.0008355058,"about_ca_topic_score_gemma":0.000011819042,"teacher_disagreement_score":0.6331636,"about_ca_system_score_codex":0.000030015817,"about_ca_system_score_gemma":0.000020897873,"threshold_uncertainty_score":0.30334178},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7467959,0.00023196028,0.23183149,0.019702626,0.0006733359,0.00019353608,0.0000036514728,0.00031870272,0.00024881787],"genre_scores_gemma":[0.9962253,0.00006463453,0.0021172613,0.0013368041,0.0001525005,0.000029966914,0.00002953907,0.000011791942,0.00003217858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.00037792692,0.00031700116,0.00030693444,0.00015169846,0.00031713574],"domain_scores_gemma":[0.9972879,0.00016847809,0.00011182027,0.0022880223,0.00007572512,0.00006804543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047887326,0.00014475567,0.0001541066,0.00018504138,0.0004691277,0.00018575908,0.002032856,0.00006397668,0.0000027174372],"category_scores_gemma":[0.000036758058,0.00015719853,0.00007655389,0.0006809147,0.00019325601,0.00030319483,0.00014146145,0.00045342743,0.00003530391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009508732,0.000988842,0.0011755294,0.000026735768,0.00018337554,0.000043903976,0.009870404,0.4466605,0.40577194,0.0056664958,0.061970443,0.06754677],"study_design_scores_gemma":[0.0008261435,0.0000671118,0.0029821217,0.00013453685,0.000022500475,0.00010204172,0.00019306934,0.9889299,0.00082126155,0.00007290061,0.0053405827,0.00050778186],"about_ca_topic_score_codex":0.00029515036,"about_ca_topic_score_gemma":0.00023083958,"teacher_disagreement_score":0.54226947,"about_ca_system_score_codex":0.00016017623,"about_ca_system_score_gemma":0.00003245111,"threshold_uncertainty_score":0.64103705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5422422,0.000049349095,0.4551497,0.000054260963,0.0004197192,0.00004224129,1.5464825e-7,0.0000959902,0.0019463502],"genre_scores_gemma":[0.98730975,0.0000048762895,0.011958821,0.00031065376,0.00018995604,0.000001073447,4.7091632e-7,0.000005063884,0.00021930315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918586,0.000040495222,0.00014542931,0.00025212966,0.000117717216,0.00025835106],"domain_scores_gemma":[0.9994867,0.000086994776,0.000031786883,0.00029107023,0.000043076838,0.000060385777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019139581,0.00008693561,0.00009556141,0.000085808344,0.00007673546,0.00010429839,0.00033659002,0.000047691094,0.000015042258],"category_scores_gemma":[0.000020533307,0.00007858932,0.00003492869,0.00023922439,0.000037267593,0.00027418078,0.000061509534,0.00011112844,0.000032608856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039632592,0.0002717892,0.06020722,0.000012459021,0.000049057948,0.0002695056,0.0041828174,0.01007562,0.054145865,0.004428459,0.0015750788,0.8647425],"study_design_scores_gemma":[0.0002042933,0.00002499636,0.002791176,0.000027945704,0.0000018607108,0.000015318263,0.00005029046,0.99582857,0.00082239055,0.00005708524,0.000062089304,0.00011396328],"about_ca_topic_score_codex":0.0014378108,"about_ca_topic_score_gemma":0.00041679817,"teacher_disagreement_score":0.985753,"about_ca_system_score_codex":0.000037863476,"about_ca_system_score_gemma":0.000025140866,"threshold_uncertainty_score":0.32047793},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97384495,0.00024455434,0.024954796,0.00037521133,0.00017822107,0.00007407895,0.000005888143,0.000041222575,0.0002810595],"genre_scores_gemma":[0.99914205,0.000048504546,0.00036177726,0.0003147721,0.000119304335,9.944785e-7,0.00000977403,0.0000022758334,5.392649e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922144,0.00006236458,0.00024446374,0.00014761028,0.00011808882,0.00020604531],"domain_scores_gemma":[0.999525,0.000103843995,0.0001131898,0.00014509566,0.000056254947,0.00005661775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038825843,0.000088822395,0.00013198724,0.00010629136,0.00019190373,0.00016831598,0.00025942724,0.000048374364,7.0003836e-7],"category_scores_gemma":[0.00007628194,0.00009097422,0.000018880579,0.00039762465,0.000029133296,0.00088424026,0.00044584475,0.00016105149,0.0000015607122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016891204,0.00012567526,0.3515373,0.0005623201,0.00010222847,0.000037806494,0.15233074,0.00084701006,0.0015353244,0.056418926,0.00019138094,0.43614239],"study_design_scores_gemma":[0.0013610017,0.000059499765,0.03531052,0.00038855488,0.000013738959,0.000036923357,0.0005824389,0.9553189,0.00018998298,0.0037071041,0.0026830172,0.00034830553],"about_ca_topic_score_codex":0.00044002268,"about_ca_topic_score_gemma":0.00010210328,"teacher_disagreement_score":0.9544719,"about_ca_system_score_codex":0.000022978933,"about_ca_system_score_gemma":0.000025851054,"threshold_uncertainty_score":0.3709821},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13674045,0.00026621393,0.86031926,0.0004030484,0.000561987,0.00030686648,0.000005290597,0.0011243719,0.00027252824],"genre_scores_gemma":[0.9903395,0.000047120164,0.00877229,0.00030465922,0.00005791291,0.00013056968,0.0000028427673,0.000037212343,0.0003078579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753344,0.00012613965,0.00035389652,0.00096620957,0.00034470347,0.0006755818],"domain_scores_gemma":[0.99819666,0.000068916255,0.00012438332,0.0013126228,0.0001837006,0.00011370177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027342085,0.00037345418,0.0003882765,0.00071763457,0.0005586996,0.000110555324,0.0011161106,0.00052273396,0.00001662734],"category_scores_gemma":[0.000009358439,0.00036461776,0.00024718815,0.00143516,0.00033194505,0.0003676392,0.000021153497,0.0009034733,0.00008893986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003779343,0.0030075416,0.00017642388,0.00007818928,0.0019891402,0.0006903581,0.0011848427,0.4560313,0.07794056,0.026959864,0.0007662743,0.43079758],"study_design_scores_gemma":[0.00075513957,0.0004899774,0.00005630152,0.000060172697,0.0000697004,0.00015185561,0.00014483,0.9913935,0.005321462,0.0007147812,0.0004121829,0.0004300638],"about_ca_topic_score_codex":0.00012963469,"about_ca_topic_score_gemma":0.000084951826,"teacher_disagreement_score":0.8535991,"about_ca_system_score_codex":0.00021881601,"about_ca_system_score_gemma":0.00007638475,"threshold_uncertainty_score":0.99988055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11441643,0.00011962919,0.8833041,0.0012849664,0.00020413099,0.0002938366,0.0001519275,0.00016918387,0.00005577221],"genre_scores_gemma":[0.67123955,0.00015896997,0.32760802,0.00041941696,0.00008571044,0.00012028829,0.00032323203,0.000013825932,0.000031014435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989456,0.00018613374,0.00029537905,0.00025118908,0.00013698282,0.00018471613],"domain_scores_gemma":[0.99658924,0.00017462242,0.00015916163,0.0027446798,0.0002687878,0.00006348871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037431822,0.00010957733,0.00016098701,0.00007603525,0.00030841565,0.00007551484,0.0020918923,0.000049471266,0.0000073351202],"category_scores_gemma":[0.000019356949,0.00011774788,0.000086096574,0.00028418485,0.00025384309,0.0003728217,0.00019320504,0.0000940916,0.000015871676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093862654,0.001240164,0.0002412134,0.00003082503,0.000160924,0.0000016827853,0.0033558684,0.0020697142,0.23211376,0.001060213,0.030696005,0.7289358],"study_design_scores_gemma":[0.00035819612,0.0002007185,0.00040355523,0.000017753013,0.000018883567,0.000003532002,0.00004471686,0.98994964,0.0030341074,0.00007573189,0.005731719,0.00016145596],"about_ca_topic_score_codex":0.00005090038,"about_ca_topic_score_gemma":0.0000085098245,"teacher_disagreement_score":0.98787993,"about_ca_system_score_codex":0.00004657406,"about_ca_system_score_gemma":0.000040238996,"threshold_uncertainty_score":0.4801619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8450615,0.000055947927,0.14591224,0.0073060053,0.0006685937,0.00010644297,4.4239798e-7,0.0007090375,0.00017982196],"genre_scores_gemma":[0.9942654,0.0000051947186,0.0023610268,0.003119391,0.000102788756,0.000025740394,4.4511927e-7,0.000016425382,0.00010360227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.000052335094,0.00035362478,0.00058316294,0.000117432166,0.0005037862],"domain_scores_gemma":[0.998959,0.00015883695,0.00013065597,0.0006577207,0.000048448506,0.00004533617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024705747,0.00020564217,0.00022647419,0.00079419464,0.00005025372,0.00014583839,0.001753169,0.00017919946,0.000023536459],"category_scores_gemma":[0.00033339285,0.0001834059,0.00006738495,0.0007125176,0.00022076775,0.00040749778,0.0008506098,0.00060971646,0.0002488069],"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.0002402233,0.0002072026,0.031191403,0.000043024116,0.00020976829,0.0031726053,0.0045995926,0.000046682053,0.3502208,0.019336754,0.009337578,0.5813944],"study_design_scores_gemma":[0.008411038,0.0034898992,0.0030306561,0.00355931,0.000082853476,0.007897819,0.002420103,0.5076163,0.3917428,0.005386852,0.061883096,0.0044793133],"about_ca_topic_score_codex":0.00017673324,"about_ca_topic_score_gemma":0.00095763576,"teacher_disagreement_score":0.576915,"about_ca_system_score_codex":0.00013300982,"about_ca_system_score_gemma":0.000024270119,"threshold_uncertainty_score":0.7479075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1856672,0.000099112825,0.8116632,0.0003589378,0.000105099694,0.00019841567,0.000003926754,0.00015872426,0.0017453702],"genre_scores_gemma":[0.64801246,0.000006191221,0.3516698,0.0001280742,0.00007246013,0.000032417778,0.000012112908,0.0000076885435,0.00005879573],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907005,0.00008821541,0.00024683468,0.00025283778,0.00012451375,0.00021752427],"domain_scores_gemma":[0.99769515,0.00022119693,0.00012891238,0.001726363,0.00018336618,0.000045024597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045974215,0.000103824204,0.000115718416,0.00008705763,0.0007997255,0.00022850509,0.0014928892,0.00004780469,0.0000024067408],"category_scores_gemma":[0.00007232488,0.00011181809,0.000079694146,0.00024049057,0.00007459689,0.0004911884,0.0006196282,0.00015687467,0.00000976657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002878505,0.0005105496,0.0006062968,0.00009231717,0.00016964122,4.0337e-7,0.020324627,0.00092929736,0.5255986,0.38347435,0.00037547798,0.06788969],"study_design_scores_gemma":[0.00029742162,0.00002640667,0.00015957412,0.00006704659,0.000014025712,0.0000058094265,0.0004384387,0.9909674,0.0038211457,0.0032529451,0.00076925533,0.00018054745],"about_ca_topic_score_codex":0.00013206065,"about_ca_topic_score_gemma":0.000018387127,"teacher_disagreement_score":0.9900381,"about_ca_system_score_codex":0.00005471378,"about_ca_system_score_gemma":0.00005183791,"threshold_uncertainty_score":0.6150923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01744281,0.000029583409,0.9790799,0.0021787495,0.00034119913,0.0002074777,0.00002517403,0.00007922708,0.0006158719],"genre_scores_gemma":[0.9747555,0.000005250555,0.024553452,0.00028280696,0.000010502402,0.000016607399,0.000020316595,0.000010324942,0.00034521142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989751,0.00006148009,0.00029093924,0.0003331428,0.0001703905,0.00016893397],"domain_scores_gemma":[0.9972477,0.0002534814,0.00024312655,0.00216002,0.00005846981,0.000037211666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598797,0.00011849858,0.00017654106,0.00014617466,0.00022364354,0.00020553566,0.003172526,0.00006594678,0.000010752669],"category_scores_gemma":[0.000085931424,0.00012101094,0.000087797445,0.000058325062,0.000058911526,0.0007087038,0.00006107195,0.00029146232,0.0000057141533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016204359,0.0037946228,0.002980896,0.0006554024,0.0007054683,0.00004495374,0.03024902,0.030098293,0.020105686,0.08014425,0.005748854,0.8238521],"study_design_scores_gemma":[0.0011797771,0.00010116487,0.00022047397,0.00029721015,0.000015495469,0.0000028769223,0.000059835023,0.9891778,0.007282995,0.00049212517,0.001026215,0.00014403126],"about_ca_topic_score_codex":0.002321112,"about_ca_topic_score_gemma":0.00028390935,"teacher_disagreement_score":0.9590795,"about_ca_system_score_codex":0.00004438139,"about_ca_system_score_gemma":0.000044141692,"threshold_uncertainty_score":0.5895395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48413244,0.0000630787,0.5148717,0.00004631851,0.0005207522,0.00024685013,0.0000024112528,0.00007923095,0.000037221005],"genre_scores_gemma":[0.9748885,0.000021391576,0.024827505,0.000043157037,0.0001548872,0.000026234668,0.000004404097,0.000016958547,0.00001697108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785244,0.00025062208,0.00052534306,0.00044770192,0.0006581782,0.00026569812],"domain_scores_gemma":[0.99808717,0.00031635945,0.00021751496,0.0006059164,0.00071122526,0.000061793085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040722643,0.00019541678,0.00026567056,0.00019452206,0.0008056069,0.00018462275,0.00042953482,0.000086866494,0.000001522886],"category_scores_gemma":[0.00008954171,0.00018701595,0.00009070142,0.00021012138,0.000032121043,0.0005950686,0.000027455024,0.00016025307,0.0000033227832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042490963,0.000037387013,0.00006635702,0.000090751,0.00004744749,5.3449916e-8,0.0017282908,0.8781154,0.0006660384,0.0008192708,0.0000017592415,0.11838475],"study_design_scores_gemma":[0.0007618421,0.00032633133,0.0001576341,0.000655129,0.00007815659,0.000016238759,0.00027667775,0.9957883,0.0005834759,0.00115585,0.0000038223898,0.00019653852],"about_ca_topic_score_codex":0.00027977905,"about_ca_topic_score_gemma":0.000013743398,"teacher_disagreement_score":0.49075603,"about_ca_system_score_codex":0.00008979228,"about_ca_system_score_gemma":0.000104737686,"threshold_uncertainty_score":0.7626289},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022526006,0.00011762187,0.9942341,0.00014038364,0.0004806814,0.00056211906,0.000032284162,0.00006234473,0.0021178783],"genre_scores_gemma":[0.49428764,0.000035867593,0.50502014,0.0002545424,0.00022230487,0.000045067278,0.000042115385,0.000019931238,0.00007240932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887204,0.000023054481,0.0004948821,0.0002007353,0.00019245519,0.00021682988],"domain_scores_gemma":[0.9985782,0.00032606226,0.00031806272,0.00060796057,0.00012958953,0.00004010759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005429441,0.00024629588,0.00027632195,0.0002245117,0.0005711635,0.00020688036,0.001396612,0.0002065407,5.3188955e-7],"category_scores_gemma":[0.00003328396,0.00020441478,0.00015134587,0.00019356004,0.00023569773,0.00027350822,0.00040166048,0.00055850076,3.9298862e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032740327,0.000021119724,0.0000068187087,0.00006222421,0.00001584141,8.5316984e-8,0.00063505635,0.99005365,0.0000032516955,0.0034668627,0.000017948623,0.0057138363],"study_design_scores_gemma":[0.00020672861,0.0001313049,0.00008740291,0.0001945934,0.000018168184,0.000002371818,0.0000043846403,0.9981774,0.000033636665,0.00036356252,0.00059064996,0.00018979583],"about_ca_topic_score_codex":0.000067229754,"about_ca_topic_score_gemma":0.00015262117,"teacher_disagreement_score":0.49203503,"about_ca_system_score_codex":0.00014627438,"about_ca_system_score_gemma":0.00023330069,"threshold_uncertainty_score":0.8335793},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008451991,0.00008214737,0.83486706,0.001009065,0.022038179,0.12866443,0.000029281911,0.0009953801,0.0038624634],"genre_scores_gemma":[0.14125617,0.0000020839166,0.11276809,0.0035267156,0.09373389,0.64555454,0.000023335964,0.00015665521,0.002978505],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979576,0.00013608107,0.00030869854,0.00078446,0.00027881263,0.0005343385],"domain_scores_gemma":[0.99814385,0.00016680219,0.00022471457,0.0012368893,0.00011569088,0.00011204481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057322194,0.00031725067,0.0003415114,0.00007163539,0.00023258617,0.00030125925,0.0017321031,0.0002612403,0.000003276688],"category_scores_gemma":[0.000023685194,0.00027690807,0.00031664336,0.00012318387,0.00007012877,0.000014380509,0.00074714195,0.00051177933,0.000033512442],"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.00033931833,0.00014505793,0.00013043109,0.000507192,0.00026043298,0.000028237915,0.0018628133,0.17838638,0.00009382573,0.002880795,0.7840131,0.031352416],"study_design_scores_gemma":[0.0015066202,0.00051563396,0.00022197716,0.0010056942,0.00005273077,0.000030623578,0.000008028525,0.20845158,0.00030030654,0.5634854,0.22303241,0.0013889867],"about_ca_topic_score_codex":0.00003814735,"about_ca_topic_score_gemma":0.00005607914,"teacher_disagreement_score":0.72209895,"about_ca_system_score_codex":0.000056269884,"about_ca_system_score_gemma":0.00022288483,"threshold_uncertainty_score":0.9999683},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078554675,0.000013424059,0.91783065,0.000092206676,0.0017503037,0.0010127366,0.0005643158,0.000061365514,0.00012033494],"genre_scores_gemma":[0.9976841,0.00010960509,0.0014790748,0.00023367222,0.00002623876,0.00013509567,0.0001502091,0.000010610047,0.00017134521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998416,0.000089471876,0.00077319663,0.0001865659,0.00036683265,0.0001679551],"domain_scores_gemma":[0.99761254,0.00037362648,0.0007861369,0.0007550387,0.0004360139,0.000036650188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007075253,0.00023639211,0.00031636344,0.0003086472,0.00014219026,0.00009551746,0.0007429597,0.00022874888,0.00002944703],"category_scores_gemma":[0.0000087865465,0.00018633019,0.000309936,0.00014461738,0.00006114633,0.0008865638,0.000020958867,0.0003577865,0.000017313256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014445034,0.0000771374,0.0000013509515,0.00046829224,0.0002990673,9.3170584e-8,0.0037943071,0.9579689,0.0045129643,0.009539222,0.000046606434,0.021847593],"study_design_scores_gemma":[0.0014172313,0.00046987357,0.00010756428,0.00025774507,0.00016441998,0.000005794789,0.00040491365,0.94092846,0.054599445,0.00096187973,0.00033084265,0.00035185795],"about_ca_topic_score_codex":0.00001592243,"about_ca_topic_score_gemma":0.0000026590521,"teacher_disagreement_score":0.9191295,"about_ca_system_score_codex":0.000099903344,"about_ca_system_score_gemma":0.0002545232,"threshold_uncertainty_score":0.75983244},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003951558,0.00022415064,0.99081546,0.00016402351,0.0034052092,0.00067731336,0.0000037711886,0.0004138158,0.0003446874],"genre_scores_gemma":[0.958793,0.000034049895,0.03575334,0.0027866152,0.0023305337,0.000067893285,0.0001045488,0.000020297797,0.000109748595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977914,0.0001305397,0.00058517285,0.00049307896,0.00028551085,0.00071426743],"domain_scores_gemma":[0.9980611,0.0001760144,0.00025235603,0.00081660174,0.00040773972,0.00028613943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062178954,0.00032039935,0.00034708326,0.00016817775,0.00047595135,0.00091499113,0.0011730266,0.00015708913,0.000010654515],"category_scores_gemma":[0.000010483942,0.00029650857,0.0001759649,0.00034920417,0.00007288531,0.0015712822,0.00041004753,0.0002856602,0.000026169973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010253501,0.00008491873,0.00017159845,0.0000068435666,0.00006413751,0.000003851853,0.00021279014,0.8599954,0.0000014184781,0.0070741577,0.009288581,0.122993745],"study_design_scores_gemma":[0.0020528748,0.0007690367,0.000667008,0.000039336002,0.000019997657,0.000020930927,0.000024890798,0.99236685,0.000003102145,0.0000823624,0.0035818182,0.00037179946],"about_ca_topic_score_codex":0.00006613161,"about_ca_topic_score_gemma":0.000013306901,"teacher_disagreement_score":0.95506215,"about_ca_system_score_codex":0.00009213931,"about_ca_system_score_gemma":0.00006811045,"threshold_uncertainty_score":0.9999487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08509234,0.000034962155,0.9092719,0.00022607311,0.0011759874,0.00023664476,0.0000016517495,0.00031226486,0.0036481568],"genre_scores_gemma":[0.9844823,0.000002050495,0.013839065,0.0011679684,0.00045415922,0.00000901489,0.0000026990526,0.000008644293,0.000034118693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972232,0.000027489405,0.0003273816,0.0006142605,0.0010043669,0.00080331846],"domain_scores_gemma":[0.9982758,0.00003857321,0.00019625115,0.0009474293,0.00032019615,0.00022174261],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008457215,0.00022183442,0.00018060546,0.00046885197,0.0010643591,0.0016794687,0.0026330731,0.000078022014,0.0000071760396],"category_scores_gemma":[0.000055350563,0.0002036098,0.000059204114,0.0020593752,0.00038419856,0.0018151108,0.00113736,0.00030529647,0.000069277194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048962127,0.0000950064,0.0006819098,0.000040936447,0.000020342626,0.0000103126395,0.013817693,0.018429592,0.086135775,0.016382242,0.0019675193,0.8623697],"study_design_scores_gemma":[0.0002363511,0.000025716383,0.00030612975,0.00002516226,0.0000050497983,0.0000257773,0.000052968437,0.9912293,0.0010859305,0.0041285134,0.0025978605,0.00028124245],"about_ca_topic_score_codex":0.000054056098,"about_ca_topic_score_gemma":0.000008772136,"teacher_disagreement_score":0.9727997,"about_ca_system_score_codex":0.0001929583,"about_ca_system_score_gemma":0.00030747172,"threshold_uncertainty_score":0.99935687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12853025,0.0062084543,0.85870224,0.0043597873,0.001062864,0.00033703342,0.0000015773113,0.000104178434,0.0006936148],"genre_scores_gemma":[0.9909934,0.0029804737,0.0042483206,0.0013858991,0.00033090916,0.00001160183,0.0000047938306,0.0000126258965,0.00003197188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807096,0.00057353254,0.00049825304,0.00026093458,0.0002335235,0.00036278006],"domain_scores_gemma":[0.9981461,0.0004884652,0.00038807248,0.00066557224,0.0001819544,0.00012982963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015482912,0.00017216709,0.0002453749,0.00011148208,0.0008911755,0.00046742277,0.00050434505,0.0000902306,0.0000053529925],"category_scores_gemma":[0.000022994702,0.00016265312,0.00005713061,0.00030968338,0.00008367255,0.00020818811,0.0003245059,0.0005281115,0.0000012839498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116972486,0.0002779305,0.11747517,0.000008025458,0.000105403094,0.00001816656,0.00045019254,0.76306796,0.000027642463,0.0020357436,0.0009915046,0.11542527],"study_design_scores_gemma":[0.000637845,0.00015842785,0.0045909844,0.0002544852,0.000011681474,0.000027013182,0.00002493068,0.9925058,0.0000038353855,0.00008142152,0.0015342535,0.00016934915],"about_ca_topic_score_codex":0.000028700711,"about_ca_topic_score_gemma":0.00010644021,"teacher_disagreement_score":0.8624632,"about_ca_system_score_codex":0.00016197849,"about_ca_system_score_gemma":0.000041880587,"threshold_uncertainty_score":0.68542916},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10257701,0.00055516936,0.8947149,0.0013791607,0.00018327363,0.00028452047,9.3989246e-7,0.000080878846,0.00022417489],"genre_scores_gemma":[0.93343467,0.00075278245,0.06459606,0.0010043371,0.00012691895,0.000046223653,0.000003403756,0.000017469385,0.000018162464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756134,0.000967214,0.0005682258,0.00030357228,0.00023598717,0.00036365716],"domain_scores_gemma":[0.9975078,0.00068084005,0.00013791089,0.0010294239,0.00043794423,0.00020609246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011267904,0.00018076361,0.00023881688,0.00057431514,0.0005833132,0.00034028775,0.0017724179,0.00010025929,0.000003961051],"category_scores_gemma":[0.00021963812,0.00017904109,0.000038490223,0.0015267092,0.000067850706,0.0004678709,0.00022647557,0.0011297752,0.000008690086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030116804,0.00016823661,0.0007245667,0.0000015761323,0.000013484756,0.000005713572,0.0010940237,0.9933981,0.00014516123,0.0004589584,0.0002199031,0.0037401647],"study_design_scores_gemma":[0.0004925848,0.00019631177,0.00044748094,0.00024201784,0.0000067530887,0.000093591625,0.000045542638,0.99763155,0.000021086242,0.0004383978,0.00018751838,0.0001971825],"about_ca_topic_score_codex":0.0001285174,"about_ca_topic_score_gemma":0.0004947319,"teacher_disagreement_score":0.83085763,"about_ca_system_score_codex":0.00019099502,"about_ca_system_score_gemma":0.00020003458,"threshold_uncertainty_score":0.7301084},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13404508,0.000080634185,0.8633392,0.00020732195,0.0019282898,0.0001577396,0.0000016755516,0.000145294,0.00009476537],"genre_scores_gemma":[0.99744165,0.000006263257,0.000716033,0.0013625722,0.00038313065,0.000022103266,0.0000054217912,0.00001181567,0.00005100901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987293,0.00007989516,0.0002525917,0.00039667307,0.00022455495,0.0003170079],"domain_scores_gemma":[0.9990332,0.00010839228,0.00009853669,0.0004673411,0.0002085968,0.00008390247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021881505,0.00015040295,0.00016881154,0.00016482755,0.00012507786,0.00034506555,0.0011264221,0.00008095773,0.000016683078],"category_scores_gemma":[0.000025744554,0.00014582352,0.000060683204,0.00046189094,0.000059742655,0.00071168767,0.00015142685,0.00012501463,0.000023894085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003487385,0.000057040823,0.0009843089,0.000004631511,0.0000075949415,0.000016987413,0.00005667684,0.993564,0.00008749845,0.00013613237,0.00079711794,0.004253149],"study_design_scores_gemma":[0.0005920793,0.00007443292,0.0007972513,0.00007701348,0.000005899849,0.0000032736484,0.000009378573,0.9979482,0.00024605816,0.000038535054,0.00002070502,0.0001871336],"about_ca_topic_score_codex":0.0005189198,"about_ca_topic_score_gemma":0.00018386888,"teacher_disagreement_score":0.8633966,"about_ca_system_score_codex":0.00008045972,"about_ca_system_score_gemma":0.00007388937,"threshold_uncertainty_score":0.5946511},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95801896,0.00007770697,0.001561543,0.003208141,0.00094269594,0.00023708558,0.0000014878932,0.0001398304,0.035812564],"genre_scores_gemma":[0.99728537,0.000007276546,0.0012850566,0.00042959704,0.00009697863,0.0000097194625,6.960008e-8,0.000004358458,0.0008815897],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920964,0.0000030357528,0.00014306522,0.00019862092,0.00027373264,0.00017189],"domain_scores_gemma":[0.9995279,0.000011551668,0.00010922273,0.00017327006,0.00013878293,0.000039302722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001797334,0.00008346685,0.00009061399,0.000044609224,0.00010712949,0.00006684242,0.0010351121,0.000020516756,0.000008296882],"category_scores_gemma":[0.000029978797,0.000055088705,0.00008409826,0.0001951277,0.00007233072,0.00021749924,0.0004460116,0.0000676652,0.000023743656],"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.00005027951,0.00027190085,0.014028618,0.00009096422,0.00013796883,0.0000014309344,0.0041082352,0.0000121762,0.63336444,0.24075134,0.07091645,0.036266215],"study_design_scores_gemma":[0.0009502899,0.0005167682,0.008445333,0.00023468313,0.000040515195,0.000047645717,0.0002902196,0.015616619,0.9419585,0.013819995,0.017651519,0.00042794808],"about_ca_topic_score_codex":0.000058868336,"about_ca_topic_score_gemma":0.0000012628575,"teacher_disagreement_score":0.30859405,"about_ca_system_score_codex":0.00003330027,"about_ca_system_score_gemma":0.000013571821,"threshold_uncertainty_score":0.22464523},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49394298,0.00033513905,0.5022842,0.0003928681,0.0013146327,0.00011101198,6.3895084e-7,0.00039689193,0.0012216321],"genre_scores_gemma":[0.986118,0.000018998195,0.008978689,0.0015284802,0.0002699304,0.0000041337375,0.0000010169252,0.000011371589,0.003069386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985008,0.000053735355,0.00027757423,0.00048944197,0.00027763698,0.0004007775],"domain_scores_gemma":[0.99906117,0.00007908383,0.00007382265,0.0004373668,0.0002038112,0.00014477178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040147602,0.00017554511,0.0001870492,0.00013977145,0.00030440773,0.00025114612,0.0007145451,0.00006778452,0.00004225188],"category_scores_gemma":[0.000040357692,0.00015262127,0.000120209654,0.00021811474,0.000089690875,0.00056342466,0.00028674066,0.00015099908,0.00037192582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018596878,0.00059750804,0.0035520205,0.000078780235,0.00037349307,0.00025181306,0.008554529,0.0008733837,0.38912967,0.021281494,0.039575703,0.53554565],"study_design_scores_gemma":[0.0011193614,0.00018267092,0.0011129684,0.000078656194,0.000014137046,0.00007202696,0.00021888955,0.9863441,0.008279724,0.000069770875,0.0021161963,0.00039151264],"about_ca_topic_score_codex":0.00020609815,"about_ca_topic_score_gemma":0.00012629929,"teacher_disagreement_score":0.9854707,"about_ca_system_score_codex":0.000056982277,"about_ca_system_score_gemma":0.000033693184,"threshold_uncertainty_score":0.6223715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997369,0.00008845425,0.00080362847,0.000374414,0.00063973444,0.00023008337,0.0000041639396,0.00011429957,0.0003762163],"genre_scores_gemma":[0.9982903,0.000010546849,0.0013664194,0.000149574,0.000047676815,0.000005499247,0.0000011185956,0.000007011452,0.00012186106],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888223,0.000008418522,0.00022439178,0.0003282619,0.00036069695,0.00019599553],"domain_scores_gemma":[0.9993261,0.0000359556,0.00022783989,0.00021330986,0.00014953974,0.000047261598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022337901,0.0001303002,0.00016743357,0.00008845774,0.00011013787,0.00008209521,0.00077158853,0.00004316368,0.0000036096117],"category_scores_gemma":[0.00003662103,0.00009522572,0.00016156067,0.00032945708,0.000028739487,0.00030140564,0.00038971397,0.00017325356,0.000009598071],"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.000040641466,0.00022464083,0.2457244,0.000045662335,0.000084678075,8.1638865e-7,0.0006699429,0.00003243377,0.7312617,0.006319476,0.00020042143,0.015395215],"study_design_scores_gemma":[0.0019960627,0.00040593895,0.18064456,0.0004446336,0.0000953033,0.0000366073,0.0007341505,0.043396164,0.735818,0.035118077,0.00060571684,0.0007047262],"about_ca_topic_score_codex":0.0013065414,"about_ca_topic_score_gemma":0.000040169663,"teacher_disagreement_score":0.06507984,"about_ca_system_score_codex":0.000045631634,"about_ca_system_score_gemma":0.000013646482,"threshold_uncertainty_score":0.3883192},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059593283,0.00006856,0.99178785,0.0008528968,0.00047861977,0.000119037024,0.000004937149,0.000112402544,0.0006163447],"genre_scores_gemma":[0.99199176,0.000016523147,0.0055202236,0.0010846355,0.00019331391,0.0000058634782,0.00007465933,0.000004939201,0.0011080751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930274,0.000020277323,0.00010595648,0.00033815927,0.00007961252,0.00015325735],"domain_scores_gemma":[0.99911326,0.000051016566,0.000032138523,0.0006678188,0.00008317693,0.000052602427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018922554,0.0000708398,0.000074365016,0.000029016646,0.00009604697,0.00017456363,0.0005698618,0.000035127414,0.000006227826],"category_scores_gemma":[0.000013226821,0.000058097354,0.000018008755,0.00007607606,0.00003140085,0.00039816927,0.0003459549,0.00003959945,0.000008258091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006765082,0.00016498753,0.0073040756,0.000033836295,0.000081287166,0.0000035351595,0.0003383738,0.000032535838,0.0003810929,0.014379064,0.13280025,0.8444133],"study_design_scores_gemma":[0.00039495813,0.00007024649,0.0025635236,0.000018495595,0.000005742368,0.000009949183,0.000010680351,0.982036,0.000025852005,0.00012910852,0.014640078,0.00009539024],"about_ca_topic_score_codex":0.000072215094,"about_ca_topic_score_gemma":0.00012672861,"teacher_disagreement_score":0.9862676,"about_ca_system_score_codex":0.000009184347,"about_ca_system_score_gemma":0.00001541979,"threshold_uncertainty_score":0.23691413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18632029,0.0000046831337,0.81091374,0.000118023636,0.0017035479,0.0005875187,0.000016701093,0.000118662974,0.00021680647],"genre_scores_gemma":[0.9944555,0.0000023782566,0.004204321,0.0005136894,0.0006072331,0.00006852516,0.000005454502,0.0000148295485,0.00012806035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825495,0.0000697349,0.00074298086,0.0001923188,0.00025447752,0.00048550623],"domain_scores_gemma":[0.9990202,0.00024437677,0.00021338197,0.0002838481,0.00014367857,0.00009452334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057197874,0.00022600504,0.0003099925,0.00021421158,0.0005592413,0.00030792347,0.0004892361,0.00027840698,0.000010241605],"category_scores_gemma":[0.000014156144,0.00021817989,0.00018267358,0.00041659357,0.00007328456,0.00076497375,0.00001143544,0.00069899746,0.000019309779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010470074,0.00095499854,0.00016613735,0.00013609228,0.0004154123,0.000009326807,0.05503296,0.54504484,0.00052205066,0.0031153022,0.00765253,0.38590333],"study_design_scores_gemma":[0.003454633,0.0003730505,0.0000053169224,0.00011794274,0.000018626037,0.00000754584,0.0016510942,0.9925446,0.0003677267,0.000033103588,0.0011453276,0.00028104597],"about_ca_topic_score_codex":0.00009643634,"about_ca_topic_score_gemma":0.00006692857,"teacher_disagreement_score":0.8081352,"about_ca_system_score_codex":0.00016517445,"about_ca_system_score_gemma":0.00010149871,"threshold_uncertainty_score":0.8897118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054746676,0.0011319631,0.9367364,0.0046682665,0.00026330288,0.0005724002,0.0000086921755,0.0016407311,0.00023155508],"genre_scores_gemma":[0.919985,0.0009561473,0.078285694,0.00019430129,0.000016474982,0.00039863872,0.000007715083,0.000022249367,0.00013376444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981996,0.00012594902,0.00049992185,0.00050581584,0.00015184136,0.0005169173],"domain_scores_gemma":[0.997268,0.0005616702,0.0001439948,0.0016830426,0.00030084845,0.000042406416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000418627,0.00026653905,0.00029271437,0.00082064304,0.001159319,0.00016545442,0.0021133882,0.00019610942,0.0000059114773],"category_scores_gemma":[0.0001352538,0.00027129764,0.00015376601,0.0014353441,0.00023755652,0.00058198156,0.00008869794,0.00072466524,0.00001678348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022204901,0.0018474734,0.0010626976,0.000046920148,0.00047982472,0.000012841775,0.003342037,0.100652434,0.009419401,0.046836667,0.0017066937,0.834371],"study_design_scores_gemma":[0.0012992538,0.00039274752,0.00032022703,0.0002465511,0.000038074282,0.000023085398,0.0031545465,0.9816703,0.0062343455,0.0004292998,0.005553424,0.0006381001],"about_ca_topic_score_codex":0.000313604,"about_ca_topic_score_gemma":0.0008053032,"teacher_disagreement_score":0.8810179,"about_ca_system_score_codex":0.00023122392,"about_ca_system_score_gemma":0.00008169079,"threshold_uncertainty_score":0.9999739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036071748,0.00052111014,0.9926387,0.00046924368,0.001610446,0.00033751756,0.0000018497882,0.00026288428,0.00055108167],"genre_scores_gemma":[0.7474322,0.00006181378,0.24921417,0.0017651727,0.0004119187,0.00001017602,0.0000046566024,0.000074594245,0.0010253341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958665,0.0000768459,0.00061957573,0.0017788381,0.00091574475,0.00074250373],"domain_scores_gemma":[0.9977794,0.0002812616,0.00021748239,0.0013461305,0.00017329257,0.00020243338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012526155,0.00055487826,0.0005730978,0.0010372516,0.00025577474,0.00048535384,0.003391349,0.00038237876,0.000032694505],"category_scores_gemma":[0.000067771325,0.0005050738,0.00015319686,0.00059955486,0.0004171135,0.00072584394,0.00085871323,0.0011349394,0.000073065414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038884387,0.00015327612,0.00019081509,0.000092300936,0.000022788176,0.00045721442,0.0054828175,0.04709384,0.009740311,0.003325695,0.00007712557,0.93332493],"study_design_scores_gemma":[0.0007303041,0.00018023491,0.00028978664,0.0011362521,0.0000073632655,0.00006711115,3.2887544e-7,0.9760998,0.0016720735,0.018395457,0.00057751883,0.0008438019],"about_ca_topic_score_codex":0.00024358343,"about_ca_topic_score_gemma":0.0005518354,"teacher_disagreement_score":0.9324811,"about_ca_system_score_codex":0.00036585046,"about_ca_system_score_gemma":0.00045921307,"threshold_uncertainty_score":0.99974006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52682996,0.00012143491,0.47025743,0.0011938991,0.0014444605,0.000038919457,4.389317e-7,0.000023630491,0.00008983039],"genre_scores_gemma":[0.9614135,0.0000062467184,0.03724727,0.00063822576,0.00067849463,1.858212e-7,8.785691e-7,0.000009529171,0.0000056418485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977756,0.00010127523,0.00080562796,0.00029401382,0.0007174268,0.00030606694],"domain_scores_gemma":[0.9982172,0.0002030858,0.0005651371,0.00017339805,0.0007313201,0.00010982715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291577,0.00017538897,0.0002982746,0.0004758258,0.00012771721,0.00035097028,0.0010779226,0.000053919543,0.0000052983696],"category_scores_gemma":[0.0002000785,0.0001633613,0.00011667812,0.00024328269,0.00010382815,0.00023177675,0.000498918,0.00036291117,0.0000075963667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007745247,0.0015658143,0.18630354,0.0001400056,0.00095314335,0.0033662887,0.0103883585,0.10967897,0.025826726,0.1119323,0.000775921,0.5482944],"study_design_scores_gemma":[0.0017354548,0.00015383161,0.0108249085,0.00064771087,0.0000074163054,0.00039196352,0.00025364896,0.9847812,0.00058815355,0.00024637886,0.00017281913,0.00019653016],"about_ca_topic_score_codex":0.00011648913,"about_ca_topic_score_gemma":0.0000116603715,"teacher_disagreement_score":0.8751022,"about_ca_system_score_codex":0.00013034709,"about_ca_system_score_gemma":0.00014824503,"threshold_uncertainty_score":0.66616803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26094827,0.000016855402,0.6932856,0.03732335,0.0009977443,0.00022449078,0.0000026305559,0.0005527087,0.006648362],"genre_scores_gemma":[0.98037505,0.0000015249253,0.007552831,0.008671923,0.00024418253,0.000013161557,0.0000018360541,0.00000685633,0.0031326602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998874,0.00003690373,0.00014629126,0.0003682697,0.00030727166,0.00026728344],"domain_scores_gemma":[0.9993796,0.000031451495,0.000040407835,0.00033355688,0.00013057808,0.00008440458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020364452,0.00011487376,0.000104518534,0.000088716064,0.000157563,0.0001856065,0.0004859658,0.000049539933,0.00009413883],"category_scores_gemma":[0.000016474776,0.000097054035,0.000067710986,0.0001825906,0.000049832535,0.0001713132,0.00018883661,0.00011170651,0.00024463306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011043914,0.0005697947,0.0050365785,0.00003619353,0.00014599755,0.000045526594,0.0114498725,0.0011544946,0.044214755,0.088815264,0.30953407,0.538887],"study_design_scores_gemma":[0.0005554961,0.00029743003,0.0029727102,0.00002082662,0.000014539742,0.000055780092,0.00010991706,0.8781627,0.025463313,0.00021823311,0.09170821,0.0004208835],"about_ca_topic_score_codex":0.00035842546,"about_ca_topic_score_gemma":0.000033078053,"teacher_disagreement_score":0.87700814,"about_ca_system_score_codex":0.00005893478,"about_ca_system_score_gemma":0.000034802397,"threshold_uncertainty_score":0.39577487},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46400362,0.000014970217,0.53391904,0.00003355297,0.0015957045,0.0002408728,0.000003846576,0.00014257611,0.000045819295],"genre_scores_gemma":[0.98605543,0.000004197669,0.012933861,0.00036962362,0.00055518677,0.00000883926,7.320542e-7,0.000026787626,0.000045333392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785733,0.00017124871,0.0004912598,0.00059141294,0.00022943561,0.00065928453],"domain_scores_gemma":[0.99844027,0.0005594212,0.00023598339,0.00043977593,0.0002060764,0.000118484415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008718995,0.00027621977,0.00032385625,0.000255314,0.001173089,0.00022808574,0.0005113698,0.00012047735,0.0000019432798],"category_scores_gemma":[0.00003690183,0.00028883317,0.00023702893,0.00043782862,0.00008168878,0.00021146699,0.000018554045,0.0005339814,0.000006373575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080215534,0.00013643278,0.0011667156,0.000017987648,0.0000559025,0.000013166886,0.002104289,0.94040596,0.0009885647,0.0002884322,0.00003241905,0.054709896],"study_design_scores_gemma":[0.00081594894,0.00017380512,0.00026836226,0.00016975473,0.000033424883,0.000045521978,0.00032045113,0.9958639,0.0018721442,0.0000951419,0.00002913497,0.0003123731],"about_ca_topic_score_codex":0.0041262475,"about_ca_topic_score_gemma":0.00075789605,"teacher_disagreement_score":0.5220518,"about_ca_system_score_codex":0.00023478651,"about_ca_system_score_gemma":0.000060434682,"threshold_uncertainty_score":0.99995637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06782581,0.0023264366,0.9270704,0.0012995737,0.0004195732,0.00014468457,8.742639e-7,0.00008183234,0.0008308353],"genre_scores_gemma":[0.988612,0.0006674341,0.009293899,0.00046212453,0.0008642177,0.000024595867,0.000003137751,0.000023549508,0.0000490275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858284,0.00023824681,0.00030651773,0.0002910749,0.00020320529,0.00037811298],"domain_scores_gemma":[0.9979686,0.00047239356,0.00029510562,0.0008528731,0.00025694218,0.00015408224],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007561796,0.00019697106,0.00021756146,0.00014490024,0.0021593391,0.00043599718,0.001180931,0.00006276799,6.216747e-7],"category_scores_gemma":[0.000006411447,0.00015831487,0.000082134575,0.000331947,0.00015197085,0.00024924526,0.0003687944,0.00054014445,9.2194847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014155074,0.0001778266,0.00088680757,0.000005724794,0.00018472635,0.000008525008,0.0010575005,0.035663735,0.00015519134,0.031810522,0.00006345869,0.92984444],"study_design_scores_gemma":[0.0004948268,0.00035939924,0.00016779228,0.00027922762,0.000026353715,0.00015235212,0.00008065283,0.9931869,0.000028052988,0.0002498065,0.004751731,0.00022291142],"about_ca_topic_score_codex":0.000039330087,"about_ca_topic_score_gemma":0.00006141044,"teacher_disagreement_score":0.95752317,"about_ca_system_score_codex":0.000070458715,"about_ca_system_score_gemma":0.000048455076,"threshold_uncertainty_score":0.9991397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16375901,0.0021158664,0.8330412,0.00025624497,0.000099547804,0.000173659,0.0000039505335,0.00019190862,0.00035859793],"genre_scores_gemma":[0.94719917,0.00019087433,0.0523314,0.00016895722,0.000046434267,0.000022614146,0.0000042698734,0.000011463315,0.000024828654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988947,0.00014940475,0.00027241555,0.00032933409,0.00012470043,0.00022945907],"domain_scores_gemma":[0.9983192,0.0002798597,0.000098300916,0.0010903804,0.0001158726,0.00009639054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005301915,0.00014483946,0.00019566242,0.00011201499,0.0010633621,0.0003742307,0.0008572161,0.000053360258,3.1126294e-7],"category_scores_gemma":[0.000007921025,0.00014642204,0.000039270442,0.00017590195,0.00017727667,0.00025882688,0.00060834223,0.00021314448,0.0000017819082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031862178,0.000098979566,0.00041068654,0.000061063314,0.000034261262,0.0000021788142,0.0035948409,0.0149829,0.0038906895,0.026954174,0.000055295757,0.9499118],"study_design_scores_gemma":[0.00026778286,0.00005244711,0.00006172898,0.00017384006,0.0000098299315,0.00001999194,0.00019262805,0.99823576,0.000038477505,0.000077631106,0.0006959617,0.0001739075],"about_ca_topic_score_codex":0.00022691952,"about_ca_topic_score_gemma":0.00001585576,"teacher_disagreement_score":0.9832529,"about_ca_system_score_codex":0.000027026028,"about_ca_system_score_gemma":0.000047162383,"threshold_uncertainty_score":0.8178629},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010304447,0.00011541707,0.9854203,0.0017921284,0.00050775305,0.00024130722,0.000012492709,0.0002798483,0.0013262931],"genre_scores_gemma":[0.910742,0.0000018631694,0.08061261,0.006398345,0.00073334086,0.000016864156,0.00004902314,0.000016256086,0.0014297357],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.00007011097,0.00020807188,0.0006263894,0.00018050165,0.0003552847],"domain_scores_gemma":[0.9980264,0.0002651161,0.000061852006,0.0013349177,0.00019845752,0.00011327911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058629893,0.00016344312,0.0001747435,0.00006151944,0.00038564377,0.00031586955,0.0017369093,0.00006971966,0.00003482541],"category_scores_gemma":[0.000117994015,0.00013682,0.000056397228,0.00021601666,0.0000710418,0.00025796265,0.000526802,0.00015815826,0.00006282525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004903639,0.0009030377,0.0032476666,0.000080120466,0.00052706385,0.000047373032,0.0011654476,0.047773477,0.016456164,0.1103838,0.6142889,0.20463659],"study_design_scores_gemma":[0.0005340829,0.0001755515,0.00005453879,0.000027479347,0.0000077285285,0.0000027555943,0.000013521135,0.9844015,0.000937164,0.000043007698,0.013594164,0.00020846832],"about_ca_topic_score_codex":0.00022727887,"about_ca_topic_score_gemma":0.00013871236,"teacher_disagreement_score":0.93662804,"about_ca_system_score_codex":0.000028750403,"about_ca_system_score_gemma":0.00013176021,"threshold_uncertainty_score":0.5579358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030878598,0.000025703417,0.9659345,0.0006372581,0.00047089835,0.00017090274,0.000026575382,0.00014208045,0.0017134612],"genre_scores_gemma":[0.99235564,0.0000012781542,0.006587515,0.000114199196,0.00010170704,0.000013018195,0.00002201597,0.0000038506632,0.0008007423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922305,0.00002468699,0.00012114294,0.00036349442,0.00011914319,0.00014849711],"domain_scores_gemma":[0.998852,0.00014390709,0.0000444489,0.00064141874,0.0002771852,0.000041001163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027205938,0.00007660044,0.0000783422,0.0000550153,0.00014791216,0.0001713476,0.00092856796,0.000024430774,0.000011479253],"category_scores_gemma":[0.000056196153,0.0000628058,0.000019221476,0.00021953003,0.00003417347,0.00020460098,0.00048483608,0.000038689173,0.00003385463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011204065,0.00039250084,0.00081613555,0.00006160719,0.00010196204,0.000007685223,0.009678813,0.00018083787,0.012913243,0.0805535,0.13038301,0.76479864],"study_design_scores_gemma":[0.00012909922,0.00013047883,0.000117888085,0.000043111504,0.000003946277,0.0000014679457,0.00039901442,0.9957627,0.0019521441,0.00014528858,0.001209803,0.0001050733],"about_ca_topic_score_codex":0.000016181568,"about_ca_topic_score_gemma":0.00004206528,"teacher_disagreement_score":0.99558187,"about_ca_system_score_codex":0.000027252845,"about_ca_system_score_gemma":0.000042960073,"threshold_uncertainty_score":0.2561146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27591118,0.00017533964,0.7231362,0.00020945077,0.00016037903,0.00012824357,0.0000021865662,0.00024189081,0.000035176632],"genre_scores_gemma":[0.87248987,0.0000034048578,0.12660761,0.0006322478,0.00018809582,0.000002349377,0.000015033162,0.0000117262125,0.00004968346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987694,0.000037060472,0.00016938159,0.00056182465,0.00014708952,0.0003152347],"domain_scores_gemma":[0.9987957,0.00022086018,0.00006088106,0.0007513787,0.00008377359,0.00008743068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004814421,0.00014502877,0.00017344487,0.000047614823,0.0003881139,0.00028460595,0.0007819636,0.000046563517,0.000001251228],"category_scores_gemma":[0.000029527899,0.000109277404,0.000027264146,0.00013286537,0.000061567946,0.0003746089,0.00045773853,0.00011892014,0.0000027262424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020831596,0.00019357221,0.004579774,0.000081399914,0.00030907674,0.000097532786,0.0016564694,0.24157697,0.00024219532,0.009105756,0.0069394875,0.73500943],"study_design_scores_gemma":[0.0005693309,0.00018791246,0.00035920145,0.00004887647,0.00001751818,0.00007715745,0.000020662725,0.997838,0.0000072134867,0.000026677624,0.0006595981,0.00018782514],"about_ca_topic_score_codex":0.00011272874,"about_ca_topic_score_gemma":0.00012769838,"teacher_disagreement_score":0.75626105,"about_ca_system_score_codex":0.00001186816,"about_ca_system_score_gemma":0.00003753635,"threshold_uncertainty_score":0.44562033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601636,0.00029978255,0.035407346,0.0006520541,0.00056649995,0.00013650411,6.4583315e-7,0.000101818245,0.0026717777],"genre_scores_gemma":[0.9991277,0.00007161315,0.00035746253,0.00022814951,0.00019904012,0.0000025280456,0.0000018841813,0.0000015612999,0.000010080779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999354,0.000061370636,0.00016599975,0.00012955847,0.00010670049,0.0001823808],"domain_scores_gemma":[0.99966055,0.000046255132,0.000067311616,0.00015026564,0.000034908244,0.000040735198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038114886,0.00006450055,0.00008199421,0.00010737582,0.00012971488,0.000384616,0.00042942353,0.00003885263,0.000004110513],"category_scores_gemma":[0.00004875992,0.00006352444,0.00002138297,0.00034978113,0.000019212068,0.0018096315,0.00048737292,0.00012317226,0.0000108364175],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005404982,0.000060116636,0.05075642,0.00010740747,0.000020562025,0.000011197499,0.025861032,0.0000185693,0.00010600391,0.03464129,0.0006561016,0.88770723],"study_design_scores_gemma":[0.002745505,0.00015608191,0.07643898,0.00042756458,0.000015534566,0.000040158666,0.00021639303,0.7371357,0.0004353063,0.09654978,0.08510768,0.000731324],"about_ca_topic_score_codex":0.00013116476,"about_ca_topic_score_gemma":0.00001781851,"teacher_disagreement_score":0.88697594,"about_ca_system_score_codex":0.000015676427,"about_ca_system_score_gemma":0.00002129424,"threshold_uncertainty_score":0.3708861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6011038,0.000030963896,0.37281677,0.0049467366,0.00043528844,0.0001690604,0.0000023537489,0.00064350694,0.019851524],"genre_scores_gemma":[0.98559815,5.961705e-7,0.0061784857,0.0035959617,0.00038253993,0.000005561418,0.0000011310788,0.0000076457,0.0042299195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988931,0.0000573771,0.00014397044,0.0003542656,0.00023896719,0.00031232502],"domain_scores_gemma":[0.9991322,0.000049037902,0.000045505043,0.0005814751,0.00007850728,0.00011326627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024667793,0.0001193056,0.00011319459,0.00014068183,0.00029533936,0.00015373391,0.0006294042,0.000026239928,0.000024285297],"category_scores_gemma":[0.000058728616,0.00010086416,0.00007756042,0.00022809175,0.00005388005,0.00014329485,0.0003120478,0.00010445123,0.00036984554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022088572,0.0009947974,0.043686848,0.00015916637,0.00018526886,0.00039323317,0.0037226097,0.00074783526,0.10661509,0.38742447,0.048043758,0.40780604],"study_design_scores_gemma":[0.0011668483,0.00043287227,0.0029379544,0.00005961275,0.000010201824,0.00010462387,0.000012740244,0.9154261,0.032722086,0.0020970209,0.04438815,0.00064184354],"about_ca_topic_score_codex":0.0011248912,"about_ca_topic_score_gemma":0.00008311055,"teacher_disagreement_score":0.9146782,"about_ca_system_score_codex":0.00012236154,"about_ca_system_score_gemma":0.00018543625,"threshold_uncertainty_score":0.47537395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10658871,0.00023130144,0.8897302,0.001912335,0.00028663193,0.00028429503,0.0000094233665,0.00024357127,0.0007135068],"genre_scores_gemma":[0.9689277,0.0016398384,0.02872486,0.0003910065,0.000029718232,0.000103096594,0.000011328407,0.000026308604,0.00014616913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998213,0.00036553037,0.00046541842,0.00045299903,0.00017245134,0.00033059798],"domain_scores_gemma":[0.9959937,0.00027043463,0.00013790927,0.0032573063,0.00020578846,0.00013491722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003521498,0.00023501508,0.00024948377,0.00036170307,0.00068126613,0.0001976618,0.0019004731,0.00016996906,0.000013062999],"category_scores_gemma":[0.000008829088,0.00025530826,0.000088547815,0.0009120392,0.00026110795,0.0004448057,0.00005466023,0.00063729327,0.000023018314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013544517,0.0053275735,0.0012199604,0.0001092023,0.00027338287,0.000031487525,0.011690099,0.71168035,0.026209924,0.018494612,0.0006650985,0.22416285],"study_design_scores_gemma":[0.0006519569,0.00011406388,0.00028867862,0.00011056162,0.000023786308,0.000013950603,0.00011080183,0.9968011,0.0013957425,0.00014100321,0.000051512437,0.00029689027],"about_ca_topic_score_codex":0.0007778776,"about_ca_topic_score_gemma":0.0016330588,"teacher_disagreement_score":0.86233896,"about_ca_system_score_codex":0.00012343877,"about_ca_system_score_gemma":0.000086088956,"threshold_uncertainty_score":0.9999899},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11849957,0.000049772498,0.8795035,0.00010396136,0.0009239729,0.00012390577,0.0000014954973,0.00050657784,0.00028726208],"genre_scores_gemma":[0.9512227,0.0000039109814,0.04778173,0.0005647295,0.00018838605,0.000016728583,0.0000014806988,0.000023983632,0.00019631858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835247,0.000044024873,0.0003035329,0.0005803299,0.00026020847,0.0004594367],"domain_scores_gemma":[0.9989693,0.00014752036,0.00012451108,0.00040525428,0.00023618585,0.000117222145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032172762,0.00021772175,0.00020011768,0.00021242106,0.0011303395,0.0002947709,0.0007096471,0.000086038555,0.000003347301],"category_scores_gemma":[0.0000010839585,0.00022618058,0.00017963897,0.00039527388,0.000032085525,0.0002354257,0.000014342414,0.00024708835,0.000030559495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042371845,0.00008689813,0.0000029714686,0.000030190138,0.000028163884,9.657838e-7,0.0020558957,0.933229,0.0014242468,0.0013909858,0.0000017049575,0.061706584],"study_design_scores_gemma":[0.00078778365,0.0001241504,0.0000025310837,0.000106030086,0.00002011449,0.000008870759,0.0001689409,0.99426574,0.004009377,0.00013883445,0.00011198149,0.0002556734],"about_ca_topic_score_codex":0.00014740464,"about_ca_topic_score_gemma":0.00014232387,"teacher_disagreement_score":0.83272314,"about_ca_system_score_codex":0.000064856446,"about_ca_system_score_gemma":0.00004202278,"threshold_uncertainty_score":0.92233765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012149154,0.0008583129,0.9829208,0.0028342484,0.0002113167,0.00035102462,0.000003002802,0.000055866207,0.00061623706],"genre_scores_gemma":[0.9589602,0.00018139079,0.039737143,0.00092447014,0.000024375593,0.00013454333,0.0000025014333,0.0000033074973,0.00003210558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990621,0.00019327571,0.00021061207,0.00030376657,0.00008891586,0.00014133689],"domain_scores_gemma":[0.9970387,0.0022438902,0.00010739727,0.00022919863,0.00032395744,0.000056830202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003202314,0.000095482545,0.00011302977,0.000087470864,0.0005985652,0.00026218372,0.00018396309,0.0000389234,0.0000025814304],"category_scores_gemma":[0.000572432,0.000099321886,0.000014992848,0.00023284368,0.0002166768,0.0012290028,0.00012990125,0.000100709505,0.000003439702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002674704,0.0007492087,0.0016308026,0.00006326465,0.000089954556,0.000024013818,0.3332175,0.00071181374,0.0021264488,0.3715732,0.005422654,0.28412366],"study_design_scores_gemma":[0.0010082305,0.00044758318,0.00063579436,0.00005370166,0.000015634358,0.00010234093,0.0058544367,0.96449864,0.00027847782,0.024562547,0.0022645544,0.0002780388],"about_ca_topic_score_codex":0.00005082198,"about_ca_topic_score_gemma":0.000021062544,"teacher_disagreement_score":0.96378684,"about_ca_system_score_codex":0.000024302788,"about_ca_system_score_gemma":0.00016152099,"threshold_uncertainty_score":0.46037403},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30106747,0.00038391064,0.694222,0.0003607069,0.0010346125,0.0025031324,0.00002851386,0.000190469,0.00020923672],"genre_scores_gemma":[0.9918692,0.000035581696,0.00460251,0.0020918716,0.00019924904,0.00097447744,0.00007654539,0.000032582848,0.000117973585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967068,0.00018864458,0.00060575723,0.001396253,0.0004348543,0.00066767907],"domain_scores_gemma":[0.99794626,0.0003651528,0.00036307267,0.0008318718,0.00031321135,0.000180423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010117221,0.0005255067,0.00059040805,0.0003053584,0.00018915716,0.000499941,0.0010262474,0.00029537943,0.00000750009],"category_scores_gemma":[0.000018864428,0.00047646672,0.0001968539,0.00014630043,0.00007410088,0.00012551628,0.0015464942,0.00052693463,0.000004223048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064581574,0.0008609186,0.005257444,0.0007609352,0.0004590219,0.000050535888,0.0046226936,0.88165516,0.00020296365,0.0012709439,0.0004527421,0.103760846],"study_design_scores_gemma":[0.0018777126,0.00025459423,0.0017189076,0.0007000384,0.000041820673,0.0000030583021,0.00050618115,0.993939,0.0002677005,0.0000592491,0.00007829532,0.0005534298],"about_ca_topic_score_codex":0.0013296624,"about_ca_topic_score_gemma":0.00027891534,"teacher_disagreement_score":0.69080174,"about_ca_system_score_codex":0.00030003855,"about_ca_system_score_gemma":0.00020221999,"threshold_uncertainty_score":0.9997687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060343765,0.000047608726,0.9344415,0.00023135779,0.0038472246,0.00032668828,0.000046388013,0.0005165931,0.00019889239],"genre_scores_gemma":[0.99568135,0.000018809062,0.002942033,0.0002997317,0.00026387308,0.000114287715,0.000008881515,0.00001671198,0.0006543374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983848,0.00010276605,0.0003072024,0.0005044991,0.00039248873,0.0003082873],"domain_scores_gemma":[0.9987272,0.000075403404,0.00007518091,0.00063315406,0.0003154371,0.00017364966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026823406,0.00020495719,0.00018249342,0.00019825638,0.00048982253,0.00013094749,0.0004915596,0.00012634236,0.000046499037],"category_scores_gemma":[0.000013877654,0.00019888225,0.00013531176,0.00036714957,0.000099001714,0.00057157176,0.0000053060025,0.0003729023,0.0002851179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012020075,0.0012168544,0.0005004042,0.000050813884,0.00019284153,0.000022570055,0.0049425075,0.019080361,0.015611617,0.00017896129,0.0014236271,0.95665926],"study_design_scores_gemma":[0.001081529,0.00055060437,0.0028282555,0.0000960065,0.000048099555,0.00003311349,0.00020601685,0.97028214,0.023437807,0.000053279262,0.001003991,0.00037913746],"about_ca_topic_score_codex":0.0011446757,"about_ca_topic_score_gemma":0.0002093686,"teacher_disagreement_score":0.9562801,"about_ca_system_score_codex":0.0001603243,"about_ca_system_score_gemma":0.000107810956,"threshold_uncertainty_score":0.8110183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16435932,0.000014267593,0.8222457,0.0004443235,0.00073802605,0.00017299951,0.00000192578,0.00037509837,0.011648296],"genre_scores_gemma":[0.99645066,2.9947935e-7,0.0025813852,0.00016427194,0.00017943095,0.00001186462,0.0000014469646,0.0000025479535,0.0006081197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949634,0.000021144257,0.000089905916,0.00018373379,0.000087213346,0.00012163774],"domain_scores_gemma":[0.9995533,0.00003337154,0.000027166287,0.00024109645,0.000104408835,0.00004062038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020681077,0.000053568325,0.00006007263,0.00002842632,0.000108396394,0.00011031939,0.00027344676,0.000030527743,0.0000027195722],"category_scores_gemma":[0.000012031668,0.00004595626,0.000046726946,0.000089210735,0.000015176942,0.00026672,0.000047767786,0.00002996921,0.000058373873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033866745,0.00006933902,0.00059930846,0.00013963986,0.000036088783,0.0000051439733,0.0015547203,0.000013191569,0.0058936,0.9603482,0.019405533,0.0119013805],"study_design_scores_gemma":[0.0008776874,0.00047317607,0.00052008557,0.00006366426,0.00001385473,0.00003208421,0.00047681766,0.970175,0.015355622,0.0036943352,0.007989663,0.00032799772],"about_ca_topic_score_codex":0.00011786696,"about_ca_topic_score_gemma":0.00006947262,"teacher_disagreement_score":0.9701618,"about_ca_system_score_codex":0.000035973404,"about_ca_system_score_gemma":0.000035161556,"threshold_uncertainty_score":0.1874042},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1928589,0.00001345882,0.80008996,0.00088944926,0.0004856554,0.0001120292,0.0000014563537,0.00018539566,0.005363696],"genre_scores_gemma":[0.9893641,0.0000015489895,0.008967652,0.00038308633,0.00006158584,0.0000074981685,0.000002908112,0.0000028067147,0.0012088163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950427,0.000014435845,0.00008110336,0.0001905659,0.00008192882,0.00012770713],"domain_scores_gemma":[0.9995775,0.00003542379,0.000024024035,0.00024167256,0.00008421117,0.000037119597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015637257,0.000054708824,0.00005204396,0.00003092507,0.00010064134,0.000092829665,0.0002949193,0.000030648607,0.000010174059],"category_scores_gemma":[0.000021120904,0.000048591923,0.0000473783,0.00008575735,0.000024070225,0.00029011836,0.000050932413,0.00003667509,0.000060717186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008331304,0.00029186765,0.0015190801,0.00007524583,0.00008334281,0.000007703216,0.0034309498,0.000059414593,0.022746088,0.79133826,0.0438235,0.13654122],"study_design_scores_gemma":[0.00031792017,0.00021694851,0.00079970714,0.0000074151926,0.0000044776707,0.0000048050515,0.00004877615,0.97556657,0.0015908844,0.017466066,0.003832763,0.00014364906],"about_ca_topic_score_codex":0.00006992602,"about_ca_topic_score_gemma":0.0002106469,"teacher_disagreement_score":0.9755072,"about_ca_system_score_codex":0.000025890196,"about_ca_system_score_gemma":0.000034049208,"threshold_uncertainty_score":0.19815211},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13416329,0.00009415844,0.8628288,0.00010250802,0.0015179414,0.00039091,0.000019755369,0.00040414443,0.0004784738],"genre_scores_gemma":[0.9910859,0.000111936926,0.006191239,0.00025301357,0.00042092236,0.0000021446695,0.000047913614,0.000027158821,0.001859767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778926,0.000130566,0.00023406127,0.0012019321,0.00008556414,0.00055861304],"domain_scores_gemma":[0.9978548,0.00015858207,0.00026231149,0.001266155,0.00025033852,0.00020777824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038558143,0.0003548238,0.00040723974,0.00017321143,0.00031562426,0.00018276446,0.0020194,0.00035761553,0.00001270562],"category_scores_gemma":[0.000053941174,0.00041092822,0.00042480513,0.00029124878,0.00009096322,0.00029936415,0.0016578671,0.000602943,0.000037075304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002863644,0.00020567152,0.0026982415,0.00015943742,0.00044575584,0.00022390182,0.00027971427,0.86328465,0.00019084156,0.12509565,0.0062280726,0.00090173114],"study_design_scores_gemma":[0.00089807453,0.000055421155,0.000069873495,0.00011932571,0.00006360791,0.0000032733737,0.000015613234,0.99120486,0.000048206843,0.0057664975,0.0012871413,0.00046811678],"about_ca_topic_score_codex":0.00023984368,"about_ca_topic_score_gemma":0.000036655587,"teacher_disagreement_score":0.8569226,"about_ca_system_score_codex":0.00017926864,"about_ca_system_score_gemma":0.00015684638,"threshold_uncertainty_score":0.99983424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029374233,0.0006950367,0.98522526,0.009276249,0.0003007728,0.00036315763,0.000010181345,0.00028145924,0.0009104784],"genre_scores_gemma":[0.65796775,0.00032707132,0.33868307,0.002418613,0.0001150255,0.000102650265,0.000026429505,0.000008594221,0.00035081062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921703,0.0000793405,0.0003221789,0.00013075427,0.00009125399,0.00015941358],"domain_scores_gemma":[0.9970767,0.0004005528,0.00011745192,0.0013280542,0.0010179013,0.00005932739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040331815,0.00009960083,0.00011553761,0.00015381124,0.00040577882,0.00021525826,0.0012253992,0.000041290663,0.0000023472237],"category_scores_gemma":[0.00032195894,0.00009519915,0.000032479173,0.00030604025,0.00012473424,0.00069778285,0.0002763923,0.000074410025,0.00012263787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007587989,0.0002752963,0.00034060198,0.000052219246,0.00014288789,0.0000010602548,0.0026810116,0.00048438722,0.012585697,0.11414875,0.31949037,0.54972184],"study_design_scores_gemma":[0.0006827668,0.00013392349,0.00058842136,0.000024454539,0.000015872265,0.00001892358,0.000025103127,0.8443486,0.0004882309,0.0017615374,0.15172696,0.00018517724],"about_ca_topic_score_codex":0.000026830792,"about_ca_topic_score_gemma":0.000016829596,"teacher_disagreement_score":0.84386426,"about_ca_system_score_codex":0.00002696058,"about_ca_system_score_gemma":0.00007896945,"threshold_uncertainty_score":0.3882109},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9371526,0.046091747,0.009912644,0.003121596,0.000880515,0.001483358,0.000009426124,0.00018596,0.0011621325],"genre_scores_gemma":[0.95966,0.035335634,0.0011931895,0.0033565934,0.000053805685,0.00011187412,0.000048306523,0.000015038273,0.00022555182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763566,0.00030541958,0.00049717363,0.00047993177,0.00079406553,0.00028776418],"domain_scores_gemma":[0.9974061,0.00068010145,0.0002796769,0.0010794458,0.0004379858,0.000116637246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028141262,0.00023620437,0.00036542577,0.00052128325,0.00031723123,0.0002230089,0.0005133361,0.0000860327,0.000091269336],"category_scores_gemma":[0.001558225,0.0002042391,0.00009659401,0.001777538,0.00004720603,0.0008993879,0.00020413124,0.0002908838,0.00031851977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013081139,0.0010624295,0.013731586,0.0056721624,0.00050592225,0.00008369858,0.0021590774,0.053388134,0.0015351439,0.04295648,0.015924977,0.8628496],"study_design_scores_gemma":[0.003261766,0.0010074,0.019578097,0.0058814846,0.00055396307,0.00078128197,0.0001327329,0.962161,0.00012740806,0.0017590654,0.003630093,0.0011257001],"about_ca_topic_score_codex":0.00006103782,"about_ca_topic_score_gemma":0.000006591669,"teacher_disagreement_score":0.9087729,"about_ca_system_score_codex":0.00028339168,"about_ca_system_score_gemma":0.00021236757,"threshold_uncertainty_score":0.83286285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00994496,0.0000630924,0.977584,0.00035142104,0.00062896893,0.000050367456,1.12856746e-7,0.000177666,0.011199435],"genre_scores_gemma":[0.9957272,0.00001862032,0.0015106056,0.0022263296,0.000126111,0.0000023216119,0.0000016102936,0.0000014747727,0.0003857176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948925,0.000015589541,0.00013126654,0.000076101845,0.00013238947,0.0001553783],"domain_scores_gemma":[0.99950427,0.000020396365,0.00003027958,0.00028783522,0.00010093047,0.00005629235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012762066,0.000057323527,0.00005181175,0.00006704511,0.000091941045,0.00017921883,0.00040943184,0.000028343416,0.00004767783],"category_scores_gemma":[0.0000150932665,0.000046139718,0.000039392682,0.00024924456,0.000019860481,0.000626498,0.00015119513,0.000061014867,0.00081348536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010014442,0.00006881814,0.001984903,0.0000066974594,0.000046311347,0.000007211942,0.0013150487,0.0041468726,0.000042264386,0.29300055,0.055456933,0.64391434],"study_design_scores_gemma":[0.000086218955,0.000045525874,0.00042716597,0.0000052950973,0.0000019101597,0.000008232954,0.000030105693,0.94702846,0.00019111866,0.00026472824,0.051818192,0.000093025854],"about_ca_topic_score_codex":0.000054785673,"about_ca_topic_score_gemma":0.0000035753492,"teacher_disagreement_score":0.98578227,"about_ca_system_score_codex":0.000019495435,"about_ca_system_score_gemma":0.000017381006,"threshold_uncertainty_score":0.9999645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3594709,0.00043219473,0.6303978,0.00036230686,0.00090463425,0.00030734486,0.0000028029838,0.00019487244,0.007927164],"genre_scores_gemma":[0.99192387,0.000008619471,0.0021603706,0.0011606613,0.00014363189,0.000024545963,0.0000016505873,0.0000061157525,0.004570518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922645,0.0000216445,0.00013593218,0.0003036613,0.00009271916,0.00021958757],"domain_scores_gemma":[0.9994672,0.000094084084,0.000038052003,0.0002401646,0.000078871475,0.00008161865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019440055,0.00009561014,0.00011310977,0.000074135154,0.000103590435,0.0001880129,0.00035470058,0.000033643115,0.0000135883965],"category_scores_gemma":[0.000029819565,0.00007840811,0.000049929782,0.00008715882,0.000046206,0.00029227417,0.00012319625,0.000060815026,0.000033821387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010988669,0.00031778414,0.008681748,0.000081208826,0.00015782123,0.000021489699,0.0048899543,0.000030887153,0.01843161,0.20522623,0.07176345,0.69028795],"study_design_scores_gemma":[0.0040110503,0.0022017155,0.0021980167,0.00008477753,0.000044721924,0.00014826251,0.00061676005,0.8828032,0.023831371,0.0035912585,0.079435274,0.0010336125],"about_ca_topic_score_codex":0.00023822967,"about_ca_topic_score_gemma":0.000043084336,"teacher_disagreement_score":0.88277227,"about_ca_system_score_codex":0.000019572586,"about_ca_system_score_gemma":0.000017346865,"threshold_uncertainty_score":0.319739},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43952197,0.00020649166,0.559412,0.000051491512,0.0006741693,0.000064542306,9.6451316e-8,0.000020765745,0.00004848814],"genre_scores_gemma":[0.95727974,0.000011851567,0.042171832,0.00012185797,0.0002479617,4.935466e-7,5.163918e-7,0.000013711341,0.0001520142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984244,0.0001093687,0.0006206023,0.00022901116,0.00034063915,0.000275947],"domain_scores_gemma":[0.9984614,0.00012622081,0.00073346676,0.00015731552,0.00043057496,0.0000909997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899942,0.00016209864,0.0003157136,0.00025907523,0.00023077984,0.00026283727,0.00049575395,0.00006297116,0.0000073128995],"category_scores_gemma":[0.00023698072,0.0001449846,0.00014981853,0.00010049167,0.000110529014,0.0005013828,0.00016978962,0.00040786646,3.4360164e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024962542,0.0000753676,0.0011305811,0.0002176015,0.00032003238,0.000016692682,0.030241719,0.8806772,0.075930715,0.0007441659,0.00041244828,0.009983807],"study_design_scores_gemma":[0.00070695515,0.00049889175,0.00006632593,0.0005484977,0.00003485338,0.0003082375,0.00018345739,0.98872274,0.008601885,0.00011310446,0.000066576686,0.00014847203],"about_ca_topic_score_codex":0.00024497212,"about_ca_topic_score_gemma":0.000002823744,"teacher_disagreement_score":0.5177578,"about_ca_system_score_codex":0.00009235,"about_ca_system_score_gemma":0.000042137206,"threshold_uncertainty_score":0.59123003},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09590705,0.0001626062,0.9014701,0.00024905344,0.00051955384,0.00024682438,9.289305e-7,0.00010383475,0.0013400418],"genre_scores_gemma":[0.9962867,0.00004250328,0.0020920085,0.0013449807,0.00008623693,0.000027957103,0.000005746626,0.0000030580034,0.00011081998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914014,0.000024498864,0.00028805312,0.00013732383,0.00014010028,0.00026989556],"domain_scores_gemma":[0.9993197,0.00007845398,0.00005917,0.0002639489,0.000222098,0.00005665939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025387184,0.00010454044,0.000118354,0.00015396581,0.00008636283,0.00032717694,0.00044736516,0.00005289487,0.00001110162],"category_scores_gemma":[0.000022474687,0.00008818581,0.0000726933,0.0002586143,0.000033265205,0.0012951676,0.00012109956,0.0000816483,0.000059763817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013329185,0.00021549374,0.0033747335,0.000046823432,0.00008628609,0.000011322239,0.0035826226,0.027144559,0.00026835658,0.6769518,0.011824949,0.27635974],"study_design_scores_gemma":[0.00045135248,0.00015163366,0.00088989775,0.000024082485,0.0000036873607,0.000004832763,0.0009487394,0.9899033,0.00017936766,0.0010733777,0.0062048216,0.00016495422],"about_ca_topic_score_codex":0.00033500808,"about_ca_topic_score_gemma":0.00011231746,"teacher_disagreement_score":0.9627587,"about_ca_system_score_codex":0.000055159475,"about_ca_system_score_gemma":0.00007432477,"threshold_uncertainty_score":0.3596113},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0822787,0.00003572407,0.8758112,0.00081933965,0.00035252929,0.00008021371,0.0000014224436,0.0004090938,0.040211756],"genre_scores_gemma":[0.97520345,0.0000021520318,0.022474427,0.00096904446,0.00012093865,0.0000047745025,0.0000014618693,0.0000054121415,0.0012183253],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99922854,0.000013598136,0.00010574622,0.00025950576,0.00018590926,0.00020668641],"domain_scores_gemma":[0.9994334,0.000023725022,0.000035509514,0.00033682474,0.00010091509,0.000069630325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117513875,0.00008926563,0.000076299,0.000063124695,0.00015320985,0.00020137336,0.00029517832,0.000025697203,0.00009304059],"category_scores_gemma":[0.0000037482828,0.00006451386,0.000039268623,0.00016439098,0.00005628843,0.00045114526,0.0000684592,0.00007700914,0.00022507978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058828686,0.00038342417,0.0031432018,0.000014458904,0.00017260906,0.0002642486,0.0018499308,0.000027472135,0.0058693727,0.047003698,0.013783347,0.9274294],"study_design_scores_gemma":[0.008805701,0.0074274773,0.42195278,0.0007691703,0.00015142425,0.0021213184,0.0011642226,0.39561522,0.07842584,0.04854896,0.029603278,0.005414605],"about_ca_topic_score_codex":0.0001280409,"about_ca_topic_score_gemma":0.000043868084,"teacher_disagreement_score":0.92201483,"about_ca_system_score_codex":0.000010003905,"about_ca_system_score_gemma":0.00002324594,"threshold_uncertainty_score":0.28930205},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03446185,0.0007573833,0.9616454,0.00093343266,0.00083109876,0.00034754354,0.000009051488,0.00033925747,0.0006749679],"genre_scores_gemma":[0.9406406,0.0001925945,0.057974502,0.00052916363,0.0001236619,0.00032040972,0.000013723695,0.000019555311,0.00018573561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988659,0.00013279602,0.00025885497,0.00030075936,0.00012281323,0.00031884946],"domain_scores_gemma":[0.99563026,0.00073646684,0.00012288788,0.0032316416,0.00018998257,0.00008872874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032782124,0.00014525467,0.00017605734,0.00008689824,0.00096238847,0.00021429714,0.0032996521,0.000115347415,0.0000028373704],"category_scores_gemma":[0.00003925131,0.00015126412,0.00012589789,0.00034205004,0.00019186884,0.00029408588,0.00037404403,0.0003741286,0.000043392633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033065655,0.00068622595,0.0006029535,0.00003523052,0.00018607425,0.0000025325035,0.0046779634,0.008656135,0.004384018,0.60430616,0.003867797,0.37256187],"study_design_scores_gemma":[0.00016570352,0.000082190905,0.00015674686,0.00008748731,0.000012826066,0.0000068811323,0.00006935494,0.98858154,0.00007315393,0.005381412,0.0051780883,0.00020460598],"about_ca_topic_score_codex":0.000083330975,"about_ca_topic_score_gemma":0.00018782594,"teacher_disagreement_score":0.9799254,"about_ca_system_score_codex":0.00007091597,"about_ca_system_score_gemma":0.000061417675,"threshold_uncertainty_score":0.7402011},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29698858,0.0000073651545,0.6977566,0.00006568446,0.0001546383,0.0000251875,5.0792465e-7,0.000039957515,0.0049614916],"genre_scores_gemma":[0.9957803,4.9660673e-7,0.0038044397,0.00013203827,0.000008006405,5.508008e-7,2.9110933e-7,0.0000015330799,0.000272341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995207,0.000055993532,0.0001108393,0.00012286469,0.000088222354,0.0001013381],"domain_scores_gemma":[0.99963385,0.00005854055,0.000027240709,0.0002007852,0.00006178188,0.000017777762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005837338,0.000035171684,0.000069130474,0.00005169131,0.000019182262,0.000020347545,0.0002990648,0.000017180037,0.000010876172],"category_scores_gemma":[0.000058039186,0.000030249628,0.000015626894,0.00022600112,0.0000125384095,0.000098947145,0.00012359228,0.000034193046,0.000024083236],"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.00002310241,0.00021276601,0.089270875,0.000010641208,0.000023862583,0.000016832975,0.002489915,0.00003503918,0.04717723,0.7682612,0.00095270894,0.09152583],"study_design_scores_gemma":[0.00045911912,0.00022571898,0.32259038,0.0000417547,0.0000013946675,0.000004908775,0.00006803947,0.65525824,0.015436064,0.005690131,0.000024657276,0.00019957394],"about_ca_topic_score_codex":0.0057601132,"about_ca_topic_score_gemma":0.002490632,"teacher_disagreement_score":0.76257104,"about_ca_system_score_codex":0.000008234831,"about_ca_system_score_gemma":0.000022027318,"threshold_uncertainty_score":0.8707606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013357174,0.0000033454442,0.96288747,0.001040079,0.00016247843,0.035520136,0.00002095832,0.00017104059,0.00006091038],"genre_scores_gemma":[0.81542134,1.3449454e-7,0.026501264,0.0024638122,0.0005845737,0.15414393,0.00038789483,0.000015577047,0.00048148978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989869,0.000022021619,0.0001916065,0.00040650638,0.00017093531,0.00022200531],"domain_scores_gemma":[0.9983864,0.00008871427,0.00007595046,0.0009584643,0.0004223687,0.00006809035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038560442,0.00010395749,0.000099668505,0.00002257033,0.0001818245,0.0001696004,0.00094298023,0.00005321982,0.000006254439],"category_scores_gemma":[0.00010564616,0.00008419314,0.000045567664,0.00018977404,0.000051803985,0.00029059543,0.00018668486,0.00006249072,0.000016635251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012254845,0.0038180738,0.0042249695,0.00044684537,0.00035677323,0.000014437574,0.00026283687,0.03199602,0.02059462,0.32805812,0.31020305,0.29879877],"study_design_scores_gemma":[0.0012000033,0.00015899836,0.00047470082,0.000043537137,0.0000049445416,0.0000024140106,0.000005393169,0.9787022,0.00046937523,0.000041943844,0.01877036,0.00012613535],"about_ca_topic_score_codex":0.00017456629,"about_ca_topic_score_gemma":0.000054488715,"teacher_disagreement_score":0.9467062,"about_ca_system_score_codex":0.000048502683,"about_ca_system_score_gemma":0.000116047384,"threshold_uncertainty_score":0.34332964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043851707,0.00023889965,0.9532578,0.000712643,0.00044763405,0.00031343586,7.238087e-7,0.00015632037,0.0010208237],"genre_scores_gemma":[0.99647087,0.000019948851,0.0020629077,0.00094143796,0.00021063999,0.000037199854,0.000010490216,0.0000050690815,0.00024143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897236,0.00004722723,0.00029677554,0.00019385034,0.00021277987,0.00027703217],"domain_scores_gemma":[0.99934405,0.00007162881,0.00009369313,0.00023681982,0.0002052402,0.000048579575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046482825,0.00010431414,0.00011395055,0.00014307258,0.00022962438,0.00024403802,0.00047399316,0.00007916352,0.00000552516],"category_scores_gemma":[0.000057437268,0.000099025114,0.00005236385,0.00034554192,0.000022575348,0.0011951885,0.0001259044,0.0001259958,0.000041435775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002076937,0.0003292972,0.0066242316,0.00011635692,0.00010323082,0.000010064288,0.012266527,0.0599784,0.00013100433,0.1661953,0.019348279,0.7346896],"study_design_scores_gemma":[0.00071676285,0.00008876652,0.00521382,0.00002583876,0.000005151533,0.000004548177,0.0000488784,0.9871308,0.000032686126,0.0009903187,0.005550725,0.00019165702],"about_ca_topic_score_codex":0.00009460993,"about_ca_topic_score_gemma":0.00015061168,"teacher_disagreement_score":0.9526192,"about_ca_system_score_codex":0.00009948039,"about_ca_system_score_gemma":0.00007648833,"threshold_uncertainty_score":0.40381268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9162401,0.00020949265,0.08198382,0.000051639036,0.00091765734,0.00022361362,0.0000035094965,0.00007675161,0.000293423],"genre_scores_gemma":[0.9920689,0.0000066667058,0.007321509,0.00017878867,0.0002574656,0.0000144963215,0.0000015170783,0.000008442005,0.00014221077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914354,0.00003504337,0.00016264775,0.00034246797,0.00008372518,0.0002325712],"domain_scores_gemma":[0.9993556,0.00029591165,0.00005292005,0.00017679161,0.000039521685,0.000079236605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028395865,0.00011111114,0.00015075148,0.000098343604,0.00007949422,0.0001291443,0.00022554207,0.000050295534,0.0000024950673],"category_scores_gemma":[0.000051604064,0.0001063542,0.000025812054,0.000078697114,0.00007224528,0.00023215695,0.00010645112,0.00012591375,0.000009201234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049808405,0.00011622477,0.014462575,0.00006338092,0.00003199702,0.000024651597,0.018887134,0.00012477547,0.017706461,0.0002785193,0.0028875817,0.9453669],"study_design_scores_gemma":[0.00076741626,0.00014738143,0.0044956356,0.00006947013,0.0000042461324,0.000019113075,0.00009131745,0.9897974,0.0026259786,0.000088967514,0.0017247635,0.00016826957],"about_ca_topic_score_codex":0.00060521223,"about_ca_topic_score_gemma":0.00018287144,"teacher_disagreement_score":0.98967266,"about_ca_system_score_codex":0.000023416133,"about_ca_system_score_gemma":0.000016547787,"threshold_uncertainty_score":0.43369985},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018430848,0.00033363685,0.9781841,0.00034087567,0.0021334924,0.0003148228,0.0000026099947,0.00016200432,0.00009762925],"genre_scores_gemma":[0.97775644,0.000044483557,0.021459222,0.00012032199,0.00032480052,0.000058964106,6.564784e-7,0.00001842327,0.0002166771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875253,0.000117012,0.0002865832,0.00035296933,0.00013773878,0.00035315473],"domain_scores_gemma":[0.9983609,0.0006962774,0.000102427635,0.00067450886,0.00011159481,0.00005429172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060738873,0.0001692731,0.00019075564,0.00012989376,0.0006403489,0.00009733126,0.0009674982,0.000077890916,0.000004148175],"category_scores_gemma":[0.000008228671,0.0001371765,0.00019761025,0.0004171381,0.00010644841,0.00016531511,0.000010653885,0.00020609907,0.000011450904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000934365,0.0001455733,0.0000019585023,0.000020834748,0.00011685002,0.0000012950901,0.0024813684,0.29837132,0.0016959469,0.00021264535,0.00029269097,0.6965661],"study_design_scores_gemma":[0.00039772963,0.0003140508,0.000023662285,0.00013822515,0.000044735894,0.000014418986,0.00006522619,0.9963809,0.00065541436,0.00024435334,0.0015504988,0.00017077489],"about_ca_topic_score_codex":0.0000085990305,"about_ca_topic_score_gemma":0.000049694918,"teacher_disagreement_score":0.9593256,"about_ca_system_score_codex":0.000057260808,"about_ca_system_score_gemma":0.00006943999,"threshold_uncertainty_score":0.55938953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21590614,0.00021429708,0.7786929,0.001421285,0.0010816152,0.00032917925,0.0000018248887,0.0003011423,0.0020516186],"genre_scores_gemma":[0.99284786,0.00001371143,0.001105972,0.004450767,0.00014637875,0.00003725132,0.0000055958185,0.000012110298,0.0013803283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980356,0.00010229655,0.00040449796,0.0005604824,0.0003564399,0.0005406857],"domain_scores_gemma":[0.9987354,0.00012701053,0.00009494045,0.0006565464,0.00023067863,0.00015541237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004567971,0.00022818906,0.00025817606,0.00018955929,0.00014364962,0.0001991298,0.0007082152,0.0000842662,0.00008605775],"category_scores_gemma":[0.000024269752,0.00019681912,0.00012991829,0.00030746683,0.00008251289,0.00031133107,0.0002768516,0.00020301214,0.000106885906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002510919,0.005159639,0.24363585,0.00020011325,0.00076538255,0.0018298106,0.003925836,0.09900341,0.022528935,0.13865459,0.13219202,0.34959352],"study_design_scores_gemma":[0.0018783739,0.0003692044,0.00446661,0.000110160734,0.0000074909426,0.000008547446,0.00022578101,0.9899398,0.0009201026,0.000030148076,0.0016875027,0.00035626502],"about_ca_topic_score_codex":0.0011376081,"about_ca_topic_score_gemma":0.00068634865,"teacher_disagreement_score":0.8909364,"about_ca_system_score_codex":0.00017006106,"about_ca_system_score_gemma":0.000090139845,"threshold_uncertainty_score":0.8026051},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39255032,0.000039285893,0.606333,0.00022250247,0.0002559015,0.0003311851,0.000005851569,0.0001925547,0.00006937869],"genre_scores_gemma":[0.9922086,0.000035283734,0.006977705,0.000017456308,0.0000107146325,0.0001706979,0.0000021938083,0.000012683046,0.0005646899],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988298,0.0000398335,0.00033135636,0.00037633578,0.0001523247,0.00027039734],"domain_scores_gemma":[0.99925345,0.0000511228,0.00009522136,0.00044999228,0.00011959812,0.000030637057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027922748,0.00013372247,0.00023313136,0.0006032518,0.000079172976,0.000031195294,0.00047865877,0.0001559988,0.0000037679117],"category_scores_gemma":[0.0000032016083,0.00013505915,0.000100954225,0.0004805049,0.000079028745,0.00013768554,0.0000078280955,0.00014506016,0.000018880864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050924625,0.0038510049,0.00010193047,0.00046738493,0.00073975,0.000115703326,0.004958169,0.10179514,0.47318524,0.029084627,0.00071956037,0.38447225],"study_design_scores_gemma":[0.0008609004,0.00044806057,0.000041288917,0.0002026267,0.00002898992,0.000012925208,0.0004618227,0.94545996,0.052092507,0.000056167086,0.00017279276,0.00016197353],"about_ca_topic_score_codex":0.000033199467,"about_ca_topic_score_gemma":0.000039064664,"teacher_disagreement_score":0.8436648,"about_ca_system_score_codex":0.000094781215,"about_ca_system_score_gemma":0.000010400527,"threshold_uncertainty_score":0.5507552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33448562,0.000016767195,0.6640588,0.00060811406,0.00021884209,0.00020548847,0.0000011680785,0.00019559743,0.0002096135],"genre_scores_gemma":[0.9344698,4.265264e-7,0.060210437,0.004249841,0.0002655746,0.000017840433,0.0000062889194,0.00001599477,0.0007637517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986115,0.00004342083,0.0001748,0.00053688965,0.00023025826,0.0004031387],"domain_scores_gemma":[0.99860317,0.0001689791,0.00006462222,0.0006924119,0.00030512284,0.00016571934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028043974,0.00018608932,0.00019193339,0.00008254181,0.0002943059,0.00023356904,0.0006439696,0.000065295,0.000013010894],"category_scores_gemma":[0.000021511309,0.00014659783,0.000066504275,0.00033240498,0.00004013539,0.00026610238,0.00015645938,0.000100167614,0.000055181765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032748454,0.002300723,0.11606282,0.0005564131,0.0013593277,0.00049291085,0.0036106643,0.15724203,0.15641667,0.1731515,0.1440035,0.24152862],"study_design_scores_gemma":[0.0015532456,0.0008812978,0.0040291543,0.0001648797,0.000051711646,0.000008197553,0.000055140044,0.94313604,0.03655517,0.00012736412,0.012712158,0.0007256326],"about_ca_topic_score_codex":0.00070812996,"about_ca_topic_score_gemma":0.00096159,"teacher_disagreement_score":0.78589404,"about_ca_system_score_codex":0.000043611857,"about_ca_system_score_gemma":0.00007113173,"threshold_uncertainty_score":0.59780854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013464298,0.00001568747,0.9833958,0.00052802975,0.00047834782,0.00016144924,3.47742e-7,0.00036682314,0.0015891975],"genre_scores_gemma":[0.9477877,0.0000024750793,0.050131954,0.0009139003,0.00038075805,0.000019608346,0.000010289363,0.0000131779025,0.0007401492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988744,0.00010722181,0.00018000958,0.00036246484,0.00014979295,0.00032610874],"domain_scores_gemma":[0.9991704,0.0002572066,0.000060546427,0.00027794286,0.00013942232,0.00009445145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045881627,0.00012086309,0.0001375753,0.00008967093,0.00044370285,0.00025160084,0.00044212135,0.000076234086,0.000028900911],"category_scores_gemma":[0.000054387267,0.00010873222,0.000084196414,0.00021554748,0.000039569506,0.00029060824,0.00011700264,0.00020204287,0.000008734125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004632003,0.00004907871,0.00035507878,0.000010903836,0.000016422831,0.0000030806993,0.00018589117,0.92902887,0.00035185344,0.009076109,0.001088688,0.059787698],"study_design_scores_gemma":[0.00048524933,0.0001844695,0.00003601559,0.000023629784,0.00000574907,0.0000026158962,0.000012987082,0.9981251,0.00017709789,0.000085908985,0.00070404616,0.0001571725],"about_ca_topic_score_codex":0.00005498354,"about_ca_topic_score_gemma":0.000012081951,"teacher_disagreement_score":0.9343234,"about_ca_system_score_codex":0.000034068784,"about_ca_system_score_gemma":0.000056925237,"threshold_uncertainty_score":0.44339713},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42416307,0.00003111134,0.57100004,0.0041882345,0.00017180631,0.00020553161,0.000037789043,0.000055636367,0.00014676785],"genre_scores_gemma":[0.919816,0.0000067952283,0.077623196,0.002321485,0.00004453845,0.00012856621,0.0000055965124,0.000007250969,0.000046568093],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99883115,0.00017099566,0.00034293407,0.00026302278,0.00018216933,0.00020971608],"domain_scores_gemma":[0.9966582,0.00056113064,0.00018003598,0.0022838844,0.00024132954,0.00007540629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004346625,0.00011223763,0.00019134706,0.00021891276,0.00027591968,0.000060912167,0.0025579599,0.00003128054,0.000001650704],"category_scores_gemma":[0.00017834952,0.000116749325,0.000099629084,0.00063846685,0.00017154319,0.00031456686,0.00040597073,0.000100918594,0.000014513091],"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.00005823713,0.00026839154,0.0011992087,0.000018658398,0.00008719505,5.9196685e-7,0.017591411,0.0000386969,0.9023838,0.013309685,0.0018973835,0.063146725],"study_design_scores_gemma":[0.00692342,0.0028535025,0.3706548,0.0010325796,0.00021784505,0.000050759496,0.008759239,0.28442112,0.2761829,0.0015680884,0.04203407,0.005301697],"about_ca_topic_score_codex":0.0007397312,"about_ca_topic_score_gemma":0.00012314059,"teacher_disagreement_score":0.6262009,"about_ca_system_score_codex":0.00006921943,"about_ca_system_score_gemma":0.000038328868,"threshold_uncertainty_score":0.47608992},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04127671,0.00004953463,0.9549057,0.0008941881,0.00088366074,0.0008059605,0.000019120038,0.001145469,0.000019683683],"genre_scores_gemma":[0.85216874,0.000011492463,0.14699607,0.00023690292,0.00006329222,0.00026524242,0.0000017211366,0.000036685335,0.00021983768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977792,0.00007701842,0.00040017805,0.00083784317,0.00022247934,0.0006833119],"domain_scores_gemma":[0.9980515,0.0002989378,0.00011292891,0.001075767,0.00032514907,0.00013569382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032722263,0.0003492209,0.00034017296,0.00066076143,0.0006958189,0.00009785831,0.0010463794,0.0004265666,0.00001444247],"category_scores_gemma":[0.000037654518,0.0003427797,0.00024074638,0.0005769785,0.00032588688,0.00032942396,0.0000136613735,0.0005051363,0.0002514443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039546072,0.002344393,0.000035781744,0.000113795606,0.00054883916,0.00012960153,0.0015709643,0.069524005,0.36414865,0.0039233975,0.00030604767,0.55695903],"study_design_scores_gemma":[0.0014034412,0.00062121043,0.0000052262685,0.000049390954,0.000055268716,0.0000614808,0.00014919562,0.81125057,0.18428911,0.0001583989,0.0015858088,0.0003708735],"about_ca_topic_score_codex":0.000056839963,"about_ca_topic_score_gemma":0.000052460808,"teacher_disagreement_score":0.81089205,"about_ca_system_score_codex":0.00012677383,"about_ca_system_score_gemma":0.00006199633,"threshold_uncertainty_score":0.9999024},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5077139,0.00017839237,0.48782915,0.0007044518,0.0001393486,0.00007001633,9.997954e-8,0.00013620245,0.0032284518],"genre_scores_gemma":[0.9974755,0.0000065897752,0.0012748365,0.0008926967,0.00007588892,0.0000030239594,9.542595e-7,0.0000044965204,0.00026600395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992606,0.0000681818,0.00014766876,0.00025988117,0.00009593166,0.00016770394],"domain_scores_gemma":[0.9995864,0.000031707346,0.00003420667,0.00026883816,0.000027029457,0.000051792864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027054557,0.00007473802,0.00008647592,0.00007772366,0.00009398799,0.00012822085,0.00019044541,0.000040965053,0.0000033522056],"category_scores_gemma":[0.000012568485,0.00006705062,0.00002210569,0.00014470432,0.000029563787,0.00014186907,0.00016020067,0.000092845345,0.000008558272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000634775,0.00024195001,0.010748229,0.00002464031,0.00005892326,0.0001478702,0.0032827903,0.0156189315,0.016193822,0.019486634,0.003703012,0.9304297],"study_design_scores_gemma":[0.00021965761,0.00007304055,0.00868187,0.000027427595,0.0000020296663,0.000071011986,0.000023155,0.9896286,0.00032201462,0.00014505579,0.00068413204,0.000122018115],"about_ca_topic_score_codex":0.00042257953,"about_ca_topic_score_gemma":0.0003628967,"teacher_disagreement_score":0.97400963,"about_ca_system_score_codex":0.00002892431,"about_ca_system_score_gemma":0.000010182934,"threshold_uncertainty_score":0.27342448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43368694,0.000040281968,0.5647868,0.000029282886,0.00071981666,0.0004939942,0.0000055378255,0.000121400844,0.00011596402],"genre_scores_gemma":[0.99392796,0.0000069854723,0.00535309,0.00022813729,0.00004340481,0.000071918126,0.0000016826582,0.000020207972,0.0003465917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985263,0.000110129244,0.00031864454,0.00055328786,0.00011511059,0.00037656547],"domain_scores_gemma":[0.9986146,0.00075679214,0.00008179308,0.0003867772,0.000089240995,0.000070796064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003567907,0.00020660735,0.00025217157,0.00022594798,0.0002612595,0.0001598085,0.00046364297,0.000076186596,0.000005283421],"category_scores_gemma":[0.000006097708,0.00020933752,0.00015183752,0.00032061743,0.000017817638,0.00024954663,0.0000071046857,0.0003767354,0.000059067854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024549101,0.00019817968,0.00025252503,0.00003840734,0.000013894922,0.000004248192,0.0010527811,0.9328697,0.022372318,0.00006716882,0.000014833526,0.043091394],"study_design_scores_gemma":[0.0012373414,0.0002898378,0.00007962997,0.000110812805,0.000006783919,0.000005623014,0.00021233551,0.9540804,0.043536115,0.000026989908,0.00014144329,0.0002726955],"about_ca_topic_score_codex":0.00021264833,"about_ca_topic_score_gemma":0.00016586014,"teacher_disagreement_score":0.56024104,"about_ca_system_score_codex":0.00009101234,"about_ca_system_score_gemma":0.00007188965,"threshold_uncertainty_score":0.85365367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2103897,0.00025861023,0.7816171,0.002846678,0.00026323806,0.0004812591,0.000021023394,0.00030898862,0.0038134002],"genre_scores_gemma":[0.99294215,0.00039091872,0.0047931094,0.0007681645,0.000008973915,0.00012082962,0.0000053937283,0.000024789644,0.00094563747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982425,0.0004351857,0.00034716117,0.0004453615,0.00024344162,0.000286367],"domain_scores_gemma":[0.9964306,0.00039256463,0.00011197677,0.0027795972,0.00014387068,0.00014143887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047731365,0.0002300349,0.0002844886,0.00023722294,0.00045678945,0.00021218663,0.0015075465,0.00009660547,0.000021966007],"category_scores_gemma":[0.0000055353203,0.00022821232,0.00013212589,0.000446858,0.00012416499,0.00040652312,0.000042838496,0.0006062417,0.000093236435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007075325,0.008598628,0.0009804157,0.0009961704,0.0014563828,0.000022642576,0.03140318,0.04461194,0.14772688,0.37942797,0.0007525459,0.3833157],"study_design_scores_gemma":[0.0010605126,0.000098327815,0.0011119804,0.00017170877,0.00005428579,0.00008833675,0.00064365217,0.9944375,0.0010259618,0.00034674758,0.0005104562,0.00045050238],"about_ca_topic_score_codex":0.00035481775,"about_ca_topic_score_gemma":0.000086895285,"teacher_disagreement_score":0.9498256,"about_ca_system_score_codex":0.00008694028,"about_ca_system_score_gemma":0.00007021479,"threshold_uncertainty_score":0.9306228},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13415466,0.00004326955,0.82970154,0.0020590618,0.00078236643,0.00013386366,2.7172712e-7,0.00019379793,0.03293113],"genre_scores_gemma":[0.98942465,7.5259635e-7,0.0055008754,0.0035607242,0.00016419264,0.000006398525,6.6832416e-7,0.000003117001,0.0013386098],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992526,0.000051212548,0.00012221742,0.0002128061,0.00013417137,0.00022695943],"domain_scores_gemma":[0.99951625,0.000059304664,0.000022584565,0.0003299598,0.000027626127,0.000044270382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003089934,0.00006917093,0.00007368641,0.000046558445,0.00005956428,0.00007020857,0.00037695697,0.000027844259,0.000048785925],"category_scores_gemma":[0.000009616772,0.000058441507,0.000029890014,0.00020926296,0.000021665803,0.00010261205,0.00008855563,0.00006800164,0.0001536906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031102018,0.0010199032,0.049593784,0.00004798804,0.000087349035,0.00014357909,0.003912516,0.10550509,0.002414653,0.12412047,0.5306573,0.18218637],"study_design_scores_gemma":[0.0007480671,0.00018012535,0.0022930154,0.000029117173,0.0000018132893,0.000002381882,0.000025728417,0.9883803,0.00040075474,0.0004222844,0.007353544,0.00016284264],"about_ca_topic_score_codex":0.00031462367,"about_ca_topic_score_gemma":0.00049080874,"teacher_disagreement_score":0.88287526,"about_ca_system_score_codex":0.00003765791,"about_ca_system_score_gemma":0.00003918396,"threshold_uncertainty_score":0.23831755},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051967002,0.000054271703,0.9431838,0.0021092673,0.00096164964,0.00017346458,0.000049389066,0.00019618352,0.0013049919],"genre_scores_gemma":[0.9534156,0.0000010801662,0.043513637,0.0009410764,0.00024947766,0.0000027196706,0.00001949918,0.000006578256,0.0018503565],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990024,0.00001720904,0.000103134436,0.00047019552,0.00016962053,0.00023742105],"domain_scores_gemma":[0.99841493,0.000066951405,0.000036779922,0.0013430044,0.00006988847,0.00006843111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015091602,0.00010069063,0.00009593707,0.000048007387,0.00013690614,0.00017726356,0.00154036,0.000037435602,0.000025710317],"category_scores_gemma":[0.000042894164,0.00007826386,0.000038718306,0.00014070956,0.00003854021,0.00019795235,0.0006158507,0.00005778439,0.000035966274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012986096,0.00020687803,0.0007241531,0.00006396636,0.000174385,0.000022784798,0.0025985804,0.0009846948,0.023760963,0.23270191,0.5518581,0.18677372],"study_design_scores_gemma":[0.0004279989,0.00013254113,0.00026309854,0.000014856908,0.000009256239,0.000013771241,0.00004808048,0.9694135,0.0014740191,0.0006225338,0.027381036,0.0001992824],"about_ca_topic_score_codex":0.000112894,"about_ca_topic_score_gemma":0.00011798794,"teacher_disagreement_score":0.96842885,"about_ca_system_score_codex":0.00001976707,"about_ca_system_score_gemma":0.0000406584,"threshold_uncertainty_score":0.31915075},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92898744,0.017703691,0.04396661,0.0042596376,0.0011528771,0.0005106041,0.0000034003888,0.00024669478,0.0031690313],"genre_scores_gemma":[0.98276836,0.01194844,0.00045144843,0.0005595098,0.0041859704,0.000006260384,0.00001229989,0.00003110698,0.00003660358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972304,0.00019342975,0.00031843546,0.00083863345,0.00019873283,0.0012203456],"domain_scores_gemma":[0.9985916,0.00051427033,0.000110142384,0.0003499163,0.000055015655,0.00037903615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012007279,0.0002397975,0.00034612638,0.00012120197,0.00053171016,0.0006359407,0.000586591,0.00010457201,0.0000046744226],"category_scores_gemma":[0.000009233132,0.000241537,0.000049159527,0.00023211609,0.00019608508,0.0003779896,0.000534208,0.0009272165,0.000021868162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012149763,0.000049443097,0.004536485,0.000095026895,0.0003523173,0.00011472658,0.0022465496,0.005328828,0.0006704148,0.26084995,0.006384068,0.71815723],"study_design_scores_gemma":[0.0012425618,0.00071269344,0.0001366266,0.000115739225,0.0000132566065,0.00010320494,0.00011549779,0.93433416,0.000040440736,0.013020533,0.049728673,0.0004366088],"about_ca_topic_score_codex":0.00023430472,"about_ca_topic_score_gemma":0.00040834758,"teacher_disagreement_score":0.9290053,"about_ca_system_score_codex":0.00029405105,"about_ca_system_score_gemma":0.00029308174,"threshold_uncertainty_score":0.9849593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014761243,0.00046076791,0.9807046,0.0016062801,0.00054648257,0.0009213143,0.00012533668,0.0002413617,0.00063260697],"genre_scores_gemma":[0.98161435,0.000518573,0.015097542,0.0005593876,0.000014854188,0.0003501781,0.000029540757,0.000023332654,0.0017922241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854296,0.00017005368,0.00036969752,0.00037792986,0.00019113917,0.00034818778],"domain_scores_gemma":[0.9962054,0.0010920804,0.00013043966,0.0020388702,0.00040421105,0.00012898161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028979513,0.0002173349,0.00025466856,0.00013795048,0.0007828209,0.00019411829,0.001504639,0.0001138817,0.000012683911],"category_scores_gemma":[0.000012107004,0.00022211175,0.00018880237,0.00046441445,0.000092631046,0.00055625744,0.000012579085,0.00042176884,0.00006899451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088758726,0.0067645637,0.00030625693,0.00014318027,0.0019909188,0.000008025506,0.010682579,0.47920215,0.27567896,0.024211971,0.0150048435,0.18511896],"study_design_scores_gemma":[0.0018190676,0.00028804355,0.000024864474,0.00009566674,0.000077316596,0.000013518929,0.0010004772,0.979812,0.008176546,0.00007577517,0.008151964,0.000464734],"about_ca_topic_score_codex":0.00020655009,"about_ca_topic_score_gemma":0.0001776468,"teacher_disagreement_score":0.96685314,"about_ca_system_score_codex":0.0001497101,"about_ca_system_score_gemma":0.00010615629,"threshold_uncertainty_score":0.9057454},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060730235,0.00033726066,0.056635413,0.0001162923,0.00043832706,0.00009754621,0.000005993173,0.00008928649,0.94221914],"genre_scores_gemma":[0.012875091,0.000059904596,0.0010030066,0.00016889254,0.000051930503,6.077736e-7,0.000004793157,0.000016123797,0.98581964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989381,0.000010034767,0.00019239214,0.00033332032,0.00036741165,0.00015878708],"domain_scores_gemma":[0.9988131,0.00006745088,0.000102467464,0.00085822336,0.00010518739,0.000053562915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001863335,0.00016293244,0.00028005772,0.00014156563,0.000027181053,0.00005759727,0.00085319026,0.00014070302,0.0003747199],"category_scores_gemma":[0.0000030992983,0.00014478162,0.000168795,0.00002364336,0.00003546272,0.00016774208,0.00041517557,0.00024415724,0.0007883898],"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.000002527543,0.0000070048754,0.0000041160456,0.000035669153,0.00003323682,0.000010161051,0.000031148917,0.000018226785,0.00011878827,0.98586076,0.007863123,0.006015214],"study_design_scores_gemma":[0.0008084136,0.0006139596,0.00005447635,0.00057999924,0.00004780636,0.000051078965,0.000023331851,0.042513795,0.00021793682,0.046969242,0.9067718,0.0013481538],"about_ca_topic_score_codex":0.00009181003,"about_ca_topic_score_gemma":0.000009902337,"teacher_disagreement_score":0.93889153,"about_ca_system_score_codex":0.000040436516,"about_ca_system_score_gemma":0.00014958638,"threshold_uncertainty_score":0.9999896},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085474895,0.00016717624,0.98505294,0.0002474722,0.00020816576,0.00019195392,3.007009e-7,0.00019017377,0.005394348],"genre_scores_gemma":[0.9784971,0.0000040006016,0.019760432,0.0008941805,0.00018629027,0.000029190147,0.000004287591,0.000009069388,0.0006154541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990342,0.00008917278,0.00012943738,0.00038495756,0.00009970642,0.00026247016],"domain_scores_gemma":[0.9993899,0.00017323431,0.00003958426,0.000191023,0.0001221329,0.00008413674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004108147,0.0001259928,0.00014608048,0.000056810684,0.00037979402,0.0002747294,0.00027415322,0.00005019478,0.0000047256763],"category_scores_gemma":[0.00007072898,0.00010437595,0.00005056847,0.00014358084,0.000058567464,0.00027308264,0.00007758373,0.00012000647,0.000005251664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035315563,0.0004872852,0.009566741,0.00020235096,0.0003054685,0.00002416607,0.014563361,0.45247832,0.0020506105,0.0933344,0.007393224,0.4192409],"study_design_scores_gemma":[0.00044139096,0.00021884906,0.00015180979,0.000013668727,0.000006268133,0.000007723152,0.00011760334,0.99726063,0.00011243143,0.000046784022,0.0014650038,0.00015785453],"about_ca_topic_score_codex":0.00010657105,"about_ca_topic_score_gemma":0.0000262248,"teacher_disagreement_score":0.9699496,"about_ca_system_score_codex":0.000020159458,"about_ca_system_score_gemma":0.000030569594,"threshold_uncertainty_score":0.42563275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036902383,0.00010116358,0.96049774,0.00058999774,0.000731135,0.0008376161,0.0000075043235,0.00026223165,0.00007025764],"genre_scores_gemma":[0.99086595,0.00024079745,0.0079712,0.00027506705,0.00001695146,0.0003933759,0.0000056669205,0.000027193018,0.00020379885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984905,0.0002458363,0.00036299083,0.0004015579,0.00017303987,0.0003260554],"domain_scores_gemma":[0.99705607,0.00060712954,0.00011062181,0.0020529411,0.00009368178,0.00007955798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047276466,0.00019686732,0.00023036222,0.00027386035,0.00050625915,0.00015849764,0.0014283145,0.00011223926,0.000006721838],"category_scores_gemma":[0.0000021176036,0.00021875103,0.0001735668,0.00041375184,0.00003819841,0.0004492998,0.000007682619,0.00048236715,0.000041017436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010175598,0.00034711589,0.0000084509675,0.000009865821,0.0000473745,0.0000017490523,0.0005774608,0.9727052,0.008134342,0.0054976665,0.000022564245,0.012546487],"study_design_scores_gemma":[0.0012029364,0.00014102174,0.000007950226,0.00007811434,0.000020269365,0.00003402227,0.00005177609,0.98354554,0.01388322,0.0006475757,0.0001230155,0.00026454328],"about_ca_topic_score_codex":0.00036433258,"about_ca_topic_score_gemma":0.00044324828,"teacher_disagreement_score":0.9539636,"about_ca_system_score_codex":0.00016906422,"about_ca_system_score_gemma":0.000060980718,"threshold_uncertainty_score":0.8920408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51914245,0.00012487014,0.47821134,0.000084362655,0.000107483436,0.000047221358,5.8636864e-8,0.0000843392,0.0021978521],"genre_scores_gemma":[0.98985946,0.000019638306,0.00793111,0.0008128906,0.00012823615,0.000003994171,3.2229573e-7,0.00000864729,0.0012356751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891824,0.00008246102,0.000184014,0.00034716388,0.00016467614,0.00030346648],"domain_scores_gemma":[0.9993088,0.000087257096,0.000054338685,0.0004027396,0.000058279325,0.00008857974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003011662,0.00013049514,0.00012072372,0.00013436613,0.000102228456,0.00022028998,0.00061393104,0.00004634866,0.000013749652],"category_scores_gemma":[0.000007778288,0.00009766267,0.00003749415,0.00028938663,0.000045737932,0.00015702005,0.0001657667,0.00021535414,0.000037295664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012039103,0.0017035024,0.3737992,0.000079302445,0.00017698813,0.002024903,0.038818337,0.11883938,0.01310996,0.017982733,0.0029258176,0.42933595],"study_design_scores_gemma":[0.00049603154,0.0003719132,0.005906911,0.00013511463,0.0000065701984,0.00006414761,0.00018507283,0.9898669,0.0015611069,0.00011245853,0.0009895407,0.00030420165],"about_ca_topic_score_codex":0.0011921104,"about_ca_topic_score_gemma":0.0016409087,"teacher_disagreement_score":0.8710275,"about_ca_system_score_codex":0.000035645935,"about_ca_system_score_gemma":0.000018818528,"threshold_uncertainty_score":0.3982568},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18442205,0.00017332323,0.8094822,0.0024637848,0.00037576485,0.0002570198,0.000005546458,0.00025831064,0.0025619688],"genre_scores_gemma":[0.9816854,0.00015123143,0.017021097,0.00045720398,0.000006376291,0.00006176529,0.0000029845799,0.000010985493,0.00060293206],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998924,0.00019978639,0.00025708097,0.00025481242,0.00015977661,0.00020452529],"domain_scores_gemma":[0.9974136,0.00023080526,0.000055854634,0.0022011166,0.0000440632,0.00005459436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027152235,0.00011945455,0.00015628892,0.000261843,0.00027365456,0.00010649766,0.0015519393,0.000057810583,0.000020467907],"category_scores_gemma":[0.000004219722,0.0001301118,0.000105026025,0.0004914978,0.000032877648,0.0004262716,0.000016457521,0.00048013846,0.00019783241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000151019,0.004350172,0.0029403311,0.00010251502,0.00039866325,0.000021778565,0.011064116,0.24664691,0.31967303,0.28180942,0.0005312171,0.13231084],"study_design_scores_gemma":[0.0011317913,0.00005337209,0.00042637356,0.000110116554,0.0000088274,0.000014362377,0.0001054457,0.9943053,0.001596726,0.0006550215,0.0012941532,0.0002984715],"about_ca_topic_score_codex":0.00063113926,"about_ca_topic_score_gemma":0.00052537734,"teacher_disagreement_score":0.7972634,"about_ca_system_score_codex":0.00010198034,"about_ca_system_score_gemma":0.00005330438,"threshold_uncertainty_score":0.5305806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32090667,0.00014146858,0.6766023,0.000617808,0.0006809186,0.00027496796,0.0000029784026,0.0006250742,0.00014783561],"genre_scores_gemma":[0.9969737,0.000025129144,0.0015270706,0.000329328,0.000023272454,0.000059765094,0.000003006362,0.000031680946,0.0010270658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981364,0.00011735822,0.0002664976,0.0007339233,0.000267306,0.00047850024],"domain_scores_gemma":[0.9985009,0.00008100721,0.00009711729,0.0010608276,0.00016946155,0.000090689566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017966806,0.00030909278,0.0003552323,0.00047809287,0.00035920404,0.00011087666,0.0007463696,0.00036691967,0.000021759735],"category_scores_gemma":[0.0000032543849,0.0002693844,0.00014132237,0.0009869318,0.00013177741,0.00027469773,0.000011242572,0.0010219599,0.00017326343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027811897,0.0009042365,0.0004007284,0.000048040987,0.00086181937,0.000913251,0.00071720465,0.6865948,0.17158179,0.010318936,0.00027772642,0.12710337],"study_design_scores_gemma":[0.0025189966,0.0013822222,0.00009606985,0.00021172642,0.00012606246,0.00062830676,0.0003349874,0.8846439,0.107547775,0.00017258165,0.0013677403,0.0009696012],"about_ca_topic_score_codex":0.00006811132,"about_ca_topic_score_gemma":0.000077624805,"teacher_disagreement_score":0.676067,"about_ca_system_score_codex":0.00011929144,"about_ca_system_score_gemma":0.00008258631,"threshold_uncertainty_score":0.99997586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029117167,0.000027412902,0.9639468,0.00024221047,0.0003075457,0.00020590874,0.0000013446698,0.00019337625,0.005958194],"genre_scores_gemma":[0.9720844,0.0000012598526,0.025949718,0.0013479629,0.00022411392,0.000036873385,0.0000099553245,0.000010618432,0.00033512258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987928,0.000060936985,0.00019800873,0.00042887474,0.00014955379,0.0003697836],"domain_scores_gemma":[0.9992365,0.00013816493,0.000048617396,0.00044292808,0.00006177289,0.0000719896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056722737,0.0001342027,0.00016466863,0.00011130019,0.00015591376,0.00017865204,0.00069697056,0.000076885764,0.000003296724],"category_scores_gemma":[0.000017058735,0.000118084965,0.000084936655,0.00027140207,0.000039484054,0.00026693413,0.00009929833,0.00014846807,0.000008844531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043679858,0.0011601562,0.026798222,0.00018212601,0.000117473144,0.000036094505,0.0027344967,0.14343473,0.0029684552,0.26859844,0.032309875,0.5212231],"study_design_scores_gemma":[0.0005775482,0.00007984846,0.00031280727,0.0000158745,0.0000027752978,0.0000026247756,0.000030018939,0.997993,0.00008232312,0.00046281755,0.00026468205,0.00017567238],"about_ca_topic_score_codex":0.00020143662,"about_ca_topic_score_gemma":0.000086694985,"teacher_disagreement_score":0.94296724,"about_ca_system_score_codex":0.000037923957,"about_ca_system_score_gemma":0.00004022683,"threshold_uncertainty_score":0.4815365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016838208,0.000117243944,0.98218733,0.00011535765,0.00017193562,0.00010478575,8.220908e-8,0.00019211392,0.00027292626],"genre_scores_gemma":[0.97924626,0.000031797183,0.020408006,0.00017955374,0.0000986425,0.000011260411,4.559852e-7,0.000009165524,0.000014875414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988311,0.00002924407,0.00014868131,0.0003338867,0.0002755664,0.00038153815],"domain_scores_gemma":[0.9993628,0.00007984293,0.000048947524,0.0003112766,0.000092158705,0.00010493726],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00067761476,0.00014646447,0.00013088311,0.0001452312,0.0017183049,0.00031924,0.00048503123,0.000042341195,6.020961e-7],"category_scores_gemma":[0.000004609938,0.00013431396,0.000024816167,0.0007825785,0.0003169565,0.00037343957,0.000018206723,0.00036314613,7.516596e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074012564,0.00001292385,0.000033042605,0.000006327881,0.000009030685,5.8338514e-7,0.00045354431,0.9798267,0.00008173906,0.0006993492,0.0000059864483,0.018863391],"study_design_scores_gemma":[0.00024668494,0.00014616307,0.00018066225,0.00005332125,0.000011178778,0.000015157493,0.00005282612,0.99894,0.000034313674,0.000002898977,0.00014430696,0.00017247448],"about_ca_topic_score_codex":0.000035603247,"about_ca_topic_score_gemma":0.000009692556,"teacher_disagreement_score":0.96240807,"about_ca_system_score_codex":0.000055771317,"about_ca_system_score_gemma":0.000062822175,"threshold_uncertainty_score":0.99958134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6445829,0.00012823277,0.22688016,0.0017818114,0.00041484478,0.000042553955,1.7535005e-7,0.00056209764,0.12560718],"genre_scores_gemma":[0.9855246,0.00000993551,0.003037483,0.00062220724,0.000026329446,8.3648155e-7,9.2522235e-8,0.0000012644161,0.010777281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996788,0.000007685761,0.000042201398,0.000104552244,0.000084712294,0.00008207333],"domain_scores_gemma":[0.99973345,0.000012519651,0.000007600529,0.00020219479,0.000014166007,0.000030055555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030969906,0.000031662898,0.000034512588,0.00002101288,0.00006419871,0.000018182702,0.00024578162,0.0000116044475,0.000011712589],"category_scores_gemma":[0.0000041690273,0.00002576543,0.000026579195,0.000070082984,0.000008362448,0.000110977635,0.00006371983,0.000033793218,0.00024948607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118418375,0.00033438986,0.026196757,0.000010152485,0.000054711552,0.0008103749,0.0022009287,0.00040216156,0.021266162,0.513377,0.32938582,0.105949685],"study_design_scores_gemma":[0.0021479898,0.00046163792,0.05021624,0.000035014906,0.000011090233,0.003044923,0.00010057718,0.66963285,0.021517524,0.004884533,0.2464086,0.0015390071],"about_ca_topic_score_codex":0.00005265163,"about_ca_topic_score_gemma":0.00000214322,"teacher_disagreement_score":0.6692307,"about_ca_system_score_codex":0.0000054476573,"about_ca_system_score_gemma":0.000011801851,"threshold_uncertainty_score":0.32067218},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11307866,0.00023596798,0.87950546,0.00007010861,0.0002803575,0.00017322377,0.0000014669783,0.00020812044,0.006446664],"genre_scores_gemma":[0.9908545,0.000011313768,0.008213056,0.0003515842,0.00025795837,0.0000106710795,0.000005838428,0.00001124037,0.00028381505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985345,0.000086725246,0.0001910243,0.000623668,0.00019990034,0.00036420388],"domain_scores_gemma":[0.99851173,0.0001248676,0.00006296306,0.0011693025,0.000056630175,0.0000745019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062522583,0.00014570111,0.00015806065,0.000118135715,0.00018301255,0.00023635231,0.0015055754,0.00004802421,0.000008971971],"category_scores_gemma":[0.000021153532,0.00011255465,0.00002069934,0.00037037325,0.000044533073,0.0012806671,0.00072168873,0.00029702438,0.000020860634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032156758,0.00052388397,0.015239216,0.00003254992,0.00020409214,0.00030192547,0.008671523,0.24634394,0.001745225,0.03084991,0.004214785,0.6915514],"study_design_scores_gemma":[0.00032526423,0.00019067712,0.00048276872,0.00009303395,0.000004708544,0.000019098052,0.00025075296,0.9975044,0.000076191776,0.000078156154,0.0007688659,0.00020609185],"about_ca_topic_score_codex":0.0020532345,"about_ca_topic_score_gemma":0.0017236911,"teacher_disagreement_score":0.87777585,"about_ca_system_score_codex":0.000044087712,"about_ca_system_score_gemma":0.00006363578,"threshold_uncertainty_score":0.45898452},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21008764,0.000039863367,0.78007776,0.0010053719,0.0009464298,0.0003757874,0.0000010932863,0.0001738847,0.007292193],"genre_scores_gemma":[0.99645334,7.240434e-7,0.0020665226,0.0005646642,0.0004909918,0.000021175603,0.0000012222549,0.0000044708886,0.0003968906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992847,0.000045668163,0.00012886607,0.00023815868,0.00008209366,0.00022052276],"domain_scores_gemma":[0.99964654,0.000111253554,0.000027701433,0.00011584351,0.00007378646,0.000024863068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028226245,0.00007398111,0.00010071306,0.000044464115,0.00021395808,0.000117821364,0.00028050732,0.000032358497,0.0000041119824],"category_scores_gemma":[0.000027765886,0.000064779066,0.000033491866,0.00015579599,0.00003390079,0.00018427105,0.00006620582,0.00007460098,0.0000110999335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013815075,0.0003293623,0.0029626118,0.00005758063,0.00006951471,0.000031111344,0.023184074,0.006449737,0.0032700058,0.6781943,0.020925537,0.264388],"study_design_scores_gemma":[0.0004895217,0.00014364209,0.000701031,0.000025543732,0.0000030220715,0.0000041624694,0.00006136965,0.990941,0.000081917446,0.004219567,0.0031467183,0.0001825008],"about_ca_topic_score_codex":0.00011708324,"about_ca_topic_score_gemma":0.00056833535,"teacher_disagreement_score":0.9844913,"about_ca_system_score_codex":0.00004308315,"about_ca_system_score_gemma":0.00003630248,"threshold_uncertainty_score":0.26416135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27407396,0.00014591891,0.7225834,0.0011582325,0.00050724903,0.0012554553,0.00001685015,0.00013190313,0.00012702901],"genre_scores_gemma":[0.8774899,0.0000052281757,0.10875886,0.012053896,0.000072412724,0.0002717857,0.00002975078,0.000027738608,0.001290376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978848,0.00008899404,0.00039412032,0.00071090914,0.0003134337,0.00060775864],"domain_scores_gemma":[0.9986042,0.00041791302,0.00009229407,0.00053650304,0.00015594339,0.00019316966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060953485,0.0002654045,0.0003326726,0.00024188017,0.0000850472,0.00017926961,0.0007680333,0.00011424344,0.00003355435],"category_scores_gemma":[0.000018950475,0.0002505368,0.00020133155,0.00032566334,0.000024138635,0.00018314512,0.00016352518,0.00018273089,0.000070304864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019513591,0.0023760144,0.016783407,0.00016472359,0.00032261646,0.00016586385,0.0009869416,0.2796753,0.070119075,0.0038533167,0.034358,0.5892434],"study_design_scores_gemma":[0.003983796,0.0006414634,0.00056595425,0.00008379274,0.000013346577,0.0000017252603,0.00009414657,0.9874836,0.0040296107,0.000013535179,0.0027065855,0.00038240862],"about_ca_topic_score_codex":0.000702646,"about_ca_topic_score_gemma":0.00030867686,"teacher_disagreement_score":0.7078083,"about_ca_system_score_codex":0.0002588705,"about_ca_system_score_gemma":0.00019925443,"threshold_uncertainty_score":0.9999947},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88445055,0.00007722571,0.11498779,0.000114386574,0.000098599885,0.00009632515,0.0000027310111,0.00004123413,0.0001311705],"genre_scores_gemma":[0.9993234,0.0000073594138,0.00054082647,0.000024401983,0.0000056187027,0.0000026539656,0.0000015858739,0.0000020213408,0.00009208825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949175,0.000013134506,0.00014077134,0.00015504753,0.0000921806,0.00010710589],"domain_scores_gemma":[0.99973315,0.00003857528,0.00002888122,0.0001407092,0.000028813185,0.000029856172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013211902,0.00006078829,0.00011995086,0.000048970058,0.00000853104,0.000020072463,0.000103640166,0.000023833893,0.000003232636],"category_scores_gemma":[0.000015489231,0.00005250386,0.00003074681,0.000096010095,0.000008194296,0.00016112502,0.0000674722,0.00006806395,0.0000065557997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014408727,0.0005991206,0.023796214,0.00023121644,0.00014894476,0.000060020047,0.004001602,0.07758179,0.28580162,0.4544643,0.0006093131,0.15256178],"study_design_scores_gemma":[0.00050883484,0.00013585665,0.038980078,0.00007255469,0.0000023296336,0.00000820606,0.00014663729,0.9572786,0.002669684,0.000029084646,0.000053940228,0.00011419348],"about_ca_topic_score_codex":0.00013254608,"about_ca_topic_score_gemma":0.000014441683,"teacher_disagreement_score":0.8796968,"about_ca_system_score_codex":0.00002986903,"about_ca_system_score_gemma":0.000011816431,"threshold_uncertainty_score":0.21410453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41443112,0.000034806875,0.582859,0.00010401618,0.00038985867,0.000506502,0.00004096784,0.00024585208,0.0013878942],"genre_scores_gemma":[0.9880619,0.000018402246,0.008200906,0.00023970718,0.00019841437,0.000009372776,0.00004280181,0.000038733946,0.0031897402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971573,0.00016768252,0.0002731573,0.0015985951,0.00018663029,0.0006166857],"domain_scores_gemma":[0.99732125,0.00036095604,0.00033245172,0.0014752868,0.0002540588,0.0002559953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047199184,0.00053050293,0.00050642266,0.00020729183,0.00040057424,0.0002580595,0.0020819106,0.00028777943,0.00001486243],"category_scores_gemma":[0.000041619744,0.0005388951,0.00031637234,0.00030934688,0.00015344482,0.0004142203,0.0015303127,0.00076642097,0.000024634626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052180287,0.00022387394,0.00094754674,0.00013406151,0.00050149433,0.00025622576,0.00064444036,0.9605079,0.00017587692,0.034833226,0.0010924896,0.00016101026],"study_design_scores_gemma":[0.0019323518,0.0003025023,0.00016619991,0.00018430034,0.00021531997,0.0000128924385,0.00018907897,0.9917303,0.00030226825,0.0038851285,0.00021731648,0.0008623704],"about_ca_topic_score_codex":0.0005728334,"about_ca_topic_score_gemma":0.000065056825,"teacher_disagreement_score":0.57465804,"about_ca_system_score_codex":0.00030437607,"about_ca_system_score_gemma":0.0004733138,"threshold_uncertainty_score":0.99970627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84769404,0.0014670179,0.13730063,0.006140908,0.00092993473,0.0004902041,0.0000031064908,0.0004364423,0.005537739],"genre_scores_gemma":[0.9944955,0.00021373191,0.0047213994,0.00024114609,0.00005483597,0.000008997013,0.0000039412616,0.000017739867,0.00024272563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998165,0.00039699688,0.0005249248,0.0002659238,0.00029581308,0.00035134645],"domain_scores_gemma":[0.99764466,0.00037532835,0.00024856618,0.0010858135,0.000488645,0.00015699524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053181185,0.00018329409,0.00023780788,0.00035144962,0.0004766949,0.00028923023,0.0023032648,0.00010308926,0.000014569663],"category_scores_gemma":[0.00012229549,0.000164176,0.00008591403,0.0013113376,0.000042747615,0.00052598584,0.00012218392,0.0012873106,0.00007624058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004054373,0.005008329,0.022140237,0.00015545501,0.00018834516,0.00015404649,0.008986609,0.0147570055,0.18180996,0.009374071,0.0025604554,0.75446004],"study_design_scores_gemma":[0.0016792208,0.00028598472,0.005605625,0.0011816388,0.000016243526,0.00032623933,0.000095642186,0.98607254,0.0013833453,0.00078209396,0.0021435886,0.00042785666],"about_ca_topic_score_codex":0.000024781288,"about_ca_topic_score_gemma":0.000012406012,"teacher_disagreement_score":0.9713155,"about_ca_system_score_codex":0.00016784287,"about_ca_system_score_gemma":0.00024006325,"threshold_uncertainty_score":0.6694903},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071478456,0.00045955132,0.924491,0.00020299193,0.0018247879,0.0010778797,0.000010190583,0.00014844428,0.0003067062],"genre_scores_gemma":[0.9495326,0.000008300348,0.049729437,0.000033887984,0.00019613173,0.000040260296,0.00002431533,0.000014072601,0.00042096566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987845,0.000085703476,0.00037999346,0.0003313703,0.00022544355,0.00019303523],"domain_scores_gemma":[0.9988728,0.0002873074,0.00024680718,0.0003731642,0.00014858684,0.00007130883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063630845,0.00012178004,0.00024983022,0.00010367309,0.000060717306,0.00008538258,0.00024242199,0.00008305262,0.0000016455629],"category_scores_gemma":[0.00015509107,0.00011402105,0.000058389465,0.0001228737,0.000023694045,0.00021704697,0.00009116712,0.00007201567,0.000012175727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021600259,0.0004529552,0.021903202,0.0020351072,0.00034983212,0.000008100461,0.028690208,0.57215023,0.14058937,0.0063857324,0.005107192,0.22211203],"study_design_scores_gemma":[0.0008100386,0.00006632506,0.00032862593,0.00014068463,0.000008915417,0.000005836384,0.00028963617,0.9971462,0.0006409981,0.0000047907415,0.00042849855,0.00012946645],"about_ca_topic_score_codex":0.0002654336,"about_ca_topic_score_gemma":0.0000025139157,"teacher_disagreement_score":0.8780542,"about_ca_system_score_codex":0.000037530644,"about_ca_system_score_gemma":0.000030081543,"threshold_uncertainty_score":0.46496436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12183644,0.00032411245,0.87691146,0.00016264067,0.0002668902,0.0002165248,0.0000012775668,0.00012771731,0.00015290822],"genre_scores_gemma":[0.9981004,0.00014757804,0.00084258005,0.00078349205,0.00003760028,0.000034195167,0.000011454073,0.000007981409,0.00003472338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985992,0.000052180218,0.0004689873,0.00029506773,0.00030202928,0.00028258224],"domain_scores_gemma":[0.9992241,0.00013938216,0.00022026087,0.00018397572,0.00013292441,0.000099337114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039982382,0.00022227527,0.00019346073,0.00013289085,0.00058925134,0.0007841656,0.00022911026,0.000117776006,0.000023085087],"category_scores_gemma":[0.0000054187626,0.00020154609,0.000052479205,0.0003653057,0.000053443593,0.003969786,0.000011931125,0.0004202684,0.000005925065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071077004,0.00013181835,0.00007000973,0.00016697375,0.000036927864,4.3129728e-7,0.0044747605,0.38078934,0.0011318993,0.00073806604,0.00030188012,0.61208683],"study_design_scores_gemma":[0.00043000327,0.00010407206,0.000029593008,0.00025339052,0.000016993643,0.000006625122,0.0003101515,0.9973601,0.0008814512,0.00009321112,0.0002685201,0.00024589224],"about_ca_topic_score_codex":0.000037634934,"about_ca_topic_score_gemma":0.000003033257,"teacher_disagreement_score":0.876264,"about_ca_system_score_codex":0.000059760285,"about_ca_system_score_gemma":0.000044093373,"threshold_uncertainty_score":0.8218811},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22035034,0.00014543581,0.7767113,0.0003283366,0.00037247624,0.00046592252,0.0000014434416,0.00010666337,0.0015180693],"genre_scores_gemma":[0.9763128,0.000014585723,0.01927315,0.00070670043,0.00007573171,0.00003518723,0.000019579687,0.000011559614,0.0035507025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897456,0.0000445828,0.00019074841,0.00040495466,0.00010357102,0.00028159],"domain_scores_gemma":[0.99920964,0.0001731888,0.00007377737,0.0003192098,0.00013963827,0.00008451896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025414972,0.00015589353,0.00018960402,0.00005903228,0.00015237446,0.00017572536,0.00032041324,0.00008206771,0.000012895992],"category_scores_gemma":[0.000012682492,0.00013174412,0.00006311092,0.00011546636,0.000017055503,0.00028764253,0.00008905888,0.000092927396,0.000015732636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041919292,0.0006769557,0.03202709,0.00034504803,0.00023462003,0.000018572993,0.0047392575,0.82416886,0.038834877,0.04657301,0.008119012,0.043843508],"study_design_scores_gemma":[0.0011734752,0.00020726639,0.0002492292,0.000028351142,0.000012919962,0.0000015643689,0.00008241931,0.99563825,0.0016514806,0.00009994503,0.00064489373,0.00021018111],"about_ca_topic_score_codex":0.00020484165,"about_ca_topic_score_gemma":0.00008145927,"teacher_disagreement_score":0.7574382,"about_ca_system_score_codex":0.00003983621,"about_ca_system_score_gemma":0.000078266276,"threshold_uncertainty_score":0.5372369},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08379037,0.0000430551,0.9135226,0.00097584294,0.00047754808,0.00016124774,0.0000075596304,0.00014545381,0.0008763273],"genre_scores_gemma":[0.9904291,0.000003375199,0.0065983282,0.00041586673,0.00011427971,0.000013477114,0.00005410318,0.000004321649,0.0023671212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923986,0.000025785763,0.000113975635,0.00026511287,0.00011513055,0.0002401056],"domain_scores_gemma":[0.9994356,0.00012041617,0.00002482959,0.00030774882,0.000044537544,0.00006689357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020449779,0.000080123216,0.00010018076,0.000017699562,0.00007146129,0.00011440786,0.00038799882,0.000057461657,0.000015702579],"category_scores_gemma":[0.000016998601,0.000066312256,0.00009206378,0.000093570554,0.0000141045575,0.00018919325,0.00013200691,0.000120500285,0.000057084326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012589156,0.00020784422,0.003716434,0.00002657751,0.00006952842,0.000009161998,0.00016677848,0.05773472,0.0011270499,0.7759324,0.06767081,0.093212806],"study_design_scores_gemma":[0.00032844374,0.000104476094,0.00075864396,0.0000053909253,0.0000031967088,0.000007028849,0.0000067849805,0.98814976,0.000077007746,0.0003471446,0.010098212,0.00011388137],"about_ca_topic_score_codex":0.000025440822,"about_ca_topic_score_gemma":0.000002366931,"teacher_disagreement_score":0.9304151,"about_ca_system_score_codex":0.000028529641,"about_ca_system_score_gemma":0.000024459918,"threshold_uncertainty_score":0.27041352},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18111503,0.000054585365,0.8159215,0.000029118359,0.000907047,0.0013027705,0.000021339103,0.00038561146,0.00026301038],"genre_scores_gemma":[0.97444284,0.000008667488,0.024356019,0.00024511365,0.00010633841,0.0005151745,0.000003315919,0.000023964229,0.00029859145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832684,0.000053418105,0.00034121188,0.0006433041,0.00023529983,0.00039993686],"domain_scores_gemma":[0.99845,0.00044490403,0.000108758955,0.00074669597,0.0001352682,0.000114406386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033527755,0.0002135187,0.0002475029,0.00015923513,0.00048816824,0.00017931864,0.0006467557,0.00009104597,0.00001831606],"category_scores_gemma":[0.0000019557215,0.00022660273,0.0002611451,0.0003816403,0.000035356978,0.00027363983,0.000008015156,0.0003100661,0.00021215278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015766327,0.00032849368,0.000034758683,0.00008256678,0.000054981432,8.754478e-7,0.00050594273,0.554969,0.012785257,0.0011035356,0.0001054476,0.43001336],"study_design_scores_gemma":[0.0009512253,0.0003364156,0.000023560337,0.00009102168,0.000029965448,0.000026774045,0.00016700507,0.9656819,0.017596709,0.00028731814,0.014295237,0.00051283406],"about_ca_topic_score_codex":0.000039739116,"about_ca_topic_score_gemma":0.000005303544,"teacher_disagreement_score":0.7933278,"about_ca_system_score_codex":0.00008727913,"about_ca_system_score_gemma":0.000049019527,"threshold_uncertainty_score":0.92405915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16753663,0.016871938,0.79838806,0.00039482716,0.0060476097,0.0005936547,5.3510587e-7,0.00003572756,0.010131007],"genre_scores_gemma":[0.9974705,0.00054122636,0.00023048758,0.00012851685,0.00033500398,0.0000018823549,1.6569444e-7,0.000005519186,0.0012867054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986158,0.00012853865,0.00058086106,0.00014206448,0.00030791867,0.00022483493],"domain_scores_gemma":[0.9988959,0.000079803605,0.00055613794,0.0002725974,0.00011819273,0.00007739792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011885464,0.00010949707,0.00039252787,0.00009728667,0.000048316997,0.00011336185,0.0004166485,0.000041416286,0.0000033942824],"category_scores_gemma":[0.0000030558376,0.0000826545,0.00011655936,0.0001727688,0.000011788066,0.00021158668,0.00008404986,0.00013709883,0.0000044257395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018118785,0.00013467809,0.034063313,0.000418302,0.0010751875,0.0002700472,0.00026588494,0.83133227,0.000127645,0.091576226,0.016559012,0.023996273],"study_design_scores_gemma":[0.002642051,0.0005147651,0.008877141,0.0008870239,0.00010968015,0.00013692991,0.00020639086,0.97149956,0.0000011775268,0.00055762805,0.01434525,0.00022242003],"about_ca_topic_score_codex":0.000016113796,"about_ca_topic_score_gemma":5.387581e-7,"teacher_disagreement_score":0.8299339,"about_ca_system_score_codex":0.000022332953,"about_ca_system_score_gemma":0.000011131096,"threshold_uncertainty_score":0.33705527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49594712,0.00013673057,0.50227463,0.00085329346,0.00017350288,0.00042556724,0.0000655055,0.00009554239,0.000028116257],"genre_scores_gemma":[0.99293494,0.00055410824,0.005973412,0.00014622103,0.0000056099816,0.00012953098,0.000021442287,0.000021671192,0.00021306642],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861425,0.0001447085,0.00046511923,0.00035072767,0.00020577815,0.00021939154],"domain_scores_gemma":[0.9974635,0.00055915787,0.00019006986,0.0014482966,0.00024461583,0.000094363546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022058267,0.00018605693,0.00030915558,0.00018880927,0.00035295618,0.00010265508,0.0009075435,0.00009952151,0.0000041475632],"category_scores_gemma":[0.000006457108,0.00019606826,0.00015574123,0.000258558,0.00013385751,0.00044991705,0.000018656467,0.00020801433,0.000007064474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018956787,0.0024881687,0.00010342617,0.00022852786,0.0003580287,7.615222e-7,0.004143381,0.024408935,0.4884532,0.007875482,0.0005322216,0.4712183],"study_design_scores_gemma":[0.0015256376,0.00021308284,0.00016375941,0.00018271088,0.000052432802,0.000007441045,0.0004760323,0.9813823,0.015383995,0.000025432926,0.00029989926,0.00028728184],"about_ca_topic_score_codex":0.00012594776,"about_ca_topic_score_gemma":0.00009846332,"teacher_disagreement_score":0.9569734,"about_ca_system_score_codex":0.00006194339,"about_ca_system_score_gemma":0.000058474816,"threshold_uncertainty_score":0.79954314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21537684,0.0020045813,0.77896154,0.00021168064,0.002409919,0.0003059682,2.9167396e-7,0.0003013076,0.0004278717],"genre_scores_gemma":[0.9722757,0.000053785832,0.025488919,0.0012532528,0.00062175165,0.000012780308,0.0000074263826,0.000023561573,0.0002628271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976717,0.00019817347,0.0004019782,0.0007013805,0.0002569752,0.0007697433],"domain_scores_gemma":[0.9985202,0.00029563878,0.00011940702,0.0008530146,0.000073871866,0.00013787425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006100891,0.00026407733,0.00038981985,0.00010106306,0.000114247545,0.00029124305,0.0010592422,0.00015702026,0.000011354504],"category_scores_gemma":[0.000009626937,0.00026097853,0.00013920627,0.00059948844,0.000025417445,0.00035943883,0.00072618795,0.00055504905,0.00013170522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017202845,0.00005228778,0.008181201,0.000012480902,0.00002734333,0.00011144819,0.00019412127,0.9180173,0.000032617405,0.0012933885,0.0022692,0.06979138],"study_design_scores_gemma":[0.0009239083,0.00008191358,0.0055209463,0.00019312608,0.0000055953424,0.0000245625,0.0000058840283,0.9904965,0.000002948661,0.00018534089,0.0022339264,0.0003253222],"about_ca_topic_score_codex":0.000026423668,"about_ca_topic_score_gemma":0.000021153666,"teacher_disagreement_score":0.7568989,"about_ca_system_score_codex":0.00007776729,"about_ca_system_score_gemma":0.00003906779,"threshold_uncertainty_score":0.99998426},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97083205,0.0005941843,0.024388755,0.0018899073,0.0012414721,0.0006702935,0.000011335127,0.00008567238,0.00028632054],"genre_scores_gemma":[0.99452496,0.00078334473,0.003719755,0.00050211564,0.00016548096,0.000070630944,0.000024651192,0.00002142663,0.0001876189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767953,0.00054128846,0.00074801757,0.00032069354,0.00022216741,0.0004883264],"domain_scores_gemma":[0.9961726,0.0016869591,0.0004977401,0.001040766,0.00046108707,0.00014086041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010908076,0.00020626593,0.00038426367,0.00037521575,0.00023312656,0.0004918004,0.00277003,0.00018618001,0.000008393488],"category_scores_gemma":[0.00025406273,0.00021197084,0.0001629495,0.0005185172,0.000024811632,0.0006607028,0.00024063113,0.0010703871,0.000021049094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005247717,0.0015154048,0.11435266,0.000015708481,0.00038685254,0.000028532291,0.0010543877,0.86020297,0.003774038,0.0012644598,0.0031301738,0.013750019],"study_design_scores_gemma":[0.002469008,0.00018117981,0.018208127,0.00013450361,0.000016609318,0.000059268583,0.00002393796,0.9775372,0.00020839323,0.00013372171,0.0007418365,0.0002862185],"about_ca_topic_score_codex":0.00021996735,"about_ca_topic_score_gemma":0.00070884445,"teacher_disagreement_score":0.1173342,"about_ca_system_score_codex":0.0012284289,"about_ca_system_score_gemma":0.00025467607,"threshold_uncertainty_score":0.864392},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876586,0.00016606686,0.009917514,0.000503321,0.00078819034,0.000116888055,0.00003158116,0.00016100593,0.00065682555],"genre_scores_gemma":[0.99693173,0.00015264642,0.0011999294,0.0007631771,0.00046572695,0.0001824342,0.00019786583,0.00003845777,0.00006803537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764323,0.00014426888,0.00045217908,0.0005311949,0.000788284,0.00044081206],"domain_scores_gemma":[0.9983836,0.00026679787,0.00033858875,0.00066133443,0.00019980708,0.00014986338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012857469,0.0002655434,0.0001660484,0.00018983158,0.0010210131,0.00047188532,0.00033567424,0.0002300966,0.0000229125],"category_scores_gemma":[0.00027786326,0.00028775315,0.00012788325,0.00032802066,0.0002592553,0.0011981406,0.0002159755,0.00033953125,0.0003744317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002374972,0.00015005383,0.000067369976,0.000073377014,0.000109453504,0.000032823347,0.0021100794,0.015969627,0.0018512652,0.97513705,0.00038412504,0.003877249],"study_design_scores_gemma":[0.0010381177,0.0006138052,0.0014853351,0.00025602142,0.00016828555,0.00037485204,0.00023924257,0.9937714,0.001237482,0.00040028553,0.00013030518,0.00028491524],"about_ca_topic_score_codex":0.0004865393,"about_ca_topic_score_gemma":0.00024576377,"teacher_disagreement_score":0.97780174,"about_ca_system_score_codex":0.00007415008,"about_ca_system_score_gemma":0.00032413675,"threshold_uncertainty_score":0.99995744},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08918476,0.00004978195,0.9092016,0.00006386576,0.00012003984,0.0001722867,0.0000019591912,0.00042289012,0.00078278285],"genre_scores_gemma":[0.972252,0.0000018961999,0.024806146,0.0006523663,0.00040187224,0.0000407311,0.00003967801,0.000027766386,0.0017775326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842083,0.00012692958,0.00019210925,0.0006488749,0.0001865314,0.00042472992],"domain_scores_gemma":[0.9989863,0.000101818965,0.00011791891,0.00040190303,0.00023710473,0.00015496014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023019151,0.00022209375,0.00022048972,0.000077766446,0.0005004539,0.00029683128,0.0005878692,0.00007863542,0.0000022357274],"category_scores_gemma":[0.000025635412,0.00017206714,0.000070095695,0.00017647078,0.00007946085,0.00059059943,0.00014625546,0.00021582734,0.0000011208059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031998425,0.000641815,0.001826744,0.000022314183,0.000282828,0.000029309374,0.002058507,0.4328586,0.00042111467,0.0154439,0.00018946789,0.5459054],"study_design_scores_gemma":[0.00049904006,0.0011042039,0.00010431651,0.00002208706,0.0000149858315,0.00010305,0.00024735517,0.996337,0.0002683368,0.000044445624,0.00097003026,0.00028515668],"about_ca_topic_score_codex":0.0009285235,"about_ca_topic_score_gemma":0.00071830436,"teacher_disagreement_score":0.8843955,"about_ca_system_score_codex":0.000042693955,"about_ca_system_score_gemma":0.00005380498,"threshold_uncertainty_score":0.70166945},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3676305,0.00006497199,0.62690955,0.00008226798,0.00061552087,0.000072461014,0.0000074166505,0.00012503026,0.004492286],"genre_scores_gemma":[0.9941219,0.000069362926,0.00015937723,0.000040959832,0.000042843134,2.348514e-7,0.0000025111958,0.0000079852525,0.0055548344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988655,0.00007919576,0.00015457114,0.0006402944,0.00006814899,0.00019233141],"domain_scores_gemma":[0.9986054,0.000074265976,0.00014377883,0.0009815778,0.00011436058,0.000080672005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013697718,0.00018319784,0.0002588396,0.00019062964,0.000029208213,0.00003898121,0.0017963296,0.00015513683,0.000022748462],"category_scores_gemma":[0.00001661978,0.00017406074,0.00021909471,0.00015597328,0.000084133695,0.00020949266,0.002147699,0.00023657441,0.000079863516],"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.000051030744,0.00013455807,0.008938781,0.00012202818,0.00022220387,0.00029923863,0.00032017138,0.0042754253,0.00090648734,0.97866213,0.0022604468,0.0038075212],"study_design_scores_gemma":[0.0014546867,0.00021096082,0.0033036107,0.0010607316,0.00014805772,0.000017510547,0.00007080219,0.72176284,0.003389412,0.26548743,0.0017644343,0.0013295212],"about_ca_topic_score_codex":0.00020070776,"about_ca_topic_score_gemma":0.000012549497,"teacher_disagreement_score":0.7174874,"about_ca_system_score_codex":0.00007551953,"about_ca_system_score_gemma":0.00008728657,"threshold_uncertainty_score":0.7097991},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05688465,0.000099690566,0.9407253,0.00021813335,0.0001698136,0.00018037714,0.000009161521,0.00018310337,0.001529719],"genre_scores_gemma":[0.9983108,0.0009331872,0.00024653313,0.00016351523,0.000025175732,0.0000012491156,0.00003596502,0.0000067307674,0.00027682798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.00010962828,0.00015017252,0.000298363,0.00007038873,0.00018415361],"domain_scores_gemma":[0.99802756,0.00012229924,0.00023002774,0.0013254432,0.00019268884,0.00010197851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013265338,0.00017842026,0.00017060779,0.0002128305,0.00023750335,0.00021164461,0.0013263276,0.00014704352,0.0000027495678],"category_scores_gemma":[0.000006935377,0.00016247743,0.000051279905,0.00037037034,0.00011790273,0.0009534727,0.0017716048,0.00028268405,0.000018792141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058561716,0.00010384456,0.014499785,0.00006936199,0.00018327254,0.000029812587,0.0008118043,0.090478495,0.0000062381687,0.871618,0.0006462685,0.021494571],"study_design_scores_gemma":[0.0004449971,0.000029576631,0.000649939,0.00013809277,0.000037456113,0.000005758352,0.00006796434,0.9949107,0.0000020942084,0.0028414358,0.00060944207,0.00026255552],"about_ca_topic_score_codex":0.000094612675,"about_ca_topic_score_gemma":0.000029086372,"teacher_disagreement_score":0.94142616,"about_ca_system_score_codex":0.00009626024,"about_ca_system_score_gemma":0.000100631514,"threshold_uncertainty_score":0.66256374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7538474,0.0005386298,0.24349424,0.00016207932,0.0005122046,0.0007476676,0.00006781551,0.00016039684,0.0004695702],"genre_scores_gemma":[0.996479,0.0002681159,0.0005806725,0.00014988601,0.000059378148,0.000016182856,0.00002638109,0.000031162195,0.0023892454],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976292,0.00010530136,0.0003355616,0.0013602567,0.0000908375,0.00047882705],"domain_scores_gemma":[0.99796534,0.0002038954,0.0002508943,0.0012565322,0.00018823297,0.00013510144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041148483,0.00037560327,0.00046395793,0.00038457732,0.00037834997,0.0005213373,0.001405518,0.0003383872,0.000006840066],"category_scores_gemma":[0.000044245677,0.00046589237,0.00026021904,0.00028351767,0.00011174942,0.00077598926,0.0016641648,0.0007026931,0.000013013412],"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.00008839861,0.00034741295,0.72285575,0.00079612166,0.0001837214,0.00016988427,0.0020552822,0.18948817,0.00080030947,0.07914093,0.00031763656,0.0037563676],"study_design_scores_gemma":[0.0051275743,0.00023394162,0.2789649,0.001881395,0.00049996667,0.000053959655,0.00093052466,0.68375134,0.00018138693,0.018716592,0.0062859105,0.0033724967],"about_ca_topic_score_codex":0.0009545933,"about_ca_topic_score_gemma":0.00037128053,"teacher_disagreement_score":0.49426317,"about_ca_system_score_codex":0.00026056296,"about_ca_system_score_gemma":0.00017533467,"threshold_uncertainty_score":0.9997793},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80443364,0.000014229149,0.18581076,0.0010084237,0.000111184774,0.00027804606,0.0000039482275,0.00013934165,0.008200407],"genre_scores_gemma":[0.99497604,0.0000047254316,0.002517098,0.00034968142,0.000008745421,0.000004446484,0.0000011834667,0.0000050694866,0.0021330272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993584,0.000020984466,0.00007537494,0.00029415442,0.000104093,0.0001469507],"domain_scores_gemma":[0.9995816,0.000030551335,0.000013573429,0.00028238297,0.000029424966,0.00006247691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007010318,0.00008828272,0.00009933562,0.000042249525,0.000029503726,0.00010204417,0.00021889724,0.000021071859,0.000021435637],"category_scores_gemma":[0.0000021125286,0.000059610218,0.000020499441,0.00006352316,0.0000254139,0.00042235001,0.0000686918,0.00008955782,0.00007212206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014450942,0.0012627275,0.14645655,0.00025157814,0.000893478,0.00022243989,0.02040665,0.00016511057,0.027202629,0.08444721,0.003627833,0.7136187],"study_design_scores_gemma":[0.0092037795,0.0041858978,0.033183094,0.00037433978,0.00007323096,0.0004670427,0.0017018275,0.9316707,0.010405674,0.00030519054,0.006722463,0.0017067272],"about_ca_topic_score_codex":0.00018331734,"about_ca_topic_score_gemma":0.000038361537,"teacher_disagreement_score":0.9315056,"about_ca_system_score_codex":0.000013426369,"about_ca_system_score_gemma":0.000015062689,"threshold_uncertainty_score":0.24308342},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4943268,0.000057335925,0.5028625,0.00013287856,0.00079179154,0.00050725613,0.000019650615,0.00036656807,0.00093521154],"genre_scores_gemma":[0.99005586,0.000030027077,0.00034559512,0.00019978703,0.00008750628,0.0000050877443,0.00006264484,0.000018749177,0.009194767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834293,0.000078879784,0.00017983868,0.0010335285,0.00007708989,0.00028774946],"domain_scores_gemma":[0.9982432,0.0000435706,0.00024300815,0.001081389,0.00027216092,0.00011668363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020751652,0.0002863635,0.00026244027,0.00019189059,0.00009642596,0.0001166767,0.002280585,0.00026559865,0.000015426338],"category_scores_gemma":[0.000004438355,0.00032292487,0.00025090235,0.00019892697,0.000038149094,0.0005173678,0.0017340024,0.00032297106,0.00010565885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045963153,0.00044599015,0.03135323,0.0030392173,0.0012080844,0.0003634226,0.0059626,0.031402487,0.0002542721,0.91635644,0.0027183727,0.0064362334],"study_design_scores_gemma":[0.00067013403,0.0001125792,0.0023615707,0.00031771927,0.00013356161,0.0000050242134,0.00012938792,0.95277876,0.0003146978,0.041754786,0.0007099533,0.0007117999],"about_ca_topic_score_codex":0.0033195834,"about_ca_topic_score_gemma":0.0005727971,"teacher_disagreement_score":0.9213763,"about_ca_system_score_codex":0.00012485952,"about_ca_system_score_gemma":0.00010655572,"threshold_uncertainty_score":0.9999223},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698646,0.000015083204,0.02745732,0.00007229717,0.000050215665,0.00003405115,1.3258114e-7,0.00004897796,0.0024573337],"genre_scores_gemma":[0.9977736,0.00000693971,0.0014284791,0.00007258838,0.0000035232297,7.2266704e-7,4.4001305e-7,0.000001211111,0.000712526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958754,0.000015020148,0.00009323683,0.00012186148,0.00012044161,0.00006187481],"domain_scores_gemma":[0.99964577,0.000042941745,0.000048730126,0.00022080005,0.000023464901,0.000018316749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012324016,0.000041407155,0.00009689553,0.00014960443,0.00002625398,0.00003433703,0.00013170448,0.000014123204,0.0000145423755],"category_scores_gemma":[0.0000060800908,0.000033516866,0.000033865024,0.0003023029,0.000007617844,0.00018759309,0.000044091215,0.000032109543,0.00002217563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007136381,0.000056544526,0.4388307,0.000082762774,0.00023219225,0.0000016055325,0.0009724938,0.0042671864,0.008119319,0.009262359,0.00006713254,0.5381006],"study_design_scores_gemma":[0.000093502465,0.000060591345,0.063180186,0.00002489946,0.000017837801,9.4219104e-7,0.000013199488,0.9352254,0.0013115375,0.00002278235,0.0000062999516,0.000042788968],"about_ca_topic_score_codex":0.000056903533,"about_ca_topic_score_gemma":0.00000513552,"teacher_disagreement_score":0.9309583,"about_ca_system_score_codex":0.000007766413,"about_ca_system_score_gemma":0.0000075895523,"threshold_uncertainty_score":0.13667782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14744489,0.008810084,0.53553456,0.0780159,0.0055709775,0.0013418793,0.00022712721,0.0011083668,0.22194621],"genre_scores_gemma":[0.81033325,0.0024281752,0.023721253,0.0003400038,0.00022640423,0.00009947067,0.00029479212,0.00009522471,0.1624614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.985913,0.008522616,0.001108502,0.002140648,0.0011650881,0.0011501678],"domain_scores_gemma":[0.9833589,0.002810742,0.0013399738,0.008409746,0.0034686413,0.0006119793],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011154724,0.0009196969,0.00095691293,0.0003238041,0.0020440235,0.0035899181,0.008080436,0.00074812316,0.00027848175],"category_scores_gemma":[0.003598847,0.00101523,0.0007887089,0.00037828818,0.00071440614,0.00091100356,0.006804285,0.002112365,0.0010836165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003779654,0.001529863,0.004870995,0.00037725412,0.00038278083,0.00016923476,0.026440507,0.00044273847,0.0031928804,0.42500654,0.0076875067,0.5298619],"study_design_scores_gemma":[0.0025379898,0.0000058228247,0.026383828,0.010565291,0.00036230506,0.0004800047,0.00027740482,0.5594,0.016404105,0.020167336,0.3598853,0.0035305626],"about_ca_topic_score_codex":0.011174183,"about_ca_topic_score_gemma":0.0030632485,"teacher_disagreement_score":0.6628884,"about_ca_system_score_codex":0.00045423367,"about_ca_system_score_gemma":0.00097818,"threshold_uncertainty_score":0.99969417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3140338,0.00036570235,0.6792912,0.00007491971,0.0012114126,0.00022294714,0.0000069166354,0.00023062652,0.0045624757],"genre_scores_gemma":[0.99788946,0.00036344206,0.00026562973,0.00011382334,0.00012457371,0.000001029063,0.000008166342,0.000017786191,0.0012160734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977196,0.00021442918,0.00021361794,0.0012724581,0.000094942014,0.0004849799],"domain_scores_gemma":[0.9974233,0.0001315758,0.00032567038,0.0018512149,0.00011112829,0.00015711959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004122488,0.0003624037,0.0004234426,0.00035038314,0.0003050287,0.00030395688,0.0031759425,0.00036961804,0.000005530168],"category_scores_gemma":[0.00003448931,0.00044057312,0.0002764997,0.00022077502,0.00009701558,0.0006726543,0.0035127136,0.0013572322,0.00004367382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043715474,0.00006390705,0.0049294056,0.000015494701,0.000064923835,0.0014256182,0.00015555823,0.9494467,0.000006195387,0.04064576,0.00020688276,0.0029958666],"study_design_scores_gemma":[0.00044204935,0.000033530137,0.0025079588,0.00024743727,0.00003011706,0.0000059924723,0.00004770331,0.98664427,0.0000033261101,0.009477865,0.000073412666,0.00048634602],"about_ca_topic_score_codex":0.0031789588,"about_ca_topic_score_gemma":0.0006803238,"teacher_disagreement_score":0.68385565,"about_ca_system_score_codex":0.00033597148,"about_ca_system_score_gemma":0.00021308014,"threshold_uncertainty_score":0.9998046},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6039694,0.0001676999,0.3927281,0.0001689896,0.0002470343,0.00031760166,0.000003679462,0.00009656275,0.002300928],"genre_scores_gemma":[0.99856323,0.000009878965,0.00023748062,0.00019441936,0.000022550226,0.000028613582,0.000014602593,0.0000041424437,0.00092509703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915755,0.000063593325,0.00013795713,0.00028153107,0.00014549946,0.00021385544],"domain_scores_gemma":[0.99945825,0.00006638349,0.000049008548,0.00028488308,0.0000929526,0.000048492813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002002741,0.00010188933,0.000141894,0.000036545855,0.000049720453,0.00012205175,0.00026966727,0.00003896809,0.0000094103125],"category_scores_gemma":[0.0000066851685,0.00007535892,0.000025430767,0.00038022597,0.000016025677,0.0003819012,0.000068521374,0.00015728605,0.00003549265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033335813,0.0006447771,0.22481635,0.000038250615,0.00012707562,0.00015262769,0.003077582,0.5459986,0.0044416436,0.15908985,0.0043921396,0.056887794],"study_design_scores_gemma":[0.0016296286,0.00052719936,0.027851649,0.00011355095,0.000005686585,0.000016651024,0.0010055598,0.9657411,0.0004616302,0.000056648336,0.0021873286,0.00040337114],"about_ca_topic_score_codex":0.0005339614,"about_ca_topic_score_gemma":0.00025865145,"teacher_disagreement_score":0.41974255,"about_ca_system_score_codex":0.00009055748,"about_ca_system_score_gemma":0.000051664727,"threshold_uncertainty_score":0.30730477},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14547886,0.0005033365,0.82741994,0.0037584892,0.0029902004,0.00061809435,0.000001944801,0.0003775814,0.018851522],"genre_scores_gemma":[0.9856346,0.000013729102,0.0007571798,0.0044498555,0.00013735954,0.00002221219,0.0000030738693,0.000011040596,0.008970952],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998871,0.000056514684,0.00018064311,0.00036770207,0.00018995181,0.00033418942],"domain_scores_gemma":[0.99864393,0.00038873314,0.000055140878,0.0007675416,0.00008025696,0.00006436702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985243,0.00013936657,0.00014265846,0.000042618292,0.00020448757,0.00025959808,0.0010115827,0.000062009094,0.00003572608],"category_scores_gemma":[0.000020936623,0.00008892305,0.00017305368,0.00014193167,0.00002146142,0.00034779066,0.0001563345,0.00018177224,0.00016538434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023080091,0.0003656197,0.02821002,0.00007240509,0.00042918755,0.00002848836,0.0021758217,0.07473,0.0040134666,0.3075242,0.4210785,0.16114147],"study_design_scores_gemma":[0.0005417809,0.00012826677,0.0013805941,0.000023209832,0.000011551859,0.00001514226,0.000067318266,0.92988074,0.00015221887,0.00077908003,0.066734254,0.00028586495],"about_ca_topic_score_codex":0.00026255546,"about_ca_topic_score_gemma":0.00004548158,"teacher_disagreement_score":0.8551507,"about_ca_system_score_codex":0.00002697535,"about_ca_system_score_gemma":0.000040549963,"threshold_uncertainty_score":0.36261767},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75318,0.0005034968,0.24453345,0.00005775746,0.0007653586,0.00053869264,0.0000059271706,0.0001266264,0.0002886613],"genre_scores_gemma":[0.99702364,0.000938458,0.00008684826,0.00015886134,0.00013328962,0.0000033028361,0.000046933066,0.000026334666,0.0015823543],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997279,0.00024205953,0.00037526287,0.0014796233,0.000116008516,0.0005080585],"domain_scores_gemma":[0.9979537,0.00010208127,0.0002480064,0.0013112143,0.00017230267,0.00021267917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038650385,0.00046700003,0.000530032,0.00037749985,0.00011126145,0.00021452794,0.0013683819,0.00044844867,0.0000056304866],"category_scores_gemma":[0.000007240958,0.0005414815,0.0002442022,0.00030224037,0.000094978044,0.00035472732,0.0025286814,0.0010011811,0.000029504556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018026361,0.0004941746,0.6632428,0.0005424233,0.00022181492,0.0017659476,0.00094051845,0.31641853,0.00093651115,0.007232819,0.0001324938,0.007891709],"study_design_scores_gemma":[0.0010777675,0.00011423899,0.1819374,0.00045193487,0.000104864725,0.00001847298,0.00008096437,0.814864,0.00008595572,0.00038460144,0.000009734199,0.00087010226],"about_ca_topic_score_codex":0.0015302692,"about_ca_topic_score_gemma":0.00086059724,"teacher_disagreement_score":0.49844542,"about_ca_system_score_codex":0.00034431517,"about_ca_system_score_gemma":0.00015595565,"threshold_uncertainty_score":0.99970365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3690569,0.00011825714,0.6286994,0.0005503424,0.00060438586,0.00026525717,0.000005102595,0.00024391038,0.00045643907],"genre_scores_gemma":[0.8660832,0.000007701465,0.13059728,0.0013720151,0.00012244262,0.000017887925,0.000015061406,0.000016203088,0.0017682203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855715,0.000048357928,0.00022144991,0.0005338425,0.00024701795,0.0003921526],"domain_scores_gemma":[0.9988808,0.000047524565,0.00006830306,0.0006882315,0.00016125558,0.00015386223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404598,0.00017667335,0.00020745856,0.00007243027,0.00011321307,0.00031443668,0.00084543787,0.0000712934,0.000046439167],"category_scores_gemma":[0.000009220165,0.00015074718,0.00014777816,0.00010776312,0.000014840183,0.00084867224,0.00010562206,0.00014199124,0.00021098502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014270471,0.0008510671,0.003683184,0.00010080576,0.0003641765,0.00007404977,0.0013692515,0.042795014,0.031139133,0.05233419,0.002817888,0.86432856],"study_design_scores_gemma":[0.00089896034,0.00022043819,0.0006496026,0.000018444453,0.000008463208,0.000019858042,0.00013727049,0.99398017,0.0024693676,0.00008356178,0.0012373092,0.00027656968],"about_ca_topic_score_codex":0.00020007709,"about_ca_topic_score_gemma":0.000013160852,"teacher_disagreement_score":0.95118517,"about_ca_system_score_codex":0.00003880566,"about_ca_system_score_gemma":0.000055232264,"threshold_uncertainty_score":0.61472917},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07322117,0.00005352948,0.9152241,0.000280945,0.0003437524,0.00036311103,0.0000011998426,0.00036442475,0.010147801],"genre_scores_gemma":[0.90166366,9.0498196e-7,0.07933208,0.0005676111,0.00005163509,0.000018526638,0.0000020655539,0.00001584722,0.018347688],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986798,0.00005723356,0.00021666451,0.00043941147,0.00020185034,0.000405041],"domain_scores_gemma":[0.99894416,0.0003215581,0.00007875982,0.0004819499,0.00009335757,0.000080226026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005475763,0.00015072108,0.00020052044,0.000093250426,0.00017350275,0.00034196375,0.0006187558,0.000059001137,0.0000675515],"category_scores_gemma":[0.00006236061,0.00013073033,0.00012502575,0.00016014025,0.000008909913,0.0005503444,0.0002097556,0.00011835984,0.0003055485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019887842,0.00024513697,0.0024239433,0.00013125598,0.00023093406,0.00004335058,0.006088722,0.020830998,0.87127674,0.056414552,0.016072601,0.026042877],"study_design_scores_gemma":[0.0004998332,0.00012157872,0.000056668665,0.000057255464,0.0000070725064,0.000014321566,0.0000693216,0.9965104,0.0010267189,0.00070580695,0.0006967784,0.00023424665],"about_ca_topic_score_codex":0.00011934611,"about_ca_topic_score_gemma":0.0000022003023,"teacher_disagreement_score":0.9756794,"about_ca_system_score_codex":0.000048062117,"about_ca_system_score_gemma":0.00005998092,"threshold_uncertainty_score":0.5331028},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034604926,0.0001717914,0.9569965,0.0061478103,0.0005179741,0.0006575104,0.000008961203,0.00015095997,0.0007435411],"genre_scores_gemma":[0.89927846,0.00015325242,0.09921213,0.0006567443,0.00044445804,0.00011334391,0.00004193661,0.000021864249,0.00007779371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817806,0.0004995654,0.00044604833,0.0002625606,0.0002697087,0.00034407235],"domain_scores_gemma":[0.9964315,0.0009142482,0.00033055127,0.0012638358,0.0009301915,0.00012963683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007827729,0.00017581474,0.00021752366,0.00023362791,0.00077898224,0.00048475064,0.00226769,0.00007924308,0.0000066111284],"category_scores_gemma":[0.00017404613,0.00015327985,0.000066599205,0.0011154305,0.000108908825,0.00071831373,0.000116308445,0.0005582047,0.00001155585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049701934,0.005703868,0.009201193,0.000083007675,0.001226019,0.000054571134,0.010125403,0.5872759,0.007935965,0.06512655,0.14902715,0.15927015],"study_design_scores_gemma":[0.0031459453,0.00058470404,0.003959735,0.00033184918,0.00004296727,0.00016037475,0.00007581343,0.98537564,0.0004856092,0.0010958405,0.0043711485,0.0003703714],"about_ca_topic_score_codex":0.000047496585,"about_ca_topic_score_gemma":0.0003185009,"teacher_disagreement_score":0.86467355,"about_ca_system_score_codex":0.00022448142,"about_ca_system_score_gemma":0.00028090805,"threshold_uncertainty_score":0.6250571},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.861468,0.00020242587,0.1313337,0.00037282158,0.00025380639,0.00014354779,8.1139007e-7,0.00014688,0.00607802],"genre_scores_gemma":[0.9962818,0.000015311927,0.0023400283,0.00031775402,0.000053689917,0.000006745052,0.00000149794,0.000010705463,0.00097247673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892986,0.000043726064,0.00014262504,0.0003988794,0.00014025449,0.00034466633],"domain_scores_gemma":[0.99881184,0.00004597773,0.00009720283,0.00091246585,0.00003786866,0.00009466128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015167121,0.00015833392,0.0001597346,0.0000645927,0.00025298796,0.00047739607,0.0010293311,0.00007596449,0.000007250961],"category_scores_gemma":[0.000010395632,0.00012392839,0.00005018285,0.0000791294,0.000037453246,0.00026149067,0.0002694642,0.00021067409,0.000010899103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029263739,0.00077433843,0.28372964,0.00012931795,0.00023581988,0.0042961924,0.005798418,0.4835742,0.0042950097,0.006734468,0.0015562254,0.20858373],"study_design_scores_gemma":[0.0011217633,0.00016319013,0.0060357274,0.00008711661,0.000011415693,0.00006861786,0.00015634854,0.9906706,0.00096318347,0.000047169015,0.0002713505,0.00040349187],"about_ca_topic_score_codex":0.0021584872,"about_ca_topic_score_gemma":0.004100052,"teacher_disagreement_score":0.5070964,"about_ca_system_score_codex":0.000042682357,"about_ca_system_score_gemma":0.000038910162,"threshold_uncertainty_score":0.5053653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43721542,0.000013141802,0.5601646,0.0007365135,0.000252245,0.00012997113,0.000034648,0.00015464796,0.0012988359],"genre_scores_gemma":[0.9570732,0.0000012828266,0.038658243,0.0017557066,0.00022919737,0.000031170923,0.000012870761,0.000009002393,0.0022293038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989135,0.000031578344,0.00018529297,0.00035966627,0.00023364174,0.00027632224],"domain_scores_gemma":[0.99920815,0.00017847834,0.00006516056,0.0003269975,0.00014319325,0.000078007324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002681357,0.000109312874,0.000098194345,0.00008175396,0.0005273937,0.0002494943,0.0005460259,0.000039326806,0.00009015423],"category_scores_gemma":[0.00006742027,0.00010072725,0.000062439416,0.000091299895,0.000026920441,0.00058092485,0.0003419675,0.00007354806,0.00007041193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015113324,0.0004840713,0.022889279,0.00011060585,0.00031574868,0.000015366215,0.07939745,0.0005882522,0.023941373,0.3912505,0.1841087,0.29674754],"study_design_scores_gemma":[0.0040740967,0.0014554223,0.011176063,0.0002575551,0.00015489249,0.000046298443,0.0025007164,0.84761614,0.048766434,0.03412926,0.047494363,0.002328794],"about_ca_topic_score_codex":0.00033165558,"about_ca_topic_score_gemma":0.00042114384,"teacher_disagreement_score":0.84702784,"about_ca_system_score_codex":0.000040310715,"about_ca_system_score_gemma":0.00005377699,"threshold_uncertainty_score":0.41075382},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15988591,0.000115004776,0.83586824,0.0030240582,0.00011522069,0.00057601894,0.00016955362,0.00023407623,0.000011889261],"genre_scores_gemma":[0.9860165,0.000012073343,0.01339116,0.00020171567,0.0000027206895,0.00028711226,0.00003801286,0.00000969371,0.000040993764],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987274,0.00007226821,0.000353577,0.0004152002,0.00019155424,0.00024000755],"domain_scores_gemma":[0.9975423,0.00020609541,0.0001586758,0.0014918467,0.00054361124,0.000057446247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022587802,0.00016489494,0.00039025745,0.0006650162,0.00020453827,0.00003320797,0.00095916196,0.0001603152,0.0000042902884],"category_scores_gemma":[0.000016553622,0.00016839043,0.0002567848,0.0033902135,0.00009570242,0.00013686792,0.000011478588,0.00023482011,0.000018510154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006137638,0.0033951735,0.008809293,0.00027594238,0.0068148794,0.0000125605175,0.0009848372,0.2917864,0.4794749,0.06574991,0.00012590578,0.14195642],"study_design_scores_gemma":[0.0009090048,0.00040514508,0.00039498496,0.000086382905,0.00040089665,0.0000016694862,0.00025749786,0.9365316,0.057703376,0.00010530689,0.0029230937,0.00028100717],"about_ca_topic_score_codex":0.00005946036,"about_ca_topic_score_gemma":0.00028604042,"teacher_disagreement_score":0.8261306,"about_ca_system_score_codex":0.00016218373,"about_ca_system_score_gemma":0.00008084265,"threshold_uncertainty_score":0.68667626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22500013,0.000051006373,0.77169037,0.0014753724,0.00012369461,0.000023783741,2.4311407e-7,0.00010693822,0.0015284903],"genre_scores_gemma":[0.9971991,0.000030033778,0.0015461995,0.00028888392,0.000019949926,0.0000020308992,1.3237259e-7,0.0000022658062,0.0009114127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.000027441898,0.00008353416,0.00019888062,0.000084059604,0.00010833287],"domain_scores_gemma":[0.99962205,0.00009072235,0.00002350525,0.00018152966,0.00003873298,0.0000434476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012902457,0.000059716138,0.000053945416,0.000057686724,0.00006043707,0.00006880788,0.00022818384,0.000021115193,0.000009577383],"category_scores_gemma":[0.000021423502,0.00003710634,0.000018541723,0.000049062317,0.000018333838,0.00054693874,0.0001727511,0.00003576839,0.000040471405],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003932225,0.000012280922,0.0010486682,0.0000028155782,0.0000055776873,0.0000049228856,0.00014803473,0.0000021478866,0.06064381,0.02934284,0.00023886205,0.9085461],"study_design_scores_gemma":[0.004278173,0.0012096972,0.112462096,0.0008208877,0.000049834194,0.00055887096,0.00025083916,0.76046515,0.06777573,0.04505554,0.0045703603,0.002502834],"about_ca_topic_score_codex":0.000104296894,"about_ca_topic_score_gemma":0.000022600021,"teacher_disagreement_score":0.9060433,"about_ca_system_score_codex":0.000019219113,"about_ca_system_score_gemma":0.000009655045,"threshold_uncertainty_score":0.15131526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19280265,0.000084607906,0.8042583,0.0016008978,0.00029868144,0.00037285156,0.000025252695,0.00015977061,0.00039701498],"genre_scores_gemma":[0.99748456,0.000115652954,0.0017525089,0.00015596436,0.00004328893,0.0002712128,0.000010230545,0.00002237713,0.00014421636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998578,0.00018658486,0.00029811802,0.00040088748,0.00017737177,0.00035904488],"domain_scores_gemma":[0.9949029,0.00058770727,0.00017201266,0.0040995567,0.00013190584,0.00010592485],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031461596,0.00021058686,0.00028312457,0.00016159432,0.0016363544,0.00038087092,0.003010568,0.00010163155,0.0000028539266],"category_scores_gemma":[0.000015038791,0.00022686948,0.00022126867,0.00022015111,0.00015012645,0.0006698382,0.000040922376,0.00063973956,0.00001437641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049434806,0.015791178,0.0013808196,0.00024623956,0.0009907294,0.00006437601,0.015333874,0.35551724,0.06915285,0.1111982,0.0020442656,0.42778587],"study_design_scores_gemma":[0.0008551957,0.00005598523,0.0002639583,0.00009231587,0.000031393738,0.000002772343,0.00008759543,0.9936784,0.0035001982,0.00073428854,0.00043208565,0.00026583546],"about_ca_topic_score_codex":0.00071390567,"about_ca_topic_score_gemma":0.001211937,"teacher_disagreement_score":0.8046819,"about_ca_system_score_codex":0.00011068305,"about_ca_system_score_gemma":0.00006855228,"threshold_uncertainty_score":0.99966335},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23870088,0.00012823446,0.75838673,0.0000280076,0.0005734767,0.0010451588,0.000042847445,0.00021212842,0.00088253286],"genre_scores_gemma":[0.98428786,0.000052245377,0.013260157,0.00022438049,0.0001588186,0.000010811301,0.00015088062,0.000044300483,0.0018105311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683964,0.00018909478,0.00034859523,0.0018495027,0.00011361051,0.00065956585],"domain_scores_gemma":[0.9972694,0.00026805245,0.0003576192,0.0014253798,0.000350297,0.00032927308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066111726,0.00059237465,0.0007617147,0.0002755619,0.00038534147,0.00040204468,0.001390211,0.00044974269,0.0000047209032],"category_scores_gemma":[0.0000396106,0.0006382311,0.0003145808,0.0002863356,0.00013516778,0.00046386666,0.001226226,0.0006727919,0.000008728939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016233933,0.00027943752,0.00051385834,0.00020547373,0.00011157956,0.000052276242,0.00045242568,0.9915636,0.00016562441,0.005903628,0.00017123086,0.0004185199],"study_design_scores_gemma":[0.0022430236,0.0002546422,0.00010229016,0.00012517585,0.00016322159,0.0000045769925,0.00039821138,0.9951524,0.00023251743,0.00043584374,0.000111767724,0.00077631284],"about_ca_topic_score_codex":0.0006669059,"about_ca_topic_score_gemma":0.00010348302,"teacher_disagreement_score":0.745587,"about_ca_system_score_codex":0.00026730937,"about_ca_system_score_gemma":0.0003477204,"threshold_uncertainty_score":0.9996069},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046943147,0.00061437,0.94784373,0.000016480448,0.0037429086,0.00050262315,0.0000028006234,0.0002927889,0.00004113938],"genre_scores_gemma":[0.9938147,0.00008387022,0.0053360523,0.000080896076,0.00012698365,0.00013143031,5.3004067e-7,0.000017361846,0.00040818276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836063,0.000020585412,0.00021495743,0.00053262553,0.00028667966,0.0005845424],"domain_scores_gemma":[0.9991073,0.00014783765,0.00004746033,0.00044468133,0.00010246408,0.00015026417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011245668,0.0001849806,0.0002110566,0.00016991673,0.0005139826,0.00037790413,0.0004840724,0.000070837705,0.000001377489],"category_scores_gemma":[0.0000063736425,0.00018053412,0.000077631,0.0006972648,0.000045390178,0.0007936811,0.000008454826,0.00026258748,0.0000065221643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006793418,0.00002092624,0.000016146292,0.000024025656,0.0000110124165,0.000001616628,0.000102230406,0.99555624,0.0010637786,0.0004535657,0.00009269734,0.0026509704],"study_design_scores_gemma":[0.00033923742,0.00012352802,0.000032348224,0.000107333035,0.000008941555,0.000015655427,0.000045482604,0.9976956,0.000083840416,0.000002847017,0.0013158605,0.00022930921],"about_ca_topic_score_codex":0.00007696108,"about_ca_topic_score_gemma":0.000006415895,"teacher_disagreement_score":0.9468715,"about_ca_system_score_codex":0.0001301559,"about_ca_system_score_gemma":0.000086230575,"threshold_uncertainty_score":0.73619676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45929238,0.00008126259,0.5390681,0.000066164095,0.0002481131,0.00043403526,0.0000033095225,0.000095063304,0.0007115797],"genre_scores_gemma":[0.9861942,0.0000056257995,0.0115183685,0.00064908236,0.000038014747,0.000023182236,0.0000052235873,0.000007402706,0.0015589317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901956,0.000041908,0.00017329569,0.0004326966,0.0001150369,0.00021748898],"domain_scores_gemma":[0.99937844,0.00013959031,0.00005790511,0.00030188417,0.00005830264,0.00006384899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035275277,0.00011968692,0.00016114567,0.00005389371,0.00019410063,0.00039241547,0.00039192458,0.000019055162,0.000011685489],"category_scores_gemma":[0.000014983315,0.0001015605,0.000046957513,0.000048432597,0.000015617625,0.00048397278,0.0002371162,0.000089027286,0.000021476164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046411727,0.0015877701,0.18027206,0.00096001755,0.0007381251,0.000071200666,0.020910831,0.06553464,0.09979852,0.08190495,0.030739564,0.5170182],"study_design_scores_gemma":[0.0010215895,0.00019113733,0.0006077434,0.000032653992,0.0000037541581,0.000014215452,0.0001436768,0.9913931,0.0046971883,0.000026191196,0.0016716437,0.00019709906],"about_ca_topic_score_codex":0.00014767906,"about_ca_topic_score_gemma":0.000008106609,"teacher_disagreement_score":0.92585844,"about_ca_system_score_codex":0.00003348489,"about_ca_system_score_gemma":0.000028696979,"threshold_uncertainty_score":0.4141517},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15472014,0.000019157067,0.84278345,0.00017186282,0.0016143941,0.00044703286,0.00001315724,0.00017380154,0.000056992023],"genre_scores_gemma":[0.98278964,0.000008031685,0.01598347,0.0009895307,0.00013622873,0.000051696145,0.000008884978,0.000015321635,0.000017223823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840677,0.000088600464,0.00040974776,0.00034114913,0.00033168984,0.0004220521],"domain_scores_gemma":[0.9982963,0.0008209725,0.00011156683,0.00055205345,0.00007425602,0.0001448114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022434,0.00020033136,0.00021328086,0.0008918141,0.00024173092,0.00024264042,0.00057958683,0.000097089585,0.000008311062],"category_scores_gemma":[0.000023370565,0.00020197596,0.0001464865,0.0006721602,0.000014589838,0.0015622146,0.0000023557084,0.00037635607,0.00009089907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064146974,0.00009867936,0.00033442158,0.000012158806,0.0000072920257,0.0000017015429,0.0006417161,0.66962665,0.0004722385,0.00003468253,0.00002154998,0.32868475],"study_design_scores_gemma":[0.0018416989,0.00011987057,0.00047981238,0.00011258039,0.00000723954,0.0000033443548,0.000043291635,0.99589604,0.0005786123,0.00006351872,0.0006206971,0.00023329479],"about_ca_topic_score_codex":0.0010164853,"about_ca_topic_score_gemma":0.00023747499,"teacher_disagreement_score":0.82806945,"about_ca_system_score_codex":0.00023386149,"about_ca_system_score_gemma":0.00017673952,"threshold_uncertainty_score":0.8236341},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70347404,0.00396175,0.12196761,0.0036921024,0.005918986,0.0037808523,0.0001623827,0.0009142666,0.15612799],"genre_scores_gemma":[0.90095127,0.0055506905,0.004122053,0.00047146383,0.0002040497,0.0000063861207,0.00481571,0.00008129484,0.08379709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997245,0.00023326719,0.00022130192,0.0004055922,0.0013553451,0.0005394633],"domain_scores_gemma":[0.99687696,0.00017338074,0.0002552798,0.0008770006,0.0016314136,0.00018595836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082144496,0.00020112967,0.00033387518,0.001086827,0.0004506061,0.00013927299,0.002162197,0.00034835972,0.00007135749],"category_scores_gemma":[0.00006286727,0.00024757214,0.00019735526,0.0018565754,0.000049423797,0.001408227,0.00041522202,0.0009819574,0.00055266864],"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.0003909541,0.0010409112,0.008489423,0.004292425,0.0015321638,0.00047627694,0.030508975,0.012678916,0.0007129928,0.16319185,0.19039136,0.58629376],"study_design_scores_gemma":[0.0020758808,0.00036809788,0.0153278215,0.00052950863,0.000058941016,0.0000081720445,0.012546361,0.5069258,0.000038404163,0.00014111682,0.46124193,0.0007379424],"about_ca_topic_score_codex":0.0003293524,"about_ca_topic_score_gemma":0.00073294726,"teacher_disagreement_score":0.5855558,"about_ca_system_score_codex":0.00019095658,"about_ca_system_score_gemma":0.00043197162,"threshold_uncertainty_score":0.9999977},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10183011,0.0001800153,0.8866826,0.0010045142,0.0009845891,0.0014660252,0.000053600324,0.000447208,0.007351287],"genre_scores_gemma":[0.90346605,0.000009745122,0.086346015,0.0009634608,0.00019810932,0.00027850084,0.00007575354,0.00005028079,0.008612102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683213,0.00012203207,0.0004739274,0.001355795,0.00058101816,0.00063509354],"domain_scores_gemma":[0.99714196,0.00056471303,0.00029094671,0.0016447231,0.00017214452,0.00018548594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066955766,0.0005835364,0.00064997573,0.00013971988,0.00020275907,0.0005698954,0.0018715583,0.00028298743,0.00001851859],"category_scores_gemma":[0.000043949432,0.00046819448,0.00031833875,0.00011465357,0.000043767563,0.00028578925,0.0015757604,0.0010016516,0.000027503906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003215852,0.00024994215,0.00036605156,0.0003274744,0.000561887,0.000033250824,0.0011816964,0.9742733,0.0006849129,0.016431794,0.004102999,0.0014650946],"study_design_scores_gemma":[0.0018532852,0.0002644237,0.00010500422,0.00022039602,0.000100599034,0.00002158549,0.00017153722,0.99445504,0.0007602696,0.0007026547,0.00040307594,0.0009421084],"about_ca_topic_score_codex":0.0010156285,"about_ca_topic_score_gemma":0.000042186824,"teacher_disagreement_score":0.8016359,"about_ca_system_score_codex":0.00018175336,"about_ca_system_score_gemma":0.0006388081,"threshold_uncertainty_score":0.99977696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016377266,0.0007237698,0.9784916,0.00017167357,0.0029875622,0.0003635868,0.000078599565,0.00034389403,0.00046201932],"genre_scores_gemma":[0.9979522,0.000053547228,0.000052939187,0.00003439522,0.000050737293,0.000059623493,0.000009508862,0.000009088104,0.0017779656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854076,0.00019234956,0.0002995149,0.00035745406,0.0002601713,0.00034973398],"domain_scores_gemma":[0.99890405,0.00020951059,0.00009361823,0.00058409414,0.00008703062,0.000121712605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036755353,0.00018992773,0.00023550261,0.000030997635,0.0005792649,0.00046999461,0.00043076283,0.00009147982,0.00000215176],"category_scores_gemma":[0.0000017174318,0.00012575052,0.000105764346,0.00029814168,0.000034798257,0.000192256,0.0000036366146,0.00025516222,0.00014489073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000774798,0.000050865776,0.000102149126,0.0000546616,0.00011514565,0.000019074649,0.000068704794,0.9792952,0.00014504656,0.014812601,0.002847545,0.002411509],"study_design_scores_gemma":[0.00062035804,0.00012201961,0.00013817596,0.00014021584,0.000019055968,0.000097780285,0.0005011405,0.98933196,0.000007662234,0.000021644933,0.008772622,0.00022738936],"about_ca_topic_score_codex":0.00031280553,"about_ca_topic_score_gemma":0.000024050301,"teacher_disagreement_score":0.98157495,"about_ca_system_score_codex":0.000091817994,"about_ca_system_score_gemma":0.000045669327,"threshold_uncertainty_score":0.51279575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6186841,0.002027939,0.21354924,0.14811042,0.00278177,0.0055958815,0.0010974356,0.0020951347,0.006058041],"genre_scores_gemma":[0.9479669,0.000028186756,0.047493827,0.00078950997,0.0003079936,0.00007937654,0.0015690655,0.000062363106,0.0017028096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99237084,0.0010485939,0.0007744655,0.0017120715,0.002534832,0.0015591879],"domain_scores_gemma":[0.9930589,0.0015202444,0.00019188748,0.0039523966,0.0008117216,0.00046482772],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009564974,0.0003517153,0.00048090515,0.0013486622,0.00028318647,0.005717161,0.007362337,0.00027104942,0.00008866551],"category_scores_gemma":[0.0071865013,0.00033714526,0.00009919622,0.002192159,0.00014419986,0.011016068,0.0036475523,0.0023099647,0.0004078568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065484655,0.008046758,0.085387714,0.0011836786,0.00026144893,0.00058137544,0.0022427272,0.05290244,0.004771051,0.032998733,0.14382517,0.66714406],"study_design_scores_gemma":[0.001652766,0.0001927728,0.006189767,0.0002730247,0.0000051924562,0.0000113508395,0.00012824105,0.97562885,0.000045283257,0.0005489987,0.014944838,0.00037893959],"about_ca_topic_score_codex":0.0022482697,"about_ca_topic_score_gemma":0.00084340246,"teacher_disagreement_score":0.9227264,"about_ca_system_score_codex":0.000504718,"about_ca_system_score_gemma":0.0013889492,"threshold_uncertainty_score":0.9999918},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3041028,0.000008089591,0.69466287,0.000034337932,0.0002707289,0.0006094448,0.00020144493,0.00007578317,0.000034479115],"genre_scores_gemma":[0.9974897,0.0000023072462,0.002292551,0.00004260353,0.000034998982,0.00009369383,0.000020895051,0.000007893622,0.000015337582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873126,0.00004641255,0.0006380589,0.00018186583,0.00021395837,0.0001884599],"domain_scores_gemma":[0.9988244,0.00035958886,0.00020239757,0.00037389196,0.00013912733,0.000100560326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037848542,0.00016090475,0.00040365595,0.0006204425,0.0002075984,0.0001611739,0.00024659632,0.00022979839,0.0000021386277],"category_scores_gemma":[0.000013782924,0.00015910267,0.00014726109,0.000802773,0.000028418617,0.00031334668,0.0000051200204,0.00031681574,0.0000015688267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101737336,0.000053023105,0.00011045375,0.0000816571,0.00049613556,1.69019e-7,0.00084443187,0.97387177,0.00028739535,0.0006821195,0.000016381677,0.023454703],"study_design_scores_gemma":[0.0021224967,0.00012471847,0.000003417234,0.00009052369,0.00044250913,0.0000021010628,0.0006215201,0.99582857,0.000560122,0.000005363907,0.000047340294,0.00015131228],"about_ca_topic_score_codex":0.00022605986,"about_ca_topic_score_gemma":0.000019044197,"teacher_disagreement_score":0.6933869,"about_ca_system_score_codex":0.00007764645,"about_ca_system_score_gemma":0.00014365051,"threshold_uncertainty_score":0.6488018},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39313278,0.00026698632,0.60487956,0.00055670034,0.00042456036,0.0004375298,0.000008575625,0.00009583157,0.00019749501],"genre_scores_gemma":[0.9850168,0.000022891687,0.01209779,0.0021388852,0.000026835916,0.0000108464155,0.000003386296,0.00001034088,0.0006721869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987471,0.000044419652,0.00022118111,0.00045280365,0.00017647108,0.00035801873],"domain_scores_gemma":[0.9989163,0.00031607636,0.000091863614,0.0004484535,0.00010101156,0.00012626876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043514936,0.00015218765,0.00029343084,0.00007674039,0.00011215903,0.0010007109,0.00070990965,0.000054034834,0.000015405667],"category_scores_gemma":[0.00007276385,0.00012763123,0.000088012326,0.00010971504,0.000022725058,0.0021370277,0.00021510846,0.00008025846,0.0000072289636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009677583,0.00045608144,0.1445276,0.0002584247,0.0011296761,0.00004529212,0.00047392977,0.00078857114,0.3010778,0.46578628,0.008483562,0.07600503],"study_design_scores_gemma":[0.010144957,0.00016200054,0.0059835096,0.00007730031,0.00014131285,0.00007418841,0.00003065138,0.93809015,0.004814016,0.0025865298,0.037183233,0.00071215665],"about_ca_topic_score_codex":0.0005389092,"about_ca_topic_score_gemma":0.000026426145,"teacher_disagreement_score":0.9373016,"about_ca_system_score_codex":0.00002527093,"about_ca_system_score_gemma":0.00005260327,"threshold_uncertainty_score":0.96498775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25965667,0.00017604746,0.73517984,0.0026624252,0.0010182478,0.00064303697,0.000039604343,0.0006113539,0.000012791542],"genre_scores_gemma":[0.9981935,0.000043740027,0.001120479,0.00016050953,0.000015893582,0.00018149897,0.000035760626,0.000020366162,0.00022824915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983269,0.00004869106,0.00032084933,0.0006460302,0.00025672853,0.00040082692],"domain_scores_gemma":[0.9987277,0.00006487869,0.00010389021,0.00079940923,0.00023830384,0.00006585304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021790642,0.0002340349,0.00027810823,0.0003353622,0.00022304649,0.0000691168,0.0006208562,0.0003552293,0.000008019335],"category_scores_gemma":[0.000014425684,0.00022876114,0.00025617663,0.00062775845,0.000074476804,0.00013336349,0.000008634988,0.00036608428,0.0001452987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018568622,0.0011759271,0.00009253467,0.0001970911,0.00036234572,0.000049967057,0.00025315705,0.388478,0.1602882,0.054167163,0.00015009171,0.39459983],"study_design_scores_gemma":[0.0011558995,0.00044424535,0.00008062236,0.00006572782,0.00004662282,0.000050018007,0.00007180542,0.9448153,0.049555283,0.0005485124,0.0028567212,0.000309267],"about_ca_topic_score_codex":0.000015469164,"about_ca_topic_score_gemma":0.000006589783,"teacher_disagreement_score":0.73853683,"about_ca_system_score_codex":0.0002288789,"about_ca_system_score_gemma":0.0000598257,"threshold_uncertainty_score":0.9328609},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973979,0.000018071698,0.021388877,0.00011738086,0.0004351957,0.00026713498,7.6230685e-7,0.00027954415,0.0035140172],"genre_scores_gemma":[0.9930929,6.260342e-7,0.0009354315,0.00033626868,0.00002131916,0.0000066746566,2.8643717e-7,0.0000048378597,0.005601638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913085,0.00004878989,0.00013328584,0.0003203017,0.0001839693,0.00018283165],"domain_scores_gemma":[0.99924827,0.000048179016,0.000028429304,0.0005646566,0.000041205098,0.00006923744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019573899,0.00009819094,0.00011730194,0.00007128007,0.00007079211,0.0001486823,0.00041749503,0.00002661117,0.000031276308],"category_scores_gemma":[0.0000069356806,0.000077403914,0.000055814842,0.00018733434,0.0000075669504,0.00027086984,0.0001721694,0.00010872334,0.00037505451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022846805,0.0024581428,0.02813522,0.000022701248,0.00016990458,0.013817026,0.014873948,0.0022004708,0.0006045635,0.016866481,0.0043305694,0.9164981],"study_design_scores_gemma":[0.0049825455,0.0021692836,0.0049801674,0.000027131602,0.00003696893,0.010126711,0.022592718,0.949579,0.00008424097,0.00015244063,0.004015165,0.0012536539],"about_ca_topic_score_codex":0.00092838635,"about_ca_topic_score_gemma":0.0004355321,"teacher_disagreement_score":0.9473785,"about_ca_system_score_codex":0.00001996162,"about_ca_system_score_gemma":0.00003939446,"threshold_uncertainty_score":0.4820692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540706,0.0000050416784,0.042813618,0.00017705541,0.00021657495,0.0000435844,5.3575104e-7,0.00006730636,0.0026056555],"genre_scores_gemma":[0.996584,0.0000028797413,0.00034845102,0.0001419134,0.000010654386,7.1167733e-7,0.0000025503589,0.0000016851478,0.0029071628],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965495,0.000011536118,0.000081960236,0.00010363033,0.000086928296,0.00006098489],"domain_scores_gemma":[0.9997075,0.0000103015755,0.000031800097,0.00020684308,0.000028025399,0.000015493022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006220649,0.000033434346,0.000060251357,0.000035355857,0.000010157375,0.000022595825,0.0002056651,0.000014958296,0.000041049832],"category_scores_gemma":[0.0000022122513,0.000028079243,0.000030036472,0.00008909813,0.000004405828,0.00020592376,0.00003898376,0.000024345016,0.00014576336],"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.0000036327342,0.00004401143,0.0012302139,0.000013487941,0.0000072542166,9.3741875e-7,0.00026875178,0.00007525982,0.9365,0.025705492,0.00010274943,0.03604821],"study_design_scores_gemma":[0.0012069251,0.00035371789,0.058375236,0.000078158744,0.000009716016,0.000022409191,0.00008085418,0.8514643,0.08326797,0.00027665665,0.0043536574,0.0005104127],"about_ca_topic_score_codex":0.000009053678,"about_ca_topic_score_gemma":0.0000011503648,"teacher_disagreement_score":0.853232,"about_ca_system_score_codex":0.0000045093648,"about_ca_system_score_gemma":0.000011916435,"threshold_uncertainty_score":0.18735418},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4571944,0.00013658269,0.5206559,0.002277898,0.01253813,0.0013414073,0.000111848225,0.0005751311,0.0051687555],"genre_scores_gemma":[0.92015624,0.00002782202,0.072889276,0.0008826016,0.0015427544,0.000071241644,0.00010382207,0.000070014656,0.004256205],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621975,0.00009101536,0.0009853843,0.0009045178,0.0010900104,0.0007093285],"domain_scores_gemma":[0.9962324,0.0016570765,0.0005059327,0.0007669558,0.0005360271,0.00030160922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001594861,0.00043003235,0.00046978626,0.0004138204,0.00016837075,0.00016591045,0.001649558,0.0002592668,0.00013774815],"category_scores_gemma":[0.0003778055,0.00042388425,0.00037730558,0.00032254247,0.00010715557,0.00066776265,0.0001992024,0.0004924068,0.0002077466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029826392,0.002974732,0.0029543159,0.00017635581,0.0013949629,0.0001879942,0.017389888,0.067592606,0.55832994,0.0025344763,0.047243338,0.29623878],"study_design_scores_gemma":[0.0029032056,0.00029159323,0.001252017,0.0005343335,0.00004479305,0.000025221965,0.0001403532,0.9325274,0.059227493,0.00014004542,0.0022151505,0.00069838733],"about_ca_topic_score_codex":0.00013076152,"about_ca_topic_score_gemma":0.000023251308,"teacher_disagreement_score":0.8649348,"about_ca_system_score_codex":0.00029218214,"about_ca_system_score_gemma":0.00009730859,"threshold_uncertainty_score":0.9998213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026374083,0.000333927,0.9702511,0.00008772109,0.0017858719,0.00035696864,6.859683e-7,0.00011326576,0.00069637055],"genre_scores_gemma":[0.9840261,0.000026758766,0.014725162,0.0008228922,0.0002943843,0.000025170457,0.000022067563,0.0000081351145,0.00004937529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983264,0.00010507219,0.0005838391,0.00030641223,0.00027694303,0.00040133263],"domain_scores_gemma":[0.99884504,0.00015265816,0.00022806774,0.0005430253,0.00014022425,0.00009100899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005060531,0.00020251486,0.00031088394,0.0002833832,0.000066870685,0.00018119554,0.0007566295,0.00012900084,0.000023332716],"category_scores_gemma":[0.000010459408,0.00019998591,0.00013630559,0.0006908145,0.000024338955,0.0011244379,0.0004486493,0.0003784799,0.000040436953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013252562,0.00003994342,0.009282433,0.000014123984,0.000026978796,0.0000039042156,0.000076967444,0.8899653,0.0000030953204,0.0037679123,0.005599769,0.09120631],"study_design_scores_gemma":[0.00080725754,0.0000568415,0.008596108,0.00009997851,0.000004682808,0.000017674462,0.0000072456914,0.9860893,0.000004413413,0.000055363525,0.0040487275,0.00021240462],"about_ca_topic_score_codex":0.00009700798,"about_ca_topic_score_gemma":0.0000038740113,"teacher_disagreement_score":0.957652,"about_ca_system_score_codex":0.000093735645,"about_ca_system_score_gemma":0.00011048269,"threshold_uncertainty_score":0.8155189},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72495055,0.0001458245,0.27238318,0.000104183586,0.0010510553,0.00022775971,5.9970864e-7,0.0002851313,0.00085169665],"genre_scores_gemma":[0.9983598,0.000018978571,0.00030273857,0.00038961883,0.00013353913,0.000022421753,0.0000068312434,0.000026899772,0.0007391459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978921,0.00016755341,0.00031681827,0.0007094953,0.00047711274,0.00043692574],"domain_scores_gemma":[0.9986734,0.00011238767,0.00012518858,0.0007513023,0.00014801194,0.00018973867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004240104,0.0002601761,0.00031403272,0.00016895606,0.0001871371,0.0009466608,0.0018030367,0.0000770137,0.000023861303],"category_scores_gemma":[0.00001859298,0.000211971,0.00011037505,0.00026408248,0.00003848677,0.0019656622,0.00034218072,0.00038922482,0.00008698923],"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.00027872072,0.0005360817,0.39302856,0.00022728198,0.00034706714,0.000740913,0.004115558,0.032742552,0.056622118,0.0009541653,0.00024176532,0.5101652],"study_design_scores_gemma":[0.0043577566,0.002966799,0.44892728,0.0020347675,0.00025649875,0.0011344241,0.0020778945,0.4517431,0.08066818,0.00019600878,0.0011602243,0.0044770567],"about_ca_topic_score_codex":0.00060467166,"about_ca_topic_score_gemma":0.00017565244,"teacher_disagreement_score":0.50568813,"about_ca_system_score_codex":0.0001107865,"about_ca_system_score_gemma":0.00006821345,"threshold_uncertainty_score":0.9128672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71071225,0.0000190964,0.26112434,0.00015855246,0.0001278203,0.027482761,7.3410115e-7,0.00032867366,0.00004578031],"genre_scores_gemma":[0.98418486,8.2796026e-7,0.00512235,0.00003598097,0.000038442973,0.010440087,0.0000012735769,0.000017264423,0.00015893935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986601,0.000059872436,0.0003698623,0.00045917815,0.0001716845,0.00027929814],"domain_scores_gemma":[0.99884284,0.000063448664,0.00018572791,0.00069997116,0.00016986724,0.00003812719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033781165,0.00017001406,0.00030613874,0.00030250868,0.00011638692,0.000028286706,0.0004799195,0.00018190019,0.0000037198831],"category_scores_gemma":[0.000020664209,0.00015012942,0.000081243255,0.0007469602,0.000029676401,0.00017680811,0.00008541381,0.00019262555,0.000013159937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005200809,0.0037931479,0.04088514,0.0008277321,0.0004922796,0.002595501,0.0021418177,0.23337516,0.35010633,0.003241085,0.0043474385,0.3576743],"study_design_scores_gemma":[0.0066014365,0.0026918463,0.00018780243,0.00021570826,0.000065434964,0.00096156506,0.00033361866,0.97289884,0.007850927,0.0004499253,0.0073364247,0.00040647908],"about_ca_topic_score_codex":0.000058998154,"about_ca_topic_score_gemma":0.00003327907,"teacher_disagreement_score":0.73952365,"about_ca_system_score_codex":0.000030067742,"about_ca_system_score_gemma":0.00003746959,"threshold_uncertainty_score":0.61221},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48637518,0.00009233082,0.5119913,0.00011124916,0.0002575307,0.00012800671,2.1918588e-7,0.00011123864,0.0009328915],"genre_scores_gemma":[0.9975396,0.000018984436,0.0013022966,0.0005240529,0.000034087625,0.000007272846,0.0000018630394,0.000009221327,0.0005626408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882364,0.000058912054,0.00018133936,0.0004050063,0.0002054932,0.00032562212],"domain_scores_gemma":[0.9993059,0.00007087119,0.000044122873,0.00047048603,0.000034669996,0.000073958276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002227991,0.00014483923,0.00017777843,0.000090559195,0.000044124266,0.00013563341,0.0005662157,0.000049657156,0.000017245266],"category_scores_gemma":[0.0000023404716,0.00010791459,0.00005047201,0.00024862762,0.000015785832,0.00020096336,0.00017738382,0.00022299,0.00005243724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020904432,0.000058119997,0.0088660475,0.0000059904987,0.000020108422,0.000083243925,0.0002629523,0.8987263,0.000100524216,0.0029309439,0.000032354514,0.08889256],"study_design_scores_gemma":[0.00026780672,0.000111637135,0.00030112485,0.000044612578,0.0000017842435,0.00004965648,0.00005152111,0.9986388,0.00013547881,0.00005160019,0.00015703154,0.00018896059],"about_ca_topic_score_codex":0.0014314923,"about_ca_topic_score_gemma":0.00049821887,"teacher_disagreement_score":0.51116437,"about_ca_system_score_codex":0.000078700796,"about_ca_system_score_gemma":0.000034111363,"threshold_uncertainty_score":0.4400629},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5498298,0.00002382507,0.44336957,0.0038554342,0.0004894062,0.00046275486,0.0000013768258,0.00032060264,0.0016472389],"genre_scores_gemma":[0.9931164,0.000007812749,0.0055368524,0.0010870461,0.00009559552,0.000021234178,5.1258104e-7,0.00000728849,0.00012728348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986909,0.000009780924,0.00031539134,0.00030280655,0.00027175533,0.00040938973],"domain_scores_gemma":[0.9991572,0.000040214585,0.00013911181,0.00013617917,0.00040411644,0.00012317077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032112168,0.00016242293,0.00016368263,0.00034235013,0.000106872954,0.00052109396,0.0006130098,0.00007119613,0.000014858468],"category_scores_gemma":[0.000054390886,0.00013490104,0.000032129945,0.00084488053,0.000013659797,0.0035754929,0.00016250688,0.000115757255,0.0003120026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020470559,0.00015401814,0.011521272,0.000321872,0.00006190018,0.000020259484,0.030245513,0.0067988373,0.34320092,0.007800052,0.0046218336,0.5950488],"study_design_scores_gemma":[0.00084725156,0.000068154004,0.00048304666,0.0011760453,0.000010314748,0.000028507426,0.00026552728,0.9913355,0.002203677,0.00045254247,0.002587041,0.0005423911],"about_ca_topic_score_codex":0.000117522504,"about_ca_topic_score_gemma":0.0000054429806,"teacher_disagreement_score":0.98453665,"about_ca_system_score_codex":0.00018064464,"about_ca_system_score_gemma":0.00012255208,"threshold_uncertainty_score":0.55011046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7336123,0.00044411756,0.26551488,0.0001144088,0.000049001093,0.00019769573,0.000009997185,0.00000785293,0.00004974765],"genre_scores_gemma":[0.9900821,0.000015821011,0.009562081,0.00019476718,0.00008547369,0.00001414474,0.000011589805,0.000003405176,0.000030649775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989817,0.00003137236,0.00047960278,0.00019984324,0.00018868347,0.0001187614],"domain_scores_gemma":[0.9982414,0.0002866933,0.00079128024,0.0003175205,0.00031774692,0.000045324457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007328396,0.000088097564,0.00036024424,0.00015223726,0.00006804284,0.00012600471,0.0008221655,0.000027656575,0.0000033140955],"category_scores_gemma":[0.000004539537,0.00007195438,0.000119635166,0.00036783595,0.000016689075,0.0003194078,0.00015700821,0.00010827799,0.0000010596948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013212264,0.0010959582,0.31143913,0.0015229221,0.009945172,0.000002314173,0.010427936,0.36351934,0.05657804,0.01800646,0.00035867334,0.22578281],"study_design_scores_gemma":[0.00071069755,0.00015974478,0.0026252167,0.00017064928,0.00019598183,0.0000030777746,0.00022205223,0.9951638,0.000115072944,0.00003594502,0.0005252275,0.00007255772],"about_ca_topic_score_codex":0.000054167853,"about_ca_topic_score_gemma":0.000027093405,"teacher_disagreement_score":0.6316444,"about_ca_system_score_codex":0.00001737319,"about_ca_system_score_gemma":0.000039403432,"threshold_uncertainty_score":0.29342145},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030626034,0.00013357642,0.96561056,0.0010874812,0.0011975905,0.00052204804,0.000011831437,0.00076214736,0.000048719958],"genre_scores_gemma":[0.977173,0.000021341486,0.02210349,0.0002511264,0.000024236448,0.000073199626,0.0000052069327,0.000023175211,0.00032528036],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840003,0.000059633498,0.00022927715,0.00070563843,0.00017681764,0.00042859916],"domain_scores_gemma":[0.9978186,0.0001628177,0.00007516146,0.0018241295,0.00006983317,0.00004945649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033531652,0.00018814822,0.0002476538,0.0003682834,0.00022837172,0.00008524402,0.0016671933,0.00025559613,0.000011770703],"category_scores_gemma":[0.000008497414,0.000186851,0.00009864248,0.00048440872,0.000041795836,0.00032644463,0.00002016282,0.00039966658,0.000078324745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030484662,0.0008359358,0.00013282364,0.000088762354,0.0007898897,0.000117344585,0.0005454635,0.32981536,0.4574315,0.016353501,0.001322097,0.19226249],"study_design_scores_gemma":[0.0007046805,0.0002402718,0.000005460967,0.000055401833,0.000030312503,0.000049306855,0.00004707921,0.98675984,0.006651133,0.0011875044,0.0039974824,0.00027152686],"about_ca_topic_score_codex":0.000022690536,"about_ca_topic_score_gemma":0.000016078346,"teacher_disagreement_score":0.9465469,"about_ca_system_score_codex":0.00006564782,"about_ca_system_score_gemma":0.00006310488,"threshold_uncertainty_score":0.7619563},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005741365,0.000029413362,0.8999407,0.0009327231,0.002244317,0.08808715,0.0000106371535,0.00073635665,0.002277332],"genre_scores_gemma":[0.6222679,8.696305e-7,0.114798605,0.010450891,0.010010499,0.23865913,0.000047074627,0.00016736309,0.0035976612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986981,0.00009859323,0.00017914394,0.00043431652,0.00022124957,0.0003685579],"domain_scores_gemma":[0.9990294,0.00024931305,0.000043486747,0.0004422349,0.00009390932,0.00014165662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028598637,0.0001518139,0.00017736781,0.000032129246,0.0001416928,0.00014051264,0.0006193879,0.00008693757,0.000024193161],"category_scores_gemma":[0.0000025638985,0.00012992928,0.000104412014,0.00015229477,0.000020958496,0.0003749493,0.000025238769,0.00012544483,0.00015769446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010299391,0.003377815,0.0026459738,0.0024582332,0.00026264106,0.00012199891,0.0026838141,0.41459993,0.037997168,0.032922838,0.14213125,0.35049894],"study_design_scores_gemma":[0.0010293457,0.00071487855,0.000088220135,0.00024644533,0.0000072314756,0.00000241209,0.0000052796954,0.96419305,0.00047059797,0.002016578,0.03100029,0.00022565507],"about_ca_topic_score_codex":0.000024271589,"about_ca_topic_score_gemma":0.0000045886486,"teacher_disagreement_score":0.7851421,"about_ca_system_score_codex":0.000021123034,"about_ca_system_score_gemma":0.00006784933,"threshold_uncertainty_score":0.52983624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17637326,0.00014148265,0.8194426,0.000055560806,0.00017288963,0.00021610082,2.2510947e-7,0.00017918732,0.0034187087],"genre_scores_gemma":[0.9936503,0.00008046035,0.000410612,0.00010555109,0.00004535057,0.0000013454048,0.000033165263,0.000015909443,0.0056573097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821544,0.00015306174,0.00023186702,0.0009176425,0.00013001323,0.0003519606],"domain_scores_gemma":[0.9987498,0.00003802296,0.00027074802,0.0007498107,0.00010553272,0.00008609803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003220158,0.00025592293,0.00026368673,0.00034715724,0.00014767096,0.0001847408,0.0011263764,0.00020865946,0.000009236693],"category_scores_gemma":[0.000018288476,0.00031212257,0.00011598735,0.00046561545,0.000030279818,0.00043479243,0.0012551182,0.00067677675,0.00005744772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016797345,0.000032803833,0.0033780977,0.00007485907,0.00001786336,0.0000559013,0.00037168557,0.9887072,0.00008990837,0.0044264705,0.00003798562,0.0027904601],"study_design_scores_gemma":[0.00037308907,0.00004282157,0.00028614062,0.00019136342,0.00002020093,0.0000026966777,0.000116780255,0.9970408,0.000060760245,0.0010255565,0.0004963654,0.0003434247],"about_ca_topic_score_codex":0.00082250877,"about_ca_topic_score_gemma":0.000084115905,"teacher_disagreement_score":0.81903195,"about_ca_system_score_codex":0.000383238,"about_ca_system_score_gemma":0.00016160689,"threshold_uncertainty_score":0.99993306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7748072,0.005101075,0.19174804,0.0046267645,0.0042008604,0.0004888801,0.0000016323092,0.00006383095,0.018961716],"genre_scores_gemma":[0.99854964,0.0002849028,0.00064260245,0.000084130814,0.000017733606,0.00000621139,0.00000255135,0.0000040899736,0.00040815814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873376,0.00012269335,0.0004801883,0.00008843235,0.0005043413,0.00007059976],"domain_scores_gemma":[0.9984355,0.000065663946,0.00042872824,0.0004103162,0.0006340781,0.00002573183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923392,0.0000612849,0.00011635942,0.00034475976,0.000018799783,0.00017549546,0.0020606045,0.000026766564,0.0000030390154],"category_scores_gemma":[0.000015957059,0.000057145713,0.000043132062,0.00020315568,0.00000990223,0.000681671,0.000101416204,0.00014977026,0.00004712756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022050347,0.00085211266,0.03096594,0.00010311161,0.00074830774,0.00010404456,0.0056492854,0.4254535,0.0015807546,0.4208725,0.0007047573,0.11274515],"study_design_scores_gemma":[0.0024707953,0.000097859986,0.032765754,0.0015377441,0.000012463979,0.0003207781,0.0019804845,0.9480723,0.00006996528,0.003049857,0.009338953,0.0002830186],"about_ca_topic_score_codex":0.000047074613,"about_ca_topic_score_gemma":0.0000075325747,"teacher_disagreement_score":0.52261883,"about_ca_system_score_codex":0.00017185898,"about_ca_system_score_gemma":0.000045342647,"threshold_uncertainty_score":0.38291502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6050608,0.006509758,0.36518964,0.01878761,0.0031275405,0.00015024668,0.0000069286098,0.00014349994,0.0010239267],"genre_scores_gemma":[0.9405084,0.00004872456,0.055962224,0.0030507008,0.00039985587,7.18158e-7,4.7854127e-7,0.000008297455,0.00002057633],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990736,0.000033829183,0.0002929501,0.00013892988,0.0003068253,0.00015383484],"domain_scores_gemma":[0.9992681,0.00004597106,0.00017738521,0.00023672364,0.00007086202,0.00020093008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109753506,0.000105610874,0.00017100526,0.00004913264,0.00005858098,0.00010546816,0.0013312432,0.000029838477,0.000015004084],"category_scores_gemma":[0.000062309366,0.00009197225,0.00015267242,0.00014285583,0.00002603278,0.0005161344,0.00034776592,0.00019176699,0.000024584826],"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.00016884296,0.0005911581,0.00079079426,0.000014209966,0.000332133,0.0011854629,0.010144441,0.00038134377,0.8470303,0.0055667586,0.04644342,0.087351136],"study_design_scores_gemma":[0.00751607,0.0069657997,0.0008916528,0.00019201629,0.000074969656,0.002766005,0.0056166644,0.25617334,0.6797935,0.0021593755,0.03620158,0.0016490625],"about_ca_topic_score_codex":0.000006325468,"about_ca_topic_score_gemma":5.1928595e-8,"teacher_disagreement_score":0.33544758,"about_ca_system_score_codex":0.000044535103,"about_ca_system_score_gemma":0.000046829835,"threshold_uncertainty_score":0.37505198},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21450812,0.00013049264,0.75335586,0.015138959,0.000203721,0.0007038414,4.110332e-7,0.00029885527,0.015659746],"genre_scores_gemma":[0.9981596,0.000020799012,0.0009390392,0.00063313876,0.000057540856,0.000018308096,8.1509467e-7,0.000010165214,0.00016063584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982561,0.000024586241,0.0005084299,0.00045812986,0.000449444,0.00030329434],"domain_scores_gemma":[0.99909824,0.00003249428,0.00032246727,0.00015727321,0.0002980765,0.00009145927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036978614,0.00018242365,0.0002132897,0.000100924255,0.00018437246,0.00025990128,0.0013063031,0.00006561915,0.000018135102],"category_scores_gemma":[0.00024745514,0.00015152832,0.00007414019,0.0007394302,0.00008277583,0.0004619189,0.0003277576,0.00036894725,0.000034189394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017423007,0.00016802776,0.0011493599,0.00016346204,0.000017982511,0.0000022297113,0.0110388985,0.13246652,0.16781822,0.34394157,0.00012723666,0.34293228],"study_design_scores_gemma":[0.00003164673,0.00016313508,0.000039294606,0.0001596051,0.00000518215,0.0000016273701,0.00066636386,0.8790953,0.114730045,0.004829537,0.00011761585,0.00016061436],"about_ca_topic_score_codex":0.0001064356,"about_ca_topic_score_gemma":0.000011856051,"teacher_disagreement_score":0.7836514,"about_ca_system_score_codex":0.00005830531,"about_ca_system_score_gemma":0.00006904559,"threshold_uncertainty_score":0.61791456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021872304,0.00014282974,0.96734047,0.00072220195,0.00011465382,0.008996435,0.000015197598,0.00023444924,0.0005614572],"genre_scores_gemma":[0.9899062,0.00012575994,0.004249982,0.0008776436,0.000021289228,0.0047498746,0.000009040607,0.000018302047,0.000041933487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862266,0.00030206528,0.00023786075,0.00043519548,0.00017086595,0.00023135667],"domain_scores_gemma":[0.9983934,0.00045166243,0.00008759714,0.0007223347,0.0001985157,0.00014644625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025835205,0.00020527747,0.0001899446,0.00015753067,0.00070334686,0.00015151348,0.0004577948,0.00008886936,0.000014108552],"category_scores_gemma":[8.9281326e-7,0.00019917685,0.00005985208,0.00044123325,0.00009039815,0.0004421059,0.0000127853855,0.00041542362,0.000011344566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024030806,0.0005122361,0.00005821976,0.00003934333,0.000052712698,0.0000019784547,0.0011173082,0.0017908367,0.0006493263,0.000421501,0.000006139825,0.9951101],"study_design_scores_gemma":[0.00173901,0.00053898763,0.00013156062,0.0006503823,0.000035320103,0.000011017304,0.00037987126,0.9934717,0.0003479047,0.00006231355,0.0023392602,0.00029266992],"about_ca_topic_score_codex":0.000057783473,"about_ca_topic_score_gemma":0.000119688244,"teacher_disagreement_score":0.99481744,"about_ca_system_score_codex":0.000026675123,"about_ca_system_score_gemma":0.00006166377,"threshold_uncertainty_score":0.8122196},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022849606,0.0000072377316,0.97409517,0.000038803122,0.0006275452,0.00014187579,0.000009071839,0.00013317777,0.0020975089],"genre_scores_gemma":[0.9971939,0.000009138001,0.0022839494,0.0003179901,0.000004911818,0.000007994023,0.0000034328234,0.0000038877565,0.00017479605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927545,0.00006937744,0.00027103027,0.00008701436,0.00019305912,0.000104049155],"domain_scores_gemma":[0.99933755,0.000095302945,0.000121700876,0.00032768905,0.00008421744,0.000033537675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027316893,0.00008408005,0.00010133599,0.00021403961,0.00008576251,0.000060212897,0.00026091456,0.00004793588,0.00007609859],"category_scores_gemma":[0.0000037990446,0.00008111819,0.00008468643,0.00017096117,0.000015742315,0.0014048195,0.0000019002293,0.00011247716,0.00017021503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003148801,0.000023327531,0.0000019482704,0.000014366068,0.0000162967,1.4346257e-7,0.00063488755,0.9724245,0.0003034802,0.005962636,0.0000073680885,0.020579522],"study_design_scores_gemma":[0.00045225225,0.00010909167,0.0000059579143,0.00003194081,0.0000086514965,0.000014411343,0.00010090957,0.9816397,0.016928772,0.00048527017,0.000095673844,0.00012736549],"about_ca_topic_score_codex":0.000013025078,"about_ca_topic_score_gemma":6.667282e-7,"teacher_disagreement_score":0.9743443,"about_ca_system_score_codex":0.000033971166,"about_ca_system_score_gemma":0.000029562085,"threshold_uncertainty_score":0.3307904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061961293,0.00008313343,0.936673,0.0003502492,0.00019713893,0.00048041303,0.0000029493385,0.00022219404,0.000029621186],"genre_scores_gemma":[0.98985094,0.000006713143,0.009883049,0.00017115573,0.000017394288,0.000020623871,5.3597364e-7,0.00001525345,0.000034322085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844575,0.00022958062,0.00033773214,0.00040075084,0.00030631898,0.00027988176],"domain_scores_gemma":[0.99863833,0.0006043337,0.00014861683,0.00039924908,0.00010968312,0.00009980228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041094993,0.00018079055,0.00023053012,0.000050395636,0.00064427085,0.00014198963,0.000636172,0.000041484025,0.000002045503],"category_scores_gemma":[0.000018081824,0.0001304869,0.00010905967,0.0003322373,0.00007264503,0.0001647482,0.000010011282,0.00039227816,0.000012624526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104114,0.00007855717,0.000009388041,0.000025147372,0.000051768537,0.000008880239,0.0006108009,0.9243668,0.00966452,0.00010883268,0.0000066639177,0.06500765],"study_design_scores_gemma":[0.00035315007,0.0004358185,0.000027714319,0.00009455331,0.000025347219,0.000020907091,0.000070663235,0.9972727,0.0014899418,0.00003881673,0.000011132737,0.00015926074],"about_ca_topic_score_codex":0.00007091697,"about_ca_topic_score_gemma":0.0000058623577,"teacher_disagreement_score":0.92788965,"about_ca_system_score_codex":0.000069520516,"about_ca_system_score_gemma":0.00007386819,"threshold_uncertainty_score":0.5321101},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16596834,0.00060855906,0.80510366,0.0272736,0.0007574145,0.00015103602,3.2912493e-7,0.00009558141,0.000041478852],"genre_scores_gemma":[0.9839272,0.00003797342,0.008691399,0.0068033254,0.0005067818,0.0000050204726,0.0000014461847,0.000015589072,0.000011285974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983728,0.00016284759,0.0005582869,0.0003073741,0.00026836141,0.000330316],"domain_scores_gemma":[0.9986171,0.000044453383,0.0004740124,0.00040290548,0.00031795457,0.00014356895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974091,0.00017519183,0.00042817995,0.00017202586,0.00020695037,0.00047916523,0.0023888908,0.00022557114,0.0000066605285],"category_scores_gemma":[0.00004705898,0.00015709948,0.00014955529,0.0009351013,0.000055058008,0.0007592668,0.00029272767,0.0007548891,0.000008732525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011511085,0.00017678486,0.0019613567,0.000016773163,0.00026130234,0.0014637227,0.00011207666,0.5510209,0.20733944,0.008201475,0.023783788,0.20554726],"study_design_scores_gemma":[0.000915356,0.00042548956,0.00006685606,0.000091669215,0.00003615622,0.00027549983,0.000021329466,0.9903839,0.0049604676,0.00019185791,0.0024339403,0.00019745191],"about_ca_topic_score_codex":0.000016939486,"about_ca_topic_score_gemma":0.00001244061,"teacher_disagreement_score":0.81795883,"about_ca_system_score_codex":0.0000566674,"about_ca_system_score_gemma":0.00016366622,"threshold_uncertainty_score":0.6406331},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039296565,0.0007462425,0.9865999,0.0016850285,0.00046941964,0.0006266147,0.0056885867,0.00023217627,0.000022373657],"genre_scores_gemma":[0.9982015,0.00011130963,0.0008389521,0.00019625707,0.00008907132,0.00011714588,0.0003198162,0.000011744688,0.000114241695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.000095254356,0.00034474925,0.0008236875,0.0002327874,0.00031613608],"domain_scores_gemma":[0.9986136,0.00019331207,0.00011079607,0.00069379923,0.00009654713,0.00029192877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002679611,0.00023490662,0.00033661764,0.000043824577,0.000419394,0.00029752552,0.00051712507,0.00010099269,0.0000026844564],"category_scores_gemma":[0.00001597108,0.00021601426,0.000061190796,0.00022358635,0.000056605626,0.00037211354,0.000022637527,0.00019093657,0.000008968303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025991919,0.0009837196,0.00016333188,0.0007643907,0.001196787,0.000096445205,0.0013286893,0.83847094,0.0029523068,0.008772136,0.1304738,0.012198257],"study_design_scores_gemma":[0.0016195781,0.0004775802,0.000046527573,0.00006293242,0.00006975444,0.00003456832,0.00047363172,0.98520225,0.00005944565,0.000042648593,0.011591132,0.00031992578],"about_ca_topic_score_codex":0.00020138231,"about_ca_topic_score_gemma":0.000012816062,"teacher_disagreement_score":0.9942718,"about_ca_system_score_codex":0.000044642078,"about_ca_system_score_gemma":0.000054280383,"threshold_uncertainty_score":0.8808806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010252259,0.00010223498,0.98556244,0.00270633,0.00036840155,0.00045205228,0.00001992686,0.00013228632,0.00040406818],"genre_scores_gemma":[0.97675365,0.00006578467,0.01523977,0.0077508073,0.00005773182,0.000060689894,0.0000058538985,0.000013326265,0.000052405823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889094,0.00004793646,0.00024026276,0.00038429763,0.00019932442,0.00023724276],"domain_scores_gemma":[0.9993557,0.000094758696,0.000076857745,0.000321033,0.00004971564,0.000101944956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083181134,0.00017913591,0.00023122343,0.000067162284,0.00017278113,0.0000835637,0.00043557756,0.000044815766,0.000005051047],"category_scores_gemma":[3.7343355e-7,0.00017048589,0.000120121884,0.00024375529,0.000017855471,0.00011037182,0.0000076156102,0.000099548306,0.0000028722945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041591382,0.00010680781,0.000008910329,0.00035162873,0.000302771,0.0000069911457,0.0007485873,0.901096,0.0004993707,0.0010784917,0.0018764287,0.093508124],"study_design_scores_gemma":[0.0018021798,0.00026622874,0.0003293944,0.000073309755,0.00012199971,3.2048192e-7,0.00020323806,0.99404985,0.00038251816,0.000248562,0.0023099782,0.00021240766],"about_ca_topic_score_codex":0.00011049833,"about_ca_topic_score_gemma":0.00011051432,"teacher_disagreement_score":0.97032267,"about_ca_system_score_codex":0.000015896352,"about_ca_system_score_gemma":0.000014836678,"threshold_uncertainty_score":0.6952213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020751632,0.0000852212,0.99089354,0.0039420472,0.0016986906,0.00064407435,0.000010369831,0.000605565,0.000045316105],"genre_scores_gemma":[0.9378401,0.000024502166,0.0602627,0.0009607229,0.000565651,0.00026727116,0.000004107005,0.000028960914,0.00004599664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984288,0.00008457335,0.0002893849,0.00056937605,0.00025264476,0.00037522346],"domain_scores_gemma":[0.99867713,0.00040770142,0.0000950827,0.0005653539,0.000083175226,0.00017155816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020907959,0.00022685692,0.00021578786,0.00012709912,0.00038529886,0.00014229507,0.000623818,0.0001382894,0.00000843575],"category_scores_gemma":[0.000018313578,0.0002363356,0.00027816038,0.00070231955,0.00004677369,0.0002603515,0.000005741196,0.00038936106,0.0000084591165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003673992,0.00042302156,0.00006982871,0.000103271974,0.0001741645,0.000018230017,0.0011433675,0.25687572,0.074526794,0.00013124045,0.0016213367,0.6645456],"study_design_scores_gemma":[0.0013860654,0.0005807172,0.000022180282,0.00020997415,0.00006883544,0.000019621413,0.000102899874,0.9439646,0.047914017,0.0005084715,0.0046561547,0.0005664824],"about_ca_topic_score_codex":0.000033938584,"about_ca_topic_score_gemma":0.0000117099535,"teacher_disagreement_score":0.9357649,"about_ca_system_score_codex":0.000052419728,"about_ca_system_score_gemma":0.000067464505,"threshold_uncertainty_score":0.96374863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20129463,0.0005339595,0.7941131,0.003114775,0.00018637757,0.0002819763,0.000011795865,0.00018726812,0.00027610196],"genre_scores_gemma":[0.994252,0.0005208504,0.003770857,0.0012888247,0.000026709184,0.00007732945,0.000012846396,0.000018326122,0.000032209507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984896,0.0002662342,0.00042930254,0.00039280514,0.0001491618,0.00027287184],"domain_scores_gemma":[0.99795765,0.00031717497,0.0000829227,0.0013717962,0.00008553266,0.0001849339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022611793,0.00020487823,0.00023541535,0.00014155601,0.00042451837,0.00018049784,0.0011892101,0.00009516134,0.00000760542],"category_scores_gemma":[0.0000060326543,0.00022121586,0.00013277523,0.0003799667,0.000102111066,0.00023059035,0.00003734121,0.00073086785,0.000013855838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003526386,0.006002771,0.03894821,0.00039052486,0.00044107018,0.00018924354,0.011403658,0.47991952,0.07333606,0.0038339656,0.0004935731,0.38468876],"study_design_scores_gemma":[0.0010300839,0.00018298812,0.007974422,0.00016367903,0.000055339035,0.00001138727,0.00022144703,0.98695284,0.0029277524,0.000013299251,0.000044425084,0.0004223632],"about_ca_topic_score_codex":0.00020459565,"about_ca_topic_score_gemma":0.0007741577,"teacher_disagreement_score":0.7929574,"about_ca_system_score_codex":0.00008239306,"about_ca_system_score_gemma":0.000076070115,"threshold_uncertainty_score":0.9020921},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05928269,0.064868525,0.84399515,0.011067359,0.007816232,0.0011978529,0.0000017916859,0.0007976896,0.010972726],"genre_scores_gemma":[0.9482722,0.016209217,0.027819958,0.005097333,0.0015461744,0.000021170774,0.000008253677,0.0000188316,0.0010068237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999198,0.000045966466,0.00020554582,0.00018637897,0.00018800334,0.00017605638],"domain_scores_gemma":[0.9994479,0.00006934527,0.000055345405,0.00024827337,0.00010673773,0.000072411196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038866914,0.000106449574,0.00012389626,0.00007370963,0.00006281565,0.00022052458,0.00021543057,0.00005852414,0.0000050455146],"category_scores_gemma":[0.000024274206,0.00008261057,0.000023163446,0.0000837052,0.000012924781,0.00088505034,0.00018070787,0.00007419293,0.000029251863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005307857,0.000033817814,0.0016371481,0.000079276244,0.00007661078,0.000011226375,0.0013263568,0.0015981308,0.00010794285,0.12282825,0.036271702,0.8359765],"study_design_scores_gemma":[0.0011629465,0.00014656574,0.0008564029,0.000054816217,0.0000097304255,0.000044260945,0.00008955632,0.62318206,0.000018855802,0.0020794307,0.3720552,0.00030017947],"about_ca_topic_score_codex":0.00010680987,"about_ca_topic_score_gemma":0.000006938471,"teacher_disagreement_score":0.88898957,"about_ca_system_score_codex":0.000013535625,"about_ca_system_score_gemma":0.000027317345,"threshold_uncertainty_score":0.33687612},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009511569,0.6657872,0.07328212,0.24718732,0.00037799924,0.001488484,0.0000061698647,0.0013161582,0.0010429643],"genre_scores_gemma":[0.80358106,0.15623914,0.031645156,0.008171983,0.000044960278,0.00009972699,0.000011345793,0.000016624137,0.00019001072],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862707,0.00045602585,0.00025892202,0.00031189472,0.00014601325,0.00020005662],"domain_scores_gemma":[0.996704,0.00042561677,0.00017163355,0.0025490231,0.00009585109,0.000053905227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181559,0.00018553324,0.00030935102,0.000060589686,0.00019724005,0.0002335599,0.0034795187,0.0000611586,0.0000017206172],"category_scores_gemma":[0.00010998187,0.0001270467,0.000065123095,0.00026910132,0.00022577852,0.00028677002,0.003463786,0.00038378435,0.0000052425357],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000218342,0.000038960028,0.0012387794,0.00013133828,0.000050149065,0.0000039888446,0.000907144,5.695477e-8,0.000012755609,0.03495397,0.0116108395,0.95104986],"study_design_scores_gemma":[0.002506475,0.001617308,0.038829762,0.009271557,0.00047206477,0.0017966165,0.0005548364,0.08941314,0.000393601,0.054683495,0.79743665,0.0030245169],"about_ca_topic_score_codex":0.00033526312,"about_ca_topic_score_gemma":0.000059854625,"teacher_disagreement_score":0.94802535,"about_ca_system_score_codex":0.000024001867,"about_ca_system_score_gemma":0.000021028762,"threshold_uncertainty_score":0.6465869},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007043179,0.00000910156,0.98755056,0.0005947046,0.0010614912,0.00046549056,3.5004211e-7,0.000181498,0.0030936308],"genre_scores_gemma":[0.99396485,0.0000028691704,0.0034814589,0.0013070788,0.000066520275,0.000038647326,0.0000022497898,0.000002654054,0.0011336623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994987,0.000011266764,0.000116856616,0.00010843185,0.00011778699,0.00014691333],"domain_scores_gemma":[0.9996281,0.00002719102,0.000050172286,0.00018387656,0.00008334272,0.000027264925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012409108,0.000058380516,0.00006122992,0.00007498732,0.00008570869,0.00017634721,0.00020447889,0.00003440932,0.00001428528],"category_scores_gemma":[0.0000047259364,0.000047944897,0.00004719126,0.0001615561,0.0000023704224,0.00082528027,0.00005149752,0.00005203907,0.00020231456],"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.000009431993,0.000013492753,0.000032969456,0.000016699409,0.0000135825085,1.4476885e-7,0.00011981372,0.0006168248,0.00045720872,0.9698551,0.0011192258,0.027745448],"study_design_scores_gemma":[0.00043250003,0.0000648448,0.000036979236,0.000012296046,0.0000026468779,0.000005703252,0.000029562363,0.97151977,0.00049422757,0.019673811,0.007620263,0.00010739891],"about_ca_topic_score_codex":0.000049321523,"about_ca_topic_score_gemma":0.0000036684635,"teacher_disagreement_score":0.98692167,"about_ca_system_score_codex":0.000034859593,"about_ca_system_score_gemma":0.00002452254,"threshold_uncertainty_score":0.26004118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46826902,0.0005809998,0.5274301,0.0021274611,0.0004529176,0.0007518206,0.000008324251,0.00024874654,0.00013059932],"genre_scores_gemma":[0.99475527,0.000034838617,0.0046583517,0.00020261167,0.000045210512,0.000050401955,0.000011550492,0.000025823354,0.00021592823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758697,0.00037458903,0.0004674583,0.00078121707,0.00043516824,0.00035458716],"domain_scores_gemma":[0.99764705,0.00038638414,0.0004105487,0.0012551324,0.00018746326,0.00011344462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072776835,0.00033624438,0.0004650761,0.000058870683,0.00032338925,0.00021577091,0.0018620542,0.000132298,0.0000018563549],"category_scores_gemma":[0.0002840535,0.0002290367,0.00017283864,0.00017517354,0.000121258956,0.00015206465,0.0014715365,0.0009545804,0.0000323818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019972802,0.0017777671,0.28965005,0.0036639185,0.004716113,0.0015360432,0.012620229,0.4180454,0.15614015,0.03212505,0.001518019,0.07620997],"study_design_scores_gemma":[0.000538925,0.0002777356,0.025901746,0.00070292735,0.0001399996,0.00003713055,0.00005024271,0.96807027,0.000284245,0.003299419,0.000045369638,0.0006520162],"about_ca_topic_score_codex":0.0005968551,"about_ca_topic_score_gemma":0.000028458637,"teacher_disagreement_score":0.5500248,"about_ca_system_score_codex":0.00014030328,"about_ca_system_score_gemma":0.0002745777,"threshold_uncertainty_score":0.9339845},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019177967,0.00028566748,0.98244005,0.0034201904,0.00045860378,0.00047078799,0.00003329319,0.00026452783,0.01260767],"genre_scores_gemma":[0.47190702,0.00032099755,0.47565073,0.03780641,0.003124645,0.0005449997,0.004414843,0.00032487282,0.0059054764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983441,0.000009596745,0.00072094146,0.00030645897,0.000360075,0.00025882482],"domain_scores_gemma":[0.9983753,0.00017735326,0.0005287912,0.00029218182,0.00056738826,0.00005896971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000223037,0.00033756054,0.00034097716,0.0004295735,0.00029943523,0.0006623514,0.0006205167,0.00024999934,0.000015155495],"category_scores_gemma":[0.00034317968,0.00033815947,0.00010390103,0.00028316796,0.000035475925,0.002879456,0.00019295899,0.00041457577,0.00004566261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027230884,0.000008632524,0.000010815393,0.0010470429,0.000026764834,0.000004463764,0.0024871144,0.01962627,0.00006508707,0.019001083,0.00037140975,0.9573241],"study_design_scores_gemma":[0.0018923273,0.00006806047,0.000061621526,0.001883842,0.00009119841,0.00003585205,0.00004683562,0.8023655,0.00059013744,0.060648747,0.13076441,0.0015514634],"about_ca_topic_score_codex":0.000013933891,"about_ca_topic_score_gemma":0.000033518067,"teacher_disagreement_score":0.95577264,"about_ca_system_score_codex":0.00013716941,"about_ca_system_score_gemma":0.00038224898,"threshold_uncertainty_score":0.999907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6733001,0.00016167913,0.32542747,0.00042455693,0.00012504356,0.00029016982,0.0000040578416,0.000079808924,0.00018711489],"genre_scores_gemma":[0.98759985,0.000018688543,0.010116584,0.00094491564,0.00002341208,0.00000850652,0.000003308833,0.000012276511,0.0012724717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888474,0.000046089328,0.0001736223,0.0004595396,0.00016006759,0.00027593033],"domain_scores_gemma":[0.9992394,0.00024896843,0.000056498404,0.000262886,0.000060464474,0.0001318182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027548178,0.00017308931,0.00026372523,0.00007884334,0.00011355365,0.00019050504,0.00022524776,0.00005577065,0.000005542418],"category_scores_gemma":[0.000010340036,0.00012648517,0.000047940808,0.00006939529,0.00006802078,0.0004106619,0.000112244474,0.000103908824,0.0000041175063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006218691,0.0007744783,0.046109214,0.00064709625,0.0015207166,0.00029021097,0.011874517,0.00552903,0.111091055,0.21044648,0.008144797,0.5973537],"study_design_scores_gemma":[0.01638038,0.0015588548,0.008733805,0.00017453884,0.0000912944,0.00022223484,0.0022807443,0.96669185,0.0012632667,0.00031125997,0.0012911609,0.0010005955],"about_ca_topic_score_codex":0.0008095294,"about_ca_topic_score_gemma":0.00013754108,"teacher_disagreement_score":0.9611628,"about_ca_system_score_codex":0.000027867725,"about_ca_system_score_gemma":0.000044275297,"threshold_uncertainty_score":0.5157916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013883422,0.082493454,0.8748208,0.03766419,0.0003878623,0.00245678,0.000002285964,0.000370456,0.00041578582],"genre_scores_gemma":[0.41422877,0.068991095,0.4633676,0.04901909,0.00031582033,0.003363332,0.00027683904,0.000071801056,0.00036564717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793667,0.00049187243,0.0006386439,0.0004102078,0.00019261024,0.00032999789],"domain_scores_gemma":[0.99398875,0.00095598307,0.00028478273,0.0043731867,0.0003013623,0.00009594469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010146712,0.00021740544,0.00041500625,0.0000858851,0.00023559552,0.00022132437,0.004312617,0.0000721162,0.000023873028],"category_scores_gemma":[0.00011193034,0.00021021943,0.00017420223,0.00052913016,0.000035297144,0.0006973273,0.0014375655,0.00027833765,0.00022987727],"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.0000029311411,0.00020271304,0.0014151833,0.0007338793,0.00004373668,9.1692067e-7,0.00021421665,0.00061611464,0.00002250881,0.021732083,0.31477123,0.66024446],"study_design_scores_gemma":[0.0009872786,0.00015280192,0.0130419675,0.005833034,0.000046884226,0.00003229948,0.000011902972,0.5881822,0.00000912253,0.017215634,0.37359408,0.0008927595],"about_ca_topic_score_codex":0.00016771854,"about_ca_topic_score_gemma":0.00003867589,"teacher_disagreement_score":0.6593517,"about_ca_system_score_codex":0.00010750715,"about_ca_system_score_gemma":0.00005662453,"threshold_uncertainty_score":0.8572499},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30791593,0.000048857255,0.67629516,0.00028819538,0.0004891368,0.00033946367,5.1633356e-7,0.0001725748,0.014450184],"genre_scores_gemma":[0.9911437,0.0000054660077,0.0006793659,0.0010102428,0.000021357097,0.000016673866,0.0000025639754,0.0000063728003,0.0071142735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987819,0.000116778516,0.00017385214,0.00040613994,0.00024102176,0.0002802831],"domain_scores_gemma":[0.99930376,0.00017196948,0.000055540626,0.00035943146,0.00004705791,0.0000622313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029844962,0.00013494551,0.00015355217,0.000099114215,0.00004535429,0.000092747454,0.00037844933,0.000031430118,0.000072821924],"category_scores_gemma":[0.00001702575,0.00011325768,0.000054823096,0.00013072761,0.000010782597,0.00019404282,0.00014183245,0.00031073505,0.00017686373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023044244,0.0002461692,0.031495463,0.000008460143,0.000020407648,0.000034018205,0.00018342277,0.92886734,0.00036996155,0.0128948875,0.0017622921,0.023887118],"study_design_scores_gemma":[0.00079369306,0.0003284738,0.0045789774,0.000096894044,0.0000015599809,0.0000010671104,0.00007158567,0.9931267,0.00021259565,0.000015920508,0.000607844,0.00016471409],"about_ca_topic_score_codex":0.00015785504,"about_ca_topic_score_gemma":0.0000319908,"teacher_disagreement_score":0.6832278,"about_ca_system_score_codex":0.000087218796,"about_ca_system_score_gemma":0.00004157893,"threshold_uncertainty_score":0.46185142},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35239613,0.000080247795,0.64334774,0.00043362798,0.00092987536,0.00019661187,0.000047150574,0.000502624,0.002066012],"genre_scores_gemma":[0.9976174,0.00018859826,0.0012468704,0.00036506244,0.00018158031,4.863202e-7,0.000070726855,0.000016158758,0.0003130811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979106,0.00012354035,0.00024342806,0.0012051688,0.00014667488,0.00037056595],"domain_scores_gemma":[0.9979254,0.00016495904,0.00026545045,0.0012615377,0.00015107375,0.00023154887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014791447,0.00036024113,0.00039777317,0.00014998917,0.00023422396,0.00022134866,0.0019008974,0.00039629423,0.000057464782],"category_scores_gemma":[0.000028627408,0.00043480386,0.00022124768,0.00060402247,0.00011207825,0.0003390298,0.0020560748,0.0011077799,0.00035082942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012419379,0.00013284848,0.012788812,0.00027511042,0.0003139771,0.0009580511,0.0002784087,0.70235395,0.000053553606,0.2780486,0.0022617017,0.002410805],"study_design_scores_gemma":[0.00041208672,0.00007394355,0.002332617,0.00026954728,0.00008072874,0.000011426141,0.000037561822,0.95973986,0.00007929069,0.03481162,0.0015057414,0.0006455754],"about_ca_topic_score_codex":0.000120933364,"about_ca_topic_score_gemma":0.0000031319437,"teacher_disagreement_score":0.6452213,"about_ca_system_score_codex":0.00018635938,"about_ca_system_score_gemma":0.0002356486,"threshold_uncertainty_score":0.9998104},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37984848,0.00003415757,0.6156557,0.0037445913,0.00026160447,0.0001531451,0.000037321566,0.0001584397,0.00010655603],"genre_scores_gemma":[0.99382335,0.0000041650965,0.0020598962,0.0038327717,0.00020770563,0.00002378398,0.000018283168,0.000009726712,0.000020334403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864477,0.000104701176,0.00016772834,0.00048448498,0.0003416187,0.00025672713],"domain_scores_gemma":[0.99895126,0.000095924785,0.00008590504,0.0003791414,0.00020333103,0.0002844334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013658128,0.00015803045,0.00018639491,0.000034657223,0.00020457049,0.00076422,0.001127866,0.0000540972,0.000009237828],"category_scores_gemma":[0.00007912445,0.00013000157,0.000034556502,0.0007227732,0.000031368992,0.0013442301,0.00016983389,0.00020428916,0.000029770177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036421667,0.0018289089,0.09664526,0.00030083407,0.0011612668,0.0022435167,0.076526545,0.10358801,0.07369909,0.24830174,0.0360292,0.35603347],"study_design_scores_gemma":[0.0074467356,0.010315033,0.11128112,0.0015303751,0.00033182473,0.0001609644,0.0057556555,0.6802945,0.13115399,0.0076480377,0.037210837,0.0068709385],"about_ca_topic_score_codex":0.00032457433,"about_ca_topic_score_gemma":0.00007255953,"teacher_disagreement_score":0.61397487,"about_ca_system_score_codex":0.00005819752,"about_ca_system_score_gemma":0.0000955419,"threshold_uncertainty_score":0.73693913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00940735,0.00010713972,0.98596007,0.003231425,0.00011512847,0.000619395,0.000018370758,0.00036733848,0.00017378382],"genre_scores_gemma":[0.97203845,0.000037530343,0.026502043,0.001097277,0.000011076416,0.00025037996,0.0000080662285,0.000024649273,0.0000305212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977587,0.0005244327,0.00052209443,0.0005292273,0.00030006797,0.00036551384],"domain_scores_gemma":[0.9974518,0.00052029337,0.00014749497,0.0015406959,0.00015668057,0.0001830455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043715304,0.00027274367,0.00033827624,0.00027582757,0.0008455251,0.00021410907,0.0019739608,0.000103632396,0.0000037229981],"category_scores_gemma":[0.000030392122,0.00027617312,0.00017249686,0.0009537313,0.00014225063,0.00051303237,0.000025744399,0.00093567,0.000024025167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006391137,0.0012862982,0.000018672381,0.000048398553,0.0000504183,0.000007750678,0.0058230213,0.9092269,0.04068461,0.001940038,0.00002296023,0.040827017],"study_design_scores_gemma":[0.00091066,0.00017003776,0.000018950072,0.0000743996,0.000018481232,0.0000057685415,0.0007133578,0.9901045,0.007654833,0.000007604079,0.000020501968,0.00030089365],"about_ca_topic_score_codex":0.0005838002,"about_ca_topic_score_gemma":0.00010001908,"teacher_disagreement_score":0.9626311,"about_ca_system_score_codex":0.00017240671,"about_ca_system_score_gemma":0.00028507336,"threshold_uncertainty_score":0.99996907},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07102952,0.000036675607,0.9280784,0.00025945788,0.00013626071,0.00015305098,0.000004153274,0.0000840381,0.00021841246],"genre_scores_gemma":[0.9984243,0.00006235796,0.00009943275,0.001354634,0.0000245525,0.000016896947,0.000009312407,0.0000037784332,0.0000047266917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992253,0.000080220685,0.0002480542,0.00013374408,0.00015368749,0.00015895655],"domain_scores_gemma":[0.9996307,0.000086254964,0.00007753395,0.0000793023,0.00004396739,0.000082234284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033028677,0.00011850539,0.00013197707,0.00009273588,0.00027231177,0.00018358116,0.00009857919,0.00007896397,0.000004032688],"category_scores_gemma":[0.0000047648577,0.000118724645,0.000049825176,0.00018088239,0.000040206243,0.0008816721,0.0000048211336,0.00044753513,0.000002904794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011675923,0.000019258543,0.000045640987,0.000064573964,0.000018078244,0.0000022027793,0.026799535,0.8636956,0.000010306154,0.014118749,0.00005824842,0.095051035],"study_design_scores_gemma":[0.0006247817,0.00013493071,0.000056307057,0.00002188413,0.0000073858564,0.0000026253383,0.00050551695,0.99678487,0.00007151865,0.0005825866,0.0010675631,0.0001400159],"about_ca_topic_score_codex":0.000025196387,"about_ca_topic_score_gemma":0.000012498412,"teacher_disagreement_score":0.927979,"about_ca_system_score_codex":0.000028205453,"about_ca_system_score_gemma":0.000023704219,"threshold_uncertainty_score":0.48414508},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128223365,0.00046503372,0.98478323,0.0005177964,0.00028017006,0.00062123296,0.0000015206421,0.00023671116,0.00027194063],"genre_scores_gemma":[0.9899086,0.000025018107,0.008634069,0.0008094696,0.00050448196,0.000050390885,0.000017515815,0.000015170209,0.000035329263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982259,0.00033694782,0.00039726717,0.00041980785,0.00025385563,0.00036620177],"domain_scores_gemma":[0.9991758,0.00017021439,0.00022572206,0.00019111592,0.00009258119,0.00014455886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005667986,0.00018017154,0.00023405615,0.000027534967,0.00043134295,0.0005582083,0.00022462902,0.00004528541,0.0000055790283],"category_scores_gemma":[0.000008275996,0.00015402412,0.00003232008,0.00032459034,0.000019700778,0.00048205198,0.00008609626,0.0001295478,0.000005660512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044461858,0.00006801949,0.052981537,0.00043631793,0.00067024294,0.00021693936,0.020033533,0.38973895,0.0040938095,0.09390275,0.07593593,0.36147735],"study_design_scores_gemma":[0.0008235846,0.00035884004,0.0003822206,0.00012009487,0.000025495106,0.00004113715,0.0015235312,0.9957246,0.00003323738,0.000041907566,0.0006746708,0.00025066404],"about_ca_topic_score_codex":0.00016660486,"about_ca_topic_score_gemma":0.00001636033,"teacher_disagreement_score":0.97708625,"about_ca_system_score_codex":0.000034352863,"about_ca_system_score_gemma":0.00007109996,"threshold_uncertainty_score":0.62809217},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33070147,0.00001089939,0.6666466,0.00024414834,0.00011091857,0.00031672744,0.000036146772,0.00007510993,0.0018579711],"genre_scores_gemma":[0.96072525,0.0000012384041,0.033335183,0.00026394727,0.000015176458,0.000035223715,0.000072723946,0.000007170651,0.0055440795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992857,0.000016150378,0.00013092729,0.00022264785,0.00014961649,0.00019493053],"domain_scores_gemma":[0.9995851,0.00007119972,0.00003883438,0.00022810869,0.000047522764,0.000029246074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017440975,0.0000893449,0.00011182543,0.00009164977,0.000058388567,0.000116463154,0.00025330766,0.000031050287,0.00007574774],"category_scores_gemma":[0.000012001992,0.000072886665,0.00002820654,0.000105013205,0.0000079534275,0.0003976811,0.000067896566,0.00006813837,0.000017177392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011032752,0.00082800054,0.08901928,0.00044260937,0.00017826473,0.00004436614,0.009494291,0.38633695,0.006878286,0.45325685,0.02690801,0.025509812],"study_design_scores_gemma":[0.0016694197,0.00033394215,0.004217211,0.000084886364,0.000003987933,0.000011154687,0.00063745625,0.99122727,0.00062601204,0.00015294824,0.00076472305,0.00027096918],"about_ca_topic_score_codex":0.00050955237,"about_ca_topic_score_gemma":0.00049952406,"teacher_disagreement_score":0.63331145,"about_ca_system_score_codex":0.000056746074,"about_ca_system_score_gemma":0.00004420072,"threshold_uncertainty_score":0.29722318},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073687196,0.000026333666,0.92385864,0.00049280695,0.0008512982,0.00033628067,0.00007064074,0.00058405456,0.000092770926],"genre_scores_gemma":[0.9768414,0.0000037141006,0.02105977,0.0018024999,0.00011778738,0.000027536158,0.00001537038,0.00003173995,0.00010016835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978886,0.00016720501,0.00039247048,0.0006590932,0.00045865035,0.00043397365],"domain_scores_gemma":[0.9988197,0.00029263174,0.00011495837,0.00046742932,0.0000851654,0.00022009393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025639535,0.0002760783,0.00027415223,0.00016764505,0.00046772134,0.00018126401,0.00053772295,0.00008132964,0.000027814967],"category_scores_gemma":[0.0000067640854,0.0002881056,0.00016763285,0.00050839566,0.00003583826,0.00014518494,0.000007166668,0.0005149404,0.00014045286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040880932,0.00038379626,0.000038650018,0.00002819095,0.00002040999,0.000025115163,0.0009692824,0.90419805,0.00019706132,0.00007089536,0.00092868786,0.093098976],"study_design_scores_gemma":[0.0008404877,0.00061305985,0.000036236197,0.00005844924,0.000021820695,0.000003995857,0.0001132157,0.9950192,0.0015895403,0.0000063974135,0.0013979367,0.00029966646],"about_ca_topic_score_codex":0.000026388616,"about_ca_topic_score_gemma":0.00004581895,"teacher_disagreement_score":0.9031542,"about_ca_system_score_codex":0.000113131864,"about_ca_system_score_gemma":0.00011267554,"threshold_uncertainty_score":0.9999571},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004370375,0.16559117,0.39464137,0.43095756,0.0012062419,0.0014019469,0.000008718175,0.00075670314,0.0010659355],"genre_scores_gemma":[0.8714024,0.064850554,0.004114359,0.059273,0.00014543677,0.000091476155,0.000068352034,0.00002101702,0.000033398417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996179,0.0025510693,0.00046071454,0.0003760814,0.00026977176,0.00016338695],"domain_scores_gemma":[0.99309695,0.0029115279,0.00065471354,0.0030492782,0.0001915593,0.0000959976],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001699628,0.00019728018,0.0002932328,0.00003954468,0.00017850191,0.00032835666,0.0057719466,0.000027439366,0.000027494387],"category_scores_gemma":[0.001859251,0.00013834465,0.00014808189,0.00048381093,0.00004131327,0.0004391685,0.0025302821,0.00070427905,0.0004320101],"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.000008977452,0.00012690379,0.00045355008,0.00020998136,0.00005304733,0.0000011908533,0.0005889197,0.000014055132,0.000005420037,0.011232368,0.28986996,0.6974356],"study_design_scores_gemma":[0.0003452215,0.00036315146,0.0072416244,0.0048675756,0.000050045543,0.000013738432,0.000011802506,0.22628316,0.000023999637,0.0006906111,0.7595724,0.0005367024],"about_ca_topic_score_codex":0.00017244402,"about_ca_topic_score_gemma":0.000047997164,"teacher_disagreement_score":0.86703205,"about_ca_system_score_codex":0.00004814885,"about_ca_system_score_gemma":0.000044413657,"threshold_uncertainty_score":0.9996073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007402081,0.20976977,0.6160455,0.1600389,0.0007545864,0.002478352,0.0000040548884,0.0004709244,0.0030358722],"genre_scores_gemma":[0.80295336,0.052093595,0.078869574,0.06534486,0.000075756216,0.00023665036,0.000020601517,0.0000309355,0.00037464924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730134,0.0015334738,0.00051368395,0.00021585058,0.0002636586,0.00017198766],"domain_scores_gemma":[0.99238855,0.0008868403,0.0003328167,0.0060295947,0.00030569633,0.000056486213],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0013011042,0.00015362684,0.00031493194,0.000039146642,0.00019723237,0.000106342195,0.0075461953,0.000040418694,0.00002167652],"category_scores_gemma":[0.00025531594,0.00010711545,0.00018227269,0.000517533,0.00008146751,0.0003491467,0.0032184627,0.00026503016,0.000065013184],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1537076e-7,0.00009075213,0.0006251754,0.00037233537,0.000029856203,2.5775486e-7,0.00017414898,0.000040324147,0.0000857585,0.013084294,0.11896664,0.8665301],"study_design_scores_gemma":[0.0014573785,0.0002921426,0.02036844,0.027926816,0.00016038744,0.00010487671,0.00016802587,0.5830674,0.0004097531,0.023764065,0.34039795,0.0018827561],"about_ca_topic_score_codex":0.00031505243,"about_ca_topic_score_gemma":0.000012708204,"teacher_disagreement_score":0.8646474,"about_ca_system_score_codex":0.000033289703,"about_ca_system_score_gemma":0.000051488685,"threshold_uncertainty_score":0.9978235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09651791,0.00009848834,0.8992579,0.0018326332,0.001304436,0.00041740327,0.000004291207,0.00048953755,0.00007739465],"genre_scores_gemma":[0.9856824,0.000009033226,0.012389279,0.0015731497,0.0002592295,0.000013037406,0.000006097804,0.00003488578,0.00003283791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747896,0.00018380226,0.0006533803,0.0007413947,0.00032166822,0.00062077737],"domain_scores_gemma":[0.9986599,0.00049130624,0.00022473747,0.00023723334,0.00021774299,0.00016908556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005419099,0.00034655523,0.00044341985,0.00020206401,0.0010521553,0.00038478497,0.0005374485,0.00014076864,0.000003579042],"category_scores_gemma":[0.000057287692,0.00038316817,0.0002153241,0.000765115,0.000035255067,0.00024603723,0.000020462721,0.00093723903,0.0000027714887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051522864,0.000057608548,0.00007911214,0.00003146557,0.00004460929,0.000023282288,0.0017328318,0.8881002,0.00020028798,0.000107901215,0.000014582053,0.10955659],"study_design_scores_gemma":[0.0015048885,0.00028931504,0.000038841787,0.00019003135,0.000016539727,0.000008002093,0.00033459647,0.99475646,0.0021365122,0.000018182385,0.00031341976,0.00039321074],"about_ca_topic_score_codex":0.00014828268,"about_ca_topic_score_gemma":0.00006100314,"teacher_disagreement_score":0.88916457,"about_ca_system_score_codex":0.00020375838,"about_ca_system_score_gemma":0.00013627278,"threshold_uncertainty_score":0.999862},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15872781,0.00016755013,0.8393321,0.0007465485,0.0004183909,0.0001914443,2.9512975e-7,0.000063095074,0.00035276433],"genre_scores_gemma":[0.99100417,0.00003106422,0.007026926,0.0013877173,0.00007544907,0.0000055205346,0.0000033641259,0.000023449638,0.0004423464],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978505,0.00015381494,0.0007936708,0.00034118647,0.00049212395,0.0003687414],"domain_scores_gemma":[0.9980043,0.00018079221,0.0008667467,0.0001243067,0.00060460926,0.00021925652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006393501,0.00026473822,0.0005112144,0.00013519557,0.0001408926,0.00042964116,0.0009522985,0.00007906781,0.000032026735],"category_scores_gemma":[0.0002538927,0.00020901134,0.00022378817,0.00018939233,0.00007267891,0.001369119,0.00017845334,0.0007782208,0.000004420162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00889322,0.0006156381,0.0048112264,0.0008940513,0.0043158694,0.00045636925,0.33948958,0.26864702,0.27882847,0.015482127,0.01606759,0.061498854],"study_design_scores_gemma":[0.002045274,0.0016680618,0.000015009147,0.00057345134,0.000049638285,0.00018021258,0.00050103996,0.932807,0.06130437,0.000060130304,0.00054072944,0.000255062],"about_ca_topic_score_codex":0.0003179447,"about_ca_topic_score_gemma":0.000005216748,"teacher_disagreement_score":0.8323052,"about_ca_system_score_codex":0.00009750539,"about_ca_system_score_gemma":0.00012660552,"threshold_uncertainty_score":0.85232353},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06294312,0.001388726,0.5930827,0.3400088,0.00036190197,0.0016190504,0.0000984775,0.000083277526,0.0004139568],"genre_scores_gemma":[0.91267675,0.00016911901,0.08290819,0.0040678526,0.000038914237,0.000043199117,0.000011403653,0.0000117400805,0.00007284183],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985563,0.0003390535,0.00050802407,0.00015939148,0.00025565858,0.00018157894],"domain_scores_gemma":[0.99537885,0.0005240803,0.0005767381,0.0025518325,0.0007969571,0.00017154893],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.000957584,0.00013412673,0.0002683859,0.000017693295,0.0011597646,0.0005019464,0.013153266,0.00004776908,0.0000011166676],"category_scores_gemma":[0.00015113848,0.000094290954,0.00033725853,0.0006552245,0.00013817193,0.00064576895,0.0017869106,0.00048077566,0.0000055905493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010027306,0.0048296154,0.0047974954,0.00033411407,0.005702923,0.000006956955,0.08206498,0.036574334,0.107844815,0.08306215,0.43261167,0.24116822],"study_design_scores_gemma":[0.0059668953,0.0011453367,0.006537963,0.001303855,0.0006573345,0.00027686293,0.007968544,0.6973536,0.0017471208,0.0003160932,0.27572206,0.0010043071],"about_ca_topic_score_codex":0.000034545526,"about_ca_topic_score_gemma":0.000063152125,"teacher_disagreement_score":0.8497336,"about_ca_system_score_codex":0.00017757725,"about_ca_system_score_gemma":0.0002839267,"threshold_uncertainty_score":0.99218607},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035652301,0.6828271,0.3142844,0.00006946509,0.0018004074,0.0002856285,0.00000656418,0.00057609484,0.00014676283],"genre_scores_gemma":[0.0004772765,0.9953747,0.0027448987,0.00034322348,0.0007455142,0.000009906469,0.00007329507,0.000066725326,0.00016447234],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939464,0.0026474465,0.0009952105,0.0012544396,0.0004498873,0.0007066721],"domain_scores_gemma":[0.9946162,0.0022266551,0.0006112148,0.0020981773,0.0001675758,0.00028019358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026082883,0.0007182883,0.0021513964,0.00019203794,0.0002844288,0.0005518877,0.0051925643,0.0003407431,0.0000052201735],"category_scores_gemma":[0.0005398908,0.0006361884,0.0009906737,0.0008841849,0.000053063828,0.00020143556,0.003677194,0.0011514298,0.00033758327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6290566e-7,0.000023120137,0.000017776627,0.0006493154,0.00016454968,0.00015296925,0.000028641554,0.00008192963,7.421277e-8,0.00038146725,0.0017760763,0.9967236],"study_design_scores_gemma":[0.00020470416,0.000079604324,0.000053846285,0.0057245893,0.00018074752,0.00015211769,0.0000047520425,0.06975543,8.529019e-8,0.00003827062,0.9228145,0.000991388],"about_ca_topic_score_codex":0.00022355966,"about_ca_topic_score_gemma":0.00000902127,"teacher_disagreement_score":0.99573225,"about_ca_system_score_codex":0.00015966906,"about_ca_system_score_gemma":0.0003058983,"threshold_uncertainty_score":0.99960893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11615679,0.0001762036,0.8639748,0.018145243,0.00031440094,0.0006181398,0.000007831045,0.0005817006,0.000024910752],"genre_scores_gemma":[0.995263,0.000014192199,0.0017067438,0.002587551,0.00003002007,0.00034662298,0.0000019015131,0.000023541901,0.000026426134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983799,0.00010685593,0.0003015739,0.00061791745,0.00017569795,0.00041804413],"domain_scores_gemma":[0.9989029,0.0002467498,0.00008500864,0.00060287584,0.000088248395,0.00007418906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002445787,0.00023933993,0.00026904762,0.0002960753,0.00033966996,0.00008080316,0.0009669906,0.00029134873,0.0000033434264],"category_scores_gemma":[0.000020088242,0.00019897813,0.00021405649,0.00082677393,0.00013603407,0.00018404248,0.000009678284,0.00084897096,0.000016083552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024807765,0.00044847952,0.00018472901,0.000023655692,0.00018806978,0.00008678915,0.00051222194,0.85597116,0.0075694425,0.0024492661,0.00030739701,0.13201071],"study_design_scores_gemma":[0.0009557924,0.00040701896,0.00008304697,0.00002850985,0.000035462064,0.000014909895,0.00010867407,0.98018205,0.015622001,0.00029617225,0.0020000467,0.0002662896],"about_ca_topic_score_codex":0.000095192765,"about_ca_topic_score_gemma":0.00010178212,"teacher_disagreement_score":0.8791062,"about_ca_system_score_codex":0.00011621985,"about_ca_system_score_gemma":0.00012509296,"threshold_uncertainty_score":0.8114093},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21888994,0.00020598463,0.77828485,0.0013937365,0.00027197608,0.00016861164,0.0000018894399,0.00071045914,0.000072570896],"genre_scores_gemma":[0.9981178,0.000056322708,0.0011847571,0.0004960898,0.000020320394,0.000092235554,0.0000010877645,0.000014156595,0.000017219998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998665,0.00006502751,0.00026073641,0.00050011976,0.00016253204,0.00034657939],"domain_scores_gemma":[0.9993353,0.00004217414,0.000052098305,0.0004500688,0.000044192664,0.00007619405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010346677,0.00018399738,0.0002266764,0.00034535668,0.00015459835,0.00007151658,0.00062519434,0.00025289805,0.000007767803],"category_scores_gemma":[0.0000034326476,0.00018953392,0.000105130384,0.0011827811,0.00007700474,0.00032161875,0.000008760524,0.00086403015,0.000036557747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021447027,0.00013983653,0.00005923268,0.000008313653,0.00003846546,0.00022215578,0.00024657845,0.93864936,0.0052557755,0.0057617,0.000029630566,0.049567487],"study_design_scores_gemma":[0.00056356814,0.0003569816,0.00001727761,0.00003376607,0.000013061352,0.000057121408,0.0004501942,0.9928936,0.0041283807,0.0003842671,0.000841065,0.0002607666],"about_ca_topic_score_codex":0.00009676196,"about_ca_topic_score_gemma":0.00008423369,"teacher_disagreement_score":0.77922785,"about_ca_system_score_codex":0.00005785606,"about_ca_system_score_gemma":0.000051506435,"threshold_uncertainty_score":0.7728969},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026999726,0.0007437991,0.9951844,0.0003333303,0.000028661485,0.0005536659,0.000003327675,0.00010072033,0.0003521084],"genre_scores_gemma":[0.99827164,0.00033654954,0.000040880233,0.00063359196,0.0001730825,0.00048933056,0.000030406873,0.0000072835633,0.000017244474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991002,0.000056521,0.00019922286,0.0003713249,0.00008326264,0.00018943612],"domain_scores_gemma":[0.9995363,0.00005951821,0.000056665467,0.00019393448,0.000043210217,0.00011041899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011484422,0.00011830042,0.0001342169,0.000026332933,0.00020282443,0.00017732802,0.0002360696,0.00006200105,0.000007796347],"category_scores_gemma":[0.0000025711918,0.000117286436,0.000026427824,0.0003838146,0.000024725408,0.0001994723,0.00013776796,0.00023706474,0.0000020617001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037994564,0.000033527867,0.00021799834,0.0000035473504,0.0000052792466,0.0000013421944,0.000029968573,0.99300045,0.0000034608186,0.0037895837,0.00029870353,0.0026123624],"study_design_scores_gemma":[0.00023442341,0.00005759032,0.00008995323,0.000011636109,0.000004241736,0.000001714762,0.00014204186,0.9983523,0.000001702299,0.000022352753,0.0009543053,0.00012776023],"about_ca_topic_score_codex":0.000043639728,"about_ca_topic_score_gemma":0.000028573513,"teacher_disagreement_score":0.9955717,"about_ca_system_score_codex":0.000025465044,"about_ca_system_score_gemma":0.000022916744,"threshold_uncertainty_score":0.47828022},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37794793,0.00030342766,0.6188902,0.0009998768,0.00044504955,0.0007924794,0.00004324972,0.00033721374,0.00024055087],"genre_scores_gemma":[0.996033,0.00045120274,0.0018468503,0.00050872524,0.00008270773,0.000011445982,0.000091678616,0.000020330464,0.00095401704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754643,0.00011698901,0.0002989757,0.0016374843,0.00010790914,0.00029222],"domain_scores_gemma":[0.997417,0.00014845999,0.0003767686,0.0013480913,0.0004527222,0.00025696354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032914538,0.00030954223,0.00039095542,0.00018038743,0.000237464,0.00023147259,0.00087023125,0.00023325636,0.000005628495],"category_scores_gemma":[0.00016388785,0.0003671946,0.0002390318,0.0002511667,0.00007231532,0.0004665333,0.0013017189,0.00037006655,0.000030046564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018764515,0.0015181842,0.008207593,0.0028202697,0.002729155,0.0006045745,0.0066508497,0.0835285,0.0635782,0.7173128,0.031039566,0.08013386],"study_design_scores_gemma":[0.0012660575,0.00020167945,0.0050715175,0.00022824925,0.00022037791,0.000010694687,0.00038786104,0.9795797,0.0009196067,0.010200783,0.0012042761,0.0007092209],"about_ca_topic_score_codex":0.00086490647,"about_ca_topic_score_gemma":0.00006536478,"teacher_disagreement_score":0.89605117,"about_ca_system_score_codex":0.0002940856,"about_ca_system_score_gemma":0.0002428107,"threshold_uncertainty_score":0.999878},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03988773,0.0003015577,0.9556601,0.003064787,0.00015469095,0.0003325227,0.00001186488,0.00041952106,0.0001672396],"genre_scores_gemma":[0.98465675,0.00014200133,0.01299131,0.0019269675,0.00002211994,0.0002005195,0.000015004375,0.000030933632,0.000014411958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789983,0.00052422547,0.00046502196,0.00049899437,0.00026288137,0.00034901858],"domain_scores_gemma":[0.9972132,0.00038647532,0.000115155184,0.0020266522,0.000066128734,0.0001923773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027832665,0.00025920826,0.000333321,0.0002060652,0.00056895334,0.000192391,0.0024513663,0.00012801547,0.000004346586],"category_scores_gemma":[0.0000047751455,0.0002803146,0.00024285715,0.00080219045,0.0000917248,0.00030032004,0.000022581127,0.0009397688,0.000028561732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037696416,0.0004624692,0.000014298138,0.000013501257,0.00004058646,0.00001109081,0.0010671812,0.9874904,0.0005466021,0.0005466198,0.000018704868,0.0097508365],"study_design_scores_gemma":[0.00095465593,0.000061958184,0.000014366359,0.000055997505,0.000023936462,0.000015810774,0.00006888187,0.9980222,0.00031989452,0.000042957472,0.00013450794,0.00028483386],"about_ca_topic_score_codex":0.0002903659,"about_ca_topic_score_gemma":0.00018956281,"teacher_disagreement_score":0.944769,"about_ca_system_score_codex":0.00010837804,"about_ca_system_score_gemma":0.000096405514,"threshold_uncertainty_score":0.9999649},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07374752,0.00033195416,0.91857225,0.006214168,0.00014281996,0.00050113717,0.000007725513,0.00047742072,0.0000050256817],"genre_scores_gemma":[0.9934999,0.000018068618,0.0043703937,0.0018598966,0.000023453034,0.00017614094,0.0000050811304,0.00002277285,0.000024296023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986842,0.00005803987,0.00021246252,0.0005873949,0.00016095657,0.0002969345],"domain_scores_gemma":[0.99911827,0.00006944283,0.000073029085,0.00039955214,0.0002263253,0.000113386144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001002438,0.00022954037,0.00027679818,0.00019501425,0.000403033,0.0000886711,0.0004144841,0.00021197229,0.0000013819913],"category_scores_gemma":[0.000016976759,0.00020331967,0.00007710946,0.00064749963,0.00012869351,0.00018448569,0.000004926823,0.00044592482,0.000005633076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014164762,0.00016883618,0.00016185886,0.000043689317,0.00019079087,0.000060951574,0.0001593941,0.9652017,0.0060733035,0.0048029185,0.00006927994,0.022925647],"study_design_scores_gemma":[0.0014776563,0.0007986619,0.000017235492,0.0000698535,0.00005966049,0.000028250613,0.00007605093,0.98527837,0.01118678,0.000058862766,0.00066905125,0.00027956758],"about_ca_topic_score_codex":0.000032139862,"about_ca_topic_score_gemma":0.000029594887,"teacher_disagreement_score":0.91975236,"about_ca_system_score_codex":0.000045366443,"about_ca_system_score_gemma":0.000058405665,"threshold_uncertainty_score":0.82911354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013549811,0.000114874434,0.9914931,0.005813048,0.00027247024,0.00036049823,0.000042457617,0.00022493576,0.00032362665],"genre_scores_gemma":[0.9741906,0.000109107066,0.025135987,0.0003427652,0.000015291504,0.00011813624,0.000011677165,0.000011429687,0.00006503096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.00010249233,0.000326322,0.0002185238,0.00010810239,0.00014874342],"domain_scores_gemma":[0.99803215,0.00046077673,0.00014019012,0.0010653787,0.00021341433,0.00008806934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001458206,0.00011743123,0.00017514158,0.00010081449,0.0005658299,0.00006371719,0.0011148718,0.000067057445,0.000004880253],"category_scores_gemma":[0.000021357446,0.0001304101,0.0001674607,0.00040132296,0.00011792562,0.00030905608,0.000012599125,0.0003040642,0.0000032369635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002575182,0.002725682,0.000099467456,0.0001662499,0.00088081555,9.733685e-7,0.0050545963,0.19215736,0.09989478,0.3487751,0.0015391051,0.34844837],"study_design_scores_gemma":[0.0006818234,0.00014889953,0.000010298062,0.000023096929,0.00003843815,0.0000033670522,0.000116703064,0.99271816,0.00465382,0.00042304935,0.0010497614,0.00013258317],"about_ca_topic_score_codex":0.000052261206,"about_ca_topic_score_gemma":0.000040008563,"teacher_disagreement_score":0.9728356,"about_ca_system_score_codex":0.000034295266,"about_ca_system_score_gemma":0.0000673802,"threshold_uncertainty_score":0.53179693},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564677,0.000113767215,0.34045675,0.002354073,0.0000098057435,0.000114031915,0.0000014879338,0.00013491753,0.0003474779],"genre_scores_gemma":[0.9978883,0.000017601213,0.0010420189,0.0009497174,0.00003401265,0.00002777302,0.000028162625,0.000008743891,0.0000036147464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906933,0.00021406349,0.0001405031,0.0002379158,0.00017447022,0.00016373995],"domain_scores_gemma":[0.9988294,0.00022248259,0.00007264695,0.0007272725,0.00006357126,0.00008461595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110323905,0.00011648075,0.00017824548,0.000032522355,0.00009997377,0.00009345095,0.0009849018,0.000031332307,5.8329886e-7],"category_scores_gemma":[0.000012172561,0.000104520666,0.000049370203,0.000379664,0.000057807454,0.0002919234,0.00018761633,0.0003004071,0.000008292906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011477217,0.003910618,0.0013859383,0.00007319553,0.00009749208,0.000039717703,0.008082429,0.59093314,0.032927915,0.09719439,0.0007111994,0.26349625],"study_design_scores_gemma":[0.0011668564,0.00013540279,0.00029236573,0.000035620433,0.000007226127,4.2858744e-7,0.000020885205,0.997322,0.000620443,0.00020742576,0.000051821542,0.00013950458],"about_ca_topic_score_codex":0.00021380773,"about_ca_topic_score_gemma":0.000051712246,"teacher_disagreement_score":0.40638888,"about_ca_system_score_codex":0.00003721043,"about_ca_system_score_gemma":0.00004164701,"threshold_uncertainty_score":0.4262229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85818946,0.0004163528,0.10512886,0.017866844,0.00069033605,0.0010929218,0.00014157746,0.0006777166,0.015795935],"genre_scores_gemma":[0.9968006,0.000040720788,0.0019627619,0.00036807434,0.000086734595,0.000054526892,0.000013173571,0.000009141647,0.0006642648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849826,0.00006601048,0.00036617983,0.0004605004,0.00032635615,0.0002826692],"domain_scores_gemma":[0.99900305,0.00019192042,0.0001747224,0.00030447426,0.0002089671,0.00011687134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019209726,0.0001958545,0.00035529083,0.00008046381,0.000094068775,0.0003171754,0.0010186374,0.00007604643,0.000022023465],"category_scores_gemma":[0.00018679588,0.00015792322,0.00015748548,0.00024980275,0.00012334799,0.0005993488,0.00020747725,0.00013444349,0.0000146355815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004730693,0.0004724591,0.038381506,0.00053507666,0.0004089609,0.000031387946,0.0019802414,0.00016407418,0.21678537,0.7052027,0.009660797,0.025904387],"study_design_scores_gemma":[0.0010674959,0.0007802178,0.0018081521,0.0001512739,0.000035443198,0.0000039156844,0.00021335723,0.9768161,0.0036246595,0.0029485445,0.0121511165,0.00039971154],"about_ca_topic_score_codex":0.000055599026,"about_ca_topic_score_gemma":0.00004845572,"teacher_disagreement_score":0.976652,"about_ca_system_score_codex":0.000014399323,"about_ca_system_score_gemma":0.001508035,"threshold_uncertainty_score":0.6439922},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8237972,0.00017540182,0.17043963,0.0039114994,0.000046852296,0.0001273397,4.6295372e-7,0.00013660254,0.0013649759],"genre_scores_gemma":[0.9917875,0.000005886505,0.0064077554,0.0016127866,0.000039553695,0.000008052255,4.065181e-7,0.000008046568,0.00013003685],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889404,0.00005753151,0.00016288103,0.00043188845,0.0002079988,0.00024564605],"domain_scores_gemma":[0.9993682,0.00009554998,0.00004080039,0.00035519068,0.000028056882,0.00011223382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016248268,0.00013059938,0.00016916396,0.000065652675,0.0000605088,0.00017404435,0.0005929592,0.00003259473,0.0000145110935],"category_scores_gemma":[0.00006318276,0.000100666875,0.000031344054,0.00027791382,0.00002149536,0.00016634255,0.00071240275,0.00017458187,0.000011240261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010513983,0.0010458241,0.22069505,0.0009216178,0.00030124024,0.0010777161,0.07079859,0.05424236,0.44863454,0.012280716,0.0057313535,0.1832196],"study_design_scores_gemma":[0.0021044738,0.00029189565,0.028192414,0.00025304587,0.000011909948,0.000020099607,0.00030452167,0.96354616,0.0043288986,0.000055176275,0.00035774006,0.0005336711],"about_ca_topic_score_codex":0.0001623313,"about_ca_topic_score_gemma":0.000046791367,"teacher_disagreement_score":0.9093038,"about_ca_system_score_codex":0.000017052364,"about_ca_system_score_gemma":0.000025716801,"threshold_uncertainty_score":0.4105076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056497906,0.002779682,0.96737796,0.0078025656,0.005865692,0.00053611613,0.00000555552,0.0014405943,0.008542038],"genre_scores_gemma":[0.9867562,0.0010700449,0.005489672,0.0035297293,0.0027265805,0.000034230623,0.000052001593,0.00005103235,0.00029052424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960352,0.00035372507,0.00072326633,0.0012484905,0.0006678404,0.00097146956],"domain_scores_gemma":[0.99786764,0.000259443,0.0004301344,0.0008272569,0.00020027239,0.00041522423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060761184,0.00052208145,0.00063759944,0.000094769865,0.0004680012,0.0009275118,0.0018173882,0.00024604762,0.000044372897],"category_scores_gemma":[0.00004825349,0.0005429496,0.00027181467,0.0012861381,0.00009366636,0.00060358114,0.0006991762,0.00083705864,0.000172008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060682,0.00029281632,0.0076535763,0.00018229797,0.00075558596,0.00081750687,0.007843798,0.091479145,0.0024964798,0.036697466,0.053187303,0.7979872],"study_design_scores_gemma":[0.00085499976,0.00012489223,0.0002958879,0.00019529992,0.00004660763,0.000022597158,0.00006403628,0.95686513,0.000018880828,0.0011070725,0.039750643,0.0006539523],"about_ca_topic_score_codex":0.000059227514,"about_ca_topic_score_gemma":0.000032931654,"teacher_disagreement_score":0.9811064,"about_ca_system_score_codex":0.00012797226,"about_ca_system_score_gemma":0.0002564662,"threshold_uncertainty_score":0.9997022},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1595512,0.001865565,0.83771586,0.0002212172,0.000106922205,0.00040687327,0.000036279456,0.000092317496,0.0000037348595],"genre_scores_gemma":[0.9260899,0.001589365,0.07123866,0.0007062871,0.000087341214,0.000063510015,0.0001877697,0.000023538028,0.000013620454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985549,0.000052645886,0.00035787097,0.0005972209,0.000112568654,0.00032478376],"domain_scores_gemma":[0.9993911,0.000097885124,0.0001052543,0.00016538575,0.00007666553,0.00016370545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020846177,0.00024268482,0.0003168951,0.00007319445,0.00037682816,0.00033037417,0.00017097629,0.00017198952,0.0000037998295],"category_scores_gemma":[0.000014732552,0.00023622453,0.000041085932,0.00017622153,0.00003497041,0.00038661962,0.00019813463,0.00030202695,5.8992715e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009567589,0.000014903094,0.0000516471,0.000039365274,0.000016365719,0.0000011418134,0.000690774,0.9902783,0.0000573207,0.00024515722,0.000037042308,0.008472328],"study_design_scores_gemma":[0.001314921,0.00014664837,0.00001387711,0.00008694507,0.000015922711,0.0000057261714,0.00039191783,0.99761486,0.0000034012612,0.00009503783,0.000023208288,0.0002875365],"about_ca_topic_score_codex":0.00003857843,"about_ca_topic_score_gemma":0.000039027123,"teacher_disagreement_score":0.7665387,"about_ca_system_score_codex":0.000033834942,"about_ca_system_score_gemma":0.000027455586,"threshold_uncertainty_score":0.96329564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20421992,0.000045548164,0.79298913,0.0005141466,0.00022816558,0.0001595151,0.000014907836,0.00047392305,0.0013547393],"genre_scores_gemma":[0.9959412,0.00006223948,0.0026175897,0.00028298542,0.00008809872,7.218736e-7,0.00003298645,0.00002060506,0.00095354044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983399,0.00011551942,0.00014630862,0.001012634,0.00011079224,0.00027482948],"domain_scores_gemma":[0.9984341,0.000076843775,0.00017460217,0.0009519704,0.000167113,0.00019536406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011254399,0.00028632255,0.00029612324,0.00017298636,0.00023847619,0.00015624883,0.0014847321,0.00016509557,0.0000103402745],"category_scores_gemma":[0.00003706136,0.00030219526,0.00015422274,0.0005625129,0.000079406556,0.00032931403,0.0014239936,0.00073309237,0.00008222176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008585659,0.00013835056,0.008480212,0.00012704256,0.00033222188,0.0011015696,0.0006582604,0.6158194,0.00034607702,0.37178865,0.00069756096,0.00042480024],"study_design_scores_gemma":[0.00047333533,0.000060499187,0.00029716277,0.00012454156,0.00008348326,0.000008645526,0.00006902128,0.9928972,0.00012817865,0.0045721414,0.0008018748,0.0004839233],"about_ca_topic_score_codex":0.00022425367,"about_ca_topic_score_gemma":0.00006630404,"teacher_disagreement_score":0.79172134,"about_ca_system_score_codex":0.00010340118,"about_ca_system_score_gemma":0.0002652943,"threshold_uncertainty_score":0.999943},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029659423,0.000117114585,0.9714296,0.02444785,0.00018112917,0.00025887517,0.000028404338,0.00021016326,0.00036092004],"genre_scores_gemma":[0.98158073,0.00009025472,0.012324782,0.005800768,0.00002472353,0.00004392265,0.0000067839296,0.000011384158,0.000116640236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.00009620171,0.00020645848,0.0002555542,0.000118554235,0.0001571076],"domain_scores_gemma":[0.99806255,0.0007799338,0.00005582154,0.000887025,0.00009734077,0.00011733014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014824313,0.00012216433,0.00012983376,0.00006642215,0.00075459754,0.00012115866,0.0009236716,0.00004442868,0.000005516382],"category_scores_gemma":[0.000006921753,0.00013088524,0.00006973877,0.000279317,0.000049600687,0.00020681543,0.000026569625,0.00024670968,0.000026532034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021077803,0.0013094877,0.000016660913,0.00014069451,0.0005117977,0.000002342907,0.025990171,0.68111557,0.009895973,0.034006756,0.0028692745,0.2439305],"study_design_scores_gemma":[0.00073470286,0.0001668638,0.000025636826,0.00003246852,0.00003231557,0.000003598574,0.0006308126,0.9954314,0.00065200153,0.00015846896,0.0019526669,0.00017906149],"about_ca_topic_score_codex":0.000042639662,"about_ca_topic_score_gemma":0.00008182202,"teacher_disagreement_score":0.9786148,"about_ca_system_score_codex":0.000031563894,"about_ca_system_score_gemma":0.000051199047,"threshold_uncertainty_score":0.58038306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009362269,0.00007921351,0.9871761,0.0012694685,0.0013316429,0.00032502727,0.00008064417,0.00033928256,0.00003631248],"genre_scores_gemma":[0.96691006,0.000079993886,0.0314546,0.001194882,0.00014132603,0.000029101924,0.00003181221,0.000025625704,0.00013258596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786454,0.00022245475,0.00040355205,0.00081118086,0.00029553092,0.00040275886],"domain_scores_gemma":[0.9983722,0.00037162594,0.000100121455,0.00086492073,0.000052045103,0.00023910972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036750385,0.00024797386,0.0002582895,0.0001624817,0.00017005007,0.00015369584,0.001172658,0.00010615687,0.000020533833],"category_scores_gemma":[0.000036170397,0.00025778922,0.00008576918,0.000580118,0.000054941378,0.0007823855,0.000018415156,0.00057641836,0.00019191869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002998868,0.0009018529,0.00027097508,0.00006595926,0.00012750053,0.00031129323,0.013617561,0.3390976,0.034675714,0.000031397984,0.0003771576,0.6102231],"study_design_scores_gemma":[0.0016788536,0.000063234686,0.00030868585,0.00005169702,0.000015869718,0.000002980315,0.00022467725,0.99583066,0.000729868,0.0000024288822,0.00081442157,0.00027665755],"about_ca_topic_score_codex":0.00043952785,"about_ca_topic_score_gemma":0.00072428334,"teacher_disagreement_score":0.9575478,"about_ca_system_score_codex":0.00005525913,"about_ca_system_score_gemma":0.000076826014,"threshold_uncertainty_score":0.9999874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009391054,0.00003876129,0.9145095,0.016965969,0.00010201495,0.000016880927,1.17226286e-7,0.0003344657,0.058641247],"genre_scores_gemma":[0.9882126,0.0000013412374,0.0029534546,0.008221183,0.00003616436,4.36993e-7,8.931332e-8,8.371077e-7,0.00057393464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977297,0.0000056768704,0.000030192034,0.00008845517,0.000052772066,0.000049911447],"domain_scores_gemma":[0.9998453,0.000008454311,0.0000047439275,0.00008923039,0.0000070396677,0.000045213314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000017826998,0.000021053425,0.000024987343,0.000005561564,0.000016901029,0.00003919516,0.00024074668,0.000006078032,0.000024842095],"category_scores_gemma":[0.000007746357,0.000017079516,0.000018617897,0.00006204554,0.000002600843,0.0000969596,0.00007547909,0.000026861671,0.00033576213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003448283,0.000022483839,0.0009697977,0.0000052704686,0.000012297889,0.000047893864,0.001006537,0.000060717997,0.015952973,0.74545604,0.08013311,0.15632944],"study_design_scores_gemma":[0.00039332418,0.00014528351,0.0010257269,0.000003966128,0.0000027160993,0.000013059934,0.000059882597,0.8606013,0.005313765,0.0020564941,0.13011287,0.0002716062],"about_ca_topic_score_codex":0.000010980113,"about_ca_topic_score_gemma":4.188119e-7,"teacher_disagreement_score":0.9788215,"about_ca_system_score_codex":0.0000017232884,"about_ca_system_score_gemma":0.000006139583,"threshold_uncertainty_score":0.4315655},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20504226,0.00041431532,0.79411596,0.00023151354,0.000050398743,0.000109918525,0.0000056537497,0.000027618125,0.0000023642456],"genre_scores_gemma":[0.9611931,0.000014200219,0.038614206,0.000034768655,0.000112022506,0.000023913975,0.0000020932946,0.0000046169116,0.0000010905421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991886,0.000041544456,0.0002773615,0.00010840384,0.00030942739,0.000074633004],"domain_scores_gemma":[0.99939364,0.00007012816,0.00009386446,0.00009762176,0.00024115744,0.000103607395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054459687,0.00005881767,0.000119647986,0.00010969324,0.00002986224,0.000035866855,0.00016456348,0.00002577287,5.214401e-7],"category_scores_gemma":[0.00012392316,0.00005762987,0.00002888083,0.00021432928,0.000005467658,0.00026610182,0.000031107225,0.00011520992,8.978922e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034601808,0.00005485093,0.00036795944,0.000031151085,0.00001947732,0.000002103131,0.00027591383,0.92515016,0.006555315,0.00079859,0.000032721582,0.06670832],"study_design_scores_gemma":[0.00020496595,0.000073029834,0.0032180615,0.00006935103,0.00001835706,0.000025899382,0.000036176407,0.99600273,0.00003747569,0.000078288154,0.00017395649,0.00006167711],"about_ca_topic_score_codex":0.0000130688495,"about_ca_topic_score_gemma":0.000001137541,"teacher_disagreement_score":0.75615084,"about_ca_system_score_codex":0.000055451885,"about_ca_system_score_gemma":0.00006518489,"threshold_uncertainty_score":0.2350078},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11086932,0.000025151836,0.8851578,0.0006795703,0.00046097054,0.0006860633,0.00030070942,0.00040495594,0.0014154387],"genre_scores_gemma":[0.9942628,0.000016715505,0.0026217878,0.00058105495,0.000098078664,0.000006808201,0.00021674135,0.000031429397,0.0021645413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760354,0.00013742203,0.0002375555,0.0013945774,0.00014750258,0.00047941046],"domain_scores_gemma":[0.9979869,0.00018847139,0.00028928625,0.0011314965,0.00013921015,0.00026464838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000300158,0.0004481367,0.0004719521,0.00017761278,0.00035077962,0.00026191695,0.0017493848,0.00023570904,0.000047267476],"category_scores_gemma":[0.0000315114,0.00045971945,0.00030255195,0.00036107606,0.000064682,0.00040808335,0.0011927717,0.00078281533,0.000029415834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035082691,0.0001770193,0.00018759022,0.0002305964,0.0003995058,0.00036575698,0.0004935521,0.9228277,0.0001215499,0.070632525,0.0037026706,0.00051068736],"study_design_scores_gemma":[0.0016194016,0.00026268538,0.00040765764,0.00018808033,0.00017912097,0.000008756408,0.00034645374,0.98063,0.0001404369,0.014807749,0.00057470147,0.00083499186],"about_ca_topic_score_codex":0.00077084056,"about_ca_topic_score_gemma":0.00035988548,"teacher_disagreement_score":0.8833935,"about_ca_system_score_codex":0.00036388534,"about_ca_system_score_gemma":0.00030144773,"threshold_uncertainty_score":0.9997855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023414375,0.00027239404,0.9718621,0.003453213,0.000110008266,0.00041638163,0.000054353826,0.0003444197,0.00007275547],"genre_scores_gemma":[0.9901732,0.00021820352,0.008121643,0.001079141,0.000018965915,0.00022942106,0.000023437708,0.000029902581,0.00010608467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986976,0.00014879204,0.00027121927,0.000405861,0.00018722336,0.0002893019],"domain_scores_gemma":[0.99765444,0.0003161364,0.000102648424,0.0016209689,0.00012272994,0.00018307143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010187064,0.00021434415,0.00021104027,0.00005551059,0.00079031463,0.00018880994,0.0019968427,0.00008856014,0.0000047200033],"category_scores_gemma":[0.0000025020306,0.00020573403,0.00013042585,0.00034718233,0.00007064317,0.00032304696,0.000018063074,0.0004667627,0.000015919743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030821483,0.0008070637,0.00002829483,0.000037428785,0.00041295303,0.0000050530066,0.0017039151,0.9063368,0.024484528,0.0025940852,0.0015116648,0.061769992],"study_design_scores_gemma":[0.00064505154,0.0003173411,0.000003857179,0.000041592044,0.000053550353,0.000008140704,0.000040747196,0.98830646,0.008376671,0.000022675,0.0018742325,0.0003096861],"about_ca_topic_score_codex":0.00013083954,"about_ca_topic_score_gemma":0.0001595666,"teacher_disagreement_score":0.96675885,"about_ca_system_score_codex":0.00005099458,"about_ca_system_score_gemma":0.0000577227,"threshold_uncertainty_score":0.83895904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87267196,0.00012858973,0.123122975,0.0018814306,0.0011687775,0.0004228704,0.0000037926231,0.00017854961,0.00042105425],"genre_scores_gemma":[0.9932158,0.000010844165,0.0054446943,0.0005654496,0.00016316773,0.00002650262,0.000014731944,0.000014823709,0.0005439835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986987,0.000068090514,0.00021159583,0.0004442714,0.00025937226,0.00031795708],"domain_scores_gemma":[0.99887633,0.00037125568,0.00011245138,0.0004488376,0.000108743865,0.00008237141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052949885,0.00015450029,0.00020675184,0.00016402203,0.00007782793,0.00016593038,0.00059965905,0.000099815574,0.000007558485],"category_scores_gemma":[0.000078812365,0.00015288216,0.0000643892,0.0001948929,0.000010155209,0.00033436366,0.00015668011,0.00016343915,0.00010796015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038659386,0.00037535353,0.011871509,0.0007027668,0.0001496309,0.00004954724,0.10476257,0.008479533,0.22302653,0.5638247,0.0012005387,0.08517073],"study_design_scores_gemma":[0.001494256,0.00007145115,0.0012100165,0.0002684888,0.000010311435,0.00000493473,0.001798502,0.9833978,0.007468272,0.0023232463,0.0016205191,0.00033220695],"about_ca_topic_score_codex":0.0003083656,"about_ca_topic_score_gemma":0.00072102575,"teacher_disagreement_score":0.97491825,"about_ca_system_score_codex":0.00006210877,"about_ca_system_score_gemma":0.000060648174,"threshold_uncertainty_score":0.6234354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004364359,0.00003050523,0.9920391,0.00081725226,0.000055444907,0.00012204473,7.577448e-8,0.00014187249,0.0024293482],"genre_scores_gemma":[0.99278307,7.7522986e-7,0.0045405733,0.0021281994,0.000019711002,0.000007701067,0.0000034455502,0.0000052706755,0.0005112496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926347,0.000026285334,0.00020111325,0.00021070114,0.00015168464,0.00014677698],"domain_scores_gemma":[0.9995631,0.00008621208,0.00008798157,0.00013099697,0.000060657036,0.000071035356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015915644,0.00008519508,0.00012790249,0.00003680224,0.000041024236,0.00007599691,0.00043992308,0.000027047388,0.000020109901],"category_scores_gemma":[0.00006559052,0.000074175565,0.00009677802,0.00009057118,0.000012068633,0.00024419563,0.000099370554,0.000116452255,0.000008166006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006491867,0.000022379025,0.00020721194,0.0000898301,0.000038871738,0.0000045619895,0.0028802592,0.9146953,0.0029290635,0.06273914,0.00074793637,0.015580475],"study_design_scores_gemma":[0.00038826076,0.00044761188,0.000008414835,0.000015365233,0.000005066008,6.3374137e-7,0.00011053886,0.9957876,0.0025898998,0.000087401844,0.00046949886,0.000089712245],"about_ca_topic_score_codex":0.00025820875,"about_ca_topic_score_gemma":0.0000043124764,"teacher_disagreement_score":0.9884187,"about_ca_system_score_codex":0.00002041205,"about_ca_system_score_gemma":0.000052000927,"threshold_uncertainty_score":0.30247918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014330054,0.0003082654,0.99299836,0.0037401763,0.00040984675,0.00017927063,0.0000032220885,0.00033023822,0.0005975867],"genre_scores_gemma":[0.8069265,0.00007003864,0.16145973,0.029152576,0.00071473664,0.00005439982,0.000010675451,0.000020068597,0.0015912645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991397,0.00002005034,0.00015513768,0.00032121342,0.00012771273,0.00023618863],"domain_scores_gemma":[0.9994099,0.00009015531,0.00003656083,0.00021312237,0.00009469413,0.00015553954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009797655,0.00010505583,0.00013855875,0.000021641994,0.000092041424,0.00013312142,0.0005348994,0.000042225412,0.0000097258135],"category_scores_gemma":[0.000018152325,0.00009076338,0.0001298363,0.00012793906,0.000014495328,0.00024297254,0.00017146258,0.00008893483,0.000040076895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014613539,0.000039794963,0.00008815621,0.0000064361425,0.000050490755,0.000018124432,0.00018555165,0.00078238396,0.0009130345,0.015288478,0.037217643,0.9453953],"study_design_scores_gemma":[0.0004507808,0.00012955275,0.00007059133,0.000004803089,0.0000058659793,0.0000040607224,0.000040184084,0.992772,0.00021765826,0.00009127257,0.0060725277,0.0001407351],"about_ca_topic_score_codex":0.00005525092,"about_ca_topic_score_gemma":0.0000027427595,"teacher_disagreement_score":0.9919896,"about_ca_system_score_codex":0.000014608737,"about_ca_system_score_gemma":0.000023864983,"threshold_uncertainty_score":0.37012234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50887924,0.0002024301,0.48944652,0.0003738913,0.0003879174,0.00023399679,0.000019643701,0.00017852383,0.0002778417],"genre_scores_gemma":[0.98630595,0.00001909017,0.013150863,0.0003398794,0.000036209167,0.000013022038,0.00011203295,0.0000092100645,0.000013724825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984163,0.00009625858,0.00061734265,0.00022315395,0.0004079972,0.0002389448],"domain_scores_gemma":[0.9988015,0.00013273164,0.00044602453,0.0002249283,0.0002690277,0.00012577447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042255293,0.00019006821,0.00029641052,0.00015271635,0.00025905026,0.0003175879,0.0003024681,0.00009876494,0.000008314496],"category_scores_gemma":[0.0002070829,0.00019185404,0.000071347444,0.00032029612,0.000084669125,0.002875376,0.0001493997,0.000149439,0.000017423981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016749067,0.00022117281,0.012529774,0.00081806927,0.00035598516,0.000045052817,0.057005607,0.0026477103,0.02582818,0.037189685,0.0038648322,0.8593264],"study_design_scores_gemma":[0.0012791189,0.00027476088,0.007142903,0.00027686884,0.00003714531,0.000028937042,0.00062641443,0.9820134,0.003491953,0.0040152934,0.00043550428,0.00037770384],"about_ca_topic_score_codex":0.00051280257,"about_ca_topic_score_gemma":0.0000074220366,"teacher_disagreement_score":0.9793657,"about_ca_system_score_codex":0.000100759,"about_ca_system_score_gemma":0.00010376063,"threshold_uncertainty_score":0.7823581},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001219993,0.0005043236,0.9940574,0.0028594513,0.00012229002,0.0005678917,5.80938e-7,0.000052351304,0.0006156866],"genre_scores_gemma":[0.98396283,0.00006575089,0.013030726,0.0024767264,0.00014741653,0.000041842435,0.0000048403763,0.0000067298374,0.00026314185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.00017581056,0.00019168237,0.00020844564,0.00012979354,0.00015712551],"domain_scores_gemma":[0.99927795,0.00026745885,0.00012126274,0.00019388655,0.000095653486,0.000043792108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043253493,0.00008971192,0.00015173802,0.0000063634848,0.00028473712,0.00012317719,0.00043503114,0.00003999761,0.000002064195],"category_scores_gemma":[0.00008617796,0.000048070695,0.00009340165,0.00019015725,0.00008108421,0.00013427896,0.00024311827,0.0001553893,2.2223229e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049983195,0.0000065967074,0.000495894,0.000005757668,0.000023736598,8.5639776e-8,0.0003090353,0.9772501,0.000013633222,0.017837834,0.0010109192,0.0029964207],"study_design_scores_gemma":[0.0008197044,0.000033783308,0.00012708313,0.000007881015,0.000021024938,0.0000019554268,0.00014486494,0.99849254,0.000012931577,0.000026344876,0.00024610118,0.00006577547],"about_ca_topic_score_codex":0.0000632055,"about_ca_topic_score_gemma":0.0000036029662,"teacher_disagreement_score":0.98274285,"about_ca_system_score_codex":0.000010058342,"about_ca_system_score_gemma":0.000023600589,"threshold_uncertainty_score":0.21899964},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18201147,0.00066758634,0.7969257,0.01747977,0.00043156624,0.0010883537,0.000006603116,0.00038373267,0.0010052042],"genre_scores_gemma":[0.98902947,0.00014309972,0.007858431,0.00261356,0.0001032866,0.00009843404,0.000048770882,0.000027398497,0.00007756154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973097,0.0007981857,0.00073965965,0.00036834783,0.00037106057,0.00041307966],"domain_scores_gemma":[0.9965133,0.000747554,0.0004168426,0.0006514833,0.0013420915,0.00032869677],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004799189,0.00025812702,0.0003415971,0.0003246222,0.0014977303,0.00067839865,0.0017273374,0.00009782991,0.0000068228233],"category_scores_gemma":[0.0005490872,0.00025903407,0.00012452804,0.0021661685,0.000029925934,0.00040745465,0.00022801377,0.0010804,0.00003674232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000897064,0.0013149746,0.0048635527,0.00008230812,0.0010989187,0.0001241618,0.012072304,0.82805437,0.08945315,0.003786158,0.0042878315,0.053965215],"study_design_scores_gemma":[0.001462997,0.00066431914,0.0016374912,0.00025178766,0.000039481725,0.00009359779,0.00026444445,0.98830634,0.0009394265,0.00006208,0.005865464,0.0004125592],"about_ca_topic_score_codex":0.000040117986,"about_ca_topic_score_gemma":0.00028114676,"teacher_disagreement_score":0.807018,"about_ca_system_score_codex":0.0003661149,"about_ca_system_score_gemma":0.00033372926,"threshold_uncertainty_score":0.9999862},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03370282,0.000041741285,0.959881,0.0052184896,0.00003231713,0.00048156225,0.00007687069,0.00006182001,0.0005033984],"genre_scores_gemma":[0.981524,0.00000550376,0.017027896,0.00112301,0.0000273525,0.000027714477,0.0000040927935,0.0000039290685,0.00025652797],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930626,0.000024782637,0.00011700194,0.00027238918,0.00013068302,0.00014890918],"domain_scores_gemma":[0.9993648,0.00007144467,0.000021467278,0.00043657963,0.00004623057,0.00005945693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000394747,0.000058358568,0.00008792999,0.000023541961,0.0000912347,0.000091221234,0.0008616491,0.00002223251,0.0000028861746],"category_scores_gemma":[0.000053467338,0.00003848421,0.000018228528,0.0001336949,0.000018567885,0.00038333458,0.0013618275,0.00007321441,0.0000021253338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031166556,0.00030520937,0.011681799,0.0004515649,0.00018912081,0.000012847234,0.02317645,0.000046778314,0.38611558,0.31625044,0.026342427,0.23511612],"study_design_scores_gemma":[0.0019922678,0.0017796683,0.001935352,0.00014429582,0.000036115114,0.000019784096,0.0049151084,0.88291645,0.068193875,0.0036693735,0.033647273,0.0007504434],"about_ca_topic_score_codex":0.0001534292,"about_ca_topic_score_gemma":0.000047769183,"teacher_disagreement_score":0.94782114,"about_ca_system_score_codex":0.0000046787186,"about_ca_system_score_gemma":0.00003411804,"threshold_uncertainty_score":0.16974205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55676323,0.074127115,0.27209246,0.09218262,0.00034913383,0.0015198311,0.00008902123,0.00092793925,0.0019486315],"genre_scores_gemma":[0.9894608,0.007485741,0.0024579866,0.00037394077,0.00003848285,0.00015696534,0.000005720215,0.00000820133,0.000012126031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924684,0.00010093011,0.00015171393,0.00025780496,0.0000735362,0.00016916051],"domain_scores_gemma":[0.9984177,0.00033405563,0.000057754347,0.0009943049,0.00006780682,0.0001283877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769667,0.00010056321,0.00014263416,0.000036766578,0.00054875464,0.00010130514,0.0010215382,0.000046439523,3.2192557e-7],"category_scores_gemma":[0.000037102705,0.00010568147,0.00004234505,0.00008365084,0.000119651275,0.0002931135,0.00071965554,0.00018557288,0.000003101258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018725854,0.0004372678,0.00033521664,0.00021957581,0.00012718845,0.0000020356601,0.057017036,0.00015643735,0.008468683,0.6112166,0.0017614332,0.32023978],"study_design_scores_gemma":[0.0008796356,0.00021813388,0.0010854627,0.00006940499,0.000040741215,0.000023696923,0.0012535516,0.94788325,0.00021479515,0.007524036,0.040364638,0.0004426631],"about_ca_topic_score_codex":0.00003215202,"about_ca_topic_score_gemma":0.000047624904,"teacher_disagreement_score":0.9477268,"about_ca_system_score_codex":0.000013360789,"about_ca_system_score_gemma":0.000034567813,"threshold_uncertainty_score":0.43095654},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97445816,0.00011956699,0.012254147,0.012183553,0.00008933068,0.00038302533,0.0000031335549,0.000039890958,0.0004692034],"genre_scores_gemma":[0.99859947,0.0000162738,0.000104430255,0.0011672168,0.000047018944,0.000025728552,2.3586625e-7,0.000005995002,0.00003364725],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990974,0.000004763862,0.00023113746,0.00023701263,0.00031058365,0.00011909849],"domain_scores_gemma":[0.9994315,0.000036426925,0.00020019132,0.00012489936,0.00016493718,0.00004207488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022166896,0.000100487385,0.00013525572,0.000022330774,0.00009750105,0.00014836721,0.0007670247,0.000020203346,3.38761e-7],"category_scores_gemma":[0.000074693504,0.000056914454,0.000056915997,0.00018013308,0.00006297801,0.00035211229,0.00033743714,0.00010640233,0.0000017772832],"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.00017399919,0.00030488637,0.10773841,0.0009264865,0.00024160279,0.0000010748975,0.01285098,0.00018240097,0.37273175,0.055236623,0.0060222694,0.44358954],"study_design_scores_gemma":[0.0021915848,0.00074283255,0.06497805,0.0010442957,0.00012045278,0.000035447174,0.0016094237,0.14690992,0.77268726,0.004718999,0.004018686,0.0009430341],"about_ca_topic_score_codex":0.00004757048,"about_ca_topic_score_gemma":0.000002121728,"teacher_disagreement_score":0.4426465,"about_ca_system_score_codex":0.00002005872,"about_ca_system_score_gemma":0.000021520742,"threshold_uncertainty_score":0.2320904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06678397,0.00013741237,0.9313473,0.00016636688,0.00061782444,0.0006620416,0.00011830807,0.00011940733,0.00004733475],"genre_scores_gemma":[0.9966613,0.000026594296,0.0024043936,0.00015370059,0.000028025906,0.00035694678,0.00008159106,0.000022234466,0.0002651841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978347,0.00018414759,0.0006717687,0.00062768965,0.00037500486,0.00030669372],"domain_scores_gemma":[0.99882025,0.00043226784,0.00012383702,0.00038398302,0.00012415816,0.00011551994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031460487,0.00025390447,0.000325199,0.00022513505,0.00020964262,0.000118249234,0.00023864827,0.00011998584,0.000020448877],"category_scores_gemma":[0.0000073717215,0.0002707175,0.00021078724,0.00029375462,0.000044659126,0.00020882844,4.2416315e-7,0.00026898316,0.000017830702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055528177,0.00026652016,0.000019496585,0.000062171304,0.00005739147,0.00003900019,0.0020009195,0.95809036,0.029044636,0.00029928444,0.000007643783,0.010057065],"study_design_scores_gemma":[0.0013987123,0.00016604378,0.00008217823,0.00036116457,0.000043159034,0.0000052621876,0.0019767394,0.72016466,0.27455264,0.000008878882,0.0008506061,0.00038992197],"about_ca_topic_score_codex":0.0001665837,"about_ca_topic_score_gemma":0.00025230797,"teacher_disagreement_score":0.92987734,"about_ca_system_score_codex":0.00018550095,"about_ca_system_score_gemma":0.0001483318,"threshold_uncertainty_score":0.9999745},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9526549,0.00045920274,0.041244846,0.0008703982,0.00015307796,0.000064308784,0.000006974081,0.00013223778,0.00441406],"genre_scores_gemma":[0.9977522,0.00021257885,0.00045721733,0.00019148191,0.000054104356,0.0000019129322,0.0000016245901,0.0000025328825,0.0013263411],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941,0.00004704167,0.00017664427,0.00016693905,0.00011211608,0.00008726346],"domain_scores_gemma":[0.99951434,0.000042001804,0.00009191146,0.00023416003,0.000073708594,0.000043849028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019941617,0.00006582518,0.00011566833,0.000047476275,0.000065260654,0.00004992647,0.00008766125,0.000025021147,0.00000617926],"category_scores_gemma":[0.00003611989,0.000062320345,0.0000362009,0.00015118737,0.000032863416,0.00019878663,0.00003941712,0.000071211376,0.000008451568],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013861433,0.00047069948,0.14654589,0.00042449354,0.00007246516,0.000015404441,0.00094238645,0.000040004372,0.013242122,0.12174693,0.016093059,0.700268],"study_design_scores_gemma":[0.0022916324,0.000095694406,0.38432926,0.0007343556,0.000053745713,0.000035268593,0.000040092014,0.09069581,0.00716756,0.0022536227,0.51127326,0.0010296638],"about_ca_topic_score_codex":0.00004180975,"about_ca_topic_score_gemma":0.00011326383,"teacher_disagreement_score":0.6992383,"about_ca_system_score_codex":0.000022158341,"about_ca_system_score_gemma":0.00001845977,"threshold_uncertainty_score":0.254135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41872823,0.004018645,0.5743746,0.00054388924,0.0020326234,0.00019416271,7.8668756e-7,0.000031770916,0.00007528064],"genre_scores_gemma":[0.9862024,0.0013005938,0.011349616,0.0005490397,0.00016507071,0.0000085372785,0.000006719958,0.000026358224,0.0003916637],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630004,0.00037777776,0.0013901016,0.00071301614,0.000725146,0.00049394113],"domain_scores_gemma":[0.99783236,0.00010884475,0.0009506644,0.00051272893,0.00030471568,0.0002906979],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016626992,0.00044284307,0.00086169224,0.00047160537,0.00007187342,0.00080498925,0.0011609892,0.00035050072,0.00003512468],"category_scores_gemma":[0.00005663095,0.00040239724,0.00043425206,0.00016734745,0.000066015746,0.00049543224,0.0010893182,0.0024909219,0.000001587332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002895194,0.004825296,0.009269061,0.003839894,0.004008991,0.011375637,0.0765519,0.2513192,0.40517563,0.0015508976,0.02047268,0.2087156],"study_design_scores_gemma":[0.0021139504,0.00018457821,0.00018226363,0.004755568,0.000051227707,0.00045537003,0.00027741207,0.97783947,0.013273037,0.000277589,0.00012626115,0.0004632695],"about_ca_topic_score_codex":0.0004069591,"about_ca_topic_score_gemma":0.000009314134,"teacher_disagreement_score":0.72652024,"about_ca_system_score_codex":0.00030177558,"about_ca_system_score_gemma":0.00019309498,"threshold_uncertainty_score":0.99984276},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21743597,0.00018173442,0.78021866,0.0010489003,0.0002904224,0.00038952546,0.0000042127613,0.00026438932,0.00016618855],"genre_scores_gemma":[0.9956802,0.000011966204,0.0013329578,0.0024257835,0.0001921992,0.000020094087,0.000006251351,0.000009653909,0.00032090058],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987733,0.000082056875,0.00025048773,0.0004339567,0.00016982837,0.0002903916],"domain_scores_gemma":[0.9988939,0.00052510505,0.00011520375,0.00018941896,0.00013728657,0.00013905468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049941766,0.00013546285,0.00020898785,0.0000251742,0.0002355226,0.00027379527,0.00027493504,0.00007678663,0.0000024062813],"category_scores_gemma":[0.00012676227,0.00012479209,0.00009737105,0.00012192565,0.000012377276,0.00029171398,0.00012871587,0.00018483317,0.000004438142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004019416,0.0009964042,0.2885839,0.00066332024,0.0009778326,0.00007091253,0.020869404,0.26725042,0.025520232,0.046951886,0.065943114,0.28177062],"study_design_scores_gemma":[0.00076227885,0.00015018435,0.0017704966,0.000019998028,0.000014667374,0.0000036989948,0.00028883063,0.995137,0.00023795945,0.00003579302,0.0013808331,0.00019829025],"about_ca_topic_score_codex":0.0001314406,"about_ca_topic_score_gemma":0.000018434446,"teacher_disagreement_score":0.7788857,"about_ca_system_score_codex":0.00007747979,"about_ca_system_score_gemma":0.000021386102,"threshold_uncertainty_score":0.50888735},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008817919,0.002898901,0.8161862,0.0024472424,0.016976798,0.0005896676,0.000057082987,0.0013493395,0.15067683],"genre_scores_gemma":[0.46185446,0.00057535403,0.26515844,0.010065618,0.012679021,0.00003257678,0.00016005697,0.00030384964,0.2491706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962608,0.000019244366,0.00048424254,0.0015472342,0.0011114,0.0005770474],"domain_scores_gemma":[0.99815106,0.00016768291,0.00019492602,0.001100495,0.00022817112,0.00015764481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007439622,0.00037414097,0.000479206,0.000624071,0.00030654835,0.000713177,0.004484404,0.00019336856,0.00004884315],"category_scores_gemma":[0.000036448466,0.0003916013,0.0001725012,0.00043145902,0.00040484124,0.000665586,0.0037296915,0.00075895234,0.00008189867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020377156,0.00008278374,0.000026108188,0.000023990937,0.000012743066,0.0005204179,0.001450627,0.00020309108,0.000072762465,0.48563814,0.0009377153,0.5110296],"study_design_scores_gemma":[0.0012713327,0.00013925161,0.003306873,0.0017907305,0.000031273234,0.000349212,0.000018185321,0.8309084,0.00009400791,0.13517459,0.023833267,0.00308289],"about_ca_topic_score_codex":0.000016633754,"about_ca_topic_score_gemma":0.00013087336,"teacher_disagreement_score":0.8307053,"about_ca_system_score_codex":0.0002577908,"about_ca_system_score_gemma":0.00049887574,"threshold_uncertainty_score":0.9998536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020783272,0.00018246613,0.9739102,0.0014736725,0.00039236495,0.00014188282,4.054199e-7,0.00013190228,0.0029838318],"genre_scores_gemma":[0.98764014,0.000013412061,0.006193397,0.005986977,0.00012327358,0.0000032809128,0.0000050541476,0.0000022730617,0.00003218743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991884,0.000036242192,0.00021264968,0.00014109127,0.00017417806,0.00024740986],"domain_scores_gemma":[0.99969316,0.000027046553,0.00004519937,0.00013169079,0.00002550941,0.00007742725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119207405,0.00008121928,0.00008580508,0.000053658456,0.00007543782,0.00013393216,0.00035301698,0.000028032553,0.000015278147],"category_scores_gemma":[0.0000058281535,0.00007769548,0.000040937615,0.0005795594,0.000010547508,0.0007246111,0.00026036485,0.00012588526,0.000031533276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072156163,0.000009100387,0.003911636,0.0000052931305,0.0000120919485,0.00001436955,0.00010336195,0.9442546,0.00000116246,0.036426306,0.003306366,0.011948535],"study_design_scores_gemma":[0.00031014127,0.000010451876,0.003934853,0.000006018079,0.0000032827868,0.000004693136,0.000028349285,0.994021,3.3084717e-7,0.00009448948,0.00149178,0.00009459147],"about_ca_topic_score_codex":0.00007284968,"about_ca_topic_score_gemma":0.000004203523,"teacher_disagreement_score":0.9677168,"about_ca_system_score_codex":0.000046924593,"about_ca_system_score_gemma":0.000017413018,"threshold_uncertainty_score":0.31683296},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010581166,0.000009309979,0.9859169,0.00045362374,0.0006804487,0.00053792563,0.00005435051,0.00023531944,0.0015309606],"genre_scores_gemma":[0.99592775,0.000004325342,0.0009944877,0.0018173248,0.000015961516,0.000444926,0.000017651988,0.000010249421,0.00076733995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987541,0.00015509389,0.00033777807,0.00016701833,0.00034299138,0.00024301244],"domain_scores_gemma":[0.9990222,0.00034259743,0.00014777061,0.00034897806,0.000067202076,0.00007124813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012133652,0.00016666284,0.0001605299,0.00029332246,0.0011022587,0.0001653324,0.00040569107,0.000034006403,0.000070085414],"category_scores_gemma":[0.0000036986005,0.00014488978,0.00012831802,0.0002700306,0.000028528064,0.0014745836,0.0000049523824,0.00029082887,0.000020707048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011707266,0.00007974837,2.984536e-7,0.000021002597,0.000084391926,8.196374e-7,0.0029441996,0.95448804,0.00010985218,0.013754016,0.00016459051,0.027182344],"study_design_scores_gemma":[0.015369653,0.0014932556,0.000019027502,0.00005228737,0.00013351542,0.00010835459,0.008506462,0.95391244,0.009177515,0.0064459154,0.0039726077,0.0008089889],"about_ca_topic_score_codex":0.000020656546,"about_ca_topic_score_gemma":0.000011545846,"teacher_disagreement_score":0.98534656,"about_ca_system_score_codex":0.00019340224,"about_ca_system_score_gemma":0.000100507306,"threshold_uncertainty_score":0.8477794},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13739054,0.00016917552,0.8619817,0.000053061467,0.00013313713,0.00016634479,0.000023560371,0.000054388864,0.000028092429],"genre_scores_gemma":[0.9724418,0.000042043477,0.027303848,0.000069694404,0.0000073674046,0.00004555297,0.000004021974,0.000008914579,0.0000767855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873567,0.00018455971,0.0002166808,0.00045752552,0.00022635548,0.0001792408],"domain_scores_gemma":[0.9986818,0.0006548292,0.00007569989,0.00036094282,0.00011312391,0.00011361418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021783818,0.00015576174,0.00029546674,0.00035547308,0.00016218919,0.00007545299,0.0001481467,0.00007129634,0.000018126624],"category_scores_gemma":[0.0000120233635,0.00015469588,0.00012280476,0.00068603794,0.00006935609,0.00024099198,0.0000037696682,0.0002024054,0.0000022769418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008300107,0.00058249437,0.00027306916,0.000037216956,0.0014399642,0.00004226461,0.0037089589,0.49691296,0.065653875,0.000018432633,0.000009065475,0.4312387],"study_design_scores_gemma":[0.0005018434,0.000109672765,0.00080710964,0.00002593647,0.00044771735,0.0000053964695,0.00014299728,0.92639947,0.07138515,0.000010256449,0.000008973225,0.00015548721],"about_ca_topic_score_codex":0.0002176858,"about_ca_topic_score_gemma":0.000086197695,"teacher_disagreement_score":0.83505124,"about_ca_system_score_codex":0.000038259284,"about_ca_system_score_gemma":0.0000949866,"threshold_uncertainty_score":0.6308315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020650752,0.0014218286,0.96622753,0.004207621,0.0009138409,0.0003844711,0.00014483977,0.00044668477,0.0056024073],"genre_scores_gemma":[0.93576765,0.00049703993,0.06135038,0.0011292179,0.000036293637,0.000087229084,0.00024236339,0.000014666938,0.00087513274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986116,0.00015732273,0.00026665014,0.0004407938,0.00026609265,0.00025753188],"domain_scores_gemma":[0.99035025,0.00018153216,0.00008885394,0.009167357,0.000121117395,0.00009091808],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0002444189,0.00013628,0.00017126837,0.00006478184,0.00031966198,0.00024478624,0.005741483,0.000046426314,0.000014465741],"category_scores_gemma":[0.000011642237,0.00014747954,0.000084898915,0.00048046673,0.00007111161,0.00034521928,0.0020317305,0.00020919279,0.00007897752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076600365,0.010039235,0.0016414815,0.0002521776,0.0012284234,0.0002329613,0.0020218003,0.019760896,0.13026404,0.5070878,0.054811485,0.27258307],"study_design_scores_gemma":[0.0014628291,0.00001591247,0.0004192971,0.00009826064,0.00005189496,0.000019470814,0.00013081066,0.900813,0.0014523081,0.00018471616,0.095012896,0.00033861617],"about_ca_topic_score_codex":0.000112435824,"about_ca_topic_score_gemma":0.00012436113,"teacher_disagreement_score":0.9151169,"about_ca_system_score_codex":0.000056626042,"about_ca_system_score_gemma":0.00012786881,"threshold_uncertainty_score":0.9996379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97693557,0.00046698767,0.016700346,0.0036396282,0.0010945797,0.00020894739,0.000004273854,0.0002582062,0.00069148664],"genre_scores_gemma":[0.99653906,0.00008931686,0.0027257039,0.00014353615,0.00006335042,0.000018660692,0.0000032898743,0.000010431144,0.00040663613],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985198,0.000030946365,0.00038909397,0.0004678046,0.00022171874,0.00037066918],"domain_scores_gemma":[0.9983228,0.000038034108,0.00045074866,0.0010086788,0.00011855891,0.00006121664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000549464,0.00018726784,0.00035450404,0.0003728187,0.00034252653,0.00022243932,0.0013327309,0.00027966002,0.000002469149],"category_scores_gemma":[0.00030370403,0.0001888404,0.00008173733,0.00020293564,0.00019186383,0.0009783378,0.0005445829,0.00042724874,0.000015034904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013437873,0.0007888147,0.51658136,0.00007791604,0.0005025558,0.00062235055,0.00047514326,0.027510662,0.050865013,0.08934764,0.0034321118,0.30966204],"study_design_scores_gemma":[0.012916195,0.0006855994,0.0569686,0.0010891584,0.00014465692,0.00036488497,0.00013160096,0.86258155,0.031581085,0.007219141,0.024118708,0.0021987963],"about_ca_topic_score_codex":0.0008522534,"about_ca_topic_score_gemma":0.0009419569,"teacher_disagreement_score":0.8350709,"about_ca_system_score_codex":0.00013497919,"about_ca_system_score_gemma":0.000046023415,"threshold_uncertainty_score":0.77006876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7521376,0.008743623,0.23800448,0.0004801805,0.00006236791,0.00023023362,0.000002794453,0.000096699194,0.00024203867],"genre_scores_gemma":[0.9942812,0.0011607824,0.0039740335,0.00047386115,0.000016670747,0.000035837278,0.0000224174,0.000010109182,0.000025136336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859446,0.00039304778,0.00030963426,0.00036461448,0.00010181208,0.00023643358],"domain_scores_gemma":[0.99818474,0.00054523326,0.000086646134,0.00094670587,0.00015093113,0.00008574933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035639972,0.00015252978,0.00022669989,0.000076290155,0.00043079242,0.00029641687,0.00056356,0.00006700911,0.0000011959164],"category_scores_gemma":[0.000012302089,0.00015925859,0.000035377932,0.00032465596,0.000108613516,0.00017639968,0.0011526502,0.00032630263,8.8698914e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022912945,0.0006842802,0.010917762,0.00006200553,0.00010398576,0.000058302896,0.0030653777,0.29882562,0.00330891,0.021374116,0.00017457528,0.66140217],"study_design_scores_gemma":[0.00065130246,0.000054641638,0.0012775083,0.0001320084,0.0000076166993,0.000023223467,0.0005196339,0.9967206,0.00010745574,0.000029462193,0.00029606753,0.00018043874],"about_ca_topic_score_codex":0.00026998672,"about_ca_topic_score_gemma":0.00043344768,"teacher_disagreement_score":0.697895,"about_ca_system_score_codex":0.00004512898,"about_ca_system_score_gemma":0.0001121627,"threshold_uncertainty_score":0.6494377},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26461923,0.0006261328,0.7288855,0.0015870869,0.0004285304,0.00050326576,0.0000019927922,0.00038054734,0.0029677183],"genre_scores_gemma":[0.99752474,0.00001819542,0.00039814357,0.0016487342,0.00006274059,0.00005193608,0.0000029028065,0.000006399697,0.0002862322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863803,0.000076416654,0.00025878195,0.00048975187,0.00021995614,0.00031703754],"domain_scores_gemma":[0.99931234,0.0000675039,0.00003778336,0.00039316912,0.000038956634,0.00015022878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768711,0.00013877514,0.00016989977,0.000047117366,0.0000653209,0.00009239205,0.000622283,0.000056761615,0.000066530745],"category_scores_gemma":[0.000015297286,0.00012010231,0.00007580066,0.00041232587,0.00002084192,0.0001117124,0.00038613693,0.00023368806,0.00008465573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028699094,0.00039174562,0.0033627935,0.000023087332,0.000016095713,0.0000637725,0.0020211833,0.965859,0.00028181507,0.0032190683,0.0052431435,0.01948958],"study_design_scores_gemma":[0.00034734167,0.0001239878,0.000558535,0.000012255575,0.0000023251055,0.0000021243623,0.00021389178,0.9970029,0.00008704552,0.000018399644,0.0014711685,0.00016003316],"about_ca_topic_score_codex":0.00012764755,"about_ca_topic_score_gemma":0.000031486215,"teacher_disagreement_score":0.73290545,"about_ca_system_score_codex":0.00006946635,"about_ca_system_score_gemma":0.00004782573,"threshold_uncertainty_score":0.48976302},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42502078,0.27838138,0.29394624,0.00051442167,0.0011484866,0.0001861032,0.000005405465,0.00017027282,0.00062692945],"genre_scores_gemma":[0.94588,0.053369794,0.00043376387,0.00008554321,0.000053581956,0.00004054787,0.000017827782,0.00001003943,0.00010891727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979201,0.00042977708,0.00028450898,0.00085679296,0.00016712745,0.00034167236],"domain_scores_gemma":[0.9989295,0.000256077,0.00008059913,0.0005640266,0.00006899085,0.000100810175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145549,0.00023847802,0.00034692674,0.00016547284,0.00012756452,0.0003579409,0.00039987246,0.00020444854,0.0000030001095],"category_scores_gemma":[0.0000228776,0.00022961966,0.0000567867,0.00012684855,0.000041785817,0.00010242379,0.0022766264,0.0003821893,3.9460593e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001745907,0.00051713985,0.007876964,0.00033248405,0.00013974038,0.00020728602,0.0042196736,0.38793468,0.000057625944,0.02067063,0.000310452,0.5777159],"study_design_scores_gemma":[0.00019482669,0.000028779676,0.019289557,0.00022250487,0.0000066143207,0.0000234184,0.00016712522,0.9793365,0.0000036142774,0.00018172969,0.00020549301,0.00033984508],"about_ca_topic_score_codex":0.0052639553,"about_ca_topic_score_gemma":0.0070632487,"teacher_disagreement_score":0.5914018,"about_ca_system_score_codex":0.000049730366,"about_ca_system_score_gemma":0.0000788268,"threshold_uncertainty_score":0.9363618},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46458,0.00008551238,0.53464067,0.0003200779,0.000081733204,0.00012242633,0.000005160159,0.00014998176,0.000014442737],"genre_scores_gemma":[0.99826115,0.000012978296,0.0013693387,0.00008077169,0.000004063014,0.00019982795,0.0000034161326,0.000009656461,0.000058778547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984797,0.00015454051,0.0003704116,0.00046874463,0.00023582866,0.00029072943],"domain_scores_gemma":[0.9990431,0.00008314089,0.00009313582,0.0006814331,0.00006723363,0.000031942764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003586536,0.00014863869,0.00036774745,0.0014716221,0.00028251964,0.000028963463,0.0007505305,0.00012306648,0.000029222761],"category_scores_gemma":[0.000008970742,0.00015771075,0.00019173238,0.004057988,0.00007319976,0.000110814966,0.000019807745,0.00066950155,0.0000017186027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011500132,0.000219686,0.00009436774,0.0000050505732,0.00020565983,0.000028779259,0.000109759436,0.9792218,0.009420581,0.0016503575,0.0000035327396,0.009028925],"study_design_scores_gemma":[0.00030647282,0.00018564351,0.000054451062,0.00000975594,0.00014357457,0.000020546458,0.00024366769,0.997168,0.0015896778,0.00010817407,0.000018131015,0.00015189519],"about_ca_topic_score_codex":0.0002759574,"about_ca_topic_score_gemma":0.00032511252,"teacher_disagreement_score":0.53368115,"about_ca_system_score_codex":0.00015706837,"about_ca_system_score_gemma":0.00005472609,"threshold_uncertainty_score":0.6431258},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033929896,0.00027640237,0.7839427,0.0035102013,0.00041722812,0.000010421969,1.2535877e-7,0.00022460625,0.1776884],"genre_scores_gemma":[0.973987,0.000008194824,0.006339381,0.0017567629,0.000023796676,5.8355425e-7,2.9384802e-7,9.302347e-7,0.017883064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997507,0.0000100749585,0.00003114675,0.00009501214,0.000056735073,0.000056372497],"domain_scores_gemma":[0.999731,0.00001318536,0.000004077268,0.00020489896,0.00002589737,0.000020940175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030564966,0.000019764992,0.000025244928,0.000008594301,0.000023698321,0.00006286001,0.00014288587,0.000007663822,0.000053905213],"category_scores_gemma":[0.000008913899,0.0000170805,0.000022429871,0.00007880404,0.0000025162335,0.00008942464,0.00009135139,0.000024426494,0.00017939934],"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":[4.7311153e-7,0.000041683976,0.00071247946,0.0000026323705,0.000009574837,0.00013276956,0.000108049666,0.000017664861,0.019909507,0.81036675,0.021467548,0.14723085],"study_design_scores_gemma":[0.0016053827,0.00012665702,0.022979772,0.000075655014,0.000012656732,0.00057914894,0.0003477076,0.45680276,0.13984452,0.05253233,0.32385784,0.0012355761],"about_ca_topic_score_codex":0.000011765882,"about_ca_topic_score_gemma":0.000005836853,"teacher_disagreement_score":0.9400571,"about_ca_system_score_codex":0.0000035836633,"about_ca_system_score_gemma":0.000021503727,"threshold_uncertainty_score":0.23058754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10503543,0.00028668408,0.89036787,0.00014971753,0.003407703,0.00040536243,0.00003112459,0.0002985639,0.000017538365],"genre_scores_gemma":[0.99671125,0.00003437927,0.0026270887,0.00015424684,0.00024120137,0.000063742395,0.000040834337,0.000016620805,0.000110651155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981486,0.00011250685,0.00041012446,0.00062088826,0.00025884685,0.00044900517],"domain_scores_gemma":[0.9986663,0.00041898515,0.00011131692,0.0005139961,0.00015982185,0.00012961728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030614983,0.000221045,0.00026043633,0.00006157958,0.0005528133,0.0002646359,0.00037077,0.000111150905,0.000005771997],"category_scores_gemma":[0.0000095533005,0.00023099889,0.00033590186,0.00036966937,0.000035035006,0.000114141294,0.00001113474,0.00032529334,0.000014344235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005601083,0.0003403149,0.000022691169,0.000016972052,0.000057952748,0.00002080247,0.00011089065,0.7986159,0.0018593158,0.00045042278,0.000104705425,0.19834402],"study_design_scores_gemma":[0.0010596353,0.00015884792,0.000061739935,0.00010402274,0.000023413746,0.000029309336,0.00008407024,0.98925596,0.007815286,0.000015940295,0.0011329353,0.00025886306],"about_ca_topic_score_codex":0.000026243353,"about_ca_topic_score_gemma":0.000008542007,"teacher_disagreement_score":0.8916758,"about_ca_system_score_codex":0.00015141592,"about_ca_system_score_gemma":0.00009214785,"threshold_uncertainty_score":0.94198614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5288646,0.0012090113,0.46157023,0.004481997,0.00031791665,0.00024129405,0.000014370074,0.00009827841,0.0032022882],"genre_scores_gemma":[0.9987844,0.00029192833,0.0003189238,0.0001383979,0.0000136187855,0.0000525793,0.000009708517,0.000008604038,0.00038179834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998383,0.0005412965,0.00037425922,0.00026187664,0.00025700527,0.00018259825],"domain_scores_gemma":[0.9958953,0.00057753327,0.000175841,0.003045588,0.0002583589,0.000047346653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050322985,0.00012521044,0.0002336867,0.00007367628,0.00013048852,0.00013247719,0.0030361617,0.00005433948,0.0000016140407],"category_scores_gemma":[0.000018954106,0.00009522668,0.000058694608,0.000682398,0.00027034886,0.00023646867,0.00048268517,0.000375552,0.000008811294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003290594,0.00078886555,0.0047017047,0.00006445629,0.00013618055,0.00003401667,0.009240072,0.0069314945,0.008234967,0.90155494,0.0010535113,0.06722686],"study_design_scores_gemma":[0.0003462803,0.00011554724,0.0025417937,0.00050021044,0.000024939636,0.000092156624,0.003728049,0.98221934,0.00818522,0.000589149,0.001277058,0.0003802835],"about_ca_topic_score_codex":0.0016710842,"about_ca_topic_score_gemma":0.002099062,"teacher_disagreement_score":0.9752878,"about_ca_system_score_codex":0.00005880691,"about_ca_system_score_gemma":0.0001680805,"threshold_uncertainty_score":0.5641994},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013383121,0.00041105633,0.98266256,0.0021047334,0.0005017589,0.0005956362,9.391684e-7,0.00016825143,0.00017194978],"genre_scores_gemma":[0.9875302,0.00066973217,0.005313241,0.0053511956,0.00008116673,0.00028909132,0.000030333538,0.000022560012,0.0007125043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983089,0.000098153905,0.0003101981,0.00056400197,0.000300389,0.0004183693],"domain_scores_gemma":[0.9989135,0.000119730954,0.00010617364,0.00043699399,0.00029723073,0.00012633727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024230909,0.000269779,0.0002513778,0.000087077424,0.00057709374,0.0002678667,0.00024953924,0.000073495736,0.000008570488],"category_scores_gemma":[8.902691e-7,0.00024269376,0.0001367211,0.00039100347,0.000023312385,0.00020806692,0.000011591317,0.00021518276,0.000005606122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019278165,0.000117347176,0.000041969677,0.00008953512,0.0002337441,0.000034157452,0.000117547745,0.97767997,0.000052129704,0.0005618324,0.0001005555,0.02077846],"study_design_scores_gemma":[0.0018322737,0.0003400359,0.00022693223,0.00019441011,0.0001772735,0.000007726108,0.00037274495,0.9935326,0.00027443576,0.000011809932,0.0027182433,0.00031154268],"about_ca_topic_score_codex":0.00012854475,"about_ca_topic_score_gemma":0.0009265744,"teacher_disagreement_score":0.97734934,"about_ca_system_score_codex":0.00007718336,"about_ca_system_score_gemma":0.00003297837,"threshold_uncertainty_score":0.9896764},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023605457,0.000018524124,0.9642379,0.007833549,0.00012501238,0.0003372174,0.000046652185,0.00031972714,0.0034759173],"genre_scores_gemma":[0.97104794,0.0000012701382,0.020280365,0.0068767043,0.00008238089,0.000039201954,0.00004203255,0.000013706225,0.0016164145],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989075,0.000036140205,0.00017119938,0.00039876197,0.00020546565,0.00028094408],"domain_scores_gemma":[0.9993246,0.000101884114,0.00005887836,0.00030955026,0.00004723695,0.00015785727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019018726,0.00015475313,0.00017224227,0.000033012988,0.00019598141,0.00019279902,0.0005076811,0.000039878825,0.00010415651],"category_scores_gemma":[0.000024346,0.00011703321,0.00007868382,0.0001623136,0.000015599957,0.0003564049,0.00011708975,0.00014614868,0.00002363184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001847438,0.0012097578,0.0011369685,0.0006426567,0.0011167108,0.00025077225,0.013528478,0.23599449,0.020547623,0.314023,0.33722022,0.07248189],"study_design_scores_gemma":[0.0022318105,0.0007572154,0.00047153194,0.00003831594,0.000032180753,0.000015630994,0.0007159029,0.9870662,0.0025285608,0.0008349666,0.0047611073,0.0005465912],"about_ca_topic_score_codex":0.00028492557,"about_ca_topic_score_gemma":0.00017176234,"teacher_disagreement_score":0.9474425,"about_ca_system_score_codex":0.000048016867,"about_ca_system_score_gemma":0.00006365482,"threshold_uncertainty_score":0.4772476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71005225,0.0022145503,0.28670883,0.000022065884,0.00031827387,0.0001391925,2.7343998e-7,0.00011874416,0.00042581],"genre_scores_gemma":[0.9948573,0.00056389114,0.00413601,0.00011301676,0.00014585328,0.000022523642,0.000006904734,0.000012717134,0.00014176326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986523,0.00015387873,0.0003212713,0.00033500785,0.000183922,0.00035363613],"domain_scores_gemma":[0.99927574,0.00009039892,0.00009540016,0.00039084212,0.00009361555,0.00005399348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004809794,0.00014574868,0.0002445134,0.000077595556,0.00010048265,0.00007081101,0.0003840729,0.00011783033,0.000012590522],"category_scores_gemma":[0.000011385572,0.0001521777,0.00008130109,0.000537391,0.000030367817,0.00024870748,0.00032460137,0.0004474445,0.000001251555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015896867,0.000060358554,0.021196667,0.000016376705,0.000012921118,0.000027346396,0.00023120637,0.9325004,0.0012562214,0.00005603669,0.00010655763,0.044519965],"study_design_scores_gemma":[0.00022108726,0.00009984187,0.0006449042,0.00020179109,0.000006549256,0.000016765678,0.00007778884,0.9968347,0.0013131809,0.0000044035164,0.00041344546,0.00016557069],"about_ca_topic_score_codex":0.000057282556,"about_ca_topic_score_gemma":0.000020015332,"teacher_disagreement_score":0.28480506,"about_ca_system_score_codex":0.00007503711,"about_ca_system_score_gemma":0.00006940625,"threshold_uncertainty_score":0.6205626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7778218,0.00036141236,0.19686107,0.0057721348,0.0015344617,0.00063137646,0.000022560824,0.000392206,0.01660298],"genre_scores_gemma":[0.9849726,0.00001565665,0.008161713,0.0034925265,0.00020798617,0.00006602638,0.000018336761,0.000020304391,0.0030448511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713373,0.00020878199,0.00043843614,0.001251998,0.00051711936,0.0004499612],"domain_scores_gemma":[0.9981052,0.00014547199,0.0001265942,0.0013091355,0.00011241445,0.00020114362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045322257,0.0003676688,0.00049716677,0.0004001291,0.000060593018,0.0006507581,0.0019387866,0.00023445851,0.000083833154],"category_scores_gemma":[0.00013665715,0.00035910623,0.00024520382,0.00043191112,0.00003633155,0.00010990415,0.0037082245,0.0009799188,0.000055490003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035905532,0.0021128561,0.0077369926,0.00087435695,0.0014019478,0.014749284,0.06493277,0.1281529,0.013967698,0.16512118,0.046645656,0.5539453],"study_design_scores_gemma":[0.0051317653,0.0006757612,0.0137614645,0.0056642117,0.00009882319,0.00039682502,0.004369137,0.92071587,0.004529689,0.019785311,0.018526185,0.006344938],"about_ca_topic_score_codex":0.0016699393,"about_ca_topic_score_gemma":0.00070740277,"teacher_disagreement_score":0.79256296,"about_ca_system_score_codex":0.00021148265,"about_ca_system_score_gemma":0.00030647285,"threshold_uncertainty_score":0.9998861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63236403,0.005427987,0.36176124,0.00008184269,0.00028753243,0.000056753906,8.8410303e-7,0.000010604777,0.000009122169],"genre_scores_gemma":[0.97532195,0.00009798126,0.024189295,0.0001701115,0.00020553813,0.0000010212103,2.8703388e-7,0.0000059261706,0.00000790502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983047,0.00024447127,0.00051583466,0.00031774247,0.0003465851,0.00027065078],"domain_scores_gemma":[0.99843353,0.00030915995,0.0003113535,0.00025639328,0.0005138616,0.00017567677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019255102,0.00014923904,0.00034584635,0.00005064261,0.00026450228,0.00027229992,0.00018836366,0.00007480293,0.0000025947886],"category_scores_gemma":[0.0001685781,0.00013679394,0.00012845642,0.00016002622,0.000060116585,0.000671045,0.00030078748,0.00043182794,2.0180863e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040188202,0.0006709092,0.004350361,0.00031863968,0.00038064565,0.00041834897,0.00917067,0.75148034,0.01872385,0.0036195572,0.000037213096,0.21042758],"study_design_scores_gemma":[0.00060624006,0.000117134514,0.00040132442,0.000239405,0.00006841923,0.00048081833,0.00026276984,0.9911591,0.00009474676,0.0064097373,0.000007747812,0.00015260381],"about_ca_topic_score_codex":0.00016395179,"about_ca_topic_score_gemma":0.000035797548,"teacher_disagreement_score":0.3429579,"about_ca_system_score_codex":0.000064742766,"about_ca_system_score_gemma":0.00020972542,"threshold_uncertainty_score":0.5578295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32361615,0.000026226875,0.6723853,0.00063779764,0.000044324686,0.000116696225,4.3349777e-7,0.000087691886,0.0030854053],"genre_scores_gemma":[0.9776095,0.000008288172,0.021420343,0.00008612019,0.0000062198865,0.000028059716,0.0000039774186,0.0000021001224,0.0008353614],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995444,0.000029713789,0.00012313205,0.00013688521,0.00008544171,0.000080445985],"domain_scores_gemma":[0.9996641,0.000058952395,0.00003893639,0.00015160817,0.000073982104,0.000012387761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025592285,0.000038756865,0.00006454654,0.00005270542,0.000030508338,0.000017772398,0.0001223297,0.000021067619,0.0000059221516],"category_scores_gemma":[0.000026429605,0.0000364447,0.000026431188,0.00012779844,0.0000064511196,0.00009617992,0.000033160723,0.000052882046,0.0000010316749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009928332,0.00052621873,0.082929485,0.0002806847,0.000029527755,0.000006779738,0.001086331,0.014317491,0.655009,0.03229537,0.0016345435,0.21178533],"study_design_scores_gemma":[0.00015887097,0.000078682024,0.0018010401,0.000028784782,0.0000014409344,6.4110725e-7,0.00008727705,0.8929305,0.103909455,0.000013570129,0.0009406354,0.000049105813],"about_ca_topic_score_codex":0.000015265718,"about_ca_topic_score_gemma":0.0000123038035,"teacher_disagreement_score":0.878613,"about_ca_system_score_codex":0.000031309984,"about_ca_system_score_gemma":0.00005918965,"threshold_uncertainty_score":0.14861718},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042943493,0.0001992699,0.95457625,0.0007751415,0.0010979283,0.00014748162,0.0000049579294,0.00015012296,0.000105334526],"genre_scores_gemma":[0.9933813,0.000036414207,0.0061390116,0.00024494817,0.00006364006,0.000045354845,0.000006840205,0.0000066075017,0.00007586677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990952,0.000025422258,0.00018914008,0.0002603501,0.00022578434,0.00020411162],"domain_scores_gemma":[0.99910676,0.00025935416,0.0000711267,0.0003608682,0.00014473492,0.000057140624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594502,0.00011636456,0.000108492655,0.00013043357,0.00038994008,0.00034922213,0.00023591034,0.00005497637,0.0000021293201],"category_scores_gemma":[0.00001878577,0.00012296642,0.000092187955,0.0003615809,0.000018272534,0.00035376832,0.000008159397,0.00013009831,0.0000028348709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447859,0.00010637783,0.00012638757,0.000068181864,0.000041352832,0.000004718179,0.001135554,0.43698695,0.001479399,0.0009343537,0.0001619006,0.55891],"study_design_scores_gemma":[0.00043083535,0.000052666885,0.00015126361,0.00022011521,0.000022366256,0.00000962083,0.000092250084,0.9933421,0.003314342,0.00044043953,0.0017417289,0.00018228959],"about_ca_topic_score_codex":0.000013794925,"about_ca_topic_score_gemma":0.000028108148,"teacher_disagreement_score":0.95043784,"about_ca_system_score_codex":0.00007220552,"about_ca_system_score_gemma":0.000052756128,"threshold_uncertainty_score":0.5014425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049338065,0.00003984576,0.9471048,0.00029646305,0.00044304057,0.002649334,1.8824191e-7,0.00003785934,0.00009040772],"genre_scores_gemma":[0.988343,0.000005511151,0.009871617,0.00025616432,0.00021452467,0.0007447191,0.000007250675,0.000015890104,0.00054133363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857455,0.00014943902,0.000521802,0.0002574912,0.00026772078,0.00022898898],"domain_scores_gemma":[0.99897283,0.000110985784,0.0003568386,0.00014241105,0.00033760906,0.00007929352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070768816,0.00013955066,0.00021941014,0.00017086556,0.000105230174,0.000358886,0.0003791231,0.00010455157,0.00001683926],"category_scores_gemma":[0.00010778379,0.00012752296,0.00015976629,0.00021058616,0.000014960361,0.00082157704,0.000029805695,0.00047064602,8.683456e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028957726,0.00026982033,0.001238527,0.00009425996,0.00004486391,0.000085882646,0.0023430665,0.70659477,0.12794648,0.00014272776,0.0027475357,0.1582025],"study_design_scores_gemma":[0.00170367,0.00023148525,0.00006403557,0.00047024392,0.000009476676,0.00006530027,0.00003309787,0.9671961,0.028803494,0.00008447577,0.0012067662,0.00013184069],"about_ca_topic_score_codex":0.000058385413,"about_ca_topic_score_gemma":0.000021078613,"teacher_disagreement_score":0.9390049,"about_ca_system_score_codex":0.00010821038,"about_ca_system_score_gemma":0.00017094873,"threshold_uncertainty_score":0.5200236},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7766012,0.00021773744,0.21816853,0.0007671078,0.000043512402,0.000008318922,6.8881195e-7,0.000035898283,0.0041570403],"genre_scores_gemma":[0.99399674,0.0000075739263,0.005011451,0.0003914466,0.0000063245725,2.9680595e-7,0.0000010701721,9.97402e-7,0.00058408245],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.000031949367,0.00009263929,0.00016602613,0.00010230852,0.00007283395],"domain_scores_gemma":[0.9996186,0.0000567146,0.00001884356,0.00021212755,0.00005502423,0.00003867373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009625785,0.000035895795,0.00012277275,0.00009389617,0.00002954193,0.000045550143,0.000112084796,0.000015734386,0.000016295871],"category_scores_gemma":[0.00002146925,0.000030919142,0.00006679005,0.0006307223,0.00001341729,0.00007826263,0.00013945445,0.000034367982,0.0000011875359],"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.0000065137137,0.0001533127,0.84516263,0.00002138289,0.0013534507,0.00015928876,0.0023422583,0.0013829063,0.022529868,0.042684402,0.0030965887,0.0811074],"study_design_scores_gemma":[0.00016174893,0.00002609475,0.24346168,0.000011219536,0.00020111831,0.000015758998,0.00022220852,0.752156,0.0027383042,0.00025233373,0.00061027124,0.0001432381],"about_ca_topic_score_codex":0.000063361964,"about_ca_topic_score_gemma":0.000036921105,"teacher_disagreement_score":0.75077313,"about_ca_system_score_codex":0.0000050246235,"about_ca_system_score_gemma":0.000021721602,"threshold_uncertainty_score":0.1260846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46493655,0.00071018405,0.533881,0.00006246559,0.00014415557,0.00006454974,0.000008979703,0.00018737359,0.0000047453987],"genre_scores_gemma":[0.9967413,0.00010505347,0.0029897897,0.000036165213,0.000004992524,0.000026043444,0.000002924048,0.0000072566254,0.00008649812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891955,0.00011443807,0.00027037231,0.0003904693,0.00016039205,0.00014476108],"domain_scores_gemma":[0.9990176,0.000051774343,0.00008016827,0.0005995996,0.00021688678,0.000033972923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019981072,0.000118363154,0.00032388652,0.00064603996,0.00018263648,0.00003981413,0.00016175622,0.0002095235,0.0000040234054],"category_scores_gemma":[0.000007678145,0.00011936802,0.00015491556,0.0018228367,0.00007413266,0.00014422825,0.0000053349813,0.00024363863,0.0000016893458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005310307,0.00011714996,0.00013997086,0.0000184056,0.00070560456,0.000084649786,0.00010087982,0.91061145,0.08390391,0.0017418775,0.000007979182,0.0025628137],"study_design_scores_gemma":[0.00017928312,0.00009996636,0.00003171669,0.00003518808,0.00042915507,0.00012574601,0.00014039282,0.97315043,0.025472986,0.000008795675,0.00019820957,0.0001281098],"about_ca_topic_score_codex":0.00011499706,"about_ca_topic_score_gemma":0.0000983039,"teacher_disagreement_score":0.53180474,"about_ca_system_score_codex":0.000056266857,"about_ca_system_score_gemma":0.00006246051,"threshold_uncertainty_score":0.48676866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014433808,0.00002253512,0.98328304,0.00011983946,0.0010492018,0.00020307218,0.000051002986,0.00012347524,0.000713998],"genre_scores_gemma":[0.94291556,0.000024988287,0.056350783,0.00057937676,0.000017805,0.000038602797,0.000008335866,0.0000056014223,0.000058961232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988964,0.000108715016,0.0004372866,0.00013686846,0.00022423887,0.00019648697],"domain_scores_gemma":[0.998577,0.00061353965,0.00018754242,0.0003325002,0.000230637,0.00005876902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043886757,0.00012115275,0.0001733431,0.00015004916,0.00023580914,0.000109651904,0.00023182345,0.000076636505,0.00004154725],"category_scores_gemma":[0.000046000077,0.0001255317,0.00017254047,0.00022015805,0.000037543774,0.0009984428,0.000003440881,0.00019925859,0.000013884404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004947818,0.00022707801,0.000011158345,0.00025243455,0.00031699272,0.0000032096818,0.010623595,0.19314128,0.008226209,0.5205984,0.00015593917,0.2659489],"study_design_scores_gemma":[0.006443901,0.00041791203,0.000014380292,0.00095240696,0.00020492513,0.00014693956,0.016928304,0.3940585,0.5372591,0.039386187,0.0030855369,0.0011019276],"about_ca_topic_score_codex":0.000005692774,"about_ca_topic_score_gemma":0.0000017869427,"teacher_disagreement_score":0.92848176,"about_ca_system_score_codex":0.000063492655,"about_ca_system_score_gemma":0.00012723084,"threshold_uncertainty_score":0.5119034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18722722,0.00017634087,0.80145186,0.0044060396,0.0019342036,0.00023853908,6.7856473e-7,0.00019109772,0.0043740096],"genre_scores_gemma":[0.9838748,0.0000017108374,0.008221623,0.0012716278,0.00021963292,0.000009300126,0.00000819201,0.000010790517,0.0063823243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981066,0.00014722382,0.00031861974,0.00067598326,0.0004622513,0.0002892997],"domain_scores_gemma":[0.9983932,0.000076815646,0.0000754793,0.0011296363,0.00024428393,0.000080610385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106066,0.00012267844,0.00016521601,0.00013431611,0.00011419679,0.0003745626,0.0006103554,0.000041814998,0.000001108234],"category_scores_gemma":[0.00008643689,0.00013385211,0.000055029104,0.0005200593,0.0000072936427,0.00014421678,0.0008875723,0.00016156596,0.00007477964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003308347,0.00048029405,0.005920847,0.000441783,0.0001701006,0.0014403834,0.012030643,0.49001542,0.0022115232,0.10853831,0.06658731,0.3121303],"study_design_scores_gemma":[0.00041952968,0.000018157778,0.0029646298,0.00016941948,0.0000056851877,0.00005882236,0.00034125076,0.97333497,0.00006901964,0.00013213787,0.022263775,0.0002226057],"about_ca_topic_score_codex":0.00004478264,"about_ca_topic_score_gemma":0.0000072493513,"teacher_disagreement_score":0.79664755,"about_ca_system_score_codex":0.00013930205,"about_ca_system_score_gemma":0.000024863317,"threshold_uncertainty_score":0.54583305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04787038,0.00020154593,0.9413017,0.0038687852,0.0007630673,0.00020685144,0.00006743871,0.00035287568,0.0053673605],"genre_scores_gemma":[0.9452525,0.000024062509,0.039951365,0.003428147,0.000102241414,0.000036900885,0.00013841384,0.000019446294,0.011046928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987988,0.000074785225,0.00020622814,0.00039603485,0.00016299996,0.0003611501],"domain_scores_gemma":[0.9990334,0.00018901094,0.000048158137,0.0005126392,0.00009822522,0.000118589174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027276567,0.00013631763,0.00018521596,0.000042549436,0.00023472829,0.0002956892,0.00046132403,0.00006462536,0.00034635872],"category_scores_gemma":[0.00009254483,0.00012439094,0.00018033179,0.00018775242,0.000013626074,0.0004016425,0.00014203461,0.00013732589,0.000024767913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014295708,0.0012259316,0.0017224334,0.00023119382,0.0005206298,0.00041231368,0.0019878536,0.00497489,0.039889056,0.6351535,0.17521788,0.13852137],"study_design_scores_gemma":[0.005294551,0.00018124189,0.0075282524,0.0001264241,0.00008989439,0.0002438427,0.0010152163,0.86578923,0.033018034,0.034480892,0.050646402,0.001585998],"about_ca_topic_score_codex":0.00031544865,"about_ca_topic_score_gemma":0.00035680423,"teacher_disagreement_score":0.9013503,"about_ca_system_score_codex":0.000054641565,"about_ca_system_score_gemma":0.00010030576,"threshold_uncertainty_score":0.5072515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.353325,0.0003151852,0.64517754,0.0004114346,0.00007800888,0.000052409556,0.0000042422466,0.00008109265,0.00055505405],"genre_scores_gemma":[0.99335337,0.000020968291,0.0063255336,0.00018959194,0.000019648207,0.000008596783,0.0000059898966,0.000004141874,0.00007214976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891084,0.00013162858,0.00017887566,0.0003686257,0.00020029186,0.00020976014],"domain_scores_gemma":[0.99939656,0.00006664264,0.00003515784,0.00036350847,0.000038003476,0.000100096906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018031242,0.000097231736,0.00022114158,0.0002613985,0.00008050952,0.00016355499,0.00023633044,0.000041170893,0.0000023148334],"category_scores_gemma":[0.000020138294,0.00009304478,0.00012716641,0.0008467416,0.0000239022,0.00013456891,0.00016081243,0.00018221338,0.0000042200486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002657423,0.000163225,0.053601958,0.00003792945,0.00035857578,0.00043455095,0.001067992,0.078491755,0.0071063605,0.8540085,0.00027659515,0.0044260006],"study_design_scores_gemma":[0.00036141943,0.000009095204,0.0041168877,0.00001677525,0.000044211363,0.000013543258,0.000056372737,0.9943484,0.00008889363,0.0007552083,0.00007936046,0.000109847286],"about_ca_topic_score_codex":0.000105529885,"about_ca_topic_score_gemma":0.00008088256,"teacher_disagreement_score":0.91585666,"about_ca_system_score_codex":0.000038753613,"about_ca_system_score_gemma":0.00004378964,"threshold_uncertainty_score":0.3794256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05458421,0.000090898626,0.94166714,0.00069543574,0.0014202221,0.00020069022,0.000017387421,0.0006801565,0.00064387283],"genre_scores_gemma":[0.9892856,0.00018136976,0.0067100436,0.0002669909,0.00011076432,0.000058560305,0.000020702648,0.000033341395,0.0033326652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978004,0.000295065,0.00030981397,0.0006696992,0.00045217003,0.00047281827],"domain_scores_gemma":[0.9986306,0.00026849366,0.00009582843,0.000577802,0.00018800181,0.00023928263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002998223,0.00026425248,0.00027162704,0.00018554927,0.0006980615,0.0001767171,0.00042456156,0.00016408387,0.00018149943],"category_scores_gemma":[0.00003086904,0.0002873898,0.00027221112,0.00045233234,0.000046883815,0.00059925305,0.000017802355,0.00058908964,0.0006982964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016562936,0.00060493755,0.00010924601,0.00006696993,0.00026553322,0.00051862723,0.0049414597,0.1434148,0.1382253,0.00004389166,0.00055947714,0.7110841],"study_design_scores_gemma":[0.0009854133,0.00011231394,0.00028886338,0.00009696768,0.000053575324,0.00011238152,0.000121701225,0.96231943,0.0344233,0.000019428337,0.0010659143,0.00040073032],"about_ca_topic_score_codex":0.0005863786,"about_ca_topic_score_gemma":0.0004913458,"teacher_disagreement_score":0.9349571,"about_ca_system_score_codex":0.00043758634,"about_ca_system_score_gemma":0.00014326953,"threshold_uncertainty_score":0.9999578},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45804688,0.000121551624,0.5373777,0.00050979765,0.00068092404,0.00035572535,0.000011262875,0.00009882212,0.0027972832],"genre_scores_gemma":[0.98678267,0.00032423149,0.00018125401,0.00029403687,0.00008562522,0.0000012510717,0.000013289188,0.000033162407,0.012284498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969722,0.00017325363,0.00030035322,0.001486563,0.00026027422,0.00080732605],"domain_scores_gemma":[0.99660575,0.00018474858,0.00062206265,0.0018750003,0.00029602973,0.00041637718],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066927576,0.00055439526,0.0004945436,0.00021557519,0.002479617,0.0014005186,0.0016981197,0.0002862174,0.00005112048],"category_scores_gemma":[0.000031204014,0.0005976612,0.00015422722,0.00036922185,0.0008238476,0.0021871158,0.0011279702,0.0006298202,0.000036282596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011347058,0.001212163,0.044373408,0.000105766354,0.0009081784,0.00044587642,0.0010406037,0.49482536,0.0003972567,0.45345557,0.0005369205,0.0015641808],"study_design_scores_gemma":[0.006826784,0.00070912944,0.0104034245,0.0002012867,0.00033614642,0.000033055294,0.0010048507,0.9782225,0.00005855315,0.00084510277,0.00054190966,0.0008172389],"about_ca_topic_score_codex":0.001816861,"about_ca_topic_score_gemma":0.0007370914,"teacher_disagreement_score":0.53719646,"about_ca_system_score_codex":0.00042064185,"about_ca_system_score_gemma":0.00030978775,"threshold_uncertainty_score":0.9996475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8771628,0.00042873734,0.119183205,0.00016564723,0.00008424298,0.000078868725,3.019843e-7,0.00004160238,0.0028545584],"genre_scores_gemma":[0.99331295,0.00004013066,0.006288026,0.00012343941,0.00002335011,0.0000091741695,6.950406e-7,0.0000018141791,0.00020042945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995263,0.00002801843,0.00013196073,0.00013177782,0.00008694548,0.00009499966],"domain_scores_gemma":[0.9994885,0.000100055746,0.00003361905,0.00031774025,0.00004641262,0.000013723783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017269506,0.000040804825,0.00006839124,0.000025223706,0.00007583563,0.000036479196,0.00035284864,0.000013620831,0.000004442728],"category_scores_gemma":[0.0000043225887,0.000029271905,0.000031342737,0.0003162592,0.000016585002,0.00008545918,0.00019927169,0.00008203032,0.0000055692035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008883513,0.00066639023,0.061798707,0.00016230345,0.00006601863,0.000019177278,0.010627427,0.36274457,0.08016981,0.20613791,0.001108541,0.27649024],"study_design_scores_gemma":[0.000107484,0.000013577043,0.00093437993,0.000020329511,0.00000151751,0.000006412317,0.00040291445,0.99220985,0.0049506137,0.000032760694,0.0012629852,0.00005719835],"about_ca_topic_score_codex":0.000019032528,"about_ca_topic_score_gemma":0.000013123699,"teacher_disagreement_score":0.6294652,"about_ca_system_score_codex":0.000010972229,"about_ca_system_score_gemma":0.000046734378,"threshold_uncertainty_score":0.11936737},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043210793,0.0035509423,0.8333584,0.0013023156,0.01798737,0.0025059965,0.000016634318,0.00058380805,0.09748372],"genre_scores_gemma":[0.93520457,0.00051888934,0.042756755,0.0046289125,0.0032656537,0.00020470734,0.000023238152,0.0001345567,0.013262742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948569,0.0001742396,0.000865947,0.0018100955,0.0014200012,0.0008728298],"domain_scores_gemma":[0.9967371,0.00051562086,0.000303293,0.0021861766,0.00010088808,0.00015687515],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0031108484,0.00055914075,0.000693368,0.00079402514,0.00033969694,0.0013851426,0.0061381753,0.0002453602,0.00002425646],"category_scores_gemma":[0.000058791422,0.00047760384,0.0002733966,0.00072227285,0.0004823993,0.00084374787,0.0019126636,0.0014772994,0.000047802685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010189014,0.0005001993,0.00059917103,0.00013086117,0.000082055885,0.0075853863,0.011074024,0.02817031,0.00059382565,0.35404706,0.0015604327,0.59555477],"study_design_scores_gemma":[0.0048151333,0.00064171036,0.0015623184,0.0026244887,0.00004699625,0.0010041096,0.00006354005,0.9056854,0.00017962759,0.015174544,0.06456469,0.0036374165],"about_ca_topic_score_codex":0.00034212053,"about_ca_topic_score_gemma":0.0003130602,"teacher_disagreement_score":0.89199376,"about_ca_system_score_codex":0.00034680343,"about_ca_system_score_gemma":0.0007616471,"threshold_uncertainty_score":0.99976754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014683606,0.0003351125,0.98078257,0.00055956625,0.0022665332,0.0006896344,0.0000013811258,0.0001389577,0.0005426555],"genre_scores_gemma":[0.98594874,0.00000796092,0.005820933,0.007582958,0.00054258306,0.000009752916,0.0000017720072,0.00002037919,0.000064943546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955678,0.00031279333,0.0005755641,0.0016887349,0.0011492094,0.0007059087],"domain_scores_gemma":[0.9955182,0.002279943,0.00026446235,0.001633125,0.00013975192,0.00016451196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031811572,0.00050314475,0.00050069415,0.00046233102,0.0007741917,0.0009921393,0.002680111,0.00021518892,0.0000068586182],"category_scores_gemma":[0.00024782546,0.00039885216,0.00014818303,0.0011796732,0.0002693111,0.00027484924,0.0011575768,0.0015579982,0.000012035912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001237598,0.00015864961,0.00026913674,0.000025441323,0.000017184966,0.019787338,0.006043494,0.590625,0.000011464459,0.005539707,0.000048223683,0.377462],"study_design_scores_gemma":[0.0006677588,0.0005556367,0.00013065644,0.00024859927,0.000014381183,0.004938359,0.000023384897,0.9751778,0.000013374683,0.017203603,0.00034616643,0.00068027864],"about_ca_topic_score_codex":0.00073658477,"about_ca_topic_score_gemma":0.004769843,"teacher_disagreement_score":0.97496164,"about_ca_system_score_codex":0.000540238,"about_ca_system_score_gemma":0.00060117646,"threshold_uncertainty_score":0.99984634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26663545,0.000067397246,0.7325766,0.00016766056,0.0003046106,0.00007124146,0.000006997556,0.00009764761,0.000072386225],"genre_scores_gemma":[0.9459183,0.00007755164,0.052406475,0.00014244708,0.000015083464,0.000020005897,0.00001563389,0.000016948185,0.0013875418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849313,0.0001707274,0.00024026944,0.0005077774,0.00027826722,0.000309813],"domain_scores_gemma":[0.9993381,0.00012796636,0.00004594163,0.00037331015,0.000015013958,0.000099701065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001612774,0.00017420787,0.00018741586,0.00013394053,0.00020960324,0.000111542824,0.0003136569,0.00009004923,0.000023010676],"category_scores_gemma":[0.000009802026,0.00018867211,0.00012162077,0.00031905397,0.000044308406,0.00032225752,0.000005121002,0.0008029143,0.00006839708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013442841,0.00067742524,0.00006960488,0.0000070196897,0.00002649596,0.00007879737,0.0017030475,0.87401545,0.009970343,0.0000038652515,0.0000045727684,0.11342993],"study_design_scores_gemma":[0.00073459494,0.000045591176,0.0008038689,0.000029777306,0.00001065927,0.000037259626,0.00020816909,0.99675125,0.0008877645,0.0000038617677,0.00028996952,0.00019724837],"about_ca_topic_score_codex":0.00011300053,"about_ca_topic_score_gemma":0.00009473888,"teacher_disagreement_score":0.6801701,"about_ca_system_score_codex":0.00013948894,"about_ca_system_score_gemma":0.000056455283,"threshold_uncertainty_score":0.76938254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3965555,0.0003597514,0.60224026,0.00021050837,0.000423431,0.00010674746,0.0000029660312,0.00008383149,0.000016974453],"genre_scores_gemma":[0.9748846,0.00019849991,0.024604997,0.00015094603,0.00006621862,0.000029696866,3.7910218e-7,0.000008938705,0.000055666093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.000012695563,0.00018171544,0.00049277797,0.00021636405,0.00039617225],"domain_scores_gemma":[0.99928695,0.00018972476,0.000031535845,0.00018474562,0.00013781688,0.00016923918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045237236,0.00015716755,0.00017007651,0.00012233267,0.0004963161,0.00040389303,0.00019303219,0.000048897928,9.459928e-7],"category_scores_gemma":[0.00001695657,0.00015673462,0.000041467458,0.00030655102,0.00011322547,0.0006391197,0.000014504366,0.00016383738,3.8506252e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058859685,0.000057642465,0.00030824592,0.000244277,0.00014759069,0.000079584104,0.0019929123,0.50871044,0.14933617,0.007288085,0.00006317797,0.33171302],"study_design_scores_gemma":[0.00034500612,0.00006593247,0.0004237901,0.00015294875,0.000020563602,0.00013042864,0.00010725927,0.99662334,0.0017705385,0.000058985006,0.00008524598,0.00021598741],"about_ca_topic_score_codex":0.000022780081,"about_ca_topic_score_gemma":0.000021294236,"teacher_disagreement_score":0.57832915,"about_ca_system_score_codex":0.000039995448,"about_ca_system_score_gemma":0.00009184809,"threshold_uncertainty_score":0.6391452},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3824909,0.00017183741,0.6156577,0.0006161455,0.00080062647,0.000057069108,0.0000022357171,0.000030674877,0.00017282821],"genre_scores_gemma":[0.9623377,0.000086976004,0.0366623,0.00026638733,0.0002630011,3.7184085e-7,0.000008929184,0.000016247386,0.00035812697],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982407,0.00020662363,0.00047585875,0.00037325628,0.00035296124,0.00035061632],"domain_scores_gemma":[0.99854964,0.00026159253,0.00021178364,0.00063830614,0.00023034413,0.00010834427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015569312,0.00013556865,0.00029200417,0.0001538206,0.00008346365,0.00038168667,0.00144066,0.00007908943,0.000006161514],"category_scores_gemma":[0.0001584475,0.0001319697,0.00014080897,0.00016952823,0.000031910273,0.0010492443,0.00057570805,0.00062482385,0.000004203177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030129732,0.00044917938,0.0034676625,0.00019663686,0.0007934979,0.0053926744,0.013049733,0.3503802,0.4383388,0.0018203025,0.021905394,0.16390462],"study_design_scores_gemma":[0.00045722147,0.000053468633,0.00010037668,0.00048371023,0.000014118077,0.00089914544,0.00005317683,0.9938914,0.003429569,0.00029224105,0.00018574552,0.0001397932],"about_ca_topic_score_codex":0.00045074802,"about_ca_topic_score_gemma":0.000023555835,"teacher_disagreement_score":0.64351124,"about_ca_system_score_codex":0.0000901515,"about_ca_system_score_gemma":0.00014515479,"threshold_uncertainty_score":0.53815687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004286137,0.0011103926,0.9452144,0.007913408,0.000433597,0.00040197864,0.000039798604,0.00017530126,0.040425025],"genre_scores_gemma":[0.9134107,0.0002009437,0.08371544,0.0019924322,0.00004504859,0.00016970403,0.00011398691,0.000011551903,0.00034019517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968869,0.00078650337,0.00059911056,0.0007684594,0.0003831353,0.0005758963],"domain_scores_gemma":[0.99436194,0.00026268742,0.00014690356,0.004417512,0.00053930614,0.00027163656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005570744,0.00032227061,0.0004484161,0.00012331069,0.00036432143,0.00071197987,0.004175347,0.0001756608,0.00004933186],"category_scores_gemma":[0.0001756296,0.0003626505,0.00018207269,0.0020060062,0.000117381154,0.00040014155,0.001217789,0.00057234085,0.00011904022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007014107,0.0028742957,0.007439948,0.000043895467,0.00017713396,0.0000887516,0.0009857398,0.42034212,0.0008329364,0.466912,0.015798567,0.08443449],"study_design_scores_gemma":[0.0007280993,0.000037226248,0.00176516,0.0000985461,0.000020630489,0.000025488105,0.00026252988,0.99195975,0.00007087601,0.0006418928,0.003926843,0.00046297078],"about_ca_topic_score_codex":0.0011198113,"about_ca_topic_score_gemma":0.001989756,"teacher_disagreement_score":0.90912455,"about_ca_system_score_codex":0.00038676106,"about_ca_system_score_gemma":0.0009741999,"threshold_uncertainty_score":0.9998825},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083537616,0.0062365416,0.9002991,0.0054485924,0.0012655178,0.0007745265,0.00011017079,0.00029668838,0.0020312504],"genre_scores_gemma":[0.98448867,0.0019486865,0.012045363,0.0006399192,0.000066624,0.0001263788,0.00033756086,0.000011855586,0.00033492493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745315,0.00064963155,0.0005402113,0.0006289033,0.00026353463,0.00046456084],"domain_scores_gemma":[0.99639606,0.0005809708,0.00022039475,0.0019037433,0.0006860014,0.00021283531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005047564,0.00031355332,0.00040032194,0.00006356241,0.0005943907,0.0007201293,0.0017405575,0.00016630563,0.000028901115],"category_scores_gemma":[0.00023977627,0.00032356672,0.00019269614,0.0005165292,0.00019306384,0.0003022092,0.00070465816,0.0004749459,0.000020045587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007699519,0.0020949915,0.023661697,0.00010807478,0.0009817252,0.000101582664,0.00096590084,0.042322308,0.004541944,0.11363891,0.00964692,0.801166],"study_design_scores_gemma":[0.0022174392,0.00026238963,0.0011102944,0.0001739299,0.000086072105,0.00002757172,0.00099447,0.9687728,0.00028389713,0.00031067914,0.025234682,0.0005257707],"about_ca_topic_score_codex":0.000593532,"about_ca_topic_score_gemma":0.0012380604,"teacher_disagreement_score":0.9264505,"about_ca_system_score_codex":0.0002347111,"about_ca_system_score_gemma":0.0006935306,"threshold_uncertainty_score":0.9999216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865098,0.003517743,0.006700801,0.0013686751,0.0016300565,0.000086269945,0.000013653775,0.000037276273,0.00013569597],"genre_scores_gemma":[0.9804183,0.000103596016,0.018358104,0.00075799966,0.00017415885,0.000006755852,0.0000026574032,0.000014729061,0.00016365966],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986476,0.00010566653,0.00033323685,0.00022530941,0.0004526123,0.00023563197],"domain_scores_gemma":[0.9990984,0.00007712545,0.0002334741,0.0003873536,0.000049672188,0.00015395836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029243357,0.00015971494,0.00021100604,0.00017723444,0.00029486037,0.00014571844,0.0012469927,0.000026823222,0.00004296052],"category_scores_gemma":[0.000018608087,0.00015047447,0.00014509006,0.00016742673,0.00005402106,0.00055772596,0.0013894094,0.00034869157,0.000003588427],"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.00074912916,0.0033073144,0.005507483,0.000032235424,0.0009431161,0.004416508,0.03135002,0.0025858565,0.7742088,0.0029490474,0.043992396,0.12995812],"study_design_scores_gemma":[0.028741432,0.03447235,0.014793586,0.0005572205,0.00030313365,0.04044627,0.1059992,0.55035686,0.16036792,0.0047132885,0.053044245,0.0062044673],"about_ca_topic_score_codex":0.00003779885,"about_ca_topic_score_gemma":4.562863e-7,"teacher_disagreement_score":0.6138408,"about_ca_system_score_codex":0.00012719422,"about_ca_system_score_gemma":0.00005592462,"threshold_uncertainty_score":0.61361706},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067793056,0.00013532076,0.98985565,0.0018015067,0.00023582179,0.0004938113,0.0000065146555,0.0006695465,0.000022552142],"genre_scores_gemma":[0.99561715,0.0000072003454,0.0033978694,0.00040213196,0.0000133320455,0.00039216306,0.000028838505,0.000024844143,0.00011646337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.000095086856,0.00025294194,0.0006921591,0.00031932298,0.00042595022],"domain_scores_gemma":[0.9984849,0.00008394157,0.000097348755,0.0012116511,0.000060678147,0.000061468905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034555106,0.00021166119,0.00022221943,0.00041693874,0.0009887135,0.00006700084,0.0014334423,0.00011179656,0.000015850834],"category_scores_gemma":[0.000003434321,0.00020543004,0.000100089805,0.00068944576,0.00006955964,0.00012205429,0.000016289128,0.00095817033,0.0000028111697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008501336,0.00011651303,0.0000041051926,0.000008256581,0.00007429079,0.00003377048,0.00004307441,0.9752008,0.00028128293,0.00068387383,0.000032281336,0.023436785],"study_design_scores_gemma":[0.0011165137,0.0015600078,0.0000020188086,0.000015821934,0.00005498691,0.0000676919,0.00019418856,0.99336207,0.00062804733,0.000046864,0.002699591,0.00025220308],"about_ca_topic_score_codex":0.00006666876,"about_ca_topic_score_gemma":0.00008929376,"teacher_disagreement_score":0.98883784,"about_ca_system_score_codex":0.00016945468,"about_ca_system_score_gemma":0.00017240948,"threshold_uncertainty_score":0.83771944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5723927,0.000104521234,0.42667535,0.0004236409,0.00019046651,0.00018578146,0.0000144003325,0.000009623048,0.0000034904672],"genre_scores_gemma":[0.9880051,0.00001622456,0.011715968,0.0002092902,0.000013106233,0.000019489162,0.000010377356,0.000005500489,0.0000049688783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99842674,0.000111192865,0.00067226315,0.0001464941,0.0005476101,0.000095699696],"domain_scores_gemma":[0.99824524,0.00012927267,0.00081956724,0.0002116274,0.00053863105,0.00005563654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085745205,0.000088113804,0.00025197104,0.00015583799,0.000055240438,0.000007635591,0.00030998487,0.000029764298,0.000002682129],"category_scores_gemma":[0.000036495192,0.0000853349,0.00014609273,0.00040660426,0.000008625742,0.0002589253,0.000008334955,0.00023048269,6.886797e-8],"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.0007334572,0.00027453934,0.0005925511,0.00007424596,0.000019157016,0.000010176774,0.0010917685,0.5777963,0.39338005,0.0006363288,0.0000058477153,0.025385633],"study_design_scores_gemma":[0.0055522183,0.007900911,0.71810114,0.0009984202,0.00016231349,0.00001565588,0.0025642982,0.11111634,0.15128566,0.0010640443,0.0005065398,0.0007324463],"about_ca_topic_score_codex":0.000021311002,"about_ca_topic_score_gemma":0.00002937529,"teacher_disagreement_score":0.7175086,"about_ca_system_score_codex":0.00008290824,"about_ca_system_score_gemma":0.00008014235,"threshold_uncertainty_score":0.34798563},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41480717,0.00062192825,0.58353204,0.00018686037,0.0006618521,0.0001479103,0.000011043529,0.000026955437,0.000004238907],"genre_scores_gemma":[0.9960357,0.00000223874,0.00364008,0.00018673782,0.00010812985,0.0000044316935,0.000007613234,0.000011222986,0.0000038355215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977759,0.00022904576,0.0008480903,0.00031112353,0.00041128354,0.00042455326],"domain_scores_gemma":[0.99838537,0.00040545338,0.00065305596,0.00018413963,0.0002303012,0.00014167558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014803892,0.00019843948,0.00043741977,0.00029050626,0.0005120431,0.0002282041,0.000639241,0.000047635618,0.0000010113819],"category_scores_gemma":[0.00008042267,0.00019258256,0.00018404167,0.00036771444,0.00002191002,0.000038744754,0.00043791346,0.00043439047,4.0393843e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067421184,0.00015059792,0.0006693049,0.00004423006,0.000033477143,0.00013238967,0.0002820451,0.9879963,0.00025484018,0.006597165,0.00005836213,0.003713909],"study_design_scores_gemma":[0.0014577502,0.00037279545,0.000173283,0.00013700321,0.000014994455,0.00042694178,0.00048209022,0.9960353,0.00007588971,0.00046322218,0.00015001139,0.00021075424],"about_ca_topic_score_codex":0.00006406073,"about_ca_topic_score_gemma":0.0000016054687,"teacher_disagreement_score":0.58122855,"about_ca_system_score_codex":0.00026130487,"about_ca_system_score_gemma":0.00012273536,"threshold_uncertainty_score":0.7853289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037211988,0.00016575852,0.95889103,0.0014167539,0.0009721112,0.00058738247,0.000089012356,0.00033507918,0.00033089984],"genre_scores_gemma":[0.9943522,0.000004838241,0.0021811076,0.0016431108,0.00015288622,0.00057326845,0.00008862931,0.0000125833585,0.000991342],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998585,0.000068532885,0.0002074461,0.00053788477,0.00033051101,0.00027065616],"domain_scores_gemma":[0.99852705,0.00004405284,0.000078227946,0.0011990189,0.000053975218,0.00009769258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003205251,0.00011901271,0.00012865089,0.00015887825,0.00047325302,0.00044081343,0.004465795,0.000016458716,0.00003150772],"category_scores_gemma":[0.0000100032985,0.00011892943,0.000036041514,0.0006943726,0.000012320431,0.00095765555,0.0023194382,0.00013724247,0.000082148305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003122133,0.000517274,0.0131808445,0.00008953331,0.00013086182,0.00007851669,0.00068949617,0.009916539,0.008217383,0.0017743846,0.030399334,0.9349746],"study_design_scores_gemma":[0.00054714084,0.00011079483,0.0034345326,0.000032352687,0.000022477687,0.00019055152,0.00016064919,0.4232919,0.0004694975,0.0030055158,0.5679635,0.0007710807],"about_ca_topic_score_codex":0.00055704155,"about_ca_topic_score_gemma":0.00006492961,"teacher_disagreement_score":0.95714027,"about_ca_system_score_codex":0.000045204175,"about_ca_system_score_gemma":0.000037865542,"threshold_uncertainty_score":0.82986325},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013952808,0.00037452622,0.9656715,0.012765675,0.00057454087,0.0004805814,0.0007723568,0.00044218934,0.0049658497],"genre_scores_gemma":[0.97497165,0.0000868296,0.023183983,0.0010355659,0.00010658429,0.000127055,0.00033948384,0.000012080682,0.00013674797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974011,0.00043438424,0.00050266273,0.0006471178,0.00039438394,0.0006203426],"domain_scores_gemma":[0.9948928,0.00041397367,0.0002286558,0.0037804053,0.00040704114,0.00027712464],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005319598,0.00036483372,0.00042288977,0.00007419519,0.0006339385,0.0009441584,0.0063373023,0.0001754612,0.000005777751],"category_scores_gemma":[0.000116609546,0.0003415105,0.00025765641,0.00052696734,0.00027630344,0.0008031811,0.0012715498,0.00040062136,0.0000787357],"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.00007975457,0.00043490826,0.0024034083,0.000071963645,0.00012047537,0.0000019751944,0.00024269718,0.00049216364,0.00042894736,0.91354483,0.011179119,0.07099975],"study_design_scores_gemma":[0.0021686463,0.00035658354,0.0062260106,0.0002597897,0.00010051129,0.00009609684,0.00017723489,0.6444055,0.00008199708,0.16007662,0.1848291,0.0012219198],"about_ca_topic_score_codex":0.00060388277,"about_ca_topic_score_gemma":0.0014520156,"teacher_disagreement_score":0.96101886,"about_ca_system_score_codex":0.00017317753,"about_ca_system_score_gemma":0.00024859453,"threshold_uncertainty_score":0.9999037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029437257,0.00182543,0.9615318,0.0005611668,0.0010066209,0.0008878956,0.0000079310075,0.00021541362,0.0045264536],"genre_scores_gemma":[0.9831127,0.00018576707,0.004901696,0.0013438404,0.00031309098,0.00017521881,0.0005207718,0.00004220799,0.009404685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985829,0.000042470027,0.00025376753,0.00069466786,0.00017323217,0.0002529673],"domain_scores_gemma":[0.99912196,0.00012880814,0.000107311505,0.00024916523,0.00027300644,0.00011974616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014329756,0.00032578642,0.0004081726,0.000070433874,0.00035456935,0.0004841892,0.0004376125,0.00020583585,0.000005544362],"category_scores_gemma":[0.00006250614,0.00027961447,0.00011960572,0.0001706801,0.000018839095,0.00036517563,0.00009359368,0.00031229056,0.0000069758817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011378368,0.00050588854,0.0004996212,0.0015721755,0.0035768573,0.0003463247,0.047880415,0.046147775,0.03033191,0.54636663,0.057842463,0.2637921],"study_design_scores_gemma":[0.0005017553,0.000205584,0.00006706512,0.00014743982,0.0000454071,0.000004192947,0.00065510464,0.99232614,0.0017349402,0.00006831885,0.003764362,0.00047971657],"about_ca_topic_score_codex":0.00007589075,"about_ca_topic_score_gemma":0.00012286603,"teacher_disagreement_score":0.9566301,"about_ca_system_score_codex":0.000029761139,"about_ca_system_score_gemma":0.00013522526,"threshold_uncertainty_score":0.9999656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011465652,0.0016488753,0.30740488,0.00013171205,0.0008627415,0.00016089762,0.0000053523,0.00050904695,0.68916184],"genre_scores_gemma":[0.9052402,0.000068387795,0.0038552736,0.00040721972,0.00041488814,8.225969e-7,0.00001573287,0.000044972432,0.08995254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987576,0.000027081078,0.0003796767,0.00045969716,0.0002266735,0.00014926304],"domain_scores_gemma":[0.999105,0.00008708952,0.00027057182,0.000357144,0.000081769256,0.000098431556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018785366,0.00025668272,0.00046382693,0.000100747544,0.0000771193,0.00010797561,0.00054245355,0.00015199315,0.000004533703],"category_scores_gemma":[0.000005863661,0.00022200253,0.00011849604,0.000042168922,0.000042456548,0.000071071874,0.00048956793,0.00039732116,0.000015871741],"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.0000046541795,0.0000034910956,0.00003943396,0.00016146935,0.000096273696,0.0000550571,0.00016299676,0.00007293103,0.000035838308,0.95331573,0.0020880294,0.043964103],"study_design_scores_gemma":[0.00036492836,0.0001710981,0.000015448124,0.0022966156,0.00007300512,0.00013273394,0.00006258269,0.92996615,0.00001893476,0.0014990486,0.06471856,0.00068091595],"about_ca_topic_score_codex":0.00019431094,"about_ca_topic_score_gemma":0.000013026814,"teacher_disagreement_score":0.9518167,"about_ca_system_score_codex":0.000042022115,"about_ca_system_score_gemma":0.000054656222,"threshold_uncertainty_score":0.9053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42502078,0.27838138,0.29394624,0.00051442167,0.0011484866,0.0001861032,0.000005405465,0.00017027282,0.00062692945],"genre_scores_gemma":[0.94588,0.053369794,0.00043376387,0.00008554321,0.000053581956,0.00004054787,0.000017827782,0.00001003943,0.00010891727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979201,0.00042977708,0.00028450898,0.00085679296,0.00016712745,0.00034167236],"domain_scores_gemma":[0.9989295,0.000256077,0.00008059913,0.0005640266,0.00006899085,0.000100810175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145549,0.00023847802,0.00034692674,0.00016547284,0.00012756452,0.0003579409,0.00039987246,0.00020444854,0.0000030001095],"category_scores_gemma":[0.0000228776,0.00022961966,0.0000567867,0.00012684855,0.000041785817,0.00010242379,0.0022766264,0.0003821893,3.9460593e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001745907,0.00051713985,0.007876964,0.00033248405,0.00013974038,0.00020728602,0.0042196736,0.38793468,0.000057625944,0.02067063,0.000310452,0.5777159],"study_design_scores_gemma":[0.00019482669,0.000028779676,0.019289557,0.00022250487,0.0000066143207,0.0000234184,0.00016712522,0.9793365,0.0000036142774,0.00018172969,0.00020549301,0.00033984508],"about_ca_topic_score_codex":0.0052639553,"about_ca_topic_score_gemma":0.0070632487,"teacher_disagreement_score":0.5914018,"about_ca_system_score_codex":0.000049730366,"about_ca_system_score_gemma":0.0000788268,"threshold_uncertainty_score":0.9363618},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075137764,0.00062689756,0.92235297,0.0006541455,0.0020743941,0.00088046957,0.000032724467,0.00054439605,0.06532023],"genre_scores_gemma":[0.94556814,0.00001659448,0.0042729024,0.0012109438,0.00060337206,0.000050813065,0.00013362202,0.00003262893,0.04811096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847806,0.000040426472,0.00029926043,0.0005024664,0.0003056454,0.0003741588],"domain_scores_gemma":[0.9987968,0.00024945405,0.00018534568,0.00039522361,0.00021034697,0.00016282836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036565858,0.00026682904,0.00030728133,0.0004278705,0.00022221374,0.0001579694,0.00069929846,0.000255918,0.0000099281515],"category_scores_gemma":[0.0001501367,0.0002321808,0.00026186372,0.00020466786,0.000006922316,0.0002411639,0.00003222984,0.00028268117,0.00002693852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010774983,0.00024266116,0.00005502787,0.00022235316,0.00033879906,0.000047607922,0.0019349006,0.00043631386,0.021182992,0.3744644,0.022614393,0.57738304],"study_design_scores_gemma":[0.006043983,0.0010630041,0.0014900682,0.0008730267,0.0001890333,0.00003263909,0.0014884579,0.9389248,0.0029697593,0.009183642,0.035414383,0.002327233],"about_ca_topic_score_codex":0.00067680056,"about_ca_topic_score_gemma":0.00033944077,"teacher_disagreement_score":0.9384885,"about_ca_system_score_codex":0.00011736065,"about_ca_system_score_gemma":0.0005805393,"threshold_uncertainty_score":0.9468058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013918476,0.22837806,0.53646,0.21535271,0.0016647854,0.0013259703,0.000004682471,0.0014160487,0.014005918],"genre_scores_gemma":[0.55400115,0.08878692,0.19757049,0.15802866,0.0004860475,0.00014343533,0.00006403406,0.000052305637,0.0008669691],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758154,0.0008065985,0.0005639443,0.0002924572,0.00034697793,0.0004084976],"domain_scores_gemma":[0.9933537,0.0006821662,0.00025490296,0.005362978,0.00015394,0.0001922905],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015476267,0.00024198246,0.00041432152,0.000088530534,0.000324976,0.00015642076,0.005669928,0.00006258469,0.000032479384],"category_scores_gemma":[0.000120017925,0.00022567273,0.00022201065,0.00041992238,0.000047647765,0.0011486838,0.0036015313,0.000391845,0.0005317081],"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.0000030786202,0.00030006323,0.0020773106,0.0007267296,0.00010345273,0.0000035125556,0.001282109,0.000010517974,0.000082400984,0.07186993,0.098540254,0.82500064],"study_design_scores_gemma":[0.0003402386,0.000049683942,0.0027846522,0.0032231985,0.00006477137,0.00009697095,0.00000593284,0.012812444,0.000043479253,0.0010255649,0.97893804,0.00061501964],"about_ca_topic_score_codex":0.00011104655,"about_ca_topic_score_gemma":0.000007409599,"teacher_disagreement_score":0.8803978,"about_ca_system_score_codex":0.00007555956,"about_ca_system_score_gemma":0.000036715843,"threshold_uncertainty_score":0.99970984},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001561348,0.00010395371,0.3560981,0.00022555228,0.00035778843,0.000028551174,4.8204504e-7,0.00021839434,0.6429656],"genre_scores_gemma":[0.011941254,0.000019159152,0.0011741088,0.0012580768,0.00019701433,9.08457e-7,0.0000027561528,0.000015849488,0.9853909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991632,0.000007979512,0.00014487174,0.00034005666,0.00020909429,0.00013480976],"domain_scores_gemma":[0.9991344,0.000051324114,0.00006843918,0.00064779236,0.00003419867,0.00006381334],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001390744,0.00017172484,0.00018488069,0.00009170213,0.00006903656,0.0001273392,0.0007378284,0.00012541405,0.00010046941],"category_scores_gemma":[0.0000058921864,0.00014938101,0.0001391856,0.000008276931,0.0000143465695,0.0000716704,0.00026531206,0.00026672086,0.001034687],"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":[3.1192195e-7,9.1478336e-7,6.904175e-7,0.0000039915253,0.0000117606205,0.000010281674,0.000010562566,0.000012824123,0.000009870166,0.9461397,0.00898425,0.044814825],"study_design_scores_gemma":[0.00010137853,0.00003826153,0.000002789434,0.000087837776,0.0000119200995,0.00003307497,4.353355e-7,0.015418904,0.0000075444664,0.042238127,0.9416372,0.00042252184],"about_ca_topic_score_codex":0.000042153944,"about_ca_topic_score_gemma":0.0000120671,"teacher_disagreement_score":0.93265295,"about_ca_system_score_codex":0.000025822163,"about_ca_system_score_gemma":0.000028090682,"threshold_uncertainty_score":0.9997431},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033807144,0.0006231093,0.9591924,0.00073485915,0.0036719376,0.00056482205,0.000006816492,0.0003905762,0.0010083556],"genre_scores_gemma":[0.834983,0.000019157946,0.16165525,0.0020688202,0.00043197436,0.00014532436,0.00009215908,0.0000319215,0.000572394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713016,0.00013907002,0.0005130304,0.0011427408,0.00053595495,0.0005390571],"domain_scores_gemma":[0.9972159,0.00075200846,0.00022124394,0.0014753508,0.00018231402,0.00015318459],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011419542,0.00039841532,0.00047947236,0.00011842667,0.00033303315,0.0010823027,0.0015612459,0.0002677982,0.000027024244],"category_scores_gemma":[0.00006130984,0.00036840758,0.00048371582,0.00015571603,0.000015122656,0.00016485335,0.0011357977,0.0006724963,0.000012594701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029816922,0.000073672796,0.00007218198,0.000095466276,0.00006538948,0.000023728473,0.00028494452,0.9742645,0.000072927614,0.0030823767,0.0045383894,0.01739659],"study_design_scores_gemma":[0.00074628944,0.00007040326,0.000094180155,0.00079007546,0.00004175329,0.0000072357034,0.00009764271,0.9871944,0.00022760296,0.008731724,0.0013441648,0.00065453263],"about_ca_topic_score_codex":0.0008948281,"about_ca_topic_score_gemma":0.00036655384,"teacher_disagreement_score":0.80117583,"about_ca_system_score_codex":0.00020283216,"about_ca_system_score_gemma":0.0004525989,"threshold_uncertainty_score":0.99995464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071813814,0.0013986498,0.8985595,0.008397289,0.0030226617,0.00095663033,0.000026543157,0.00086747954,0.014957441],"genre_scores_gemma":[0.925041,0.000060265367,0.0031149467,0.0074753026,0.00045798265,0.00021765562,0.00016279233,0.000054606677,0.063415416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959997,0.00033072828,0.0004220416,0.0015370261,0.0011597518,0.0005507828],"domain_scores_gemma":[0.996582,0.00024332604,0.00011771396,0.0018230935,0.0009286923,0.00030522767],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087110454,0.00051243044,0.0005574537,0.00019984356,0.000316093,0.0015629409,0.0017877124,0.00036132065,0.00012278363],"category_scores_gemma":[0.00015708676,0.0004585913,0.0003131574,0.00033030126,0.000027033206,0.00018752416,0.0038297353,0.0017641847,0.00012518858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031742475,0.0001198071,0.000035768524,0.000020605205,0.0001044747,0.00017934256,0.0039062111,0.8684276,0.000041598796,0.0008756122,0.08420762,0.042049624],"study_design_scores_gemma":[0.0004618695,0.0004688277,0.00019841551,0.0007842284,0.000039587525,0.000033386674,0.0020346988,0.82527846,0.00019780599,0.000055714234,0.16892095,0.0015260527],"about_ca_topic_score_codex":0.00023950315,"about_ca_topic_score_gemma":0.00020251483,"teacher_disagreement_score":0.8954446,"about_ca_system_score_codex":0.00022532394,"about_ca_system_score_gemma":0.00022408126,"threshold_uncertainty_score":0.99978656},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5754651,0.00005574493,0.3621153,0.05799961,0.0009910621,0.000059066067,6.795422e-7,0.00022898865,0.0030844726],"genre_scores_gemma":[0.99575835,0.0000097387265,0.0010158118,0.0005813042,0.0010420334,0.0000020373252,1.7025982e-7,0.0000019483293,0.00158858],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996769,0.000032305397,0.000054497606,0.0000846155,0.00005819618,0.0000935291],"domain_scores_gemma":[0.99976563,0.000046044595,0.000011542328,0.00012853174,0.000022924973,0.000025317191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119337084,0.000038636823,0.00004575701,0.0000319095,0.00013744744,0.00007847416,0.00015408486,0.000014551601,0.000010254318],"category_scores_gemma":[0.0000039929505,0.000026008744,0.000013302486,0.00005599029,0.00001888652,0.00018208467,0.00013368478,0.000029364368,0.000027761045],"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.00001064476,0.00001806788,0.0011934852,0.0000029227383,0.000013232309,0.0000014242099,0.0028739762,0.0000032666874,0.005694088,0.061351612,0.07654778,0.8522895],"study_design_scores_gemma":[0.0021330537,0.0006167619,0.040041503,0.00016111128,0.000029708384,0.00015404599,0.0043191253,0.01833561,0.0029514162,0.015714262,0.91395444,0.0015889382],"about_ca_topic_score_codex":0.000070379894,"about_ca_topic_score_gemma":0.000040732317,"teacher_disagreement_score":0.85070056,"about_ca_system_score_codex":0.000010021123,"about_ca_system_score_gemma":0.000004524624,"threshold_uncertainty_score":0.10606058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4993672,0.030681767,0.4667663,0.00077353837,0.0012039231,0.00071795686,0.0000016421959,0.0001898515,0.00029782977],"genre_scores_gemma":[0.92898875,0.012911663,0.05461427,0.0032464813,0.00015918615,0.000026891985,0.000014100134,0.000015694592,0.000022984199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693555,0.0001817876,0.0007128837,0.0004726461,0.0012602108,0.0004368989],"domain_scores_gemma":[0.99690926,0.0008011669,0.0004433259,0.0011422358,0.00057872105,0.00012527061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009174989,0.00021143635,0.00031757387,0.0005205452,0.00039639467,0.0002198335,0.001193444,0.00006592227,0.000068645895],"category_scores_gemma":[0.005357318,0.00020181622,0.00013263115,0.0028983376,0.000024612375,0.0017804648,0.0003403173,0.00025197334,0.00008036083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058141554,0.00006685066,0.0016739774,0.00057281484,0.000040340536,0.0000063925113,0.00010343216,0.003704592,0.0019868365,0.0018614926,0.0013176384,0.9886598],"study_design_scores_gemma":[0.0011651452,0.0001559619,0.009033253,0.004818998,0.00034845324,0.000074639975,0.00001968486,0.96978414,0.0030159473,0.0011257638,0.00955731,0.00090070115],"about_ca_topic_score_codex":0.000038080285,"about_ca_topic_score_gemma":0.0000019956078,"teacher_disagreement_score":0.9877591,"about_ca_system_score_codex":0.00034675447,"about_ca_system_score_gemma":0.00018288441,"threshold_uncertainty_score":0.82298267},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015730977,0.00021655574,0.9744845,0.008169931,0.00021288358,0.00007839436,2.426806e-7,0.00006559826,0.0010409362],"genre_scores_gemma":[0.984251,0.0000053557005,0.006178133,0.00092812045,0.00017400195,0.000015215408,2.9238822e-7,0.0000018563384,0.008446005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999695,0.000010285687,0.000058113154,0.0001114707,0.00005559972,0.0000695211],"domain_scores_gemma":[0.999682,0.000074995725,0.000012424566,0.00019821705,0.000019109668,0.000013259281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014156007,0.00003354146,0.000028002169,0.000012149714,0.000052015508,0.00010604375,0.00028766497,0.000011286272,0.000013238937],"category_scores_gemma":[0.000012815496,0.000019942985,0.000036579306,0.000027840004,0.000006618199,0.00013217748,0.000029978028,0.000026346415,0.000043111544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003117477,0.000032859276,0.000015921125,0.0000015961692,0.000013888709,3.3233428e-7,0.0004880512,0.0015280838,0.0074455687,0.19328439,0.04546955,0.7517166],"study_design_scores_gemma":[0.00006370189,0.0000150894775,0.000022808115,0.0000013079953,0.0000025080994,0.000004390767,0.000007855671,0.95395255,0.0029430497,0.00007557905,0.042876832,0.000034302484],"about_ca_topic_score_codex":0.000026163334,"about_ca_topic_score_gemma":0.00005390449,"teacher_disagreement_score":0.96852005,"about_ca_system_score_codex":0.000010532355,"about_ca_system_score_gemma":0.0000067675333,"threshold_uncertainty_score":0.102258235},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29977027,0.0003398401,0.69864357,0.00023098015,0.0006662337,0.00012731054,0.00000282677,0.000039192146,0.00017974869],"genre_scores_gemma":[0.9936813,0.00006223363,0.004679222,0.00013236016,0.0000643984,0.000035487014,0.0000054503726,0.0000071063732,0.0013324026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990204,0.000049032227,0.00022814184,0.0004368733,0.00013918667,0.00012635006],"domain_scores_gemma":[0.99927145,0.00011949273,0.00013108045,0.0003908412,0.00005971543,0.000027421796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023785846,0.0001379143,0.00023663756,0.00011613385,0.000049001308,0.00030561475,0.00026980115,0.0001040687,0.0000019164486],"category_scores_gemma":[0.00002350769,0.00012388382,0.00017038046,0.00005380828,0.000015760601,0.00024953755,0.00093961006,0.0001533495,2.319425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019885384,0.00048689425,0.0019224462,0.0034627002,0.0011033996,0.000036399164,0.0072685587,0.0075637605,0.15007891,0.006650449,0.0020568746,0.8191708],"study_design_scores_gemma":[0.0017383754,0.00032069584,0.005858775,0.0012721039,0.00019083494,0.00007035429,0.001020619,0.9055458,0.076956876,0.0053530755,0.0005179571,0.0011545474],"about_ca_topic_score_codex":0.00018123831,"about_ca_topic_score_gemma":0.00006608814,"teacher_disagreement_score":0.897982,"about_ca_system_score_codex":0.000031659936,"about_ca_system_score_gemma":0.000040147333,"threshold_uncertainty_score":0.5051835},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083203847,0.0012646852,0.26517665,0.000027943886,0.0013731319,0.00015830481,0.0000044714075,0.00043044402,0.7307323],"genre_scores_gemma":[0.6423507,0.00007033006,0.0052224495,0.00020826251,0.00076298474,9.760685e-7,0.000013973381,0.00005207236,0.35131824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998732,0.000027783564,0.00038112834,0.00044622552,0.00022671244,0.00018618256],"domain_scores_gemma":[0.99889076,0.000085171814,0.00030069053,0.0004979229,0.00015042357,0.00007505086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033744477,0.00025957264,0.0004195606,0.00014893725,0.0000999401,0.000113693575,0.00056669884,0.00018587662,0.00001786567],"category_scores_gemma":[0.0000049224645,0.00021721626,0.00010678412,0.000035792596,0.00008473551,0.000081540544,0.00046223876,0.0002851677,0.000028152162],"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.000009317993,0.0000102834865,0.000095874595,0.00023483229,0.00019642273,0.00004717154,0.00050755026,0.00003975786,0.000051016657,0.9184016,0.010146364,0.07025982],"study_design_scores_gemma":[0.0005841612,0.00036496777,0.00003259738,0.0052357535,0.00011101179,0.00030041073,0.00011360406,0.85098183,0.0000415885,0.003529308,0.13755116,0.0011536002],"about_ca_topic_score_codex":0.0002445353,"about_ca_topic_score_gemma":0.00003175593,"teacher_disagreement_score":0.9148723,"about_ca_system_score_codex":0.00004988087,"about_ca_system_score_gemma":0.00005138416,"threshold_uncertainty_score":0.8857822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46440452,0.00010526935,0.532737,0.0002088827,0.000523201,0.0004899798,0.0000026308187,0.00025517258,0.0012733309],"genre_scores_gemma":[0.99700165,0.0000063389525,0.0014835035,0.00015187165,0.000055397533,0.000090113084,0.0000013836992,0.0000042192246,0.0012055108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991642,0.000034457073,0.00013466229,0.0003369641,0.00015229445,0.00017741117],"domain_scores_gemma":[0.9992333,0.00008506364,0.000041027648,0.00042130548,0.00015892177,0.0000603762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001831875,0.00008215474,0.00012541568,0.00003784958,0.00016824681,0.000051855804,0.00026972604,0.000036740064,0.0000011623355],"category_scores_gemma":[0.000045626086,0.000064291286,0.000077046134,0.00010191125,0.000024662193,0.00032207946,0.000086808395,0.000057671397,0.000022701317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092584407,0.003951811,0.006389782,0.00063994416,0.00040645627,0.00038249604,0.009388347,0.005133639,0.23566623,0.32694045,0.1251831,0.2849919],"study_design_scores_gemma":[0.00083413755,0.0003480893,0.008247505,0.000040925057,0.00000825308,0.00022441336,0.00017077613,0.97776,0.006847301,0.0008808596,0.0042531765,0.00038456894],"about_ca_topic_score_codex":0.00020418533,"about_ca_topic_score_gemma":0.000005447748,"teacher_disagreement_score":0.9726263,"about_ca_system_score_codex":0.00004142604,"about_ca_system_score_gemma":0.00004950753,"threshold_uncertainty_score":0.26217225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15980826,0.00011611491,0.833843,0.0019992723,0.0005726003,0.0017719603,0.00014036385,0.0011420944,0.00060636835],"genre_scores_gemma":[0.91423994,0.00012943054,0.07379769,0.001009986,0.00021897435,0.00084579166,0.0009798333,0.0000980653,0.008680288],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950952,0.0007903122,0.0011550497,0.001223353,0.0007047025,0.0010313974],"domain_scores_gemma":[0.99536395,0.000979442,0.0005862001,0.0013356133,0.001381102,0.0003537145],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014927257,0.00064710504,0.0006054661,0.00061117904,0.00047292927,0.001366091,0.0010846882,0.00027097252,0.00058524136],"category_scores_gemma":[0.0017983256,0.0006389286,0.00018583908,0.00090440485,0.00012501652,0.0022086024,0.00032281896,0.0004614051,0.00552087],"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.00020474952,0.0032253684,0.0033562959,0.00061798777,0.0002002614,0.000053390264,0.012838927,0.0020567973,0.5428817,0.03502452,0.343393,0.05614699],"study_design_scores_gemma":[0.0074732807,0.00072219834,0.029839445,0.0011635852,0.00012230064,0.00018409932,0.00024399658,0.4368204,0.00531118,0.010047735,0.503778,0.0042937933],"about_ca_topic_score_codex":0.0006228612,"about_ca_topic_score_gemma":0.0010834887,"teacher_disagreement_score":0.7600453,"about_ca_system_score_codex":0.00012211708,"about_ca_system_score_gemma":0.00032384545,"threshold_uncertainty_score":0.99967057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8598673,0.003076634,0.11034979,0.0005938569,0.003801587,0.0012145119,0.000038143153,0.0015124605,0.01954573],"genre_scores_gemma":[0.98085487,0.00007477052,0.0029655006,0.00022243879,0.00016977689,0.0000851653,0.00015588803,0.00003168065,0.015439935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986432,0.000043006108,0.0002928056,0.00054661947,0.00023319227,0.00024114056],"domain_scores_gemma":[0.9989396,0.00016296843,0.00020491988,0.0004477828,0.00016741495,0.00007732599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002088359,0.00025444472,0.000319771,0.00013916609,0.00042541983,0.00035148425,0.0005700496,0.00017413133,5.228791e-7],"category_scores_gemma":[0.000035414807,0.00023459463,0.00009995437,0.00014714542,0.000007218541,0.0003709671,0.000075043135,0.0002225921,0.000004228084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017519955,0.00045183644,0.0018870183,0.04254247,0.0019676976,0.0005288735,0.118697345,0.0021066056,0.047850735,0.4478363,0.059115745,0.27526337],"study_design_scores_gemma":[0.0031329088,0.00035940073,0.0027610706,0.0052989223,0.00029712907,0.0008379476,0.013022483,0.9465881,0.002085075,0.0007123936,0.021804277,0.003100302],"about_ca_topic_score_codex":0.0013998448,"about_ca_topic_score_gemma":0.0011923569,"teacher_disagreement_score":0.9444815,"about_ca_system_score_codex":0.00006112552,"about_ca_system_score_gemma":0.00018790035,"threshold_uncertainty_score":0.9566491},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007213223,0.0004126365,0.7117249,0.0003092246,0.0036595727,0.00034261172,0.000001497369,0.00042893444,0.2823993],"genre_scores_gemma":[0.31628573,0.00039720762,0.33992624,0.005289869,0.002575231,0.00007250063,0.000006150443,0.00022014324,0.33522695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601334,0.000018954883,0.0005441446,0.0015908205,0.0010781863,0.000754561],"domain_scores_gemma":[0.99737084,0.00011455459,0.00024291627,0.001806534,0.00022008693,0.00024504057],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00094029086,0.00046740135,0.00046778942,0.00086940394,0.0002666804,0.0010340082,0.0046498533,0.00019531958,0.00009586441],"category_scores_gemma":[0.000025385203,0.0004790431,0.00016654775,0.0003541803,0.0004883083,0.0013225826,0.0027614909,0.0007586547,0.00083802163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011495663,0.000018923256,0.00003308671,0.000022777549,0.000009606365,0.00016031391,0.00021246256,0.00039607912,0.00019492145,0.63900477,0.00050119584,0.35944474],"study_design_scores_gemma":[0.0006008248,0.00022022372,0.000986618,0.0012530234,0.000012704579,0.00022950595,0.000002112354,0.8776738,0.0002680683,0.06585841,0.05057697,0.0023177592],"about_ca_topic_score_codex":0.0001099882,"about_ca_topic_score_gemma":0.00001987984,"teacher_disagreement_score":0.8772777,"about_ca_system_score_codex":0.0003436423,"about_ca_system_score_gemma":0.0004146331,"threshold_uncertainty_score":0.9999399},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033807144,0.0006231093,0.9591924,0.00073485915,0.0036719376,0.00056482205,0.000006816492,0.0003905762,0.0010083556],"genre_scores_gemma":[0.834983,0.000019157946,0.16165525,0.0020688202,0.00043197436,0.00014532436,0.00009215908,0.0000319215,0.000572394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713016,0.00013907002,0.0005130304,0.0011427408,0.00053595495,0.0005390571],"domain_scores_gemma":[0.9972159,0.00075200846,0.00022124394,0.0014753508,0.00018231402,0.00015318459],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011419542,0.00039841532,0.00047947236,0.00011842667,0.00033303315,0.0010823027,0.0015612459,0.0002677982,0.000027024244],"category_scores_gemma":[0.00006130984,0.00036840758,0.00048371582,0.00015571603,0.000015122656,0.00016485335,0.0011357977,0.0006724963,0.000012594701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029816922,0.000073672796,0.00007218198,0.000095466276,0.00006538948,0.000023728473,0.00028494452,0.9742645,0.000072927614,0.0030823767,0.0045383894,0.01739659],"study_design_scores_gemma":[0.00074628944,0.00007040326,0.000094180155,0.00079007546,0.00004175329,0.0000072357034,0.00009764271,0.9871944,0.00022760296,0.008731724,0.0013441648,0.00065453263],"about_ca_topic_score_codex":0.0008948281,"about_ca_topic_score_gemma":0.00036655384,"teacher_disagreement_score":0.80117583,"about_ca_system_score_codex":0.00020283216,"about_ca_system_score_gemma":0.0004525989,"threshold_uncertainty_score":0.99995464},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009339857,0.00015432353,0.11914842,0.0001901734,0.0006311874,0.000042383737,0.0000012568829,0.0002966,0.8795263],"genre_scores_gemma":[0.003192584,0.000021305223,0.0016130868,0.00087701285,0.00032676992,8.117884e-7,0.0000026215187,0.000015515128,0.9939503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914587,0.0000056427443,0.00013934738,0.00035835098,0.00021040931,0.00014036],"domain_scores_gemma":[0.9991389,0.000031102012,0.00006405759,0.00064941915,0.00005503361,0.0000614709],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011427384,0.00016916847,0.00015681979,0.00009385415,0.000080503254,0.00013765396,0.0007692674,0.000128317,0.0005746828],"category_scores_gemma":[0.000004968053,0.00014656836,0.00012565526,0.00001063706,0.000027826669,0.00014066734,0.00033244016,0.00021413885,0.002427274],"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":[7.864577e-7,0.0000025967074,8.5967196e-7,0.0000044441695,0.000025041665,0.000027589556,0.000057662997,0.0000020744144,0.00001909985,0.9342952,0.047987215,0.017577453],"study_design_scores_gemma":[0.000108219705,0.00007280079,0.000002689418,0.00011287748,0.000014471123,0.000047534268,0.0000017052689,0.006688651,0.000020122947,0.090628356,0.90180516,0.00049740565],"about_ca_topic_score_codex":0.000033880042,"about_ca_topic_score_gemma":0.000016715738,"teacher_disagreement_score":0.85381794,"about_ca_system_score_codex":0.00003089403,"about_ca_system_score_gemma":0.0000410794,"threshold_uncertainty_score":0.9983494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47240874,0.000023293313,0.434503,0.00016825204,0.00031476573,0.00009427244,4.6566544e-7,0.0003236016,0.09216362],"genre_scores_gemma":[0.99659884,0.0000063910034,0.0006221593,0.0011276781,0.000040839073,0.0000047102067,6.6411354e-7,0.0000055723394,0.0015931225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991342,0.0000070152573,0.00013338745,0.0003135918,0.00020582518,0.00020599503],"domain_scores_gemma":[0.99930155,0.000072932744,0.000031994834,0.0004992674,0.000018936205,0.00007530498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026515295,0.00009563091,0.00010212403,0.000070671544,0.00011853528,0.00018064678,0.0005409487,0.00003578565,0.00001988995],"category_scores_gemma":[0.000015542915,0.00007073652,0.000054603443,0.000116001116,0.000015765892,0.000314476,0.0001887013,0.00011267586,0.00015730178],"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.000013496944,0.000050131322,0.0006312995,0.000006867562,0.000011816657,0.000005911206,0.00032411958,0.0008610755,0.000613599,0.9638239,0.0009568359,0.032700934],"study_design_scores_gemma":[0.0014821152,0.0009912685,0.0010402927,0.00011382468,0.00000791067,0.000025018373,0.00047983814,0.9043415,0.002373929,0.07107634,0.017385585,0.00068236736],"about_ca_topic_score_codex":0.000060103386,"about_ca_topic_score_gemma":0.000028549239,"teacher_disagreement_score":0.9034804,"about_ca_system_score_codex":0.000051422456,"about_ca_system_score_gemma":0.000013110718,"threshold_uncertainty_score":0.28845516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19440946,0.00007402773,0.45227566,0.0061943326,0.00047344802,0.00039749726,6.2503304e-8,0.0022922717,0.34388325],"genre_scores_gemma":[0.97462153,8.6512796e-7,0.019369043,0.00060332444,0.00001579084,0.00002662988,1.0896053e-7,0.0000010222244,0.0053616934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997486,0.000005520756,0.000034070035,0.00008029354,0.000053773623,0.00007775593],"domain_scores_gemma":[0.9997687,0.000007426364,0.0000055341548,0.00016792899,0.00002110239,0.00002933927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000023060269,0.000024216468,0.000023134175,0.000013930756,0.000021896847,0.00013798855,0.00023278015,0.000008386612,0.00006430475],"category_scores_gemma":[0.0000028685818,0.000017604505,0.00001809749,0.00005578724,0.000004715199,0.00023306954,0.000059534737,0.000023848768,0.0011404676],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.23802e-8,0.000034787903,0.00042732598,7.3555213e-7,0.0000023963753,0.0000011795548,0.000028716402,9.876255e-7,0.00064566365,0.087398894,0.020352663,0.8911066],"study_design_scores_gemma":[0.00042816385,0.00029728867,0.026974462,0.000011131853,0.0000026331838,0.000035390618,0.000056951165,0.8484262,0.001109261,0.020245366,0.10196765,0.00044548142],"about_ca_topic_score_codex":0.0001666856,"about_ca_topic_score_gemma":0.0000015852158,"teacher_disagreement_score":0.8906611,"about_ca_system_score_codex":0.0000029580433,"about_ca_system_score_gemma":0.0000047575004,"threshold_uncertainty_score":0.99963725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27298123,0.00014589653,0.6619402,0.001545616,0.00039855024,0.000092333146,0.0000027731546,0.000512748,0.06238066],"genre_scores_gemma":[0.98571485,0.0000011354077,0.005118677,0.0012789894,0.00013756947,0.0000043194623,0.0000026441983,0.000008074988,0.0077337525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989586,0.000026057758,0.00016399886,0.00032267894,0.00024027155,0.00028841087],"domain_scores_gemma":[0.99939454,0.000053846812,0.0000444909,0.00041631874,0.00004704623,0.000043784974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012942133,0.00012838669,0.0001138776,0.00007948871,0.00011726163,0.000268955,0.0005342739,0.00004457685,0.0000620085],"category_scores_gemma":[0.00000974928,0.000104459075,0.000089182475,0.00018013467,0.000023661833,0.00019362828,0.00018219434,0.00016046561,0.00014912983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062893065,0.0011758609,0.016131707,0.00012985099,0.00017201553,0.00070820673,0.0026321302,0.011454867,0.12499958,0.2850098,0.26017997,0.2973431],"study_design_scores_gemma":[0.005421393,0.00054178893,0.035224307,0.00046337687,0.00006439679,0.00083911046,0.00030816387,0.6806533,0.020616973,0.032908265,0.21894711,0.004011874],"about_ca_topic_score_codex":0.0005066694,"about_ca_topic_score_gemma":0.000089755085,"teacher_disagreement_score":0.7127336,"about_ca_system_score_codex":0.000016541526,"about_ca_system_score_gemma":0.00002447704,"threshold_uncertainty_score":0.42597175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027663747,0.00015870154,0.9684927,0.00090490706,0.0003061083,0.000064741886,0.0000038685794,0.00031230948,0.0020929289],"genre_scores_gemma":[0.9935898,0.0000033798642,0.005468817,0.00028579263,0.00052159786,0.000024985524,0.000018380619,0.0000038101336,0.00008344714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993148,0.00002637123,0.00012120172,0.00014519594,0.00015868626,0.00023373502],"domain_scores_gemma":[0.999491,0.00010849674,0.000032192547,0.00022178948,0.00004896436,0.00009758568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002110971,0.0000698446,0.00007876861,0.00003232517,0.00023087392,0.00007713977,0.00041475476,0.00004669351,0.00001887938],"category_scores_gemma":[0.000026108333,0.00006372584,0.00005580606,0.00022060167,0.000024266106,0.00027735898,0.00016773632,0.00009162999,0.00021199966],"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.00000368923,0.0001923398,0.0020797155,0.0000112553225,0.000030577106,0.0000012017483,0.004159238,0.00001893069,0.0031770892,0.74944824,0.012821848,0.22805591],"study_design_scores_gemma":[0.0033321138,0.000077976445,0.08773239,0.000056333258,0.0001732445,0.00010828013,0.003899201,0.19177008,0.0093481345,0.09495821,0.6048578,0.0036862358],"about_ca_topic_score_codex":0.000059822236,"about_ca_topic_score_gemma":0.000009438529,"teacher_disagreement_score":0.96592605,"about_ca_system_score_codex":0.00003654223,"about_ca_system_score_gemma":0.000019961599,"threshold_uncertainty_score":0.27248976},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012687749,0.000027933134,0.9484545,0.0045417626,0.00015189491,0.000013184527,1.307012e-7,0.00020885988,0.03391397],"genre_scores_gemma":[0.98234075,0.0000038762605,0.0024330083,0.00047643948,0.000022179443,0.0000010904067,1.7922877e-8,0.0000010953896,0.014721567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971485,0.000009014579,0.000036882953,0.00009930341,0.00006371167,0.000076236895],"domain_scores_gemma":[0.9997038,0.00003255558,0.000006955703,0.00021615466,0.000012692229,0.000027826487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055473112,0.000026760837,0.000026276966,0.000016785065,0.000020433332,0.000023024642,0.00026683405,0.00000971244,0.00003772293],"category_scores_gemma":[0.000009526385,0.000013380869,0.000022047247,0.00003922615,0.000006443667,0.00017335343,0.00006951971,0.000012139369,0.00045272656],"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.0000010946189,0.0000131502675,0.0006924789,3.8976887e-7,0.0000046695613,0.0000065882623,0.000027210965,4.2960895e-7,0.021261685,0.49117497,0.012498484,0.47431883],"study_design_scores_gemma":[0.0052345395,0.00067913777,0.032699943,0.00019281027,0.000018760116,0.00026349572,0.000093663286,0.077377535,0.079584114,0.116756596,0.68486184,0.0022375644],"about_ca_topic_score_codex":0.000015772592,"about_ca_topic_score_gemma":0.0000029163182,"teacher_disagreement_score":0.96965295,"about_ca_system_score_codex":0.000007011214,"about_ca_system_score_gemma":0.000008546446,"threshold_uncertainty_score":0.58190346},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3367885,0.0041520437,0.5840671,0.0072402935,0.003264393,0.047321808,0.00017426249,0.0036479516,0.013343661],"genre_scores_gemma":[0.9806489,0.00007871499,0.0027755897,0.0014628557,0.00010187171,0.0039628074,0.0003972494,0.00008458697,0.010487467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995122,0.00044040027,0.00095440226,0.0015545033,0.0009921325,0.0009365453],"domain_scores_gemma":[0.996844,0.00025034152,0.0005254835,0.0014967358,0.00041984773,0.0004636015],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005220364,0.0008368366,0.00089224614,0.00030830372,0.00064151065,0.0013666888,0.0030257576,0.0005000822,0.000152501],"category_scores_gemma":[0.00027202637,0.00079712534,0.0006275608,0.00081161427,0.00009278372,0.00043979057,0.0005700668,0.0010907357,0.00060699997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036640286,0.0075298743,0.019580955,0.008351024,0.0032977199,0.0033795552,0.1457334,0.0037638396,0.16984914,0.07590226,0.018618181,0.54033],"study_design_scores_gemma":[0.0017338246,0.0013024771,0.0026081495,0.0017680428,0.00024545952,0.00007603094,0.010133004,0.9642364,0.009763048,0.00034991722,0.0057108887,0.0020727878],"about_ca_topic_score_codex":0.0006179015,"about_ca_topic_score_gemma":0.00012259887,"teacher_disagreement_score":0.9604725,"about_ca_system_score_codex":0.00019863887,"about_ca_system_score_gemma":0.0006256242,"threshold_uncertainty_score":0.99966997},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29977027,0.0003398401,0.69864357,0.00023098015,0.0006662337,0.00012731054,0.00000282677,0.000039192146,0.00017974869],"genre_scores_gemma":[0.9936813,0.00006223363,0.004679222,0.00013236016,0.0000643984,0.000035487014,0.0000054503726,0.0000071063732,0.0013324026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990204,0.000049032227,0.00022814184,0.0004368733,0.00013918667,0.00012635006],"domain_scores_gemma":[0.99927145,0.00011949273,0.00013108045,0.0003908412,0.00005971543,0.000027421796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023785846,0.0001379143,0.00023663756,0.00011613385,0.000049001308,0.00030561475,0.00026980115,0.0001040687,0.0000019164486],"category_scores_gemma":[0.00002350769,0.00012388382,0.00017038046,0.00005380828,0.000015760601,0.00024953755,0.00093961006,0.0001533495,2.319425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019885384,0.00048689425,0.0019224462,0.0034627002,0.0011033996,0.000036399164,0.0072685587,0.0075637605,0.15007891,0.006650449,0.0020568746,0.8191708],"study_design_scores_gemma":[0.0017383754,0.00032069584,0.005858775,0.0012721039,0.00019083494,0.00007035429,0.001020619,0.9055458,0.076956876,0.0053530755,0.0005179571,0.0011545474],"about_ca_topic_score_codex":0.00018123831,"about_ca_topic_score_gemma":0.00006608814,"teacher_disagreement_score":0.897982,"about_ca_system_score_codex":0.000031659936,"about_ca_system_score_gemma":0.000040147333,"threshold_uncertainty_score":0.5051835},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97940505,0.00027414013,0.011658885,0.000013664875,0.0016794939,0.000313089,6.866103e-7,0.0000440718,0.0066108988],"genre_scores_gemma":[0.9968947,0.000048446942,0.00042724985,0.0001553973,0.000045677476,0.000017667246,0.000076633754,0.000014273849,0.002319939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984574,0.000055645894,0.00047368155,0.00040391088,0.00026589973,0.00034346295],"domain_scores_gemma":[0.9991218,0.00008627398,0.0002352633,0.0004739551,0.000051720053,0.00003097609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045976706,0.0002088329,0.00035764862,0.00025867816,0.00003159808,0.000046255667,0.0007337175,0.00019152668,0.000007035753],"category_scores_gemma":[0.000007758523,0.00020340658,0.000088053974,0.00042629262,0.00000629313,0.0002179575,0.00004306199,0.00046132426,0.000007868176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011429018,0.00013889816,0.136768,0.0003432302,0.000023736706,0.000010645202,0.0005049078,0.788938,0.0003074171,0.0006786361,0.00019010149,0.07198216],"study_design_scores_gemma":[0.00051276694,0.00007299078,0.04820038,0.0006565937,0.0000042221686,1.9857364e-7,0.000041649524,0.95016545,0.00009207204,0.000018039897,0.000016088019,0.00021952638],"about_ca_topic_score_codex":0.0010226849,"about_ca_topic_score_gemma":0.0014115681,"teacher_disagreement_score":0.1612275,"about_ca_system_score_codex":0.000080542086,"about_ca_system_score_gemma":0.00013312741,"threshold_uncertainty_score":0.82946795},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014843531,0.5291915,0.42486256,0.035497118,0.0010079943,0.0006233098,0.0000016963565,0.00085311517,0.006478354],"genre_scores_gemma":[0.56850535,0.123074755,0.2659744,0.04164191,0.000294772,0.00010759293,0.00003931324,0.000032055777,0.000329857],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826974,0.0005639727,0.00039681778,0.00020813539,0.00024096036,0.00032038568],"domain_scores_gemma":[0.9941892,0.0004892497,0.00016654182,0.004885778,0.000114034316,0.00015518804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001059803,0.0001765105,0.0003077602,0.00006149423,0.00021741264,0.00011234593,0.0045771953,0.00004352944,0.00003704633],"category_scores_gemma":[0.00011683289,0.00015866072,0.00015965088,0.000352167,0.000036816567,0.0008413069,0.0025655897,0.00027015497,0.000626165],"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.0000012804367,0.00033036844,0.0020288732,0.00044696094,0.000064550666,0.0000016952935,0.0005017605,0.000008992636,0.000057372126,0.08792411,0.15136863,0.7572654],"study_design_scores_gemma":[0.00034559704,0.00005196503,0.0036923382,0.002365137,0.00005730099,0.00014302155,0.000007282284,0.014323966,0.000029007731,0.001454736,0.9769259,0.00060372584],"about_ca_topic_score_codex":0.000025652344,"about_ca_topic_score_gemma":0.0000013648081,"teacher_disagreement_score":0.8255573,"about_ca_system_score_codex":0.000052933174,"about_ca_system_score_gemma":0.000028045264,"threshold_uncertainty_score":0.85056436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8508254,0.00016165423,0.14579271,0.00041269133,0.00006535924,0.00009034184,3.987783e-7,0.00006413254,0.0025873086],"genre_scores_gemma":[0.9933702,0.000025571124,0.0041647027,0.00047139626,0.00002803987,0.000015320027,0.0000024600167,0.0000025292616,0.0019198313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999448,0.00002412812,0.000107852575,0.00017881124,0.00012447542,0.00011672923],"domain_scores_gemma":[0.9997016,0.000017220063,0.000020340785,0.00022813384,0.00000323096,0.000029484208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012837394,0.000054802156,0.000054468936,0.00005589097,0.00002677252,0.000051183328,0.00026247973,0.0000146215725,0.00004272456],"category_scores_gemma":[0.0000060456077,0.000050683084,0.000022497155,0.000053647185,0.000008552391,0.00043543256,0.000101585094,0.000060838174,0.0002833734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007670193,0.0004501162,0.0114424685,0.000005946147,0.000017090804,0.000025129797,0.00061680865,0.0076595754,0.048532784,0.01618966,0.0038713394,0.9111814],"study_design_scores_gemma":[0.0013843504,0.00011644561,0.0064238883,0.000027416218,0.000005325297,0.000030089295,0.00008463256,0.5878603,0.15141682,0.0009325635,0.25115132,0.00056690275],"about_ca_topic_score_codex":0.000046504614,"about_ca_topic_score_gemma":0.000013588563,"teacher_disagreement_score":0.9106145,"about_ca_system_score_codex":0.00004965876,"about_ca_system_score_gemma":0.000009420638,"threshold_uncertainty_score":0.36422864},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002332061,0.006946757,0.062419757,0.00006286746,0.0009720941,0.00048574863,0.00012693256,0.00028078447,0.926373],"genre_scores_gemma":[0.9830949,0.00023934174,0.0006163038,0.0006602062,0.00019247449,0.00000894555,0.000022395237,0.00004280777,0.015122675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977638,0.00006887383,0.00040117165,0.0010903116,0.0002740108,0.00040182535],"domain_scores_gemma":[0.99807006,0.000069642396,0.00019518925,0.0014473265,0.00006125345,0.00015653156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035402225,0.00045495832,0.00051290024,0.00008800361,0.00016350478,0.00033359305,0.0018062587,0.00032739923,0.0000029509674],"category_scores_gemma":[0.000013029416,0.00044330923,0.00006825626,0.000026752059,0.00008547098,0.0003630085,0.002189324,0.0007717441,0.000015921589],"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.000027656037,0.0000094105435,0.000041304833,0.000016073016,0.00006417958,0.0001885669,0.00034207074,0.00006421793,0.000006052631,0.8729365,0.00035237172,0.1259516],"study_design_scores_gemma":[0.005724743,0.001102729,0.0008491711,0.008896238,0.0004624183,0.0012583621,0.000157551,0.44874698,0.000020268017,0.47379196,0.050576113,0.008413469],"about_ca_topic_score_codex":0.00041920485,"about_ca_topic_score_gemma":0.0013802241,"teacher_disagreement_score":0.9807628,"about_ca_system_score_codex":0.00013155499,"about_ca_system_score_gemma":0.00015655387,"threshold_uncertainty_score":0.9998019},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08509234,0.000034962155,0.9092719,0.00022607311,0.0011759874,0.00023664476,0.0000016517495,0.00031226486,0.0036481568],"genre_scores_gemma":[0.9844823,0.000002050495,0.013839065,0.0011679684,0.00045415922,0.00000901489,0.0000026990526,0.000008644293,0.000034118693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972232,0.000027489405,0.0003273816,0.0006142605,0.0010043669,0.00080331846],"domain_scores_gemma":[0.9982758,0.00003857321,0.00019625115,0.0009474293,0.00032019615,0.00022174261],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008457215,0.00022183442,0.00018060546,0.00046885197,0.0010643591,0.0016794687,0.0026330731,0.000078022014,0.0000071760396],"category_scores_gemma":[0.000055350563,0.0002036098,0.000059204114,0.0020593752,0.00038419856,0.0018151108,0.00113736,0.00030529647,0.000069277194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048962127,0.0000950064,0.0006819098,0.000040936447,0.000020342626,0.0000103126395,0.013817693,0.018429592,0.086135775,0.016382242,0.0019675193,0.8623697],"study_design_scores_gemma":[0.0002363511,0.000025716383,0.00030612975,0.00002516226,0.0000050497983,0.0000257773,0.000052968437,0.9912293,0.0010859305,0.0041285134,0.0025978605,0.00028124245],"about_ca_topic_score_codex":0.000054056098,"about_ca_topic_score_gemma":0.000008772136,"teacher_disagreement_score":0.9727997,"about_ca_system_score_codex":0.0001929583,"about_ca_system_score_gemma":0.00030747172,"threshold_uncertainty_score":0.99935687},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071813814,0.0013986498,0.8985595,0.008397289,0.0030226617,0.00095663033,0.000026543157,0.00086747954,0.014957441],"genre_scores_gemma":[0.925041,0.000060265367,0.0031149467,0.0074753026,0.00045798265,0.00021765562,0.00016279233,0.000054606677,0.063415416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959997,0.00033072828,0.0004220416,0.0015370261,0.0011597518,0.0005507828],"domain_scores_gemma":[0.996582,0.00024332604,0.00011771396,0.0018230935,0.0009286923,0.00030522767],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00087110454,0.00051243044,0.0005574537,0.00019984356,0.000316093,0.0015629409,0.0017877124,0.00036132065,0.00012278363],"category_scores_gemma":[0.00015708676,0.0004585913,0.0003131574,0.00033030126,0.000027033206,0.00018752416,0.0038297353,0.0017641847,0.00012518858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031742475,0.0001198071,0.000035768524,0.000020605205,0.0001044747,0.00017934256,0.0039062111,0.8684276,0.000041598796,0.0008756122,0.08420762,0.042049624],"study_design_scores_gemma":[0.0004618695,0.0004688277,0.00019841551,0.0007842284,0.000039587525,0.000033386674,0.0020346988,0.82527846,0.00019780599,0.000055714234,0.16892095,0.0015260527],"about_ca_topic_score_codex":0.00023950315,"about_ca_topic_score_gemma":0.00020251483,"teacher_disagreement_score":0.8954446,"about_ca_system_score_codex":0.00022532394,"about_ca_system_score_gemma":0.00022408126,"threshold_uncertainty_score":0.99978656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43375504,0.0007866939,0.5643803,0.00013958498,0.00035883937,0.0002977547,0.0000022258898,0.000092054026,0.00018754585],"genre_scores_gemma":[0.99643207,0.0012281258,0.001152272,0.00023646522,0.000044161203,0.0000021068117,0.000034022592,0.000018540431,0.00085225276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720937,0.00032370814,0.0004002273,0.0014135601,0.00015333391,0.0004997786],"domain_scores_gemma":[0.99833506,0.00009317664,0.0002316378,0.0009225558,0.00014150183,0.0002760915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004670419,0.00041405423,0.0005598606,0.00031679822,0.00014446578,0.0002657523,0.0007872083,0.00034376545,0.000024387067],"category_scores_gemma":[0.000019297086,0.00046587866,0.0002559413,0.0004634531,0.00007147376,0.0003115894,0.0018412805,0.00091505155,0.0000057538937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035902305,0.0008083121,0.0076281494,0.00040249957,0.00033949458,0.004910756,0.0013814397,0.95723367,0.0050163134,0.016752198,0.00046892828,0.0046992246],"study_design_scores_gemma":[0.0020122963,0.000058240803,0.0006020175,0.0005289761,0.000050670067,0.000008762208,0.00033153058,0.9950167,0.0003739844,0.00038215404,0.000115715164,0.0005189428],"about_ca_topic_score_codex":0.0004916324,"about_ca_topic_score_gemma":0.00006604587,"teacher_disagreement_score":0.563228,"about_ca_system_score_codex":0.0003313826,"about_ca_system_score_gemma":0.00016118496,"threshold_uncertainty_score":0.9997793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3328035,0.000082870145,0.66537565,0.0001189413,0.00074845273,0.00041514004,0.00012446455,0.00022906555,0.000101906975],"genre_scores_gemma":[0.9989011,0.000036185822,0.00042910126,0.000051715906,0.00008810581,0.0000043603773,0.00011943691,0.0000197612,0.00035017767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978191,0.00017230993,0.00028585645,0.001190201,0.00010251398,0.00042999044],"domain_scores_gemma":[0.9984647,0.00015617801,0.00024671198,0.0008175121,0.00012516952,0.00018973861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000314077,0.00033140645,0.00049038697,0.00022225853,0.00014653878,0.00023646382,0.0017515908,0.00026505018,0.0000021435524],"category_scores_gemma":[0.000067017536,0.00039805652,0.00026551777,0.00045688936,0.000039696948,0.00034003734,0.0013448606,0.00072250055,0.000022760105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055617737,0.00006439887,0.00075024005,0.00017846152,0.000056424105,0.00051973946,0.00018734267,0.9693958,0.000106071115,0.028375627,0.00026324796,0.000047021542],"study_design_scores_gemma":[0.0007805408,0.00005473305,0.00037601494,0.00022975165,0.000037386904,0.000003716445,0.00009154315,0.9965218,0.000014807432,0.0013218507,0.00013619871,0.00043169147],"about_ca_topic_score_codex":0.00082448,"about_ca_topic_score_gemma":0.000038417005,"teacher_disagreement_score":0.66609764,"about_ca_system_score_codex":0.0003765023,"about_ca_system_score_gemma":0.00021594502,"threshold_uncertainty_score":0.9998471},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34224746,0.000040635397,0.6561421,0.00014653194,0.00043813942,0.00046427493,0.000013862568,0.00024346342,0.0002635272],"genre_scores_gemma":[0.9983282,0.00005818734,0.0005635135,0.00038390886,0.00025789608,0.000008095767,0.000063566935,0.00004242578,0.00029417058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726295,0.00009736826,0.0002444876,0.00166374,0.00015235571,0.00057910406],"domain_scores_gemma":[0.9977831,0.00022128366,0.00032732895,0.0011164706,0.00025046803,0.00030131973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000265327,0.0004894138,0.0005508825,0.00019106972,0.00040641162,0.00052559463,0.003066635,0.00031385926,0.0000035825183],"category_scores_gemma":[0.000023353205,0.0005089932,0.00037363928,0.00046675617,0.00007977434,0.0007315614,0.0017189633,0.0010177298,0.000009915141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016360528,0.00006682446,0.0112936245,0.00013713779,0.00021491361,0.0005010118,0.00009744876,0.9774487,0.000052214597,0.009183422,0.0002954104,0.00054566876],"study_design_scores_gemma":[0.0011421097,0.00009563683,0.0011520563,0.00023298903,0.00011666093,0.000008522075,0.000025817902,0.9943501,0.000064536194,0.0019730804,0.00016964054,0.000668868],"about_ca_topic_score_codex":0.00067458866,"about_ca_topic_score_gemma":0.00018045917,"teacher_disagreement_score":0.6560808,"about_ca_system_score_codex":0.00016900107,"about_ca_system_score_gemma":0.0003039184,"threshold_uncertainty_score":0.9997362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057906248,0.0007803606,0.9349464,0.0045040026,0.00008466447,0.0013036072,0.00014774025,0.0002507562,0.00007617783],"genre_scores_gemma":[0.9098936,0.00027155154,0.08580213,0.00041226292,0.000022344984,0.003432284,0.000053697808,0.000020971778,0.00009119017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984454,0.00015273994,0.00045265915,0.0005194827,0.00014679166,0.00028291313],"domain_scores_gemma":[0.99615425,0.0014389786,0.00013095133,0.0020710393,0.00010112587,0.000103639],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00056368264,0.00018715815,0.0002102753,0.00032460943,0.0032244413,0.00025434027,0.0016703141,0.00005461929,0.000005888457],"category_scores_gemma":[0.000036370693,0.0002247538,0.000087743894,0.0005469032,0.00017234946,0.00028458092,0.0003779863,0.00055644725,0.000001932043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014002573,0.001171702,0.012143133,0.000044994504,0.00005558647,7.4385866e-7,0.0033721505,0.013625375,0.0021353965,0.017398499,0.000042710377,0.9499957],"study_design_scores_gemma":[0.002939994,0.0002581888,0.08371156,0.000093620525,0.00013055501,0.00013245112,0.0019558037,0.85407,0.00014346905,0.0056194006,0.049765658,0.0011792912],"about_ca_topic_score_codex":0.00030368127,"about_ca_topic_score_gemma":0.000096961165,"teacher_disagreement_score":0.9488164,"about_ca_system_score_codex":0.00009974385,"about_ca_system_score_gemma":0.00006707198,"threshold_uncertainty_score":0.9980732},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035164602,0.7681878,0.00080196635,0.0059450553,0.0023285758,0.0027829916,0.00023468788,0.00023055809,0.18432373],"genre_scores_gemma":[0.8830406,0.11621059,0.00024890545,0.000011372664,0.00001697983,0.00007239361,0.00007782985,0.000011670233,0.00030962427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.00012875309,0.00040519403,0.00024604148,0.00032776108,0.00016295005],"domain_scores_gemma":[0.9979046,0.0009452073,0.00024603182,0.00085943105,0.000012406199,0.000032296266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054668257,0.00018197743,0.0002536166,0.00009499555,0.0005256206,0.000018672217,0.000640166,0.000069127105,0.000002690138],"category_scores_gemma":[0.00006075903,0.00015516515,0.00006781243,0.000036859816,0.0005432639,0.000021126323,0.0018885714,0.0004413341,6.5515906e-7],"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.000022312868,0.000097276075,0.0020774307,0.00012755847,0.00058792374,0.00001073566,0.038516205,0.0006967819,0.00085402594,0.7432681,0.000041298368,0.21370037],"study_design_scores_gemma":[0.0034287493,0.0005562215,0.027079374,0.0024281645,0.0007409888,0.00009778134,0.033695146,0.056029283,0.00014985864,0.83147407,0.041147064,0.0031732868],"about_ca_topic_score_codex":0.00017234815,"about_ca_topic_score_gemma":0.00056011276,"teacher_disagreement_score":0.847876,"about_ca_system_score_codex":0.00021392661,"about_ca_system_score_gemma":0.000014871424,"threshold_uncertainty_score":0.63274515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4856666,0.008375827,0.44721285,0.004864703,0.0025416857,0.008124007,0.00018021434,0.0014979844,0.041536145],"genre_scores_gemma":[0.99811524,0.0000633227,0.00027280112,0.00007772459,0.00016563907,0.00065141096,0.0000737936,0.00003169427,0.0005483991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936632,0.0021034717,0.00036544108,0.001240687,0.0016221169,0.0010051145],"domain_scores_gemma":[0.997185,0.0007466979,0.00010792111,0.0014912382,0.00027378075,0.00019538878],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0037439084,0.0002952621,0.000382414,0.000944863,0.00043578437,0.0007545909,0.002564269,0.0002535057,0.00007514272],"category_scores_gemma":[0.00021226866,0.00030488695,0.00021575642,0.0010693147,0.000080058606,0.00022145717,0.003951089,0.0060543385,0.00001665112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009254875,0.00023935853,0.0023166887,0.00022076498,0.00004481488,0.00058425724,0.00060606154,0.96968496,0.00003279804,0.004366202,0.00082424295,0.020987317],"study_design_scores_gemma":[0.0003780982,0.00026381187,0.0035438556,0.00035380948,0.0000032295823,0.00000347734,0.0005468466,0.99241865,0.000016508668,0.001727035,0.00040157186,0.00034310622],"about_ca_topic_score_codex":0.0052255625,"about_ca_topic_score_gemma":0.00041374122,"teacher_disagreement_score":0.5124486,"about_ca_system_score_codex":0.0013282638,"about_ca_system_score_gemma":0.001874876,"threshold_uncertainty_score":0.99994034},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35203114,0.0002142687,0.6464669,0.00005778798,0.00074882514,0.0002877615,0.0000036732686,0.00016706048,0.000022553917],"genre_scores_gemma":[0.9952306,0.000027430267,0.00415349,0.0003346392,0.000036017373,0.000108598666,0.000001466761,0.000021121876,0.00008664921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978647,0.00034824133,0.0003986505,0.0006653922,0.00027715458,0.00044582877],"domain_scores_gemma":[0.99900156,0.00037862323,0.0001231204,0.00035660932,0.000035711844,0.00010437953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064745056,0.00023305602,0.00029749083,0.00031515825,0.0009819097,0.000148716,0.00046501655,0.000052968997,0.000006501209],"category_scores_gemma":[0.000003979056,0.00026136386,0.00013165668,0.00049068354,0.000037625217,0.00026714848,0.000031341715,0.0009464494,0.0000034020022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986493,0.00018514745,0.00024727208,0.0000059392423,0.000031532552,0.000043192293,0.0020160414,0.9418213,0.0014913968,0.000064248765,0.00000841262,0.05405755],"study_design_scores_gemma":[0.0013901418,0.00019095141,0.0006213927,0.00005641648,0.000011845304,0.0000801648,0.00095967983,0.99620765,0.00014795049,0.000019336834,0.000032792712,0.00028164918],"about_ca_topic_score_codex":0.0007892254,"about_ca_topic_score_gemma":0.00012702661,"teacher_disagreement_score":0.64319944,"about_ca_system_score_codex":0.0002708922,"about_ca_system_score_gemma":0.000041440522,"threshold_uncertainty_score":0.99998385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5441139,0.00017528859,0.45387396,0.000047874197,0.0016521631,0.00006151514,0.000005177431,0.00004916156,0.00002096801],"genre_scores_gemma":[0.9910759,0.0000090639605,0.007721337,0.0010750988,0.00007351724,0.0000016497967,0.0000109489865,0.000008622304,0.000023863304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785453,0.0003497966,0.0006915209,0.00015904191,0.0006199948,0.00032511284],"domain_scores_gemma":[0.99815655,0.0002172916,0.000949176,0.00021496194,0.00037572157,0.00008632244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167382,0.00015395926,0.0002566819,0.00032568892,0.00037586025,0.0004576193,0.0012778589,0.000029106986,0.000042319178],"category_scores_gemma":[0.000034832454,0.00015649555,0.00014689029,0.00038826812,0.000021302287,0.0012537371,0.0006634931,0.00058053556,0.000004378927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005092507,0.0004067818,0.12523624,0.00026382966,0.0008627376,0.0001664264,0.0260099,0.77494687,0.003729005,0.0009129326,0.009235827,0.0577202],"study_design_scores_gemma":[0.0006360685,0.0001340778,0.0039362516,0.000106864434,0.000017464385,0.0005717919,0.00035706811,0.99276614,0.00010332338,0.00015582741,0.0010239566,0.00019115118],"about_ca_topic_score_codex":0.002297104,"about_ca_topic_score_gemma":0.000011804889,"teacher_disagreement_score":0.446962,"about_ca_system_score_codex":0.00016672474,"about_ca_system_score_gemma":0.00006639495,"threshold_uncertainty_score":0.6381703},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49094516,0.00011034354,0.50739396,0.0006077849,0.00045416103,0.00019968541,0.000007987075,0.00012240156,0.00015849597],"genre_scores_gemma":[0.9972602,0.0000022957126,0.0008317831,0.00094223156,0.00035991243,0.00017753405,0.0000106658545,0.000021773065,0.0003935647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984006,0.000138023,0.00021023107,0.00047255814,0.00035180323,0.00042673864],"domain_scores_gemma":[0.998867,0.00031290625,0.00015106204,0.00050095667,0.000058658068,0.0001094226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025705926,0.0002032611,0.00023087999,0.00011254715,0.0006871172,0.00056556653,0.0018045976,0.00003405614,0.000012271726],"category_scores_gemma":[0.000013268099,0.00016869475,0.00011332851,0.00040692146,0.00002449918,0.0004985329,0.00053621235,0.0002446714,9.3627483e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033480983,0.0005473292,0.020029156,0.000085298576,0.00035010287,0.00014032527,0.0010543304,0.9317656,0.0037468579,0.003663386,0.0030714087,0.035211384],"study_design_scores_gemma":[0.0013549568,0.0003054505,0.010485905,0.000036007816,0.000059487815,0.000045790657,0.00012234236,0.98387057,0.001237872,0.00019038639,0.0016912959,0.0005999118],"about_ca_topic_score_codex":0.0009694039,"about_ca_topic_score_gemma":0.00009069617,"teacher_disagreement_score":0.5065622,"about_ca_system_score_codex":0.00012449325,"about_ca_system_score_gemma":0.00010734102,"threshold_uncertainty_score":0.68791723},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3828562,0.00033265565,0.6150203,0.0002955115,0.0013144689,0.00013310708,0.00000122421,0.000026454427,0.00002011209],"genre_scores_gemma":[0.9866497,0.000011135238,0.011676234,0.0012473406,0.00015053926,0.000023210174,0.000004524462,0.000024597468,0.00021270402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976842,0.0002722999,0.00066764536,0.00038458064,0.0004957978,0.00049550115],"domain_scores_gemma":[0.9987978,0.00017239328,0.00047677333,0.00037190624,0.000030869716,0.00015027264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019829313,0.00020862787,0.00030829952,0.00022792695,0.00023346535,0.00017359736,0.0017596438,0.000065019056,0.00003194068],"category_scores_gemma":[0.000030784224,0.00021577344,0.0002433312,0.00019430861,0.000039868755,0.00029129875,0.00027701654,0.0011041411,0.0000018736853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017671351,0.00029069826,0.0023572904,0.000010192674,0.00006412322,0.00005927794,0.0011015496,0.9738125,0.002670631,0.00033916163,0.0008054843,0.018312342],"study_design_scores_gemma":[0.00066587713,0.00049270206,0.00024682004,0.00010218461,0.000011808138,0.00011735516,0.00008388355,0.9958005,0.0003569231,0.0008318939,0.0010697851,0.00022027561],"about_ca_topic_score_codex":0.0001314547,"about_ca_topic_score_gemma":0.000017932021,"teacher_disagreement_score":0.60379356,"about_ca_system_score_codex":0.00042684053,"about_ca_system_score_gemma":0.00007196491,"threshold_uncertainty_score":0.87989855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6820087,0.00019934046,0.31510404,0.000014760017,0.00059285195,0.0002933299,0.000016716303,0.000059343667,0.0017109428],"genre_scores_gemma":[0.99664533,0.000107386906,0.0030373773,0.000012832064,0.00006292279,9.132652e-7,0.000014614323,0.000010985821,0.00010760887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981874,0.0002604524,0.00032904436,0.000597696,0.00035930483,0.00026608777],"domain_scores_gemma":[0.99729395,0.000055104643,0.00066302356,0.0010403686,0.00085788034,0.00008967952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013369195,0.00023676816,0.00037096397,0.0002696706,0.00010733863,0.00005849811,0.0014025883,0.0001948188,0.000024397907],"category_scores_gemma":[0.000037754002,0.00025427798,0.00017437416,0.0004527754,0.0001165575,0.0007377247,0.00090905104,0.00036421863,0.0000075166668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023050763,0.0027253856,0.06302093,0.0025441993,0.001509701,0.00029769717,0.006995873,0.4901546,0.0132487565,0.12033845,0.00021091824,0.29872298],"study_design_scores_gemma":[0.0005182702,0.000049939827,0.005339057,0.0003243683,0.00022918066,0.0000059863733,0.000042342956,0.9900377,0.0006657591,0.002508619,0.0000062178506,0.00027260694],"about_ca_topic_score_codex":0.00085738546,"about_ca_topic_score_gemma":0.000015772765,"teacher_disagreement_score":0.49988306,"about_ca_system_score_codex":0.00028187496,"about_ca_system_score_gemma":0.000633755,"threshold_uncertainty_score":0.99999094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3265319,0.0025092575,0.49312136,0.10009158,0.010118103,0.0021022875,0.00040816292,0.0013580157,0.06375933],"genre_scores_gemma":[0.98911387,0.00086629647,0.0050970367,0.0017924408,0.000051707673,0.00046722608,0.0002648756,0.00004319403,0.0023033656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571794,0.00088395656,0.00085217337,0.0009320393,0.001026043,0.000587863],"domain_scores_gemma":[0.9950718,0.0008640125,0.00037122384,0.003307771,0.00022748967,0.00015766283],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012223786,0.000420977,0.0004101895,0.0009891092,0.0009996853,0.0006113922,0.007294096,0.00009103384,0.00042210743],"category_scores_gemma":[0.0001224879,0.0004992378,0.00027798978,0.0011805958,0.00016390916,0.0006451023,0.0022923034,0.0022853774,0.000097740216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005550498,0.0045726104,0.0014412208,0.000030739033,0.00076875143,0.000669278,0.009310486,0.08502603,0.021362651,0.3861506,0.014962302,0.4751503],"study_design_scores_gemma":[0.0009422363,0.000102824626,0.00055177906,0.00017297734,0.000017614106,0.00017121171,0.0013856076,0.9834186,0.000080357786,0.006272886,0.006205232,0.000678672],"about_ca_topic_score_codex":0.00017794482,"about_ca_topic_score_gemma":0.0005922564,"teacher_disagreement_score":0.89839256,"about_ca_system_score_codex":0.0009290212,"about_ca_system_score_gemma":0.00022741093,"threshold_uncertainty_score":0.9997459},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007842897,0.0019168117,0.85118854,0.086714834,0.011516695,0.0030564575,0.00089267053,0.0013450569,0.035526056],"genre_scores_gemma":[0.9723142,0.0005090303,0.020016927,0.001876971,0.00044087914,0.0013395353,0.0010827652,0.00005483174,0.0023648986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958291,0.0006126926,0.00072479027,0.001187379,0.0010526882,0.0005933505],"domain_scores_gemma":[0.99174273,0.0014127016,0.0005008315,0.0057492056,0.0004288211,0.00016572425],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017661572,0.00040281954,0.0003870633,0.00045264847,0.002085789,0.00085000973,0.015789611,0.000116922274,0.00019007978],"category_scores_gemma":[0.0002644916,0.00046200957,0.00022032623,0.00097370445,0.00015649943,0.0010754032,0.006364387,0.0017697074,0.000034443794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005479517,0.0018442083,0.00052248244,0.000019751193,0.0011864705,0.00003086119,0.002867208,0.019076305,0.0020021573,0.5502183,0.059325702,0.36235863],"study_design_scores_gemma":[0.0007623746,0.00008640639,0.0001173142,0.00011888022,0.00003402162,0.0000351174,0.0012341163,0.93822813,0.000016176342,0.0034670832,0.055369437,0.0005309195],"about_ca_topic_score_codex":0.000111419096,"about_ca_topic_score_gemma":0.00016991796,"teacher_disagreement_score":0.9644713,"about_ca_system_score_codex":0.0005429697,"about_ca_system_score_gemma":0.00037973654,"threshold_uncertainty_score":0.99978316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6892436,0.0003114542,0.30909166,0.0000730927,0.00060190924,0.00040016707,0.000025759533,0.00013167506,0.000120642246],"genre_scores_gemma":[0.9969371,0.00043207392,0.0013803605,0.00045172643,0.00017461747,0.0000032401206,0.00006221161,0.000019178098,0.0005395025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.00012244817,0.00027740514,0.0011771783,0.000086027925,0.0004543045],"domain_scores_gemma":[0.9984802,0.00019153439,0.00025828334,0.0007376768,0.00018297553,0.00014931832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041774407,0.00034771496,0.000420192,0.0003024413,0.00017118112,0.00017138748,0.0011888369,0.0002716233,0.0000038858834],"category_scores_gemma":[0.000014278009,0.00039951975,0.000162738,0.00026330052,0.000084047766,0.00031994536,0.0020643815,0.00043626592,0.0000043957957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006161698,0.0005824561,0.016029695,0.0005343039,0.00046076297,0.0003865182,0.0018807704,0.93926895,0.00013859235,0.035327766,0.00038454635,0.0043894793],"study_design_scores_gemma":[0.0013736235,0.00013671679,0.0011066606,0.00041497505,0.000059399834,0.0000035107573,0.00048699533,0.99442285,0.000013496944,0.0014708303,0.00008905659,0.00042185604],"about_ca_topic_score_codex":0.0006874963,"about_ca_topic_score_gemma":0.00045141458,"teacher_disagreement_score":0.3077113,"about_ca_system_score_codex":0.00017086865,"about_ca_system_score_gemma":0.00008682267,"threshold_uncertainty_score":0.9998457},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27502856,0.000062123894,0.723483,0.00008158765,0.00033867898,0.00042803126,0.00004877471,0.00028623312,0.00024297585],"genre_scores_gemma":[0.9947741,0.00017028343,0.0024064842,0.00008467345,0.000027618207,0.000008176759,0.00009220983,0.000024823503,0.0024116016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976693,0.00019118703,0.00028183192,0.0012380013,0.00016258274,0.0004571158],"domain_scores_gemma":[0.9986969,0.00005168738,0.00018480018,0.0008187527,0.00009495956,0.00015289936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035297812,0.0003931619,0.0004202302,0.0003382831,0.00026938354,0.00012221327,0.0012583152,0.00024861182,0.000015531363],"category_scores_gemma":[0.000014966026,0.00042897096,0.00024254188,0.00051575026,0.000093961215,0.0007922342,0.0009109005,0.0012373852,0.00000674877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024315208,0.00019245117,0.025008395,0.00002815904,0.00008262741,0.00024202313,0.00030079257,0.97111046,0.00005955088,0.002348031,0.000033389613,0.00035097604],"study_design_scores_gemma":[0.0014154918,0.00011697642,0.004841412,0.00008372221,0.00006092492,0.000008566979,0.00018895733,0.99240184,0.0000084205785,0.00038475232,0.000042561274,0.00044635413],"about_ca_topic_score_codex":0.0017002597,"about_ca_topic_score_gemma":0.0013459765,"teacher_disagreement_score":0.72107655,"about_ca_system_score_codex":0.0005102673,"about_ca_system_score_gemma":0.00019654096,"threshold_uncertainty_score":0.99981624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86938596,0.0010653193,0.12432634,0.0011647141,0.00059253094,0.0003016873,0.000005185126,0.00057245727,0.0025858285],"genre_scores_gemma":[0.9902899,0.000008901631,0.0061749113,0.0018864663,0.00005934805,0.00006328636,0.000010214755,0.000016408736,0.0014905499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980474,0.0002307204,0.00026387433,0.0005297856,0.00044651772,0.00048170987],"domain_scores_gemma":[0.9989148,0.00026414936,0.0000952889,0.0005801116,0.000045390283,0.00010026558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044534664,0.00019161783,0.00023828611,0.00014093527,0.00036919158,0.00017874298,0.0010228516,0.00007027696,0.00022887866],"category_scores_gemma":[0.000027533628,0.0001675301,0.00007626877,0.0011830503,0.00003231782,0.00029418705,0.0006929657,0.00076150335,0.00003373946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057976565,0.0006488634,0.18418461,0.00002583684,0.00027207218,0.0014554312,0.0115041295,0.7095412,0.00032140143,0.04116534,0.029528396,0.020772925],"study_design_scores_gemma":[0.0021103655,0.00065635,0.017528435,0.00016181509,0.000035338835,0.00023265567,0.0017432687,0.9667258,0.000040448987,0.003989668,0.005723945,0.001051859],"about_ca_topic_score_codex":0.0017416094,"about_ca_topic_score_gemma":0.00028963413,"teacher_disagreement_score":0.25718462,"about_ca_system_score_codex":0.00013143008,"about_ca_system_score_gemma":0.000118380354,"threshold_uncertainty_score":0.68316793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041790612,0.000021723215,0.95632094,0.00090055226,0.0000774442,0.00021177603,0.000014456237,0.00007492304,0.0005875652],"genre_scores_gemma":[0.996599,0.0000011183038,0.0021647736,0.00023586242,0.000025954141,0.00022473549,0.000021717595,0.0000033459282,0.0007234595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993612,0.000035160625,0.0001620275,0.00018274783,0.00016950592,0.00008935856],"domain_scores_gemma":[0.99943495,0.000047980462,0.00003952899,0.00035949054,0.00009475785,0.000023289396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039783306,0.000043996064,0.00007074868,0.000043044525,0.00019164542,0.000020263771,0.00044443473,0.000013093453,0.000008706577],"category_scores_gemma":[0.000011394305,0.00004525536,0.00006013989,0.000180807,0.0000062775234,0.00017742532,0.00025028276,0.000058998336,0.0000013405063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013248009,0.00010695498,0.00011826684,0.000013771793,0.000013630826,1.3166503e-7,0.00023439353,0.47471341,0.0019709116,0.513734,0.0014307048,0.007650594],"study_design_scores_gemma":[0.00014871407,0.000043274158,0.000040016737,0.0000010350697,0.0000033756314,7.727236e-7,0.0001018237,0.9941909,0.000121455305,0.0040437886,0.0012498018,0.00005506941],"about_ca_topic_score_codex":0.00063761504,"about_ca_topic_score_gemma":0.000041202165,"teacher_disagreement_score":0.9548084,"about_ca_system_score_codex":0.000036871617,"about_ca_system_score_gemma":0.0000453179,"threshold_uncertainty_score":0.18454601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8750584,0.00065910746,0.121426344,0.000017111886,0.00040412182,0.00044060673,0.0000011861589,0.0002435615,0.0017495304],"genre_scores_gemma":[0.9889471,0.00033260105,0.01001472,0.000055418797,0.00004885471,0.00013476641,0.000013734007,0.000014954818,0.00043784987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982891,0.00018756774,0.0004241156,0.00050965796,0.0003112463,0.00027833338],"domain_scores_gemma":[0.9990502,0.0000636561,0.00017958628,0.0006107787,0.00005603612,0.000039746727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008390061,0.00021283983,0.00034530336,0.00026341918,0.000109617504,0.00007524874,0.0010514806,0.00013311054,0.000076549826],"category_scores_gemma":[0.000009157592,0.00021748716,0.00012085433,0.00026475743,0.000025045663,0.00014815896,0.003272366,0.0011240136,8.698248e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000183789,0.000082444814,0.017628528,0.00010758627,0.000019632274,0.000008365807,0.0006262257,0.9586022,0.0010654606,0.00009589578,0.000042425858,0.021702852],"study_design_scores_gemma":[0.0001261386,0.00013846671,0.00026427422,0.00017306367,0.000007115894,0.0000036860954,0.0001687726,0.99761367,0.00092135195,0.000008915478,0.0003338789,0.00024066473],"about_ca_topic_score_codex":0.0007055839,"about_ca_topic_score_gemma":0.000014138176,"teacher_disagreement_score":0.113888666,"about_ca_system_score_codex":0.0002378603,"about_ca_system_score_gemma":0.00014843907,"threshold_uncertainty_score":0.88688695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8750584,0.00065910746,0.121426344,0.000017111886,0.00040412182,0.00044060673,0.0000011861589,0.0002435615,0.0017495304],"genre_scores_gemma":[0.9889471,0.00033260105,0.01001472,0.000055418797,0.00004885471,0.00013476641,0.000013734007,0.000014954818,0.00043784987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982891,0.00018756774,0.0004241156,0.00050965796,0.0003112463,0.00027833338],"domain_scores_gemma":[0.9990502,0.0000636561,0.00017958628,0.0006107787,0.00005603612,0.000039746727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008390061,0.00021283983,0.00034530336,0.00026341918,0.000109617504,0.00007524874,0.0010514806,0.00013311054,0.000076549826],"category_scores_gemma":[0.000009157592,0.00021748716,0.00012085433,0.00026475743,0.000025045663,0.00014815896,0.003272366,0.0011240136,8.698248e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000183789,0.000082444814,0.017628528,0.00010758627,0.000019632274,0.000008365807,0.0006262257,0.9586022,0.0010654606,0.00009589578,0.000042425858,0.021702852],"study_design_scores_gemma":[0.0001261386,0.00013846671,0.00026427422,0.00017306367,0.000007115894,0.0000036860954,0.0001687726,0.99761367,0.00092135195,0.000008915478,0.0003338789,0.00024066473],"about_ca_topic_score_codex":0.0007055839,"about_ca_topic_score_gemma":0.000014138176,"teacher_disagreement_score":0.113888666,"about_ca_system_score_codex":0.0002378603,"about_ca_system_score_gemma":0.00014843907,"threshold_uncertainty_score":0.88688695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.427701,0.00009836422,0.5714014,0.0004793633,0.000100206664,0.00009105908,0.000027952143,0.00008704992,0.000013557296],"genre_scores_gemma":[0.99498737,8.72746e-7,0.0044998247,0.00031982455,0.000010680837,0.000004966754,0.00015874821,0.000003624438,0.000014113681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870944,0.00020882933,0.00018346765,0.00050286134,0.00020448206,0.00019092581],"domain_scores_gemma":[0.99904364,0.00011959824,0.000045247023,0.0007291547,0.00001693302,0.00004540446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010785569,0.00008638804,0.00011519006,0.000054056243,0.00031083915,0.00011168458,0.0008090868,0.000018306848,0.000003034548],"category_scores_gemma":[0.00005799508,0.000088300825,0.00002325951,0.00023225433,0.000017031361,0.00025416803,0.0016087376,0.00024655223,0.000001371191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078700235,0.0018692797,0.18527858,0.00012541187,0.00006149896,0.00036682407,0.0013162888,0.62319136,0.0101122195,0.020346964,0.0013012557,0.1559516],"study_design_scores_gemma":[0.0005802622,0.000026804657,0.007398396,0.000007734213,0.00000216001,0.000008812433,0.00009291487,0.99133754,0.000038215556,0.000050256527,0.00034452337,0.000112359514],"about_ca_topic_score_codex":0.0012801051,"about_ca_topic_score_gemma":0.00009038895,"teacher_disagreement_score":0.5672863,"about_ca_system_score_codex":0.0000862539,"about_ca_system_score_gemma":0.000048324568,"threshold_uncertainty_score":0.3600803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46295738,0.0000948736,0.5354476,0.000026067291,0.00087939005,0.000351223,0.00008579143,0.00014315911,0.000014518295],"genre_scores_gemma":[0.999251,0.0000174707,0.00025906088,0.00005433726,0.000053909313,0.00019893041,0.00008837264,0.000016058439,0.000060839793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772483,0.0003054937,0.0006672542,0.000515525,0.00042979987,0.00035709512],"domain_scores_gemma":[0.99884605,0.00027363686,0.00023556572,0.00045733404,0.0001056511,0.00008175215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641036,0.00021420258,0.0003088467,0.00023519792,0.0004808415,0.000057907004,0.00046473797,0.00007014888,0.000025757154],"category_scores_gemma":[0.000005872729,0.00024490786,0.00022048465,0.0007823676,0.000049932627,0.00024159557,0.000012800311,0.00059538754,0.0000034240177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084954394,0.00044238457,0.0010106489,0.000013613751,0.000027882392,0.000016317006,0.00044866197,0.9537172,0.0014263939,0.000075004384,0.00010628329,0.04263067],"study_design_scores_gemma":[0.0011064959,0.00077870983,0.0012439453,0.000068920264,0.000019517316,0.00003924037,0.00033881387,0.9936705,0.0022509657,0.000023130007,0.00024053476,0.00021922334],"about_ca_topic_score_codex":0.00076561613,"about_ca_topic_score_gemma":0.000119634125,"teacher_disagreement_score":0.5362936,"about_ca_system_score_codex":0.00032476248,"about_ca_system_score_gemma":0.00007920473,"threshold_uncertainty_score":0.99870527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008899314,0.123498246,0.60467994,0.010049326,0.0005099709,0.00710917,0.00004339064,0.0044388776,0.24077177],"genre_scores_gemma":[0.9465896,0.0089441445,0.009798756,0.0005058148,0.00004438346,0.0018093457,0.00015444413,0.000092648166,0.03206088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987257,0.0000771413,0.00033255617,0.00045156895,0.00014521167,0.00026783408],"domain_scores_gemma":[0.99842876,0.00026666006,0.00024802174,0.00093557016,0.00008175145,0.00003924061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051586755,0.00024383566,0.00037511505,0.00037225068,0.0003850811,0.00007347166,0.0011050082,0.00033065942,0.000046058085],"category_scores_gemma":[0.0000104244555,0.00024196818,0.00006317535,0.00013713485,0.00009994264,0.00011587426,0.0008371881,0.001141269,0.0000017324937],"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.000079062826,0.00010673,0.00022682638,0.00006440077,0.00025255413,0.000014110339,0.002246562,0.012014101,0.00022215248,0.70545167,0.0006137592,0.27870807],"study_design_scores_gemma":[0.002298174,0.0017334832,0.0000123579075,0.0005161928,0.00009493348,0.000076201846,0.0022543527,0.38210824,0.0000351059,0.029255483,0.58051354,0.0011019398],"about_ca_topic_score_codex":0.000015355614,"about_ca_topic_score_gemma":0.00004809325,"teacher_disagreement_score":0.93769026,"about_ca_system_score_codex":0.00010709803,"about_ca_system_score_gemma":0.00009321428,"threshold_uncertainty_score":0.9867176},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020477096,0.00046741264,0.9749772,0.0028708137,0.00021256268,0.00042641963,0.000023712953,0.0002884844,0.00025630093],"genre_scores_gemma":[0.91564643,0.00008777183,0.083361104,0.00024895283,0.0000062147164,0.00045343928,0.000015938773,0.000027824564,0.00015234564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981084,0.00042294656,0.0003600443,0.000436218,0.0003053311,0.00036707646],"domain_scores_gemma":[0.9972004,0.00031106267,0.00012130706,0.0022229035,0.00005445639,0.00008986441],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041759145,0.0002157218,0.00022909918,0.00047102734,0.0014655372,0.0001733796,0.0016970653,0.000033559918,0.000011455562],"category_scores_gemma":[0.0000028151817,0.00023359865,0.00014316889,0.0007299306,0.00008777826,0.00039574088,0.000045822122,0.0012033088,0.000010329753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009804325,0.0015440191,0.000033798817,0.000021661497,0.0001931167,0.00009066794,0.0094216755,0.29968974,0.009649266,0.00021616912,0.000022843189,0.679019],"study_design_scores_gemma":[0.0009021022,0.00031136489,0.000040691506,0.000077485754,0.000042260494,0.00027394487,0.00060417556,0.99512494,0.0006943731,0.00014677897,0.0013759898,0.00040587797],"about_ca_topic_score_codex":0.00071494136,"about_ca_topic_score_gemma":0.0018666047,"teacher_disagreement_score":0.8951693,"about_ca_system_score_codex":0.00037494837,"about_ca_system_score_gemma":0.00010444386,"threshold_uncertainty_score":0.9998344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010911805,0.0024559826,0.98566866,0.0006390153,0.0001405249,0.000066834415,2.0404428e-7,0.00004818189,0.00006880198],"genre_scores_gemma":[0.8573427,0.0019214472,0.14027469,0.00026567522,0.00012870059,0.0000030872425,0.0000070182095,0.000013975421,0.00004270832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987339,0.0003642811,0.00042821135,0.00011686073,0.00014096357,0.00021582426],"domain_scores_gemma":[0.9985106,0.00043452837,0.00035149508,0.00049644336,0.00013515842,0.00007176853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012075009,0.00009680008,0.00020342608,0.00024847282,0.0003953261,0.00026154864,0.0009946097,0.000069466936,0.0000010145045],"category_scores_gemma":[0.000041600902,0.00009412627,0.000065947104,0.0009961794,0.00004235752,0.00041757768,0.00045573738,0.00055106013,4.9215805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008198445,0.00002958676,0.0018878762,0.0000023768305,0.000010513135,0.000006692811,0.00012960412,0.9625944,0.00001771613,0.00006534226,0.00019096029,0.035056774],"study_design_scores_gemma":[0.000534345,0.00004550776,0.0012770917,0.00021975585,0.000011279215,0.000023688564,0.00006580645,0.9965685,0.000002343187,0.00004787075,0.001105242,0.00009857227],"about_ca_topic_score_codex":0.00006185498,"about_ca_topic_score_gemma":0.00003067412,"teacher_disagreement_score":0.8464309,"about_ca_system_score_codex":0.00004524645,"about_ca_system_score_gemma":0.000060320843,"threshold_uncertainty_score":0.38383576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02176051,0.0038076895,0.97353,0.0005405172,0.00022434829,0.000059376867,0.0000016522065,0.000029416873,0.000046489153],"genre_scores_gemma":[0.8192228,0.002586135,0.1778585,0.00008363353,0.000171479,0.000001608959,0.0000019077927,0.000008268633,0.00006567495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.000079593,0.0002549501,0.00007836398,0.000093048584,0.00014386815],"domain_scores_gemma":[0.9986769,0.00043977358,0.0002130868,0.00042434558,0.00017824388,0.00006763907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060321,0.0000655944,0.00013215249,0.00012926882,0.00033598294,0.0001257225,0.00073368306,0.000035789864,4.3478323e-7],"category_scores_gemma":[0.00003129917,0.00006200914,0.00007402109,0.00030258563,0.000045586366,0.0001814279,0.0003212737,0.00019461046,5.3299556e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018992081,0.000086363936,0.00055343146,0.0000226188,0.00010308686,0.000040226732,0.0008797699,0.056088593,0.00022713706,0.0033980156,0.0020845707,0.9364972],"study_design_scores_gemma":[0.00027803643,0.000072126284,0.00084637577,0.00008676365,0.000026396317,0.00015059214,0.00009201874,0.995994,9.661273e-7,0.0006240944,0.0017603211,0.00006834899],"about_ca_topic_score_codex":0.000018793355,"about_ca_topic_score_gemma":0.0000027055914,"teacher_disagreement_score":0.93990535,"about_ca_system_score_codex":0.000025938392,"about_ca_system_score_gemma":0.00005233807,"threshold_uncertainty_score":0.25841433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21108547,0.00024560565,0.7862875,0.00045721544,0.0015458878,0.00022049689,0.00000525179,0.00008483275,0.000067741545],"genre_scores_gemma":[0.99248284,0.000026998881,0.006629462,0.00042949905,0.00016131892,0.000016817447,0.0000050836347,0.0000172482,0.00023071226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796605,0.00018369847,0.0006798552,0.0003285343,0.0003773416,0.00046454422],"domain_scores_gemma":[0.9984834,0.0003379008,0.0004536441,0.0002291812,0.00036472263,0.00013116085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016219836,0.00021216711,0.00038958126,0.00044691248,0.000120455676,0.00042316678,0.0009500809,0.00011453676,0.0000039946126],"category_scores_gemma":[0.00010267468,0.00019123023,0.00023095524,0.00052403106,0.00004305223,0.00076608494,0.000102916776,0.00061125343,0.0000050315807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003200283,0.00018020319,0.0011161387,0.00008469894,0.00034909003,0.0007245681,0.00716195,0.8572448,0.017676378,0.0010246745,0.008413103,0.10570435],"study_design_scores_gemma":[0.0014879035,0.00030120093,0.00017040227,0.00045964046,0.0000138505275,0.00007205501,0.0004892788,0.9930083,0.0033277853,0.00034482157,0.000117985095,0.0002067358],"about_ca_topic_score_codex":0.00020894594,"about_ca_topic_score_gemma":0.000020951013,"teacher_disagreement_score":0.7813974,"about_ca_system_score_codex":0.00021337574,"about_ca_system_score_gemma":0.00018006627,"threshold_uncertainty_score":0.77981424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1815979,0.00009333516,0.7910833,0.023930985,0.0005331467,0.00067451096,0.0005061819,0.0011908115,0.00038986],"genre_scores_gemma":[0.97157365,0.000038253547,0.022132827,0.004959866,0.000057362166,0.00023400644,0.000624261,0.000028908877,0.0003508479],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850297,0.00012512466,0.00035732155,0.0003662746,0.00023136723,0.00041693443],"domain_scores_gemma":[0.9961383,0.0007741982,0.0001473251,0.002697767,0.00014160374,0.00010080977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044656152,0.00019897611,0.0002209277,0.00025332597,0.00082378567,0.0003166514,0.0029536008,0.000085518965,0.000007635017],"category_scores_gemma":[0.00006148032,0.00021502074,0.00017544783,0.00070925424,0.00010269899,0.0005637756,0.0004937414,0.00035857968,0.00008043622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000741479,0.0008189908,0.00051122694,0.00011599388,0.00044763595,0.000023071378,0.0024382898,0.11656361,0.55820525,0.060471985,0.23995334,0.020376481],"study_design_scores_gemma":[0.0012029567,0.000055721925,0.0038835974,0.00008537248,0.000039663566,0.000031055257,0.00029239318,0.9876244,0.00043144875,0.00075740146,0.0050489237,0.00054707145],"about_ca_topic_score_codex":0.0012455034,"about_ca_topic_score_gemma":0.0006098497,"teacher_disagreement_score":0.8710608,"about_ca_system_score_codex":0.0001212337,"about_ca_system_score_gemma":0.00009188955,"threshold_uncertainty_score":0.87682915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749902,0.0037454749,0.35819075,0.007961356,0.03128612,0.0024586911,0.00007642233,0.00074969704,0.020541316],"genre_scores_gemma":[0.9932432,0.00018022896,0.0001415679,0.0045421286,0.00076637155,0.00008213399,0.000020822037,0.000022837936,0.0010007195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965914,0.00052876596,0.0005866816,0.00082121184,0.00082137063,0.0006506052],"domain_scores_gemma":[0.99865955,0.0003390276,0.00031436965,0.00041553777,0.00012572827,0.00014580361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011797599,0.0003336441,0.00041452868,0.00030920588,0.0005725291,0.0004392498,0.0007185105,0.00006663874,0.00006448706],"category_scores_gemma":[0.00002520929,0.00035377027,0.00014607547,0.00036974504,0.000050321116,0.0001999027,0.00042591398,0.0008485993,0.00001098187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012354734,0.0005251052,0.005189413,0.00001887469,0.00041530412,0.00061169814,0.0019707598,0.7548373,0.0024783155,0.02881502,0.010045056,0.19385773],"study_design_scores_gemma":[0.0028044456,0.0003282521,0.0003541173,0.0001303084,0.000019294997,0.00011175845,0.0003873168,0.9837684,0.00000948191,0.0007541789,0.010931688,0.00040076874],"about_ca_topic_score_codex":0.00061501097,"about_ca_topic_score_gemma":0.00024230989,"teacher_disagreement_score":0.418253,"about_ca_system_score_codex":0.0003871607,"about_ca_system_score_gemma":0.00011798005,"threshold_uncertainty_score":0.9998914},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12534314,0.00030094365,0.86872035,0.0024385243,0.0011473313,0.00066941,9.3800224e-7,0.00039388932,0.0009854825],"genre_scores_gemma":[0.9967717,0.00083647063,0.0015170497,0.0003321914,0.00017355513,0.0000881417,0.00009932714,0.000025015463,0.00015655094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740624,0.00073948153,0.0008067877,0.0002930202,0.0002059506,0.00054850953],"domain_scores_gemma":[0.99675566,0.0018059105,0.00037447934,0.0005594001,0.00038897656,0.000115578456],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018583264,0.00020418488,0.0002942201,0.0006866213,0.0014095829,0.00051239954,0.001304746,0.00010778319,0.000006906251],"category_scores_gemma":[0.00034298218,0.0002157768,0.000096809425,0.0022709314,0.00002809485,0.00041506454,0.00022966885,0.0016544216,0.00001719426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028832274,0.00012670051,0.0017154163,0.0000060249504,0.000034481815,0.000006195749,0.0010944896,0.9609835,0.00027310476,0.0003558654,0.0012801595,0.034095243],"study_design_scores_gemma":[0.0010487793,0.00015192083,0.001483188,0.00024334365,0.000006941274,0.000033008168,0.00028403863,0.99378026,0.00003752094,0.00016378156,0.0025383816,0.00022885617],"about_ca_topic_score_codex":0.000085817635,"about_ca_topic_score_gemma":0.00038298804,"teacher_disagreement_score":0.87142855,"about_ca_system_score_codex":0.00045063117,"about_ca_system_score_gemma":0.00016479666,"threshold_uncertainty_score":0.99989045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.520065,0.0005397054,0.47599587,0.0015915412,0.00065679103,0.00057839474,0.00003295296,0.00052201864,0.000017733119],"genre_scores_gemma":[0.9864974,0.000033956785,0.012032017,0.00096645585,0.000049868067,0.00022562486,0.00005579615,0.000048125316,0.00009074695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628174,0.00018827201,0.000844771,0.0012583927,0.00055650255,0.00087029673],"domain_scores_gemma":[0.9973754,0.000277457,0.0006564977,0.0011215982,0.00043492086,0.00013412672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012072086,0.0005197421,0.00081483764,0.000668331,0.0010179159,0.00016022929,0.0016550355,0.0002498739,0.000012362427],"category_scores_gemma":[0.00017851223,0.000551672,0.00020418719,0.0014270459,0.00017405694,0.00030321343,0.0019329265,0.0013706385,0.0000022498984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035847863,0.0014005576,0.015839702,0.0008542871,0.0016956727,0.00051510567,0.0033123998,0.16867644,0.26871192,0.14574063,0.0016116347,0.39128318],"study_design_scores_gemma":[0.0017995384,0.0009848187,0.00047566943,0.00018030475,0.00011001013,0.00015647322,0.0024086821,0.98533845,0.0024487264,0.003883186,0.0014154549,0.0007986776],"about_ca_topic_score_codex":0.002384136,"about_ca_topic_score_gemma":0.00065356836,"teacher_disagreement_score":0.816662,"about_ca_system_score_codex":0.0003055795,"about_ca_system_score_gemma":0.00031059672,"threshold_uncertainty_score":0.99969345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111010745,0.000022343487,0.8875045,0.00019771713,0.0006770556,0.0002711725,0.000034231274,0.00018974884,0.00009247586],"genre_scores_gemma":[0.9989799,0.00008518475,0.00046490072,0.00035693988,0.000021719607,0.000047130758,0.000021863772,0.000006054997,0.000016304462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905485,0.000030593204,0.00030948393,0.00016845035,0.00016035202,0.00027628164],"domain_scores_gemma":[0.99944824,0.00012383715,0.000076938086,0.00019876324,0.000080736376,0.00007149658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538424,0.00013226613,0.00015302104,0.00025743444,0.00034304886,0.00023897381,0.00016559107,0.00009546232,0.0000013336719],"category_scores_gemma":[0.000006592149,0.00013571032,0.00008477262,0.00041998253,0.000026881655,0.0012097793,0.000007075637,0.00024143406,0.000010392875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096348915,0.000066075314,0.00011213862,0.00013066597,0.000051030253,0.0000065845634,0.007022493,0.81928045,0.000070807415,0.0106351115,0.0009277203,0.1616006],"study_design_scores_gemma":[0.00059721863,0.0000588478,0.000048990627,0.000046585166,0.000006406964,0.000009557973,0.000102355014,0.99514526,0.0004283361,0.0024270792,0.00097225886,0.00015709012],"about_ca_topic_score_codex":0.000101126076,"about_ca_topic_score_gemma":0.00016959985,"teacher_disagreement_score":0.88796914,"about_ca_system_score_codex":0.000051930092,"about_ca_system_score_gemma":0.000027108303,"threshold_uncertainty_score":0.5534106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011812431,0.00007758827,0.94344246,0.0034676525,0.010862338,0.0005904366,0.039872933,0.0001685626,0.0003367842],"genre_scores_gemma":[0.9244427,0.000079479774,0.003836338,0.0029648682,0.0009843201,0.000174935,0.067065045,0.000037153113,0.00041512778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506956,0.00025002312,0.00055884133,0.0021442557,0.0014677978,0.0005094954],"domain_scores_gemma":[0.9922036,0.00042923735,0.0003895379,0.006479049,0.00032988438,0.00016869263],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018886679,0.00036016226,0.00037703378,0.0002840101,0.0006006079,0.00061355793,0.018691063,0.000083629915,0.00008418977],"category_scores_gemma":[0.0003594149,0.00037741684,0.00008896274,0.00028123794,0.00005857875,0.0015590299,0.010589181,0.00068776525,0.000025526206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014555221,0.0010379828,0.00011766767,0.00004319388,0.0013515913,0.00039816007,0.00016932034,0.011707939,0.0070771533,0.3864312,0.23095518,0.3592551],"study_design_scores_gemma":[0.0013440397,0.00019876478,0.000019906727,0.00006866574,0.000049847255,0.000025243051,0.0002264229,0.967399,0.00012917591,0.0012500684,0.028857803,0.00043105477],"about_ca_topic_score_codex":0.00039263273,"about_ca_topic_score_gemma":0.00029697138,"teacher_disagreement_score":0.95569104,"about_ca_system_score_codex":0.00021716856,"about_ca_system_score_gemma":0.00044201093,"threshold_uncertainty_score":0.9998678},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8536101,0.000094908755,0.14456758,0.0006007513,0.0007349501,0.00020553987,0.000010527309,0.000040214145,0.00013543952],"genre_scores_gemma":[0.9987963,0.000013877451,0.00055568625,0.00023009906,0.00008794266,0.00001606404,0.0000022658091,0.000010348214,0.00028743935],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836415,0.00019362614,0.0005355435,0.00023660553,0.000367711,0.0003023893],"domain_scores_gemma":[0.99859685,0.00053085724,0.0003705979,0.00027926767,0.00017616252,0.00004624584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023536114,0.00014248994,0.00027455212,0.00028010723,0.000058758636,0.00014757871,0.0016251581,0.00006624066,0.0000055640626],"category_scores_gemma":[0.00019253866,0.00010117051,0.00024637594,0.00025623568,0.000045698293,0.00065845274,0.00020127418,0.00053014763,0.0000049369537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016176623,0.0035304823,0.04285437,0.0013183149,0.0016283143,0.00054433726,0.5535014,0.004446292,0.063522495,0.036349818,0.14303069,0.14765577],"study_design_scores_gemma":[0.002310906,0.0010496848,0.008834854,0.0014467123,0.000055507116,0.00040433698,0.0058781505,0.9265769,0.038914327,0.01261475,0.001429602,0.00048424516],"about_ca_topic_score_codex":0.0003668176,"about_ca_topic_score_gemma":0.00002897483,"teacher_disagreement_score":0.92213064,"about_ca_system_score_codex":0.000058912476,"about_ca_system_score_gemma":0.000059719197,"threshold_uncertainty_score":0.41256136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8738801,0.10796118,0.012029383,0.0050158557,0.0001605725,0.00016835105,0.00002472128,0.00032365022,0.00043622876],"genre_scores_gemma":[0.93571484,0.063948035,0.00011000559,0.000060852395,0.000013874157,0.00006151063,0.000028443963,0.000007634106,0.000054804943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879503,0.00039500336,0.00016806633,0.0002682556,0.000120815326,0.0002528076],"domain_scores_gemma":[0.9984308,0.0007397252,0.000045444107,0.0006555116,0.000057424593,0.0000711007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008544387,0.000106925654,0.00014177943,0.0001691627,0.00048747114,0.000094090436,0.0006574697,0.00005504521,6.968382e-7],"category_scores_gemma":[0.000024763758,0.00011157355,0.000025464326,0.0004794627,0.000120657714,0.00013292866,0.00082396856,0.00018541931,0.0000031450559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032610737,0.0008391951,0.030719135,0.00015760987,0.00012987266,0.00003248894,0.03532723,0.017376289,0.0005091953,0.20153545,0.0009360928,0.71240485],"study_design_scores_gemma":[0.00017651523,0.000022708238,0.044780195,0.00005930271,0.0000031759832,0.000010645398,0.00053249963,0.9531627,7.966574e-7,0.000117956966,0.000991912,0.00014153367],"about_ca_topic_score_codex":0.0012945493,"about_ca_topic_score_gemma":0.005343624,"teacher_disagreement_score":0.9357865,"about_ca_system_score_codex":0.00003309094,"about_ca_system_score_gemma":0.000042597607,"threshold_uncertainty_score":0.45498374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03367849,0.0001421084,0.95223236,0.009314768,0.00024515082,0.0009438772,0.0000087974895,0.00068675866,0.0027477054],"genre_scores_gemma":[0.9953972,0.000009625741,0.0011007785,0.0008995527,0.0004503699,0.0007231061,0.000034203946,0.00002108549,0.0013640397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811745,0.000070093316,0.00026205127,0.0006523662,0.00037352997,0.000524521],"domain_scores_gemma":[0.99880457,0.00024789295,0.000058816786,0.0005177488,0.00014320303,0.00022775757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079952937,0.00019283353,0.00020187726,0.00029888834,0.00035213228,0.00034069622,0.0005485131,0.00007851668,0.0000012579764],"category_scores_gemma":[0.000028501827,0.00020108205,0.00005478743,0.0019421628,0.000023911187,0.00012280837,0.00021494292,0.0003353306,0.00006202835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010625822,0.00004855604,0.0020704023,0.0000073717683,0.00001751635,0.000009285892,0.00042877352,0.81384385,0.0001189113,0.006029522,0.0055410387,0.17187417],"study_design_scores_gemma":[0.00025113852,0.000046273075,0.0062242346,0.000059172708,0.000009510215,0.00000438832,0.00012353482,0.9553181,0.0000148451445,0.0009025742,0.036740396,0.00030583984],"about_ca_topic_score_codex":0.00028631318,"about_ca_topic_score_gemma":0.00012893553,"teacher_disagreement_score":0.96171874,"about_ca_system_score_codex":0.00007999084,"about_ca_system_score_gemma":0.000074527576,"threshold_uncertainty_score":0.8199888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47856814,0.000132928,0.5156965,0.0013939309,0.00027900105,0.00021341229,0.0000019811553,0.00074779784,0.0029663134],"genre_scores_gemma":[0.9930273,0.000045039233,0.0008043681,0.0006727583,0.000029961117,0.000015140136,0.00001703643,0.000013102021,0.005375246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884635,0.000025441346,0.00018392748,0.00038473116,0.00020445253,0.00035506953],"domain_scores_gemma":[0.9992499,0.00011093616,0.000055381275,0.00036263827,0.000078221376,0.0001429487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022998522,0.00017255651,0.0001972645,0.000114641975,0.00018150211,0.00023862011,0.00034023676,0.00008420658,0.000010996036],"category_scores_gemma":[0.000009718108,0.00012349524,0.00004627144,0.00050173514,0.000050075323,0.00036169667,0.0002422357,0.0001867156,0.00006093277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008762972,0.0007139976,0.18478025,0.00022451463,0.0024719576,0.0019808705,0.012990736,0.4711874,0.008345231,0.12651227,0.09757022,0.09234622],"study_design_scores_gemma":[0.0008899411,0.0001335734,0.02530068,0.0000489566,0.00001761303,0.00004847383,0.00043582084,0.9726128,0.000054778957,0.00015912317,0.00006428231,0.00023398735],"about_ca_topic_score_codex":0.0004576058,"about_ca_topic_score_gemma":0.00024808236,"teacher_disagreement_score":0.51489216,"about_ca_system_score_codex":0.000031855212,"about_ca_system_score_gemma":0.00003806238,"threshold_uncertainty_score":0.503599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06433988,0.00012881627,0.9334139,0.0011470146,0.00031526864,0.00027708564,0.000006317465,0.00017916464,0.00019250589],"genre_scores_gemma":[0.99323225,0.0017010756,0.0048285616,0.00006888743,0.000009126637,0.00007437282,0.000016308968,0.000011486523,0.000057958274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867153,0.00029944401,0.00042516104,0.0002307994,0.00019070067,0.00018234164],"domain_scores_gemma":[0.9983875,0.00033856355,0.00012374067,0.0010523858,0.00004647434,0.000051299103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122348,0.000120455414,0.00018980671,0.00030827182,0.00027185565,0.00006699403,0.0005688052,0.00006771301,0.0000042158144],"category_scores_gemma":[0.000008835329,0.0001319459,0.00006464861,0.0008076787,0.00007029274,0.00028093607,0.000022876175,0.00024580536,0.000008036598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028901397,0.0001478845,0.00003489626,0.0000061011383,0.000024689376,7.2090387e-7,0.0010337703,0.98224664,0.0016154768,0.0025808818,0.000025293855,0.012254721],"study_design_scores_gemma":[0.00079091167,0.0000727115,0.00037985403,0.000121992,0.000013158596,0.0000024707858,0.00020687711,0.99748766,0.00058166083,0.0001151629,0.000080008955,0.00014752905],"about_ca_topic_score_codex":0.00020364286,"about_ca_topic_score_gemma":0.00019283386,"teacher_disagreement_score":0.9288923,"about_ca_system_score_codex":0.000061737526,"about_ca_system_score_gemma":0.000052197018,"threshold_uncertainty_score":0.5380598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006652042,0.00013506087,0.98976904,0.0003827381,0.00031732826,0.00030363092,2.372277e-7,0.00037459572,0.0020653093],"genre_scores_gemma":[0.9078161,8.7697333e-7,0.0904138,0.0010759669,0.00013209123,0.00007270925,0.000021959966,0.000012508347,0.00045399138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984134,0.000080586025,0.00026625578,0.00043237282,0.00032901196,0.0004783887],"domain_scores_gemma":[0.99919647,0.00023175245,0.00012445575,0.00032004132,0.000052973865,0.00007429818],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00091651635,0.00014354126,0.00016959243,0.0000823143,0.0016375066,0.00019035849,0.000706314,0.000025196125,0.000016942073],"category_scores_gemma":[0.00003540079,0.0001480853,0.00014898869,0.00033243187,0.00001393074,0.00012192364,0.0005833274,0.00030538253,0.000004623227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014153617,0.000029852941,0.0002937055,0.000018187946,0.000017014614,0.0000021774742,0.00026631937,0.9812669,0.000030056588,0.011546952,0.0003114883,0.006203164],"study_design_scores_gemma":[0.000617743,0.0001584146,0.000018154991,0.00001083517,0.000007678765,0.0000067050846,0.00019209343,0.99310046,0.000013812517,0.00007860647,0.005590876,0.00020462809],"about_ca_topic_score_codex":0.00007588507,"about_ca_topic_score_gemma":0.0000045697398,"teacher_disagreement_score":0.90116405,"about_ca_system_score_codex":0.00011335472,"about_ca_system_score_gemma":0.00006387949,"threshold_uncertainty_score":0.9996622},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85616875,0.00003473794,0.13336132,0.0004193464,0.00007078413,0.009113951,0.0000027651563,0.00039062332,0.0004377174],"genre_scores_gemma":[0.99614173,0.000044980363,0.0009626477,0.000035284484,0.00007723756,0.002132367,0.0000016687278,0.000020258813,0.0005838301],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795854,0.000034282366,0.00028986216,0.00021861169,0.00032546296,0.0011732483],"domain_scores_gemma":[0.99938405,0.000018365945,0.00016294913,0.00021671731,0.00016934492,0.000048590082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014030237,0.00014342186,0.00018520636,0.00022740799,0.00018678705,0.00005582911,0.000525927,0.000048846458,0.0000019841739],"category_scores_gemma":[0.0000051964316,0.00011062408,0.000100484154,0.00040645007,0.000025493631,0.00050641777,0.000032052933,0.0006608664,0.000003943236],"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.0026999682,0.00045997073,0.047030482,0.00059657876,0.0010373746,0.00005819046,0.0014894995,0.002039146,0.5049145,0.040103436,0.0008023472,0.39876845],"study_design_scores_gemma":[0.016773203,0.014407072,0.006785153,0.0028566066,0.00027409595,0.004097482,0.0014646029,0.693118,0.20917864,0.020136595,0.027750608,0.003157928],"about_ca_topic_score_codex":0.000008862423,"about_ca_topic_score_gemma":0.000103177,"teacher_disagreement_score":0.69107884,"about_ca_system_score_codex":0.00017777382,"about_ca_system_score_gemma":0.001366134,"threshold_uncertainty_score":0.4511119},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95617104,0.000040350533,0.03992657,0.00023037648,0.0007576003,0.0002844122,0.00006804157,0.00062943134,0.0018921893],"genre_scores_gemma":[0.99749947,0.00009897345,0.00008608544,0.00010754654,0.0000836152,0.000002290289,0.000038803915,0.000026425096,0.0020568003],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972322,0.00039089067,0.0002411533,0.0014113309,0.00018142167,0.00054298085],"domain_scores_gemma":[0.99795055,0.00024943167,0.00034947216,0.0011564634,0.00012813658,0.00016594224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089395535,0.00036808054,0.0005033399,0.00042299385,0.00017822665,0.00022280935,0.002088722,0.00039361257,0.0000057321813],"category_scores_gemma":[0.00006226711,0.00045568275,0.00022971588,0.0008523759,0.000061785344,0.000674957,0.001772569,0.0010872525,0.000109262015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007594359,0.0008385394,0.5122413,0.00013101686,0.00043348927,0.0019075262,0.0084483195,0.326812,0.00028079853,0.14649503,0.0010120894,0.0013239711],"study_design_scores_gemma":[0.00079883926,0.000108130516,0.08889195,0.00013461376,0.000057427234,6.5324764e-7,0.0007191001,0.81149477,0.000035058896,0.0968378,0.000029325274,0.0008922982],"about_ca_topic_score_codex":0.002419043,"about_ca_topic_score_gemma":0.0019942932,"teacher_disagreement_score":0.4846828,"about_ca_system_score_codex":0.0010967646,"about_ca_system_score_gemma":0.00025358427,"threshold_uncertainty_score":0.9997895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7835683,0.00016241649,0.21187565,0.0008523343,0.0032283573,0.0001495818,0.0000058762826,0.00009299671,0.00006448958],"genre_scores_gemma":[0.99432534,0.000008388884,0.0033569895,0.0015367888,0.0003029779,0.0000066179937,0.000002933332,0.00002235878,0.00043759577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774444,0.00029952612,0.0006501659,0.0003374149,0.00043790916,0.0005305455],"domain_scores_gemma":[0.9976853,0.0011235953,0.00042642822,0.00031123383,0.00031855598,0.00013488968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021945804,0.00021102572,0.00041328816,0.0003925476,0.00012488732,0.00025634913,0.0013292581,0.000097899174,0.000008256591],"category_scores_gemma":[0.000205694,0.00019745227,0.0002801374,0.00048909476,0.00004848223,0.00024186839,0.00015682695,0.0006476721,0.000025201609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012560633,0.00046897007,0.049023014,0.0003206428,0.0006275469,0.0011060694,0.010506156,0.63967764,0.024306903,0.0019535895,0.24095473,0.029798657],"study_design_scores_gemma":[0.0016814431,0.00036768493,0.009258887,0.00068305584,0.000015856198,0.00016929246,0.000053819054,0.9809474,0.0022951968,0.0025632747,0.001595929,0.0003681992],"about_ca_topic_score_codex":0.0012015655,"about_ca_topic_score_gemma":0.00011144294,"teacher_disagreement_score":0.3412697,"about_ca_system_score_codex":0.00011012456,"about_ca_system_score_gemma":0.00013185813,"threshold_uncertainty_score":0.80518705},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53131616,0.00013624987,0.46799067,0.00021062586,0.00020839929,0.000073720694,0.000001614501,0.00004758585,0.000014973939],"genre_scores_gemma":[0.9980211,0.000018951625,0.0014201087,0.000078957055,0.0003678102,0.0000023804237,0.0000021567632,0.000011541218,0.00007695678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986364,0.00008654754,0.00049830956,0.00022221802,0.00025957983,0.00029690462],"domain_scores_gemma":[0.9988646,0.0002462214,0.00030907683,0.00009558118,0.00040634337,0.00007817244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092383986,0.00013073452,0.00026541084,0.00029199722,0.00023033896,0.0002552223,0.00039351924,0.00008167163,4.3396957e-7],"category_scores_gemma":[0.00007036047,0.00012273341,0.000059188984,0.000714893,0.000031234737,0.0005547333,0.0000778734,0.00044844317,4.406291e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012872288,0.00018324188,0.016250942,0.00039881913,0.00008027082,0.0002106726,0.004776146,0.094282605,0.015419184,0.0014600665,0.00078990444,0.8660194],"study_design_scores_gemma":[0.00060126407,0.00023226738,0.0029039981,0.00032624547,0.000011593888,0.00011135029,0.0002512065,0.9937822,0.0005262753,0.0010053429,0.00008406447,0.00016417558],"about_ca_topic_score_codex":0.000024167863,"about_ca_topic_score_gemma":0.000027410028,"teacher_disagreement_score":0.8994996,"about_ca_system_score_codex":0.0001278036,"about_ca_system_score_gemma":0.00021505397,"threshold_uncertainty_score":0.50049233},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71522933,0.0003986167,0.2794697,0.0034986772,0.00009887055,0.0006826109,0.000027040966,0.00032388602,0.00027124543],"genre_scores_gemma":[0.99792033,0.00031455577,0.0008140056,0.00029023617,0.0000778458,0.00012896993,0.00011307951,0.0000101508185,0.0003308403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989218,0.00008747055,0.00030815194,0.00031264246,0.00016806016,0.00020183565],"domain_scores_gemma":[0.9992207,0.0002607779,0.000103968,0.0002285205,0.000092671784,0.000093355695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069617317,0.00014821588,0.00015676375,0.00032607157,0.00031174434,0.00016283443,0.00018600108,0.00008764745,0.0000021434762],"category_scores_gemma":[0.00012628388,0.00014335381,0.000024744548,0.00064738374,0.000045260513,0.0012337655,0.00021216675,0.00018746256,0.000042478852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002678203,0.00007297854,0.0023387398,0.00011956409,0.000029704854,0.0000022583845,0.0029107307,0.000662505,0.0033855618,0.87661654,0.0002909599,0.113543674],"study_design_scores_gemma":[0.0007617647,0.000055098913,0.009987763,0.000041434923,0.00001759201,0.000015324575,0.00033496,0.97066915,0.00041293228,0.01312738,0.004300223,0.0002763576],"about_ca_topic_score_codex":0.00006332237,"about_ca_topic_score_gemma":0.000024707097,"teacher_disagreement_score":0.97000664,"about_ca_system_score_codex":0.000020247035,"about_ca_system_score_gemma":0.000026190532,"threshold_uncertainty_score":0.5845799},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02085518,0.000017428345,0.9741594,0.00036147938,0.00008177688,0.000110271125,0.0000061851165,0.00016177775,0.004246484],"genre_scores_gemma":[0.95096475,3.0825802e-7,0.041691355,0.0003891651,0.000017455597,0.000020993124,0.0000017440309,0.0000058553137,0.006908372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993249,0.000021217747,0.000064807966,0.0002440489,0.00017689374,0.0001680918],"domain_scores_gemma":[0.99962133,0.000058095397,0.000034759712,0.0001949783,0.00004955009,0.000041289964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012489063,0.00006983597,0.0000719141,0.000052402964,0.00032167303,0.0000516168,0.00041453924,0.0000090790645,0.0000086544505],"category_scores_gemma":[0.000004671954,0.00006169431,0.00004127291,0.0001386964,0.000012345933,0.00021288019,0.0002825203,0.000094871284,0.0000019977138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024272095,0.00011700376,0.00013745404,0.000007775388,0.000053992557,0.000047484235,0.0028613417,0.52840626,0.0009087395,0.4285076,0.0050010057,0.03370862],"study_design_scores_gemma":[0.00037417238,0.00021505532,0.000009327414,0.0000026569776,0.000004284702,0.000019989406,0.00033863707,0.99774796,0.00002246229,0.0006797849,0.00047820102,0.000107448424],"about_ca_topic_score_codex":0.00010062114,"about_ca_topic_score_gemma":0.000022478054,"teacher_disagreement_score":0.93246806,"about_ca_system_score_codex":0.00006606513,"about_ca_system_score_gemma":0.00008937884,"threshold_uncertainty_score":0.2515821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063134884,0.000019209103,0.9438561,0.0007725322,0.00014388507,0.044090915,8.175271e-7,0.001247792,0.0035552243],"genre_scores_gemma":[0.79379004,8.521396e-7,0.00032967626,0.000080831116,0.000013879482,0.20019291,0.0000057364587,0.0000077231725,0.005578332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992165,0.00012407565,0.00017337115,0.00018622323,0.00012179329,0.00017801157],"domain_scores_gemma":[0.99942064,0.0001632733,0.000049138886,0.0002694304,0.000066624205,0.000030898456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046520843,0.000067151705,0.00009456983,0.00013682926,0.00019513947,0.00024798847,0.00039016412,0.00003103118,0.0000017109002],"category_scores_gemma":[0.00003762802,0.00005920803,0.00003229537,0.00046000286,0.000008609049,0.00008440272,0.00015896746,0.00008156681,0.000019777142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024809466,0.00013597845,0.00029716126,0.00005705966,0.000011980179,0.000010055846,0.0006779465,0.87354624,0.0010304144,0.10894912,0.006025247,0.009233958],"study_design_scores_gemma":[0.00047955432,0.00003676218,0.00011720772,0.000048036956,3.640774e-7,0.0000016469644,0.0001455575,0.98235637,0.00004319452,0.00004697008,0.016644908,0.00007942827],"about_ca_topic_score_codex":0.0006170723,"about_ca_topic_score_gemma":0.000062791834,"teacher_disagreement_score":0.94352645,"about_ca_system_score_codex":0.000045532703,"about_ca_system_score_gemma":0.000048105227,"threshold_uncertainty_score":0.24144334},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19675684,0.0021940756,0.7849784,0.0048826225,0.0022271897,0.0024873428,0.000072936455,0.0019901295,0.0044104513],"genre_scores_gemma":[0.99393964,0.00023792798,0.00061918143,0.00009131426,0.00025822717,0.00023095726,0.000045054694,0.000063306514,0.0045143934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944313,0.0003960998,0.00044201067,0.0015656066,0.0019987302,0.001166239],"domain_scores_gemma":[0.99574274,0.0006673099,0.00011284012,0.0022104133,0.00084355444,0.0004231517],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029144038,0.00037904605,0.0004909023,0.0007264309,0.00038408142,0.0011868094,0.0032486308,0.00031547414,0.00004165375],"category_scores_gemma":[0.00027625007,0.0003228277,0.0002386622,0.00077157427,0.00023112468,0.00016218662,0.0065448172,0.0031728845,0.0009156639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011318476,0.0021631045,0.06749439,0.00917981,0.0022341968,0.011697966,0.014277691,0.07426041,0.0017205104,0.13957174,0.044816736,0.6314516],"study_design_scores_gemma":[0.0012245958,0.0010030726,0.0155142285,0.0073102866,0.00003560871,0.000064148175,0.0011792529,0.94716793,0.0017937887,0.012343128,0.010670324,0.0016936227],"about_ca_topic_score_codex":0.0038984937,"about_ca_topic_score_gemma":0.00071077223,"teacher_disagreement_score":0.8729075,"about_ca_system_score_codex":0.0005050927,"about_ca_system_score_gemma":0.0007022448,"threshold_uncertainty_score":0.9999224},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056671808,0.0007289911,0.08061642,0.008567735,0.00038641618,0.00025275574,0.000006774078,0.0017438504,0.9076404],"genre_scores_gemma":[0.0005561473,0.000099771576,0.0001495033,0.0022194549,0.000096308984,0.000021531609,0.0000026893938,0.00008709354,0.9967675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995514,0.00001385272,0.000045454122,0.00021614991,0.00009835407,0.00007478483],"domain_scores_gemma":[0.9994581,0.000037737842,0.000033958055,0.0004392745,0.000010687354,0.000020239528],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000072719224,0.000072960065,0.00006210238,0.000032988133,0.00004876966,0.00005555795,0.000343116,0.00005689461,0.000059523765],"category_scores_gemma":[0.000001915268,0.00004502911,0.000018376531,0.0001179716,0.000009105887,0.000024712941,0.0003010774,0.000057047026,0.0011263618],"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":[4.979417e-7,0.000003972116,0.000041105326,0.000012517261,0.00001729939,0.0000011948191,0.0000626803,0.0000018830726,0.00012393891,0.016193159,0.9508136,0.032728147],"study_design_scores_gemma":[0.000050341423,0.0000030496699,0.00007675854,0.000016413162,0.000004809973,0.000003940258,0.0000073205547,0.009729939,0.000008932173,0.0001896481,0.9898192,0.000089647365],"about_ca_topic_score_codex":0.0021980258,"about_ca_topic_score_gemma":0.0076073688,"teacher_disagreement_score":0.089127116,"about_ca_system_score_codex":0.000011150527,"about_ca_system_score_gemma":0.0000075987273,"threshold_uncertainty_score":0.9996514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002231215,0.0011333299,0.9902251,0.005148946,0.00019309174,0.0003386955,0.000007522033,0.00036170127,0.0003604334],"genre_scores_gemma":[0.9937066,0.0007114564,0.004075019,0.00085162604,0.00008174903,0.00013427967,0.000012916473,0.000021666765,0.00040470916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988509,0.00012690351,0.00024402406,0.00034750978,0.0001318573,0.0002988479],"domain_scores_gemma":[0.99774665,0.0009544376,0.00008286087,0.0010585008,0.00005469102,0.00010284254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005131933,0.00016057752,0.00017161205,0.00021074215,0.0014730449,0.00020147866,0.0006805121,0.00008770022,8.29712e-7],"category_scores_gemma":[8.583888e-7,0.00016319726,0.00008572239,0.00058909727,0.00010695453,0.00019217006,0.000021363305,0.00031813933,0.00000242992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022399909,0.000042483895,0.00008028918,0.000015523688,0.00003366888,0.0000013040059,0.000299871,0.0073633175,0.00006113757,0.00033198294,0.00026458714,0.99148345],"study_design_scores_gemma":[0.00043325056,0.00011696203,0.000071942515,0.00010682925,0.000026100892,0.000006362854,0.000050471856,0.9843113,0.000018438961,0.00040519523,0.014267465,0.00018568161],"about_ca_topic_score_codex":0.0002784831,"about_ca_topic_score_gemma":0.0002709064,"teacher_disagreement_score":0.99147534,"about_ca_system_score_codex":0.000023448241,"about_ca_system_score_gemma":0.00002790174,"threshold_uncertainty_score":0.9998269},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2601628,0.00011045702,0.62837636,0.00453558,0.0011912036,0.00022873252,0.000013736914,0.0052447654,0.10013638],"genre_scores_gemma":[0.99284405,0.000005705279,0.0016898613,0.00028883226,0.000041814816,0.000010599523,0.0000056221,0.000003474207,0.005110074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.00002051802,0.00008107418,0.00019885655,0.00013649696,0.00017495055],"domain_scores_gemma":[0.9996134,0.000054290264,0.000018687999,0.00023152209,0.00003217691,0.000049917282],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010634347,0.000056466757,0.000060150844,0.00006675945,0.00010501708,0.0001263925,0.00028226626,0.000019045407,0.000046474044],"category_scores_gemma":[0.00001560914,0.00005067899,0.000042766093,0.00033711173,0.00000961924,0.0003076015,0.00015080521,0.00005500751,0.0010811248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018490937,0.00010559195,0.0057614674,0.000010954796,0.00009609264,0.00022419961,0.002210436,0.004170421,0.0038917616,0.60863554,0.24077983,0.13409518],"study_design_scores_gemma":[0.00032958097,0.000107709246,0.012883017,0.000036434874,0.000005066788,0.0000095701,0.0003476637,0.9745707,0.0008762067,0.007025952,0.0035374563,0.00027064254],"about_ca_topic_score_codex":0.00012981673,"about_ca_topic_score_gemma":0.00003256393,"teacher_disagreement_score":0.9704003,"about_ca_system_score_codex":0.000014367399,"about_ca_system_score_gemma":0.000020049116,"threshold_uncertainty_score":0.9996967},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002931,0.00007509958,0.698127,0.00012337006,0.00024007409,0.00033593984,0.000006976435,0.00060327933,0.00019516792],"genre_scores_gemma":[0.9939092,0.000045473324,0.005346215,0.00013604749,0.000025827274,0.00008171014,0.000012232575,0.000022539298,0.00042079488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981337,0.00035738188,0.00033822315,0.00056244916,0.00026953686,0.00033869938],"domain_scores_gemma":[0.99852306,0.00043364885,0.00010534371,0.00069478014,0.00011624357,0.00012694934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328715,0.00023350355,0.00027247946,0.0002501248,0.0010167074,0.00027417587,0.00057568203,0.000075870776,0.0000034941427],"category_scores_gemma":[0.0000055114688,0.00023481224,0.00011020321,0.0007872474,0.00009125733,0.0002739,0.000030069476,0.00048061466,0.00004081261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021616102,0.00042073123,0.00004839758,0.000035686862,0.00009701261,0.000011598793,0.0054468615,0.6898714,0.010340279,0.0003541023,0.00017997992,0.29317236],"study_design_scores_gemma":[0.0008792747,0.00009387624,0.0003286812,0.000082391954,0.000019675435,0.00003361904,0.00058991247,0.99513584,0.0024941755,0.0000126058185,0.00006922328,0.00026070018],"about_ca_topic_score_codex":0.00025275123,"about_ca_topic_score_gemma":0.000035054916,"teacher_disagreement_score":0.6936161,"about_ca_system_score_codex":0.00008675402,"about_ca_system_score_gemma":0.0000490574,"threshold_uncertainty_score":0.9575365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16254432,0.00014551768,0.8291361,0.0025890814,0.002755317,0.000315783,0.0000010728867,0.0013112208,0.0012015804],"genre_scores_gemma":[0.995167,0.0000053739823,0.0005670994,0.0026475352,0.0005733681,0.000030526815,0.00005741251,0.000026938245,0.00092471944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802476,0.00014196486,0.00027943315,0.0005261843,0.0004881989,0.0005394797],"domain_scores_gemma":[0.99898374,0.0001648461,0.00013773546,0.0005081062,0.000067612564,0.00013797525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036907976,0.0002839779,0.00021954531,0.0002536292,0.00017330972,0.00026839893,0.0007990607,0.000079323065,0.000034080836],"category_scores_gemma":[0.00002187246,0.00022312782,0.00016135015,0.00060653733,0.00003263676,0.00014483195,0.00014279298,0.00061173417,0.0001622634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011611031,0.00002288036,0.0018022524,0.000014982993,0.00003461035,0.00012629379,0.0003435443,0.9798992,0.00004803822,0.0019158251,0.0040759076,0.011600327],"study_design_scores_gemma":[0.00046786276,0.0007130045,0.0005630029,0.00017243823,0.000012186296,0.0000068199247,0.000073043164,0.9866842,0.00037058492,0.00003686564,0.010601597,0.00029841164],"about_ca_topic_score_codex":0.00018185494,"about_ca_topic_score_gemma":0.00013272943,"teacher_disagreement_score":0.8326227,"about_ca_system_score_codex":0.000083679624,"about_ca_system_score_gemma":0.000047633963,"threshold_uncertainty_score":0.90988886},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97172225,0.000071311835,0.02690349,0.00039454183,0.0007087931,0.000044559045,7.1521197e-7,0.00006486775,0.00008946564],"genre_scores_gemma":[0.9968431,9.826311e-7,0.002730399,0.00031338018,0.00006373372,0.0000020454308,0.0000015235213,0.000009062162,0.000035752757],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985715,0.00015474782,0.00045257734,0.0001926264,0.0004231206,0.00020541358],"domain_scores_gemma":[0.99917305,0.00008444885,0.00031428062,0.00022531027,0.00009649585,0.000106426196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903896,0.00011292985,0.00019236909,0.0006397851,0.00003654213,0.00020611622,0.001004398,0.000052591073,0.000008977717],"category_scores_gemma":[0.00007036414,0.0001040319,0.000105925894,0.00035703316,0.00007048635,0.000547251,0.00006282722,0.00038106786,0.0000026615692],"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.000068442445,0.00009149615,0.013831627,0.000025489262,0.000026184596,0.00007302419,0.021362294,0.010120252,0.9484552,0.00047608095,0.0012407854,0.0042290892],"study_design_scores_gemma":[0.00071706634,0.00037749024,0.0037613972,0.00042580251,0.000004592967,0.00008774457,0.0005286526,0.5415866,0.4510195,0.0013072491,0.0000167425,0.0001671854],"about_ca_topic_score_codex":0.0004980301,"about_ca_topic_score_gemma":0.000013067855,"teacher_disagreement_score":0.5314663,"about_ca_system_score_codex":0.00005639533,"about_ca_system_score_gemma":0.0000888511,"threshold_uncertainty_score":0.42422977},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076992095,0.000059106853,0.92154706,0.00015183649,0.00068385823,0.00020052053,5.9765136e-7,0.00035371337,0.000011230993],"genre_scores_gemma":[0.8879602,0.000016605538,0.111421615,0.0004279737,0.00012629555,0.000013738511,0.000015567672,0.000009814226,0.000008210259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998759,0.00006781066,0.00040907288,0.00026604164,0.0001537782,0.00034434945],"domain_scores_gemma":[0.99882007,0.00066331826,0.00020179039,0.00018981709,0.00007071445,0.000054294116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809763,0.00015006437,0.00022757401,0.00034458502,0.00011033652,0.00023886816,0.00037612475,0.0001266757,4.453718e-7],"category_scores_gemma":[0.00014137625,0.00015464997,0.000072571005,0.0007425607,0.000013943636,0.0010140026,0.00037324525,0.00034777683,0.0000030398678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053943764,0.00004480492,0.02794826,0.00012989974,0.000048458704,0.000006108091,0.006638135,0.37210503,0.000015060856,0.04502273,0.0010948912,0.54689264],"study_design_scores_gemma":[0.00038568454,0.00006250645,0.0045782775,0.00024353665,0.0000056419976,0.000012420114,0.000015681248,0.9915922,0.000007584661,0.002855064,0.00008916725,0.0001522174],"about_ca_topic_score_codex":0.00016744416,"about_ca_topic_score_gemma":0.0000055127684,"teacher_disagreement_score":0.8109681,"about_ca_system_score_codex":0.000052391024,"about_ca_system_score_gemma":0.000025042136,"threshold_uncertainty_score":0.63064426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28105867,0.0001599014,0.7173869,0.00008294052,0.0009996118,0.00015689209,9.603862e-7,0.0001447256,0.000009355644],"genre_scores_gemma":[0.9984881,0.00024398424,0.00096073345,0.00009556922,0.00007488038,0.00004044834,4.771368e-7,0.000007865598,0.00008789903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883485,0.000015278385,0.00018607025,0.00031258355,0.00020916726,0.00044206585],"domain_scores_gemma":[0.9993425,0.00035027604,0.00003662284,0.00012688334,0.000063191255,0.00008053342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012860039,0.0001151264,0.00014055625,0.00024194615,0.00037594425,0.00024779685,0.00019641187,0.000047969315,2.7588334e-7],"category_scores_gemma":[0.000018030334,0.00011800882,0.00003586137,0.00086539896,0.00003296482,0.00039470627,0.000011016015,0.00019831806,0.0000011480038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000317091,0.0000074281343,0.000419842,0.00001007412,0.0000068764657,0.0000013124425,0.0003328383,0.9754905,0.00030938615,0.0003081477,0.00006409324,0.02304632],"study_design_scores_gemma":[0.00019128971,0.000052205767,0.0018093882,0.00009349024,0.000004722425,0.0000033904557,0.00011569174,0.9970932,0.00015762898,0.000016967086,0.00032721183,0.00013483074],"about_ca_topic_score_codex":0.00005161445,"about_ca_topic_score_gemma":0.000035532772,"teacher_disagreement_score":0.71742946,"about_ca_system_score_codex":0.00013800549,"about_ca_system_score_gemma":0.00003495862,"threshold_uncertainty_score":0.48122603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25798014,0.00003893637,0.7401789,0.00030207593,0.001298252,0.00006970988,0.000002666975,0.000084311294,0.00004500766],"genre_scores_gemma":[0.9985706,0.00001109944,0.00075076835,0.00012838161,0.0001414754,0.0000060003176,0.000009063368,0.000009126737,0.00037347415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983469,0.00020406081,0.0005159667,0.0002643741,0.00035846856,0.00031020344],"domain_scores_gemma":[0.99887925,0.00030280027,0.00034857728,0.00016346201,0.00021345868,0.000092452035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020515455,0.00013423368,0.00035736416,0.00064096623,0.00008805468,0.00019648562,0.00064064626,0.00009824065,0.000008534102],"category_scores_gemma":[0.00020523254,0.00012641252,0.00038836873,0.0008145827,0.000030017007,0.00045339274,0.00006338297,0.00061716215,0.0000036098786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028310402,0.00013787516,0.19989446,0.000023650602,0.0007302066,0.00008133176,0.0010588819,0.7878793,0.0008985713,0.00069208443,0.0025258234,0.005794752],"study_design_scores_gemma":[0.00076015486,0.00019788147,0.025182089,0.00008085927,0.00008451398,0.000012157974,0.00004759182,0.97279555,0.00021448675,0.00040848914,0.000108815824,0.00010741023],"about_ca_topic_score_codex":0.00034213497,"about_ca_topic_score_gemma":0.000079197875,"teacher_disagreement_score":0.74059045,"about_ca_system_score_codex":0.0000956038,"about_ca_system_score_gemma":0.000048895523,"threshold_uncertainty_score":0.51549524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12406583,0.0012361966,0.87310594,0.00034828723,0.0007352139,0.00028900345,2.2717155e-7,0.0001791361,0.00004017046],"genre_scores_gemma":[0.99655205,0.00013417957,0.001117078,0.0003281705,0.000067351066,0.00005262621,0.00001039601,0.000013070453,0.0017250909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988186,0.0000911522,0.00033376637,0.00026182295,0.00020058698,0.000294089],"domain_scores_gemma":[0.9990247,0.00030513058,0.0001954845,0.0003415268,0.00007882003,0.00005432852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083110493,0.00013112763,0.00017120967,0.000059951537,0.00018844768,0.00010154953,0.00066292105,0.00005128171,0.0000017092912],"category_scores_gemma":[0.0000743756,0.000094730334,0.00014067031,0.00021415179,0.000040079944,0.00013770258,0.00035385104,0.00026552405,0.000012448662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030085557,0.000015125935,0.0006247356,0.000012682509,0.00006569449,0.0000051306074,0.0020811101,0.9554654,0.00043788683,0.0023380679,0.00065672083,0.03826738],"study_design_scores_gemma":[0.00056852563,0.00013704314,0.0009952517,0.00007700256,0.0000139514195,0.0000029773291,0.00038833966,0.99636173,0.00013514535,0.000044068773,0.0011598011,0.00011614766],"about_ca_topic_score_codex":0.00009861193,"about_ca_topic_score_gemma":0.00006913057,"teacher_disagreement_score":0.87248623,"about_ca_system_score_codex":0.00003731585,"about_ca_system_score_gemma":0.00001900082,"threshold_uncertainty_score":0.3862991},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61184573,0.000046572506,0.38549942,0.0013384979,0.00043569313,0.00015310824,0.0000016876413,0.0005445698,0.0001347559],"genre_scores_gemma":[0.9927857,0.0000047370627,0.004244798,0.0012701768,0.000024802612,0.000025560905,0.000015175542,0.000012942889,0.0016160896],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825335,0.00013787222,0.0003062698,0.00050166337,0.0003565773,0.00044429247],"domain_scores_gemma":[0.99910235,0.00008803619,0.000053071646,0.0005698073,0.00007323315,0.000113470145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212954,0.00017322843,0.00021599379,0.0003469446,0.00013687283,0.00013177395,0.0005675768,0.00007932421,0.0000071236486],"category_scores_gemma":[0.00007065547,0.000155886,0.0001343362,0.0008049762,0.000020395932,0.00031543148,0.00018472792,0.00028529507,0.00018522289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002144546,0.0026384394,0.4752719,0.00023028624,0.0002695084,0.0053250655,0.0054204282,0.09934652,0.16973594,0.16878034,0.0063796453,0.06638748],"study_design_scores_gemma":[0.0020013996,0.000042915162,0.031943914,0.000051991163,0.0000046281607,0.0000053946237,0.000117521275,0.9635824,0.000975684,0.00005292957,0.00096238166,0.0002588735],"about_ca_topic_score_codex":0.0035501197,"about_ca_topic_score_gemma":0.00070113176,"teacher_disagreement_score":0.8642359,"about_ca_system_score_codex":0.00008476243,"about_ca_system_score_gemma":0.000047130314,"threshold_uncertainty_score":0.63568467},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66377145,0.000051005623,0.3352066,0.0005155042,0.00022107639,0.00019235493,0.000011637393,0.000026121726,0.000004254555],"genre_scores_gemma":[0.9909923,0.000053352316,0.008776124,0.00011599566,0.000022772145,0.000008948352,0.000016304708,0.0000068917075,0.000007284961],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99837196,0.00007337793,0.00075322244,0.0001607979,0.00052047946,0.00012016883],"domain_scores_gemma":[0.99786353,0.00019730904,0.00078937254,0.00023298831,0.0008464095,0.000070393304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777476,0.00010164471,0.0002822404,0.00022913283,0.000030848543,0.000011258991,0.00026857958,0.000082192404,9.152245e-7],"category_scores_gemma":[0.00009449459,0.00009292549,0.00014958077,0.0007367099,0.000010859596,0.00037288948,0.000004623701,0.00024644428,4.2333218e-7],"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.0006321215,0.00018424366,0.0010221541,0.00015759568,0.000026402215,0.000018832667,0.0010525256,0.23749606,0.7195457,0.0004400651,0.00001464206,0.039409645],"study_design_scores_gemma":[0.0014401696,0.0014038947,0.8660363,0.0010009634,0.00005051034,0.0000024986282,0.00043921306,0.04263902,0.086346686,0.00032780855,0.000072615665,0.00024032933],"about_ca_topic_score_codex":0.000018281771,"about_ca_topic_score_gemma":0.00004574491,"teacher_disagreement_score":0.86501414,"about_ca_system_score_codex":0.00004902351,"about_ca_system_score_gemma":0.00006819204,"threshold_uncertainty_score":0.37893915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17194502,0.00011632359,0.8265527,0.0004968702,0.00016694743,0.0005009097,0.00001605817,0.00016434737,0.00004083684],"genre_scores_gemma":[0.9968277,0.0015389802,0.0011024527,0.000043286287,0.0000053071917,0.00038933993,0.000024024726,0.000011346038,0.00005757097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.00021822254,0.00040367746,0.00025947636,0.00017480558,0.00019029128],"domain_scores_gemma":[0.9983423,0.00026222534,0.0001248277,0.0010767679,0.00013088623,0.000063037725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033140782,0.00013303114,0.0001975656,0.00037820672,0.0003189434,0.00007273823,0.00060085946,0.000079367885,0.0000027470364],"category_scores_gemma":[0.000005620104,0.00013843703,0.000070263355,0.0008133548,0.00008980954,0.00021773213,0.000025658577,0.00033042507,0.0000048522934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006854884,0.00020228482,0.00006882342,0.000009559017,0.0000123065065,5.261271e-7,0.0008184922,0.9664895,0.0007232703,0.00056053686,0.000012206433,0.031095631],"study_design_scores_gemma":[0.00034900752,0.000060089555,0.00064881984,0.00013352429,0.000011086139,0.0000029150772,0.00041735327,0.9975733,0.00064558844,0.000010391977,0.000020082864,0.00012779656],"about_ca_topic_score_codex":0.000522477,"about_ca_topic_score_gemma":0.0007240736,"teacher_disagreement_score":0.82545024,"about_ca_system_score_codex":0.0000812457,"about_ca_system_score_gemma":0.000048977403,"threshold_uncertainty_score":0.5645298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18882215,0.000019106783,0.80896115,0.000612059,0.00036869236,0.00019258207,4.950734e-7,0.00048600853,0.00053775054],"genre_scores_gemma":[0.99500316,0.0000066982598,0.00071432523,0.00035367455,0.000025706706,0.000032853684,0.0000336014,0.000009453361,0.0038205371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853724,0.00015495376,0.00030502718,0.0003884975,0.00028382128,0.00033043453],"domain_scores_gemma":[0.99941176,0.00009481971,0.000071250586,0.0002734447,0.000068838584,0.0000799055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058138755,0.00015443488,0.00016357141,0.00036009453,0.0002354272,0.00016842372,0.00036387995,0.000044243778,0.000024136101],"category_scores_gemma":[0.000060348568,0.00014111838,0.000101506615,0.00068507314,0.000022081573,0.0002646947,0.00018510506,0.0002597685,0.00020855908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014469431,0.0000957705,0.08415173,0.000021022504,0.000027091011,0.00011704607,0.00084031187,0.8986429,0.0038364977,0.0021784836,0.0006776238,0.009397078],"study_design_scores_gemma":[0.00084067736,0.000080377846,0.015862394,0.00005079633,0.0000026385044,9.861868e-7,0.0001678352,0.9822548,0.0002753447,0.0000136028275,0.00025660437,0.00019395286],"about_ca_topic_score_codex":0.0049512465,"about_ca_topic_score_gemma":0.0012709097,"teacher_disagreement_score":0.80824685,"about_ca_system_score_codex":0.00007739219,"about_ca_system_score_gemma":0.000087712775,"threshold_uncertainty_score":0.7484837},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288669,0.000030120904,0.06667369,0.0031985936,0.00027364955,0.0001368232,5.4344946e-7,0.000457523,0.00036213992],"genre_scores_gemma":[0.99477184,0.0000081000935,0.003969024,0.000282889,0.000019278665,0.000007884925,0.0000024097208,0.0000061357764,0.0009324627],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.00004186314,0.00013504938,0.0003519777,0.00014035925,0.00019975413],"domain_scores_gemma":[0.99955595,0.00006626158,0.000031301526,0.0002798617,0.000023564546,0.000043079308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031423784,0.000084329775,0.000098242344,0.00024301991,0.00010128584,0.000086620355,0.00020966273,0.000030596926,0.0000029520515],"category_scores_gemma":[0.00005789045,0.0000793029,0.000027387941,0.0005512299,0.000015807755,0.0002715196,0.0001300011,0.00014618918,0.00003843758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085131825,0.00045665284,0.23420085,0.00054424594,0.00012400272,0.0007723246,0.008218277,0.24531367,0.26136687,0.022126783,0.0077498783,0.21904132],"study_design_scores_gemma":[0.00025452478,0.000018495035,0.012009021,0.00004889776,0.0000015845818,0.0000051512925,0.00006816497,0.9870238,0.00016027663,0.000107851585,0.00018646175,0.00011582708],"about_ca_topic_score_codex":0.0005972193,"about_ca_topic_score_gemma":0.00019849934,"teacher_disagreement_score":0.74171007,"about_ca_system_score_codex":0.000059029087,"about_ca_system_score_gemma":0.000047371628,"threshold_uncertainty_score":0.32338786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47926623,0.000009795818,0.518855,0.0006959174,0.0003257605,0.00006459171,0.0000019389745,0.0006257417,0.00015503343],"genre_scores_gemma":[0.9969112,0.0000014510292,0.0016439204,0.0006657619,0.00011748441,0.000012931319,0.000015862548,0.000012880218,0.0006184564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984493,0.00008702899,0.00019199682,0.0004881776,0.0003973262,0.00038613175],"domain_scores_gemma":[0.99886996,0.0000914954,0.00003740782,0.00079136016,0.000050660135,0.00015909705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001854126,0.00016615684,0.00015772381,0.00017810444,0.00015317944,0.00023575455,0.0008610567,0.00006597514,0.00009028625],"category_scores_gemma":[0.0000109734965,0.00013928764,0.00012471975,0.0004122904,0.00005252588,0.00015893154,0.00024901304,0.00014930876,0.00038077432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049042876,0.005089682,0.017416034,0.00029417954,0.00044763606,0.0010125628,0.0032749441,0.24569286,0.2097612,0.26644143,0.031234005,0.21884502],"study_design_scores_gemma":[0.0007373246,0.00007952215,0.0065015093,0.000017371269,0.000005961295,0.0000031962907,0.000044263346,0.99024785,0.0017766863,0.00012535969,0.00024159638,0.00021934017],"about_ca_topic_score_codex":0.00017061726,"about_ca_topic_score_gemma":0.000014356658,"teacher_disagreement_score":0.744555,"about_ca_system_score_codex":0.000041544175,"about_ca_system_score_gemma":0.00007183781,"threshold_uncertainty_score":0.5679985},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016529752,0.000017245517,0.9959747,0.0002647903,0.00069485884,0.00016736377,0.000053741296,0.00044313545,0.000731186],"genre_scores_gemma":[0.89867157,0.00003720054,0.08990577,0.0014377268,0.00022791818,0.000108060776,0.001078949,0.000014200534,0.00851858],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994866,0.000013027989,0.00013191284,0.000120296565,0.00012036241,0.00012780006],"domain_scores_gemma":[0.9993313,0.000060355367,0.00003288077,0.00049890793,0.000046663616,0.000029885286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042950318,0.00004481193,0.000055803677,0.0000809461,0.00007852459,0.0002492759,0.000739686,0.000021790844,3.8052139e-7],"category_scores_gemma":[0.00004989076,0.000037907605,0.000018787632,0.0002201541,0.000004455187,0.0012842144,0.00035325807,0.000029299637,0.0002544991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010071408,0.0000457364,0.00045158432,0.00017443264,0.00004971212,0.000006480853,0.0010945135,0.0020531362,0.00046995573,0.44259015,0.44416416,0.108890064],"study_design_scores_gemma":[0.00019504272,0.000009954688,0.00012696577,0.00000550747,0.00000108058,0.000002347244,0.00013211796,0.91105545,0.000004086804,0.00006705575,0.08834539,0.000055005712],"about_ca_topic_score_codex":0.00008886042,"about_ca_topic_score_gemma":0.00000848887,"teacher_disagreement_score":0.9090023,"about_ca_system_score_codex":0.0000114882,"about_ca_system_score_gemma":0.000021325175,"threshold_uncertainty_score":0.32711557},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028010258,0.00021459725,0.5677227,0.0010129947,0.015311537,0.00095336133,0.000023790913,0.0016026633,0.41035736],"genre_scores_gemma":[0.23294474,0.0004458592,0.068693586,0.0066272644,0.0038163145,0.00010979441,0.000025439436,0.00043461926,0.6869024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949755,0.00002431869,0.0006073174,0.0019994564,0.0015119066,0.00088148325],"domain_scores_gemma":[0.9968103,0.00027505084,0.0002710502,0.002190053,0.00018887587,0.0002646766],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014550649,0.0005822602,0.0005998019,0.0012877417,0.00038909467,0.0008698842,0.004762869,0.00023835289,0.000037874182],"category_scores_gemma":[0.00004320578,0.0005961062,0.0002169995,0.0006677364,0.00051410554,0.00078689604,0.002717553,0.0009308696,0.0009898331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021175358,0.00011600505,0.00013945828,0.00012526875,0.000051229516,0.0011215745,0.000943252,0.012461137,0.00059617765,0.5500989,0.0075913076,0.4267345],"study_design_scores_gemma":[0.0008306507,0.00048595128,0.001427182,0.0022461216,0.000016148411,0.00006166512,0.000004006506,0.93790287,0.00069522165,0.03693664,0.017194023,0.0021994929],"about_ca_topic_score_codex":0.00015898162,"about_ca_topic_score_gemma":0.000074437776,"teacher_disagreement_score":0.92544174,"about_ca_system_score_codex":0.00033965224,"about_ca_system_score_gemma":0.00062987383,"threshold_uncertainty_score":0.999788},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009762542,0.0001805772,0.98188055,0.0063232253,0.0006899404,0.00037003937,0.000031618045,0.00045784476,0.00030368863],"genre_scores_gemma":[0.9867397,0.000034584544,0.011813932,0.0006655696,0.00023534917,0.00018404088,0.00017911958,0.000011426258,0.00013625644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895394,0.00018273808,0.00024605799,0.00025703802,0.00011705454,0.00024316083],"domain_scores_gemma":[0.9981091,0.0007154738,0.000063303094,0.0009876722,0.00008981241,0.000034615237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346496,0.00011105892,0.0001478197,0.00017696999,0.0005478382,0.00026710468,0.0015851451,0.00005365422,4.9410244e-7],"category_scores_gemma":[0.000015338454,0.00011785704,0.00009031308,0.000726903,0.000065009546,0.0003684371,0.00062298804,0.0001990625,0.000016456348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006445786,0.0011222551,0.01860242,0.000092700044,0.0002444915,0.00002255265,0.01289812,0.3184357,0.0011290641,0.25478104,0.12031611,0.2722911],"study_design_scores_gemma":[0.00045064176,0.00003561874,0.007904956,0.000038501275,0.000004743354,0.0000010130902,0.00002857669,0.9825773,0.0000048679067,0.0006696497,0.008164503,0.000119581106],"about_ca_topic_score_codex":0.000049180628,"about_ca_topic_score_gemma":0.00011840271,"teacher_disagreement_score":0.97697717,"about_ca_system_score_codex":0.00007066172,"about_ca_system_score_gemma":0.00010501498,"threshold_uncertainty_score":0.48060706},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95470715,0.0001138156,0.041139994,0.0005778009,0.0017395503,0.0006141254,0.000028517623,0.00030504106,0.0007739954],"genre_scores_gemma":[0.9991514,0.000009703707,0.000108964145,0.00019793086,0.00010504797,0.0002123583,0.00000482553,0.00001029572,0.00019947629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985551,0.000109149776,0.00037943496,0.00042562519,0.00014915281,0.0003814999],"domain_scores_gemma":[0.9989499,0.00035649317,0.00009027965,0.00041800342,0.00010609544,0.00007922874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077564875,0.00015738785,0.00027197515,0.0001997109,0.00013147402,0.00039282007,0.0013281,0.00008044431,0.0000028129903],"category_scores_gemma":[0.000028278191,0.00014320733,0.00011364742,0.0006696715,0.000030912983,0.00034513616,0.000064470674,0.00012378245,0.000044907876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080285675,0.0014958237,0.09558322,0.006301759,0.00051454693,0.00020511515,0.072722785,0.072394475,0.044664815,0.009329272,0.025378285,0.67060703],"study_design_scores_gemma":[0.0025634558,0.00024882425,0.05142285,0.000514195,0.000030892217,0.000022975579,0.0012330542,0.91494125,0.020066876,0.0025189337,0.0053761583,0.0010605432],"about_ca_topic_score_codex":0.00089517754,"about_ca_topic_score_gemma":0.0013214421,"teacher_disagreement_score":0.84254676,"about_ca_system_score_codex":0.00007429999,"about_ca_system_score_gemma":0.00006407038,"threshold_uncertainty_score":0.5839825},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9491505,0.00008183823,0.014559392,0.02004129,0.0011866183,0.00088202005,0.00014654898,0.0007019256,0.013249838],"genre_scores_gemma":[0.9893051,0.00004676115,0.009501261,0.00013280826,0.00002619646,0.000008042406,0.000030910916,0.000008350814,0.00094056554],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885863,0.000005031012,0.000221812,0.00032297536,0.0004296726,0.00016185179],"domain_scores_gemma":[0.9983845,0.000044286004,0.00019825612,0.0012666782,0.00008103316,0.000025270212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047245756,0.00008928548,0.00011289217,0.00008092167,0.00015041529,0.00011887671,0.005241433,0.000022080309,0.000005630865],"category_scores_gemma":[0.00011858956,0.000071629634,0.00005057053,0.0006103649,0.000045965924,0.0007350845,0.00652234,0.00009591504,0.00004899685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011449742,0.00047170656,0.040321507,0.0013123853,0.0006849296,0.000012724432,0.0014353752,0.00886314,0.002605308,0.30147642,0.5747765,0.06792554],"study_design_scores_gemma":[0.000930194,0.00019766204,0.053365033,0.0011125617,0.00013459599,0.0000042936904,0.0010430262,0.92438555,0.0011905824,0.008671056,0.008586211,0.00037921392],"about_ca_topic_score_codex":0.00001536262,"about_ca_topic_score_gemma":5.455581e-7,"teacher_disagreement_score":0.91552246,"about_ca_system_score_codex":0.000012852719,"about_ca_system_score_gemma":0.000009442304,"threshold_uncertainty_score":0.9739974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039406314,0.0006252631,0.94929516,0.0026202549,0.004243799,0.0007443299,0.000025114321,0.0015944159,0.0014453671],"genre_scores_gemma":[0.9804895,0.000021409955,0.010564378,0.0017026135,0.00026996303,0.000271024,0.0000398188,0.000049411738,0.006591894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742925,0.000115415634,0.00042641335,0.0011807556,0.0003815196,0.00046661892],"domain_scores_gemma":[0.998229,0.00028881824,0.00015837542,0.00084393524,0.00032974716,0.00015012451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006207823,0.00043436929,0.0004543657,0.0003192805,0.00021971644,0.0008938094,0.0013762033,0.00030448395,0.000009943281],"category_scores_gemma":[0.00012206299,0.0003905696,0.00066509156,0.000118254124,0.00002360318,0.00009984598,0.002381569,0.0013191331,0.0001165788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012414617,0.00035083253,0.00006965769,0.0023565574,0.0008410245,0.0002893117,0.0018826724,0.08347189,0.009060214,0.8414914,0.012870927,0.047191363],"study_design_scores_gemma":[0.00039552015,0.00017714003,0.000005654027,0.00040807322,0.000075543474,0.000008272352,0.00007488931,0.96651876,0.0015735393,0.029515231,0.0007045224,0.0005428793],"about_ca_topic_score_codex":0.0009535001,"about_ca_topic_score_gemma":0.00007170229,"teacher_disagreement_score":0.9410832,"about_ca_system_score_codex":0.00018495934,"about_ca_system_score_gemma":0.00041210093,"threshold_uncertainty_score":0.9998546},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035477582,0.00049321074,0.96141124,0.0023718867,0.00009152289,0.00007126032,0.0000035047224,0.00006480688,0.000014965863],"genre_scores_gemma":[0.9729261,0.00007312665,0.026227808,0.0005077974,0.00015471953,0.000033754943,3.4712596e-7,0.0000076262386,0.0000687488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947196,0.000008341315,0.00017642927,0.00010995909,0.0001327488,0.00010058221],"domain_scores_gemma":[0.9993368,0.0003604149,0.00002667336,0.00018640913,0.00003308862,0.000056628993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023543302,0.0000684152,0.000082468476,0.00021027993,0.00003905598,0.0003607587,0.0005368071,0.00002278726,7.894625e-7],"category_scores_gemma":[0.000051778075,0.000049779508,0.000040598046,0.00044344025,0.000004427042,0.00028646775,0.000068952424,0.0003173494,0.0000028003735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005605651,0.00011265802,0.014097448,0.00019445458,0.00006617622,0.00008606527,0.0017060116,0.75067854,0.00062000303,0.17973247,0.007578321,0.04512221],"study_design_scores_gemma":[0.00019344127,0.000058138714,0.01783067,0.0016563386,0.000039370578,0.00020640963,0.000060251215,0.88993686,0.00008042697,0.008933274,0.080578595,0.00042619914],"about_ca_topic_score_codex":0.0000060159227,"about_ca_topic_score_gemma":0.0000074287423,"teacher_disagreement_score":0.9374485,"about_ca_system_score_codex":0.000024101555,"about_ca_system_score_gemma":0.000032415333,"threshold_uncertainty_score":0.34788045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07290875,0.00046519013,0.92058724,0.002183369,0.0032300742,0.000084948544,0.0000031971904,0.0004389154,0.00009834118],"genre_scores_gemma":[0.984622,0.000005009849,0.008207035,0.0062890896,0.0007966595,0.000008338311,0.0000027500157,0.000026138889,0.000042965905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807346,0.00010623342,0.00029901008,0.0007028904,0.00037511153,0.00044331508],"domain_scores_gemma":[0.9989295,0.00017042075,0.00007106673,0.00069998164,0.000028424809,0.00010059966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018241392,0.00027681634,0.0002539104,0.00033114263,0.000103072096,0.00026012096,0.0010541454,0.000073922754,0.0000015672439],"category_scores_gemma":[0.000003722936,0.00023391096,0.00024185375,0.00040543676,0.000068953064,0.00014665328,0.00020652344,0.0004519762,0.000008301633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075633193,0.00004099182,0.000004667814,0.00004256559,0.00004567863,0.00015756741,0.0006791466,0.4988951,0.04622314,0.0017838203,0.0033749267,0.44874483],"study_design_scores_gemma":[0.00016067336,0.00013549313,0.000025059211,0.00015026846,0.000010522378,0.00006756703,7.672759e-7,0.9948534,0.003309416,0.00044510377,0.0005787236,0.0002630291],"about_ca_topic_score_codex":0.00011735753,"about_ca_topic_score_gemma":0.0000055868004,"teacher_disagreement_score":0.91238016,"about_ca_system_score_codex":0.000049689366,"about_ca_system_score_gemma":0.000038230497,"threshold_uncertainty_score":0.95386124},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011891834,0.000014998408,0.9854145,0.0005986072,0.00022657162,0.00021287426,4.9347386e-7,0.0008032836,0.000836846],"genre_scores_gemma":[0.98894143,0.0000025566962,0.006935745,0.000534474,0.00004419881,0.000059459842,0.000026901227,0.000012773838,0.0034424446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882287,0.000033448476,0.00021601109,0.0003349121,0.00024206811,0.00035069967],"domain_scores_gemma":[0.9993585,0.00011047936,0.00006662835,0.00031409864,0.00006387936,0.00008641641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045849272,0.00013344974,0.00013926829,0.00021669982,0.00030877406,0.00016004755,0.0004412802,0.000043255364,0.0000051375605],"category_scores_gemma":[0.000049625363,0.00012294883,0.0001592458,0.0002921951,0.00001398263,0.00022922484,0.00015158935,0.0001367172,0.00004237004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011197423,0.000010639938,0.00032429077,0.00001599163,0.0000107769465,0.0000042840193,0.00035128,0.98351955,0.00044507065,0.0047878544,0.00072376133,0.009795304],"study_design_scores_gemma":[0.000494767,0.000083218576,0.00004244501,0.000016441243,0.0000055041296,7.8510425e-7,0.000036814177,0.997848,0.00018360498,0.00084239093,0.00027108463,0.00017498009],"about_ca_topic_score_codex":0.0007127126,"about_ca_topic_score_gemma":0.00019442517,"teacher_disagreement_score":0.9784787,"about_ca_system_score_codex":0.00003373901,"about_ca_system_score_gemma":0.000070103146,"threshold_uncertainty_score":0.5013708},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10089874,0.000071885035,0.89604294,0.00088971027,0.00022335177,0.0002678272,0.0000013949162,0.00036269077,0.0012414414],"genre_scores_gemma":[0.9941878,0.000008355348,0.003954924,0.0004948225,0.00006716844,0.000051559477,0.0000021611052,0.000012942876,0.0012202678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998553,0.00015229924,0.00021526648,0.0004187952,0.0001902427,0.00047040495],"domain_scores_gemma":[0.998655,0.0007930334,0.0000426269,0.0003961888,0.000039934297,0.00007320739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014110775,0.00013933184,0.00015254282,0.00060654944,0.000185547,0.00014721979,0.0005830578,0.0000453123,0.000004041386],"category_scores_gemma":[0.00016778421,0.00012540312,0.000108202716,0.0011054332,0.000023625951,0.00014468796,0.00019515636,0.000111516274,0.000049177837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007156471,0.0002016848,0.0013642757,0.000066664645,0.0000708626,0.000076134624,0.009052745,0.22395822,0.01072917,0.49036512,0.002772557,0.261271],"study_design_scores_gemma":[0.0007639235,0.00006448498,0.0022793508,0.00006364845,0.000006088562,0.000008827376,0.0007194196,0.972468,0.0017282618,0.021377444,0.00021089749,0.00030965894],"about_ca_topic_score_codex":0.0004902896,"about_ca_topic_score_gemma":0.00001946746,"teacher_disagreement_score":0.893289,"about_ca_system_score_codex":0.00008445239,"about_ca_system_score_gemma":0.00009073491,"threshold_uncertainty_score":0.5113791},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25018272,0.005224663,0.7353802,0.000116779236,0.0019172173,0.00079659815,0.0000012190277,0.0013551789,0.0050254716],"genre_scores_gemma":[0.9893003,0.00015268895,0.008829753,0.00009322565,0.00017352529,0.00013126677,0.0000074829018,0.000028257955,0.0012834839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776536,0.0001513581,0.000440911,0.00090507476,0.0003104016,0.00042686355],"domain_scores_gemma":[0.9990527,0.000067756155,0.000113556314,0.00063073216,0.00006024083,0.00007504024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008534734,0.00032339737,0.00033982133,0.00037350264,0.00009377098,0.0004577641,0.00086128846,0.00028354654,0.000015475378],"category_scores_gemma":[0.000013915391,0.00029355468,0.0001796737,0.00033811142,0.000025908463,0.00004698298,0.004580585,0.0018630296,0.00002531209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040209648,0.0000713118,0.00021676587,0.00008299252,0.000024472412,0.000077113495,0.00063118903,0.9762931,0.00037821103,0.0010352609,0.00016734004,0.021018252],"study_design_scores_gemma":[0.00006809659,0.000047238373,0.000018436607,0.00063703174,0.000015167071,0.000011113564,0.00009063652,0.99753594,0.00036939114,0.00036555628,0.0004893936,0.00035200227],"about_ca_topic_score_codex":0.00077788014,"about_ca_topic_score_gemma":0.000025113028,"teacher_disagreement_score":0.7391176,"about_ca_system_score_codex":0.00037738014,"about_ca_system_score_gemma":0.00017017256,"threshold_uncertainty_score":0.99995166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25018272,0.005224663,0.7353802,0.000116779236,0.0019172173,0.00079659815,0.0000012190277,0.0013551789,0.0050254716],"genre_scores_gemma":[0.9893003,0.00015268895,0.008829753,0.00009322565,0.00017352529,0.00013126677,0.0000074829018,0.000028257955,0.0012834839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776536,0.0001513581,0.000440911,0.00090507476,0.0003104016,0.00042686355],"domain_scores_gemma":[0.9990527,0.000067756155,0.000113556314,0.00063073216,0.00006024083,0.00007504024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008534734,0.00032339737,0.00033982133,0.00037350264,0.00009377098,0.0004577641,0.00086128846,0.00028354654,0.000015475378],"category_scores_gemma":[0.000013915391,0.00029355468,0.0001796737,0.00033811142,0.000025908463,0.00004698298,0.004580585,0.0018630296,0.00002531209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040209648,0.0000713118,0.00021676587,0.00008299252,0.000024472412,0.000077113495,0.00063118903,0.9762931,0.00037821103,0.0010352609,0.00016734004,0.021018252],"study_design_scores_gemma":[0.00006809659,0.000047238373,0.000018436607,0.00063703174,0.000015167071,0.000011113564,0.00009063652,0.99753594,0.00036939114,0.00036555628,0.0004893936,0.00035200227],"about_ca_topic_score_codex":0.00077788014,"about_ca_topic_score_gemma":0.000025113028,"teacher_disagreement_score":0.7391176,"about_ca_system_score_codex":0.00037738014,"about_ca_system_score_gemma":0.00017017256,"threshold_uncertainty_score":0.99995166},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024678541,0.0024818175,0.9673459,0.0012415485,0.00021299552,0.00030077857,0.0000042153324,0.00017986352,0.0035543486],"genre_scores_gemma":[0.86199594,0.00006258037,0.13734329,0.0003971093,0.000044927052,0.00006126804,0.0000037496459,0.000006963407,0.0000841822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988548,0.00003458827,0.00015557022,0.0004889481,0.00017616576,0.00028991268],"domain_scores_gemma":[0.99887747,0.0004852906,0.00004454596,0.00048879534,0.000030265344,0.00007362762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072307256,0.00013498198,0.00015174133,0.00011559619,0.00065589696,0.0008839176,0.00083527324,0.000022444156,0.0000010258912],"category_scores_gemma":[0.000007468654,0.00009972808,0.000046011854,0.00035378707,0.00037439135,0.00032217524,0.00033698743,0.00015789324,0.0000033926851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090495465,0.00013691091,0.00013409964,0.00008496595,0.0002524737,0.000040187893,0.004842612,0.04461489,0.023819119,0.4828621,0.0033738143,0.43974835],"study_design_scores_gemma":[0.00032958254,0.000077053075,0.0000120686655,0.00004878394,0.000021732609,0.000051814703,0.00013783721,0.99427456,0.000667362,0.0028717045,0.0013065133,0.00020097401],"about_ca_topic_score_codex":0.00004916763,"about_ca_topic_score_gemma":0.000019881825,"teacher_disagreement_score":0.9496597,"about_ca_system_score_codex":0.00001910316,"about_ca_system_score_gemma":0.00007220945,"threshold_uncertainty_score":0.8523638},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70282644,0.000034472687,0.28244394,0.007723054,0.00024276706,0.00012527878,5.864454e-7,0.0005218962,0.006081549],"genre_scores_gemma":[0.98136944,0.0000051214197,0.0061648255,0.00052785577,0.000029038645,0.000006933552,0.0000012927841,0.0000056638246,0.01188986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926263,0.000050538143,0.00006647511,0.0002596915,0.00012333166,0.00023734338],"domain_scores_gemma":[0.9996241,0.000107612585,0.000015284953,0.0001667987,0.000016075619,0.00007014574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001753,0.0000701731,0.000095978416,0.00017595277,0.00009959599,0.00024248923,0.00024811516,0.000027441438,0.0000023859886],"category_scores_gemma":[0.0000933713,0.000064993474,0.000016300832,0.0003675213,0.0000050469944,0.00034209658,0.000332252,0.00014864896,0.000027553886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004460128,0.000108844564,0.258311,0.00012396803,0.00008569963,0.00039762026,0.025743524,0.08183135,0.068703935,0.16960119,0.056020755,0.33902752],"study_design_scores_gemma":[0.0007328818,0.00019244147,0.019155227,0.00010265319,0.0000042535044,0.000024613571,0.0009033698,0.94411063,0.00033784084,0.004418518,0.02954992,0.00046766442],"about_ca_topic_score_codex":0.0005344471,"about_ca_topic_score_gemma":0.00011549001,"teacher_disagreement_score":0.86227924,"about_ca_system_score_codex":0.00001774155,"about_ca_system_score_gemma":0.000018228679,"threshold_uncertainty_score":0.2650357},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09817038,0.013401652,0.879102,0.008392345,0.00038641912,0.00023014318,0.0000013192158,0.00017593353,0.00013980766],"genre_scores_gemma":[0.9891703,0.0072188955,0.0028095143,0.0005095804,0.0000966582,0.000042460255,0.000014304838,0.000015685893,0.00012259845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998335,0.00072157395,0.00027592143,0.00032648488,0.00011598925,0.00022502363],"domain_scores_gemma":[0.9985703,0.0008187902,0.00003699437,0.00050821714,0.000016820546,0.00004883134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010693856,0.00015212611,0.00014500448,0.000289695,0.0006245041,0.0005259214,0.00052264263,0.00007108506,0.0000024397348],"category_scores_gemma":[0.000006746631,0.00013237311,0.000042770334,0.0007856889,0.00003768334,0.00025148402,0.000031262134,0.0016471723,0.0000023415134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054465086,0.000079888836,0.00065279927,0.0000077547875,0.00001315625,0.0000075681764,0.0028426338,0.30080745,0.00036376092,0.0003076163,0.000021677573,0.69489026],"study_design_scores_gemma":[0.00014235788,0.000095240546,0.00021353265,0.00017665327,0.00001071156,0.000019990006,0.00024070765,0.9867162,0.000005425845,0.000041406936,0.0121948095,0.00014297034],"about_ca_topic_score_codex":0.0005409007,"about_ca_topic_score_gemma":0.0020056823,"teacher_disagreement_score":0.8909999,"about_ca_system_score_codex":0.00004804825,"about_ca_system_score_gemma":0.000015866812,"threshold_uncertainty_score":0.71562356},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08761427,0.00015130344,0.9078922,0.0003061203,0.002307037,0.00036143415,0.0000404711,0.0011906934,0.00013644608],"genre_scores_gemma":[0.9957065,0.0000034434765,0.0034565781,0.00023764506,0.000427694,0.000017394448,0.000041574553,0.000042451786,0.0000667423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970743,0.00012718259,0.0005320257,0.0012286908,0.00041734945,0.0006204706],"domain_scores_gemma":[0.9982439,0.00043630195,0.00011561866,0.00091844244,0.00017361942,0.00011207392],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014123021,0.000284343,0.00033536367,0.0002295135,0.0011135496,0.0012218262,0.0020789804,0.0001422985,0.0000037225595],"category_scores_gemma":[0.0000014117442,0.00029129302,0.00022976837,0.0007317995,0.000025543759,0.00085387315,0.00008702301,0.0005728383,0.000024828865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012749783,0.0002516394,0.00011111815,0.0036547366,0.0011044499,0.00022092028,0.007035216,0.54317456,0.0019371851,0.0097267,0.00017083785,0.43248516],"study_design_scores_gemma":[0.00036014448,0.000061319755,0.00007467736,0.0007142565,0.00008356913,0.000047522033,0.0011808911,0.99665195,0.0003858772,0.000020282883,0.00012038422,0.00029909905],"about_ca_topic_score_codex":0.00041550287,"about_ca_topic_score_gemma":0.00011286016,"teacher_disagreement_score":0.9080922,"about_ca_system_score_codex":0.00015425762,"about_ca_system_score_gemma":0.000088183704,"threshold_uncertainty_score":0.9999539},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101007126,0.00062393193,0.8780845,0.0013974891,0.0020766547,0.00016510085,0.0000075902194,0.0011336368,0.015503963],"genre_scores_gemma":[0.99219733,0.000016953605,0.0024492575,0.000982381,0.00013405956,0.000008302062,0.00001487359,0.000019890922,0.00417696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981488,0.00015004193,0.00031090426,0.00067307544,0.00035849298,0.00035870442],"domain_scores_gemma":[0.99902475,0.00028799105,0.000030808897,0.00038795694,0.000121775745,0.00014670772],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00041264851,0.00023945105,0.00021268621,0.00020429034,0.0004737307,0.002042176,0.000553614,0.00008424385,0.000062813386],"category_scores_gemma":[0.000072401126,0.00018264761,0.00013997807,0.00050462416,0.000025190806,0.0009239285,0.00032728302,0.00041205485,0.00037969786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115394476,0.0005891249,0.0013880568,0.000094635776,0.00046397353,0.0016364756,0.0031804312,0.003888456,0.04137064,0.101194955,0.14232649,0.7037514],"study_design_scores_gemma":[0.00065152015,0.00014244903,0.00085813965,0.0003433771,0.00001677537,0.00019269482,0.00013441668,0.9718333,0.0012596855,0.00040244908,0.023612816,0.0005524046],"about_ca_topic_score_codex":0.00034344854,"about_ca_topic_score_gemma":0.00016460188,"teacher_disagreement_score":0.9679448,"about_ca_system_score_codex":0.00013445457,"about_ca_system_score_gemma":0.00012885313,"threshold_uncertainty_score":0.9989938},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05244065,0.0007903281,0.9327605,0.0016231416,0.0007740465,0.00023007746,0.000010989068,0.000455524,0.010914793],"genre_scores_gemma":[0.97542644,0.000016120164,0.009183815,0.00026971876,0.0000995214,0.00005522163,0.0000033581239,0.00000880205,0.014937029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918526,0.000010978209,0.00013495983,0.0003383439,0.00010608232,0.0002243848],"domain_scores_gemma":[0.99955773,0.00015159095,0.000009865956,0.00022528357,0.000016010768,0.00003948873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019884536,0.00008144347,0.000091643145,0.0001667343,0.000060849143,0.00029093752,0.0004664362,0.000030483865,0.000008035806],"category_scores_gemma":[0.000024669826,0.0000688933,0.00005769201,0.00024154535,0.000013041836,0.00044407998,0.00030297894,0.00011246683,0.000018459012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024091258,0.00008934565,0.003793809,0.00023744263,0.000073574505,0.000111350666,0.005246802,0.0017951906,0.0059267585,0.8443929,0.013482687,0.124826044],"study_design_scores_gemma":[0.00024573714,0.000055528413,0.00096146815,0.00011941709,0.0000042105944,0.000014078897,0.00010936506,0.97480536,0.0006825078,0.016880656,0.005965346,0.0001563455],"about_ca_topic_score_codex":0.00012045647,"about_ca_topic_score_gemma":0.000111627676,"teacher_disagreement_score":0.9730101,"about_ca_system_score_codex":0.000029783161,"about_ca_system_score_gemma":0.00004740176,"threshold_uncertainty_score":0.2809387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9515203,0.0002658489,0.03338712,0.002073433,0.008477354,0.000154766,0.000007066149,0.00043928405,0.0036747959],"genre_scores_gemma":[0.99826276,0.0000047568988,0.0013202179,0.0002659311,0.000014180252,0.000004531607,0.0000022039337,0.000009026153,0.00011640095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.00006011734,0.00016603821,0.00029257082,0.00026496398,0.00016000112],"domain_scores_gemma":[0.9989101,0.00053968106,0.000050032802,0.00040218435,0.000045425644,0.0000525383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020143525,0.000118288845,0.00014493226,0.00014032806,0.00006902121,0.00012175029,0.00029799246,0.00006814651,0.000020438025],"category_scores_gemma":[0.00011531552,0.00011464867,0.00009976427,0.00030888917,0.000026568236,0.00021849545,0.00007224612,0.00024399442,0.000027349959],"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.00002076819,0.000051582603,0.0010494763,0.000047270838,0.000025424477,0.000028401919,0.00012999302,0.00033203003,0.004547974,0.98938525,0.001590633,0.002791204],"study_design_scores_gemma":[0.00074286736,0.000348944,0.000638279,0.00037523397,0.000015776435,0.00000699985,0.000018649578,0.93673754,0.013882625,0.045408294,0.0015572023,0.00026761292],"about_ca_topic_score_codex":0.000124192,"about_ca_topic_score_gemma":0.000002360891,"teacher_disagreement_score":0.94397694,"about_ca_system_score_codex":0.00004550699,"about_ca_system_score_gemma":0.000081705744,"threshold_uncertainty_score":0.4675237},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36444044,0.0046251034,0.501887,0.0072253444,0.0019099186,0.0005646899,0.000011407616,0.0023166,0.11701947],"genre_scores_gemma":[0.9923111,0.0001089114,0.0014483611,0.00056750124,0.000050054194,0.0000130989165,0.0000017271457,0.000011563506,0.005487666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900305,0.000035123805,0.00010973793,0.00044644714,0.00018898035,0.00021663595],"domain_scores_gemma":[0.99935746,0.00010709873,0.000017123226,0.0003806152,0.000033452914,0.000104223516],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002058313,0.000132731,0.0001248621,0.000080498685,0.00008472541,0.0010581921,0.00053085125,0.000036122612,0.000012955637],"category_scores_gemma":[0.000012144376,0.00009248195,0.0000375527,0.00028351022,0.000036319554,0.0007502558,0.00031135764,0.00014804737,0.00004559188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008038649,0.00024186916,0.00856978,0.00022432736,0.0004334088,0.0010812661,0.0023505874,0.0009196527,0.0033770315,0.1477946,0.10806042,0.72686666],"study_design_scores_gemma":[0.0008962633,0.0003240145,0.0044338154,0.00039575368,0.00010455596,0.0005088398,0.000087550696,0.8642621,0.0037842183,0.0028088074,0.12119125,0.0012028139],"about_ca_topic_score_codex":0.00033679433,"about_ca_topic_score_gemma":0.000117308846,"teacher_disagreement_score":0.86334246,"about_ca_system_score_codex":0.000021626754,"about_ca_system_score_gemma":0.00007542295,"threshold_uncertainty_score":0.9999788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076948985,0.00032052063,0.64819795,0.06275554,0.0020174952,0.00058525155,0.0000039634588,0.0018116226,0.20735867],"genre_scores_gemma":[0.9676664,0.00008898061,0.0029017457,0.008342678,0.00014165347,0.000026346666,0.000001688915,0.0000148662575,0.020815669],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896866,0.00007817599,0.00010721624,0.0003368689,0.00030032388,0.00020875446],"domain_scores_gemma":[0.999189,0.00017532037,0.00001673433,0.0005422299,0.00002327267,0.000053423682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031350643,0.00012336469,0.00008122459,0.000062253814,0.00015746432,0.0005206157,0.00057641556,0.000016250735,0.000046461784],"category_scores_gemma":[0.0000083911,0.00006149844,0.000056273166,0.00023914529,0.000026032094,0.00020633629,0.0001507408,0.0002445539,0.0005149554],"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.000046077366,0.000102375285,0.00019900272,0.00003151177,0.00013255022,0.0003262828,0.0027570128,0.001449507,0.00022665171,0.27695322,0.17423889,0.5435369],"study_design_scores_gemma":[0.00041385661,0.00079764926,0.00069235434,0.00015163381,0.00003053686,0.000061726736,0.00040937032,0.32055455,0.0005174302,0.0012738584,0.6746725,0.00042452206],"about_ca_topic_score_codex":0.00034758283,"about_ca_topic_score_gemma":0.00008085435,"teacher_disagreement_score":0.8907174,"about_ca_system_score_codex":0.000033949997,"about_ca_system_score_gemma":0.00006292378,"threshold_uncertainty_score":0.6618881},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027693167,0.00061079493,0.9689442,0.001690243,0.0003301981,0.00016468708,0.000019401874,0.00016065083,0.0003866931],"genre_scores_gemma":[0.98478127,0.000021531288,0.014951497,0.000034574852,0.000039898347,0.000039700655,0.000074536285,0.000005015093,0.000051977415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990246,0.00006083238,0.00035565236,0.00032315613,0.00009640952,0.00013930074],"domain_scores_gemma":[0.99902123,0.0004927595,0.000092673974,0.00022816822,0.00013208446,0.000033053562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092931656,0.00007384742,0.00017543703,0.0011129931,0.00013073868,0.0004609917,0.00022521516,0.00003422479,0.000002404773],"category_scores_gemma":[0.000094817995,0.00007486058,0.00008579237,0.0025371923,0.000020776972,0.00040467334,0.000089469904,0.00008038457,7.362291e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018164063,0.00008662843,0.018177764,0.00013306117,0.0006106319,7.55132e-7,0.0015330765,0.021180091,0.00018734149,0.44464958,0.0011049451,0.5123343],"study_design_scores_gemma":[0.0000789878,0.000012977143,0.005868685,0.000048665413,0.00007112406,0.0000030802016,0.00009429606,0.9909561,0.000013830795,0.00051299785,0.0022623532,0.00007684773],"about_ca_topic_score_codex":0.0001741826,"about_ca_topic_score_gemma":0.00002283974,"teacher_disagreement_score":0.96977603,"about_ca_system_score_codex":0.000043274064,"about_ca_system_score_gemma":0.000032327738,"threshold_uncertainty_score":0.44453534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15116899,0.00014568814,0.8469926,0.00010995008,0.0008170657,0.000498927,0.00006951163,0.00013481498,0.00006244226],"genre_scores_gemma":[0.999519,0.00003630178,0.00015841716,0.000065345106,0.000016835065,0.00012224274,0.000021751108,0.000011484027,0.000048612223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823666,0.0003116092,0.00057650654,0.0003985919,0.00034779814,0.00012885174],"domain_scores_gemma":[0.9991651,0.0003692843,0.00007204114,0.00025174776,0.00010130811,0.000040498508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006343025,0.00017109109,0.00020085147,0.00036240727,0.00008569518,0.00014932027,0.00017941836,0.000083519764,0.000012065189],"category_scores_gemma":[0.0000054596394,0.00013308458,0.00010178369,0.0004668216,0.000051201587,0.00029993965,2.8620337e-7,0.00031175945,0.0000042492547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053955824,0.0001902644,0.00008323146,0.00014035785,0.000031590513,0.0000075116436,0.004735518,0.9912263,0.00079377874,0.0009851346,0.000019079289,0.0017332818],"study_design_scores_gemma":[0.00023206873,0.00031495185,0.0008615174,0.0005511936,0.000027940228,0.000004659594,0.000811642,0.9917703,0.0052796076,0.000008628358,0.000024004743,0.0001134561],"about_ca_topic_score_codex":0.0005981819,"about_ca_topic_score_gemma":0.0001910622,"teacher_disagreement_score":0.84835005,"about_ca_system_score_codex":0.000089057794,"about_ca_system_score_gemma":0.00006238877,"threshold_uncertainty_score":0.5427032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3553138,0.0010823599,0.6287349,0.0055441293,0.007789587,0.001271161,0.0000098386345,0.00011601445,0.00013819213],"genre_scores_gemma":[0.9871721,0.000010662682,0.011915239,0.00039987403,0.0003560675,0.000011711503,4.0480754e-7,0.000012622572,0.000121264326],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824506,0.00039650654,0.00053449,0.00025423412,0.00037074927,0.00019895063],"domain_scores_gemma":[0.9980186,0.00023894482,0.00030683287,0.00092615833,0.0004222434,0.00008720071],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003338608,0.00014685844,0.0002719069,0.000040144663,0.00048962707,0.0032206033,0.004147407,0.00004966587,9.3579416e-7],"category_scores_gemma":[0.0000107772,0.000099747944,0.00052258465,0.00034340212,0.00003477981,0.0018469992,0.0012167407,0.0004103584,0.00000236453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059384223,0.0011894512,0.000844676,0.000523463,0.0023112681,0.0014559963,0.10099268,0.0016207333,0.00025648772,0.017466059,0.8385142,0.034765624],"study_design_scores_gemma":[0.0020064474,0.00047672188,0.00006634513,0.0010147508,0.0002011459,0.008152117,0.007848324,0.96975726,0.00010142156,0.0011143441,0.008920465,0.00034068016],"about_ca_topic_score_codex":0.00018378808,"about_ca_topic_score_gemma":0.00003717324,"teacher_disagreement_score":0.9681365,"about_ca_system_score_codex":0.00022065548,"about_ca_system_score_gemma":0.00018272772,"threshold_uncertainty_score":0.9978142},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023157857,0.00088214333,0.96983254,0.0007235349,0.0006185798,0.00010531843,0.000008558922,0.0005342352,0.004137206],"genre_scores_gemma":[0.9847872,0.000008998557,0.011932044,0.00017640593,0.000075477285,0.000015027659,0.000002587585,0.0000067146507,0.0029955322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.000016187054,0.000093467184,0.0002687263,0.00010952659,0.00015983789],"domain_scores_gemma":[0.9995186,0.00021850382,0.000011315588,0.00018040946,0.00003461941,0.000036575468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019440713,0.00007665379,0.00007822709,0.00006181485,0.0000976953,0.00027439694,0.00025197628,0.0000306065,0.00000515403],"category_scores_gemma":[0.00001818757,0.00006233156,0.000079020254,0.00013608046,0.000009924446,0.00033415083,0.00006705087,0.00008479491,0.00003011652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013831364,0.000026034815,0.00026017806,0.000048688973,0.000095324736,0.000053521464,0.0011216605,0.00030665967,0.0051284954,0.73831785,0.017403826,0.23722395],"study_design_scores_gemma":[0.00013934921,0.000099172416,0.00015109609,0.00011137408,0.000012643415,0.000018748711,0.00021102467,0.9870971,0.0011038713,0.0048982827,0.0059706834,0.0001866441],"about_ca_topic_score_codex":0.00007041236,"about_ca_topic_score_gemma":0.000028993263,"teacher_disagreement_score":0.9867905,"about_ca_system_score_codex":0.000027228072,"about_ca_system_score_gemma":0.000039235107,"threshold_uncertainty_score":0.26460162},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14046508,0.0036976063,0.84023553,0.011321517,0.00065035577,0.00059012155,0.0000738794,0.000043445845,0.0029224297],"genre_scores_gemma":[0.98291594,0.0010388253,0.015337536,0.00008443935,0.000027141341,0.000012456253,0.0000059927675,0.0000059262256,0.0005717352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989204,0.00032991866,0.00030511216,0.0001375142,0.00021918539,0.00008790082],"domain_scores_gemma":[0.9988489,0.00019112836,0.00014825304,0.0007368672,0.000038297872,0.000036515303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013003051,0.000079752805,0.00017237263,0.00008228812,0.00031635037,0.0003709019,0.0021946325,0.00003833818,0.0000016418077],"category_scores_gemma":[0.000013992538,0.000059506765,0.00019542374,0.0006367194,0.000111298585,0.0014029999,0.00070292444,0.00042502454,0.0000015001589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024085978,0.0028691108,0.09296071,0.00020411644,0.018251412,0.000029353629,0.23287967,0.54785556,0.026539113,0.014753593,0.027232066,0.03618442],"study_design_scores_gemma":[0.00024778867,0.0000453111,0.024648951,0.00009384754,0.00021203114,0.000047056696,0.0011687886,0.9720017,0.000020438163,0.00066643016,0.00076447567,0.00008320065],"about_ca_topic_score_codex":0.000065235894,"about_ca_topic_score_gemma":0.000010648263,"teacher_disagreement_score":0.84245086,"about_ca_system_score_codex":0.00013621121,"about_ca_system_score_gemma":0.0000754546,"threshold_uncertainty_score":0.40782097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9337267,0.0005501734,0.0009986492,0.009900881,0.00087405875,0.0006585718,0.000013120746,0.00028894242,0.052988887],"genre_scores_gemma":[0.9975607,0.000013297427,0.0007237637,0.0004451276,0.000030365505,0.00002630795,1.6248632e-7,0.0000057461743,0.0011945706],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990473,0.000006099103,0.00021406257,0.00026545304,0.00026980744,0.00019727976],"domain_scores_gemma":[0.99966156,0.000046128807,0.00003993532,0.00014222856,0.000055366087,0.000054799137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003556118,0.00010277884,0.00013275312,0.00013429692,0.000039122107,0.0001504841,0.0007723571,0.000025250298,0.000012944375],"category_scores_gemma":[0.00005401309,0.00007144994,0.00008157912,0.00045607393,0.000026450256,0.00021633241,0.0005476628,0.000137719,0.000084070016],"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.000055019726,0.0003049544,0.0058061136,0.00034425437,0.00009202189,0.000028165989,0.007475081,0.00013603613,0.52706695,0.3577624,0.050101157,0.050827872],"study_design_scores_gemma":[0.0030369526,0.0014350218,0.009764128,0.006825929,0.00013231493,0.00039514687,0.0010012396,0.21367943,0.5288795,0.07759264,0.15486267,0.0023949759],"about_ca_topic_score_codex":0.00009748161,"about_ca_topic_score_gemma":0.000003547663,"teacher_disagreement_score":0.28016976,"about_ca_system_score_codex":0.000081218765,"about_ca_system_score_gemma":0.000037612725,"threshold_uncertainty_score":0.2913644},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073707174,0.17211758,0.7641729,0.0015786369,0.00361519,0.000984947,0.0000637095,0.0006165777,0.056113377],"genre_scores_gemma":[0.82807994,0.010230211,0.009379532,0.0010262653,0.00031243777,0.00007335366,0.00008756478,0.00010344003,0.15070724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980477,0.000021107942,0.0004877567,0.00079644856,0.00039224504,0.00025470366],"domain_scores_gemma":[0.998373,0.0007527134,0.00015255414,0.00025917357,0.00039247875,0.00007011008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021215844,0.0004079035,0.00047608692,0.00026643902,0.00013028797,0.00016848797,0.00046653065,0.00014939976,0.000008883614],"category_scores_gemma":[0.000025773861,0.00034188072,0.00008893781,0.0001313368,0.00039067114,0.00019451547,0.00065194303,0.0006514712,0.000056912417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050816805,0.000022790126,0.00009762377,0.00013072476,0.00069811405,0.0006822455,0.0014195027,0.31707716,5.047522e-7,0.6570589,0.0011114342,0.021650204],"study_design_scores_gemma":[0.00015153976,0.00024016396,0.00009303053,0.0027125308,0.000076620665,0.00020689647,0.00033075127,0.86845595,0.0000015574669,0.12565453,0.0013868198,0.0006896198],"about_ca_topic_score_codex":0.000049061513,"about_ca_topic_score_gemma":0.000095908326,"teacher_disagreement_score":0.82734287,"about_ca_system_score_codex":0.00017860101,"about_ca_system_score_gemma":0.00008395284,"threshold_uncertainty_score":0.9999033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124024294,0.0017196167,0.8318251,0.0012564738,0.03527588,0.0030712879,0.00027422034,0.0023749694,0.00017815888],"genre_scores_gemma":[0.95471287,0.00017856105,0.03875143,0.0016000904,0.003161218,0.00050133583,0.0007966764,0.00015326738,0.00014455465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99130005,0.0016316691,0.0029310524,0.0015475105,0.0008967305,0.0016930039],"domain_scores_gemma":[0.9926221,0.0023734083,0.0012988995,0.0024482661,0.000877552,0.00037979387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0038305297,0.0013416272,0.002013942,0.000937278,0.0009706041,0.014215799,0.0036977849,0.00065296364,0.00007982154],"category_scores_gemma":[0.0002594736,0.0013474914,0.00046689785,0.0009099144,0.000203039,0.003915048,0.0012613339,0.000612401,0.00040364816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018581426,0.0009697142,0.0002989344,0.0067950403,0.002929423,0.00040187375,0.018225418,0.041491564,0.20241095,0.46938896,0.12877463,0.12645535],"study_design_scores_gemma":[0.0073203812,0.0011178459,0.0011540609,0.018963322,0.000583511,0.00038228353,0.0005492537,0.692214,0.06576421,0.0044727568,0.20111452,0.006363864],"about_ca_topic_score_codex":0.0007607603,"about_ca_topic_score_gemma":0.000012850081,"teacher_disagreement_score":0.8306886,"about_ca_system_score_codex":0.0005328766,"about_ca_system_score_gemma":0.00035921947,"threshold_uncertainty_score":0.9999335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74813485,0.009345307,0.045344606,0.12291692,0.0039180582,0.004295986,0.0011067619,0.0014024662,0.063535035],"genre_scores_gemma":[0.9499611,0.0007493513,0.04323002,0.0005542551,0.00004728729,0.000023219582,0.000019564932,0.000025612768,0.0053895363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987699,0.0000054041657,0.00020987823,0.00047724144,0.00037916214,0.00015841088],"domain_scores_gemma":[0.99851274,0.000035785673,0.00009074813,0.0012909588,0.00003976185,0.000030001445],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00046268123,0.00012687143,0.00014093492,0.00011447726,0.000053879343,0.00021831036,0.0053526117,0.000021825368,0.000008685229],"category_scores_gemma":[0.000035002733,0.00009004776,0.000051744813,0.00025806963,0.000046266505,0.0008240303,0.00908743,0.00010097709,0.000007443359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014726809,0.000491929,0.0020090167,0.007038311,0.0014805873,0.000026914486,0.0015224371,0.00008888067,0.008884511,0.16656373,0.4020627,0.4096837],"study_design_scores_gemma":[0.0025028833,0.0006861474,0.010696338,0.007062045,0.00081352453,0.000035891564,0.0016304577,0.88071316,0.0027220154,0.02856022,0.0633632,0.0012141428],"about_ca_topic_score_codex":0.000014645447,"about_ca_topic_score_gemma":0.0000013464132,"teacher_disagreement_score":0.88062423,"about_ca_system_score_codex":0.000017167116,"about_ca_system_score_gemma":0.0000049172445,"threshold_uncertainty_score":0.9989269},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.946854,0.00013750032,0.050649248,0.0018283173,0.00023049432,0.000072639225,1.0034939e-7,0.000055186792,0.00017252956],"genre_scores_gemma":[0.9984356,0.000024305176,0.001493068,0.00001437647,0.00001701554,0.00000308259,2.9392456e-8,0.000002294607,0.0000102124795],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852616,0.000043820546,0.0004534132,0.00019698965,0.000522912,0.00025668854],"domain_scores_gemma":[0.9988027,0.00010916841,0.0004516005,0.00035927707,0.00025193373,0.000025283716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046713375,0.00006542556,0.00014942746,0.0015615665,0.00023704974,0.00007757132,0.0020625521,0.00004876096,4.7667837e-7],"category_scores_gemma":[0.00048334544,0.000044180113,0.000043550408,0.0056875283,0.0007081885,0.0007691323,0.00028155273,0.00036004398,0.0000029953665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004765959,0.00004284913,0.005009546,0.000008888659,0.000003804132,0.000014186635,0.002102779,0.067664206,0.801337,0.040587854,0.000009860436,0.083214246],"study_design_scores_gemma":[0.000327653,0.0005928267,0.015123343,0.00019697571,0.000008097205,0.00019417489,0.0054997155,0.9184639,0.01941113,0.040026627,0.0000151270715,0.00014043697],"about_ca_topic_score_codex":0.00007705547,"about_ca_topic_score_gemma":0.0000071715963,"teacher_disagreement_score":0.8507997,"about_ca_system_score_codex":0.0000692557,"about_ca_system_score_gemma":0.00042091438,"threshold_uncertainty_score":0.38327694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033309463,0.006318335,0.9580306,0.0005005929,0.000582299,0.00009720206,0.0000035726896,0.00046069873,0.00069724995],"genre_scores_gemma":[0.994513,0.00006930358,0.0039519905,0.00026781124,0.000088028115,0.000014092354,0.0000020336465,0.000009954664,0.0010838399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911493,0.000016373435,0.0001428084,0.00038763793,0.00013278809,0.00020546827],"domain_scores_gemma":[0.99950266,0.00017505854,0.000019734776,0.00021669973,0.000026658916,0.000059181166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026247202,0.00010596993,0.00011688842,0.00015730568,0.00017801838,0.0007276933,0.00029345788,0.000029355539,0.0000031041204],"category_scores_gemma":[0.000012217857,0.00009064619,0.00006406696,0.0003612111,0.0000081403105,0.00070712535,0.00017979016,0.00009523382,0.0000068340682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011959645,0.000031987893,0.0029804946,0.002074323,0.0001342414,0.00007355766,0.0054245363,0.0006527944,0.0025877506,0.05007918,0.00259836,0.9333508],"study_design_scores_gemma":[0.000109400455,0.000028583358,0.00029842847,0.00023612774,0.000012181015,0.000019194204,0.0001371195,0.97229135,0.000083867955,0.00086175324,0.02574939,0.00017260252],"about_ca_topic_score_codex":0.00022969182,"about_ca_topic_score_gemma":0.000054619362,"teacher_disagreement_score":0.97163856,"about_ca_system_score_codex":0.00003393304,"about_ca_system_score_gemma":0.000017995475,"threshold_uncertainty_score":0.7017163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6881071,0.0067066113,0.2635046,0.009986827,0.01397825,0.008685197,0.0007122851,0.0026240586,0.0056950925],"genre_scores_gemma":[0.9592966,0.00088053785,0.015463549,0.00043658126,0.0017131183,0.0016769473,0.00029544416,0.00018262875,0.020054588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98995954,0.00085029704,0.0009232416,0.003162066,0.003244894,0.0018599785],"domain_scores_gemma":[0.99274313,0.00024888286,0.00016046583,0.004349798,0.0014284824,0.0010692313],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0048676543,0.0007606859,0.00069225946,0.0013534753,0.0005975469,0.0017747671,0.003966744,0.00048533455,0.00008385867],"category_scores_gemma":[0.00029788303,0.00071402744,0.00039966614,0.0015033009,0.00016511722,0.00043165038,0.013272193,0.004456932,0.0013804247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002876162,0.00092252914,0.0002850702,0.0022076203,0.00031894367,0.00043980678,0.008279962,0.0028454252,0.002883744,0.0049385484,0.023877937,0.9527128],"study_design_scores_gemma":[0.00060538267,0.0034159727,0.0005339569,0.0033679295,0.000052276773,0.000060240676,0.001807057,0.9265022,0.012631433,0.0024943838,0.046803292,0.0017258255],"about_ca_topic_score_codex":0.0019850973,"about_ca_topic_score_gemma":0.000077970915,"teacher_disagreement_score":0.950987,"about_ca_system_score_codex":0.0015395174,"about_ca_system_score_gemma":0.0013722868,"threshold_uncertainty_score":0.9995311},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14793675,0.00091623294,0.84369916,0.000980469,0.00029222458,0.00019893303,0.000013426794,0.0033993535,0.0025634677],"genre_scores_gemma":[0.9921058,0.0000070672218,0.0055627245,0.00064329786,0.000060140068,0.000022427193,0.0000113626165,0.000016922377,0.0015702564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.000022986967,0.00012485174,0.00038961766,0.00020966552,0.00030808634],"domain_scores_gemma":[0.9994969,0.00004833608,0.00002020184,0.0003252634,0.000042135765,0.0000671825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026605185,0.00014151473,0.00014251364,0.00011100187,0.00012388823,0.00054066564,0.00045579416,0.000042849497,0.0000065947124],"category_scores_gemma":[0.0000022060842,0.00009770254,0.000073738694,0.00022444337,0.000008070872,0.0007883188,0.0001465299,0.00009567985,0.000029134995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013333575,0.0005442921,0.00039068278,0.0048012133,0.0010230636,0.0013013524,0.05254131,0.062747404,0.01585453,0.6940305,0.009023474,0.15760884],"study_design_scores_gemma":[0.000224493,0.00005509743,0.000033723794,0.00018345106,0.000016811362,0.00003634507,0.0002588803,0.9978961,0.0003020075,0.00048623097,0.00033971336,0.00016715469],"about_ca_topic_score_codex":0.00077734626,"about_ca_topic_score_gemma":0.00027245918,"teacher_disagreement_score":0.9351487,"about_ca_system_score_codex":0.000026645122,"about_ca_system_score_gemma":0.000053274434,"threshold_uncertainty_score":0.5213651},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5989717,0.0032738908,0.39258784,0.00013554457,0.0018470469,0.00026241862,0.000010903398,0.0005690017,0.0023416325],"genre_scores_gemma":[0.9950849,0.000094516996,0.0034047328,0.0002553055,0.00074506813,0.000017714696,0.0000075550934,0.0000427485,0.0003474877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701697,0.00007932803,0.00060071325,0.0011865108,0.0004350483,0.00068140647],"domain_scores_gemma":[0.9985113,0.00024648543,0.00019653328,0.00078636507,0.000100673766,0.00015862285],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005798374,0.0005665761,0.0006004895,0.0002065632,0.00035995647,0.005503699,0.00082032394,0.00025350993,0.0000043262835],"category_scores_gemma":[0.0000382368,0.0005079841,0.00021004617,0.00020362975,0.00006871676,0.0014414297,0.0028434412,0.0012945002,0.000019834444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101764745,0.00014247789,0.008663261,0.0033136748,0.0014911663,0.0005208891,0.005600029,0.74264145,0.010375829,0.035652276,0.0008781815,0.19061899],"study_design_scores_gemma":[0.00028773354,0.000053861746,0.00044879285,0.0019886226,0.00008528649,0.00008656649,0.00030603362,0.99019194,0.00009335665,0.005616843,0.00012665507,0.0007142901],"about_ca_topic_score_codex":0.0007514262,"about_ca_topic_score_gemma":0.00010041149,"teacher_disagreement_score":0.39611316,"about_ca_system_score_codex":0.0001574256,"about_ca_system_score_gemma":0.00038031992,"threshold_uncertainty_score":0.9997372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014872186,0.0015773303,0.97569823,0.0004994077,0.0058183772,0.000278878,0.000014718727,0.000697336,0.0005435296],"genre_scores_gemma":[0.99715483,0.0001487212,0.0012336017,0.00043465273,0.0005638926,0.000040925515,0.000009227427,0.000041056574,0.00037306556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698776,0.00011941909,0.00048282914,0.0011847537,0.0004582585,0.00076698326],"domain_scores_gemma":[0.9981716,0.00026017576,0.000064148866,0.0013426973,0.000025850815,0.00013549093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012579306,0.00028530497,0.00029071636,0.00038528658,0.00038970605,0.00063497503,0.0015355959,0.0001268319,0.000011209516],"category_scores_gemma":[0.000002472696,0.00028867906,0.00015880898,0.0010409064,0.000025981122,0.0003552622,0.000065945074,0.000855629,0.00004171117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000860665,0.00046859626,0.00009651792,0.00008458191,0.00019366799,0.0005304985,0.004012673,0.62275606,0.0012692757,0.0047814082,0.0007274417,0.36499318],"study_design_scores_gemma":[0.00037634425,0.000040867268,0.000015207962,0.0010466921,0.000028587452,0.00004119608,0.00017404147,0.98936117,0.00012787411,0.00026822343,0.00820746,0.0003123407],"about_ca_topic_score_codex":0.00011558644,"about_ca_topic_score_gemma":0.00036745326,"teacher_disagreement_score":0.9822827,"about_ca_system_score_codex":0.00020576971,"about_ca_system_score_gemma":0.000055953995,"threshold_uncertainty_score":0.99995655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040622674,0.00024384189,0.9572735,0.0001787938,0.0008779932,0.00022369785,1.8944442e-7,0.0004914069,0.00008794843],"genre_scores_gemma":[0.99854213,0.000019885883,0.000994188,0.0002783358,0.00006802042,0.000022339931,0.0000012830812,0.000020757681,0.000053078358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983332,0.00013857335,0.00038413174,0.0005361217,0.00021714893,0.00039079256],"domain_scores_gemma":[0.9992736,0.0003016327,0.000055568853,0.00025191152,0.00002711251,0.00009020535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031686,0.00020770865,0.00021188588,0.00033125572,0.00039146998,0.000433884,0.00023212445,0.000079437916,0.000005820892],"category_scores_gemma":[0.0000052373525,0.00021413788,0.00012232293,0.0004525226,0.000029632456,0.00027089132,0.000012215317,0.0009647393,0.0000110361025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044151907,0.000025898356,0.00005999817,0.000025417074,0.000015769445,0.00003657131,0.00058833184,0.90715796,0.00017789184,0.00019916135,0.000004347203,0.09170424],"study_design_scores_gemma":[0.00029117032,0.00015451212,0.00006129066,0.00045951954,0.00001141892,0.000020800851,0.000072221854,0.99837476,0.00026664956,0.000014992851,0.000049019396,0.00022361905],"about_ca_topic_score_codex":0.00019317208,"about_ca_topic_score_gemma":0.000047865582,"teacher_disagreement_score":0.9579194,"about_ca_system_score_codex":0.00015700221,"about_ca_system_score_gemma":0.000054105265,"threshold_uncertainty_score":0.8732289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2353269,0.0022006785,0.76055926,0.00035873658,0.00077010394,0.00027664143,0.0000011654517,0.0004938933,0.000012639773],"genre_scores_gemma":[0.9896039,0.000017487282,0.009417107,0.00046176827,0.00022958216,0.000021137184,0.000007346765,0.000028329321,0.00021335096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784034,0.00011253574,0.000373991,0.0009433893,0.00022345979,0.00050629204],"domain_scores_gemma":[0.99858636,0.0006706669,0.00009639958,0.00032538772,0.00018558302,0.00013560503],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00097332906,0.00028060938,0.00031447236,0.0001529732,0.0006440443,0.001278735,0.00057912344,0.000099693636,0.0000026320208],"category_scores_gemma":[0.00017400182,0.00026180502,0.00012842909,0.00027104685,0.000065042106,0.00045593863,0.00036637124,0.00056039414,0.000009752735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019744552,0.000037528203,0.0014584038,0.00014055354,0.00009477991,0.00012896043,0.0014031387,0.92024344,0.0045398735,0.047204304,0.000089841735,0.02463942],"study_design_scores_gemma":[0.0006463067,0.00013685378,0.00087575236,0.00068944134,0.000023546945,0.000028993943,0.000117663345,0.9963665,0.00050372706,0.000086629,0.00018627131,0.00033829882],"about_ca_topic_score_codex":0.00037907285,"about_ca_topic_score_gemma":0.000022711716,"teacher_disagreement_score":0.754277,"about_ca_system_score_codex":0.00007559572,"about_ca_system_score_gemma":0.000079384,"threshold_uncertainty_score":0.99998343},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24797137,0.0007072319,0.74904865,0.00011212253,0.0011637552,0.00019578224,0.000008628624,0.00057672465,0.00021571186],"genre_scores_gemma":[0.8697501,0.000008881209,0.12966803,0.00024143791,0.00020070383,0.000002176694,0.000037326936,0.000030862273,0.00006052838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776006,0.000067969144,0.00045110422,0.000976585,0.00037227236,0.00037201177],"domain_scores_gemma":[0.99880373,0.00022760584,0.00020474227,0.0005109711,0.00011275756,0.00014018475],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032997318,0.0003771239,0.00035090046,0.0004042865,0.00021705391,0.002960769,0.0006705393,0.00019744493,0.00000383042],"category_scores_gemma":[0.000030953608,0.00036458412,0.00013908633,0.0002973098,0.000024937268,0.00039899547,0.0029997265,0.0006910133,0.00001139736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003145045,0.00003040835,0.000802967,0.0005639616,0.00004857194,0.00004196825,0.0006711666,0.9866357,0.00035583394,0.00014867578,0.000006951923,0.010690649],"study_design_scores_gemma":[0.00020556983,0.000011409689,0.00004107442,0.00103748,0.000041124742,0.000016471566,0.00006735312,0.99777895,0.0002396487,0.00014355348,0.000013176135,0.00040421603],"about_ca_topic_score_codex":0.0008268921,"about_ca_topic_score_gemma":0.000028261271,"teacher_disagreement_score":0.62177867,"about_ca_system_score_codex":0.00014300161,"about_ca_system_score_gemma":0.00019602572,"threshold_uncertainty_score":0.9998806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23449986,0.003702963,0.7597321,0.0015185882,0.00023587007,0.00006123296,1.9848135e-7,0.00004070709,0.00020846017],"genre_scores_gemma":[0.98818964,0.0002528406,0.011199795,0.00030803165,0.00002362271,0.0000053633707,4.2460462e-7,0.000005347041,0.000014909386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999016,0.000052813244,0.00039561937,0.00017817145,0.0001637709,0.00019366245],"domain_scores_gemma":[0.999512,0.000054514345,0.00013871603,0.00020536044,0.000054354194,0.000035041696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006956794,0.00010943552,0.0002040067,0.0005225322,0.00009219265,0.0004606475,0.00070626347,0.0001162187,7.4310714e-7],"category_scores_gemma":[0.000015069544,0.000095204305,0.000034196517,0.0006163976,0.00006036101,0.0010037103,0.00031166495,0.00034305447,8.8376504e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008283867,0.0001240632,0.00071027974,0.00022417428,0.00017697299,0.0019407201,0.0011136994,0.1671869,0.0046450947,0.12888864,0.0002576454,0.694649],"study_design_scores_gemma":[0.0009777509,0.0002456415,0.000083922736,0.0011861268,0.00003111623,0.0005699061,0.0005682515,0.9794028,0.003611811,0.003334467,0.009756752,0.0002314453],"about_ca_topic_score_codex":0.000038707738,"about_ca_topic_score_gemma":0.000016872476,"teacher_disagreement_score":0.8122159,"about_ca_system_score_codex":0.00004547419,"about_ca_system_score_gemma":0.000042192685,"threshold_uncertainty_score":0.44420347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073859957,0.04390694,0.9330552,0.0025198334,0.00086385064,0.0010590478,0.000052175947,0.001417392,0.009739523],"genre_scores_gemma":[0.9025886,0.0006180477,0.09498768,0.00033518806,0.00007822995,0.0003769109,0.000083425446,0.000027395923,0.0009045302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810565,0.00046024646,0.00034421746,0.00050846534,0.00022228729,0.00035913693],"domain_scores_gemma":[0.99620956,0.00039127094,0.000081879734,0.0030479687,0.00012658903,0.00014273962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755705,0.00024826595,0.00023517295,0.00014858348,0.00073920836,0.0005899631,0.0026106723,0.00009064213,0.000005909817],"category_scores_gemma":[0.000039979772,0.00022783387,0.00017436287,0.0011013987,0.00014200014,0.0003812662,0.00079943147,0.0005996858,0.00013622784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057351408,0.0046653748,0.003598018,0.0004169427,0.0008620467,0.00007828152,0.04453534,0.26920277,0.0059348247,0.29597908,0.01885131,0.35581866],"study_design_scores_gemma":[0.00026536302,0.000041867974,0.0014831934,0.000095075404,0.00002567059,0.0000066180664,0.00012945945,0.92521316,0.00005281078,0.00020862266,0.07220171,0.0002764316],"about_ca_topic_score_codex":0.00014298283,"about_ca_topic_score_gemma":0.00006486691,"teacher_disagreement_score":0.8952026,"about_ca_system_score_codex":0.0001370298,"about_ca_system_score_gemma":0.000258963,"threshold_uncertainty_score":0.92907953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006501652,0.0003265808,0.9898123,0.0014268364,0.00059790723,0.00022160177,0.00014966163,0.0002793955,0.00068404054],"genre_scores_gemma":[0.997458,0.00029507474,0.0017096193,0.00015631662,0.000011902625,0.00004315144,0.000081110455,0.000010858837,0.00023399775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988229,0.00011792914,0.0004956705,0.00017830612,0.00019753716,0.00018760304],"domain_scores_gemma":[0.9978396,0.00048942136,0.00006904611,0.0014458582,0.00008993012,0.00006610403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026864727,0.0001432714,0.00018047816,0.00041648184,0.000206614,0.00030198589,0.0012957418,0.00008132408,0.000005965976],"category_scores_gemma":[0.000012308718,0.00014595619,0.00015270154,0.00063771446,0.00006976208,0.0014052296,0.000028570741,0.0005992313,0.000026801623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015543238,0.0049015735,0.00011308056,0.00029093356,0.0006802648,0.00007994308,0.019866263,0.33836478,0.005106235,0.17028126,0.0010446775,0.45911556],"study_design_scores_gemma":[0.0003934799,0.000090531095,0.0001974882,0.00037126913,0.000020275305,0.000017822762,0.00051935326,0.99476165,0.00025007335,0.0009439132,0.0022052948,0.00022884132],"about_ca_topic_score_codex":0.00038706008,"about_ca_topic_score_gemma":0.00048812275,"teacher_disagreement_score":0.9909563,"about_ca_system_score_codex":0.000104795465,"about_ca_system_score_gemma":0.000096490105,"threshold_uncertainty_score":0.5951921},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24495049,0.0013763361,0.7335051,0.0012640795,0.00016652861,0.000027699221,1.2745532e-7,0.0010864171,0.017623274],"genre_scores_gemma":[0.9862997,0.000014412948,0.0006966122,0.0001508573,0.000027134514,0.0000023136267,3.5619925e-7,0.000005361658,0.012803278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994638,0.000013890584,0.000055525787,0.00026409718,0.00008567741,0.00011702385],"domain_scores_gemma":[0.99982697,0.000034214172,0.0000071213135,0.00007446022,0.000015747975,0.000041499286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089726534,0.0000649095,0.00005592604,0.000058179856,0.00011496429,0.0006278949,0.00010837666,0.000018051596,0.000008898018],"category_scores_gemma":[0.0000037109726,0.000046869038,0.000013426107,0.00015512397,0.000010007893,0.000097723154,0.0001276689,0.00009438041,0.000007098832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017771472,0.00003129061,0.0041629705,0.000054453485,0.00014474879,0.0006297336,0.0010763834,0.002096495,0.012074573,0.58949924,0.0012790519,0.38893327],"study_design_scores_gemma":[0.00007478459,0.00005550102,0.00004875975,0.000051568495,0.0000028996405,0.00007119663,0.000044185606,0.9940794,0.00040646625,0.00029996707,0.00476557,0.000099710465],"about_ca_topic_score_codex":0.00036799803,"about_ca_topic_score_gemma":0.00007589889,"teacher_disagreement_score":0.9919829,"about_ca_system_score_codex":0.000009556286,"about_ca_system_score_gemma":0.000016899523,"threshold_uncertainty_score":0.6054805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05004382,0.0002455577,0.9439361,0.0029604875,0.0016553717,0.0002055431,0.000019130335,0.0004893121,0.00044466212],"genre_scores_gemma":[0.9601148,0.000006981862,0.035132706,0.003087365,0.00036296304,0.000053422857,0.000010039432,0.000020954642,0.0012108022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876964,0.000083528656,0.00015845087,0.00053357903,0.00019419307,0.000260604],"domain_scores_gemma":[0.9988726,0.0004875198,0.000025686737,0.00045594762,0.00008960757,0.00006866899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039798647,0.0001656031,0.00019020724,0.00009486347,0.0001192049,0.0008092788,0.0005852727,0.000075248034,0.0000056227236],"category_scores_gemma":[0.000027578144,0.0001301115,0.00016283673,0.00038757824,0.0000101080905,0.00084597897,0.0002581746,0.00017454897,0.000020728527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000413075,0.000068290756,0.00025256112,0.0005771082,0.0002885281,0.00010480959,0.0014876621,0.0058861133,0.012318317,0.80741304,0.018775467,0.15278682],"study_design_scores_gemma":[0.00023574634,0.000051205036,0.00017281025,0.000070064765,0.000025516296,0.00005478849,0.00016822838,0.9654189,0.0017584383,0.018944802,0.01284197,0.00025754934],"about_ca_topic_score_codex":0.0003427353,"about_ca_topic_score_gemma":0.00010155164,"teacher_disagreement_score":0.95953274,"about_ca_system_score_codex":0.00005253094,"about_ca_system_score_gemma":0.00011149688,"threshold_uncertainty_score":0.7803894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14665295,0.0018213075,0.8498762,0.0010592776,0.00014263412,0.00022539445,0.0000036570357,0.00013691999,0.00008165642],"genre_scores_gemma":[0.99302995,0.000060654893,0.00670929,0.00010194579,0.000040034167,0.000013072788,0.000018514736,0.000005043819,0.000021463411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991801,0.000044197604,0.00018496352,0.00036532455,0.000068417445,0.00015700673],"domain_scores_gemma":[0.99936503,0.00036437376,0.00003549517,0.00012878623,0.00006864032,0.000037654565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054758834,0.00008515433,0.000097109616,0.00009744498,0.00016469027,0.00039419252,0.0001154684,0.000044255106,9.0373554e-8],"category_scores_gemma":[0.000063041676,0.00007831813,0.000013828575,0.0004954296,0.000023489634,0.00029649466,0.000076789984,0.000110295005,4.1676805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007105318,0.00009685187,0.0033985253,0.00024113905,0.000047151596,0.00001655421,0.009912586,0.10806624,0.00454977,0.31517935,0.0018083475,0.55661243],"study_design_scores_gemma":[0.00020932268,0.00003320388,0.0021768087,0.00010869482,0.0000043322184,0.000007251654,0.00015322008,0.9963208,0.00007803634,0.0005607907,0.00024882026,0.000098754615],"about_ca_topic_score_codex":0.00009002629,"about_ca_topic_score_gemma":0.00005089643,"teacher_disagreement_score":0.8882545,"about_ca_system_score_codex":0.00005191072,"about_ca_system_score_gemma":0.000038904647,"threshold_uncertainty_score":0.38012075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08736078,0.0035940001,0.89647895,0.011261559,0.0006852134,0.00024821924,0.0000054931484,0.000020995323,0.00034477355],"genre_scores_gemma":[0.99348795,0.00077474664,0.0027036471,0.0020143813,0.0006819985,0.000016751548,7.136719e-7,0.0000049216123,0.0003148853],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99937725,0.00012958268,0.00019723017,0.00010405715,0.00010593674,0.00008596063],"domain_scores_gemma":[0.999074,0.00040831685,0.00013905657,0.00025125698,0.00009431659,0.00003307217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034541287,0.000068188194,0.0001142541,0.00005112944,0.00026833845,0.00008716849,0.00038277713,0.000018707706,4.3409656e-7],"category_scores_gemma":[0.000003902344,0.00003805508,0.00006165944,0.00037072596,0.000051501902,0.000029498953,0.0001398166,0.00021570442,3.98922e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026610096,0.00011354898,0.007078796,0.000012309513,0.00016541347,0.0000010125142,0.0004340062,0.007325838,0.000023233613,0.04094075,0.053670153,0.8902083],"study_design_scores_gemma":[0.00035249477,0.00014246155,0.61489594,0.0001383618,0.00004022212,0.000068163616,0.000013400409,0.0707804,0.000018263174,0.030385043,0.28301933,0.00014594998],"about_ca_topic_score_codex":0.000012011169,"about_ca_topic_score_gemma":0.000035162226,"teacher_disagreement_score":0.90612715,"about_ca_system_score_codex":0.0000073048723,"about_ca_system_score_gemma":0.000038058373,"threshold_uncertainty_score":0.20638694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01839658,0.0008359649,0.9764861,0.0030436479,0.00017215927,0.0002180269,0.000008362872,0.00033954938,0.0004996091],"genre_scores_gemma":[0.9839708,0.00060094363,0.008960764,0.0001848889,0.0000050670546,0.00007210132,0.000025443294,0.000012255387,0.006167689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989548,0.00026247263,0.0002214379,0.00027664902,0.00009812513,0.00018651284],"domain_scores_gemma":[0.9985442,0.00067328505,0.00006515465,0.00055310916,0.00011220075,0.000052025818],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00025594237,0.00013889387,0.0001649312,0.00022498441,0.002039316,0.00022537897,0.00060231076,0.00006869937,0.0000039480133],"category_scores_gemma":[0.000027318292,0.00015286996,0.00011200926,0.00034083138,0.0000835508,0.00020250324,0.000017264298,0.000691163,0.0000045990955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013560674,0.0014132517,0.0002094924,0.00014122215,0.0006075249,0.000004023596,0.004207301,0.115666844,0.09867338,0.015666405,0.00013456038,0.7631404],"study_design_scores_gemma":[0.0006231433,0.000071365524,0.000040371127,0.00009286442,0.00004811338,0.0000043241025,0.0005044931,0.9881206,0.00046251246,0.0002472504,0.009622588,0.00016233242],"about_ca_topic_score_codex":0.00012092205,"about_ca_topic_score_gemma":0.00022241112,"teacher_disagreement_score":0.96752536,"about_ca_system_score_codex":0.00007767605,"about_ca_system_score_gemma":0.00006778209,"threshold_uncertainty_score":0.9992599},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058660745,0.0001423778,0.9901048,0.000082805695,0.0005480463,0.0010663682,0.00000765788,0.0002282249,0.0019536735],"genre_scores_gemma":[0.73513645,0.00039204484,0.26235968,0.00091081415,0.00014052293,0.00009913761,0.00038802729,0.000016939563,0.00055641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981168,0.00012600321,0.0006370064,0.0004706018,0.00031380885,0.0003358064],"domain_scores_gemma":[0.99880546,0.000031375046,0.0002521182,0.00068401196,0.00016138854,0.00006562255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043366378,0.0002796601,0.0003069249,0.00091182685,0.00008241567,0.0005552787,0.0009577798,0.00032656104,0.0000046371993],"category_scores_gemma":[0.000052280204,0.00028189833,0.00013987868,0.0009577227,0.000023185577,0.00078547385,0.0018894074,0.0006676918,0.0000022251286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002291092,0.00006949391,0.000047527854,0.00009486371,0.00002038154,0.0000012612185,0.00053606037,0.9896271,0.0000012542171,0.0013789464,0.0000180923,0.008182059],"study_design_scores_gemma":[0.0002126405,0.000023201266,0.000026332686,0.00019306636,0.0000107052165,0.0000050117937,0.000086338,0.9990272,0.000005570335,0.00012532329,0.000026666909,0.00025793654],"about_ca_topic_score_codex":0.0009387652,"about_ca_topic_score_gemma":0.0000075859657,"teacher_disagreement_score":0.72927034,"about_ca_system_score_codex":0.0008094376,"about_ca_system_score_gemma":0.00055881677,"threshold_uncertainty_score":0.99996334},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0943589e-8,0.5121818,0.4827226,0.000019889789,0.00057788304,0.004339845,0.000020503823,0.00006821123,0.000069215814],"genre_scores_gemma":[0.000064566484,0.96874934,0.0007570044,0.00031302453,0.0002969885,0.028798688,0.00003397352,0.000035797384,0.000950588],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963418,0.00046818377,0.0012659262,0.001188591,0.00031818915,0.0004172708],"domain_scores_gemma":[0.99724936,0.0007369857,0.0007774105,0.0009665375,0.0001473162,0.0001224062],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008513902,0.0006095305,0.0019315286,0.0002947955,0.0001425611,0.0010493293,0.0025763325,0.00021757252,0.000001178298],"category_scores_gemma":[0.00023409532,0.00047795317,0.00048783416,0.00045003017,0.000047454,0.00026400262,0.0006306329,0.00022466556,0.0000044585795],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003892068,0.00008164768,1.301672e-7,0.04582794,0.00012607733,0.000009993425,0.000011352224,0.000020668138,7.7988915e-8,0.047155578,0.00093302986,0.9058296],"study_design_scores_gemma":[0.000061739476,0.00009021085,3.3384282e-8,0.15859298,0.00043207154,0.00002353537,0.0000037230782,0.06989287,0.00002134951,0.00026417067,0.7699862,0.0006311077],"about_ca_topic_score_codex":0.00035884124,"about_ca_topic_score_gemma":0.000034505556,"teacher_disagreement_score":0.9051985,"about_ca_system_score_codex":0.00013641844,"about_ca_system_score_gemma":0.00028509813,"threshold_uncertainty_score":0.99998766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009755338,0.0001793844,0.9850056,0.001803412,0.001358386,0.00023671097,0.0000019888394,0.00068049895,0.000978662],"genre_scores_gemma":[0.9844715,0.0000045041857,0.013666927,0.0007974107,0.00022374911,0.000013588857,0.000027083504,0.000014413224,0.00078083866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989606,0.00003878114,0.00020258792,0.000409821,0.00011330475,0.0002748689],"domain_scores_gemma":[0.9992957,0.0002959686,0.000042559914,0.00020622658,0.0000922024,0.00006730823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041922435,0.0001340431,0.0001325198,0.00008840623,0.00023751294,0.00040749053,0.00024433012,0.00003966166,0.000006329083],"category_scores_gemma":[0.00002040669,0.00010133096,0.00007769689,0.00023319857,0.000014638816,0.00042079837,0.000115306706,0.00017118834,0.000009408061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006323091,0.00009322262,0.0008324246,0.00009109043,0.0001921628,0.000026200738,0.0012382981,0.020769477,0.0006254149,0.1328492,0.012736812,0.8304825],"study_design_scores_gemma":[0.0002963831,0.00011844205,0.00008992005,0.0001148412,0.000012255841,0.00002312602,0.00010241728,0.98973966,0.000058469206,0.00006802992,0.00921496,0.00016152412],"about_ca_topic_score_codex":0.00013205357,"about_ca_topic_score_gemma":0.000037862537,"teacher_disagreement_score":0.9747161,"about_ca_system_score_codex":0.0000612706,"about_ca_system_score_gemma":0.00003783867,"threshold_uncertainty_score":0.41321564},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024581837,0.00041308146,0.9434899,0.0004889158,0.00065243675,0.00013709959,4.5264382e-8,0.0009225303,0.029314158],"genre_scores_gemma":[0.9877779,0.000090448164,0.0010757615,0.0003231578,0.00003398524,0.000020209352,0.000007233964,0.000012301003,0.010659042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987333,0.000055494245,0.0002093965,0.0004382341,0.00027344847,0.00029015008],"domain_scores_gemma":[0.9996205,0.000039798833,0.000026309648,0.0002121023,0.000034108532,0.000067209985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002953318,0.00015513238,0.00011691602,0.00014979538,0.00029330963,0.0008052582,0.00033990206,0.00003691654,0.000040241786],"category_scores_gemma":[0.000008551971,0.00013568264,0.00009551482,0.0002915865,0.000010972033,0.00039977915,0.00031367515,0.00023952227,0.00030041952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001274553,0.000051764557,0.000030197014,0.00021231023,0.0003708923,0.00067800423,0.0014020592,0.45474654,0.018943625,0.0936431,0.0008646922,0.42904407],"study_design_scores_gemma":[0.00015116758,0.00004458223,0.000042378393,0.000089455,0.00001323388,0.000012507923,0.00011882317,0.9961688,0.00061366777,0.0001352043,0.002419601,0.00019059489],"about_ca_topic_score_codex":0.00006816195,"about_ca_topic_score_gemma":0.000015345862,"teacher_disagreement_score":0.96319604,"about_ca_system_score_codex":0.00013501417,"about_ca_system_score_gemma":0.000020331923,"threshold_uncertainty_score":0.7765124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36097756,0.00095954275,0.63602877,0.00033526812,0.0012533813,0.00011345656,0.000002318667,0.00006219416,0.00026750434],"genre_scores_gemma":[0.995072,0.00007088779,0.0036697863,0.00041799244,0.00008065344,0.0000083283685,6.6027536e-7,0.000007796547,0.0006719059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.000072198505,0.00046234878,0.00030048893,0.00024451312,0.0002465474],"domain_scores_gemma":[0.998915,0.00020568981,0.0003164765,0.00026898322,0.00020503174,0.00008880836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001012421,0.00014863956,0.00027420302,0.0003805453,0.00015749711,0.000421396,0.0008930761,0.000070961396,0.0000028136703],"category_scores_gemma":[0.000063754575,0.00013579642,0.00015879615,0.0002404863,0.000030952713,0.0009151996,0.0002399804,0.00036753766,8.120002e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057090796,0.0005552952,0.01196698,0.0023115205,0.0012642302,0.00015221382,0.019920774,0.0038981487,0.05150039,0.008011187,0.017555583,0.88229275],"study_design_scores_gemma":[0.0017389294,0.00050868996,0.0029302468,0.0017962785,0.00010146014,0.00049584126,0.0007349196,0.96382314,0.012507947,0.011415981,0.003478865,0.00046767437],"about_ca_topic_score_codex":0.00076885574,"about_ca_topic_score_gemma":0.000022309841,"teacher_disagreement_score":0.959925,"about_ca_system_score_codex":0.000078699726,"about_ca_system_score_gemma":0.000053748536,"threshold_uncertainty_score":0.5537617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075876586,0.00014700799,0.9216167,0.00024289,0.00038956644,0.00016530429,0.0000013342433,0.00012448536,0.0014361637],"genre_scores_gemma":[0.9511279,0.000009503675,0.04727489,0.0001939544,0.00002459873,0.000018067274,0.000002656685,0.0000036797244,0.0013447558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.000026835029,0.0002481576,0.00025891178,0.0001085255,0.00015640042],"domain_scores_gemma":[0.99932253,0.00017751152,0.000066659515,0.000287459,0.0001227408,0.000023092523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030397577,0.00010209996,0.00014874023,0.0001674833,0.00012200292,0.00029559527,0.00042366775,0.000047016918,0.000001886437],"category_scores_gemma":[0.000071250455,0.00008491438,0.000090165995,0.00022043471,0.000012425658,0.000707056,0.00010447593,0.00009542202,0.0000019628847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003810951,0.00015436637,0.00022527386,0.000093915696,0.00007605205,0.0000022055538,0.002144428,0.0008569746,0.28349024,0.57975006,0.0006444212,0.13252394],"study_design_scores_gemma":[0.00086255086,0.00008892838,0.0003925021,0.00019577926,0.00001738765,0.0000022817558,0.0032471428,0.96809345,0.019229645,0.007165094,0.0005235132,0.0001817217],"about_ca_topic_score_codex":0.00057768147,"about_ca_topic_score_gemma":0.00029102256,"teacher_disagreement_score":0.96723646,"about_ca_system_score_codex":0.00003228168,"about_ca_system_score_gemma":0.00011732419,"threshold_uncertainty_score":0.3462708},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015609855,0.00067119603,0.9764923,0.0007761489,0.000838009,0.00013383674,0.0000013596539,0.00014783045,0.00532945],"genre_scores_gemma":[0.9736363,0.000025565549,0.020220758,0.00053318,0.00008850203,0.000009433766,0.0000032404816,0.000020201694,0.0054628123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973981,0.00038863777,0.0007943033,0.00045685025,0.00054058264,0.0004215265],"domain_scores_gemma":[0.99844766,0.00020003864,0.00048522817,0.00037847273,0.00033228926,0.00015629138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014188439,0.0003149594,0.0006220621,0.0004872907,0.00018984044,0.00075321656,0.0012355191,0.00013581262,0.000087568245],"category_scores_gemma":[0.000099667406,0.00026833647,0.00061335164,0.00043909403,0.00007561473,0.0011338223,0.0001000296,0.001158376,0.0000053980975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082648396,0.00017417163,0.000066324705,0.000079993224,0.0009327262,0.000052694228,0.0015701996,0.98988545,0.0018573571,0.0015608687,0.00220986,0.0015277113],"study_design_scores_gemma":[0.0010046965,0.00020970382,0.000009593543,0.00019269128,0.00034188307,0.00016385234,0.00013581714,0.99300754,0.0038148598,0.000346942,0.0005171886,0.00025522866],"about_ca_topic_score_codex":0.00017799431,"about_ca_topic_score_gemma":0.0000021534872,"teacher_disagreement_score":0.95802647,"about_ca_system_score_codex":0.00014267219,"about_ca_system_score_gemma":0.00033491742,"threshold_uncertainty_score":0.9999769},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.0583143e-8,0.7017321,0.29505152,0.000305242,0.0009958231,0.00040926502,0.000007440927,0.00011614263,0.0013824344],"genre_scores_gemma":[0.0000157281,0.99305654,0.0005243008,0.0029906482,0.00050088874,0.00039684057,0.000068793226,0.00004877668,0.0023975112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98916095,0.006378953,0.0016310998,0.0011933845,0.0005698054,0.0010658269],"domain_scores_gemma":[0.99363613,0.0034328024,0.00089489337,0.001814822,0.000116658535,0.00010471398],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0062530036,0.0008959714,0.0025154504,0.00075661,0.00010121189,0.00034590927,0.0045049796,0.0007204391,0.00001433117],"category_scores_gemma":[0.0007660288,0.0006305551,0.0013185206,0.0035033883,0.00007418474,0.00018136478,0.00031282532,0.002332931,0.00001493584],"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.000010150327,0.000067849156,6.144722e-8,0.0012999955,0.00011653428,0.00003655056,0.00000998188,0.000012828494,0.0000017263787,0.103358135,0.006415633,0.88867056],"study_design_scores_gemma":[0.00049993605,0.00016896432,1.5326396e-8,0.036512207,0.00054181344,0.00005425827,8.7224197e-7,0.0017906161,0.000013448663,0.0024533777,0.957378,0.00058654],"about_ca_topic_score_codex":0.00020712042,"about_ca_topic_score_gemma":0.00012681447,"teacher_disagreement_score":0.9509623,"about_ca_system_score_codex":0.00052508165,"about_ca_system_score_gemma":0.0029506425,"threshold_uncertainty_score":0.9999687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015238701,0.00007153356,0.97809005,0.004320568,0.0005683548,0.000638973,0.000010406321,0.0008696858,0.00019172105],"genre_scores_gemma":[0.9609352,0.000025545714,0.037768807,0.00028337626,0.000027402724,0.00035952544,0.0000028380305,0.000013242461,0.00058407494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987197,0.000050375136,0.00026343708,0.000511117,0.00013297357,0.00032237664],"domain_scores_gemma":[0.99909323,0.000073921685,0.00007614361,0.00052018854,0.00019935425,0.000037138183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014906481,0.00018426296,0.00022948917,0.0010251116,0.0004507521,0.00007138978,0.00053894863,0.00025493777,0.0000024302622],"category_scores_gemma":[0.000026009819,0.00019477011,0.0001844391,0.0011458994,0.000079576115,0.0002495986,0.0000075819376,0.00034579606,0.000008651655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018429518,0.0005587551,0.000010717524,0.00006375558,0.0003098665,0.000011175292,0.00013222876,0.57802916,0.07660474,0.09739304,0.000096475684,0.24660577],"study_design_scores_gemma":[0.0016910492,0.00025614168,0.00001499534,0.0001238069,0.000055741086,0.000014141317,0.000081828206,0.94166255,0.052243527,0.0033398652,0.0002424554,0.0002738973],"about_ca_topic_score_codex":0.000043468004,"about_ca_topic_score_gemma":0.00001699563,"teacher_disagreement_score":0.9456965,"about_ca_system_score_codex":0.00017696578,"about_ca_system_score_gemma":0.00018006128,"threshold_uncertainty_score":0.7942494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084575854,0.00007131319,0.907334,0.0054707937,0.0022010908,0.00014972182,0.0000022765887,0.000044567936,0.00015034064],"genre_scores_gemma":[0.8447197,0.000022934937,0.1546944,0.00023102348,0.000085284904,0.000014849091,0.0000010598318,0.0000030513493,0.00022768877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998279,0.000018921979,0.0004868834,0.00020655325,0.00069450267,0.00031416467],"domain_scores_gemma":[0.99715334,0.00021559799,0.000101374026,0.00022094906,0.0022304684,0.00007824257],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004344877,0.00008175588,0.0001447796,0.006868659,0.0001702999,0.0013421937,0.0020994155,0.000052793457,0.0000021375993],"category_scores_gemma":[0.000472265,0.00007449538,0.000039382365,0.0021622288,0.00023441527,0.0031568052,0.0007337729,0.00026734272,0.000010328182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055446617,0.00006028702,0.00019850151,0.00003170545,0.00003494155,0.000015610505,0.00074560294,0.05281121,0.013580584,0.02711771,0.006161312,0.8991871],"study_design_scores_gemma":[0.00040973988,0.0001008866,0.00014798148,0.00022773433,8.893106e-7,0.000049070513,0.00004115791,0.9708841,0.0023184658,0.00084388413,0.024897266,0.00007884158],"about_ca_topic_score_codex":0.0000025535496,"about_ca_topic_score_gemma":2.6191793e-7,"teacher_disagreement_score":0.9180729,"about_ca_system_score_codex":0.00015114223,"about_ca_system_score_gemma":0.00027296154,"threshold_uncertainty_score":0.9996945},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052860687,0.00025708502,0.9900497,0.00021255256,0.0014828751,0.0005239242,0.000027428121,0.0005717566,0.0015885995],"genre_scores_gemma":[0.97544724,0.0000016721385,0.022829149,0.00012402105,0.00013816473,0.000045356865,0.000021335803,0.000012246078,0.0013808295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890804,0.000053687887,0.00020397609,0.00039019977,0.0002457211,0.00019839518],"domain_scores_gemma":[0.9994909,0.00006508109,0.000039100756,0.00028899845,0.0000605167,0.000055406916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031623157,0.00012716597,0.0001247545,0.0001634691,0.00014225855,0.00038770665,0.00026819427,0.000040812432,0.0000058123237],"category_scores_gemma":[0.0000030489869,0.00011320023,0.000096995565,0.00021191621,0.00001688853,0.00032230548,0.00007626827,0.00007605083,0.0000138221285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015269656,0.00034611832,0.00057675206,0.0016080007,0.00074821466,0.00030638094,0.00100054,0.4410454,0.0056231944,0.44078946,0.053209964,0.05459326],"study_design_scores_gemma":[0.0002535557,0.00009586488,0.00015283596,0.00012134887,0.000028037372,0.0000055780133,0.00010769278,0.9949805,0.000038085374,0.0001339678,0.003955702,0.00012683691],"about_ca_topic_score_codex":0.0004215533,"about_ca_topic_score_gemma":0.000009293637,"teacher_disagreement_score":0.97016114,"about_ca_system_score_codex":0.00018016393,"about_ca_system_score_gemma":0.000051274958,"threshold_uncertainty_score":0.4616171},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025570677,0.009239624,0.98412037,0.0019224297,0.00073341595,0.00065414835,0.000009750596,0.000054733515,0.0007084626],"genre_scores_gemma":[0.9870948,0.0021603915,0.0032436117,0.00042300185,0.00027781812,0.00008013535,0.000006805269,0.000018743542,0.006694662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972923,0.000187868,0.0004421502,0.00043150873,0.00040335886,0.0012428091],"domain_scores_gemma":[0.9983018,0.00035056216,0.00044538057,0.0006651944,0.00018806018,0.000049026003],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0023353302,0.00024947472,0.0003156286,0.00029554337,0.00018697466,0.00017972586,0.002624679,0.00012439983,0.00000124129],"category_scores_gemma":[0.000035084857,0.00018848717,0.00044902606,0.00023876036,0.000050532795,0.00006880361,0.00096139836,0.0024905903,0.0000020468067],"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.0002992779,0.00019208176,0.00015713814,0.00017171391,0.0013563737,0.000007779801,0.00030913064,0.0072105112,0.0000102630665,0.61955625,0.001983458,0.368746],"study_design_scores_gemma":[0.0033242716,0.00094726356,0.00045527038,0.0013170778,0.0007355492,0.000069842456,0.0014016817,0.62351096,0.00026830632,0.3429196,0.024241228,0.0008089337],"about_ca_topic_score_codex":0.00010300438,"about_ca_topic_score_gemma":0.000074430296,"teacher_disagreement_score":0.9845378,"about_ca_system_score_codex":0.0008978659,"about_ca_system_score_gemma":0.002212349,"threshold_uncertainty_score":0.9998107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072560884,0.00010640932,0.92600006,0.00020347384,0.000118791504,0.00013944568,0.00001227196,0.00015069215,0.0007079847],"genre_scores_gemma":[0.9517744,0.000016583632,0.04709031,0.00052028394,0.0000049322484,0.000007807957,0.000026854785,0.000005645481,0.0005531576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991025,0.00006841974,0.00021134871,0.0002831986,0.00014326889,0.0001912779],"domain_scores_gemma":[0.9992713,0.000076387885,0.00007946963,0.0003994157,0.00012696044,0.00004649119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010322457,0.00011858519,0.00017856175,0.00009871787,0.00010397269,0.00008759522,0.0003827968,0.00005273011,0.00007033908],"category_scores_gemma":[0.000021765405,0.000097040574,0.00006791656,0.0002678708,0.000025505597,0.00022914288,0.00014302376,0.000090031404,0.0000012549948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021056827,0.0003144311,0.0026798872,0.000064271495,0.0002639305,0.000018973315,0.00016418494,0.9630336,0.008476566,0.015379154,0.0014921939,0.007902201],"study_design_scores_gemma":[0.0007170007,0.000057969148,0.00024383125,0.0000460208,0.000020171738,0.000008651168,0.00002656413,0.9947842,0.0037076052,0.00020296931,0.0000531974,0.00013183312],"about_ca_topic_score_codex":0.0012026029,"about_ca_topic_score_gemma":0.00021737478,"teacher_disagreement_score":0.8792135,"about_ca_system_score_codex":0.000047254944,"about_ca_system_score_gemma":0.00007764432,"threshold_uncertainty_score":0.39571998},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123895235,0.0005719498,0.8745417,0.00026187,0.0004706188,0.00019376715,3.8923457e-7,0.000056392633,0.000008052609],"genre_scores_gemma":[0.98216885,0.000059301827,0.01751551,0.00006461533,0.000047168538,0.000020704345,0.0000016717161,0.000009056687,0.00011309843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.000076440774,0.0002697428,0.00022761345,0.000073616786,0.00021775454],"domain_scores_gemma":[0.9994566,0.00020518526,0.00005380964,0.000089980735,0.00012215375,0.00007229674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060134236,0.00013606617,0.00015991234,0.00021161596,0.00018144654,0.0002507832,0.0001482167,0.00007479472,0.0000012893987],"category_scores_gemma":[0.00013141708,0.000126371,0.000048152855,0.00029145787,0.000007792974,0.00034729028,0.000025740577,0.00033520564,2.6182937e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005650592,0.00006274927,0.00042085082,0.00003980217,0.000047499867,0.000009690489,0.0004498097,0.94852614,0.035567842,0.0009113423,0.00012392696,0.013783861],"study_design_scores_gemma":[0.0010840181,0.00006761526,0.009092556,0.00030426143,0.000016924663,0.00007906054,0.000010849727,0.9887534,0.00018797068,0.000033151562,0.00023738544,0.0001328092],"about_ca_topic_score_codex":0.00001477513,"about_ca_topic_score_gemma":0.000023314191,"teacher_disagreement_score":0.8582736,"about_ca_system_score_codex":0.000116822295,"about_ca_system_score_gemma":0.00007244505,"threshold_uncertainty_score":0.51532596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20747848,0.00013268414,0.7916217,0.00029214993,0.00026306583,0.00005754285,2.1753249e-7,0.000015192061,0.00013898556],"genre_scores_gemma":[0.9866104,0.000052484917,0.011585576,0.00018115794,0.00001536951,0.0000024164176,6.529811e-7,0.0000066720777,0.0015452344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993121,0.00004415651,0.00020733937,0.00016361296,0.00013814041,0.00013461825],"domain_scores_gemma":[0.9996937,0.00006699991,0.00008077407,0.00008543504,0.000031762513,0.000041362044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032507858,0.00009439672,0.00013653767,0.00013645466,0.00010575364,0.00016960263,0.00030834373,0.00003786505,0.0000026979435],"category_scores_gemma":[0.000018868841,0.000078357465,0.000058118487,0.000053947206,0.00003037214,0.0005427846,0.00003650739,0.0002852257,3.5026008e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044864544,0.00018985209,0.0042825043,0.00016075384,0.00054733985,0.000039260573,0.009811779,0.8207908,0.04375091,0.0027330276,0.00053281896,0.11671228],"study_design_scores_gemma":[0.0007683898,0.00022632594,0.00016581982,0.00030799973,0.000030259745,0.00010701215,0.00006627363,0.9958144,0.0018647334,0.00020945883,0.00034030955,0.00009902068],"about_ca_topic_score_codex":0.0000246376,"about_ca_topic_score_gemma":0.0000016839725,"teacher_disagreement_score":0.7800361,"about_ca_system_score_codex":0.000047373233,"about_ca_system_score_gemma":0.000025047655,"threshold_uncertainty_score":0.31953248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31347975,0.20545278,0.43612066,0.034555107,0.0027717247,0.005402653,0.000041415686,0.0009130379,0.0012628682],"genre_scores_gemma":[0.9564115,0.028247887,0.0106685255,0.003923751,0.000053016265,0.00024112554,0.00023260385,0.0000152243765,0.00020637654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692136,0.00031737395,0.0005895178,0.00059331994,0.0012799395,0.00029846738],"domain_scores_gemma":[0.99707305,0.00022267376,0.00032222195,0.0014036022,0.0009004031,0.00007802761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035971967,0.00025979773,0.00039906835,0.0006211246,0.00032002316,0.00018692577,0.0017493775,0.00008415043,0.00003354809],"category_scores_gemma":[0.0017068124,0.00021149726,0.00009800796,0.0042365883,0.00003891453,0.0009897965,0.0004116537,0.0002927092,0.000047205624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010669335,0.000316318,0.0049673263,0.0012300505,0.000085397376,0.0000015488368,0.000087935456,0.0009239402,0.00001727341,0.0027054944,0.001616723,0.98803735],"study_design_scores_gemma":[0.0026023109,0.00042400957,0.12629338,0.0058217854,0.000593592,0.000018842768,0.000073403244,0.82733566,0.00009732404,0.00012579895,0.035857037,0.0007568414],"about_ca_topic_score_codex":0.000022552307,"about_ca_topic_score_gemma":0.00002191852,"teacher_disagreement_score":0.9872805,"about_ca_system_score_codex":0.00023572911,"about_ca_system_score_gemma":0.0002896162,"threshold_uncertainty_score":0.8624608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6890832,0.0002088848,0.25307575,0.0033456436,0.00026659324,0.000106251086,2.7636153e-7,0.00030119103,0.05361217],"genre_scores_gemma":[0.9932393,0.000013211299,0.00083904597,0.0012214399,0.00000817586,0.000006743397,6.4983806e-7,0.0000028915217,0.0046685436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936455,0.000036575984,0.00011178877,0.00021698851,0.00010676911,0.00016333481],"domain_scores_gemma":[0.9995933,0.000048013528,0.000018813784,0.00029455515,0.0000226966,0.000022624576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438158,0.000082823004,0.00009349318,0.00018953125,0.00008343748,0.00010269666,0.00030390325,0.000029916137,0.0000033958797],"category_scores_gemma":[0.000010837965,0.00006461821,0.00002785187,0.00038352818,0.00001694849,0.00030546036,0.0001031183,0.00013628916,0.000011183624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103374885,0.0004983464,0.098544575,0.00015956837,0.00016231381,0.00013424532,0.0056260685,0.03024025,0.037499424,0.33034027,0.0021787747,0.4945128],"study_design_scores_gemma":[0.001450057,0.00015211586,0.18393628,0.0003600117,0.000019977502,0.000049986098,0.00132851,0.8078174,0.00066796143,0.0023139277,0.0013472677,0.00055649545],"about_ca_topic_score_codex":0.0016635099,"about_ca_topic_score_gemma":0.0013699051,"teacher_disagreement_score":0.77757716,"about_ca_system_score_codex":0.0000829247,"about_ca_system_score_gemma":0.000056062257,"threshold_uncertainty_score":0.26350543},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08833839,0.000061318744,0.8820942,0.0006244673,0.00031849043,0.00014100953,0.000003415263,0.00018714632,0.028231585],"genre_scores_gemma":[0.9509591,0.000015945318,0.04330402,0.0011228141,0.000029235322,0.000025675572,0.0000044096164,0.000010582433,0.0045282333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990587,0.000024444822,0.00021460112,0.0002485434,0.00024219768,0.00021146968],"domain_scores_gemma":[0.999084,0.00016832567,0.000058631067,0.00060207484,0.000039504775,0.000047459394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001899626,0.00014098162,0.00016131048,0.00010960237,0.00012157421,0.0001625695,0.0006077985,0.000040161525,0.000014265866],"category_scores_gemma":[0.00004892775,0.00011862206,0.000097926444,0.00018453819,0.000023763498,0.0001225049,0.00021908557,0.00012246692,0.000125233],"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.00001240574,0.0001568328,0.000014023659,0.00007528703,0.00006392231,0.000021317566,0.00090422324,0.003866656,0.000669042,0.9831163,0.008050466,0.0030495063],"study_design_scores_gemma":[0.0007353532,0.00017095637,0.000033815417,0.00040429126,0.000037131278,0.000009460037,0.0005373223,0.9552825,0.002425976,0.038227495,0.0017421873,0.00039350003],"about_ca_topic_score_codex":0.0000051862417,"about_ca_topic_score_gemma":9.1726304e-7,"teacher_disagreement_score":0.95141584,"about_ca_system_score_codex":0.00004830938,"about_ca_system_score_gemma":0.00004035776,"threshold_uncertainty_score":0.48372674},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044219296,0.00016219355,0.95052207,0.0003909786,0.004463809,0.000116515206,0.000007446896,0.00006174573,0.00005597683],"genre_scores_gemma":[0.9925764,0.0000075855646,0.0064146137,0.00010552119,0.00083291676,0.000009938117,0.000010559538,0.000007257511,0.00003520161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900496,0.000036605335,0.00044896267,0.00013838752,0.0002294306,0.00014165656],"domain_scores_gemma":[0.9987565,0.00036326377,0.00017115474,0.00013166845,0.0005024169,0.00007496179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004109972,0.00010936574,0.00015833843,0.00039625276,0.00007533972,0.0003001278,0.0009364691,0.000084699226,0.0000018222959],"category_scores_gemma":[0.00013696414,0.000110373345,0.00013917149,0.00020922435,0.000010584744,0.00054918625,0.00005815968,0.000352989,5.2770565e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018141067,0.000046565878,0.00010944858,0.0000016037136,0.00013252493,0.000012175048,0.000054271906,0.95605963,0.0002835724,0.011488949,0.00053643965,0.03125666],"study_design_scores_gemma":[0.0008820077,0.00013277777,0.00010401728,0.000103981,0.000017865374,0.00004011219,0.000044975084,0.9967029,0.000082029626,0.00052185374,0.0012722902,0.00009519958],"about_ca_topic_score_codex":0.000026895928,"about_ca_topic_score_gemma":0.0000017210109,"teacher_disagreement_score":0.9483571,"about_ca_system_score_codex":0.00016675188,"about_ca_system_score_gemma":0.00029127556,"threshold_uncertainty_score":0.45008945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079780646,0.00014532091,0.9189122,0.00037614148,0.00034358958,0.00030818558,0.0000018737015,0.00008144516,0.000050602208],"genre_scores_gemma":[0.99482584,0.000033721215,0.004747066,0.0002473482,0.000017299526,0.000057862257,2.9712533e-7,0.000005698773,0.000064839944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989381,0.000020559404,0.00019746266,0.00040215344,0.00013674387,0.00030497878],"domain_scores_gemma":[0.9993822,0.00026812084,0.000019808867,0.00016374254,0.000075639575,0.00009050524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005570865,0.00014077894,0.00018408483,0.00022129247,0.00034346088,0.00018115315,0.00021579716,0.000042788197,7.803742e-7],"category_scores_gemma":[0.000022330963,0.0001318257,0.000026612977,0.0008126997,0.00005243214,0.00035148155,0.000005856891,0.00016033303,8.87557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002476287,0.000025964026,0.0000013025232,0.00007321159,0.000006961105,0.0000029962791,0.00046064344,0.9540482,0.014014902,0.00034894975,0.000020486461,0.030971596],"study_design_scores_gemma":[0.00048623746,0.00006652192,0.00011753328,0.00033708982,0.000013714517,0.000008930261,0.00001431418,0.99811125,0.00049583835,0.00009414962,0.000112063666,0.00014233857],"about_ca_topic_score_codex":0.000022917124,"about_ca_topic_score_gemma":0.00001670418,"teacher_disagreement_score":0.9150452,"about_ca_system_score_codex":0.00006068037,"about_ca_system_score_gemma":0.00014102802,"threshold_uncertainty_score":0.5375696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040994767,0.00031289755,0.9553344,0.0002343273,0.0008683738,0.00042855888,0.000005910287,0.00037204343,0.0014486696],"genre_scores_gemma":[0.99287385,0.000014643389,0.0033124336,0.00035277617,0.00007912885,0.000118945325,0.000010562917,0.000006512971,0.0032311366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891955,0.0000592372,0.00019159951,0.00041654852,0.00011913511,0.0002939229],"domain_scores_gemma":[0.9993321,0.0001194535,0.00005639802,0.00031087428,0.00012572863,0.000055467717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036377975,0.00013744798,0.00016659484,0.00010559766,0.00030855363,0.00019876595,0.00034769866,0.00006894803,0.0000014788734],"category_scores_gemma":[0.000027264963,0.00012638488,0.00010241191,0.0003252861,0.000018357165,0.0003958239,0.00016148886,0.00020350658,0.0000024319481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028698248,0.0008713176,0.048471067,0.00023519798,0.00081705605,0.000021844027,0.0029253857,0.36081526,0.008649651,0.071709394,0.068727836,0.43646902],"study_design_scores_gemma":[0.00037510679,0.00011388676,0.0018111783,0.00002642263,0.000019314135,0.000004179266,0.000042512736,0.9920771,0.00094323856,0.0030684858,0.0013725894,0.00014598643],"about_ca_topic_score_codex":0.00092118507,"about_ca_topic_score_gemma":0.00023897339,"teacher_disagreement_score":0.952022,"about_ca_system_score_codex":0.00010996814,"about_ca_system_score_gemma":0.000058326495,"threshold_uncertainty_score":0.5153826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46714565,0.00015597796,0.5315529,0.00008282377,0.00005665322,0.00004016279,1.3282707e-7,0.000020720958,0.00094500295],"genre_scores_gemma":[0.9972721,0.000035260153,0.0011950519,0.00016439187,0.000003274856,0.0000018003167,3.5029288e-7,0.0000031736995,0.0013245976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993272,0.00007105783,0.00011293899,0.0002547692,0.00007944812,0.00015458647],"domain_scores_gemma":[0.9997948,0.000050416755,0.000008752699,0.00011678669,0.0000031547634,0.000026110672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016381485,0.00008220289,0.00009857468,0.0001294347,0.000102315695,0.000061171886,0.00016061158,0.000033599914,0.0000024484339],"category_scores_gemma":[0.0000053151116,0.000079952944,0.000025375048,0.00012826725,0.000019654359,0.00025159254,0.000081433274,0.00019371424,0.0000028475927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010182159,0.0003598311,0.068727575,0.00007384145,0.00018363004,0.00018097415,0.010427738,0.22302286,0.22510228,0.061817653,0.00004144819,0.40996036],"study_design_scores_gemma":[0.00033611993,0.000021917074,0.006221361,0.0000622948,0.0000049097657,0.0000038181797,0.00018325145,0.9924365,0.00019986286,0.0002892642,0.00013652284,0.00010413726],"about_ca_topic_score_codex":0.00031896986,"about_ca_topic_score_gemma":0.000078537116,"teacher_disagreement_score":0.76941365,"about_ca_system_score_codex":0.00006926125,"about_ca_system_score_gemma":0.000017358889,"threshold_uncertainty_score":0.32603863},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2048018,0.0011709796,0.78856313,0.0028784692,0.000380156,0.00083024515,0.000034722765,0.0010988961,0.00024159194],"genre_scores_gemma":[0.9690855,0.000012916049,0.02725484,0.0022377195,0.00005007843,0.000320553,0.000011155271,0.000024957959,0.0010022703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800247,0.00005782059,0.00034798976,0.0007667459,0.00020107349,0.0006238711],"domain_scores_gemma":[0.9982516,0.00014018844,0.00012198714,0.0011237271,0.00029810937,0.00006436379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040703933,0.00031285678,0.0004296632,0.0005623461,0.00030756934,0.00008838466,0.0014112979,0.0005251973,0.000002511188],"category_scores_gemma":[0.00013770911,0.0002956277,0.00016965595,0.0011474765,0.000088646186,0.00024103042,0.00040227227,0.000728008,0.000064733824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028018642,0.0010774456,0.00050982804,0.00032228374,0.0006891631,0.00033442612,0.0024632674,0.036891308,0.21424298,0.6717695,0.0066438,0.06477579],"study_design_scores_gemma":[0.0014039673,0.00019920271,0.00002063892,0.0002059556,0.000053846812,0.000022088077,0.00031212522,0.9714113,0.0073261023,0.016905246,0.0017839537,0.00035558143],"about_ca_topic_score_codex":0.000018521161,"about_ca_topic_score_gemma":0.000069789356,"teacher_disagreement_score":0.93452,"about_ca_system_score_codex":0.0000991403,"about_ca_system_score_gemma":0.00017141037,"threshold_uncertainty_score":0.9999496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120759215,0.00031465813,0.9364867,0.0002207658,0.0016001218,0.0009245115,0.000026346781,0.0006919905,0.04765897],"genre_scores_gemma":[0.9895862,0.000029943825,0.008876872,0.00084297627,0.000042977994,0.000088137574,0.00002574199,0.000017238857,0.00048996415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955932,0.00015102192,0.0022470653,0.00032947888,0.0009354014,0.00074384216],"domain_scores_gemma":[0.9964344,0.00045538726,0.0010425159,0.0012932017,0.0005184245,0.00025610483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011811623,0.0005215226,0.0007937202,0.000793382,0.00046232247,0.00057932956,0.002367526,0.00024624218,0.0000029143612],"category_scores_gemma":[0.00015621283,0.00046680076,0.00040944666,0.0010194234,0.0001500237,0.0022926643,0.00047781173,0.00055736926,0.000060392296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004899777,0.00036446043,0.0021643296,0.005974954,0.0005161432,0.00013508539,0.0036313585,0.025122767,0.0011523756,0.6777939,0.006449489,0.27620512],"study_design_scores_gemma":[0.003365152,0.0006329216,0.0018435945,0.0024508543,0.00012647129,0.00024153304,0.00086764334,0.95393324,0.0037268787,0.00019343635,0.03163103,0.0009872586],"about_ca_topic_score_codex":0.000017210465,"about_ca_topic_score_gemma":0.0000037915802,"teacher_disagreement_score":0.9775102,"about_ca_system_score_codex":0.00036662113,"about_ca_system_score_gemma":0.0009876739,"threshold_uncertainty_score":0.9997784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36820272,0.0009064875,0.62643605,0.00016252643,0.0027174402,0.00085122243,0.0000769261,0.00044445312,0.00020219543],"genre_scores_gemma":[0.9955379,0.00012132671,0.0013793892,0.0002534516,0.00047152705,0.0005049928,0.00013509108,0.000024285311,0.0015720417],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973179,0.00018359785,0.00046088576,0.0012158988,0.00026396738,0.0005577547],"domain_scores_gemma":[0.99804866,0.0002022646,0.00031596742,0.0010038044,0.00029965068,0.00012964087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006737879,0.00043717405,0.0005212087,0.000197566,0.00043466466,0.00028374756,0.0010863034,0.00036446186,0.0000016223436],"category_scores_gemma":[0.00008038559,0.00045562687,0.0003460517,0.00029169995,0.0000436326,0.00035281872,0.0014344958,0.0012745636,0.00000700337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018565387,0.0005681465,0.47638494,0.0007654243,0.0011203774,0.00004446543,0.0036087534,0.45852822,0.0010962506,0.0010476419,0.008678955,0.047971174],"study_design_scores_gemma":[0.00065112265,0.00021216203,0.035041925,0.00041309744,0.00015811193,0.00001152485,0.000053220323,0.95765346,0.0007848597,0.0027465676,0.0015157043,0.00075821544],"about_ca_topic_score_codex":0.0019611653,"about_ca_topic_score_gemma":0.00025303662,"teacher_disagreement_score":0.6273352,"about_ca_system_score_codex":0.00032798748,"about_ca_system_score_gemma":0.0002412969,"threshold_uncertainty_score":0.99978954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21640849,0.004193468,0.7773837,0.00062176434,0.00049276644,0.00031083048,0.0000010490461,0.00005063681,0.00053729466],"genre_scores_gemma":[0.9950472,0.0003600115,0.003514273,0.000959151,0.000006386684,0.000048725648,5.477508e-7,0.0000023328264,0.00006134096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893963,0.00011210597,0.00033151763,0.00031690448,0.00016609108,0.00013373536],"domain_scores_gemma":[0.9990254,0.00038863657,0.00017272313,0.00019520432,0.00015461812,0.00006340806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000399554,0.000114828865,0.00022559766,0.000107263564,0.00018623601,0.0001431007,0.00022684938,0.000031908505,7.397173e-7],"category_scores_gemma":[0.00031771138,0.00010443453,0.000025875663,0.00031806788,0.000034261677,0.0010597431,0.00019861768,0.00009770491,0.0000027665421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084783,0.00023441501,0.00034394805,0.013976411,0.00013161413,0.000015714693,0.04011538,0.0008439653,0.016504532,0.6040257,0.0001222261,0.32360128],"study_design_scores_gemma":[0.0013583637,0.0008705233,0.0012036506,0.0108823925,0.00016566894,0.00014073125,0.011640049,0.9605255,0.0058361175,0.0059439153,0.0006401187,0.00079295516],"about_ca_topic_score_codex":0.000055585882,"about_ca_topic_score_gemma":9.3514166e-7,"teacher_disagreement_score":0.9596816,"about_ca_system_score_codex":0.000012927508,"about_ca_system_score_gemma":0.00005569168,"threshold_uncertainty_score":0.42587167},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022383314,0.001574622,0.97705305,0.017105158,0.0013004614,0.00040750485,0.00000934312,0.000069532834,0.00024199166],"genre_scores_gemma":[0.9698504,0.00077471643,0.027956255,0.00090203574,0.00006444541,0.00031040385,0.0000480405,0.000002792115,0.00009089042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999092,0.00002555468,0.0005158765,0.0000947836,0.00019594697,0.00007587372],"domain_scores_gemma":[0.997778,0.00021326673,0.00042157568,0.00012625268,0.0014368637,0.000024027951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003938866,0.00009086977,0.000108535416,0.00082422,0.00011654772,0.00046578966,0.00041843468,0.000053414286,0.0000015727511],"category_scores_gemma":[0.00019116983,0.000081581835,0.000036185513,0.00020173535,0.000048619248,0.0021465058,0.000051918014,0.00009115505,0.0000014868378],"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.000032068918,0.000077584074,0.00079134066,0.000038993014,0.000059054804,4.5117428e-8,0.00018368669,0.00017328057,0.00022128283,0.4855464,0.009276887,0.50359935],"study_design_scores_gemma":[0.0066237035,0.0012399361,0.015299951,0.0012091732,0.00018173695,0.0003135249,0.04991468,0.13410342,0.0139063,0.17768505,0.5984522,0.0010703326],"about_ca_topic_score_codex":0.000024518155,"about_ca_topic_score_gemma":0.0000016343828,"teacher_disagreement_score":0.9676121,"about_ca_system_score_codex":0.00011804906,"about_ca_system_score_gemma":0.00056410604,"threshold_uncertainty_score":0.44916204},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000057228,0.8725122,0.0038511688,0.00078007166,0.0008410584,0.005570113,0.00010831602,0.00036758045,0.11596378],"genre_scores_gemma":[0.000014588068,0.9964162,0.0008900472,0.0013568309,0.000039052855,0.00053894357,0.0004217786,0.000007246264,0.00031531905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99200755,0.00043694815,0.0024037356,0.0003440068,0.0039665643,0.0008411751],"domain_scores_gemma":[0.99484724,0.00074976357,0.0012688538,0.0016960049,0.0011346831,0.00030342775],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0054667974,0.00042876063,0.0011062104,0.0057704905,0.0007003067,0.002563884,0.0045989086,0.0002672017,0.00010972753],"category_scores_gemma":[0.0021414044,0.00035627422,0.0004093442,0.010116248,0.0004114341,0.08444922,0.0020139879,0.0011521743,0.002394662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004645922,0.00001951785,0.0000012973226,0.10654643,0.000007501901,8.8615184e-7,0.00028533873,0.0000041941257,1.4266945e-7,0.032822777,0.0042961463,0.8560111],"study_design_scores_gemma":[0.00015387233,0.00016144049,0.0000055265386,0.37448338,0.000030505858,0.000025561782,0.00007120164,0.0005550731,0.000022981663,0.0000820492,0.62406105,0.00034734275],"about_ca_topic_score_codex":0.000034197306,"about_ca_topic_score_gemma":2.1095674e-7,"teacher_disagreement_score":0.8556638,"about_ca_system_score_codex":0.00027639503,"about_ca_system_score_gemma":0.009630127,"threshold_uncertainty_score":0.9998889},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007864389,0.0023448083,0.97160363,0.0025609343,0.006329505,0.0004108946,0.000015294332,0.0003191305,0.00855141],"genre_scores_gemma":[0.98517764,0.00007117994,0.0043251757,0.00489859,0.00031606748,0.000009919542,0.00007673376,0.0000179632,0.0051067225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959042,0.0004187838,0.0007403723,0.0015815521,0.0006498953,0.00070521806],"domain_scores_gemma":[0.9943915,0.000768172,0.00025561528,0.004163672,0.00024709632,0.0001739436],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001741522,0.00042355416,0.00045305688,0.00035385432,0.0006482064,0.0013654015,0.003990298,0.00017907242,0.0001447194],"category_scores_gemma":[0.00024215851,0.0004244144,0.00016329349,0.001630298,0.00009038244,0.0014740991,0.002272367,0.00057648186,0.00012162019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017802391,0.0009245885,0.018672053,0.00045860859,0.0012663748,0.000107022395,0.00056795863,0.09859237,0.00073997624,0.03416488,0.085895546,0.7584326],"study_design_scores_gemma":[0.00091213523,0.00002998892,0.0022499987,0.00058515975,0.0001840463,0.0000018685988,0.000043815602,0.972526,0.000074523756,0.00032596724,0.022643538,0.00042296894],"about_ca_topic_score_codex":0.0015733214,"about_ca_topic_score_gemma":0.0003495232,"teacher_disagreement_score":0.9773133,"about_ca_system_score_codex":0.00018088963,"about_ca_system_score_gemma":0.0011911944,"threshold_uncertainty_score":0.99982077},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5849173,0.0628556,0.2769233,0.010222041,0.043104127,0.0059771514,0.0010906751,0.0014563779,0.013453435],"genre_scores_gemma":[0.9925169,0.0042537577,0.0010229988,0.00079519034,0.00039488362,0.00010037795,0.00015686006,0.000024424713,0.00073464983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98660654,0.009691316,0.001570552,0.0006916903,0.00065052445,0.0007893635],"domain_scores_gemma":[0.98697025,0.0050276923,0.00088322914,0.005384891,0.0014680711,0.00026589487],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013969026,0.00061468326,0.00092462794,0.0007462564,0.0018104935,0.002000887,0.004650697,0.00032932978,0.000011963665],"category_scores_gemma":[0.00032584206,0.00060651975,0.00014489793,0.0038269646,0.00054537266,0.0011092151,0.0017515828,0.00078174414,0.00007182636],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006613077,0.0020156906,0.43473378,0.0009312371,0.0029743996,0.00001704771,0.011087572,0.011486683,0.00018476379,0.036271773,0.009459341,0.4901764],"study_design_scores_gemma":[0.005838489,0.00043383182,0.2869763,0.0021582632,0.00054736173,0.00004245112,0.000573682,0.48475876,0.00006748736,0.00079225743,0.21544716,0.0023639693],"about_ca_topic_score_codex":0.011687203,"about_ca_topic_score_gemma":0.0075247437,"teacher_disagreement_score":0.48781243,"about_ca_system_score_codex":0.00020048015,"about_ca_system_score_gemma":0.00094946276,"threshold_uncertainty_score":0.9996386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25336403,0.002345334,0.73712575,0.0025642393,0.003671909,0.00021880583,4.707911e-7,0.00007158608,0.00063789316],"genre_scores_gemma":[0.97877854,0.00021558319,0.014310736,0.002552049,0.000187962,0.0000071775794,4.442899e-7,0.000029674662,0.003917842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954369,0.00051720074,0.0016177626,0.0006948234,0.0009816648,0.000751646],"domain_scores_gemma":[0.99665,0.0006929955,0.0013010922,0.00054315926,0.0004482776,0.00036447047],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025940451,0.0005558387,0.0008651473,0.00080206606,0.00049965305,0.0011617681,0.0016190859,0.00030579738,0.00008244941],"category_scores_gemma":[0.000598216,0.0005350468,0.0005522653,0.0004063595,0.00022091223,0.0002911086,0.0005667582,0.003091358,0.00000815343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011450092,0.0003568072,0.0019717396,0.0003144841,0.0011756525,0.00027870896,0.011568384,0.925628,0.0032974652,0.003816166,0.0018653432,0.04858222],"study_design_scores_gemma":[0.0025793607,0.0008535594,0.000051405383,0.0061315163,0.00022213417,0.00020199835,0.00026335876,0.9820439,0.005398712,0.0010973306,0.0007072687,0.00044940916],"about_ca_topic_score_codex":0.00057658984,"about_ca_topic_score_gemma":0.0000018303116,"teacher_disagreement_score":0.7254145,"about_ca_system_score_codex":0.00034790733,"about_ca_system_score_gemma":0.00047964847,"threshold_uncertainty_score":0.9998751},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021594238,0.0020100626,0.9674444,0.00045742534,0.00747362,0.000583007,0.000009926145,0.00020381674,0.00022350937],"genre_scores_gemma":[0.98995084,0.0012043829,0.0077323206,0.00045665284,0.00015219519,0.000100031415,4.8790054e-7,0.000018166062,0.0003849569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695444,0.000036644524,0.00054679875,0.0009653113,0.00047731024,0.0010194947],"domain_scores_gemma":[0.9982919,0.00042595298,0.000082602804,0.00054690975,0.00039189227,0.00026071383],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001511555,0.0004274506,0.0004347507,0.00058638764,0.0015451817,0.0014484341,0.00092740904,0.00013271811,0.0000042314036],"category_scores_gemma":[0.000025505353,0.00043983586,0.00022427436,0.001669191,0.0003002127,0.0013978875,0.000021696313,0.00054436567,0.000004250851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007198345,0.00006317287,0.0000015512455,0.00008161002,0.000073772564,0.000003887372,0.00035702388,0.904466,0.0039684894,0.0056529795,0.00014208896,0.08511747],"study_design_scores_gemma":[0.00066675426,0.0001954705,0.000025375033,0.00069584383,0.00009288253,0.000011271881,0.0004061435,0.99446154,0.0019747487,0.00012805106,0.00091402093,0.00042789208],"about_ca_topic_score_codex":0.00014763582,"about_ca_topic_score_gemma":0.000022161792,"teacher_disagreement_score":0.96835655,"about_ca_system_score_codex":0.0002881523,"about_ca_system_score_gemma":0.00096084335,"threshold_uncertainty_score":0.99980533},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002411256,0.015219562,0.97728366,0.00073784636,0.0011554103,0.0012701493,0.000017780298,0.00018450865,0.0017198304],"genre_scores_gemma":[0.9804153,0.015398962,0.000810088,0.0010160533,0.00009370858,0.00050370477,0.0000323413,0.000040465144,0.0016893788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664956,0.0008340352,0.00074213685,0.00083954964,0.00025868346,0.0006760184],"domain_scores_gemma":[0.9953389,0.002667406,0.00031822867,0.00079136644,0.0007003434,0.00018376243],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00071252853,0.0005316854,0.00055083487,0.0004368859,0.0063042515,0.00078827597,0.00081554335,0.0002283568,0.000017163957],"category_scores_gemma":[0.000023378112,0.0006147302,0.0003997464,0.00079675973,0.00041087146,0.00038280847,0.000070126705,0.001267745,0.0000093206645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007811961,0.00047218314,0.000027947037,0.00008792583,0.0011892434,0.000006311857,0.003792035,0.112096235,0.00033775883,0.0009455291,0.000031733714,0.8802319],"study_design_scores_gemma":[0.0025131106,0.00062008674,0.000007760428,0.0021325618,0.00054189924,0.00001946168,0.0017268561,0.988843,0.0005173183,0.00017372746,0.0023388937,0.00056531565],"about_ca_topic_score_codex":0.00017291239,"about_ca_topic_score_gemma":0.00036242534,"teacher_disagreement_score":0.97800404,"about_ca_system_score_codex":0.00023471871,"about_ca_system_score_gemma":0.00022802135,"threshold_uncertainty_score":0.9996304},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.416119,0.0010302305,0.5793249,0.0009029762,0.0013496119,0.00018400518,0.0000014133733,0.00003246747,0.0010553802],"genre_scores_gemma":[0.9915198,0.0003179577,0.0026486223,0.0018240573,0.00026045373,0.0000065639474,0.0000013228987,0.000027308317,0.0033939285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582386,0.000628493,0.0011711263,0.0007587213,0.00090056093,0.00071722583],"domain_scores_gemma":[0.99649245,0.0010900543,0.00092277565,0.00029116578,0.00084927096,0.00035426486],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016329163,0.0005607529,0.0008397428,0.0005990335,0.0006780245,0.001500481,0.0010489542,0.0001870596,0.000060378963],"category_scores_gemma":[0.00082701555,0.00047233907,0.00026544696,0.00036360644,0.0005309018,0.00096133497,0.00062698766,0.005023154,0.000009164879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013212301,0.0016549574,0.021651633,0.0012729832,0.012274308,0.005442016,0.22174008,0.1478505,0.009390388,0.051545106,0.0040039397,0.5099618],"study_design_scores_gemma":[0.0034681677,0.004258427,0.00039682936,0.024783064,0.0004573424,0.0029064931,0.0018942682,0.94773895,0.0098505635,0.0029037264,0.00042292837,0.0009192497],"about_ca_topic_score_codex":0.00040104106,"about_ca_topic_score_gemma":0.0000055044266,"teacher_disagreement_score":0.79988843,"about_ca_system_score_codex":0.00020959043,"about_ca_system_score_gemma":0.00054799207,"threshold_uncertainty_score":0.99977285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9519815,0.000081933176,0.042017117,0.00061095355,0.00010971364,0.00010215703,6.8896077e-7,0.00021513815,0.0048808292],"genre_scores_gemma":[0.99421775,0.000048497564,0.0032512147,0.00070331054,0.000036698264,0.0000054595475,6.865927e-7,0.0000048291495,0.0017315417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933034,0.000024850417,0.000084389736,0.0002465737,0.00015780452,0.00015602061],"domain_scores_gemma":[0.9994655,0.00009450129,0.000031788877,0.00030118623,0.00003230235,0.00007472572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008037484,0.00008842938,0.00009529891,0.000045401724,0.00017419085,0.000087952976,0.00027448076,0.000021859303,0.00001023409],"category_scores_gemma":[0.000015978614,0.000062840525,0.000018138217,0.00009993712,0.00003706053,0.0005213653,0.0001334931,0.0001019178,0.000024764626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032307298,0.00092994195,0.060036562,0.00018936506,0.00037624344,0.002434175,0.012331521,0.0033397994,0.047870655,0.09854913,0.044486325,0.7291332],"study_design_scores_gemma":[0.011111676,0.0011682706,0.121721685,0.00046715705,0.00006017279,0.004827747,0.0006194935,0.82814556,0.01592818,0.0017003819,0.011269894,0.0029798027],"about_ca_topic_score_codex":0.00024913388,"about_ca_topic_score_gemma":0.000037202237,"teacher_disagreement_score":0.82480574,"about_ca_system_score_codex":0.000012315126,"about_ca_system_score_gemma":0.00005492647,"threshold_uncertainty_score":0.25625622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085442705,0.00013866657,0.98877674,0.0013673672,0.0006017884,0.00022701421,0.0000125506185,0.00031857507,0.008471877],"genre_scores_gemma":[0.988465,0.000042049844,0.0018369695,0.007056347,0.00034692427,0.000028431945,0.0015638067,0.00005106737,0.000609385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815214,0.000024156026,0.0007278003,0.00033768392,0.00047557594,0.00028265658],"domain_scores_gemma":[0.9979444,0.00006612092,0.00075339084,0.0005095651,0.00067208323,0.000054437744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028566268,0.00042557513,0.00038446605,0.0006757982,0.00018530285,0.00085964886,0.0006576607,0.00044971553,0.000026859236],"category_scores_gemma":[0.00013951774,0.0004028815,0.00007247709,0.00027521583,0.000049691465,0.002193447,0.00011639556,0.000499295,0.00009143144],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010190161,0.0000075011967,0.00008033157,0.0005829249,0.0000069550947,0.000004995798,0.00046064754,0.0047246427,0.000075900345,0.0033609234,0.000010593613,0.9906744],"study_design_scores_gemma":[0.0012618926,0.000058699847,0.0013500843,0.00391498,0.00006214482,0.000041866297,0.00000304942,0.9283195,0.00052288454,0.008510176,0.05400477,0.0019499284],"about_ca_topic_score_codex":0.00004258766,"about_ca_topic_score_gemma":0.000023832643,"teacher_disagreement_score":0.98872447,"about_ca_system_score_codex":0.00016843984,"about_ca_system_score_gemma":0.0003188579,"threshold_uncertainty_score":0.9998423},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056708526,0.000035091907,0.40954137,0.00062224764,0.00055829796,0.000067723675,2.08108e-7,0.00012150596,0.532345],"genre_scores_gemma":[0.9863692,0.0000015998721,0.012326154,0.00014551409,0.0000095730165,0.0000011279185,8.0620005e-8,0.0000028143222,0.0011439484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939424,0.000063113905,0.00014107263,0.00015839239,0.000121124205,0.00012207581],"domain_scores_gemma":[0.99934363,0.00027447118,0.000061133396,0.00023239054,0.00004469442,0.000043655094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002295625,0.000055839962,0.00009250124,0.000054664146,0.000041023424,0.000052886553,0.00015706354,0.000020775766,0.00007181902],"category_scores_gemma":[0.000523189,0.00004750116,0.000047374568,0.00019631285,0.000012659665,0.00026690148,0.000050714818,0.00009769971,0.000036640522],"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.0000024476115,0.00007012938,0.00045127267,0.0000041971784,0.000013998557,0.000025886307,0.00015891659,0.000006960407,0.0063040056,0.9894922,0.0031117047,0.0003582905],"study_design_scores_gemma":[0.0039671552,0.0014909361,0.0033274824,0.0003501995,0.00006986847,0.0016458757,0.0023635589,0.2736139,0.58143145,0.06876994,0.060835045,0.0021345902],"about_ca_topic_score_codex":0.00005716071,"about_ca_topic_score_gemma":0.000007676774,"teacher_disagreement_score":0.9296607,"about_ca_system_score_codex":0.000019925557,"about_ca_system_score_gemma":0.00006529339,"threshold_uncertainty_score":0.1937041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44718364,0.000040779254,0.505201,0.0011685697,0.0010723533,0.000117270574,0.0000039161946,0.0005933868,0.044619117],"genre_scores_gemma":[0.9900804,0.000025013052,0.0064037703,0.0004719337,0.00018943724,0.0000035105127,0.00001499713,0.000017847195,0.002793051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806,0.00010196555,0.00032148705,0.00058669026,0.00061651913,0.0003133573],"domain_scores_gemma":[0.99898463,0.0001366166,0.00020391593,0.00028788322,0.00028294203,0.00010398775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024143702,0.00025063704,0.0002138496,0.00024069808,0.00019940578,0.00030985367,0.0013913093,0.000054107328,0.00008520677],"category_scores_gemma":[0.00005903219,0.00021564373,0.000089861845,0.00015569091,0.00006530714,0.0003957161,0.00043510497,0.000615495,0.00014233509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004476383,0.000779785,0.07519512,0.000040656225,0.0008787649,0.002042529,0.010797298,0.023680685,0.0062862374,0.6064372,0.00248548,0.27092862],"study_design_scores_gemma":[0.0006296098,0.00025921012,0.0009550687,0.00020844607,0.0000035030403,0.00040704646,0.000044269374,0.994622,0.00047075696,0.00020943402,0.0019064598,0.00028422367],"about_ca_topic_score_codex":0.000291663,"about_ca_topic_score_gemma":0.000025477513,"teacher_disagreement_score":0.9709413,"about_ca_system_score_codex":0.000101740625,"about_ca_system_score_gemma":0.00010300618,"threshold_uncertainty_score":0.87936956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4192863,0.0000035095843,0.57949007,0.0001414426,0.00022270263,0.0005648979,0.00007005982,0.00009576129,0.00012524471],"genre_scores_gemma":[0.9986406,3.8100584e-8,0.00074613595,0.00036027146,0.000009825148,0.0002092317,0.000013872248,0.0000036903377,0.000016350197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828124,0.00020505539,0.00068227056,0.00015763144,0.00053701794,0.00013681165],"domain_scores_gemma":[0.9984229,0.000028800701,0.00053189206,0.0005871814,0.0003731955,0.000056011388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013143801,0.000115492505,0.00024000832,0.00022761984,0.00010803752,0.000049554026,0.00045224858,0.00004792775,0.0000022640306],"category_scores_gemma":[0.000026745387,0.00010579349,0.00009406094,0.00044438214,0.0000074650657,0.00032436894,0.00020374419,0.00012282214,0.0000062676872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037342391,0.00032397386,0.10582697,0.009122124,0.00038649506,0.0000203657,0.3367455,0.44803363,0.014597409,0.020767208,0.00048969703,0.059952397],"study_design_scores_gemma":[0.0011618318,0.00059131,0.04578049,0.00037738404,0.000020147021,0.000008300182,0.006811945,0.9372376,0.007539873,0.0000019619215,0.00011488442,0.0003542509],"about_ca_topic_score_codex":0.000045915334,"about_ca_topic_score_gemma":5.3351033e-7,"teacher_disagreement_score":0.5793543,"about_ca_system_score_codex":0.00015878606,"about_ca_system_score_gemma":0.00005009259,"threshold_uncertainty_score":0.43141335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4192863,0.0000035095843,0.57949007,0.0001414426,0.00022270263,0.0005648979,0.00007005982,0.00009576129,0.00012524471],"genre_scores_gemma":[0.9986406,3.8100584e-8,0.00074613595,0.00036027146,0.000009825148,0.0002092317,0.000013872248,0.0000036903377,0.000016350197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828124,0.00020505539,0.00068227056,0.00015763144,0.00053701794,0.00013681165],"domain_scores_gemma":[0.9984229,0.000028800701,0.00053189206,0.0005871814,0.0003731955,0.000056011388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013143801,0.000115492505,0.00024000832,0.00022761984,0.00010803752,0.000049554026,0.00045224858,0.00004792775,0.0000022640306],"category_scores_gemma":[0.000026745387,0.00010579349,0.00009406094,0.00044438214,0.0000074650657,0.00032436894,0.00020374419,0.00012282214,0.0000062676872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037342391,0.00032397386,0.10582697,0.009122124,0.00038649506,0.0000203657,0.3367455,0.44803363,0.014597409,0.020767208,0.00048969703,0.059952397],"study_design_scores_gemma":[0.0011618318,0.00059131,0.04578049,0.00037738404,0.000020147021,0.000008300182,0.006811945,0.9372376,0.007539873,0.0000019619215,0.00011488442,0.0003542509],"about_ca_topic_score_codex":0.000045915334,"about_ca_topic_score_gemma":5.3351033e-7,"teacher_disagreement_score":0.5793543,"about_ca_system_score_codex":0.00015878606,"about_ca_system_score_gemma":0.00005009259,"threshold_uncertainty_score":0.43141335},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8872463,0.000015318094,0.00046548762,0.00002267114,0.00006292768,0.0002489395,0.111615755,0.000003588254,0.0003190147],"genre_scores_gemma":[0.91177833,0.000026146487,0.062244434,0.0000393303,0.000043659566,0.00009293291,0.024476515,0.000013231608,0.0012854399],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99918216,0.00006133544,0.00022408576,0.00029467128,0.00013709549,0.000100617646],"domain_scores_gemma":[0.9980432,0.0011843335,0.00019012338,0.00024974343,0.00029040553,0.000042233012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007175476,0.000084313106,0.0001819748,0.000044198525,0.000065338565,0.00009132957,0.0001376567,0.000035917223,0.01316159],"category_scores_gemma":[0.00037332176,0.000081184226,0.000060534458,0.00020828283,0.000028438126,0.00034542306,0.00019895066,0.000041197804,0.0000055043433],"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.00010856458,0.0034593365,0.13386062,0.00005230886,0.000346811,0.00007477132,0.0004733855,0.00002325927,0.00048451548,0.00006920738,0.6625977,0.1984495],"study_design_scores_gemma":[0.0017223787,0.00032121994,0.83588064,0.00016756344,0.000090889276,0.000025981117,0.00008416111,0.010978687,0.0027779795,0.000073518786,0.14749226,0.00038475334],"about_ca_topic_score_codex":0.00017861467,"about_ca_topic_score_gemma":0.00029812925,"teacher_disagreement_score":0.70202,"about_ca_system_score_codex":0.000009743848,"about_ca_system_score_gemma":0.000087813074,"threshold_uncertainty_score":0.9877405},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9364179,0.0005314472,0.00018581907,0.00074590195,0.0034445387,0.0002836249,0.00006381829,0.000037404337,0.05828957],"genre_scores_gemma":[0.9722629,0.00044144626,0.00023092693,0.0012249348,0.00018376537,0.000010413957,0.00005413659,0.000022301707,0.025569132],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9970477,0.00005326937,0.0003463066,0.00041456555,0.0017679239,0.0003702267],"domain_scores_gemma":[0.99895424,0.00016418794,0.00031345527,0.0003462924,0.0000014914538,0.00022032278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000008954313,0.00032439036,0.00035298095,0.000050162333,0.00023190497,0.00009503155,0.0006734392,0.00006712521,0.000015772106],"category_scores_gemma":[0.0000019422612,0.00029645575,0.000043562854,0.000108987726,0.000023381803,0.0004702869,0.0001371886,0.00037717982,1.10663505e-8],"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.0011720068,0.00008116332,0.011618095,0.0006508599,0.0004339277,0.00021687284,0.0004876222,0.0042614415,0.012418693,0.3679799,0.011649313,0.5890301],"study_design_scores_gemma":[0.0027421287,0.0013637639,0.6333577,0.0036303743,0.00015619266,0.00004188976,0.0066621783,0.19956176,0.10603292,0.0021044118,0.04086602,0.0034806472],"about_ca_topic_score_codex":0.0031760738,"about_ca_topic_score_gemma":0.004483359,"teacher_disagreement_score":0.6217396,"about_ca_system_score_codex":0.000015778292,"about_ca_system_score_gemma":0.0012311651,"threshold_uncertainty_score":0.99994874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8035189,0.00048230283,0.12222853,0.013231124,0.0024333172,0.0005407352,0.00006590993,0.00030473925,0.057194453],"genre_scores_gemma":[0.9900626,0.000039701506,0.0023716963,0.00009003914,0.00005096094,3.8813747e-7,0.000026081632,0.000005565134,0.0073529747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825245,0.00018567182,0.00026659507,0.00048771102,0.0005578052,0.0002497543],"domain_scores_gemma":[0.99903345,0.00031465187,0.000088083725,0.0002557566,0.00018751649,0.00012056045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040027275,0.0002030038,0.0002269537,0.0009328238,0.0005445187,0.00010675058,0.0009756296,0.00011134875,0.0000130569615],"category_scores_gemma":[0.000025431626,0.00020030788,0.00016345523,0.0006678176,0.00063326966,0.0007737611,0.000499646,0.0003350392,0.000004530289],"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.00017321848,0.00009586335,0.0010802826,0.00003858458,0.00014664001,0.0011903371,0.00090765173,0.00067270914,0.00017179201,0.9938042,0.00007329319,0.0016453956],"study_design_scores_gemma":[0.009663534,0.00030435072,0.030181712,0.0007330275,0.00025838712,0.0010630344,0.005026286,0.1328524,0.0013813573,0.0065629114,0.81028825,0.0016847223],"about_ca_topic_score_codex":0.00047959582,"about_ca_topic_score_gemma":0.00008053384,"teacher_disagreement_score":0.9872413,"about_ca_system_score_codex":0.0016632169,"about_ca_system_score_gemma":0.0009230044,"threshold_uncertainty_score":0.8168319},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876042,0.0004103475,0.00029664754,0.0074605467,0.0015655272,0.00037745663,0.000013404387,0.00059057534,0.0016812905],"genre_scores_gemma":[0.026174078,0.00020578313,0.0006428819,0.000021601594,0.00003515358,6.683125e-7,0.00007791838,0.000017851955,0.97282404],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99885285,0.000078489444,0.00010172857,0.0003566119,0.000336854,0.00027344457],"domain_scores_gemma":[0.9989123,0.00009965904,0.000188537,0.0005839809,0.00015000967,0.00006551951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002786484,0.00017082658,0.0002148039,0.0001406111,0.0005171726,0.00009050352,0.0014817823,0.00016266995,0.000008493279],"category_scores_gemma":[0.000011496297,0.00015135668,0.00020404253,0.0002910588,0.000051614745,0.00027528257,0.0001906214,0.00028301653,0.0002060348],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031532554,0.00020133483,0.0006767093,0.0007708081,0.00091331435,0.0004926295,0.53593534,0.00031353996,0.0075646713,0.030591642,0.21766925,0.2045554],"study_design_scores_gemma":[0.0031831467,0.00091386255,0.024174064,0.0018060097,0.00060612033,0.000028337618,0.8475063,0.033006135,0.0021170098,0.014419052,0.06899983,0.0032401457],"about_ca_topic_score_codex":0.041776188,"about_ca_topic_score_gemma":0.07378041,"teacher_disagreement_score":0.97114277,"about_ca_system_score_codex":0.00004987525,"about_ca_system_score_gemma":0.00010398946,"threshold_uncertainty_score":0.96460474},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42190847,0.000039597846,0.008317418,0.10684242,0.013528942,0.00026066662,0.00000834188,0.00082989206,0.44826424],"genre_scores_gemma":[0.71605635,0.000008669903,0.00086829776,0.007908048,0.0003030685,0.000004031949,2.9507487e-7,0.00000511875,0.27484614],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990566,0.000022811846,0.000095801195,0.00015792939,0.0004363354,0.00023055857],"domain_scores_gemma":[0.9991685,0.00009098123,0.000025596999,0.00020968457,0.00010378447,0.00040144965],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004673321,0.000054474578,0.00006216676,0.00006854156,0.0000947417,0.00011153308,0.00051117246,0.00017021384,0.015989177],"category_scores_gemma":[0.00055158645,0.000040973326,0.000030377425,0.00013339639,0.00000578726,0.00019747858,0.000050289433,0.00035946557,0.00534875],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003983661,0.000046593002,0.0025081597,0.0000035181642,0.00003153542,0.0001536289,0.0003557659,0.0000029073626,0.0022645167,0.0509544,0.8829571,0.06071786],"study_design_scores_gemma":[0.0005255603,0.000057081666,0.027367532,0.000011984904,0.000006686075,0.00009147415,0.000038264312,0.15976381,0.00077009376,0.000029334253,0.81095177,0.00038640815],"about_ca_topic_score_codex":0.031967517,"about_ca_topic_score_gemma":0.47831106,"teacher_disagreement_score":0.44634357,"about_ca_system_score_codex":0.0000498141,"about_ca_system_score_gemma":0.0005666583,"threshold_uncertainty_score":0.9954257},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005803679,0.000022220134,0.7896754,0.005830109,0.0011320129,0.19243449,0.0000036308095,0.00014931537,0.010694744],"genre_scores_gemma":[0.12841068,0.0000044603908,0.0060625286,0.007761959,0.0004050123,0.75435865,0.0000015921989,0.000024307175,0.10297081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997938,0.00016438695,0.00040572468,0.0007174893,0.00029343477,0.00048101012],"domain_scores_gemma":[0.9974727,0.00047246375,0.000107244035,0.001513885,0.0003232418,0.00011046192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010276723,0.00027154805,0.00026248762,0.00012035621,0.00079193094,0.0009430982,0.0019268169,0.000097882905,0.00017141558],"category_scores_gemma":[0.00012359768,0.00017224405,0.00028600622,0.00062746374,0.00008888132,0.0006159409,0.0005050636,0.00023742567,0.00008608781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040928822,0.00073904113,0.0002119136,0.00025737888,0.00046659922,0.000009596867,0.000735396,0.0012155246,0.00056985795,0.5201803,0.06785814,0.40734696],"study_design_scores_gemma":[0.0014151419,0.00029296463,0.00020616563,0.000090667985,0.00008797434,0.0000040039936,0.00022695473,0.7730775,0.0006957812,0.002123375,0.22154404,0.00023541329],"about_ca_topic_score_codex":0.00047783653,"about_ca_topic_score_gemma":0.00018828466,"teacher_disagreement_score":0.7836129,"about_ca_system_score_codex":0.000056739154,"about_ca_system_score_gemma":0.00044424486,"threshold_uncertainty_score":0.90943176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84077734,0.013423799,0.13849616,0.0001972205,0.003906985,0.0007008451,0.0000075627936,0.0003371335,0.0021529775],"genre_scores_gemma":[0.99012285,0.0012572363,0.00055510836,0.00005533377,0.0004972494,0.00009303641,0.00026512516,0.00007759952,0.007076442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959328,0.00031620025,0.0006866307,0.0017528193,0.0005737566,0.000737767],"domain_scores_gemma":[0.9986428,0.00014461446,0.00026206285,0.0006378351,0.000089526664,0.00022314934],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009285594,0.00070801674,0.0007428132,0.00061221607,0.00033563288,0.001099341,0.0006775235,0.0006470416,0.00000819465],"category_scores_gemma":[0.000030352116,0.0007591232,0.00021763169,0.0009073727,0.00007394544,0.00054654485,0.00021302067,0.0019746132,0.000019006475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001733224,0.00029128586,0.00039105606,0.00096114544,0.00016947104,0.00015238831,0.06511732,0.8553155,0.00019061881,0.0012187498,0.000898331,0.07512079],"study_design_scores_gemma":[0.00056894077,0.00012429123,0.0015036395,0.0016284413,0.000146912,0.00006748781,0.011821606,0.9834019,0.0000043199298,0.00002144742,0.000092421345,0.0006185802],"about_ca_topic_score_codex":0.0019068589,"about_ca_topic_score_gemma":0.0010885838,"teacher_disagreement_score":0.14934555,"about_ca_system_score_codex":0.00025986234,"about_ca_system_score_gemma":0.00023947889,"threshold_uncertainty_score":0.9999376},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027065627,0.001152864,0.95279014,0.0019460989,0.0006158309,0.0006374782,0.0000031978173,0.00008385754,0.015704902],"genre_scores_gemma":[0.90607494,0.00010975511,0.08923243,0.0024740899,0.000046225075,0.00008581743,0.000004952694,0.000012807645,0.0019589807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976536,0.0001427165,0.000516624,0.0009091758,0.00016643938,0.0006114292],"domain_scores_gemma":[0.998831,0.00034361568,0.00009466552,0.0005448106,0.000082605155,0.00010330523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013533811,0.00031755026,0.00040670054,0.00048161752,0.00045586145,0.0005202386,0.00062330835,0.00014784728,0.0000068417844],"category_scores_gemma":[0.00006163052,0.0003162953,0.0001325403,0.000582336,0.000058926096,0.00064665027,0.00040748704,0.00044548762,0.0000014779511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004517387,0.0010037856,0.021616403,0.002044113,0.00016843523,0.000010060706,0.0026859066,0.16448767,0.00062463316,0.018251406,0.0028497828,0.78580606],"study_design_scores_gemma":[0.002011544,0.00011468655,0.00077244436,0.00032563432,0.000025733401,0.0000048089164,0.00028928719,0.9950171,0.00017662575,0.000065329754,0.0008456405,0.00035114816],"about_ca_topic_score_codex":0.00020907805,"about_ca_topic_score_gemma":0.000024907438,"teacher_disagreement_score":0.8790093,"about_ca_system_score_codex":0.00013864531,"about_ca_system_score_gemma":0.00024232769,"threshold_uncertainty_score":0.9999289},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005156046,0.00021296945,0.9812538,0.0002614186,0.0031394034,0.00026217065,0.000011759326,0.0002683983,0.014074461],"genre_scores_gemma":[0.79076666,0.000080515936,0.040690187,0.0021825614,0.0011138731,0.000027164924,0.00007544544,0.00006383283,0.16499974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965827,0.000036347767,0.0005511643,0.0013224401,0.000936896,0.000570482],"domain_scores_gemma":[0.9977927,0.00016855715,0.00027345063,0.0012932152,0.0002468648,0.00022519415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011464694,0.00041518747,0.00046197267,0.00040256884,0.00012955464,0.00052935135,0.0036640293,0.00018853019,0.000026400941],"category_scores_gemma":[0.00004513278,0.0003902437,0.00015816254,0.00021179664,0.0005614415,0.00048276898,0.0017766439,0.00059302885,0.00043606135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006120085,0.00003452356,0.00007428993,0.000019585012,0.000011578498,0.0000838437,0.00029855984,0.00018575044,0.000070739865,0.3318146,0.0043719765,0.6630284],"study_design_scores_gemma":[0.0005238011,0.00020352234,0.0008974175,0.0005867215,0.000008311318,0.00007575698,7.833892e-7,0.96073186,0.00011187522,0.00790848,0.028156433,0.00079503097],"about_ca_topic_score_codex":0.00008524871,"about_ca_topic_score_gemma":0.000038127557,"teacher_disagreement_score":0.96054614,"about_ca_system_score_codex":0.0003808618,"about_ca_system_score_gemma":0.0002228944,"threshold_uncertainty_score":0.9998549},"labels":[],"label_agreement":null}]}