{"meta":{"query_hash":"e0fdac2723aa","filters":{"topic":"Data Management and Algorithms"},"cohort_total":1256,"direct_labels_cover":2,"predictions_cover":1256,"exported":1256,"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/e0fdac2723aa","api":"https://metacan.xera.ac/api/v1/cohort?topic=Data+Management+and+Algorithms"},"results":[{"id":"W100764105","doi":"10.46298/dmtcs.3484","title":"Around the root of random multidimensional quadtrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Data Management and Algorithms","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","keywords":"Arity; Root (linguistics); Mathematics; Point (geometry); Computer science; Statistics; Algorithm; Combinatorics; Geometry","score_opus":0.010048296120503342,"score_gpt":0.2434762852402676,"score_spread":0.23342798911976426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100764105","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.016837165,0.00003663074,0.97606474,0.0010433941,0.0003249905,0.0002756991,0.000005854106,0.00009603095,0.005315492],"genre_scores_gemma":[0.6440509,0.0000013006313,0.3557251,0.00007604763,0.000095594754,0.0000071463933,0.00000294763,0.0000068237937,0.000034137847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972073,0.000082469254,0.00051655044,0.00053575885,0.0011729422,0.0004850131],"domain_scores_gemma":[0.99753755,0.00075055927,0.00019337147,0.0012568376,0.00016513141,0.00009652161],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020704125,0.00022258874,0.00029671268,0.00014257198,0.00041660407,0.0004960223,0.0033037572,0.00003364416,0.000025395306],"category_scores_gemma":[0.00009479919,0.00013050299,0.00013013562,0.00092835363,0.0027592075,0.000726109,0.0017586119,0.00014165213,0.000044409866],"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.0000035572998,0.00010332471,0.000029341903,0.000017198008,0.0000075631183,0.0000047846993,0.00024993467,0.00026719572,0.00038719384,0.9965455,0.00018405724,0.0022003783],"study_design_scores_gemma":[0.00032504485,0.00004943354,0.0002488884,0.000034658227,0.000010874289,0.000010300572,0.000030926858,0.6744703,0.001594629,0.3229311,0.00014335781,0.00015050342],"about_ca_topic_score_codex":0.0000113971155,"about_ca_topic_score_gemma":0.0000027641763,"teacher_disagreement_score":0.6742031,"about_ca_system_score_codex":0.000018496476,"about_ca_system_score_gemma":0.000054430533,"threshold_uncertainty_score":0.9999547},"labels":[],"label_agreement":null},{"id":"W101537656","doi":"","title":"Distance Between Graphs Using Graph Labelings.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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; Combinatorics; Edge-graceful labeling; Graph; Line graph; Discrete mathematics; Graph power","score_opus":0.020169486850561948,"score_gpt":0.2535486037510895,"score_spread":0.23337911690052757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101537656","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.70217884,0.0010517305,0.27670416,0.0022988182,0.0053296755,0.00058463827,0.00002680371,0.0012273866,0.010597944],"genre_scores_gemma":[0.96033347,0.000026974914,0.039163966,0.00020648382,0.000029915322,0.000004602621,0.000011936361,0.000013258058,0.0002094255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986447,0.0000355231,0.00023042603,0.0004079823,0.00032054217,0.0003608101],"domain_scores_gemma":[0.99902374,0.000038553437,0.000096474265,0.00068527437,0.000052846302,0.000103123806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028863893,0.00016131753,0.00017498079,0.00013570918,0.00019294703,0.00026813088,0.0012640705,0.000044946093,0.0000083263585],"category_scores_gemma":[0.0000154956,0.00016269667,0.000069947055,0.00077288056,0.000047985093,0.0013200877,0.0004006232,0.00013329776,0.0000817145],"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":[7.352785e-7,0.000044157212,0.0066974587,0.0000066211383,0.000024454508,0.000006467558,0.000077012686,0.000011799758,0.000022322887,0.9617941,0.0019120439,0.02940286],"study_design_scores_gemma":[0.000993599,0.000059245234,0.0047776997,0.000042482414,0.000032606284,0.0000018625145,0.000015371448,0.020350305,0.00059482985,0.9095722,0.063008115,0.0005517123],"about_ca_topic_score_codex":0.000029441084,"about_ca_topic_score_gemma":0.0000028792476,"teacher_disagreement_score":0.25815457,"about_ca_system_score_codex":0.000039464638,"about_ca_system_score_gemma":0.000018156543,"threshold_uncertainty_score":0.66345775},"labels":[],"label_agreement":null},{"id":"W102758216","doi":"","title":"Query Algebra and Query Optimization for Concept Assertion Retrieval.","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Query expansion; Query optimization; Sargable; Query language; Information retrieval; Query by Example; Assertion; Web search query; Search engine indexing; Relational algebra; Boolean conjunctive query; Web query classification; Extension (predicate logic); RDF query language; Relational database; Search engine; Programming language","score_opus":0.008842400117279256,"score_gpt":0.23565499863371173,"score_spread":0.22681259851643248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102758216","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.0048186807,0.00001347144,0.9914838,0.0011697944,0.0005972678,0.00021604134,0.0000027186866,0.00015510985,0.0015431014],"genre_scores_gemma":[0.13326687,0.00002229943,0.86166143,0.0009078248,0.00021734514,0.000015694528,0.00008571505,0.000011195455,0.003811641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993838,0.00001099507,0.000114291,0.00025282404,0.00010662852,0.00013146392],"domain_scores_gemma":[0.9995281,0.000051522136,0.00004396561,0.00027322257,0.00005713913,0.000046049117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024232134,0.0000714077,0.00006940533,0.000056856097,0.0000868513,0.00029296183,0.00027948312,0.000045049816,0.000046958638],"category_scores_gemma":[0.00005771873,0.00006273931,0.000020915266,0.00014337932,0.000026774636,0.0013007652,0.0001409618,0.000060021663,0.0000069062603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014587585,0.00007118266,0.00027193158,0.00002907791,0.000024319668,0.0000023727673,0.00014631987,0.00039487114,0.0022962936,0.8391219,0.021571921,0.13605525],"study_design_scores_gemma":[0.0004072122,0.000060827068,0.0005893788,0.0000043333284,0.0000069448074,0.0000018638069,0.000017167566,0.97812986,0.0038563954,0.0033152888,0.013451465,0.00015925756],"about_ca_topic_score_codex":0.000012660732,"about_ca_topic_score_gemma":0.0000065531426,"teacher_disagreement_score":0.977735,"about_ca_system_score_codex":0.000004877141,"about_ca_system_score_gemma":0.00001389799,"threshold_uncertainty_score":0.28250375},"labels":[],"label_agreement":null},{"id":"W103048715","doi":"10.1007/978-3-540-72029-4_13","title":"UMapIT© (Unrestricted Mapping Interactive Tool): Merging the datacube paradigm with an occurrence-based approach to support on-demand web mapping","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in geoinformation and cartography","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Data cube; Object (grammar); Flexibility (engineering); Online analytical processing; Representation (politics); Field (mathematics); The Internet; Data mining; Data science; Information retrieval; World Wide Web; Artificial intelligence; Data warehouse; Mathematics","score_opus":0.021537560409844777,"score_gpt":0.22339032754616805,"score_spread":0.20185276713632327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103048715","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.0004437663,0.00011421338,0.9563603,0.00054515497,0.00024936558,0.0010881705,0.0001809279,0.00018837731,0.040829718],"genre_scores_gemma":[0.7143986,0.0023198877,0.22302559,0.03446668,0.0011269677,0.0008776617,0.021963004,0.00024453958,0.0015770305],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788684,0.000044965007,0.0004970374,0.0005995378,0.0005716072,0.00040004554],"domain_scores_gemma":[0.99840707,0.00016575762,0.0003357176,0.00089773216,0.000073910174,0.000119792785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032695336,0.0004990226,0.00038390225,0.0014538562,0.00033372417,0.0006528881,0.0008893045,0.00015618936,0.000012693907],"category_scores_gemma":[0.000022038077,0.00035534744,0.00010644515,0.0007558139,0.000117050724,0.0016677642,0.00023436779,0.0006258613,0.000014560189],"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.00025717894,0.0002203711,0.000718646,0.00054016174,0.0005114273,0.000090696645,0.027702974,0.030069126,0.00000592176,0.048517916,0.008561401,0.88280416],"study_design_scores_gemma":[0.0023424376,0.0010683805,0.0014734706,0.0009276056,0.0000789746,0.00009736011,0.00027234442,0.44255537,0.000033611253,0.002691929,0.54625577,0.0022027257],"about_ca_topic_score_codex":0.000018575009,"about_ca_topic_score_gemma":0.000023062588,"teacher_disagreement_score":0.88060147,"about_ca_system_score_codex":0.000038818147,"about_ca_system_score_gemma":0.00009774053,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W10346826","doi":"10.1007/3-540-26886-3_7","title":"Multi-Dimensional Interpolations with Fuzzy Sets","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Interpolation (computer graphics); Fuzzy set; Fuzzy logic; Fuzzy set operations; Multivariate interpolation; Geographic information system; Data mining; Representation (politics); Fuzzy number; Computer science; Defuzzification; Fuzzy classification; Mathematics; Artificial intelligence; Geography; Cartography; Computer vision; Bilinear interpolation","score_opus":0.02525651062524525,"score_gpt":0.24263581385269528,"score_spread":0.21737930322745003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10346826","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":[7.5261266e-7,0.000060179274,0.2669024,0.00074915163,0.00020661927,0.00017003901,0.00002594828,0.00022977311,0.7316551],"genre_scores_gemma":[0.000073903386,0.000008700367,0.35778657,0.00055290695,0.00007900294,0.0000033367912,0.00009379939,0.00001564835,0.64138615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988002,0.000004813649,0.00019040829,0.00049564126,0.000325815,0.00018308677],"domain_scores_gemma":[0.9990304,0.000026498712,0.00009983708,0.00069860363,0.00006348114,0.00008114107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000763473,0.00025237657,0.0001772619,0.00019204142,0.00008515548,0.00019473716,0.0008310638,0.00008491926,0.0005162449],"category_scores_gemma":[0.0000018076989,0.0001908674,0.0000634679,0.00003931864,0.000047138743,0.0006287284,0.00063791353,0.00019169245,0.0012072031],"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.000002401833,0.000032672924,0.000004437475,0.0000071580344,0.00009328887,0.000044276687,0.000031791853,0.0000408743,0.0000018571914,0.8951134,0.03188608,0.07274177],"study_design_scores_gemma":[0.00049328106,0.00008476855,0.00010449974,0.00012422977,0.000035202233,0.000024644,0.0000020385419,0.100078054,0.0000040849227,0.0066081053,0.89180326,0.0006378305],"about_ca_topic_score_codex":0.000008537255,"about_ca_topic_score_gemma":0.000081238955,"teacher_disagreement_score":0.8885053,"about_ca_system_score_codex":0.00003327263,"about_ca_system_score_gemma":0.000043268956,"threshold_uncertainty_score":0.9995705},"labels":[],"label_agreement":null},{"id":"W105892904","doi":"","title":"Approximate Orthogonal Range Search using Patricia Tries","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Rectangle; Range query (database); Combinatorics; Range (aeronautics); Mathematics; Boundary (topology); Set (abstract data type); Trie; Range tree; Binary logarithm; Computational geometry; Data structure; Discrete mathematics; Algorithm; Computer science; Tree structure; Geometry; Binary tree; Sargable; Search engine; Interval tree; Mathematical analysis","score_opus":0.05859047501254531,"score_gpt":0.2789679369922952,"score_spread":0.22037746197974992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105892904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0726504,0.000101226586,0.9096899,0.0052132327,0.00044932374,0.00034650753,0.00020934075,0.00016005283,0.01118002],"genre_scores_gemma":[0.91941965,0.000007551227,0.07811501,0.0016227565,0.00025868294,0.000006754215,0.000120712444,0.000012500973,0.00043640277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998133,0.000058659625,0.00024691722,0.00048234,0.00054735824,0.00053175096],"domain_scores_gemma":[0.99887836,0.000099240846,0.000063464475,0.00032656468,0.00022640482,0.00040595958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351317,0.00019127376,0.00017732965,0.00097137823,0.00031520746,0.0005668301,0.00092961406,0.00006229994,0.00027677958],"category_scores_gemma":[0.00003072191,0.00020166904,0.000059506692,0.0011266714,0.000073657226,0.0007678823,0.00014460756,0.00020015366,0.0003147973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000765393,0.00006584547,0.0017955367,0.000022590062,0.00004583936,0.000058202917,0.00018893059,0.04946891,0.0000064133737,0.6713164,0.0029948654,0.2740288],"study_design_scores_gemma":[0.000416881,0.000042913773,0.005863655,0.000022336968,0.000005999042,0.00000910325,0.000042665863,0.9806701,0.00001799123,0.0050096433,0.0075883917,0.00031030554],"about_ca_topic_score_codex":0.0020972076,"about_ca_topic_score_gemma":0.0022302468,"teacher_disagreement_score":0.9312012,"about_ca_system_score_codex":0.00022063812,"about_ca_system_score_gemma":0.0009304551,"threshold_uncertainty_score":0.82238245},"labels":[],"label_agreement":null},{"id":"W107444495","doi":"","title":"Looking Backward, Forward, and All Around: Temporal, Spatial, and Spatio-Temporal Data Mining","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Generalization; Computer science; Data mining; Temporal database; Process (computing); Data modeling; Set (abstract data type); Domain (mathematical analysis); Data set; Software; Spatial analysis; Current (fluid); Artificial intelligence; Geography; Remote sensing; Mathematics; Geology; Database","score_opus":0.05579234385690988,"score_gpt":0.26314808233418185,"score_spread":0.20735573847727198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107444495","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.02592048,0.0010407066,0.95765376,0.00441644,0.0005284205,0.00043650513,0.000052434763,0.00041170602,0.00953955],"genre_scores_gemma":[0.6016213,0.00045766463,0.39269954,0.0013183065,0.00023940585,0.000007643698,0.0003489619,0.00002397161,0.003283163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983284,0.000036888694,0.00026441232,0.00076133123,0.00028557802,0.0003234188],"domain_scores_gemma":[0.9985397,0.00006048549,0.00010506905,0.0011379136,0.00002294768,0.0001339085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042654283,0.00019492197,0.0001976713,0.00012466872,0.00015456046,0.0010019048,0.0011454019,0.000044672306,0.00009918862],"category_scores_gemma":[0.000028167175,0.00017466846,0.000018011538,0.00017189806,0.000069130496,0.002939125,0.0023968671,0.00008517674,0.000044246586],"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.0000052091605,0.0001061706,0.070340246,0.000074779244,0.00012497428,0.00009850849,0.00068162667,0.000004034502,0.0000070346673,0.0041006077,0.13840052,0.7860563],"study_design_scores_gemma":[0.00056486845,0.00008401532,0.0011596485,0.00002711366,0.000024814914,0.000018856423,0.00014176991,0.7050447,0.00001242258,0.00033987968,0.29223576,0.0003461658],"about_ca_topic_score_codex":0.0006980241,"about_ca_topic_score_gemma":0.00046421413,"teacher_disagreement_score":0.7857101,"about_ca_system_score_codex":0.000010623641,"about_ca_system_score_gemma":0.00000834112,"threshold_uncertainty_score":0.9661392},"labels":[],"label_agreement":null},{"id":"W107722637","doi":"10.1137/1.9781611972764.41","title":"Cluster Description Formats, Problems and Algorithms","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Interpretability; Computer science; Cluster analysis; Heuristic; Cluster (spacecraft); Data mining; Code (set theory); State (computer science); Information retrieval; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","score_opus":0.016970937114307572,"score_gpt":0.20509833950533765,"score_spread":0.18812740239103007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107722637","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.0017605763,0.000066831686,0.9816681,0.00087452144,0.00017342449,0.0001477243,0.0000012292314,0.00019277343,0.015114775],"genre_scores_gemma":[0.13432023,0.00007177907,0.8361111,0.0018193742,0.00027928554,0.000041227064,0.000058411977,0.000015008847,0.027283534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933875,0.000012605058,0.00012920241,0.0002076031,0.00013592282,0.00017593002],"domain_scores_gemma":[0.9996775,0.000009371903,0.00003062157,0.00023380565,0.000018838235,0.000029859917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018492677,0.00007827716,0.00006534461,0.000067640205,0.00007506238,0.00045483725,0.00029123193,0.000021408832,0.000010728583],"category_scores_gemma":[0.0000017488109,0.000062225925,0.000016375856,0.00013969735,0.000018601868,0.002033969,0.0002992998,0.000036771926,0.00006223155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020783975,0.0001288335,0.0013763887,0.00006985947,0.00001632887,0.000009543035,0.00021367912,0.0001597698,0.00027748256,0.26509574,0.1142735,0.6183768],"study_design_scores_gemma":[0.00048810465,0.000046148074,0.0048397863,0.0000106819025,0.0000045992833,0.000014359304,0.000015634067,0.84500843,0.00013340652,0.022162728,0.12706216,0.00021399245],"about_ca_topic_score_codex":0.00012437906,"about_ca_topic_score_gemma":0.000026403088,"teacher_disagreement_score":0.84484863,"about_ca_system_score_codex":0.000009471807,"about_ca_system_score_gemma":0.0000031149125,"threshold_uncertainty_score":0.4386006},"labels":[],"label_agreement":null},{"id":"W110213072","doi":"","title":"Distributed predictive and descriptive data mining","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Data mining; Variety (cybernetics); Data stream mining; Domain (mathematical analysis); Knowledge extraction; Constraint (computer-aided design); Data science; Artificial intelligence; Engineering","score_opus":0.03084286755736358,"score_gpt":0.2324296577191919,"score_spread":0.20158679016182834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110213072","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.001945219,0.000049184833,0.9864569,0.00037303747,0.00009384963,0.00006691176,0.00013816467,0.0001397268,0.010737058],"genre_scores_gemma":[0.5605232,0.00001596014,0.43456805,0.00019920089,0.00016785262,0.0000075582548,0.0013416212,0.0000075787684,0.0031689634],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.000012415366,0.00007872457,0.00032104022,0.0001052089,0.00013030772],"domain_scores_gemma":[0.99936414,0.000025395408,0.000023978118,0.00054279185,0.000016973248,0.00002675001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012069251,0.000060897262,0.000056428456,0.00003148749,0.000062612904,0.00023628876,0.00080391846,0.000012592892,0.00000617621],"category_scores_gemma":[0.000012229717,0.000050819584,0.0000054322177,0.00015958062,0.000030278794,0.0015087869,0.0014204036,0.000026947757,0.000008603801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009084446,0.00016522924,0.011035312,0.000016172928,0.00007528125,0.000083158746,0.0003475156,0.00003208294,0.00009391235,0.2414944,0.54654735,0.20010051],"study_design_scores_gemma":[0.0003847277,0.00005588916,0.04015898,0.000010763472,0.0000135758455,0.0000050543877,0.00024176124,0.91726375,0.00012799547,0.0035235232,0.038017187,0.00019677964],"about_ca_topic_score_codex":0.00010661967,"about_ca_topic_score_gemma":0.000021674403,"teacher_disagreement_score":0.9172317,"about_ca_system_score_codex":0.000008000873,"about_ca_system_score_gemma":0.0000072763482,"threshold_uncertainty_score":0.2278538},"labels":[],"label_agreement":null},{"id":"W111494185","doi":"","title":"The total number of maximal k-independent sets in the generalized lexicographical product of graphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"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":"Lexicographical order; Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.012366653337287141,"score_gpt":0.2557627499748185,"score_spread":0.24339609663753137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111494185","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.9939779,0.00018262478,0.00016865881,0.0028206126,0.00082845706,0.00031538872,0.000004142933,0.000028446346,0.0016737523],"genre_scores_gemma":[0.99762464,0.000050434304,0.0021394864,0.00006490048,0.000010433898,0.000019903728,0.0000042533334,0.0000056935137,0.000080275546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840915,0.00016439823,0.0003432512,0.0002750277,0.00054675335,0.00026142068],"domain_scores_gemma":[0.9988367,0.00009470268,0.00013647116,0.00084240985,0.000059112812,0.00003058746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010060132,0.00012243967,0.00016779004,0.00007553249,0.00008999486,0.00009409699,0.0015682174,0.000033020133,0.000008312946],"category_scores_gemma":[0.000030634066,0.0000743644,0.00010074333,0.00074135954,0.00013228122,0.00038116903,0.00036958038,0.00016244236,0.000009896219],"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.000010842486,0.0002398739,0.0053611547,0.0000075585044,0.00002576375,0.000005487958,0.0002694169,0.000011564526,0.000073695985,0.9772626,0.0016692585,0.015062794],"study_design_scores_gemma":[0.0030371642,0.00018460586,0.18188865,0.00003523159,0.000033433913,0.0000436921,0.00015766932,0.009994889,0.003073179,0.79475224,0.0063890647,0.0004101966],"about_ca_topic_score_codex":0.000059625127,"about_ca_topic_score_gemma":0.000014029728,"teacher_disagreement_score":0.18251036,"about_ca_system_score_codex":0.000010990219,"about_ca_system_score_gemma":0.000024447954,"threshold_uncertainty_score":0.3032492},"labels":[],"label_agreement":null},{"id":"W11219696","doi":"10.1007/978-3-540-36122-0_8","title":"GTSOM: Game Theoretic Self-organizing Maps","year":2006,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Data Management and Algorithms","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":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.055725829606105885,"score_gpt":0.3077881833873966,"score_spread":0.2520623537812907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11219696","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.0000038520398,0.0039437427,0.75156707,0.0005171568,0.0014144294,0.00036439075,0.000033883713,0.00031401156,0.24184147],"genre_scores_gemma":[0.054766193,0.008385691,0.61514807,0.00240156,0.0019540389,0.000117448544,0.00070210797,0.00027288165,0.31625202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737865,0.00003748046,0.00068361714,0.00086727197,0.0006703106,0.00036266737],"domain_scores_gemma":[0.9982869,0.00058922597,0.00027859307,0.0005288981,0.0002682102,0.000048173064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043921638,0.0004549952,0.00047315232,0.00040181124,0.00013573539,0.00018245864,0.0015993342,0.000116881616,0.000046433724],"category_scores_gemma":[0.000049403974,0.00045001614,0.000114114344,0.00023364816,0.00033128134,0.00039640605,0.0015597057,0.00040018614,0.00056292117],"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.0000014605971,0.000029060484,0.000009955594,0.000097289245,0.00012008088,0.00012307431,0.0005053301,0.012386867,6.291706e-8,0.96712637,0.007831081,0.011769378],"study_design_scores_gemma":[0.000068423215,0.000049111528,0.00002378239,0.00031198305,0.000024315968,0.00001535265,0.000055674216,0.041429825,0.000007420398,0.92073476,0.03677022,0.0005091262],"about_ca_topic_score_codex":0.000006119654,"about_ca_topic_score_gemma":0.000007827143,"teacher_disagreement_score":0.136419,"about_ca_system_score_codex":0.00024294102,"about_ca_system_score_gemma":0.00006620498,"threshold_uncertainty_score":0.99979514},"labels":[],"label_agreement":null},{"id":"W112839659","doi":"","title":"Memory-Bounded D* Lite","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Pathfinding; Bounded function; Computer science; Queue; Priority queue; Path (computing); Parallel computing; Theoretical computer science; Algorithm; Shortest path problem; Operating system; Mathematics; Computer network; Graph","score_opus":0.02356485116860079,"score_gpt":0.21581872589124257,"score_spread":0.19225387472264177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112839659","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.0030492912,0.00003195736,0.7540925,0.0011619874,0.00030873352,0.000060411887,5.5601316e-7,0.00033853247,0.24095604],"genre_scores_gemma":[0.23099716,0.000100924,0.55940086,0.0042197257,0.00026073866,0.00001257202,0.000013604487,0.000011505415,0.20498289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994632,0.0000087645385,0.00006994068,0.00017890356,0.0001435279,0.00013567036],"domain_scores_gemma":[0.99949974,0.000010493799,0.000014706011,0.00042006272,0.000015285197,0.000039740484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007313016,0.000051532817,0.000050111215,0.000045678193,0.00009423404,0.00009876421,0.00067784433,0.000011046975,0.00009334662],"category_scores_gemma":[0.0000052398523,0.00004193633,0.000023293404,0.00021021847,0.000022638225,0.0007598036,0.0002903236,0.000030358673,0.00074522535],"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.0000015012178,0.00010256122,0.00042519573,0.000007890767,0.00002594039,0.00022176778,0.0005491538,0.000006254103,0.00008671445,0.5242718,0.19884126,0.27545998],"study_design_scores_gemma":[0.0010190834,0.00010503066,0.011326715,0.000008559797,0.0000057747766,0.00008779584,0.000041576484,0.09566723,0.0045554815,0.019363102,0.8671858,0.00063388277],"about_ca_topic_score_codex":0.000019948926,"about_ca_topic_score_gemma":0.0000021169174,"teacher_disagreement_score":0.6683445,"about_ca_system_score_codex":0.0000059675826,"about_ca_system_score_gemma":0.000010879772,"threshold_uncertainty_score":0.95786124},"labels":[],"label_agreement":null},{"id":"W114151515","doi":"10.5751/es-00371-060102","title":"A Fractal Landscape Realizer for Generating Synthetic Maps","year":2002,"lang":"en","type":"article","venue":"Conservation Ecology","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":78,"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":"Fractal; Geography; Computer science; Cartography; Mathematics","score_opus":0.03244642651610551,"score_gpt":0.23967366990808417,"score_spread":0.20722724339197865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114151515","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.04040804,0.00009444218,0.92668515,0.02454223,0.0012048973,0.00053296465,0.00002493707,0.00028093075,0.0062263967],"genre_scores_gemma":[0.60108656,0.00007026041,0.3610615,0.022847762,0.00057458226,0.00048313197,0.00027169168,0.000033985692,0.013570486],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993229,0.000035428697,0.00016036913,0.00023656183,0.00006114539,0.00018363065],"domain_scores_gemma":[0.99940497,0.00017032691,0.000078113575,0.00026180822,0.000055315657,0.000029443694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018982786,0.00006980322,0.000095628246,0.00007065042,0.00013105499,0.000098447454,0.00033056372,0.00004442871,0.00016418232],"category_scores_gemma":[0.00012237435,0.00006923909,0.000029498944,0.00013334372,0.000019932739,0.0003863057,0.00010344593,0.00003901587,0.000108618486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063105877,0.00017542968,0.015082061,0.000044780885,0.00005695442,0.000022701957,0.0004144085,0.00013952136,0.00047605578,0.19510803,0.65519005,0.13328369],"study_design_scores_gemma":[0.00041099277,0.00006960083,0.0033803498,0.0000031929585,0.0000068282643,0.0000072301386,0.000013223679,0.8520532,0.00005920765,0.0020701087,0.1418147,0.00011136094],"about_ca_topic_score_codex":0.0000053320173,"about_ca_topic_score_gemma":0.0000300581,"teacher_disagreement_score":0.8519137,"about_ca_system_score_codex":0.000011563875,"about_ca_system_score_gemma":0.0000095647865,"threshold_uncertainty_score":0.2823488},"labels":[],"label_agreement":null},{"id":"W117904809","doi":"10.3166/isi.10.1.33-57","title":"Recherche d'information. Analyse des résultats de différents systèmes réalisant la même tâche","year":2005,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Political science","score_opus":0.06425829610738738,"score_gpt":0.2950916923317034,"score_spread":0.23083339622431603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117904809","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.026892813,0.0020286082,0.8905564,0.0017404167,0.0015388319,0.00084798544,0.00029325168,0.00061422953,0.075487465],"genre_scores_gemma":[0.53125274,0.0030071198,0.4540999,0.0026728103,0.0009994322,0.00025438884,0.0013759626,0.000058442725,0.006279191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949625,0.00078600727,0.0019082492,0.00033365996,0.000850558,0.001159016],"domain_scores_gemma":[0.996403,0.0004771448,0.0010685035,0.0009146473,0.0007392493,0.0003974665],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.004602556,0.0005922063,0.0005795283,0.00077138154,0.0007302514,0.004252986,0.0015866673,0.00054186996,0.00020236115],"category_scores_gemma":[0.0019522519,0.00059662416,0.00026399377,0.0019451026,0.0005347753,0.049638834,0.0006846653,0.00066658395,0.0022599727],"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.00003042786,0.00010598585,0.00060505397,0.0011002492,0.00020006408,0.000010856426,0.036352538,0.0039633987,0.000016470107,0.026647795,0.012252915,0.9187142],"study_design_scores_gemma":[0.0014880532,0.00014473444,0.0104598235,0.0011375353,0.00019061158,0.00019329232,0.0044013085,0.63309264,0.00089479843,0.015590859,0.33138543,0.0010209214],"about_ca_topic_score_codex":0.0009847741,"about_ca_topic_score_gemma":0.000082104954,"teacher_disagreement_score":0.9176933,"about_ca_system_score_codex":0.0017121965,"about_ca_system_score_gemma":0.0005712601,"threshold_uncertainty_score":0.9996485},"labels":[],"label_agreement":null},{"id":"W119401213","doi":"10.1007/3-540-31305-2_5","title":"Distributed Geospatial Information Service","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Geospatial analysis; Web Coverage Service; Service (business); Geography; Computer science; Data science; World Wide Web; Business; Remote sensing; Web service; Web 2.0","score_opus":0.009089489171984272,"score_gpt":0.18648355310654147,"score_spread":0.1773940639345572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119401213","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":[1.220469e-7,0.0000052211344,0.5014439,0.0004387321,0.0002117865,0.00009243132,0.00011632595,0.000179932,0.49751154],"genre_scores_gemma":[0.00008602291,0.000024315621,0.029496105,0.0030205199,0.00036211745,0.000010100867,0.013851605,0.000018933139,0.9531303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906147,0.0000029075184,0.0002620557,0.00019564299,0.00032053722,0.0001574026],"domain_scores_gemma":[0.9991033,0.000010965452,0.00015432309,0.00058415625,0.00010697585,0.00004025985],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000074653435,0.00019354133,0.00014270772,0.000114718314,0.00005971982,0.00043820194,0.001003728,0.00011234727,0.00019846254],"category_scores_gemma":[0.000002090092,0.00017642177,0.000050363113,0.00006076736,0.00000940456,0.002009053,0.00064646173,0.00012087317,0.0020048872],"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":[5.9142104e-7,0.0000039303245,7.575103e-7,0.000022676275,0.00001597497,0.0000043799405,0.000012555058,0.00003493783,6.3698806e-8,0.698392,0.23944302,0.06206914],"study_design_scores_gemma":[0.00013288844,0.0000125691995,0.000058574267,0.00001715408,0.000010240765,0.0000012645622,7.3332296e-7,0.0319046,0.000002506866,0.010386261,0.9572322,0.00024101269],"about_ca_topic_score_codex":0.0001608599,"about_ca_topic_score_gemma":0.00006427825,"teacher_disagreement_score":0.7177892,"about_ca_system_score_codex":0.000032550088,"about_ca_system_score_gemma":0.000025632375,"threshold_uncertainty_score":0.99877214},"labels":[],"label_agreement":null},{"id":"W121085945","doi":"","title":"The PKD-tree for Orthogonal d-Dimensional Range Search.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Range tree; Tree (set theory); Combinatorics; R-tree; Search engine indexing; K-ary tree; Mathematics; Pyramid (geometry); Tree structure; Interval tree; Computer science; Algorithm; Binary tree; Spatial database; Artificial intelligence; Statistics; Spatial analysis; Geometry","score_opus":0.02736035179704939,"score_gpt":0.24675582092588252,"score_spread":0.21939546912883312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121085945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016358726,0.00019973301,0.9196595,0.036029525,0.0015468826,0.00096478395,0.00060611253,0.0001850054,0.024449766],"genre_scores_gemma":[0.97185296,0.0000033832816,0.021958353,0.0018559117,0.0003731973,0.000053347118,0.0004540206,0.000015718551,0.0034331197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823755,0.000045185938,0.00023151538,0.00043301898,0.00052150193,0.0005312347],"domain_scores_gemma":[0.99859816,0.00042011632,0.00005968299,0.00033939074,0.0003334495,0.0002492193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043856626,0.00016828686,0.00012656047,0.0003729528,0.00068714895,0.0006181711,0.0010491968,0.00005003632,0.000059421727],"category_scores_gemma":[0.000042488577,0.0001393387,0.00008273193,0.00055964454,0.000110162124,0.0003078163,0.000110552915,0.00014215027,0.00019916818],"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.0000064726123,0.00002033133,0.00022352004,0.0000049367545,0.000019114528,0.000011381277,0.000008369082,0.0063713253,0.0000027132194,0.89596176,0.026030298,0.071339756],"study_design_scores_gemma":[0.0007116434,0.00010280651,0.03484404,0.000021414842,0.000007317542,0.0000066694947,0.000020220145,0.7644218,0.000015745805,0.1202195,0.07926868,0.000360171],"about_ca_topic_score_codex":0.0032956745,"about_ca_topic_score_gemma":0.015735656,"teacher_disagreement_score":0.9554942,"about_ca_system_score_codex":0.000114988754,"about_ca_system_score_gemma":0.00081125594,"threshold_uncertainty_score":0.87808657},"labels":[],"label_agreement":null},{"id":"W125162825","doi":"10.1142/s0218213005002053","title":"CLUSTERING SPATIAL DATA IN THE PRESENCE OF OBSTACLES","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Cluster analysis; Computer science; Preprocessor; Constraint (computer-aided design); Data mining; Clustering high-dimensional data; Computation; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.1338871831955201,"score_gpt":0.3589904498955765,"score_spread":0.2251032667000564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W125162825","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.01061783,0.00008710657,0.98212034,0.0055962014,0.0009963163,0.00008557189,0.000020180085,0.000007014391,0.00046944775],"genre_scores_gemma":[0.9606151,0.000089424015,0.038449474,0.00021538656,0.00060136436,0.0000011075763,0.0000068717245,0.0000033585368,0.000017926915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980687,0.00007789901,0.00074345473,0.00017046423,0.0008004713,0.00013902428],"domain_scores_gemma":[0.99849665,0.00034548214,0.00038512994,0.0005085092,0.00023577716,0.000028432467],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0014019184,0.000083697785,0.00012949701,0.00020841586,0.000026849311,0.00039679022,0.0065304413,0.000023532202,0.00003752416],"category_scores_gemma":[0.0004676766,0.00006118698,0.000052451993,0.00020854872,0.00006619039,0.0027523574,0.0007853704,0.0001747517,0.000021171736],"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.000027273112,0.00016712457,0.00012858832,0.0000028413713,0.000026305648,0.00005136981,0.0008435466,0.0040388578,0.00033370985,0.016509514,0.00027568685,0.9775952],"study_design_scores_gemma":[0.00013147258,0.00014852127,0.0022262542,0.00016807117,0.000012702042,0.00010032906,0.0009566881,0.95807534,0.011619786,0.013195738,0.013165469,0.00019960324],"about_ca_topic_score_codex":0.00008195758,"about_ca_topic_score_gemma":0.00024703366,"teacher_disagreement_score":0.9773956,"about_ca_system_score_codex":0.00002995364,"about_ca_system_score_gemma":0.000054756863,"threshold_uncertainty_score":0.9988447},"labels":[],"label_agreement":null},{"id":"W1292837","doi":"","title":"Complexity of Octagonal and Rectangular Cartograms.","year":2005,"lang":"en","type":"article","venue":"Pneumonologia i Alergologia Polska","topic":"Data Management and Algorithms","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":"","keywords":"Adjacency list; Rectangle; Computer science; Slicing; Population; Type (biology); Combinatorics; Mathematics; Geometry; Computer graphics (images); Geology","score_opus":0.030175102056890477,"score_gpt":0.24214459905200506,"score_spread":0.21196949699511458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1292837","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.8683365,0.0016494341,0.10290843,0.012079331,0.0007687883,0.00066485966,0.000067633846,0.0010889429,0.012436047],"genre_scores_gemma":[0.90210277,0.00013622623,0.09711255,0.0003375552,0.00007569366,0.000014148499,0.000016928676,0.000007929389,0.00019620796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983879,0.000087847984,0.00034259554,0.00053463836,0.00021893803,0.00042810082],"domain_scores_gemma":[0.99887973,0.00009057165,0.00016665371,0.0007120088,0.000056727866,0.00009430804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003352582,0.00021230495,0.00031342264,0.00016248338,0.000101921105,0.00008759905,0.0011853653,0.00010928859,0.00004034233],"category_scores_gemma":[0.00008115373,0.00018684797,0.00007429253,0.000345695,0.00047269656,0.00058747944,0.00095041847,0.00018252344,0.000043913908],"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.000024939263,0.00035644666,0.023840671,0.00005913759,0.00015676809,0.00005669964,0.00046595436,0.000049204657,0.007886246,0.5047066,0.005335763,0.45706156],"study_design_scores_gemma":[0.003303898,0.0019527966,0.7060492,0.00010220608,0.00012654456,0.00029060498,0.00042059764,0.09450567,0.03431124,0.06624135,0.090111315,0.0025845803],"about_ca_topic_score_codex":0.000065417815,"about_ca_topic_score_gemma":0.00003692529,"teacher_disagreement_score":0.68220854,"about_ca_system_score_codex":0.000028998102,"about_ca_system_score_gemma":0.000025949306,"threshold_uncertainty_score":0.76194394},"labels":[],"label_agreement":null},{"id":"W138750640","doi":"10.1007/978-3-642-03668-2_26","title":"Holonic Modelling of Large Scale Geographic Environments","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Situated; Computer science; Geographic information system; Representation (politics); Scale (ratio); Data science; Artificial intelligence; Geography; Cartography","score_opus":0.01631348630134387,"score_gpt":0.22174833510947373,"score_spread":0.20543484880812984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138750640","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.00011440941,0.0005571654,0.99611515,0.00023027555,0.00059942063,0.00027488507,0.000011971533,0.000069242975,0.0020274662],"genre_scores_gemma":[0.11851215,0.000478601,0.8783033,0.0011617622,0.00028704866,0.0000056016447,0.000027518785,0.000037627622,0.0011863722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964503,0.000021199057,0.0004898728,0.0013377708,0.0010359549,0.0006649188],"domain_scores_gemma":[0.9978167,0.00008768803,0.00030756192,0.0016276367,0.000043656957,0.000116789844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084248564,0.00042016938,0.00047020908,0.0009475478,0.00016579879,0.00026156264,0.004068093,0.00019714152,0.0000138473915],"category_scores_gemma":[0.000007268048,0.00040141793,0.00015371157,0.00052499684,0.00041139114,0.0008606985,0.0016818695,0.0005025432,0.00003494792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034164568,0.00010910523,0.00008301154,0.000037167374,0.000019113433,0.00006148501,0.00036445478,0.15224709,0.000054016436,0.0141423745,0.000016238828,0.83286256],"study_design_scores_gemma":[0.0002572253,0.0001360598,0.00012703994,0.00021110098,0.000011038651,0.000007786154,9.0057696e-8,0.89764386,0.00044614027,0.09730688,0.0033885909,0.0004641706],"about_ca_topic_score_codex":0.000008789661,"about_ca_topic_score_gemma":0.000011389588,"teacher_disagreement_score":0.83239836,"about_ca_system_score_codex":0.00008280773,"about_ca_system_score_gemma":0.00008788206,"threshold_uncertainty_score":0.9998438},"labels":[],"label_agreement":null},{"id":"W140589133","doi":"10.1007/b10143","title":"Topics in Spatial Stochastic Processes","year":2003,"lang":"en","type":"book","venue":"Lecture notes in mathematics","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Mathematics; Stochastic process; Subject (documents); Mathematical economics; Set (abstract data type); Statistical physics; Statistics; Library science; Computer science; Physics","score_opus":0.015668743634088014,"score_gpt":0.24110294985917782,"score_spread":0.2254342062250898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140589133","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.0000032740281,0.00034814115,0.95710206,0.0002509656,0.00036639633,0.0004208573,0.000007711196,0.00006578744,0.041434817],"genre_scores_gemma":[0.0013447525,0.00016555969,0.79303414,0.0013200849,0.0010881439,0.0001469848,0.0002097933,0.00017491406,0.20251563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983787,0.00002466659,0.00043813788,0.00044742678,0.00037921255,0.0003318379],"domain_scores_gemma":[0.99864006,0.0003419034,0.00019610544,0.00073559565,0.000049203234,0.000037156682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024241008,0.00033444367,0.0004428718,0.000325005,0.0000291193,0.00019584289,0.0012126232,0.00025740688,0.000032861855],"category_scores_gemma":[0.0005961502,0.000302565,0.0000465278,0.0003759357,0.000038824277,0.0001955733,0.00031053988,0.00049461157,0.00005327342],"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.000015761685,0.0020458251,0.000114125105,0.02650307,0.0002097369,0.0012673916,0.017579196,0.027467199,0.000007125475,0.38355657,0.023582714,0.5176513],"study_design_scores_gemma":[0.00032109494,0.000048518963,0.000004871274,0.0008835618,0.000020290592,0.000010894007,0.0000026099938,0.0438759,0.000029410381,0.9465832,0.007670882,0.0005487726],"about_ca_topic_score_codex":0.0000059250715,"about_ca_topic_score_gemma":0.000256679,"teacher_disagreement_score":0.5630266,"about_ca_system_score_codex":0.00013583012,"about_ca_system_score_gemma":0.00030641005,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W144578322","doi":"10.1007/0-387-23667-8_13","title":"Parallel Computation, Co-operation, Tabu Search","year":2005,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Data Management and Algorithms","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computation; Computer science; Focus (optics); Guided Local Search; Point (geometry); Mathematical optimization; Theoretical computer science; Management science; Data science; Algorithm; Mathematics; Engineering","score_opus":0.03662927356086902,"score_gpt":0.2816171157799109,"score_spread":0.24498784221904185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W144578322","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.000002026551,0.00035358925,0.21174172,0.0023017856,0.0009403669,0.0006595027,0.000044489774,0.0005616494,0.7833949],"genre_scores_gemma":[0.000204792,0.00007313781,0.022998422,0.0036419535,0.0014403893,0.000044769,0.0007363447,0.00010869378,0.9707515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954059,0.00006844523,0.0009329019,0.0013890474,0.0014198549,0.00078383816],"domain_scores_gemma":[0.99778533,0.000108325345,0.00035224942,0.0011260321,0.00025478675,0.0003732902],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010950419,0.0006869547,0.0005749053,0.0007065413,0.00034229076,0.0025067916,0.0038937172,0.00086444616,0.0005077916],"category_scores_gemma":[0.00002389614,0.0006998819,0.00021011366,0.00006630992,0.00024741326,0.0042120432,0.0010996585,0.0021708203,0.0014898559],"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.000004409557,0.000007967067,0.000008063987,0.000026069845,0.00010452584,0.000021483598,0.00031966154,0.00018675835,0.0000038301114,0.27424264,0.5957135,0.12936108],"study_design_scores_gemma":[0.00061427616,0.000040000006,0.000021146921,0.000064871245,0.000035446777,0.000018411409,0.000015674781,0.012791554,0.000013575627,0.021089397,0.96448284,0.00081277336],"about_ca_topic_score_codex":0.000015987393,"about_ca_topic_score_gemma":0.0000046177884,"teacher_disagreement_score":0.36876935,"about_ca_system_score_codex":0.00023800075,"about_ca_system_score_gemma":0.00038008305,"threshold_uncertainty_score":0.9995452},"labels":[],"label_agreement":null},{"id":"W1480779956","doi":"10.1109/mdm.2015.49","title":"A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Sequence (biology); Point of interest; Focus (optics); Group (periodic table); Euclidean distance; Euclidean geometry; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.20483533165271003,"score_gpt":0.3292976793257234,"score_spread":0.12446234767301337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480779956","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.0029160655,0.00006192987,0.9767362,0.0009539158,0.00036621382,0.00035899295,0.000011929908,0.00033152,0.018263258],"genre_scores_gemma":[0.70289063,0.000008907052,0.28726536,0.0003871404,0.00024007108,0.00011433213,0.00011436331,0.000022453905,0.008956731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867016,0.0000332775,0.00018569131,0.00040249716,0.0003098788,0.0003984831],"domain_scores_gemma":[0.9991913,0.00008156623,0.00004128913,0.00044600962,0.00008487197,0.0001549876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006056863,0.00014136992,0.0001543137,0.00010974499,0.00014242507,0.00059598155,0.0010214566,0.000040806623,0.000011734426],"category_scores_gemma":[0.000032435466,0.00011766542,0.0000476455,0.00031765475,0.00004916584,0.0014668287,0.00036537522,0.00007529502,0.00006160263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077459204,0.0001650257,0.000823361,0.00011536311,0.00009198901,0.00009948591,0.0022255862,0.0017221746,0.00014886097,0.70184815,0.12487151,0.16781107],"study_design_scores_gemma":[0.0046631536,0.0014430898,0.003381513,0.00008771044,0.000027043201,0.00003251339,0.0048583397,0.82048327,0.002779186,0.019586775,0.1414644,0.0011930448],"about_ca_topic_score_codex":0.00020480379,"about_ca_topic_score_gemma":0.00012571827,"teacher_disagreement_score":0.81876105,"about_ca_system_score_codex":0.00003973225,"about_ca_system_score_gemma":0.000069624875,"threshold_uncertainty_score":0.5747064},"labels":[],"label_agreement":null},{"id":"W1481682349","doi":"10.1007/11425274_58","title":"A Distance-Based Algorithm for Clustering Database User Sessions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Cluster analysis; Benchmark (surveying); Computation; Workload; Data mining; Online transaction processing; Database; Algorithm; Database transaction; Artificial intelligence; Transaction processing","score_opus":0.0233684434842335,"score_gpt":0.2653069685680108,"score_spread":0.24193852508377728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481682349","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":[4.891439e-7,0.0003172658,0.99440426,0.0010230644,0.0020365436,0.00078915624,0.00013948855,0.0002487718,0.0010409785],"genre_scores_gemma":[0.00027034112,0.000040644234,0.9949694,0.0020879616,0.0008892194,0.000046905672,0.00011130167,0.00004594757,0.0015382444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572873,0.000021786407,0.0005355953,0.0019208208,0.0009289919,0.0008640903],"domain_scores_gemma":[0.99678403,0.00044217127,0.00028139786,0.002088175,0.00018321873,0.00022102786],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00083530927,0.0006069973,0.00050930475,0.0008051607,0.0004224417,0.0010537042,0.004675632,0.00019261087,0.00002842309],"category_scores_gemma":[0.000044472992,0.00055227516,0.00017507841,0.0005784413,0.0004052942,0.001570154,0.0022706368,0.00052961824,0.000035105957],"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.0000030282756,0.000034626515,0.000002810924,0.00004255417,0.000008616057,0.000043310218,0.000054346558,0.0068816138,0.000012810812,0.0059678103,0.00021384268,0.9867346],"study_design_scores_gemma":[0.00051327934,0.000083762265,0.0000067841534,0.00046344774,0.000012848003,0.000008212218,1.0367303e-7,0.92084235,0.00023138059,0.007793997,0.06937793,0.00066592346],"about_ca_topic_score_codex":0.000012050893,"about_ca_topic_score_gemma":0.000121614146,"teacher_disagreement_score":0.9860687,"about_ca_system_score_codex":0.00027754874,"about_ca_system_score_gemma":0.00040934968,"threshold_uncertainty_score":0.9999833},"labels":[],"label_agreement":null},{"id":"W1481798977","doi":"10.1007/11424857_20","title":"A New and Efficient K-Medoid Algorithm for Spatial Clustering","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":112,"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":"Medoid; k-medoids; Cluster analysis; Computer science; Algorithm; Canopy clustering algorithm; Computation; CURE data clustering algorithm; Correlation clustering; Data mining; Artificial intelligence","score_opus":0.013327264064766016,"score_gpt":0.23704973927285192,"score_spread":0.2237224752080859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481798977","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.000002211133,0.0004083125,0.9951372,0.00080877496,0.0019308634,0.0006645876,0.000022575428,0.00014664569,0.0008788111],"genre_scores_gemma":[0.0005931628,0.00004153615,0.9959029,0.00080230384,0.0014209411,0.000010908483,0.000012942619,0.00003029198,0.0011849914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660313,0.00001153746,0.00041646502,0.0015824843,0.00070843793,0.0006779604],"domain_scores_gemma":[0.9982614,0.00022728092,0.00019922921,0.0009815919,0.00009719721,0.00023332413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006386556,0.00048593726,0.00043856047,0.00066342077,0.0002466392,0.0009927596,0.0025427758,0.00017984076,0.000015658146],"category_scores_gemma":[0.000028452556,0.00045504776,0.000099900986,0.00029578796,0.000260932,0.0005189678,0.0025174327,0.00036540304,0.000014364694],"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.0000019492313,0.000010220515,0.0000010369002,0.000019552766,0.0000075515213,0.000017385662,0.00018109879,0.009804449,0.000007813091,0.002515119,0.00006211079,0.9873717],"study_design_scores_gemma":[0.00048351922,0.00014358773,0.000020585967,0.00016604796,0.000010068832,0.000029300674,8.951086e-8,0.97229165,0.00013993615,0.012824171,0.013358522,0.0005325092],"about_ca_topic_score_codex":0.000050941533,"about_ca_topic_score_gemma":0.000109887005,"teacher_disagreement_score":0.9868392,"about_ca_system_score_codex":0.000155158,"about_ca_system_score_gemma":0.00025945398,"threshold_uncertainty_score":0.99979013},"labels":[],"label_agreement":null},{"id":"W148229027","doi":"","title":"The Counting Series for Unlabeled Linear Acyclic Hypergraphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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; Series (stratigraphy); Combinatorics; Biology","score_opus":0.008401725942124443,"score_gpt":0.2225427401329127,"score_spread":0.21414101419078826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148229027","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.7685796,0.0036342444,0.10224337,0.034789264,0.04224575,0.004692415,0.00007643446,0.0036112147,0.040127728],"genre_scores_gemma":[0.9700209,0.00008765941,0.022586029,0.00032123656,0.000115031784,0.00013569623,0.000048540012,0.00003254895,0.0066523817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989446,0.000025878331,0.00020166428,0.00027208286,0.00021439246,0.00034139212],"domain_scores_gemma":[0.9990731,0.00016334954,0.00009027998,0.0005574912,0.00008644169,0.000029358827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042094482,0.00012479097,0.00011413279,0.000044757777,0.0005611076,0.00044312375,0.001120309,0.000032780565,0.0000012832628],"category_scores_gemma":[0.00004531854,0.00009404285,0.00006455497,0.00037183947,0.000058802205,0.00078589475,0.0002817031,0.000073238116,0.000029186018],"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.000003328695,0.000030364157,0.00040147186,0.0000065074914,0.000012978417,0.0000017531912,0.000016883474,0.000004128569,0.00010310091,0.98009586,0.014306304,0.005017335],"study_design_scores_gemma":[0.00070696394,0.00007097297,0.0012876086,0.000008473012,0.000010709336,0.0000020429752,0.000022893144,0.012323766,0.0010570841,0.68529564,0.29901773,0.00019611324],"about_ca_topic_score_codex":0.00003832351,"about_ca_topic_score_gemma":0.000014405732,"teacher_disagreement_score":0.2948002,"about_ca_system_score_codex":0.000016356598,"about_ca_system_score_gemma":0.000019654173,"threshold_uncertainty_score":0.43156427},"labels":[],"label_agreement":null},{"id":"W1483181615","doi":"10.1007/978-3-540-68825-9_22","title":"Predicting User Preferences Via Similarity-Based Clustering","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"National Research Council Canada; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Computer science; Cluster analysis; Similarity (geometry); Data mining; Artificial intelligence; Information retrieval","score_opus":0.026412242445519492,"score_gpt":0.23842959414335174,"score_spread":0.21201735169783226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483181615","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.000055649503,0.00019659036,0.9924107,0.0004199524,0.0020004436,0.0004157334,0.000010134824,0.0003654084,0.0041253977],"genre_scores_gemma":[0.041345257,0.00008673121,0.954732,0.0023302457,0.00078977784,0.000016961498,0.000030403597,0.00005256511,0.000616045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953864,0.00003913978,0.00057557825,0.0018596823,0.0013244754,0.00081471563],"domain_scores_gemma":[0.9973255,0.0003009383,0.00033073893,0.0016877991,0.00016970882,0.00018535256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077016314,0.00061681576,0.0005228947,0.00091933005,0.00046438,0.0009309021,0.005320964,0.00027419016,0.000025377596],"category_scores_gemma":[0.000057859783,0.000570631,0.00013796659,0.00066396553,0.00058763387,0.0014586141,0.002811022,0.00086837914,0.000047220758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061181877,0.000049436072,0.0006106952,0.00010203732,0.000022889775,0.0002467476,0.00047943217,0.07827443,0.000026946342,0.0012874458,0.00012912546,0.9187647],"study_design_scores_gemma":[0.0002710506,0.00013522066,0.00022892663,0.0003529596,0.000008857335,0.000028781455,8.641102e-8,0.98365265,0.00035758544,0.009436063,0.0048371586,0.000690685],"about_ca_topic_score_codex":0.000045011147,"about_ca_topic_score_gemma":0.00016156485,"teacher_disagreement_score":0.918074,"about_ca_system_score_codex":0.00018842169,"about_ca_system_score_gemma":0.00035884633,"threshold_uncertainty_score":0.9996745},"labels":[],"label_agreement":null},{"id":"W1483563006","doi":"10.1007/11766247_12","title":"Intelligent Information Personalization Leveraging Constraint Satisfaction and Association Rule Methods","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Personalization; Computer science; Consistency (knowledge bases); Information filtering system; Constraint (computer-aided design); Information retrieval; Constraint satisfaction problem; Relevance (law); Set (abstract data type); Constraint satisfaction; Association rule learning; Recommender system; Data mining; World Wide Web; Artificial intelligence; Mathematics; Probabilistic logic","score_opus":0.017660564034717406,"score_gpt":0.26557442543268184,"score_spread":0.24791386139796442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483563006","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.000032338794,0.00011270369,0.99485165,0.00050063175,0.0011792872,0.00027772455,0.000006716363,0.00011791821,0.002921049],"genre_scores_gemma":[0.019548498,0.00009304568,0.97884005,0.0008351466,0.00023452862,0.0000073829137,0.00006914042,0.000013529779,0.00035866105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789715,0.00004885494,0.0004290326,0.00059642474,0.0007028392,0.00032569925],"domain_scores_gemma":[0.99868786,0.0002484319,0.0004136593,0.0003931474,0.00019275758,0.000064128304],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015103478,0.00028165913,0.00025377263,0.0006980245,0.00022562016,0.001197285,0.0005852192,0.00017944703,0.000013274208],"category_scores_gemma":[0.00009531184,0.00028228163,0.000050756815,0.0003529286,0.00014669637,0.0024921948,0.00059358595,0.0003515041,0.000017948423],"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":[8.092659e-7,0.0000039741176,0.00029945237,0.000030622523,0.000008495189,0.0000023876748,0.00046226406,0.005875516,0.000020021154,0.011296537,0.000070322094,0.9819296],"study_design_scores_gemma":[0.00018774235,0.000040033206,0.002025692,0.00014544767,0.000013101389,0.00001396278,0.0000010010806,0.93464446,0.00036492574,0.057067208,0.005062389,0.00043406026],"about_ca_topic_score_codex":0.00008245186,"about_ca_topic_score_gemma":0.000023673656,"teacher_disagreement_score":0.98149556,"about_ca_system_score_codex":0.0005860415,"about_ca_system_score_gemma":0.00012887396,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W1485709273","doi":"10.3390/fi7020110","title":"Dynamis: Effective Context-Aware Web Service Selection Using Dynamic Attributes","year":2015,"lang":"en","type":"article","venue":"Future Internet","topic":"Data Management and Algorithms","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 Victoria","funders":"","keywords":"Computer science; Skyline; Web service; Ranking (information retrieval); Data mining; Quality of service; Set (abstract data type); Context (archaeology); Matching (statistics); Service (business); Database; Information retrieval; World Wide Web; Computer network","score_opus":0.01869549164567102,"score_gpt":0.2578691115358681,"score_spread":0.2391736198901971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485709273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07995951,0.0003324323,0.91021645,0.0028627457,0.0045920187,0.0005724109,0.0000513939,0.00064600306,0.0007670344],"genre_scores_gemma":[0.98810697,0.0000053155063,0.009151673,0.0010443652,0.00054971484,0.000024847594,0.00010628012,0.000020069763,0.0009907407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872154,0.000095763055,0.00017787567,0.00045117008,0.00026409983,0.00028952313],"domain_scores_gemma":[0.999179,0.000033535096,0.000105726685,0.00033950116,0.00022446597,0.00011778672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002680474,0.00020279855,0.0001851814,0.00013059274,0.000054048276,0.0003224419,0.000905876,0.000085773456,0.000019633972],"category_scores_gemma":[0.000019123292,0.0001823039,0.000052391966,0.00056513597,0.000017387749,0.0010685421,0.0004958615,0.00019610095,0.00020764786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002952405,0.0008188473,0.012928106,0.0005209812,0.0013232423,0.00037280674,0.010523217,0.002120698,0.00239832,0.042810515,0.29596058,0.62992746],"study_design_scores_gemma":[0.000591597,0.00012469878,0.0010542853,0.000059981307,0.000020538293,0.00003458909,0.0002993283,0.9428891,0.00022378027,0.0003619114,0.054091934,0.00024826216],"about_ca_topic_score_codex":0.00026862152,"about_ca_topic_score_gemma":0.00087429036,"teacher_disagreement_score":0.9407684,"about_ca_system_score_codex":0.00022652857,"about_ca_system_score_gemma":0.000050500887,"threshold_uncertainty_score":0.74341375},"labels":[],"label_agreement":null},{"id":"W1486636865","doi":"10.1007/3-540-45749-6_28","title":"Geometric Algorithms for Density-Based Data Clustering","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Approximation algorithm; Cluster analysis; Algorithm; Computer science; Quadratic equation; Function (biology); Mathematics; Artificial intelligence","score_opus":0.06445117085016047,"score_gpt":0.2762087730906237,"score_spread":0.21175760224046322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486636865","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.0000013721655,0.0002987408,0.9940196,0.00081714615,0.0026630654,0.00073113997,0.00008099743,0.00024609393,0.0011418149],"genre_scores_gemma":[0.0015341231,0.000046658777,0.99472165,0.0017990593,0.0007860182,0.000013999131,0.00015592958,0.00004802242,0.0008945505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994705,0.00002156534,0.0005628167,0.0026528507,0.0011491153,0.00090862956],"domain_scores_gemma":[0.99437493,0.0006389309,0.00031896782,0.0042553493,0.00022029033,0.00019154017],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014972844,0.0006077329,0.0005921655,0.002052295,0.0003634933,0.0014079572,0.011269297,0.0002464237,0.000023514503],"category_scores_gemma":[0.00016463464,0.0005858039,0.00012804136,0.0014242046,0.00037512757,0.0016195752,0.006237873,0.0005458797,0.00006667342],"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.0000026210391,0.000032139185,0.000009412006,0.00007510651,0.000014700427,0.00007003385,0.00003623556,0.011215801,0.0000048777338,0.0018601905,0.0003927071,0.98628616],"study_design_scores_gemma":[0.00043573166,0.0001323775,0.000023411807,0.00017583542,0.000017257604,0.00001649632,3.917477e-8,0.96797293,0.00015613098,0.012257977,0.01811391,0.0006979054],"about_ca_topic_score_codex":0.0000174041,"about_ca_topic_score_gemma":0.000037155893,"teacher_disagreement_score":0.98558825,"about_ca_system_score_codex":0.00021386343,"about_ca_system_score_gemma":0.00022095264,"threshold_uncertainty_score":0.99965936},"labels":[],"label_agreement":null},{"id":"W1487521718","doi":"10.1007/978-3-642-19173-2_7","title":"A Folksonomy-Based Recommendation System for the Sensor Web","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Calgary","funders":"","keywords":"Folksonomy; Computer science; Terabyte; Tag system; Geospatial analysis; Key (lock); Information retrieval; World Wide Web; Sensor web; Web resource; Data mining","score_opus":0.03169044304548255,"score_gpt":0.24056679311994608,"score_spread":0.20887635007446353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487521718","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.000001208522,0.00009198595,0.98971486,0.0020157308,0.0031843204,0.0009660963,0.00003017702,0.0002189793,0.0037766697],"genre_scores_gemma":[0.024538694,0.00002387163,0.9709274,0.0024221155,0.0009811836,0.000111695525,0.000052594252,0.000053763935,0.0008886732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735755,0.000029414388,0.00042322816,0.0012152131,0.0004459307,0.0005286933],"domain_scores_gemma":[0.99720377,0.0007226641,0.00032632984,0.001471632,0.00018685199,0.00008873883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013580684,0.00040940562,0.0003454786,0.00051458104,0.00041350536,0.00081088574,0.0038875777,0.00015759323,0.000019620973],"category_scores_gemma":[0.000041120562,0.00029815137,0.00015503206,0.0003898412,0.00028294997,0.00064805994,0.00093879533,0.0003502949,0.000054275275],"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.0000065162244,0.000014571205,0.0000056901863,0.000075402655,0.000017164097,0.00000934737,0.000111925925,0.0019232415,0.0000098989885,0.037173282,0.00020836288,0.96044457],"study_design_scores_gemma":[0.0003601462,0.00011748214,0.0000108718295,0.00020156844,0.000020876309,0.000009370889,3.323971e-7,0.9324253,0.00033999348,0.012046044,0.054037943,0.00043006882],"about_ca_topic_score_codex":0.000016919706,"about_ca_topic_score_gemma":0.00003302272,"teacher_disagreement_score":0.9600145,"about_ca_system_score_codex":0.0002328554,"about_ca_system_score_gemma":0.0003321854,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W1488044967","doi":"10.1109/easic.1990.207976","title":"A framework for performance and knowledge-based control of basic designs","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Control (management); Design knowledge; Process (computing); Quality (philosophy); Object (grammar); Expert system; Software engineering; Artificial intelligence; Programming language","score_opus":0.04736273604541713,"score_gpt":0.2582569875414832,"score_spread":0.21089425149606605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488044967","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.0013438651,0.00013096744,0.99464667,0.00042489948,0.00008642324,0.0001997173,0.0000032166138,0.000049296974,0.0031149292],"genre_scores_gemma":[0.74802274,0.0000121607645,0.2509856,0.00024701195,0.000025222374,0.000019793095,6.6391283e-7,0.0000030482686,0.0006837698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995208,0.000012060957,0.00010244233,0.00016467908,0.00006579446,0.00013425696],"domain_scores_gemma":[0.999463,0.00017561017,0.00003561339,0.00025710752,0.000034808898,0.000033829256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015771465,0.00006375434,0.00009752039,0.000057681915,0.000048440423,0.000056291763,0.00033748857,0.00002315695,0.000038764134],"category_scores_gemma":[0.000023727704,0.000052087147,0.000024856732,0.00014625865,0.00002910124,0.00029510824,0.00004035601,0.00003140922,0.000016888851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001190366,0.00020320495,0.0016970923,0.00016722597,0.000029481864,9.1166004e-7,0.00022025571,0.00005264783,0.000079010715,0.34205645,0.008841496,0.6466403],"study_design_scores_gemma":[0.00069637486,0.00016839718,0.00060490833,0.000023839953,0.000007309583,2.583541e-7,0.0000044225785,0.98882675,0.000830717,0.0017600519,0.006992244,0.00008474539],"about_ca_topic_score_codex":0.0000010243134,"about_ca_topic_score_gemma":5.993905e-7,"teacher_disagreement_score":0.98877406,"about_ca_system_score_codex":0.0000041209505,"about_ca_system_score_gemma":0.0000066727575,"threshold_uncertainty_score":0.21240522},"labels":[],"label_agreement":null},{"id":"W1489209457","doi":"","title":"Tuning QoD in stream processing engines","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Scheduling (production processes); Quality of service; Exploit; Stream processing; Response time; Database; Real-time computing; Distributed computing; Computer network; Operating system; Mathematical optimization","score_opus":0.010733023995767059,"score_gpt":0.23641036869278612,"score_spread":0.22567734469701906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489209457","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.062308896,0.00002262146,0.8815124,0.0011874086,0.00049796794,0.00009824591,4.6796626e-7,0.00036027367,0.05401169],"genre_scores_gemma":[0.8075855,0.0000015652805,0.19069546,0.000118776814,0.000060406874,0.000003625811,0.0000021552157,0.0000030950484,0.0015294334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955034,0.000003789103,0.00007219156,0.00015742754,0.000084174695,0.00013209337],"domain_scores_gemma":[0.99973077,0.000009890409,0.000015492862,0.00020847355,0.000011613242,0.000023734683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013064346,0.000049448245,0.000044739907,0.00008719867,0.00002982451,0.00022460552,0.0005055793,0.000015091838,0.00002205305],"category_scores_gemma":[0.000012083874,0.0000407466,0.00000857289,0.00025565008,0.000008793786,0.000978425,0.0002025052,0.00008643902,0.000027387601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.390913e-7,0.000033848,0.0030779066,0.000009930288,0.0000013251858,0.000012862019,0.00016124565,0.0000126476125,0.0010728731,0.0457527,0.0005097775,0.94935465],"study_design_scores_gemma":[0.00028729707,0.000017303239,0.010681641,0.000020577761,0.0000014889156,0.0000033321867,0.00006789126,0.9613341,0.0017571432,0.0027588236,0.022844397,0.00022597439],"about_ca_topic_score_codex":0.000025164403,"about_ca_topic_score_gemma":0.00007432765,"teacher_disagreement_score":0.9613215,"about_ca_system_score_codex":0.0000025946897,"about_ca_system_score_gemma":0.000011171892,"threshold_uncertainty_score":0.21658762},"labels":[],"label_agreement":null},{"id":"W1490413238","doi":"10.1007/978-3-642-12098-5_5","title":"Dynamic Skyline Queries in Large Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":36,"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":"Skyline; Computer science; Pruning; Euclidean space; Graph; Set (abstract data type); Query optimization; Data mining; Spatial query; Metric space; Theoretical computer science; Algorithm; Web search query; Sargable; Information retrieval; Search engine; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.008112831594243572,"score_gpt":0.23515278624070535,"score_spread":0.22703995464646176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490413238","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.00014208205,0.0002684367,0.9923357,0.0010114814,0.0026491245,0.00035946158,0.000020129404,0.00017872706,0.0030349041],"genre_scores_gemma":[0.054180555,0.00018772969,0.9412814,0.0022891127,0.00024622728,0.000018512339,0.000058641206,0.000055807992,0.0016820657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960495,0.00002453704,0.0005343646,0.0016543097,0.00087277085,0.00086449017],"domain_scores_gemma":[0.99753,0.00018618278,0.00022396598,0.0018172576,0.000108605054,0.0001339865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011268966,0.0005384788,0.0005193007,0.0015447163,0.00020752382,0.00076634076,0.005042604,0.00032254535,0.000041432046],"category_scores_gemma":[0.00006340121,0.00049690425,0.00011651277,0.0010072383,0.0005999933,0.0013326067,0.0028994598,0.0013062181,0.00006976349],"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.000005317044,0.0000960144,0.00024894823,0.000063796906,0.0000128689535,0.0003952371,0.00064638467,0.0013390861,0.0002196993,0.17075206,0.000031322954,0.8261893],"study_design_scores_gemma":[0.0005156895,0.00011881064,0.0009909372,0.00028480522,0.0000062239897,0.000029910534,2.5816902e-7,0.5702197,0.00028148713,0.41291034,0.013651281,0.0009905483],"about_ca_topic_score_codex":0.000030690993,"about_ca_topic_score_gemma":0.0015853968,"teacher_disagreement_score":0.8251987,"about_ca_system_score_codex":0.0001337569,"about_ca_system_score_gemma":0.00023231217,"threshold_uncertainty_score":0.99974823},"labels":[],"label_agreement":null},{"id":"W1491134956","doi":"","title":"Mobile services discovery and selection in the publish/subscribe paradigm","year":2004,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Data Management and Algorithms","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; Roaming; Matching (statistics); Service discovery; ENCODE; Service (business); Preference; Encoding (memory); Publication; Value (mathematics); Selection (genetic algorithm); Information retrieval; Personalization; Service provider; Computer network; World Wide Web; Web service; Artificial intelligence; Machine learning; Mathematics","score_opus":0.06744222156279532,"score_gpt":0.37136164871072375,"score_spread":0.3039194271479284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491134956","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.7978428,0.012217557,0.04556173,0.113584615,0.0021682656,0.020940073,0.0007097671,0.00020243062,0.006772776],"genre_scores_gemma":[0.99599487,0.0012335855,0.0017636883,0.000096523014,0.000030441917,0.0003025272,0.0000042074375,0.000005741413,0.00056844665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833477,0.00024125664,0.00019723241,0.00038040412,0.0004999036,0.00034643945],"domain_scores_gemma":[0.99849266,0.00039845958,0.00010416119,0.00030905646,0.0006681967,0.000027457336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009606115,0.00012927395,0.0001936627,0.00012512709,0.00041221266,0.00045656614,0.0012166321,0.000025251662,6.1591123e-7],"category_scores_gemma":[0.00024685304,0.00007256369,0.000030051417,0.0015879311,0.0002792154,0.0015207747,0.00054545206,0.00019550353,0.0000014284042],"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.00016877953,0.00036050894,0.0005247038,0.00029243817,0.00012286368,0.000003663404,0.025242295,0.00227521,0.0009316102,0.9475343,0.0015918498,0.020951744],"study_design_scores_gemma":[0.008640018,0.004045391,0.007572676,0.0019166238,0.00004394093,0.0000034415605,0.24633448,0.012087615,0.03960052,0.58377904,0.09496716,0.0010091132],"about_ca_topic_score_codex":0.00001551274,"about_ca_topic_score_gemma":0.0007068511,"teacher_disagreement_score":0.36375532,"about_ca_system_score_codex":0.00010268296,"about_ca_system_score_gemma":0.00014518872,"threshold_uncertainty_score":0.44026777},"labels":[],"label_agreement":null},{"id":"W1491296979","doi":"10.1007/11935148_17","title":"Integrating Data from Maps on the World-Wide Web","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Completeness (order theory); Data mining; Precision and recall; Process (computing); Information retrieval; Data integration; Mathematics","score_opus":0.033943154934804716,"score_gpt":0.25342368495600515,"score_spread":0.21948053002120044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491296979","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.000009413707,0.00016479136,0.9535081,0.0048856786,0.0020921077,0.00034705218,0.00013358642,0.00018066505,0.03867864],"genre_scores_gemma":[0.014896797,0.00004548533,0.95579475,0.015884029,0.0026152963,0.00001736303,0.0006882575,0.00008806165,0.009969978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995443,0.00005487808,0.0005017537,0.0021519214,0.0012304134,0.0006180455],"domain_scores_gemma":[0.9927328,0.0018302263,0.00030754006,0.0049522948,0.000086550244,0.00009053847],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001306782,0.00056047685,0.00040892774,0.0006811865,0.0003843112,0.0019985766,0.015286662,0.00013162078,0.00006469747],"category_scores_gemma":[0.00016824197,0.00037969812,0.0000842093,0.00085615396,0.0005347498,0.0012133357,0.0074221333,0.0010846098,0.00023990785],"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.000004252111,0.0000494402,0.00008015874,0.00001459439,0.000030467994,0.0001802964,0.00013870496,0.003988324,0.000030559022,0.12135595,0.0365231,0.83760417],"study_design_scores_gemma":[0.00014690861,0.000046632886,0.00006744798,0.00044406916,0.000010094826,0.000003045693,1.8711378e-7,0.7562989,0.0001570529,0.15143141,0.090823606,0.0005706244],"about_ca_topic_score_codex":0.00011895826,"about_ca_topic_score_gemma":0.0012019486,"teacher_disagreement_score":0.8370335,"about_ca_system_score_codex":0.00015085666,"about_ca_system_score_gemma":0.00023988224,"threshold_uncertainty_score":0.9998655},"labels":[],"label_agreement":null},{"id":"W1492345494","doi":"10.24297/ijct.v14i4.1962","title":"An Ameliorated Methodology for Ranking the Tuple","year":2015,"lang":"en","type":"article","venue":"INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY","topic":"Data Management and Algorithms","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":"Horizon College and Seminary","funders":"","keywords":"Ranking (information retrieval); Computer science; Tuple; Information retrieval; Web search query; Query optimization; Sorting; Task (project management); Sargable; Web query classification; Query expansion; Query language; View; Database; Search engine; Database design; Mathematics","score_opus":0.0873100512517525,"score_gpt":0.362472441262074,"score_spread":0.2751623900103215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492345494","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.00984952,0.00012179669,0.96861595,0.017423054,0.0037448932,0.0000948288,0.0000023423713,0.00009202153,0.000055584645],"genre_scores_gemma":[0.4343399,0.000014258009,0.5641997,0.0009979863,0.000410456,0.0000051975435,0.000004767213,0.000007466917,0.000020241458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885815,0.00010564233,0.00037038117,0.00016996123,0.00032258383,0.00017329346],"domain_scores_gemma":[0.9981795,0.00020004627,0.0003734416,0.0003252262,0.00086679356,0.000054983262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013860331,0.00009849813,0.00018838151,0.0005812359,0.00004860681,0.00020040238,0.0043336875,0.0000682546,0.0000019209103],"category_scores_gemma":[0.00017120974,0.000069969785,0.00007390778,0.0003413984,0.00009487355,0.0007237229,0.00039463482,0.00018887481,0.0000054972543],"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.00010951308,0.00014057054,0.0010461453,0.0000029002713,0.0004328809,0.00017056614,0.00055837765,0.0039027494,0.0010228012,0.25780794,0.01587895,0.7189266],"study_design_scores_gemma":[0.0043769833,0.0017020055,0.00078464125,0.00006127201,0.000053354765,0.0014558124,0.00051643304,0.34238374,0.006198081,0.41376686,0.22831628,0.0003845317],"about_ca_topic_score_codex":0.0000059381423,"about_ca_topic_score_gemma":0.0000026874854,"teacher_disagreement_score":0.7185421,"about_ca_system_score_codex":0.000065220236,"about_ca_system_score_gemma":0.00008457618,"threshold_uncertainty_score":0.8053142},"labels":[],"label_agreement":null},{"id":"W1493904710","doi":"10.5539/cis.v8n3p119","title":"Handling Uncertainty in Database: An Introduction and Brief Survey","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"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; Uncertain data; Key (lock); Database; Data administration; Data mining; Data management; Search engine indexing; Database design; Information retrieval; Data science; Database model","score_opus":0.037896907907580026,"score_gpt":0.274460504861961,"score_spread":0.23656359695438098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493904710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08610954,0.00001887191,0.91232455,0.0005256861,0.0005646564,0.00009982799,0.000006076733,0.0000512694,0.00029950982],"genre_scores_gemma":[0.9156826,0.000050767856,0.083026625,0.0009258074,0.00016994824,0.000004082156,0.00012872658,0.0000020110774,0.000009411762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908733,0.000037239803,0.00018815529,0.00023399622,0.00028765012,0.00016562101],"domain_scores_gemma":[0.99936455,0.00002091572,0.000056590347,0.00030843297,0.000116594165,0.00013291505],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0022569357,0.00006921568,0.0000747131,0.00030208123,0.00012363688,0.0011167508,0.0004952137,0.000013473031,6.6482517e-7],"category_scores_gemma":[0.000078389996,0.000061482046,0.000003762958,0.00082596863,0.00014240235,0.029691583,0.0006062636,0.0000585469,0.000004457945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013006592,0.000037727663,0.008926238,0.000024585092,0.0000024168025,0.000001624842,0.004170875,0.0034532717,0.00005478269,0.09627906,0.002465806,0.8845706],"study_design_scores_gemma":[0.00034508744,0.00005868644,0.054842815,0.000005364156,4.8152503e-7,0.000008557767,0.00005236117,0.9347333,0.00004927885,0.00017878917,0.009624231,0.00010105034],"about_ca_topic_score_codex":0.00012552495,"about_ca_topic_score_gemma":0.000016059432,"teacher_disagreement_score":0.93128,"about_ca_system_score_codex":0.000019049723,"about_ca_system_score_gemma":0.00006543626,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W1494905438","doi":"10.1007/978-3-540-85128-8_6","title":"Constructive Path Planning for Natural Phenomena Modeling","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Data Management and Algorithms","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":"Motion planning; Constructive; Randomness; Computer science; Artificial intelligence; Path (computing); Robotics; Any-angle path planning; Roulette; Mathematical optimization; Shortest path problem; Theoretical computer science; Graph; Process (computing); Algorithm; Robot; Mathematics","score_opus":0.14382780630123568,"score_gpt":0.35566330468604984,"score_spread":0.21183549838481416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494905438","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.0000051583384,0.0077220714,0.9617016,0.0001240424,0.001939251,0.00045409094,0.000048658145,0.00008851378,0.027916629],"genre_scores_gemma":[0.052238423,0.0039097983,0.9011068,0.00087261375,0.0015407556,0.0001930448,0.00041172278,0.000099031924,0.039627854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799496,0.000013124771,0.00054322125,0.0007357604,0.0004144641,0.0002984853],"domain_scores_gemma":[0.9984776,0.00060191547,0.00021587894,0.0002653766,0.00040174183,0.000037536032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002114114,0.0003557799,0.00044041398,0.0002978227,0.00023709836,0.000076490396,0.00091788865,0.00007245818,0.0000039133492],"category_scores_gemma":[0.0000676305,0.0003548961,0.00011653621,0.00010041778,0.00027384647,0.00042697263,0.00076698867,0.0003189379,0.000023625991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009593977,0.000010404837,0.000002420343,0.00006756292,0.00018778791,0.00005252983,0.0017077959,0.35318828,3.3061678e-8,0.6002092,0.0017814941,0.042782947],"study_design_scores_gemma":[0.000078077275,0.000037539136,0.0000010656478,0.00027131633,0.000008153797,0.000012854738,0.00019941355,0.678195,6.9264564e-7,0.31652436,0.0043768287,0.00029471374],"about_ca_topic_score_codex":0.0000026568375,"about_ca_topic_score_gemma":0.0000014624752,"teacher_disagreement_score":0.32500672,"about_ca_system_score_codex":0.00018196594,"about_ca_system_score_gemma":0.00008504061,"threshold_uncertainty_score":0.9998903},"labels":[],"label_agreement":null},{"id":"W1495160560","doi":"10.1007/978-3-540-30466-1_3","title":"Modeling Geospatial Databases with Plug-Ins for Visual Languages: A Pragmatic Approach and the Impacts of 16 Years of Research and Experimentations on Perceptory","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"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é Laval","funders":"","keywords":"Geospatial analysis; Rotation formalisms in three dimensions; Computer science; Unified Modeling Language; Database; Geospatial PDF; Plug-in; Data science; Software engineering; Programming language; Geography; Software; Cartography","score_opus":0.04313467398315612,"score_gpt":0.3443264711299999,"score_spread":0.3011917971468438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495160560","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.0049887253,0.00023227397,0.99363136,0.00009311456,0.000060409733,0.0007128338,0.000024195277,0.000016396629,0.00024071326],"genre_scores_gemma":[0.65832824,0.000042373158,0.3413736,0.00009093616,0.0000777384,0.000024360617,0.000025318097,0.000013290536,0.000024176552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821836,0.00003553899,0.000239264,0.0005834697,0.0006701839,0.00025320787],"domain_scores_gemma":[0.99859285,0.0005776737,0.00011577718,0.0005334222,0.00012714417,0.000053103886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010285007,0.00017204853,0.00028049675,0.0004567638,0.00014622614,0.00017846133,0.00085007487,0.000045223755,0.0000014646981],"category_scores_gemma":[0.00007305476,0.000117515694,0.000027723305,0.00025942735,0.0011490395,0.00040680153,0.00072257844,0.00022698665,2.6496323e-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.0003026481,0.00043565294,0.000072339215,0.0012403163,0.00013407425,0.000024254008,0.03272087,0.107091896,0.00033704052,0.4129591,0.000025397805,0.4446564],"study_design_scores_gemma":[0.0012039341,0.00054527586,0.0000475909,0.00062224234,0.000012015564,0.000007735366,0.000039951432,0.9862729,0.00035974773,0.010687579,0.000009326864,0.00019173071],"about_ca_topic_score_codex":0.00024166498,"about_ca_topic_score_gemma":0.000065489825,"teacher_disagreement_score":0.87918097,"about_ca_system_score_codex":0.00006264895,"about_ca_system_score_gemma":0.00019978489,"threshold_uncertainty_score":0.4792151},"labels":[],"label_agreement":null},{"id":"W1496437917","doi":"","title":"Modeling location-based services with subject spaces","year":2003,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Data Management and Algorithms","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; Pager; Publication; Location-based service; Context (archaeology); Mobile computing; Mobile device; Ubiquitous computing; Computer network; World Wide Web; Human–computer interaction","score_opus":0.08792687399602565,"score_gpt":0.3692779066140036,"score_spread":0.28135103261797795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496437917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10436409,0.004510727,0.84179294,0.028459871,0.0012720766,0.009055159,0.00029158095,0.00024595452,0.010007606],"genre_scores_gemma":[0.9782179,0.00013465018,0.020669283,0.00005165346,0.000013174309,0.00012237988,0.0000045549077,0.000009600119,0.0007767778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980452,0.0002834068,0.00019542158,0.00044079399,0.00064595655,0.00038923896],"domain_scores_gemma":[0.99434626,0.0005075408,0.00011360043,0.00065565686,0.004327107,0.000049827955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082179805,0.00016387552,0.0002382802,0.00013357615,0.0005171373,0.00018192994,0.0010816464,0.000023577746,0.0000023924756],"category_scores_gemma":[0.00051561446,0.00009977292,0.00003281065,0.0018528757,0.00023186629,0.000438259,0.00020914694,0.00013664909,0.000003960575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034135554,0.0003150919,0.00049789075,0.0007441624,0.00031720675,0.000003321624,0.004714015,0.2506705,0.00056159357,0.73360395,0.0005981212,0.007632804],"study_design_scores_gemma":[0.0031584557,0.001136651,0.0000490508,0.0015099843,0.000029379431,2.7793956e-7,0.059826665,0.8323063,0.073984176,0.017007912,0.010447417,0.0005436819],"about_ca_topic_score_codex":0.000006794243,"about_ca_topic_score_gemma":0.00034008955,"teacher_disagreement_score":0.87385386,"about_ca_system_score_codex":0.00008611084,"about_ca_system_score_gemma":0.00042761065,"threshold_uncertainty_score":0.40686217},"labels":[],"label_agreement":null},{"id":"W1497284170","doi":"","title":"Spatio-Temporal Approximate Reasoning over Complex Objects","year":2005,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","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 Manitoba","funders":"","keywords":"Computer science; Domain (mathematical analysis); Context (archaeology); Artificial intelligence; Theoretical computer science; Data mining; Mathematics; Geography","score_opus":0.02291557565412861,"score_gpt":0.2590175512023282,"score_spread":0.23610197554819962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497284170","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.037800368,0.00005173125,0.7404715,0.0021580947,0.0007282084,0.0010045378,0.00005516884,0.0011537987,0.21657662],"genre_scores_gemma":[0.5548413,0.000011684061,0.43959588,0.0036239736,0.00019348439,0.000036305002,0.00033065438,0.000014475755,0.0013522563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842614,0.000022232269,0.00044207997,0.0002160559,0.00045396545,0.00043951636],"domain_scores_gemma":[0.99893034,0.000028666687,0.00018576355,0.000698482,0.00002937332,0.00012739205],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033808424,0.00019311975,0.0001873035,0.00015185478,0.00020261163,0.000834118,0.001066726,0.000035327725,0.00044371578],"category_scores_gemma":[0.000018908599,0.00017675484,0.00006219386,0.00032993648,0.000047508758,0.004518323,0.00076734554,0.00011842383,0.001084053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028154573,0.00034970263,0.009235772,0.0002836419,0.00017750134,0.000021559808,0.00903388,0.00046912883,0.000040914412,0.3224774,0.21466665,0.4432157],"study_design_scores_gemma":[0.00066812563,0.000055013184,0.0035477723,0.000035554032,0.00000789856,0.000007817239,0.00017705277,0.6471873,0.00012203078,0.00042653142,0.3474691,0.00029585222],"about_ca_topic_score_codex":0.000028629674,"about_ca_topic_score_gemma":0.000018391625,"teacher_disagreement_score":0.64671814,"about_ca_system_score_codex":0.00008881593,"about_ca_system_score_gemma":0.000028689823,"threshold_uncertainty_score":0.9996937},"labels":[],"label_agreement":null},{"id":"W1497709229","doi":"","title":"Seeking stable clusters in the blogosphere","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Waterloo; University of Toronto","funders":"","keywords":"Blogosphere; Computer science; Popularity; Intuition; Context (archaeology); Set (abstract data type); Geolocation; Event (particle physics); Information retrieval; Data mining; Theoretical computer science; Data science; World Wide Web; The Internet","score_opus":0.014809310064884687,"score_gpt":0.24113365580255747,"score_spread":0.2263243457376728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497709229","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.0027420844,0.000020004712,0.84615433,0.0010685471,0.00013714626,0.00007513152,1.3798055e-7,0.000052023068,0.14975059],"genre_scores_gemma":[0.8724309,0.000008913969,0.11451887,0.0055931294,0.00009002568,0.0000040202626,0.0000033389854,0.0000050653766,0.007345714],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993995,0.000015804257,0.00008975837,0.0001384766,0.0001517197,0.00020478561],"domain_scores_gemma":[0.99957925,0.000054416887,0.000016634158,0.00032789717,0.0000063210978,0.000015454269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092560117,0.000045459165,0.000038470644,0.000031267457,0.00004552663,0.00018850321,0.0009416996,0.000011691435,0.00002912255],"category_scores_gemma":[0.0000053483527,0.000028592309,0.000013319253,0.00035670237,0.0000099899025,0.00051585445,0.00022487919,0.00005741149,0.000054827444],"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.0000036860947,0.00012343125,0.0073331594,0.000015120126,0.000012706633,0.00019938836,0.0019688222,0.00014618108,0.00006420888,0.41902217,0.04625614,0.524855],"study_design_scores_gemma":[0.0011724263,0.00010363059,0.045180287,0.00003276387,0.000007621221,0.000018350835,0.0044935434,0.43528548,0.0003683171,0.0090492675,0.50370413,0.00058420905],"about_ca_topic_score_codex":0.0000825269,"about_ca_topic_score_gemma":0.00024329284,"teacher_disagreement_score":0.8696888,"about_ca_system_score_codex":0.000010147964,"about_ca_system_score_gemma":0.0000047485228,"threshold_uncertainty_score":0.18177408},"labels":[],"label_agreement":null},{"id":"W1497909917","doi":"10.1007/978-3-540-45227-0_59","title":"Efficient Indexing of High Dimensional Normalized Histograms","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Search engine indexing; Histogram; Computer science; Nearest neighbor search; R-tree; Similarity (geometry); Tree (set theory); k-nearest neighbors algorithm; Indexation; Feature (linguistics); Constraint (computer-aided design); Data structure; Feature vector; Data mining; Pattern recognition (psychology); Information retrieval; Artificial intelligence; Spatial analysis; Image (mathematics); Mathematics; Spatial database; Combinatorics","score_opus":0.012396481116063937,"score_gpt":0.22114698413863004,"score_spread":0.2087505030225661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497909917","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.00016175298,0.00030906644,0.9926923,0.00029356492,0.0025229515,0.00032024446,0.000008643842,0.00009424197,0.003597242],"genre_scores_gemma":[0.10251212,0.000017917979,0.8947014,0.0016514447,0.00021944384,0.0000080499185,0.000022091264,0.00003993652,0.00082758314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598116,0.000035080462,0.0006225941,0.0013406486,0.001408018,0.000612523],"domain_scores_gemma":[0.9975589,0.00020838929,0.00041576332,0.0014623383,0.0002136162,0.00014101408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009789636,0.0004734673,0.000588363,0.0009358306,0.00018746582,0.0002723105,0.003227532,0.00019644988,0.000030793766],"category_scores_gemma":[0.000049185932,0.00042704746,0.00014706489,0.00077092845,0.00066921726,0.0003166759,0.0019300901,0.0005096498,0.000026489124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007987295,0.000101370686,0.000024482986,0.000067030276,0.000026951288,0.00011104461,0.00026360407,0.15546712,0.00012807387,0.1547682,0.000098790464,0.68893534],"study_design_scores_gemma":[0.0007250735,0.00019639984,0.00007958168,0.00044041572,0.000018762094,0.00004030989,1.1443353e-7,0.926024,0.0013470508,0.06560641,0.00459443,0.0009274479],"about_ca_topic_score_codex":0.000040815397,"about_ca_topic_score_gemma":0.000013250416,"teacher_disagreement_score":0.77055687,"about_ca_system_score_codex":0.00020343429,"about_ca_system_score_gemma":0.00022238825,"threshold_uncertainty_score":0.99981815},"labels":[],"label_agreement":null},{"id":"W1499353052","doi":"10.1007/978-3-642-12156-2_31","title":"Ordered Polyline Trees for Efficient Search of Objects Moving on a Graph","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Rectangle; Computer science; Graph; Combinatorics; Object (grammar); Data structure; Line segment; Interval (graph theory); Bounding overwatch; Mathematics; Algorithm; Artificial intelligence; Geometry","score_opus":0.019174590125179785,"score_gpt":0.25854840263300716,"score_spread":0.23937381250782738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499353052","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.0003372626,0.00012071865,0.9951732,0.00048470098,0.0016106744,0.0007268766,0.000029925728,0.00010248853,0.0014141242],"genre_scores_gemma":[0.16027519,0.000027039694,0.8377772,0.0007705227,0.00050734676,0.000020465615,0.000025705553,0.0000478847,0.0005486505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962742,0.000020990961,0.00048700388,0.0014330628,0.0011071037,0.0006776949],"domain_scores_gemma":[0.9971387,0.0006069079,0.0002577625,0.0015985547,0.00026384185,0.00013424248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011303957,0.00045241843,0.0005199641,0.0014030082,0.0002418162,0.00040274262,0.004066019,0.00022713358,0.00001057936],"category_scores_gemma":[0.00011181222,0.0003890661,0.00017985787,0.0007768821,0.00059189246,0.0002901872,0.0015543369,0.00065441907,0.000010570595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023176377,0.00012913614,0.000011994119,0.00011507134,0.00002466076,0.000031511197,0.0007245193,0.04851789,0.001687751,0.04449783,0.00002060324,0.9042159],"study_design_scores_gemma":[0.00068273616,0.0006221917,0.00010479261,0.00045768643,0.000012967288,0.000009325771,5.120003e-7,0.9364077,0.01499968,0.0451823,0.0008369524,0.00068315095],"about_ca_topic_score_codex":0.000028938299,"about_ca_topic_score_gemma":0.00010656874,"teacher_disagreement_score":0.9035327,"about_ca_system_score_codex":0.0000749377,"about_ca_system_score_gemma":0.00029102893,"threshold_uncertainty_score":0.9998561},"labels":[],"label_agreement":null},{"id":"W1500551073","doi":"10.1007/978-3-642-10649-1_4","title":"Connecting the Dots: Constructing Spatiotemporal Episodes from Events Schemas","year":2009,"lang":"en","type":"book-chapter","venue":"Transactions on computational science","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Event (particle physics); Consistency (knowledge bases); Data mining; Path (computing); Tree (set theory); Hierarchical database model; Constraint (computer-aided design); Interval (graph theory); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.026211271901109872,"score_gpt":0.25680099901123066,"score_spread":0.2305897271101208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500551073","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.00011643901,0.00004622194,0.9461481,0.0018663711,0.0007269151,0.00028828377,0.00007824474,0.00020830786,0.050521106],"genre_scores_gemma":[0.22376534,0.00004543129,0.75051266,0.0015230011,0.0003830343,0.00001809422,0.00014040605,0.00005001205,0.023561992],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997059,0.000029802084,0.00042846918,0.00089217845,0.0012592972,0.0003312378],"domain_scores_gemma":[0.99823844,0.00049474504,0.0003338004,0.00060204143,0.00021454823,0.00011644812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061610487,0.00032051207,0.000241397,0.0003138648,0.0012958078,0.00048517043,0.001857158,0.000086644824,0.00015883024],"category_scores_gemma":[0.000024868574,0.00026558113,0.00013515109,0.00035895652,0.00032999576,0.0012278263,0.000064378335,0.0004916202,0.00019427473],"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.000004274592,0.00003277235,0.0000023102762,0.0000047142553,0.00004222427,0.000008502971,0.00018376381,0.023468224,0.00001170664,0.3591953,0.00005967085,0.6169865],"study_design_scores_gemma":[0.00073727046,0.0001716476,0.00033197209,0.0004265529,0.00007751657,0.00004725795,0.0001266608,0.44568488,0.0003966911,0.5231378,0.02773937,0.0011224067],"about_ca_topic_score_codex":0.000053134012,"about_ca_topic_score_gemma":0.000021455302,"teacher_disagreement_score":0.6158641,"about_ca_system_score_codex":0.00015454342,"about_ca_system_score_gemma":0.00025587238,"threshold_uncertainty_score":0.9999796},"labels":[],"label_agreement":null},{"id":"W1500796099","doi":"10.1007/3-540-36151-0_12","title":"An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Constant (computer programming); Algorithm; Combinatorics; Approx; Running time; Computer science; Mathematics; Discrete mathematics; Mathematical optimization","score_opus":0.024134354590971633,"score_gpt":0.2595262473964646,"score_spread":0.235391892805493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500796099","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.000032588152,0.00013882935,0.99578446,0.00025415796,0.0020617258,0.0008275426,0.000033705113,0.00023903136,0.0006279745],"genre_scores_gemma":[0.0038971512,0.000013504859,0.99381316,0.0008193942,0.00051754713,0.000027618682,0.00006914292,0.00004630029,0.0007961901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955731,0.000034536544,0.0006104681,0.0019769818,0.0009291324,0.00087575795],"domain_scores_gemma":[0.99693894,0.00057620055,0.0003598579,0.0016649336,0.00025748493,0.00020258775],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008537775,0.00058030366,0.00053204875,0.00084021053,0.0006439285,0.00351431,0.003471176,0.00027670426,0.000032571417],"category_scores_gemma":[0.00010205079,0.0005478672,0.00015708727,0.00063265953,0.0005445959,0.0014800618,0.00071217306,0.00041388703,0.000027533437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022127167,0.00007163276,0.0000023973832,0.000020155698,0.000009114492,0.000024084919,0.00038275897,0.05947757,0.000028842976,0.001995004,0.000069751186,0.93791646],"study_design_scores_gemma":[0.0004488956,0.00021046471,0.000023293778,0.00017992638,0.000015055584,0.00001524222,2.0491116e-7,0.9791775,0.00075579126,0.015333166,0.0031619493,0.0006785271],"about_ca_topic_score_codex":0.0000127087915,"about_ca_topic_score_gemma":0.000008101059,"teacher_disagreement_score":0.9372379,"about_ca_system_score_codex":0.00021847566,"about_ca_system_score_gemma":0.00020448423,"threshold_uncertainty_score":0.99969727},"labels":[],"label_agreement":null},{"id":"W1507246359","doi":"10.1016/b978-012088469-8.50128-5","title":"Efficient Constraint Processing for Highly Personalized Location Based Services","year":2004,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Constraint (computer-aided design); Engineering; Mechanical engineering","score_opus":0.015810502446586456,"score_gpt":0.2379889543604717,"score_spread":0.22217845191388524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507246359","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.000004261353,0.000765324,0.21239096,0.00042704292,0.00046025185,0.0014482758,0.000063148094,0.00031155703,0.7841292],"genre_scores_gemma":[0.0040123635,0.000007802639,0.10165151,0.0017155096,0.00038043846,0.00019414985,0.00027964928,0.0000884311,0.89167017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980349,0.000012908307,0.00039092058,0.0007620628,0.00046568367,0.000333513],"domain_scores_gemma":[0.99861985,0.000040432362,0.00036065435,0.0006222358,0.00025456486,0.00010228546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003495368,0.00040133458,0.0003687321,0.00021515987,0.00022012094,0.0004686158,0.0010735684,0.0001569146,0.000029021056],"category_scores_gemma":[0.0000047548633,0.0003763214,0.00017197765,0.000037240025,0.0001415085,0.000114500996,0.00020561965,0.0001696147,0.000060031613],"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.0000061505143,0.000013948275,1.2637143e-7,0.000745137,0.000028107346,0.000008434497,0.00018845762,0.0001623511,0.000004964521,0.1266821,0.000015174148,0.87214506],"study_design_scores_gemma":[0.0013750147,0.0000942229,0.000002885249,0.00197034,0.0001227805,0.0000042106376,0.00001719305,0.13320297,0.00005436714,0.0180005,0.8444051,0.00075039745],"about_ca_topic_score_codex":6.9570024e-7,"about_ca_topic_score_gemma":0.0000037991545,"teacher_disagreement_score":0.87139463,"about_ca_system_score_codex":0.00014359843,"about_ca_system_score_gemma":0.00037226055,"threshold_uncertainty_score":0.99986887},"labels":[],"label_agreement":null},{"id":"W1507738160","doi":"10.1109/icde.1992.213182","title":"Distance-associated join indices for spatial range search","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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","funders":"","keywords":"Join (topology); Search engine indexing; Computer science; Index (typography); Range (aeronautics); Data mining; Spatial database; Spatial analysis; Range query (database); Information retrieval; Theoretical computer science; Mathematics; Statistics; Search engine; Combinatorics; World Wide Web; Engineering","score_opus":0.02856134253859242,"score_gpt":0.2641502726120932,"score_spread":0.23558893007350076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507738160","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.002192547,0.000023379498,0.9783868,0.00041194388,0.00027903,0.00024271062,0.00001130444,0.00012154621,0.018330693],"genre_scores_gemma":[0.8946578,0.000019615072,0.08760378,0.0005748301,0.000095622985,0.000055290795,0.000050890278,0.000013117686,0.016929055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991408,0.000039813134,0.000109317414,0.0002422283,0.00020826107,0.0002595738],"domain_scores_gemma":[0.9995718,0.000058986065,0.000032489177,0.000253284,0.000036957466,0.00004649455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044463412,0.00007372293,0.000089821864,0.000059266353,0.000109230365,0.00024417252,0.00052783464,0.000024902061,0.00006625235],"category_scores_gemma":[0.000048308906,0.000062020496,0.000038916347,0.0002392175,0.000017621083,0.0005061172,0.000100366036,0.000043323907,0.000049765684],"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.000009160306,0.00027083664,0.00839847,0.000038335107,0.00007893301,0.000010288839,0.0004768136,0.000012445536,0.000053799562,0.7944512,0.04826075,0.14793903],"study_design_scores_gemma":[0.00738407,0.0006630015,0.030257817,0.000056643097,0.000043027438,0.0000017219664,0.0003213298,0.26060295,0.006588213,0.031987786,0.660686,0.0014074207],"about_ca_topic_score_codex":0.00009516132,"about_ca_topic_score_gemma":0.00016995227,"teacher_disagreement_score":0.89246523,"about_ca_system_score_codex":0.000022189815,"about_ca_system_score_gemma":0.000021206954,"threshold_uncertainty_score":0.25291225},"labels":[],"label_agreement":null},{"id":"W1508458705","doi":"10.1007/11766247_13","title":"On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 British Columbia","funders":"","keywords":"Computer science; Quality (philosophy); Artificial intelligence; Theoretical computer science","score_opus":0.05624935494597458,"score_gpt":0.3175180439768304,"score_spread":0.26126868903085587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508458705","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.0006533936,0.000118242206,0.9969512,0.0008234901,0.00039972615,0.0007000857,0.000025078993,0.000023006138,0.0003057752],"genre_scores_gemma":[0.87295246,0.000021720785,0.12607022,0.00067510596,0.000118360746,0.000018099108,0.000013723051,0.000017548173,0.00011277633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732584,0.000065612854,0.00049185887,0.000911822,0.00081531185,0.00038955206],"domain_scores_gemma":[0.9941122,0.004558867,0.00016119037,0.0009865875,0.00012230576,0.000058872534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028656316,0.00026803833,0.00043529697,0.0005411746,0.00017230243,0.00028819992,0.0023033367,0.00011694274,0.000003025604],"category_scores_gemma":[0.0002501533,0.00018561076,0.00008409675,0.00045490172,0.0008603271,0.0003078271,0.0012262866,0.0004082228,0.000004444308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045700526,0.00005991238,0.000057917907,0.000031182783,0.000008318569,0.000009770202,0.00021280609,0.14335078,0.000016564905,0.28551686,0.000076247205,0.5706139],"study_design_scores_gemma":[0.0007443613,0.00014421328,0.00089825055,0.00027165774,0.0000042585175,0.0000025687139,3.7204094e-7,0.78536135,0.00011235174,0.2121305,0.000078969075,0.00025115165],"about_ca_topic_score_codex":0.00012390286,"about_ca_topic_score_gemma":0.00029990383,"teacher_disagreement_score":0.8722991,"about_ca_system_score_codex":0.000083633895,"about_ca_system_score_gemma":0.0001538767,"threshold_uncertainty_score":0.7568987},"labels":[],"label_agreement":null},{"id":"W1508670223","doi":"10.1016/b978-012088469-8.50127-3","title":"A-ToPSS","year":2004,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science","score_opus":0.01574671368467904,"score_gpt":0.22397339214054648,"score_spread":0.20822667845586745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508670223","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":[1.966788e-7,0.00035735525,0.0033724827,0.00020431237,0.00088811206,0.00029878522,0.000015894455,0.00028466646,0.9945782],"genre_scores_gemma":[0.000027059155,0.000059862974,0.012385691,0.0006986415,0.00034688757,0.0000124884045,0.000027385768,0.000041513547,0.9864005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828476,0.0000084648555,0.00030076664,0.00066178164,0.000428902,0.00031534038],"domain_scores_gemma":[0.99828357,0.00001723428,0.00016746188,0.0013698672,0.00004740702,0.00011447795],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001726737,0.00036974516,0.00033457356,0.00017893853,0.00009988322,0.0003055798,0.0019215826,0.00016696111,0.00019849559],"category_scores_gemma":[0.0000037629984,0.00034928368,0.00018576482,0.000017646127,0.00007214876,0.00023876794,0.0009993066,0.0003252185,0.0016238984],"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":[3.232588e-7,0.0000023304187,1.0460295e-7,0.000017812243,0.000024986837,0.00006382718,0.00002868552,3.0095396e-7,4.1836685e-7,0.3855594,0.00032929162,0.6139725],"study_design_scores_gemma":[0.00015238518,0.000026976315,0.0000027551991,0.00014633664,0.000021444575,0.000006158481,4.6423906e-7,0.000039352944,0.000008625338,0.18105197,0.81819385,0.0003496714],"about_ca_topic_score_codex":3.592393e-7,"about_ca_topic_score_gemma":0.000003116153,"teacher_disagreement_score":0.8178646,"about_ca_system_score_codex":0.00008190284,"about_ca_system_score_gemma":0.000098246084,"threshold_uncertainty_score":0.99989593},"labels":[],"label_agreement":null},{"id":"W1509825211","doi":"10.14778/2733085.2733099","title":"Generating top-k packages via preference elicitation","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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 British Columbia","funders":"","keywords":"Computer science; Recommender system; Preference elicitation; Ranking (information retrieval); Function (biology); Preference; Rank (graph theory); Information retrieval; Variety (cybernetics); Learning to rank; Preference learning; Machine learning; Data mining; Artificial intelligence; Mathematics","score_opus":0.01761425993665048,"score_gpt":0.21582282076499093,"score_spread":0.19820856082834046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509825211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37002802,0.00010910108,0.584662,0.005352128,0.0012049833,0.0010487898,0.000004791469,0.0003506874,0.037239473],"genre_scores_gemma":[0.9520155,0.000012277429,0.04710476,0.00027208216,0.000096250085,0.000029058318,0.0000011624405,0.0000054516504,0.00046344858],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990539,0.000007792492,0.00019235096,0.00024768355,0.00031997258,0.00017832337],"domain_scores_gemma":[0.99946564,0.00002474553,0.0001838702,0.00019152704,0.000101437116,0.00003275026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037494028,0.00010171578,0.00010149542,0.000052541098,0.00014029496,0.0001758895,0.0010913879,0.000019478464,0.0000048026786],"category_scores_gemma":[0.000072811206,0.00006957213,0.00004411684,0.00023445,0.00002636134,0.0006074099,0.0005819283,0.00006306294,0.000011999358],"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.000004898559,0.0001304972,0.0042936737,0.00016968256,0.000050484447,1.6970255e-7,0.0015225515,0.0001618568,0.16992375,0.3629229,0.0065423627,0.4542772],"study_design_scores_gemma":[0.00088331365,0.00027292164,0.009547294,0.00017882648,0.00004338956,0.000005368298,0.0002061054,0.41807413,0.5077993,0.04887432,0.013617068,0.00049795053],"about_ca_topic_score_codex":0.00001987496,"about_ca_topic_score_gemma":8.78188e-7,"teacher_disagreement_score":0.5819875,"about_ca_system_score_codex":0.000020617494,"about_ca_system_score_gemma":0.0000047349968,"threshold_uncertainty_score":0.28370693},"labels":[],"label_agreement":null},{"id":"W1510049598","doi":"","title":"Fusing social network data with hard data","year":2015,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Data Management and Algorithms","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":"Defence Research and Development Canada; McMaster University","funders":"","keywords":"Computer science; Dissemination; Event (particle physics); Fuse (electrical); Social media; Social network (sociolinguistics); Identification (biology); Class (philosophy); Process (computing); Data mining; Attack patterns; Microblogging; Sensor fusion; Computer security; Data science; Information retrieval; World Wide Web; Artificial intelligence; Intrusion detection system; Engineering","score_opus":0.17921186500788264,"score_gpt":0.3274271580848725,"score_spread":0.14821529307698986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510049598","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.00064564,0.0000045183547,0.87959874,0.008791649,0.0015606676,0.00018401198,0.00025434126,0.0001956861,0.10876472],"genre_scores_gemma":[0.69965136,0.00009458921,0.24728084,0.00759988,0.0023010818,0.000026572106,0.041172888,0.000024657105,0.0018481116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984631,0.00002763379,0.0002621787,0.00027333654,0.00080538035,0.0001683763],"domain_scores_gemma":[0.9982937,0.00001789806,0.00020865284,0.0010992247,0.00031215948,0.00006836463],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006174226,0.0001167016,0.000090246016,0.00012234897,0.00014722133,0.001077597,0.004316603,0.00003627364,0.000072328425],"category_scores_gemma":[0.00005949784,0.00009648043,0.000009509352,0.00021653848,0.000030663276,0.011076167,0.0030311537,0.00011982709,0.00041296906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065234555,0.000038071415,0.00017969804,0.0000063501934,0.00003518037,0.000005088983,0.0005812393,0.00033793203,0.000004529582,0.49132764,0.19265774,0.3147613],"study_design_scores_gemma":[0.000523713,0.000046367575,0.0006854752,0.00003780745,0.0000045396587,0.0000046959453,0.0001644658,0.7171771,0.0000042522024,0.0022026594,0.27899975,0.000149182],"about_ca_topic_score_codex":0.00004071556,"about_ca_topic_score_gemma":0.000015263464,"teacher_disagreement_score":0.71683913,"about_ca_system_score_codex":0.000042731874,"about_ca_system_score_gemma":0.00014320583,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W1510767022","doi":"10.1007/11733836_42","title":"Query Optimization for a Graph Database with Visual Queries","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science; Graph database; Query optimization; Graph; Information retrieval; View; Database; Theoretical computer science; Database design","score_opus":0.012275470845136827,"score_gpt":0.2388625836253793,"score_spread":0.22658711278024246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510767022","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.0000059199883,0.00014533626,0.9964647,0.00040078157,0.00080304395,0.0006608094,0.000042425225,0.00019891457,0.0012780508],"genre_scores_gemma":[0.0013477575,0.000029133478,0.9965899,0.0007517941,0.00039511287,0.00003351147,0.00021562737,0.000036391,0.00060076383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681884,0.00001626958,0.0003699407,0.0014688688,0.00076227856,0.0005637818],"domain_scores_gemma":[0.9980957,0.0002220018,0.0002575433,0.0011092152,0.00021760445,0.00009796537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005543476,0.00047692462,0.00038804565,0.00086089206,0.00029047858,0.0009950403,0.0023825776,0.00013861168,0.000009755523],"category_scores_gemma":[0.000029019358,0.0003982075,0.000083704996,0.0006594398,0.00054491404,0.0018467639,0.001064336,0.0002962316,0.000006114387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026480995,0.00008128516,0.000033525277,0.00014558538,0.000028893952,0.00010401534,0.00014882711,0.4856169,0.000019071149,0.050439984,0.00069040665,0.46266505],"study_design_scores_gemma":[0.00039466287,0.00028364483,0.0000126299,0.00027003424,0.000015515208,0.000017363693,1.3973062e-7,0.9764341,0.0002569356,0.018059567,0.003610864,0.0006445027],"about_ca_topic_score_codex":0.000039844086,"about_ca_topic_score_gemma":0.00010414552,"teacher_disagreement_score":0.49081725,"about_ca_system_score_codex":0.00010312779,"about_ca_system_score_gemma":0.00027781448,"threshold_uncertainty_score":0.999847},"labels":[],"label_agreement":null},{"id":"W1516469158","doi":"10.1016/b978-155860869-6/50073-1","title":"The Generalized MDL Approach for Summarization","year":2002,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":60,"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":"Automatic summarization; Minimum description length; Online analytical processing; Aggregate (composite); Generalization; Computer science; Data cube; Cube (algebra); Data mining; Information retrieval; Theoretical computer science; Mathematics; Algorithm; Combinatorics; Data warehouse","score_opus":0.02701062889003689,"score_gpt":0.22721061869485687,"score_spread":0.20019998980481998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516469158","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":[3.2771354e-8,0.00056291936,0.1555634,0.00014296021,0.0005022018,0.00087464345,0.00002416277,0.00012070319,0.842209],"genre_scores_gemma":[0.0000017918139,0.0002705375,0.055276282,0.00031364994,0.00042461432,0.00013482202,0.00016872864,0.00004184132,0.9433677],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842787,0.000022394022,0.00033455988,0.00056424015,0.00033989517,0.0003110317],"domain_scores_gemma":[0.99842346,0.00006658043,0.0002315501,0.0011292069,0.00008572182,0.00006350158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750221,0.00030874612,0.0002668459,0.00009207234,0.00038202739,0.0005909079,0.0016887045,0.00014279773,0.000015529993],"category_scores_gemma":[0.000011265838,0.00022257357,0.00019916205,0.00002117763,0.00007476483,0.00017026374,0.0004914507,0.0001696841,0.00005836746],"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.0000013695014,0.0000030764604,1.03548544e-7,0.000019397987,0.000040472598,0.0000011280614,0.000022771384,0.0000019118863,4.601116e-7,0.31379005,0.0036307736,0.6824885],"study_design_scores_gemma":[0.00025004087,0.000025101956,5.418983e-7,0.000022364839,0.000039910537,0.0000015895549,7.572239e-7,0.026454488,0.0000049037585,0.027821114,0.9450981,0.00028111326],"about_ca_topic_score_codex":1.775309e-7,"about_ca_topic_score_gemma":0.0000013142297,"teacher_disagreement_score":0.9414673,"about_ca_system_score_codex":0.00003802093,"about_ca_system_score_gemma":0.000024299412,"threshold_uncertainty_score":0.9076287},"labels":[],"label_agreement":null},{"id":"W1517348552","doi":"","title":"Maximal vector computation in large data sets","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":373,"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":"Skyline; Curse of dimensionality; Convex hull; Computer science; Set (abstract data type); Computation; Field (mathematics); Algorithm; Running time; Mathematics; Regular polygon; Data mining; Artificial intelligence","score_opus":0.04080861114137971,"score_gpt":0.2986350357834028,"score_spread":0.2578264246420231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517348552","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.0025675555,0.00002471494,0.9867389,0.0028183034,0.00014163069,0.00008419077,0.00001913218,0.0001233629,0.007482164],"genre_scores_gemma":[0.5380526,0.000006126891,0.45991626,0.0009182369,0.00008396469,0.0000022773734,0.00028686208,0.0000042242937,0.0007294466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930614,0.000016406577,0.000106721534,0.00027355185,0.00013276646,0.00016438418],"domain_scores_gemma":[0.999422,0.000016032775,0.000020137597,0.00050793187,0.000008233742,0.000025635354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026284315,0.000052661868,0.000054255164,0.0000696682,0.000026488968,0.00015066772,0.001092632,0.000012998028,0.00005265505],"category_scores_gemma":[0.000007971152,0.000047907433,0.000007173015,0.0002163807,0.0000051119296,0.0018471235,0.0010326159,0.000042698604,0.0003411532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021043522,0.00022530225,0.0015469015,0.0000086389455,0.000008417017,0.000025909652,0.00015712812,0.00025147863,0.000014935549,0.0633448,0.07750443,0.85690993],"study_design_scores_gemma":[0.00027831894,0.000008634313,0.015708597,0.0000027254584,8.0780063e-7,9.866077e-7,0.000007640045,0.93387085,0.000017714508,0.00030626846,0.04972308,0.000074402924],"about_ca_topic_score_codex":0.000018204695,"about_ca_topic_score_gemma":0.00012642577,"teacher_disagreement_score":0.9336193,"about_ca_system_score_codex":0.000013397298,"about_ca_system_score_gemma":0.000009024919,"threshold_uncertainty_score":0.43849483},"labels":[],"label_agreement":null},{"id":"W1518152488","doi":"10.1109/icde.2015.7113341","title":"Size-Constrained Weighted Set Cover","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Cover (algebra); Generalization; Set cover problem; Constraint (computer-aided design); Set (abstract data type); Fraction (chemistry); Approximation algorithm; Mathematics; Computer science; Algorithm; Mathematical optimization; Discrete mathematics","score_opus":0.03126983876728152,"score_gpt":0.25166055383354863,"score_spread":0.22039071506626712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518152488","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.0010254948,0.000011912281,0.6436897,0.00231209,0.00047366013,0.000094858515,0.0000060721095,0.0003448849,0.35204136],"genre_scores_gemma":[0.39826095,0.0000062941876,0.52953607,0.0045080436,0.00022565319,0.000011009021,0.00003829221,0.000012008586,0.0674017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993325,0.000017328932,0.000090965455,0.00020078581,0.00019720901,0.00016125092],"domain_scores_gemma":[0.9994186,0.000033524902,0.000022683336,0.00038930494,0.00003261388,0.000103235565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020100099,0.00007020098,0.000069390204,0.000033258097,0.000025972504,0.00020071895,0.00066832575,0.000018275363,0.00019817756],"category_scores_gemma":[0.000027310993,0.00005485692,0.000021327094,0.00022341259,0.000022827355,0.0006516381,0.00032324786,0.00003609145,0.0012827071],"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.0000033190406,0.000050254395,0.0002911751,0.0000040645646,0.00002693296,0.000051061394,0.00024126505,0.0000057182656,0.000026767126,0.3828878,0.55628115,0.06013047],"study_design_scores_gemma":[0.0013559248,0.000094863564,0.0004892358,0.0000052605133,0.0000069837834,0.0000102113545,0.00008602425,0.24762912,0.00048372956,0.019669056,0.7298374,0.0003321931],"about_ca_topic_score_codex":0.000018302315,"about_ca_topic_score_gemma":0.0000016636016,"teacher_disagreement_score":0.39723545,"about_ca_system_score_codex":0.000011813385,"about_ca_system_score_gemma":0.00003234781,"threshold_uncertainty_score":0.9994949},"labels":[],"label_agreement":null},{"id":"W1518384768","doi":"10.1109/vlhcc.2004.7","title":"An Automatic Layout Algorithm for Lograph","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Debugger; Computer science; Graph; Graph rewriting; Interpreter; Graph Layout; Programming language; Theoretical computer science; Query optimization; Algorithm; Parallel computing; Debugging; Information retrieval; Graph drawing","score_opus":0.014129201752913574,"score_gpt":0.2685554322895135,"score_spread":0.2544262305365999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518384768","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.0002792039,0.000018476752,0.99434584,0.0009001175,0.00016750838,0.0001984346,0.00000643322,0.0005126685,0.0035713397],"genre_scores_gemma":[0.007477663,0.0000028088791,0.9895115,0.0010227464,0.00016534502,0.000029776624,0.000021538739,0.0000060953757,0.0017625516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992276,0.000012421208,0.00012882309,0.0002700988,0.00013369125,0.00022738225],"domain_scores_gemma":[0.9993139,0.000023472894,0.000030146937,0.00053437846,0.000026152204,0.00007193596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021131618,0.000087092136,0.00008462303,0.00010353622,0.00007937157,0.0002903091,0.00096494006,0.000021583899,0.000055543806],"category_scores_gemma":[0.0000033327342,0.00007225703,0.000047765814,0.00020965707,0.000016072045,0.0014978345,0.00011577303,0.000028212256,0.00011646788],"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.242092e-8,0.00005392817,0.000013681596,0.0000028868367,0.000007300474,8.250219e-7,0.000040249994,0.000011519201,0.000005879913,0.025745217,0.0074469866,0.9666714],"study_design_scores_gemma":[0.00022724381,0.000066175766,0.00024226912,0.0000021652274,0.000004267215,0.0000013412149,0.00001526223,0.93334305,0.0001265125,0.0017460692,0.06410848,0.000117179945],"about_ca_topic_score_codex":0.000007492085,"about_ca_topic_score_gemma":0.0000078468065,"teacher_disagreement_score":0.9665542,"about_ca_system_score_codex":0.000008463062,"about_ca_system_score_gemma":0.000009014454,"threshold_uncertainty_score":0.29465562},"labels":[],"label_agreement":null},{"id":"W1518500743","doi":"10.1007/978-3-642-03730-6_22","title":"High Performance Analytics with the R3-Cache","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science; Cache; Analytics; Parallel computing; Database","score_opus":0.014388152473746488,"score_gpt":0.21484261997778403,"score_spread":0.20045446750403756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518500743","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.000096068434,0.00014442722,0.98983806,0.003670267,0.0006271768,0.00031269662,0.0000033432752,0.00014060759,0.005167356],"genre_scores_gemma":[0.18182476,0.00021272042,0.8019831,0.0082100835,0.0012320968,0.000011648985,0.000023434539,0.000057175806,0.006444992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965797,0.000021150518,0.00031523587,0.001240625,0.0011956779,0.0006475957],"domain_scores_gemma":[0.9972686,0.0001851797,0.00024962323,0.0020365373,0.00015444441,0.00010560092],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008431006,0.00049973506,0.00039073292,0.0004796701,0.00038488818,0.0010737114,0.006055273,0.00014077517,0.0000134806005],"category_scores_gemma":[0.00001394646,0.0003074085,0.00006905739,0.0009169355,0.00067937083,0.0010524754,0.0013704875,0.0007831727,0.000062003055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033273193,0.000015270009,0.000018691248,0.000014123466,0.000014066404,0.00005465225,0.00014877894,0.033246305,0.0000035108699,0.0195597,0.00014766214,0.9467739],"study_design_scores_gemma":[0.00036987214,0.00050016894,0.0008003455,0.00029107212,0.000032100706,0.000057557565,2.4758543e-7,0.9472056,0.00039045356,0.032898065,0.016489787,0.0009647242],"about_ca_topic_score_codex":0.000011164994,"about_ca_topic_score_gemma":0.000035578945,"teacher_disagreement_score":0.9458092,"about_ca_system_score_codex":0.00014321246,"about_ca_system_score_gemma":0.00023698402,"threshold_uncertainty_score":0.9999633},"labels":[],"label_agreement":null},{"id":"W151938044","doi":"10.1137/1.9781611972757.5","title":"Summarizing and Mining Skewed Data Streams","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":138,"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":"Crohn's and Colitis Foundation of Canada","keywords":"Skew; Skewness; Data stream mining; Computer science; Data mining; Data stream; Space (punctuation); Zipf's law; Point (geometry); Algorithm; Mathematics; Statistics","score_opus":0.04579868955532916,"score_gpt":0.2686245177712225,"score_spread":0.2228258282158933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151938044","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.012527669,0.00023891586,0.9074159,0.00546939,0.00024321252,0.00012309827,0.000014706048,0.00039710922,0.073569946],"genre_scores_gemma":[0.10091376,0.000055453605,0.892353,0.0008377933,0.00017852696,0.0000014780334,0.00007296902,0.0000054318803,0.0055815754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993622,0.000008854534,0.00008190328,0.00030437164,0.00010277865,0.00013994832],"domain_scores_gemma":[0.9991279,0.000029114903,0.00001982877,0.0007748941,0.0000066729585,0.000041565618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020264507,0.000057566536,0.0000540783,0.00004031153,0.00006110873,0.00033029105,0.0010924999,0.000011477226,0.000021989179],"category_scores_gemma":[0.0000126617215,0.000048853104,0.0000054665484,0.00010627848,0.000013383553,0.0019671435,0.0019292572,0.000028372877,0.00003660934],"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":[2.2209738e-7,0.000010333422,0.0004825184,0.0000022213685,0.0000058958385,0.0000030960784,0.000055246437,0.0000020171592,0.000014385712,0.016336268,0.01541376,0.967674],"study_design_scores_gemma":[0.00020474549,0.000012712367,0.0010265828,0.0000073825486,0.000004415238,0.0000026436442,0.00005997378,0.7330445,0.00008643216,0.0002002541,0.26521942,0.0001309703],"about_ca_topic_score_codex":0.00002468114,"about_ca_topic_score_gemma":0.000043250366,"teacher_disagreement_score":0.96754307,"about_ca_system_score_codex":0.000004024475,"about_ca_system_score_gemma":0.000006114422,"threshold_uncertainty_score":0.31850043},"labels":[],"label_agreement":null},{"id":"W1521873349","doi":"10.1007/978-3-642-16321-0_8","title":"Range Queries over Untangled Chains","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Partition (number theory); Computer science; Range (aeronautics); Representation (politics); Monotonic function; Data structure; Set (abstract data type); Space (punctuation); Algorithm; Combinatorics; Discrete mathematics; Mathematics","score_opus":0.01298931434922809,"score_gpt":0.2331379272691236,"score_spread":0.22014861291989551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521873349","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.000053202606,0.00020817602,0.9844945,0.0009979472,0.0037498428,0.00038922235,0.000015182781,0.00028059704,0.009811305],"genre_scores_gemma":[0.017954271,0.00013537543,0.967643,0.0050397697,0.0020225253,0.000025362968,0.00003684649,0.000089160596,0.0070536854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604714,0.000021820466,0.0004365418,0.0016402573,0.0011058289,0.0007484116],"domain_scores_gemma":[0.9971051,0.00021912243,0.0002512606,0.0021060044,0.00013843809,0.00018003122],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008008342,0.00058400235,0.0005142477,0.000876837,0.00031696065,0.0011538273,0.00529122,0.0003384392,0.00010801456],"category_scores_gemma":[0.00006113977,0.0005199981,0.00014534198,0.00063101243,0.00086484756,0.0014359977,0.0028896395,0.0010458904,0.00012261304],"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.000005275078,0.00003882242,0.00009249368,0.000044883254,0.000019994317,0.00025054027,0.0006118124,0.00033981708,0.00024281321,0.22368824,0.00012653272,0.77453876],"study_design_scores_gemma":[0.0012998995,0.00036716755,0.0009752729,0.00056576444,0.0000340933,0.00009451523,3.5069925e-7,0.46896818,0.0025187926,0.3996887,0.12250714,0.002980145],"about_ca_topic_score_codex":0.000036357713,"about_ca_topic_score_gemma":0.00026223803,"teacher_disagreement_score":0.77155864,"about_ca_system_score_codex":0.00013946828,"about_ca_system_score_gemma":0.00025180896,"threshold_uncertainty_score":0.99988306},"labels":[],"label_agreement":null},{"id":"W1524550501","doi":"10.1007/978-3-540-30116-5_41","title":"Density-Based Spatial Clustering in the Presence of Obstacles and Facilitators","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":52,"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 Regina","funders":"","keywords":"Cluster analysis; Computer science; Preprocessor; Cluster (spacecraft); Data mining; Spatial analysis; Artificial intelligence; k-means clustering; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.01611851001436791,"score_gpt":0.23139271342903908,"score_spread":0.21527420341467118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524550501","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.00080424355,0.00015395082,0.99727446,0.0005500657,0.0004749348,0.00034737375,0.0000071648633,0.000033541834,0.00035424915],"genre_scores_gemma":[0.7452869,0.000024719873,0.25387698,0.0006689601,0.000093032344,0.0000060626558,0.0000047297417,0.0000113833285,0.000027267311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975582,0.00004285893,0.0003664794,0.0008846313,0.0007778645,0.00037001102],"domain_scores_gemma":[0.9982586,0.00046245407,0.00016768488,0.0009880053,0.00006863625,0.00005465766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542444,0.0002958668,0.00031921882,0.0005435915,0.00011383667,0.0003675651,0.002913541,0.00010868086,0.0000036981223],"category_scores_gemma":[0.0000780126,0.00022572873,0.000054215136,0.00043872636,0.0007030446,0.00053604506,0.0013016919,0.00039692016,0.0000030143667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008574305,0.000038958296,0.0006944924,0.00017280034,0.0000075001494,0.00016821951,0.0021990084,0.0659223,0.000067452725,0.020262135,0.000006378822,0.9104522],"study_design_scores_gemma":[0.00050597073,0.00019116496,0.0029574526,0.00066379306,0.000007197134,0.000014780276,0.0000014683982,0.8959505,0.0007429755,0.09813949,0.0003073877,0.0005178074],"about_ca_topic_score_codex":0.00023193276,"about_ca_topic_score_gemma":0.0005637307,"teacher_disagreement_score":0.9099344,"about_ca_system_score_codex":0.00008219246,"about_ca_system_score_gemma":0.0002007102,"threshold_uncertainty_score":0.92049503},"labels":[],"label_agreement":null},{"id":"W1524865704","doi":"10.1007/3-540-44466-1_13","title":"Maintaining Horizontally Partitioned Warehouse Views","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Windsor","funders":"","keywords":"Data warehouse; Aggregate (composite); Tuple; Scheme (mathematics); Warehouse; Computer science; Database; Set (abstract data type); Materialized view; Base (topology); Data mining; Information retrieval; Mathematics; View; Geography","score_opus":0.02446178647882132,"score_gpt":0.24570998442426253,"score_spread":0.2212481979454412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524865704","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.00001183991,0.00027284477,0.9737394,0.001008953,0.0013627487,0.00039926352,0.000010408651,0.00034016214,0.022854393],"genre_scores_gemma":[0.042613838,0.0004450032,0.9471424,0.005124959,0.0016915746,0.00003840201,0.000071086135,0.00010113009,0.0027716127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580586,0.000036957095,0.00057968433,0.001719601,0.0010407222,0.0008171492],"domain_scores_gemma":[0.9974844,0.00017609553,0.00023976274,0.0018065696,0.00009397894,0.00019923081],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009224649,0.00056562125,0.000520748,0.0007988951,0.0003345073,0.0011723542,0.004567389,0.00020772377,0.00015105198],"category_scores_gemma":[0.000030132629,0.0005276969,0.00015164577,0.0006003911,0.00044698513,0.0014847256,0.0016947765,0.00066817104,0.0003684477],"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.0000039541214,0.000025484891,0.000008231385,0.000013396644,0.000011666755,0.00022166075,0.00025657326,0.009062783,0.000013449951,0.049026966,0.00014883144,0.941207],"study_design_scores_gemma":[0.00063377596,0.00045890833,0.00010531527,0.0006435752,0.000022502956,0.0000872137,3.2026864e-7,0.4232968,0.00041406622,0.4863457,0.08623087,0.0017609338],"about_ca_topic_score_codex":0.00001918974,"about_ca_topic_score_gemma":0.00008530233,"teacher_disagreement_score":0.9394461,"about_ca_system_score_codex":0.00022681431,"about_ca_system_score_gemma":0.00026589874,"threshold_uncertainty_score":0.9998645},"labels":[],"label_agreement":null},{"id":"W1526157805","doi":"10.1007/11424918_14","title":"A Comparative Study of Two Density-Based Spatial Clustering Algorithms for Very Large Datasets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"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 Regina","funders":"","keywords":"DBSCAN; Computer science; Cluster analysis; Data mining; Spatial analysis; Algorithm; Artificial intelligence; CURE data clustering algorithm; Correlation clustering; Pattern recognition (psychology); Machine learning; Mathematics; Statistics","score_opus":0.038952807120862576,"score_gpt":0.3084190218575835,"score_spread":0.26946621473672094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526157805","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.00024040378,0.00006124884,0.9962963,0.0001054141,0.0013610173,0.0014247978,0.00025164298,0.00009887764,0.00016033652],"genre_scores_gemma":[0.2408349,0.000004276885,0.7573255,0.00070309255,0.0007298251,0.000037690785,0.00025276354,0.000034506003,0.000077444456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583924,0.000053710643,0.0006795532,0.0016737428,0.001058961,0.00069478864],"domain_scores_gemma":[0.9969256,0.00047087346,0.00046505584,0.0017760403,0.00022921122,0.00013320011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011770221,0.0005708083,0.0008592554,0.00087856565,0.00028951417,0.00048329664,0.0039612064,0.00012447845,0.000010204588],"category_scores_gemma":[0.000030827916,0.00054334954,0.00012811559,0.00048338962,0.00029069776,0.00091473677,0.0026477291,0.0004371356,0.000012648699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078748315,0.0011638221,0.00021368757,0.00019579062,0.00014265068,0.00019216188,0.0030464537,0.15147842,0.00009024078,0.004169512,0.00024886715,0.83897966],"study_design_scores_gemma":[0.0020365927,0.00067040155,0.00013035243,0.00018323277,0.000032125732,0.000005997358,0.0000014338353,0.9910352,0.0007418885,0.003194692,0.0013705472,0.0005974854],"about_ca_topic_score_codex":0.00012374028,"about_ca_topic_score_gemma":0.001970424,"teacher_disagreement_score":0.8395568,"about_ca_system_score_codex":0.00016454654,"about_ca_system_score_gemma":0.00026847082,"threshold_uncertainty_score":0.9997018},"labels":[],"label_agreement":null},{"id":"W1527829338","doi":"10.1023/a:1022870110853","title":"Ordering Points for Incremental TIN Construction from DEMs","year":2003,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"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":"Triangulation; Mathematics; Approximation error; Point (geometry); Triangulated irregular network; Terrain; Mean squared error; Elevation (ballistics); Surface (topology); Geometry; Mathematical analysis; Combinatorics; Statistics; Geography","score_opus":0.012531027467926862,"score_gpt":0.21720300360272352,"score_spread":0.20467197613479665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527829338","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.007663051,0.0000106470825,0.9712802,0.00017462154,0.0005022636,0.00025127767,0.000018890647,0.00012065586,0.0199784],"genre_scores_gemma":[0.052725103,0.0000065096456,0.9464889,0.0004650315,0.000045282795,0.000031091535,0.00007515438,0.000005813734,0.00015712384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992724,0.000011151019,0.00022846914,0.00012302755,0.00014898606,0.00021596006],"domain_scores_gemma":[0.9995183,0.000043170392,0.00007680788,0.00028978815,0.000023199971,0.000048731777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022999654,0.00008726639,0.00009195589,0.000058811587,0.00012319633,0.0002309102,0.00035243863,0.000023226848,0.000076646495],"category_scores_gemma":[0.000042182306,0.00008252465,0.000034312856,0.00012481962,0.00002186232,0.0014635208,0.00013660546,0.000043162887,0.00022689743],"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.000009218667,0.000057418252,0.0011994743,0.00008724257,0.000099409706,0.000003013641,0.0014991263,0.000033151373,0.000100222795,0.59758353,0.014930384,0.38439777],"study_design_scores_gemma":[0.0033231222,0.0001636829,0.0011203904,0.00007494896,0.00003948097,0.000030616215,0.0016029985,0.46774688,0.0076703494,0.067985915,0.44944564,0.000795986],"about_ca_topic_score_codex":0.00002090638,"about_ca_topic_score_gemma":0.0000034177538,"teacher_disagreement_score":0.52959764,"about_ca_system_score_codex":0.00001971166,"about_ca_system_score_gemma":0.000017506696,"threshold_uncertainty_score":0.33652577},"labels":[],"label_agreement":null},{"id":"W1528801041","doi":"10.1109/tai.1996.560458","title":"Attribute-oriented induction using domain generalization graphs","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Computer science; Generalization; Domain (mathematical analysis); Theoretical computer science; Mathematics","score_opus":0.026651408239762753,"score_gpt":0.2574127937498282,"score_spread":0.23076138551006542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528801041","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.062550604,0.000016409287,0.93508023,0.00070113206,0.0003577312,0.00008158525,0.0000013705103,0.00018300505,0.0010279139],"genre_scores_gemma":[0.15013379,0.000017872648,0.8474931,0.00072458736,0.00029450186,0.0000049409955,0.00007643178,0.000008409775,0.0012463336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992795,0.000026248688,0.0001293083,0.00023043535,0.0001755869,0.0001588976],"domain_scores_gemma":[0.999585,0.0000038052792,0.00004437289,0.00028931003,0.000039512775,0.000038024373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016728128,0.00007309837,0.00005722884,0.000134199,0.00011423386,0.00014120556,0.00029058417,0.00002598866,0.000036338086],"category_scores_gemma":[0.0000041755134,0.00006652787,0.000025402787,0.00061238935,0.000012789949,0.001631153,0.00016826887,0.00003578461,0.000042974454],"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.0000013941805,0.00008341172,0.0012566799,0.0000046662944,0.00002045351,0.000003410343,0.00018135388,0.0020135958,0.003025079,0.89861816,0.008507602,0.08628422],"study_design_scores_gemma":[0.0006413054,0.000038394217,0.0021525268,0.000009737132,0.000010687892,0.000011912306,0.000065713386,0.82189673,0.0057044304,0.0071394406,0.1619615,0.00036762055],"about_ca_topic_score_codex":0.000030671312,"about_ca_topic_score_gemma":0.000010161698,"teacher_disagreement_score":0.8914787,"about_ca_system_score_codex":0.000035398363,"about_ca_system_score_gemma":0.00000887009,"threshold_uncertainty_score":0.2712928},"labels":[],"label_agreement":null},{"id":"W1529172590","doi":"10.1007/978-3-540-76888-3_43","title":"Issues in Location-Based Indexing for Co-operating Mobile Information Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Search engine indexing; Context (archaeology); World Wide Web; Tourism; Information system; Mobile device; Information access; Mobile computing; Computer network; Geography; Engineering","score_opus":0.020834333248542877,"score_gpt":0.28227208832324885,"score_spread":0.26143775507470596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529172590","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.000017015407,0.00029864468,0.99527156,0.00015054882,0.0012549623,0.0011541145,0.00001075425,0.0001175097,0.0017248604],"genre_scores_gemma":[0.08166026,0.000026680787,0.91445583,0.0022604105,0.0007830438,0.00016864492,0.00020144286,0.000038642884,0.00040503198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973109,0.000019430572,0.00068109756,0.00071978866,0.0007532886,0.00051551865],"domain_scores_gemma":[0.99809974,0.0004231849,0.0003049694,0.00081042503,0.000286112,0.00007554036],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019142288,0.00034181905,0.00035730985,0.0013994931,0.00021432215,0.0014778061,0.0021430224,0.00019535849,0.0000033194588],"category_scores_gemma":[0.00009253127,0.00032946866,0.000052339365,0.00070611347,0.00017618819,0.002376962,0.0003906949,0.0003645197,0.000027109789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026126847,0.000015659485,0.00008703049,0.00018580497,0.000004159402,0.000008252039,0.0006264294,0.4636363,0.000006869541,0.018497448,0.000044019365,0.5168854],"study_design_scores_gemma":[0.00032138688,0.00010594325,0.000036845613,0.0005036823,0.0000024028473,0.0000028963557,0.0000013419401,0.9844245,0.00028088014,0.0026185845,0.011302954,0.00039859372],"about_ca_topic_score_codex":0.00008607505,"about_ca_topic_score_gemma":0.00005195711,"teacher_disagreement_score":0.5207882,"about_ca_system_score_codex":0.0002958907,"about_ca_system_score_gemma":0.0003295477,"threshold_uncertainty_score":0.9999157},"labels":[],"label_agreement":null},{"id":"W15302468","doi":"","title":"Synthetic and Real Spatiotemporal Datasets.","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Benchmarking; Computer science; Context (archaeology); Data science; Data mining; Synthetic data; Artificial intelligence","score_opus":0.014107196131605347,"score_gpt":0.23331914805024065,"score_spread":0.2192119519186353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15302468","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.003890949,0.000058967085,0.8215871,0.0010739209,0.00031613035,0.00015446421,0.000035187033,0.00023433466,0.17264895],"genre_scores_gemma":[0.5763655,0.00017570621,0.41722268,0.0008181969,0.00003892765,0.000008333603,0.000146082,0.000010147092,0.005214443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995352,0.000020279907,0.0000625112,0.00019661902,0.00008430496,0.000101105026],"domain_scores_gemma":[0.99955267,0.000013894965,0.000015012949,0.00037460917,0.000004546861,0.00003925285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016537463,0.00004801445,0.000044598644,0.000031740183,0.000041611635,0.00014932522,0.00025380278,0.000010113285,0.00003982954],"category_scores_gemma":[0.000011509831,0.000039196995,0.0000069243897,0.0000892406,0.000018106806,0.00053905323,0.00014766911,0.000021064285,0.000058070338],"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":[2.8271964e-7,0.00002002264,0.0007062503,0.000004789394,0.0000047372123,0.000012724998,0.000023711778,3.8490344e-7,0.000013068103,0.9100391,0.021204406,0.067970514],"study_design_scores_gemma":[0.00075386325,0.00012284548,0.009286833,0.000015068989,0.000014881573,0.000032810356,0.00006762498,0.043484204,0.0019189137,0.027871093,0.9158398,0.0005920603],"about_ca_topic_score_codex":0.00006926152,"about_ca_topic_score_gemma":0.000010282554,"teacher_disagreement_score":0.8946354,"about_ca_system_score_codex":0.0000031111879,"about_ca_system_score_gemma":0.0000065282684,"threshold_uncertainty_score":0.15984072},"labels":[],"label_agreement":null},{"id":"W1533258823","doi":"10.1007/978-3-540-39985-8_4","title":"Query Selectivity Estimation via Data Mining","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Joins; Join (topology); Computer science; Query optimization; Data mining; Simple (philosophy); Database; Mathematics; Programming language","score_opus":0.046532383626247655,"score_gpt":0.2599893478918166,"score_spread":0.21345696426556895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533258823","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":[3.2834186e-7,0.000028217153,0.6083349,0.00019277784,0.00023477004,0.00009805917,0.000016049265,0.00020626899,0.39088863],"genre_scores_gemma":[0.000427856,0.000031666525,0.56590605,0.00030022798,0.00018137333,0.0000028548482,0.00089911994,0.000025304058,0.43222556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985249,0.000007340834,0.00019684379,0.0007560271,0.00033119606,0.0001836759],"domain_scores_gemma":[0.99782753,0.000039237813,0.00013503837,0.0019141213,0.000033143708,0.00005092229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029760628,0.00022415312,0.00019455935,0.00015246347,0.00008588618,0.00033262017,0.0022958005,0.00010531271,0.00016353032],"category_scores_gemma":[0.000013796926,0.00021521196,0.000035286346,0.000057740577,0.000026588705,0.0020014532,0.0021602192,0.00015810021,0.00038209383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.976694e-7,0.000009995532,0.0000010764388,0.000021845253,0.00003214864,0.00002117902,0.000015579366,0.000033543853,0.0000011386745,0.42747152,0.0113652805,0.5610262],"study_design_scores_gemma":[0.00019459642,0.000052142954,0.000031379328,0.00014728609,0.000047421294,0.0000132936075,0.0000011763028,0.7320199,0.000027322838,0.14456724,0.12219838,0.00069986866],"about_ca_topic_score_codex":0.000052305033,"about_ca_topic_score_gemma":0.000036949285,"teacher_disagreement_score":0.73198634,"about_ca_system_score_codex":0.00006313041,"about_ca_system_score_gemma":0.00008380065,"threshold_uncertainty_score":0.8776089},"labels":[],"label_agreement":null},{"id":"W1536212463","doi":"10.1007/978-3-540-77092-3_43","title":"Extraction and Classification of User Behavior","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"St. Francis Xavier University","funders":"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; Markov chain; Generator (circuit theory); Artificial neural network; User group; Artificial intelligence; Human–computer interaction; Machine learning; Multimedia; Power (physics)","score_opus":0.041530658813898766,"score_gpt":0.29418579905001263,"score_spread":0.25265514023611385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536212463","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.00024445527,0.00016406827,0.9951594,0.00014616417,0.0008533914,0.0002524723,0.0000035974076,0.0000577551,0.0031187346],"genre_scores_gemma":[0.10904268,0.000119131444,0.8890696,0.00033496294,0.00030973437,0.000009156119,0.000016464759,0.000024673798,0.0010735865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979453,0.000011057631,0.00035271357,0.00082378846,0.00059996685,0.00026715366],"domain_scores_gemma":[0.9985726,0.0001462466,0.00026718673,0.0008142735,0.00012723739,0.000072467315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326177,0.00023172697,0.00023690109,0.0007196671,0.0000910018,0.00025863037,0.0013274826,0.00016025522,0.00000974242],"category_scores_gemma":[0.000022381582,0.00021810965,0.000043921635,0.0003527831,0.00038790368,0.0009612539,0.0006835288,0.00031332654,0.0000122296315],"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.0000015096729,0.000021575928,0.00012173504,0.000018235492,0.0000029891014,0.000018013316,0.00008035819,0.00006545225,0.0003931249,0.033251792,0.0000132023315,0.966012],"study_design_scores_gemma":[0.0010630464,0.00061784964,0.08165832,0.00080613734,0.00009257,0.00017411845,0.0000011098252,0.76356417,0.0065647173,0.11365939,0.029533982,0.0022646121],"about_ca_topic_score_codex":0.000010378462,"about_ca_topic_score_gemma":0.000026179208,"teacher_disagreement_score":0.9637474,"about_ca_system_score_codex":0.00007714709,"about_ca_system_score_gemma":0.00007908987,"threshold_uncertainty_score":0.88942534},"labels":[],"label_agreement":null},{"id":"W1539879039","doi":"10.1007/978-3-540-85836-2_12","title":"Processing Aggregate Queries on Spatial OLAP Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"","keywords":"Online analytical processing; Computer science; Spatial query; Query optimization; Spatial database; Set (abstract data type); Database; Aggregate (composite); Spatial analysis; Data mining; Query language; Information retrieval; Sargable; Web search query; Data warehouse; Search engine; Geography","score_opus":0.03638146454789528,"score_gpt":0.26065759763387575,"score_spread":0.22427613308598046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539879039","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.000008235554,0.00062300044,0.9900164,0.0009368243,0.0018948033,0.00031880572,0.000030553594,0.00025606717,0.0059153144],"genre_scores_gemma":[0.025678502,0.000637023,0.96386576,0.004517302,0.0023419438,0.000012575106,0.00026437265,0.0000987896,0.0025837324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509305,0.000026619111,0.0004671064,0.0023682273,0.0013452584,0.0006997265],"domain_scores_gemma":[0.9957481,0.00016741428,0.00034622286,0.0034590203,0.00013198599,0.00014727928],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.000671503,0.00058459834,0.00048156764,0.0007561898,0.0004632638,0.0012733454,0.009929093,0.00019439199,0.000015530302],"category_scores_gemma":[0.00008339608,0.0005146435,0.00006650336,0.0005644356,0.0008156128,0.0023528868,0.006079261,0.00073727383,0.00010945461],"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.0000043193077,0.000022921522,0.0000068405043,0.00003093036,0.0000065968293,0.0002171927,0.00024065556,0.001274544,0.000004711356,0.002413405,0.00033231213,0.99544555],"study_design_scores_gemma":[0.00031607604,0.00020927805,0.00008077918,0.0007647363,0.000009889971,0.000073323055,1.2017242e-7,0.92013675,0.00040243097,0.017593645,0.059398636,0.0010143224],"about_ca_topic_score_codex":0.00005539922,"about_ca_topic_score_gemma":0.00011865762,"teacher_disagreement_score":0.99443126,"about_ca_system_score_codex":0.00013873188,"about_ca_system_score_gemma":0.00048786242,"threshold_uncertainty_score":0.9997634},"labels":[],"label_agreement":null},{"id":"W1540196280","doi":"10.1007/978-1-4939-2864-4_256","title":"Nearest Neighbor Interchange and Related Distances","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Data Management and Algorithms","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":"k-nearest neighbors algorithm; Geography; Computer science; Artificial intelligence","score_opus":0.011835362371953729,"score_gpt":0.21984664656121664,"score_spread":0.2080112841892629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540196280","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.000007589083,0.0028774613,0.033896726,0.0007271108,0.0020018101,0.00036777082,0.00022900217,0.00019264565,0.95969987],"genre_scores_gemma":[0.0001114227,0.014424277,0.023168707,0.00008083305,0.0005415311,0.000018615638,0.00007453134,0.00007133275,0.96150875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770015,0.000023918354,0.0005860442,0.0008343039,0.0004937941,0.000361758],"domain_scores_gemma":[0.9981986,0.00014648547,0.000437743,0.0009568112,0.000097784476,0.0001625758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026723414,0.0004638081,0.0005555117,0.00029252202,0.00008448868,0.00012285172,0.0013872014,0.00025091125,0.0002968035],"category_scores_gemma":[0.000029498391,0.00036677497,0.0001408542,0.000090639,0.00028109178,0.00088314526,0.00115594,0.00029592848,0.00019605232],"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.0000044038634,0.00001740393,0.0000103982975,0.00007018793,0.00010746788,0.000100519515,0.0002613047,1.2336933e-7,0.0000017488305,0.31970048,0.0050221775,0.6747038],"study_design_scores_gemma":[0.0005031223,0.00020202373,0.000115670155,0.0005092526,0.00005937271,0.000017453252,0.000011359282,0.0012365903,0.0000068368086,0.07378496,0.9228688,0.00068456214],"about_ca_topic_score_codex":0.000010564785,"about_ca_topic_score_gemma":0.000009236856,"teacher_disagreement_score":0.9178466,"about_ca_system_score_codex":0.0000416582,"about_ca_system_score_gemma":0.000054294804,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"W1542773558","doi":"10.1007/978-3-540-74767-3_38","title":"Distributed Multi-source Regular Path Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Victoria","funders":"","keywords":"Computer science; Path (computing); Distributed computing; Theoretical computer science; Programming language","score_opus":0.023895276126301032,"score_gpt":0.24997032842705894,"score_spread":0.22607505230075792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542773558","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.00000865601,0.00039824363,0.9951022,0.00050368824,0.0016901899,0.0003869808,0.000031967964,0.0003784226,0.0014996503],"genre_scores_gemma":[0.0044595865,0.000076483586,0.9901749,0.0016814072,0.0006086017,0.000008211502,0.00010637946,0.0000558125,0.002828603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953261,0.000029802555,0.00058664475,0.0018707437,0.0012421155,0.0009445774],"domain_scores_gemma":[0.9968169,0.00023626321,0.00032180114,0.00218456,0.00021295276,0.00022754369],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012824748,0.0006518062,0.00055233744,0.000839938,0.0003444459,0.0010850895,0.005322744,0.0003068572,0.000021824562],"category_scores_gemma":[0.0000969463,0.0005970989,0.00015459869,0.00092216244,0.00088444544,0.0012088146,0.0032441516,0.0007604985,0.00009077527],"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.000004233373,0.000047404348,0.00004705414,0.00004136461,0.000018414092,0.00027444048,0.0003117995,0.0056493254,0.00002624764,0.029633554,0.00017711545,0.963769],"study_design_scores_gemma":[0.0005481323,0.0001687639,0.00027024475,0.00042088295,0.000016379548,0.000057697787,5.2642577e-7,0.86615884,0.0006605555,0.038673785,0.09164576,0.0013784106],"about_ca_topic_score_codex":0.000033358865,"about_ca_topic_score_gemma":0.00006729838,"teacher_disagreement_score":0.96239066,"about_ca_system_score_codex":0.00025976152,"about_ca_system_score_gemma":0.00022088438,"threshold_uncertainty_score":0.9999519},"labels":[],"label_agreement":null},{"id":"W1544455437","doi":"","title":"Proceedings of the 17th ACM conference on Information and knowledge management","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":407,"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; Information retrieval; World Wide Web; Data science","score_opus":0.028285685752529027,"score_gpt":0.22942912088786532,"score_spread":0.2011434351353363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544455437","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.04133134,0.000010651287,0.022075355,0.0016315379,0.00018842779,0.00038268077,0.0000016645847,0.00009547486,0.93428284],"genre_scores_gemma":[0.9723914,0.00011047351,0.021676721,0.00032515588,0.0000117726295,0.000009655253,0.0000012478076,0.0000016238275,0.005471915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99961406,0.0000022757492,0.00009639665,0.000084731946,0.0001296731,0.000072850955],"domain_scores_gemma":[0.99968255,0.0000061685523,0.000046409456,0.00020314811,0.000045275745,0.000016432774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090663925,0.000048869897,0.00004440659,0.000053345837,0.000068979934,0.00007265985,0.0007592576,0.0000095951955,0.0000049924115],"category_scores_gemma":[0.0000075373846,0.000030115434,0.0000115831745,0.00018704882,0.00003560893,0.0010344324,0.00088285835,0.000028778592,0.000029302517],"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.0000010330989,0.000019991232,0.00044926367,0.000030629806,0.0000060543994,1.715594e-7,0.00052249304,2.6614694e-7,0.0000064510937,0.92223996,0.0124672,0.0642565],"study_design_scores_gemma":[0.0032253608,0.0005653178,0.43799856,0.00034252543,0.00004339842,0.000028989798,0.0023024504,0.14506881,0.009349854,0.044328947,0.3557614,0.0009843983],"about_ca_topic_score_codex":0.0000028512293,"about_ca_topic_score_gemma":5.6354935e-7,"teacher_disagreement_score":0.9310601,"about_ca_system_score_codex":0.0000054184948,"about_ca_system_score_gemma":0.0000062016306,"threshold_uncertainty_score":0.14109021},"labels":[],"label_agreement":null},{"id":"W1546191538","doi":"10.1109/icc.2015.7249049","title":"Hidden Markov model based graph matching for calibration of localization maps","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Matching (statistics); Computer science; Graph; Map matching; Hidden Markov model; Pattern recognition (psychology); Markov chain; Algorithm; Scale (ratio); Artificial intelligence; Variance (accounting); 3-dimensional matching; Markov process; Data mining; Theoretical computer science; Mathematics; Bipartite graph; Machine learning; Statistics","score_opus":0.0300206110872125,"score_gpt":0.2515043478573134,"score_spread":0.22148373677010091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546191538","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.000090975744,0.0000056882236,0.9971134,0.000512521,0.00010243671,0.00017320235,0.000010636821,0.00008113442,0.0019100183],"genre_scores_gemma":[0.08539453,0.000001033833,0.91307896,0.00052381784,0.000023996887,0.0000156691,0.00014170395,0.0000062902923,0.0008139719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994209,0.000015407071,0.00013956233,0.0001578618,0.00017262039,0.000093687304],"domain_scores_gemma":[0.9995745,0.000017824997,0.000055709108,0.00024569876,0.000065530396,0.000040745286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027352912,0.000056738434,0.00006836048,0.000090442154,0.000029672712,0.00009163413,0.00034736705,0.000020495663,0.0000029429154],"category_scores_gemma":[0.0000116029705,0.00004990979,0.000027227174,0.00018698511,0.000009450342,0.0009495237,0.000092145645,0.0000149113785,0.000001509791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028129823,0.00014125864,0.00020717479,0.00012645655,0.000022991206,0.0000012568166,0.00045639218,0.16026527,0.00019231265,0.6098626,0.11223241,0.116463736],"study_design_scores_gemma":[0.00030291235,0.000024410125,0.000004594984,0.000005574121,0.00000367024,7.917196e-8,0.000020126168,0.9228654,0.00070776406,0.075814545,0.00018907724,0.00006184053],"about_ca_topic_score_codex":0.000028921724,"about_ca_topic_score_gemma":0.0000075570965,"teacher_disagreement_score":0.7626001,"about_ca_system_score_codex":0.00000969213,"about_ca_system_score_gemma":0.00003390014,"threshold_uncertainty_score":0.20352623},"labels":[],"label_agreement":null},{"id":"W1552526860","doi":"10.3334/ornldaac/386","title":"BOREAS TGB-05 Fire History of Manitoba 1980 to 1991 in Raster Format","year":2012,"lang":"en","type":"dataset","venue":"NASA Technical Reports Server (NASA)","topic":"Data Management and Algorithms","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":"Canadian Forest Service","funders":"","keywords":"Raster graphics; Atmosphere (unit); Taiga; Trace gas; Environmental science; Biogeochemistry; Boreal; TRACE (psycholinguistics); Scale (ratio); Geography; Physical geography; Meteorology; Remote sensing; Forestry; Geology; Archaeology; Cartography; Oceanography; Computer science; Computer graphics (images)","score_opus":0.025183729470557695,"score_gpt":0.2515476213803319,"score_spread":0.22636389190977418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552526860","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043256627,0.008448268,0.008344671,0.0024088712,0.034172274,0.009388934,0.9203452,0.002418203,0.010147901],"genre_scores_gemma":[0.00348902,0.00036888997,0.011306079,0.0026674778,0.0009009175,0.00035679972,0.97827923,0.00009048615,0.0025410964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943418,0.00010232697,0.0017767255,0.001270744,0.0015349465,0.00097344577],"domain_scores_gemma":[0.99379224,0.000098950644,0.0010403641,0.004512061,0.00013949958,0.00041687384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015365607,0.00067763554,0.0010329793,0.00064400496,0.000057355606,0.00014327813,0.0031990677,0.0006433362,0.0001348273],"category_scores_gemma":[0.0002601414,0.00063800823,0.0003268212,0.0007762494,0.00012763693,0.0015885832,0.0041324203,0.0009261598,0.00020731211],"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.000013528106,0.00033434687,0.00035631086,0.0002779988,0.00003127198,0.0010108922,0.00002026285,0.0000022714214,0.000009500627,0.00015598995,0.9889492,0.008838427],"study_design_scores_gemma":[0.00025077074,0.00014560147,0.004482161,0.00033319922,0.000059887258,0.00022675151,0.000007651209,0.00006601833,0.000011206752,0.00022232866,0.99348515,0.0007092672],"about_ca_topic_score_codex":0.0023325693,"about_ca_topic_score_gemma":0.0018746401,"teacher_disagreement_score":0.05793402,"about_ca_system_score_codex":0.001053152,"about_ca_system_score_gemma":0.00024318206,"threshold_uncertainty_score":0.99960715},"labels":[],"label_agreement":null},{"id":"W1558205009","doi":"10.1137/1.9781611972764.22","title":"Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected <i>k</i>-Center Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Data mining; Heuristic; Identification (biology); Completeness (order theory); Data type; Cluster (spacecraft); Cluster analysis; Approximation algorithm; Algorithm; Artificial intelligence; Mathematics","score_opus":0.07804125867314685,"score_gpt":0.2735365913257415,"score_spread":0.19549533265259464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558205009","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.0033229834,0.00007936649,0.9852276,0.0070158,0.000069075664,0.00024507495,0.0006788645,0.00007590769,0.003285344],"genre_scores_gemma":[0.8666,0.00003154117,0.117365986,0.0010901566,0.00008931496,0.0000074749328,0.011523052,0.000009875593,0.003282601],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879515,0.000074563526,0.00029223264,0.00047726234,0.00021304782,0.00014776191],"domain_scores_gemma":[0.99676275,0.00015063724,0.00011621994,0.0029021043,0.000045005887,0.000023306475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083855353,0.000086941036,0.00015800315,0.0001450948,0.00009909864,0.00026642327,0.0022814889,0.000021314092,0.000017550317],"category_scores_gemma":[0.00003672662,0.00005422638,0.000023405975,0.0010397669,0.000056775923,0.0016089756,0.004272476,0.00006625883,0.000008439076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006895257,0.00030818567,0.22713403,0.00004808,0.0011132009,0.0000070727842,0.00015310071,0.0004604199,0.000039975792,0.20173036,0.55968153,0.00931715],"study_design_scores_gemma":[0.00039141855,0.000011343498,0.13306296,0.0000069543653,0.0003145116,0.0000015916137,0.00002059419,0.8277049,0.000012664728,0.0010035742,0.03734754,0.00012194939],"about_ca_topic_score_codex":0.00019249934,"about_ca_topic_score_gemma":0.0004084653,"teacher_disagreement_score":0.8678616,"about_ca_system_score_codex":0.00000502316,"about_ca_system_score_gemma":0.000010512787,"threshold_uncertainty_score":0.5325335},"labels":[],"label_agreement":null},{"id":"W1561051430","doi":"10.1007/11599289_14","title":"Adaptive Path Finding for Moving Objects","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Path (computing); Computer vision; Artificial intelligence; Computer graphics (images); Programming language","score_opus":0.02642836210097145,"score_gpt":0.2506438747937748,"score_spread":0.22421551269280338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561051430","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.000005475726,0.0002507847,0.99026203,0.00049575337,0.0017866872,0.00063307496,0.000018213492,0.00019235794,0.00635563],"genre_scores_gemma":[0.017438909,0.000037761678,0.9778734,0.0017254861,0.0011776929,0.000024462139,0.000015823474,0.00004025055,0.0016662297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625045,0.000016401613,0.0004265805,0.0016907578,0.0008039784,0.00081182516],"domain_scores_gemma":[0.9977285,0.00045102212,0.0002880754,0.0012330345,0.00015715757,0.00014220043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090399006,0.00051714096,0.00046060613,0.0008327923,0.00035234864,0.000914659,0.0040970026,0.00020494986,0.000013549336],"category_scores_gemma":[0.000077509765,0.00048779,0.00015579697,0.0004896649,0.0002897654,0.0014488822,0.0020977235,0.00049543707,0.00004234687],"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.0000036611711,0.000016435799,0.0000046667765,0.000027064369,0.0000127471,0.0000398813,0.00043718997,0.008250537,0.000019773446,0.041109636,0.0001097488,0.94996864],"study_design_scores_gemma":[0.00032109165,0.00020625225,0.000024434163,0.00036563235,0.000010812143,0.000014338603,3.452784e-7,0.89992976,0.00033256478,0.09122691,0.0068367114,0.0007311208],"about_ca_topic_score_codex":0.0000071524164,"about_ca_topic_score_gemma":0.000037907696,"teacher_disagreement_score":0.9492375,"about_ca_system_score_codex":0.00029581346,"about_ca_system_score_gemma":0.0002935649,"threshold_uncertainty_score":0.99975735},"labels":[],"label_agreement":null},{"id":"W1563424464","doi":"10.1007/978-3-642-37487-6_17","title":"Indexing Reverse Top-k Queries in Two Dimensions","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"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":"Search engine indexing; Computer science; Polygon (computer graphics); Tuple; Information retrieval; Combinatorics; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.01701251877270165,"score_gpt":0.25371234571853657,"score_spread":0.2366998269458349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563424464","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.000116246316,0.00021098729,0.98713666,0.001078317,0.0018687036,0.0004291125,0.000004212395,0.0001489062,0.009006879],"genre_scores_gemma":[0.036469597,0.00013005795,0.95475614,0.004092463,0.00057085016,0.000028394585,0.000020202639,0.000050938306,0.0038813665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963357,0.000034851804,0.0005116812,0.0015021143,0.00081592845,0.0007997178],"domain_scores_gemma":[0.99764675,0.00026108936,0.00021408545,0.0016041907,0.00011661879,0.0001572923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085076224,0.00048044568,0.00047525935,0.0011794309,0.00020507301,0.0008657645,0.0035741653,0.0001463054,0.00007629345],"category_scores_gemma":[0.00008118279,0.0004394701,0.0000890614,0.0008528099,0.0005041537,0.0019223725,0.0033321457,0.0007860648,0.00020145618],"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.000002591769,0.00004081812,0.0002569561,0.000038213555,0.000011608893,0.0002930272,0.00092672266,0.010214001,0.00007032377,0.1525326,0.00043981837,0.8351733],"study_design_scores_gemma":[0.0006881688,0.00012258394,0.00036355053,0.00091286044,0.000009793035,0.000041716932,0.0000010775132,0.63745993,0.0004560306,0.33074695,0.027750675,0.0014466908],"about_ca_topic_score_codex":0.00022301803,"about_ca_topic_score_gemma":0.0003931988,"teacher_disagreement_score":0.83372664,"about_ca_system_score_codex":0.00024511045,"about_ca_system_score_gemma":0.00026103557,"threshold_uncertainty_score":0.9998057},"labels":[],"label_agreement":null},{"id":"W1564560516","doi":"10.1007/978-3-540-77294-1","title":"Combinatorial and algorithmic aspects of networking : 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007 : revised papers","year":2007,"lang":"en","type":"book","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Luck; Scheduling (production processes); Routing (electronic design automation); Heuristic; Distributed computing; Theoretical computer science; Computer network; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.011964064160898189,"score_gpt":0.21824244442250584,"score_spread":0.20627838026160766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564560516","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.0000025825711,0.0022096713,0.018391468,0.00022767461,0.010923985,0.0007285971,0.000058493664,0.00017516906,0.96728235],"genre_scores_gemma":[0.00047501983,0.0011837451,0.009564008,0.0013191086,0.005500969,0.00001605717,0.0004882815,0.00012009253,0.9813327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958262,0.00007189261,0.00083509495,0.0011235522,0.0012308545,0.0009124213],"domain_scores_gemma":[0.9972739,0.00030649063,0.0005717308,0.0012980755,0.00017922997,0.00037056624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000934895,0.0006749005,0.00093116646,0.000325516,0.00020200336,0.000346481,0.001995088,0.00037327464,0.00034715084],"category_scores_gemma":[0.000036538448,0.0006633436,0.00014148415,0.00043281718,0.00017059968,0.00044748274,0.0011584362,0.0006723819,0.000014268231],"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.000009642551,0.00002817934,0.00001542628,0.00012913346,0.00015484923,0.00027414272,0.000025148694,0.000008520431,5.5993195e-7,0.112567276,0.8093003,0.07748681],"study_design_scores_gemma":[0.00093752303,0.000068303016,0.00007645524,0.0004940215,0.000095791234,0.000012315202,0.00002133922,0.0029033923,0.000005857165,0.0044140285,0.99012303,0.000847959],"about_ca_topic_score_codex":0.048255827,"about_ca_topic_score_gemma":0.07254374,"teacher_disagreement_score":0.18082272,"about_ca_system_score_codex":0.00045398023,"about_ca_system_score_gemma":0.0013779908,"threshold_uncertainty_score":0.99958175},"labels":[],"label_agreement":null},{"id":"W1565853284","doi":"","title":"Knowledgeable agents for search and choice support in e-commerce: a decision support systems approach","year":2000,"lang":"en","type":"article","venue":"MacSphere (McMaster University)","topic":"Data Management and Algorithms","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":true,"ca_institutions":"McMaster University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Sociology; Computer science; Management science; Political science; Operations research; Library science; Data science; Engineering","score_opus":0.03240099171009096,"score_gpt":0.24520913847436532,"score_spread":0.21280814676427434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565853284","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.008475158,0.000056520763,0.30901507,0.00012224267,0.00025612637,0.0009923707,0.000029796374,0.00013541743,0.6809173],"genre_scores_gemma":[0.01973337,0.00007124426,0.028612545,0.0001366401,0.00007204243,0.0000065886625,0.000058370308,0.00002256778,0.9512866],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984024,0.000072848125,0.00019140267,0.00062794593,0.000243944,0.00046145864],"domain_scores_gemma":[0.999246,0.000080078564,0.00003431819,0.0004460813,0.0000450811,0.00014842796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034280683,0.00018718824,0.00023526147,0.00023715975,0.00014971681,0.00031095927,0.0011054478,0.000079895195,0.0063011786],"category_scores_gemma":[0.0000062092604,0.00019809876,0.000054052318,0.0007607832,0.000045721277,0.0013009593,0.0005301626,0.00012870638,0.00013009817],"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.000047697216,0.00016495178,0.0036482671,0.00011106617,0.000026797117,0.00006222195,0.0004076255,0.00043593443,0.0000043432046,0.0036233326,0.008150005,0.98331773],"study_design_scores_gemma":[0.0017985853,0.00012738664,0.002905881,0.00003161497,0.0000148712215,0.00000806695,0.00033862473,0.1527672,0.000006360374,0.000036853897,0.84172344,0.00024111605],"about_ca_topic_score_codex":0.00017988443,"about_ca_topic_score_gemma":0.00006748026,"teacher_disagreement_score":0.98307663,"about_ca_system_score_codex":0.00008651254,"about_ca_system_score_gemma":0.000044860724,"threshold_uncertainty_score":0.9946072},"labels":[],"label_agreement":null},{"id":"W1569796140","doi":"10.1007/978-3-642-00672-2_18","title":"Rank Aggregation to Combine QoS in Web Search","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ranking (information retrieval); Rank (graph theory); Information retrieval; Quality (philosophy); Process (computing); Learning to rank; Web page; Data mining; World Wide Web; Mathematics; Programming language","score_opus":0.018621470445311105,"score_gpt":0.2562007237998797,"score_spread":0.2375792533545686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569796140","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.00011728401,0.00014495631,0.988072,0.0035668474,0.0017411283,0.00067241973,0.000005640363,0.00014007812,0.005539655],"genre_scores_gemma":[0.06081181,0.00017061614,0.9245297,0.008823969,0.0017210833,0.00002534976,0.00004951832,0.00006280844,0.0038051757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591315,0.000042117103,0.0004950053,0.0015725251,0.0012319284,0.000745268],"domain_scores_gemma":[0.9978842,0.0001921078,0.000121396806,0.0014663398,0.00014805525,0.00018789261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013613821,0.00044124736,0.00045905335,0.0018588244,0.00014588579,0.000862087,0.004526786,0.00018379536,0.000021785358],"category_scores_gemma":[0.0000589259,0.00042529596,0.00007786961,0.0015267322,0.00022102689,0.0010589703,0.0019091154,0.00068996946,0.00017126137],"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.0000046230925,0.000033897497,0.0000327278,0.000015547146,0.0000032896876,0.0001195634,0.00031685413,0.012336944,0.00005583112,0.014446785,0.00016953038,0.9724644],"study_design_scores_gemma":[0.00092028274,0.00043303115,0.00060527585,0.0007875358,0.0000056648055,0.000024923846,2.6249987e-7,0.912908,0.0010128599,0.06819475,0.014010415,0.0010970116],"about_ca_topic_score_codex":0.00002865544,"about_ca_topic_score_gemma":0.00019565348,"teacher_disagreement_score":0.9713674,"about_ca_system_score_codex":0.000288194,"about_ca_system_score_gemma":0.0002943804,"threshold_uncertainty_score":0.9998199},"labels":[],"label_agreement":null},{"id":"W1571329508","doi":"10.1007/978-3-540-89197-0_71","title":"Probabilistic Nogood Store as a Heuristic","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Heuristics; Probabilistic logic; Computer science; Heuristic; Binary number; Artificial intelligence; Machine learning; Theoretical computer science; Mathematics","score_opus":0.018029281322692662,"score_gpt":0.23571535280376482,"score_spread":0.21768607148107216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571329508","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.000029168563,0.00044853738,0.98206776,0.00065400655,0.002122546,0.0005702933,0.000010702591,0.0002934036,0.013803582],"genre_scores_gemma":[0.06593307,0.00037940915,0.91742665,0.005027043,0.0020803686,0.000057782872,0.000067549496,0.00014812636,0.008880008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995178,0.00003125789,0.000530531,0.002054417,0.0013868834,0.0008189417],"domain_scores_gemma":[0.99676687,0.00032498565,0.00028064003,0.0021943732,0.0002029892,0.00023015357],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00057190494,0.00064216874,0.00056715275,0.0008617072,0.0003536765,0.00076345005,0.005744161,0.00023376412,0.000040769377],"category_scores_gemma":[0.00018447997,0.00058598345,0.00014503975,0.00076756167,0.00088159036,0.00095520774,0.00279075,0.0007866659,0.0003854462],"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.0000057434254,0.000084852014,0.000014165024,0.00010111185,0.000024847506,0.0014489477,0.0007810331,0.008096101,0.000008890294,0.05723263,0.0007772244,0.93142444],"study_design_scores_gemma":[0.0006080175,0.0005548726,0.0001562986,0.00061792025,0.000027267455,0.00056364766,1.789227e-7,0.653226,0.00013651753,0.30553895,0.036716703,0.0018535873],"about_ca_topic_score_codex":0.000027811655,"about_ca_topic_score_gemma":0.00003456008,"teacher_disagreement_score":0.92957085,"about_ca_system_score_codex":0.000295764,"about_ca_system_score_gemma":0.00059102237,"threshold_uncertainty_score":0.9996592},"labels":[],"label_agreement":null},{"id":"W1572714866","doi":"10.1002/atr.1207","title":"A methodology for schedule‐based paths recommendation in multimodal public transportation networks","year":2012,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":14,"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":"Schedule; Transport engineering; Public transport; Computer science; Flow network; Operations research; Engineering; Mathematical optimization; Mathematics","score_opus":0.06148860993418383,"score_gpt":0.3239089192985081,"score_spread":0.2624203093643243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572714866","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.056909718,0.000094086776,0.94060296,0.0010834229,0.0009957147,0.0002657038,0.000014744991,0.000024469888,0.000009157469],"genre_scores_gemma":[0.5496929,0.000028092605,0.44981337,0.00012104117,0.000097447504,0.00001824311,0.00021877288,0.000007374847,0.0000027295048],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9985556,0.00010213768,0.0006912051,0.00016688387,0.00017880958,0.00030535622],"domain_scores_gemma":[0.9987841,0.0002357657,0.0005600709,0.00012970521,0.00019248856,0.00009787144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013962024,0.00012886697,0.0002393022,0.00034866904,0.00005301127,0.00004181696,0.00028818258,0.000072474424,0.000010747919],"category_scores_gemma":[0.00005497813,0.0001244496,0.00011753647,0.00043469341,0.000015201352,0.0039875787,0.000001672919,0.00017043423,7.1623964e-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.00036320297,0.00068077643,0.020469515,0.000105528816,0.00006772877,0.000012090741,0.0024062956,0.15654549,0.0018038411,0.026913397,0.00011839131,0.79051375],"study_design_scores_gemma":[0.0104054455,0.0007769555,0.76806,0.00013166251,0.00012014656,0.0000052464375,0.0007697368,0.19838044,0.0024838329,0.0043765428,0.0138665475,0.00062344223],"about_ca_topic_score_codex":0.000004032139,"about_ca_topic_score_gemma":0.00008694269,"teacher_disagreement_score":0.7898903,"about_ca_system_score_codex":0.000053833024,"about_ca_system_score_gemma":0.000043975047,"threshold_uncertainty_score":0.50749075},"labels":[],"label_agreement":null},{"id":"W1573698156","doi":"10.1007/3-540-45754-2_13","title":"Immersed Visual Data Mining: Walking the Walk","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Data warehouse; Architecture; Visualization; XML; Human–computer interaction; Interactive visual analysis; Data visualization; Data mining; World Wide Web","score_opus":0.039145002991682026,"score_gpt":0.2825056599917915,"score_spread":0.24336065700010948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573698156","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.000012219471,0.00037363134,0.9817306,0.0025792378,0.0028785332,0.00036609883,0.000009534218,0.00016560833,0.011884562],"genre_scores_gemma":[0.026946051,0.00036363158,0.95413446,0.010094479,0.0035411317,0.000016732352,0.00021382947,0.00011666485,0.0045730025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500364,0.000048174847,0.00051693665,0.0022174171,0.0013593913,0.0008544297],"domain_scores_gemma":[0.9946391,0.0005546388,0.00031757922,0.0042429627,0.00010903884,0.00013667204],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0018572344,0.00056209444,0.00043883006,0.00059911155,0.0004944188,0.0017252518,0.015698293,0.00018675161,0.000047969937],"category_scores_gemma":[0.00010374072,0.00040865835,0.0000923047,0.00093705027,0.00071295595,0.0018089454,0.010653995,0.0007283215,0.0000926932],"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.0000019220693,0.00001956947,0.0000151758095,0.000011503987,0.000016989212,0.00017941858,0.0003299919,0.0006846302,0.000011449896,0.007880098,0.00053943205,0.99030983],"study_design_scores_gemma":[0.000249795,0.00009338929,0.000065056105,0.00020937769,0.000018641587,0.000074916075,9.81123e-7,0.9131372,0.000074862146,0.026792461,0.058573123,0.0007102188],"about_ca_topic_score_codex":0.00002798814,"about_ca_topic_score_gemma":0.00006176911,"teacher_disagreement_score":0.9895996,"about_ca_system_score_codex":0.00013118002,"about_ca_system_score_gemma":0.00028572735,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W1581079409","doi":"10.1007/3-540-35589-8_28","title":"A Quantitative Similarity Measure for Maps","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Measure (data warehouse); Typification; Cartographic generalization; Computer science; Similarity (geometry); Generalization; Similarity measure; Scale (ratio); Quality (philosophy); Data mining; Selection (genetic algorithm); Artificial intelligence; Information retrieval; Mathematics; Geography; Cartography; Image (mathematics)","score_opus":0.053712895015598346,"score_gpt":0.2621101739334201,"score_spread":0.20839727891782178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581079409","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":[1.8444602e-8,0.0000882644,0.5009302,0.00045213685,0.0002141906,0.00026995863,0.000118562384,0.00012097492,0.49780568],"genre_scores_gemma":[0.00000816547,0.000010475203,0.20487121,0.00033245992,0.000114640345,0.000016870496,0.00027113073,0.000020662786,0.7943544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986449,0.0000071695154,0.00022360885,0.00057094375,0.00032909538,0.00022432365],"domain_scores_gemma":[0.998934,0.00008707756,0.00012895932,0.00066250743,0.00013988178,0.00004761994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002728813,0.00026594478,0.00026967246,0.00013762127,0.00009482457,0.0002684425,0.0011326153,0.00014223877,0.000055548695],"category_scores_gemma":[0.000014022125,0.00023460394,0.00017152744,0.00003479698,0.00004062206,0.0004549986,0.00039164122,0.00014800682,0.00017758476],"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.0000021855237,0.0000074834725,2.90606e-7,0.000020619067,0.000031670774,0.0000057653306,0.000006201399,0.0000017356704,4.5615204e-7,0.69769645,0.29209298,0.010134148],"study_design_scores_gemma":[0.00018651357,0.000087546876,0.0000033760073,0.000033662473,0.000024285026,6.828849e-7,0.0000014682236,0.006411231,0.0000067313235,0.24083689,0.75210774,0.00029989902],"about_ca_topic_score_codex":0.000020023961,"about_ca_topic_score_gemma":0.000066842375,"teacher_disagreement_score":0.46001473,"about_ca_system_score_codex":0.00003111191,"about_ca_system_score_gemma":0.000038983446,"threshold_uncertainty_score":0.9566871},"labels":[],"label_agreement":null},{"id":"W1581306068","doi":"10.1007/3-540-44732-6_22","title":"A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Line segment; Tree (set theory); Sorting; Data structure; Tree structure; Process (computing); Segment tree; Image processing; Algorithm; Line (geometry); Path (computing); Time complexity; Scheme (mathematics); Image (mathematics); Artificial intelligence; Binary tree; Interval tree; Mathematics","score_opus":0.027390248709639648,"score_gpt":0.2532196908368677,"score_spread":0.22582944212722803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581306068","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.000060961043,0.000051936702,0.99699515,0.00016784533,0.0008515903,0.0012900915,0.00013397544,0.00012205323,0.00032642158],"genre_scores_gemma":[0.0006981654,0.00007859605,0.99705666,0.00031260273,0.00072140497,0.000048786584,0.00031946538,0.000034930803,0.00072937977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685603,0.000022609134,0.0005957106,0.0012960666,0.0006933146,0.00053623883],"domain_scores_gemma":[0.99787027,0.00034471197,0.0004202372,0.0009386982,0.00029302904,0.00013303215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089305756,0.00041603946,0.0004976608,0.001368089,0.00015400657,0.0004477057,0.0021497344,0.00020848888,0.00003828345],"category_scores_gemma":[0.00004560792,0.00039899437,0.00016631486,0.0008176367,0.00011438898,0.0013229328,0.0005625399,0.00017784421,0.000014774502],"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.00000906871,0.000048769663,0.0000062971535,0.000034654,0.000016573033,0.000005412471,0.00008635764,0.0007143321,0.00011414663,0.00012297792,0.00020068446,0.9986407],"study_design_scores_gemma":[0.0010049491,0.0011001027,0.00015479658,0.00023141528,0.000028649665,0.000010599613,1.9205775e-7,0.94952303,0.0015593204,0.043990314,0.0017774743,0.00061912584],"about_ca_topic_score_codex":0.00009050086,"about_ca_topic_score_gemma":0.000046336754,"teacher_disagreement_score":0.9980216,"about_ca_system_score_codex":0.00017988354,"about_ca_system_score_gemma":0.000232193,"threshold_uncertainty_score":0.9998462},"labels":[],"label_agreement":null},{"id":"W1582070848","doi":"10.1007/978-3-642-17461-2_32","title":"Approximate Ellipsoid in the Streaming Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Ellipsoid; Computation; Ball (mathematics); Bounded function; Computer science; Approximation algorithm; Factor (programming language); Algorithm; Mathematics; Mathematical analysis; Physics","score_opus":0.019580363951233283,"score_gpt":0.23865807748270756,"score_spread":0.2190777135314743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582070848","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.000055776673,0.00010105907,0.98988926,0.0010225448,0.0008872334,0.0004125249,0.000006180697,0.00009891439,0.0075264783],"genre_scores_gemma":[0.046999145,0.00006534641,0.9490185,0.0027017663,0.00046545325,0.000021766527,0.000016891818,0.00003557795,0.0006755653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648917,0.000028742072,0.00042150426,0.0013536501,0.0010277258,0.0006792389],"domain_scores_gemma":[0.99736965,0.00025897194,0.00019447373,0.0020301112,0.00006991009,0.00007688032],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015898611,0.00045247126,0.00035324862,0.0007244933,0.00024118768,0.0011344474,0.0076416275,0.0002283108,0.0000068916706],"category_scores_gemma":[0.00003859796,0.00032877325,0.00009064291,0.0006499839,0.0004906632,0.0010629611,0.0020247686,0.0013013532,0.000034165412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018750189,0.000046737106,0.000017556844,0.000029360826,0.000005143508,0.00012420153,0.0014198419,0.06610565,0.000104040686,0.08609121,0.000030004228,0.8460244],"study_design_scores_gemma":[0.000121659425,0.000029960966,0.000019696596,0.000089060755,0.000003216856,0.0000151241065,2.6522935e-7,0.80259573,0.00016305488,0.19565524,0.0009644301,0.00034254612],"about_ca_topic_score_codex":0.000020275977,"about_ca_topic_score_gemma":0.00015657846,"teacher_disagreement_score":0.84568185,"about_ca_system_score_codex":0.00008794244,"about_ca_system_score_gemma":0.00020388914,"threshold_uncertainty_score":0.99991643},"labels":[],"label_agreement":null},{"id":"W1588404442","doi":"10.1007/978-3-540-73580-9_27","title":"An Analysis of Map-Based Abstraction and Refinement","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"","keywords":"Testbed; Abstraction; Variety (cybernetics); Computer science; Pathfinding; Theoretical computer science; Programming language; Artificial intelligence; World Wide Web; Graph","score_opus":0.02182059924059719,"score_gpt":0.2736472474865811,"score_spread":0.2518266482459839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588404442","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.00018608246,0.000101328915,0.99779075,0.00022346774,0.0005068446,0.00015736256,0.000010877925,0.000060876042,0.0009624354],"genre_scores_gemma":[0.15168817,0.000028875536,0.8469212,0.0009352558,0.00017316114,0.00000315324,0.000068320434,0.000017183975,0.000164689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739766,0.000014738885,0.0004272609,0.0010456983,0.00079252827,0.0003221005],"domain_scores_gemma":[0.99808604,0.00015389171,0.00030341835,0.0012112866,0.00013504493,0.000110321904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011012647,0.00028142132,0.00040996977,0.0021720391,0.00010197616,0.00032782098,0.0017027981,0.00013336462,0.000025551108],"category_scores_gemma":[0.00001226262,0.0002597543,0.00009153442,0.0009546813,0.00033059096,0.000660317,0.00045707478,0.00026246102,0.000004592479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048288457,0.000050418388,0.00020211411,0.000037015903,0.00006289068,0.000033823897,0.00013621627,0.054711323,0.00009232576,0.010095381,0.00000773581,0.9345659],"study_design_scores_gemma":[0.00015593518,0.00016305715,0.0026541955,0.00007073104,0.00009032981,0.0000014235117,1.6518017e-7,0.9886259,0.00064633787,0.005806716,0.0014607265,0.00032451414],"about_ca_topic_score_codex":0.00006325617,"about_ca_topic_score_gemma":0.00018658896,"teacher_disagreement_score":0.9342414,"about_ca_system_score_codex":0.00010021003,"about_ca_system_score_gemma":0.00009839902,"threshold_uncertainty_score":0.99998546},"labels":[],"label_agreement":null},{"id":"W1590149829","doi":"","title":"Concurrent Parallel Shortest Path Computation.","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Computer science; Shortest path problem; Parallel computing; Constrained Shortest Path First; Computation; K shortest path routing; Path (computing); Topology (electrical circuits); Theoretical computer science; Algorithm; Mathematics; Combinatorics; Computer network; Graph","score_opus":0.02065145057853855,"score_gpt":0.26182881408960784,"score_spread":0.2411773635110693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590149829","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.00020983384,0.000058191115,0.973288,0.0022531091,0.00023171112,0.0000849359,0.0000017053133,0.00022965093,0.023642845],"genre_scores_gemma":[0.6392718,0.000025273746,0.35563868,0.0015133286,0.00018717117,0.00000998567,0.00003398308,0.0000051484512,0.0033146366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930376,0.00001226686,0.0001283475,0.00022412882,0.00017217809,0.0001593463],"domain_scores_gemma":[0.9996493,0.000021478365,0.000028120232,0.00021933988,0.00002534268,0.00005640664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010165009,0.00007523564,0.000067784014,0.000041225714,0.000056369856,0.0002096377,0.0005328556,0.000012324886,0.00006442759],"category_scores_gemma":[0.0000037439559,0.000062910935,0.000026585494,0.00014438921,0.000015535437,0.0007740973,0.00024515096,0.000041622687,0.0006106963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2330487e-7,0.00006451172,0.0001747294,0.0000014149548,0.0000070595333,0.000004204202,0.00005411369,0.0011633851,0.0000029012954,0.18553422,0.06315478,0.74983853],"study_design_scores_gemma":[0.0002264576,0.000023418663,0.0017833668,0.0000032244984,0.0000022817799,0.0000019636298,0.000009457403,0.83556837,0.000017069295,0.00064293196,0.16159596,0.00012552542],"about_ca_topic_score_codex":0.0000058426854,"about_ca_topic_score_gemma":0.0000050312397,"teacher_disagreement_score":0.83440495,"about_ca_system_score_codex":0.000013301147,"about_ca_system_score_gemma":0.000010937795,"threshold_uncertainty_score":0.7849469},"labels":[],"label_agreement":null},{"id":"W1590505239","doi":"10.1007/978-3-540-74472-6_7","title":"Shortest Path Queries Between Geometric Objects on Surfaces","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Surface (topology); Path (computing); Euclidean geometry; Face (sociological concept); Mathematics; Genus; Computer science; Geometry","score_opus":0.03260386802131227,"score_gpt":0.2616404646236558,"score_spread":0.22903659660234355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590505239","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.00018092811,0.00034207935,0.9811378,0.00025699646,0.001918939,0.000411896,0.000023801775,0.00029169838,0.015435866],"genre_scores_gemma":[0.36597028,0.00022124713,0.62677556,0.0024007342,0.0019218981,0.000011165488,0.00008306723,0.00010107798,0.0025149568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458426,0.00002944882,0.00059986574,0.002009559,0.0017725788,0.0010042957],"domain_scores_gemma":[0.9964354,0.00092306547,0.00031833502,0.001907405,0.00017774892,0.00023802744],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016236046,0.0007108617,0.0006740235,0.0026481356,0.00033563192,0.0012424614,0.00533132,0.00030973495,0.000023675402],"category_scores_gemma":[0.00013113685,0.0006283293,0.00014077123,0.002246396,0.00064313516,0.0012075348,0.0023320531,0.00091044157,0.00016754436],"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.000002841374,0.00003210958,0.0005117489,0.000025680787,0.00002061602,0.00020571066,0.00020724056,0.0045319335,0.000006720481,0.013732593,0.000096878255,0.9806259],"study_design_scores_gemma":[0.0022338626,0.0043505686,0.02508949,0.0034325905,0.0001475869,0.0001181484,0.0000035441358,0.53598726,0.007055468,0.3356869,0.075495705,0.010398923],"about_ca_topic_score_codex":0.000034224653,"about_ca_topic_score_gemma":0.000060082817,"teacher_disagreement_score":0.970227,"about_ca_system_score_codex":0.00025536705,"about_ca_system_score_gemma":0.00025351127,"threshold_uncertainty_score":0.99979436},"labels":[],"label_agreement":null},{"id":"W1591816673","doi":"10.1007/978-3-540-39658-1_40","title":"I/O-Efficient Undirected Shortest Paths","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.012924077728041194,"score_gpt":0.23852948296908064,"score_spread":0.22560540524103945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591816673","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.011377174,0.00009560175,0.9856199,0.00041774457,0.0016239765,0.00020563425,0.0000012578681,0.00022820472,0.0004305067],"genre_scores_gemma":[0.6111597,0.0000026382695,0.38822955,0.0005451141,0.00004834577,0.0000055849723,0.000001018899,0.000005121816,0.0000029042917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729216,0.00008365174,0.00026621553,0.0009964661,0.00066612253,0.00069538783],"domain_scores_gemma":[0.99841094,0.00018960048,0.00007206256,0.0010882654,0.00009705471,0.00014209915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089595,0.00022049349,0.00018992531,0.00045376623,0.00025057318,0.0006753705,0.0023663568,0.00004960851,0.000014398519],"category_scores_gemma":[0.00021070204,0.00019126845,0.000048050126,0.003753217,0.00025326805,0.0004806049,0.00066660735,0.00021430086,0.000058858725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012634197,0.00020889132,0.0020008397,0.0000082223105,0.000005563606,0.00010028417,0.0006106294,0.17003374,0.0008350358,0.019134477,0.000042653774,0.8070184],"study_design_scores_gemma":[0.00021899276,0.00006120354,0.0026292522,0.0000239064,0.0000019300971,0.000022701519,5.576227e-7,0.9834992,0.005076837,0.007491591,0.00067523983,0.00029856584],"about_ca_topic_score_codex":0.000017476694,"about_ca_topic_score_gemma":0.00001704674,"teacher_disagreement_score":0.8134655,"about_ca_system_score_codex":0.00010625214,"about_ca_system_score_gemma":0.00016687592,"threshold_uncertainty_score":0.7799701},"labels":[],"label_agreement":null},{"id":"W1591856724","doi":"10.1007/978-3-540-30570-5_23","title":"First-Order Query Rewriting for Inconsistent Databases","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":88,"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; Rewriting; Class (philosophy); Conjunctive query; Query language; Query optimization; Boolean conjunctive query; Database query; Database; Sargable; Data integrity; Order (exchange); Information retrieval; Web search query; Programming language; Relational database; Search engine; Artificial intelligence","score_opus":0.033056032078094426,"score_gpt":0.2629440349701871,"score_spread":0.22988800289209266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591856724","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.0000037228738,0.00034736755,0.99193364,0.0018700275,0.0018684493,0.0007304563,0.000046533118,0.00021714646,0.0029826325],"genre_scores_gemma":[0.0030384744,0.0000756009,0.99324006,0.0022072128,0.00069782493,0.00003538521,0.000064940476,0.000040208477,0.000600286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596286,0.000014548418,0.0005735883,0.0018594693,0.00080942136,0.00078010006],"domain_scores_gemma":[0.9968648,0.0005822836,0.00030227238,0.0018210037,0.00027789682,0.00015172524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009856807,0.0005420489,0.0005019075,0.00077038317,0.00046492918,0.00087255787,0.0037702406,0.00014718411,0.000020421721],"category_scores_gemma":[0.00020747293,0.0005122605,0.00015138906,0.00059303985,0.00048366174,0.0014576137,0.0029252062,0.00046147406,0.00003510539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058674796,0.00005526559,0.000027404476,0.00024898243,0.000027109721,0.00012677143,0.00022877654,0.022551546,0.000012065168,0.29468563,0.0002030388,0.68182755],"study_design_scores_gemma":[0.00080963376,0.0002106789,0.000047304075,0.0016453736,0.000026804044,0.000047818983,5.1041707e-7,0.7074399,0.00033903963,0.25083834,0.037240703,0.0013538967],"about_ca_topic_score_codex":0.00006642721,"about_ca_topic_score_gemma":0.0002055144,"teacher_disagreement_score":0.68488836,"about_ca_system_score_codex":0.00030418072,"about_ca_system_score_gemma":0.00049789436,"threshold_uncertainty_score":0.9997329},"labels":[],"label_agreement":null},{"id":"W1592532873","doi":"10.1109/icde.2015.7113307","title":"Bi-temporal Timeline Index: A data structure for Processing Queries on bi-temporal data","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Timeline; Computer science; Temporal database; Benchmark (surveying); SQL; Implementation; Exploit; Index (typography); Data mining; Database; Information retrieval; Programming language","score_opus":0.14040817073326656,"score_gpt":0.33820071225299186,"score_spread":0.1977925415197253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592532873","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.00090809463,0.00018604919,0.9906751,0.0039830944,0.00072897365,0.0005561645,0.0013664863,0.00043174534,0.0011642715],"genre_scores_gemma":[0.28535247,0.000008487209,0.6874382,0.0017849763,0.0010355944,0.000016470198,0.019553421,0.000048125916,0.004762283],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975891,0.000036927035,0.00033713577,0.0011238126,0.0005236507,0.00038937657],"domain_scores_gemma":[0.9957327,0.00003551779,0.00016492253,0.0037763133,0.00012161686,0.0001688805],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00078140147,0.00025566155,0.0002497615,0.00016054443,0.00015114118,0.0010077916,0.006595451,0.00007141895,0.000026086105],"category_scores_gemma":[0.00013949422,0.00019528334,0.000020933618,0.0004860091,0.00006892658,0.0056748358,0.005244872,0.00014303828,0.00003559584],"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.00008326535,0.00015985889,0.0030251718,0.00012233359,0.000059160713,0.0000305796,0.000231401,0.000043763772,0.0000139703325,0.010164413,0.59016454,0.39590153],"study_design_scores_gemma":[0.0007650274,0.00013037762,0.0001715245,0.000030671777,0.000013248304,0.0000045454103,0.000096250544,0.6086934,0.000058322017,0.0028799092,0.38684532,0.00031136925],"about_ca_topic_score_codex":0.00021921612,"about_ca_topic_score_gemma":0.00032543528,"teacher_disagreement_score":0.6086497,"about_ca_system_score_codex":0.000023057677,"about_ca_system_score_gemma":0.00024558196,"threshold_uncertainty_score":0.99877936},"labels":[],"label_agreement":null},{"id":"W1594349942","doi":"10.1007/978-3-642-19668-3_12","title":"Uncertainty in Rank Join","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Join (topology); Ranking (information retrieval); Rank (graph theory); Result set; sort; Operator (biology); Set (abstract data type); Information retrieval; Domain (mathematical analysis); Aggregate (composite); Sort-merge join; Semantics (computer science); Theoretical computer science; Core (optical fiber); Learning to rank; Query optimization; Data mining; Programming language","score_opus":0.024074171957326612,"score_gpt":0.23653624849568025,"score_spread":0.21246207653835364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594349942","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.00002263077,0.00026387468,0.97747403,0.00054901495,0.001852967,0.00037837517,0.0000058386263,0.00014435405,0.01930891],"genre_scores_gemma":[0.08059894,0.00038185687,0.9066018,0.00584951,0.0012100564,0.00004138513,0.00004628457,0.00010833771,0.0051618274],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607337,0.00003584349,0.0005477833,0.0017081413,0.0008508292,0.0007840574],"domain_scores_gemma":[0.99755514,0.00019163592,0.00022151576,0.0017878037,0.00010099129,0.00014292804],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012095723,0.0005200372,0.0005297121,0.0013122412,0.0001308069,0.00055800803,0.0055412757,0.00023654386,0.00006721245],"category_scores_gemma":[0.00005375055,0.00047153153,0.00011227191,0.0008611292,0.0005093298,0.0011420945,0.0026788942,0.00078111363,0.00015784656],"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.0000043666,0.000033990826,0.000049568964,0.000026328114,0.000007022241,0.00022453496,0.0004858285,0.0067100655,0.000011204904,0.061158575,0.00010111952,0.9311874],"study_design_scores_gemma":[0.00061834825,0.00015876086,0.00040157663,0.0004661476,0.0000073464616,0.0000280299,1.6190347e-7,0.49073917,0.00020464767,0.49146307,0.014795295,0.0011174424],"about_ca_topic_score_codex":0.00012686345,"about_ca_topic_score_gemma":0.00030627396,"teacher_disagreement_score":0.9300699,"about_ca_system_score_codex":0.0002445767,"about_ca_system_score_gemma":0.00028069623,"threshold_uncertainty_score":0.99983925},"labels":[],"label_agreement":null},{"id":"W1595500906","doi":"10.1007/11880592_5","title":"A Supervised Learning Approach to Entity Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":20,"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 Montréal","funders":"","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Key (lock); Baseline (sea); Artificial intelligence; Search engine; Supervised learning; Machine learning; Web search query; Data mining; Artificial neural network","score_opus":0.024429425519479422,"score_gpt":0.2428645211463592,"score_spread":0.2184350956268798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595500906","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.00005043288,0.000091407244,0.95943344,0.00038883105,0.00077939604,0.0004964828,0.000004805655,0.00024558723,0.038509645],"genre_scores_gemma":[0.02800901,0.000016344024,0.96423185,0.0011410924,0.00068601104,0.000016424146,0.000047618858,0.000046998324,0.0058046645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952332,0.0000501899,0.0004125731,0.0019794458,0.001446079,0.0008785149],"domain_scores_gemma":[0.9978784,0.00014211597,0.000104271756,0.0014754562,0.00018176872,0.00021800787],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013304732,0.00049445056,0.00046166652,0.0012352875,0.0003567496,0.0015807861,0.005526937,0.0001906007,0.00001591768],"category_scores_gemma":[0.000044222532,0.00047081194,0.00012472532,0.0011519421,0.00031661504,0.0009969495,0.004150794,0.00096810993,0.00017089478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031516674,0.00007356645,0.000091020156,0.00006607711,0.00001243061,0.00006556038,0.00054152997,0.17554125,0.00005666175,0.025518877,0.00037651902,0.7976534],"study_design_scores_gemma":[0.0002394009,0.00013272883,0.00018986007,0.00012939033,0.000006366746,0.000015512649,2.1762176e-7,0.97503924,0.00024063225,0.012600747,0.010648714,0.00075715844],"about_ca_topic_score_codex":0.00009579392,"about_ca_topic_score_gemma":0.000022381077,"teacher_disagreement_score":0.799498,"about_ca_system_score_codex":0.00022949779,"about_ca_system_score_gemma":0.00023535396,"threshold_uncertainty_score":0.9998536},"labels":[],"label_agreement":null},{"id":"W1595627082","doi":"10.1007/978-3-642-02982-0_26","title":"Efficient Evaluation of Static and Dynamic Optimal Route Queries","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Graph; Shortest path problem; Dynamic problem; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Algorithm; Path (computing); Dynamic programming; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.01677437801556516,"score_gpt":0.2665094323699007,"score_spread":0.24973505435433555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595627082","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.0012100157,0.00042976433,0.9959666,0.00038898183,0.0005386288,0.00043845017,0.000010102578,0.000056417255,0.00096105563],"genre_scores_gemma":[0.28399396,0.000055261044,0.7152387,0.00034777474,0.00007697185,0.0000071491836,0.000017866685,0.000017688992,0.00024460457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677026,0.00004243158,0.00041054253,0.0009849971,0.0014346656,0.00035709393],"domain_scores_gemma":[0.9983334,0.00014833723,0.00027450395,0.00089375983,0.00027145763,0.00007856355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017435647,0.0003235126,0.00036750612,0.0006376031,0.000118468895,0.00036796232,0.0016120257,0.00010302952,0.000008769954],"category_scores_gemma":[0.000054522105,0.00029230892,0.000053724645,0.0003940423,0.00050610193,0.000394763,0.0009820441,0.0002587947,0.0000058250134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019423771,0.000017690987,0.0000046875225,0.000024959476,0.000006890586,0.000008583086,0.00037515923,0.14240535,0.000029780587,0.008195241,0.00000282286,0.8489269],"study_design_scores_gemma":[0.00024856863,0.00014219467,0.00038959927,0.0001898661,0.000022510872,0.000009972213,3.1100424e-7,0.95028955,0.000089221125,0.04821778,0.00011019748,0.00029022034],"about_ca_topic_score_codex":0.000010113465,"about_ca_topic_score_gemma":0.000021205195,"teacher_disagreement_score":0.8486367,"about_ca_system_score_codex":0.00018531013,"about_ca_system_score_gemma":0.0003064341,"threshold_uncertainty_score":0.9999529},"labels":[],"label_agreement":null},{"id":"W1596527724","doi":"10.1007/978-3-540-24571-1_73","title":"Similarity Search and Dimensionality Reduction: Not All Dimensions Are Equally Useful","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Dimensionality reduction; Search engine indexing; Computer science; Curse of dimensionality; Reduction (mathematics); Speedup; Nearest neighbor search; Similarity (geometry); Overhead (engineering); Diffusion map; Space (punctuation); Range query (database); Range (aeronautics); Process (computing); Similitude; Data mining; Algorithm; Theoretical computer science; Nonlinear dimensionality reduction; Artificial intelligence; Mathematics; Information retrieval; Search engine; Parallel computing; Web search query","score_opus":0.04871447997598213,"score_gpt":0.27806901145447543,"score_spread":0.2293545314784933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596527724","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.00044613032,0.00036608128,0.99009967,0.005683007,0.0017604358,0.00047038976,0.000027599515,0.00020601871,0.00094068714],"genre_scores_gemma":[0.2760356,0.0002699987,0.71705794,0.0044372263,0.0009218008,0.00001329823,0.000053178977,0.00006536516,0.0011455538],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950077,0.000058689602,0.00050594466,0.002162285,0.0015198422,0.00074554636],"domain_scores_gemma":[0.99721503,0.0002468446,0.00020270213,0.001764034,0.00027830238,0.0002931105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014398552,0.0005573078,0.0005365164,0.00063180923,0.0005060216,0.0008978898,0.0026136513,0.00028184528,0.00003157844],"category_scores_gemma":[0.000066300985,0.0005118865,0.000110105044,0.0005393651,0.0010004094,0.0012700858,0.0044119735,0.0010158754,0.00004120488],"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.000033943514,0.00031147464,0.00020845322,0.00028443855,0.00013438138,0.0009878718,0.0018394646,0.064763054,0.0006356178,0.4296053,0.00046095258,0.50073504],"study_design_scores_gemma":[0.0015252832,0.00061947893,0.0037510372,0.0014072541,0.00007080763,0.00035748092,0.0000021584704,0.32842934,0.0028377096,0.65100324,0.007003482,0.0029927318],"about_ca_topic_score_codex":0.00006434696,"about_ca_topic_score_gemma":0.00005768525,"teacher_disagreement_score":0.49774233,"about_ca_system_score_codex":0.00029528493,"about_ca_system_score_gemma":0.00041207665,"threshold_uncertainty_score":0.99973327},"labels":[],"label_agreement":null},{"id":"W1596588646","doi":"10.1007/978-3-642-38562-9_55","title":"Probabilistic Graph Summarization","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Victoria","funders":"","keywords":"Automatic summarization; Computer science; Scalability; Probabilistic logic; Graph; Theoretical computer science; Algorithm; Data mining; Artificial intelligence; Database","score_opus":0.014928164622190572,"score_gpt":0.2209521364385043,"score_spread":0.20602397181631374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596588646","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.0000067634,0.0001103677,0.98467314,0.0005855737,0.0018015376,0.00076203287,0.000004989426,0.0002212224,0.011834346],"genre_scores_gemma":[0.009529417,0.00008884177,0.9815614,0.0022709724,0.00083152764,0.000059247006,0.00007347791,0.00006386494,0.0055212076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965613,0.00002336752,0.00042953016,0.0014732135,0.0009419618,0.0005706247],"domain_scores_gemma":[0.99759555,0.00018129594,0.00023382207,0.0016450566,0.00020633647,0.00013791287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00062185427,0.00044391866,0.0003599337,0.0008831454,0.00020609805,0.0012567492,0.004097972,0.00019053873,0.00006815427],"category_scores_gemma":[0.00007408593,0.00039463575,0.0000924574,0.0007845308,0.0004895585,0.0015063868,0.00203946,0.00045332976,0.00027514494],"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":[8.9979386e-7,0.000022448587,0.000013715547,0.000048949107,0.000008348521,0.00003122879,0.00013237052,0.0074384077,0.000014622589,0.17205441,0.00021717255,0.8200174],"study_design_scores_gemma":[0.00013849862,0.00008191104,0.00007924389,0.00017878553,0.000006745286,0.000009467275,3.3845456e-8,0.51019496,0.00007886555,0.48495844,0.003753257,0.00051979395],"about_ca_topic_score_codex":0.000020927497,"about_ca_topic_score_gemma":0.000028603996,"teacher_disagreement_score":0.81949764,"about_ca_system_score_codex":0.00015069115,"about_ca_system_score_gemma":0.00021241911,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W1597331078","doi":"10.5555/963600.963624","title":"A new histogram method for sparse attributes: the averaged rectangular attribute cardinality map","year":2003,"lang":"en","type":"article","venue":"Proceedings of the 1st international symposium on Information and communication technologies","topic":"Data Management and Algorithms","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":"Histogram; Cardinality (data modeling); Query optimization; Oracle; Computer science; Set (abstract data type); Data mining; Algorithm; Result set; Mathematics; Pattern recognition (psychology); Artificial intelligence; Image (mathematics)","score_opus":0.018469531074071448,"score_gpt":0.25767338078929375,"score_spread":0.2392038497152223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597331078","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.001301868,0.0003389965,0.84608376,0.13643515,0.0006160614,0.0013992409,0.00006537253,0.0006998587,0.013059713],"genre_scores_gemma":[0.5272655,0.0013116947,0.46799257,0.0016647148,0.00003147,0.00045282394,0.00008422709,0.000014692569,0.0011822738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990708,0.000022556655,0.0003716758,0.00013645613,0.00026876252,0.00012972241],"domain_scores_gemma":[0.99852616,0.00014711828,0.00045538487,0.00050669693,0.00034615456,0.000018503977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010556129,0.00012397274,0.0001270976,0.00010786854,0.00032863332,0.0003792834,0.0026543231,0.00007077476,0.0000023829243],"category_scores_gemma":[0.00036386412,0.0000812605,0.000077690034,0.0003167047,0.0000876165,0.0013979486,0.00072373234,0.00017882502,0.0000048162037],"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.000012308742,0.00001818777,0.00033214223,0.000027332304,0.000054684628,9.991995e-9,0.0003954128,0.000023370409,0.00023122833,0.9214229,0.016038617,0.061443824],"study_design_scores_gemma":[0.0007690981,0.00010966653,0.00039480653,0.00008948574,0.000032712705,0.000010182639,0.0018276547,0.01326431,0.034506537,0.08352478,0.8652332,0.0002375923],"about_ca_topic_score_codex":0.00003182951,"about_ca_topic_score_gemma":0.0000015680278,"teacher_disagreement_score":0.8491946,"about_ca_system_score_codex":0.00007644938,"about_ca_system_score_gemma":0.000020568705,"threshold_uncertainty_score":0.4932437},"labels":[],"label_agreement":null},{"id":"W1599696396","doi":"","title":"Anytime measures for top-k algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":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; Probabilistic logic; Computation; Ranking (information retrieval); Algorithm; Identification (biology); Point (geometry); Data mining; Asset (computer security); Theoretical computer science; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.025895331435677,"score_gpt":0.27623642975701723,"score_spread":0.2503410983213402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599696396","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.00009589669,0.00004392652,0.97600615,0.00063275575,0.00042787823,0.00018518146,0.0000026756973,0.00024365091,0.022361862],"genre_scores_gemma":[0.009131682,0.0000070911374,0.97758645,0.0011243867,0.00025940436,0.00001172518,0.000010195607,0.000008052459,0.011861019],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906445,0.0000058429855,0.00014245335,0.00027601628,0.00020475815,0.0003064694],"domain_scores_gemma":[0.99937487,0.0000607102,0.00002914288,0.00040796393,0.00005441027,0.00007291921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076917064,0.00008618759,0.00008323776,0.00009247355,0.00008383708,0.00018024055,0.0008095796,0.000026482374,0.000023658162],"category_scores_gemma":[0.00002353268,0.000071070535,0.00005150015,0.00021932526,0.00001563973,0.00061961473,0.00020123513,0.000034300465,0.0000914164],"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.000002701052,0.000035962956,0.000060965613,0.000005617878,0.000015199001,0.0000070733627,0.00005268075,0.0000036540243,0.00018853841,0.09806464,0.027009882,0.8745531],"study_design_scores_gemma":[0.0007524998,0.0001432646,0.0011911064,0.000007535067,0.000009618141,0.000005380764,0.000062425286,0.11477292,0.010206826,0.009553925,0.8629124,0.0003820761],"about_ca_topic_score_codex":0.000017279266,"about_ca_topic_score_gemma":0.000010960337,"teacher_disagreement_score":0.874171,"about_ca_system_score_codex":0.000013075367,"about_ca_system_score_gemma":0.000010664774,"threshold_uncertainty_score":0.2898172},"labels":[],"label_agreement":null},{"id":"W1601136399","doi":"10.1007/978-3-540-39406-8_11","title":"L-ToPSS – Push-Oriented Location-Based Services","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01013617173920688,"score_gpt":0.22494480688487498,"score_spread":0.2148086351456681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601136399","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.000010820504,0.00030740674,0.98991424,0.0012994476,0.0026116988,0.00040157992,0.000008721707,0.00023487947,0.0052111987],"genre_scores_gemma":[0.018242184,0.00003842132,0.9662402,0.012834855,0.0005671479,0.000026505675,0.00009182614,0.0000675309,0.0018913073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584645,0.000035518442,0.00049276144,0.001762737,0.0011691761,0.0006933615],"domain_scores_gemma":[0.9968746,0.00021277287,0.00030714172,0.002078163,0.00034789863,0.00017943005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077175576,0.00056084944,0.00042935557,0.0009366279,0.0002946892,0.00094032625,0.004629193,0.00022235732,0.00003651641],"category_scores_gemma":[0.000032466847,0.00052536395,0.00010170676,0.0012934624,0.0004147557,0.0011591119,0.0010823928,0.00051269185,0.00013248068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006047904,0.000108966786,0.00016809537,0.00026978654,0.000030045005,0.00016776018,0.0004231792,0.08416572,0.000037736096,0.09975048,0.00022215077,0.81465006],"study_design_scores_gemma":[0.00040309218,0.000111085086,0.00009344994,0.0004195416,0.000012530943,0.000011967202,2.2675906e-7,0.92226136,0.0006822037,0.042897657,0.032243855,0.0008630056],"about_ca_topic_score_codex":0.000034723744,"about_ca_topic_score_gemma":0.00006485631,"teacher_disagreement_score":0.83809566,"about_ca_system_score_codex":0.00020303339,"about_ca_system_score_gemma":0.00036112656,"threshold_uncertainty_score":0.9997198},"labels":[],"label_agreement":null},{"id":"W1604896632","doi":"10.1007/3-540-44886-1_15","title":"Discovering Temporal/Causal Rules: A Comparison of Methods","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Regina","funders":"","keywords":"Computer science; Preprocessor; Data mining; Artificial intelligence; Domain (mathematical analysis); Tetrad; Data pre-processing; Machine learning; Mathematics","score_opus":0.04298376201132736,"score_gpt":0.3364625450889709,"score_spread":0.2934787830776435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604896632","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.000031037274,0.0006105195,0.9915996,0.00027207492,0.001921281,0.0003218443,0.000010756394,0.00010435688,0.0051284987],"genre_scores_gemma":[0.007575976,0.000035809702,0.9913688,0.00041807303,0.00015847918,0.000005374976,0.000013535132,0.000029294133,0.0003946652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962255,0.000078662546,0.00079726154,0.0014415714,0.0008478742,0.00060918217],"domain_scores_gemma":[0.99704105,0.00038128986,0.00053263817,0.0017777072,0.00013101955,0.00013629593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015719443,0.00053086085,0.0008320028,0.0008771623,0.00016160782,0.00056112953,0.004366865,0.000207333,0.000020821371],"category_scores_gemma":[0.0000878539,0.00047888877,0.00016009188,0.000676567,0.00063600176,0.0011355213,0.0022981772,0.00063256174,0.000023317576],"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.0000030444235,0.000061655184,0.00018302549,0.00009279518,0.000026200181,0.000026262307,0.0006166864,0.0070519447,0.00013383167,0.05159555,0.00012695469,0.9400821],"study_design_scores_gemma":[0.00043684052,0.00032078597,0.00010929386,0.0006454559,0.000027503162,0.000022597598,0.0000011097067,0.82125217,0.0051150015,0.14873491,0.022099454,0.0012349134],"about_ca_topic_score_codex":0.0000306657,"about_ca_topic_score_gemma":0.000021822709,"teacher_disagreement_score":0.9388471,"about_ca_system_score_codex":0.00014566285,"about_ca_system_score_gemma":0.00021098868,"threshold_uncertainty_score":0.9997663},"labels":[],"label_agreement":null},{"id":"W16075771","doi":"10.4018/978-1-59140-560-3.ch015","title":"Component-Based Generalized Database Index Model","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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":"Database; Computer science; Index (typography); Data mining; Database index; Database design; Nearest neighbor search; Similarity (geometry); Database model; Component (thermodynamics); Quality (philosophy); Information retrieval; Search engine indexing; Artificial intelligence","score_opus":0.030647775382697875,"score_gpt":0.2526843373543047,"score_spread":0.22203656197160682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16075771","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.000005651251,0.000119517266,0.407497,0.00016580985,0.00032757636,0.00027680726,0.00052917365,0.00032214334,0.5907563],"genre_scores_gemma":[0.01389654,0.000028401026,0.40088436,0.012249918,0.0014142196,0.00007677263,0.00079148816,0.00017728168,0.570481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971457,0.000021710244,0.0004737553,0.0010266593,0.00081185444,0.00052033516],"domain_scores_gemma":[0.9973593,0.000017483477,0.00027076527,0.0020200724,0.0000830695,0.00024930894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018518421,0.0006030822,0.0005036765,0.00015791773,0.00013819883,0.0004405917,0.0025844695,0.00023944666,0.000045253208],"category_scores_gemma":[0.0000043503715,0.000610697,0.00024382211,0.00003525705,0.00009158751,0.00035974334,0.0013155931,0.00030348587,0.00043255888],"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.000012486116,0.00002106692,0.0000019236243,0.000022858885,0.00005819986,0.00010036748,0.0000049777364,0.001047173,0.000007768217,0.9575678,0.017743265,0.023412129],"study_design_scores_gemma":[0.0011698977,0.000032619377,0.0000032422765,0.00012310068,0.00005942385,0.000007972106,4.666168e-7,0.71368444,0.000024581163,0.12871064,0.15533231,0.0008513003],"about_ca_topic_score_codex":0.00006620579,"about_ca_topic_score_gemma":0.000052923846,"teacher_disagreement_score":0.8288571,"about_ca_system_score_codex":0.00020558687,"about_ca_system_score_gemma":0.00022378688,"threshold_uncertainty_score":0.99963444},"labels":[],"label_agreement":null},{"id":"W1614173561","doi":"10.1287/moor.2014.0706","title":"Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Data Management and Algorithms","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":"Mathematics; Euclidean minimum spanning tree; Spanning tree; Minimum spanning tree; Combinatorics; Euclidean geometry; Minimum weight; Discrete mathematics; Shortest path problem; Subadditivity; Euclidean shortest path; Limit (mathematics); Shortest-path tree; Minimum degree spanning tree; Graph; Longest path problem; Geometry; Mathematical analysis","score_opus":0.1421796790829535,"score_gpt":0.36571574975285154,"score_spread":0.22353607066989803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614173561","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.035622254,0.000100858284,0.9605515,0.0011243197,0.00003045631,0.00061898684,0.0000060924813,0.00002943874,0.0019160772],"genre_scores_gemma":[0.3562585,0.000024015797,0.6422391,0.000024694118,0.00004558711,0.0000913683,0.000014850609,0.000014617472,0.0012872561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988742,0.000052838157,0.0002009811,0.00021584466,0.00039670692,0.0002594268],"domain_scores_gemma":[0.9987194,0.00021074715,0.000025802496,0.0004902092,0.00045355884,0.00010028388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019432805,0.00008318783,0.00014860895,0.00018033427,0.00017342613,0.00047356111,0.0005607628,0.000028393102,0.0000027519598],"category_scores_gemma":[0.00020914355,0.00006156174,0.000017032116,0.0004033685,0.00013116846,0.0004607827,0.00042232222,0.00009561767,0.0000060929597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030037712,0.00039062768,0.00016638786,0.00025838113,0.00010612809,0.0000144960695,0.009370875,0.0140468255,0.00024101623,0.95409024,0.008117139,0.013167874],"study_design_scores_gemma":[0.0004363687,0.00029111968,0.00001985786,0.00006742516,0.0000063629755,0.0000067908795,0.0010038117,0.9915059,0.00021218305,0.005708503,0.00064959977,0.00009206778],"about_ca_topic_score_codex":0.000016853714,"about_ca_topic_score_gemma":0.000027807,"teacher_disagreement_score":0.9774591,"about_ca_system_score_codex":0.000016554064,"about_ca_system_score_gemma":0.000070795824,"threshold_uncertainty_score":0.4566561},"labels":[],"label_agreement":null},{"id":"W1618713168","doi":"10.1016/s1571-0661(04)81007-7","title":"Three approaches to partiality in the sketch data model1 1Research partially supported by the Australian Research Council and NSERC Canada.","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Mount Allison University","funders":"","keywords":"Sketch; Equivalence (formal languages); Computer science; Information retrieval; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","score_opus":0.25763518615005127,"score_gpt":0.336122033931163,"score_spread":0.07848684778111176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1618713168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048206847,0.00013839452,0.9047367,0.044942137,0.00014717183,0.0010152789,0.000018352119,0.000030968327,0.0007641288],"genre_scores_gemma":[0.99085337,0.00001328003,0.008344624,0.0006716969,0.000041490726,0.000049481805,0.000006606849,0.0000072882885,0.000012139383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9916844,0.0010084749,0.00038676726,0.0013840552,0.0036032842,0.0019330527],"domain_scores_gemma":[0.99564445,0.001244611,0.000038470982,0.0026642322,0.00019791286,0.00021032582],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.043395046,0.00020682208,0.00020903724,0.00012677327,0.0005722626,0.0012074768,0.00936482,0.000048609338,0.00001686241],"category_scores_gemma":[0.0012757913,0.00012884714,0.000016650543,0.0032049497,0.0021263186,0.0008287182,0.0028192066,0.0009350677,0.0000068276313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000012771039,0.000074712014,0.00046852417,0.000005849515,0.0000044085123,0.000018808925,0.00050913455,0.00024143068,0.000023445304,0.9711888,0.0030593069,0.024392812],"study_design_scores_gemma":[0.000308086,0.00021810744,0.0017118411,0.000015051299,0.000003273467,0.000017743816,0.000057236437,0.75422794,0.0007365545,0.23476744,0.0076727276,0.0002640136],"about_ca_topic_score_codex":0.018007586,"about_ca_topic_score_gemma":0.2297612,"teacher_disagreement_score":0.94264656,"about_ca_system_score_codex":0.00063765625,"about_ca_system_score_gemma":0.0040635066,"threshold_uncertainty_score":0.99982935},"labels":[],"label_agreement":null},{"id":"W163910197","doi":"","title":"Updatable Indices for Efficient, Generalised Top-k Queries.","year":2011,"lang":"en","type":"article","venue":"Advances in Databases and Information Systems","topic":"Data Management and Algorithms","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 Victoria","funders":"","keywords":"Computer science; Information retrieval; World Wide Web","score_opus":0.02580553964115974,"score_gpt":0.2594260641727355,"score_spread":0.23362052453157578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163910197","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.0020013717,0.0020637254,0.9843838,0.000028732093,0.0009776488,0.0005653076,0.0005052414,0.00008711546,0.00938705],"genre_scores_gemma":[0.5343988,0.011129524,0.44318938,0.0020578501,0.00047377113,0.001273389,0.0067508817,0.00003299046,0.000693444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913704,0.000016948552,0.0003486462,0.00015917662,0.00014383305,0.00019435315],"domain_scores_gemma":[0.9993269,0.000034961853,0.00017728696,0.00037343666,0.00004476758,0.00004265996],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035880375,0.000098945726,0.00012911807,0.00017989868,0.000095136005,0.00021312815,0.00041931556,0.000016184922,0.000005802449],"category_scores_gemma":[0.00003064646,0.000084083294,0.000015268155,0.0002498749,0.000029894682,0.01786989,0.00024852957,0.000034987504,0.000014924933],"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.00002066169,0.000037015634,0.0023705466,0.00039646917,0.000010292849,0.0000014923899,0.0010969316,0.0006485965,0.000003907696,0.92947334,0.002502437,0.06343829],"study_design_scores_gemma":[0.0004983285,0.00003748718,0.00035054545,0.00005515296,0.0000030944746,0.0000034630393,0.00055595295,0.11714797,0.00012217509,0.00009392471,0.88097256,0.00015932722],"about_ca_topic_score_codex":0.0002142273,"about_ca_topic_score_gemma":0.000014487191,"teacher_disagreement_score":0.92937946,"about_ca_system_score_codex":0.000012234817,"about_ca_system_score_gemma":0.000013631724,"threshold_uncertainty_score":0.99586666},"labels":[],"label_agreement":null},{"id":"W165396895","doi":"","title":"K-Nearest Neighbor Search using the Pyramid Technique.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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":"Pyramid (geometry); k-nearest neighbors algorithm; RADIUS; Best bin first; Nearest neighbor graph; Nearest neighbor search; Nearest-neighbor chain algorithm; Range (aeronautics); Point (geometry); Range query (database); Mathematics; Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Combinatorics; Geometry; Search engine; Information retrieval; Cluster analysis; Web search query","score_opus":0.04234192041526704,"score_gpt":0.2690653430377264,"score_spread":0.22672342262245934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165396895","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.0062221596,0.00003740421,0.9696585,0.004957411,0.0003216359,0.0003950076,0.00008280575,0.00011054002,0.018214533],"genre_scores_gemma":[0.9611409,0.0000017722259,0.036853142,0.0011258138,0.00016252759,0.000016390366,0.000101660866,0.0000116497295,0.00058615336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984418,0.000060195027,0.00019442067,0.000395789,0.00046506582,0.00044268894],"domain_scores_gemma":[0.99899596,0.00011596141,0.00005317559,0.00044738263,0.00020159698,0.00018593199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033212092,0.0001592955,0.00011641531,0.00055159244,0.0004152929,0.0007250426,0.0012746645,0.000055082855,0.00013458791],"category_scores_gemma":[0.000018094137,0.00013458553,0.00004681569,0.0011114473,0.00012305584,0.00038058648,0.00015790208,0.00022004214,0.0001441538],"study_design_candidate":"theoretical_or_conceptual","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.000001802048,0.000028309154,0.00054187764,0.000008387229,0.000014192519,0.00005894303,0.000025731044,0.029883472,0.000039586816,0.94543046,0.005021274,0.018945947],"study_design_scores_gemma":[0.00018959449,0.000059570702,0.012488278,0.000035220477,0.0000055541796,0.000021523674,0.000042739954,0.93502605,0.00011296905,0.039499678,0.012193127,0.00032566936],"about_ca_topic_score_codex":0.023866152,"about_ca_topic_score_gemma":0.00443914,"teacher_disagreement_score":0.95491874,"about_ca_system_score_codex":0.00017894975,"about_ca_system_score_gemma":0.00074056606,"threshold_uncertainty_score":0.982634},"labels":[],"label_agreement":null},{"id":"W1657379609","doi":"10.1109/ipdpsw.2015.21","title":"Towards a Combined Grouping and Aggregation Algorithm for Fast Query Processing in Columnar Databases with GPUs","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"IBM (Canada)","funders":"","keywords":"Computer science; Hash function; Parallel computing; Aggregate (composite); Algorithm; sort; Database; Data structure; Operating system","score_opus":0.03857750052534887,"score_gpt":0.26820241688198154,"score_spread":0.22962491635663268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1657379609","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.003558475,0.00009714962,0.9947172,0.00035531932,0.00007905936,0.0003739653,0.000009843716,0.00011180798,0.0006972075],"genre_scores_gemma":[0.06353478,0.000011348305,0.9355255,0.00026694644,0.00005418332,0.00007493544,0.000092821356,0.000010893493,0.00042862346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.000018567907,0.00014551717,0.0003344189,0.00019729791,0.00020376222],"domain_scores_gemma":[0.9995508,0.000018488896,0.00006402328,0.00021548869,0.00007754435,0.00007364012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734274,0.000106126856,0.00012930912,0.000120927776,0.00006888468,0.00036570602,0.00027911566,0.000016114649,8.848821e-7],"category_scores_gemma":[0.000022573025,0.00008794605,0.000009237471,0.00034464494,0.000034624223,0.0022294403,0.00024568144,0.000043714357,0.0000014619893],"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.000010612063,0.000054447937,0.0005155812,0.00003727618,0.0000046503474,0.000011704309,0.00029022992,0.000010273966,0.000005793496,0.005112904,0.0005860164,0.9933605],"study_design_scores_gemma":[0.0018849357,0.0002293792,0.0011702143,0.000117194366,0.0000074376444,0.000009084024,0.00044603352,0.99222904,0.00018433899,0.0009880284,0.0025196194,0.00021470588],"about_ca_topic_score_codex":0.00027413934,"about_ca_topic_score_gemma":0.00020786676,"teacher_disagreement_score":0.9931458,"about_ca_system_score_codex":0.000030543044,"about_ca_system_score_gemma":0.00007360632,"threshold_uncertainty_score":0.35863358},"labels":[],"label_agreement":null},{"id":"W166953216","doi":"","title":"Vertex-Neighbor-Integrity of Composition Graphs of Paths.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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; Vertex (graph theory); Composition (language); Combinatorics; Graph; Art","score_opus":0.017667599210157293,"score_gpt":0.22980220846005123,"score_spread":0.21213460924989394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166953216","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.9860077,0.00010667663,0.0075241653,0.0001609605,0.0017664187,0.00017035622,0.000015859465,0.00009768686,0.004150169],"genre_scores_gemma":[0.99554414,0.00006445659,0.0042885076,0.000037264686,0.0000020943578,0.0000035610549,0.000016835555,0.0000050533827,0.00003809483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.000053559983,0.00026967796,0.00022571535,0.00032393908,0.00015943547],"domain_scores_gemma":[0.9990466,0.00005786055,0.0001506,0.00057182607,0.00012401125,0.000049096787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019434828,0.000106060565,0.0002159718,0.00012366351,0.00006914311,0.000016096861,0.0008369132,0.000044795303,0.000010199243],"category_scores_gemma":[0.000015307733,0.000101799225,0.00008422397,0.00047516194,0.000102324506,0.0005307534,0.0002590407,0.00011452408,0.00001536232],"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.000004902893,0.00023838112,0.005098753,0.000022940929,0.000023228287,0.000014197111,0.00016656576,0.000001222107,0.0008136427,0.9880742,0.002436533,0.0031054397],"study_design_scores_gemma":[0.001716821,0.00042419537,0.07579271,0.00008467625,0.000023923736,0.000014986219,0.000028752178,0.010006276,0.031979445,0.8790021,0.0005868074,0.00033929065],"about_ca_topic_score_codex":0.0000628492,"about_ca_topic_score_gemma":7.5334555e-7,"teacher_disagreement_score":0.109072074,"about_ca_system_score_codex":0.000014823298,"about_ca_system_score_gemma":0.000029720262,"threshold_uncertainty_score":0.4151252},"labels":[],"label_agreement":null},{"id":"W1669943","doi":"","title":"The Height Distribution of Nodes in Non-Crossing Trees.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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":"Mathematics; Distribution (mathematics); Statistics; Mathematical analysis","score_opus":0.009088075525755093,"score_gpt":0.23055360921991788,"score_spread":0.22146553369416278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669943","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.9362543,0.0004943299,0.04918769,0.0007216635,0.004029189,0.0003485647,0.000009931917,0.0000882293,0.0088661015],"genre_scores_gemma":[0.99912614,0.000020272993,0.0006641887,0.00001533419,0.0000022309498,0.000005545891,0.000007537901,0.0000031770012,0.00015558838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923176,0.00005059242,0.00017931616,0.00017073928,0.00016857189,0.00019901221],"domain_scores_gemma":[0.9993637,0.00007772133,0.000070310656,0.0004302815,0.00003259159,0.00002535578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047709202,0.00007467616,0.00009378821,0.000029112096,0.00018295154,0.00025972485,0.0005946974,0.000023787032,0.0000015166439],"category_scores_gemma":[0.00005902407,0.00005618497,0.000030572766,0.00043892386,0.000079226804,0.00044181434,0.00013540086,0.00007124065,0.000010400125],"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.0000011751379,0.000054012675,0.0034893611,0.0000037625707,0.000004928432,0.0000039485108,0.000086768276,0.0000058709024,0.00005191102,0.98407996,0.0008560303,0.011362246],"study_design_scores_gemma":[0.0018766357,0.00009055984,0.13651982,0.000069133384,0.000008813344,0.000002977524,0.00010703991,0.023938399,0.007944369,0.7907144,0.03838113,0.00034677598],"about_ca_topic_score_codex":0.000028574736,"about_ca_topic_score_gemma":0.000009778653,"teacher_disagreement_score":0.19336563,"about_ca_system_score_codex":0.000032473934,"about_ca_system_score_gemma":0.00002777082,"threshold_uncertainty_score":0.25045326},"labels":[],"label_agreement":null},{"id":"W1674016448","doi":"10.1017/cbo9780511546570.008","title":"Advances in Point Counting","year":2005,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Data Management and Algorithms","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":"Point (geometry); Computer science; Mathematics; Geometry","score_opus":0.014408470542076083,"score_gpt":0.19580663870416343,"score_spread":0.18139816816208734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1674016448","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.000002994701,0.00031934856,0.029766865,0.000039658848,0.00025067967,0.00021976692,0.000039638813,0.00016682634,0.96919423],"genre_scores_gemma":[0.00012209748,0.0006970639,0.0029533026,0.00010310877,0.00012999223,3.987724e-7,0.000026110163,0.000017421133,0.9959505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986478,0.000017444923,0.00017530356,0.0005909541,0.0002772659,0.00029123388],"domain_scores_gemma":[0.99897724,0.00003649006,0.00017987909,0.00067521166,0.00005454723,0.000076629985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014836264,0.00027058064,0.00027447357,0.000286056,0.000095783624,0.00013755,0.0015628117,0.0001304697,0.0000030844892],"category_scores_gemma":[0.000004005219,0.00032792724,0.00009823252,0.000016058048,0.00008249808,0.0010845548,0.0012602577,0.0003216266,0.000032452856],"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.0000044252884,0.000005576173,0.0000011242166,0.000033100452,0.000011958636,0.00028015245,0.000024622106,0.000007754104,9.305473e-7,0.9267583,0.0061618784,0.066710204],"study_design_scores_gemma":[0.00034477704,0.000016621661,0.000008180586,0.00014512271,0.000018769038,0.0000041721514,0.00001152199,0.0024981257,0.000017690922,0.000053434527,0.99651814,0.0003634299],"about_ca_topic_score_codex":0.00003736686,"about_ca_topic_score_gemma":0.000008036379,"teacher_disagreement_score":0.99035627,"about_ca_system_score_codex":0.00015552859,"about_ca_system_score_gemma":0.000041006755,"threshold_uncertainty_score":0.99991727},"labels":[],"label_agreement":null},{"id":"W1685824674","doi":"10.48550/arxiv.1308.4469","title":"External Memory Algorithms For Path Traversal in Graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Tree traversal; Graph traversal; Polygon mesh; Data structure; Computer science; Path (computing); Representation (politics); Binary tree; Bounded function; Planar graph; Tree (set theory); Longest path problem; Algorithm; Shortest path problem; Theoretical computer science; Mathematics; Graph; Combinatorics","score_opus":0.0707405642959143,"score_gpt":0.19577988601862475,"score_spread":0.12503932172271046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1685824674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065966055,0.00006450656,0.92979723,0.00007939212,0.0012973977,0.0008321176,0.00005821794,0.00019861141,0.00170647],"genre_scores_gemma":[0.94422483,0.00031099937,0.048210017,0.00021239348,0.00019715408,0.000015646474,0.00009698515,0.000038699927,0.0066932654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977018,0.00008022115,0.00025022562,0.0013208477,0.00012690335,0.00051999686],"domain_scores_gemma":[0.99825346,0.0000797358,0.0002124828,0.001206638,0.00009051222,0.00015717305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003555066,0.00035985667,0.00036312468,0.00051455345,0.00009789482,0.00029117585,0.0030187452,0.00021642812,0.000038680726],"category_scores_gemma":[0.000014620242,0.0004123222,0.0002603737,0.00049772253,0.00008500832,0.0010065945,0.002261887,0.000437922,0.00008747556],"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.000057381443,0.00051376666,0.002123596,0.00037050218,0.00023224887,0.0012287474,0.00068825064,0.036778037,0.00004138349,0.88447696,0.0056855744,0.06780357],"study_design_scores_gemma":[0.0011285607,0.00006658813,0.0020807825,0.00010590236,0.00003992382,0.000001927872,0.00008606603,0.82303333,0.000039497376,0.17199819,0.0008579943,0.0005612487],"about_ca_topic_score_codex":0.0004178626,"about_ca_topic_score_gemma":0.00003550809,"teacher_disagreement_score":0.8815872,"about_ca_system_score_codex":0.00013341746,"about_ca_system_score_gemma":0.00009249481,"threshold_uncertainty_score":0.99983287},"labels":[],"label_agreement":null},{"id":"W1689383259","doi":"","title":"Assessment of the Regionalization of Precipitation in Two Canadian Climate Regions: A Fuzzy Clustering Approach","year":2015,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"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":"Precipitation; Fuzzy logic; Fuzzy clustering; Cluster analysis; Environmental science; Geography; Climatology; Computer science; Meteorology; Geology; Artificial intelligence","score_opus":0.1251690301853281,"score_gpt":0.3350170189990403,"score_spread":0.2098479888137122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1689383259","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.8534353,0.000031248615,0.14224185,0.00034940324,0.00029645523,0.0005075407,0.000020144194,0.000045813358,0.0030722797],"genre_scores_gemma":[0.99562997,0.000018988438,0.0038252927,0.000080580154,0.000016793163,0.000001723717,0.000028895387,0.000009558814,0.00038821818],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99844164,0.00028286868,0.00026130688,0.00034113834,0.00040196042,0.00027106365],"domain_scores_gemma":[0.9987331,0.000032401014,0.0002728102,0.00065931736,0.0001663728,0.00013599494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007242826,0.0001364721,0.0001846749,0.00059701886,0.0000831204,0.00011867641,0.0014165064,0.00005128246,5.720211e-7],"category_scores_gemma":[0.00002854384,0.00013197135,0.000059156875,0.0010857066,0.00006628823,0.0022654925,0.00065780926,0.00017069871,0.0000028220834],"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.000008892811,0.000065308595,0.98201233,0.000057073554,0.000016450633,0.000013223529,0.00058636203,0.002055641,0.000022782258,0.01462037,0.0000013873502,0.0005401728],"study_design_scores_gemma":[0.0010256575,0.000046784717,0.9958321,0.00019473405,0.00002133197,0.0000062682084,0.00038084335,0.0011886797,0.0000775956,0.0007723004,0.000276176,0.00017755572],"about_ca_topic_score_codex":0.00064323656,"about_ca_topic_score_gemma":0.06261384,"teacher_disagreement_score":0.14219469,"about_ca_system_score_codex":0.00028845682,"about_ca_system_score_gemma":0.00026292106,"threshold_uncertainty_score":0.954491},"labels":[],"label_agreement":null},{"id":"W1696916719","doi":"10.3233/ida-2003-7202","title":"Iceberg-cube algorithms: An empirical evaluation on synthetic and real data","year":2003,"lang":"en","type":"article","venue":"Intelligent Data Analysis","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Crossover; Pruning; Algorithm; Point (geometry); Cube (algebra); Computer science; Set (abstract data type); Function (biology); Mathematics; Artificial intelligence; Combinatorics; Geometry","score_opus":0.19531162735217378,"score_gpt":0.40852110797410435,"score_spread":0.21320948062193057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696916719","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.0030353882,0.00023353899,0.992259,0.000613894,0.00029616166,0.0002836128,0.00057799125,0.00012672791,0.002573675],"genre_scores_gemma":[0.5314626,0.0053678704,0.4046681,0.0022574614,0.00055880594,0.000075410964,0.05420388,0.00009310187,0.0013127639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602425,0.00047869937,0.00042437858,0.0017844195,0.0009518409,0.00033638944],"domain_scores_gemma":[0.9914412,0.00017810182,0.00013817813,0.00794767,0.000101056,0.00019379673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034874815,0.00023841897,0.0003209709,0.00052372686,0.00017518326,0.0007225712,0.004680069,0.00006257171,0.00022517481],"category_scores_gemma":[0.00037515486,0.00020862972,0.000056134097,0.0016606336,0.00007020552,0.0027000245,0.0020426584,0.00013799599,0.00016108033],"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.000007942567,0.00055011234,0.003893684,0.000012777149,0.0014427254,0.00004434728,0.00027397665,0.00065566436,0.000008416595,0.010732864,0.008928831,0.97344863],"study_design_scores_gemma":[0.00011699935,0.00006958183,0.0015860419,0.00000739164,0.0012029635,0.0000025369268,0.00009791055,0.959244,0.00006142144,0.0011350965,0.03622343,0.00025261682],"about_ca_topic_score_codex":0.0002724924,"about_ca_topic_score_gemma":0.00025817862,"teacher_disagreement_score":0.973196,"about_ca_system_score_codex":0.0000502913,"about_ca_system_score_gemma":0.000063133695,"threshold_uncertainty_score":0.86968106},"labels":[],"label_agreement":null},{"id":"W1710084411","doi":"10.1007/978-3-540-75256-1_62","title":"A Qualitative Hidden Markov Model for Spatio-temporal Reasoning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Computer science; Hidden Markov model; Construct (python library); Artificial intelligence; Representation (politics); Markov process; Markov model; Markov chain; Maximum-entropy Markov model; Machine learning; Variable-order Markov model; Hidden semi-Markov model; Theoretical computer science; Programming language; Mathematics","score_opus":0.052698351172976124,"score_gpt":0.3273504401116056,"score_spread":0.27465208893862947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710084411","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.000010732775,0.00016635405,0.99288565,0.0005625582,0.0010425261,0.00072128954,0.000035623074,0.00018363447,0.0043916116],"genre_scores_gemma":[0.00563715,0.000014782817,0.99026686,0.0011542403,0.00040371262,0.000021978873,0.00007119529,0.000037946644,0.0023921297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958098,0.00003375327,0.00058754283,0.0017090973,0.0010423184,0.00081749423],"domain_scores_gemma":[0.9972292,0.0006111593,0.00038884382,0.0013046807,0.00029366172,0.00017242778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027126465,0.0005437692,0.0005240192,0.0009682384,0.0003039467,0.0007997855,0.0038481185,0.00024041289,0.000010546553],"category_scores_gemma":[0.00014191697,0.0005161415,0.000168356,0.00054733513,0.0004518536,0.0013205281,0.001701066,0.00050708314,0.000022768112],"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.000014693968,0.000022434815,0.0000072420166,0.00005333239,0.000018616427,0.00003461295,0.004431037,0.005029488,0.0000028203785,0.077828795,0.00025908306,0.91229784],"study_design_scores_gemma":[0.00027204212,0.00009636605,0.000004757312,0.00020557646,0.000008259189,0.000006082916,0.0000011243211,0.821552,0.0000493367,0.17596889,0.0012971415,0.0005384685],"about_ca_topic_score_codex":0.000029706945,"about_ca_topic_score_gemma":0.00018226169,"teacher_disagreement_score":0.9117594,"about_ca_system_score_codex":0.0002617477,"about_ca_system_score_gemma":0.00038911053,"threshold_uncertainty_score":0.99972904},"labels":[],"label_agreement":null},{"id":"W1714480694","doi":"10.3233/hsn-2006-282","title":"Destination-driven shortest path tree algorithms","year":2006,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Data Management and Algorithms","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; Path (computing); Tree (set theory); Algorithm; Shortest path problem; Theoretical computer science; Computer network; Mathematics; Combinatorics; Graph","score_opus":0.00937035923181781,"score_gpt":0.21665481260163844,"score_spread":0.20728445336982063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714480694","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.008269142,0.00028061148,0.9865341,0.0009401187,0.0014614778,0.000093373965,0.0000024357482,0.00006216498,0.0023565677],"genre_scores_gemma":[0.8159804,0.00009303261,0.18015563,0.00020306728,0.0026802486,9.5181593e-7,0.000018742763,0.00001725834,0.0008506649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836916,0.000051256924,0.00054629083,0.00021284631,0.00050312554,0.00031730873],"domain_scores_gemma":[0.9987915,0.000100296034,0.0004653186,0.0003363122,0.00020541495,0.00010116111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045783067,0.0001658451,0.000261372,0.00020383576,0.000111106805,0.00035672798,0.0011839333,0.00006352156,0.000022124905],"category_scores_gemma":[0.000017828308,0.00013714939,0.000121432975,0.000529727,0.00003874541,0.0012313928,0.00020615546,0.00027765453,0.000015673064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026004223,0.0006285886,0.007978036,0.0000102545855,0.00015705817,0.0015650446,0.00007605519,0.22639719,0.00013768679,0.06318308,0.2127755,0.48706552],"study_design_scores_gemma":[0.00097045593,0.00027011626,0.0609565,0.000069979724,0.00004686082,0.00017761806,0.000011258396,0.92087084,0.00005793706,0.0055884207,0.010689277,0.000290759],"about_ca_topic_score_codex":0.000039319333,"about_ca_topic_score_gemma":0.000013356634,"teacher_disagreement_score":0.80771124,"about_ca_system_score_codex":0.00005471817,"about_ca_system_score_gemma":0.000035833113,"threshold_uncertainty_score":0.55927896},"labels":[],"label_agreement":null},{"id":"W174827044","doi":"10.1007/978-3-642-14755-5_3","title":"A General Approach to the Fuzzy Modeling of Spatial Relationships","year":2010,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"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":"Bounding overwatch; Snapshot (computer storage); Duality (order theory); Position (finance); Dual (grammatical number); Computer science; Mathematics; Object (grammar); Algorithm; Combinatorics; Artificial intelligence","score_opus":0.0951757116457981,"score_gpt":0.28587772403228356,"score_spread":0.19070201238648546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174827044","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.0006486732,0.001525351,0.8836209,0.00043307242,0.0011837062,0.00044422474,0.000009321039,0.00006453893,0.11207017],"genre_scores_gemma":[0.67497486,0.00064556475,0.3032719,0.0003612446,0.0023845895,0.000038557082,0.000052601554,0.00008244596,0.018188238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848354,0.00003285915,0.00045464924,0.0005169932,0.00027781574,0.0002341144],"domain_scores_gemma":[0.99895674,0.00017053277,0.00017507178,0.0005211388,0.00013773472,0.000038773065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000894233,0.00025746133,0.000433234,0.0001905519,0.0003773786,0.00009836769,0.00080579123,0.0001050666,4.3579217e-7],"category_scores_gemma":[0.00009389286,0.00018928546,0.00006210126,0.00010980707,0.00011877205,0.00013227727,0.0022705924,0.00054785406,0.0000029508783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070290703,0.000036738762,0.00027748998,0.00031093124,0.00018787326,0.000010432319,0.0068048076,0.035454344,0.0000021660596,0.8180325,0.00035555067,0.13852015],"study_design_scores_gemma":[0.00021865926,0.00002333053,0.00017460785,0.00025286668,0.000028549817,0.0000046974856,0.0002363875,0.963968,5.9206224e-7,0.030862875,0.0038866657,0.000342768],"about_ca_topic_score_codex":0.00005618055,"about_ca_topic_score_gemma":0.000075193595,"teacher_disagreement_score":0.92851365,"about_ca_system_score_codex":0.000020686579,"about_ca_system_score_gemma":0.000022815915,"threshold_uncertainty_score":0.7718837},"labels":[],"label_agreement":null},{"id":"W175226406","doi":"","title":"k-Geodomination in Graphs","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":14,"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; Combinatorics","score_opus":0.015649248580041072,"score_gpt":0.21926343233824622,"score_spread":0.20361418375820514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175226406","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.8245782,0.00073036517,0.012804635,0.006327472,0.010403412,0.00083425065,0.0000045460692,0.00085676904,0.14346032],"genre_scores_gemma":[0.9967723,0.0000387904,0.0022741028,0.00013737574,0.0000027704552,0.00001107611,0.0000031824345,0.000004447345,0.00075596164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992487,0.000032344917,0.00013051061,0.00022712885,0.00017783056,0.00018348556],"domain_scores_gemma":[0.99949855,0.000030821553,0.00003653726,0.00037943252,0.000019689413,0.00003498004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019694935,0.000075298405,0.00008145973,0.0001744317,0.000042827596,0.000119502,0.00066406844,0.000026693477,0.000040467985],"category_scores_gemma":[0.000022349175,0.00007774723,0.000025615218,0.00062778534,0.000015465523,0.0008799119,0.0001893252,0.00007316367,0.00025231548],"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":[3.0400372e-7,0.00008234368,0.0010765669,0.000002758206,0.0000026001371,0.000021133777,0.00010662416,0.0000016293186,0.000014329194,0.95329666,0.00592631,0.039468747],"study_design_scores_gemma":[0.0010931866,0.00005564618,0.011261097,0.000013657178,0.0000024448839,0.0000019996717,0.000015925634,0.078982376,0.00023034068,0.9009845,0.007147978,0.00021079202],"about_ca_topic_score_codex":0.000014332373,"about_ca_topic_score_gemma":0.0000032642429,"teacher_disagreement_score":0.17219406,"about_ca_system_score_codex":0.000023572453,"about_ca_system_score_gemma":0.0000025046525,"threshold_uncertainty_score":0.3243089},"labels":[],"label_agreement":null},{"id":"W1752875563","doi":"10.1007/978-3-540-71703-4_3","title":"Improving Quality and Convergence of Genetic Query Optimizers","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"IBM (Canada)","funders":"","keywords":"Computer science; Heuristics; Convergence (economics); Query optimization; Genetic algorithm; Mathematical optimization; Quality (philosophy); Join (topology); Population; Genetic programming; Selection (genetic algorithm); Data mining; Machine learning; Mathematics","score_opus":0.033527309144610655,"score_gpt":0.27695763267335344,"score_spread":0.24343032352874278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752875563","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.0001959143,0.000588733,0.99626034,0.00013409865,0.0011309811,0.00026639857,0.000006870434,0.000071129405,0.0013455439],"genre_scores_gemma":[0.020904398,0.00014867811,0.97780746,0.000716044,0.00016607509,0.000002541661,0.0000036159206,0.000018979226,0.0002322243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967152,0.000028030578,0.00066477276,0.0012673258,0.00082299765,0.0005017149],"domain_scores_gemma":[0.99770993,0.0003313971,0.00044315422,0.0012119237,0.00016111064,0.00014248224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012933585,0.0003728689,0.00048176994,0.00066764833,0.00012003419,0.00028897007,0.0026060713,0.00017787516,0.000012604447],"category_scores_gemma":[0.000081227736,0.00035328284,0.0000802201,0.00044182027,0.0008894315,0.00069149793,0.002212442,0.0003926382,0.0000072358403],"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.0000042569764,0.000014885576,0.0003328596,0.00011342504,0.000010469231,0.000045540954,0.00017944134,0.0025803004,0.0001635121,0.012237103,0.000008620629,0.9843096],"study_design_scores_gemma":[0.0005619522,0.00023677787,0.0040202793,0.00037883501,0.000021171143,0.000039084232,7.261755e-7,0.93631136,0.002017341,0.054570783,0.0006201618,0.0012215106],"about_ca_topic_score_codex":0.00013872211,"about_ca_topic_score_gemma":0.000044989185,"teacher_disagreement_score":0.9830881,"about_ca_system_score_codex":0.00008577797,"about_ca_system_score_gemma":0.00020229333,"threshold_uncertainty_score":0.99989194},"labels":[],"label_agreement":null},{"id":"W1758661201","doi":"10.1007/978-3-319-24462-4_2","title":"Extended Spearman and Kendall Coefficients for Gene Annotation List Correlation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Princess Margaret Cancer Centre; University of Toronto","funders":"","keywords":"Annotation; Correlation; Spearman's rank correlation coefficient; Gene ontology; Gene Annotation; Computer science; Key (lock); Correlation coefficient; Pearson product-moment correlation coefficient; Data mining; Machine learning; Gene; Statistics; Artificial intelligence; Mathematics; Biology; Genetics; Genome","score_opus":0.02809335195549204,"score_gpt":0.26892840053091677,"score_spread":0.24083504857542473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758661201","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.000050592695,0.00030537034,0.99538904,0.00034138208,0.0018151175,0.0006152489,0.000025641612,0.00010971271,0.0013479159],"genre_scores_gemma":[0.05100997,0.000057848698,0.94478315,0.0008953155,0.0007212675,0.000020225447,0.00020696416,0.00004745141,0.002257805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973446,0.000018084294,0.00034752215,0.0011618913,0.00072133593,0.00040654937],"domain_scores_gemma":[0.99844176,0.00015884201,0.00023802117,0.00072277273,0.00029691085,0.00014166892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094800023,0.00033264133,0.00029319094,0.00057735096,0.00021410396,0.0007417282,0.001503092,0.00014549227,0.000004711882],"category_scores_gemma":[0.00007225974,0.00031883517,0.000051858853,0.00035018192,0.00031123805,0.0009401764,0.00095253566,0.0002498917,0.0000170485],"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.000008507035,0.000029138462,0.000027945218,0.000034141973,0.000009083826,0.00001837033,0.00041904286,0.010257138,0.000050205945,0.020767469,0.00024783745,0.9681311],"study_design_scores_gemma":[0.00046183888,0.00017366803,0.00014000617,0.00008657313,0.0000109885905,0.000015500642,2.4443523e-7,0.92077285,0.00015462853,0.0694892,0.00829725,0.00039723978],"about_ca_topic_score_codex":0.000010475296,"about_ca_topic_score_gemma":0.000016578007,"teacher_disagreement_score":0.96773386,"about_ca_system_score_codex":0.00015209963,"about_ca_system_score_gemma":0.0001603591,"threshold_uncertainty_score":0.9999264},"labels":[],"label_agreement":null},{"id":"W1760299170","doi":"10.1007/978-3-540-24840-8_7","title":"Finding Interesting Summaries in GenSpace Graphs Efficiently","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Regina","funders":"","keywords":"Traverse; Automatic summarization; Computer science; Pruning; Graph; Data mining; Theoretical computer science; Set (abstract data type); Algorithm; Artificial intelligence","score_opus":0.023736585282035712,"score_gpt":0.25130724938362103,"score_spread":0.22757066410158533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760299170","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.00033418325,0.00032523085,0.99170095,0.00063387403,0.0020568268,0.0003881589,0.000007306819,0.0001942708,0.004359216],"genre_scores_gemma":[0.24111071,0.00008979018,0.7561163,0.0014561596,0.00038938,0.000014659839,0.000031242904,0.000068615234,0.000723182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957146,0.000030458868,0.0005850948,0.0017850831,0.0009520357,0.0009327251],"domain_scores_gemma":[0.9977553,0.0003651802,0.0002909593,0.0013476625,0.00010365936,0.00013724923],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001157686,0.0005761024,0.000521393,0.0019685077,0.00026201925,0.0013112519,0.0046617785,0.00021720976,0.000017029482],"category_scores_gemma":[0.00014188162,0.00055524043,0.0001208285,0.0013903738,0.00064283365,0.0011886377,0.0032833717,0.0009186849,0.00004832635],"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.000005394967,0.000053845706,0.0004927119,0.00009673873,0.000013996809,0.00058635866,0.0016543545,0.071690544,0.00005393973,0.2298761,0.00003416136,0.69544184],"study_design_scores_gemma":[0.0007873423,0.00020895772,0.0007059568,0.0021779842,0.000011595872,0.000045589346,0.0000013295898,0.54815054,0.0007047658,0.44395414,0.0017272393,0.0015245603],"about_ca_topic_score_codex":0.00008275631,"about_ca_topic_score_gemma":0.0003128839,"teacher_disagreement_score":0.6939173,"about_ca_system_score_codex":0.00043240297,"about_ca_system_score_gemma":0.000352401,"threshold_uncertainty_score":0.99972546},"labels":[],"label_agreement":null},{"id":"W1760549314","doi":"10.1007/3-540-46146-9_70","title":"Query Optimization via Empty Joins","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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","funders":"","keywords":"Joins; Computer science; Query optimization; Tuple; Cartesian product; Join (topology); Relational database; Materialized view; Sargable; Data mining; Information retrieval; Theoretical computer science; Product (mathematics); Database; Web search query; View; Programming language; Search engine; Database design; Mathematics; Discrete mathematics","score_opus":0.017438079444344196,"score_gpt":0.22306605696522241,"score_spread":0.20562797752087822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760549314","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.0000014025688,0.00020428102,0.98421174,0.0007945154,0.0021787186,0.00033432155,0.0000061242195,0.00026597956,0.012002917],"genre_scores_gemma":[0.0027367875,0.0001586894,0.9918127,0.0019283075,0.00066090305,0.000008315756,0.000027803804,0.00004026219,0.0026262542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625564,0.000026469697,0.00047552874,0.0015863288,0.0010219067,0.0006341354],"domain_scores_gemma":[0.99755543,0.00014443547,0.00026843656,0.0017213653,0.00015468556,0.00015561405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059464324,0.00050517806,0.0004232565,0.00093468814,0.00026662566,0.0009949724,0.004063989,0.0002372033,0.000116172196],"category_scores_gemma":[0.000037429552,0.00047547775,0.00011946563,0.0007475346,0.00039420603,0.0016264222,0.0021144284,0.00056971086,0.00016006212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011025202,0.00003258864,0.000012488718,0.00002409733,0.0000108823015,0.000099286255,0.00017845113,0.19342443,0.000007154079,0.012053733,0.00022726347,0.7939285],"study_design_scores_gemma":[0.0001663331,0.00007835323,0.000023820343,0.00013154196,0.000007132369,0.000026303847,3.063642e-8,0.96379775,0.00009938381,0.030501522,0.004598973,0.00056888396],"about_ca_topic_score_codex":0.000015499974,"about_ca_topic_score_gemma":0.000015025669,"teacher_disagreement_score":0.79335964,"about_ca_system_score_codex":0.00021271911,"about_ca_system_score_gemma":0.00012559746,"threshold_uncertainty_score":0.9997697},"labels":[],"label_agreement":null},{"id":"W1763623545","doi":"10.1007/11424918_21","title":"Towards an Ontology-Based Spatial Clustering Framework","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Cluster analysis; Computer science; Ontology; Data mining; Spatial analysis; Information retrieval; Artificial intelligence; Geography; Remote sensing","score_opus":0.02057685886093921,"score_gpt":0.2650080722306205,"score_spread":0.2444312133696813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763623545","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.00001156955,0.00013856775,0.990068,0.0016813895,0.0029464911,0.00033778674,0.000009278297,0.00032371318,0.0044831904],"genre_scores_gemma":[0.023620836,0.000015356138,0.97022635,0.0044036917,0.0014551199,0.000009146256,0.00002169214,0.000036480444,0.00021134189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956443,0.000040759507,0.00050199364,0.0019229339,0.0010591357,0.00083093304],"domain_scores_gemma":[0.99694765,0.00019739903,0.0002594955,0.0022281152,0.00013304537,0.00023432658],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00083414046,0.00060188933,0.00054004067,0.00087798235,0.00027284372,0.0011002657,0.0060640746,0.00041448945,0.000076043136],"category_scores_gemma":[0.00006600381,0.00057174184,0.00012910498,0.0004740298,0.0005449985,0.0012941855,0.002158491,0.0009737512,0.00007699252],"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.0000045166703,0.000032470976,0.000015225178,0.000020333857,0.000006798826,0.00009389114,0.00019448536,0.027248051,0.0000069211083,0.01717174,0.00001297818,0.95519257],"study_design_scores_gemma":[0.00022795457,0.0002196091,0.00014319133,0.00025018348,0.000008357203,0.000016265934,7.484141e-8,0.9042612,0.00018140978,0.08849959,0.0055008493,0.00069132494],"about_ca_topic_score_codex":0.00008768997,"about_ca_topic_score_gemma":0.00059231033,"teacher_disagreement_score":0.9545013,"about_ca_system_score_codex":0.00026513566,"about_ca_system_score_gemma":0.0004473669,"threshold_uncertainty_score":0.9999367},"labels":[],"label_agreement":null},{"id":"W1775567208","doi":"","title":"Structure choices for two-dimensional histogram construction","year":2004,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Data Management and Algorithms","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":"Histogram; Computer science; Data mining; Context (archaeology); Dimension (graph theory); Pattern recognition (psychology); Artificial intelligence; Mathematics; Image (mathematics)","score_opus":0.07778592883821964,"score_gpt":0.39176021727559773,"score_spread":0.31397428843737807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1775567208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33490613,0.010395214,0.3857272,0.1744954,0.027380398,0.04975795,0.010003868,0.00087742996,0.006456418],"genre_scores_gemma":[0.7752651,0.0001462955,0.22142598,0.00015060174,0.00020601875,0.00038236522,0.000049697726,0.000026078673,0.0023478824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814093,0.000110450936,0.00025780787,0.00049205683,0.0005779442,0.0004207793],"domain_scores_gemma":[0.9953368,0.0005571983,0.0001977698,0.00051221135,0.003338337,0.00005768888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554109,0.00017445069,0.00027997873,0.0001482649,0.00068729534,0.00011088519,0.0010351748,0.000035804034,0.0000036711913],"category_scores_gemma":[0.0009402739,0.00011784377,0.00007751054,0.001038826,0.0005868944,0.00046593885,0.0004963641,0.00016662321,0.0000020015352],"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.00028434108,0.00014259956,0.000034930297,0.00017532366,0.0002420425,0.0000010991333,0.0014710577,0.008585267,0.006210554,0.90704006,0.0029951343,0.072817616],"study_design_scores_gemma":[0.011991778,0.0021376028,0.00020590605,0.0009777939,0.00005823849,0.0000023328828,0.01142651,0.009329435,0.32043704,0.5616765,0.080935374,0.0008214708],"about_ca_topic_score_codex":0.000004085349,"about_ca_topic_score_gemma":0.00015057287,"teacher_disagreement_score":0.44035897,"about_ca_system_score_codex":0.000211788,"about_ca_system_score_gemma":0.00033043238,"threshold_uncertainty_score":0.528619},"labels":[],"label_agreement":null},{"id":"W1779695964","doi":"","title":"A Java based Linkage Disequilibrium plotter","year":2006,"lang":"en","type":"article","venue":"UWA Profiles and Research Repository (University of Western Australia)","topic":"Data Management and Algorithms","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":"Centre for Global Health Research","funders":"","keywords":"Plotter; Java; Computer science; Linkage (software); Java applet; Computer graphics (images); Programming language; Database; Biology","score_opus":0.053537481099952565,"score_gpt":0.28483619546359723,"score_spread":0.23129871436364466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779695964","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.9821092,0.00006877534,0.012223731,0.0019112739,0.00016149235,0.0003781992,0.000021805308,0.00011421088,0.0030112986],"genre_scores_gemma":[0.94544643,0.000010126409,0.0052723754,0.000013078545,0.0001040292,9.3698225e-7,0.000020267405,0.000007653025,0.049125113],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983619,0.00015598185,0.00013162222,0.00043315155,0.0005448564,0.00037253182],"domain_scores_gemma":[0.99911326,0.000059997674,0.00007721403,0.00051000644,0.00012320586,0.000116324496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003969619,0.00011345729,0.00016023104,0.00020237111,0.00031591044,0.00024438795,0.0009302795,0.00007530446,0.000017172206],"category_scores_gemma":[0.000003945187,0.00011672687,0.000065605884,0.0003021427,0.0003380868,0.0008960492,0.0006669991,0.00020667545,0.000032316526],"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.000332742,0.0019495592,0.6689163,0.002783954,0.00033815712,0.0053694304,0.0022671907,0.00013754815,0.12579103,0.049372386,0.13136223,0.011379463],"study_design_scores_gemma":[0.002452593,0.0007110349,0.8832983,0.00037618988,0.000051011793,0.000037498598,0.00059547264,0.023273954,0.035024427,0.0009716531,0.052420538,0.0007873668],"about_ca_topic_score_codex":0.0012061022,"about_ca_topic_score_gemma":0.000011694715,"teacher_disagreement_score":0.21438196,"about_ca_system_score_codex":0.000028000757,"about_ca_system_score_gemma":0.000050755956,"threshold_uncertainty_score":0.47599837},"labels":[],"label_agreement":null},{"id":"W178322037","doi":"","title":"Geosemantic Proximity to Improve Geospatial Information Discovery in a Wireless Environment","year":2003,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","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":"Humanities; Political science; Art","score_opus":0.005039637914213342,"score_gpt":0.1893679564771393,"score_spread":0.18432831856292597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178322037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14927678,0.0000034055922,0.8475045,0.00048702507,0.00021172663,0.0005557495,0.0000076261535,0.000051183764,0.0019019847],"genre_scores_gemma":[0.94952875,0.0000075092735,0.049514975,0.00049123814,0.00002262025,0.0001150224,0.000020490344,0.0000056654176,0.0002937025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988617,0.000041516112,0.00028931713,0.00021749898,0.00028720064,0.00030280493],"domain_scores_gemma":[0.999285,0.000024229525,0.00006962325,0.00054577476,0.000008691239,0.000066704306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034655436,0.000120155615,0.00013331011,0.00013215849,0.000054572447,0.00035064114,0.0004918699,0.00002901296,0.000019108395],"category_scores_gemma":[0.00004590794,0.00010954408,0.000028605667,0.00022156505,0.000015426001,0.0034518328,0.0003162365,0.00006953058,0.00050120475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001880743,0.00065173267,0.004297789,0.00034837425,0.000053182903,0.000043498287,0.0038511853,0.000707471,0.0004868279,0.49741924,0.0018838381,0.49023807],"study_design_scores_gemma":[0.0047798753,0.0008381171,0.13699572,0.0002899317,0.000054722175,0.000020578245,0.0006692673,0.7326732,0.007943191,0.053437922,0.059836928,0.0024605019],"about_ca_topic_score_codex":0.0000617796,"about_ca_topic_score_gemma":0.000015043835,"teacher_disagreement_score":0.800252,"about_ca_system_score_codex":0.00005372574,"about_ca_system_score_gemma":0.000023497625,"threshold_uncertainty_score":0.64421403},"labels":[],"label_agreement":null},{"id":"W1800174300","doi":"10.3233/fun-2006-70405","title":"Indexing Schemes for Similarity Search: an Illustrated Paradigm","year":2006,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Nearest neighbor search; Similarity (geometry); Information retrieval; Data mining; Artificial intelligence","score_opus":0.043228175001902375,"score_gpt":0.27945411912867,"score_spread":0.23622594412676765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800174300","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.019923044,0.0000153929,0.9638697,0.0008675503,0.00024778943,0.0006651546,0.00006504401,0.00036890706,0.013977445],"genre_scores_gemma":[0.6250567,0.000008557012,0.3697688,0.0021157227,0.00031984333,0.00012794766,0.0011392664,0.00002561059,0.0014375632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985173,0.00002205453,0.0003923773,0.00021915714,0.0003326782,0.00051642914],"domain_scores_gemma":[0.9990982,0.000052736927,0.00009389729,0.0005965217,0.000044823148,0.00011384517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052570296,0.00016293637,0.00015721297,0.00014281599,0.00026509727,0.0009783991,0.0010409452,0.000051274874,0.000051292856],"category_scores_gemma":[0.000013931938,0.00015110336,0.000055316374,0.0003279709,0.00006346872,0.004528009,0.00032808635,0.0001161438,0.00008536272],"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.000015195131,0.00022881021,0.0011037345,0.00016383332,0.000049193095,0.0000055319388,0.0006829863,0.00031931672,0.00004908087,0.9107477,0.015344952,0.071289636],"study_design_scores_gemma":[0.0010990693,0.0002146332,0.0018826746,0.000027674787,0.000012923455,0.0000048950496,0.0002819437,0.6223895,0.0011362229,0.010317137,0.3622212,0.00041212954],"about_ca_topic_score_codex":0.000054424156,"about_ca_topic_score_gemma":0.000015273532,"teacher_disagreement_score":0.9004306,"about_ca_system_score_codex":0.000042172425,"about_ca_system_score_gemma":0.00005095407,"threshold_uncertainty_score":0.94347245},"labels":[],"label_agreement":null},{"id":"W1804029757","doi":"10.1007/978-3-642-20152-3_27","title":"Indexing for Vector Projections","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"","keywords":"Search engine indexing; Computer science; Artificial intelligence; Information retrieval","score_opus":0.036854241327270804,"score_gpt":0.25773242166584637,"score_spread":0.22087818033857556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804029757","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.0000014859613,0.00010904503,0.9831155,0.0004703584,0.0023544743,0.0007176329,0.0000135399805,0.00021869339,0.012999288],"genre_scores_gemma":[0.007385597,0.00003174037,0.9871194,0.0010122855,0.0008189143,0.00006449223,0.000022027114,0.000046535068,0.003499004],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970835,0.000011808057,0.00035895425,0.0013648495,0.0005191458,0.00066174415],"domain_scores_gemma":[0.9980474,0.00020427929,0.00020850524,0.0012534416,0.00016852199,0.000117832235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007316057,0.00039248404,0.0003421071,0.0008698087,0.00032512652,0.0006485938,0.0035443453,0.00018439667,0.000022604781],"category_scores_gemma":[0.00006391009,0.00036138075,0.00012926916,0.0005178232,0.00032726114,0.0010707655,0.001505744,0.0004204165,0.000043062297],"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.0000029521043,0.000025712681,0.0000078495295,0.000040668412,0.000014627808,0.000017232313,0.00035005153,0.00053111796,0.00001836488,0.25682685,0.00014390257,0.74202067],"study_design_scores_gemma":[0.00046482874,0.00037254803,0.0001058425,0.0003566981,0.000021785017,0.000032221407,1.7294236e-7,0.3720549,0.0008510108,0.5560962,0.06845441,0.0011894221],"about_ca_topic_score_codex":0.000021491971,"about_ca_topic_score_gemma":0.00006390157,"teacher_disagreement_score":0.74083126,"about_ca_system_score_codex":0.00017094487,"about_ca_system_score_gemma":0.0003283595,"threshold_uncertainty_score":0.99988383},"labels":[],"label_agreement":null},{"id":"W1812036194","doi":"10.3233/fun-2008-892-304","title":"Preferential Regular Path Queries","year":2008,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","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 Victoria; Concordia University","funders":"","keywords":"Path (computing); Computer science; Theoretical computer science; Mathematics; Programming language","score_opus":0.021314384049354696,"score_gpt":0.20625042352430084,"score_spread":0.18493603947494613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1812036194","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.058394715,0.000063783235,0.8403194,0.00093949237,0.0012270996,0.0005509979,0.000032916374,0.0007678476,0.09770378],"genre_scores_gemma":[0.7581169,0.00019598668,0.22837573,0.0026347348,0.00026149314,0.000090107525,0.00023147684,0.00002223092,0.010071355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998828,0.000017725155,0.0003131193,0.00015880167,0.00038345766,0.00029889986],"domain_scores_gemma":[0.9990941,0.000017093787,0.00009591764,0.00067410676,0.00002868674,0.0000900657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013715625,0.00013830476,0.0001386916,0.00009669363,0.00024618546,0.0002762364,0.0009769344,0.000030682026,0.00017673423],"category_scores_gemma":[0.0000137909465,0.00011952809,0.000054205702,0.00022455772,0.00008400081,0.0032790664,0.0006680859,0.00008527993,0.0008439628],"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.00002274489,0.0003040479,0.0027541216,0.00021091034,0.00018720826,0.00006195681,0.010383198,0.0000308314,0.00011896692,0.5573291,0.31365556,0.11494134],"study_design_scores_gemma":[0.0011806152,0.00024974789,0.0073083052,0.000049895436,0.000016685803,0.00007530245,0.0004091726,0.03746018,0.0014912876,0.0034234887,0.9477103,0.0006250611],"about_ca_topic_score_codex":0.000011772969,"about_ca_topic_score_gemma":0.0000010478847,"teacher_disagreement_score":0.6997222,"about_ca_system_score_codex":0.00003036361,"about_ca_system_score_gemma":0.00003418219,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W181282468","doi":"10.1007/978-3-642-31900-6_25","title":"A Spatial Clustering Method for Points-with-Directions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Calgary","funders":"","keywords":"Cluster analysis; Computer science; Trajectory; Point (geometry); Set (abstract data type); Data set; Data mining; Data point; Correlation clustering; Artificial intelligence; Algorithm; Mathematics","score_opus":0.024455545978639578,"score_gpt":0.27550299358854374,"score_spread":0.25104744760990416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181282468","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":[5.564443e-7,0.00022294304,0.99318665,0.0009774601,0.0021929077,0.000641971,0.000015620524,0.00021850895,0.0025433803],"genre_scores_gemma":[0.00087293907,0.000026302567,0.9965534,0.00086587144,0.0008916131,0.000036969814,0.000013504666,0.000035327623,0.0007040558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693644,0.000026870555,0.0003580444,0.0012883883,0.0006545727,0.00073571206],"domain_scores_gemma":[0.99775726,0.00044882196,0.00022631053,0.0012375701,0.00016762946,0.00016239182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011883018,0.00045317577,0.0004288605,0.0007398144,0.00033565203,0.00070782687,0.0027084863,0.00016702471,0.00002279615],"category_scores_gemma":[0.00004687075,0.00038306575,0.00012097633,0.00045032785,0.00023308759,0.0010951145,0.0016215212,0.00041833144,0.00003054027],"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.0000055188852,0.000018763141,0.000007515549,0.000033866483,0.000016498267,0.000010856401,0.00020066086,0.0020945482,0.00001735004,0.009060311,0.000037213034,0.9884969],"study_design_scores_gemma":[0.00037272432,0.0001919371,0.000046156867,0.00019540613,0.000024389752,0.000056301233,1.3468906e-7,0.9244872,0.00043703578,0.037883457,0.035645887,0.00065940124],"about_ca_topic_score_codex":0.000072876144,"about_ca_topic_score_gemma":0.0003627292,"teacher_disagreement_score":0.9878375,"about_ca_system_score_codex":0.00018036262,"about_ca_system_score_gemma":0.00018010978,"threshold_uncertainty_score":0.99986213},"labels":[],"label_agreement":null},{"id":"W1813751874","doi":"10.1109/ideas.1999.787246","title":"Query result size estimation using a novel histogram-like technique: the rectangular attribute cardinality map","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Histogram; Cardinality (data modeling); Probability density function; Mathematics; Density estimation; Algorithm; Set (abstract data type); Probability distribution; Mathematical optimization; Computer science; Image (mathematics); Statistics; Data mining; Artificial intelligence","score_opus":0.033764081521882545,"score_gpt":0.2678671898074362,"score_spread":0.23410310828555364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813751874","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.00023661664,0.00007288407,0.9937252,0.0008676371,0.0004509943,0.00042677196,0.000008938335,0.00027994253,0.003931056],"genre_scores_gemma":[0.03924054,0.0000053989443,0.95849687,0.00051655655,0.000038592596,0.00003731234,0.000010678062,0.00001044628,0.0016436008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985854,0.0001191158,0.0002513765,0.0004060525,0.00035064027,0.00028743668],"domain_scores_gemma":[0.9986392,0.00011050248,0.00010759729,0.0010085524,0.000082902654,0.000051234758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015103965,0.00015172955,0.00014619803,0.000056700075,0.00026503502,0.00032308567,0.0007912701,0.000053017386,0.000016002006],"category_scores_gemma":[0.00018139092,0.000109035274,0.00008371506,0.0005857886,0.000058741636,0.00076309295,0.0002709131,0.00013238573,0.000019779434],"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.00002328249,0.00054073735,0.00074040267,0.00016999211,0.0002466137,0.00007731121,0.0006853882,0.002139859,0.0127566205,0.8188942,0.07520547,0.08852014],"study_design_scores_gemma":[0.001017295,0.000111888294,0.0010595889,0.00009681186,0.00011148443,0.000108176784,0.00015309632,0.33816117,0.008890578,0.01894706,0.63028836,0.0010545023],"about_ca_topic_score_codex":0.00031373088,"about_ca_topic_score_gemma":0.000007847949,"teacher_disagreement_score":0.79994714,"about_ca_system_score_codex":0.000118847325,"about_ca_system_score_gemma":0.00004906493,"threshold_uncertainty_score":0.44463295},"labels":[],"label_agreement":null},{"id":"W1814173068","doi":"10.1007/978-94-015-9518-6_15","title":"Prototype Validation of the Trapezoidal Attribute Cardinality Map for Query Optimization in Database Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Enterprise Information Systems","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Query optimization; Cardinality (data modeling); Computer science; Query plan; Database; Histogram; Online aggregation; Data mining; View; Set (abstract data type); Algorithm; Sargable; Database design; Information retrieval; Search engine; Web search query; Artificial intelligence; Programming language","score_opus":0.02005550705722954,"score_gpt":0.231608512032307,"score_spread":0.21155300497507745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814173068","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.000024608327,0.00021407015,0.9549986,0.00008667738,0.0027099436,0.0066947583,0.0014681842,0.00011054795,0.033692602],"genre_scores_gemma":[0.55237293,0.0022688026,0.040583644,0.0011801551,0.0050258157,0.016548991,0.0773504,0.0006148966,0.30405435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974275,0.00008917506,0.0013218796,0.00028076058,0.00066098943,0.00021964438],"domain_scores_gemma":[0.99752307,0.000061199375,0.0010736731,0.0010505775,0.00024264712,0.00004882188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010925898,0.0002915398,0.0004473431,0.00037125836,0.000097238204,0.0004959998,0.001087896,0.00018224324,0.0000088895],"category_scores_gemma":[0.000022199685,0.0002389472,0.00017057391,0.00014574385,0.000034775396,0.003462818,0.00023066967,0.00018033414,0.00004684977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003174149,0.00013876436,0.00054412335,0.010115254,0.0004793677,0.0000067625365,0.0029100182,0.61646223,0.000005068508,0.3328385,0.02088906,0.015293426],"study_design_scores_gemma":[0.0012031588,0.00011272241,0.00003558437,0.0023889034,0.000066822104,0.000011289094,0.00010303333,0.5400217,0.000047760226,0.00018521382,0.4552587,0.0005651219],"about_ca_topic_score_codex":0.00012428491,"about_ca_topic_score_gemma":0.0000022426004,"teacher_disagreement_score":0.91441494,"about_ca_system_score_codex":0.000171151,"about_ca_system_score_gemma":0.00010756103,"threshold_uncertainty_score":0.97439843},"labels":[],"label_agreement":null},{"id":"W181609631","doi":"10.1007/978-3-319-05810-8_28","title":"Monitoring Probabilistic Threshold SUM Query Processing in Uncertain Streams","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Probabilistic logic; Scalability; Data stream mining; Probability distribution; Data mining; Stream processing; Computation; Theoretical computer science; Algorithm; Distributed computing; Artificial intelligence; Database","score_opus":0.025054234627576583,"score_gpt":0.25891524561035056,"score_spread":0.23386101098277398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181609631","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.0002060414,0.000494228,0.99347275,0.000409865,0.0016445562,0.0004939461,0.000002728086,0.00019675217,0.003079129],"genre_scores_gemma":[0.39031,0.00009939258,0.605789,0.0007091149,0.0016877267,0.000050983832,0.000017621725,0.0000885935,0.0012475861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545735,0.00003196373,0.00062119024,0.0019043266,0.0010934876,0.0008916986],"domain_scores_gemma":[0.99775183,0.00019632657,0.00028940788,0.0014706183,0.00014278751,0.000149046],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013277762,0.0005968294,0.00057031045,0.0010268523,0.00021439076,0.0013144371,0.0044972734,0.00024247525,0.0000055999008],"category_scores_gemma":[0.0000889205,0.00054553605,0.000087548964,0.0009253746,0.0004754801,0.0011358074,0.0020701154,0.00085896923,0.00002659735],"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.0000024680407,0.000026570295,0.0005387427,0.00012677374,0.0000031358115,0.00011047757,0.00029412538,0.030340502,0.00001905886,0.009752079,0.000009223703,0.95877683],"study_design_scores_gemma":[0.00028343278,0.00010259833,0.00036636821,0.0016392493,0.0000071124573,0.000015336587,4.377904e-7,0.88262224,0.00021554517,0.11317493,0.00076863886,0.000804133],"about_ca_topic_score_codex":0.000055861266,"about_ca_topic_score_gemma":0.00009898989,"teacher_disagreement_score":0.9579727,"about_ca_system_score_codex":0.00041408985,"about_ca_system_score_gemma":0.00039015902,"threshold_uncertainty_score":0.9997223},"labels":[],"label_agreement":null},{"id":"W181730724","doi":"10.1007/978-3-7908-1752-2_7","title":"Using Fuzzy Spatial Relations to Control Movement Behavior of Mobile Objects in Spatially Explicit Ecological Models","year":2002,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Data Management and Algorithms","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":"Movement (music); Fuzzy logic; Control (management); Computer science; Geography; Spatial relation; Ecology; Artificial intelligence; Biology; Art; Aesthetics","score_opus":0.08341092247206316,"score_gpt":0.30594639524891337,"score_spread":0.2225354727768502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181730724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042673886,0.0032651967,0.8998904,0.00021281306,0.00247578,0.0045677475,0.00009772718,0.00020326462,0.046613194],"genre_scores_gemma":[0.97838795,0.00022048266,0.019310944,0.00016811809,0.00018990444,0.00007661058,0.000009184418,0.00002717148,0.0016096282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773717,0.00003982202,0.0008246655,0.00069082086,0.0003398325,0.00036770842],"domain_scores_gemma":[0.99885625,0.00025415866,0.0003126878,0.00037428935,0.00014193387,0.000060688857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044302986,0.00035909953,0.00083358254,0.00041887126,0.00015684628,0.00007204182,0.00050891214,0.00013328007,0.0000076124],"category_scores_gemma":[0.000042626038,0.00034298614,0.00007914045,0.00016298234,0.00008965877,0.000245057,0.001550478,0.00026810987,0.0000030794463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039129984,0.00073406583,0.007719623,0.00054395484,0.00039019156,0.00059059676,0.011287197,0.40011486,0.000040589035,0.2939666,0.00022041827,0.28435278],"study_design_scores_gemma":[0.0019002049,0.00037063519,0.0038277612,0.0011755329,0.00009712958,0.000003908941,0.00034623186,0.9645374,0.00000489863,0.026591664,0.00022153382,0.00092309015],"about_ca_topic_score_codex":0.00013877852,"about_ca_topic_score_gemma":0.00023097004,"teacher_disagreement_score":0.93571407,"about_ca_system_score_codex":0.00013963555,"about_ca_system_score_gemma":0.00002932025,"threshold_uncertainty_score":0.9999022},"labels":[],"label_agreement":null},{"id":"W1824170323","doi":"10.1109/ftcsh.1995.532623","title":"A Compendium of Robust Data Structures","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Compendium; Computer science; Geography","score_opus":0.06700451719216276,"score_gpt":0.274010257755401,"score_spread":0.20700574056323823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824170323","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.0005073264,0.00004399876,0.9684943,0.0013769903,0.0001424686,0.000057373458,0.000021117812,0.000086330714,0.02927011],"genre_scores_gemma":[0.18745671,0.000008932831,0.8103353,0.00041304604,0.00010422224,5.2382006e-7,0.00007283645,0.0000029243615,0.0016055385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994384,0.000008728303,0.000103729224,0.00020764807,0.00014226027,0.00009921143],"domain_scores_gemma":[0.9987522,0.000013432067,0.00003405574,0.00116374,0.000012436595,0.000024158682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011336585,0.0000483272,0.000066092114,0.000043427157,0.000022126673,0.00007495974,0.002467765,0.000009933452,0.00016086675],"category_scores_gemma":[0.00000568032,0.00003757683,0.000010301654,0.00012059372,0.000018238488,0.0010597823,0.0015624276,0.00002848273,0.000045832865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010810011,0.0000473364,0.00024730258,0.000010950326,0.000021457896,0.0000030327456,0.000052673076,0.00040949494,0.000067987465,0.5857383,0.120778866,0.29262152],"study_design_scores_gemma":[0.00031928695,0.000025181549,0.0050689382,0.0000046268165,0.0000068321565,0.0000037195825,0.000024095145,0.7013535,0.0012985971,0.0021188166,0.28961304,0.00016338372],"about_ca_topic_score_codex":0.000026708301,"about_ca_topic_score_gemma":0.000025525524,"teacher_disagreement_score":0.700944,"about_ca_system_score_codex":0.0000030797567,"about_ca_system_score_gemma":0.0000082662655,"threshold_uncertainty_score":0.45857626},"labels":[],"label_agreement":null},{"id":"W1826195249","doi":"10.1007/978-1-4899-7993-3_947-2","title":"Query Expansion for Information Retrieval","year":2017,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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":"Information retrieval; Query expansion; Computer science","score_opus":0.0207098328871844,"score_gpt":0.2462056284886811,"score_spread":0.2254957956014967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826195249","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.0000020353773,0.0005679233,0.30842713,0.000059953138,0.0050419606,0.0013348385,0.0032738321,0.00012575623,0.6811666],"genre_scores_gemma":[0.0002220395,0.0044501135,0.030050177,0.00008796829,0.0021992018,0.000094228686,0.0124246515,0.0000802399,0.95039135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788344,0.000018351628,0.00076040736,0.0004276557,0.0006518224,0.0002583205],"domain_scores_gemma":[0.99598664,0.00011431965,0.0011658286,0.0023938196,0.00023880973,0.00010058472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007995466,0.000332335,0.0005058507,0.00034244894,0.0001674934,0.0003166493,0.0019248428,0.00019006412,0.0000123146865],"category_scores_gemma":[0.00015225045,0.00031152993,0.00014972666,0.000028351704,0.00005712145,0.004427109,0.0008514151,0.00018229926,0.00018544725],"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.00003517185,0.0000220979,0.0000038967055,0.0018854183,0.000111887406,0.000017795019,0.00018444526,0.000007545457,0.000010161612,0.7339148,0.20485103,0.058955748],"study_design_scores_gemma":[0.00038307157,0.00007580906,0.000004883087,0.00068381784,0.000044152213,0.000004518346,0.00001171831,0.0032898504,0.000015171383,0.0007455395,0.9943842,0.0003572383],"about_ca_topic_score_codex":0.000069095455,"about_ca_topic_score_gemma":0.0000037747056,"teacher_disagreement_score":0.7895332,"about_ca_system_score_codex":0.000044215376,"about_ca_system_score_gemma":0.00015966794,"threshold_uncertainty_score":0.99993366},"labels":[],"label_agreement":null},{"id":"W1841647363","doi":"","title":"k-Nearest Neighbors Queries in Time-Dependent Road Networks","year":2012,"lang":"en","type":"article","venue":"Cadernos de Linguística e Teoria da Literatura (Universidade Federal de Minas Gerais)","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"","keywords":"Computer science; Correctness; Pruning; k-nearest neighbors algorithm; Speedup; Effi; Data mining; Constant (computer programming); Algorithm; Artificial intelligence; Database","score_opus":0.009278389424483256,"score_gpt":0.22709201674419396,"score_spread":0.2178136273197107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1841647363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36591068,0.007193335,0.5824152,0.0064274063,0.0065141083,0.001819233,0.00014068122,0.0018677983,0.027711516],"genre_scores_gemma":[0.97035444,0.000049750364,0.021605853,0.0009839331,0.0012246938,0.000020722531,0.0001253613,0.00005195714,0.005583289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964413,0.00027688534,0.00042446595,0.00074196263,0.0005148466,0.0016005175],"domain_scores_gemma":[0.99811196,0.0002468539,0.00017743457,0.0008157387,0.000099002384,0.0005490225],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007870761,0.0004939734,0.0004485676,0.00045800107,0.00041343307,0.0033329164,0.0018847088,0.0003375129,0.00015833124],"category_scores_gemma":[0.00019167205,0.0005330097,0.0001584943,0.0009182659,0.00013792796,0.0032727523,0.00093769445,0.00085099676,0.00021982475],"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.0006016188,0.0017953507,0.062444896,0.00042243383,0.00060844765,0.0048523755,0.045624964,0.0028013235,0.0058823964,0.69886196,0.039800894,0.13630332],"study_design_scores_gemma":[0.006569466,0.00069844874,0.109014936,0.00094686035,0.00022693086,0.00060015044,0.0024588564,0.6611213,0.0010015522,0.006370913,0.2061488,0.004841793],"about_ca_topic_score_codex":0.00015081438,"about_ca_topic_score_gemma":0.000007912357,"teacher_disagreement_score":0.69249105,"about_ca_system_score_codex":0.000413446,"about_ca_system_score_gemma":0.00011729231,"threshold_uncertainty_score":0.99971217},"labels":[],"label_agreement":null},{"id":"W1842291153","doi":"","title":"Comparison of uncertainty representations for missing data in information retrieval","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Defence Research and Development Canada","funders":"","keywords":"Missing data; Computer science; Randomness; Data mining; Information retrieval; Representation (politics); Data retrieval; Domain (mathematical analysis); Machine learning; Mathematics; Statistics","score_opus":0.08646012484158463,"score_gpt":0.3722946330535117,"score_spread":0.285834508211927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842291153","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.0027506307,0.000006493981,0.9915493,0.0015744743,0.00009780617,0.00032034886,0.0000144239375,0.00003199872,0.003654517],"genre_scores_gemma":[0.5856708,0.0000031704674,0.41306004,0.00019997114,0.00002299631,0.000011164624,0.00072955753,0.0000023244352,0.0002999457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940777,0.000011644175,0.00025441972,0.00011339507,0.0001232998,0.000089450834],"domain_scores_gemma":[0.99913126,0.000080004575,0.00008383551,0.0006276927,0.000058517064,0.000018666406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024441894,0.00003653878,0.00007635175,0.00009365113,0.000030798954,0.00017585263,0.00083474116,0.000013446558,0.000020303603],"category_scores_gemma":[0.00012444044,0.00003208678,0.000010103589,0.00026305518,0.000012786784,0.004635235,0.00040378614,0.000026433918,0.0000184379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125449205,0.00017493879,0.011315241,0.00011856648,0.000023198707,2.1365638e-7,0.0017716011,0.0021344987,0.00029677927,0.10815854,0.1272201,0.74877375],"study_design_scores_gemma":[0.0002200393,0.000015058176,0.0063950946,0.000006607961,0.0000016543172,7.791639e-8,0.00024311837,0.98543143,0.00027530984,0.0022509464,0.0051163933,0.000044244596],"about_ca_topic_score_codex":0.00032647664,"about_ca_topic_score_gemma":0.00001741815,"teacher_disagreement_score":0.98329693,"about_ca_system_score_codex":0.000008746039,"about_ca_system_score_gemma":0.00001609605,"threshold_uncertainty_score":0.33604333},"labels":[],"label_agreement":null},{"id":"W1860119121","doi":"10.1007/978-3-540-85654-2_12","title":"On the Evaluation of Large and Sparse Graph Reachability Queries","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Winnipeg","funders":"","keywords":"Computer science; Reachability; Bounded function; Search engine indexing; Theoretical computer science; Graph; Graph database; Treewidth; Mathematics; Information retrieval; Pathwidth","score_opus":0.040333803899718405,"score_gpt":0.2734266014825541,"score_spread":0.2330927975828357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860119121","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.0011551478,0.00036358373,0.9927686,0.0009855042,0.00059838657,0.00051189,0.00001170867,0.000044698245,0.0035605123],"genre_scores_gemma":[0.83166933,0.00042336,0.16482775,0.0023624806,0.00029939128,0.000033842603,0.000019991325,0.00003369313,0.00033017114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703085,0.00008534194,0.00031352602,0.0009032519,0.0013656687,0.000301361],"domain_scores_gemma":[0.9975877,0.00049784797,0.0002208171,0.0013983069,0.00024310136,0.00005224219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031809143,0.00027156324,0.00027907567,0.00037818783,0.00023552093,0.0001908003,0.0018753624,0.00010200699,0.000016767388],"category_scores_gemma":[0.00021764704,0.00018765745,0.00006532385,0.00040269177,0.0008693115,0.0005002423,0.001172658,0.0003384921,0.0000063895727],"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.0000046062487,0.000048735634,0.000059896258,0.000028357466,0.0000133446365,0.000009092995,0.0010422888,0.0020057024,0.000013257708,0.19329937,0.00018950613,0.80328584],"study_design_scores_gemma":[0.00032410453,0.00019700757,0.0012611679,0.00022244155,0.000017941038,0.0000130199605,5.2507664e-7,0.5133452,0.00044503663,0.48195276,0.0018312713,0.00038952846],"about_ca_topic_score_codex":0.000020186159,"about_ca_topic_score_gemma":0.000060181374,"teacher_disagreement_score":0.8305142,"about_ca_system_score_codex":0.00007314931,"about_ca_system_score_gemma":0.00017858182,"threshold_uncertainty_score":0.7652449},"labels":[],"label_agreement":null},{"id":"W1864072479","doi":"10.22201/icat.16656423.2012.10.6.353","title":"Performance of a New Enhanced Topological Decision-Rule Map-Matching Algorithm for Transportation Applications","year":2012,"lang":"en","type":"article","venue":"Journal of Applied Research and Technology","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":10,"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":"Fondo Nacional de Desarrollo Científico y Tecnológico","keywords":"Map matching; Matching (statistics); Global Positioning System; Computer science; Algorithm; Data mining; Blossom algorithm; Digital mapping; Sequence (biology); Geography; Mathematics; Cartography","score_opus":0.032872435224295865,"score_gpt":0.33303229440369975,"score_spread":0.3001598591794039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864072479","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.1079399,0.00023822066,0.8907812,0.0005246161,0.00007028666,0.00026621102,0.0000043705054,0.00001991073,0.00015524082],"genre_scores_gemma":[0.5372445,0.00020867198,0.46234703,0.0000096388485,0.00009756511,0.00003218045,0.0000028571294,0.0000034905886,0.000054051026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989715,0.0000067288233,0.00030450374,0.0001323712,0.0002878213,0.00029704656],"domain_scores_gemma":[0.9992182,0.00014623125,0.0001494402,0.00019909661,0.0001879288,0.000099057135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008723171,0.00006606168,0.00017452796,0.00046161076,0.00012471338,0.000029869838,0.000642806,0.00008842138,0.0000056258395],"category_scores_gemma":[0.000014895522,0.000050642528,0.000028130542,0.0005524995,0.00012703304,0.000350849,0.000096329364,0.0002569047,0.0000038790645],"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.000027182492,0.00009445987,0.000062064384,0.000020404987,0.000017174798,6.363429e-7,0.000112908056,0.0000032312353,0.0031505774,0.07658658,0.0003850659,0.9195397],"study_design_scores_gemma":[0.0033488586,0.0022512805,0.0024311338,0.00011014299,0.00003369429,0.000039381866,0.0014738766,0.008278571,0.122833565,0.80214363,0.056691904,0.0003639525],"about_ca_topic_score_codex":0.0000015763368,"about_ca_topic_score_gemma":8.062273e-7,"teacher_disagreement_score":0.91917574,"about_ca_system_score_codex":0.000015847821,"about_ca_system_score_gemma":0.000049907467,"threshold_uncertainty_score":0.20651424},"labels":[],"label_agreement":null},{"id":"W1869095669","doi":"10.5623/cig2015-303","title":"An intelligent spatial proximity SYSTEM USING NEUROFUZZY CLASSIFIERS AND CONTEXTUAL INFORMATION","year":2015,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Fuzzy logic; Artificial intelligence; Artificial neural network; Classifier (UML); Machine learning; Data mining; Expert system; Possibility theory; Spatial intelligence; Neuro-fuzzy; Fuzzy set; Fuzzy control system","score_opus":0.042990595635349384,"score_gpt":0.2569579641857549,"score_spread":0.21396736855040552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869095669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069914445,0.0000074733407,0.92739767,0.00013515566,0.00039081645,0.00024938912,0.0000050352855,0.00017005374,0.0017299699],"genre_scores_gemma":[0.9644857,0.0000010347064,0.035266723,0.00014948293,0.00005616309,0.000006387292,0.000016904045,0.000003668594,0.000013933251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991363,0.000059971226,0.00022759994,0.00015056512,0.00025245387,0.00017306778],"domain_scores_gemma":[0.9993088,0.00001546087,0.00009414472,0.0003642477,0.00006557877,0.00015177004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003749074,0.00009365943,0.00011002318,0.00008542776,0.00008141893,0.00050111354,0.0003939536,0.000028969052,0.000001494188],"category_scores_gemma":[0.000039497947,0.00008212115,0.000014308816,0.000124732,0.000036834623,0.0031491814,0.00024598732,0.000056056506,0.000051303126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028183595,0.00012264508,0.0014330712,0.00036564624,0.00005056989,0.00003202934,0.0067993887,0.0005092168,0.00006554085,0.2831368,0.0020300047,0.7054269],"study_design_scores_gemma":[0.00023445925,0.000093607414,0.0007016869,0.000022798702,0.000008887749,0.000014803151,0.00087201485,0.995337,0.00006767245,0.0006347951,0.0018972333,0.000115003284],"about_ca_topic_score_codex":0.00013930429,"about_ca_topic_score_gemma":0.00000664291,"teacher_disagreement_score":0.9948278,"about_ca_system_score_codex":0.00004260612,"about_ca_system_score_gemma":0.000038786904,"threshold_uncertainty_score":0.4832249},"labels":[],"label_agreement":null},{"id":"W1871629701","doi":"10.37236/380","title":"Logconcave Random Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Data Management and Algorithms","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":"National Science Foundation","keywords":"Combinatorics; Mathematics; Random graph; Random regular graph; Bounded function; Graph; Discrete mathematics; Unit cube; Chordal graph; 1-planar graph","score_opus":0.004298915434445819,"score_gpt":0.21050635183446573,"score_spread":0.2062074364000199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871629701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10638813,0.0016506428,0.87368464,0.0065027936,0.005697282,0.00022760415,6.6609897e-7,0.00007486693,0.0057733804],"genre_scores_gemma":[0.9987532,0.00033392687,0.00024037737,0.00016546236,0.00010929593,0.0000011642446,3.5646738e-7,0.0000068438803,0.0003893787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871325,0.00007258022,0.00028541757,0.00010560365,0.00039716344,0.0004260019],"domain_scores_gemma":[0.99883974,0.00016267871,0.00029742726,0.0004850525,0.00015059246,0.000064517866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018159212,0.00010846976,0.00017901511,0.00011903478,0.00013370044,0.00016926261,0.0023474072,0.000037799895,0.00001033295],"category_scores_gemma":[0.000071796116,0.0000672213,0.00012530794,0.00047884104,0.000055157896,0.0006057294,0.0001849876,0.0009285498,0.000016124963],"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.000009667401,0.000048056052,0.000047776983,0.000001589807,0.000045735418,0.000009701604,0.00006695064,0.0000030104563,0.00021160762,0.991921,0.0014250946,0.0062098135],"study_design_scores_gemma":[0.0014066085,0.00022543638,0.00015641777,0.0000037317682,0.00002509286,0.00013307725,0.00001612458,0.0010219895,0.0007415754,0.9614579,0.03471624,0.000095802694],"about_ca_topic_score_codex":0.0000023715793,"about_ca_topic_score_gemma":0.0000033973702,"teacher_disagreement_score":0.89236504,"about_ca_system_score_codex":0.00003834725,"about_ca_system_score_gemma":0.00018716883,"threshold_uncertainty_score":0.43621054},"labels":[],"label_agreement":null},{"id":"W1875872827","doi":"10.1007/978-3-540-24627-5_7","title":"Skyline Cardinality for Relational Processing","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":120,"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":"Skyline; Cardinality (data modeling); Computer science; Online analytical processing; Tuple; Extension (predicate logic); Data mining; Theoretical computer science; Database; Mathematics; Discrete mathematics; Data warehouse; Programming language","score_opus":0.030965914320897212,"score_gpt":0.2674929519471953,"score_spread":0.2365270376262981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875872827","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.0000037593086,0.00028758642,0.9924081,0.0013134964,0.0011034218,0.00048361174,0.000018694196,0.00014783881,0.004233516],"genre_scores_gemma":[0.014579318,0.000012710747,0.9829345,0.00089988316,0.00076461583,0.00001715844,0.000045787678,0.000024265111,0.0007218109],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968857,0.000010684729,0.00041718927,0.0013493918,0.00083734916,0.0004996792],"domain_scores_gemma":[0.99832433,0.00017452598,0.00024274546,0.0008958811,0.00025866684,0.00010387324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000990411,0.00036978663,0.00036534053,0.00048870017,0.0003199993,0.00064414926,0.0024898245,0.00017406739,0.000011482455],"category_scores_gemma":[0.00006740363,0.0003428007,0.0001304507,0.00043935524,0.00036752017,0.0012173556,0.001089718,0.00039631015,0.000018419154],"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.0000031591592,0.000018180039,0.000014005717,0.00007369548,0.000008028291,0.000019274597,0.00013469135,0.019789374,0.00000890502,0.18880463,0.00002770207,0.79109836],"study_design_scores_gemma":[0.00032575813,0.00007711728,0.00009268715,0.00027291206,0.000009788178,0.000012091677,4.5980446e-8,0.48484975,0.00014557254,0.5071308,0.0066321176,0.00045134051],"about_ca_topic_score_codex":0.000009014041,"about_ca_topic_score_gemma":0.000012330739,"teacher_disagreement_score":0.79064703,"about_ca_system_score_codex":0.00030791186,"about_ca_system_score_gemma":0.00061527285,"threshold_uncertainty_score":0.9999024},"labels":[],"label_agreement":null},{"id":"W1887036206","doi":"10.1007/978-3-642-31155-0_7","title":"On Minimum Sum of Radii and Diameters Clustering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Combinatorics; Euclidean geometry; Approximation algorithm; Metric (unit); Cluster analysis; Shortest path problem; Polynomial-time approximation scheme; Euclidean distance; Mathematics; Plane (geometry); Graph; Singleton; Path (computing); Polynomial; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.018562734337131095,"score_gpt":0.23256725870375436,"score_spread":0.21400452436662326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887036206","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.00018096367,0.0004311891,0.99503636,0.00031207394,0.0014642477,0.00023085621,0.0000066011667,0.000058136535,0.0022795468],"genre_scores_gemma":[0.23603743,0.00023524622,0.7607235,0.0017498853,0.0005437948,0.000007732491,0.00001071175,0.000052049814,0.0006396585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975891,0.000019430867,0.00034938147,0.00092733157,0.00062938075,0.00048533978],"domain_scores_gemma":[0.9981507,0.00036899507,0.00022429063,0.0010691684,0.000052836596,0.00013401365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065817015,0.0003571432,0.00040376154,0.0007242557,0.000101548605,0.0002931749,0.0021967075,0.0001318731,0.000010524187],"category_scores_gemma":[0.000039665363,0.00031741435,0.0000695284,0.0003002824,0.0005117766,0.0007607497,0.0020195527,0.00033715792,0.000014203285],"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.000004004865,0.000021754871,0.000028180817,0.000062674015,0.000011716645,0.00002738194,0.00037228156,0.0014284778,0.0000821241,0.018991316,0.0000362262,0.9789339],"study_design_scores_gemma":[0.0007157032,0.00056610256,0.00052129896,0.000922464,0.000027208114,0.000041304724,3.986691e-7,0.8924145,0.0015743508,0.098150976,0.003759884,0.0013058067],"about_ca_topic_score_codex":0.000010579514,"about_ca_topic_score_gemma":0.00001355824,"teacher_disagreement_score":0.97762805,"about_ca_system_score_codex":0.000071452356,"about_ca_system_score_gemma":0.00006155738,"threshold_uncertainty_score":0.9999278},"labels":[],"label_agreement":null},{"id":"W1890828259","doi":"","title":"A trajectory splitting model for efficient spatio-temporal indexing","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"is_retracted":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":"Search engine indexing; Trajectory; Bounding overwatch; Computer science; Range (aeronautics); Set (abstract data type); Dynamic programming; Range query (database); Algorithm; Linear programming; Tree (set theory); Mathematical optimization; Mathematics; Combinatorics; Search engine; Artificial intelligence","score_opus":0.03033275801181353,"score_gpt":0.2600813327572613,"score_spread":0.22974857474544777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890828259","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.007160222,0.0000164966,0.98677355,0.00079235906,0.000106961896,0.00022121142,0.0000030359715,0.0002132028,0.004712962],"genre_scores_gemma":[0.47192463,4.9521657e-7,0.52484775,0.0003766911,0.00010092926,0.000018068698,0.000010175875,0.0000054272355,0.002715824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991012,0.000008148095,0.00017247198,0.00029866103,0.00017129008,0.00024821167],"domain_scores_gemma":[0.99953103,0.00003126416,0.00004976068,0.00030951266,0.00002897374,0.000049446793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003606632,0.0000910046,0.00008471375,0.00008715399,0.00010977305,0.00018561614,0.0005567206,0.00002176937,0.000010510487],"category_scores_gemma":[0.00001286228,0.00008150485,0.000052674324,0.00013915244,0.0000112287435,0.00048267966,0.00021049664,0.00004562332,0.000025971878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007585862,0.00017466523,0.00028870636,0.00003752465,0.000021819067,0.0000021850121,0.0012255467,0.29853538,0.000060327817,0.26383838,0.007952649,0.42785522],"study_design_scores_gemma":[0.00027006998,0.000013766723,0.000050503193,0.000005891521,0.0000026342666,4.1509574e-7,0.000017005206,0.99112236,0.00018850065,0.00046454454,0.007744285,0.00012003631],"about_ca_topic_score_codex":0.000010572367,"about_ca_topic_score_gemma":0.000027585773,"teacher_disagreement_score":0.69258696,"about_ca_system_score_codex":0.00003178988,"about_ca_system_score_gemma":0.000026777896,"threshold_uncertainty_score":0.33236712},"labels":[],"label_agreement":null},{"id":"W1899304629","doi":"10.1109/icde.1990.113479","title":"An attribute-oriented approach for learning classification rules from relational databases","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Relational database; Database; Information retrieval; Data mining","score_opus":0.12090143033010475,"score_gpt":0.28025421181607696,"score_spread":0.1593527814859722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899304629","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.0011979607,0.000031158776,0.9946518,0.00035646476,0.00009422295,0.00016058369,0.000096156946,0.0002485971,0.0031630811],"genre_scores_gemma":[0.06874977,0.00001486804,0.9221683,0.000099045945,0.00014083603,0.000038414553,0.006543095,0.0000066999173,0.0022389274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907833,0.00003771527,0.00014348804,0.00040117028,0.00019123104,0.00014804988],"domain_scores_gemma":[0.9993292,0.00008505524,0.00006383281,0.00042257216,0.00004949336,0.00004983744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017414849,0.00008132118,0.000071935676,0.000064059124,0.00018961758,0.00014631556,0.0004325213,0.000021186492,0.000099477686],"category_scores_gemma":[0.000038098344,0.00007385539,0.000026568496,0.00016357677,0.00001817327,0.0018947531,0.000113578695,0.000064142,0.000072332135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043007008,0.00036158503,0.008369516,0.000007646107,0.00003381928,9.3698907e-7,0.00019602994,0.0005652303,0.0002744349,0.8436222,0.023538452,0.12302581],"study_design_scores_gemma":[0.00022993246,0.000026072303,0.0076645967,0.0000021092753,0.0000056735366,2.5864907e-7,0.000066899374,0.93412054,0.000066402776,0.00025060787,0.057461154,0.00010573343],"about_ca_topic_score_codex":0.000026338721,"about_ca_topic_score_gemma":0.0000015151278,"teacher_disagreement_score":0.9335553,"about_ca_system_score_codex":0.000014868534,"about_ca_system_score_gemma":0.0000043476643,"threshold_uncertainty_score":0.30117354},"labels":[],"label_agreement":null},{"id":"W189941673","doi":"","title":"Data Cube Approximation and Mining using Probabilistic Modeling","year":2007,"lang":"en","type":"article","venue":"CogPrints (University of Southampton)","topic":"Data Management and Algorithms","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; Université du Québec en Outaouais","funders":"","keywords":"Online analytical processing; Data mining; Computer science; Dimension (graph theory); Set (abstract data type); Data warehouse; Abstraction; Data cube; Aggregate (composite); Probabilistic logic; Data set; Outlier; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.08750062848913254,"score_gpt":0.2543261015456471,"score_spread":0.16682547305651457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189941673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31464818,0.00001128009,0.6844871,0.000032071315,0.000047722875,0.00008006088,0.000010514791,0.000039131824,0.0006439079],"genre_scores_gemma":[0.7011797,0.000004773318,0.29866382,0.0000105325125,0.000014584534,2.1902515e-8,0.000027818165,0.0000034007116,0.00009537687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917686,0.000014564323,0.00010123449,0.00036674703,0.0001742113,0.00016637931],"domain_scores_gemma":[0.9991438,0.000030087185,0.00008785737,0.0006254748,0.00005225128,0.00006053688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063698884,0.000076848744,0.000110047695,0.00013856182,0.00015400197,0.00005151135,0.0010173802,0.00003319321,0.000010923545],"category_scores_gemma":[0.000029469795,0.00009636925,0.000016662514,0.00022773656,0.000068115216,0.0012708737,0.0017479312,0.00005715372,0.000007237845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102902064,0.0004205604,0.011569131,0.00070182316,0.00027487142,0.00017848107,0.02458086,0.013211266,0.0018971332,0.07033582,0.00033712687,0.87639004],"study_design_scores_gemma":[0.0002478946,0.000008209023,0.00077842927,0.000034790697,0.000018041826,0.0000031119075,0.0018518665,0.995948,0.000008986516,0.0007801874,0.0002110284,0.00010944377],"about_ca_topic_score_codex":0.000093072296,"about_ca_topic_score_gemma":0.000031485895,"teacher_disagreement_score":0.98273677,"about_ca_system_score_codex":0.000020513395,"about_ca_system_score_gemma":0.000020439094,"threshold_uncertainty_score":0.3929824},"labels":[],"label_agreement":null},{"id":"W1901357871","doi":"10.1002/jgt.21655","title":"Transversals in Trees","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Data Management and Algorithms","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":"Concordia University; McGill University; Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada","funders":"McGill University","keywords":"Library science; Computer science; Operations research; Engineering","score_opus":0.013102022792360887,"score_gpt":0.238538950887151,"score_spread":0.2254369280947901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901357871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14875126,0.0030995267,0.8344125,0.0012176408,0.0019556338,0.000090660666,0.0000027852084,0.000033170752,0.010436839],"genre_scores_gemma":[0.99081343,0.000108578795,0.0086280685,0.00018010345,0.00012516785,4.1046673e-7,1.9008668e-7,0.0000032046303,0.00014081833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993163,0.00009900365,0.00020338749,0.000049089293,0.00016787492,0.00016439089],"domain_scores_gemma":[0.9995889,0.00007307087,0.000107729014,0.00014958759,0.000018457238,0.000062265986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017107852,0.00005410926,0.00010912232,0.00029903164,0.000019576044,0.000044034132,0.0006183824,0.000017230475,0.000023312608],"category_scores_gemma":[0.000018377074,0.00004039522,0.00008272708,0.00028013997,0.00002441419,0.001584678,0.000043263586,0.00010242492,0.000009654877],"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.000028571094,0.0002246785,0.007052337,0.00000777503,0.000051459825,0.000047628248,0.0017691237,0.000017790882,0.0003806179,0.8243448,0.0023605821,0.16371463],"study_design_scores_gemma":[0.0030074087,0.0004305331,0.18393706,0.00017117929,0.000067350236,0.00017943038,0.0011039597,0.0006030543,0.0027250862,0.7483021,0.058925755,0.0005470821],"about_ca_topic_score_codex":0.0000010178395,"about_ca_topic_score_gemma":0.0000012267511,"teacher_disagreement_score":0.8420622,"about_ca_system_score_codex":0.000008610884,"about_ca_system_score_gemma":0.000008278615,"threshold_uncertainty_score":0.16472693},"labels":[],"label_agreement":null},{"id":"W1915173029","doi":"10.1139/x2012-063","title":"Route selection for best distances in road databases based on drivers’ and customers’ preferences","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Selection (genetic algorithm); Payment; Shortest path problem; Path (computing); Quality (philosophy); Integer programming; Computer science; Database; Operations research; Mathematics; Algorithm; World Wide Web; Artificial intelligence; Graph","score_opus":0.10682296863295443,"score_gpt":0.34814309555168726,"score_spread":0.24132012691873284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1915173029","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.95247954,0.0008186472,0.039163467,0.0020506163,0.0007667716,0.0006105607,0.00011207683,0.00001004706,0.003988285],"genre_scores_gemma":[0.9952577,0.000034772478,0.004336494,0.00003364793,0.00013073819,0.00000839387,0.000009463554,0.000004388704,0.00018442735],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99876744,0.00009298967,0.00016074826,0.00014310404,0.0003330676,0.00050265645],"domain_scores_gemma":[0.9990446,0.00016336801,0.00006185393,0.00015220277,0.00015007904,0.0004279277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015154316,0.00007322208,0.00010868029,0.0008410662,0.00019947349,0.0002445744,0.0005465433,0.00002289133,0.000011126448],"category_scores_gemma":[0.00017907014,0.00006126656,0.000024961622,0.00052476564,0.00010287719,0.001426818,0.000036504924,0.00022271527,0.0000053348726],"study_design_candidate":"observational","study_design_consensus":"observational","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.000024765353,0.000056509227,0.8925171,0.000037345762,0.0000140267375,0.000023359788,0.0003888338,0.00020028737,0.0000064736882,0.017608741,0.0043576085,0.084764965],"study_design_scores_gemma":[0.0014171223,0.0011208548,0.7916505,0.0003655345,0.000013229897,0.000019410027,0.0007288437,0.04333513,0.00015200976,0.0013650534,0.15952143,0.00031092681],"about_ca_topic_score_codex":0.006687262,"about_ca_topic_score_gemma":0.14890295,"teacher_disagreement_score":0.15516382,"about_ca_system_score_codex":0.00014861858,"about_ca_system_score_gemma":0.0005022439,"threshold_uncertainty_score":0.9999273},"labels":[],"label_agreement":null},{"id":"W192218065","doi":"10.1007/978-3-642-37087-8_2","title":"A Strategy for Optimizing a Multi-site Query in a Distributed Spatial Database","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Database; Distributed database; Query optimization; Spatiotemporal database; Information retrieval; Spatial database; Database theory; View; Spatial query; Data mining; Database design; Sargable; Database tuning; Spatial analysis; Web search query; Search engine","score_opus":0.036795136319182964,"score_gpt":0.27006818067291993,"score_spread":0.23327304435373697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192218065","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.00002315552,0.00017897665,0.9966192,0.00038256912,0.0010143106,0.0011297584,0.00021208462,0.00013846916,0.00030148035],"genre_scores_gemma":[0.012828006,0.000040685212,0.9853198,0.0006685383,0.00035497188,0.000077054916,0.00035507997,0.00003761186,0.00031827533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959444,0.000032390584,0.00061621965,0.0018717996,0.00064646313,0.0008887542],"domain_scores_gemma":[0.9974826,0.00033684797,0.00028842813,0.0015496762,0.00017007104,0.00017236121],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008955978,0.000571954,0.0005639429,0.00093099964,0.00018126125,0.0012754966,0.0036218676,0.00021773549,0.000022350887],"category_scores_gemma":[0.00009470434,0.000536057,0.00012294429,0.00062585087,0.00032104185,0.0018930922,0.002385864,0.00062108575,0.0000442036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013037441,0.00011414558,0.000046859746,0.00012919308,0.000018424727,0.00020052402,0.00034853892,0.058548175,0.00013969687,0.012325292,0.00018861517,0.9279275],"study_design_scores_gemma":[0.0007980084,0.00012474964,0.00011163822,0.00038213193,0.0000076141673,0.000011533919,3.0233414e-7,0.98648155,0.00016735874,0.009598281,0.0016592199,0.0006576392],"about_ca_topic_score_codex":0.000409347,"about_ca_topic_score_gemma":0.00087093184,"teacher_disagreement_score":0.92793334,"about_ca_system_score_codex":0.00024297084,"about_ca_system_score_gemma":0.00033831925,"threshold_uncertainty_score":0.9997613},"labels":[],"label_agreement":null},{"id":"W1935986945","doi":"10.3233/ida-2003-7406","title":"Measuring the interestingness of discovered knowledge: A principled approach","year":2003,"lang":"en","type":"article","venue":"Intelligent Data Analysis","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Computer science; Data science","score_opus":0.14380152833480334,"score_gpt":0.31391007904092466,"score_spread":0.17010855070612133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935986945","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.0013384174,0.00041619973,0.9915229,0.00005910223,0.00013581387,0.00015598361,0.000057460446,0.00004041515,0.0062736953],"genre_scores_gemma":[0.9420112,0.00008229027,0.056721523,0.000031900992,0.000036319005,0.000015174474,0.00036666103,0.000010332047,0.0007246372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980302,0.00021985579,0.00045500463,0.0006624595,0.0003678242,0.00026464486],"domain_scores_gemma":[0.9957924,0.00015156016,0.00020805391,0.0036900693,0.00009641515,0.00006151751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001617009,0.00016796429,0.00031140615,0.00032580065,0.00011734521,0.0003075199,0.0052805548,0.000027377315,0.000029294146],"category_scores_gemma":[0.00038188585,0.00011146264,0.0001594366,0.0026944636,0.00007818133,0.00084409723,0.0022366915,0.0001207481,0.000032979155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003120435,0.0026850712,0.032754306,0.0003912142,0.0145095065,0.000032400378,0.0058238464,0.011010906,0.0002581112,0.5546789,0.003587477,0.37423706],"study_design_scores_gemma":[0.00015609876,0.000022187021,0.0012515642,0.000026272965,0.0010341819,0.0000024453534,0.00050137535,0.9653352,0.002180954,0.0010560455,0.028113354,0.0003203557],"about_ca_topic_score_codex":0.00009143073,"about_ca_topic_score_gemma":0.000085583946,"teacher_disagreement_score":0.95432425,"about_ca_system_score_codex":0.00002685894,"about_ca_system_score_gemma":0.00004514674,"threshold_uncertainty_score":0.9812672},"labels":[],"label_agreement":null},{"id":"W1959603133","doi":"10.1609/socs.v6i1.18345","title":"Moving Target Search with Subgoal Graphs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); Robotics; Abstraction; Artificial intelligence; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Robot; Programming language","score_opus":0.01248162264710213,"score_gpt":0.24000576043663643,"score_spread":0.22752413778953431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959603133","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.84631366,0.00006027853,0.0024080095,0.036207844,0.009732349,0.00074082334,0.000037662405,0.00024455602,0.10425484],"genre_scores_gemma":[0.99375075,0.000021847776,0.004071884,0.00015953997,0.000287374,0.000015246191,0.000007673929,0.00001686297,0.0016687982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972014,0.000019700206,0.00023065574,0.000477307,0.0017552758,0.00031567836],"domain_scores_gemma":[0.99851876,0.00008334179,0.000093358685,0.00026404005,0.0009576767,0.00008283236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063134177,0.00015375124,0.00015837155,0.00011951573,0.00018562518,0.0005758066,0.0029569366,0.000047548765,0.000034883346],"category_scores_gemma":[0.00006512793,0.000112936184,0.00009845131,0.0007409717,0.000091234455,0.0007888114,0.0016888925,0.00031360594,0.000018145789],"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.00006686152,0.00026357212,0.0072383024,0.000032270822,0.00009804371,0.00000859277,0.00021553428,0.00006707072,0.018537855,0.971302,0.0015218307,0.0006480826],"study_design_scores_gemma":[0.0036687977,0.00071293744,0.0067969263,0.00037387758,0.000028548146,0.00005308187,0.00035429516,0.026084581,0.8646086,0.07807294,0.018552288,0.00069315394],"about_ca_topic_score_codex":0.000063392305,"about_ca_topic_score_gemma":0.0000011166696,"teacher_disagreement_score":0.893229,"about_ca_system_score_codex":0.00010675211,"about_ca_system_score_gemma":0.00010140173,"threshold_uncertainty_score":0.5552516},"labels":[],"label_agreement":null},{"id":"W1960442958","doi":"10.1109/icde.2000.839489","title":"DISIMA: an object-oriented approach to developing an image database system","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Computer science; Salient; Semantics (computer science); Artificial intelligence; Natural language processing; Set (abstract data type); Focus (optics); Information retrieval; Object (grammar); Similarity (geometry); Query language; Image (mathematics); Programming language","score_opus":0.038223262927435726,"score_gpt":0.2520166150604092,"score_spread":0.21379335213297346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960442958","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.0018086173,0.000010447955,0.9514601,0.00018697443,0.00026054148,0.0002802509,0.000017112185,0.0006489317,0.045327008],"genre_scores_gemma":[0.06613419,0.000002656761,0.93152946,0.00049909466,0.000117845244,0.00003265388,0.00015187633,0.0000143896905,0.001517842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982673,0.000066592154,0.00021812494,0.00073318457,0.00033471966,0.00038006145],"domain_scores_gemma":[0.9983324,0.000011817102,0.000041594863,0.0013310598,0.000057076657,0.00022605891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034226532,0.00017128582,0.00015079348,0.00016420295,0.00018270683,0.0005933524,0.0015353143,0.000022884398,0.000019572934],"category_scores_gemma":[0.000013450313,0.0001458335,0.000023898916,0.00075920403,0.000017928834,0.004162514,0.000832165,0.00006947262,0.0003304171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038913345,0.0005213055,0.00012072747,0.00015238533,0.000030620697,0.00008172289,0.001421828,0.000030538667,0.0003577081,0.906099,0.018066652,0.07311361],"study_design_scores_gemma":[0.0003485342,0.000084659936,0.0004384694,0.000030050862,0.000007741087,0.000015319536,0.0008524795,0.9808019,0.00046548565,0.00003090421,0.016437598,0.00048688272],"about_ca_topic_score_codex":0.00006952079,"about_ca_topic_score_gemma":0.000010911663,"teacher_disagreement_score":0.98077136,"about_ca_system_score_codex":0.000055677567,"about_ca_system_score_gemma":0.000010673508,"threshold_uncertainty_score":0.59469175},"labels":[],"label_agreement":null},{"id":"W1961651351","doi":"10.3233/ifs-130935","title":"A simulated annealing algorithm for routing problems with fuzzy constrains","year":2014,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Simulated annealing; Computer science; Fuzzy logic; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.02341158619173813,"score_gpt":0.251242004933188,"score_spread":0.22783041874144985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1961651351","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.001856052,0.0003602409,0.99368954,0.00022846769,0.0015322791,0.0006199039,0.00001160877,0.00007996316,0.0016219593],"genre_scores_gemma":[0.8544159,0.00006196833,0.14338489,0.00018035153,0.001311518,0.000015434407,0.000014625898,0.00004784404,0.0005675047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997277,0.00013426185,0.00110278,0.0003481061,0.0006356145,0.00050219934],"domain_scores_gemma":[0.99726534,0.00029643162,0.0011045118,0.00044100996,0.0006800731,0.00021263568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024299815,0.00027345686,0.0005444476,0.00032746032,0.00018500397,0.00076853327,0.0012157125,0.00007844817,0.0000020509435],"category_scores_gemma":[0.00009647741,0.00019690955,0.00018480244,0.00045284344,0.000056515863,0.0009501422,0.00013846804,0.00025152205,0.000014586389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006987003,0.00042906255,0.0011074506,0.00061707845,0.0011261064,0.00015641385,0.002631994,0.14193317,0.0003676599,0.066255026,0.0037360971,0.7815701],"study_design_scores_gemma":[0.0009903554,0.001083968,0.000027754875,0.00087898795,0.00006275708,0.0002686682,0.00059727987,0.9716123,0.00034105332,0.00093024987,0.022853382,0.00035326404],"about_ca_topic_score_codex":0.000039854054,"about_ca_topic_score_gemma":0.0000035302223,"teacher_disagreement_score":0.8525598,"about_ca_system_score_codex":0.000090583904,"about_ca_system_score_gemma":0.000091869864,"threshold_uncertainty_score":0.8029738},"labels":[],"label_agreement":null},{"id":"W1963523624","doi":"10.1145/1281192.1281248","title":"Joint cluster analysis of attribute and relationship data withouta-priori specification of the number of clusters","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Cluster analysis; A priori and a posteriori; Computer science; Data mining; Cluster (spacecraft); Probabilistic logic; Theoretical computer science; Artificial intelligence","score_opus":0.08205287164865702,"score_gpt":0.3089478544620917,"score_spread":0.2268949828134347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963523624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08243013,0.000013266695,0.91394895,0.00055032386,0.00008155502,0.0001251793,0.000035998823,0.0000111540085,0.002803433],"genre_scores_gemma":[0.9369032,0.000007058578,0.062406544,0.00006194711,0.000012285136,3.1578156e-7,0.00005800197,0.0000026026196,0.0005480615],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99888545,0.000039080056,0.000435664,0.000237682,0.00029948913,0.0001026181],"domain_scores_gemma":[0.99798524,0.00015046929,0.00030979156,0.0014410779,0.000086947686,0.000026462361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016807914,0.00006452509,0.00017643713,0.00018543922,0.00003397248,0.000024875537,0.00091713737,0.000029138833,0.00001711386],"category_scores_gemma":[0.00006408917,0.000044172106,0.000049866536,0.0014100169,0.00008858603,0.0005337254,0.0009886614,0.00005170542,0.0000022212678],"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.000017163773,0.00010987023,0.89659977,0.00005870717,0.0004923386,6.371228e-7,0.0007072473,0.00020531434,0.00022134813,0.083372414,0.0023833327,0.015831845],"study_design_scores_gemma":[0.00019973877,0.000007685381,0.9154314,0.000011252619,0.00022356004,6.8524383e-7,0.00013274758,0.08230494,0.0007867833,0.00027222728,0.0005622372,0.00006676926],"about_ca_topic_score_codex":0.00007351208,"about_ca_topic_score_gemma":0.00010828668,"teacher_disagreement_score":0.85447305,"about_ca_system_score_codex":0.000009810957,"about_ca_system_score_gemma":0.000010419035,"threshold_uncertainty_score":0.18012862},"labels":[],"label_agreement":null},{"id":"W1964744646","doi":"10.1057/palgrave.ivs.9500069","title":"A Pivot-Based Routine for Improved Parent-Finding in Hybrid MDS","year":2004,"lang":"en","type":"article","venue":"Information Visualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":31,"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 British Columbia","keywords":"Computer science; Interpolation (computer graphics); Set (abstract data type); Heuristic; Algorithm; Reduction (mathematics); Computational complexity theory; Curse of dimensionality; Multidimensional scaling; Theoretical computer science; Data mining; Artificial intelligence; Mathematics; Machine learning; Programming language","score_opus":0.020986857059478125,"score_gpt":0.2926540428330248,"score_spread":0.2716671857735467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964744646","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.004664078,0.0000035584794,0.99372005,0.0004309262,0.00024905714,0.00046571635,0.000016331642,0.00016098733,0.0002893149],"genre_scores_gemma":[0.956976,0.000004730119,0.040080085,0.0013129201,0.00004541137,0.0001056581,0.0014426969,0.0000071123127,0.000025373238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.000012523882,0.0003684096,0.000121462144,0.00014892081,0.00018527058],"domain_scores_gemma":[0.99947953,0.000019221325,0.0001753497,0.00020394323,0.00008947166,0.00003248233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033513454,0.00009465186,0.00008811261,0.0003408359,0.00008647142,0.00035832686,0.00031797294,0.000026360978,0.000003996616],"category_scores_gemma":[0.0000808579,0.00009758206,0.000030246925,0.0004795211,0.0000086580885,0.0045094583,0.00006578667,0.000032335927,0.000027678323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050330098,0.00023851614,0.0015043507,0.0002703332,0.000020712045,0.0000015559357,0.0024733907,0.045299612,0.00018574287,0.7589274,0.0016114957,0.18941654],"study_design_scores_gemma":[0.00212164,0.00007153615,0.00095349713,0.000036476205,0.0000031323102,5.8435586e-7,0.0000413166,0.98439825,0.0019020907,0.0017627407,0.008557968,0.00015077712],"about_ca_topic_score_codex":0.000028252347,"about_ca_topic_score_gemma":0.000007721033,"teacher_disagreement_score":0.9536399,"about_ca_system_score_codex":0.00010368482,"about_ca_system_score_gemma":0.000055071585,"threshold_uncertainty_score":0.3979281},"labels":[],"label_agreement":null},{"id":"W1964998447","doi":"10.4236/ijg.2015.61007","title":"An OWL-Based Mobile GeoBI Context Ontology Enabling Location-Based and Context-Based Reasoning and Supporting Contextual Business Analysis","year":2015,"lang":"en","type":"article","venue":"International Journal of Geosciences","topic":"Data Management and Algorithms","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":"Centre de Géomatique du Québec; Université Laval","funders":"","keywords":"Computer science; Ontology; Context (archaeology); Geospatial analysis; Context model; Context awareness; Context analysis; Web Ontology Language; Data science; Taxonomy (biology); Knowledge management; World Wide Web; Semantic Web; Artificial intelligence; Geography","score_opus":0.02194034940470553,"score_gpt":0.3048498517611198,"score_spread":0.28290950235641427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964998447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502456,0.0004452383,0.64726484,0.001345614,0.0005438261,0.00008376963,0.000010201851,0.000024181927,0.000036711197],"genre_scores_gemma":[0.98079336,0.000007841865,0.018026253,0.0010062538,0.00011311157,0.000005942178,0.000019568359,0.0000049033133,0.000022794286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977352,0.00014391763,0.00060466904,0.00039410262,0.0008605759,0.00026153834],"domain_scores_gemma":[0.9966052,0.0003145749,0.00079319515,0.00021633807,0.0018276431,0.0002430568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331222,0.0001655125,0.0003232525,0.00086964545,0.0001536689,0.00091425027,0.001334165,0.00004665392,0.000015044384],"category_scores_gemma":[0.000607938,0.00013798906,0.00006644737,0.0008943316,0.00032093428,0.0018800009,0.000110449015,0.00012900506,0.0000016685411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003375287,0.00074285,0.2549438,0.00004359546,0.00060395274,0.0005531256,0.0021243684,0.07944216,0.0006540774,0.019237293,0.00028374366,0.64103353],"study_design_scores_gemma":[0.0017753128,0.00039611198,0.019183472,0.0000872929,0.000091563794,0.000039871804,0.001627204,0.9742716,0.0004898256,0.00027479665,0.0015363862,0.00022656767],"about_ca_topic_score_codex":0.0007170144,"about_ca_topic_score_gemma":0.00036265448,"teacher_disagreement_score":0.89482945,"about_ca_system_score_codex":0.000067945526,"about_ca_system_score_gemma":0.0005939828,"threshold_uncertainty_score":0.8816137},"labels":[],"label_agreement":null},{"id":"W1965167435","doi":"10.1016/s0924-2716(00)00015-0","title":"Taxonomy of space tessellation","year":2000,"lang":"en","type":"article","venue":"ISPRS Journal of Photogrammetry and Remote Sensing","topic":"Data Management and Algorithms","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":"University of New Brunswick","funders":"Hong Kong Polytechnic University","keywords":"Raster graphics; Tessellation (computer graphics); Partition (number theory); Computer science; Raster data; Feature vector; Space partitioning; Pixel; Theoretical computer science; Data mining; Artificial intelligence; Pattern recognition (psychology); Algorithm; Computer graphics (images); Mathematics; Combinatorics","score_opus":0.016095039798276995,"score_gpt":0.2288803512093513,"score_spread":0.2127853114110743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965167435","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.081685655,0.00035850477,0.9141127,0.00025129304,0.00023539955,0.00008083002,6.086758e-7,0.000014072256,0.0032609345],"genre_scores_gemma":[0.6466959,0.0003051669,0.35262868,0.00007321503,0.00011251159,4.6563073e-9,5.586966e-7,0.0000048106745,0.00017912504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919015,0.00004549838,0.0003041732,0.000119199256,0.00019894652,0.00014205018],"domain_scores_gemma":[0.99935645,0.00005907682,0.00025066917,0.00017588418,0.00008599623,0.000071927134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043515128,0.00008788223,0.00018441136,0.00018952314,0.000062424595,0.00010880304,0.000202634,0.00003533107,0.000012126057],"category_scores_gemma":[0.000020609343,0.0000725577,0.00006985246,0.00039394753,0.000048770686,0.00045709382,0.0000469973,0.00012685073,0.0000022838674],"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.000009703582,0.000011374661,0.000031550022,0.000014376017,0.000022866278,0.000033863824,0.0000782516,0.00004705886,0.0015971159,0.000069773596,0.00015293853,0.9979311],"study_design_scores_gemma":[0.0020052767,0.0005483196,0.0015587072,0.00062232465,0.000118839096,0.001199846,0.0003489069,0.69545573,0.057147115,0.0052977027,0.23515415,0.0005430608],"about_ca_topic_score_codex":0.000102643906,"about_ca_topic_score_gemma":0.000004099287,"teacher_disagreement_score":0.99738806,"about_ca_system_score_codex":0.000008956747,"about_ca_system_score_gemma":0.000017404484,"threshold_uncertainty_score":0.2958817},"labels":[],"label_agreement":null},{"id":"W1966404343","doi":"10.4018/jdwm.2012100103","title":"Efficient and Effective Aggregate Keyword Search on Relational Databases","year":2012,"lang":"en","type":"article","venue":"International Journal of Data Warehousing and Mining","topic":"Data Management and Algorithms","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":"Simon Fraser University; Coquitlam College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Aggregate (composite); Ranking (information retrieval); Keyword search; Relational database; Information retrieval; Keyword density; Database; Data mining","score_opus":0.08742456037480173,"score_gpt":0.3419586676621541,"score_spread":0.2545341072873524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966404343","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.6274195,0.001113869,0.36729133,0.001999619,0.0015163461,0.00008560344,0.00012812368,0.00002566957,0.00041993838],"genre_scores_gemma":[0.89185315,0.00011700764,0.10718716,0.00035145963,0.00039081593,5.686234e-7,0.00006032186,0.0000067595747,0.00003272498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891496,0.00005749801,0.00020433358,0.000184528,0.00048834766,0.00015035072],"domain_scores_gemma":[0.999098,0.0003188789,0.00016134536,0.00022456763,0.00010649694,0.00009072537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010491573,0.00008578477,0.00010070284,0.00022933027,0.000096584976,0.00019749245,0.00063556805,0.000013065542,0.000004254005],"category_scores_gemma":[0.00014654534,0.00007111464,0.000016138127,0.00008502306,0.000045078476,0.0014813532,0.0010254307,0.00013556641,0.0000036772535],"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.000058815924,0.00015219465,0.00814024,0.000009879204,0.00018346669,0.00008570134,0.0011681807,0.00067069416,0.00011099059,0.008064856,0.0026223457,0.97873265],"study_design_scores_gemma":[0.0047739656,0.000598199,0.09746931,0.0023685521,0.00013683233,0.0020980677,0.0010856237,0.6753384,0.0009964195,0.00026639507,0.21393102,0.0009372411],"about_ca_topic_score_codex":0.0000093987765,"about_ca_topic_score_gemma":5.853216e-7,"teacher_disagreement_score":0.9777954,"about_ca_system_score_codex":0.000026851041,"about_ca_system_score_gemma":0.000023451894,"threshold_uncertainty_score":0.2899971},"labels":[],"label_agreement":null},{"id":"W1966445797","doi":"10.1145/1620432.1620453","title":"Efficient keyword proximity search using a frontier-reduce strategy based on<i>d</i>-distance graph index","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Graph; Set (abstract data type); Efficient frontier; Space (punctuation); Theoretical computer science; Index (typography); Frontier; World Wide Web","score_opus":0.03283030230392023,"score_gpt":0.2784831588872907,"score_spread":0.24565285658337047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966445797","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.018668178,0.00002615677,0.9674481,0.00085639756,0.00022741094,0.0003558627,0.000006480552,0.0002540887,0.012157279],"genre_scores_gemma":[0.91770273,0.0000013118358,0.08042408,0.0009144669,0.000056162513,0.0000048864663,0.0000068847253,0.0000075629823,0.00088194147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780303,0.000076086275,0.00023400856,0.00068031217,0.00067076547,0.0005357691],"domain_scores_gemma":[0.9987564,0.000027708633,0.00006133841,0.000933442,0.00007663435,0.00014446127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046040097,0.00021536076,0.00018279832,0.00023989235,0.00020977513,0.00052107236,0.0012646472,0.00004830364,0.000032808784],"category_scores_gemma":[0.00001044199,0.00018585498,0.00008140146,0.0009967128,0.00005431358,0.0004186101,0.00015577418,0.00019815326,0.000030860047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010702205,0.0019812246,0.000992184,0.000053181095,0.000040497696,0.00015673287,0.00023321755,0.45240617,0.0005907956,0.24397452,0.0068649175,0.29259953],"study_design_scores_gemma":[0.00048640987,0.00013540317,0.0035462051,0.000025529152,0.000004319306,0.0000010976416,0.000025640109,0.99241936,0.00050543406,0.0020325708,0.0005625791,0.00025547468],"about_ca_topic_score_codex":0.00006191087,"about_ca_topic_score_gemma":0.0000057687603,"teacher_disagreement_score":0.8990345,"about_ca_system_score_codex":0.00006830589,"about_ca_system_score_gemma":0.000105577616,"threshold_uncertainty_score":0.75789464},"labels":[],"label_agreement":null},{"id":"W1967241189","doi":"10.1002/atr.5670390205","title":"Counting the different efficient paths for transportation networks and its applications","year":2010,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":28,"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":"Simple (philosophy); Heuristic; Time complexity; Computer science; Floyd–Warshall algorithm; Mathematical optimization; Flow network; Polynomial; Algorithm; Travel time; Matrix (chemical analysis); Mathematics; Theoretical computer science; Shortest path problem; Graph; Engineering","score_opus":0.0070851890042968714,"score_gpt":0.23572634358927508,"score_spread":0.22864115458497822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967241189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26241794,0.00013316903,0.7363702,0.00037887247,0.00036459696,0.00030479665,0.000011577603,0.000014043022,0.00000479309],"genre_scores_gemma":[0.9822812,0.00010935603,0.017298082,0.00006079028,0.00015008874,0.000040005678,0.000043030355,0.000006678803,0.0000107845935],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991897,0.000007706126,0.00035224803,0.0001342989,0.00019390424,0.00012218153],"domain_scores_gemma":[0.9991939,0.000112165544,0.00034286777,0.00012464609,0.00018126827,0.000045160094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026168246,0.00008780868,0.0001110369,0.00005628454,0.00015242657,0.000072445175,0.00028709118,0.000029325389,0.0000014741375],"category_scores_gemma":[0.000008530004,0.000060359504,0.00006215586,0.00014689779,0.000017431896,0.00048739256,0.0000020092643,0.00016091223,2.6115225e-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.000104823586,0.00031828013,0.0012918467,0.00016893835,0.000100322504,0.000009828046,0.0036558886,0.31478035,0.015486187,0.20220439,0.000113539085,0.4617656],"study_design_scores_gemma":[0.004029262,0.0004113035,0.51959264,0.00012602871,0.00030791046,0.000012979626,0.00085196435,0.42919138,0.0036189184,0.007971358,0.033307407,0.00057884416],"about_ca_topic_score_codex":5.504362e-7,"about_ca_topic_score_gemma":0.000030396805,"teacher_disagreement_score":0.71986324,"about_ca_system_score_codex":0.000006513778,"about_ca_system_score_gemma":0.000012103014,"threshold_uncertainty_score":0.2461389},"labels":[],"label_agreement":null},{"id":"W1967654850","doi":"10.14778/1687627.1687642","title":"Measure-driven keyword-query expansion","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Pruning; Information retrieval; Query expansion; Web search query; Context (archaeology); Set (abstract data type); Process (computing); Domain (mathematical analysis); Measure (data warehouse); Focus (optics); Query optimization; Data mining; Word (group theory); Search engine; Mathematics","score_opus":0.012523221015441705,"score_gpt":0.21224724329768602,"score_spread":0.1997240222822443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967654850","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.379091,0.0015743601,0.091732875,0.09179708,0.005961207,0.0062646675,0.00002768294,0.0024408484,0.42111027],"genre_scores_gemma":[0.9787016,0.000047868118,0.019623928,0.0006738421,0.000091438465,0.000014768483,8.436865e-7,0.0000065898694,0.0008391563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986631,0.000005310395,0.00022438704,0.0003098115,0.0005431836,0.00025417228],"domain_scores_gemma":[0.9993754,0.000010340164,0.00016914059,0.00027867474,0.00011066001,0.00005576828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002935311,0.00013938549,0.0001494762,0.00008458587,0.000111996655,0.00014726708,0.001748166,0.000029317212,0.000006334734],"category_scores_gemma":[0.00003477958,0.00009365909,0.0000966987,0.0003897801,0.000030135054,0.0007735371,0.00054297876,0.00009895483,0.000018764424],"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.000030941243,0.00059210946,0.0020950343,0.00009043943,0.000086635686,0.000003618088,0.0015525958,0.000048951606,0.11763148,0.40688083,0.056000836,0.41498655],"study_design_scores_gemma":[0.0038733108,0.0012303762,0.04921186,0.0010098192,0.0001691524,0.000043420718,0.0005796009,0.03699951,0.7104551,0.111288995,0.08345318,0.0016856694],"about_ca_topic_score_codex":0.000008529801,"about_ca_topic_score_gemma":4.4551524e-7,"teacher_disagreement_score":0.59961057,"about_ca_system_score_codex":0.000041307732,"about_ca_system_score_gemma":0.000014418463,"threshold_uncertainty_score":0.38193068},"labels":[],"label_agreement":null},{"id":"W1968799289","doi":"10.1145/2808194.2809493","title":"Pooling for User-Oriented Evaluation Measures","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; University of Waterloo","keywords":"Pooling; Automatic summarization; Computer science; Information retrieval; Relevance (law); Focus (optics); Rank (graph theory); Order (exchange); World Wide Web; Data mining; Artificial intelligence","score_opus":0.12017179713478407,"score_gpt":0.32649510122844744,"score_spread":0.20632330409366337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968799289","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.00062811637,0.00003359859,0.98727226,0.00064562657,0.0005477719,0.00026679586,0.0000012017443,0.00012420319,0.010480438],"genre_scores_gemma":[0.23675223,0.0000029720454,0.7570118,0.00076465117,0.0003220549,0.00011493203,0.000065611006,0.000010429923,0.004955352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924064,0.000022611575,0.000085922875,0.00017699267,0.0003538498,0.000119983015],"domain_scores_gemma":[0.9994058,0.000018342334,0.000026442616,0.00026477495,0.00023287312,0.000051762905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011055274,0.000048220696,0.000047305453,0.000052601696,0.000041269257,0.00013135905,0.00035128836,0.0000126504565,0.0000057406774],"category_scores_gemma":[0.000136486,0.000039906336,0.000019945222,0.00015504054,0.0000053874733,0.0007564099,0.00012254577,0.000016582562,0.00003968177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065948216,0.000048069207,0.00021429469,0.0000055503892,0.000022808548,7.406424e-7,0.0002753434,0.00041332108,0.00005238831,0.45167994,0.07796503,0.46931592],"study_design_scores_gemma":[0.0006607364,0.000046702993,0.00016740954,0.0000032841986,0.000010263316,4.2090446e-7,0.00006194198,0.822941,0.0005439413,0.010071547,0.16540349,0.00008925634],"about_ca_topic_score_codex":0.000016095823,"about_ca_topic_score_gemma":0.000008190511,"teacher_disagreement_score":0.8225277,"about_ca_system_score_codex":0.000024795187,"about_ca_system_score_gemma":0.000038321163,"threshold_uncertainty_score":0.16273332},"labels":[],"label_agreement":null},{"id":"W1969872322","doi":"10.1016/j.dam.2004.06.007","title":"Measures on Boolean polynomials and their applications in data mining","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"","keywords":"Mathematics; Extension (predicate logic); Value (mathematics); Bonferroni correction; Type (biology); Binary number; Discrete mathematics; Statistics; Computer science; Arithmetic","score_opus":0.04596786842187776,"score_gpt":0.2692105800670464,"score_spread":0.22324271164516865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969872322","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.0049246154,0.000060141225,0.98259085,0.00053003844,0.00002689262,0.00052057265,0.000043374843,0.00011616013,0.011187348],"genre_scores_gemma":[0.5302346,0.000045148725,0.46895802,0.00031408822,0.000073183335,0.00012035874,0.00015226586,0.000027161708,0.00007518001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999004,0.0000060291,0.00023117762,0.0003988307,0.00015878708,0.00020116934],"domain_scores_gemma":[0.9984638,0.000086771455,0.000086083506,0.0013025139,0.0000075063413,0.000053319138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035920073,0.00015333938,0.0001835191,0.00010332552,0.000086040825,0.00021020228,0.0013039286,0.00003178559,0.000001487604],"category_scores_gemma":[0.000017004386,0.00011703264,0.0000148707695,0.00022419309,0.000042819876,0.00030614433,0.0007873476,0.0000752414,0.00002127051],"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.0000021393887,0.00014026687,0.000011523531,0.00006646695,0.000024090123,0.0000020644934,0.0025504825,0.00006382685,0.0005878828,0.9360806,0.00037815492,0.060092524],"study_design_scores_gemma":[0.004606432,0.00015062318,0.0010070191,0.00050520943,0.0000852951,0.000014973807,0.013231037,0.090996705,0.012905957,0.8457635,0.028403183,0.0023300878],"about_ca_topic_score_codex":0.0000055965384,"about_ca_topic_score_gemma":0.000016218472,"teacher_disagreement_score":0.52531,"about_ca_system_score_codex":0.000017954213,"about_ca_system_score_gemma":0.00001752542,"threshold_uncertainty_score":0.47724527},"labels":[],"label_agreement":null},{"id":"W1970296249","doi":"10.1007/s10115-011-0379-3","title":"Aggregate keyword search on large relational databases","year":2011,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Aggregate (composite); Information retrieval; Tuple; Set (abstract data type); Keyword density; Relational database; Keyword search; Matching (statistics); Data mining; Table (database); Focus (optics); Database; Mathematics","score_opus":0.06452476657364406,"score_gpt":0.26599489127396836,"score_spread":0.2014701247003243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970296249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034396322,0.00031640643,0.55427015,0.00013295271,0.0010123296,0.00033813942,0.00005910416,0.00018659589,0.44024467],"genre_scores_gemma":[0.98430926,0.00022466117,0.0068510617,0.0008825165,0.00020479396,0.000061874955,0.00045965303,0.000009610009,0.006996584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926406,0.000038158927,0.00024078053,0.0001172706,0.0001800222,0.0001597261],"domain_scores_gemma":[0.9994392,0.000031997268,0.00007162324,0.00030031757,0.000095018135,0.00006187703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047105367,0.00008336749,0.00008337432,0.00019263627,0.00014886014,0.00017863873,0.00026673533,0.000019796958,0.00002855905],"category_scores_gemma":[0.000017680746,0.00006873176,0.000017416422,0.00022189153,0.000014737084,0.0063533452,0.00024569876,0.000068783884,0.0013507513],"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.000003902895,0.000030447716,0.0006966776,0.000044256933,0.000010357351,9.3812025e-7,0.0025532118,0.0000035307173,6.300089e-7,0.95443344,0.010627315,0.03159532],"study_design_scores_gemma":[0.000328833,0.000045178593,0.004696186,0.000059406386,0.0000021622222,0.0000048263005,0.0001519209,0.0992353,0.00005623495,0.00004844988,0.89525557,0.00011590782],"about_ca_topic_score_codex":0.000015159787,"about_ca_topic_score_gemma":0.000001932389,"teacher_disagreement_score":0.9808696,"about_ca_system_score_codex":0.000014980187,"about_ca_system_score_gemma":0.000021417207,"threshold_uncertainty_score":0.99942684},"labels":[],"label_agreement":null},{"id":"W1971004146","doi":"10.1145/1966478.1966480","title":"CTS 2010 workshop report","year":2011,"lang":"en","type":"article","venue":"SIGSPATIAL Special","topic":"Data Management and Algorithms","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; Science and engineering; Library science; Operations research; Engineering management; Data science; Engineering ethics; Engineering","score_opus":0.04689999787022253,"score_gpt":0.23958626505780756,"score_spread":0.19268626718758503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971004146","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.0025874241,0.000018912695,0.5708382,0.0007822785,0.012614924,0.00029161124,0.000007488562,0.00036604592,0.41249308],"genre_scores_gemma":[0.36952266,0.00006883266,0.46002373,0.0025276786,0.072906144,0.0001051352,0.00026495586,0.00010979529,0.09447108],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987565,0.000024379979,0.00022789498,0.00039204373,0.00031108625,0.0002880731],"domain_scores_gemma":[0.99906546,0.000019061732,0.00010307268,0.00067426666,0.000039838123,0.0000983173],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022554428,0.00012328953,0.00012573617,0.000081428996,0.0001026544,0.00015347109,0.0010128695,0.000053058382,0.0013127817],"category_scores_gemma":[0.00006657471,0.0001155197,0.00006091785,0.00027187265,0.000041798365,0.0007577988,0.0005401536,0.000116627554,0.000724845],"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.000022444801,0.00021508498,0.0014122152,0.0000064124765,0.00003894086,0.0019044058,0.0011700921,0.0000017249026,0.000051195864,0.12342872,0.3307285,0.5410203],"study_design_scores_gemma":[0.0010065947,0.00018666704,0.047175556,0.000029240602,0.000029558414,0.00007983528,0.000065526816,0.0032805074,0.002571976,0.029225871,0.9153582,0.0009905035],"about_ca_topic_score_codex":0.00016902736,"about_ca_topic_score_gemma":0.00014937315,"teacher_disagreement_score":0.58462965,"about_ca_system_score_codex":0.000018610943,"about_ca_system_score_gemma":0.000034405646,"threshold_uncertainty_score":0.9996002},"labels":[],"label_agreement":null},{"id":"W1972857993","doi":"10.1145/1242572.1242836","title":"Visualizing structural patterns in web collections","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; World Wide Web; Visualization; Information retrieval; Data mining","score_opus":0.014869418158442055,"score_gpt":0.28473958028463964,"score_spread":0.2698701621261976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972857993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09364149,0.000008314867,0.860199,0.00026461648,0.0004708735,0.00009957284,0.0000020983005,0.00017694158,0.04513714],"genre_scores_gemma":[0.97119105,0.0000035492624,0.023126638,0.00029929396,0.00005242942,0.000001949778,0.000003906757,0.0000030699348,0.0053180913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941564,0.000008931381,0.00011456699,0.00016219288,0.00010922623,0.00018944089],"domain_scores_gemma":[0.99973154,0.000023982093,0.000017156937,0.00018541182,0.000010421946,0.000031494947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020757699,0.000051323357,0.00004846295,0.00020925305,0.000078243385,0.00018810513,0.00036411433,0.0000140402935,0.00006775216],"category_scores_gemma":[0.0000056069325,0.00004530716,0.000015836784,0.0006821198,0.000006431265,0.00053779257,0.00020143228,0.00004823739,0.000020913192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006602479,0.0001127487,0.122652754,0.000026578444,0.000034069584,0.00022467686,0.0011990989,0.00006798372,0.0008553925,0.5466307,0.021262407,0.30692703],"study_design_scores_gemma":[0.0016551607,0.00012867671,0.26233146,0.0000390944,0.0000061688866,0.00002634562,0.0008577121,0.67118704,0.003386926,0.0066920253,0.05292252,0.0007668502],"about_ca_topic_score_codex":0.00012161051,"about_ca_topic_score_gemma":0.0013098493,"teacher_disagreement_score":0.8775496,"about_ca_system_score_codex":0.000025094163,"about_ca_system_score_gemma":0.000008905042,"threshold_uncertainty_score":0.18475723},"labels":[],"label_agreement":null},{"id":"W1972876322","doi":"10.1016/s0304-3975(00)00080-3","title":"Sokoban: improving the search with relevance cuts","year":2001,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Pruning; Relevance (law); Computer science; Context (archaeology); Reduction (mathematics); Sequence (biology); Current (fluid); Measure (data warehouse); Incremental heuristic search; State (computer science); Artificial intelligence; Algorithm; Search algorithm; Theoretical computer science; Mathematics; Machine learning; Beam search; Data mining","score_opus":0.011189001344637992,"score_gpt":0.2382632445281641,"score_spread":0.22707424318352612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972876322","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.011143938,0.000024603107,0.9763979,0.0043372344,0.0003703,0.0002057134,6.2344014e-7,0.00021904377,0.0073006637],"genre_scores_gemma":[0.8261445,0.000012913124,0.17242487,0.0010787847,0.00017481094,0.000007351163,5.729623e-7,0.0000077539935,0.00014840293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711347,0.00008381652,0.00017917251,0.00079630467,0.0010652359,0.00076199207],"domain_scores_gemma":[0.9979159,0.00023596748,0.000047197056,0.0014577087,0.00015568109,0.000187551],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018476133,0.00017548558,0.00013610916,0.00011791916,0.00076440186,0.0013250752,0.005285604,0.00002297624,0.000023459224],"category_scores_gemma":[0.000045973637,0.000098315046,0.000035048393,0.0019400758,0.002805902,0.0016265906,0.002259094,0.0002537299,0.00013855932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006032539,0.000027010075,0.00006678984,0.0000032649482,0.0000028823508,0.000042191314,0.00016882057,0.00012739899,0.000110385896,0.8054389,0.00017730442,0.19382903],"study_design_scores_gemma":[0.00024249348,0.00027128312,0.0011756396,0.000025840953,0.000005098149,0.00011204416,0.0000163239,0.97648436,0.001249368,0.016966507,0.0031791423,0.00027191345],"about_ca_topic_score_codex":0.000008654913,"about_ca_topic_score_gemma":0.0000014195931,"teacher_disagreement_score":0.9763569,"about_ca_system_score_codex":0.00004066769,"about_ca_system_score_gemma":0.00010109471,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W1972924401","doi":"10.14778/1920841.1920947","title":"Building ranked mashups of unstructured sources with uncertain information","year":2010,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Mashup; Computer science; Ranking (information retrieval); Information retrieval; Rank (graph theory); Probabilistic logic; Information extraction; Semantics (computer science); Database; World Wide Web; Data mining; Web service; Artificial intelligence; Web modeling","score_opus":0.00427333096314046,"score_gpt":0.19202117821881115,"score_spread":0.1877478472556707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972924401","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.9696986,0.00001918275,0.021152604,0.0015969527,0.00053821446,0.0007217533,0.0000101146725,0.000108694534,0.0061538615],"genre_scores_gemma":[0.9006141,0.0000038510634,0.099221386,0.000071256174,0.000027508739,0.000012874619,0.0000011910458,0.000003826257,0.00004403491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990391,0.0000026121884,0.00024488277,0.00013691664,0.00041251926,0.00016395647],"domain_scores_gemma":[0.9992526,0.000014445918,0.0003580128,0.00019598169,0.00014655433,0.000032410917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027964904,0.000110978515,0.00013315963,0.000107592845,0.00007544364,0.00012562702,0.001261974,0.000027921542,0.000006379492],"category_scores_gemma":[0.000033359804,0.0000660921,0.00004452606,0.00037600537,0.000081799044,0.0013094232,0.00043681855,0.00011654724,0.000001447988],"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.0000621849,0.00008510726,0.0072257947,0.00045912643,0.0001445296,3.4302906e-7,0.0033179729,0.00017614962,0.12516293,0.77569836,0.0016190178,0.08604848],"study_design_scores_gemma":[0.00246747,0.00026361644,0.010192231,0.00021664171,0.000084289146,0.000021852695,0.0007204661,0.016674226,0.9236752,0.0260879,0.019133717,0.00046240893],"about_ca_topic_score_codex":0.00004070364,"about_ca_topic_score_gemma":0.0000022963088,"teacher_disagreement_score":0.7985122,"about_ca_system_score_codex":0.000012318,"about_ca_system_score_gemma":0.000016822098,"threshold_uncertainty_score":0.26951575},"labels":[],"label_agreement":null},{"id":"W1973582313","doi":"10.1145/2525314.2525347","title":"A parallel spatial data analysis infrastructure for the cloud","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Multi-core processor; Distributed computing; Range (aeronautics); Spatial analysis; Parallel processing; Confluence; Data mining; Computational science; Parallel computing; Remote sensing; Operating system","score_opus":0.025265773279392792,"score_gpt":0.25936779789960634,"score_spread":0.23410202462021357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973582313","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.0000581855,0.000021508411,0.99379927,0.0045481604,0.00025769725,0.0002838531,0.000024791954,0.00006457349,0.0009419469],"genre_scores_gemma":[0.109829165,0.000033731547,0.8810555,0.0025472098,0.000591391,0.00009041694,0.00042570411,0.000008075153,0.005418804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.000012915148,0.000111390895,0.0003246256,0.00014605692,0.00016485585],"domain_scores_gemma":[0.99797416,0.000088965186,0.000040788538,0.0018319123,0.000031350886,0.000032817938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018650216,0.0000744901,0.00009112566,0.000054666743,0.00011198284,0.0005469128,0.0034075086,0.000017808215,0.00028922968],"category_scores_gemma":[0.000022049246,0.00004053928,0.000049881703,0.00040845518,0.00002077584,0.00093178643,0.0014569053,0.000042015443,0.00007486793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012763669,0.000013883632,0.0006305463,0.000003774531,0.00045014743,5.1965964e-7,0.00005797479,0.0006758962,0.000002216931,0.05175736,0.3795118,0.5668946],"study_design_scores_gemma":[0.00011596737,0.0000089914365,0.009080193,3.3907085e-7,0.000079573525,1.7871878e-7,0.000018385335,0.892039,0.0000019253077,0.0046776477,0.09391124,0.00006658954],"about_ca_topic_score_codex":0.00057276286,"about_ca_topic_score_gemma":0.00013972145,"teacher_disagreement_score":0.8913631,"about_ca_system_score_codex":0.0000040220452,"about_ca_system_score_gemma":0.000009928736,"threshold_uncertainty_score":0.63320553},"labels":[],"label_agreement":null},{"id":"W1973664142","doi":"10.1007/s00224-012-9382-7","title":"(Approximate) Uncertain Skylines","year":2012,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Skyline; Point (geometry); Probability distribution; Set (abstract data type); Simple (philosophy); Computer science; Lying; Construct (python library); Mathematical optimization; Algorithm; Mathematics; Data mining; Statistics; Geometry","score_opus":0.031101281482397936,"score_gpt":0.2640454652165077,"score_spread":0.23294418373410974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973664142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029343149,0.00071269704,0.958398,0.000049235623,0.0018815979,0.00018240137,0.0000023455304,0.00025424414,0.009176353],"genre_scores_gemma":[0.9837589,0.0000026836246,0.015146183,0.000041229443,0.00039196733,0.0000023234522,0.0000046102564,0.000008886873,0.0006432006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867374,0.00022843629,0.00032097966,0.00018387144,0.0002454989,0.00034747034],"domain_scores_gemma":[0.99889946,0.00020426739,0.00020427609,0.000570498,0.00005186538,0.00006964965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025121483,0.00012627238,0.00022710567,0.0001038895,0.00008563853,0.00009809863,0.0009796381,0.000031382882,0.000004251803],"category_scores_gemma":[0.000035510115,0.000105877894,0.000051497864,0.0002646908,0.000050031667,0.00050628727,0.00040543103,0.000061187544,0.00005019784],"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.000002402384,0.000055827528,0.00066607515,0.000121831654,0.000029003842,0.0000013609908,0.0011013288,0.00042516048,0.00009995124,0.974532,0.00072160526,0.022243427],"study_design_scores_gemma":[0.0010579242,0.00014891538,0.0046469225,0.00061974983,0.000050489438,0.00007551385,0.001596823,0.9436138,0.0018886449,0.024334896,0.020957159,0.0010091547],"about_ca_topic_score_codex":0.000017537037,"about_ca_topic_score_gemma":6.5847125e-8,"teacher_disagreement_score":0.95441574,"about_ca_system_score_codex":0.000016246782,"about_ca_system_score_gemma":0.000010797293,"threshold_uncertainty_score":0.4317575},"labels":[],"label_agreement":null},{"id":"W1976774657","doi":"10.1117/12.541894","title":"&lt;title&gt;A randomized heuristic approach for multidimensional association in target tracking&lt;/title&gt;","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristic; Computational complexity theory; Computer science; Relaxation (psychology); Mathematical optimization; Tracking (education); Tree (set theory); Algorithm; Artificial intelligence; Mathematics","score_opus":0.010099061955353825,"score_gpt":0.21920683848387093,"score_spread":0.20910777652851711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976774657","genre_codex":"empirical","genre_gemma":"methods","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.8132283,0.0005539477,0.1069296,0.0068093054,0.0019386273,0.0033545103,0.00015711256,0.0004131699,0.06661545],"genre_scores_gemma":[0.04926355,0.000064326116,0.9483565,0.00011720508,0.00038339052,0.00019210887,0.000036875586,0.00003711247,0.0015489431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864787,2.738006e-8,0.00038338627,0.00027249168,0.00045529567,0.00024092731],"domain_scores_gemma":[0.9990557,0.00012855741,0.00022086894,0.000045498076,0.00050292985,0.00004644058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008539531,0.00015896588,0.00029609515,0.000091767055,0.0000410852,0.000087735636,0.00061158615,0.000102090846,0.00001234288],"category_scores_gemma":[0.0006062754,0.00013348546,0.00033822493,0.00021868902,0.000056114877,0.00041873936,0.00012266554,0.00013730655,0.000007583856],"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.00009686738,0.000105186184,0.000019347184,0.00013782794,0.0001491137,7.2493506e-8,0.00006678092,0.00024924517,0.010727335,0.97863644,0.009347954,0.00046382562],"study_design_scores_gemma":[0.027133526,0.00019789206,0.0003878355,0.00031521672,0.00018424977,0.000007874543,0.00013359536,0.8750769,0.0141875055,0.025418673,0.056174085,0.00078265235],"about_ca_topic_score_codex":0.0000020377383,"about_ca_topic_score_gemma":4.0344684e-8,"teacher_disagreement_score":0.95321774,"about_ca_system_score_codex":0.00016085342,"about_ca_system_score_gemma":0.00002539694,"threshold_uncertainty_score":0.5443379},"labels":[],"label_agreement":null},{"id":"W1977646040","doi":"10.1145/1167350.1167389","title":"On using conditional rotations and randomized heuristics for self-organizing ternary search tries","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Heuristics; Binary search tree; Trie; Ternary search tree; Computer science; Heuristic; Binary number; A priori and a posteriori; Theoretical computer science; Invariant (physics); Search problem; Set (abstract data type); Algorithm; Search algorithm; Binary tree; Search tree; Mathematics; Data structure; Mathematical optimization; Artificial intelligence; Interval tree; Arithmetic","score_opus":0.024937798078680195,"score_gpt":0.2852842621220211,"score_spread":0.26034646404334094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977646040","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.007797737,0.000020628266,0.98956054,0.0012543763,0.00006799454,0.00033416247,0.000017191363,0.00010004644,0.00084730046],"genre_scores_gemma":[0.1814314,0.000015840438,0.8169213,0.00060752215,0.00013621848,0.000016673046,0.00004149571,0.0000065888094,0.000822994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994043,0.00003256757,0.00012945045,0.00017168556,0.00013975102,0.00012223526],"domain_scores_gemma":[0.9993068,0.00046057973,0.000028190827,0.00012033844,0.00004900638,0.000035084413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032250804,0.000065423075,0.00011603381,0.000084836145,0.00018837726,0.00025021884,0.00018451673,0.000013935099,0.000020874902],"category_scores_gemma":[0.0000585896,0.000054738084,0.000027473807,0.000094371266,0.000036190242,0.0004986702,0.000115686395,0.0000363476,0.000011244903],"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.00027111013,0.000085846346,0.00003662926,0.000020118017,0.00006275799,0.0000031661234,0.00033449387,0.000754104,0.000060564234,0.9863314,0.0033082124,0.008731587],"study_design_scores_gemma":[0.017786851,0.000024789182,0.000052198575,0.00000651265,0.000016267622,0.0000039681104,0.00002537189,0.966407,0.0003301477,0.013723188,0.0015294803,0.00009420551],"about_ca_topic_score_codex":0.000005184544,"about_ca_topic_score_gemma":0.0000011308705,"teacher_disagreement_score":0.9726082,"about_ca_system_score_codex":0.000016867625,"about_ca_system_score_gemma":0.000021965487,"threshold_uncertainty_score":0.2412866},"labels":[],"label_agreement":null},{"id":"W1977733667","doi":"10.1093/comjnl/bxt106","title":"A New and Effective Approach to GML Documents Compression","year":2013,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; XML; Compression ratio; Information retrieval; Data mining; Compression (physics); Encoding (memory); Tree (set theory); Data compression; Pattern matching; Database; Artificial intelligence; World Wide Web","score_opus":0.008118702872697147,"score_gpt":0.22243529010725135,"score_spread":0.2143165872345542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977733667","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.0046183504,0.00007090749,0.99022275,0.002208014,0.000582769,0.00037315825,2.4692707e-7,0.000044183125,0.0018796297],"genre_scores_gemma":[0.088763565,0.000029429326,0.90534824,0.0032783055,0.0012382322,0.000022888567,0.000001744753,0.000013486281,0.0013041305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990271,0.000115089875,0.00014327046,0.00021764518,0.0002519844,0.0002449551],"domain_scores_gemma":[0.9992854,0.000054688036,0.000068279216,0.00033776168,0.000039678413,0.00021417686],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003360964,0.000119715056,0.0001198979,0.00008486612,0.00025639436,0.0014344514,0.0012493612,0.000017702308,0.000013921941],"category_scores_gemma":[0.0000034394998,0.00006944831,0.000034700806,0.0001805256,0.000016836006,0.0010556614,0.0012630841,0.00019684312,0.0001408666],"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.0000021350513,0.000026769654,0.00008292088,0.000003406203,0.000029984689,0.000003366174,0.00060987455,0.00015143621,0.00003376102,0.0036382873,0.14146625,0.8539518],"study_design_scores_gemma":[0.0023840324,0.0005288522,0.076089896,0.0001490973,0.000032883407,0.00070842454,0.00005774297,0.79882157,0.00017619798,0.051351327,0.06906,0.00063999766],"about_ca_topic_score_codex":0.00002614964,"about_ca_topic_score_gemma":1.4718468e-7,"teacher_disagreement_score":0.85331184,"about_ca_system_score_codex":0.000018282753,"about_ca_system_score_gemma":0.0000112074595,"threshold_uncertainty_score":0.99960214},"labels":[],"label_agreement":null},{"id":"W1977873546","doi":"10.1007/s11590-006-0032-3","title":"On pitfalls in computing the geodetic number of a graph","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Data Management and Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Geodetic datum; Combinatorics; Mathematics; Shortest path problem; Graph; Geodesic; Discrete mathematics","score_opus":0.004860542944742337,"score_gpt":0.20948864178880877,"score_spread":0.20462809884406644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977873546","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.016216572,0.0000034608333,0.9775623,0.003838014,0.000112347894,0.0000943032,8.530564e-7,0.000031345808,0.0021407832],"genre_scores_gemma":[0.76045287,0.0000049947316,0.23473719,0.0045858603,0.00005542908,0.0000050804474,0.00002589861,0.000009735303,0.00012295827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993763,0.000040613857,0.00015738845,0.00015351415,0.0001532992,0.00011891611],"domain_scores_gemma":[0.9995872,0.000060047056,0.00007513414,0.00025585043,0.00001337326,0.000008390064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636247,0.00006167956,0.000064607375,0.00007783655,0.00004282991,0.00008131315,0.00041695163,0.000012066059,0.000014126137],"category_scores_gemma":[0.000007095338,0.00004796421,0.000024157378,0.0004371035,0.000028966722,0.00022073222,0.00009089047,0.000048058908,0.0000127985795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.7984455e-7,0.000028809309,0.00094462506,0.0000032418575,0.0000024949272,0.0000028204693,0.000052859617,0.9620091,0.000019553094,0.03258109,0.0032296532,0.001124896],"study_design_scores_gemma":[0.00024812977,0.0000063737752,0.0030865308,0.000019020434,0.000002200362,9.349871e-7,0.000005497984,0.9955676,0.000043401407,0.000758026,0.00018342028,0.00007885257],"about_ca_topic_score_codex":0.00006606783,"about_ca_topic_score_gemma":0.0000028462675,"teacher_disagreement_score":0.7442363,"about_ca_system_score_codex":0.000010615887,"about_ca_system_score_gemma":0.000003385,"threshold_uncertainty_score":0.19559237},"labels":[],"label_agreement":null},{"id":"W1979383090","doi":"10.1109/icassp.2014.6854782","title":"Probabilistic ranking of multi-attribute items using indifference curve","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Ranking (information retrieval); Computer science; Rank (graph theory); Probabilistic logic; Preference; Process (computing); Quality (philosophy); Selection (genetic algorithm); Machine learning; Competition (biology); Data mining; Information retrieval; Artificial intelligence; Statistics; Mathematics","score_opus":0.054665929588310194,"score_gpt":0.27217448058857674,"score_spread":0.21750855100026656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979383090","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.057029527,0.00001266085,0.9421382,0.00005253783,0.00022647524,0.00014025392,0.0000029351581,0.000085486645,0.00031193142],"genre_scores_gemma":[0.8450575,0.0000019489687,0.15459302,0.000064814034,0.000032342774,0.0000030116375,0.0000056878207,0.000004576051,0.00023711078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990093,0.000058810776,0.00021716321,0.00028671493,0.00021657467,0.00021141909],"domain_scores_gemma":[0.99920416,0.000084425345,0.000108366345,0.0005010483,0.000059614897,0.000042380365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464212,0.00010183934,0.0001581118,0.00009598712,0.00006218005,0.00012769291,0.0008990451,0.000026507032,0.000012815988],"category_scores_gemma":[0.00009500318,0.00008387988,0.000036260633,0.00031884963,0.000041602863,0.00055067247,0.0004873614,0.000060536062,0.00001659457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008350159,0.0008751508,0.0852536,0.00059575884,0.0001552366,0.00001902433,0.0029948025,0.0022577846,0.0072393683,0.61161184,0.0009731679,0.28801593],"study_design_scores_gemma":[0.00037021795,0.000033246117,0.008397569,0.00003715713,0.000007469441,0.0000015320056,0.0000091652155,0.98694247,0.00089355675,0.002779857,0.0003753493,0.00015240724],"about_ca_topic_score_codex":0.0000800809,"about_ca_topic_score_gemma":0.000009854824,"teacher_disagreement_score":0.9846847,"about_ca_system_score_codex":0.000014412303,"about_ca_system_score_gemma":0.000014299629,"threshold_uncertainty_score":0.34205222},"labels":[],"label_agreement":null},{"id":"W1979503369","doi":"10.1109/itsc.2007.4357638","title":"Improving Vehicle Positioning and Visual Feature Estimates through Mutual Constraint","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Position (finance); Global Positioning System; Constraint (computer-aided design); Computer science; Feature (linguistics); Artificial intelligence; Visualization; Computer vision; Bayesian probability; Engineering","score_opus":0.00919495397747208,"score_gpt":0.2609781876478673,"score_spread":0.25178323367039523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979503369","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.023567593,0.000066730965,0.9666046,0.0006025355,0.00012950462,0.00007605615,0.000001406188,0.0002001387,0.008751421],"genre_scores_gemma":[0.58909196,0.0000030899228,0.40987596,0.0005690392,0.00006493726,0.0000010992538,0.000008399709,0.0000043796217,0.00038116728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992824,0.0000061182363,0.000094065035,0.0002531722,0.00012978223,0.0002344636],"domain_scores_gemma":[0.9997075,0.0000644008,0.000033514596,0.00012313045,0.000022217691,0.00004920641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002311345,0.0000885198,0.00007283056,0.00003997599,0.00015364538,0.00039040082,0.00020730366,0.000031583495,0.000012352836],"category_scores_gemma":[0.000015926402,0.00007614119,0.000016781416,0.00014465603,0.000058408332,0.0011276078,0.00032451525,0.00008072286,0.000017196271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060383427,0.000058411813,0.0015697767,0.000026801865,0.000028493696,0.00011536126,0.0005491693,0.0000047532735,0.0076956623,0.25169024,0.0018459993,0.7364093],"study_design_scores_gemma":[0.0012627962,0.00035106717,0.018555466,0.00005888163,0.000028524182,0.00013039573,0.0010545352,0.93212134,0.03587374,0.0065424982,0.003279568,0.0007411734],"about_ca_topic_score_codex":0.0000445811,"about_ca_topic_score_gemma":0.000007989429,"teacher_disagreement_score":0.9321166,"about_ca_system_score_codex":0.000011821748,"about_ca_system_score_gemma":0.000009115614,"threshold_uncertainty_score":0.3764644},"labels":[],"label_agreement":null},{"id":"W1980185632","doi":"10.14778/2350229.2350241","title":"Fundamentals of order dependencies","year":2012,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Functional dependency; Lexicographical order; Axiom; Dependency theory (database theory); Tuple; Computer science; Inference; Dependency (UML); Set (abstract data type); Query optimization; Theoretical computer science; Mathematics; Data mining; Artificial intelligence; Discrete mathematics; Relational database; Programming language; Combinatorics","score_opus":0.015635755890120978,"score_gpt":0.22162146837522673,"score_spread":0.20598571248510575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980185632","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.82814556,0.0017846138,0.017046688,0.004923457,0.00317745,0.0020185167,0.00003455075,0.00028712736,0.14258204],"genre_scores_gemma":[0.97913486,0.00003099132,0.019777272,0.000109480214,0.00004753213,0.000016364702,4.9142164e-7,0.0000050414183,0.00087797845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898946,0.000003619679,0.00021492058,0.00013810115,0.0004111539,0.00024275131],"domain_scores_gemma":[0.9994479,0.000015293637,0.00021234056,0.0001838829,0.00009612678,0.00004449002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904561,0.000095770396,0.00013007599,0.00006246886,0.000055202614,0.00004925135,0.0012357677,0.000018301416,0.000025191275],"category_scores_gemma":[0.000033960787,0.00006272663,0.000061294704,0.00035248187,0.00005517242,0.00095494214,0.0010970023,0.0000500688,0.000012188516],"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.000014348312,0.0008212351,0.079185225,0.00038841166,0.00021364352,2.5815467e-7,0.003874838,0.000006572421,0.08988824,0.7600956,0.019957485,0.045554142],"study_design_scores_gemma":[0.0008333872,0.00014774803,0.025610078,0.00013766134,0.00006655538,0.000010800265,0.0011657674,0.000934089,0.9305962,0.007928,0.03221744,0.00035227608],"about_ca_topic_score_codex":0.000023795854,"about_ca_topic_score_gemma":4.3649774e-7,"teacher_disagreement_score":0.84070796,"about_ca_system_score_codex":0.000025184052,"about_ca_system_score_gemma":0.000009048292,"threshold_uncertainty_score":0.25579175},"labels":[],"label_agreement":null},{"id":"W1980418511","doi":"10.1109/icde.2007.367933","title":"Evaluating Proximity Relations Under Uncertainty","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Relation (database); Position (finance); Object (grammar); Computer science; Point (geometry); Process (computing); Data mining; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.0748826486360854,"score_gpt":0.3539822720212371,"score_spread":0.2790996233851517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980418511","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.0049148705,0.00000712279,0.92901003,0.0011026707,0.00016541922,0.000110592315,3.918441e-7,0.00019551894,0.06449338],"genre_scores_gemma":[0.4209584,0.0000010094094,0.56385493,0.00083304156,0.00007654416,0.0000044380267,0.000009867593,0.0000043039554,0.014257458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992251,0.00001842215,0.00013170422,0.00020803708,0.0002314804,0.0001852486],"domain_scores_gemma":[0.9994398,0.00007800355,0.000034483564,0.00036160098,0.000042529035,0.000043598528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011327744,0.00005512417,0.000044947963,0.000061275365,0.00012659717,0.00012115676,0.00044027856,0.000018806273,0.000088953064],"category_scores_gemma":[0.000039553397,0.00004556965,0.000022659942,0.00032789973,0.000015392945,0.00086959964,0.00025392833,0.000061062514,0.00020305857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.4307927e-7,0.000034947883,0.0004395373,0.0000021730525,0.000009267286,0.000002734878,0.000080225895,0.0019771024,0.00006677525,0.78678876,0.002454843,0.20814271],"study_design_scores_gemma":[0.00030426594,0.000050261693,0.0170468,0.000006191869,0.0000067764595,0.00000197632,0.000099309524,0.9188483,0.00017060887,0.056363355,0.0069157877,0.00018640446],"about_ca_topic_score_codex":0.000035696485,"about_ca_topic_score_gemma":0.000042219566,"teacher_disagreement_score":0.9168712,"about_ca_system_score_codex":0.000031738757,"about_ca_system_score_gemma":0.000020230467,"threshold_uncertainty_score":0.26099747},"labels":[],"label_agreement":null},{"id":"W1981953140","doi":"10.1007/s10700-006-0020-1","title":"A concept geometry for conceptual spaces","year":2006,"lang":"en","type":"article","venue":"Fuzzy Optimization and Decision Making","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Mathematics; Hypercube; Object (grammar); Space (punctuation); Similarity (geometry); Algebra over a field; Scalar (mathematics); Computer science; Pure mathematics; Theoretical computer science; Artificial intelligence; Geometry; Discrete mathematics; Image (mathematics)","score_opus":0.017281373451054325,"score_gpt":0.27140670863036326,"score_spread":0.2541253351793089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981953140","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.0007552639,0.00032378247,0.9963521,0.00014050228,0.00030548713,0.00019470984,0.000010819018,0.000112711685,0.0018046721],"genre_scores_gemma":[0.10679797,0.00001955867,0.89236945,0.00033755263,0.00012178892,0.000010843169,0.00003345477,0.0000075690796,0.00030179246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909705,0.00001306,0.00019489658,0.00032130774,0.00020349358,0.00017018989],"domain_scores_gemma":[0.999368,0.0002120851,0.000090743546,0.00021981781,0.00007643786,0.000032874672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018154593,0.000100247635,0.00011580084,0.00016410604,0.00018708325,0.00057955226,0.00029782188,0.000040354313,0.000029109577],"category_scores_gemma":[0.00005592566,0.00009070855,0.000033582583,0.00034500012,0.000048513382,0.00073548267,0.00021007481,0.000034245226,0.0000063964617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014965986,0.00003876032,0.00026028618,0.0000069860075,0.000008405622,0.0000047263743,0.00012819092,0.26860708,0.000006211778,0.43262428,0.023895234,0.2744049],"study_design_scores_gemma":[0.0007282782,0.000045420817,0.00024535847,0.00003111305,0.000005876678,0.0000030125875,0.00008836805,0.964894,0.000016644337,0.018869359,0.014902578,0.00017000095],"about_ca_topic_score_codex":0.0000033003955,"about_ca_topic_score_gemma":0.0000014807879,"teacher_disagreement_score":0.6962869,"about_ca_system_score_codex":0.000010535946,"about_ca_system_score_gemma":0.000010598077,"threshold_uncertainty_score":0.5588636},"labels":[],"label_agreement":null},{"id":"W1982250524","doi":"10.1007/s00453-006-0112-x","title":"Large Deviations for the Weighted Height of an Extended Class of Trees","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":49,"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":"Mathematics; Combinatorics; Binary search tree; Class (philosophy); Weight-balanced tree; Intersection (aeronautics); Constant (computer programming); Theory of computation; Binary tree; Tree (set theory); Random binary tree; Limit (mathematics); Plane (geometry); Discrete mathematics; Large deviations theory; Statistics; Algorithm; Geometry; Mathematical analysis; Computer science","score_opus":0.010497652059589604,"score_gpt":0.24524001371447793,"score_spread":0.23474236165488832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982250524","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.0023193026,0.00022867482,0.9947201,0.00092133397,0.00022083618,0.00034074468,0.00015636355,0.000064160966,0.001028467],"genre_scores_gemma":[0.80957794,0.00004214937,0.18816665,0.0001618467,0.00032586136,0.00008669631,0.00022773595,0.000020682817,0.0013904609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896556,0.000035419864,0.00030052254,0.0002453868,0.00022815303,0.00022498086],"domain_scores_gemma":[0.9988302,0.00016876379,0.00016738787,0.00068520504,0.00011973838,0.00002870095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904891,0.00010643427,0.00016456367,0.00009355418,0.00012555975,0.000053396023,0.0010741303,0.000035877943,0.0000140731345],"category_scores_gemma":[0.00001309493,0.00007493974,0.00008886661,0.00038218356,0.000056720324,0.0005159919,0.00017846476,0.000047464888,0.000004456762],"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.000008221441,0.000545151,0.00006362196,0.000023835462,0.00008245938,0.00000243107,0.00015610975,0.000021100657,0.00057223806,0.8861465,0.010161623,0.102216706],"study_design_scores_gemma":[0.0012226589,0.0002178093,0.011634796,0.000016245793,0.000068331115,0.0000024547028,0.000098587065,0.8080047,0.013674736,0.05582064,0.10900417,0.00023488438],"about_ca_topic_score_codex":0.000052657673,"about_ca_topic_score_gemma":0.000091636444,"teacher_disagreement_score":0.83032584,"about_ca_system_score_codex":0.000009743054,"about_ca_system_score_gemma":0.000027300392,"threshold_uncertainty_score":0.30559537},"labels":[],"label_agreement":null},{"id":"W1982600687","doi":"10.1016/j.cor.2004.11.021","title":"Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":45,"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 Montréal; Université du Québec à Montréal","funders":"","keywords":"Sequence (biology); Computer science; Computation; Travel time; Mathematical optimization; Route planning; Decomposition; Plan (archaeology); Shortest path problem; Mathematics; Algorithm; Theoretical computer science; Graph; Transport engineering","score_opus":0.08730844122553108,"score_gpt":0.3832802464060155,"score_spread":0.2959718051804844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982600687","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.003981165,0.00004696593,0.9900962,0.0030105675,0.000049879687,0.000968785,0.00002405986,0.00009659671,0.0017257567],"genre_scores_gemma":[0.41032425,0.000014287904,0.58787555,0.00030523597,0.00014581926,0.00026581067,0.00008809169,0.000015369107,0.00096557953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767786,0.00014648316,0.00036405976,0.00060997414,0.00076901587,0.00043260655],"domain_scores_gemma":[0.9984886,0.00012061296,0.000029351802,0.00088258064,0.00035911868,0.00011975506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098256,0.00014090001,0.0001793672,0.0003084083,0.00035999878,0.00048591802,0.0018223111,0.000045499222,0.00001673623],"category_scores_gemma":[0.00003429111,0.00013725905,0.000039750877,0.0011468948,0.00009584495,0.0012760506,0.0009008271,0.00022632675,0.00037632097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014474036,0.0005887186,0.00011013153,0.00005642243,0.000064814085,0.00002438343,0.011347118,0.5383688,0.04314558,0.048786607,0.013704444,0.34378847],"study_design_scores_gemma":[0.00022968475,0.00013081498,0.00018315988,0.000067419074,0.0000029519463,0.0000060368666,0.00012390297,0.99107105,0.002813478,0.00019791872,0.0050041666,0.00016944572],"about_ca_topic_score_codex":0.0001364045,"about_ca_topic_score_gemma":0.00002908583,"teacher_disagreement_score":0.45270216,"about_ca_system_score_codex":0.00011744964,"about_ca_system_score_gemma":0.00014083195,"threshold_uncertainty_score":0.5597262},"labels":[],"label_agreement":null},{"id":"W1982732476","doi":"10.1109/edoc.2012.29","title":"Efficient QoS-based Service Selection with Consideration of User Requirements","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skyline; Computer science; Quality of service; Ranking (information retrieval); Selection (genetic algorithm); Process (computing); Service (business); Data mining; Computation; Quality (philosophy); Machine learning; Distributed computing; Database; Computer network; Algorithm","score_opus":0.02757498345983851,"score_gpt":0.25533282575544985,"score_spread":0.22775784229561136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982732476","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.08409345,0.0000053187473,0.91209245,0.00048120218,0.00019185126,0.00015438572,8.0957517e-7,0.0000875891,0.002892923],"genre_scores_gemma":[0.8924361,2.0900126e-7,0.10658842,0.00066273764,0.000042614058,0.0000064013966,0.0000073060337,0.000003517661,0.00025271834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933827,0.000023855268,0.00011437393,0.00013360176,0.00023413304,0.00015576305],"domain_scores_gemma":[0.99956834,0.00001728176,0.00006476808,0.00021316094,0.00009769219,0.000038763068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021955669,0.00006523187,0.00006233256,0.00006747223,0.000052836276,0.000059990245,0.00017224508,0.000014594403,0.000045007975],"category_scores_gemma":[0.0000046104715,0.000049289556,0.000010866071,0.00037168604,0.000009632694,0.00046715123,0.00006358138,0.000025057012,0.000036357014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016348487,0.0041146097,0.15844424,0.0005615515,0.00035482162,0.000007638882,0.0023228172,0.078761,0.026688665,0.64348906,0.037516456,0.047575656],"study_design_scores_gemma":[0.000989786,0.00016085299,0.021076495,0.000030739546,0.000021915497,0.0000023716293,0.000042094427,0.9351769,0.03758245,0.000046687273,0.004644968,0.00022475886],"about_ca_topic_score_codex":0.000049851955,"about_ca_topic_score_gemma":0.000027894299,"teacher_disagreement_score":0.85641587,"about_ca_system_score_codex":0.000017542223,"about_ca_system_score_gemma":0.000021658785,"threshold_uncertainty_score":0.20099698},"labels":[],"label_agreement":null},{"id":"W1983018368","doi":"10.1109/icde.2012.124","title":"Efficient Top-k Keyword Search in Graphs with Polynomial Delay","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Keyword search; Set (abstract data type); Ranking (information retrieval); Graph; Theoretical computer science; Information retrieval","score_opus":0.014786198395387352,"score_gpt":0.24040256443500058,"score_spread":0.22561636603961321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983018368","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.5269783,0.000090598616,0.4161457,0.0006243087,0.00048105756,0.0002962283,0.00000188332,0.00018171029,0.055200182],"genre_scores_gemma":[0.9597367,0.0000023425187,0.038792253,0.00021107077,0.000053908694,0.0000071958384,0.0000025093823,0.00000466912,0.0011893514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897593,0.00002920335,0.00010386986,0.00021314473,0.0002524523,0.00042541348],"domain_scores_gemma":[0.99946797,0.000023195053,0.00001546295,0.0003833662,0.000014299789,0.000095700016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038487927,0.00008697679,0.00008086838,0.00018301186,0.000045872734,0.00012263299,0.00060881424,0.00001943229,0.00004537308],"category_scores_gemma":[0.0000027266422,0.000061754305,0.000020267074,0.0005843919,0.000027991342,0.00037390785,0.00037022945,0.000085100124,0.00013790812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059339396,0.00125319,0.16985391,0.000035571244,0.000061291576,0.00010733479,0.0032054193,0.0028228327,0.00015240742,0.52858734,0.01553525,0.27832612],"study_design_scores_gemma":[0.004001193,0.0005307562,0.25656,0.00006393002,0.000019530886,0.000050814087,0.00071135524,0.6773468,0.0030350464,0.0003181933,0.055881888,0.0014804426],"about_ca_topic_score_codex":0.0001335205,"about_ca_topic_score_gemma":0.000019955329,"teacher_disagreement_score":0.674524,"about_ca_system_score_codex":0.00002013879,"about_ca_system_score_gemma":0.00001614169,"threshold_uncertainty_score":0.25182673},"labels":[],"label_agreement":null},{"id":"W1983171268","doi":"10.1239/aap/1025131226","title":"Density approximation and exact simulation of random variables that are solutions of fixed-point equations","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Data Management and Algorithms","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":"McGill University","funders":"","keywords":"Mathematics; Fixed point; Probabilistic logic; Random variable; Applied mathematics; Class (philosophy); Limit (mathematics); Sampling (signal processing); Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.03694009101673632,"score_gpt":0.2498786806779737,"score_spread":0.21293858966123738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983171268","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.009472008,0.00024795535,0.98759526,0.000088204266,0.00005189143,0.0005974277,0.000010520763,0.000038472474,0.0018982629],"genre_scores_gemma":[0.9156592,0.00006943705,0.084199816,0.000010097704,0.0000069445737,0.00003720871,0.000009323046,0.0000024375167,0.0000055541213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898785,0.000060838865,0.00032180682,0.0003007948,0.00019067412,0.00013800246],"domain_scores_gemma":[0.9988201,0.00041483156,0.00025873724,0.0004318456,0.000050909122,0.000023540175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069842895,0.00009244905,0.0002074057,0.00008134532,0.00007233743,0.000025176043,0.00024358404,0.00003512454,0.000011690049],"category_scores_gemma":[0.00015095752,0.000087728484,0.000025632819,0.0003438623,0.0001183579,0.0009218775,0.00019920785,0.00006275875,0.0000014643429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005125735,0.00068970065,0.009172719,0.00056955434,0.000021612714,4.768929e-7,0.0009836131,0.2645858,0.00032752397,0.46888146,0.000020240486,0.254696],"study_design_scores_gemma":[0.0006919798,0.000016315933,0.0032241568,0.000025854335,0.000008573657,1.4905615e-7,0.00004464386,0.8265488,0.00057415327,0.16866407,0.00010702015,0.00009425623],"about_ca_topic_score_codex":0.000008915329,"about_ca_topic_score_gemma":0.000036327816,"teacher_disagreement_score":0.9061872,"about_ca_system_score_codex":0.000030976284,"about_ca_system_score_gemma":0.0000063192806,"threshold_uncertainty_score":0.35774636},"labels":[],"label_agreement":null},{"id":"W1984043155","doi":"10.1145/2189403.2189405","title":"CTS 2011 Workshop Report: the Fourth International Workshop on Computational Transportation Science","year":2012,"lang":"en","type":"article","venue":"SIGSPATIAL Special","topic":"Data Management and Algorithms","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":"Library science; Computer science; Operations research; Engineering","score_opus":0.02560025034052508,"score_gpt":0.2774527309373553,"score_spread":0.2518524805968302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984043155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011072741,0.000025281375,0.93489647,0.010133753,0.014526882,0.00043821847,0.000034939567,0.00017499301,0.028696733],"genre_scores_gemma":[0.96229637,0.000010112387,0.022252858,0.0009931045,0.0127661135,0.00002840902,0.00024247321,0.000015065103,0.0013954976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760276,0.000036879715,0.00032394024,0.00041617578,0.0012026156,0.0004176411],"domain_scores_gemma":[0.99892217,0.00016335877,0.0001998321,0.00044492405,0.00013635089,0.00013337946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083755556,0.00015956037,0.00011244821,0.00017972571,0.0004139377,0.0004528717,0.0015685936,0.0000425993,0.00047027037],"category_scores_gemma":[0.00013278298,0.00012313924,0.000072052804,0.000502792,0.00020027297,0.0019182668,0.00015982559,0.00019326188,0.00034612278],"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.000059825725,0.00041864289,0.003324227,0.0000046196865,0.000056199293,0.00009383669,0.0027953456,0.0066105775,0.00003634449,0.47952378,0.057255715,0.44982088],"study_design_scores_gemma":[0.0018172116,0.00012271562,0.40680954,0.00009154802,0.000052332165,0.000053078307,0.00041972185,0.111361675,0.00045441283,0.019386834,0.45821002,0.0012208851],"about_ca_topic_score_codex":0.000028744746,"about_ca_topic_score_gemma":0.00006151643,"teacher_disagreement_score":0.9512236,"about_ca_system_score_codex":0.000084644205,"about_ca_system_score_gemma":0.00009752367,"threshold_uncertainty_score":0.5149131},"labels":[],"label_agreement":null},{"id":"W1984054760","doi":"10.1007/s00236-004-0157-8","title":"A deterministic skip list for k-dimensional range search","year":2005,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","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 New Brunswick; Nova Scotia Community College","funders":"","keywords":"Range (aeronautics); Data structure; Commutative property; Mathematics; Set (abstract data type); Theory of computation; Discrete mathematics; Combinatorics; Cartesian product; Extension (predicate logic); Associative property; Computer science; Algorithm; Pure mathematics","score_opus":0.021941126642092315,"score_gpt":0.26816769603582175,"score_spread":0.24622656939372944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984054760","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.013929379,0.000032230826,0.91831046,0.011350224,0.00064983947,0.0013639069,0.00008533199,0.0004959948,0.05378261],"genre_scores_gemma":[0.6267565,0.0000057313805,0.3671941,0.0034859045,0.000280281,0.00007569116,0.0000654791,0.000010671446,0.002125692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990036,0.000009999969,0.00025855136,0.00013363906,0.00027910358,0.0003151084],"domain_scores_gemma":[0.9991957,0.00014774984,0.000052165688,0.00046097423,0.000053067906,0.00009032492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033105508,0.00010510844,0.00011517617,0.00010323139,0.00014690153,0.000325624,0.00089954917,0.000029361365,0.0000614528],"category_scores_gemma":[0.00005692045,0.00008949316,0.00005435193,0.00015625378,0.000034522833,0.002028773,0.00041194088,0.000071153765,0.0003906628],"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.000027502992,0.00016218047,0.00005989338,0.00022577634,0.00006066952,0.0000066681414,0.0018471992,0.0001251507,0.00004164601,0.08853278,0.18664901,0.72226155],"study_design_scores_gemma":[0.0005131248,0.000076558055,0.00024318858,0.000016181293,0.00000703854,0.0000058374503,0.000019929961,0.7006685,0.000109402376,0.00033945296,0.29784715,0.0001535841],"about_ca_topic_score_codex":0.0000032015962,"about_ca_topic_score_gemma":0.000002894811,"teacher_disagreement_score":0.72210795,"about_ca_system_score_codex":0.000023717288,"about_ca_system_score_gemma":0.000038610764,"threshold_uncertainty_score":0.50213104},"labels":[],"label_agreement":null},{"id":"W1986041862","doi":"10.14778/1920841.1920982","title":"An access cost-aware approach for object retrieval over multiple sources","year":2010,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"","keywords":"Computer science; Overhead (engineering); Probabilistic logic; Object (grammar); Source code; Selection (genetic algorithm); Data mining; Information retrieval; Data source; Database; Artificial intelligence; Programming language","score_opus":0.024767759603829508,"score_gpt":0.279069790039691,"score_spread":0.2543020304358615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986041862","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.8018389,0.00005656899,0.18005764,0.0015751431,0.0023067323,0.006093999,0.0001381389,0.0005717958,0.007361093],"genre_scores_gemma":[0.9644738,0.0000058117303,0.034681268,0.00018594254,0.00019602406,0.00011708327,0.000011099332,0.00001563344,0.00031334543],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854624,0.0000047350404,0.00023061017,0.00046606798,0.00042885507,0.00032349338],"domain_scores_gemma":[0.99910796,0.00004101667,0.00023525467,0.00037474846,0.00015805088,0.00008299716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005437776,0.00017243047,0.00017610521,0.00009254317,0.00020796753,0.000563176,0.0035090633,0.000054836783,0.000007937582],"category_scores_gemma":[0.000093269584,0.00011796501,0.00010995419,0.0003525133,0.000073391224,0.0016927038,0.0010617637,0.00016808786,0.0000015920475],"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.000665523,0.004382917,0.18806846,0.0016814187,0.0007031418,0.0000021900673,0.0072604846,0.00051865866,0.37698635,0.20731589,0.05414492,0.15827003],"study_design_scores_gemma":[0.0031262864,0.00035182145,0.02122373,0.000051651867,0.00008861919,0.000008461264,0.0004661838,0.45658672,0.4877375,0.0051413933,0.02447739,0.0007402235],"about_ca_topic_score_codex":0.00003986216,"about_ca_topic_score_gemma":0.0000036846845,"teacher_disagreement_score":0.45606807,"about_ca_system_score_codex":0.000022338265,"about_ca_system_score_gemma":0.000020435977,"threshold_uncertainty_score":0.6520771},"labels":[],"label_agreement":null},{"id":"W1987170162","doi":"10.1016/j.engappai.2014.04.004","title":"FIA5: A customized Fuzzy Interval Algebra for modeling spatial relevancy in urban context-aware systems","year":2014,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Context (archaeology); Fuzzy logic; Interval (graph theory); Theoretical computer science; Artificial intelligence; Algebra over a field; Data mining; Mathematics","score_opus":0.02274273637091325,"score_gpt":0.25329204964011764,"score_spread":0.2305493132692044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987170162","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.001578505,0.0001050859,0.99688923,0.00013348677,0.0002990488,0.00075854996,0.000014542496,0.00015946206,0.00006208404],"genre_scores_gemma":[0.954407,0.000009389014,0.044764105,0.000014752053,0.00016942876,0.0005656727,0.000020775284,0.000016695823,0.00003223514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985318,0.000022343214,0.00061427994,0.00040031518,0.00016793107,0.00026333277],"domain_scores_gemma":[0.99888265,0.00020678298,0.00011442607,0.0006181662,0.00011823674,0.000059709855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054104155,0.00015893155,0.00026390044,0.0002608769,0.000058549926,0.000121555895,0.000997835,0.00005831329,0.0000019471618],"category_scores_gemma":[0.00012430275,0.00017347494,0.00007668078,0.00044151157,0.000024536188,0.00032520163,0.00016841383,0.00012288964,0.000025874879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013039031,0.00007831146,0.00000985396,0.000109547,0.000015199407,3.156281e-7,0.0002769046,0.29223028,0.0003165477,0.47973928,0.00005974539,0.22715098],"study_design_scores_gemma":[0.00007203955,0.000037761056,0.0000039911606,0.00007736436,0.0000067937362,5.8841846e-7,0.00008525467,0.9908363,0.0016387351,0.005035532,0.002030457,0.00017515499],"about_ca_topic_score_codex":0.00022709856,"about_ca_topic_score_gemma":0.000031322194,"teacher_disagreement_score":0.95282847,"about_ca_system_score_codex":0.000040863808,"about_ca_system_score_gemma":0.000020247742,"threshold_uncertainty_score":0.7074103},"labels":[],"label_agreement":null},{"id":"W1987268029","doi":"10.1007/s11042-007-0103-1","title":"Flexible integration of multimedia sub-queries with qualitative preferences","year":2007,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"","keywords":"Computer science; Flexibility (engineering); Set (abstract data type); Matching (statistics); Rank (graph theory); Object (grammar); Function (biology); Information retrieval; Similarity (geometry); Monotone polygon; Theoretical computer science; Data mining; Image (mathematics); Artificial intelligence; Programming language","score_opus":0.05049170897294804,"score_gpt":0.3214820700270039,"score_spread":0.2709903610540559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987268029","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.010507817,0.000072971234,0.98641086,0.00019755823,0.000032606134,0.00046781517,0.000057060097,0.00009421265,0.0021591247],"genre_scores_gemma":[0.49645758,0.00009018646,0.5024937,0.000055317527,0.000084531166,0.00025303496,0.00019880012,0.000008634876,0.00035826256],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991294,0.000017739054,0.00022654129,0.00027479738,0.00019018556,0.00016131939],"domain_scores_gemma":[0.9990559,0.00033267375,0.00012888858,0.00030044213,0.00011054443,0.00007152282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748975,0.00011168434,0.00013443812,0.00009197552,0.000097819015,0.00011218573,0.00033291592,0.000034473534,0.000008042641],"category_scores_gemma":[0.000031451622,0.00008370196,0.00001890404,0.00036378237,0.00017056832,0.0007503161,0.00010230213,0.00007164858,0.000014152134],"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.000009357442,0.00008591079,0.00023444722,0.000019026305,0.00001976198,5.11047e-7,0.0043756887,0.0000025199809,0.0027380413,0.05123165,0.00016929614,0.94111377],"study_design_scores_gemma":[0.0049053365,0.0012648082,0.16585222,0.00035465488,0.00018475074,0.000014354266,0.027957495,0.104332045,0.54973614,0.04142454,0.10155624,0.0024174016],"about_ca_topic_score_codex":0.000061479215,"about_ca_topic_score_gemma":0.00007827856,"teacher_disagreement_score":0.9386964,"about_ca_system_score_codex":0.000009051439,"about_ca_system_score_gemma":0.00002186818,"threshold_uncertainty_score":0.3413267},"labels":[],"label_agreement":null},{"id":"W1987634983","doi":"10.1145/2068984.2068987","title":"Crowd-sourced carpool recommendation based on simple and efficient trajectory grouping","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Carpool; Trajectory; Computer science; Simple (philosophy); Data mining; Transport engineering; Engineering","score_opus":0.033034306958350176,"score_gpt":0.22181301588456653,"score_spread":0.18877870892621634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987634983","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.028433898,0.0000024306755,0.93957746,0.00021371843,0.0002015678,0.00015088746,0.0000026512644,0.0001976781,0.03121968],"genre_scores_gemma":[0.9547464,0.0000010279429,0.043893114,0.0010815397,0.000042806656,0.000008352478,0.000021188569,0.0000066486828,0.00019892307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.00003615288,0.00011381851,0.0003026888,0.000111623056,0.0001650043],"domain_scores_gemma":[0.99956095,0.000036811623,0.000038424976,0.00029185275,0.000018518838,0.00005342793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027311986,0.00008946647,0.00006998639,0.00011725351,0.00010638419,0.00011170196,0.00029002634,0.00001969204,0.00020225572],"category_scores_gemma":[0.00001154495,0.00007765367,0.000021857632,0.00017004885,0.00002122448,0.00022180997,0.0001388991,0.000044223496,0.000044053086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006256164,0.00071606867,0.0029023415,0.00007952902,0.00005704375,0.000026581018,0.0032390545,0.00062974397,0.0005837602,0.057955608,0.02234354,0.9114042],"study_design_scores_gemma":[0.0004006792,0.0001510423,0.008750693,0.00000791215,0.0000047995713,5.599315e-7,0.000055036773,0.9832036,0.0016028782,0.00019002023,0.0054681553,0.00016462717],"about_ca_topic_score_codex":0.00005579669,"about_ca_topic_score_gemma":0.0000079660695,"teacher_disagreement_score":0.98257387,"about_ca_system_score_codex":0.000016572514,"about_ca_system_score_gemma":0.0000070728092,"threshold_uncertainty_score":0.3166625},"labels":[],"label_agreement":null},{"id":"W1987759864","doi":"10.4018/jaeis.2010070102","title":"A Systematic Approach for Managing the Risk Related to Semantic Interoperability between Geospatial Datacubes","year":2010,"lang":"en","type":"article","venue":"International Journal of Agricultural and Environmental Information Systems","topic":"Data Management and Algorithms","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":"Université Laval; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Geospatial analysis; Computer science; Interoperability; Information retrieval; Database; Geospatial metadata; Data science; Metadata; World Wide Web; Geography; Metadata repository; Remote sensing; Meta Data Services","score_opus":0.006775708503710019,"score_gpt":0.2040943667207618,"score_spread":0.1973186582170518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987759864","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.7028204,0.000038115653,0.29316533,0.0012154693,0.0015946788,0.00085578277,0.00012692831,0.000021500195,0.00016176993],"genre_scores_gemma":[0.99640894,0.00001570339,0.003197859,0.000054980952,0.00013027218,0.000022686658,0.00011688335,0.0000020718985,0.000050596056],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99860877,0.000055472945,0.0007029992,0.0000976432,0.00042875687,0.00010634033],"domain_scores_gemma":[0.99911207,0.00008312557,0.00051812927,0.00015305063,0.00006535027,0.000068288966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085332757,0.00011220288,0.0001787547,0.00008906495,0.0001237146,0.00070767873,0.0009381594,0.000032170417,0.0000016957925],"category_scores_gemma":[0.000040753574,0.00005486247,0.00007515087,0.000065564775,0.000029119743,0.0028939198,0.00029651306,0.0001682432,0.000009403454],"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.00053882535,0.0017648587,0.15669365,0.016587503,0.01788221,0.000032929234,0.14124072,0.09202643,0.01566293,0.25842378,0.026564911,0.27258125],"study_design_scores_gemma":[0.00355242,0.0006851282,0.67796284,0.0011486942,0.00042682403,0.001377219,0.029276848,0.276973,0.00058546034,0.0008518084,0.0060729855,0.0010867951],"about_ca_topic_score_codex":0.000021255755,"about_ca_topic_score_gemma":0.0000013031668,"teacher_disagreement_score":0.52126914,"about_ca_system_score_codex":0.000043309527,"about_ca_system_score_gemma":0.00000391274,"threshold_uncertainty_score":0.68241626},"labels":[],"label_agreement":null},{"id":"W1987916013","doi":"10.2316/journal.206.2009.3.206-3274","title":"A QUALITATIVE MODEL OF DYNAMIC SCENE ANALYSIS AND INTERPRETATION IN AMBIENT INTELLIGENCE SYSTEMS","year":2009,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"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":"Interpretation (philosophy); Computer science; Ambient intelligence; Spatial intelligence; Artificial intelligence; Machine learning","score_opus":0.020338160905148554,"score_gpt":0.3319495610846746,"score_spread":0.31161140017952604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987916013","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.057465736,0.00012807205,0.9415406,0.0006711437,0.00012627154,0.00004302399,0.0000035415035,0.0000053519134,0.000016245009],"genre_scores_gemma":[0.8815071,0.00015930852,0.11828038,0.000028693064,0.000006290567,3.655257e-7,0.000004740507,0.0000011731884,0.000011973349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990658,0.00004939781,0.0004484454,0.00009864636,0.0002828347,0.00005486364],"domain_scores_gemma":[0.999207,0.000046562825,0.00040379557,0.00006647486,0.00025014687,0.000026009347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053408986,0.00005967505,0.00015347377,0.0006262486,0.00001257531,0.00014072678,0.00026835655,0.000019402305,3.4356682e-7],"category_scores_gemma":[0.000042598724,0.000053020314,0.000036890073,0.00026366048,0.000019732797,0.0007597314,0.000053308675,0.000055327913,2.0168753e-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.000020347226,0.00014306269,0.00032743148,0.000018645007,0.00023430964,0.000008736935,0.0072337803,0.73720074,0.0007559784,0.06273964,0.000004973192,0.19131233],"study_design_scores_gemma":[0.00015318267,0.00006819807,0.00706097,0.000086197186,0.000031155385,0.000005939145,0.00034080792,0.98535943,0.000069489884,0.0067755324,5.237771e-7,0.00004856032],"about_ca_topic_score_codex":0.0000110488545,"about_ca_topic_score_gemma":0.000007195337,"teacher_disagreement_score":0.8240413,"about_ca_system_score_codex":0.000042092634,"about_ca_system_score_gemma":0.000016752017,"threshold_uncertainty_score":0.21621056},"labels":[],"label_agreement":null},{"id":"W1991341889","doi":"10.1109/ccece.2014.6901019","title":"Multiscale navigation in large trace data","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"TRACE (psycholinguistics); Computer science","score_opus":0.026631703787659708,"score_gpt":0.27759460036045625,"score_spread":0.2509628965727965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991341889","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.0032585766,0.000009445679,0.9879039,0.0008751797,0.00013831424,0.00006055665,0.000006419982,0.00008223837,0.0076653874],"genre_scores_gemma":[0.7686134,0.0000051268335,0.22751214,0.0003960738,0.000075850105,0.000004183715,0.00023578273,0.0000045763804,0.0031528682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994035,0.000024025541,0.00008573806,0.00025315292,0.00010579336,0.00012782302],"domain_scores_gemma":[0.99909055,0.000022106036,0.000017535373,0.0008410386,0.000007051331,0.000021721948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476025,0.000041119663,0.000046153375,0.00003526668,0.000025025218,0.000111479145,0.0012689764,0.000013162895,0.000017660606],"category_scores_gemma":[0.000019110534,0.000035709345,0.000005896403,0.00017056402,0.0000053301187,0.0014617248,0.0007521342,0.000040277155,0.000164615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.828749e-7,0.00016227837,0.0044732015,0.0000145867325,0.000003847033,0.00000789558,0.00018236693,0.00002227964,0.00007760949,0.26477543,0.018955793,0.71132386],"study_design_scores_gemma":[0.00025218815,0.000007258275,0.009447637,0.000005686813,6.136203e-7,4.2037405e-7,0.00000888442,0.8962317,0.00006636154,0.0009713883,0.09294581,0.00006204051],"about_ca_topic_score_codex":0.000039040104,"about_ca_topic_score_gemma":0.00007938461,"teacher_disagreement_score":0.8962094,"about_ca_system_score_codex":0.0000044955577,"about_ca_system_score_gemma":0.0000028231811,"threshold_uncertainty_score":0.23580948},"labels":[],"label_agreement":null},{"id":"W1991782162","doi":"10.1111/1467-9671.00127","title":"A Perspective on the Fundamentals of Fuzzy Sets and their Use in Geographic Information Systems","year":2003,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":188,"is_retracted":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":"Fuzzy logic; Data mining; Computer science; Geographic information system; Fuzzy set; Sophistication; Perspective (graphical); Relation (database); AM/FM/GIS; Fuzzy set operations; GIS applications; Defuzzification; Artificial intelligence; Fuzzy number; Geography; Cartography","score_opus":0.021448065113886586,"score_gpt":0.23594112615745103,"score_spread":0.21449306104356444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991782162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47947055,0.00024256001,0.5006421,0.0012091997,0.0005368791,0.0012889844,0.00009450938,0.00008425765,0.016430946],"genre_scores_gemma":[0.99924195,0.00006953037,0.0005661797,0.000053775002,0.0000012547978,0.00002751051,0.000001347376,0.0000016331145,0.000036813926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950576,0.00007008051,0.00014667881,0.00009742986,0.000088295594,0.00009177611],"domain_scores_gemma":[0.9996276,0.000087246866,0.000038895854,0.00021366982,0.000019658299,0.0000129639075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028146626,0.000062927,0.00007520088,0.00027604014,0.00004808343,0.00012053603,0.00015767917,0.000019596091,0.0000055570777],"category_scores_gemma":[0.000007872765,0.00004398376,0.000020699348,0.0005063284,0.00003836382,0.0011930314,0.0000064956453,0.00008471059,0.0000031274],"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.00003246336,0.0006478591,0.0072809923,0.000119974575,0.00014713056,0.000005746071,0.04541002,0.009029078,0.000108730164,0.87644625,0.0002520432,0.0605197],"study_design_scores_gemma":[0.009571858,0.0014003005,0.30319318,0.0013150002,0.00008512701,0.0000861748,0.17669456,0.41719437,0.003749261,0.0353087,0.049178742,0.002222726],"about_ca_topic_score_codex":0.0008601722,"about_ca_topic_score_gemma":0.00016148703,"teacher_disagreement_score":0.8411376,"about_ca_system_score_codex":0.00003750468,"about_ca_system_score_gemma":0.000008686942,"threshold_uncertainty_score":0.17936058},"labels":[],"label_agreement":null},{"id":"W1992628046","doi":"10.1145/375663.375666","title":"Iceberg-cube computation with PC clusters","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of British Columbia Hospital","funders":"","keywords":"Computer science; Computation; Cuboid; Cube (algebra); Parallel computing; Load balancing (electrical power); Algorithm; Mathematics","score_opus":0.01430538454407141,"score_gpt":0.231174238206917,"score_spread":0.21686885366284558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992628046","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.0029145556,0.0000056031104,0.93072474,0.0017055877,0.00012392533,0.00008060214,2.9184173e-7,0.00020457465,0.0642401],"genre_scores_gemma":[0.4969762,0.000024009143,0.48000038,0.0033693647,0.00012923637,0.000011668367,0.0000381795,0.000013755842,0.01943723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993663,0.000013007087,0.000077830475,0.00021500845,0.00017724294,0.00015062348],"domain_scores_gemma":[0.99965316,0.000017245871,0.000028519229,0.00023325387,0.000025511688,0.000042316045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090880734,0.000069913025,0.000057225774,0.00006251235,0.00006138947,0.0002259347,0.00041138448,0.000011643536,0.000029084584],"category_scores_gemma":[0.0000017529662,0.000051480616,0.000013803964,0.0003250449,0.000016371388,0.0009533502,0.00016142776,0.000033552984,0.00017494382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017052684,0.00014605452,0.0027753848,0.000016335169,0.00005885144,0.00015594225,0.00038921475,0.003515441,0.000020688472,0.10320283,0.054552898,0.8351493],"study_design_scores_gemma":[0.00073938613,0.00014066175,0.0044594277,0.000011997511,0.000007680167,0.00002669837,0.000081306796,0.93380946,0.00006303246,0.0015205685,0.058878444,0.00026131293],"about_ca_topic_score_codex":0.00003982442,"about_ca_topic_score_gemma":0.0000318791,"teacher_disagreement_score":0.93029404,"about_ca_system_score_codex":0.000011391551,"about_ca_system_score_gemma":0.000008201774,"threshold_uncertainty_score":0.22486073},"labels":[],"label_agreement":null},{"id":"W1992764338","doi":"10.1109/colcom.2006.361843","title":"How to Fit In Another Meeting","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Ackermann function; Duration (music); Binary logarithm; Combinatorics; Schedule; Interval (graph theory); Computer science; Graph; Euclidean geometry; Mathematics; Discrete mathematics; Inverse; Geometry","score_opus":0.01784500369562987,"score_gpt":0.22244885637587505,"score_spread":0.20460385268024517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992764338","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.0048244093,0.000013153919,0.83817184,0.008734163,0.00010807211,0.000090153226,4.764538e-7,0.00011965573,0.1479381],"genre_scores_gemma":[0.40210676,0.0000011626606,0.4892496,0.0024763586,0.00015173385,0.0000108709055,0.0000022047132,0.000007413385,0.10599389],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995802,0.0000067558535,0.00004943445,0.00015282471,0.00008511869,0.000125684],"domain_scores_gemma":[0.9997657,0.000008353112,0.000009438993,0.0001996236,0.0000057281736,0.000011160773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100645404,0.000038712686,0.000037787348,0.000069723705,0.000014731279,0.00028256307,0.00040147456,0.000007815825,0.000012093804],"category_scores_gemma":[0.0000037602476,0.000032483404,0.00000923209,0.00025637267,0.000002861091,0.00042061254,0.00020063636,0.00001699319,0.00007353583],"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.0000014771298,0.000115378556,0.007434488,0.000010673496,0.000005030907,0.00005792388,0.00017098927,0.00042223968,0.001204921,0.3667771,0.24904928,0.37475052],"study_design_scores_gemma":[0.0005154443,0.000047800684,0.019429687,0.000028697288,0.0000015265342,0.0000011881837,0.00006993527,0.13076898,0.0055021374,0.0068367748,0.8363627,0.00043510477],"about_ca_topic_score_codex":0.00020683382,"about_ca_topic_score_gemma":0.00020043078,"teacher_disagreement_score":0.5873134,"about_ca_system_score_codex":0.0000073485226,"about_ca_system_score_gemma":0.0000020806644,"threshold_uncertainty_score":0.2724762},"labels":[],"label_agreement":null},{"id":"W1992931136","doi":"10.3166/ria.26.393-408","title":"Extraction et visualisation de structures arborescentes à partir de treillis de concepts","year":2012,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Computer science","score_opus":0.07556293189651259,"score_gpt":0.3633979581320241,"score_spread":0.2878350262355115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992931136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05509609,0.0044282093,0.9317128,0.0041614096,0.002038949,0.0002741306,0.000028613624,0.00012241094,0.0021373793],"genre_scores_gemma":[0.9629024,0.0012987572,0.02743781,0.00090575917,0.0009971331,0.000031481846,0.00004928755,0.000032055505,0.0063452967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704206,0.000485859,0.00051859417,0.00048131225,0.0002704914,0.0012016823],"domain_scores_gemma":[0.99831235,0.00031744866,0.00025748377,0.0006474474,0.000106387146,0.00035889723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019243469,0.00029835434,0.00023525169,0.00013859004,0.00032101912,0.00074619445,0.0007233368,0.00018074356,0.00054827717],"category_scores_gemma":[0.00034278003,0.00033281842,0.00014426628,0.0005586222,0.00029316178,0.0024218701,0.00022743444,0.000374665,0.0004539492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028435175,0.00072574534,0.0076141725,0.0002753256,0.000074037154,0.00004788904,0.030147297,0.030227691,0.012342016,0.46566567,0.011635104,0.44121662],"study_design_scores_gemma":[0.00006274417,0.00009462332,0.0043281005,0.0001712468,0.0000616253,0.00009282636,0.0017355382,0.7235102,0.1302167,0.010336279,0.12898143,0.00040871077],"about_ca_topic_score_codex":0.0005519262,"about_ca_topic_score_gemma":0.000043907112,"teacher_disagreement_score":0.90780634,"about_ca_system_score_codex":0.00030862523,"about_ca_system_score_gemma":0.00015081668,"threshold_uncertainty_score":0.9999124},"labels":[],"label_agreement":null},{"id":"W1993378086","doi":"10.1145/2806416.2806493","title":"A Hierarchical Recurrent Encoder-Decoder for Generative Context-Aware Query Suggestion","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":467,"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":"Nvidia","keywords":"Computer science; Encoder; Generative grammar; Context (archaeology); Artificial intelligence; Generative model; Natural language processing","score_opus":0.06969257043282508,"score_gpt":0.30214913904282525,"score_spread":0.2324565686100002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993378086","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.0006145616,0.00007965519,0.9909656,0.0047588847,0.00076228956,0.00034802675,0.000014640039,0.00017786921,0.0022784588],"genre_scores_gemma":[0.2737749,0.0000405075,0.7069955,0.0043616276,0.0008534031,0.0003814082,0.00031616155,0.000030347886,0.013246174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988868,0.000058496906,0.00018179785,0.00039532833,0.00023304926,0.0002445053],"domain_scores_gemma":[0.9992329,0.000076641285,0.000047706842,0.00035184817,0.00013960418,0.00015132457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038470022,0.00012591456,0.00013365725,0.00008065117,0.00008246014,0.00023950716,0.0005677685,0.000041163483,0.000015025137],"category_scores_gemma":[0.00007027773,0.00010080589,0.000053510023,0.00015014278,0.00003483609,0.00075750955,0.00029024982,0.00008385667,0.00007087895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024180108,0.00013531232,0.00007618005,0.000011535775,0.000028463202,0.0000071283057,0.0007109414,0.000055140194,0.000012466864,0.34778672,0.19599475,0.45515716],"study_design_scores_gemma":[0.0011713359,0.00037443894,0.00012431084,0.000018847457,0.000009870576,0.000004625809,0.0001801444,0.8198113,0.00063897145,0.032288026,0.14506193,0.0003161908],"about_ca_topic_score_codex":0.000023222769,"about_ca_topic_score_gemma":0.000060381553,"teacher_disagreement_score":0.81975615,"about_ca_system_score_codex":0.000044689838,"about_ca_system_score_gemma":0.000076806056,"threshold_uncertainty_score":0.4110745},"labels":[],"label_agreement":null},{"id":"W1993926838","doi":"10.1109/services.2013.60","title":"Towards Smarter Task Applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Task (project management); Context (archaeology); Data science; Human–computer interaction; Mobile device; Software; World Wide Web; Systems engineering; Engineering","score_opus":0.009335746972947208,"score_gpt":0.21681894130196908,"score_spread":0.20748319432902187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993926838","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.000049148515,0.000006366631,0.8466902,0.0029691532,0.00005889546,0.00015809397,6.4590915e-7,0.0001522094,0.14991532],"genre_scores_gemma":[0.15319872,0.000016791615,0.78561825,0.0058403243,0.00025596816,0.0007105278,0.00003026317,0.000010291549,0.054318845],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999571,0.0000049092137,0.00006388936,0.00015927764,0.00008920815,0.00011169547],"domain_scores_gemma":[0.9994834,0.0000054866273,0.000012539801,0.00043550212,0.000023367458,0.000039721945],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004347962,0.00004323744,0.00003523629,0.00003356457,0.000041069263,0.00027502776,0.00067597255,0.000010129885,0.00032629163],"category_scores_gemma":[0.0000011637024,0.00003329712,0.000016765638,0.0001580546,0.000010450013,0.00080976286,0.00026674726,0.000023477134,0.0043293354],"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":[2.2050774e-8,0.00001866543,0.000046150304,0.0000017865169,0.0000041280823,2.745352e-7,0.000018406978,3.8503455e-7,0.000046672758,0.2715889,0.09491062,0.633364],"study_design_scores_gemma":[0.00011361109,0.000015176899,0.00653084,0.0000012008305,0.000002309819,0.0000011590453,0.00001630232,0.044410307,0.00020325759,0.033285897,0.9152684,0.00015152823],"about_ca_topic_score_codex":0.00006123175,"about_ca_topic_score_gemma":0.0000015801324,"teacher_disagreement_score":0.8203578,"about_ca_system_score_codex":0.000004570086,"about_ca_system_score_gemma":0.0000056266854,"threshold_uncertainty_score":0.9964459},"labels":[],"label_agreement":null},{"id":"W1994103787","doi":"10.1016/j.camwa.2011.07.047","title":"On the semantics of top-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>ranking for objects with uncertain data","year":2011,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Data Management and Algorithms","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":"Ranking (information retrieval); Object (grammar); Semantics (computer science); Rank (graph theory); Mathematics; Context (archaeology); Algorithm; Theoretical computer science; Computer science; Discrete mathematics; Artificial intelligence; Combinatorics; Programming language","score_opus":0.03597014975348904,"score_gpt":0.25429496065205887,"score_spread":0.2183248108985698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994103787","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.13425678,0.000023322078,0.8636488,0.00032859237,0.00010816537,0.0003222895,0.00007841163,0.00011753964,0.001116117],"genre_scores_gemma":[0.4298445,0.000033948796,0.56860894,0.0004866704,0.00013811466,0.00053412694,0.00023763365,0.000069224305,0.00004684276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807864,0.000024438432,0.00042226329,0.00058134313,0.0005030941,0.00039022104],"domain_scores_gemma":[0.9962345,0.0005798345,0.0005259951,0.002486953,0.000074115625,0.000098595505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054248027,0.00025871582,0.00019877555,0.00008267866,0.00039271067,0.0002872299,0.0023957002,0.00009523446,0.000005601701],"category_scores_gemma":[0.000049616578,0.00021305552,0.00009850097,0.00043729015,0.00020955196,0.0004758622,0.0010897586,0.0001893347,0.00009679022],"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.00002318891,0.00023868376,0.0000039336455,0.0002631624,0.00016345225,0.000009236208,0.0011759525,0.0005864464,0.000025302033,0.99350417,0.0009817512,0.0030247003],"study_design_scores_gemma":[0.00038763997,0.00024735293,0.000018620027,0.0002855307,0.000152956,0.000032658085,0.00021984108,0.98795867,0.00055198016,0.008566999,0.0013381145,0.00023962116],"about_ca_topic_score_codex":0.000033147444,"about_ca_topic_score_gemma":0.000033696495,"teacher_disagreement_score":0.9873722,"about_ca_system_score_codex":0.000009349972,"about_ca_system_score_gemma":0.00011451249,"threshold_uncertainty_score":0.8688152},"labels":[],"label_agreement":null},{"id":"W1994414840","doi":"10.1007/s10458-015-9285-5","title":"Privacy preserving existence recognition and construction of hypertree agent organization","year":2015,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Data Management and Algorithms","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 Guelph","funders":"","keywords":"Computer science; Probabilistic logic; Constraint (computer-aided design); Hyperbolic tree; Scheme (mathematics); Tree (set theory); Private information retrieval; Theoretical computer science; Adjacency list; Artificial intelligence; Computer security; Mathematics; Algorithm","score_opus":0.10166313198612774,"score_gpt":0.2630290996846375,"score_spread":0.16136596769850975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994414840","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.65401226,0.0006771191,0.34167576,0.0002270274,0.0016625227,0.0009362779,0.000038799568,0.00019990069,0.0005703252],"genre_scores_gemma":[0.948997,0.0003196582,0.04946663,0.00006923407,0.00008908485,0.000025575515,0.00010502409,0.000020432897,0.0009073338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871296,0.00008236905,0.00036421424,0.00041837763,0.00023333394,0.00018872517],"domain_scores_gemma":[0.999026,0.000020069056,0.00025017234,0.00037643104,0.00018061587,0.00014670916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036585392,0.00015428498,0.00020708147,0.00011839132,0.00011136588,0.00027331387,0.00032612652,0.000053620686,0.000005362598],"category_scores_gemma":[0.00007373021,0.00014114348,0.000019070721,0.00022975462,0.000053066775,0.0009038743,0.0004884029,0.000051367762,0.000020657537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038385904,0.0011906858,0.13622116,0.0020860587,0.00061477063,0.00014179361,0.022348627,0.0005759569,0.002963796,0.019856537,0.008766417,0.8051958],"study_design_scores_gemma":[0.0053863134,0.00044684394,0.07772891,0.00060186745,0.0001738309,0.0002658931,0.0027429732,0.85603774,0.001596828,0.0008580842,0.052910842,0.0012498926],"about_ca_topic_score_codex":0.00041148326,"about_ca_topic_score_gemma":0.000005198751,"teacher_disagreement_score":0.8554618,"about_ca_system_score_codex":0.000050447474,"about_ca_system_score_gemma":0.000035032306,"threshold_uncertainty_score":0.5755664},"labels":[],"label_agreement":null},{"id":"W1995622714","doi":"10.1109/cisis.2007.16","title":"Compact Hilbert Indices for Multi-Dimensional Data","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Hilbert curve; Hilbert R-tree; Dimension (graph theory); Hilbert space; Cardinality (data modeling); Grid; Computer science; Representation (politics); Theoretical computer science; Mathematics; Algorithm; Reproducing kernel Hilbert space; Rigged Hilbert space; Mathematical analysis; Pure mathematics; Data mining; Geometry","score_opus":0.1259849650363655,"score_gpt":0.35420101087050176,"score_spread":0.22821604583413627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995622714","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.00069524307,0.00003385081,0.9942784,0.000774404,0.00036487938,0.00017107313,0.000034441553,0.0001256966,0.003522033],"genre_scores_gemma":[0.03682153,0.0000023603081,0.95533556,0.001591024,0.00014186138,0.0000014859637,0.0004153199,0.0000071666395,0.0056837234],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990876,0.0000062447216,0.00013667541,0.0003503292,0.00018156954,0.00023761104],"domain_scores_gemma":[0.99891,0.00011007305,0.000042352287,0.00084507046,0.000024564215,0.00006794532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968551,0.000078323814,0.00007936564,0.0000803809,0.000089374946,0.00014993065,0.001894358,0.00001967429,0.000031622545],"category_scores_gemma":[0.000024257817,0.00006119338,0.000020737885,0.00015027869,0.000019764308,0.0012796961,0.0007917765,0.000037931834,0.000082129554],"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.00002034424,0.00047537946,0.003288834,0.000031303054,0.00010834601,0.00003209899,0.00013377501,0.000028647397,0.00022200872,0.15946694,0.48658454,0.3496078],"study_design_scores_gemma":[0.0007594967,0.00004404786,0.011888692,0.0000070081087,0.000007100814,0.0000033283454,0.000017792141,0.7054492,0.0005251411,0.00047231984,0.28062618,0.00019970667],"about_ca_topic_score_codex":0.00006773529,"about_ca_topic_score_gemma":0.00008083566,"teacher_disagreement_score":0.70542055,"about_ca_system_score_codex":0.000007980553,"about_ca_system_score_gemma":0.0000137389225,"threshold_uncertainty_score":0.352022},"labels":[],"label_agreement":null},{"id":"W1998792254","doi":"10.1145/1247480.1247613","title":"URank","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Semantics (computer science); Ranking (information retrieval); Probabilistic logic; Information retrieval; Query language; Query optimization; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.009667932734316846,"score_gpt":0.23642622257327722,"score_spread":0.22675828983896038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998792254","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.0002598264,0.000006182037,0.76898193,0.0003715857,0.00013627078,0.000016023592,6.090982e-8,0.00011031334,0.23011778],"genre_scores_gemma":[0.33420908,0.0000055576247,0.62899876,0.0025489223,0.00014389463,9.56532e-7,0.000002848794,0.0000035874727,0.03408639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968624,0.0000016858492,0.000044144832,0.00008873456,0.00007621422,0.00010297319],"domain_scores_gemma":[0.9997407,0.000011013446,0.0000067988944,0.00021024827,0.000006520611,0.00002471429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020422069,0.000023888657,0.000020226824,0.00003279678,0.000021413465,0.00006717185,0.00041961286,0.0000058694263,0.000044900527],"category_scores_gemma":[0.000002790277,0.000018707362,0.000009931849,0.00013421637,0.000004814527,0.00037862812,0.00014591591,0.000015503398,0.00036227392],"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":[1.7949797e-7,0.000008063958,0.00013565534,6.3507866e-7,0.000001759899,0.00001163456,0.000016434455,2.4429346e-7,0.00003097325,0.57734317,0.013459361,0.4089919],"study_design_scores_gemma":[0.000285611,0.000035480854,0.019713167,0.0000024933804,0.000001823463,0.000004870173,0.000029280534,0.02132647,0.003642272,0.012462377,0.9422868,0.00020934163],"about_ca_topic_score_codex":0.000006229077,"about_ca_topic_score_gemma":0.0000038273984,"teacher_disagreement_score":0.92882746,"about_ca_system_score_codex":0.0000028560216,"about_ca_system_score_gemma":0.0000017349594,"threshold_uncertainty_score":0.46564192},"labels":[],"label_agreement":null},{"id":"W1999824796","doi":"10.1145/1102351.1102385","title":"Near-optimal sensor placements in Gaussian processes","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":467,"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; Intel Corporation","keywords":"Mutual information; Computer science; Gaussian; Entropy (arrow of time); Gaussian process; Algorithm; Global Positioning System; Variance (accounting); Task (project management); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.014486650433944056,"score_gpt":0.25045457089195855,"score_spread":0.23596792045801449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999824796","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.069589056,0.00009968692,0.77438444,0.010122688,0.000283337,0.00049065874,0.0000055470487,0.00057096174,0.14445363],"genre_scores_gemma":[0.36788356,0.000021353646,0.61105615,0.0013191088,0.000117297335,0.00001856067,0.000011171319,0.00000885475,0.019563925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920267,0.000010707977,0.00012845855,0.00025600198,0.00017194956,0.00023020858],"domain_scores_gemma":[0.9996354,0.000013632645,0.000025024356,0.00026642042,0.000016040054,0.000043461387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011862225,0.000081592065,0.00007013007,0.00006745386,0.000047264268,0.00030957602,0.0005690153,0.000017069888,0.000114610164],"category_scores_gemma":[0.000013016469,0.00006853581,0.000011376345,0.00038133774,0.000016029458,0.0012392864,0.00026751266,0.00004921423,0.00044080705],"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.000036735608,0.0013291273,0.02085227,0.00022338929,0.0000713027,0.0002113385,0.0034850868,0.008521357,0.00014615581,0.066347554,0.07726006,0.8215156],"study_design_scores_gemma":[0.0013198329,0.000097212636,0.005733456,0.000033148066,0.000004186474,0.0000067269984,0.00015307705,0.62462866,0.0014976725,0.00019589382,0.36587438,0.00045577445],"about_ca_topic_score_codex":0.000022601387,"about_ca_topic_score_gemma":0.00006483469,"teacher_disagreement_score":0.8210598,"about_ca_system_score_codex":0.000018420538,"about_ca_system_score_gemma":0.000030079711,"threshold_uncertainty_score":0.566583},"labels":[],"label_agreement":null},{"id":"W2000053898","doi":"10.1109/cloud.2013.78","title":"HGrid: A Data Model for Large Geospatial Data Sets in HBase","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"NoSQL; Computer science; Scalability; Geospatial analysis; Cloud computing; Data mining; Grid; Database; Big data; Tree (set theory)","score_opus":0.10653666167588431,"score_gpt":0.3196813446547444,"score_spread":0.21314468297886008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000053898","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.0003700573,0.000016632717,0.9952936,0.0018817872,0.00015904898,0.00046771855,0.00091278204,0.000092722716,0.0008056049],"genre_scores_gemma":[0.049847912,0.00002013069,0.9364502,0.0020557845,0.0001140238,0.00007212111,0.007709788,0.000014641878,0.0037154383],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860686,0.0000142572935,0.00018004663,0.0006893541,0.0001745849,0.00033487892],"domain_scores_gemma":[0.996014,0.000039501174,0.00003685593,0.0038247015,0.000023803645,0.00006112251],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00052525953,0.00010085345,0.00010723604,0.000074277814,0.000052072992,0.0003644102,0.006204637,0.000025066547,0.000062647225],"category_scores_gemma":[0.000048470705,0.00008466132,0.000011020254,0.00016184442,0.0000076225247,0.0053931084,0.008080201,0.000057085297,0.00017812983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030021988,0.0002284584,0.00024668177,0.000027668391,0.000015491778,0.000006763623,0.00009507534,0.00015468425,0.000008465224,0.040193826,0.78882563,0.17019422],"study_design_scores_gemma":[0.00055807346,0.000010433119,0.00021634082,0.0000046451214,0.000003284381,3.6410674e-7,0.000011512162,0.97839653,0.0000039394886,0.0028287205,0.017836398,0.00012974543],"about_ca_topic_score_codex":0.00039033103,"about_ca_topic_score_gemma":0.0011096745,"teacher_disagreement_score":0.97824186,"about_ca_system_score_codex":0.000007757188,"about_ca_system_score_gemma":0.000036375106,"threshold_uncertainty_score":0.99994224},"labels":[],"label_agreement":null},{"id":"W2001088180","doi":"10.5555/338219.338659","title":"Computing contour trees in all dimensions","year":2000,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Simple (philosophy); Computer science; Contour line; Algorithm; Artificial intelligence; Cartography; Geography","score_opus":0.02725043140270391,"score_gpt":0.26435506847606716,"score_spread":0.23710463707336324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001088180","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.22243352,0.00014785978,0.37815297,0.0064335093,0.0004629271,0.00037409525,0.0000028679467,0.0008202019,0.39117205],"genre_scores_gemma":[0.92482036,0.000022322523,0.063989304,0.0017073499,0.000039376668,0.0000014758231,0.000005480886,0.0000037371915,0.009410578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938536,0.000019405812,0.000114565446,0.00019977799,0.00009914985,0.00018172017],"domain_scores_gemma":[0.999644,0.000031555708,0.000012455107,0.00027141164,0.000005106138,0.000035515164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013762315,0.00005954881,0.00007245342,0.00005604124,0.000034070075,0.000113998125,0.0004945314,0.000013037757,0.00021371353],"category_scores_gemma":[0.0000033982599,0.000049974526,0.00001873672,0.00018944072,0.000009967276,0.00042096144,0.00016644239,0.00004499267,0.00030246956],"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.0000016665241,0.00012118632,0.0016234843,0.000001976323,0.000012437697,0.000071506554,0.00040081225,0.0007739856,0.00008414172,0.08970599,0.019371508,0.88783133],"study_design_scores_gemma":[0.0005933759,0.00003533677,0.02384985,0.000016425076,0.0000024935364,0.0000033123165,0.000038960203,0.85273546,0.00009526572,0.0020680027,0.12034795,0.00021358341],"about_ca_topic_score_codex":0.00016002677,"about_ca_topic_score_gemma":0.00013086865,"teacher_disagreement_score":0.8876177,"about_ca_system_score_codex":0.00000824174,"about_ca_system_score_gemma":0.000004270727,"threshold_uncertainty_score":0.38877353},"labels":[],"label_agreement":null},{"id":"W2002457770","doi":"10.1016/j.ijar.2003.07.004","title":"P-FCM: a proximity-based fuzzy clustering for user-centered web applications","year":2003,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":51,"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; The Internet; Information retrieval; World Wide Web; Similarity (geometry); Interface (matter); User interface; Search engine; Fuzzy logic; Cluster analysis; Artificial intelligence","score_opus":0.021751857493087553,"score_gpt":0.2813758141385941,"score_spread":0.2596239566455065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002457770","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.0014465724,0.00008036011,0.9940652,0.0008704912,0.0006936114,0.00033742987,0.00001932359,0.00005590652,0.0024310818],"genre_scores_gemma":[0.1782049,0.000038678547,0.8208378,0.00031251737,0.00029475777,0.0000824512,0.00002155442,0.000022691243,0.00018464851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984538,0.000047054087,0.00049105694,0.00024906112,0.00050975016,0.00024926563],"domain_scores_gemma":[0.99851,0.00009945543,0.0005304569,0.00027327242,0.0004890999,0.000097735945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080807245,0.00015222369,0.0001932987,0.0003020453,0.00010687145,0.00052924646,0.0014772885,0.000039761595,0.00000868877],"category_scores_gemma":[0.00013258781,0.00014089093,0.00016593872,0.00020871607,0.00002686041,0.0012547964,0.00015244163,0.00014444481,0.0000065252348],"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.00019440429,0.0010070942,0.0022722147,0.00019290781,0.000731001,0.00012604299,0.00036522103,0.00488234,0.0028941745,0.8440833,0.0032327669,0.14001851],"study_design_scores_gemma":[0.005238469,0.00022363996,0.00019010511,0.0005025042,0.00006297981,0.00031563808,0.00014610484,0.6917992,0.00424523,0.01389384,0.28283694,0.0005453374],"about_ca_topic_score_codex":0.0000016784174,"about_ca_topic_score_gemma":0.0000018504967,"teacher_disagreement_score":0.83018947,"about_ca_system_score_codex":0.000109426794,"about_ca_system_score_gemma":0.00013846923,"threshold_uncertainty_score":0.57453656},"labels":[],"label_agreement":null},{"id":"W2002910581","doi":"10.1002/int.1031","title":"Conceptual design of fuzzy object-oriented databases using extended entity-relationship model","year":2001,"lang":"en","type":"article","venue":"International Journal of Intelligent Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":79,"is_retracted":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; Conceptual schema; Entity–relationship model; Fuzzy logic; Database schema; Database design; Data mining; Conceptual model; Relational database; Schema (genetic algorithms); Database; Fuzzy set; Imperfect; Object (grammar); Database model; Information retrieval; Artificial intelligence","score_opus":0.1350884247380204,"score_gpt":0.3359440521008348,"score_spread":0.20085562736281437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002910581","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.013110762,0.00047246643,0.9826805,0.000085482505,0.0029871834,0.00017070962,0.000027298092,0.000022572534,0.0004430332],"genre_scores_gemma":[0.93212396,0.00016534519,0.06691825,0.000043851618,0.00032380925,0.0000027283074,0.000016956794,0.00001082684,0.0003942605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732345,0.00016459986,0.0010248574,0.00021649126,0.0010837284,0.00018684824],"domain_scores_gemma":[0.99742544,0.0002325167,0.0009450636,0.00032007095,0.0009828712,0.000094027506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010186465,0.0001557628,0.00026846703,0.0005415427,0.000060080412,0.00017553555,0.0015186322,0.00003730745,0.000019658879],"category_scores_gemma":[0.0002432729,0.00013791888,0.00013364662,0.00030124758,0.00008022217,0.0016870605,0.00026515528,0.00016802477,0.000016972235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013780087,0.0004969589,0.005372109,0.000022361532,0.0005721092,0.00025434163,0.0010348072,0.4702771,0.0018117676,0.5139348,0.002125836,0.0039600097],"study_design_scores_gemma":[0.00053190807,0.000110635556,0.00021967074,0.00034646076,0.00004079677,0.0003515149,0.00065015483,0.9914162,0.0015820102,0.0016567656,0.0028963161,0.00019754868],"about_ca_topic_score_codex":0.00007856329,"about_ca_topic_score_gemma":0.0000021079327,"teacher_disagreement_score":0.9190132,"about_ca_system_score_codex":0.00015298238,"about_ca_system_score_gemma":0.00014863655,"threshold_uncertainty_score":0.56241685},"labels":[],"label_agreement":null},{"id":"W2002932370","doi":"10.1145/1061318.1061324","title":"Concise descriptions of subsets of structured sets","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Automatic summarization; Theoretical computer science; Set (abstract data type); Minimum description length; Online analytical processing; Hierarchy; Cover (algebra); Context (archaeology); Representation (politics); Data mining; Algorithm; Artificial intelligence; Data warehouse","score_opus":0.0319806076430219,"score_gpt":0.26392649524481654,"score_spread":0.23194588760179463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002932370","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.0072392235,0.00017764317,0.988696,0.0002694101,0.00075598236,0.0003559746,0.002066163,0.00010177541,0.00033782385],"genre_scores_gemma":[0.93713695,0.000054774995,0.06227939,0.00004152769,0.00003382045,0.000026404783,0.00014217719,0.000010027648,0.000274936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986135,0.00007531949,0.00043749445,0.0003142164,0.00036562956,0.00019384299],"domain_scores_gemma":[0.9977255,0.00008150355,0.00016832791,0.0018568452,0.00008732885,0.00008051918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025893215,0.0001438858,0.00023869913,0.0002566489,0.00009024883,0.000052149666,0.0012502788,0.000041695435,0.000055421144],"category_scores_gemma":[0.000020673519,0.00013407115,0.00008135671,0.00047591567,0.000058678448,0.0010214109,0.000040340565,0.00011151256,0.00004463801],"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.00015203257,0.0026490092,0.00040135498,0.0017044778,0.0011116978,0.00006369471,0.0028446284,0.034048356,0.053113393,0.10429019,0.03320691,0.7664143],"study_design_scores_gemma":[0.009017816,0.00093302835,0.0035825386,0.0017297661,0.00061939564,0.00020203323,0.0019615141,0.5726355,0.17950723,0.0011988304,0.22604635,0.002566045],"about_ca_topic_score_codex":0.00018681026,"about_ca_topic_score_gemma":0.00007351698,"teacher_disagreement_score":0.9298977,"about_ca_system_score_codex":0.000030353907,"about_ca_system_score_gemma":0.000039565217,"threshold_uncertainty_score":0.5467262},"labels":[],"label_agreement":null},{"id":"W2003043371","doi":"10.1080/03461230601110447","title":"On composite lognormal-Pareto models","year":2007,"lang":"en","type":"article","venue":"Scandinavian Actuarial Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":182,"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":"Pareto principle; Log-normal distribution; Mathematics; Econometrics; Composite number; Pareto distribution; Statistics; Applied mathematics; Computer science; Mathematical optimization; Mathematical economics; Algorithm","score_opus":0.017291858383935446,"score_gpt":0.2500035017044091,"score_spread":0.23271164332047367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003043371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01186032,0.000032918488,0.9555722,0.0006047809,0.002812142,0.00011432796,0.00000519835,0.00010041146,0.028897697],"genre_scores_gemma":[0.9748145,0.000029373645,0.022448814,0.00095699524,0.0011370854,0.0000011531723,0.000009565527,0.00001522347,0.000587289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981447,0.000049236965,0.0003617515,0.00030147028,0.00055567606,0.0005871738],"domain_scores_gemma":[0.99891955,0.000083833875,0.00018297591,0.00042921936,0.000063347354,0.0003210934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069458,0.00019601977,0.00019281643,0.0003266898,0.00040113524,0.00092913903,0.0014343688,0.00006652263,0.00006391273],"category_scores_gemma":[0.000018338778,0.0001650599,0.00011615252,0.0003286633,0.000044279033,0.0018703132,0.00026947274,0.00042136596,0.00012503716],"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.00035192177,0.00036660384,0.00084328384,0.000012350983,0.00017307367,0.0016429251,0.0010030136,0.0020515567,0.00039590953,0.50987816,0.036360648,0.44692057],"study_design_scores_gemma":[0.011769701,0.0028137148,0.021358436,0.0005642454,0.0001365537,0.0024183006,0.00028666816,0.18073831,0.0040909,0.73237246,0.0406429,0.002807786],"about_ca_topic_score_codex":0.000015947118,"about_ca_topic_score_gemma":0.000006405129,"teacher_disagreement_score":0.96295416,"about_ca_system_score_codex":0.000120711986,"about_ca_system_score_gemma":0.000035198296,"threshold_uncertainty_score":0.8959709},"labels":[],"label_agreement":null},{"id":"W2003540235","doi":"","title":"Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Library science; Operations research; Database; Mathematics","score_opus":0.039512182558560004,"score_gpt":0.23424321879366222,"score_spread":0.1947310362351022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003540235","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.72510433,0.00017097442,0.046430293,0.0040102657,0.003031993,0.0031198817,0.0001711029,0.00054605206,0.21741508],"genre_scores_gemma":[0.9778877,0.00006934278,0.008042701,0.00014624538,0.00008765044,0.000025007526,0.0000103705515,0.000013608301,0.013717372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841887,0.00001785414,0.00036221955,0.00036952077,0.00060692313,0.00022458608],"domain_scores_gemma":[0.9984775,0.000058706028,0.00026754668,0.001027421,0.00011225187,0.000056526445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563317,0.00014838445,0.00021060054,0.00010364263,0.00010624035,0.000065852415,0.0028263084,0.000030288773,0.000009172023],"category_scores_gemma":[0.000058431957,0.00009416628,0.000079001235,0.0004440536,0.00009730974,0.00087835884,0.0016683711,0.000090885624,0.000017360138],"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.000027645257,0.00087067153,0.017518034,0.00059678825,0.0001421928,0.00001234189,0.0010849353,0.00039390425,0.020221576,0.92815083,0.029493244,0.0014878246],"study_design_scores_gemma":[0.0042450116,0.0016665485,0.044434328,0.0021499142,0.00017494123,0.00013793905,0.0012076553,0.25957745,0.41403076,0.00088633195,0.26934624,0.002142866],"about_ca_topic_score_codex":0.000054089145,"about_ca_topic_score_gemma":0.000001617143,"teacher_disagreement_score":0.9272645,"about_ca_system_score_codex":0.000019973682,"about_ca_system_score_gemma":0.00003734525,"threshold_uncertainty_score":0.5252031},"labels":[],"label_agreement":null},{"id":"W2003765267","doi":"10.1145/2534921.2534923","title":"The price of generality in spatial indexing","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Generality; Computer science; Overhead (engineering); Database index; Tree (set theory); Index (typography); Data mining; Big data; Information retrieval; Task (project management); Database; Programming language","score_opus":0.010309212865929103,"score_gpt":0.21389175394483334,"score_spread":0.20358254107890425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003765267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045532,0.00001911682,0.9197492,0.0022771838,0.00020759327,0.00016967593,2.9638244e-7,0.000032951462,0.032012004],"genre_scores_gemma":[0.9704796,0.000008977236,0.027547395,0.00019700738,0.000030164409,0.000008943024,7.1711963e-7,0.0000014020252,0.0017257989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995876,0.00001975677,0.00010189781,0.00009098139,0.00010178024,0.0000979627],"domain_scores_gemma":[0.99963844,0.000030613974,0.000028524213,0.00027317676,0.000016714892,0.000012556865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021255249,0.000029285606,0.000036116024,0.000021713693,0.00002859977,0.00010364052,0.0006043372,0.000008069506,0.0000236886],"category_scores_gemma":[0.000011185322,0.00001752875,0.000010164255,0.00014111315,0.000015279222,0.00042421406,0.00033214965,0.000029248029,0.000030218309],"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.5631147e-7,0.000044651722,0.010422344,0.0000088724455,0.0000058924543,0.0000013146895,0.00018915653,0.000041467443,0.0002560099,0.3326621,0.0053828815,0.6509845],"study_design_scores_gemma":[0.00038060764,0.00003268191,0.40310475,0.0000078509165,0.0000011521322,4.4514212e-7,0.000059042017,0.5562205,0.0024969727,0.022717647,0.014814031,0.00016431793],"about_ca_topic_score_codex":0.0018414124,"about_ca_topic_score_gemma":0.00013060214,"teacher_disagreement_score":0.9249476,"about_ca_system_score_codex":0.000005351167,"about_ca_system_score_gemma":0.0000064899377,"threshold_uncertainty_score":0.2783677},"labels":[],"label_agreement":null},{"id":"W2003931981","doi":"10.3166/isi.12.2.75-95","title":"Vers l'interopérabilité des modèles de localisation géométrique et sémantique au travers de l'utilisation de métadonnées","year":2007,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Humanities; Philosophy","score_opus":0.02773951814302394,"score_gpt":0.261107776105936,"score_spread":0.23336825796291205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003931981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2841933,0.00015832973,0.7081272,0.0005342923,0.00063560804,0.00041916227,0.00003721574,0.0001957698,0.0056990804],"genre_scores_gemma":[0.91571015,0.00035795433,0.08189754,0.00094146025,0.00021532757,0.00003977432,0.0002535164,0.000026460015,0.00055778364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965837,0.0004295139,0.0010306685,0.00033632168,0.000467045,0.0011527454],"domain_scores_gemma":[0.9980011,0.0002895652,0.00052040763,0.00052625407,0.00036385804,0.00029880053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0057135895,0.0004027304,0.00030309812,0.0005791151,0.00053779176,0.0013292084,0.00078669353,0.0003483459,0.000039288567],"category_scores_gemma":[0.0007495481,0.00046446544,0.00016784122,0.00085429725,0.00064264616,0.014979619,0.00022773154,0.0003566442,0.000106750784],"study_design_candidate":"simulation_or_modeling","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.0001412854,0.0001528023,0.012527571,0.0021121136,0.00013674889,0.00003269822,0.117197946,0.017058227,0.0006952608,0.21772969,0.0009184368,0.63129723],"study_design_scores_gemma":[0.0011880154,0.00037094468,0.15620254,0.0011904151,0.00009917708,0.00019778156,0.011449258,0.7434028,0.009119771,0.05580972,0.020100387,0.0008691897],"about_ca_topic_score_codex":0.0049440158,"about_ca_topic_score_gemma":0.000816385,"teacher_disagreement_score":0.7263446,"about_ca_system_score_codex":0.0038696756,"about_ca_system_score_gemma":0.0008034094,"threshold_uncertainty_score":0.9999543},"labels":[],"label_agreement":null},{"id":"W2004773941","doi":"10.1007/s11634-009-0046-7","title":"Parsimonious cluster systems","year":2009,"lang":"en","type":"article","venue":"Advances in Data Analysis and Classification","topic":"Data Management and Algorithms","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":"Saint Paul University","funders":"","keywords":"Bijection; Set (abstract data type); Cluster (spacecraft); Cluster analysis; Phylogenetic tree; Computer science; Combinatorics; Tree (set theory); Mathematics; Theoretical computer science; Biology; Artificial intelligence; Genetics","score_opus":0.029910501458001896,"score_gpt":0.30810436773482447,"score_spread":0.2781938662768226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004773941","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.0006686269,0.002581786,0.9932692,0.0013066261,0.00009259788,0.00009694206,0.000022760083,0.000044528424,0.001916954],"genre_scores_gemma":[0.9786506,0.0042398595,0.01591562,0.00018743603,0.000041197327,0.0000074584937,0.0007379366,0.0000021772412,0.00021769274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989251,0.000046321893,0.00022447307,0.00050942844,0.00016340843,0.00013130732],"domain_scores_gemma":[0.99845994,0.000033215587,0.000104607876,0.0013495233,0.00001969152,0.00003303177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039337197,0.000078823796,0.00015070387,0.00023726022,0.000055631364,0.00028984557,0.0011061622,0.000023045073,0.0000017376109],"category_scores_gemma":[0.000020172018,0.00006791134,0.000019000658,0.0011343631,0.000020190175,0.0031689506,0.00021261343,0.000049417486,0.000009874257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035157434,0.000090065376,0.008573222,0.000011221364,0.000065804605,0.000003928971,0.000059088146,0.00073228864,0.00004078369,0.09652285,0.0011373864,0.89275986],"study_design_scores_gemma":[0.00012263916,0.0000126024315,0.048539158,0.000006594911,0.00007061402,5.191373e-7,0.000064885455,0.89733404,0.0000033059027,0.0014295176,0.052309677,0.000106443935],"about_ca_topic_score_codex":0.00001264556,"about_ca_topic_score_gemma":0.00007447587,"teacher_disagreement_score":0.977982,"about_ca_system_score_codex":0.000013731929,"about_ca_system_score_gemma":0.000004947303,"threshold_uncertainty_score":0.27949876},"labels":[],"label_agreement":null},{"id":"W2005048938","doi":"10.1145/1516360.1516459","title":"Interactive query refinement","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Query optimization; Information retrieval; Query language","score_opus":0.009324530882337508,"score_gpt":0.24426485920332866,"score_spread":0.23494032832099115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005048938","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.00030405863,0.000010060505,0.7424025,0.0066222576,0.00019254454,0.000050364113,3.4474317e-7,0.00017240667,0.25024545],"genre_scores_gemma":[0.56367296,0.000026908123,0.3836044,0.016023658,0.00017441245,0.000007429423,0.000013784904,0.000004460883,0.036471948],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995552,0.000007825028,0.00006962896,0.00016054667,0.00010110851,0.00010569642],"domain_scores_gemma":[0.99963725,0.000008690227,0.000018691508,0.00029529422,0.000013745474,0.000026309906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074431526,0.000047916863,0.000042766962,0.000046587193,0.000027494918,0.00013145962,0.00046986027,0.000007209279,0.000074007796],"category_scores_gemma":[0.000004874655,0.000037651494,0.000018491332,0.00012272775,0.0000038404446,0.0007216673,0.00013906794,0.000033061813,0.0002259766],"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":[9.982082e-7,0.000050886625,0.000012767017,5.9886963e-7,0.0000049619293,0.000010311114,0.000058493893,0.0000019418483,0.00007099347,0.3480905,0.047382914,0.6043146],"study_design_scores_gemma":[0.00083400344,0.000543172,0.018468957,0.000029432791,0.000008675007,0.000007892687,0.00013186413,0.095815375,0.0052987775,0.058473557,0.81978774,0.0006005774],"about_ca_topic_score_codex":0.00000913398,"about_ca_topic_score_gemma":0.0000018436989,"teacher_disagreement_score":0.7724048,"about_ca_system_score_codex":0.000012238625,"about_ca_system_score_gemma":0.0000045800343,"threshold_uncertainty_score":0.29045475},"labels":[],"label_agreement":null},{"id":"W2005698680","doi":"10.1109/aina.2014.132","title":"Efficient Distributed Spatial Semijoins and Their Application in Multiple-Site Queries","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"Western Canada Research Grid; Compute Canada","keywords":"Computer science; Distributed database; Distributed computing; Spatial query; Transmission (telecommunications); Data transmission; Spatial analysis; Join (topology); Distributed algorithm; Distributed data store; Data mining; Computer network; Information retrieval; Search engine","score_opus":0.0075535646363497815,"score_gpt":0.1985708475267403,"score_spread":0.19101728289039052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005698680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07596333,0.00000779293,0.9227302,0.00049412606,0.000050001825,0.00013281648,0.000012290703,0.000092218404,0.0005172162],"genre_scores_gemma":[0.99148715,0.0000026153243,0.0082481075,0.00011286826,0.000026195159,0.000015856202,0.00005849312,0.000002527511,0.000046215097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994147,0.000023778864,0.00010816874,0.00024874866,0.000073235766,0.00013138616],"domain_scores_gemma":[0.9995637,0.000055085322,0.000029284836,0.0003049832,0.000013556213,0.000033417626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019616536,0.000076216784,0.00007800707,0.000052197098,0.000050957824,0.0001137503,0.00025038942,0.000018689763,0.0000020604787],"category_scores_gemma":[0.000022714908,0.000057355224,0.000011763096,0.00017540422,0.00002730468,0.00013077723,0.00030405557,0.00003809561,0.000019644072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099160125,0.00021013047,0.051923055,0.00003530515,0.000011058077,0.0000018889127,0.0010069174,0.0024639498,0.0016959617,0.13106793,0.0008735495,0.81070036],"study_design_scores_gemma":[0.00024488432,0.00001526303,0.043246727,0.000003877936,6.4450035e-7,4.526116e-7,0.000018662693,0.9452668,0.00047247892,0.00035015334,0.010298049,0.000082032064],"about_ca_topic_score_codex":0.00039522958,"about_ca_topic_score_gemma":0.0005174492,"teacher_disagreement_score":0.94280285,"about_ca_system_score_codex":0.000010949228,"about_ca_system_score_gemma":0.0000037801537,"threshold_uncertainty_score":0.23388782},"labels":[],"label_agreement":null},{"id":"W2005846137","doi":"","title":"Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Context (archaeology); Computer science; Welsh; Library science; Mobile computing; Event (particle physics); World Wide Web; Telecommunications; History","score_opus":0.04307025708030411,"score_gpt":0.30081736227153577,"score_spread":0.2577471051912317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005846137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22407116,0.000050275612,0.7523099,0.012124548,0.0012988211,0.0013309683,0.000071669594,0.00025697768,0.008485692],"genre_scores_gemma":[0.9464481,0.00003124435,0.05199253,0.0004466844,0.00012508477,0.00001813008,0.000018432298,0.000004789774,0.0009150438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952555,6.572362e-7,0.00007632516,0.00019798272,0.00012286048,0.00007662475],"domain_scores_gemma":[0.99952644,0.000033256925,0.00003410207,0.00036235334,0.000028756993,0.000015109263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011231453,0.000050621606,0.000049440256,0.000038668357,0.000025871275,0.00026305183,0.0035141606,0.00001159499,0.0000028464983],"category_scores_gemma":[0.000033700624,0.0000327432,0.000010803845,0.00012422976,0.000007486486,0.0012031209,0.001465767,0.000031911703,4.1015463e-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.000010632592,0.00013046263,0.0006018475,0.000040190927,0.000040372088,5.023042e-7,0.00022477578,0.00012955666,0.00078452827,0.30990493,0.03469891,0.6534333],"study_design_scores_gemma":[0.000396018,0.000056617533,0.008382801,0.00008273183,0.0000072760595,0.0000013207218,0.00004653409,0.95407754,0.003993482,0.0021419893,0.030658783,0.00015491359],"about_ca_topic_score_codex":0.0000013231881,"about_ca_topic_score_gemma":2.8109167e-7,"teacher_disagreement_score":0.95394796,"about_ca_system_score_codex":0.000004689655,"about_ca_system_score_gemma":0.0000033907854,"threshold_uncertainty_score":0.6530243},"labels":[],"label_agreement":null},{"id":"W2006707333","doi":"10.1016/s0925-7721(02)00102-5","title":"Fast approximations for sums of distances, clustering and the Fermat–Weber problem","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":90,"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":"Fermat's Last Theorem; Mathematics; Cluster analysis; Dimension (graph theory); Combinatorics; Randomized algorithm; Euclidean geometry; Preprocessor; Constant (computer programming); Set (abstract data type); Point (geometry); Approximation algorithm; Discrete mathematics; Algorithm; Computer science; Geometry; Statistics; Artificial intelligence","score_opus":0.01932622633743269,"score_gpt":0.22757928364946964,"score_spread":0.20825305731203694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006707333","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.0011307874,0.0002846087,0.995032,0.0013363035,0.00009521665,0.00030277006,0.00003281012,0.000035502333,0.0017499977],"genre_scores_gemma":[0.519449,0.00002255314,0.47894594,0.00024196839,0.000064930035,0.0000700042,0.00005956727,0.000007748262,0.0011383166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993129,0.000019598177,0.00019169519,0.00017369053,0.00018675582,0.00011539671],"domain_scores_gemma":[0.99939203,0.00025560067,0.00009318488,0.00016279894,0.00007106513,0.000025312536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022409785,0.00007222439,0.000108368215,0.000102214304,0.00013987524,0.00014904044,0.00037423425,0.000015187974,0.000010963822],"category_scores_gemma":[0.000021501175,0.000053333984,0.000038105965,0.0003843162,0.00009836787,0.0004195885,0.0002266164,0.000040412076,0.0000060659017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001143167,0.00008566021,0.00029520542,0.00028745283,0.00007685941,9.637745e-7,0.00087402505,0.030233808,0.000005990593,0.7811024,0.0059882565,0.18103793],"study_design_scores_gemma":[0.0007646283,0.00001312432,0.0011047577,0.000014917894,0.0000060646166,0.0000035072474,0.000031642663,0.9682326,0.0000051064585,0.026000325,0.0037502716,0.000073109215],"about_ca_topic_score_codex":0.0000022507945,"about_ca_topic_score_gemma":0.000001208733,"teacher_disagreement_score":0.9379987,"about_ca_system_score_codex":0.000008239372,"about_ca_system_score_gemma":0.0000051638112,"threshold_uncertainty_score":0.21748967},"labels":[],"label_agreement":null},{"id":"W2006806998","doi":"10.1016/s0306-4379(03)00038-3","title":"Extending object-oriented databases for fuzzy information modeling","year":2003,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":104,"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; Fuzzy logic; Object (grammar); Database; Data mining; Measure (data warehouse); Database model; Data model (GIS); Database design; Theoretical computer science; Information retrieval; Artificial intelligence","score_opus":0.0335790971528764,"score_gpt":0.26375830145697404,"score_spread":0.23017920430409763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006806998","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.00033225544,0.000038967206,0.97550815,0.000029678835,0.0015971891,0.0006388617,0.0000653522,0.00024017492,0.021549365],"genre_scores_gemma":[0.8806694,0.000036022244,0.11592886,0.00060871034,0.00015997066,0.00044650433,0.0018429226,0.000011839531,0.00029575726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986676,0.000031079715,0.00060382404,0.00010379581,0.00034547757,0.000248217],"domain_scores_gemma":[0.99897975,0.00004189296,0.00025152363,0.00044470027,0.00022266996,0.00005948216],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008120558,0.0001243634,0.00012917144,0.00032779344,0.00021925136,0.0008189568,0.00037103647,0.000030634885,0.0000021307367],"category_scores_gemma":[0.0001541685,0.00011621951,0.00004298429,0.00038521647,0.0000070903047,0.024462812,0.00009421431,0.000052358002,0.00022323467],"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.000003536002,0.000008521586,0.000035163943,0.00017965978,0.00001838586,2.0322767e-7,0.0010072036,0.018182222,0.0000036464055,0.95589554,0.0037689896,0.02089691],"study_design_scores_gemma":[0.00033286863,0.000013353059,0.0000047486315,0.000031970387,0.0000038023104,0.00000525088,0.0007185534,0.6574239,0.00003486315,0.00011962228,0.34119254,0.00011846956],"about_ca_topic_score_codex":0.00003744769,"about_ca_topic_score_gemma":6.6169235e-7,"teacher_disagreement_score":0.9557759,"about_ca_system_score_codex":0.000054375054,"about_ca_system_score_gemma":0.00004210456,"threshold_uncertainty_score":0.9891815},"labels":[],"label_agreement":null},{"id":"W2007822373","doi":"10.1109/icra.2014.6907710","title":"Multi-agent rendezvous on street networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Rendezvous; Shortest path problem; Computer science; Task (project management); Path (computing); Mathematical optimization; Distributed computing; Computer network; Mathematics; Theoretical computer science; Engineering; Graph","score_opus":0.02206231649215098,"score_gpt":0.2390775722026118,"score_spread":0.21701525571046082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007822373","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.00022489122,0.000007689935,0.97876376,0.00040442328,0.0004987652,0.0000626688,5.5480757e-7,0.00021898783,0.019818285],"genre_scores_gemma":[0.6842563,0.000021707458,0.29735288,0.0036663946,0.00031091776,0.000011040816,0.00002001263,0.000011822601,0.014348882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.000029505814,0.00009509436,0.00028534897,0.00015276029,0.00020117263],"domain_scores_gemma":[0.99924654,0.000030624917,0.000028246517,0.00062211475,0.000011846308,0.000060623395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020458247,0.000085194515,0.00007035485,0.00004516522,0.000059656395,0.00016159345,0.0007922103,0.000021726408,0.000029179171],"category_scores_gemma":[0.000011367217,0.000066431356,0.000029055971,0.0001351232,0.000010857494,0.00025704358,0.00033524344,0.00006127356,0.00023482702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014454314,0.00013882671,0.00043444184,0.0000035126782,0.000015849999,0.00001057618,0.000029509101,0.003180058,0.000006442349,0.2163022,0.06706251,0.7128146],"study_design_scores_gemma":[0.00022820487,0.000069039015,0.0024405262,0.000004447098,0.0000017241186,2.6783889e-7,0.00000436225,0.92387867,0.000037771948,0.0001892867,0.07303678,0.000108911205],"about_ca_topic_score_codex":0.00002331399,"about_ca_topic_score_gemma":0.000029582927,"teacher_disagreement_score":0.92069864,"about_ca_system_score_codex":0.000009747557,"about_ca_system_score_gemma":0.0000027586423,"threshold_uncertainty_score":0.30183047},"labels":[],"label_agreement":null},{"id":"W2007853611","doi":"10.1016/j.comgeo.2006.03.003","title":"Computing homotopic shortest paths efficiently","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"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":"Disjoint sets; Randomized algorithm; Mathematics; Deterministic algorithm; Combinatorics; Floyd–Warshall algorithm; Point (geometry); Plane (geometry); Running time; Shortest path problem; Algorithm; Discrete mathematics; Computer science; K shortest path routing; Geometry; Graph","score_opus":0.008324284205473856,"score_gpt":0.22607426931660687,"score_spread":0.21774998511113303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007853611","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.06947318,0.00011237807,0.9242555,0.00031059643,0.00053194066,0.000122061436,0.000008995961,0.000278153,0.0049071903],"genre_scores_gemma":[0.87930626,6.399004e-7,0.11949389,0.00030435363,0.0002527004,0.0000027246606,0.00014929316,0.000008341449,0.00048182413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985044,0.000029379618,0.00027755878,0.00042624027,0.0004608551,0.00030157488],"domain_scores_gemma":[0.9992679,0.00016818073,0.00009019071,0.0003191735,0.000097417374,0.000057148798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496057,0.00014629881,0.00013872002,0.00031151422,0.00020699826,0.00037511156,0.0008393997,0.000034025074,0.000025366777],"category_scores_gemma":[0.000019458173,0.00014914485,0.00006660479,0.0010801797,0.000044039716,0.00042056185,0.00046621956,0.000104570165,0.0002553859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016381526,0.00039808956,0.014723581,0.000030273872,0.000032945358,0.00009175216,0.00005852698,0.26366395,0.00003012841,0.5670143,0.015574538,0.13838033],"study_design_scores_gemma":[0.0003318039,0.000034210763,0.15136738,0.000014636598,0.0000052267733,0.000014054438,0.000007586238,0.8223784,0.000028415785,0.017217347,0.008357731,0.00024320971],"about_ca_topic_score_codex":0.000025747908,"about_ca_topic_score_gemma":0.0000011753842,"teacher_disagreement_score":0.80983305,"about_ca_system_score_codex":0.000034771867,"about_ca_system_score_gemma":0.0000338093,"threshold_uncertainty_score":0.608195},"labels":[],"label_agreement":null},{"id":"W2008632807","doi":"10.1109/icde.2012.38","title":"Relevance Matters: Capitalizing on Less (Top-k Matching in Publish/Subscribe)","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Search engine indexing; Personalization; Cluster analysis; Tree (set theory); Data mining; Matching (statistics); Hierarchical clustering; Theoretical computer science; Information retrieval; Index (typography); Relevance (law); Machine learning; World Wide Web","score_opus":0.028357691564821663,"score_gpt":0.2513707586421479,"score_spread":0.22301306707732627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008632807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14538656,0.00028905045,0.7544375,0.01702027,0.0030550784,0.00038897726,0.0000045486763,0.0006754554,0.07874254],"genre_scores_gemma":[0.92782074,0.000025005862,0.06094582,0.007923127,0.00022140334,0.000019727351,0.000012253809,0.00001786917,0.0030140325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987143,0.000038440827,0.00019060572,0.00030568626,0.0002698058,0.00048115992],"domain_scores_gemma":[0.99922377,0.00006146893,0.00005089877,0.0005663922,0.000013340425,0.00008415719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051062857,0.0001293445,0.00012019576,0.00019260944,0.00006101796,0.000584235,0.0010038508,0.000029913072,0.000033817185],"category_scores_gemma":[0.000017931545,0.00011427611,0.00003068635,0.00036296571,0.000014697633,0.005494445,0.000477469,0.00013563823,0.00031805394],"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.000003729532,0.00025429844,0.007376202,0.000049599945,0.000015172959,0.000033499437,0.002379171,0.00010736596,0.00016562153,0.79778904,0.057797365,0.13402893],"study_design_scores_gemma":[0.0048661786,0.00030234773,0.11781599,0.0010355269,0.000034053595,0.000068511355,0.007879482,0.110703155,0.008541433,0.07730924,0.66649246,0.004951612],"about_ca_topic_score_codex":0.00018237962,"about_ca_topic_score_gemma":0.000029196299,"teacher_disagreement_score":0.78243417,"about_ca_system_score_codex":0.000047358157,"about_ca_system_score_gemma":0.000006787383,"threshold_uncertainty_score":0.56337917},"labels":[],"label_agreement":null},{"id":"W2009319587","doi":"10.1145/1557626.1557665","title":"General spanning trees and reachability query evaluation","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Winnipeg","funders":"","keywords":"Reachability; Spanning tree; Computer science; Combinatorics; Graph; Tree (set theory); Path (computing); Node (physics); Minimum spanning tree; Enhanced Data Rates for GSM Evolution; Trémaux tree; Routing (electronic design automation); Theoretical computer science; Directed graph; Discrete mathematics; Mathematics; Pathwidth; Line graph; Computer network; Artificial intelligence","score_opus":0.028690230338999687,"score_gpt":0.286801518287136,"score_spread":0.2581112879481363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009319587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19259275,0.00014035859,0.76193833,0.00389417,0.0001846582,0.000229727,6.8288614e-7,0.00023090278,0.040788434],"genre_scores_gemma":[0.8066691,0.0000104711935,0.19080693,0.0006832214,0.00009164656,0.000003870042,0.000009102526,0.0000015954085,0.0017240794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999402,0.000034125907,0.00007791768,0.00021440155,0.00017560174,0.00009598754],"domain_scores_gemma":[0.9996505,0.000011117561,0.000018874423,0.00026582304,0.000025286585,0.000028394186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058776385,0.000048902584,0.000049375438,0.000038586026,0.000049118244,0.00015679037,0.00019952266,0.000012470498,0.000014651207],"category_scores_gemma":[0.000021012867,0.000040257983,0.000012167321,0.00010001024,0.000010639798,0.00076978,0.00008948181,0.000026102398,0.000007260953],"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":[5.1955016e-7,0.00001663635,0.00062107464,8.7271417e-7,0.0000018768849,7.709518e-7,0.00006953083,0.000022164466,0.0001860774,0.043076202,0.0014845296,0.95451975],"study_design_scores_gemma":[0.00018721087,0.000056330548,0.17473769,0.0000031302466,0.000005026326,0.0000012754284,0.0000130093085,0.8055896,0.00023359929,0.016867163,0.002212827,0.000093141665],"about_ca_topic_score_codex":0.000041158935,"about_ca_topic_score_gemma":0.000008996054,"teacher_disagreement_score":0.9544266,"about_ca_system_score_codex":0.000011732022,"about_ca_system_score_gemma":0.000008308221,"threshold_uncertainty_score":0.1641673},"labels":[],"label_agreement":null},{"id":"W2009688537","doi":"10.1145/1391729.1391730","title":"A survey of top- <i>k</i> query processing techniques in relational database systems","year":2008,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":834,"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; Relational database; Database; Information retrieval; Dimension (graph theory); XML database; XML; Query optimization; Query language; Sargable; Domain (mathematical analysis); View; Database design; Web search query; World Wide Web; Search engine","score_opus":0.1129110638023711,"score_gpt":0.3416350848872731,"score_spread":0.22872402108490203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009688537","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.000004057278,0.6972283,0.3013265,0.0000052358764,0.00036415338,0.0005163227,0.00011771122,0.00019080089,0.00024690805],"genre_scores_gemma":[0.00016245469,0.94867265,0.049176212,0.00001392062,0.00013270591,0.000023742763,0.001683554,0.000044864795,0.000089866095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934343,0.003159388,0.0014269096,0.0009299129,0.00060387736,0.00044560607],"domain_scores_gemma":[0.99498093,0.001844033,0.0010649916,0.0018125575,0.00022885161,0.000068662484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008689558,0.0004616565,0.0015717983,0.00067874306,0.00012539965,0.00021377506,0.003401317,0.00020768335,0.0000011966117],"category_scores_gemma":[0.0009861628,0.00042583584,0.00015617393,0.002297869,0.00007935177,0.00078139326,0.0027515278,0.00052194804,0.000016733953],"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.2731103e-7,0.00006666249,0.0011332302,0.0042731734,0.000027536418,0.00004080028,0.000027775806,0.000013893683,3.9061625e-8,0.00031184588,0.0011294319,0.9929753],"study_design_scores_gemma":[0.00053993997,0.0001182864,0.015358656,0.072577715,0.0000979016,0.00018324288,0.000009900727,0.06961157,0.0000024061849,0.000081778504,0.838744,0.0026746292],"about_ca_topic_score_codex":0.0020639277,"about_ca_topic_score_gemma":0.00007610735,"teacher_disagreement_score":0.99030066,"about_ca_system_score_codex":0.0001043435,"about_ca_system_score_gemma":0.00052210194,"threshold_uncertainty_score":0.99981934},"labels":[],"label_agreement":null},{"id":"W2010342401","doi":"10.1080/13658810601079759","title":"A shortest path algorithm with novel heuristics for dynamic transportation networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Data Management and Algorithms","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":"MRF Geosystems (Canada)","funders":"","keywords":"Heuristics; Computer science; Shortest path problem; Path (computing); Process (computing); Yen's algorithm; Algorithm; Object (grammar); Mathematical optimization; Dijkstra's algorithm; K shortest path routing; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.007295755120132437,"score_gpt":0.24335346984247644,"score_spread":0.236057714722344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010342401","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.0010336386,0.00005104262,0.99623644,0.00026794287,0.0019165169,0.00023417799,0.000107957334,0.00003735425,0.000114929855],"genre_scores_gemma":[0.8882428,0.000054993907,0.1108124,0.0002641257,0.0003250289,0.000010251264,0.0002649839,0.000007756958,0.000017677523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978664,0.000010780078,0.0009652195,0.0001011712,0.00085310376,0.00020331773],"domain_scores_gemma":[0.9974645,0.00013470933,0.00077498966,0.00014597962,0.0013663139,0.000113516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011326924,0.0001312025,0.00018235351,0.0005622077,0.00006505796,0.00052852166,0.0008810156,0.000068476445,0.0000012915784],"category_scores_gemma":[0.000027630622,0.000102356506,0.00011969854,0.0003835444,0.00003964318,0.0029941562,0.000025651747,0.00016773124,0.0000016466627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053603057,0.0006340458,0.0076376945,0.000098650344,0.0014901856,0.00014389267,0.0012481848,0.08311204,0.000041315998,0.22415492,0.0025237787,0.67837924],"study_design_scores_gemma":[0.0016753498,0.00033623865,0.014323162,0.00014186265,0.000032632135,0.0001776413,0.0002417399,0.9446917,0.000006356968,0.00019347823,0.037976757,0.00020305236],"about_ca_topic_score_codex":0.000017822096,"about_ca_topic_score_gemma":0.000008736007,"teacher_disagreement_score":0.8872091,"about_ca_system_score_codex":0.000048263897,"about_ca_system_score_gemma":0.000038276477,"threshold_uncertainty_score":0.50965464},"labels":[],"label_agreement":null},{"id":"W2010507851","doi":"10.1007/s13740-012-0001-1","title":"On Modeling and Querying Concept Evolution","year":2012,"lang":"en","type":"article","venue":"Journal on Data Semantics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":12,"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; Scalability; Exploit; RDF; Theoretical computer science; Artificial intelligence; Semantic Web; Database","score_opus":0.059410692376369395,"score_gpt":0.2917034509951963,"score_spread":0.2322927586188269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010507851","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.008659692,0.0002814345,0.98837686,0.0011257146,0.0009876615,0.00004997616,0.000017699746,0.000036963385,0.00046402443],"genre_scores_gemma":[0.9553097,0.00020341878,0.043087993,0.00063569547,0.0006159486,3.5414425e-7,0.000036609672,0.000009260995,0.0001010571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899465,0.00004251517,0.00018200847,0.00019101659,0.0003240293,0.00026576646],"domain_scores_gemma":[0.99899864,0.00005331436,0.000098223136,0.00069717894,0.000027514154,0.00012509832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069251994,0.000098610144,0.00010243811,0.000114332484,0.00020559455,0.00042580796,0.000974281,0.00002868606,0.000004938706],"category_scores_gemma":[0.00008469382,0.00008024738,0.000017092092,0.00011877209,0.000015525175,0.002970967,0.00070660206,0.00024010621,0.000040358278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021634898,0.0004195766,0.0010177841,0.000038329923,0.00011312668,0.00008196048,0.0006794377,0.011476217,0.000086007,0.8220046,0.055842493,0.108218804],"study_design_scores_gemma":[0.00023513623,0.000061305334,0.00018323392,0.00006780344,0.0000139869535,0.00005387291,0.000046345736,0.9902371,0.00001173619,0.0039773826,0.0049825017,0.00012958556],"about_ca_topic_score_codex":0.00000361594,"about_ca_topic_score_gemma":4.6460212e-7,"teacher_disagreement_score":0.9787609,"about_ca_system_score_codex":0.000033229626,"about_ca_system_score_gemma":0.000014493253,"threshold_uncertainty_score":0.41060758},"labels":[],"label_agreement":null},{"id":"W2010916971","doi":"10.1145/1132863.1132868","title":"Integrating XML data sources using approximate joins","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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":"Computer science; Joins; XML validation; XML; Efficient XML Interchange; Document Structure Description; XML Schema (W3C); XML database; Information retrieval; Streaming XML; Data mining; Set (abstract data type); Tree (set theory); XML Encryption; Database; Programming language; World Wide Web","score_opus":0.06748389564404962,"score_gpt":0.2828255905583581,"score_spread":0.2153416949143085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010916971","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.0013125552,0.00015538283,0.99469465,0.00017508202,0.0010015122,0.00033521865,0.0013698388,0.00036650922,0.00058926665],"genre_scores_gemma":[0.42338413,0.00004943761,0.5715017,0.00015713707,0.00060290727,0.00006935373,0.0026921383,0.0000648788,0.0014783306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787056,0.0001120941,0.00042576808,0.00078604557,0.0004300545,0.0003754994],"domain_scores_gemma":[0.99526185,0.00010962173,0.00015022987,0.0043661483,0.00003814234,0.00007399989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006450247,0.00023561936,0.00022583989,0.0002625086,0.00044415417,0.0007688176,0.0034121242,0.000044645814,0.000015532833],"category_scores_gemma":[0.000025801766,0.00020906924,0.00005082696,0.00060868874,0.00004508615,0.002746512,0.0002513643,0.00021733633,0.00006603077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010255687,0.0052051735,0.0013173877,0.0030049514,0.0013968394,0.00091357203,0.0015998346,0.11404436,0.02703342,0.26122507,0.048338108,0.53581876],"study_design_scores_gemma":[0.0003427732,0.000027522106,0.000017546754,0.00020354768,0.000044369754,0.00004203835,0.00030992922,0.97489977,0.0006996151,0.00015273098,0.022913016,0.00034716577],"about_ca_topic_score_codex":0.002600541,"about_ca_topic_score_gemma":0.0001590475,"teacher_disagreement_score":0.8608554,"about_ca_system_score_codex":0.00004848087,"about_ca_system_score_gemma":0.000042604617,"threshold_uncertainty_score":0.8525596},"labels":[],"label_agreement":null},{"id":"W2012848182","doi":"10.1007/s00778-009-0176-8","title":"Supporting ranking queries on uncertain and incomplete data","year":2010,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":78,"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":"Ranking (information retrieval); Computer science; Data mining; Uncertain data; Set (abstract data type); Rank (graph theory); Probabilistic logic; Ranking SVM; Information retrieval; Semantics (computer science); Learning to rank; Artificial intelligence; Mathematics","score_opus":0.04986115690612704,"score_gpt":0.32384594359330166,"score_spread":0.27398478668717463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012848182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32698643,0.00031820973,0.61455727,0.044242136,0.005006408,0.00034856566,0.000039664104,0.0002467631,0.008254587],"genre_scores_gemma":[0.9263455,0.000099272016,0.069992706,0.0018326705,0.0011326694,0.000001639854,0.000015163494,0.000014097324,0.000566239],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991431,0.00005266081,0.00017022941,0.00017847166,0.00023273089,0.00022280276],"domain_scores_gemma":[0.99893653,0.000100333804,0.00013772542,0.00074901123,0.00002062609,0.000055778903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018826207,0.00007932663,0.00008101635,0.00005978276,0.00047493412,0.0008610262,0.0021023354,0.000015104263,0.000030660347],"category_scores_gemma":[0.00010024191,0.000047787216,0.000015840642,0.000118644886,0.00006614261,0.0010247392,0.001170204,0.0004000725,0.000016558735],"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.0000114307395,0.000026304357,0.0012748558,0.000008910653,0.000044409015,0.000110170826,0.00094702025,0.000023833865,0.0010454505,0.073504776,0.01585557,0.9071473],"study_design_scores_gemma":[0.0012639725,0.00019400431,0.009477008,0.00010124661,0.00004219463,0.0012734199,0.00047461863,0.31676924,0.0004760506,0.06690371,0.6024582,0.0005663432],"about_ca_topic_score_codex":0.000017672866,"about_ca_topic_score_gemma":0.000019061941,"teacher_disagreement_score":0.9065809,"about_ca_system_score_codex":0.0000044440226,"about_ca_system_score_gemma":0.000023905584,"threshold_uncertainty_score":0.8302895},"labels":[],"label_agreement":null},{"id":"W2012990590","doi":"10.1109/grc.2005.1547337","title":"Using contextual information to improve retrieval performance","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Information retrieval; Weighting; Divergence-from-randomness model; Query expansion; Construct (python library); Context (archaeology); Granularity; Index (typography); Paragraph; Probabilistic logic; Data mining; Artificial intelligence; World Wide Web","score_opus":0.023033424523372464,"score_gpt":0.25603084098202233,"score_spread":0.23299741645864988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012990590","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.056026135,0.000002719618,0.9276841,0.00072066375,0.00025686887,0.00014059964,0.000002478583,0.00012709116,0.01503933],"genre_scores_gemma":[0.67168844,0.00000330334,0.3233376,0.0031001805,0.00016275866,0.0000018000336,0.000006676979,0.000002772141,0.0016964633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994055,0.0000049371956,0.00014389204,0.000108282184,0.00017676601,0.00016060821],"domain_scores_gemma":[0.9995994,0.000006602685,0.000033074164,0.0002644419,0.000043286225,0.000053225835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001798503,0.000060850813,0.000052319083,0.000088797184,0.0000684463,0.00027662585,0.00046366858,0.000015723666,0.000025682128],"category_scores_gemma":[0.000013966733,0.000052762014,0.000014665835,0.00024622612,0.000007002748,0.005470322,0.0003125492,0.000038959217,0.0006303849],"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.000008173852,0.0000137844045,0.00007156623,0.000007808794,0.0000058141036,3.841801e-7,0.00036069538,0.00050744636,0.00046462126,0.025277868,0.003975591,0.96930623],"study_design_scores_gemma":[0.00021599104,0.000058359987,0.0004873668,0.000004329783,0.0000016056589,0.0000015204382,0.000027721457,0.8692016,0.004761658,0.000021224265,0.1251021,0.000116516836],"about_ca_topic_score_codex":0.00000881104,"about_ca_topic_score_gemma":0.0000013725951,"teacher_disagreement_score":0.9691897,"about_ca_system_score_codex":0.00003337692,"about_ca_system_score_gemma":0.000015559135,"threshold_uncertainty_score":0.81025326},"labels":[],"label_agreement":null},{"id":"W2013001036","doi":"10.1016/s1386-5056(02)00126-0","title":"Integrating gis components with knowledge discovery technology for environmental health decision support","year":2003,"lang":"en","type":"article","venue":"International Journal of Medical Informatics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre hospitalier universitaire de Québec; Institut National de Santé Publique du Québec; Université Laval","funders":"","keywords":"Online analytical processing; GIS and public health; Decision support system; Computer science; Geographic information system; Data science; Knowledge extraction; Field (mathematics); Knowledge management; Data mining; Data warehouse; Geography; Cartography","score_opus":0.01732169662344831,"score_gpt":0.3056542075351189,"score_spread":0.2883325109116706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013001036","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.008010263,0.0000623284,0.9878439,0.0022955716,0.0010191699,0.0000933948,0.000013103312,0.0000136537365,0.00064861553],"genre_scores_gemma":[0.2590998,0.0003299567,0.73847926,0.0016371808,0.00017559071,0.000006518014,0.000045751673,0.000010855613,0.0002150865],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977794,0.000020646654,0.000771571,0.000069424816,0.0011865811,0.00017232534],"domain_scores_gemma":[0.9989452,0.00014650123,0.0005364625,0.00014437322,0.00009247101,0.00013499284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011923913,0.000100914425,0.00018665417,0.00031872353,0.000058337064,0.00020372825,0.0016096744,0.000055334083,0.000030773677],"category_scores_gemma":[0.0002070841,0.00006858306,0.00006130865,0.00011958641,0.00007435224,0.0015594389,0.00025413805,0.00023721233,0.000013070672],"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.000032034863,0.0003484691,0.0008159293,0.000026003554,0.0001750133,0.000045379802,0.0010019572,0.000035178393,0.000008895555,0.08629369,0.009002525,0.90221494],"study_design_scores_gemma":[0.008820851,0.0024173732,0.00054594444,0.0013690721,0.000030839106,0.00251568,0.003870296,0.2513594,0.0006868331,0.011295749,0.7165615,0.0005264562],"about_ca_topic_score_codex":9.440237e-7,"about_ca_topic_score_gemma":0.00000263888,"teacher_disagreement_score":0.90168846,"about_ca_system_score_codex":0.00012443776,"about_ca_system_score_gemma":0.00022091373,"threshold_uncertainty_score":0.29912025},"labels":[],"label_agreement":null},{"id":"W2013230316","doi":"10.3166/isi.15.1.113-138","title":"Requêtes arbres régulières pour l'analyse de dépendances entre vues et mises à jour de documents XML","year":2010,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"","keywords":"XPath; Class (philosophy); XML; Computer science; Tree (set theory); Combinatorics; Database query; Time complexity; PSPACE; Independence (probability theory); Mathematics; Theoretical computer science; Discrete mathematics; Information retrieval; Computational complexity theory; Algorithm; Artificial intelligence; XML database; World Wide Web; Statistics","score_opus":0.01622366735193683,"score_gpt":0.2679519267846842,"score_spread":0.2517282594327474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013230316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3497953,0.0032977436,0.5788988,0.009489705,0.006039425,0.00093506946,0.00029699368,0.0007324969,0.050514463],"genre_scores_gemma":[0.8696734,0.001165985,0.12029425,0.00185013,0.000679759,0.000068072026,0.00024037014,0.000029875468,0.005998175],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99704415,0.00022563856,0.00089728885,0.0003313227,0.0005753256,0.0009262636],"domain_scores_gemma":[0.9978322,0.0002058631,0.0006907279,0.0006687823,0.00033292462,0.00026953671],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0016227302,0.00042059732,0.00036761074,0.00044398615,0.00050245126,0.0041513164,0.0014341376,0.00021534778,0.00036503782],"category_scores_gemma":[0.0007006815,0.00042041787,0.00017864504,0.000656719,0.00030576755,0.020414576,0.0005459793,0.0004785234,0.00052965106],"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.000057330915,0.00025688796,0.024834547,0.0015150394,0.00043152153,0.00009126836,0.036361296,0.0017682897,0.0016286097,0.13766065,0.05686423,0.73853034],"study_design_scores_gemma":[0.0021485286,0.0003312548,0.04639236,0.001812896,0.00038383782,0.00044867827,0.007538373,0.30973756,0.01941781,0.11992489,0.48988038,0.0019834316],"about_ca_topic_score_codex":0.0015454335,"about_ca_topic_score_gemma":0.00054172083,"teacher_disagreement_score":0.7365469,"about_ca_system_score_codex":0.0002708156,"about_ca_system_score_gemma":0.00048186828,"threshold_uncertainty_score":0.99982476},"labels":[],"label_agreement":null},{"id":"W2014133121","doi":"10.1007/s11009-011-9246-7","title":"Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs","year":2011,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Data Management and Algorithms","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":"McMaster University","funders":"","keywords":"Mathematics; Random walk; Cover (algebra); Class (philosophy); Combinatorics; Discrete mathematics; Order (exchange); Statistics; Computer science; Artificial intelligence","score_opus":0.10535835796620976,"score_gpt":0.29521330892928965,"score_spread":0.1898549509630799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014133121","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.39397168,0.000033787295,0.60436934,0.000023321769,0.00008008852,0.0003157247,0.0000022072952,0.000024358103,0.0011795235],"genre_scores_gemma":[0.5092112,0.0000019983604,0.49073195,0.00002773626,0.000008135071,0.000010485918,0.0000017799531,0.0000023188488,0.000004421248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867934,0.00030889755,0.00037175688,0.00039986236,0.000064593696,0.00017554732],"domain_scores_gemma":[0.9980228,0.0014862438,0.00018461948,0.00024580324,0.00003367466,0.000026853893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039247507,0.00010819498,0.000324901,0.00009584958,0.00010501479,0.000012727369,0.00021353058,0.00006266402,0.0000026916225],"category_scores_gemma":[0.00019723747,0.00009839998,0.000036419075,0.0001881566,0.00013079289,0.000060909453,0.00025331407,0.00010409005,1.9067444e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020232446,0.00014429646,0.009465831,0.00025782923,0.000050181214,5.158286e-7,0.0023011256,0.0006372082,0.0012271266,0.5348756,0.000018709481,0.45081925],"study_design_scores_gemma":[0.0036604227,0.0004202229,0.03166693,0.00008442268,0.00005196483,0.0000054954958,0.0003638749,0.5151436,0.007999985,0.44016743,0.000064672444,0.000371011],"about_ca_topic_score_codex":0.00003389891,"about_ca_topic_score_gemma":0.000008224875,"teacher_disagreement_score":0.51450634,"about_ca_system_score_codex":0.0000054071593,"about_ca_system_score_gemma":0.000010859372,"threshold_uncertainty_score":0.40126345},"labels":[],"label_agreement":null},{"id":"W2015391423","doi":"10.1145/2462356.2462378","title":"Kinetic data structures for all nearest neighbors and closest pair in the plane","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Combinatorics; k-nearest neighbors algorithm; Plane (geometry); Mathematics; Algebraic number; Function (biology); Amortized analysis; Binary logarithm; Degree (music); Trajectory; Kinetic energy; Discrete mathematics; Data structure; Algorithm; Physics; Computer science; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.04426051183283414,"score_gpt":0.27019164940629237,"score_spread":0.22593113757345823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015391423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19793351,0.00074909825,0.69879436,0.076876685,0.0014875276,0.0055851215,0.00033783686,0.00054097106,0.017694911],"genre_scores_gemma":[0.8930453,0.000033327287,0.10133065,0.0045191245,0.00014360927,0.00004534499,0.0003641657,0.000008124287,0.0005103486],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934655,0.00001782713,0.00009484596,0.00026967208,0.00010693833,0.00016417193],"domain_scores_gemma":[0.9990288,0.000104799125,0.000021642425,0.000809831,0.0000085093325,0.00002638809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017073544,0.00007316386,0.00006223639,0.00003625283,0.000037914277,0.0005010873,0.0017749197,0.000016288082,0.000029061004],"category_scores_gemma":[0.00001844434,0.000042262862,0.000006872018,0.000093872644,0.000025587204,0.00078823057,0.00062830007,0.000045006345,0.000015528412],"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.0000037122968,0.00006731557,0.008788737,0.00005114539,0.000026260088,0.000014607657,0.0005149517,0.000021105925,0.000035928184,0.2864527,0.429558,0.2744655],"study_design_scores_gemma":[0.0007912335,0.00014795111,0.26098135,0.000009027031,0.0000121147505,0.000010382154,0.00022010152,0.39968175,0.00003613247,0.034647956,0.30316573,0.00029627152],"about_ca_topic_score_codex":0.00051289744,"about_ca_topic_score_gemma":0.00015340414,"teacher_disagreement_score":0.6951118,"about_ca_system_score_codex":0.0000021236958,"about_ca_system_score_gemma":0.0000050341246,"threshold_uncertainty_score":0.48319966},"labels":[],"label_agreement":null},{"id":"W2015414733","doi":"10.1002/asi.22648","title":"Modeling geographic, temporal, and proximity contexts for improving geotemporal search","year":2012,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Query expansion; Web search query; Probabilistic logic; Context (archaeology); Data mining; Search engine; Artificial intelligence; Geography","score_opus":0.0190929325820931,"score_gpt":0.2779477077519878,"score_spread":0.2588547751698947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015414733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36631733,0.00009872133,0.6270216,0.006075225,0.0001415302,0.0003022994,0.0000053964964,0.00002556412,0.000012317956],"genre_scores_gemma":[0.9072386,0.000049613227,0.09212724,0.0005307204,0.0000380736,0.000009076815,4.900778e-7,0.0000017936821,0.0000044181634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990312,0.00000603855,0.00027604518,0.0000848223,0.0003170526,0.0002848607],"domain_scores_gemma":[0.99875104,0.000032408247,0.00040046187,0.00019152876,0.0005606673,0.00006390408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026022894,0.000069908965,0.0001413219,0.0002545545,0.00049113994,0.0002450936,0.0008228158,0.000027615508,7.436622e-8],"category_scores_gemma":[0.00015733845,0.00004576323,0.00008656055,0.0011032956,0.000783498,0.007232421,0.00045984678,0.00012528483,1.6680977e-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.000015764448,0.00002845913,0.009010588,0.000076346994,0.00004040092,5.8364943e-8,0.0015026105,0.00006751496,0.00078294886,0.046454564,0.0005788367,0.9414419],"study_design_scores_gemma":[0.00083406514,0.00043964214,0.0015902765,0.000020105217,0.000028604816,0.00006339657,0.0051742652,0.97158927,0.000833418,0.0045151906,0.014714297,0.0001974782],"about_ca_topic_score_codex":0.00001708858,"about_ca_topic_score_gemma":4.7509587e-7,"teacher_disagreement_score":0.97152174,"about_ca_system_score_codex":0.000030088057,"about_ca_system_score_gemma":0.00011261698,"threshold_uncertainty_score":0.52433306},"labels":[],"label_agreement":null},{"id":"W2017629483","doi":"10.1145/1071246.1071248","title":"Efficient constraint processing for location-aware computing","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Constraint (computer-aided design); Set (abstract data type); Relation (database); Position (finance); Distributed computing; Wireless ad hoc network; Mobile computing; Matching (statistics); Point (geometry); Wireless; Theoretical computer science; Computer network; Data mining; Mathematics","score_opus":0.019338926336859567,"score_gpt":0.2695487969445762,"score_spread":0.2502098706077166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017629483","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.00062245363,0.000032352345,0.9935677,0.001855946,0.000098421086,0.00019961252,0.0000012685989,0.00021089721,0.0034113305],"genre_scores_gemma":[0.6549656,2.1076924e-7,0.3441555,0.00044488654,0.00009555322,0.000004801162,0.000005363883,0.0000028886507,0.00032525224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.000005943031,0.00013959155,0.0002376815,0.00012050981,0.0001864764],"domain_scores_gemma":[0.99959767,0.000033124335,0.000046743404,0.00019462944,0.00009032521,0.00003752662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022091845,0.000068968824,0.000063421074,0.000050811657,0.00014911486,0.00026221102,0.00044057964,0.000013915847,0.000008427632],"category_scores_gemma":[0.000012181745,0.00005968977,0.00002149373,0.00020542963,0.000024017265,0.00018957471,0.00015640749,0.000029037588,0.000037820897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.221025e-7,0.00004134337,0.000017348164,0.000026884529,0.000003470043,4.269721e-7,0.00016700097,0.014558339,0.000009423884,0.058185637,0.0014943718,0.9254953],"study_design_scores_gemma":[0.0001900269,0.000011770132,0.000091227266,0.000017953935,0.0000021052779,0.0000016797685,0.00007135545,0.9902823,0.00018582011,0.00012306144,0.008930274,0.00009243547],"about_ca_topic_score_codex":0.0000022929173,"about_ca_topic_score_gemma":0.00000202834,"teacher_disagreement_score":0.9757239,"about_ca_system_score_codex":0.000022189372,"about_ca_system_score_gemma":0.000035999317,"threshold_uncertainty_score":0.2528507},"labels":[],"label_agreement":null},{"id":"W2017668371","doi":"10.3166/ria.22.137-159","title":"Génération de plan de site web pour les non-voyants par des fourmis artificielles","year":2008,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Data Management and Algorithms","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":"Humanities; Biology; Philosophy","score_opus":0.12354991509025708,"score_gpt":0.27668443620145355,"score_spread":0.15313452111119646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017668371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22147459,0.0021041222,0.7622501,0.003419571,0.00088261836,0.00036769398,0.000058345173,0.0001741466,0.00926878],"genre_scores_gemma":[0.8712867,0.004469588,0.053088743,0.00036276117,0.0008288206,0.00004454216,0.000054598437,0.000057984613,0.06980628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961655,0.00025450546,0.00084121927,0.0009809658,0.00038968297,0.0013680904],"domain_scores_gemma":[0.99766254,0.00031188127,0.0002905018,0.0011303873,0.00022494726,0.0003797439],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012155563,0.0004715359,0.00041636676,0.0002728795,0.0012150503,0.0005536843,0.0014173186,0.00025568393,0.0006393937],"category_scores_gemma":[0.00024178911,0.00054185634,0.00024416525,0.0010591192,0.00067529595,0.0013595412,0.00049732585,0.0004543514,0.0036785782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008648068,0.0020684015,0.031412926,0.00082286657,0.00020471496,0.0027771355,0.035232577,0.1360277,0.032997858,0.035738282,0.060968243,0.6616628],"study_design_scores_gemma":[0.00009378987,0.0001666467,0.0013165246,0.00038658862,0.000046975547,0.00045023556,0.0011247147,0.8966154,0.061000366,0.0048805387,0.033330712,0.0005875323],"about_ca_topic_score_codex":0.00059155934,"about_ca_topic_score_gemma":0.00023929897,"teacher_disagreement_score":0.7605877,"about_ca_system_score_codex":0.0002164545,"about_ca_system_score_gemma":0.0003818695,"threshold_uncertainty_score":0.9997033},"labels":[],"label_agreement":null},{"id":"W2017733151","doi":"10.1109/iccit.2007.148","title":"Investigating the Performance of Naive- Bayes Classifiers and K- Nearest Neighbor Classifiers","year":2007,"lang":"en","type":"article","venue":"2007 International Conference on Convergence Information Technology (ICCIT 2007)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":151,"is_retracted":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":"","keywords":"Naive Bayes classifier; Artificial intelligence; k-nearest neighbors algorithm; Computer science; Machine learning; Bayes error rate; Classifier (UML); Bayes classifier; Random subspace method; Pattern recognition (psychology); Bayesian probability; Bayes' theorem; Data mining; Support vector machine","score_opus":0.024900131717299163,"score_gpt":0.26046504088334227,"score_spread":0.2355649091660431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017733151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3773804,0.00008348643,0.52193606,0.013892903,0.0049431133,0.00087046885,0.000053377345,0.0006370599,0.08020312],"genre_scores_gemma":[0.988596,0.0002730399,0.009461794,0.0011683189,0.00006174424,0.000020638836,0.00003425639,0.0000063660623,0.0003778098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981056,0.000021514168,0.00066870754,0.00027484642,0.0005676798,0.00036166856],"domain_scores_gemma":[0.99840164,0.00010328735,0.0005095959,0.00044426147,0.00045375136,0.0000874744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008000145,0.00021555963,0.00017802774,0.0006637947,0.00023102763,0.00020678047,0.0016982642,0.00017608314,0.00023196802],"category_scores_gemma":[0.00023036536,0.00017613919,0.000042738833,0.0006547805,0.0005508193,0.002674911,0.00043612492,0.0003947424,0.00017628154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022183825,0.00003279325,0.030070964,0.0000339751,0.00006304773,0.0000031415768,0.0003942575,0.000054442604,0.00033404492,0.7916552,0.0033204234,0.17401552],"study_design_scores_gemma":[0.0010712337,0.0004974811,0.057390895,0.0002540375,0.000020332247,0.00003877027,0.003352001,0.8694682,0.011019563,0.008314503,0.04786939,0.000703607],"about_ca_topic_score_codex":0.00002652344,"about_ca_topic_score_gemma":0.000007847227,"teacher_disagreement_score":0.86941373,"about_ca_system_score_codex":0.00007018246,"about_ca_system_score_gemma":0.00010791892,"threshold_uncertainty_score":0.7182748},"labels":[],"label_agreement":null},{"id":"W2018416407","doi":"10.1145/2133803.2330083","title":"A topological sorting algorithm for large graphs","year":2012,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Topological sorting; Reachability; Computer science; Sorting; Algorithm; Sorting algorithm; Vertex (graph theory); sort; Directed acyclic graph; Graph; Theoretical computer science; Mathematics","score_opus":0.03450389665994346,"score_gpt":0.314868580395484,"score_spread":0.2803646837355405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018416407","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.010878215,0.0030629514,0.9823629,0.00039063144,0.0026394904,0.000240236,0.000020676247,0.000062754756,0.0003421321],"genre_scores_gemma":[0.14609826,0.00007614627,0.85218054,0.0005480892,0.0009631755,0.000015975505,0.0000100925545,0.000019328934,0.000088428664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997872,0.00005703456,0.00065078726,0.00023382166,0.0004561327,0.0007302086],"domain_scores_gemma":[0.9984439,0.000145533,0.00048770264,0.00050851965,0.00013543792,0.00027890925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001127711,0.0002337324,0.00034735433,0.00020245614,0.00022460379,0.0001898526,0.001946336,0.000083565734,0.000029460783],"category_scores_gemma":[0.00011398173,0.00019243931,0.000298367,0.0002970816,0.000046993613,0.002292636,0.0009227074,0.00021958057,0.000013587106],"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.00004460654,0.0032129693,0.0017790077,0.000021236403,0.0004310486,0.00012933543,0.002543331,0.000004103222,0.0063590812,0.256371,0.011969123,0.7171352],"study_design_scores_gemma":[0.02291043,0.008528268,0.0041000843,0.00030392624,0.0003979637,0.0036467712,0.014491607,0.31093135,0.28358614,0.1146193,0.23171437,0.004769762],"about_ca_topic_score_codex":0.0000030012825,"about_ca_topic_score_gemma":1.2068698e-7,"teacher_disagreement_score":0.7123654,"about_ca_system_score_codex":0.00007856018,"about_ca_system_score_gemma":0.000031693715,"threshold_uncertainty_score":0.78474474},"labels":[],"label_agreement":null},{"id":"W2018601220","doi":"10.1007/s11042-013-1740-1","title":"Knowledge management technologies for semantic multimedia services","year":2013,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Semantics (computer science); Ubiquitous computing; Database transaction; Context (archaeology); Domain (mathematical analysis); World Wide Web; Domain knowledge; Service (business); Knowledge management; Human–computer interaction; Database","score_opus":0.0194616780833261,"score_gpt":0.2600597032365578,"score_spread":0.2405980251532317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018601220","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.0005677972,0.00076496147,0.9853788,0.0023995445,0.00015878073,0.0038228408,0.0000688592,0.0010215802,0.005816849],"genre_scores_gemma":[0.07439204,0.00068105065,0.9096904,0.0002165954,0.000170687,0.011938438,0.00025461064,0.000024667677,0.0026315574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897325,0.0000074101395,0.00019264179,0.0004529292,0.00009778189,0.0002760014],"domain_scores_gemma":[0.9990655,0.0001318895,0.00006488738,0.0006096788,0.00006611525,0.000061889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010025572,0.00015240416,0.00013730416,0.000119822034,0.00021155753,0.00046766936,0.0009190346,0.000054034375,0.000008588447],"category_scores_gemma":[0.000006199026,0.00013136046,0.000038683593,0.00029608508,0.00006950216,0.00080391736,0.0006014608,0.00005960275,0.00037985598],"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.4880267e-7,0.0000779241,0.00008956821,0.00012100128,0.000023651628,2.9869074e-7,0.000113516086,0.0000010714351,0.00011451909,0.028180957,0.0018836022,0.96939355],"study_design_scores_gemma":[0.00086148526,0.000035096546,0.005677018,0.0000415364,0.00004143432,0.0000016773693,0.0008902976,0.55054504,0.00062471605,0.013016686,0.4278432,0.0004218279],"about_ca_topic_score_codex":0.000013177757,"about_ca_topic_score_gemma":0.000006482301,"teacher_disagreement_score":0.9689717,"about_ca_system_score_codex":0.0000108002705,"about_ca_system_score_gemma":0.000005189783,"threshold_uncertainty_score":0.5356724},"labels":[],"label_agreement":null},{"id":"W2019985064","doi":"10.1109/bigdata.congress.2014.121","title":"Towards Efficient KNN Joins on Data Streams","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Joins; Computer science; Snapshot (computer storage); Data mining; Data stream mining; Cluster analysis; Big data; Database; Artificial intelligence","score_opus":0.039897047600310674,"score_gpt":0.2677724367088479,"score_spread":0.22787538910853725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019985064","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.0010577658,0.0000035336852,0.8399194,0.0016764189,0.00044193797,0.00007739554,0.000012653195,0.00021152257,0.15659936],"genre_scores_gemma":[0.7608492,0.000015991436,0.22108461,0.004541593,0.00052792,0.000009291141,0.00032053204,0.000021192607,0.012629713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989125,0.000025899852,0.00010676259,0.00046087996,0.00029151118,0.00020244],"domain_scores_gemma":[0.99774766,0.000027791008,0.000028379503,0.0021172299,0.000014195396,0.000064757965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038318272,0.00009202886,0.00008260428,0.00006367866,0.000064541266,0.000277263,0.0026506376,0.000016623771,0.00006181984],"category_scores_gemma":[0.000033739972,0.00006796422,0.000018464067,0.00019017629,0.000016767584,0.00035435462,0.0018353234,0.00005321085,0.00075174385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.018337e-7,0.00007771896,0.000014673703,0.000003055546,0.0000057398147,0.0000024078677,0.000018085815,0.000077132805,0.00000541597,0.34555694,0.03422566,0.6200126],"study_design_scores_gemma":[0.00017329621,0.00006925405,0.00069645006,0.000006188044,0.0000028658505,5.6378383e-7,0.0000065935697,0.82763475,0.00020536974,0.0005808732,0.17050761,0.00011618257],"about_ca_topic_score_codex":0.000049605867,"about_ca_topic_score_gemma":0.000008044342,"teacher_disagreement_score":0.8275576,"about_ca_system_score_codex":0.000009830575,"about_ca_system_score_gemma":0.000012309685,"threshold_uncertainty_score":0.9662397},"labels":[],"label_agreement":null},{"id":"W2020019218","doi":"10.1111/1467-9671.00111","title":"Spatio‐Temporal Object‐Oriented Data Model for Disaggregate Travel Behavior","year":2002,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Université Laval; Université de Montréal","funders":"","keywords":"Computer science; Exploit; Object (grammar); Domain (mathematical analysis); Data model (GIS); Hierarchy; Field (mathematics); Travel behavior; Conceptual model; Process (computing); Focus (optics); Data mining; Database; Artificial intelligence; Engineering; Transport engineering; Mathematics","score_opus":0.08436288203277122,"score_gpt":0.29173461727934974,"score_spread":0.20737173524657854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020019218","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.0009711063,0.000039327777,0.9965347,0.0006759621,0.00032386134,0.0004351256,0.00042055533,0.00011283979,0.00048650557],"genre_scores_gemma":[0.74171054,0.00007797263,0.24971308,0.00010583919,0.000041360843,0.00023302471,0.00035164834,0.000020212517,0.007746312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879456,0.000017592614,0.00024475442,0.0004907201,0.00018576083,0.0002666368],"domain_scores_gemma":[0.99873644,0.000027902994,0.000047670743,0.0011068368,0.00002479374,0.000056360394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017122725,0.00013061719,0.00013378507,0.000164059,0.00013546516,0.00011514399,0.0011797666,0.000042265827,0.00010187136],"category_scores_gemma":[0.0000059428808,0.00013456892,0.00004975508,0.00043337583,0.000037481568,0.0016523506,0.000048936272,0.00011047081,0.00002637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002009726,0.00151823,0.0005702218,0.00005448457,0.000055415312,0.000026775775,0.002643368,0.00671412,0.00004590041,0.0062120617,0.0055185095,0.9766208],"study_design_scores_gemma":[0.0006354712,0.000027005834,0.0004029706,0.0000102368085,0.000027660593,0.0000022341458,0.00003143158,0.99372596,0.000061739825,0.00021725168,0.00469037,0.00016768332],"about_ca_topic_score_codex":0.00012708206,"about_ca_topic_score_gemma":0.00053039787,"teacher_disagreement_score":0.98701185,"about_ca_system_score_codex":0.000031831783,"about_ca_system_score_gemma":0.000014605511,"threshold_uncertainty_score":0.5487561},"labels":[],"label_agreement":null},{"id":"W2020493833","doi":"10.1145/1989323.1989390","title":"BE-tree","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":93,"is_retracted":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; Tree (set theory); Mathematics; Combinatorics","score_opus":0.06173774393611898,"score_gpt":0.22555230003446247,"score_spread":0.1638145560983435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020493833","genre_codex":"other","genre_gemma":"methods","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.000111614245,0.000003250144,0.4969133,0.00025002967,0.000113453585,0.000017311211,1.6706139e-7,0.00011315788,0.5024777],"genre_scores_gemma":[0.10844469,0.000008412688,0.8392987,0.0026417694,0.000057314108,0.000005457841,0.0000029811397,0.000004517378,0.04953611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968976,0.0000039959664,0.000039967028,0.00011279034,0.00006685532,0.000086632564],"domain_scores_gemma":[0.99964565,0.000003290454,0.000008004569,0.000311846,0.0000069128246,0.00002430657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058482692,0.000030806143,0.000025906445,0.000027217213,0.00002016991,0.000045990306,0.0006458277,0.0000065637955,0.00026308218],"category_scores_gemma":[0.0000020608754,0.000023836988,0.00001242863,0.00009533997,0.0000075328485,0.00053334987,0.00028839303,0.000015773592,0.00047664184],"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":[1.981663e-7,0.000021075048,0.00023488521,8.9177803e-7,0.0000037442398,0.0000087568405,0.00011899632,2.2684818e-8,0.0000082708675,0.78752077,0.041036215,0.17104617],"study_design_scores_gemma":[0.0005546322,0.00016441784,0.040144507,0.000006124927,0.00000868158,0.000006417101,0.00009073158,0.047524158,0.007423393,0.07293081,0.830592,0.0005541428],"about_ca_topic_score_codex":0.00002865104,"about_ca_topic_score_gemma":0.000007973335,"teacher_disagreement_score":0.7895558,"about_ca_system_score_codex":0.0000017821297,"about_ca_system_score_gemma":0.000002665495,"threshold_uncertainty_score":0.6126425},"labels":[],"label_agreement":null},{"id":"W2020603728","doi":"10.1007/s10796-014-9517-2","title":"Optimization of generic progressive queries based on dependency analysis and materialized views","year":2014,"lang":"en","type":"article","venue":"Information Systems Frontiers","topic":"Data Management and Algorithms","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":"IBM (Canada)","funders":"","keywords":"Materialized view; Computer science; Dependency (UML); Process (computing); Node (physics); Graph; Dependency graph; Set (abstract data type); Greedy algorithm; Data mining; Theoretical computer science; Database; Artificial intelligence; Algorithm; Database design; View","score_opus":0.008966254829263439,"score_gpt":0.2124387450631958,"score_spread":0.20347249023393235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020603728","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.00057761214,0.00004331109,0.9967778,0.000047861773,0.0005949081,0.00026768236,0.000012983284,0.0000624812,0.0016154042],"genre_scores_gemma":[0.63314646,0.00002282079,0.36589056,0.00024644638,0.000055307828,0.000117827236,0.00037187527,0.000007689153,0.00014102325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990105,0.00009202312,0.00040462174,0.00011551447,0.00027229544,0.00010505305],"domain_scores_gemma":[0.9990946,0.000011196577,0.00042471229,0.00033436803,0.00009649131,0.000038609087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064277,0.00009706927,0.00022959801,0.000473556,0.000062823645,0.0003783416,0.00027229785,0.000036209894,0.000004873952],"category_scores_gemma":[0.000026098402,0.00008128647,0.00004066356,0.00055320555,0.000025666766,0.0021327434,0.000056173758,0.000021550379,0.0000056297613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006297073,0.000053387226,0.0058362526,0.00059355574,0.00044174382,0.000001318902,0.0019215402,0.8540594,0.000019984387,0.018330233,0.007872038,0.11080759],"study_design_scores_gemma":[0.00031813388,0.000044400625,0.00047767503,0.000018989424,0.000037511305,3.9357874e-7,0.00009010447,0.9901002,0.00009046405,0.0000148421805,0.008713557,0.000093734314],"about_ca_topic_score_codex":0.000032263582,"about_ca_topic_score_gemma":5.680005e-7,"teacher_disagreement_score":0.63256884,"about_ca_system_score_codex":0.000018972121,"about_ca_system_score_gemma":0.0000137461275,"threshold_uncertainty_score":0.36483568},"labels":[],"label_agreement":null},{"id":"W2021494192","doi":"10.1145/1823854.1823873","title":"Synthesizing high fidelity 3D landscapes from GIS data","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Geospatial analysis; Computer science; Rendering (computer graphics); Fidelity; Digital elevation model; Semantics (computer science); Data mining; Information retrieval; Artificial intelligence; Remote sensing; Geography","score_opus":0.02568987498340746,"score_gpt":0.24922064976506833,"score_spread":0.22353077478166086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021494192","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.036481425,0.00003355031,0.9424398,0.0030102134,0.001610669,0.00011648126,0.00019543106,0.00055812486,0.015554325],"genre_scores_gemma":[0.38056344,0.000012256638,0.6176414,0.0004869834,0.00031544897,0.0000026351424,0.0002636276,0.000006203212,0.00070800364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898684,0.000017835699,0.00013371452,0.00048973283,0.00019338701,0.00017849445],"domain_scores_gemma":[0.9975559,0.00012160543,0.000038907663,0.002208652,0.000017904953,0.000057024514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003258619,0.00009015193,0.00009936311,0.00003737733,0.000081442864,0.00044328728,0.0032233929,0.000032013224,0.00046576976],"category_scores_gemma":[0.00007104033,0.000071108676,0.000015311693,0.00012477738,0.0000151299455,0.001740692,0.0022697686,0.00011868904,0.00034618384],"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.000002098699,0.00008875875,0.002113873,0.0000074165405,0.000052398744,0.000029124427,0.00006922139,0.000003111583,0.0016932724,0.06566483,0.06918791,0.861088],"study_design_scores_gemma":[0.00035479444,0.000017584694,0.022760853,0.000013819428,0.000024843333,0.000002037664,0.000035298453,0.56290597,0.0017212101,0.010635035,0.40104854,0.0004800085],"about_ca_topic_score_codex":0.0013243653,"about_ca_topic_score_gemma":0.00046110697,"teacher_disagreement_score":0.860608,"about_ca_system_score_codex":0.000002667954,"about_ca_system_score_gemma":0.00001243308,"threshold_uncertainty_score":0.59899193},"labels":[],"label_agreement":null},{"id":"W2021599742","doi":"10.1117/12.921043","title":"Simulation of large-scale multitarget tracking scenarios using GPUs","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Data Management and Algorithms","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; McMaster University","funders":"","keywords":"Computer science; Central processing unit; Throughput; Conjunction (astronomy); Scale (ratio); Graphics processing unit; Parallel computing; Path (computing); Computational science; Real-time computing; Computer hardware","score_opus":0.019638462857331028,"score_gpt":0.25820028110832594,"score_spread":0.2385618182509949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021599742","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.9830239,0.000102102225,0.015058539,0.0004101945,0.0004102268,0.00039576646,0.00003666435,0.00008102169,0.00048160093],"genre_scores_gemma":[0.6345946,0.000014605291,0.36494857,0.000047003567,0.0002976572,0.000018212359,0.0000063914777,0.000025891595,0.000047072663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978107,1.9845146e-8,0.00064445264,0.00032452753,0.0007325333,0.00048775072],"domain_scores_gemma":[0.9980712,0.000140305,0.00046247913,0.00008996748,0.0011212492,0.000114822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095841876,0.00025208373,0.00034544728,0.00013470325,0.00009481922,0.00013718761,0.0013741081,0.00012672847,0.000006905063],"category_scores_gemma":[0.00037351192,0.00022049734,0.00043605795,0.00043721404,0.000100909216,0.0025264763,0.0004344213,0.00020433377,0.0000013098734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432231,0.0005319921,0.0033423454,0.0007985545,0.0004867015,9.023177e-8,0.0015966726,0.014570595,0.39462698,0.5816724,0.00079257303,0.0015367927],"study_design_scores_gemma":[0.000690828,0.00008768915,0.00110435,0.00018317992,0.00008333097,0.0000028736192,0.0007014178,0.9449991,0.04989436,0.0004760502,0.0015168843,0.0002599233],"about_ca_topic_score_codex":0.0000074521868,"about_ca_topic_score_gemma":7.8761744e-8,"teacher_disagreement_score":0.9304285,"about_ca_system_score_codex":0.00010349774,"about_ca_system_score_gemma":0.000018201199,"threshold_uncertainty_score":0.89916205},"labels":[],"label_agreement":null},{"id":"W2022093457","doi":"10.1007/s10489-009-0206-7","title":"Integrating multi-objective genetic algorithm based clustering and data partitioning for skyline computation","year":2009,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":62,"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":"Skyline; Computer science; Cluster analysis; Data mining; Computation; Task (project management); Process (computing); Multi-objective optimization; Genetic algorithm; Algorithm; Machine learning","score_opus":0.05347847030860073,"score_gpt":0.3203052310956666,"score_spread":0.2668267607870659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022093457","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.00010828077,0.0000768791,0.99868226,0.000192216,0.00011998923,0.00046014774,0.000022746493,0.00014055814,0.00019690237],"genre_scores_gemma":[0.14512314,0.0000153115,0.85416365,0.0004384617,0.00006610017,0.000029220853,0.0001428815,0.000007064134,0.00001419008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986716,0.000017911838,0.00027591054,0.0006398204,0.00014677324,0.00024799598],"domain_scores_gemma":[0.999129,0.00014240795,0.00010894835,0.0004999018,0.000060905935,0.000058833153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035619395,0.00015470873,0.00014204961,0.00009403546,0.0002023463,0.00034090222,0.00084562204,0.000034277404,0.0000024406602],"category_scores_gemma":[0.000044293858,0.00015385539,0.000018965964,0.00026094634,0.000038469072,0.00053997384,0.00035879217,0.000094727315,0.000009133264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033762306,0.000038473372,0.000008405466,0.000011491375,0.0000069664616,0.0000018356476,0.00016589374,0.00459526,0.00014113403,0.0035163737,0.00006758875,0.9914432],"study_design_scores_gemma":[0.0001805155,0.00007900662,0.0005029312,0.00003093519,0.000009649216,0.0000021732808,0.00012212663,0.9924106,0.0016787013,0.004452493,0.00034476747,0.0001861028],"about_ca_topic_score_codex":0.000014088112,"about_ca_topic_score_gemma":0.0000112614825,"teacher_disagreement_score":0.9912571,"about_ca_system_score_codex":0.000022768716,"about_ca_system_score_gemma":0.000021502346,"threshold_uncertainty_score":0.6274041},"labels":[],"label_agreement":null},{"id":"W2022462411","doi":"10.1145/1071246.1071301","title":"Demo","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Object (grammar); Process (computing); Location-based service; Track (disk drive); Computer vision; Wireless; Truck; Video tracking; Tracking (education); Artificial intelligence; Human–computer interaction; Telecommunications; Engineering","score_opus":0.00933770523917123,"score_gpt":0.21795342594348346,"score_spread":0.20861572070431222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022462411","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.0001448808,0.000009855121,0.75796133,0.003612905,0.00005570317,0.000015583208,9.428967e-8,0.00013082633,0.2380688],"genre_scores_gemma":[0.106258206,0.000007428152,0.84048235,0.0030825364,0.00016251439,0.000002131799,0.0000015077813,0.0000020967766,0.050001208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997425,0.000002689464,0.00003440901,0.000087288776,0.00006025262,0.00007285694],"domain_scores_gemma":[0.9997598,0.000004299772,0.000005671039,0.00020674945,0.00000454305,0.000018968243],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000050998875,0.000022996648,0.000019375551,0.000020017971,0.000020124811,0.00008416447,0.00043698636,0.0000047934755,0.00008755265],"category_scores_gemma":[0.000001726196,0.000018106692,0.000009126301,0.00007935248,0.000003510975,0.00062010676,0.00017294407,0.00001333433,0.0011432973],"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":[3.6347668e-8,0.0000070636984,0.000030419948,2.725171e-7,0.0000011510299,8.6387746e-7,0.000009003762,0.00000390442,0.000007139664,0.2861367,0.041135475,0.672668],"study_design_scores_gemma":[0.000060331757,0.0000052166056,0.00046410214,4.80993e-7,4.4287145e-7,7.926998e-7,0.0000018676092,0.11321249,0.00039436805,0.001382676,0.8844304,0.000046849666],"about_ca_topic_score_codex":0.0000021126802,"about_ca_topic_score_gemma":0.0000025047798,"teacher_disagreement_score":0.8432949,"about_ca_system_score_codex":0.0000033357571,"about_ca_system_score_gemma":0.0000022231654,"threshold_uncertainty_score":0.99963444},"labels":[],"label_agreement":null},{"id":"W2022630997","doi":"10.1002/jgt.20560","title":"Disjoint Hamilton cycles in the random geometric graph","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Data Management and Algorithms","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","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Disjoint sets; Hamiltonian path; Pairwise comparison; Discrete mathematics; Line graph; Random graph; Graph","score_opus":0.025574762827060893,"score_gpt":0.22949837930324368,"score_spread":0.2039236164761828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022630997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2929801,0.0025330805,0.6924496,0.0004943372,0.0016036547,0.00028403403,0.000004420145,0.000040846535,0.009609882],"genre_scores_gemma":[0.99211526,0.00063403015,0.0066447966,0.00043721657,0.00011773317,0.0000033243157,8.261456e-7,0.0000045250135,0.000042269367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985845,0.00032260787,0.00038582628,0.00012883428,0.0003735237,0.00020471822],"domain_scores_gemma":[0.998974,0.0002908887,0.00028621385,0.00034876796,0.000050092378,0.000050000563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039282595,0.00010959319,0.00019438846,0.0008570942,0.000073175645,0.00012565944,0.001873777,0.00002752379,0.000021937023],"category_scores_gemma":[0.00006644569,0.000056135224,0.00020393936,0.0015328287,0.0000671127,0.00087452424,0.00011746144,0.00024165517,0.000008225667],"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.00040349094,0.0009352038,0.0058944887,0.000031374435,0.00024840294,0.0007451278,0.009217599,0.000021588863,0.0001579566,0.54601866,0.005077603,0.43124852],"study_design_scores_gemma":[0.0027397627,0.00041589647,0.14500104,0.000085016705,0.000060145027,0.00015903053,0.00091806584,0.00019720406,0.00047247924,0.8448657,0.0048002913,0.0002853583],"about_ca_topic_score_codex":0.000008716017,"about_ca_topic_score_gemma":0.000004871712,"teacher_disagreement_score":0.6991352,"about_ca_system_score_codex":0.000009035116,"about_ca_system_score_gemma":0.000011330677,"threshold_uncertainty_score":0.34819752},"labels":[],"label_agreement":null},{"id":"W2022902860","doi":"10.1145/1007568.1007621","title":"Incremental and effective data summarization for dynamic hierarchical clustering","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Automatic summarization; Computer science; Cluster analysis; Data mining; Merge (version control); Hierarchical clustering; Data stream clustering; CURE data clustering algorithm; Fuzzy clustering; Information retrieval; Artificial intelligence","score_opus":0.017484841954494672,"score_gpt":0.2759949414161231,"score_spread":0.2585100994616284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022902860","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.0034062031,0.000009992616,0.9949248,0.00063123304,0.00011369826,0.00035554264,0.000021007598,0.000076128264,0.00046139857],"genre_scores_gemma":[0.542189,0.000013550624,0.45699129,0.0002835257,0.00003749691,0.000024311317,0.00032993167,0.0000061645264,0.00012470732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941945,0.00001027087,0.000072244584,0.00030125465,0.00008211384,0.000114638045],"domain_scores_gemma":[0.9995477,0.000035779278,0.00001732303,0.0003601761,0.000008539085,0.000030471701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018822888,0.00005814074,0.000054663822,0.000046008332,0.00008054712,0.00018460341,0.0005572718,0.000014329731,0.0000015112852],"category_scores_gemma":[0.000018160663,0.000051217587,0.00000781905,0.00008813968,0.000019577585,0.0010841467,0.0014038988,0.000030603038,0.0000037843083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014564688,0.00007700621,0.00028510133,0.00006012314,0.00003983346,0.0000052494033,0.00015071432,0.00015985807,0.0008013375,0.1265038,0.00036287363,0.87153953],"study_design_scores_gemma":[0.0009773996,0.000097483295,0.0041548,0.0000131232655,0.0000069451967,0.0000031256302,0.000014221287,0.98529005,0.0001789123,0.007917391,0.0012253253,0.0001212144],"about_ca_topic_score_codex":0.000025980726,"about_ca_topic_score_gemma":0.000064032254,"teacher_disagreement_score":0.9851302,"about_ca_system_score_codex":0.00002280921,"about_ca_system_score_gemma":0.0000075305575,"threshold_uncertainty_score":0.20885926},"labels":[],"label_agreement":null},{"id":"W2023341057","doi":"10.1109/icdim.2009.5356774","title":"The mqr-tree: Improving upon a 2-dimensional spatial access method","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Tree (set theory); Computer science; R-tree; Node (physics); Access method; Set (abstract data type); Tree structure; Data mining; Algorithm; Spatial database; Spatial analysis; Mathematics; Binary tree; Statistics; Database","score_opus":0.01817071787777646,"score_gpt":0.3017663965670973,"score_spread":0.28359567868932084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023341057","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.00026119992,0.00004165794,0.9821778,0.0063456288,0.00041199467,0.00012135964,7.856789e-7,0.00016304686,0.010476521],"genre_scores_gemma":[0.13934565,0.00001805095,0.84620696,0.0053376653,0.00052623486,0.000014531843,0.000013821194,0.00001133924,0.008525726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989156,0.000054494474,0.00014801012,0.00031300285,0.0003055201,0.00026338844],"domain_scores_gemma":[0.9991935,0.00011432412,0.000056339322,0.0005455431,0.000036033496,0.00005425779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005850769,0.000100680256,0.00007944762,0.000049337323,0.00026894276,0.00096844084,0.0017703621,0.000021882674,0.000025064044],"category_scores_gemma":[0.000031211555,0.000060694765,0.000044623892,0.00023397327,0.000011149897,0.0011827945,0.0007665936,0.00008577571,0.00005050381],"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.0000026255907,0.000018214809,0.000007588642,8.6747406e-7,0.0000049488126,0.000006690226,0.00001116512,0.000026432363,0.00017619302,0.046172943,0.0052666115,0.9483057],"study_design_scores_gemma":[0.00030105413,0.00008645775,0.0049352627,0.000004669678,0.000007041518,0.0000055065116,0.0000062908907,0.9470943,0.0021268188,0.014397613,0.030838598,0.00019637302],"about_ca_topic_score_codex":0.00017163428,"about_ca_topic_score_gemma":0.00008278701,"teacher_disagreement_score":0.9481093,"about_ca_system_score_codex":0.000013805378,"about_ca_system_score_gemma":0.0000257928,"threshold_uncertainty_score":0.9338697},"labels":[],"label_agreement":null},{"id":"W2023635708","doi":"10.1145/1183471.1183499","title":"Object localization based on directional information case of 2D vector data","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Object (grammar); Raster graphics; Object-based spatial database; Raster data; Computer science; Computation; Spatial analysis; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Spatial database; Geometry","score_opus":0.016382066334276288,"score_gpt":0.23921244194220573,"score_spread":0.22283037560792945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023635708","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.00022383247,0.0000019936238,0.98277795,0.00013305595,0.00017482933,0.00007492316,0.000043280994,0.00008328531,0.016486825],"genre_scores_gemma":[0.9297289,0.000001164712,0.06768987,0.00050000177,0.00008439817,0.000004747734,0.001625593,0.000003413299,0.00036185473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.000016085789,0.00014774466,0.00012171378,0.00017001678,0.00006856392],"domain_scores_gemma":[0.9993319,0.00003124142,0.000059615926,0.00052326237,0.000041772168,0.000012219585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017149614,0.000049866754,0.00004627321,0.0001146252,0.000049351915,0.000102841914,0.0003784196,0.000014555548,0.000033306827],"category_scores_gemma":[0.000019107472,0.000042889922,0.000011404192,0.0002977671,0.000010814468,0.002054314,0.00015513368,0.000020988267,0.00003596732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029099445,0.00056042057,0.0015559105,0.00013409881,0.000030490482,0.00011077266,0.00009862995,0.058143765,0.0000767122,0.35827926,0.26550236,0.31547847],"study_design_scores_gemma":[0.00017537664,0.000026528825,0.00087250787,0.00000476666,0.0000027279896,0.0000062240865,0.0000051242723,0.984861,0.00060255016,0.00017214492,0.013215108,0.00005594054],"about_ca_topic_score_codex":0.00049453985,"about_ca_topic_score_gemma":0.00006433808,"teacher_disagreement_score":0.9295051,"about_ca_system_score_codex":0.000012985365,"about_ca_system_score_gemma":0.000019804955,"threshold_uncertainty_score":0.17490003},"labels":[],"label_agreement":null},{"id":"W2023889025","doi":"10.2316/journal.206.2013.4.206-3702","title":"SUBDIVISION-BASED CORRIDOR MAP METHOD FOR PATH PLANNING","year":2013,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Data Management and Algorithms","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":"Subdivision; Path (computing); Computer science; Geography; Archaeology; Computer network","score_opus":0.01748591853544828,"score_gpt":0.3005014314257354,"score_spread":0.2830155128902871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023889025","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.0012077361,0.000044726952,0.99388635,0.0036177773,0.0010871796,0.00008976927,0.0000037954642,0.000019017114,0.000043621756],"genre_scores_gemma":[0.1555584,0.0000059431572,0.843719,0.0004274587,0.00018647421,0.0000036770257,0.000015441861,0.0000046457694,0.00007892344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926376,0.000020437852,0.00025861477,0.00008968235,0.00028904693,0.000078444406],"domain_scores_gemma":[0.9990706,0.0001532067,0.00028277008,0.00007320005,0.00037790212,0.000042334035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596765,0.00006204982,0.00008856562,0.00016176433,0.000043106807,0.00042942344,0.0004357979,0.000020700874,0.000008913584],"category_scores_gemma":[0.000055790835,0.000050688446,0.000046149766,0.000046950547,0.000008078332,0.0008590608,0.00006797863,0.00004983921,0.000005478753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021927975,0.00018453678,0.0018798257,0.000057872738,0.00019526976,0.0000365835,0.00037140617,0.106878266,0.0007419038,0.14897865,0.03524932,0.70540446],"study_design_scores_gemma":[0.00044924035,0.00007367699,0.0036960377,0.00006644731,0.000007270022,0.000010509535,0.00001679341,0.98531586,0.00015058988,0.007964189,0.0021889538,0.00006042174],"about_ca_topic_score_codex":0.0000049120536,"about_ca_topic_score_gemma":1.02657616e-7,"teacher_disagreement_score":0.8784376,"about_ca_system_score_codex":0.000021692787,"about_ca_system_score_gemma":0.000025831601,"threshold_uncertainty_score":0.414094},"labels":[],"label_agreement":null},{"id":"W2024336226","doi":"10.1007/s00778-006-0015-0","title":"Histograms based on the minimum description length principle","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":16,"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 Toronto; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Histogram; Computer science; Data mining; Set (abstract data type); Representation (politics); Overhead (engineering); Online analytical processing; Data set; Algorithm; Pattern recognition (psychology); Artificial intelligence; Image (mathematics); Data warehouse","score_opus":0.023451583210226296,"score_gpt":0.22292722325460765,"score_spread":0.19947564004438134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024336226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03660053,0.00012438398,0.91961765,0.025189443,0.0015530981,0.00023273939,0.0000026558178,0.00011808909,0.016561415],"genre_scores_gemma":[0.98314613,0.000015839181,0.010037646,0.0020711937,0.00075162196,0.000008051918,0.00000420153,0.000011377466,0.0039539444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896365,0.00012528732,0.00016912355,0.00013257762,0.00038233175,0.00022699857],"domain_scores_gemma":[0.99921286,0.00007748162,0.00012161638,0.0005186553,0.00003463183,0.000034731664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063981,0.000094649775,0.000065537024,0.00006663921,0.00050259434,0.0006620637,0.0013975977,0.00001756113,0.000046893903],"category_scores_gemma":[0.000020078425,0.000046132744,0.000071976,0.00023337282,0.000049878618,0.00038374026,0.00013133345,0.00023863246,0.0000995493],"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.000053361076,0.0006412743,0.0012961057,0.000012645572,0.00006431521,0.00012821527,0.0004837118,0.005667223,0.0012823993,0.37594196,0.34471676,0.26971203],"study_design_scores_gemma":[0.0005922371,0.0001784756,0.0080949385,0.000038033395,0.000022120983,0.000054836175,0.00004914692,0.52347285,0.00034715375,0.018314531,0.44861725,0.00021845744],"about_ca_topic_score_codex":0.000019859619,"about_ca_topic_score_gemma":0.000006544608,"teacher_disagreement_score":0.9465456,"about_ca_system_score_codex":0.000051020583,"about_ca_system_score_gemma":0.000027462775,"threshold_uncertainty_score":0.6384296},"labels":[],"label_agreement":null},{"id":"W2024430332","doi":"10.3138/2773-q553-0483-np77","title":"Modular Web-Based Atlas Information Systems","year":2006,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"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; Modular design; Personalization; Architecture; World Wide Web; Locality; Software engineering; Modularity (biology); Operating system","score_opus":0.006343791936389476,"score_gpt":0.2345362390868176,"score_spread":0.2281924471504281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024430332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010101062,0.00018116468,0.9820066,0.0031076216,0.0028872606,0.00056826766,0.00007220464,0.00017138256,0.000904434],"genre_scores_gemma":[0.99258316,0.00037141802,0.002749068,0.0022164413,0.00041993993,0.00011895552,0.0014629107,0.000009933545,0.000068154564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812996,0.000057316443,0.0007343683,0.00012464183,0.0007060467,0.00024763495],"domain_scores_gemma":[0.9978963,0.000080916914,0.00056454435,0.0002502108,0.0011352696,0.00007275221],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010673393,0.00018267246,0.0001313094,0.0011778743,0.00060708664,0.003363232,0.000976878,0.00008354655,0.0000048695747],"category_scores_gemma":[0.0000691126,0.00013815843,0.00016052554,0.0006936473,0.00008282568,0.0068691294,0.00012277934,0.00014726954,0.000011546412],"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.000052240423,0.000055373497,0.004309517,0.000062769184,0.00014269202,0.0000014954913,0.00023841769,0.018287642,0.000045285247,0.9330687,0.015311437,0.028424466],"study_design_scores_gemma":[0.0010857496,0.000054252356,0.0034389612,0.000029271423,0.000020720474,0.00003796946,0.00010994346,0.516843,0.000020175103,0.0041408576,0.4740551,0.00016397744],"about_ca_topic_score_codex":0.00009259383,"about_ca_topic_score_gemma":0.000010695792,"teacher_disagreement_score":0.98248214,"about_ca_system_score_codex":0.000029695639,"about_ca_system_score_gemma":0.00006698106,"threshold_uncertainty_score":0.99767137},"labels":[],"label_agreement":null},{"id":"W2024437575","doi":"10.1155/asp/2006/49073","title":"Information Mining from Multimedia Databases","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Data Management and Algorithms","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; Multimedia; Database; Information retrieval; World Wide Web","score_opus":0.016361785347271725,"score_gpt":0.27678843063447334,"score_spread":0.2604266452872016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024437575","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.011121497,0.002207742,0.9808911,0.00025215212,0.0004316696,0.000072890754,0.00001107164,0.000081271624,0.0049306164],"genre_scores_gemma":[0.6545293,0.0002038766,0.34384382,0.00063056196,0.0006435205,0.0000049087716,0.00007334727,0.00001088657,0.000059801274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857014,0.000049722934,0.000459396,0.00017163603,0.0004742857,0.00027482572],"domain_scores_gemma":[0.9992423,0.00013139728,0.00034945874,0.00015512624,0.0000628674,0.00005885111],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037174256,0.00015091829,0.00014670813,0.00028878587,0.00020002492,0.0007278951,0.000675293,0.000019995667,0.000026054628],"category_scores_gemma":[0.00004635027,0.00012904739,0.000031480686,0.00042738518,0.000033994213,0.0155738965,0.00012914614,0.0002615463,0.0000427836],"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.000014478021,0.000048574653,0.0020405997,0.000013619893,0.000002159964,0.000053587482,0.00021818082,0.0034655528,0.000064965105,0.00052708975,0.0004272878,0.9931239],"study_design_scores_gemma":[0.0026444616,0.00018986838,0.01330216,0.0013661371,0.000015371661,0.00007678837,0.0008380755,0.736189,0.0022222921,0.011369171,0.23090029,0.00088640704],"about_ca_topic_score_codex":0.0000105489735,"about_ca_topic_score_gemma":0.0000079557,"teacher_disagreement_score":0.9922375,"about_ca_system_score_codex":0.00005224881,"about_ca_system_score_gemma":0.000042477062,"threshold_uncertainty_score":0.99819475},"labels":[],"label_agreement":null},{"id":"W2024678590","doi":"10.1145/602421.602453","title":"Use of the SAND spatial browser for digital government applications","year":2003,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Interface (matter); Spatial analysis; World Wide Web; The Internet; Information retrieval; Web browser; Spatial data infrastructure; Agency (philosophy); Remote sensing; Geography","score_opus":0.06115913605671689,"score_gpt":0.2656214992029471,"score_spread":0.2044623631462302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024678590","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.006141207,0.00043709585,0.9071463,0.06390684,0.0004326601,0.0034649917,0.00072053145,0.00007375419,0.017676666],"genre_scores_gemma":[0.7550055,0.000045617784,0.2437507,0.00014414468,0.000008887473,0.00013774332,0.00000891983,0.0000058881005,0.0008926239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947494,0.00004233437,0.00016113634,0.000090646114,0.00016189157,0.000069020316],"domain_scores_gemma":[0.9790797,0.00026776383,0.00015457717,0.02043418,0.000051410596,0.000012344112],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00012941568,0.00004861488,0.00006201225,0.0000100142115,0.00018390278,0.00007904116,0.019928422,0.00001199012,0.000001357323],"category_scores_gemma":[0.0012144883,0.000030696647,0.00007736906,0.00020051445,0.00013357282,0.00032858978,0.011795366,0.000046281613,0.0000021675646],"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.000004941932,0.0007427868,0.0079109855,0.00004322639,0.00012661763,1.4794435e-8,0.00036530825,0.00016235164,0.0011195623,0.82843363,0.062151533,0.09893907],"study_design_scores_gemma":[0.00036736167,0.00002624337,0.013912459,0.000038615013,0.00004648906,0.0000010158014,0.000056264133,0.007321951,0.009930844,0.11219185,0.85595703,0.00014987054],"about_ca_topic_score_codex":0.000013531157,"about_ca_topic_score_gemma":0.000011892616,"teacher_disagreement_score":0.7938055,"about_ca_system_score_codex":0.000016734657,"about_ca_system_score_gemma":0.000020755559,"threshold_uncertainty_score":0.99619704},"labels":[],"label_agreement":null},{"id":"W2025155398","doi":"10.1016/j.datak.2009.10.001","title":"Skyline queries with constraints: Integrating skyline and traditional query operators","year":2009,"lang":"en","type":"article","venue":"Data & Knowledge Engineering","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Skyline; Computer science; Pruning; Class (philosophy); Space (punctuation); Operator (biology); Database; Computation; Information retrieval; Data mining; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.027096740140654725,"score_gpt":0.23442299360009852,"score_spread":0.2073262534594438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025155398","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.0030807725,0.00059033884,0.99320185,0.00045973842,0.00028127333,0.00013776816,0.00025567508,0.0003344732,0.001658136],"genre_scores_gemma":[0.25622475,0.00010808918,0.74036884,0.000253862,0.0006895861,0.00001555769,0.0020993978,0.00003117584,0.00020873712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998889,0.00001512692,0.00021296977,0.0004796399,0.00014702673,0.00025618522],"domain_scores_gemma":[0.9990953,0.00007184409,0.00003580853,0.00064642925,0.00004592728,0.00010467745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003073956,0.00020863363,0.00018410753,0.0001378957,0.00009571339,0.0003540949,0.00097583025,0.000034405446,0.00001554127],"category_scores_gemma":[0.00008187606,0.00017580668,0.000014560957,0.00034033132,0.000063260464,0.0021840166,0.00036381307,0.00016657398,0.000010105253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054474717,0.00015517803,0.000119232995,0.00007108259,0.00007234331,0.00007777423,0.00052432035,0.00008383017,0.0006018363,0.27365872,0.0057377187,0.7188925],"study_design_scores_gemma":[0.00044495863,0.000118150594,0.0011054002,0.00016627103,0.000014641643,0.000055877503,0.00009188385,0.96962327,0.00023560553,0.00013103483,0.027638927,0.00037397473],"about_ca_topic_score_codex":0.0000036978965,"about_ca_topic_score_gemma":0.000014255083,"teacher_disagreement_score":0.96953946,"about_ca_system_score_codex":0.000020859288,"about_ca_system_score_gemma":0.000044921882,"threshold_uncertainty_score":0.7169188},"labels":[],"label_agreement":null},{"id":"W2025204875","doi":"10.1109/geoinformatics.2012.6270345","title":"Mobile spatial interaction in the Future Internet of Things","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Institut National de la Recherche Scientifique; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Mobile device; Information overload; Personalization; Spatial contextual awareness; Context (archaeology); Mobile computing; Location-based service; Field (mathematics); The Internet; Clutter; World Wide Web; Human–computer interaction; Radar; Artificial intelligence; Telecommunications","score_opus":0.011242580864961762,"score_gpt":0.24966229524987027,"score_spread":0.2384197143849085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025204875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037125077,0.00011087572,0.9200566,0.00066624384,0.0020561754,0.00023155342,5.519157e-7,0.00005665737,0.039696302],"genre_scores_gemma":[0.9891035,0.000008337852,0.00976831,0.0004229212,0.00015805676,0.000008074524,0.0000035258024,0.0000013457502,0.0005259139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99961156,0.000028055107,0.00008863919,0.00007194395,0.00010694337,0.000092872266],"domain_scores_gemma":[0.99971837,0.000017652555,0.00003502038,0.00021029051,0.000007698786,0.000010944097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028253495,0.00003886344,0.000042143147,0.000045313715,0.000008508859,0.00005305082,0.0005773918,0.000012935334,0.00005387516],"category_scores_gemma":[0.0000027034364,0.000022971208,0.000017677768,0.000119386044,0.000007538171,0.0015028964,0.0001909283,0.000063327134,0.000035320125],"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.000004939977,0.00023432879,0.003723243,0.000015246501,0.000010412205,0.0000019744753,0.016329873,0.0000026817784,0.00008798172,0.12526369,0.02201713,0.8323085],"study_design_scores_gemma":[0.0006820148,0.0003533886,0.030643208,0.00004338159,0.000012177725,0.000016812852,0.006030045,0.18586624,0.0049442137,0.0022565806,0.7687912,0.0003607627],"about_ca_topic_score_codex":0.0002176247,"about_ca_topic_score_gemma":0.000018311153,"teacher_disagreement_score":0.95197845,"about_ca_system_score_codex":0.0000064058036,"about_ca_system_score_gemma":0.0000019392003,"threshold_uncertainty_score":0.10895637},"labels":[],"label_agreement":null},{"id":"W2025419780","doi":"10.1109/fskd.2010.5569645","title":"Top-k ranking for uncertain data","year":2010,"lang":"en","type":"article","venue":"2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery","topic":"Data Management and Algorithms","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":"Ranking (information retrieval); Semantics (computer science); Rank (graph theory); Computer science; Uncertain data; Dimension (graph theory); Information retrieval; Data mining; Space (punctuation); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.08575587457417934,"score_gpt":0.3355655237190078,"score_spread":0.24980964914482845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025419780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027084218,0.0006197947,0.69661325,0.0054953783,0.057821814,0.0021515088,0.0020718172,0.00036436087,0.20777787],"genre_scores_gemma":[0.97438234,0.000065665045,0.0035318527,0.00010363524,0.000942913,0.00007937372,0.00052911916,0.000015379905,0.020349734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985204,0.000035350047,0.00028327064,0.00065179035,0.00026688195,0.00024233868],"domain_scores_gemma":[0.9986123,0.00010725806,0.00013766052,0.0008861783,0.00017426797,0.00008234791],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066369906,0.00018651603,0.00018964421,0.00015673383,0.00014751611,0.0014226341,0.0021766236,0.000071051225,0.000017919923],"category_scores_gemma":[0.00008426239,0.00015707512,0.000046092286,0.000096271506,0.00005260612,0.0020821765,0.00089484005,0.00018883798,0.000051928353],"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.000016104623,0.000096631484,0.0002686007,0.000047822607,0.000056565936,0.000003866427,0.0001369226,0.0000038987014,0.00036774232,0.9608534,0.0105292015,0.027619218],"study_design_scores_gemma":[0.0016423677,0.00015789607,0.0013140241,0.00031711138,0.000027781316,0.000023240427,0.00040917838,0.6990424,0.00014958177,0.017338783,0.27887973,0.0006979396],"about_ca_topic_score_codex":0.000095059426,"about_ca_topic_score_gemma":0.00013367627,"teacher_disagreement_score":0.9472981,"about_ca_system_score_codex":0.000019049228,"about_ca_system_score_gemma":0.00011086771,"threshold_uncertainty_score":0.999614},"labels":[],"label_agreement":null},{"id":"W2025843016","doi":"10.1145/2675743.2776761","title":"High performance stream queries in scala","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Scala; Latency (audio); Stream processing; Process (computing); Throughput; Data stream; Streaming data; Distributed computing; Data mining; Operating system; Wireless","score_opus":0.021590480583114385,"score_gpt":0.22539422125214284,"score_spread":0.20380374066902845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025843016","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.6899531,0.000056659293,0.19677289,0.0031817884,0.0010990299,0.00019829451,0.0000024246099,0.0004723802,0.108263426],"genre_scores_gemma":[0.92969584,0.000012378535,0.06468738,0.00021300219,0.00003842195,0.0000030495855,0.000004754197,0.000002525206,0.0053426167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994801,0.000009673536,0.00008351194,0.00015124073,0.00013850725,0.00013696782],"domain_scores_gemma":[0.99963254,0.0000065776107,0.000014717262,0.00028553314,0.000016830834,0.00004377692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017021017,0.00005323702,0.00005876262,0.00006313765,0.000016617541,0.00011984354,0.00052237394,0.000012409567,0.000013580937],"category_scores_gemma":[0.0000074280447,0.000042629417,0.0000069493353,0.00023424225,0.000016701131,0.0012560635,0.0003151451,0.0000357655,0.00018074835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053607637,0.00011748694,0.024724044,0.000015305097,0.000007032978,0.000027699243,0.0004481047,0.00037973534,0.0000075418807,0.4192508,0.035629332,0.5193876],"study_design_scores_gemma":[0.0023669917,0.00045506682,0.13741556,0.00005369896,0.0000048744523,0.000008666156,0.0004319072,0.70950055,0.0045624333,0.016432224,0.1279115,0.00085651065],"about_ca_topic_score_codex":0.00014345095,"about_ca_topic_score_gemma":0.000030787094,"teacher_disagreement_score":0.70912087,"about_ca_system_score_codex":0.000015155344,"about_ca_system_score_gemma":0.000017362798,"threshold_uncertainty_score":0.23232146},"labels":[],"label_agreement":null},{"id":"W2026730210","doi":"10.1145/362084.362104","title":"Generating spatiotemporal datasets on the WWW","year":2000,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":54,"is_retracted":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":"Financiadora de Estudos e Projetos; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computer science; Search engine indexing; Data mining; Information retrieval; Interface (matter); Database; Operating system","score_opus":0.031612334944660654,"score_gpt":0.2537045766043308,"score_spread":0.22209224165967018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026730210","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6059836,0.00026455254,0.25837797,0.07071173,0.004541916,0.0018851178,0.0004608115,0.0014699408,0.056304358],"genre_scores_gemma":[0.37618166,0.00037332275,0.5552338,0.02823809,0.0029261555,0.00016355033,0.0015394377,0.00008677708,0.035257228],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901193,0.00006371942,0.00015205459,0.00034054279,0.00021687098,0.00021489784],"domain_scores_gemma":[0.9981888,0.00012281457,0.000047916463,0.0015897664,0.000009720684,0.000040980147],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030221412,0.00011273538,0.00008337827,0.000036172398,0.000211668,0.00032137387,0.0021140622,0.000024456613,0.00056916295],"category_scores_gemma":[0.0000628488,0.00007496291,0.000033996206,0.00021609833,0.000021926679,0.0005853166,0.0004157474,0.000115622424,0.0010797435],"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.0000021187648,0.00002351102,0.00008806538,0.0000015979722,0.000008268771,0.000011191894,0.000029123536,0.00004800066,0.000027271935,0.0034747103,0.12628557,0.8700006],"study_design_scores_gemma":[0.00022281228,0.00012639769,0.00052592636,0.000019379951,0.0000057424327,0.0000029459195,0.000009292813,0.22672668,0.00043956467,0.0039631105,0.76770097,0.0002571773],"about_ca_topic_score_codex":0.000087961365,"about_ca_topic_score_gemma":0.000023945599,"teacher_disagreement_score":0.8697434,"about_ca_system_score_codex":0.000011691271,"about_ca_system_score_gemma":0.000012681424,"threshold_uncertainty_score":0.99969804},"labels":[],"label_agreement":null},{"id":"W2026808466","doi":"10.1007/s00778-010-0196-4","title":"Ranking queries on uncertain data","year":2010,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"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":"Ranking (information retrieval); Uncertain data; Rank (graph theory); Computer science; Set (abstract data type); Probabilistic logic; Data mining; Ranking SVM; Information retrieval; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.05671574245012417,"score_gpt":0.29787606197723465,"score_spread":0.24116031952711048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026808466","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.045520578,0.0002550732,0.86423314,0.054775015,0.010523404,0.0002549137,0.000027259182,0.00026483278,0.024145769],"genre_scores_gemma":[0.82687265,0.0003528732,0.15672626,0.006223842,0.0050596963,0.000004970337,0.00003658857,0.00003576325,0.004687391],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999206,0.000049330098,0.00012004464,0.00015634815,0.00028180526,0.00018648797],"domain_scores_gemma":[0.998611,0.000071710216,0.000079550744,0.0011690425,0.00002219071,0.000046541412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013032828,0.0000724418,0.00006386697,0.00005533796,0.00037783533,0.00079836923,0.004017516,0.000016080743,0.000066790475],"category_scores_gemma":[0.00006720414,0.000041046933,0.000022652152,0.00015420228,0.000049360046,0.0010523899,0.00086597144,0.00043990294,0.00010278594],"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.000009602906,0.000040151423,0.00014850708,0.0000029547646,0.000038252332,0.00007906924,0.0004358894,0.00004675603,0.00044844535,0.15740053,0.062124096,0.77922577],"study_design_scores_gemma":[0.00052582246,0.000082365244,0.0016149159,0.000034515615,0.000017009594,0.0003225796,0.00010546843,0.07833266,0.00037742392,0.032842983,0.8854977,0.00024653666],"about_ca_topic_score_codex":0.000010591588,"about_ca_topic_score_gemma":0.000014229257,"teacher_disagreement_score":0.8233736,"about_ca_system_score_codex":0.0000056196095,"about_ca_system_score_gemma":0.000029937342,"threshold_uncertainty_score":0.76986927},"labels":[],"label_agreement":null},{"id":"W2027088687","doi":"10.5539/cis.v2n1p115","title":"A Study On Query Optimization for Federated Database Systems","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Data Management and Algorithms","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; Database; Information retrieval; View; Sargable; Web search query; Database design; Search engine","score_opus":0.027325869938409148,"score_gpt":0.276357045068118,"score_spread":0.24903117512970882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027088687","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.002914931,0.0000050968465,0.99461186,0.00024732325,0.00048818512,0.00056436664,0.000006156431,0.00011137089,0.0010507324],"genre_scores_gemma":[0.8393218,0.000014042125,0.15780279,0.0026180232,0.000107399144,0.000033114986,0.00006750915,0.0000023804055,0.000032968106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999055,0.000014648513,0.00022376626,0.00021268436,0.00032315697,0.00017074066],"domain_scores_gemma":[0.99934804,0.000026845082,0.00008797206,0.00029186957,0.00017575716,0.000069520545],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0007170546,0.000086650885,0.00008387733,0.00029784613,0.00043647893,0.0022917057,0.00056927174,0.000011907547,5.230121e-7],"category_scores_gemma":[0.000023539078,0.00007165518,0.000010972836,0.0006511058,0.000035990488,0.015453713,0.00017254094,0.000035507644,0.000011124889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026194402,0.00037572073,0.00013582663,0.000048039677,0.00001350783,0.000004214771,0.0040905755,0.097120315,0.000037805512,0.30726653,0.009310615,0.5815707],"study_design_scores_gemma":[0.00041721796,0.00039862056,0.0016758001,0.000013813166,0.0000016130607,0.0000029569362,0.000101368474,0.9953776,0.000027006956,0.000032089756,0.0018507628,0.00010114401],"about_ca_topic_score_codex":0.0000023146354,"about_ca_topic_score_gemma":5.9242133e-8,"teacher_disagreement_score":0.8982573,"about_ca_system_score_codex":0.000019964753,"about_ca_system_score_gemma":0.000038239286,"threshold_uncertainty_score":0.998744},"labels":[],"label_agreement":null},{"id":"W2028102160","doi":"10.1016/s0167-8655(02)00115-0","title":"Logic-oriented fuzzy clustering","year":2002,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Correlation clustering; Constrained clustering; CURE data clustering algorithm; Fuzzy logic; Canopy clustering algorithm; Data mining; Mathematics; FLAME clustering; Single-linkage clustering; Computer science; Algorithm; Data stream clustering; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science","score_opus":0.044132254754598435,"score_gpt":0.22689990083145775,"score_spread":0.1827676460768593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028102160","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.011910487,0.000018008512,0.9714358,0.010451682,0.0008392298,0.00015408122,0.00001582356,0.00033404265,0.0048408317],"genre_scores_gemma":[0.7917745,0.00013410032,0.10166977,0.10395362,0.0010632755,0.00014841034,0.00032971124,0.000058756832,0.0008678562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883646,0.000048614496,0.00019307669,0.00038991947,0.00022924588,0.00030266846],"domain_scores_gemma":[0.9994307,0.000029246416,0.00007848111,0.0003652428,0.00002702851,0.00006929462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011991396,0.00014141388,0.00010506487,0.0001466108,0.00010489327,0.00022721868,0.0004951914,0.000027401318,0.0003696255],"category_scores_gemma":[0.000011383443,0.00014116763,0.000059150505,0.00025106507,0.00002483328,0.0009365074,0.00026267453,0.00010793068,0.0024884283],"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.0000010049544,0.000059773058,0.0006410738,0.000022036265,0.000023279099,0.00009125426,0.00021407969,0.00001365162,0.00048537404,0.00006954951,0.023493517,0.9748854],"study_design_scores_gemma":[0.0055888104,0.00036000926,0.014415017,0.00043039906,0.00010190436,0.0002034168,0.00020352364,0.84367573,0.0031794442,0.003531468,0.12482645,0.0034838272],"about_ca_topic_score_codex":0.000011615507,"about_ca_topic_score_gemma":0.0000049680943,"teacher_disagreement_score":0.9714016,"about_ca_system_score_codex":0.000025759246,"about_ca_system_score_gemma":9.744724e-7,"threshold_uncertainty_score":0.9982883},"labels":[],"label_agreement":null},{"id":"W2028295384","doi":"10.1109/icde.2010.5447757","title":"MashRank: Towards uncertainty-aware and rank-aware mashups","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Mashup; Computer science; Ranking (information retrieval); Probabilistic logic; Rank (graph theory); Information retrieval; Set (abstract data type); Web application; World Wide Web; Class (philosophy); Data mining; Web service; Data science; Artificial intelligence; Mathematics; Web modeling; Programming language","score_opus":0.008734477333093486,"score_gpt":0.23043501417259163,"score_spread":0.22170053683949814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028295384","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.01502488,0.000051443098,0.9298642,0.009009963,0.0025548788,0.0004115978,0.000023537588,0.00082993926,0.042229556],"genre_scores_gemma":[0.8959959,0.00007869008,0.078907646,0.0024422342,0.00038329742,0.00003162415,0.00005869915,0.000026356685,0.022075528],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876314,0.000020125019,0.00016173496,0.00046927138,0.00027021908,0.00031550616],"domain_scores_gemma":[0.9990173,0.00003118286,0.000039213013,0.0007267793,0.000052730073,0.00013281911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028407937,0.00016526708,0.00015061024,0.00010124296,0.00013484286,0.00046063855,0.0010125431,0.00006245388,0.00031736953],"category_scores_gemma":[0.000016122644,0.00013162625,0.00004363319,0.00025767894,0.00006598011,0.0009192561,0.0007563926,0.00019681311,0.00014048255],"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.0000066435578,0.00007314916,0.001076177,0.000051157745,0.000041404768,0.00006802743,0.0003056951,0.0000106786965,0.00025203128,0.17072147,0.040878974,0.7865146],"study_design_scores_gemma":[0.002104033,0.00015277577,0.010955526,0.000029780018,0.00003204793,0.000049916303,0.00027720633,0.39858064,0.0009770558,0.013944851,0.57179385,0.0011023226],"about_ca_topic_score_codex":0.0001394897,"about_ca_topic_score_gemma":0.00011682399,"teacher_disagreement_score":0.8809711,"about_ca_system_score_codex":0.000007556024,"about_ca_system_score_gemma":0.000030410922,"threshold_uncertainty_score":0.5367562},"labels":[],"label_agreement":null},{"id":"W2028642351","doi":"10.1016/j.cor.2005.02.040","title":"Road network monitoring: algorithms and a case study","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":38,"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; Group for Research in Decision Analysis","funders":"Ministère des Transports","keywords":"Computer science; Schedule; Global Positioning System; Algorithm; TRACE (psycholinguistics); Plan (archaeology); Interurban; Class (philosophy); Operations research; Flow network; Christian ministry; Real-time computing; Transport engineering; Telecommunications; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.11001924702025198,"score_gpt":0.40173843069173426,"score_spread":0.2917191836714823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028642351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31931308,0.00055188447,0.6744173,0.0028220592,0.00080452417,0.0012667413,0.000003064735,0.0002607848,0.00056056824],"genre_scores_gemma":[0.740689,0.000052942007,0.25696462,0.000066196524,0.0011746486,0.000097337834,0.0000046456234,0.000012520958,0.0009380631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977059,0.0003164338,0.00024979663,0.0006163995,0.00056758034,0.0005439206],"domain_scores_gemma":[0.9986157,0.000111914305,0.000013218897,0.00084231276,0.00022602774,0.00019083657],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001550799,0.00014565681,0.00014985714,0.00028348624,0.0011513307,0.00196086,0.0010142605,0.000035120425,0.000008198318],"category_scores_gemma":[0.00002573538,0.00013721766,0.00002695188,0.0010476853,0.00008560957,0.0014433499,0.0017675534,0.00033244182,0.00009215118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016814,0.00032616532,0.0010317942,0.000004552735,0.00004590218,0.0012289936,0.002372777,0.010596289,0.0000072515063,0.0020969734,0.0057580317,0.9765296],"study_design_scores_gemma":[0.0005649529,0.00028128954,0.001970291,0.000016115042,0.000005124829,0.0003287094,0.0009255919,0.98670137,0.000023650351,0.000054920063,0.008925915,0.0002020577],"about_ca_topic_score_codex":0.00051411375,"about_ca_topic_score_gemma":0.00015912313,"teacher_disagreement_score":0.97632754,"about_ca_system_score_codex":0.000064533146,"about_ca_system_score_gemma":0.00006237002,"threshold_uncertainty_score":0.9990752},"labels":[],"label_agreement":null},{"id":"W2028769163","doi":"10.1145/1044731.1044733","title":"Determining approximate shortest paths on weighted polyhedral surfaces","year":2005,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":115,"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":"Discretization; Combinatorics; Face (sociological concept); Mathematics; Shortest path problem; Surface (topology); Euclidean geometry; Polyhedron; Computational geometry; Discrete mathematics; Algorithm; Geometry; Graph; Mathematical analysis","score_opus":0.02130323145929961,"score_gpt":0.2520038338114481,"score_spread":0.23070060235214848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028769163","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.9505292,0.00019175305,0.018647091,0.026031546,0.0019472763,0.00013686906,0.0000042803476,0.00006228362,0.0024497018],"genre_scores_gemma":[0.8871483,0.000029308965,0.111003846,0.00086336443,0.00041851064,5.500274e-7,3.2959943e-7,0.0000075079715,0.00052826153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990523,0.000045601315,0.00025737888,0.000112077236,0.0003534268,0.00017922942],"domain_scores_gemma":[0.9986002,0.00006623324,0.00027412668,0.00096780556,0.000038605765,0.000053069434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044391587,0.00009198208,0.0001270387,0.00007778984,0.00010470511,0.00023216229,0.004236207,0.000020633117,0.000010792944],"category_scores_gemma":[0.000116231786,0.000052857824,0.000094811025,0.00018442865,0.000021767202,0.00088280154,0.0010470221,0.00017039737,0.000024091984],"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.000034680892,0.000399767,0.010949422,0.000017158249,0.00016716622,0.00017607555,0.0011647812,0.0014879941,0.0028506636,0.0065408144,0.04739069,0.9288208],"study_design_scores_gemma":[0.0028842587,0.0011066716,0.094874725,0.00057704543,0.00013772257,0.0006029592,0.00021579082,0.7346602,0.027318269,0.025940735,0.11066653,0.001015081],"about_ca_topic_score_codex":0.000001059641,"about_ca_topic_score_gemma":0.0000014646632,"teacher_disagreement_score":0.9278057,"about_ca_system_score_codex":0.00002704311,"about_ca_system_score_gemma":0.000022185925,"threshold_uncertainty_score":0.7871997},"labels":[],"label_agreement":null},{"id":"W2028936054","doi":"10.1007/s101150050009","title":"An Index Structure for Data Mining and Clustering","year":2000,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Fudan University; National Science Foundation","keywords":"Cluster analysis; Euclidean distance; Data mining; Computer science; Metric (unit); Set (abstract data type); Index (typography); Visualization; Mathematics; Data set; Computation; Approximation error; Algorithm; Pattern recognition (psychology); Artificial intelligence","score_opus":0.02296360961186923,"score_gpt":0.2681822105133437,"score_spread":0.24521860090147446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028936054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02200378,0.00058947847,0.96319354,0.00006924679,0.00064214837,0.0005528611,0.00014345697,0.00015455394,0.012650948],"genre_scores_gemma":[0.9863914,0.00007617244,0.012195712,0.00011980368,0.00021238178,0.000015286332,0.00048106376,0.0000048854913,0.0005032803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994803,0.000013792662,0.00019436784,0.00013527273,0.0000675955,0.00010867911],"domain_scores_gemma":[0.9994371,0.000017197755,0.000050352395,0.00040995344,0.000034513534,0.000050872444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023139834,0.00007206283,0.0000865042,0.000077658486,0.00012779013,0.0007807057,0.0004406526,0.000032236923,0.000004268629],"category_scores_gemma":[0.0000054583775,0.0000619935,0.000005084823,0.00009635787,0.000011329451,0.010704032,0.00019053234,0.000023174342,0.000007243217],"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.0000031497789,0.0000037549403,0.0002432576,0.00015336467,0.000007670604,1.170747e-7,0.0021312903,0.000034503548,0.000003089254,0.00203041,0.0034430118,0.9919464],"study_design_scores_gemma":[0.0002194739,0.000022272174,0.0004670079,0.000019685638,0.0000021363062,0.0000060051116,0.00015954055,0.7034905,0.0000019340403,0.000011846232,0.29553285,0.00006676715],"about_ca_topic_score_codex":0.000010090938,"about_ca_topic_score_gemma":0.000009649344,"teacher_disagreement_score":0.99187964,"about_ca_system_score_codex":0.0000050907856,"about_ca_system_score_gemma":0.000009659576,"threshold_uncertainty_score":0.77601653},"labels":[],"label_agreement":null},{"id":"W2029626238","doi":"10.1016/s0304-3975(02)00738-7","title":"Mining for empty spaces in large data sets","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"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 Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Focus (optics); Scalability; Computer science; Bounded function; Set (abstract data type); Data structure; Space (punctuation); Mathematics; Algorithm; Data mining; Theoretical computer science","score_opus":0.03465404803737175,"score_gpt":0.30475762553959324,"score_spread":0.27010357750222147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029626238","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.008046531,0.000029054938,0.98754853,0.00072404713,0.0006412781,0.00023078352,0.000013721512,0.000095195915,0.0026708764],"genre_scores_gemma":[0.52057475,0.0000022227632,0.4789763,0.00038273164,0.000033878296,0.000005537148,0.000007075313,0.000004220511,0.000013312288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757487,0.00008055365,0.00022271807,0.0009687125,0.0004466416,0.0007065028],"domain_scores_gemma":[0.9978689,0.00024956444,0.000049139686,0.0016313613,0.000056475023,0.00014458163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038817408,0.00014525573,0.00016710458,0.00019941718,0.0002579677,0.00079046044,0.005112672,0.000029219298,0.00001891237],"category_scores_gemma":[0.00023906025,0.00012300504,0.000025866098,0.0011066967,0.0006065143,0.001964329,0.0025124294,0.00009363716,0.000026506505],"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.0000015984982,0.00005541526,0.00020979664,0.0000063049965,0.0000017213133,0.000008117288,0.00018513943,0.000015143356,0.000012667174,0.9755455,0.00047069107,0.023487901],"study_design_scores_gemma":[0.00044642226,0.000082272796,0.0005549632,0.00002243366,0.0000027571841,0.000006830758,0.00002214702,0.9057108,0.00034040338,0.086024806,0.0065644924,0.00022165039],"about_ca_topic_score_codex":0.0000012208808,"about_ca_topic_score_gemma":0.0000029984121,"teacher_disagreement_score":0.9056957,"about_ca_system_score_codex":0.000024941806,"about_ca_system_score_gemma":0.00008213288,"threshold_uncertainty_score":0.9500702},"labels":[],"label_agreement":null},{"id":"W2029902517","doi":"10.1007/s10115-012-0511-z","title":"How you move reveals who you are: understanding human behavior by analyzing trajectory data","year":2012,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":80,"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":"Computer science; Process (computing); Inference; Field (mathematics); Human behavior; Data science; Trajectory; Artificial intelligence; Knowledge extraction; Business process discovery; Human–computer interaction; Work in process; Business process; Engineering","score_opus":0.07373967419833824,"score_gpt":0.28297431501211756,"score_spread":0.20923464081377932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029902517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012113767,0.004857827,0.956411,0.0002644265,0.002349176,0.0009025019,0.0003208819,0.0003400543,0.022440383],"genre_scores_gemma":[0.9960933,0.000094619776,0.00038620125,0.000054446762,0.0002891152,0.000030161398,0.00052641105,0.000008269855,0.00251751],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988152,0.000063622705,0.00037416007,0.00019684088,0.00023251522,0.00031770812],"domain_scores_gemma":[0.998701,0.000024905263,0.00029319135,0.00078293233,0.000060355105,0.00013764105],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0009921666,0.00016089613,0.00021665983,0.00022785181,0.00031017736,0.0014029908,0.0008291722,0.00006423355,0.0000024260637],"category_scores_gemma":[0.000022485718,0.00014436194,0.000027283537,0.0003307691,0.00003671293,0.023225388,0.0005329265,0.00009855857,0.00005109182],"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.0000057465745,0.00027502645,0.046958663,0.0013344953,0.00019805203,0.0000034699008,0.020332932,0.0000062784065,0.00045212248,0.27204362,0.5895072,0.06888239],"study_design_scores_gemma":[0.0011173284,0.00006573282,0.0081267925,0.00031744767,0.00009809782,0.000020274132,0.012305099,0.046621628,0.00010924388,0.00006744514,0.9302734,0.0008775232],"about_ca_topic_score_codex":0.000016806627,"about_ca_topic_score_gemma":0.000001700167,"teacher_disagreement_score":0.9839795,"about_ca_system_score_codex":0.00009220568,"about_ca_system_score_gemma":0.000011103225,"threshold_uncertainty_score":0.99963367},"labels":[],"label_agreement":null},{"id":"W2031979200","doi":"10.1016/j.ins.2013.06.019","title":"Weighting tags and paths in XML documents according to their topic generalization","year":2013,"lang":"en","type":"article","venue":"Information Sciences","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"","keywords":"Weighting; Computer science; Generalization; Information retrieval; XML; Data mining; Document Structure Description; Database; Mathematics; World Wide Web","score_opus":0.014341667468508033,"score_gpt":0.24544668063568473,"score_spread":0.2311050131671767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031979200","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.6497818,0.000014750582,0.33528534,0.0017294328,0.00035057662,0.00030728543,0.0000010238118,0.00006720013,0.0124625815],"genre_scores_gemma":[0.9781753,0.000013228883,0.02049858,0.0012046046,0.000019744137,0.0000219111,0.0000037252867,7.654081e-7,0.00006214893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993362,0.000014103349,0.00019248486,0.00011200093,0.00019636632,0.00014886084],"domain_scores_gemma":[0.99973476,0.000019171832,0.000065001295,0.00011087512,0.000033128003,0.000037058002],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00040495204,0.000055003475,0.000051496605,0.00024697726,0.00014153593,0.0012812862,0.00046709183,0.000012539729,0.0000097383445],"category_scores_gemma":[0.000031860418,0.00004147372,0.0000070338497,0.00064351544,0.0000211354,0.012093745,0.00029498234,0.000023549954,0.00011050896],"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":[2.3304483e-7,0.000005543224,0.020482616,0.000010111207,0.0000015081788,2.1780563e-7,0.0033455545,0.00046412184,0.00014081456,0.032394685,0.0005999449,0.94255465],"study_design_scores_gemma":[0.00031014252,0.00006727011,0.06068147,0.00005028549,9.62394e-7,0.0000025009272,0.002620307,0.9022223,0.0009725997,0.010281371,0.022505281,0.000285564],"about_ca_topic_score_codex":0.00016991558,"about_ca_topic_score_gemma":0.000007699987,"teacher_disagreement_score":0.9422691,"about_ca_system_score_codex":0.000014277684,"about_ca_system_score_gemma":0.0000119900915,"threshold_uncertainty_score":0.9997555},"labels":[],"label_agreement":null},{"id":"W2032871197","doi":"10.1139/l00-106","title":"Analyse orientée-objet et totalement désagrégée des données d'enquêtes ménages origine-destination","year":2001,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":22,"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; TRIPS architecture; Database; Survey data collection; Visualization; Data model (GIS); Object (grammar); Geography; Data mining; Statistics; Mathematics; Artificial intelligence","score_opus":0.018582823856837946,"score_gpt":0.2216172389986528,"score_spread":0.20303441514181486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032871197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05382597,0.00096157845,0.940052,0.0009887422,0.0009880149,0.0001111378,0.000008431775,0.000070605485,0.002993566],"genre_scores_gemma":[0.9767951,0.00015396795,0.022468142,0.00010768301,0.00020944887,0.0000031596678,0.000006405301,0.000016176184,0.00023995417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882436,0.000023659064,0.00033659936,0.00016728378,0.0002569413,0.00039113918],"domain_scores_gemma":[0.99896747,0.000049100287,0.00013804379,0.0002559383,0.00015985982,0.00042957335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005708981,0.00016274932,0.00018253316,0.0006942789,0.0001038494,0.0004305532,0.00073486805,0.000029903887,0.00007375586],"category_scores_gemma":[0.00013514856,0.00015570383,0.00008059416,0.00070090184,0.000028339919,0.0015700943,0.000053768657,0.00016378015,0.000008571727],"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.000018734778,0.00019949701,0.08731807,0.00046752676,0.0010367949,0.007169692,0.0058156727,0.49287367,0.0020472908,0.14376296,0.0349434,0.2243467],"study_design_scores_gemma":[0.0019522434,0.0007071935,0.11596955,0.0013345965,0.00021611652,0.0013418058,0.00057070935,0.39376324,0.0016887911,0.0059203906,0.47467846,0.0018568974],"about_ca_topic_score_codex":0.00054542325,"about_ca_topic_score_gemma":0.027624592,"teacher_disagreement_score":0.9229691,"about_ca_system_score_codex":0.00017315586,"about_ca_system_score_gemma":0.00020499091,"threshold_uncertainty_score":0.99011874},"labels":[],"label_agreement":null},{"id":"W2033152755","doi":"10.1145/1995412.1995419","title":"Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Metric (unit); Tree (set theory); Similarity (geometry); Computer science; Nearest neighbor search; Metric space; Mathematics; Theoretical computer science; Data mining; Discrete mathematics; Combinatorics; Artificial intelligence; Engineering","score_opus":0.05797500141741404,"score_gpt":0.27117219149028254,"score_spread":0.2131971900728685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033152755","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.84947085,0.000019261719,0.13830577,0.00013511085,0.00026614193,0.00030002915,0.0000051884335,0.00006950478,0.011428135],"genre_scores_gemma":[0.93037605,0.000015651189,0.06877086,0.00010610532,0.000014269478,0.000010826525,0.000004295504,0.0000050031545,0.0006969653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990017,0.0000196858,0.00018803398,0.00028488995,0.00024540097,0.0002603016],"domain_scores_gemma":[0.9993019,0.00009230167,0.000041601685,0.00047485656,0.000046701225,0.000042656375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247223,0.000096594275,0.00014267521,0.0004408019,0.000068995825,0.000048960414,0.00071014656,0.000035631252,0.0000366094],"category_scores_gemma":[0.000034259534,0.00007828271,0.00004074933,0.00086150784,0.0000334755,0.00077181315,0.00038489056,0.00010083701,0.000012291855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017989674,0.0019193188,0.090879604,0.00020491374,0.00010286262,0.000021843065,0.0008742747,0.0001365403,0.00034903927,0.49334958,0.0028564637,0.40912566],"study_design_scores_gemma":[0.0023856547,0.0019622128,0.30553502,0.000114853196,0.00001900559,0.0000011026676,0.00008824153,0.6333759,0.047199674,0.0030490155,0.0056457813,0.0006235872],"about_ca_topic_score_codex":0.00011946577,"about_ca_topic_score_gemma":0.000024648733,"teacher_disagreement_score":0.6332393,"about_ca_system_score_codex":0.00002460321,"about_ca_system_score_gemma":0.000022485776,"threshold_uncertainty_score":0.31922764},"labels":[],"label_agreement":null},{"id":"W2033937100","doi":"10.1145/2433140.2433151","title":"A framework to compute statistics of system parameters from very large trace files","year":2013,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Granularity; TRACE (psycholinguistics); Hierarchy; Interval (graph theory); Architecture; Data mining; Theoretical computer science; Algorithm; Operating system","score_opus":0.027823030164328938,"score_gpt":0.2784168744414443,"score_spread":0.2505938442771154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033937100","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.0025432815,0.027851311,0.96533006,0.00040720653,0.0011540409,0.002005635,0.00036612758,0.00020185686,0.00014049836],"genre_scores_gemma":[0.054671943,0.0014807124,0.9418634,0.0010971718,0.00016980078,0.00035737906,0.00013271954,0.000034009023,0.00019284188],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710935,0.00038378415,0.001000796,0.00059820415,0.00050052337,0.00040735095],"domain_scores_gemma":[0.9964639,0.0008126624,0.0003575749,0.0019616785,0.00023656168,0.00016763649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008921138,0.00028663446,0.00085288327,0.00007549348,0.00014386146,0.00066640717,0.0024058332,0.00006877738,0.000026637488],"category_scores_gemma":[0.00068969926,0.00023725576,0.00008989092,0.0005604357,0.000019960604,0.00071425707,0.000961987,0.00017653922,0.00058797287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003684818,0.0003738843,0.0015572095,0.051654246,0.00081562565,0.00015273252,0.0026496542,0.0021782483,0.00040304827,0.28024167,0.38321596,0.27675402],"study_design_scores_gemma":[0.0012383498,0.00066873064,0.0019609553,0.18743563,0.00038293796,0.000052870917,0.001370824,0.70051455,0.0002602859,0.00090619695,0.102449834,0.0027588457],"about_ca_topic_score_codex":0.00085868564,"about_ca_topic_score_gemma":0.0000046969844,"teacher_disagreement_score":0.6983363,"about_ca_system_score_codex":0.00005295116,"about_ca_system_score_gemma":0.000040562896,"threshold_uncertainty_score":0.967501},"labels":[],"label_agreement":null},{"id":"W2034856714","doi":"10.1145/2618243.2618262","title":"Skew-resistant parallel in-memory spatial join","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Skew; Computer science; Partition (number theory); Join (topology); Spatial analysis; Parallel computing; Spatial database; Theoretical computer science; Mathematics","score_opus":0.011469557123735248,"score_gpt":0.2175001016848722,"score_spread":0.20603054456113695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034856714","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.001697859,0.00001055001,0.916063,0.0011591907,0.00026345422,0.00007896892,6.4060293e-7,0.00011240307,0.08061391],"genre_scores_gemma":[0.7279847,0.000010432171,0.25942665,0.0018357508,0.000219125,0.000016364618,0.0000111355785,0.000010002562,0.010485786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916166,0.000036053036,0.00014544417,0.000269223,0.00017841178,0.00020922493],"domain_scores_gemma":[0.9993933,0.000030361332,0.000029081848,0.00049017026,0.000010665333,0.00004643048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029723227,0.000080993654,0.00009618132,0.000089031615,0.000036245852,0.00015362087,0.0007695195,0.000020670206,0.000076112],"category_scores_gemma":[0.000018763609,0.000067328336,0.000026372027,0.00016039211,0.000016463491,0.00043142264,0.0003769786,0.000057076824,0.00032037203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075308208,0.000116172705,0.00072782894,0.000017085209,0.000009202894,0.00003273852,0.00013867639,0.00009048783,0.00017243609,0.49430338,0.020799829,0.48358464],"study_design_scores_gemma":[0.001756169,0.00018830047,0.0668925,0.00002833978,0.0000052664827,0.0000019640688,0.000032747732,0.716167,0.0005386868,0.036185477,0.17760308,0.000600513],"about_ca_topic_score_codex":0.000378916,"about_ca_topic_score_gemma":0.00034133115,"teacher_disagreement_score":0.7262869,"about_ca_system_score_codex":0.000011598699,"about_ca_system_score_gemma":0.000009696057,"threshold_uncertainty_score":0.4117841},"labels":[],"label_agreement":null},{"id":"W2035006988","doi":"10.1007/s00778-006-0017-y","title":"Query processing of multi-way stream window joins","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":19,"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":"Joins; Computer science; Join (topology); Data stream mining; Window (computing); Sliding window protocol; Data stream; Database; Data mining; Aggregate (composite); Distributed computing; Real-time computing; Programming language","score_opus":0.019450964385993072,"score_gpt":0.24129503545532632,"score_spread":0.22184407106933324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035006988","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.043797106,0.0006571636,0.9499882,0.001625226,0.00041075042,0.00010005817,0.0000038506187,0.0000614379,0.003356243],"genre_scores_gemma":[0.9468489,0.000040304953,0.050905555,0.00013749175,0.00045075297,0.0000014449513,0.000001937194,0.000008942293,0.0016046332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991414,0.00004753935,0.00022865225,0.00011188637,0.00027099292,0.00019954174],"domain_scores_gemma":[0.9994143,0.000021895938,0.0001986636,0.00027032735,0.00006002028,0.000034755572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045711,0.000083057515,0.00010189473,0.000087865235,0.00021750036,0.00032094642,0.0010035979,0.00001752062,0.000012431272],"category_scores_gemma":[0.000010678296,0.000050558505,0.000055621604,0.00024500082,0.000051404404,0.000777001,0.00019804611,0.00016625707,0.000015126358],"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.000007836883,0.00035072578,0.0027351363,0.00003375369,0.000043066535,0.000075947544,0.00059469056,0.0011084483,0.0032589098,0.0089728935,0.00882972,0.9739889],"study_design_scores_gemma":[0.006336587,0.0005258674,0.21433781,0.00076549675,0.00017833369,0.0012477294,0.000984577,0.61946046,0.032255635,0.043949816,0.07847398,0.0014837228],"about_ca_topic_score_codex":0.00003725395,"about_ca_topic_score_gemma":0.000011343609,"teacher_disagreement_score":0.97250515,"about_ca_system_score_codex":0.0000152957,"about_ca_system_score_gemma":0.00004164412,"threshold_uncertainty_score":0.30948937},"labels":[],"label_agreement":null},{"id":"W2036524648","doi":"10.4018/jaeis.2010070104","title":"Describing Spatio-Temporal Phenomena for Environmental System Development","year":2010,"lang":"en","type":"article","venue":"International Journal of Agricultural and Environmental Information Systems","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Temporalities; Temporality; Rotation formalisms in three dimensions; Simple (philosophy); Computer science; Focus (optics); Extension (predicate logic); Field (mathematics); Cognitive science; Presentation (obstetrics); Epistemology; Programming language; Psychology; Mathematics; Philosophy","score_opus":0.011699973528119913,"score_gpt":0.18282299448812928,"score_spread":0.17112302096000936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036524648","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.8385653,0.00018574779,0.15229823,0.00041128104,0.006571721,0.0006170427,0.00014798938,0.00006109159,0.0011416305],"genre_scores_gemma":[0.9908977,0.000023832448,0.008235943,0.000055573084,0.00033532496,0.000014489705,0.00029614856,0.000003010499,0.00013795609],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986205,0.000013694745,0.00062947103,0.00009813426,0.00050509156,0.00013309052],"domain_scores_gemma":[0.9992064,0.000022411336,0.0005428292,0.00008153041,0.000031668027,0.00011512862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030375505,0.00013424942,0.0001392478,0.00011783918,0.00012209248,0.0005083369,0.000546373,0.000041665142,0.0000076153983],"category_scores_gemma":[0.000006361283,0.00009132068,0.000060305916,0.000032756205,0.000028501798,0.004007232,0.00017844142,0.000107901884,0.000024406176],"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.00018687476,0.0005147568,0.017274546,0.00024725555,0.001326065,0.000029693538,0.011592437,0.0024014944,0.023337407,0.050868552,0.0060997847,0.88612115],"study_design_scores_gemma":[0.005380724,0.00043398258,0.1323336,0.0003592634,0.000065436376,0.0025362724,0.022049148,0.04025715,0.0054008546,0.000025235491,0.78991413,0.0012442203],"about_ca_topic_score_codex":0.000005390617,"about_ca_topic_score_gemma":0.0000012466586,"teacher_disagreement_score":0.8848769,"about_ca_system_score_codex":0.00015274751,"about_ca_system_score_gemma":0.000012695653,"threshold_uncertainty_score":0.49019042},"labels":[],"label_agreement":null},{"id":"W2036609507","doi":"10.1145/2379307.2379314","title":"Ranking the answer trees of graph search by both structure and content","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"China Postdoctoral Science Foundation","keywords":"Ranking (information retrieval); Weighting; Computer science; Keyword search; Graph; Information retrieval; Theoretical computer science; Scheme (mathematics); Tree (set theory); Data mining; Mathematics; Combinatorics","score_opus":0.029930659174962196,"score_gpt":0.2391713763056908,"score_spread":0.20924071713072862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036609507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4414369,0.0017851905,0.54877853,0.0025515985,0.0004886745,0.0003356012,0.000028882638,0.000082557664,0.0045120753],"genre_scores_gemma":[0.9932189,0.000030205692,0.005741283,0.00024426097,0.000029241488,9.320162e-7,0.0000032648252,0.0000021261953,0.0007297619],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994837,0.000026062004,0.000071904535,0.000100397956,0.00016421478,0.00015369056],"domain_scores_gemma":[0.9996603,0.00003085651,0.000020154677,0.00024374113,0.000013673729,0.00003126169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021857525,0.00005222566,0.00006112629,0.000030195204,0.000055705626,0.000085607644,0.00041581146,0.000012331096,0.000028838702],"category_scores_gemma":[0.0000029697012,0.000027919406,0.00001657325,0.00012447992,0.00005043371,0.0005297577,0.00024766647,0.000044136355,0.0000012067104],"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.000008801542,0.00010835688,0.08454155,0.000039621562,0.00013842303,0.0000015956077,0.0035212343,0.000006659238,0.010293419,0.3849207,0.04549231,0.47092736],"study_design_scores_gemma":[0.004407813,0.000449492,0.7182509,0.00008940562,0.00011068049,0.000030655046,0.0049316646,0.05718521,0.08560062,0.010176871,0.117339924,0.0014268107],"about_ca_topic_score_codex":0.00007553362,"about_ca_topic_score_gemma":0.000010125548,"teacher_disagreement_score":0.6337093,"about_ca_system_score_codex":0.00000220844,"about_ca_system_score_gemma":0.0000024305712,"threshold_uncertainty_score":0.11385204},"labels":[],"label_agreement":null},{"id":"W2037133727","doi":"10.1145/2463676.2463687","title":"A query answering system for data with evolution relationships","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Statistics Canada","funders":"","keywords":"Computer science; Schema (genetic algorithms); Database schema; Query language; View; Schema evolution; Information retrieval; Probabilistic logic; Database theory; Database; Probabilistic database; Relational database; Database design; Artificial intelligence","score_opus":0.0533440084306374,"score_gpt":0.23527731013378606,"score_spread":0.18193330170314864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037133727","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.0005238441,0.00001544355,0.9935055,0.0005679413,0.00011932483,0.00033472327,0.0000050773638,0.00025154272,0.0046766475],"genre_scores_gemma":[0.51327676,5.2522756e-7,0.48502973,0.00002618171,0.000049982562,0.000055710007,0.000065742446,0.000004662108,0.0014907186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940634,0.000015621423,0.000091204434,0.00025924246,0.00010174263,0.00012586547],"domain_scores_gemma":[0.99897176,0.000045125704,0.000033285683,0.00087974966,0.000039013114,0.000031076215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025753622,0.000053219563,0.000051237075,0.000050638755,0.00012151809,0.00027471338,0.0008685745,0.000014372498,0.000003865591],"category_scores_gemma":[0.000014879277,0.00003901018,0.000007810082,0.00016472174,0.000008435767,0.0029960142,0.00035221435,0.00003502666,0.00009887646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020526481,0.00002269265,0.0027283907,0.000093022645,0.00002749696,0.0000015617571,0.000050881663,0.000071691975,0.00003661265,0.93794376,0.028584694,0.030437123],"study_design_scores_gemma":[0.00017525928,0.000024582028,0.0047361213,0.000027164964,0.000005783919,0.0000032673986,0.00014492271,0.988054,0.000016168715,0.000654844,0.006062119,0.00009580807],"about_ca_topic_score_codex":0.00016089546,"about_ca_topic_score_gemma":0.000029705063,"teacher_disagreement_score":0.9879823,"about_ca_system_score_codex":0.000025878879,"about_ca_system_score_gemma":0.0000141804385,"threshold_uncertainty_score":0.26490676},"labels":[],"label_agreement":null},{"id":"W2038043779","doi":"10.1002/asi.10191","title":"GeoSearcher: Location‐based ranking of search engine results","year":2002,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Woods Hole Oceanographic Institution","keywords":"Geospatial analysis; Computer science; Information retrieval; Ranking (information retrieval); Search engine; Dimension (graph theory); Data mining; Geographic coordinate system; sort; Geography; Mathematics","score_opus":0.025164326394637917,"score_gpt":0.2735954831368768,"score_spread":0.2484311567422389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038043779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10378192,0.00010138277,0.85059834,0.044466026,0.0002060145,0.00031095778,0.000012972554,0.000050386203,0.00047197152],"genre_scores_gemma":[0.9077399,0.0000922498,0.09150053,0.00062404474,0.000015002299,0.0000022557995,4.4304585e-7,0.0000013669265,0.000024252711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988847,0.000008617648,0.00032786405,0.00006980562,0.0005439293,0.00016513251],"domain_scores_gemma":[0.9980596,0.00007069098,0.00055872055,0.00028467024,0.0009963226,0.000030003264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020208738,0.000048180565,0.00011670947,0.0003533177,0.00020683941,0.00010143348,0.0013948409,0.00001864764,6.360116e-7],"category_scores_gemma":[0.0003786945,0.000032166212,0.000070387636,0.003868824,0.0009924582,0.0021745204,0.00025727757,0.00012489385,0.0000012738577],"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.000010504715,0.000034903267,0.00024378068,0.000033521366,0.000026630894,1.499917e-7,0.0015693061,0.0005901978,0.00083844207,0.011572458,0.0056941984,0.9793859],"study_design_scores_gemma":[0.0014376056,0.00053683994,0.0016524862,0.000053139192,0.000016154534,0.000026933103,0.0028881426,0.9376113,0.01063508,0.0011032261,0.043902405,0.0001367328],"about_ca_topic_score_codex":0.0000042469032,"about_ca_topic_score_gemma":1.3653285e-7,"teacher_disagreement_score":0.9792492,"about_ca_system_score_codex":0.000042860273,"about_ca_system_score_gemma":0.000111289635,"threshold_uncertainty_score":0.36567536},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2040010874","doi":"10.1007/s00500-004-0411-6","title":"Exploring spatial data through computational intelligence: a joint perspective","year":2004,"lang":"en","type":"article","venue":"Soft Computing","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Geospatial analysis; Computer science; Data science; Perspective (graphical); Context (archaeology); Soft computing; Geographic information system; Process (computing); Generalization; Spatial analysis; Computational intelligence; Data mining; Artificial intelligence; Cartography; Geography; Remote sensing; Mathematics","score_opus":0.2505455837239068,"score_gpt":0.32932268302722806,"score_spread":0.07877709930332127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040010874","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.0018435972,0.00007843076,0.993383,0.0015769673,0.0008737538,0.00016209026,0.000010115169,0.00039449747,0.0016775706],"genre_scores_gemma":[0.6025423,0.000008573324,0.39676532,0.00026575045,0.00034489663,0.0000026119085,0.00005023818,0.000010371589,0.000009950008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980247,0.000036871283,0.00031723417,0.0008005911,0.00044496037,0.00037566322],"domain_scores_gemma":[0.99868804,0.00009201096,0.00012820952,0.00090245926,0.0001248724,0.000064402484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043317067,0.0001836735,0.00018198726,0.000102880884,0.00032651663,0.00043082543,0.0020161767,0.000023922943,0.000007873694],"category_scores_gemma":[0.00011435637,0.00018753542,0.000050567054,0.00048999494,0.00006652158,0.0027275363,0.0031788258,0.00020905,0.00014579418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030265844,0.00013341596,0.00006104693,0.000021444344,0.00006506096,0.00006873021,0.007183322,0.17416628,0.000008305786,0.56918615,0.00022368536,0.24887954],"study_design_scores_gemma":[0.0003321298,0.000058950027,0.0010008218,0.000093740506,0.000009388693,0.000020662832,0.0012292471,0.85866445,0.00016576432,0.13715413,0.0009255339,0.00034517347],"about_ca_topic_score_codex":0.000608755,"about_ca_topic_score_gemma":0.000013623739,"teacher_disagreement_score":0.6844982,"about_ca_system_score_codex":0.00013448183,"about_ca_system_score_gemma":0.000100482896,"threshold_uncertainty_score":0.76474726},"labels":[],"label_agreement":null},{"id":"W2040572217","doi":"10.1016/j.ejor.2004.01.032","title":"The shortest path problem with forbidden paths","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":80,"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; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; Constrained Shortest Path First; K shortest path routing; Longest path problem; Shortest Path Faster Algorithm; Euclidean shortest path; Yen's algorithm; Distance; Widest path problem; Mathematics; Matching (statistics); Path (computing); Mathematical optimization; Algorithm; Computer science; Graph; Combinatorics; Dijkstra's algorithm","score_opus":0.057786834878117005,"score_gpt":0.31843098541114934,"score_spread":0.26064415053303236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040572217","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.02032617,0.00067852373,0.8315092,0.042692654,0.0003837827,0.00061917095,0.000008332395,0.000045384564,0.103736795],"genre_scores_gemma":[0.89449775,0.00020727246,0.102075994,0.00022245583,0.000566065,0.0000040881823,0.0000048328584,0.000020529242,0.002401012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976346,0.00036596632,0.00027468335,0.00015047663,0.0013082355,0.0002660455],"domain_scores_gemma":[0.9986665,0.00013146107,0.00007543842,0.00028885223,0.00072724296,0.00011048838],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0057249614,0.000072940165,0.00007072679,0.00011419544,0.00056239456,0.0012184443,0.0016755451,0.000006043254,0.000010662775],"category_scores_gemma":[0.00012255613,0.00003860334,0.000033568554,0.00038454338,0.000110265384,0.0010525243,0.00035368823,0.00037027785,0.000113348404],"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.00009520059,0.0003191175,0.0005423587,0.000010406011,0.00013845072,0.002886893,0.0012429763,0.0061299354,0.00066337915,0.7609162,0.033230122,0.19382499],"study_design_scores_gemma":[0.0068751443,0.008963788,0.052030634,0.00069352554,0.00002444507,0.0016678148,0.0011338864,0.012338923,0.0012414933,0.027396575,0.88677555,0.0008582106],"about_ca_topic_score_codex":0.0000030974627,"about_ca_topic_score_gemma":0.0000041878748,"teacher_disagreement_score":0.87417156,"about_ca_system_score_codex":0.00005005144,"about_ca_system_score_gemma":0.00031211152,"threshold_uncertainty_score":0.9998184},"labels":[],"label_agreement":null},{"id":"W2040641513","doi":"10.1145/1148170.1148341","title":"A platform for Okapi-based contextual information retrieval","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Relevance (law); Relevance feedback; Context (archaeology); Information retrieval; Probabilistic logic; Extension (predicate logic); Java; Query expansion; Dual (grammatical number); Artificial intelligence; Human–computer information retrieval; Search engine; Programming language; Image retrieval","score_opus":0.014971571772353453,"score_gpt":0.22610969182340065,"score_spread":0.2111381200510472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040641513","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.0009990785,0.000004057541,0.97903556,0.00059862563,0.0001815098,0.00023711358,0.000012858059,0.00018598912,0.018745234],"genre_scores_gemma":[0.5666011,0.0000012382703,0.42290324,0.0038546002,0.00026267633,0.000038546183,0.0006472764,0.0000089199975,0.0056823804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994209,0.000002655479,0.00016163042,0.00009988199,0.00015837677,0.00015655192],"domain_scores_gemma":[0.9996078,0.00004406033,0.000049955128,0.00022189379,0.00005389092,0.000022420385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018309939,0.00006431325,0.00006086039,0.00008467523,0.00007025578,0.00031515848,0.00040206115,0.000023056558,0.000017592158],"category_scores_gemma":[0.000017562228,0.000053759082,0.00003663649,0.00016935679,0.000012235917,0.0025886171,0.00007369379,0.000025111447,0.00009554125],"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.000023513223,0.000034022727,0.000041938387,0.000018829296,0.0000054919597,7.9150465e-7,0.00003088791,0.00008005538,0.000032710122,0.8366756,0.076611765,0.08644439],"study_design_scores_gemma":[0.0014611675,0.00012089228,0.0005545208,0.000004915528,0.0000040056584,6.307203e-7,0.000024456844,0.6574589,0.002895783,0.007348116,0.32995513,0.00017147278],"about_ca_topic_score_codex":0.000034219986,"about_ca_topic_score_gemma":0.0000086330465,"teacher_disagreement_score":0.82932746,"about_ca_system_score_codex":0.000017224538,"about_ca_system_score_gemma":0.000022928516,"threshold_uncertainty_score":0.30390805},"labels":[],"label_agreement":null},{"id":"W2041121499","doi":"10.1198/016214508000000517","title":"Combining Registration and Fitting for Functional Models","year":2008,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Econometrics; Mathematics; Artificial intelligence","score_opus":0.03196521524814722,"score_gpt":0.25255041528521477,"score_spread":0.22058520003706755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041121499","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.01969114,0.000008612787,0.9773465,0.0025281555,0.00019551338,0.000049772134,0.000010765582,0.000007416973,0.00016213334],"genre_scores_gemma":[0.82983786,0.000021832084,0.16929516,0.00040412447,0.00014030446,0.0000019378906,0.0000035483074,0.0000034514871,0.00029179367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992286,0.000057700323,0.00022517647,0.0000762269,0.00031621786,0.00009606931],"domain_scores_gemma":[0.9984734,0.00050237594,0.0007783519,0.00007256844,0.00014238505,0.000030887033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283893,0.000044065546,0.00011585931,0.000031520794,0.00017311641,0.00006998187,0.00017273909,0.000009868454,6.6258e-7],"category_scores_gemma":[0.000505104,0.0000320143,0.000035880043,0.00012846844,0.000039256305,0.00048228295,0.000055095436,0.0000822599,4.651433e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011791155,0.00021398732,0.034073614,0.000027932067,0.00030229535,0.000016574948,0.0009712116,0.0030738984,0.00045533536,0.63931966,0.12614226,0.1952853],"study_design_scores_gemma":[0.00088852167,0.00037180036,0.2530319,0.000022904049,0.00005528922,0.0000554229,0.00010548986,0.64985627,0.000048504935,0.09336506,0.0020486568,0.00015021108],"about_ca_topic_score_codex":0.000009125267,"about_ca_topic_score_gemma":0.0000010894827,"teacher_disagreement_score":0.8101467,"about_ca_system_score_codex":0.00008002228,"about_ca_system_score_gemma":0.000037407506,"threshold_uncertainty_score":0.1331489},"labels":[],"label_agreement":null},{"id":"W2041277986","doi":"10.1145/2600428.2609527","title":"An enhanced context-sensitive proximity model for probabilistic information retrieval","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relevance (law); Weighting; Term (time); Computer science; Divergence-from-randomness model; Probabilistic logic; Information retrieval; Context (archaeology); Relevance feedback; Term Discrimination; Ranking (information retrieval); Statistical model; Data mining; Context model; Artificial intelligence; Search engine; Image retrieval; Concept search; Web search query; Geography","score_opus":0.017307298973516138,"score_gpt":0.24683986839512623,"score_spread":0.2295325694216101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041277986","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.0036150282,3.4797372e-7,0.9915384,0.00027052785,0.0001081993,0.00059660483,0.00000960818,0.0001957123,0.0036655625],"genre_scores_gemma":[0.8465871,3.819792e-7,0.15223794,0.0007512425,0.0000323646,0.000019302188,0.000054361157,0.0000027215915,0.00031454855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992743,0.000023744898,0.00017036877,0.00019839773,0.00015906924,0.00017411243],"domain_scores_gemma":[0.99925107,0.00004793477,0.000069828035,0.00039958162,0.0001749428,0.000056619127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044541253,0.000086509564,0.00009685127,0.000052004085,0.00008812773,0.00027804053,0.0004319968,0.000028984621,0.0000017640328],"category_scores_gemma":[0.00013742661,0.00007255285,0.000027893599,0.000119266806,0.000023429742,0.0045564845,0.000105187595,0.000038549573,0.000028958684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032189306,0.00005296775,0.000001929552,0.00003746106,0.000007664867,8.258785e-8,0.00080903777,0.0019491571,0.00029719263,0.7884165,0.0006553279,0.20774046],"study_design_scores_gemma":[0.00036156437,0.0001263006,0.00006105007,0.0000041204407,0.000003957653,2.3308793e-7,0.000023706323,0.975172,0.0032675986,0.020310577,0.00055268465,0.00011620715],"about_ca_topic_score_codex":0.000006725594,"about_ca_topic_score_gemma":0.000011483808,"teacher_disagreement_score":0.97322285,"about_ca_system_score_codex":0.000021021473,"about_ca_system_score_gemma":0.000024027548,"threshold_uncertainty_score":0.33033413},"labels":[],"label_agreement":null},{"id":"W2041305873","doi":"10.1145/2668064.2677081","title":"(Reverse) <i>k</i> -nearest neighbors for moving objects","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Object (grammar); Simple (philosophy); Trajectory; Nearest neighbor search; Term (time); Artificial intelligence","score_opus":0.0097642879889438,"score_gpt":0.21719981751453704,"score_spread":0.20743552952559324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041305873","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.00017891634,0.000007487709,0.9406135,0.0008104093,0.00043724815,0.00013935388,0.0000017919804,0.0002086831,0.057602573],"genre_scores_gemma":[0.26441425,0.000011982875,0.7089306,0.0077846423,0.00044474212,0.00004634369,0.000025024283,0.000021162912,0.018321276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926674,0.000014164749,0.00009722065,0.00027087846,0.0001258166,0.00022514777],"domain_scores_gemma":[0.9993569,0.000086600965,0.000031979795,0.0004427002,0.000026321677,0.00005549942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544135,0.00008131393,0.000081517275,0.00005241074,0.00009237226,0.00021975514,0.00075835397,0.000019582112,0.00001984122],"category_scores_gemma":[0.000048466558,0.00006923063,0.0000426271,0.00015831027,0.000012381703,0.00073878485,0.000303806,0.00003261557,0.00012164704],"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.0000018196447,0.00003372063,0.00018113511,0.000027988237,0.000012838995,0.0000020598097,0.00010267567,0.000049527454,0.00013347757,0.67257947,0.09233344,0.23454183],"study_design_scores_gemma":[0.0005120928,0.00008993563,0.0005056148,0.000010359975,0.0000062355325,0.0000011152301,0.000033397584,0.5025396,0.00097591185,0.008476977,0.48659945,0.0002493494],"about_ca_topic_score_codex":0.000027808306,"about_ca_topic_score_gemma":0.000015063423,"teacher_disagreement_score":0.6641025,"about_ca_system_score_codex":0.000008670345,"about_ca_system_score_gemma":0.000009763966,"threshold_uncertainty_score":0.2823143},"labels":[],"label_agreement":null},{"id":"W2041835266","doi":"10.1145/2452376.2452433","title":"Efficient top-k query answering using cached views","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Query optimization; Scalability; Query expansion; Query language; Scope (computer science); Cache; Partition (number theory); Web search query; Information retrieval; Data mining; Theoretical computer science; Search engine; Database; Parallel computing; Programming language","score_opus":0.03926363015225346,"score_gpt":0.2621972053555646,"score_spread":0.22293357520331117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041835266","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.08233525,0.000043588094,0.9023364,0.000291444,0.00035159086,0.00017588116,3.0645e-7,0.00017161614,0.014293899],"genre_scores_gemma":[0.4581151,0.0000043505943,0.5381842,0.0008712236,0.0001204456,0.000016584485,0.000002827567,0.000010500979,0.0026747158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991963,0.000017921797,0.00014101391,0.00025795776,0.00015516105,0.0002316584],"domain_scores_gemma":[0.9994004,0.000013450288,0.00003353061,0.0004679241,0.000025033769,0.000059657716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015929753,0.00008822368,0.00008987259,0.00007343381,0.00008158762,0.00035092665,0.00060504716,0.00001759141,0.00012899206],"category_scores_gemma":[0.0000067086457,0.00007052489,0.00003481774,0.00024123039,0.000013251676,0.00043492008,0.000479972,0.00004528276,0.00042210834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020639388,0.0004471442,0.0026538873,0.000115164454,0.00009463483,0.000066275155,0.001719661,0.016870791,0.033887133,0.191208,0.024041444,0.7288938],"study_design_scores_gemma":[0.00008642189,0.000008368875,0.0015242038,0.000007353222,0.0000021020567,0.0000015646798,0.000035497404,0.9927607,0.00048101545,0.00016437346,0.0048035835,0.0001248219],"about_ca_topic_score_codex":0.00029461947,"about_ca_topic_score_gemma":0.0000032518403,"teacher_disagreement_score":0.9758899,"about_ca_system_score_codex":0.000021591859,"about_ca_system_score_gemma":0.000009928728,"threshold_uncertainty_score":0.54254895},"labels":[],"label_agreement":null},{"id":"W2041882671","doi":"10.1145/1142473.1142481","title":"Supporting ad-hoc ranking aggregates","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Ranking (information retrieval); Computer science; Tuple; Aggregate (composite); Pruning; Rank (graph theory); Schedule; sort; Query optimization; Process (computing); Information retrieval; Tuple space; Theoretical computer science; Data mining; Mathematics","score_opus":0.008520640680822918,"score_gpt":0.2446987088814756,"score_spread":0.23617806820065268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041882671","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.004894788,0.00041644537,0.9094881,0.0013277368,0.00032598592,0.00009809436,9.276948e-7,0.00057932717,0.0828686],"genre_scores_gemma":[0.5233624,0.000036710775,0.43423358,0.0009927914,0.00024903932,0.00001003173,0.000034588782,0.00001527543,0.041065577],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991823,0.000010210255,0.00015647232,0.00023194888,0.00016131489,0.0002577792],"domain_scores_gemma":[0.9995673,0.000023195491,0.00006078668,0.0003085736,0.000017137623,0.000023035187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022849161,0.00007307964,0.00006901936,0.00006241313,0.000085966,0.0003376603,0.0006274551,0.000014153429,0.00008106097],"category_scores_gemma":[0.0000075994903,0.00006147292,0.00003252139,0.00022032509,0.000012387787,0.0008554932,0.00032231477,0.000038135382,0.00018669768],"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":[8.868572e-7,0.000040689058,0.0014318572,0.000011087912,0.00000893927,0.000058815385,0.00005957937,0.000028704528,0.00020486537,0.19380169,0.028041815,0.77631104],"study_design_scores_gemma":[0.0008664113,0.00006658296,0.0055801705,0.00004040768,0.000011983912,0.000014636023,0.000074638716,0.23490293,0.0058781095,0.05841124,0.6934943,0.0006585968],"about_ca_topic_score_codex":0.000033956167,"about_ca_topic_score_gemma":0.000015656797,"teacher_disagreement_score":0.77565247,"about_ca_system_score_codex":0.000007854584,"about_ca_system_score_gemma":0.0000069655634,"threshold_uncertainty_score":0.3256066},"labels":[],"label_agreement":null},{"id":"W2042149992","doi":"10.5194/isprsarchives-xxxix-b4-421-2012","title":"A HYBRID PULL-PUSH SYSTEM FOR NEAR REAL-TIME NOTIFICATIONS ON SENSOR WEB","year":2012,"lang":"en","type":"article","venue":"˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences","topic":"Data Management and Algorithms","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":"Alberta Innovates; Canarie; Microsoft Research","keywords":"Sensor web; Computer science; Web service; Publication; Web mapping; Wireless sensor network; Geospatial analysis; World Wide Web; Data Web; Database; Computer network; Key distribution in wireless sensor networks; Telecommunications; Wireless; Remote sensing","score_opus":0.019670595106740154,"score_gpt":0.2541133945000572,"score_spread":0.23444279939331705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042149992","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.0054567466,0.00001553031,0.97395897,0.0047245533,0.0026503124,0.0009871318,0.00024103385,0.00010624363,0.011859493],"genre_scores_gemma":[0.982329,0.000081686216,0.016194971,0.00088147493,0.00022847472,0.0000011525989,0.00007724021,0.000012986698,0.00019299358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531066,0.00029221072,0.0013925422,0.0004693446,0.0018503644,0.0006848974],"domain_scores_gemma":[0.99568015,0.0013348401,0.0016632177,0.0007873729,0.00032571802,0.00020869316],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020560024,0.00044181588,0.00043266345,0.0009040024,0.0019106164,0.0015318675,0.0027659854,0.000071912196,0.0000045256106],"category_scores_gemma":[0.00060080836,0.0002840808,0.00041283574,0.0009223747,0.0020276092,0.0011027448,0.0012337856,0.00033032923,0.000013323092],"study_design_candidate":"design_other","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.00008990038,0.00003235342,0.00008232415,0.00005213587,0.000090606765,2.0895928e-7,0.0018840621,0.0017551419,0.0018626219,0.00011078867,0.0001851601,0.9938547],"study_design_scores_gemma":[0.00070911093,0.00014110722,0.0011622614,0.00028790926,0.000045605495,0.00010413102,0.0010172504,0.9787207,0.0056678415,0.0020370418,0.009776661,0.00033038465],"about_ca_topic_score_codex":0.41662568,"about_ca_topic_score_gemma":0.016444016,"teacher_disagreement_score":0.9935243,"about_ca_system_score_codex":0.00006621117,"about_ca_system_score_gemma":0.000224782,"threshold_uncertainty_score":0.99996114},"labels":[],"label_agreement":null},{"id":"W2042301468","doi":"10.1007/s11004-008-9192-2","title":"Collocated Cokriging Based on Merged Secondary Attributes","year":2008,"lang":"en","type":"article","venue":"Mathematical Geosciences","topic":"Data Management and Algorithms","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 Alberta","funders":"University of Alberta","keywords":"Hydrogeology; Geostatistics; Geology; Statistics; Computer science; Mathematics; Spatial variability; Geotechnical engineering","score_opus":0.03331157812737271,"score_gpt":0.24369631197313998,"score_spread":0.21038473384576728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042301468","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.017415809,0.000025953295,0.9404759,0.002857301,0.00045425066,0.00026659077,0.000011910445,0.00043330702,0.038058985],"genre_scores_gemma":[0.8398095,0.000008879887,0.15418008,0.0018389622,0.00006164092,0.000039936825,0.000011675731,0.000010668229,0.0040386897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981791,0.00004922659,0.00025255245,0.0004515809,0.0006704115,0.00039716085],"domain_scores_gemma":[0.99900764,0.00023088502,0.00007193281,0.0005164954,0.00004401641,0.00012903665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069147,0.0001543761,0.0002017474,0.00016027161,0.00044875703,0.00022351652,0.0014305667,0.00003166999,0.00023402071],"category_scores_gemma":[0.00017999671,0.00011403876,0.00006110468,0.0010051763,0.00026792946,0.0006546311,0.00023607007,0.00011365813,0.00046052472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023461693,0.0021504154,0.002160739,0.00029643,0.00005719954,0.0005926788,0.0015902017,0.0008866247,0.000951462,0.857788,0.062075462,0.0714273],"study_design_scores_gemma":[0.00035822354,0.00016661783,0.0019090677,0.000050377723,0.0000053592626,0.000013923435,0.000045098976,0.9699392,0.001181587,0.015353079,0.010675644,0.0003018269],"about_ca_topic_score_codex":0.000008031189,"about_ca_topic_score_gemma":0.0000010006871,"teacher_disagreement_score":0.96905255,"about_ca_system_score_codex":0.00001889606,"about_ca_system_score_gemma":0.00009178464,"threshold_uncertainty_score":0.5919267},"labels":[],"label_agreement":null},{"id":"W2042914194","doi":"10.1080/10095020.2012.708150","title":"Abstraction of informed virtual geographic environments","year":2012,"lang":"en","type":"article","venue":"Geo-spatial Information Science","topic":"Data Management and Algorithms","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Abstraction; Situated; Geographic information system; Representation (politics); Graph; Theoretical computer science; Human–computer interaction; Data science; Artificial intelligence; Geography; Cartography","score_opus":0.0129804264962671,"score_gpt":0.24330398587524432,"score_spread":0.23032355937897722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042914194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05107134,0.000008044167,0.9390147,0.000098571974,0.001014493,0.00018218526,0.000008519389,0.00006105068,0.00854114],"genre_scores_gemma":[0.9928142,0.000025399597,0.0067800945,0.00026170837,0.000040754592,0.000009633813,0.00002291984,0.0000015151256,0.000043768723],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982133,0.000011258666,0.00040061993,0.00011361211,0.00088889047,0.00037235135],"domain_scores_gemma":[0.9990294,0.000032476088,0.00031587284,0.00042734868,0.00006355955,0.00013134966],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009855679,0.00009904138,0.00009084211,0.0004901614,0.00020429658,0.00023531352,0.0010053396,0.00003380673,0.000036989655],"category_scores_gemma":[0.000103508035,0.000090193455,0.000036014702,0.0008342153,0.00022567366,0.029605845,0.00043417956,0.000078163706,0.0003645619],"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.0000076277333,0.00009428295,0.006184503,0.000020806221,0.000011035142,1.8099928e-7,0.002914618,0.0005855684,0.0014451516,0.0533333,0.00038830756,0.9350146],"study_design_scores_gemma":[0.00078088394,0.00018764912,0.6996856,0.000026151401,0.0000121582425,0.000008767283,0.00049758697,0.12163754,0.021912437,0.00034849986,0.15439913,0.00050364045],"about_ca_topic_score_codex":0.00016937031,"about_ca_topic_score_gemma":0.000004611933,"teacher_disagreement_score":0.9417429,"about_ca_system_score_codex":0.000044409157,"about_ca_system_score_gemma":0.0000651891,"threshold_uncertainty_score":0.9839666},"labels":[],"label_agreement":null},{"id":"W2043316303","doi":"10.1109/cjece.2006.259180","title":"Comparing nearest-neighbour search strategies in the SMOTE algorithm","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; k-nearest neighbors algorithm; Nearest neighbour; Algorithm; Nearest-neighbor chain algorithm; Nearest neighbor search; Artificial intelligence; Pattern recognition (psychology); Cluster analysis","score_opus":0.009873257376333613,"score_gpt":0.19071500132972305,"score_spread":0.18084174395338942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043316303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043284267,0.0006424443,0.9551992,0.00042006018,0.00018292118,0.000051573465,6.244318e-7,0.000012340999,0.00020656762],"genre_scores_gemma":[0.9592718,0.000011516353,0.040253866,0.00009365906,0.00035091044,7.5874345e-7,0.0000011523603,0.0000053762583,0.000010968657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908304,0.000031801457,0.0002267867,0.00012572636,0.00017093589,0.00036169082],"domain_scores_gemma":[0.9995682,0.00008401326,0.000035657424,0.00012749387,0.00003852371,0.0001461023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003251175,0.00010403605,0.00015185203,0.00035200285,0.00007405356,0.0007426144,0.00073486846,0.000027285128,0.0000013216571],"category_scores_gemma":[0.000005292843,0.00007884067,0.000038066213,0.0005410609,0.000017717048,0.000528868,0.000043934702,0.00031467472,0.0000013227933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000401628,0.00008062661,0.012032182,0.000052161988,0.00007655284,0.0033462166,0.0009809051,0.16018438,0.000045325774,0.2903257,0.0034807196,0.5293912],"study_design_scores_gemma":[0.00020131798,0.000078783494,0.061461512,0.00002272406,0.0000032411342,0.00017203047,0.000010867226,0.9338335,0.000010456519,0.0008714408,0.0032282267,0.00010592708],"about_ca_topic_score_codex":0.001972189,"about_ca_topic_score_gemma":0.00053809246,"teacher_disagreement_score":0.91598755,"about_ca_system_score_codex":0.00004336549,"about_ca_system_score_gemma":0.00013839922,"threshold_uncertainty_score":0.71610475},"labels":[],"label_agreement":null},{"id":"W204411587","doi":"10.1007/978-3-642-40148-0_12","title":"Distributed B-Tree with Weak Consistency","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Computer science; Consistency (knowledge bases); Tree (set theory); Search engine indexing; B-tree; Cloud computing; Tree structure; R-tree; Data consistency; Distributed computing; Theoretical computer science; Data mining; Algorithm; Binary tree; Information retrieval; Mathematics; Artificial intelligence","score_opus":0.013474698375992309,"score_gpt":0.21483600062383063,"score_spread":0.20136130224783833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204411587","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.000008127046,0.0002131986,0.96952385,0.0010819463,0.00085339125,0.00049133785,0.000022763963,0.0002515643,0.027553812],"genre_scores_gemma":[0.016019998,0.000070501344,0.9767974,0.0017496641,0.0005481828,0.00003260199,0.00010369252,0.00006303678,0.0046149334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958789,0.000022693059,0.0004543071,0.0017343818,0.0011290691,0.00078066974],"domain_scores_gemma":[0.9969109,0.00022536208,0.00029246707,0.0020985012,0.00025798028,0.00021475327],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046064047,0.0006107432,0.0005379769,0.0006226047,0.00027490256,0.0013285059,0.0048349574,0.0001978705,0.00007541069],"category_scores_gemma":[0.000038801754,0.00047393932,0.00009705273,0.0007755839,0.0009247239,0.001463785,0.0021887384,0.0006328763,0.00030201953],"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.0000034282834,0.000035726414,0.00005904956,0.000036507183,0.000027656319,0.00015236916,0.00009657358,0.0019179905,0.000014177165,0.13105732,0.00065774104,0.86594146],"study_design_scores_gemma":[0.0012199067,0.0007345562,0.0006580887,0.0010176388,0.000049531685,0.00019208189,7.09769e-7,0.62916833,0.00046296898,0.29190105,0.071833156,0.002761981],"about_ca_topic_score_codex":0.000034127603,"about_ca_topic_score_gemma":0.0000918043,"teacher_disagreement_score":0.8631795,"about_ca_system_score_codex":0.00018249013,"about_ca_system_score_gemma":0.00035464295,"threshold_uncertainty_score":0.99977124},"labels":[],"label_agreement":null},{"id":"W2044762750","doi":"10.1007/s11390-010-9335-z","title":"Towards Progressive and Load Balancing Distributed Computation: A Case Study on Skyline Analysis","year":2010,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Data Management and Algorithms","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":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Skyline; Computer science; Load balancing (electrical power); Scalability; Distributed computing; Computation; Theory of computation; Distributed database; Load management; Data mining; Database; Algorithm","score_opus":0.009547070416137317,"score_gpt":0.2833963986359273,"score_spread":0.27384932821978997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044762750","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.5560525,0.000032952583,0.4419206,0.0016145738,0.0002487989,0.00008433715,0.0000012503069,0.00003464827,0.000010296107],"genre_scores_gemma":[0.922911,0.0000038141916,0.0769273,0.00008420334,0.00006813914,0.0000016932634,3.7548796e-7,0.0000020085217,0.0000014546146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985182,0.000022451775,0.0003204254,0.00035673077,0.00055753865,0.00022460625],"domain_scores_gemma":[0.9984855,0.000043620144,0.00030449659,0.0003275701,0.00072589924,0.00011290936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600286,0.000123846,0.0002829742,0.0011551027,0.0002645841,0.0004897622,0.0008601383,0.000047991165,9.724073e-7],"category_scores_gemma":[0.00007620148,0.00009197285,0.000031519347,0.00348793,0.00039762317,0.0008808418,0.00075552997,0.00032478344,7.3195747e-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.0000071576037,0.00042568165,0.015627932,0.000007768105,0.00023457168,0.007948131,0.0007915754,0.000119042226,0.0002575032,0.0066362326,0.00017492313,0.9677695],"study_design_scores_gemma":[0.0022040466,0.003688786,0.04113243,0.000038570528,0.00027525963,0.015468302,0.00093745376,0.9292258,0.0006911423,0.005166167,0.00072594633,0.0004460644],"about_ca_topic_score_codex":0.000009432163,"about_ca_topic_score_gemma":0.000013426702,"teacher_disagreement_score":0.9673234,"about_ca_system_score_codex":0.000027439692,"about_ca_system_score_gemma":0.0001602934,"threshold_uncertainty_score":0.4722788},"labels":[],"label_agreement":null},{"id":"W2046087084","doi":"10.3166/isi.13.5.131-154","title":"La notion de division tolérante et son intérêt pour remédier aux réponses vides","year":2008,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"","keywords":"INT; Philosophy; Humanities; Computer science","score_opus":0.03743520473531755,"score_gpt":0.2717675839899965,"score_spread":0.23433237925467895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046087084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13370353,0.00080244173,0.8332707,0.00212642,0.0014689445,0.00039891107,0.00006310008,0.00034466415,0.027821254],"genre_scores_gemma":[0.9615681,0.0013318278,0.032472204,0.0011805345,0.00019564897,0.000038693386,0.00020314638,0.000023133589,0.0029866847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972844,0.00043548987,0.0008061068,0.00029378012,0.0005488311,0.00063138455],"domain_scores_gemma":[0.9982364,0.00023277917,0.0004594418,0.0005542458,0.00035838422,0.00015875176],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001692093,0.00034852978,0.00030634503,0.0004158572,0.00065396016,0.0012064282,0.00073032035,0.00023687394,0.00007306653],"category_scores_gemma":[0.00061367574,0.00036293545,0.00014393766,0.00070327753,0.00034602868,0.018787635,0.00054660795,0.00033653763,0.0008160714],"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.000039570918,0.000119454526,0.0016321843,0.0005683008,0.000059627888,0.000067726905,0.021657502,0.0010940408,0.00013070932,0.06454338,0.01490672,0.89518076],"study_design_scores_gemma":[0.0016390415,0.00038468928,0.15018207,0.002084624,0.00007631824,0.00084065326,0.0014971878,0.4789743,0.0015090212,0.019728191,0.34191307,0.0011708112],"about_ca_topic_score_codex":0.00055213185,"about_ca_topic_score_gemma":0.000026483396,"teacher_disagreement_score":0.89400995,"about_ca_system_score_codex":0.00040647754,"about_ca_system_score_gemma":0.00041256042,"threshold_uncertainty_score":0.9999619},"labels":[],"label_agreement":null},{"id":"W2046470653","doi":"10.1109/itaic.2014.7065000","title":"Using data mining techniques to improve location based services","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Data mining; Process (computing); Location-based service; Service (business); Location data; Quality (philosophy); Data deduplication; Database","score_opus":0.04931969447216452,"score_gpt":0.30372076210289795,"score_spread":0.25440106763073345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046470653","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.0005925765,0.0000026207438,0.9950402,0.00065852783,0.00011766884,0.000109658555,0.000002743858,0.0002567689,0.0032192308],"genre_scores_gemma":[0.06465658,2.526977e-7,0.9327552,0.0023109193,0.000080107195,0.0000035940582,0.000037275415,0.000004206073,0.00015187153],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928147,0.000018144781,0.00009719159,0.0003454828,0.00013219153,0.00012551992],"domain_scores_gemma":[0.9986662,0.000020870082,0.000035402532,0.0011993358,0.000038788978,0.000039358114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189668,0.000064206935,0.000056678735,0.00008477441,0.00005710395,0.00032034272,0.0017130353,0.000015324335,0.0000059956005],"category_scores_gemma":[0.000012735164,0.000056448866,0.000006140701,0.00028969953,0.0000051142756,0.0013452193,0.0010963548,0.00002005137,0.000025286061],"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.0000011011022,0.000025057056,0.00017585949,0.000055233468,0.0000049854693,7.7452887e-7,0.00005964666,0.000067011904,0.0028134217,0.0070183966,0.0021744731,0.987604],"study_design_scores_gemma":[0.00004302895,0.000023605106,0.00009071003,0.000021996579,0.0000030253327,1.6335248e-7,0.000014743904,0.9705116,0.006038742,0.00011156029,0.023049591,0.00009121076],"about_ca_topic_score_codex":0.00014216143,"about_ca_topic_score_gemma":0.000028295579,"teacher_disagreement_score":0.9875128,"about_ca_system_score_codex":0.00000908987,"about_ca_system_score_gemma":0.000011957856,"threshold_uncertainty_score":0.31832743},"labels":[],"label_agreement":null},{"id":"W2046883796","doi":"10.1016/j.jspi.2003.11.010","title":"Calibrated random imputation for qualitative data","year":2004,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Data Management and Algorithms","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Mathematics; Imputation (statistics); Statistics; Econometrics; Missing data","score_opus":0.09948713495637404,"score_gpt":0.40970737181317,"score_spread":0.310220236856796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046883796","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.0017876723,0.000098086035,0.997264,0.00044713134,0.00013126657,0.000061914376,0.00011964768,0.000012471866,0.000077805],"genre_scores_gemma":[0.4584355,0.00001713556,0.5412897,0.00012338939,0.00005302365,0.0000010341427,0.000065555425,0.0000029141431,0.000011785801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921924,0.00004750603,0.0002966692,0.00014619043,0.00016920238,0.00012118255],"domain_scores_gemma":[0.99858594,0.00089913706,0.00018103093,0.00014013173,0.00011259452,0.00008115663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007530906,0.000069787326,0.00016051964,0.00006856442,0.00007035188,0.00023128759,0.00045598892,0.00002093282,0.0000023342302],"category_scores_gemma":[0.0008048275,0.000052945197,0.000011823369,0.00009783439,0.000048512764,0.0013168035,0.00013919856,0.000099124656,0.0000014912],"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.00028107417,0.00014126262,0.00020566702,0.00011688211,0.0001444005,0.00015391149,0.011644933,0.0024776838,0.00013436029,0.8395093,0.009851605,0.13533892],"study_design_scores_gemma":[0.006846622,0.0011962753,0.0028072726,0.00032000698,0.00007004965,0.000059879938,0.001831914,0.44643733,0.000102718746,0.53787273,0.0021153137,0.00033990678],"about_ca_topic_score_codex":0.0000083711875,"about_ca_topic_score_gemma":4.051165e-7,"teacher_disagreement_score":0.45664784,"about_ca_system_score_codex":0.000009944793,"about_ca_system_score_gemma":0.000073794436,"threshold_uncertainty_score":0.22303115},"labels":[],"label_agreement":null},{"id":"W2047152207","doi":"10.3390/ijgi2010001","title":"A Bottom-Up Approach for Automatically Grouping Sensor Data Layers by their Observed Property","year":2013,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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":"Alberta Innovates; Canarie; Microsoft Research","keywords":"Computer science; Geospatial analysis; Data mining; Cluster analysis; Information retrieval; Sensor web; Set (abstract data type); Data set; Matching (statistics); Database; Artificial intelligence; Geography; Remote sensing; Mathematics","score_opus":0.04152532853080417,"score_gpt":0.25468914909149054,"score_spread":0.21316382056068636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047152207","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.001795899,0.0000151709755,0.99110436,0.0032876448,0.0022927383,0.00042238607,0.00015652871,0.00006006975,0.0008652241],"genre_scores_gemma":[0.12612697,0.000081877355,0.865339,0.004163971,0.0011432909,0.00006527187,0.002341839,0.000019457104,0.0007183279],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980757,0.000037240065,0.00076952216,0.00013811025,0.0007624844,0.00021689505],"domain_scores_gemma":[0.9978086,0.00007693429,0.00066367874,0.00043467252,0.0009239405,0.00009222215],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0009174449,0.0001495389,0.00017849453,0.0002318714,0.000096311735,0.0014041814,0.0032133767,0.000058091406,0.000018697223],"category_scores_gemma":[0.00024891665,0.00009709054,0.00008899375,0.00013994909,0.000028390228,0.020567311,0.00057247176,0.00018362336,0.000048202117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006298324,0.00016366372,0.00018810223,0.00010584941,0.00047292447,0.0000018767249,0.0015961486,0.0004451805,0.0003839572,0.0058238017,0.5149599,0.47579566],"study_design_scores_gemma":[0.0010487718,0.000078586156,0.0004311883,0.000047170746,0.000013302159,0.000038938633,0.00037522637,0.90691,0.00018180221,0.0006277735,0.09007829,0.00016892665],"about_ca_topic_score_codex":0.000045929686,"about_ca_topic_score_gemma":4.743565e-7,"teacher_disagreement_score":0.9064649,"about_ca_system_score_codex":0.00008184973,"about_ca_system_score_gemma":0.00007488886,"threshold_uncertainty_score":0.9996325},"labels":[],"label_agreement":null},{"id":"W2047363895","doi":"10.1145/512161.512167","title":"A map generalization model based on algebra mapping transformation","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"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":"Technische Universiteit Delft; McMaster University","keywords":"Cartographic generalization; Generalization; Transformation (genetics); Intersection (aeronautics); Computer science; Orientation (vector space); Abstraction; Spatial relationship; Mathematics; Artificial intelligence; Topology (electrical circuits); Geography; Cartography; Geometry; Combinatorics","score_opus":0.024899200540549053,"score_gpt":0.23033611384545158,"score_spread":0.20543691330490252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047363895","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.00048537974,0.0000026721352,0.9682133,0.0030391219,0.00009168583,0.000111831236,0.0000010314332,0.0002014716,0.027853489],"genre_scores_gemma":[0.5101922,0.000023238288,0.47614196,0.008133262,0.00008827369,0.000029442439,0.00016988322,0.000012190979,0.005209519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938375,0.000013417981,0.000115864765,0.00016510196,0.0001907042,0.00013116219],"domain_scores_gemma":[0.99966264,0.0000060181164,0.00002360304,0.0002580435,0.000019464314,0.000030228679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013252343,0.00006931577,0.000048162055,0.00013353625,0.000069777685,0.00017510995,0.00032904456,0.000018939549,0.000041862746],"category_scores_gemma":[0.0000016012071,0.00006109064,0.000024964238,0.00021888375,0.000004641578,0.0010882687,0.000028405506,0.000027606053,0.00012741452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003995423,0.000082034654,0.000051725063,0.000020098198,0.0000061289506,0.0000047828094,0.00034129038,0.2175471,0.00015248953,0.5837551,0.008063051,0.18997222],"study_design_scores_gemma":[0.00022155688,0.000015076883,0.000060473994,0.0000063695443,0.0000012885266,3.124411e-7,0.0000069630883,0.9874643,0.00016914328,0.0031847577,0.008781673,0.00008806075],"about_ca_topic_score_codex":0.0000069542357,"about_ca_topic_score_gemma":0.0000026052915,"teacher_disagreement_score":0.7699172,"about_ca_system_score_codex":0.000017227463,"about_ca_system_score_gemma":0.000010100304,"threshold_uncertainty_score":0.2491204},"labels":[],"label_agreement":null},{"id":"W2049086388","doi":"10.1038/nmeth.2337","title":"Axes, ticks and grids","year":2013,"lang":"en","type":"article","venue":"Nature Methods","topic":"Data Management and Algorithms","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":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Computer science; Biology; Computational biology; Human–computer interaction","score_opus":0.010128289303103255,"score_gpt":0.33023298427380393,"score_spread":0.32010469497070065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049086388","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.00044265372,0.0011319796,0.98223156,0.0020273363,0.00078993756,0.00012539799,0.0000010340044,0.00012434658,0.013125756],"genre_scores_gemma":[0.0044057616,0.000034139735,0.99153763,0.0013101064,0.00011512322,0.000010092965,0.0000028786174,0.000004766711,0.0025795072],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992587,0.00011579557,0.000084431675,0.00026772282,0.00010586089,0.00016748653],"domain_scores_gemma":[0.9993343,0.00011442003,0.00002787024,0.00042481863,0.00003474069,0.00006387468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005908879,0.00008671544,0.00009713353,0.00006939295,0.000056773508,0.0002887921,0.00058009295,0.00010231937,0.000046136745],"category_scores_gemma":[0.00008876407,0.00006654825,0.000021836931,0.00023821676,0.000025313167,0.0007044191,0.00044547764,0.00028307308,0.00005344495],"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":[2.0894068e-7,0.000007654451,0.00008309645,0.000006639243,0.000008079081,0.0000018392311,0.000048807753,1.995328e-7,0.00027715327,0.042576972,0.020609897,0.93637943],"study_design_scores_gemma":[0.0003588049,0.000062382096,0.019731836,0.00001474762,0.000014740176,0.000015414247,0.000032059383,0.05828384,0.0026931735,0.07218305,0.8462387,0.0003712594],"about_ca_topic_score_codex":0.00001979111,"about_ca_topic_score_gemma":6.9097655e-7,"teacher_disagreement_score":0.9360082,"about_ca_system_score_codex":0.000006373058,"about_ca_system_score_gemma":0.000006558346,"threshold_uncertainty_score":0.27848288},"labels":[],"label_agreement":null},{"id":"W2049619678","doi":"10.1007/s10115-012-0486-9","title":"Skyline distance: a measure of multidimensional competence","year":2012,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Scalability; Measure (data warehouse); Data mining; sort; Point (geometry); Theoretical computer science; Information retrieval; Database; Mathematics","score_opus":0.01418241925939989,"score_gpt":0.23315883989896102,"score_spread":0.21897642063956113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049619678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033405975,0.0033215852,0.9514333,0.000060638136,0.0014322628,0.00028721656,0.000025708483,0.00008880316,0.040009916],"genre_scores_gemma":[0.99576306,0.000036055393,0.0038386858,0.000030718566,0.000079681464,0.000010174391,0.000027456255,0.0000016335963,0.00021253161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930674,0.000027014634,0.0002894177,0.000059171958,0.00018225613,0.00013541074],"domain_scores_gemma":[0.99942154,0.000028643492,0.00013028945,0.00020192518,0.0001519318,0.000065660875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046032542,0.00007165393,0.00011751843,0.00008997624,0.00006108734,0.00006340846,0.00019347519,0.000025176354,0.0000024516528],"category_scores_gemma":[0.00001853964,0.00005688281,0.000019303772,0.00020369703,0.000024199218,0.0057027387,0.00014799651,0.0000378466,0.00010923727],"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.0000050340564,0.00007576064,0.0036077525,0.00034536762,0.000024233916,1.7396641e-7,0.004354739,0.00001837429,0.00007525786,0.9212184,0.0065816618,0.063693255],"study_design_scores_gemma":[0.0005551383,0.000034496064,0.008187594,0.00013751096,0.0000067717956,0.000010746594,0.00035390485,0.18046011,0.0001961503,0.000022006117,0.8098569,0.00017869078],"about_ca_topic_score_codex":0.0000066509297,"about_ca_topic_score_gemma":5.210117e-7,"teacher_disagreement_score":0.99242246,"about_ca_system_score_codex":0.000010842768,"about_ca_system_score_gemma":0.000014995844,"threshold_uncertainty_score":0.41343477},"labels":[],"label_agreement":null},{"id":"W2050175694","doi":"10.1007/s10115-012-0527-4","title":"A new approach for maximizing bichromatic reverse nearest neighbor search","year":2012,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":33,"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":"National Natural Science Foundation of China; National Science Foundation","keywords":"k-nearest neighbors algorithm; Best bin first; Nearest neighbor search; Large margin nearest neighbor; Nearest-neighbor chain algorithm; Computer science; Nearest neighbor graph; Metric space; Metric (unit); Fixed-radius near neighbors; Algorithm; Space (punctuation); Mathematics; Data mining; Artificial intelligence; Discrete mathematics; Cluster analysis","score_opus":0.036402218891202674,"score_gpt":0.26517865462145235,"score_spread":0.22877643573024967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050175694","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.00014003807,0.00047199382,0.9495576,0.00007064566,0.0005907592,0.0005529718,0.0000066865114,0.00009239161,0.04851689],"genre_scores_gemma":[0.5731216,0.00016845971,0.4081356,0.0005066012,0.0021521868,0.000368729,0.0004834361,0.000031525928,0.015031831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916464,0.0000319903,0.00028603707,0.00010098317,0.00014784659,0.00026852422],"domain_scores_gemma":[0.99935913,0.000043880344,0.00008331051,0.0002934078,0.00007390276,0.00014634628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007358426,0.000099764984,0.00013574003,0.00016668257,0.00014781459,0.00056286325,0.0003369793,0.00004125321,0.000005026831],"category_scores_gemma":[0.000024852758,0.000083644,0.00003053297,0.0002835173,0.000011017908,0.008684679,0.00019982267,0.000049562357,0.0003199797],"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.0000086181535,0.00007138297,0.0005260217,0.0019076054,0.00006284449,2.1219203e-7,0.015743406,0.00007254089,0.000016200023,0.4417636,0.19869615,0.34113142],"study_design_scores_gemma":[0.00048854563,0.000023412547,0.00033161108,0.000040334304,0.000007831654,0.000009412418,0.0006599497,0.44692242,0.000018751047,0.000015382082,0.5513446,0.00013777323],"about_ca_topic_score_codex":0.00003185462,"about_ca_topic_score_gemma":2.757121e-7,"teacher_disagreement_score":0.5729816,"about_ca_system_score_codex":0.000027137017,"about_ca_system_score_gemma":0.000039687537,"threshold_uncertainty_score":0.6296183},"labels":[],"label_agreement":null},{"id":"W2050599442","doi":"10.1023/b:gein.0000034819.57376.92","title":"Development of a Temporal Extension to Query Travel Behavior Time Paths Using an Object-Oriented GIS","year":2004,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"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é Laval; Université de Montréal","funders":"","keywords":"Computer science; Chaining; Temporal database; Set (abstract data type); Extension (predicate logic); Operator (biology); Data mining; Path (computing); Data model (GIS); Object (grammar); Event (particle physics); Spatiotemporal database; Spatial query; Query language; Information retrieval; Database; Database design; View; Artificial intelligence; Web query classification; Web search query; Programming language; Search engine","score_opus":0.02474059615807743,"score_gpt":0.25684331491594886,"score_spread":0.23210271875787142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050599442","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.41402596,0.0000027629244,0.58478487,0.000038059294,0.00012154424,0.00033154397,0.0000083127525,0.00008207915,0.00060487806],"genre_scores_gemma":[0.1348328,5.2584437e-7,0.86478245,0.0001910897,0.000016688491,0.000016254333,0.000058432186,0.000007764446,0.000093988674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854773,0.0000114850845,0.0005200049,0.00020218614,0.00040908766,0.0003094948],"domain_scores_gemma":[0.9990606,0.0000068240042,0.00013455021,0.0005670806,0.00007819751,0.00015276246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003546863,0.00015031344,0.00019751054,0.0002148408,0.00013690823,0.00010704213,0.0005681421,0.00003696329,0.000020180194],"category_scores_gemma":[0.00001256372,0.00013526081,0.00004044109,0.0004167421,0.000022632781,0.0017207463,0.00043557127,0.000061423016,0.00021214093],"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.00005904404,0.0023086423,0.00026802166,0.0003633396,0.000115240546,0.00016094637,0.088814676,0.0019553106,0.020971442,0.019254053,0.00092480105,0.8648045],"study_design_scores_gemma":[0.0067800046,0.0017017218,0.05484836,0.0012647016,0.00019297031,0.000207456,0.0075568664,0.83550555,0.064104736,0.0013222668,0.022857634,0.0036577466],"about_ca_topic_score_codex":0.000058421778,"about_ca_topic_score_gemma":0.000008310077,"teacher_disagreement_score":0.86114675,"about_ca_system_score_codex":0.000066234184,"about_ca_system_score_gemma":0.00015357365,"threshold_uncertainty_score":0.55157757},"labels":[],"label_agreement":null},{"id":"W2051275384","doi":"10.1145/2187836.2187902","title":"A flexible generative model for preference aggregation","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":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; Benchmark (surveying); Pairwise comparison; Inference; Preference; Ranking (information retrieval); Variety (cybernetics); Machine learning; Generative model; Collaborative filtering; Artificial intelligence; Aggregation problem; Probabilistic logic; Preference learning; Face (sociological concept); Bayesian inference; Recommender system; Data mining; Generative grammar; Bayesian probability; Mathematics","score_opus":0.11944296328508364,"score_gpt":0.2918070294794631,"score_spread":0.17236406619437944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051275384","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.00031017698,0.000032824908,0.99034864,0.0003043956,0.00014048303,0.00017795287,0.0000037924,0.000121500336,0.0085602235],"genre_scores_gemma":[0.18087293,0.0000068238537,0.7998625,0.0004193097,0.000092202434,0.00006622853,0.000016691067,0.0000032050923,0.018660093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952585,0.0000068078875,0.00006787787,0.0001343863,0.000087706816,0.0001773826],"domain_scores_gemma":[0.99966186,0.000014593713,0.000025297823,0.00022433353,0.000031429725,0.000042468255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014631203,0.000054087952,0.000044998797,0.000034839428,0.00006295708,0.00010541039,0.00033618615,0.000014126301,0.000008644618],"category_scores_gemma":[0.000008843133,0.000043399912,0.000018815794,0.00009556924,0.000006873067,0.0017771837,0.00014287092,0.000018018742,0.000041741907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011820551,0.000035993526,0.000056294324,0.0000052799214,0.000006200831,3.3013816e-8,0.00037216407,0.00051266974,0.00010284822,0.86924696,0.012113126,0.11754723],"study_design_scores_gemma":[0.000111705565,0.000013456478,0.000059703652,0.0000020204532,0.0000022538004,1.7363033e-7,0.000006343968,0.97803736,0.00579278,0.012386496,0.0035153334,0.000072377945],"about_ca_topic_score_codex":0.0000029838866,"about_ca_topic_score_gemma":0.0000017543699,"teacher_disagreement_score":0.9775247,"about_ca_system_score_codex":0.000010402073,"about_ca_system_score_gemma":0.000011060149,"threshold_uncertainty_score":0.1769797},"labels":[],"label_agreement":null},{"id":"W2051379876","doi":"10.1080/10824000409480666","title":"Personalized Multi-Criteria Decision Strategies in Location-Based Decision Support","year":2004,"lang":"en","type":"article","venue":"Annals of GIS","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":67,"is_retracted":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; Decision support system; Space (punctuation); Outcome (game theory); Decision analysis; Decision model; Operator (biology); Data mining; Machine learning; Mathematics","score_opus":0.07183809637024421,"score_gpt":0.36353243949977015,"score_spread":0.2916943431295259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051379876","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.054547656,0.00011600953,0.94355,0.0011382429,0.00016957262,0.00013187766,0.000008810192,0.00004405852,0.00029379927],"genre_scores_gemma":[0.75405854,0.00005610767,0.24523753,0.0005151865,0.000017138236,0.000007366206,0.000024053543,0.0000061155624,0.00007798048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882525,0.000023931918,0.00030896446,0.00030343432,0.00033489268,0.00020354164],"domain_scores_gemma":[0.9991432,0.00009100221,0.000090667214,0.00047182117,0.00014993388,0.000053388736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048596354,0.00011226375,0.0001661413,0.00024559547,0.000041544405,0.00018192914,0.0007721135,0.00003942466,0.00006203375],"category_scores_gemma":[0.00008806095,0.00010274985,0.000058044858,0.0005516404,0.00005167915,0.0011070529,0.00014447892,0.00005305039,0.000060364568],"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.00024904445,0.001906898,0.0016848044,0.00015480595,0.0000527677,0.00022055015,0.0029963502,0.01583969,0.0014054105,0.10160284,0.01403269,0.85985416],"study_design_scores_gemma":[0.02171462,0.001879817,0.21874966,0.0021438675,0.00003405341,0.000013299084,0.001701185,0.4819238,0.030952282,0.17618941,0.062429726,0.0022682906],"about_ca_topic_score_codex":0.00017985786,"about_ca_topic_score_gemma":0.000088087,"teacher_disagreement_score":0.85758585,"about_ca_system_score_codex":0.00001308714,"about_ca_system_score_gemma":0.0001319003,"threshold_uncertainty_score":0.41900173},"labels":[],"label_agreement":null},{"id":"W2051586036","doi":"10.1109/iccsit.2009.5234622","title":"A Ranking Theory for Uncertain Data with Constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Ranking (information retrieval); Polyhedron; Object (grammar); Space (punctuation); Computation; Computer science; Theoretical computer science; Mathematics; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.045467416384539494,"score_gpt":0.290167778197072,"score_spread":0.24470036181253252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051586036","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.00004283443,0.000014045764,0.97720826,0.0013694772,0.00005119678,0.00018510684,0.000013527516,0.0001223326,0.020993251],"genre_scores_gemma":[0.1396738,0.0000041982803,0.85478985,0.0030191408,0.00007280625,0.000006313502,0.00011267272,0.000004398424,0.0023168118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932295,0.00001528816,0.000073885676,0.00030700152,0.0001127757,0.00016809028],"domain_scores_gemma":[0.99900836,0.00007068938,0.000026136584,0.0008471335,0.000018663204,0.00002904095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050529523,0.000067000874,0.00006816992,0.00003701401,0.00006564923,0.00020988045,0.0015573909,0.000010754715,0.00002672243],"category_scores_gemma":[0.000019373065,0.000045512792,0.000010771688,0.00012984216,0.00003648775,0.0009042969,0.00021444043,0.000027417982,0.0000108638305],"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.00000461152,0.000013345373,0.000006198499,0.0000018401194,0.000007348537,0.0000045905613,0.000024277626,0.000003304946,0.0000063820435,0.5210868,0.0033180339,0.47552326],"study_design_scores_gemma":[0.0033414173,0.00057398266,0.00075239147,0.00007607464,0.000043427,0.000029795425,0.00027399653,0.5868574,0.0003289068,0.30064532,0.10635935,0.0007179659],"about_ca_topic_score_codex":0.000002036659,"about_ca_topic_score_gemma":0.0000026343414,"teacher_disagreement_score":0.5868541,"about_ca_system_score_codex":0.000004577566,"about_ca_system_score_gemma":0.000021681411,"threshold_uncertainty_score":0.28940457},"labels":[],"label_agreement":null},{"id":"W2051894417","doi":"10.3166/geo.19.211-230","title":"Une architecture orientée service web pour la constitution de minicubes SOLAP pour clients mobiles","year":2009,"lang":"fr","type":"article","venue":"Revue internationale de géomatique","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Computer science","score_opus":0.0182750614185143,"score_gpt":0.26783736690888854,"score_spread":0.24956230549037425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051894417","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.14256741,0.0008492909,0.69778156,0.11694735,0.0015273745,0.0004885671,0.00016878267,0.00022198311,0.03944766],"genre_scores_gemma":[0.6988125,0.0013528764,0.22225374,0.008032817,0.0019006786,0.000091537746,0.0002908434,0.000039276412,0.06722575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997751,0.00031278667,0.00050297304,0.0005657378,0.00035333226,0.0005141626],"domain_scores_gemma":[0.9983538,0.00036945567,0.00028351165,0.0004967685,0.00030986822,0.00018663023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007164054,0.00031205022,0.0002667881,0.00023899523,0.00013470677,0.0005516847,0.001398372,0.00020779997,0.000105932035],"category_scores_gemma":[0.00025204467,0.0003521002,0.00014678168,0.00053474976,0.00010278048,0.0009453776,0.00028923407,0.0003877976,0.00038042662],"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.000019300409,0.0007603042,0.0024228122,0.00030403127,0.00013445066,0.00044054817,0.0026204856,0.006682183,0.0015380858,0.6946428,0.015648052,0.27478695],"study_design_scores_gemma":[0.0012247409,0.00010687467,0.02474281,0.0019048281,0.00007563774,0.0010816265,0.00019315485,0.5674391,0.0010217619,0.09476769,0.3068175,0.0006243094],"about_ca_topic_score_codex":0.00047146782,"about_ca_topic_score_gemma":0.0004547539,"teacher_disagreement_score":0.5998751,"about_ca_system_score_codex":0.0003277772,"about_ca_system_score_gemma":0.0005352082,"threshold_uncertainty_score":0.99989307},"labels":[],"label_agreement":null},{"id":"W2051942744","doi":"10.3166/isi.14.1.13-17","title":"Gestion de données de capteurs","year":2009,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Scalability; Computer science; Wireless sensor network; Distributed computing; Stream processing; Domain (mathematical analysis); Real-time computing; Computer network; Database; Mathematics","score_opus":0.02480946168187863,"score_gpt":0.23639834988650693,"score_spread":0.2115888882046283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051942744","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.020266706,0.0013167082,0.944116,0.0057485183,0.0013639597,0.00030760936,0.00003079286,0.0003356335,0.026514068],"genre_scores_gemma":[0.89090085,0.001212654,0.099807486,0.0035055403,0.00055956055,0.00002795494,0.00020824105,0.000014636524,0.0037630529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982251,0.00011913013,0.0005137261,0.00017634535,0.00031019186,0.0006555152],"domain_scores_gemma":[0.99892074,0.000051665284,0.00027356792,0.0004091424,0.00017881926,0.00016604322],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0010252502,0.00022785085,0.00018103358,0.0002652451,0.0003353934,0.0016581012,0.0006734634,0.00017746315,0.00004055663],"category_scores_gemma":[0.00026035015,0.00025588938,0.00008088444,0.0005792,0.00012939656,0.01423719,0.0001336305,0.00021668701,0.00044348283],"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.00000808904,0.000040618754,0.00029796493,0.00018703687,0.000016794851,0.00001462341,0.007383873,0.0014477008,0.0000321259,0.15339686,0.007802102,0.8293722],"study_design_scores_gemma":[0.00078623544,0.00042857538,0.06434907,0.0010715794,0.00007009177,0.00027601534,0.00094395055,0.67694384,0.00075758254,0.09868343,0.15497316,0.00071644457],"about_ca_topic_score_codex":0.00038937424,"about_ca_topic_score_gemma":0.000013089959,"teacher_disagreement_score":0.87063414,"about_ca_system_score_codex":0.00058441877,"about_ca_system_score_gemma":0.00017311443,"threshold_uncertainty_score":0.99998933},"labels":[],"label_agreement":null},{"id":"W2052535241","doi":"10.1145/1317331.1317343","title":"Efficient computation of view subsets","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Concordia University; Carleton University","funders":"","keywords":"Computer science; Suite; Table (database); Schema (genetic algorithms); Dimension (graph theory); Computation; Identification (biology); Greedy algorithm; Theoretical computer science; Data mining; Algorithm; Information retrieval; Mathematics","score_opus":0.016935490035266242,"score_gpt":0.268427751283041,"score_spread":0.2514922612477748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052535241","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.012765361,0.000040083978,0.97104245,0.000120275145,0.00015781017,0.000058833677,3.3713005e-7,0.00005783829,0.015757019],"genre_scores_gemma":[0.89007133,0.0000020288526,0.109613,0.00012063032,0.000012530342,3.496193e-7,0.0000026515938,0.0000014722149,0.00017599776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950117,0.000006789411,0.00012658752,0.00011246405,0.00015307254,0.00009988972],"domain_scores_gemma":[0.99972945,0.00002108633,0.00003815503,0.00015744873,0.000029536192,0.000024292449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038556245,0.00003707047,0.00005335505,0.00006459325,0.000019131932,0.000026925482,0.0002920396,0.00000869889,0.0000093907665],"category_scores_gemma":[0.0000041874637,0.00003055364,0.00001819996,0.00026377826,0.000011967321,0.00008362509,0.00013294717,0.000016918766,0.000059016216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013959454,0.000104998886,0.00021402843,0.00002725359,0.000008238271,0.000008225471,0.00013906542,0.0012115174,0.00018005431,0.2302501,0.001630092,0.76622504],"study_design_scores_gemma":[0.00032613418,0.000051818224,0.020277802,0.00002221201,0.0000043637924,0.0000022479728,0.00003343921,0.96858454,0.0036923962,0.0014773331,0.005382321,0.00014542208],"about_ca_topic_score_codex":0.00000979379,"about_ca_topic_score_gemma":0.0000028475617,"teacher_disagreement_score":0.967373,"about_ca_system_score_codex":0.000005742889,"about_ca_system_score_gemma":0.000004352064,"threshold_uncertainty_score":0.12459414},"labels":[],"label_agreement":null},{"id":"W2053271839","doi":"10.1145/2451716.2451721","title":"Testing of sensor observation services","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Sensor web; Server; Computer science; Web service; Geospatial analysis; Web Coverage Service; Web server; Service (business); Response time; Interface (matter); Database; World Wide Web; Operating system; Remote sensing; The Internet; Web application security; Web development; Wireless; Key distribution in wireless sensor networks","score_opus":0.05635409759770819,"score_gpt":0.25299471952412333,"score_spread":0.19664062192641515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053271839","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.3767732,0.000056672485,0.57409173,0.00045410055,0.00048708642,0.00012152146,0.0000018504345,0.00028482082,0.047729015],"genre_scores_gemma":[0.4245627,4.7167742e-7,0.57446903,0.00020985055,0.000057482237,9.903413e-7,0.0000030741455,0.0000015880603,0.0006948068],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99967045,0.000007082105,0.00007400371,0.000062464846,0.000088921835,0.000097083954],"domain_scores_gemma":[0.9997016,0.000028904513,0.000038814862,0.00018239919,0.000027991238,0.000020250287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014550051,0.000030552565,0.000035920944,0.000024367167,0.000019390629,0.000032658616,0.00027471624,0.000007545736,0.000008874262],"category_scores_gemma":[0.0000079675465,0.000024804747,0.0000079508745,0.00020933872,0.0000038947387,0.0012962695,0.00016045662,0.0000124099215,0.000036786143],"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":[5.9525735e-7,0.000101126134,0.38370094,0.00011799135,0.00001471045,7.7692044e-7,0.00055709766,0.000018994768,0.004824742,0.16591494,0.0007187677,0.44402933],"study_design_scores_gemma":[0.00018516796,0.000044658856,0.72176087,0.00002816295,0.000007617821,0.0000018281017,0.00016423795,0.24855092,0.008796201,0.0010532034,0.01921954,0.00018760594],"about_ca_topic_score_codex":0.000048521786,"about_ca_topic_score_gemma":9.911375e-7,"teacher_disagreement_score":0.44384173,"about_ca_system_score_codex":0.000002326255,"about_ca_system_score_gemma":0.000001935453,"threshold_uncertainty_score":0.101150826},"labels":[],"label_agreement":null},{"id":"W2053495332","doi":"10.1145/2487259.2487260","title":"Analysis and optimization for boolean expression indexing","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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":"Computer science; Regular expression; Theoretical computer science; Search engine indexing; Boolean expression; Tree (set theory); Matching (statistics); Search tree; Data structure; Tree structure; String searching algorithm; Data mining; Algorithm; Pattern matching; Boolean function; Binary tree; Search algorithm; Artificial intelligence; Mathematics","score_opus":0.020552758876912467,"score_gpt":0.24775622824136947,"score_spread":0.227203469364457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053495332","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.0003914545,0.000041582414,0.9981969,0.00022730627,0.00026217703,0.000530267,0.00015028393,0.00012709828,0.000072907314],"genre_scores_gemma":[0.38741016,0.00008587718,0.61034596,0.00013289087,0.00007654499,0.0005278687,0.0005072822,0.000019338942,0.0008940978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990009,0.000045182387,0.00020568036,0.00039599263,0.00017922376,0.00017301424],"domain_scores_gemma":[0.9986489,0.00011061675,0.000073706135,0.0010358325,0.000050739596,0.00008023167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022166144,0.000116476396,0.00015047041,0.00037008352,0.00023895894,0.0004355764,0.00054704177,0.00003344342,0.000034759116],"category_scores_gemma":[0.000018121833,0.00010305583,0.000055849938,0.0005670465,0.000015545751,0.0017034339,0.00003776483,0.00006387971,0.000017911809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003034396,0.00050477654,0.0005412012,0.00054273335,0.0012337852,0.000008495736,0.00063190656,0.5774015,0.002565795,0.0054659275,0.0058434093,0.4052301],"study_design_scores_gemma":[0.00029476287,0.000034088855,0.00007666843,0.00004643125,0.000092548355,0.0000013838508,0.00010575532,0.9966292,0.000662424,0.000037874648,0.0018685496,0.00015030759],"about_ca_topic_score_codex":0.00022573664,"about_ca_topic_score_gemma":0.000009032257,"teacher_disagreement_score":0.41922766,"about_ca_system_score_codex":0.000017265134,"about_ca_system_score_gemma":0.000007827476,"threshold_uncertainty_score":0.42024946},"labels":[],"label_agreement":null},{"id":"W2053777878","doi":"10.5555/2133036.2133059","title":"I/O-efficient contour queries on terrains","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Combinatorics; Set (abstract data type); Terrain; Mathematics; sort; Plane (geometry); Triangulation; Function (biology); Connected component; Contour line; Geometry; Computer science; Geography; Arithmetic; Cartography","score_opus":0.04463725236995688,"score_gpt":0.23084366078490784,"score_spread":0.18620640841495095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053777878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003957198,0.0000073687893,0.5586312,0.0004393054,0.00040358191,0.000086328844,0.000001494733,0.0002550094,0.43621853],"genre_scores_gemma":[0.8997416,0.0000031721538,0.08543594,0.0018310627,0.00005848641,0.0000107670085,0.0000023961688,0.0000059179315,0.012910649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994086,0.000012134478,0.00008078152,0.00020717141,0.00013388447,0.00015744039],"domain_scores_gemma":[0.99948627,0.0000095448895,0.000021985728,0.0004254027,0.0000141067385,0.000042684926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010953834,0.00007001717,0.00005789781,0.000057030942,0.000053852065,0.00008230754,0.0006364086,0.00001296662,0.00018273793],"category_scores_gemma":[0.0000075037465,0.000052037263,0.000025675809,0.00010886072,0.0000262689,0.00015062858,0.0002411445,0.00003433122,0.0004755075],"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.0000021092233,0.000097867865,0.00006721041,0.0000019415131,0.000007452682,0.00001536684,0.00073139224,0.000007542706,0.0000119569395,0.93555737,0.008992998,0.054506794],"study_design_scores_gemma":[0.0018821589,0.0013497112,0.046525408,0.000061728664,0.000019923977,0.000012718512,0.0011762918,0.5360339,0.009285743,0.01942055,0.3826448,0.001587034],"about_ca_topic_score_codex":0.00005383253,"about_ca_topic_score_gemma":0.000009250399,"teacher_disagreement_score":0.9161368,"about_ca_system_score_codex":0.000007930143,"about_ca_system_score_gemma":0.000006784553,"threshold_uncertainty_score":0.61118454},"labels":[],"label_agreement":null},{"id":"W2054815985","doi":"10.5555/1639809.1639942","title":"Adaptive web navigation","year":2009,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Data Management and Algorithms","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; Expansive; Task (project management); Field (mathematics); Preprocessor; Web application; Range (aeronautics); The Internet; Data mining; World Wide Web; Artificial intelligence; Engineering; Systems engineering","score_opus":0.03511111319707586,"score_gpt":0.28704466436199266,"score_spread":0.2519335511649168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054815985","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.04799327,0.000013362406,0.94885635,0.00028528602,0.00016290478,0.00015317237,0.0000014583311,0.00029527425,0.0022389211],"genre_scores_gemma":[0.92926306,0.0000028963589,0.07043098,0.00013672143,0.00004552216,0.000002271549,0.0000056246854,0.0000030770723,0.00010985757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991065,0.000028900293,0.00016771442,0.00029716117,0.00021969766,0.00018001406],"domain_scores_gemma":[0.999309,0.000062695515,0.00007748543,0.00040774085,0.00009017106,0.000052923715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001467935,0.00010595506,0.0000871165,0.00008680516,0.000104619154,0.00023585687,0.00051094097,0.00003249769,0.000010288722],"category_scores_gemma":[0.000036650308,0.00010702516,0.000029584638,0.00022301392,0.000015553775,0.0012260841,0.00009608257,0.0000869615,0.00013493355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068990034,0.000077999284,0.001104672,0.0000063114576,0.000009963286,0.000009586584,0.0003298532,0.11447963,0.0016277111,0.32877618,0.000017868488,0.55355334],"study_design_scores_gemma":[0.00026011912,0.00003846516,0.028675575,0.000026915399,0.000003027454,2.2467482e-7,0.000009702552,0.9660842,0.00034447244,0.0036968887,0.00072432286,0.00013609942],"about_ca_topic_score_codex":0.000013682575,"about_ca_topic_score_gemma":0.0000014776052,"teacher_disagreement_score":0.8812698,"about_ca_system_score_codex":0.000027917593,"about_ca_system_score_gemma":0.000024750345,"threshold_uncertainty_score":0.43643594},"labels":[],"label_agreement":null},{"id":"W2055028639","doi":"10.1145/1460797.1460801","title":"On domination game analysis for microeconomic data mining","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Data Management and Algorithms","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 British Columbia","funders":"National University of Singapore","keywords":"Nash equilibrium; Game theory; Dimension (graph theory); Product (mathematics); Commodity; Computer science; Point (geometry); Best response; Space (punctuation); Mathematical economics; Economics; Mathematics","score_opus":0.07051834428210217,"score_gpt":0.3199586946775136,"score_spread":0.2494403503954114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055028639","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.0044774367,0.00010304156,0.9809259,0.0014280102,0.0005887669,0.0002954917,0.011784271,0.00010654453,0.00029053618],"genre_scores_gemma":[0.7845188,0.00015401628,0.17293312,0.0008776998,0.00026214932,0.00003804383,0.03901297,0.00002821637,0.0021750059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977795,0.000051939878,0.00034330256,0.0013842093,0.00015082635,0.00029021583],"domain_scores_gemma":[0.9912363,0.0005368976,0.00011953549,0.008002349,0.000034095374,0.00007080908],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00040747118,0.00023613879,0.000299319,0.00046676432,0.00020514576,0.0007781206,0.008054944,0.00006041589,0.000044419714],"category_scores_gemma":[0.00007240747,0.00023555128,0.00011379865,0.0006892997,0.00003098208,0.007757449,0.00027915722,0.00012350363,0.00014928392],"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.000096161755,0.001059067,0.00003071685,0.000013033335,0.0010063165,0.000004474022,0.0002748016,0.00094930787,0.00019843207,0.0030602731,0.01889881,0.9744086],"study_design_scores_gemma":[0.0023783317,0.00038204176,0.004677538,0.00008602093,0.0014706386,0.0000011931073,0.00015139682,0.92917657,0.0013410322,0.009165676,0.05022168,0.000947855],"about_ca_topic_score_codex":0.00003846171,"about_ca_topic_score_gemma":0.00022095325,"teacher_disagreement_score":0.97346073,"about_ca_system_score_codex":0.000063257845,"about_ca_system_score_gemma":0.000055482953,"threshold_uncertainty_score":0.99731195},"labels":[],"label_agreement":null},{"id":"W2055411343","doi":"10.1145/2424321.2424369","title":"Surveying the landscape","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science; Workload; Variety (cybernetics); Spatial analysis; Spatial database; Resource (disambiguation); Resource planning; Database; Degree (music); Resource allocation; Geography; Remote sensing; Artificial intelligence; Environmental resource management; Operating system","score_opus":0.02892337505620284,"score_gpt":0.24332186297707223,"score_spread":0.21439848792086938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055411343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026936396,0.00010452629,0.83494735,0.0018202608,0.0005987086,0.00005066191,3.9762892e-7,0.0001411532,0.1596433],"genre_scores_gemma":[0.97837824,0.0000073722836,0.015040925,0.00081529334,0.00016279449,0.0000030283286,0.0000022076715,0.0000020206066,0.0055881413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996611,0.00002094938,0.00003654766,0.000059188937,0.00008187041,0.0001403314],"domain_scores_gemma":[0.99963516,0.000035644152,0.000009740841,0.00029063452,0.0000054132447,0.000023427077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046430485,0.000028979732,0.00002286131,0.000013888925,0.00006255817,0.00012741981,0.0005661087,0.0000052216897,0.00006319048],"category_scores_gemma":[0.000007221899,0.000015110805,0.000011647317,0.0001265003,0.0000057007524,0.00071845716,0.00028658693,0.00002412423,0.0003255898],"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":[2.556604e-7,0.000031658765,0.057179347,0.0000022772374,0.000011152187,8.375709e-7,0.00029242501,0.0000021428477,0.000010609053,0.6060295,0.10891708,0.2275227],"study_design_scores_gemma":[0.00025000624,0.000024324623,0.26124635,0.000003723007,0.0000060792067,0.0000068017634,0.00017240092,0.085735686,0.00033504528,0.001770762,0.65016365,0.00028518474],"about_ca_topic_score_codex":0.000009951645,"about_ca_topic_score_gemma":0.0000020513394,"teacher_disagreement_score":0.9756846,"about_ca_system_score_codex":0.0000015057706,"about_ca_system_score_gemma":0.0000018637988,"threshold_uncertainty_score":0.41849065},"labels":[],"label_agreement":null},{"id":"W2055567224","doi":"10.3390/s140712990","title":"A Hybrid Spatio-Temporal Data Indexing Method for Trajectory Databases","year":2014,"lang":"en","type":"article","venue":"Sensors","topic":"Data Management and Algorithms","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":"Toronto Metropolitan University","funders":"National High-tech Research and Development Program; National Natural Science Foundation of China","keywords":"Computer science; Search engine indexing; Data mining; Tree (set theory); Hash table; Trajectory; Database; Access method; NoSQL; Hash function; Temporal database; Data structure; R-tree; Database index; Field (mathematics); Table (database); Spatial database; Big data; Information retrieval; Spatial analysis; Mathematics","score_opus":0.06935513009240445,"score_gpt":0.32216713151688803,"score_spread":0.25281200142448357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055567224","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.0034438723,0.000017853812,0.9941603,0.00042414264,0.00044795562,0.00021310922,0.00022561064,0.00017855824,0.000888595],"genre_scores_gemma":[0.025353877,0.0000043297705,0.97159636,0.00049005897,0.00032128952,0.000009739738,0.0013377842,0.000015909864,0.0008706341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986563,0.00010170305,0.00018090283,0.0005889531,0.00020681358,0.0002653741],"domain_scores_gemma":[0.99789137,0.00025262547,0.00008675204,0.0016733471,0.000029900286,0.000066027074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010625568,0.00012629529,0.00015239055,0.00010531711,0.00011421986,0.0001697374,0.0015841548,0.000013483109,0.000010825218],"category_scores_gemma":[0.00019597916,0.00011811678,0.000035562465,0.000090800175,0.000023230046,0.0010036256,0.0008360163,0.00006904116,0.000032542088],"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.000023551773,0.00012058334,0.0010997771,0.00013029364,0.00009373881,0.00002644072,0.00024494066,0.0007164208,0.00008121271,0.08403667,0.097829536,0.8155968],"study_design_scores_gemma":[0.00021874339,0.000022527776,0.00019123129,0.000009176139,0.000009245323,0.0000030058577,0.000009797077,0.63958615,0.00034163514,0.0007113001,0.35876527,0.00013192448],"about_ca_topic_score_codex":0.00013700064,"about_ca_topic_score_gemma":0.000052399413,"teacher_disagreement_score":0.8154649,"about_ca_system_score_codex":0.000011670555,"about_ca_system_score_gemma":0.000023996889,"threshold_uncertainty_score":0.48166627},"labels":[],"label_agreement":null},{"id":"W2055575272","doi":"10.1016/j.jda.2008.09.011","title":"Counting distance permutations","year":2008,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Data Management and Algorithms","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 Waterloo","funders":"National Aeronautics and Space Administration","keywords":"Permutation (music); Metric space; Vector space; Mathematics; String (physics); Point (geometry); Combinatorics; Tree (set theory); Metric (unit); Space (punctuation); Computer science; Discrete mathematics; Pure mathematics","score_opus":0.020306791770880833,"score_gpt":0.2551660287123915,"score_spread":0.2348592369415107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055575272","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.004367899,0.00046786177,0.99123913,0.0010341222,0.0007147948,0.0000590536,0.000010236919,0.000040634142,0.002066289],"genre_scores_gemma":[0.48346236,0.00063751097,0.51222634,0.00049036474,0.00093117205,0.000004182458,0.0000116248775,0.000024952134,0.0022114825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849963,0.000037678266,0.00046146562,0.00017690693,0.0005754626,0.0002488594],"domain_scores_gemma":[0.998889,0.0000611068,0.00040306954,0.0003204409,0.00021134623,0.000114996146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710798,0.00012836861,0.000211805,0.00016283293,0.00024332028,0.00017041579,0.0010858363,0.000028200464,0.000018819173],"category_scores_gemma":[0.00006039703,0.00010417365,0.00013812735,0.00043682277,0.00007417505,0.0022979444,0.00017106778,0.00019698875,0.000030999472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076927274,0.001139557,0.0135248415,0.0001891116,0.0011810113,0.0086828405,0.011974754,0.004423986,0.0016843915,0.1860416,0.17346527,0.5976157],"study_design_scores_gemma":[0.0037664084,0.00086993666,0.031094356,0.00027871155,0.00013621207,0.0033982699,0.00085394667,0.63016504,0.0009063722,0.012992331,0.31412128,0.0014171288],"about_ca_topic_score_codex":0.000006852622,"about_ca_topic_score_gemma":0.0000012541121,"teacher_disagreement_score":0.62574106,"about_ca_system_score_codex":0.00004007661,"about_ca_system_score_gemma":0.00007770747,"threshold_uncertainty_score":0.4248078},"labels":[],"label_agreement":null},{"id":"W2056795974","doi":"10.1016/j.patcog.2006.02.006","title":"Geometric visualization of clusters obtained from fuzzy clustering algorithms","year":2006,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Cluster analysis; Fuzzy clustering; Visualization; Fuzzy logic; Computer science; Data mining; Artificial intelligence; Cluster (spacecraft); Object (grammar); FLAME clustering; Tetrahedron; Algorithm; Pattern recognition (psychology); Mathematics; Canopy clustering algorithm","score_opus":0.024314507256502776,"score_gpt":0.24684455813193756,"score_spread":0.2225300508754348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056795974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040944602,0.00004135706,0.9564749,0.00008080072,0.0004892218,0.000178311,0.0000684457,0.00015021538,0.0015721186],"genre_scores_gemma":[0.96615696,0.000030665775,0.031666216,0.00020913461,0.00029522018,0.00001802602,0.00151011,0.000018038492,0.0000956126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986968,0.000061340244,0.0003496605,0.00036327273,0.00031647075,0.00021242423],"domain_scores_gemma":[0.9992885,0.00006975014,0.00021169902,0.00029711123,0.0000968283,0.00003608571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021627406,0.00013871293,0.00015857066,0.0004287318,0.00006240073,0.00015792223,0.0004100087,0.000051612467,0.000049048766],"category_scores_gemma":[0.000018358638,0.00014607802,0.000058909627,0.00079865655,0.000018996949,0.0009059086,0.0002424032,0.000052015806,0.00011623051],"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.00000420101,0.00011351719,0.0038071724,0.00004389848,0.00002419292,0.000009124732,0.00007746288,0.0001086037,0.00035074473,0.000043737986,0.0006854886,0.99473184],"study_design_scores_gemma":[0.0021778927,0.00018814471,0.08001649,0.00020998115,0.000074715674,0.0000061195574,0.00008798609,0.8931334,0.012771031,0.009856918,0.0007124939,0.00076480856],"about_ca_topic_score_codex":0.0008640829,"about_ca_topic_score_gemma":0.000049982733,"teacher_disagreement_score":0.99396706,"about_ca_system_score_codex":0.00003630984,"about_ca_system_score_gemma":0.000007917235,"threshold_uncertainty_score":0.5956889},"labels":[],"label_agreement":null},{"id":"W2057058417","doi":"10.1145/1132863.1132873","title":"Approximation and streaming algorithms for histogram construction problems","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":127,"is_retracted":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":"Histogram; Computer science; Algorithm; Approximation algorithm; Artificial intelligence; Image (mathematics)","score_opus":0.02572179603381434,"score_gpt":0.24387751952964024,"score_spread":0.2181557234958259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057058417","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.00040142136,0.0001422532,0.9964413,0.00022782749,0.00089992036,0.0009294755,0.00042675782,0.00028056552,0.00025046442],"genre_scores_gemma":[0.13963802,0.0000806913,0.8568093,0.000044233442,0.00028793243,0.00083543133,0.0011547323,0.00003623059,0.0011133852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986616,0.000043073753,0.00031510144,0.00050168304,0.00023451632,0.0002440513],"domain_scores_gemma":[0.9987986,0.00010185329,0.0001238786,0.00086040853,0.000058727765,0.00005650604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003257952,0.00017198076,0.00016530845,0.0002337342,0.0003266283,0.00035590515,0.00045043003,0.000049421207,0.0000028581578],"category_scores_gemma":[0.000011210091,0.00016762518,0.000047749647,0.00030285385,0.000053497384,0.0012535109,0.000024142077,0.00009314338,0.000010055696],"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.000012913839,0.0003195914,0.00004943895,0.0005670656,0.000074845964,0.000005080026,0.00011455901,0.0026903746,0.00092593,0.065313466,0.0015979789,0.92832875],"study_design_scores_gemma":[0.0021095963,0.00027476126,0.00016153058,0.00028510173,0.00010278438,0.00010480394,0.00037208805,0.8973469,0.0013001052,0.0034491203,0.093767315,0.0007258623],"about_ca_topic_score_codex":0.00053497526,"about_ca_topic_score_gemma":0.000037662005,"teacher_disagreement_score":0.9276029,"about_ca_system_score_codex":0.000055049266,"about_ca_system_score_gemma":0.000018198409,"threshold_uncertainty_score":0.68355566},"labels":[],"label_agreement":null},{"id":"W2057222780","doi":"10.1016/s0020-0190(01)00266-6","title":"Signature files and signature trees","year":2002,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":19,"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 Winnipeg","funders":"","keywords":"Computer science; Signature (topology); Search engine indexing; Overhead (engineering); Tree (set theory); Information retrieval; Inefficiency; Inverted index; Data mining; Database; Mathematics; Operating system","score_opus":0.008946689608552622,"score_gpt":0.19419754317582877,"score_spread":0.18525085356727614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057222780","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.007760521,0.00095674105,0.9470272,0.034550596,0.0003993897,0.00025959391,0.000014577995,0.00071788323,0.0083135115],"genre_scores_gemma":[0.897251,0.000058202888,0.06757921,0.034408964,0.00014107914,0.000020106438,0.00007276157,0.000009166509,0.000459486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993559,0.000009299177,0.00015635045,0.00011490733,0.00020932841,0.00015421413],"domain_scores_gemma":[0.99965495,0.000014897509,0.00010155211,0.000159584,0.000030913718,0.000038102025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086881104,0.00009966171,0.000068757785,0.00014295663,0.00015727578,0.0009142335,0.00038404303,0.000043181215,0.00002066616],"category_scores_gemma":[0.000016210333,0.00008525471,0.000016596749,0.00030399818,0.000032510037,0.007908346,0.000112323585,0.00012869484,0.00005448402],"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.413458e-7,0.000009147339,0.00004792862,0.00007173269,0.0000067545197,0.0000037148702,0.0024848147,0.00013980665,0.00029905874,0.0016432652,0.096682414,0.8986104],"study_design_scores_gemma":[0.0006243009,0.000032351352,0.0021389357,0.000114793766,0.000011183691,0.000018877607,0.00017628493,0.69839174,0.00060925545,0.00047636117,0.29691723,0.00048869837],"about_ca_topic_score_codex":0.0000012323881,"about_ca_topic_score_gemma":2.8939994e-7,"teacher_disagreement_score":0.8981217,"about_ca_system_score_codex":0.000010445715,"about_ca_system_score_gemma":0.0000036936128,"threshold_uncertainty_score":0.88159746},"labels":[],"label_agreement":null},{"id":"W2057310371","doi":"10.1109/cidm.2013.6597220","title":"Discovery of topological relations for spatial Activity Recognition","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Exploit; Computer science; Activity recognition; Wearable computer; Ubiquitous computing; Machine learning; Artificial intelligence; Human–computer interaction; Computer security; Embedded system","score_opus":0.03751113440578365,"score_gpt":0.2561704451345515,"score_spread":0.21865931072876785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057310371","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.0588234,9.99701e-7,0.934604,0.0010884161,0.000121620644,0.00019619607,0.000008101112,0.000036720547,0.0051205438],"genre_scores_gemma":[0.9047892,0.0000014553342,0.093015596,0.000055343724,0.000032363994,0.000032680153,0.000015172166,0.0000011608481,0.00205699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966866,0.000011741414,0.00006909259,0.000118290714,0.00005969507,0.00007255221],"domain_scores_gemma":[0.9997079,0.000069614565,0.000034414246,0.00014638953,0.00002990838,0.000011823826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006645798,0.000033829703,0.00005004152,0.000027909837,0.00003437704,0.0000803633,0.0001823521,0.000018263692,0.00008129135],"category_scores_gemma":[0.000029828776,0.0000255098,0.000030142768,0.000064889755,0.000017923321,0.0016012719,0.000110263405,0.000021335349,0.00006145806],"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.0000044208773,0.00018859755,0.0008754315,0.000012265213,0.000017173805,3.1669794e-7,0.00003798784,0.0000040706072,0.0015910341,0.12919132,0.0098078055,0.8582696],"study_design_scores_gemma":[0.0011473296,0.0005867533,0.24393025,0.00001953167,0.000025004963,0.0000015226078,0.00006338585,0.39197692,0.028029071,0.33110565,0.0026692662,0.00044530578],"about_ca_topic_score_codex":0.00019044495,"about_ca_topic_score_gemma":0.000013774038,"teacher_disagreement_score":0.85782427,"about_ca_system_score_codex":0.0000051668558,"about_ca_system_score_gemma":0.000005598454,"threshold_uncertainty_score":0.116088346},"labels":[],"label_agreement":null},{"id":"W2058239738","doi":"10.1145/2484838.2484857","title":"A multidimensional data model with subcategories for flexibly capturing summarizability","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Extension (predicate logic); Aggregate (composite); Dimension (graph theory); Hierarchy; Data warehouse; Cube (algebra); Data cube; Property (philosophy); Online analytical processing; Materialized view; Data modeling; Theoretical computer science; Expressive power; Data mining; Database; View; Programming language; Database design; Mathematics","score_opus":0.055817360048969145,"score_gpt":0.26051186430184153,"score_spread":0.2046945042528724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058239738","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.002989042,0.000011061372,0.99326617,0.0015634176,0.00008030132,0.00047466368,0.000028995963,0.0001957815,0.0013905902],"genre_scores_gemma":[0.12807542,0.0000017382624,0.8675173,0.00031164303,0.000033638225,0.00006926579,0.00020330702,0.000008233258,0.0037794546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988028,0.00001055868,0.0001431745,0.00056921446,0.00021057646,0.00026368062],"domain_scores_gemma":[0.9982979,0.00006626,0.000038486964,0.0014281175,0.00009954997,0.00006968133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002522786,0.0001233447,0.0001129581,0.00004754758,0.00011842436,0.00028985715,0.0014253515,0.00002184849,0.000022849306],"category_scores_gemma":[0.000022241202,0.00008432797,0.000018986311,0.00013828748,0.000049161892,0.0031851528,0.0013841445,0.00004934265,0.000047963604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036624966,0.00035426122,0.0021145183,0.00012577223,0.00012072674,0.0000049764076,0.0003614016,0.008043944,0.0003714582,0.8255038,0.076775,0.08618751],"study_design_scores_gemma":[0.0003223645,0.000029599967,0.00045420806,0.000003399728,0.0000054922366,7.924702e-7,0.000025298714,0.986908,0.00019859729,0.009840138,0.0020586185,0.00015348257],"about_ca_topic_score_codex":0.00029124887,"about_ca_topic_score_gemma":0.000036105306,"teacher_disagreement_score":0.9788641,"about_ca_system_score_codex":0.000012487657,"about_ca_system_score_gemma":0.000048766924,"threshold_uncertainty_score":0.34387946},"labels":[],"label_agreement":null},{"id":"W2059398928","doi":"10.1080/13658811003702147","title":"An ontology-based framework for geospatial clustering","year":2010,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Data Management and Algorithms","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":true,"ca_institutions":"University of Regina; University of Calgary","funders":"","keywords":"Geospatial analysis; Ontology; Cluster analysis; Computer science; Geography; Information retrieval; Data science; Data mining; Cartography; Artificial intelligence","score_opus":0.01188119275411146,"score_gpt":0.2913445074125316,"score_spread":0.2794633146584201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059398928","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.007879188,0.0000084605645,0.98233366,0.0013467638,0.008043132,0.00015237585,0.00002422448,0.000044462875,0.00016772086],"genre_scores_gemma":[0.8272808,0.000003322779,0.17137502,0.00061796344,0.0006669731,0.000012792997,0.00003648709,0.0000036050349,0.0000030113245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984023,0.000030684787,0.00070889463,0.00009046341,0.00061456073,0.0001530726],"domain_scores_gemma":[0.9979264,0.00014223212,0.00064032414,0.00024782858,0.00092703936,0.00011617659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000872836,0.000100343656,0.00015697477,0.0005694936,0.000070346934,0.0009227929,0.0016954008,0.000110022695,0.00000953189],"category_scores_gemma":[0.00015777697,0.0000845974,0.00013590831,0.00017507578,0.000038332277,0.004080101,0.000079639445,0.00029040282,0.000009338425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017813375,0.00021508631,0.0056211296,0.000059630078,0.00026276018,0.000015609112,0.00053664297,0.008088847,0.00021483802,0.836725,0.0011373576,0.14694498],"study_design_scores_gemma":[0.0012382702,0.00031942932,0.0043370714,0.00007972031,0.000012950629,0.00010404448,0.00010404514,0.9071167,0.00007878399,0.0061510513,0.08025756,0.0002003881],"about_ca_topic_score_codex":0.000028640565,"about_ca_topic_score_gemma":0.000014017469,"teacher_disagreement_score":0.8990278,"about_ca_system_score_codex":0.00001604929,"about_ca_system_score_gemma":0.000052005336,"threshold_uncertainty_score":0.8898513},"labels":[],"label_agreement":null},{"id":"W2060325926","doi":"10.1145/1463434.1463486","title":"Efficient search of moving objects on a planar graph","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Search engine indexing; Computer science; Graph; Auxiliary memory; Data structure; Breadth-first search; Planar graph; Search tree; Tree (set theory); Search algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Combinatorics","score_opus":0.027994935155377813,"score_gpt":0.24097151259354685,"score_spread":0.21297657743816903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060325926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3501888,0.000035213412,0.5199956,0.00035863186,0.00029595883,0.00023026793,0.0000046638793,0.00022822834,0.12866265],"genre_scores_gemma":[0.97262144,0.000007917881,0.026014958,0.00018027159,0.000017470582,0.0000017806077,0.0000019001911,0.0000028904758,0.001151397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992099,0.00001811619,0.000095611555,0.00020096444,0.00031007227,0.00016537942],"domain_scores_gemma":[0.99950194,0.000037283473,0.00002064378,0.00037925865,0.00002127002,0.00003960118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014964823,0.00005896334,0.000074891046,0.0001607144,0.00007018091,0.000024519159,0.0005772509,0.00001247367,0.000016689854],"category_scores_gemma":[0.000007184274,0.000046723082,0.000032278036,0.00037331955,0.000031237512,0.00008324265,0.0001694284,0.00004775277,0.00010069986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033208627,0.0012960687,0.0027355908,0.0001210984,0.00011451061,0.0005679609,0.0054628253,0.018418366,0.0028246224,0.8460581,0.029711379,0.09265627],"study_design_scores_gemma":[0.0011129809,0.0006157937,0.028433051,0.00006934199,0.0000061744604,0.000024921266,0.00025315778,0.9470033,0.0191262,0.001030572,0.0018383309,0.00048616694],"about_ca_topic_score_codex":0.000052367057,"about_ca_topic_score_gemma":0.000002085669,"teacher_disagreement_score":0.92858493,"about_ca_system_score_codex":0.0000072024936,"about_ca_system_score_gemma":0.00001572385,"threshold_uncertainty_score":0.1905312},"labels":[],"label_agreement":null},{"id":"W2062257519","doi":"","title":"Approximation algorithms for labeling hierarchical taxonomies","year":2008,"lang":"en","type":"article","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Data Management and Algorithms","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":"Linear programming relaxation; Approximation algorithm; Extension (predicate logic); Mathematics; Algorithm; Linear programming; Steiner tree problem; Discrete mathematics; Combinatorics; Relaxation (psychology); Computer science","score_opus":0.042226861691430896,"score_gpt":0.2626705395891018,"score_spread":0.22044367789767091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062257519","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.017273122,0.00015384656,0.9766034,0.0032544942,0.0007017419,0.0006956073,0.000110671564,0.00085237663,0.00035472095],"genre_scores_gemma":[0.06580676,0.00010724082,0.9333662,0.00010488643,0.00009856583,0.0002537149,0.00007693718,0.000019671343,0.00016602046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980973,0.000013332746,0.00055759447,0.00060719805,0.00025902968,0.0004655589],"domain_scores_gemma":[0.99859005,0.00003265264,0.00024460087,0.00088645256,0.00015570564,0.00009051155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041329963,0.00025066055,0.00039481153,0.0008116554,0.00036088555,0.000045214063,0.0016912041,0.00028294369,0.0000040977257],"category_scores_gemma":[0.00029405428,0.00023805766,0.0001344455,0.0010916084,0.00055975094,0.0007719858,0.0006610744,0.00029328733,0.000050264836],"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.000020432524,0.0002181911,0.00036673827,0.00015638646,0.00008254904,0.0000355779,0.00007390192,0.00024472596,0.0020299964,0.63949996,0.0032532124,0.35401833],"study_design_scores_gemma":[0.0017076556,0.00037792826,0.00009216777,0.00012494107,0.0000444657,0.000100952384,0.00005439414,0.3213538,0.04643474,0.09477287,0.5341301,0.00080596434],"about_ca_topic_score_codex":0.000006501999,"about_ca_topic_score_gemma":0.0000023890527,"teacher_disagreement_score":0.5447271,"about_ca_system_score_codex":0.000055556648,"about_ca_system_score_gemma":0.000090079164,"threshold_uncertainty_score":0.970771},"labels":[],"label_agreement":null},{"id":"W2064848265","doi":"10.1007/s10115-011-0405-5","title":"Effectiveness of NAQ-tree in handling reverse nearest-neighbor queries in high-dimensional metric space","year":2011,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","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":"University of Calgary","funders":"","keywords":"Computer science; Pruning; Metric (unit); k-nearest neighbors algorithm; Nearest neighbor search; Euclidean distance; Tree (set theory); Data mining; Metric space; Artificial intelligence; Mathematics","score_opus":0.014143569775840109,"score_gpt":0.2202502816969014,"score_spread":0.20610671192106128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064848265","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.75671375,0.0024771844,0.17911401,0.00005267061,0.0031893332,0.0019309728,0.000024513794,0.00017903095,0.056318555],"genre_scores_gemma":[0.99834776,0.000031166226,0.0015010253,0.000006313941,0.0000133340045,0.000024237446,0.000013402227,0.00000243026,0.000060316717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99912643,0.00011739137,0.00036106416,0.00011834705,0.0001408769,0.0001358586],"domain_scores_gemma":[0.9994262,0.00010961093,0.0001310386,0.00019998367,0.00009926773,0.00003389507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010131375,0.00009458957,0.00020647769,0.00065735437,0.000034889268,0.00007882955,0.00022784685,0.00004525179,0.0000029182177],"category_scores_gemma":[0.000064281165,0.000082345745,0.000018478884,0.0008940004,0.000026519921,0.004273344,0.00019432907,0.0000646139,0.000054452106],"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.00022065676,0.00040649535,0.09121481,0.005924434,0.00009145197,0.00002672451,0.025690317,0.00081842236,0.00020981349,0.75030965,0.0014110168,0.12367622],"study_design_scores_gemma":[0.005377288,0.0004050879,0.6561119,0.0024969545,0.000018983787,0.000017538834,0.0014005404,0.31118113,0.0037647055,0.00081951707,0.017634872,0.00077150617],"about_ca_topic_score_codex":0.0006182879,"about_ca_topic_score_gemma":0.00004867017,"teacher_disagreement_score":0.74949014,"about_ca_system_score_codex":0.000034886947,"about_ca_system_score_gemma":0.00003444059,"threshold_uncertainty_score":0.3357962},"labels":[],"label_agreement":null},{"id":"W2065063350","doi":"10.1109/eesms.2010.5634177","title":"Collaborative web-based architecture for real-time monitoring of sensor data","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Sensor web; Ajax; Variety (cybernetics); Architecture; Web application; Data sharing; World Wide Web; Real-time data; Database; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.0192080971045939,"score_gpt":0.28059002589249227,"score_spread":0.26138192878789834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065063350","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.026135929,0.000008225734,0.95976746,0.0022355912,0.0010803785,0.00074865867,0.00058355404,0.0003363385,0.009103859],"genre_scores_gemma":[0.018596385,0.0000031746188,0.9797283,0.00003790049,0.00017270353,0.000012229876,0.00009444639,0.000007803732,0.0013470604],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919295,0.000017061775,0.00013418715,0.00033413048,0.00016184847,0.00015980176],"domain_scores_gemma":[0.99836993,0.00015131138,0.00007093053,0.0012642851,0.00009862617,0.000044907665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028256627,0.000090060086,0.00011993366,0.00007804362,0.000054279204,0.00010894248,0.0015595652,0.000030602594,0.000019574576],"category_scores_gemma":[0.00006173509,0.00007227112,0.000020794674,0.0003042527,0.000034088025,0.0004195205,0.00044938753,0.0000705978,0.000014685975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009558648,0.0004762434,0.0030378092,0.0002582387,0.00021138736,0.000025138888,0.0007097733,0.00043946895,0.47484493,0.057944153,0.097384155,0.36457312],"study_design_scores_gemma":[0.001930548,0.00021159032,0.0019260169,0.000036826725,0.000033274886,0.0000014129156,0.00012258653,0.7672161,0.10523416,0.0013569124,0.12143822,0.00049233943],"about_ca_topic_score_codex":0.000016978991,"about_ca_topic_score_gemma":0.000012718189,"teacher_disagreement_score":0.7667766,"about_ca_system_score_codex":0.0000033581123,"about_ca_system_score_gemma":0.00006680772,"threshold_uncertainty_score":0.29471308},"labels":[],"label_agreement":null},{"id":"W2065714066","doi":"10.1007/s00778-005-0177-1","title":"Optimization and evaluation of shortest path queries","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":50,"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":"Constrained Shortest Path First; Shortest path problem; K shortest path routing; Computer science; Yen's algorithm; Dijkstra's algorithm; Shortest Path Faster Algorithm; Euclidean shortest path; Scalability; Pruning; Path (computing); Query optimization; Algorithm; Theoretical computer science; Data mining; Database; Graph; Computer network","score_opus":0.01871367238197218,"score_gpt":0.2452819636881325,"score_spread":0.2265682913061603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065714066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04335089,0.0003897087,0.9529162,0.0010201208,0.00018725745,0.00007922156,0.0000012626489,0.000014247076,0.0020411161],"genre_scores_gemma":[0.9603171,0.00009348289,0.039289616,0.000039156836,0.00014611652,0.0000015688851,0.0000035300404,0.0000027274632,0.000106727064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941707,0.00006526477,0.000113772956,0.000056098972,0.00028572293,0.000062059305],"domain_scores_gemma":[0.9996618,0.000016746117,0.00008869624,0.00012629488,0.000094370225,0.000012082408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033706,0.000035269462,0.000041436946,0.0000392315,0.00010547161,0.00016587792,0.00023665639,0.000008088287,0.000015755151],"category_scores_gemma":[0.000013669818,0.00002221151,0.000012207989,0.00011040521,0.000028536746,0.00051939755,0.00007360286,0.000042469335,0.0000010648195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085976435,0.00013970167,0.0052931337,0.000010588425,0.00005529022,0.000008601028,0.00089802826,0.41341978,0.00057140365,0.09619103,0.011696041,0.4717078],"study_design_scores_gemma":[0.00020593076,0.000027920454,0.009616632,0.000010802889,0.00002275747,0.000029136827,0.000036981983,0.9788633,0.00015549276,0.010512485,0.00047604894,0.00004250859],"about_ca_topic_score_codex":0.000011312054,"about_ca_topic_score_gemma":0.0000024396625,"teacher_disagreement_score":0.9169662,"about_ca_system_score_codex":0.000008616592,"about_ca_system_score_gemma":0.000020121983,"threshold_uncertainty_score":0.15995647},"labels":[],"label_agreement":null},{"id":"W206965105","doi":"10.1007/978-3-540-76796-1_3","title":"Antimatroids, Betweenness, Convexity","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":25,"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":"Betweenness centrality; Mathematics; Convexity; Combinatorics; Regular polygon; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.027070840514102208,"score_gpt":0.2148578489244075,"score_spread":0.1877870084103053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206965105","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":[4.627878e-7,0.00017825612,0.22777241,0.00034156337,0.0004697094,0.00013594098,0.000023140094,0.0003626946,0.77071583],"genre_scores_gemma":[0.00008205212,0.0009701465,0.03777335,0.00048051064,0.00029397215,0.0000023698703,0.00013154597,0.000025613175,0.9602404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984905,0.0000056999547,0.0002551692,0.0006059307,0.00038331116,0.00025935954],"domain_scores_gemma":[0.99857646,0.000027569875,0.00013088503,0.0011229083,0.000052958974,0.0000892366],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010375725,0.00030563545,0.0003298703,0.00014781016,0.000115106406,0.00018991559,0.0017519876,0.00014701768,0.00046015086],"category_scores_gemma":[0.000003167105,0.00027511094,0.00014111423,0.000041392934,0.000096405136,0.0006591764,0.0010866787,0.0002280027,0.0024436335],"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":[3.6990465e-7,0.00000709312,0.000008411992,0.000014769531,0.000041318668,0.00009085969,0.000009543824,2.234794e-7,2.2235356e-7,0.68816924,0.26762047,0.044037443],"study_design_scores_gemma":[0.00013765329,0.00002611714,0.00006741942,0.000026522515,0.000013793135,0.000012540069,4.6010658e-7,0.0017002847,0.000011038503,0.017977413,0.9796163,0.00041045004],"about_ca_topic_score_codex":0.000014023285,"about_ca_topic_score_gemma":0.000002739424,"teacher_disagreement_score":0.71199584,"about_ca_system_score_codex":0.000022377732,"about_ca_system_score_gemma":0.000042462758,"threshold_uncertainty_score":0.9999701},"labels":[],"label_agreement":null},{"id":"W2070325534","doi":"10.4018/jdm.2009062501","title":"A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases","year":2009,"lang":"en","type":"article","venue":"Journal of Database Management","topic":"Data Management and Algorithms","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":"Brock University","funders":"","keywords":"Computer science; Query optimization; Sargable; Relational database; Online aggregation; Range (aeronautics); Database; Search engine indexing; Data mining; View; Query language; Query expansion; Information retrieval; Selection (genetic algorithm); Relational database management system; Range query (database); Query by Example; Web search query; Search engine; Database design; Artificial intelligence","score_opus":0.060419915738604536,"score_gpt":0.30755272712627224,"score_spread":0.2471328113876677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070325534","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.000780697,0.00007459629,0.9956378,0.0021505055,0.00036293018,0.0004896688,0.0000834869,0.00005103144,0.000369336],"genre_scores_gemma":[0.013529474,0.0000502834,0.9843936,0.001132033,0.00020879104,0.000023489645,0.00038617535,0.000008384331,0.00026777008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984711,0.000045213324,0.00048112462,0.00025338476,0.00052509137,0.00022411834],"domain_scores_gemma":[0.99891204,0.00008890934,0.00042709016,0.00036749686,0.00013103549,0.000073441566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009590597,0.00014949165,0.0001770883,0.0004839782,0.00016578358,0.00021264101,0.00050136336,0.000017566203,0.000031239317],"category_scores_gemma":[0.00007107535,0.00013758181,0.000096649776,0.00044538832,0.000016483216,0.0030978865,0.00014126323,0.00010549456,0.000008096839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023423335,0.00041760423,0.0010986691,0.0003279845,0.00025815447,0.00012955247,0.00015179004,0.008734339,0.0002771352,0.38608143,0.15226538,0.45002374],"study_design_scores_gemma":[0.0031919419,0.00030811792,0.014007855,0.00033302253,0.00012668225,0.000020422587,0.00007354818,0.6683127,0.0004084601,0.0018923734,0.3109667,0.00035816216],"about_ca_topic_score_codex":0.0000053006993,"about_ca_topic_score_gemma":0.0000027094063,"teacher_disagreement_score":0.6595784,"about_ca_system_score_codex":0.0000978521,"about_ca_system_score_gemma":0.000038395738,"threshold_uncertainty_score":0.5610423},"labels":[],"label_agreement":null},{"id":"W2070508857","doi":"10.1017/s0373463307004043","title":"A Spatial Indexing Approach for High Performance Location Based Services","year":2006,"lang":"en","type":"article","venue":"Journal of Navigation","topic":"Data Management and Algorithms","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":"MRF Geosystems (Canada)","funders":"","keywords":"Quadtree; Search engine indexing; Computer science; Location-based service; Index (typography); Space partitioning; Tree (set theory); R-tree; Data mining; Service (business); Spatial database; Linear subspace; QR decomposition; Database; Information retrieval; Spatial analysis; Algorithm; Computer network; Geography; World Wide Web; Mathematics","score_opus":0.009378618420394,"score_gpt":0.22018880214771663,"score_spread":0.21081018372732263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070508857","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.12665889,0.000019139308,0.8727405,0.00019303703,0.00018421997,0.000094804695,0.0000011716783,0.0000139844,0.00009424497],"genre_scores_gemma":[0.83527946,9.0151354e-7,0.16426939,0.000052034287,0.00030963137,0.000003654874,0.00005637358,0.0000031334068,0.00002543717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993142,0.000015940333,0.0002470756,0.00009093301,0.00024336005,0.00008848206],"domain_scores_gemma":[0.9992849,0.000019305184,0.000352341,0.000113102426,0.00021243471,0.00001791681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004107316,0.000056711753,0.000078487006,0.00009871943,0.000074813,0.00015630163,0.0003419729,0.00002461073,7.491757e-7],"category_scores_gemma":[0.0000036631466,0.0000490971,0.000026409007,0.00021983415,0.0000072101,0.001402172,0.000026030717,0.00005923357,0.0000012759341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014752825,0.00067261513,0.01665352,0.0013738119,0.00006316646,0.00000957591,0.00041594318,0.21479718,0.0033391647,0.024366377,0.0013504686,0.7368106],"study_design_scores_gemma":[0.0006197338,0.00011544944,0.018547522,0.00007405864,0.0000114292925,0.000004662879,0.000010770403,0.9755194,0.0035886627,0.0010362682,0.00040310758,0.00006891666],"about_ca_topic_score_codex":0.000043880464,"about_ca_topic_score_gemma":0.0000012244517,"teacher_disagreement_score":0.7607222,"about_ca_system_score_codex":0.000034254783,"about_ca_system_score_gemma":0.000029949642,"threshold_uncertainty_score":0.20021215},"labels":[],"label_agreement":null},{"id":"W2070626052","doi":"10.1504/ijbidm.2014.068366","title":"A hybrid risk-aware design method for spatial datacubes handling spatial vague data: implementation and validation","year":2014,"lang":"en","type":"article","venue":"International Journal of Business Intelligence and Data Mining","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Computer science; Online analytical processing; Spatial analysis; Vagueness; Data warehouse; Data mining; Spatial database; Database; Information retrieval; Data science; Fuzzy logic; Artificial intelligence","score_opus":0.12201891936327565,"score_gpt":0.39097008713991216,"score_spread":0.2689511677766365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070626052","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.0014558331,0.00010084973,0.9959523,0.00057277345,0.0011465851,0.00014972653,0.0006010694,0.000015145037,0.0000056946947],"genre_scores_gemma":[0.24791293,0.0006698836,0.7483933,0.00012520673,0.0009540678,0.0000041387475,0.0019226638,0.000011838653,0.0000059868526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981637,0.00012854152,0.00059048133,0.0005031953,0.00044757625,0.0001665078],"domain_scores_gemma":[0.9974476,0.0006527617,0.0006693474,0.0006345647,0.00053037814,0.00006532911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031187723,0.00015316073,0.00021284571,0.00027077176,0.00015264633,0.0009711284,0.0027248377,0.000027437538,0.000010284081],"category_scores_gemma":[0.00079285563,0.00013664739,0.00001898017,0.00011307841,0.00003884451,0.0055528544,0.0018806355,0.00010085965,0.0000013349344],"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.000049718798,0.0000259306,0.00079980487,0.000017943752,0.00009946612,0.000009706682,0.00014128682,0.00063092087,0.000057008,0.00048967893,0.0008612371,0.9968173],"study_design_scores_gemma":[0.0004958365,0.00010289034,0.0011105372,0.000116677285,0.00008947123,0.00011268738,0.00025229968,0.9874828,0.0024414142,0.0019587001,0.0056526503,0.00018406256],"about_ca_topic_score_codex":0.000477558,"about_ca_topic_score_gemma":0.000067094734,"teacher_disagreement_score":0.99663323,"about_ca_system_score_codex":0.000017617711,"about_ca_system_score_gemma":0.000078257806,"threshold_uncertainty_score":0.9364614},"labels":[],"label_agreement":null},{"id":"W2071248930","doi":"10.3138/carto.48.2.1837","title":"An Information Model for Pedestrian Routing and Navigation Databases Supporting Universal Accessibility","year":2013,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"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":"FP7 Information and Communication Technologies","keywords":"Geospatial analysis; Computer science; Pedestrian; Conceptual model; Database; Data model (GIS); Class (philosophy); Routing (electronic design automation); Information model; Information retrieval; Data mining; Artificial intelligence; Transport engineering; Geography; Engineering","score_opus":0.02075790918732527,"score_gpt":0.3156206710317091,"score_spread":0.2948627618443838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071248930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09172269,0.000017221217,0.9053744,0.0014891542,0.0004356502,0.00073581137,0.00010371622,0.000075418444,0.00004590872],"genre_scores_gemma":[0.9803842,0.00018820765,0.015868407,0.0010442921,0.000114923445,0.000090450645,0.002294045,0.00000613715,0.00000938563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985615,0.0000424543,0.00064786326,0.00015832299,0.00035950876,0.00023035117],"domain_scores_gemma":[0.99778336,0.000108693304,0.0006345829,0.00021300385,0.0011449654,0.00011538927],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0013334041,0.00015375184,0.00011401381,0.00055025,0.0007890406,0.0028785141,0.0006480435,0.000054720553,0.000004488779],"category_scores_gemma":[0.00018774814,0.00012229563,0.00008362342,0.0003267619,0.000084670384,0.022164041,0.00015924187,0.00011637137,0.0000011129207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010162499,0.00007884654,0.019009616,0.00016322169,0.00020141194,3.7990435e-7,0.0058545787,0.0036290267,0.00008611416,0.47787058,0.0019773976,0.4910272],"study_design_scores_gemma":[0.00086802425,0.00007295313,0.0052935053,0.000029740535,0.000026194624,0.000022246468,0.0011384827,0.97271043,0.000023185292,0.01333367,0.006319337,0.00016223066],"about_ca_topic_score_codex":0.00010053064,"about_ca_topic_score_gemma":0.0000151304,"teacher_disagreement_score":0.9690814,"about_ca_system_score_codex":0.000022057091,"about_ca_system_score_gemma":0.000056957997,"threshold_uncertainty_score":0.9981566},"labels":[],"label_agreement":null},{"id":"W2071465809","doi":"10.1016/j.jmva.2007.01.013","title":"From moments of sum to moments of product","year":2007,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":131,"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":"Mathematics; Product (mathematics); Random variable; Moment (physics); Identity (music); Quadratic equation; Multivariate statistics; Applied mathematics; Algebra of random variables; Sum of normally distributed random variables; Multivariate random variable; Statistics; Geometry","score_opus":0.017624701618862034,"score_gpt":0.29671318869209123,"score_spread":0.2790884870732292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071465809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3511045,0.0000623125,0.64778477,0.00039661187,0.00030440348,0.00008568848,0.000019472947,0.000006984744,0.0002352665],"genre_scores_gemma":[0.90041465,0.00001846793,0.0989939,0.000048258757,0.00013042793,4.4464412e-7,0.0000071206196,0.000005238956,0.00038149874],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978025,0.000056114473,0.00093311607,0.00024022303,0.0007525686,0.00021546424],"domain_scores_gemma":[0.9978877,0.00008122808,0.0009791099,0.000559092,0.00035942878,0.00013345318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014987035,0.00012602554,0.0005322044,0.0010966776,0.000029220115,0.000049421993,0.0012162818,0.000027257813,0.000044609096],"category_scores_gemma":[0.00011307233,0.00010072702,0.00029680424,0.002083868,0.000019432855,0.00068210484,0.00034231064,0.00009667327,0.0000057290767],"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.00083842105,0.0064833835,0.23429792,0.000163201,0.05165912,0.00051440316,0.01589174,0.0277859,0.24145103,0.002733401,0.009907651,0.40827385],"study_design_scores_gemma":[0.0042494363,0.00079640845,0.7776753,0.00022879275,0.004420012,0.000004368923,0.00074779463,0.063359566,0.1378511,0.0021677164,0.007722359,0.0007771848],"about_ca_topic_score_codex":0.00050435227,"about_ca_topic_score_gemma":0.000017412849,"teacher_disagreement_score":0.54931015,"about_ca_system_score_codex":0.000043428317,"about_ca_system_score_gemma":0.000025825533,"threshold_uncertainty_score":0.41075286},"labels":[],"label_agreement":null},{"id":"W2071604065","doi":"10.3166/isi.9.3-4.161-182","title":"L'inférence des dépendances fonctionnelles","year":2004,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Political science","score_opus":0.02603653703257053,"score_gpt":0.2414358269880673,"score_spread":0.21539928995549676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071604065","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.013479986,0.003060461,0.94302195,0.00096718455,0.0038230184,0.00037901948,0.000052059928,0.00032832846,0.034887996],"genre_scores_gemma":[0.7624871,0.0026706213,0.22764681,0.0010219576,0.0007621747,0.000108877175,0.00026879704,0.000029862196,0.005003788],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997803,0.00006134131,0.0007489901,0.00027878396,0.0004701784,0.0006377293],"domain_scores_gemma":[0.99850047,0.000048862596,0.00040391946,0.00053164683,0.00036086031,0.00015426219],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.000616671,0.00031731362,0.0002501345,0.0003075557,0.00080809393,0.0021879827,0.00094133,0.00013337817,0.00013192334],"category_scores_gemma":[0.00019795811,0.0003324714,0.00011382333,0.0011025044,0.00069442514,0.030164149,0.00042449453,0.0001926141,0.0018137544],"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.00000851127,0.000056433164,0.00026512347,0.00059086084,0.000048893824,0.000012349923,0.010018512,0.0046698176,0.000010712869,0.2572405,0.0016574784,0.72542083],"study_design_scores_gemma":[0.0027118386,0.0007308532,0.01926586,0.003217822,0.000117427284,0.00035924307,0.0055241124,0.07933858,0.0027430693,0.49401873,0.39023978,0.0017326642],"about_ca_topic_score_codex":0.0009345156,"about_ca_topic_score_gemma":0.00010413253,"teacher_disagreement_score":0.7490071,"about_ca_system_score_codex":0.00046173882,"about_ca_system_score_gemma":0.00021561651,"threshold_uncertainty_score":0.99991274},"labels":[],"label_agreement":null},{"id":"W2071898607","doi":"10.1145/2405153.2405162","title":"Location-based matching in publish/subscribe revisited","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Publication; Scalability; Event (particle physics); Focus (optics); Context (archaeology); Abstraction; Matching (statistics); Intrusion detection system; Complex event processing; Pattern matching; Distributed computing; Data mining; Data science; Database; Artificial intelligence","score_opus":0.01960999132443506,"score_gpt":0.2462256749626037,"score_spread":0.22661568363816864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071898607","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.0017133167,0.00010525702,0.9772857,0.0020206056,0.00023988474,0.000102483944,4.9065756e-7,0.00016477733,0.018367523],"genre_scores_gemma":[0.9017568,0.000002161652,0.09532246,0.001909283,0.00007815954,0.00000942691,0.00002281527,0.0000045738857,0.00089430105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925894,0.000030163912,0.00013729912,0.0001637829,0.0001642787,0.00024553566],"domain_scores_gemma":[0.9994186,0.000035580597,0.000031824206,0.00042477564,0.000029603667,0.000059614642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005295332,0.000066885645,0.00006824985,0.00016391645,0.000034742618,0.0003512594,0.00065651326,0.000018496848,0.000060137412],"category_scores_gemma":[0.000028657536,0.000058456517,0.000015851483,0.00077201985,0.000007430089,0.003147828,0.00017520075,0.00005997931,0.00019771291],"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.0000020122861,0.00027241782,0.032649737,0.000079748075,0.000009937259,0.000006315276,0.00048730298,0.00023576902,0.000055744687,0.8229907,0.034237932,0.1089724],"study_design_scores_gemma":[0.0017388316,0.00004738885,0.19084288,0.00020469163,0.0000127970125,0.0000035297242,0.00026358967,0.6612001,0.001005455,0.0099230865,0.13366103,0.001096603],"about_ca_topic_score_codex":0.00008286029,"about_ca_topic_score_gemma":0.000009306933,"teacher_disagreement_score":0.9000435,"about_ca_system_score_codex":0.000023289696,"about_ca_system_score_gemma":0.000015298769,"threshold_uncertainty_score":0.33872023},"labels":[],"label_agreement":null},{"id":"W2072013890","doi":"10.1145/2792838.2800190","title":"Preference-oriented Social Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Homophily; Preference; Exploit; Set (abstract data type); Social network (sociolinguistics); Context (archaeology); Inference; Computer science; Variety (cybernetics); Probabilistic logic; Social group; Social preferences; Social psychology; Psychology; Microeconomics; Artificial intelligence; Economics; Social media; World Wide Web; Computer security","score_opus":0.07941404259286733,"score_gpt":0.25508297883914505,"score_spread":0.17566893624627772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072013890","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.00032285118,0.000011031532,0.89766896,0.0006608982,0.0004743909,0.00005034003,4.655849e-7,0.00021340167,0.100597665],"genre_scores_gemma":[0.78976566,0.000010639604,0.17032336,0.0021290444,0.0010391098,0.000025375053,0.000059144095,0.000013771391,0.036633886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939,0.00001824998,0.000076904005,0.00017693691,0.00017071355,0.00016721105],"domain_scores_gemma":[0.9996476,0.000006387765,0.000022345674,0.00021447138,0.00004244464,0.00006674772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000161348,0.000057301804,0.00005704043,0.000030864205,0.00005277221,0.00014708497,0.00059121946,0.00002191045,0.000021188285],"category_scores_gemma":[0.00000737997,0.000046627145,0.000017822387,0.00025166542,0.00001495372,0.0006143969,0.00043478404,0.00004736258,0.00013468307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018240768,0.000034593173,0.00027139677,0.0000010568776,0.000009455386,0.000005190418,0.00021657099,0.00004145819,6.7949907e-7,0.6358716,0.22905496,0.13449122],"study_design_scores_gemma":[0.0006049813,0.00006583507,0.001950112,0.000002629391,0.0000046292394,0.0000012729055,0.00009951309,0.6505907,0.00002495092,0.00678038,0.33964548,0.00022952733],"about_ca_topic_score_codex":0.000015340222,"about_ca_topic_score_gemma":0.000004407778,"teacher_disagreement_score":0.78944284,"about_ca_system_score_codex":0.000012213377,"about_ca_system_score_gemma":0.000015998818,"threshold_uncertainty_score":0.19013998},"labels":[],"label_agreement":null},{"id":"W2072167856","doi":"10.3166/isi.16.6.11-39","title":"Un modèle UML et des contraintes OCL pour les entrepôts de données spatiales. De la représentation conceptuelle à l'implémentation","year":2011,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":13,"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":"Unified Modeling Language; Computer science; Object Constraint Language; Online analytical processing; Programming language; Data integrity; Data warehouse; Context (archaeology); Software engineering; Implementation; Database; Applications of UML; Software; Geography","score_opus":0.05479642006578949,"score_gpt":0.27042710966438294,"score_spread":0.21563068959859344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072167856","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.086103134,0.0007399845,0.88963187,0.00044867,0.0005919439,0.0004935205,0.00007593874,0.00024020365,0.02167474],"genre_scores_gemma":[0.8628133,0.0007569771,0.13469875,0.0005587491,0.00013799727,0.00007277912,0.00028836564,0.000020904254,0.00065221114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728614,0.0006398047,0.00081499544,0.00029324892,0.00035035296,0.0006154616],"domain_scores_gemma":[0.9982309,0.00021747196,0.00062437233,0.00039451188,0.0003734147,0.0001593302],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001816139,0.00032935882,0.00026366732,0.00026810786,0.00049963547,0.0012321098,0.00057541346,0.00019515901,0.00042175472],"category_scores_gemma":[0.00046957933,0.0003618773,0.00011939955,0.000426041,0.00069430907,0.010972291,0.0002535284,0.00021265591,0.00024022601],"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.00004293134,0.0001389336,0.010137766,0.00047353227,0.0001180035,0.000024934463,0.114636675,0.000659784,0.000311233,0.26192865,0.0018653687,0.6096622],"study_design_scores_gemma":[0.0035691063,0.00045487584,0.12585752,0.0013913907,0.00025184185,0.00034700637,0.032125823,0.57513857,0.028536376,0.21870732,0.012309485,0.0013107202],"about_ca_topic_score_codex":0.0035645557,"about_ca_topic_score_gemma":0.00009808361,"teacher_disagreement_score":0.77671015,"about_ca_system_score_codex":0.0004991344,"about_ca_system_score_gemma":0.00025256898,"threshold_uncertainty_score":0.9998833},"labels":[],"label_agreement":null},{"id":"W2072526459","doi":"10.1145/1321440.1321494","title":"A fast unified optimal route query evaluation algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Correctness; Algorithm; Pruning; Theoretical computer science","score_opus":0.023470842308094906,"score_gpt":0.2820873122154505,"score_spread":0.2586164699073556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072526459","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.0008956616,0.000023664586,0.95720094,0.0003589021,0.0004697881,0.00020057504,0.0000024567757,0.00022816316,0.040619858],"genre_scores_gemma":[0.03799472,0.0000072066177,0.9535806,0.0005794856,0.00021757303,0.000010881672,0.00006133402,0.000008995534,0.007539157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859405,0.000032819327,0.0001964957,0.00034322767,0.00053240795,0.00030102328],"domain_scores_gemma":[0.99921995,0.000035650257,0.000053095842,0.0005098719,0.000102182625,0.00007921797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017358001,0.000108988825,0.000088012974,0.00014835567,0.00008642811,0.00026468912,0.0007424634,0.000034911576,0.00009445838],"category_scores_gemma":[0.000017246735,0.000096284944,0.000039711405,0.000436665,0.00002011799,0.0012306747,0.0003511538,0.00007164795,0.00022862421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014038494,0.000036536152,0.0000389892,0.0000016994702,0.000012587754,0.00001451597,0.000087171305,0.00006797475,0.00004277081,0.031196034,0.0018812146,0.9666191],"study_design_scores_gemma":[0.00043914534,0.0000449498,0.0034506503,0.0000048953007,0.000011058562,0.000004869912,0.00009798603,0.98214847,0.0005543513,0.0009934425,0.01206298,0.00018717641],"about_ca_topic_score_codex":0.00006628849,"about_ca_topic_score_gemma":0.0000203901,"teacher_disagreement_score":0.9820805,"about_ca_system_score_codex":0.000052913052,"about_ca_system_score_gemma":0.000039164952,"threshold_uncertainty_score":0.39263862},"labels":[],"label_agreement":null},{"id":"W2073247434","doi":"10.1007/s00357-003-0011-7","title":"Maximum Split Clustering Under Connectivity Constraints","year":2003,"lang":"en","type":"article","venue":"Journal of Classification","topic":"Data Management and Algorithms","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Heuristic; Partition (number theory); Mathematics; Combinatorics; Contiguity; Cluster analysis; Set (abstract data type); Algorithm; Computer science; Mathematical optimization","score_opus":0.04863080670212839,"score_gpt":0.2771362547617657,"score_spread":0.2285054480596373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073247434","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.009223128,0.000030075322,0.97927123,0.0013221256,0.0005824126,0.000052459254,6.9860005e-7,0.00001759689,0.009500244],"genre_scores_gemma":[0.95428103,0.000019931353,0.045348044,0.00014133441,0.000056484914,8.579206e-7,7.223523e-7,0.0000036222082,0.00014797848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991812,0.00007897802,0.00027163356,0.00012040829,0.00023088351,0.00011690354],"domain_scores_gemma":[0.99920475,0.000058208374,0.0003227768,0.00024236226,0.00011356933,0.000058342364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665323,0.00006570296,0.00010779184,0.000110310124,0.000057541867,0.00017451443,0.0003816576,0.000028846427,0.000030632516],"category_scores_gemma":[0.000079459845,0.000057475805,0.000049988575,0.00018104388,0.00004210016,0.0009958277,0.00003882856,0.00011183559,0.000023571023],"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.0000078346675,0.00015804912,0.0010532723,0.000019319992,0.00005685407,0.000021108635,0.00014147493,0.00020427049,0.0044162706,0.69377244,0.0019605889,0.2981885],"study_design_scores_gemma":[0.0049644527,0.0006124853,0.3473048,0.0002457052,0.00012450379,0.001048304,0.0017262312,0.23108646,0.008008535,0.24981746,0.15390626,0.0011548091],"about_ca_topic_score_codex":5.891668e-7,"about_ca_topic_score_gemma":0.0000010426616,"teacher_disagreement_score":0.94505787,"about_ca_system_score_codex":0.000053055403,"about_ca_system_score_gemma":0.000054380296,"threshold_uncertainty_score":0.23437953},"labels":[],"label_agreement":null},{"id":"W2073835465","doi":"10.1145/2600212.2600712","title":"A scalable distributed skip list for range queries","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Scalability; Multi-core processor; Range (aeronautics); Parallel computing; Cluster (spacecraft); Data structure; Distributed computing; Range query (database); Computer cluster; Concurrent data structure; Operating system; Search engine; Information retrieval","score_opus":0.013570312600213795,"score_gpt":0.231650254573932,"score_spread":0.21807994197371822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073835465","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.00017517725,0.000010734682,0.9853289,0.0021550446,0.00022632047,0.00014629235,0.000024541165,0.00021984887,0.011713114],"genre_scores_gemma":[0.2582116,0.00001538792,0.68985623,0.0029050906,0.0005106847,0.0001922762,0.00039972216,0.000023901766,0.04788512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993681,0.000013555754,0.00009567157,0.00022166719,0.00010161396,0.00019939717],"domain_scores_gemma":[0.99943435,0.00005877892,0.000026384301,0.00039853365,0.000035972746,0.00004600472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024138506,0.00007275317,0.000089276975,0.000031134638,0.00010073296,0.0003314336,0.0006345162,0.000017811788,0.000036900223],"category_scores_gemma":[0.000050486848,0.000058449103,0.00003698736,0.00016768284,0.000024014731,0.0006721581,0.000244736,0.00002290274,0.000064187],"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.0000035141666,0.000039318256,0.0004080782,0.000024252964,0.000010388693,7.821763e-7,0.000030767602,0.0000058831793,0.00001728409,0.7764142,0.16114612,0.061899364],"study_design_scores_gemma":[0.00040554936,0.000056799512,0.0007280671,0.00000520383,0.0000042759207,5.48598e-7,0.0000094500565,0.22488712,0.00034633174,0.009272031,0.76415056,0.00013407285],"about_ca_topic_score_codex":0.00004471026,"about_ca_topic_score_gemma":0.000026768708,"teacher_disagreement_score":0.76714224,"about_ca_system_score_codex":0.000008247345,"about_ca_system_score_gemma":0.000006359097,"threshold_uncertainty_score":0.3196022},"labels":[],"label_agreement":null},{"id":"W2074082874","doi":"10.1145/1376616.1376741","title":"Stretch 'n' shrink","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Open source; Query optimization; Information retrieval; Database; Human–computer interaction; Programming language; Software","score_opus":0.02381021578104246,"score_gpt":0.20803536299146164,"score_spread":0.1842251472104192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074082874","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.013786545,0.000020286468,0.7967823,0.0013704298,0.00025724102,0.00005126155,5.796461e-7,0.0003536103,0.18737772],"genre_scores_gemma":[0.7100275,0.000053730142,0.25600514,0.0012511094,0.00011029195,0.000004691019,0.0000055208716,0.000004723912,0.032537296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999591,0.0000048099846,0.000050511284,0.00013888263,0.000109143824,0.00010568092],"domain_scores_gemma":[0.9996224,0.00000697289,0.000009302169,0.00032205594,0.000009463654,0.000029813029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040551084,0.000038180362,0.00003530174,0.000030331328,0.00005432058,0.000046021094,0.00058621843,0.000008176912,0.00015326172],"category_scores_gemma":[0.0000027282622,0.000030857544,0.000015602564,0.00014469841,0.0000130687085,0.00053859595,0.0002645042,0.000024217223,0.0005295168],"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":[4.5255888e-7,0.000055483175,0.0027168824,0.0000029653968,0.000011479196,0.0001238429,0.00018066834,0.000005064717,0.000025059908,0.5514625,0.15382364,0.291592],"study_design_scores_gemma":[0.0007107861,0.00010924642,0.039688453,0.0000060672555,0.0000037111793,0.000062441555,0.000039410603,0.26098245,0.0022357937,0.010087696,0.68551916,0.00055481185],"about_ca_topic_score_codex":0.0000129099435,"about_ca_topic_score_gemma":0.0000013499431,"teacher_disagreement_score":0.69624096,"about_ca_system_score_codex":0.0000035294036,"about_ca_system_score_gemma":0.0000068707964,"threshold_uncertainty_score":0.6806044},"labels":[],"label_agreement":null},{"id":"W2075568796","doi":"10.1145/2505515.2505713","title":"CRF framework for supervised preference aggregation","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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","funders":"","keywords":"Pairwise comparison; Conditional random field; Benchmark (surveying); Computer science; Preference; Inference; Machine learning; Unary operation; Artificial intelligence; Aggregation problem; Preference learning; Rank (graph theory); Field (mathematics); Data mining; Mathematics; Statistics","score_opus":0.046988036543216316,"score_gpt":0.2551128107390605,"score_spread":0.2081247741958442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075568796","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.0014441799,0.000012878139,0.9911812,0.0018846355,0.00022381825,0.00036712064,0.0000013849401,0.00017309682,0.004711717],"genre_scores_gemma":[0.07209645,0.00001132734,0.92376167,0.00080066844,0.000073299554,0.00012991836,0.000013336255,0.0000041775143,0.0031091424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994121,0.000008751524,0.00009288298,0.00021761384,0.00011056642,0.0001580425],"domain_scores_gemma":[0.9994062,0.00007226152,0.000024902725,0.00039901733,0.000057281566,0.000040341172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005845565,0.000063380954,0.000056166173,0.00003861994,0.000060428934,0.0003901425,0.0007001108,0.000028898143,0.00020678648],"category_scores_gemma":[0.0000406875,0.000050770323,0.000025133613,0.00014864713,0.000009731928,0.0013586873,0.00017481236,0.00003552781,0.00039809514],"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":[3.526693e-7,0.000015221516,0.00009737597,0.000007578277,0.0000040999403,1.1283764e-7,0.000051446186,0.0000019488511,0.00002741243,0.6053384,0.009984211,0.38447186],"study_design_scores_gemma":[0.0002686266,0.00007689887,0.0035709017,0.00002424127,0.0000038244634,3.3984628e-7,0.000033920554,0.44251588,0.0017319875,0.53561544,0.015942778,0.00021517092],"about_ca_topic_score_codex":0.000029572459,"about_ca_topic_score_gemma":0.0000017543597,"teacher_disagreement_score":0.44251394,"about_ca_system_score_codex":0.0000065448417,"about_ca_system_score_gemma":0.000007761825,"threshold_uncertainty_score":0.51168406},"labels":[],"label_agreement":null},{"id":"W2075657963","doi":"10.1145/1516360.1516374","title":"Answering aggregate keyword queries on relational databases using minimal group-bys","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Aggregate (composite); Tuple; Information retrieval; Set (abstract data type); Keyword search; Relational database; Matching (statistics); Table (database); Result set; Group (periodic table); Data mining; Database; Mathematics","score_opus":0.0592646243551924,"score_gpt":0.27941395934440943,"score_spread":0.22014933498921704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075657963","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.036176093,0.00006155495,0.9511196,0.0016510799,0.00032779816,0.00010056886,0.00001092305,0.000274188,0.010278208],"genre_scores_gemma":[0.21665156,0.000029002367,0.7795288,0.0021755008,0.00022446476,0.0000023335224,0.00008698647,0.000008639764,0.0012927338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989944,0.000019848689,0.0001586155,0.00034259804,0.00026293044,0.00022158581],"domain_scores_gemma":[0.99941766,0.0000406088,0.00005594625,0.00041758502,0.000017859118,0.00005032107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015544498,0.00012032808,0.00009314609,0.000112128895,0.00015320886,0.00020247098,0.00044056735,0.000015980533,0.000038970717],"category_scores_gemma":[0.000019970448,0.00010716814,0.000033533033,0.00025754672,0.00002517178,0.0020518783,0.00021557136,0.00007038847,0.00004512527],"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.000014742141,0.000106704734,0.00055998005,0.0000067632955,0.000015921089,0.000060063827,0.00009328124,0.00039045053,0.00074369955,0.8416933,0.0038294955,0.1524856],"study_design_scores_gemma":[0.0009850038,0.00046652442,0.04301605,0.00019759605,0.000023093302,0.000031040265,0.00008646005,0.76181716,0.003175412,0.0066321995,0.18253964,0.0010298326],"about_ca_topic_score_codex":0.000035806836,"about_ca_topic_score_gemma":0.000008420795,"teacher_disagreement_score":0.83506113,"about_ca_system_score_codex":0.00002113263,"about_ca_system_score_gemma":0.000009821552,"threshold_uncertainty_score":0.437019},"labels":[],"label_agreement":null},{"id":"W2075780554","doi":"10.1145/1183471.1183483","title":"Efficient integration of road maps","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Matching (statistics); Novelty; Data integration; Road map; Point (geometry); Data mining; Artificial intelligence; Geography; Cartography; Mathematics","score_opus":0.010254308351370246,"score_gpt":0.2197246140788357,"score_spread":0.20947030572746544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075780554","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.0086196745,0.0000108535105,0.922228,0.00023159412,0.0001230812,0.000044496894,0.0000011923282,0.000056532583,0.068684615],"genre_scores_gemma":[0.8826681,6.974165e-7,0.11206527,0.00005614909,0.000033508728,0.0000020719276,0.000014426348,0.000001621286,0.00515817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996278,0.0000067367932,0.00009063584,0.000100302124,0.00011114046,0.00006335803],"domain_scores_gemma":[0.9997329,0.0000050892872,0.000026843813,0.00020712966,0.000019882977,0.000008168517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092548005,0.000033059885,0.000038510498,0.000049347105,0.000015181979,0.00004345681,0.00028912575,0.000007882294,0.000015262916],"category_scores_gemma":[0.000002590384,0.000024887118,0.000016985756,0.00016410476,0.000009389472,0.00010082251,0.00010422877,0.000014724246,0.000045081655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.716745e-7,0.00007144076,0.000057222212,0.0000032358955,0.0000019765664,0.0000013319204,0.000028017208,0.00061313144,0.0010749972,0.7995026,0.011959638,0.18668592],"study_design_scores_gemma":[0.00019365153,0.000035465135,0.0094164405,0.000008007128,0.00000257199,6.713532e-7,0.000020859616,0.9656391,0.011120212,0.0058690333,0.007593258,0.00010072779],"about_ca_topic_score_codex":0.00017349956,"about_ca_topic_score_gemma":0.00001134867,"teacher_disagreement_score":0.96502596,"about_ca_system_score_codex":0.0000050694507,"about_ca_system_score_gemma":0.0000035583748,"threshold_uncertainty_score":0.10148673},"labels":[],"label_agreement":null},{"id":"W2075947171","doi":"10.3138/carto.42.2.153","title":"Understanding Spatiotemporal Patterns: Visual Ordering of Space and Time","year":2007,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":14,"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; Set (abstract data type); Row; Matrix (chemical analysis); Space (punctuation); Usability; Task (project management); Component (thermodynamics); Theoretical computer science; Data mining; Human–computer interaction","score_opus":0.023284918307625368,"score_gpt":0.278920532268305,"score_spread":0.25563561396067963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075947171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051176645,0.0000688693,0.9465274,0.001173977,0.00056180905,0.00021391375,0.000012976071,0.000037168196,0.00022723757],"genre_scores_gemma":[0.99666005,0.0005603153,0.002165484,0.00039127524,0.000100430574,0.000004615951,0.000093184324,0.0000057843677,0.000018860967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880373,0.000025510892,0.00048017348,0.0001123351,0.00040301203,0.00017522612],"domain_scores_gemma":[0.99891263,0.0001210248,0.00041293196,0.00010760638,0.00037581963,0.00007001183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014993522,0.000118122014,0.00011085887,0.0008220339,0.0003106084,0.0006168226,0.0004018577,0.00005178131,0.0000060117395],"category_scores_gemma":[0.00007258261,0.00009302745,0.00007534513,0.00040544837,0.000088428606,0.0022398725,0.00016878096,0.00010077152,7.3332734e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114707604,0.000057871803,0.03952627,0.00008184941,0.0003588997,0.0000030791978,0.0022906591,0.00014270522,0.00019689748,0.88107264,0.00074642967,0.07540797],"study_design_scores_gemma":[0.006146914,0.0009998679,0.09469281,0.00046059635,0.00018129582,0.0004538543,0.006138954,0.709787,0.0012840554,0.10221244,0.07645993,0.0011822674],"about_ca_topic_score_codex":0.000024920619,"about_ca_topic_score_gemma":0.000011633088,"teacher_disagreement_score":0.9454834,"about_ca_system_score_codex":0.000019781994,"about_ca_system_score_gemma":0.000019316105,"threshold_uncertainty_score":0.5948035},"labels":[],"label_agreement":null},{"id":"W2076172709","doi":"10.1145/765568.765571","title":"The height of a random binary search tree","year":2003,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":100,"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":"Binary search tree; Combinatorics; Binary number; Random binary tree; Mathematics; Binary tree; Tree (set theory); Self-balancing binary search tree; Optimal binary search tree; Discrete mathematics; K-ary tree; Arithmetic; Tree structure","score_opus":0.022067085861600267,"score_gpt":0.2553730957915877,"score_spread":0.2333060099299874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076172709","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.5000078,0.011488503,0.2049857,0.2108533,0.013352646,0.0012423215,0.000010236262,0.000069836395,0.057989687],"genre_scores_gemma":[0.92641675,0.00089575903,0.06336858,0.00063124025,0.0003536248,0.0000020750067,2.1372115e-7,0.000014107703,0.00831763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907464,0.00016830221,0.00021542124,0.000056523055,0.00036464125,0.00012047698],"domain_scores_gemma":[0.9984182,0.0002177744,0.00018284026,0.001079906,0.00007186519,0.000029400862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478314,0.00004746895,0.00010081954,0.000044506538,0.00012414905,0.000098746794,0.0045019025,0.000011642787,0.0000071257095],"category_scores_gemma":[0.00042643963,0.000020354702,0.00011949679,0.0002579943,0.000047245056,0.00032422485,0.00080859783,0.00013517604,0.0000061268715],"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.00034457108,0.000575363,0.0043363743,0.000058222668,0.00070463907,0.00018737567,0.0020898678,0.0006688822,0.005586187,0.13886002,0.47256342,0.37402508],"study_design_scores_gemma":[0.011234428,0.0010064234,0.03005316,0.00028859687,0.00014701847,0.00048866216,0.0006552438,0.018181518,0.031759363,0.18649141,0.71924055,0.00045362586],"about_ca_topic_score_codex":0.0000017201455,"about_ca_topic_score_gemma":0.0000011168617,"teacher_disagreement_score":0.42640898,"about_ca_system_score_codex":0.000011042237,"about_ca_system_score_gemma":0.000045236717,"threshold_uncertainty_score":0.836573},"labels":[],"label_agreement":null},{"id":"W2076293176","doi":"10.1080/17538947.2014.927597","title":"Hexagonal connectivity maps for Digital Earth","year":2014,"lang":"en","type":"article","venue":"International Journal of Digital Earth","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":59,"is_retracted":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":"Digital Earth; Geospatial analysis; Hexagonal crystal system; Grid; Polyhedron; Search engine indexing; Computer science; Variety (cybernetics); Hexagonal tiling; Theoretical computer science; Geography; Computational science; Data mining; Information retrieval; Mathematics; Cartography; Geometry; Artificial intelligence; Chemistry; Crystallography","score_opus":0.01380105371859322,"score_gpt":0.24483215849202383,"score_spread":0.2310311047734306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076293176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042908773,0.000023859307,0.9371938,0.0021705253,0.0020723413,0.00010264307,0.00021265756,0.000044230335,0.015271146],"genre_scores_gemma":[0.98942304,0.000004020013,0.008103429,0.0002468776,0.00077022734,0.0000017094488,0.000043194745,0.000009216361,0.0013982966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862844,0.000013104549,0.00034583412,0.00019193182,0.0006313975,0.00018930307],"domain_scores_gemma":[0.9987781,0.00022248263,0.00028169042,0.0001780593,0.00042710677,0.00011253436],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027920998,0.0001251022,0.0001683589,0.00019022277,0.000042703687,0.0019573218,0.001308482,0.000027358876,0.00001217039],"category_scores_gemma":[0.00032604643,0.000107600536,0.0001934591,0.00009649157,0.000043935655,0.0051978435,0.00028897275,0.00011059308,0.0000594923],"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.0001073569,0.0003926464,0.005902719,0.00001162053,0.00033917263,0.000065845714,0.000091965194,0.0002109612,0.000082615,0.1839313,0.006123006,0.80274075],"study_design_scores_gemma":[0.003871928,0.0012101,0.014589498,0.000116939475,0.000019761374,0.00046711133,0.00004733259,0.030593984,0.0012281986,0.10065491,0.8466222,0.0005780038],"about_ca_topic_score_codex":7.969169e-7,"about_ca_topic_score_gemma":0.0000013712912,"teacher_disagreement_score":0.94651425,"about_ca_system_score_codex":0.000015629586,"about_ca_system_score_gemma":0.000053854874,"threshold_uncertainty_score":0.99907875},"labels":[],"label_agreement":null},{"id":"W2076486399","doi":"10.3166/isi.15.1.35-60","title":"Stratégies alternatives pour la recherche des plus proches voisins dans les espaces multidimensionnels","year":2010,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Curse of dimensionality; Nearest neighbor search; Dimension (graph theory); Computer science; Probabilistic logic; Similarity (geometry); Mathematics; Theoretical computer science; Data mining; Artificial intelligence; Combinatorics","score_opus":0.12417799718269645,"score_gpt":0.3132868043507056,"score_spread":0.18910880716800915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076486399","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.3519568,0.0007035669,0.61973673,0.0015152467,0.0015714241,0.000573123,0.0000948389,0.00039463904,0.023453644],"genre_scores_gemma":[0.6033888,0.0007102647,0.3884817,0.00010332819,0.00032199483,0.00007846543,0.000108655935,0.000030447985,0.006776335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972488,0.00052006874,0.00074640126,0.0003632224,0.0004931369,0.0006283346],"domain_scores_gemma":[0.99729824,0.00080908986,0.0005387883,0.00061046187,0.00057180424,0.00017163891],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0023708823,0.0004480408,0.00033916463,0.00033936783,0.0006826747,0.0025952554,0.00112972,0.0004164602,0.00005651361],"category_scores_gemma":[0.0019323744,0.00042667848,0.00012619834,0.0006828275,0.00103243,0.016910926,0.00059025903,0.0008010306,0.00027150204],"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.000022595756,0.00011185671,0.001299471,0.00093025237,0.00013249338,0.000021112744,0.12802824,0.00075207266,0.0028011682,0.116741344,0.0011846476,0.74797475],"study_design_scores_gemma":[0.0023747378,0.00040065823,0.0362453,0.0022774136,0.00017102275,0.00033086812,0.051791422,0.65631163,0.042477418,0.10902874,0.09652032,0.0020704877],"about_ca_topic_score_codex":0.0015149262,"about_ca_topic_score_gemma":0.00081417605,"teacher_disagreement_score":0.74590427,"about_ca_system_score_codex":0.00038092103,"about_ca_system_score_gemma":0.00036766558,"threshold_uncertainty_score":0.9998185},"labels":[],"label_agreement":null},{"id":"W2076647913","doi":"10.3724/sp.j.1246.2012.00034.1","title":"A method for rapid transmission of multi-scale vector river data via the Internet","year":2012,"lang":"en","type":"article","venue":"Geodesy and Geodynamics","topic":"Data Management and Algorithms","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":"Bottleneck; Vector map; Computer science; The Internet; Scale (ratio); Data mining; Data transmission; Transmission (telecommunications); Bandwidth (computing); Computer network; Telecommunications; Cartography; Artificial intelligence; World Wide Web; Geography","score_opus":0.03520013781570731,"score_gpt":0.29360843846254775,"score_spread":0.25840830064684045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076647913","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.0012326678,0.0005414909,0.99716514,0.00041212075,0.00020194637,0.0002455602,0.000092934635,0.00002266402,0.00008549081],"genre_scores_gemma":[0.055396475,0.00019260898,0.9432051,0.00022239223,0.0000789008,0.000014863748,0.00020524385,0.000010111536,0.0006742835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991707,0.00005494356,0.00016066086,0.00025819376,0.000109896035,0.00024556572],"domain_scores_gemma":[0.99899566,0.00015676422,0.0000709165,0.0006876912,0.000024587804,0.00006438997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000808295,0.000105617284,0.00013079467,0.000038734248,0.00007626554,0.000054300155,0.0011233852,0.000040239713,0.000012351699],"category_scores_gemma":[0.0000121338835,0.00007109671,0.000039745544,0.00011743801,0.0000616478,0.00077718415,0.00062869897,0.00007141958,0.0000036490187],"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.000012525077,0.00009117707,0.00021008385,0.000049463328,0.000035769397,2.4636697e-7,0.0010016991,0.000021700207,0.00019798825,0.004358779,0.000669308,0.9933513],"study_design_scores_gemma":[0.00035831006,0.00003594214,0.0030018303,0.000011571181,0.000029743711,0.0000034003604,0.000028073282,0.94311094,0.00010471589,0.00038374003,0.052831426,0.000100315076],"about_ca_topic_score_codex":0.000084334446,"about_ca_topic_score_gemma":0.000020317788,"teacher_disagreement_score":0.99325097,"about_ca_system_score_codex":0.000005846789,"about_ca_system_score_gemma":0.00000773633,"threshold_uncertainty_score":0.28992394},"labels":[],"label_agreement":null},{"id":"W2077780773","doi":"10.14778/1920841.1920948","title":"Computing closed skycubes","year":2010,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Linear subspace; Computer science; Representation (politics); Subspace topology; Computation; Theoretical computer science; Formal concept analysis; Closure (psychology); Space (punctuation); Algorithm; Data mining; Mathematics; Artificial intelligence","score_opus":0.006308341498846236,"score_gpt":0.20824132972052734,"score_spread":0.2019329882216811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077780773","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.8837771,0.00006155071,0.011448524,0.008201713,0.0037685558,0.0010743396,0.000007004164,0.0004758353,0.0911854],"genre_scores_gemma":[0.9592908,0.000004814833,0.039884705,0.00020998645,0.000122836,0.0000063667317,5.019893e-7,0.0000064408373,0.00047355006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897677,0.0000025402562,0.00019913651,0.00025585943,0.00033797746,0.00022774296],"domain_scores_gemma":[0.99944085,0.000021664408,0.0001621358,0.0002429743,0.00008789648,0.00004450471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003694299,0.000110978785,0.00011764009,0.00006226274,0.00012960937,0.00018747772,0.0020092486,0.000026311218,0.000009850418],"category_scores_gemma":[0.000047081416,0.00007450462,0.00007364334,0.00030170925,0.000056873138,0.00047550767,0.0013005491,0.00016682009,0.000017476394],"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.00000417916,0.0001831956,0.006009809,0.0000882738,0.00005394026,8.2488515e-7,0.0008306021,0.000005213068,0.13823707,0.72971624,0.011552989,0.113317646],"study_design_scores_gemma":[0.001812713,0.00018615946,0.036115523,0.00016616515,0.00006071124,0.000028264009,0.00034058312,0.062034525,0.75561196,0.04870328,0.09416545,0.00077468314],"about_ca_topic_score_codex":0.000018963792,"about_ca_topic_score_gemma":0.0000016069434,"teacher_disagreement_score":0.681013,"about_ca_system_score_codex":0.000011392027,"about_ca_system_score_gemma":0.000010807732,"threshold_uncertainty_score":0.37337172},"labels":[],"label_agreement":null},{"id":"W2078488084","doi":"10.1117/12.642362","title":"Subjective trajectory characterization: acquisition, matching, and retrieval","year":2006,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Data Management and Algorithms","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":"Particle filter; Computer science; Trajectory; Computer vision; Artificial intelligence; Position (finance); Active shape model; Histogram; Representation (politics); Similarity (geometry); Pattern recognition (psychology); Filter (signal processing); Algorithm","score_opus":0.007055292126385822,"score_gpt":0.20653009863989086,"score_spread":0.19947480651350505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078488084","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.99264365,0.000053344054,0.0029849848,0.0018983501,0.00025985495,0.000367858,0.00004690946,0.00012551379,0.0016195159],"genre_scores_gemma":[0.6984866,0.0001434043,0.29856354,0.00031467548,0.0012630197,0.00009739862,0.00007714715,0.000073850606,0.0009803419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820405,1.4655032e-8,0.00048423838,0.0004293617,0.00058288226,0.00029945554],"domain_scores_gemma":[0.9986117,0.00006920667,0.00031262744,0.00006813501,0.0008672265,0.000071142385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051414926,0.00024455195,0.0002731717,0.000112965965,0.00011329273,0.0003263335,0.0010830548,0.00010720901,0.0000062365184],"category_scores_gemma":[0.00007701264,0.00021445614,0.0002563747,0.0003957979,0.00014941067,0.0016063856,0.00031073467,0.00017990157,0.0000013527006],"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.000025133924,0.00006857816,0.00034289993,0.00015635691,0.00011419447,1.2004817e-7,0.00013203049,0.000012683763,0.30268827,0.69542825,0.0007288851,0.00030261977],"study_design_scores_gemma":[0.007017919,0.001600439,0.16542032,0.0012080156,0.00057001575,0.000130558,0.0023470542,0.20997846,0.50596106,0.07862248,0.024148848,0.0029948296],"about_ca_topic_score_codex":0.000009717771,"about_ca_topic_score_gemma":8.558008e-8,"teacher_disagreement_score":0.61680573,"about_ca_system_score_codex":0.00008231727,"about_ca_system_score_gemma":0.000019709867,"threshold_uncertainty_score":0.8745268},"labels":[],"label_agreement":null},{"id":"W2079246093","doi":"10.1109/mesoca.2011.6049032","title":"On supporting dynamic web service selection with histogramming","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"International Business Machines Corporation","keywords":"Skyline; Computer science; Web service; Snapshot (computer storage); World Wide Web; Ranking (information retrieval); Dynamic web page; WS-Policy; Service (business); Information retrieval; Database; Data mining; Web application security; Web development","score_opus":0.016067437867282344,"score_gpt":0.22180531863435166,"score_spread":0.2057378807670693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079246093","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.022786219,0.0000020683938,0.9194893,0.00028494667,0.00014582158,0.00010706118,3.9796973e-7,0.000443619,0.056740545],"genre_scores_gemma":[0.8005442,9.557149e-7,0.19610369,0.0007092687,0.000013882681,0.0000072560015,0.0000055294818,0.000007852964,0.0026073488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992932,0.000011166151,0.00009694806,0.00025636368,0.00014232696,0.00019998949],"domain_scores_gemma":[0.99961513,0.000010042238,0.000058519392,0.00024317238,0.000034935827,0.000038213748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001425232,0.00008091921,0.00005824773,0.000090585956,0.000085316766,0.000086841435,0.00042443015,0.000015203769,0.000091892776],"category_scores_gemma":[0.0000035115422,0.00006232119,0.000013258405,0.00042509678,0.0000066737625,0.00062840554,0.00011234619,0.000060354818,0.00014112455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041704818,0.00042664725,0.003152861,0.00008797024,0.00009527991,0.000091442416,0.002658104,0.00008363723,0.0012780005,0.3216275,0.003977372,0.66647947],"study_design_scores_gemma":[0.0004435039,0.00038342967,0.0021229193,0.000027319036,0.000014210231,0.000017166958,0.00015402962,0.98680496,0.00076563004,0.0024579833,0.006446658,0.00036217232],"about_ca_topic_score_codex":0.00016617382,"about_ca_topic_score_gemma":0.00050037086,"teacher_disagreement_score":0.98672134,"about_ca_system_score_codex":0.000027942522,"about_ca_system_score_gemma":0.000017146293,"threshold_uncertainty_score":0.25413844},"labels":[],"label_agreement":null},{"id":"W2080555007","doi":"10.1145/1806907.1806909","title":"Continuous online index tuning in moving object databases","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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 Alberta","funders":"Media Development Authority - Singapore","keywords":"Computer science; Granularity; B-tree; Overhead (engineering); Search engine indexing; Tree (set theory); Grid; Data mining; Workload; Set (abstract data type); Object (grammar); Database; Binary tree; Information retrieval; Algorithm; Artificial intelligence; Mathematics","score_opus":0.028133624355503567,"score_gpt":0.2745241931610565,"score_spread":0.2463905688055529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080555007","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.019594105,0.00006175797,0.9753745,0.0002885505,0.0023856896,0.0004255073,0.0011648091,0.0003261243,0.00037890938],"genre_scores_gemma":[0.9424059,0.000051332758,0.05584538,0.00017270264,0.0001817105,0.000075714976,0.00062698364,0.00002855332,0.0006117696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979141,0.00010532319,0.00044424334,0.0006881533,0.00041628085,0.00043192485],"domain_scores_gemma":[0.9966849,0.00026524274,0.000116354095,0.0027601346,0.000044837605,0.00012849823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006626886,0.00024608086,0.00028443828,0.0005483517,0.00019972934,0.00031134373,0.0018878041,0.000054277723,0.00004220869],"category_scores_gemma":[0.00011514653,0.00023855134,0.000060255043,0.0008076304,0.00004824142,0.0020975284,0.00013852917,0.00064709794,0.00008572257],"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.00013111303,0.0048387917,0.010828291,0.000864495,0.00042575103,0.0017121821,0.001355733,0.008771725,0.0320848,0.04095716,0.0060519218,0.891978],"study_design_scores_gemma":[0.0037382885,0.00020945509,0.005206101,0.0010222481,0.000070832575,0.00021710199,0.0017647233,0.8333502,0.002093875,0.00014667907,0.1503901,0.0017903981],"about_ca_topic_score_codex":0.0026110387,"about_ca_topic_score_gemma":0.0022811606,"teacher_disagreement_score":0.92281175,"about_ca_system_score_codex":0.00003500802,"about_ca_system_score_gemma":0.00006131239,"threshold_uncertainty_score":0.9727841},"labels":[],"label_agreement":null},{"id":"W2080801059","doi":"10.1109/wi.2004.42","title":"Clustering Web Surfers with Probabilistic Models in a Real Application","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Open Text (Canada); York University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Probabilistic logic; Web mining; Machine learning; Web page; Artificial intelligence; World Wide Web","score_opus":0.019421044491934283,"score_gpt":0.22980754273789455,"score_spread":0.21038649824596029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080801059","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.008671928,0.0000018622103,0.9691337,0.0003193429,0.000025506622,0.00023428905,5.229838e-7,0.00013423366,0.021478657],"genre_scores_gemma":[0.85260975,0.000006892827,0.14709252,0.00007402735,0.00001360024,0.000040436702,0.0000050903695,0.0000039511224,0.00015370455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939775,0.0000064813776,0.000091012385,0.00024620516,0.00012049936,0.00013805518],"domain_scores_gemma":[0.99960345,0.000006748583,0.00002087625,0.00032160748,0.000020172274,0.0000271533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011945795,0.00006149348,0.000058722835,0.00006498715,0.00002278415,0.000092264556,0.00038814457,0.0000128593965,0.0000010173168],"category_scores_gemma":[0.000002372128,0.000048278464,0.000007921234,0.000302726,0.000014214777,0.0007680543,0.00015835991,0.0000358662,0.00001488938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010091157,0.0001260552,0.00038154304,0.00003984035,0.0000074462764,0.00001545793,0.00044793717,0.397063,0.00007001998,0.55792,0.000060295457,0.04385838],"study_design_scores_gemma":[0.0004057593,0.000032517124,0.000477321,0.000012477514,0.0000012888275,0.0000010439037,0.00001706507,0.98543006,0.000015380292,0.013411155,0.00010544142,0.000090492715],"about_ca_topic_score_codex":0.00035779353,"about_ca_topic_score_gemma":0.001039125,"teacher_disagreement_score":0.8439379,"about_ca_system_score_codex":0.000050844465,"about_ca_system_score_gemma":0.000029663099,"threshold_uncertainty_score":0.19687386},"labels":[],"label_agreement":null},{"id":"W2080956388","doi":"10.1080/13658816.2011.558017","title":"Geopot: a Cloud-based geolocation data service for mobile applications","year":2011,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Cloud computing; Geolocation; Scalability; Service (business); Database; Mobile computing; Computer network; World Wide Web; Operating system","score_opus":0.04624366737655682,"score_gpt":0.28504769206839486,"score_spread":0.23880402469183803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080956388","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.0005666927,0.000072551484,0.995427,0.0006433737,0.0017385415,0.00057677244,0.00014267908,0.000054563738,0.00077782426],"genre_scores_gemma":[0.90684307,0.00006477926,0.08848606,0.0020126847,0.0010049134,0.0003756508,0.0011639558,0.0000125745755,0.000036289075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981064,0.0000365378,0.00089497457,0.00014398142,0.0006670546,0.0001510536],"domain_scores_gemma":[0.99646086,0.00009576453,0.0008557004,0.0006104489,0.001880692,0.00009655947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849725,0.00011351451,0.00015803156,0.00058751885,0.00008103241,0.00045710508,0.0035718253,0.000063900334,0.0000109372495],"category_scores_gemma":[0.000047598907,0.000098860226,0.00008853505,0.0004932797,0.000031221185,0.0053014825,0.00031172807,0.00011771063,0.000047633835],"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.00037380465,0.0011394536,0.0052050264,0.0004943645,0.0013111228,0.000012275407,0.002332431,0.00788058,0.000044760705,0.6454038,0.02467311,0.31112927],"study_design_scores_gemma":[0.0012745274,0.00016175774,0.0013787446,0.00007206475,0.000035084242,0.000056849356,0.0002795715,0.4432002,0.000053849017,0.0017929767,0.5514886,0.00020576204],"about_ca_topic_score_codex":0.00009107604,"about_ca_topic_score_gemma":0.0000049742507,"teacher_disagreement_score":0.90694094,"about_ca_system_score_codex":0.000030673662,"about_ca_system_score_gemma":0.000090485126,"threshold_uncertainty_score":0.6637399},"labels":[],"label_agreement":null},{"id":"W2081425277","doi":"10.1109/iri.2010.5558909","title":"Tag grid: Supporting collaborative and fuzzy multidimensional queries of tagged datasets","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Ontario Tech University","funders":"","keywords":"Computer science; Information retrieval; Grid; Fuzzy logic; Tag cloud; Data mining; World Wide Web; Visualization; Artificial intelligence","score_opus":0.006771716228991452,"score_gpt":0.2551415023184189,"score_spread":0.24836978608942747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081425277","genre_codex":"empirical","genre_gemma":"methods","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.7060606,0.00016939318,0.24999492,0.007888398,0.0048734923,0.0015629007,0.0040270844,0.0006846262,0.024738604],"genre_scores_gemma":[0.2546568,0.000015728594,0.74365723,0.00035611205,0.00009684854,0.000009717936,0.0005616013,0.000007725652,0.0006382492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920285,0.00001964343,0.00018884047,0.00025663525,0.00018210355,0.00014992572],"domain_scores_gemma":[0.9993358,0.00006720997,0.00011001397,0.00036189574,0.000067433444,0.000057639478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032137966,0.000086776156,0.00011672074,0.000060629514,0.00008154434,0.00008359382,0.00032752982,0.00002479867,0.000051588788],"category_scores_gemma":[0.00007632359,0.00006955096,0.000011968219,0.00022045521,0.000095282354,0.0010057157,0.0006281095,0.000082687715,0.000011297812],"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.000015831547,0.0001784459,0.0043081264,0.000053819684,0.00006904961,0.000051071103,0.00094673445,0.000005992206,0.043306742,0.7852183,0.10701985,0.05882603],"study_design_scores_gemma":[0.0043863133,0.00059837295,0.050642945,0.00007674459,0.00006856212,0.00005398062,0.0024701199,0.116480224,0.18662536,0.011754921,0.6250015,0.0018409353],"about_ca_topic_score_codex":0.000057747173,"about_ca_topic_score_gemma":0.00009844835,"teacher_disagreement_score":0.77346337,"about_ca_system_score_codex":0.0000019656366,"about_ca_system_score_gemma":0.000035633715,"threshold_uncertainty_score":0.28362057},"labels":[],"label_agreement":null},{"id":"W2081685229","doi":"10.1080/10824000009480539","title":"Spatial Data Warehousing: A Strategy for Integrated Urban Data Management in Support of Decision Making","year":2000,"lang":"en","type":"article","venue":"Annals of GIS","topic":"Data Management and Algorithms","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":"Data warehouse; Spatial analysis; Architecture; Computer science; Data management; Spatial database; Decision support system; Dimensional modeling; Data science; Data mining; Database; Geography","score_opus":0.19953909378020154,"score_gpt":0.39153546540331025,"score_spread":0.1919963716231087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081685229","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.012231688,0.00016272292,0.977574,0.0010311725,0.00023901723,0.0008063427,0.0017043551,0.00007498112,0.006175711],"genre_scores_gemma":[0.8159215,0.0003661988,0.18053256,0.0005024554,0.0000650549,0.000009139828,0.002063436,0.000019007728,0.00052067667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984293,0.000027586422,0.0004528289,0.0005538712,0.00029341466,0.00024302633],"domain_scores_gemma":[0.9972591,0.0000622606,0.00014015853,0.002450739,0.000056699813,0.00003106052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774137,0.00011854646,0.00021676032,0.00019641746,0.000029580186,0.00009494757,0.004136684,0.0000310325,0.00011941283],"category_scores_gemma":[0.000034172368,0.00010920059,0.0000289873,0.00042126924,0.000035444795,0.001402334,0.001660434,0.000052600964,0.000009114628],"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.000046829085,0.00013601509,0.00010129874,0.000042454558,0.000038549286,0.000025319632,0.00006239493,0.00009120195,0.0000045080665,0.0010751137,0.08565014,0.91272616],"study_design_scores_gemma":[0.0012003714,0.00041558058,0.0047323536,0.00031840647,0.000039973616,0.0000029313085,0.00009652225,0.568944,0.0003783842,0.004387387,0.41909328,0.0003908166],"about_ca_topic_score_codex":0.00023584708,"about_ca_topic_score_gemma":0.00014465155,"teacher_disagreement_score":0.91233534,"about_ca_system_score_codex":0.0000050522426,"about_ca_system_score_gemma":0.000031740357,"threshold_uncertainty_score":0.7687056},"labels":[],"label_agreement":null},{"id":"W2082021920","doi":"10.1023/b:mach.0000033118.09057.80","title":"Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces","year":2004,"lang":"en","type":"article","venue":"Machine Learning","topic":"Data Management and Algorithms","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":"Cluster analysis; Dimension (graph theory); Clustering high-dimensional data; CURE data clustering algorithm; Mathematics; Quadratic equation; Correlation clustering; Computer science; Constrained clustering; Approximation algorithm; Data stream clustering; Algorithm; Data mining; Pattern recognition (psychology); Artificial intelligence; Combinatorics","score_opus":0.018086759246439765,"score_gpt":0.24490751639547292,"score_spread":0.22682075714903316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082021920","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.020246634,0.00007095338,0.9773334,0.0014311636,0.00021205083,0.0003871707,0.0000021605538,0.00016593031,0.00015050125],"genre_scores_gemma":[0.65783876,0.000005513626,0.341316,0.00012704631,0.00008512108,0.000078084224,0.00011216604,0.000017018348,0.00042024365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989007,0.000039589253,0.00021738844,0.00035110046,0.0002131894,0.00027800986],"domain_scores_gemma":[0.9995952,0.000049024027,0.000096784075,0.00019575006,0.000023998065,0.000039223705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997632,0.00013467009,0.00014884784,0.00017931635,0.00015229399,0.0002756951,0.00038025598,0.00003256934,0.00000616912],"category_scores_gemma":[0.000052925625,0.00012473976,0.000035552406,0.00031429747,0.000015190137,0.00081528636,0.00028328708,0.00015516671,0.000016944487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065297877,0.000114048584,0.0025746792,0.00015371137,0.000018232286,0.000012884609,0.0009861514,0.86274827,0.00035883873,0.021109942,0.000030958217,0.11188574],"study_design_scores_gemma":[0.0010682804,0.000102492675,0.0015144463,0.000060564427,0.0000037236803,0.0000039527154,0.000016655324,0.98909485,0.00009220606,0.00701273,0.0008572849,0.00017281565],"about_ca_topic_score_codex":0.00026692866,"about_ca_topic_score_gemma":0.00012266623,"teacher_disagreement_score":0.63759214,"about_ca_system_score_codex":0.000055313474,"about_ca_system_score_gemma":0.00001718881,"threshold_uncertainty_score":0.50867397},"labels":[],"label_agreement":null},{"id":"W2082534709","doi":"10.1016/j.is.2012.08.005","title":"Consistent query answering under spatial semantic constraints","year":2012,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Computer science; Spatial query; Class (philosophy); Set (abstract data type); Data integrity; Semantics (computer science); Information retrieval; Consistency (knowledge bases); Core (optical fiber); Query optimization; Query language; Theoretical computer science; Database; Web query classification; Web search query; Artificial intelligence; Programming language; Search engine","score_opus":0.021003019347201494,"score_gpt":0.2307467823017295,"score_spread":0.209743762954528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082534709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027725792,0.00004081293,0.9740746,0.000116755524,0.0025060775,0.0002249734,0.0000064610176,0.00017574511,0.020081993],"genre_scores_gemma":[0.9981017,0.0000033900228,0.0013489538,0.00025968946,0.00012685843,0.000014627699,0.000027718477,0.0000025242757,0.00011452799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990241,0.00003068236,0.00034521378,0.00007106919,0.0002848421,0.00024412772],"domain_scores_gemma":[0.9993735,0.000026742413,0.00015224678,0.00030794728,0.000056499204,0.000083078834],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004602696,0.00009118882,0.00010822004,0.00012420875,0.00008289126,0.00049171667,0.0003137668,0.000033216373,0.00001187144],"category_scores_gemma":[0.000012600523,0.000082006045,0.00003142762,0.00013775782,0.000032715314,0.00559173,0.000150677,0.000051849114,0.0008481905],"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.0000037388097,0.00006420144,0.0060357065,0.00038368555,0.00011695151,0.0000039193137,0.0041393163,0.0010811487,0.000070104,0.7935723,0.007661781,0.18686716],"study_design_scores_gemma":[0.0019419357,0.00008161049,0.032826122,0.00035210664,0.000039807313,0.00027971933,0.005782181,0.5754382,0.0005842492,0.00024026548,0.38121262,0.0012211746],"about_ca_topic_score_codex":0.0001085078,"about_ca_topic_score_gemma":0.000001561726,"teacher_disagreement_score":0.99532914,"about_ca_system_score_codex":0.000038533388,"about_ca_system_score_gemma":0.000020891535,"threshold_uncertainty_score":0.9999298},"labels":[],"label_agreement":null},{"id":"W2083283415","doi":"10.1145/2694413.2694425","title":"Report on the First International Workshop on Exploratory Search in Databases and the Web (ExploreDB 2014)","year":2014,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Data Management and Algorithms","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; Database; World Wide Web; Information retrieval","score_opus":0.0560095100511173,"score_gpt":0.2822348339987544,"score_spread":0.22622532394763706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083283415","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.38329232,0.0003046912,0.15598188,0.41234556,0.009444051,0.0022549187,0.000050104576,0.00052571937,0.035800762],"genre_scores_gemma":[0.97966295,0.0011950673,0.007211869,0.007940677,0.0009294991,0.00025762353,0.00008346357,0.000033143344,0.0026857255],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986126,0.00014582169,0.000212692,0.0004454289,0.0003836838,0.00019977633],"domain_scores_gemma":[0.99697125,0.0012977133,0.00007792749,0.0015860461,0.000031105494,0.00003594085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017390589,0.00012628344,0.00012062626,0.00012362421,0.00015652923,0.00028024477,0.0019693163,0.000021570739,0.00003665454],"category_scores_gemma":[0.00066054275,0.00006990211,0.000034150355,0.00021184783,0.00011249287,0.0006259451,0.0013841422,0.00024255841,0.000115869196],"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.00019037859,0.00022962187,0.010639605,0.000015584988,0.0000793345,0.00016255374,0.00094886,0.00014735003,0.000011952353,0.20567569,0.283235,0.49866405],"study_design_scores_gemma":[0.0018403925,0.000120879326,0.006468059,0.00020757804,0.000008950099,0.000014940207,0.00032853993,0.15495947,0.00015248818,0.008227973,0.82729846,0.0003722734],"about_ca_topic_score_codex":0.00004719088,"about_ca_topic_score_gemma":0.00015288465,"teacher_disagreement_score":0.59637064,"about_ca_system_score_codex":0.000022449272,"about_ca_system_score_gemma":0.00001911973,"threshold_uncertainty_score":0.36595124},"labels":[],"label_agreement":null},{"id":"W2083392507","doi":"10.1068/b31159","title":"A Precategorical Spatial-Data Metamodel","year":2006,"lang":"en","type":"article","venue":"Environment and Planning B Planning and Design","topic":"Data Management and Algorithms","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; Wilfrid Laurier University","funders":"","keywords":"Formalism (music); Metamodeling; Computer science; Spatial analysis; Graph; Graph theory; Land use; Data mining; Theoretical computer science; Geography; Mathematics; Engineering; Software engineering; Remote sensing","score_opus":0.062284283753351766,"score_gpt":0.24230444754764313,"score_spread":0.18002016379429137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083392507","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.0024268748,0.0025452222,0.9932824,0.0001957182,0.00009139518,0.00013770076,0.0000102468985,0.00011024979,0.0012002345],"genre_scores_gemma":[0.69621867,0.00012423293,0.3011358,0.00019178876,0.00031366872,0.00001875655,0.0002824399,0.000021126782,0.001693501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986548,0.00007220568,0.00018343741,0.0005932488,0.00021913089,0.00027718718],"domain_scores_gemma":[0.99919033,0.00015804001,0.0000695891,0.0004975639,0.0000030161684,0.00008148738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264717,0.00018516181,0.00017361665,0.00008692493,0.00021944796,0.00033568157,0.0005069526,0.000056062338,0.0000065949775],"category_scores_gemma":[0.0000113310225,0.0001618898,0.00001421347,0.000065320884,0.000051651685,0.00065471156,0.0005814571,0.0001204542,0.000016084628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024442648,0.0006869918,0.18693018,0.0001860711,0.00045160166,0.0014759522,0.0042738225,0.13595714,0.0014390047,0.030144231,0.26488003,0.37333053],"study_design_scores_gemma":[0.00050434493,0.00010755314,0.0242792,0.000034526678,0.000041830026,0.00002236937,0.00004171995,0.93810654,0.00011258507,0.0037359097,0.03261844,0.00039499873],"about_ca_topic_score_codex":0.00007787962,"about_ca_topic_score_gemma":1.6782543e-7,"teacher_disagreement_score":0.80214936,"about_ca_system_score_codex":0.000008687898,"about_ca_system_score_gemma":0.000009077453,"threshold_uncertainty_score":0.6601674},"labels":[],"label_agreement":null},{"id":"W2085392097","doi":"10.3166/isi.10.4.59-88","title":"Indexation multidimensionnelle de bases de données capteur temps-réel et spatio-temporelles","year":2005,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Humanities; Philosophy","score_opus":0.027069286593507026,"score_gpt":0.24500815515966298,"score_spread":0.21793886856615596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085392097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12020646,0.0012561798,0.8592249,0.004699551,0.0011697612,0.000671165,0.00010517126,0.0004009899,0.012265786],"genre_scores_gemma":[0.8718866,0.00087841897,0.12149027,0.002193536,0.0004150276,0.0000695309,0.00055243465,0.000027077063,0.0024870797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997284,0.00028231554,0.00091685215,0.0003017394,0.0005049518,0.0007101407],"domain_scores_gemma":[0.9981022,0.00018289969,0.00061993924,0.00055721827,0.00033077155,0.00020701009],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.001738567,0.0003665288,0.00028193422,0.0004386363,0.0005457498,0.001341438,0.0006534652,0.0002163307,0.00014128712],"category_scores_gemma":[0.00043414312,0.00039431185,0.00011686268,0.00063309,0.00020138946,0.016577922,0.0004172732,0.00026671056,0.00070562377],"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.000036935035,0.00023564468,0.005108289,0.0009058343,0.00010700386,0.000020292922,0.040496558,0.044924032,0.000105830964,0.12499153,0.028646816,0.75442123],"study_design_scores_gemma":[0.00076761324,0.00010635584,0.008388305,0.0005701102,0.00004319972,0.00007138377,0.0016492252,0.6939594,0.0015632667,0.0037900698,0.28858373,0.0005073548],"about_ca_topic_score_codex":0.0020733925,"about_ca_topic_score_gemma":0.0004984115,"teacher_disagreement_score":0.7539139,"about_ca_system_score_codex":0.0006381115,"about_ca_system_score_gemma":0.00033952695,"threshold_uncertainty_score":0.99985087},"labels":[],"label_agreement":null},{"id":"W2085403470","doi":"10.1155/s1173912601000177","title":"A statistical comparison of three goodness-of-fit criteria used inmodelling distances","year":2001,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Decision Sciences","topic":"Data Management and Algorithms","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":"McMaster University","funders":"","keywords":"Goodness of fit; Mean absolute error; Statistics; Mean squared error; Mathematics; Computer science","score_opus":0.14961168221071405,"score_gpt":0.38839721651434433,"score_spread":0.23878553430363028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085403470","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.19995426,0.0001369061,0.7988156,0.00003805393,0.00011589466,0.000054754535,0.0000030690148,0.0000039083243,0.0008775644],"genre_scores_gemma":[0.41659632,0.00006174606,0.5833182,0.0000063106836,0.000014356014,4.243796e-7,1.1938306e-7,0.0000016869965,8.890465e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979407,0.000003616189,0.0008619904,0.0001646436,0.0008894987,0.00013950712],"domain_scores_gemma":[0.99818933,0.0006660276,0.00075053744,0.00020257627,0.00011717567,0.00007435783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015914021,0.00009719694,0.00042436912,0.0002071778,0.00009751136,0.00024123522,0.00094712316,0.000025479643,0.000013233444],"category_scores_gemma":[0.00006193331,0.00006323418,0.000042426378,0.00047626867,0.00023317535,0.00048509656,0.00022473675,0.00007096754,0.0000013453379],"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.000032438893,0.00035416035,0.0005437988,0.00008041373,0.000020756439,0.00000826344,0.0014582246,0.00075585756,0.00070916745,0.81227565,0.0003708038,0.1833905],"study_design_scores_gemma":[0.0003021659,0.00017152604,0.000276544,0.00013063638,0.000016111864,0.000010338585,0.0007974038,0.42009637,0.0004514972,0.577425,0.0002345176,0.000087881],"about_ca_topic_score_codex":0.0000013984101,"about_ca_topic_score_gemma":0.0000024037272,"teacher_disagreement_score":0.41934052,"about_ca_system_score_codex":0.000005267955,"about_ca_system_score_gemma":0.0000394142,"threshold_uncertainty_score":0.25786152},"labels":[],"label_agreement":null},{"id":"W2085596541","doi":"10.1016/j.dam.2012.08.006","title":"Spanning cactus of a graph: Existence, extension, optimization, and approximation","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"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":"Cactus; Mathematics; Extension (predicate logic); Combinatorics; Graph; Approximation algorithm; Discrete mathematics; Botany; Computer science","score_opus":0.02074061584606133,"score_gpt":0.2399834890233004,"score_spread":0.2192428731772391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085596541","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.0024858855,0.00008571642,0.9882784,0.00005283617,0.00007052931,0.00023830477,0.0000030122571,0.00007779171,0.0087075345],"genre_scores_gemma":[0.12587123,0.000032705982,0.8739001,0.000046763063,0.000028183995,0.000021220858,0.000020542442,0.000010504383,0.00006873009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909633,0.000007650999,0.00027424074,0.00017837074,0.00023243997,0.00021094218],"domain_scores_gemma":[0.9991929,0.000047179063,0.0001986377,0.0004476059,0.00004324532,0.00007042414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034162262,0.00012168748,0.0001780012,0.00011097939,0.00007763946,0.00008002785,0.00030594665,0.000034321074,0.0000074414297],"category_scores_gemma":[0.000023827663,0.00010290393,0.000025863052,0.00031080612,0.000054737466,0.0006169929,0.00027134563,0.000047960446,0.0000073241863],"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.0000013539758,0.000082319355,0.000043787095,0.00021207152,0.000021014486,4.426181e-7,0.0026664927,0.0005712854,0.0004664937,0.99112076,0.0002901812,0.004523812],"study_design_scores_gemma":[0.0006989551,0.000043002496,0.0006672897,0.0001327848,0.00008886499,0.000015793808,0.0017845393,0.9120639,0.0037282782,0.07943239,0.0007572894,0.0005869344],"about_ca_topic_score_codex":0.0000015416464,"about_ca_topic_score_gemma":1.0594737e-7,"teacher_disagreement_score":0.9116884,"about_ca_system_score_codex":0.0000058261508,"about_ca_system_score_gemma":0.0000061270734,"threshold_uncertainty_score":0.41963002},"labels":[],"label_agreement":null},{"id":"W2086954434","doi":"10.1145/2063576.2063821","title":"Adding structure to top-k","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Information retrieval; Set (abstract data type); Web search query; Query expansion; Web query classification; Result set; Categorical variable; Search engine; Hierarchy; Interface (matter); Theoretical computer science; Machine learning","score_opus":0.026697683445214806,"score_gpt":0.22539785437844223,"score_spread":0.19870017093322742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086954434","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.002771853,0.0000037186212,0.8368268,0.00025087688,0.00035375336,0.00006696714,0.0000024159285,0.00017256083,0.15955104],"genre_scores_gemma":[0.29930446,6.1643726e-7,0.6942372,0.001439222,0.000054413376,0.0000019344523,0.0000020065963,0.0000029289813,0.004957276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995803,0.000004388377,0.000049700284,0.00016614543,0.00007967784,0.00011979256],"domain_scores_gemma":[0.99959946,0.000003565819,0.000008972047,0.00032776388,0.000010333199,0.00004992579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041396856,0.000044349425,0.000036890786,0.000050392122,0.000030621453,0.00008161148,0.000702263,0.000010061192,0.00042392238],"category_scores_gemma":[0.000004762918,0.000034516655,0.000011393431,0.00018007265,0.000003448909,0.00045175754,0.00040801163,0.000024137087,0.00022119423],"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":[7.362993e-7,0.000010005164,0.0004338891,0.000002307986,0.000006855684,0.000010892913,0.0006237424,0.0000012962857,0.0001538479,0.6756575,0.029169455,0.29392946],"study_design_scores_gemma":[0.0006030514,0.00031557548,0.040633053,0.000028263501,0.000013859126,0.0000138022015,0.000291203,0.026483528,0.035529424,0.059688274,0.83524144,0.0011585283],"about_ca_topic_score_codex":0.000023984365,"about_ca_topic_score_gemma":0.0000073796787,"teacher_disagreement_score":0.806072,"about_ca_system_score_codex":0.0000041555168,"about_ca_system_score_gemma":0.0000032270623,"threshold_uncertainty_score":0.4641653},"labels":[],"label_agreement":null},{"id":"W2087307849","doi":"10.1109/icif.2007.4408208","title":"Situation analysis for decision support: A formal approach","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Decision support system; Terrain; Situation awareness; Operations research; Decision maker; Situation analysis; Planner; Artificial intelligence; Engineering; Geography; Cartography","score_opus":0.025725439577604384,"score_gpt":0.2781522388994416,"score_spread":0.2524267993218372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087307849","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.0006863692,0.0000027465808,0.98326963,0.0000640944,0.00008195464,0.00015902994,0.0000022726888,0.000084608924,0.01564928],"genre_scores_gemma":[0.20960304,0.0000011367729,0.7886576,0.00018270855,0.000038726015,0.0000070743436,0.00007874967,0.000002098375,0.0014288429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.0000037308764,0.00016622023,0.00023315981,0.0002041799,0.00022671762],"domain_scores_gemma":[0.99945354,0.00007857174,0.000042957097,0.00033564167,0.000043217027,0.00004605856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010270312,0.000060014034,0.000085910244,0.00029145944,0.00008362711,0.00016550277,0.0004914978,0.000022110671,0.000027268037],"category_scores_gemma":[0.000022420547,0.00004810785,0.00009205222,0.00084418274,0.000006236097,0.0013232605,0.00019157352,0.000020763782,0.000024932566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009301073,0.000066210836,0.00056906213,0.0000047241933,0.000085146705,0.000001428287,0.00013105023,0.00023343365,0.000011052342,0.130966,0.003834071,0.86408854],"study_design_scores_gemma":[0.0002818532,0.00005871721,0.010771873,7.5526543e-7,0.000063462285,6.944989e-7,0.00005182698,0.9760102,0.00018986769,0.0025827696,0.009867551,0.00012043591],"about_ca_topic_score_codex":0.000006491701,"about_ca_topic_score_gemma":0.000021951448,"teacher_disagreement_score":0.97577673,"about_ca_system_score_codex":0.000012291873,"about_ca_system_score_gemma":0.000006805255,"threshold_uncertainty_score":0.19617812},"labels":[],"label_agreement":null},{"id":"W2089406675","doi":"10.1080/13658816.2012.743663","title":"LOST-Tree: a spatio-temporal structure for efficient sensor data loading in a sensor web browser","year":2012,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Data Management and Algorithms","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 Calgary","funders":"Canarie; Microsoft Research","keywords":"Sensor web; Wireless sensor network; Computer science; Mashup; Geography; Data mining; Real-time computing; World Wide Web; Web service; Computer network; Telecommunications; Key distribution in wireless sensor networks; Web 2.0","score_opus":0.02486267327264885,"score_gpt":0.28015399351693054,"score_spread":0.2552913202442817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089406675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19313255,0.00029644865,0.7921839,0.0028500692,0.009323941,0.00082756806,0.0007402962,0.00006327959,0.0005819932],"genre_scores_gemma":[0.98202085,0.000015917902,0.016761329,0.00024104913,0.0006323426,0.0000047619565,0.0002913325,0.000006178043,0.000026222418],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742746,0.0000717925,0.001081678,0.00013727974,0.000988898,0.0002929146],"domain_scores_gemma":[0.99788904,0.00013885486,0.00081127847,0.00038420255,0.00063266617,0.00014393879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013934717,0.00015511186,0.00023991089,0.0010230584,0.000050761177,0.00069012813,0.0018273687,0.00008393434,0.000013680079],"category_scores_gemma":[0.00017917567,0.0001268169,0.00010581889,0.00046036753,0.000034375575,0.0057153134,0.0004080595,0.00022002125,0.000024699673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001390771,0.0017199332,0.51613533,0.0009427239,0.0026986832,0.00015521381,0.008923702,0.051452883,0.0008537932,0.20910771,0.068497464,0.13812178],"study_design_scores_gemma":[0.0025309115,0.00010092734,0.012420135,0.00025147188,0.00002611445,0.0003393446,0.0006226317,0.75041914,0.000061831604,0.00010770052,0.23278327,0.00033651874],"about_ca_topic_score_codex":0.00004004176,"about_ca_topic_score_gemma":0.000012924582,"teacher_disagreement_score":0.78888834,"about_ca_system_score_codex":0.00007253069,"about_ca_system_score_gemma":0.000057130426,"threshold_uncertainty_score":0.6654922},"labels":[],"label_agreement":null},{"id":"W2089906307","doi":"10.1145/1807167.1807196","title":"Processing proximity relations in road networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Ranging; Track (disk drive); Set (abstract data type); Real-time computing; Data mining; Telecommunications","score_opus":0.010472758763183808,"score_gpt":0.23524127692069863,"score_spread":0.2247685181575148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089906307","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.0054303356,0.0000099950375,0.94799495,0.0010190603,0.00023207546,0.00010354395,1.3083901e-7,0.00014338116,0.04506651],"genre_scores_gemma":[0.84513867,0.0000012909701,0.15146063,0.00016980829,0.00006253332,0.000010048853,0.0000035811647,0.0000027538558,0.0031507057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951184,0.000008021742,0.00009286368,0.00017285935,0.00008040093,0.00013402432],"domain_scores_gemma":[0.99967176,0.000008085516,0.000023401568,0.0002551132,0.00001512368,0.000026511032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021041244,0.000045027093,0.00004188245,0.00005845285,0.00005971262,0.0002046845,0.00045018113,0.000027220201,0.0000299714],"category_scores_gemma":[0.0000139758995,0.000038023223,0.000010471275,0.00036132344,0.000014009554,0.0015082249,0.00019903593,0.00016002195,0.000037331785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.8151072e-7,0.000054671847,0.0075187525,0.0000030895415,0.0000013828197,0.0000050780372,0.000088870744,0.00024617044,0.000025312349,0.11385285,0.0016445998,0.87655884],"study_design_scores_gemma":[0.00008842042,0.0000040274963,0.040313095,0.000003825914,6.605968e-7,8.098712e-7,0.000005018061,0.95281756,0.000012228269,0.0024614711,0.004225002,0.000067902845],"about_ca_topic_score_codex":0.000030690186,"about_ca_topic_score_gemma":0.00019337544,"teacher_disagreement_score":0.9525714,"about_ca_system_score_codex":0.0000047765107,"about_ca_system_score_gemma":0.000014909073,"threshold_uncertainty_score":0.19737774},"labels":[],"label_agreement":null},{"id":"W2090407107","doi":"10.1016/j.jal.2005.06.005","title":"Efficient spatio-temporal data mining with GenSpace graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Computer science; Data mining; Ranking (information retrieval); Process (computing); Path (computing); Temporal database; Machine learning; Information retrieval","score_opus":0.033887326577623,"score_gpt":0.2521135207993993,"score_spread":0.2182261942217763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090407107","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.117553316,0.00022323898,0.8672445,0.0032611229,0.00033419748,0.00022016172,0.000008550866,0.000080898375,0.011074039],"genre_scores_gemma":[0.56403863,0.000010226231,0.435376,0.0003568664,0.00015630767,8.0522176e-7,0.000009854129,0.000005346859,0.000045975703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.000013990001,0.0002886434,0.00024705744,0.00045346367,0.00021367714],"domain_scores_gemma":[0.998769,0.00003286126,0.00038262104,0.00067120144,0.000055417266,0.000088936664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064396893,0.00012105577,0.00018219497,0.00016915535,0.00007890271,0.00019205017,0.0018253886,0.000025377778,0.000018002102],"category_scores_gemma":[0.000006966162,0.00008195492,0.000031012984,0.00035682152,0.000037427162,0.0003637674,0.00048824374,0.0001416543,0.000026700576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035589174,0.0010811604,0.0026137452,0.0000676428,0.0004155095,0.00065431534,0.0023357505,0.10117095,0.00031993835,0.21914151,0.08210574,0.58973783],"study_design_scores_gemma":[0.004027626,0.0008541378,0.0041821944,0.00010390081,0.0001481783,0.00030093227,0.00075714703,0.8061287,0.00055733876,0.0045030327,0.1775023,0.0009345109],"about_ca_topic_score_codex":0.0000017261551,"about_ca_topic_score_gemma":0.000008076473,"teacher_disagreement_score":0.7049577,"about_ca_system_score_codex":0.00002311987,"about_ca_system_score_gemma":0.000044635406,"threshold_uncertainty_score":0.33920565},"labels":[],"label_agreement":null},{"id":"W2090539590","doi":"10.1145/375551.375575","title":"Querying partially sound and complete data sources","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Probabilistic logic; Consistency (knowledge bases); Semantics (computer science); Set (abstract data type); Information retrieval; Possible world; Data quality; Data collection; Data mining; Theoretical computer science; Artificial intelligence; Programming language; Mathematics; Metric (unit)","score_opus":0.10321980569761678,"score_gpt":0.2845998366516957,"score_spread":0.1813800309540789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090539590","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.011013455,0.0000968274,0.97819114,0.0015006114,0.000121278885,0.000062741936,0.0000063354837,0.00016453708,0.008843079],"genre_scores_gemma":[0.8173167,0.00016056672,0.17692591,0.0022014745,0.00024969853,0.000002683721,0.00009418765,0.000010934631,0.0030378334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992336,0.000017129243,0.000099606696,0.00033891547,0.00013490583,0.00017585393],"domain_scores_gemma":[0.9990368,0.000034910598,0.000026630787,0.00084053096,0.000009910153,0.000051207568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024289613,0.00006881173,0.000071828865,0.00003878979,0.00011696899,0.0005902475,0.0013068862,0.0000112486805,0.00003688696],"category_scores_gemma":[0.0000110467045,0.000057136407,0.000007865581,0.00013242397,0.000032208205,0.0014827568,0.0019055854,0.000035817106,0.00007183764],"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.000006276287,0.000100278485,0.04804381,0.000028492928,0.00008388936,0.00015109267,0.00039813126,0.000045243385,0.00016175142,0.3420672,0.020888023,0.5880258],"study_design_scores_gemma":[0.00032795462,0.00003208307,0.008326175,0.0000074402697,0.000009717368,0.000016909791,0.00008657932,0.5655616,0.000018852892,0.009992523,0.41535443,0.00026570214],"about_ca_topic_score_codex":0.000063078835,"about_ca_topic_score_gemma":0.00013946298,"teacher_disagreement_score":0.80630326,"about_ca_system_score_codex":0.0000026189105,"about_ca_system_score_gemma":0.0000047061526,"threshold_uncertainty_score":0.56917703},"labels":[],"label_agreement":null},{"id":"W2090656321","doi":"10.5539/cis.v1n1p12","title":"Speedy Algorithm of Public Traffic Route Selection Based on Adaptive Backbone Network","year":2008,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Data Management and Algorithms","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":"National Natural Science Foundation of China","keywords":"Computer science; Backbone network; Selection (genetic algorithm); Computation; Core (optical fiber); Algorithm; Service (business); Selection algorithm; Computer network; Telecommunications; Artificial intelligence","score_opus":0.02675363555684376,"score_gpt":0.22272681670471225,"score_spread":0.1959731811478685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090656321","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.0021257692,0.000009065677,0.9948608,0.00018906254,0.00041634208,0.00014491509,0.000003925193,0.000096781725,0.0021533216],"genre_scores_gemma":[0.41016123,0.000040797917,0.5885941,0.0010359413,0.00012319944,0.000005234727,0.000015738518,0.0000027530111,0.000021053496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985749,0.000029291457,0.00029460932,0.00022843498,0.0005837168,0.00028905587],"domain_scores_gemma":[0.9991507,0.000042228894,0.00016413021,0.00028285806,0.00024794362,0.00011211843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007739091,0.000114747694,0.00012917229,0.0005059428,0.00038253132,0.00031698422,0.00074000657,0.000025721358,0.0000056263366],"category_scores_gemma":[0.000013681587,0.00010111186,0.00003060198,0.0023401086,0.00024837098,0.011685997,0.0002562828,0.00008352569,0.00003133157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030947742,0.000038791815,0.0001896643,0.000006884625,0.0000036697188,0.0000010110125,0.00033629677,0.015862942,0.0000026673472,0.020909576,0.0022101528,0.9604353],"study_design_scores_gemma":[0.000295562,0.00022754887,0.01239908,0.000013087892,0.0000013549949,0.000010689166,0.000007685275,0.9812255,0.00005491641,0.00006936411,0.005575803,0.000119422315],"about_ca_topic_score_codex":0.000003848329,"about_ca_topic_score_gemma":3.3547877e-7,"teacher_disagreement_score":0.96536255,"about_ca_system_score_codex":0.000036753438,"about_ca_system_score_gemma":0.0001374861,"threshold_uncertainty_score":0.8472066},"labels":[],"label_agreement":null},{"id":"W2091097976","doi":"10.1068/b33118","title":"Dynamic accessibility analysis in location-based service using an incremental parallel algorithm","year":2008,"lang":"en","type":"article","venue":"Environment and Planning B Planning and Design","topic":"Data Management and Algorithms","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":"MRF Geosystems (Canada)","funders":"","keywords":"Dijkstra's algorithm; Computer science; Voronoi diagram; k-nearest neighbors algorithm; Path (computing); Shortest path problem; Pathfinding; Algorithm; Euclidean distance; Service (business); Data mining; Computer network; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.05445833725858438,"score_gpt":0.2741563962339289,"score_spread":0.21969805897534453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091097976","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.27149066,0.0004084149,0.7278418,0.000036097772,0.000026947126,0.00012635045,0.00000490065,0.000044796223,0.000020028278],"genre_scores_gemma":[0.6849612,0.000017948134,0.31471178,0.00016555133,0.0000136333965,0.000008095059,0.00009771125,0.0000065290797,0.000017539553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847186,0.00015206875,0.00025439108,0.00059800385,0.00024699443,0.00027671127],"domain_scores_gemma":[0.9993171,0.00011543017,0.000103963124,0.00034029136,0.000008670893,0.0001145393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060396997,0.00020369746,0.00023611104,0.00031718644,0.00031601035,0.0001696339,0.0003187544,0.00006299264,0.000007873223],"category_scores_gemma":[0.0000072942244,0.0002019558,0.000022767163,0.0005054975,0.000060502665,0.0008428275,0.00015121982,0.00013039116,0.0000027601704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030022382,0.00015116468,0.36587822,0.00002248236,0.00009056843,0.00022038998,0.0016646542,0.6258422,0.0001064545,0.000013019864,0.000030757554,0.0059500216],"study_design_scores_gemma":[0.0003980678,0.00004860805,0.22146992,0.000024421352,0.00004102083,0.0000071175814,0.00012440067,0.7775763,0.000020276437,0.000060854774,0.000025899044,0.00020306477],"about_ca_topic_score_codex":0.00016553389,"about_ca_topic_score_gemma":0.000002493818,"teacher_disagreement_score":0.41347054,"about_ca_system_score_codex":0.000047936785,"about_ca_system_score_gemma":0.000029888522,"threshold_uncertainty_score":0.8235519},"labels":[],"label_agreement":null},{"id":"W2091334245","doi":"10.1559/152304003100010947","title":"Representation of Generalized Map Series Using Semi-Structured Data Models","year":2003,"lang":"en","type":"article","venue":"Cartography and Geographic Information Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"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":"McMaster University","keywords":"Computer science; Representation (politics); Schema (genetic algorithms); Information retrieval; Original equipment manufacturer; Data mining; Database","score_opus":0.0408222443581195,"score_gpt":0.2735583114638165,"score_spread":0.232736067105697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091334245","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.070446506,0.0002511266,0.9259545,0.00010511446,0.00058250636,0.0002918969,0.00006477691,0.00008708048,0.002216485],"genre_scores_gemma":[0.8414299,0.00026511637,0.1580235,0.00016977977,0.000012212344,0.0000055403584,0.00008450629,0.0000025872373,0.0000068935306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985157,0.0000436907,0.00035491728,0.00030684538,0.00053736457,0.00024145012],"domain_scores_gemma":[0.9984044,0.000018475323,0.00022801316,0.0010153946,0.00025027673,0.00008347536],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009377978,0.00011621401,0.00014544318,0.00096463395,0.000355598,0.0004838826,0.001144395,0.00003396363,0.0000038329895],"category_scores_gemma":[0.00005227767,0.00010475073,0.000046749246,0.0038156803,0.00053603377,0.024116209,0.00042634484,0.000060127495,7.589906e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008888703,0.000017464436,0.0070028165,0.000079828074,0.000035021498,0.0000011040886,0.0018184824,0.0030217601,0.0012325882,0.96666694,0.00024497006,0.019870112],"study_design_scores_gemma":[0.0011393039,0.0000808955,0.0079664355,0.000051215473,0.00005042045,0.000048700058,0.0013487489,0.88123244,0.007472486,0.08895524,0.011038898,0.0006152153],"about_ca_topic_score_codex":0.000047146466,"about_ca_topic_score_gemma":0.0000032756423,"teacher_disagreement_score":0.87821066,"about_ca_system_score_codex":0.0000038313783,"about_ca_system_score_gemma":0.000056880912,"threshold_uncertainty_score":0.98953295},"labels":[],"label_agreement":null},{"id":"W2092019692","doi":"10.1145/500933.500936","title":"Parallel traversal of signature trees for fast CBIR","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree traversal; Computer science; Signature (topology); Histogram; Binary tree; Tree (set theory); k-d tree; Image (mathematics); Parallel computing; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.016909529304104363,"score_gpt":0.24115249871248032,"score_spread":0.22424296940837596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092019692","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.00048464868,0.000026392392,0.98379594,0.00078369584,0.00013112223,0.00013368607,0.000006236854,0.00007093142,0.014567364],"genre_scores_gemma":[0.39038,0.00006301744,0.5688347,0.0007823445,0.00019032205,0.00002649137,0.00004266984,0.000012415372,0.039668005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994674,0.0000061030987,0.00009802417,0.00017265971,0.000113752794,0.00014207154],"domain_scores_gemma":[0.9996268,0.000028565319,0.000032308388,0.00025859234,0.00002443476,0.000029282239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008344613,0.00006394999,0.00008447091,0.000049560127,0.00002855116,0.00005153513,0.0006316867,0.000025318312,0.000039818893],"category_scores_gemma":[0.000005312721,0.000050018327,0.000049857743,0.00015401421,0.000016161868,0.00041721037,0.00010692632,0.000029147943,0.00001220099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026528352,0.00018168097,0.000335449,0.000025842754,0.000058120313,0.000013992223,0.00036326435,0.0003765546,0.00054231763,0.4768354,0.08198798,0.43925285],"study_design_scores_gemma":[0.0025445335,0.0004886955,0.0048050587,0.000021606973,0.000025655441,0.0000060117627,0.000330163,0.62699544,0.0020447802,0.017476346,0.34475994,0.0005017898],"about_ca_topic_score_codex":0.000009958989,"about_ca_topic_score_gemma":0.00002846118,"teacher_disagreement_score":0.62661886,"about_ca_system_score_codex":0.00000379242,"about_ca_system_score_gemma":0.0000073723145,"threshold_uncertainty_score":0.20396882},"labels":[],"label_agreement":null},{"id":"W2092044923","doi":"10.3166/geo.21.8-42","title":"Approche géosémantique intégrée pour les cubes évolutifs de données géospatiales","year":2011,"lang":"fr","type":"article","venue":"Revue internationale de géomatique","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"INT; Humanities; Art; Philosophy; Computer science; Programming language","score_opus":0.08373906001639302,"score_gpt":0.2584708038021653,"score_spread":0.17473174378577228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092044923","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.061154958,0.0026791464,0.88929814,0.011789872,0.0013709709,0.00043471868,0.000074506985,0.00028333697,0.03291437],"genre_scores_gemma":[0.31774968,0.0048578507,0.58040595,0.0011102847,0.0022487103,0.00024671975,0.00011698034,0.00010375611,0.09316006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997096,0.00037098848,0.00069703837,0.00073904445,0.0003653012,0.00073162233],"domain_scores_gemma":[0.99795324,0.0003309301,0.00040071906,0.0007463509,0.0003430915,0.00022564354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010827157,0.0004286768,0.00037712563,0.00034622935,0.00019273591,0.00048298185,0.002472843,0.00030488518,0.0005464472],"category_scores_gemma":[0.00047872085,0.0004906484,0.00024238872,0.00037760305,0.00028492732,0.0017407923,0.00088798645,0.0004899655,0.00052349706],"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.000015261801,0.00055289705,0.015865045,0.00066131196,0.00027425375,0.00032682688,0.008499813,0.00015962792,0.00044179359,0.80599564,0.011497518,0.15570998],"study_design_scores_gemma":[0.0008702811,0.00019935706,0.08585138,0.0026485343,0.00013495046,0.00083144946,0.00079859147,0.59048986,0.010499823,0.19734928,0.10899666,0.001329842],"about_ca_topic_score_codex":0.0037217524,"about_ca_topic_score_gemma":0.0012018271,"teacher_disagreement_score":0.6086464,"about_ca_system_score_codex":0.00038847837,"about_ca_system_score_gemma":0.00035686718,"threshold_uncertainty_score":0.9997545},"labels":[],"label_agreement":null},{"id":"W2092318232","doi":"10.1109/icra.2012.6224657","title":"Efficient on-line data summarization using extremum summaries","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"McGill University","funders":"","keywords":"Automatic summarization; Computer science; Sample (material); Constraint (computer-aided design); Task (project management); Focus (optics); Selection (genetic algorithm); Data mining; Line (geometry); Time constraint; Artificial intelligence; Machine learning; Engineering; Mathematics","score_opus":0.15976209607818245,"score_gpt":0.3241721104130834,"score_spread":0.16441001433490096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092318232","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.0014675817,0.000055858807,0.9900266,0.0003512968,0.0008095133,0.00009850303,0.000021676815,0.00015247207,0.0070164944],"genre_scores_gemma":[0.5639952,0.000016855183,0.4285515,0.001306762,0.00081624737,0.0000038442554,0.000850762,0.000023257975,0.004435561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900556,0.000027359512,0.00013641745,0.00028918512,0.00025829254,0.00028318595],"domain_scores_gemma":[0.99857676,0.000041720516,0.000046409736,0.0012422466,0.000022900973,0.000069945345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042778163,0.000097332246,0.000077817545,0.00009020627,0.0001224468,0.0002615007,0.0012585006,0.00002124701,0.000046051955],"category_scores_gemma":[0.000040998944,0.00007907305,0.000013950801,0.00031531675,0.000023516053,0.0010418597,0.0015940983,0.000047084664,0.00012415145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010031837,0.000804669,0.004505983,0.000032666892,0.00005495819,0.000008755824,0.0003470315,0.011117081,0.00045610254,0.717126,0.028152915,0.23738378],"study_design_scores_gemma":[0.0001089754,0.00001272618,0.00029743958,0.000006972041,0.0000063848343,8.8374026e-7,0.00001714835,0.97675,0.00012579112,0.00009773648,0.02245907,0.00011685875],"about_ca_topic_score_codex":0.000043204473,"about_ca_topic_score_gemma":0.0000041417334,"teacher_disagreement_score":0.9656329,"about_ca_system_score_codex":0.000018741921,"about_ca_system_score_gemma":0.000013788029,"threshold_uncertainty_score":0.32245052},"labels":[],"label_agreement":null},{"id":"W2092683383","doi":"10.1145/584792.584867","title":"Discovering approximate keys in XML data","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":25,"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; XML; Key (lock); Information retrieval; Document Structure Description; Set (abstract data type); Representation (politics); XML validation; XML database; Well-formed document; Streaming XML; Search engine indexing; XML Encryption; Data mining; Theoretical computer science; World Wide Web; Programming language; Computer security","score_opus":0.08292524527261654,"score_gpt":0.25329512341279864,"score_spread":0.17036987814018212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092683383","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.0015861682,0.000059257123,0.90942734,0.001415258,0.00021157452,0.00009746827,0.0000072227904,0.00016214896,0.08703353],"genre_scores_gemma":[0.5971149,0.00019412805,0.38444024,0.00089420594,0.00013766994,0.000012869037,0.00009034307,0.000015989053,0.017099619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929154,0.0000097309585,0.00009710957,0.00031203186,0.00011924849,0.00017032174],"domain_scores_gemma":[0.99882287,0.000011019752,0.00001637829,0.0011226352,0.0000026934542,0.00002440999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001510021,0.000057861664,0.000059144455,0.000060101334,0.000021698806,0.00025995605,0.001976789,0.000009622602,0.00009981386],"category_scores_gemma":[0.00000859152,0.00004830179,0.000007768351,0.0002495216,0.000009440156,0.0023809206,0.0020776938,0.000042640357,0.00022563925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.248675e-7,0.00021154097,0.0021941063,0.00003334843,0.000014305893,0.00010579561,0.0004686862,0.000118526026,0.000052617106,0.22326826,0.035920702,0.7376114],"study_design_scores_gemma":[0.00013579756,0.000005487416,0.0004993644,0.000005825838,7.2883955e-7,9.3083815e-7,0.000022855997,0.98215836,0.000036275233,0.00074285147,0.016300466,0.000091024696],"about_ca_topic_score_codex":0.000055116845,"about_ca_topic_score_gemma":0.000029533525,"teacher_disagreement_score":0.98203987,"about_ca_system_score_codex":0.0000071845343,"about_ca_system_score_gemma":0.000001520402,"threshold_uncertainty_score":0.36733988},"labels":[],"label_agreement":null},{"id":"W2093885745","doi":"10.1145/1370256.1370277","title":"Revisiting 2DR-tree insertion","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Tree (set theory); Tree structure; Computer science; Node (physics); Space (punctuation); Data structure; Theoretical computer science; Algorithm; Mathematics; Binary tree; Engineering; Combinatorics","score_opus":0.029364105228486256,"score_gpt":0.23050544469329656,"score_spread":0.2011413394648103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093885745","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.01014235,0.00003159643,0.87568396,0.001343885,0.00014284109,0.000048291608,2.1343561e-7,0.00027825637,0.1123286],"genre_scores_gemma":[0.6876341,0.00009523878,0.2936668,0.0018002014,0.0003121837,0.0000057040406,0.000010875927,0.0000066973334,0.016468186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.000010782733,0.00008155165,0.00015652373,0.00012201158,0.000110268],"domain_scores_gemma":[0.9996452,0.000010745706,0.000021694963,0.0002802874,0.000015932308,0.000026165713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099801706,0.000043650703,0.000043988,0.000042556276,0.0000952318,0.00006582228,0.00041582828,0.000009792729,0.00003072867],"category_scores_gemma":[0.000011377418,0.000036976664,0.000019171612,0.00019358387,0.000009649966,0.00085608975,0.00022523427,0.00002979574,0.00032622798],"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.148732e-7,0.0000220415,0.003215292,0.000008443381,0.0000074903796,0.00006266045,0.00011770266,0.000005728636,0.00025424454,0.1541313,0.020305155,0.82186925],"study_design_scores_gemma":[0.0009668665,0.00010430956,0.22205935,0.000057429566,0.000009084763,0.000097779106,0.00006579632,0.41669658,0.004059754,0.0063997386,0.34865797,0.0008253414],"about_ca_topic_score_codex":0.000014557249,"about_ca_topic_score_gemma":0.0000011362027,"teacher_disagreement_score":0.8210439,"about_ca_system_score_codex":0.0000068861286,"about_ca_system_score_gemma":0.0000059218437,"threshold_uncertainty_score":0.41931096},"labels":[],"label_agreement":null},{"id":"W2094263052","doi":"10.1139/x07-036","title":"Improved road network design models with the consideration of various link patterns and road design elements","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":30,"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":"Terrain; Grid; Computer science; Network planning and design; Graph; Minimum spanning tree; Link (geometry); Mathematical optimization; Grid cell; Tree (set theory); Representation (politics); Steiner tree problem; Graph theory; Field (mathematics); Path (computing); Algorithm; Mathematics; Theoretical computer science; Geography; Cartography","score_opus":0.07844955858372361,"score_gpt":0.2989638394534982,"score_spread":0.2205142808697746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094263052","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.015465387,0.00025861533,0.98231,0.0013492936,0.00008371121,0.00037171217,0.0000029041328,0.0000034128484,0.00015494623],"genre_scores_gemma":[0.9298972,0.000041814084,0.06965159,0.000109453766,0.00016891418,0.0000037791435,0.0000016720873,0.000009453623,0.00011612585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816144,0.0002629814,0.00033474297,0.00016778575,0.0004888646,0.00058421824],"domain_scores_gemma":[0.9983721,0.00024647397,0.00017985611,0.00032112683,0.00049408904,0.00038635006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066023776,0.00009927012,0.0001486187,0.0003333157,0.0003368115,0.0004355994,0.0008318045,0.000042223437,0.000007660982],"category_scores_gemma":[0.00007009341,0.000065942506,0.000025873564,0.00042568144,0.00015296583,0.00071008824,0.00007941338,0.00035249983,0.0000010187301],"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.00030982628,0.000072247654,0.031299442,0.000072288596,0.0004797356,0.0017792465,0.003599579,0.09589612,0.00015833712,0.03495461,0.02107358,0.810305],"study_design_scores_gemma":[0.002067627,0.0028074228,0.087873675,0.0002646239,0.000040689472,0.00022796709,0.00037687214,0.8793823,0.0005300016,0.024690827,0.001374687,0.00036332634],"about_ca_topic_score_codex":0.006077965,"about_ca_topic_score_gemma":0.042569697,"teacher_disagreement_score":0.9144318,"about_ca_system_score_codex":0.0000829447,"about_ca_system_score_gemma":0.0009341083,"threshold_uncertainty_score":0.9749009},"labels":[],"label_agreement":null},{"id":"W2094536036","doi":"10.1007/978-3-540-79299-4","title":"Transactions on Computational Science I","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":40,"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":"Pleasure; Computer science; Volume (thermodynamics); Series (stratigraphy); Data science; Psychology; Geology","score_opus":0.016204287122543144,"score_gpt":0.24590869321671666,"score_spread":0.2297044060941735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094536036","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.000013286518,0.00006771418,0.9900273,0.0006810355,0.002500816,0.00036545575,0.000014738086,0.00024898985,0.0060806572],"genre_scores_gemma":[0.02517452,0.00005637732,0.96794474,0.0033145521,0.00048728622,0.000022153654,0.000022875009,0.000037430385,0.0029400426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940713,0.000036264606,0.0004622497,0.0020952758,0.0024228122,0.00091208494],"domain_scores_gemma":[0.9973103,0.00039166052,0.00021060675,0.0015475808,0.00029617967,0.00024370605],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010177211,0.000500313,0.00041047228,0.0021461726,0.00094992097,0.0011314511,0.0071235658,0.00015278428,0.000016806058],"category_scores_gemma":[0.000047810285,0.0004707902,0.00012444596,0.0034808698,0.002314894,0.0020399464,0.00057124544,0.00083880423,0.00018897899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002423867,0.000086083084,0.000003044165,0.000015580126,0.000006640309,0.000098905024,0.00036234758,0.25911468,0.000009986132,0.0077204364,0.00030246287,0.7322774],"study_design_scores_gemma":[0.00029377762,0.00019066798,0.00012972474,0.00016775476,0.0000048352617,0.00007432882,1.1987332e-7,0.93327206,0.0004223031,0.06130841,0.003492937,0.000643084],"about_ca_topic_score_codex":0.000009510269,"about_ca_topic_score_gemma":0.000009527896,"teacher_disagreement_score":0.7316343,"about_ca_system_score_codex":0.0007418317,"about_ca_system_score_gemma":0.0027261013,"threshold_uncertainty_score":0.99990547},"labels":[],"label_agreement":null},{"id":"W2096830858","doi":"10.1007/s00224-014-9539-7","title":"Probabilistic k-Median Clustering in Data Streams","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Probabilistic logic; Mathematics; Cluster analysis; Representation (politics); Metric (unit); Probability distribution; Euclidean geometry; Point (geometry); Probabilistic analysis of algorithms; Combinatorics; Statistics","score_opus":0.03428720038795635,"score_gpt":0.25713929499946075,"score_spread":0.2228520946115044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096830858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020853536,0.00005840977,0.9734326,0.000084150444,0.0010123755,0.00025243187,0.000006073004,0.00013786329,0.0041625774],"genre_scores_gemma":[0.98992723,0.0000011734728,0.009720277,0.000024395518,0.00016955972,0.00000180098,0.000023528397,0.000008742255,0.00012329375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833673,0.00034323428,0.00040953825,0.00041560188,0.00023436568,0.00026055233],"domain_scores_gemma":[0.99777794,0.00040161514,0.00018547292,0.0015584228,0.00002840549,0.00004813332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036084612,0.00012197632,0.00026129468,0.00014494125,0.000047719463,0.00014317685,0.0026567501,0.000030395793,0.0000014698014],"category_scores_gemma":[0.00015940846,0.0001119992,0.000019803965,0.0002815224,0.000055566576,0.00040898685,0.0015612146,0.000088604924,0.000019906101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073904653,0.00010080892,0.0006238252,0.0005880188,0.000029771649,0.000010358577,0.0014482519,0.018479984,0.000042972926,0.61158854,0.0004452058,0.36663485],"study_design_scores_gemma":[0.00024822127,0.0000299359,0.00061530556,0.00027128402,0.0000039694423,0.0000046415694,0.00009383167,0.9917703,0.0000066742346,0.006044809,0.00078319816,0.00012778913],"about_ca_topic_score_codex":0.0000675007,"about_ca_topic_score_gemma":0.000018622208,"teacher_disagreement_score":0.9732904,"about_ca_system_score_codex":0.000021304339,"about_ca_system_score_gemma":0.000017643773,"threshold_uncertainty_score":0.49369466},"labels":[],"label_agreement":null},{"id":"W2096934584","doi":"10.1109/icde.2009.91","title":"Keyword Search over Dynamic Categorized Information","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Management and Algorithms","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":"ASTER","funders":"","keywords":"Computer science; Categorization; Focus (optics); Information retrieval; Keyword search; Data mining; Contrast (vision); Artificial intelligence","score_opus":0.03711792081511415,"score_gpt":0.2881913891656117,"score_spread":0.25107346835049754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096934584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008878313,0.000015296939,0.94610435,0.006281622,0.0012440103,0.00036093956,0.00015855045,0.0007686214,0.036188297],"genre_scores_gemma":[0.9701195,0.00007758944,0.028370557,0.0003596453,0.00010097094,0.000008951977,0.00071925094,0.000006843974,0.00023669457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986648,0.0000020228629,0.00022952752,0.0003321349,0.0005311769,0.00024034835],"domain_scores_gemma":[0.9993153,0.000012707579,0.00006783042,0.00036124274,0.00017239092,0.00007051847],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00027507264,0.00015642514,0.000106460495,0.00032189913,0.000049043123,0.0011404484,0.0030327763,0.000037882786,0.000058192418],"category_scores_gemma":[0.00008518273,0.0001562203,0.000021225615,0.00026562688,0.000009158888,0.0075331368,0.0006778971,0.00019928219,0.00012538444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135511145,0.000040616975,0.000035962614,0.000020403175,0.00003563813,0.0000032555797,0.00020262932,0.00026499163,0.0012941223,0.9010595,0.002304897,0.09472444],"study_design_scores_gemma":[0.00030418255,0.000045794422,0.001475805,0.000042150947,0.0000031409636,0.000003819072,0.000024965795,0.9827755,0.00016369314,0.0010399364,0.013935362,0.00018566154],"about_ca_topic_score_codex":0.0000097069415,"about_ca_topic_score_gemma":3.766617e-7,"teacher_disagreement_score":0.9825105,"about_ca_system_score_codex":0.000073233954,"about_ca_system_score_gemma":0.00002619206,"threshold_uncertainty_score":0.99989647},"labels":[],"label_agreement":null},{"id":"W2097016224","doi":"10.1109/icccyb.2010.5491218","title":"Real-time collaborative intelligent services for sensor networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Sensor web; Computer science; Wireless sensor network; Web service; Ajax; Architecture; Service (business); Variety (cybernetics); World Wide Web; Computer network; Database; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.008386407147198568,"score_gpt":0.2473887321151258,"score_spread":0.23900232496792723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097016224","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.0029778292,0.000008096444,0.9710698,0.0012621381,0.00089773163,0.00048304856,0.000013575382,0.0003073811,0.022980386],"genre_scores_gemma":[0.011263853,0.000071815266,0.96580714,0.0008055753,0.00050072075,0.0000689072,0.00008345151,0.000016816695,0.021381732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924356,0.000013029213,0.00012996774,0.00028990392,0.00010781349,0.00021575682],"domain_scores_gemma":[0.9992367,0.00007956986,0.00005216638,0.00044965622,0.00011697505,0.00006493715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022001864,0.00010027401,0.00010130497,0.000046951973,0.00009370382,0.00035149386,0.00077861134,0.000039677296,0.000086532535],"category_scores_gemma":[0.0000057140132,0.00007997717,0.000031194548,0.00029737168,0.000019678795,0.00057767855,0.00028879129,0.00006369654,0.00015110128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003185331,0.0002430152,0.0003107794,0.000075821416,0.00015663444,0.000018819039,0.0011350069,0.00082422985,0.006406641,0.6092213,0.08211822,0.29945773],"study_design_scores_gemma":[0.00015730414,0.0000597487,0.00013381337,0.000004631241,0.000006164071,8.1315443e-7,0.00008498168,0.8847009,0.0017479545,0.0011184142,0.111819245,0.0001660682],"about_ca_topic_score_codex":0.000032670647,"about_ca_topic_score_gemma":0.000059148882,"teacher_disagreement_score":0.8838766,"about_ca_system_score_codex":0.0000055125347,"about_ca_system_score_gemma":0.000014633316,"threshold_uncertainty_score":0.33894634},"labels":[],"label_agreement":null},{"id":"W2097402427","doi":"10.5555/545538.545541","title":"View updates in a semantic data modelling paradigm","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Mount Allison University","funders":"","keywords":"Sketch; Computer science; Categorical variable; Schema (genetic algorithms); Scope (computer science); Data modeling; Database schema; Theoretical computer science; Information retrieval; Database; Database design; Programming language; Algorithm; Machine learning","score_opus":0.08291259319403696,"score_gpt":0.28249692409287197,"score_spread":0.199584330898835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097402427","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.0009419236,0.00023001086,0.9908396,0.0019827858,0.00009438305,0.000086786466,0.000001982444,0.00010648528,0.0057160147],"genre_scores_gemma":[0.42461154,0.0024936975,0.56574607,0.002346662,0.00015149698,0.000013760433,0.00026507827,0.000019576055,0.0043521426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991096,0.000017416422,0.00014791277,0.00038111227,0.00013178935,0.00021213965],"domain_scores_gemma":[0.99870074,0.000020718868,0.000021936034,0.0012178335,0.0000047885496,0.000033999026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030270842,0.00007613391,0.000095687035,0.00008619513,0.000031128962,0.00023668726,0.0021215887,0.000013732384,0.000042366442],"category_scores_gemma":[0.0000036176943,0.000064025335,0.000010906268,0.00042552274,0.000009644187,0.0019049927,0.0010890594,0.000051333976,0.00023585718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034557816,0.00025386165,0.0030882622,0.00005046033,0.00003114357,0.00035977937,0.00019431848,0.00843838,0.000007179928,0.5910513,0.01657686,0.379945],"study_design_scores_gemma":[0.00010551348,0.000004974875,0.00009324222,0.000014836152,0.000001930865,0.0000040450727,0.0000056962913,0.9109816,0.000003948438,0.008192772,0.080500156,0.00009130732],"about_ca_topic_score_codex":0.00015014947,"about_ca_topic_score_gemma":0.000054056065,"teacher_disagreement_score":0.9025432,"about_ca_system_score_codex":0.000006446042,"about_ca_system_score_gemma":0.000009191457,"threshold_uncertainty_score":0.3942475},"labels":[],"label_agreement":null},{"id":"W2097783272","doi":"10.1016/j.jvlc.2011.01.001","title":"Formal classification of integrity constraints in spatiotemporal database applications","year":2011,"lang":"en","type":"article","venue":"Journal of Visual Languages & Computing","topic":"Data Management and Algorithms","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":"Natural Resources Canada; Université Laval; Natural Sciences and Engineering Research Council","funders":"","keywords":"Data integrity; Computer science; Terminology; Constraint (computer-aided design); Database; Data mining","score_opus":0.05527544016951537,"score_gpt":0.34337204731802734,"score_spread":0.288096607148512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097783272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17260726,0.00008249947,0.8257315,0.00004872467,0.0000982492,0.000104360275,0.0000052606038,0.000016382195,0.0013057219],"genre_scores_gemma":[0.86653525,0.000006362571,0.1333296,0.00002932532,0.00008099641,7.5481046e-7,0.000009224014,0.0000034711163,0.000004992905],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988403,0.00006561428,0.000564286,0.00013300763,0.00023278281,0.00016401564],"domain_scores_gemma":[0.99893194,0.00006759786,0.00060645083,0.00021248315,0.00012878716,0.00005271076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668485,0.000083953455,0.00017940154,0.00025587075,0.000041045092,0.000042511012,0.00067767355,0.000031991593,0.000014340797],"category_scores_gemma":[0.000051618666,0.00007404197,0.000053848835,0.0003310899,0.00006290029,0.0009989202,0.0002609056,0.00024728526,0.0000039673673],"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.00002148803,0.00069374224,0.024294319,0.00008873328,0.000043179425,0.00006968136,0.0027174626,0.000015713766,0.0028479802,0.070038326,0.0001508832,0.89901847],"study_design_scores_gemma":[0.0030622238,0.0009980539,0.6058208,0.00084319134,0.00007123315,0.00023115013,0.007567102,0.3641236,0.013298495,0.0022345919,0.0010066212,0.0007429718],"about_ca_topic_score_codex":0.00005667417,"about_ca_topic_score_gemma":0.000011089479,"teacher_disagreement_score":0.8982755,"about_ca_system_score_codex":0.000027331673,"about_ca_system_score_gemma":0.000059196944,"threshold_uncertainty_score":0.3019344},"labels":[],"label_agreement":null},{"id":"W2098416578","doi":"10.1145/335191.335419","title":"Efficient and extensible algorithms for multi query optimization","year":2000,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":409,"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; Query optimization; Heuristics; Benchmark (surveying); Overhead (engineering); Greedy algorithm; Heuristic; Algorithm; Data mining; Artificial intelligence","score_opus":0.04290867931345283,"score_gpt":0.2807725920124819,"score_spread":0.23786391269902907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098416578","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.005635933,0.00012403553,0.99223095,0.00060048973,0.00039472536,0.0003865989,0.00000934215,0.00017184236,0.00044606614],"genre_scores_gemma":[0.0034817134,0.00014085535,0.99237776,0.00032895614,0.000111507215,0.000048655354,0.000024832274,0.000014284878,0.0034714506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989354,0.000022953245,0.00017895068,0.00046491512,0.00013308275,0.0002647201],"domain_scores_gemma":[0.99908435,0.00008123619,0.000047967085,0.0006637301,0.00004995728,0.0000727315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022950128,0.00013147427,0.00013648764,0.00008989274,0.00015228581,0.00021201979,0.00067268,0.00004419554,0.000058516864],"category_scores_gemma":[0.00005787947,0.00012077585,0.000042884094,0.00023136864,0.000029447563,0.0003262915,0.00026213398,0.000053674725,0.000031219453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008155907,0.00007509506,0.000051519222,0.000013215318,0.000012906102,0.000004346927,0.00008119923,0.015832525,0.000016696551,0.00067434326,0.0019857374,0.98124427],"study_design_scores_gemma":[0.0005906847,0.00008373343,0.00023803237,0.00001304947,0.000008778405,0.0000035593707,0.0000106881835,0.9842018,0.00007027005,0.00041765004,0.014185641,0.00017611048],"about_ca_topic_score_codex":0.000037220212,"about_ca_topic_score_gemma":0.0000043044242,"teacher_disagreement_score":0.98106813,"about_ca_system_score_codex":0.000015553167,"about_ca_system_score_gemma":0.000014301328,"threshold_uncertainty_score":0.4925096},"labels":[],"label_agreement":null},{"id":"W2099328971","doi":"","title":"Ad-hoc top-k query answering for data streams","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":85,"is_retracted":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; Tuple; Search engine indexing; Pruning; Set (abstract data type); Information retrieval; Data mining; Wireless ad hoc network; Data stream mining; Representation (politics); Spatial query; Database; Theoretical computer science; Sargable; Web search query; Search engine","score_opus":0.05186536901822806,"score_gpt":0.3103343436705761,"score_spread":0.258468974652348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099328971","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.0008940643,0.00008696618,0.98805237,0.00046422516,0.00042127352,0.00014231318,0.000014497329,0.00020024956,0.009724015],"genre_scores_gemma":[0.017446741,0.00004917719,0.9737944,0.00079889066,0.00020930544,0.000005705937,0.00019303647,0.000011316364,0.0074914233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908763,0.0000038670364,0.0001350387,0.00037563898,0.00013304243,0.00026479783],"domain_scores_gemma":[0.99860746,0.00006158131,0.000028574517,0.0012275914,0.000018949338,0.000055842615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575676,0.00007648272,0.00007134895,0.00006170944,0.0000651396,0.00021098371,0.001938838,0.000019665462,0.000020455609],"category_scores_gemma":[0.000019340636,0.000065920925,0.000020454368,0.00016503604,0.000011602204,0.0014762862,0.001152577,0.000034548568,0.000039834198],"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.0000023066575,0.000022178807,0.00009749978,0.000008658831,0.000008925892,0.0000070268998,0.00002782606,0.0000012904067,0.00004304793,0.027647093,0.01672551,0.95540863],"study_design_scores_gemma":[0.0003549558,0.000065862194,0.0007223516,0.000010027018,0.0000062961008,0.0000016284708,0.00009011332,0.19697547,0.00091429,0.001493789,0.79913956,0.0002256741],"about_ca_topic_score_codex":0.000022319744,"about_ca_topic_score_gemma":0.000077677294,"teacher_disagreement_score":0.95518297,"about_ca_system_score_codex":0.000009813162,"about_ca_system_score_gemma":0.000010926617,"threshold_uncertainty_score":0.36028758},"labels":[],"label_agreement":null},{"id":"W2100161618","doi":"10.1109/icde.2005.226","title":"High-Dimensional Similarity Searches Using A Metric Pseudo-Grid","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Metric (unit); Computer science; Similarity (geometry); Grid; Artificial intelligence; Mathematics; Engineering; Geometry","score_opus":0.04889620410546126,"score_gpt":0.2785726413087025,"score_spread":0.22967643720324127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100161618","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.046503704,0.00008618374,0.9436758,0.0049415254,0.0005730656,0.0001721442,0.0000105082145,0.00035911123,0.0036779628],"genre_scores_gemma":[0.16133161,0.000006314128,0.835498,0.0012317544,0.0003470624,0.000002150921,0.000010743539,0.0000062610543,0.0015661423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987411,0.000038789614,0.0001504098,0.00035149578,0.0004229536,0.000295262],"domain_scores_gemma":[0.99931306,0.000058148184,0.000034737815,0.00045366812,0.000048297246,0.00009206673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004318371,0.00010987076,0.00011559956,0.00024981322,0.00013563066,0.00025262285,0.0007849229,0.00002945171,0.00017075561],"category_scores_gemma":[0.000027364182,0.00009132916,0.000046453293,0.00082840066,0.000029148847,0.0013172573,0.0008467532,0.000104390776,0.0002230744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010215231,0.000631528,0.00097067625,0.000032615833,0.00013809296,0.00009128898,0.00013075132,0.011724611,0.0012482496,0.29028454,0.09532464,0.5994128],"study_design_scores_gemma":[0.0002878296,0.000025935868,0.0017825543,0.000004902848,0.000007650132,0.000007727513,0.0000046996242,0.98193777,0.0021079641,0.0011682528,0.012471204,0.00019350942],"about_ca_topic_score_codex":0.00014473083,"about_ca_topic_score_gemma":0.000013002958,"teacher_disagreement_score":0.9702132,"about_ca_system_score_codex":0.000048369307,"about_ca_system_score_gemma":0.000036203604,"threshold_uncertainty_score":0.3724295},"labels":[],"label_agreement":null},{"id":"W2100235843","doi":"10.5555/1182635.1164146","title":"Relaxing join and selection queries","year":2006,"lang":"en","type":"article","venue":"National University of Singapore","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Joins; Computer science; Traverse; Query optimization; Theoretical computer science; Relaxation (psychology); Join (topology); Lattice (music); Selection (genetic algorithm); Information retrieval; Data mining; Mathematics; Combinatorics; Machine learning","score_opus":0.008028305870935474,"score_gpt":0.17630563071848537,"score_spread":0.1682773248475499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100235843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16772048,0.00008997609,0.74568725,0.0033122324,0.00012170403,0.00012259182,0.000017522932,0.00019559053,0.08273268],"genre_scores_gemma":[0.9268519,0.0000068523254,0.07117795,0.000024415598,0.00002816197,2.1640567e-8,0.000016278815,0.0000013336569,0.0018930746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9996643,0.000007859306,0.000035617715,0.00009568469,0.00015267656,0.000043845223],"domain_scores_gemma":[0.99983084,0.000015352018,0.00003918761,0.000027561113,0.00007761714,0.000009437704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009123666,0.000028068755,0.00003436602,0.00008066445,0.00011671757,0.000024615647,0.00011231493,0.00001575673,0.000007620805],"category_scores_gemma":[0.000006414773,0.000034382556,0.000011105856,0.00014857974,0.00003614108,0.00058936485,0.000079655685,0.000028020555,0.0000022700635],"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.000004825794,0.000040785333,0.005019847,0.0000144584565,0.000012008619,0.000006532012,0.00015707292,0.00016459714,0.00080948276,0.9677135,0.012633043,0.013423898],"study_design_scores_gemma":[0.0016310255,0.00013619119,0.45837063,0.0000732574,0.00002638253,0.000030373549,0.0005675244,0.17758155,0.0016979564,0.12037579,0.23899665,0.0005126712],"about_ca_topic_score_codex":0.00012969015,"about_ca_topic_score_gemma":0.00004349259,"teacher_disagreement_score":0.84733766,"about_ca_system_score_codex":0.000024324552,"about_ca_system_score_gemma":0.000020178462,"threshold_uncertainty_score":0.14020799},"labels":[],"label_agreement":null},{"id":"W2100247763","doi":"10.5555/1182635.1164182","title":"Similarity search: a matching based approach","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Nearest neighbor search; Similarity (geometry); Computer science; Matching (statistics); Object (grammar); Set (abstract data type); Curse of dimensionality; k-nearest neighbors algorithm; Data mining; Information retrieval; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.027808764142922257,"score_gpt":0.2324174349816486,"score_spread":0.20460867083872636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100247763","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.0006678259,0.0000056245585,0.8694632,0.000728214,0.000048390142,0.00007201123,0.0000015929556,0.00022998103,0.12878312],"genre_scores_gemma":[0.28848082,3.6553382e-7,0.70766413,0.00067936536,0.000066118744,0.0000050315,0.000027219989,0.000004446795,0.0030725356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918866,0.000028241631,0.000088878965,0.00025726442,0.00023345841,0.00020348174],"domain_scores_gemma":[0.99949825,0.000021316633,0.000013915157,0.000419176,0.000015435566,0.000031931126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030608897,0.000069237554,0.00006262566,0.0000695552,0.0000848312,0.00034107457,0.0007537633,0.000017287904,0.00002782056],"category_scores_gemma":[0.0000019810616,0.000057786823,0.0000314304,0.00025492988,0.000015260342,0.0005809085,0.00030535462,0.00006853015,0.00006161643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016166036,0.00028952776,0.0006765873,0.000035547288,0.000007791345,0.000022476752,0.00005286066,0.004381021,0.00010335172,0.93979204,0.02335214,0.03128502],"study_design_scores_gemma":[0.00021222114,0.0000105823065,0.002114553,0.000002346465,0.0000017756735,9.1260705e-7,0.000014682202,0.9806228,0.0003485522,0.008232836,0.0083055105,0.00013318914],"about_ca_topic_score_codex":0.00031501616,"about_ca_topic_score_gemma":0.000007912893,"teacher_disagreement_score":0.9762418,"about_ca_system_score_codex":0.000010955915,"about_ca_system_score_gemma":0.000014307623,"threshold_uncertainty_score":0.328899},"labels":[],"label_agreement":null},{"id":"W2100598684","doi":"","title":"Location-based indexing for mobile context-aware access to a digital library","year":2007,"lang":"en","type":"article","venue":"Research Commons (University of Waikato)","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Search engine indexing; World Wide Web; Digital library; Information access; Context (archaeology); Mobile device; Mobile computing; Tourism; Telecommunications; Geography","score_opus":0.07120690979862587,"score_gpt":0.3309801712535136,"score_spread":0.2597732614548877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100598684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024086453,0.000038578695,0.9683442,0.0033765994,0.00004820225,0.00077403564,0.000097018514,0.000121000165,0.0031139124],"genre_scores_gemma":[0.9906995,0.0000025227985,0.007878417,0.00009755292,0.000022661852,0.0000027874732,0.0000657117,0.000008326645,0.0012224644],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986564,0.000044443943,0.00010447792,0.00031625712,0.0004725794,0.00040584433],"domain_scores_gemma":[0.998317,0.00058134226,0.000046957382,0.00058340124,0.00027014132,0.00020117687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485216,0.000082313396,0.00013439286,0.0006902065,0.0003829148,0.00046542744,0.002796033,0.000043208765,0.00003545884],"category_scores_gemma":[0.000053833868,0.000099402794,0.00006142515,0.0017787452,0.0001319898,0.0030015532,0.0017410071,0.00015129578,0.0000534581],"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.0002665543,0.0006303341,0.016851118,0.00032109482,0.00009435708,0.00012342655,0.0014092255,0.00048819967,0.000041281713,0.05042154,0.11846466,0.81088823],"study_design_scores_gemma":[0.003619255,0.0012645395,0.028668908,0.00050205266,0.000018168363,0.0000028148538,0.008697412,0.24105258,0.0024197458,0.0053453348,0.7075082,0.00090099627],"about_ca_topic_score_codex":0.00012818426,"about_ca_topic_score_gemma":0.00017385867,"teacher_disagreement_score":0.9666131,"about_ca_system_score_codex":0.000055046192,"about_ca_system_score_gemma":0.00017758367,"threshold_uncertainty_score":0.51957715},"labels":[],"label_agreement":null},{"id":"W2100732567","doi":"10.1109/wise.2000.882860","title":"An extended conceptual model for fuzzy data modeling","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conceptual model; Fuzzy set; Computer science; Fuzzy logic; Data modeling; Data mining; Conceptual schema; Data model (GIS); Artificial intelligence; Theoretical computer science; Database","score_opus":0.19636446026420123,"score_gpt":0.31601500321513476,"score_spread":0.11965054295093352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100732567","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.00016405788,0.00005002892,0.993191,0.00042881572,0.000111689485,0.0001565235,0.00004528235,0.00023679706,0.005615782],"genre_scores_gemma":[0.3408446,0.000022109325,0.6549929,0.0007841987,0.0000888536,0.0000116152505,0.00013207397,0.0000081064345,0.0031155557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989297,0.00001064934,0.00013978782,0.0005192899,0.00016345864,0.0002371585],"domain_scores_gemma":[0.9982057,0.000014430233,0.000023412465,0.0016499874,0.000033485296,0.00007298805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021165301,0.000092489994,0.00008795417,0.000044497596,0.00009738394,0.00026798985,0.0027957107,0.000023168415,0.00002919836],"category_scores_gemma":[0.000009351681,0.00008124097,0.000020249889,0.00008419356,0.000021062018,0.0032818897,0.0006929428,0.000039548737,0.000043758297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017994248,0.0001391798,0.000001031534,0.000005411995,0.000014154578,0.000002311986,0.000418023,0.055113003,0.000036228408,0.6535234,0.02668975,0.2640557],"study_design_scores_gemma":[0.000269078,0.00003969918,2.7197612e-7,0.0000017079094,0.000004724883,5.449949e-7,0.00004167338,0.98846734,0.000007829207,0.009689386,0.0013420371,0.00013572782],"about_ca_topic_score_codex":0.000007160078,"about_ca_topic_score_gemma":0.000005462903,"teacher_disagreement_score":0.9333543,"about_ca_system_score_codex":0.0000063780703,"about_ca_system_score_gemma":0.0000071179593,"threshold_uncertainty_score":0.51951724},"labels":[],"label_agreement":null},{"id":"W2100928221","doi":"10.1142/s0218195905001683","title":"GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Cluster analysis; Approximation algorithm; Algorithm; Mathematics; Quadratic equation; Data point","score_opus":0.046781824903133894,"score_gpt":0.33619353800168617,"score_spread":0.2894117130985523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100928221","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.00021806787,0.00024022402,0.9929548,0.0052581206,0.0005042599,0.0003727539,0.00019210455,0.000057967616,0.00020171373],"genre_scores_gemma":[0.11319027,0.00002616111,0.88309664,0.0011911836,0.0017290078,0.000057328336,0.00057100825,0.000016186294,0.00012223108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756294,0.000028848743,0.0007384771,0.00039691693,0.0010520867,0.00022072488],"domain_scores_gemma":[0.996649,0.0005925469,0.0006162996,0.00056389277,0.0014456352,0.000132577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089329976,0.00016735586,0.00021570051,0.0013920119,0.00016576004,0.00047469093,0.004494345,0.000048479906,0.000028515835],"category_scores_gemma":[0.00009834054,0.00016990092,0.00014092617,0.0011069926,0.000051195024,0.0017636492,0.0006848689,0.00016973756,0.000058428428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021917756,0.00037027034,0.00018715182,0.000017670543,0.00024729906,0.000007445823,0.000016763717,0.17101912,0.000020080948,0.016835738,0.0056239585,0.8056326],"study_design_scores_gemma":[0.0010080499,0.00005134327,0.001041386,0.000017782912,0.000029897872,0.00007052136,0.00000980096,0.6484294,0.00009730639,0.008082081,0.34098133,0.00018107261],"about_ca_topic_score_codex":0.000003101545,"about_ca_topic_score_gemma":0.0000023808318,"teacher_disagreement_score":0.8054515,"about_ca_system_score_codex":0.00014006307,"about_ca_system_score_gemma":0.00020395448,"threshold_uncertainty_score":0.8351686},"labels":[],"label_agreement":null},{"id":"W2100934002","doi":"10.1007/978-3-642-03761-0_20","title":"Exploiting User Navigation to Improve Focused Retrieval","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Computer science; Information retrieval; Boosting (machine learning); Ranking (information retrieval); XML; Key (lock); Process (computing); Data mining; Machine learning; World Wide Web","score_opus":0.017349114839110186,"score_gpt":0.24645950088438867,"score_spread":0.22911038604527847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100934002","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.0001213653,0.00006700871,0.992488,0.0014150542,0.0019516725,0.0005886238,0.0000076675105,0.000265502,0.0030950746],"genre_scores_gemma":[0.014991584,0.000014915112,0.97763985,0.0038488032,0.0012083148,0.000007968432,0.000026930522,0.000045717097,0.0022159303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562323,0.000024445546,0.00052933226,0.0018371374,0.0012417991,0.0007440688],"domain_scores_gemma":[0.99746907,0.0001857317,0.00026203375,0.0016440906,0.00021485548,0.00022419532],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010653673,0.0005074333,0.00043222372,0.0008288978,0.00026143226,0.0013575396,0.0042061894,0.00021049885,0.000011127604],"category_scores_gemma":[0.00010031973,0.0004876271,0.0001119579,0.0009885756,0.00017935097,0.0016545224,0.0019682848,0.0006224623,0.00013571995],"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.0000047714043,0.00001378395,0.0000035226178,0.000015497537,0.00000524835,0.00006981157,0.00025594735,0.0018790052,0.00034850667,0.012200998,0.000056708082,0.9851462],"study_design_scores_gemma":[0.0010414519,0.0010700353,0.00026720538,0.0014369907,0.000027988985,0.00004344388,5.6344e-7,0.6496733,0.015938587,0.30046067,0.027313033,0.0027267197],"about_ca_topic_score_codex":0.000015020369,"about_ca_topic_score_gemma":0.0000101931955,"teacher_disagreement_score":0.9824195,"about_ca_system_score_codex":0.00028369846,"about_ca_system_score_gemma":0.0002016825,"threshold_uncertainty_score":0.9997575},"labels":[],"label_agreement":null},{"id":"W2101496601","doi":"10.1016/j.is.2011.03.008","title":"Ranking uncertain sky: The probabilistic top-k skyline operator","year":2011,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Data mining; Probabilistic logic; Uncertain data; Set (abstract data type); Ranking (information retrieval); Object (grammar); Operator (biology); Algorithm; Artificial intelligence","score_opus":0.034734958614284876,"score_gpt":0.22833759244706478,"score_spread":0.1936026338327799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101496601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020562047,0.00007009943,0.9361157,0.00043373668,0.0020021717,0.0009290347,0.000012361628,0.00031783624,0.0580629],"genre_scores_gemma":[0.9928545,0.0000064050987,0.005331513,0.0008851432,0.00016555419,0.0001345937,0.00003714024,0.0000051602974,0.0005800292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990392,0.00005131128,0.00036450036,0.00009849581,0.00027901502,0.00016751238],"domain_scores_gemma":[0.9991492,0.00002958373,0.00014241016,0.00053407904,0.00010868245,0.000036036003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075820816,0.00009152188,0.000094917,0.00008018212,0.00015856669,0.0006437968,0.0009618654,0.00002674953,0.000013635851],"category_scores_gemma":[0.00004304675,0.000057175053,0.000027405882,0.00031517635,0.000022635428,0.0035222722,0.00020564487,0.00006496299,0.0004926519],"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.0000074621903,0.000035339872,0.0005050311,0.00019633428,0.000048232334,0.0000053010576,0.015959296,0.0012714703,0.00000619853,0.885148,0.014220332,0.082597],"study_design_scores_gemma":[0.00048889156,0.000054155415,0.00088172767,0.00007073329,0.0000096248605,0.00002073129,0.001119983,0.5740582,0.000065456945,0.0006958671,0.42227122,0.00026342846],"about_ca_topic_score_codex":0.00012301037,"about_ca_topic_score_gemma":0.0000022916465,"teacher_disagreement_score":0.99079823,"about_ca_system_score_codex":0.000029197205,"about_ca_system_score_gemma":0.000030322908,"threshold_uncertainty_score":0.63322073},"labels":[],"label_agreement":null},{"id":"W2101997973","doi":"10.1109/icde.2007.369000","title":"On MBR Approximation of Histories for Historical Queries: Expectations and Limitations","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristic; Bounding overwatch; Index (typography); Set (abstract data type); Pairwise comparison; Filter (signal processing); Volume (thermodynamics); Search engine indexing; Algorithm; Mathematical optimization; Data mining; Mathematics; Information retrieval; Artificial intelligence","score_opus":0.0429416170546344,"score_gpt":0.2591871809807201,"score_spread":0.21624556392608568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101997973","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.0006825836,0.000047205733,0.9867088,0.0008158181,0.00023440208,0.0001415899,0.000001851761,0.000058539146,0.011309191],"genre_scores_gemma":[0.3492019,0.000006608103,0.64593965,0.000115300856,0.000043074397,0.000037472862,0.000022251905,0.0000051898005,0.0046285507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99951917,0.000005299474,0.00014548743,0.00013523262,0.00010311736,0.000091685346],"domain_scores_gemma":[0.9993568,0.0003386602,0.000053183467,0.00016126406,0.000060958155,0.000029126319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015660517,0.000047222413,0.00006434674,0.00011290234,0.00008589752,0.00003082553,0.00014120166,0.000015870612,0.0000014834594],"category_scores_gemma":[0.00016832848,0.000043201224,0.00001945536,0.00015812322,0.000021740258,0.00044077574,0.00003547489,0.000018143903,0.0000015755011],"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.0000035858593,0.00003850728,0.000010848586,0.0000106445605,0.00000390407,1.6718847e-7,0.0014351505,0.0000018554414,0.000037880352,0.9544073,0.005333177,0.038717013],"study_design_scores_gemma":[0.0030899178,0.0022588237,0.0060660057,0.000052683306,0.00008170884,0.0000050697518,0.010065871,0.1456058,0.007350687,0.282063,0.54214025,0.001220178],"about_ca_topic_score_codex":0.000010577367,"about_ca_topic_score_gemma":0.00003066621,"teacher_disagreement_score":0.67234427,"about_ca_system_score_codex":0.000082240775,"about_ca_system_score_gemma":0.000011789189,"threshold_uncertainty_score":0.17616947},"labels":[],"label_agreement":null},{"id":"W2103049742","doi":"10.1016/j.artint.2013.01.001","title":"Predicting the size of IDA*ʼs search tree","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"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 Regina; University of Alberta","funders":"","keywords":"Preprocessor; Computation; Truncation (statistics); Computer science; Tree (set theory); Line (geometry); Algorithm; Chen; Mathematics; Artificial intelligence; Machine learning; Combinatorics","score_opus":0.05447862698732074,"score_gpt":0.2857127171165383,"score_spread":0.23123409012921753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103049742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1001547,0.00006788669,0.88365895,0.004689931,0.0006079128,0.0004763854,0.0000040886885,0.00014469388,0.010195466],"genre_scores_gemma":[0.9896098,0.0000158675,0.009611074,0.00018255063,0.000114021466,0.000018599401,0.0000010525121,0.0000054088773,0.00044167732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987516,0.00006351127,0.00031167388,0.00026461584,0.00033344317,0.00027514758],"domain_scores_gemma":[0.9987357,0.0003819808,0.00007100408,0.00064831786,0.00011231232,0.00005066859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052995345,0.00009209912,0.000100047575,0.00004512056,0.00014332701,0.00027045494,0.0016480627,0.00002578655,0.00016554799],"category_scores_gemma":[0.00017618701,0.00006395096,0.00005074226,0.0005150905,0.00013343358,0.00073410367,0.0005535326,0.00012409149,0.0006000915],"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.0000017982526,0.000057337427,0.00051216333,0.000010009979,0.00001450594,0.0000024645706,0.0010158673,0.00017535921,0.0019464463,0.18452744,0.0006756963,0.8110609],"study_design_scores_gemma":[0.000023226454,0.00014733494,0.005149518,0.00003441429,0.000009845292,0.000003048064,0.0016155228,0.7817727,0.11529764,0.094488524,0.0012189226,0.00023931969],"about_ca_topic_score_codex":0.0005860164,"about_ca_topic_score_gemma":0.00004402034,"teacher_disagreement_score":0.889455,"about_ca_system_score_codex":0.00000978611,"about_ca_system_score_gemma":0.000023347096,"threshold_uncertainty_score":0.77131623},"labels":[],"label_agreement":null},{"id":"W2103287597","doi":"10.1109/glocom.2008.ecp.75","title":"Coverage-Based Sensor Association Rules for Wireless Vehicular Ad Hoc and Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Wireless sensor network; Computer science; Wireless ad hoc network; Process (computing); Set (abstract data type); Computer network; Association rule learning; Data mining; Base station; Key distribution in wireless sensor networks; Association (psychology); Vehicular ad hoc network; Property (philosophy); Wireless; Distributed computing; Real-time computing; Wireless network; Telecommunications","score_opus":0.013679947225468343,"score_gpt":0.21376686958549648,"score_spread":0.20008692236002815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103287597","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.07695959,0.000111044516,0.920643,0.001224251,0.00021999712,0.00028152182,0.000016302794,0.00017078206,0.00037355194],"genre_scores_gemma":[0.43737176,0.0011735132,0.5301809,0.0059146425,0.0006091433,0.000113653026,0.00038805994,0.00005622913,0.024192132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999014,0.00003815728,0.00014525442,0.00032239823,0.00021549338,0.0002646679],"domain_scores_gemma":[0.999329,0.00017567186,0.000089619774,0.00027329504,0.00007296738,0.000059468417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002596845,0.000119318276,0.00014546474,0.000054369717,0.00020656557,0.00019274566,0.00025197072,0.000064043845,0.0000066544317],"category_scores_gemma":[0.000026742322,0.000107082735,0.00005287227,0.00013147721,0.000018939161,0.00044346237,0.00010497229,0.000062063875,0.000017156928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013783005,0.00070190337,0.038498987,0.00025374314,0.000470292,0.0003555081,0.0006064326,0.020508954,0.0006327462,0.039124407,0.17764865,0.7210606],"study_design_scores_gemma":[0.00091689464,0.00006314844,0.0062613986,0.000008764128,0.000012642187,0.000002859015,0.0000087990065,0.9603285,0.00021189405,0.00014265509,0.03183848,0.0002039435],"about_ca_topic_score_codex":0.000007864564,"about_ca_topic_score_gemma":0.0000038194926,"teacher_disagreement_score":0.9398196,"about_ca_system_score_codex":0.000041531788,"about_ca_system_score_gemma":0.00001756213,"threshold_uncertainty_score":0.43667072},"labels":[],"label_agreement":null},{"id":"W2103552971","doi":"10.1145/2507157.2507159","title":"Orthogonal query recommendation","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Web query classification; Web search query; Information retrieval; Query expansion; Query optimization; Sargable; Query language; Set (abstract data type); Result set; Search engine; Matching (statistics); Ranking (information retrieval); RDF query language; Spatial query; Mathematics; Programming language","score_opus":0.008742361205546412,"score_gpt":0.19987272210056514,"score_spread":0.19113036089501872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103552971","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.00091178267,0.0000019068624,0.859825,0.0055932226,0.0002400131,0.000073856005,4.282774e-7,0.0001540783,0.1331997],"genre_scores_gemma":[0.22941315,0.000020777496,0.73023045,0.00708814,0.00022151011,0.00006137461,0.0001065883,0.000009015303,0.032848977],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996306,0.000010650084,0.00006820364,0.00013103029,0.00006448112,0.00009504872],"domain_scores_gemma":[0.99974054,0.000012848815,0.000016840868,0.00018164041,0.000019754221,0.000028383518],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008194037,0.000037545557,0.000030483856,0.000037825885,0.00003449193,0.00022508041,0.00032024982,0.0000092935015,0.0011569291],"category_scores_gemma":[0.0000041756944,0.000030092378,0.000013450699,0.00011286558,0.000005086145,0.0015767679,0.00020034253,0.000025096078,0.0020213437],"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":[6.585706e-8,0.0000131622955,0.00028328344,0.0000010711286,0.0000030135468,3.738731e-7,0.000009836303,5.0669007e-7,0.00002370486,0.19581202,0.09170552,0.7121474],"study_design_scores_gemma":[0.0003454096,0.00005582201,0.036558338,0.0000050757767,0.0000028463467,0.0000040604964,0.00004385917,0.29893515,0.00037803742,0.033777226,0.62954557,0.00034860344],"about_ca_topic_score_codex":0.000038406255,"about_ca_topic_score_gemma":0.0000034951283,"teacher_disagreement_score":0.71179885,"about_ca_system_score_codex":0.000005188312,"about_ca_system_score_gemma":0.0000047946505,"threshold_uncertainty_score":0.99975616},"labels":[],"label_agreement":null},{"id":"W2103615139","doi":"10.14778/1453856.1453955","title":"Keyword query cleaning","year":2008,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"York University; Ontario Tech University","funders":"","keywords":"Computer science; Query optimization; Query expansion; Web query classification; Web search query; Sargable; Query language; Information retrieval; Online aggregation; View; Set (abstract data type); Context (archaeology); Database; Query by Example; Data mining; Search engine","score_opus":0.016461420648945766,"score_gpt":0.19089173340955867,"score_spread":0.1744303127606129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103615139","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.60831314,0.00057917554,0.029417112,0.013207592,0.0031492459,0.0018773159,0.000010949049,0.0010184579,0.34242702],"genre_scores_gemma":[0.96988904,0.00009433112,0.0265381,0.000390835,0.000099169716,0.000020613934,5.441161e-7,0.00000937941,0.0029579855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896103,0.0000031325603,0.00019207632,0.00024668654,0.00037375445,0.00022328919],"domain_scores_gemma":[0.99951816,0.00001365306,0.00014863415,0.00020839398,0.00006935916,0.000041814328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021093339,0.000106922605,0.000118844495,0.00006666684,0.00017083708,0.00006966339,0.0015683782,0.000019186697,0.000008429159],"category_scores_gemma":[0.000029714281,0.00007393552,0.000077420795,0.00035447476,0.000059089576,0.00068336166,0.0010693619,0.00008772908,0.000024157225],"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.000022854056,0.00045234628,0.024279408,0.00019837116,0.00017070577,0.000012605758,0.0043583424,0.000035954083,0.019002736,0.722929,0.13205719,0.09648048],"study_design_scores_gemma":[0.0039141644,0.00065245025,0.072624356,0.0006264704,0.00011797354,0.0002638663,0.00118348,0.0327918,0.5073615,0.05388988,0.32467648,0.0018975872],"about_ca_topic_score_codex":0.000023356679,"about_ca_topic_score_gemma":4.3471317e-7,"teacher_disagreement_score":0.66903913,"about_ca_system_score_codex":0.000029868654,"about_ca_system_score_gemma":0.000013174723,"threshold_uncertainty_score":0.3015003},"labels":[],"label_agreement":null},{"id":"W2104550444","doi":"10.14778/1453856.1453967","title":"Efficient skyline querying with variable user preferences on nominal attributes","year":2008,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Chinese University of Hong Kong; National Natural Science Foundation of China","keywords":"Skyline; Computer science; Preference; Order (exchange); Tree (set theory); Variable (mathematics); Data mining; Mathematics; Statistics","score_opus":0.022724689187778764,"score_gpt":0.2061796146940327,"score_spread":0.18345492550625395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104550444","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.942299,0.00011395638,0.03140335,0.0019219071,0.0005150641,0.0010894128,0.000021379245,0.00023321566,0.022402702],"genre_scores_gemma":[0.94786525,0.000017589153,0.050557565,0.00018497485,0.000069290196,0.000047246518,0.0000019409931,0.000009197517,0.0012469472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858,0.00000548491,0.00021331485,0.00036412786,0.0005465033,0.00029061723],"domain_scores_gemma":[0.9993514,0.00003183823,0.00019812351,0.000233198,0.00013192745,0.00005352268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028065997,0.00016614275,0.00017830319,0.000086944136,0.00022396633,0.00010479479,0.0013093054,0.00002323703,0.000011351082],"category_scores_gemma":[0.000030704075,0.00009600473,0.000045265282,0.00046379335,0.00007910013,0.00026052786,0.0005990457,0.00011095652,0.0000131260485],"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.00032274704,0.0029702298,0.045376793,0.00060126674,0.00043717914,0.000018824889,0.0038784917,0.011562833,0.02294219,0.86633044,0.03184597,0.013713015],"study_design_scores_gemma":[0.007962035,0.0041961223,0.06392181,0.0024644816,0.0002978971,0.00021944683,0.0009968836,0.22684716,0.62084156,0.0073655425,0.062273547,0.0026135482],"about_ca_topic_score_codex":0.000048741873,"about_ca_topic_score_gemma":7.442043e-7,"teacher_disagreement_score":0.8589649,"about_ca_system_score_codex":0.00004633295,"about_ca_system_score_gemma":0.000032022916,"threshold_uncertainty_score":0.39149594},"labels":[],"label_agreement":null},{"id":"W2104992338","doi":"10.1109/ccece.2004.1347728","title":"Analysis of distance based indexing methods for similarity search","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Similarity (geometry); Nearest neighbor search; Metric (unit); Data mining; Database index; Metric space; Tree (set theory); Access method; Data structure; Similitude; Space (punctuation); Tree structure; Information retrieval; Artificial intelligence; Mathematics; Database","score_opus":0.054382943945520186,"score_gpt":0.3891997797608845,"score_spread":0.3348168358153643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104992338","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.00027119674,0.000014485805,0.9976083,0.00063971715,0.000045277855,0.00011395396,0.000011076792,0.00004974403,0.0012462322],"genre_scores_gemma":[0.103715144,0.0000013583939,0.89588267,0.00020914724,0.000007078881,0.000006764177,0.000016287537,0.000002257156,0.00015928464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992549,0.000038080954,0.00014815725,0.00025115424,0.00014877619,0.0001589776],"domain_scores_gemma":[0.9992374,0.00014209155,0.000039338418,0.00047921782,0.00006571012,0.00003623111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095154974,0.000060532162,0.00016112432,0.00023711463,0.000054017415,0.000082035825,0.00070488517,0.0000188885,0.000014039541],"category_scores_gemma":[0.000037893347,0.00005212835,0.00011236768,0.0014279471,0.000025434263,0.00035823273,0.00017084235,0.000037777485,8.854437e-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.000009934551,0.00018699147,0.0029323571,0.000067360685,0.0004874279,0.000002175742,0.00018783273,0.025387209,0.0003875498,0.6149488,0.00010572597,0.3552966],"study_design_scores_gemma":[0.00029381088,0.000027286662,0.0026386383,0.000004101122,0.00007795852,2.1578847e-8,0.000013209067,0.9840521,0.0061232937,0.0040911012,0.0025935848,0.00008490112],"about_ca_topic_score_codex":0.00006019723,"about_ca_topic_score_gemma":0.000032425865,"teacher_disagreement_score":0.9586649,"about_ca_system_score_codex":0.000022973281,"about_ca_system_score_gemma":0.000030489306,"threshold_uncertainty_score":0.21257325},"labels":[],"label_agreement":null},{"id":"W2105283873","doi":"10.1007/978-3-540-30076-2_13","title":"A Partial Pre-aggregation Scheme for HOLAP Engines","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Aggregate (composite); Overhead (engineering); Scheme (mathematics); Online aggregation; Cube (algebra); Greedy algorithm; Algorithm; Theoretical computer science; Search engine; Information retrieval; Web search query; Sargable; Mathematics; Programming language","score_opus":0.017649390009643866,"score_gpt":0.24943202107536577,"score_spread":0.23178263106572192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105283873","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.000033650078,0.00016816579,0.9951344,0.0009841558,0.0021052854,0.00073756283,0.0000140207085,0.00021548013,0.00060724234],"genre_scores_gemma":[0.018868022,0.000025719297,0.9784518,0.0008344781,0.0010752152,0.000045462963,0.00003817636,0.000034637887,0.0006264807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683714,0.00001077139,0.0004098316,0.0014020184,0.00073560723,0.00060465187],"domain_scores_gemma":[0.99809086,0.00018946368,0.00022724351,0.0011920619,0.00018023056,0.00012012451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006631572,0.00043854312,0.00036707573,0.0006076405,0.00023549012,0.000914465,0.003170054,0.00020044741,0.000013562914],"category_scores_gemma":[0.000086517175,0.0004084363,0.00013394248,0.00045659285,0.00030017796,0.0013726864,0.0011537415,0.00035602148,0.000029994872],"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.0000068345844,0.000031292468,0.000012568019,0.00007812384,0.000015455496,0.000025764499,0.00027872095,0.016247107,0.00007077685,0.1987727,0.000062145504,0.7843985],"study_design_scores_gemma":[0.0005073235,0.00018804571,0.00003670471,0.00032848632,0.000010206903,0.000011200311,4.5187008e-8,0.74022436,0.0019236831,0.24677123,0.009371963,0.00062672206],"about_ca_topic_score_codex":0.000013208587,"about_ca_topic_score_gemma":0.000016067692,"teacher_disagreement_score":0.7837718,"about_ca_system_score_codex":0.00020144999,"about_ca_system_score_gemma":0.00034706836,"threshold_uncertainty_score":0.99983674},"labels":[],"label_agreement":null},{"id":"W2105814260","doi":"10.1109/cmpsac.1990.139357","title":"A bi-level object-oriented data model for GIS applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Geographic information system; Object-based spatial database; Object (grammar); Data model (GIS); Data modeling; Representation (politics); Geometric modeling; Set (abstract data type); Spatial analysis; Object-oriented programming; Geometric networks; Function (biology); Data mining; Theoretical computer science; Information retrieval; Spatial database; Database; Artificial intelligence; Programming language; Geography; Mathematics; World Wide Web; Remote sensing","score_opus":0.15955316621612123,"score_gpt":0.2996829217535909,"score_spread":0.14012975553746967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105814260","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.0000038445346,0.000031602325,0.98701227,0.0014074249,0.00006319594,0.00041311918,0.0002468196,0.00020834421,0.010613359],"genre_scores_gemma":[0.004546286,0.000028208242,0.9578492,0.00066043425,0.000066297405,0.00018331493,0.00029560676,0.000007772909,0.036362875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990673,0.000005012732,0.00012988235,0.0004599944,0.00014260421,0.00019520002],"domain_scores_gemma":[0.99809575,0.000029533396,0.00003465989,0.0017484864,0.000038754595,0.000052814423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013158872,0.00008096707,0.00007292781,0.000068849346,0.00011944949,0.00015622031,0.002128137,0.00001918189,0.000037271424],"category_scores_gemma":[0.000012591186,0.00007128917,0.000023051993,0.00032489523,0.000016594215,0.0011147528,0.0010181911,0.00003265645,0.00017647955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.3823444e-7,0.00014617162,0.00000846077,0.000012241941,0.000020511223,5.3441903e-7,0.00009676331,0.00012706204,0.000021562673,0.38182533,0.3283044,0.28943634],"study_design_scores_gemma":[0.00017648576,0.000007761501,0.000009452899,0.000001325286,0.000005100522,4.419796e-7,0.0000062282875,0.820632,0.000016151329,0.002012542,0.1770449,0.00008762988],"about_ca_topic_score_codex":0.000011190232,"about_ca_topic_score_gemma":0.000014156727,"teacher_disagreement_score":0.8205049,"about_ca_system_score_codex":0.000008736383,"about_ca_system_score_gemma":0.000008235728,"threshold_uncertainty_score":0.39546433},"labels":[],"label_agreement":null},{"id":"W2106261787","doi":"","title":"On the Suitability of Skyline Queries for Data Exploration","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Victoria","funders":"Strategiske Forskningsråd","keywords":"Skyline; Computer science; Data mining; Data science; Information retrieval","score_opus":0.10389612201650028,"score_gpt":0.2952690435094551,"score_spread":0.19137292149295482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106261787","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.0008764269,0.0000018835458,0.9902285,0.0060299705,0.00010677033,0.00014792156,0.000012528991,0.000032680655,0.0025633464],"genre_scores_gemma":[0.7962106,0.0000062073145,0.20097065,0.0010636394,0.00010626173,0.00003579414,0.00022893284,0.000005003115,0.0013729393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995631,0.000026093558,0.00009074776,0.00016592714,0.00009346402,0.00006064403],"domain_scores_gemma":[0.99847287,0.0002563506,0.00003335458,0.0011997415,0.000028909166,0.000008781155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081590464,0.00003499074,0.00004667261,0.000013568524,0.000042883265,0.00006274218,0.001111437,0.0000068353916,0.000013322476],"category_scores_gemma":[0.00024334108,0.00001975865,0.00001084936,0.00007330388,0.000022527958,0.0009175621,0.00042635607,0.000014703033,0.00000842109],"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.0000017975249,0.000021566302,0.000021633015,0.0000061110327,0.0000023960536,9.2448875e-9,0.000032240336,0.0000054383677,0.000015913318,0.9324912,0.012658914,0.054742806],"study_design_scores_gemma":[0.00013905551,0.000116887415,0.00031612592,0.000004140913,0.0000031745633,3.4391352e-8,0.00004429276,0.80795646,0.0018471762,0.12762424,0.061886545,0.000061869825],"about_ca_topic_score_codex":0.000016407552,"about_ca_topic_score_gemma":0.000029953546,"teacher_disagreement_score":0.80795103,"about_ca_system_score_codex":0.0000020454393,"about_ca_system_score_gemma":0.000004874867,"threshold_uncertainty_score":0.20653449},"labels":[],"label_agreement":null},{"id":"W2107717699","doi":"10.1109/icpr.2006.947","title":"Probabilistic Relaxation using the Heat Equation","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Laplacian matrix; Probabilistic logic; Heat equation; Mathematics; Graph; Computer science; Discrete mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.03669928004500724,"score_gpt":0.24581203043714367,"score_spread":0.20911275039213642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107717699","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.004297266,0.000011995546,0.98580086,0.00096669013,0.00013803461,0.00012132721,2.4141247e-7,0.00008464176,0.008578941],"genre_scores_gemma":[0.87752086,0.000001135182,0.11932862,0.0003385762,0.00017100901,0.00000854151,0.000018506225,0.0000041924072,0.0026085759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.000020653886,0.00008273741,0.0001199897,0.0001291106,0.000080673206],"domain_scores_gemma":[0.9996711,0.00002513909,0.00002127857,0.0002547954,0.000020863497,0.0000068286276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018882226,0.000037143855,0.000026021982,0.000024817273,0.00010134409,0.00020767358,0.00028383333,0.000009163563,0.000009733192],"category_scores_gemma":[0.000012040312,0.00002301392,0.0000123622085,0.00020020173,0.000012149766,0.0005781222,0.00009784043,0.000022178283,0.000030079877],"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.5621002e-7,0.000022312812,0.00015670125,0.000003741255,0.0000019877614,8.2083784e-7,0.000045202054,0.008807174,0.00017209361,0.97634447,0.002188286,0.012256856],"study_design_scores_gemma":[0.0000492263,0.00000627562,0.001264526,0.000002225786,0.0000026588841,6.899973e-7,0.000006025461,0.96751285,0.000117788964,0.028547408,0.0024490855,0.00004126443],"about_ca_topic_score_codex":0.00021828231,"about_ca_topic_score_gemma":0.000013639313,"teacher_disagreement_score":0.95870566,"about_ca_system_score_codex":0.00002049961,"about_ca_system_score_gemma":0.000007815552,"threshold_uncertainty_score":0.2002601},"labels":[],"label_agreement":null},{"id":"W2108523040","doi":"10.1109/icpads.2000.857695","title":"Efficient query result retrieval over the Web","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Web query classification; Web search query; Database; Interface (matter); Web server; Query optimization; Set (abstract data type); Application server; Information retrieval; Operating system; The Internet; Search engine; Programming language","score_opus":0.02038459448792331,"score_gpt":0.22420434647119358,"score_spread":0.20381975198327026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108523040","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.055115536,0.00047722235,0.34095705,0.02804447,0.0028066582,0.0006152731,0.000015388148,0.0010505352,0.57091784],"genre_scores_gemma":[0.89099175,0.00009380488,0.017262956,0.0053158915,0.00038178454,0.0000055886753,0.0000042562538,0.000013466173,0.085930504],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991119,0.00002937433,0.00011583806,0.00023858648,0.0003068445,0.00019744113],"domain_scores_gemma":[0.9991506,0.000053649193,0.000030048135,0.0007105227,0.00001886726,0.00003631524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030497718,0.00007246948,0.000054401342,0.00004392339,0.00011497759,0.00028108127,0.0010465744,0.000017963212,0.00031643733],"category_scores_gemma":[0.000028923097,0.000041908912,0.000037549904,0.00041628108,0.000026571213,0.0001657193,0.0004812159,0.00007541471,0.0007356429],"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.000003979482,0.00014862037,0.00009905295,0.000005543874,0.000023285433,0.000034137905,0.00035810922,0.0003359635,0.00012402923,0.2542388,0.69747335,0.047155105],"study_design_scores_gemma":[0.00018664445,0.00001770313,0.0009123327,0.0000028279014,0.0000024193555,0.0000016340688,0.000012902606,0.8350649,0.00007776374,0.00017582694,0.16346042,0.00008463617],"about_ca_topic_score_codex":0.000009228855,"about_ca_topic_score_gemma":0.0000025182342,"teacher_disagreement_score":0.8358762,"about_ca_system_score_codex":0.000012774946,"about_ca_system_score_gemma":0.000004728508,"threshold_uncertainty_score":0.94554466},"labels":[],"label_agreement":null},{"id":"W2109010760","doi":"10.1109/ssdbm.2006.6","title":"A Disc-based Approach to Data Summarization and Privacy Preservation","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Automatic summarization; Computer science; Data mining; Heuristic; Constraint (computer-aided design); Set (abstract data type); Cluster analysis; Exploit; Algorithm; Theoretical computer science; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.04332015707856461,"score_gpt":0.24894069578372094,"score_spread":0.20562053870515634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109010760","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.00055259,0.0000062573054,0.98088133,0.0016483254,0.00003486184,0.00019898689,0.000009127153,0.00010614456,0.016562376],"genre_scores_gemma":[0.14976226,0.0000013879791,0.8444806,0.0005667775,0.00007774614,0.000015907757,0.0015432137,0.0000057468565,0.003546372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930865,0.0000149744155,0.00009098386,0.00033807606,0.0001475267,0.000099769444],"domain_scores_gemma":[0.9990782,0.000013640676,0.000022488426,0.0008416662,0.000017006141,0.000026978734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017299225,0.00005535018,0.000044999735,0.000062784566,0.000052089832,0.0003851728,0.0009880011,0.000012064935,0.0000030147319],"category_scores_gemma":[0.000018429022,0.000046084107,0.0000045600354,0.0003013535,0.000007664968,0.0020520228,0.0010524361,0.000018636218,0.000008090654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057931834,0.0003747937,0.009758122,0.00006388106,0.000010482071,0.000001631006,0.000089539906,0.0014340961,0.00019697187,0.69393754,0.18477988,0.10934724],"study_design_scores_gemma":[0.00014721527,0.000010257364,0.013583125,0.0000025375177,0.0000024272001,1.2172784e-7,0.0000024216836,0.94680905,0.000059857626,0.0014513413,0.03785469,0.000076936754],"about_ca_topic_score_codex":0.00016050405,"about_ca_topic_score_gemma":0.000013842249,"teacher_disagreement_score":0.94537497,"about_ca_system_score_codex":0.000005335983,"about_ca_system_score_gemma":0.000009194292,"threshold_uncertainty_score":0.371423},"labels":[],"label_agreement":null},{"id":"W2109416465","doi":"","title":"A Combinatorial Approach to Nearly Uncoupled Markov Chains","year":2011,"lang":"en","type":"dissertation","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Data Management and Algorithms","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":"National University of Ireland; University of Regina","keywords":"Markov chain; Mathematics; Additive Markov chain; Markov chain mixing time; Invariant (physics); Markov property; Combinatorics; Disjoint sets; Markov process; State space; Complement (music); Markov model; Discrete mathematics; Variable-order Markov model; Markov renewal process; Random variable; Statistics","score_opus":0.015594422460048744,"score_gpt":0.23615201266788502,"score_spread":0.22055759020783627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109416465","genre_codex":"other","genre_gemma":"methods","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.16819434,0.0012063432,0.30704963,0.0030565117,0.08402497,0.0073762,0.00030685868,0.0064295474,0.4223556],"genre_scores_gemma":[0.3691354,0.00033908858,0.59101605,0.00045974672,0.0013308089,0.001382882,0.004163564,0.0002603171,0.031912096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965439,0.000023804956,0.00080911384,0.0012978957,0.0006597112,0.0006656018],"domain_scores_gemma":[0.9965144,0.000014860156,0.00060007896,0.002346959,0.0003630762,0.00016062934],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00047683084,0.00060108287,0.00083324005,0.0022267606,0.00022209962,0.00022456264,0.0059858365,0.0009283834,0.000019781522],"category_scores_gemma":[0.00022831936,0.00061434327,0.00021445985,0.002850237,0.00020620455,0.0013897928,0.00095091073,0.0007596904,0.00016728643],"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.000053440228,0.00048519307,0.00004450797,0.00021720571,0.00018546829,0.00003804692,0.00026943334,0.000008454995,0.00023901391,0.93180025,0.010654788,0.0560042],"study_design_scores_gemma":[0.006621053,0.0018243608,0.0012823879,0.0009690975,0.0004767647,0.00003911523,0.0009108501,0.012903639,0.013545447,0.118563436,0.8382816,0.0045822747],"about_ca_topic_score_codex":0.0001973587,"about_ca_topic_score_gemma":0.00010938612,"teacher_disagreement_score":0.82762676,"about_ca_system_score_codex":0.000084838844,"about_ca_system_score_gemma":0.0003043008,"threshold_uncertainty_score":0.9996308},"labels":[],"label_agreement":null},{"id":"W2109557983","doi":"","title":"The Last Descent In Samples Of Geometric Random Variables And Permutations.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"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; Descent (aeronautics); Combinatorics; Statistics; Geography","score_opus":0.013036842164318543,"score_gpt":0.23518992439154165,"score_spread":0.2221530822272231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109557983","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.8540028,0.0013758917,0.1392561,0.0005501886,0.0017855575,0.0004722021,0.0000052843466,0.00007309846,0.0024789195],"genre_scores_gemma":[0.99541277,0.000114062525,0.0043920656,0.000024934776,0.0000034585005,0.000004219411,0.0000025810568,0.0000032428434,0.000042676507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.000035509096,0.00021028309,0.00015788562,0.000180686,0.00018550083],"domain_scores_gemma":[0.9989902,0.0006010576,0.000069027985,0.00026351892,0.000042284075,0.00003393383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012020424,0.00006627878,0.00010227568,0.0002043885,0.000103227634,0.000112009395,0.0004612162,0.000019794328,0.0000015813322],"category_scores_gemma":[0.00016022149,0.00004968144,0.00001767118,0.00096914195,0.00005264064,0.00021312674,0.00023405091,0.000058276873,0.0000028380405],"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.000007590932,0.00006122896,0.015400866,0.000009499886,0.000010970951,0.0000048208303,0.00014977847,0.000009023506,0.000024925435,0.9385003,0.00039408682,0.045426894],"study_design_scores_gemma":[0.004533443,0.00011189492,0.42980963,0.000044248827,0.000015116153,0.0000047870917,0.00029383952,0.0064031836,0.0011088441,0.54813814,0.009283617,0.00025328886],"about_ca_topic_score_codex":0.000055680943,"about_ca_topic_score_gemma":0.0000286762,"teacher_disagreement_score":0.41440874,"about_ca_system_score_codex":0.000018059895,"about_ca_system_score_gemma":0.000015783497,"threshold_uncertainty_score":0.20259503},"labels":[],"label_agreement":null},{"id":"W2110175519","doi":"10.1145/1938551.1938576","title":"(Approximate) uncertain skylines","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Army Research Office; Division of Information and Intelligent Systems; Division of Computer and Network Systems; Division of Computing and Communication Foundations; National Institutes of Health; National Science Foundation","keywords":"Computer science","score_opus":0.061871102603712466,"score_gpt":0.24358545929449738,"score_spread":0.1817143566907849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110175519","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.00035522992,0.000011749195,0.7911912,0.0002182917,0.00019393541,0.000050497216,5.1647464e-7,0.0002500632,0.20772849],"genre_scores_gemma":[0.07489627,0.000015176786,0.9056173,0.0009250324,0.00007561842,0.000012106455,0.0000061777055,0.000006459035,0.018445836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994998,0.0000087399685,0.000078057885,0.00018085535,0.000092069255,0.00014045133],"domain_scores_gemma":[0.9995363,0.000006082678,0.000018180144,0.0003881395,0.00001685093,0.000034459506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011665593,0.000057616777,0.000049518978,0.000044047905,0.000035079258,0.00007474204,0.00079522585,0.000012207583,0.00020130818],"category_scores_gemma":[0.000005034555,0.000042928623,0.000019681172,0.00016904624,0.000014052218,0.00064392475,0.0003160845,0.000023972638,0.00029564754],"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.795195e-7,0.000048465146,0.00039726673,0.0000051521915,0.000007769475,0.000017002922,0.00022939619,5.626831e-7,0.000017717783,0.87802887,0.010968803,0.11027819],"study_design_scores_gemma":[0.0010924538,0.0002432613,0.011273742,0.000024885509,0.000018573186,0.000019740326,0.00032400558,0.54771006,0.012360164,0.21641189,0.20934077,0.0011804415],"about_ca_topic_score_codex":0.000067688925,"about_ca_topic_score_gemma":0.0000042850047,"teacher_disagreement_score":0.66161704,"about_ca_system_score_codex":0.0000035211528,"about_ca_system_score_gemma":0.000005511284,"threshold_uncertainty_score":0.38000494},"labels":[],"label_agreement":null},{"id":"W2110557355","doi":"10.1007/s007780100049","title":"Approximate query processing using wavelets","year":2001,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":477,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Wavelet; Query optimization; Data mining; Tuple; Histogram; Algorithm; Artificial intelligence; Mathematics; Image (mathematics)","score_opus":0.0412518917975479,"score_gpt":0.2701677799750619,"score_spread":0.22891588817751402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110557355","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.034526892,0.00030382822,0.9598022,0.0019527627,0.00040468297,0.000060603674,3.2629828e-7,0.000066857334,0.0028818445],"genre_scores_gemma":[0.72746295,0.00042513822,0.26561847,0.0020181194,0.001999093,0.0000036690133,0.0000019907761,0.000035616744,0.0024349603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907273,0.000052464693,0.00017163588,0.00013422812,0.0002787817,0.00029016254],"domain_scores_gemma":[0.99946654,0.000014413066,0.00013212684,0.0002799736,0.000044994482,0.000061929786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074933516,0.00009056483,0.000084410414,0.00008444262,0.0005128147,0.00094994577,0.0011417409,0.000016997223,0.00002060897],"category_scores_gemma":[0.000012146505,0.00005534851,0.00004212929,0.00034043545,0.000034903576,0.0013174693,0.0002929477,0.00020876944,0.000026417265],"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.0000072674948,0.00006096278,0.00038157747,0.000014147826,0.000030650535,0.00030720618,0.00074300147,0.00045046257,0.0008754768,0.0050790035,0.0022840106,0.98976624],"study_design_scores_gemma":[0.00037533976,0.000029686194,0.00076121127,0.00008624982,0.000019849089,0.0025263412,0.00013601681,0.95633924,0.0002813176,0.014129849,0.025082799,0.00023211472],"about_ca_topic_score_codex":0.0000050491212,"about_ca_topic_score_gemma":5.986842e-7,"teacher_disagreement_score":0.98953414,"about_ca_system_score_codex":0.000028074313,"about_ca_system_score_gemma":0.000042921947,"threshold_uncertainty_score":0.91603494},"labels":[],"label_agreement":null},{"id":"W2110610722","doi":"10.1145/872757.872798","title":"Mapping data in peer-to-peer systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":253,"is_retracted":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; Semantic mapping; Data mapping; Semantics (computer science); Peer-to-peer; Information retrieval; Data sharing; Listing (finance); Data exchange; Theoretical computer science; Data mining; Database; Programming language; World Wide Web","score_opus":0.061956020897478724,"score_gpt":0.28126520072606803,"score_spread":0.2193091798285893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110610722","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.0004324687,0.00003161267,0.90449077,0.00258363,0.00074336067,0.00017006428,0.000007247388,0.000102479244,0.091438375],"genre_scores_gemma":[0.2903966,0.000010088581,0.48983437,0.0023004403,0.00018528978,0.000032925534,0.00016355302,0.000021217367,0.21705551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987854,0.000037389356,0.00015187243,0.0003993561,0.00040302862,0.00022298643],"domain_scores_gemma":[0.99844587,0.000022785956,0.000020246429,0.0014098276,0.00004461053,0.00005664132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207493,0.00007282377,0.00008860135,0.00015468504,0.000031742053,0.0004332499,0.0019782248,0.000016711007,0.000023141522],"category_scores_gemma":[0.0001228354,0.00006341123,0.000008211057,0.000588191,0.0000053270824,0.0010804625,0.0009203865,0.00005244734,0.0004450813],"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":[5.0254334e-7,0.000075214695,0.0025817668,0.00003368857,0.000016314649,0.00007122175,0.0004225404,0.0001918114,0.00003757754,0.57628673,0.38713455,0.03314806],"study_design_scores_gemma":[0.00014257766,0.0000075447774,0.0008403894,0.000014914237,6.498743e-7,0.0000028546597,0.00019443712,0.11433963,0.000016331747,0.00026333964,0.8840454,0.0001318947],"about_ca_topic_score_codex":0.00013903556,"about_ca_topic_score_gemma":0.000022689026,"teacher_disagreement_score":0.5760234,"about_ca_system_score_codex":0.000015867297,"about_ca_system_score_gemma":0.000015299636,"threshold_uncertainty_score":0.5720768},"labels":[],"label_agreement":null},{"id":"W2111811740","doi":"10.14778/2021017.2021018","title":"On pruning for top-k ranking in uncertain databases","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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; University of Alberta","funders":"","keywords":"Tuple; Pruning; Ranking (information retrieval); Rank (graph theory); Computer science; Parameterized complexity; Key (lock); Range (aeronautics); Learning to rank; Semantics (computer science); Function (biology); Computation; Ranking SVM; Task (project management); Database; Information retrieval; Artificial intelligence; Data mining; Mathematics; Algorithm; Programming language; Combinatorics; Discrete mathematics","score_opus":0.06770205945613778,"score_gpt":0.2641757924783974,"score_spread":0.19647373302225962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111811740","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.5855262,0.0004917268,0.2196287,0.006164803,0.003724011,0.008997007,0.000102482096,0.00069133873,0.17467369],"genre_scores_gemma":[0.9029351,0.000017123459,0.09624768,0.00031629106,0.00004031037,0.00012170543,0.0000025473178,0.000009812964,0.00030945096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910134,0.000003690255,0.00019013612,0.00026645095,0.00021585003,0.00022250396],"domain_scores_gemma":[0.99956614,0.00004259152,0.00013299464,0.00019210031,0.000042672065,0.000023520075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046120695,0.00010154695,0.00011642532,0.00011216949,0.00006827272,0.000051321094,0.0011641684,0.000012473918,0.000006410129],"category_scores_gemma":[0.00008515493,0.00007079518,0.00004917399,0.00027331762,0.000024096236,0.00054283784,0.0005742624,0.000062910134,0.0000025458744],"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.000039508643,0.00020284436,0.0035784345,0.00013611406,0.000025965739,9.805547e-7,0.0017832603,0.000016704684,0.001867234,0.9585668,0.0027103147,0.03107188],"study_design_scores_gemma":[0.007208598,0.0011256022,0.015615649,0.002439603,0.000102068974,0.000010733275,0.002016525,0.07961056,0.60919136,0.24790746,0.033355225,0.0014166267],"about_ca_topic_score_codex":0.00008427108,"about_ca_topic_score_gemma":0.000003715605,"teacher_disagreement_score":0.71065927,"about_ca_system_score_codex":0.00003373865,"about_ca_system_score_gemma":0.000009701494,"threshold_uncertainty_score":0.28869435},"labels":[],"label_agreement":null},{"id":"W2111838425","doi":"10.1007/11504894_87","title":"The Coordination of Parallel Search with Common Components","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science","score_opus":0.021478151606717767,"score_gpt":0.2510388984967862,"score_spread":0.22956074689006842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111838425","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.00010808893,0.00022718997,0.993011,0.0019869462,0.00044121375,0.00039461168,0.0000048128463,0.00006160103,0.00376452],"genre_scores_gemma":[0.30360553,0.00019277539,0.6920963,0.00082994753,0.0004819618,0.000015708732,0.00003805451,0.000048493628,0.002691221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702466,0.00003928351,0.00039814872,0.0008057535,0.001256831,0.00047535193],"domain_scores_gemma":[0.9976863,0.0004010881,0.0002563933,0.0013655213,0.00020813517,0.000082516024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010359837,0.00031922586,0.00034306818,0.0004066323,0.00034033306,0.0005481455,0.0044932733,0.00010336435,0.000005421785],"category_scores_gemma":[0.000013542294,0.00021119865,0.00006230515,0.000515614,0.0008875633,0.0007173518,0.0016093082,0.00048191604,0.000020719823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010397842,0.000031915657,0.00010023329,0.000021133643,0.000017833547,0.000021639458,0.00019852987,0.018907135,0.000026285947,0.062687375,0.000054911638,0.9179226],"study_design_scores_gemma":[0.0005296227,0.00028912062,0.0009803822,0.00030673124,0.000010565142,0.000022988086,3.6712893e-7,0.95462894,0.00041948433,0.033527493,0.008773344,0.0005109653],"about_ca_topic_score_codex":0.000036146717,"about_ca_topic_score_gemma":0.00012800777,"teacher_disagreement_score":0.9357218,"about_ca_system_score_codex":0.00012453533,"about_ca_system_score_gemma":0.00015157925,"threshold_uncertainty_score":0.8612431},"labels":[],"label_agreement":null},{"id":"W2111878549","doi":"10.1109/aiccsa.2005.1387094","title":"A user modeling approach to improving estimation accuracy in location-tracking applications","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University; University of Guelph","funders":"","keywords":"Computer science; Focus (optics); Estimation; Creatures; Location tracking; Trajectory; Point (geometry); Real-time computing; Object (grammar); Sampling (signal processing); Tracking (education); Variance (accounting); Tracking system; Data mining; Artificial intelligence; Computer vision; Kalman filter","score_opus":0.027350263711973098,"score_gpt":0.2779662463896305,"score_spread":0.25061598267765745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111878549","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.00059439347,0.000021834045,0.9937627,0.00080173527,0.000021550499,0.00043653138,4.2911557e-7,0.00016186647,0.0041989833],"genre_scores_gemma":[0.43072408,0.0000010995051,0.5685597,0.0003926219,0.000040296156,0.00012087854,0.000010504478,0.0000038384937,0.00014699742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991032,0.000010937501,0.00021072644,0.0003389706,0.00015540063,0.00018080082],"domain_scores_gemma":[0.99938357,0.000027962617,0.000037468606,0.00044851215,0.000055181754,0.000047312373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027222626,0.00008079167,0.000066560184,0.00019308794,0.000080925354,0.0003809521,0.0006745645,0.0000212403,0.000003826231],"category_scores_gemma":[0.00004024279,0.00007989383,0.0000140641105,0.0007507803,0.0000041029925,0.002403016,0.0002578688,0.00006361158,0.00011516461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.6156445e-7,0.000049963153,0.000018426943,0.00000927738,0.0000012528421,6.743932e-8,0.0001651852,0.4474166,0.000030361587,0.062472172,0.00007155335,0.48976487],"study_design_scores_gemma":[0.000092237,0.0000030451836,0.00012399264,0.000006861517,0.0000015962191,6.177892e-7,0.000044360047,0.99771917,0.00007124291,0.0005719731,0.0012563895,0.0001085155],"about_ca_topic_score_codex":0.000079568585,"about_ca_topic_score_gemma":0.000020772686,"teacher_disagreement_score":0.55030257,"about_ca_system_score_codex":0.000054849577,"about_ca_system_score_gemma":0.000024240784,"threshold_uncertainty_score":0.367353},"labels":[],"label_agreement":null},{"id":"W2112007194","doi":"10.14778/2536274.2536316","title":"IPS","year":2013,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Flexibility (engineering); Computer science; Set (abstract data type); Task (project management); Point of interest; Human–computer interaction; Engineering; Artificial intelligence; Systems engineering","score_opus":0.0070832293950941465,"score_gpt":0.17799929477527485,"score_spread":0.1709160653801807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112007194","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.39629704,0.00042943875,0.01863995,0.049979694,0.0034205546,0.00440059,0.000010426834,0.000916278,0.525906],"genre_scores_gemma":[0.9697813,0.00001704115,0.025442172,0.0005109809,0.00006896787,0.00007987505,4.212059e-7,0.0000068635077,0.0040924097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992115,0.0000019021767,0.0001441847,0.00018626753,0.00027646398,0.00017967992],"domain_scores_gemma":[0.9995749,0.000008638027,0.00010589987,0.00018909613,0.00008413563,0.000037310016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014305618,0.00008152065,0.000082949744,0.000044452212,0.000064651,0.00018462469,0.0016311149,0.00001426695,0.000038168386],"category_scores_gemma":[0.000019537052,0.000050572533,0.000053258893,0.0002481553,0.000031035666,0.000868447,0.0010137294,0.000054949105,0.00011418137],"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.0000018637287,0.00018353692,0.004513051,0.0000955266,0.0000662785,3.3842505e-7,0.00073989964,0.0000029612943,0.02246786,0.6650356,0.17672917,0.13016388],"study_design_scores_gemma":[0.0020976362,0.0003560065,0.070116386,0.00026939804,0.00007016772,0.000021762815,0.00086927006,0.028000873,0.46087056,0.25414503,0.18210751,0.0010753991],"about_ca_topic_score_codex":0.00003507383,"about_ca_topic_score_gemma":1.9688375e-7,"teacher_disagreement_score":0.57348424,"about_ca_system_score_codex":0.000017925096,"about_ca_system_score_gemma":0.0000053842614,"threshold_uncertainty_score":0.30310443},"labels":[],"label_agreement":null},{"id":"W2112064847","doi":"","title":"Indexing mixed types for approximate retrieval","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Trie; Edit distance; Categorical variable; String (physics); Data mining; Access method; Inverted index; Data structure; Theoretical computer science; Information retrieval; Algorithm; Mathematics; Database; Machine learning","score_opus":0.022312491443381526,"score_gpt":0.254048192522594,"score_spread":0.23173570107921246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112064847","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.0005766907,0.000024423738,0.981966,0.0020648772,0.00021629383,0.00013803234,0.0000021272995,0.00019451884,0.01481699],"genre_scores_gemma":[0.079182185,0.00000795792,0.9029281,0.00089085574,0.00032845998,0.000009932443,0.000018416296,0.0000090605745,0.016625026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941486,0.0000060221796,0.00009074294,0.00019262977,0.00010527816,0.00019048301],"domain_scores_gemma":[0.99963117,0.00002648225,0.000024695095,0.0002616172,0.000022426104,0.000033605596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024635385,0.000057495025,0.000060069688,0.00004851508,0.000060765135,0.00018143465,0.00053291477,0.000017796663,0.000025040057],"category_scores_gemma":[0.000019518626,0.000047615253,0.000027590528,0.00015073243,0.000008890927,0.0007134874,0.00021365637,0.000027524602,0.0000634889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067843735,0.000039728922,0.00002903063,0.000015317037,0.000017648174,0.0000011824565,0.00007593766,0.000047273512,0.00011769409,0.6507272,0.02653242,0.32238978],"study_design_scores_gemma":[0.00040748634,0.000038316586,0.0001555756,0.0000047909393,0.000004720344,0.0000011007199,0.00001308052,0.66430146,0.005728474,0.0051826825,0.3240005,0.00016180536],"about_ca_topic_score_codex":0.0000015493297,"about_ca_topic_score_gemma":0.0000033089177,"teacher_disagreement_score":0.6642542,"about_ca_system_score_codex":0.000011562675,"about_ca_system_score_gemma":0.000008606159,"threshold_uncertainty_score":0.19416936},"labels":[],"label_agreement":null},{"id":"W2112268371","doi":"10.1109/aina.2009.82","title":"Network Voronoi Diagram Based Range Search","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Voronoi diagram; Computer science; Range (aeronautics); Weighted Voronoi diagram; Euclidean distance; Spatial network; Data mining; Diagram; Computational geometry; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Database","score_opus":0.022307822049841636,"score_gpt":0.2482409210875101,"score_spread":0.22593309903766848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112268371","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.00022435156,0.00004056107,0.9559797,0.0055180634,0.00018534731,0.00011627224,5.721969e-7,0.0002641026,0.037671003],"genre_scores_gemma":[0.5691878,0.000018230494,0.40562025,0.014637662,0.0007382905,0.000010107857,0.000025370151,0.00000876504,0.009753498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999112,0.000032034124,0.0000903095,0.00024725893,0.00021008468,0.0003083263],"domain_scores_gemma":[0.9993577,0.00002820081,0.000013564066,0.00051438436,0.000019030795,0.000067135465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031900595,0.00007753327,0.00007620897,0.00004306535,0.000078613535,0.00026854355,0.0008802972,0.000019352397,0.000098170494],"category_scores_gemma":[0.000004540766,0.00006343843,0.000033325057,0.00036398013,0.000011774028,0.0005118309,0.00013828621,0.00006114262,0.00027912884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002157779,0.000063071406,0.00051732396,0.0000025806535,0.0000038165836,0.0000135032205,0.000019856881,0.000557912,0.000005044048,0.14427303,0.10359057,0.7509511],"study_design_scores_gemma":[0.00053528155,0.0001616663,0.022519685,0.000008698488,0.000003996776,4.0143348e-7,0.0000038066871,0.911124,0.000110486515,0.0056974245,0.05958183,0.00025271077],"about_ca_topic_score_codex":0.000017181772,"about_ca_topic_score_gemma":0.00000404324,"teacher_disagreement_score":0.9105661,"about_ca_system_score_codex":0.0000104630335,"about_ca_system_score_gemma":0.000013883922,"threshold_uncertainty_score":0.35877296},"labels":[],"label_agreement":null},{"id":"W2112729204","doi":"10.1007/s00236-008-0069-0","title":"Weighted height of random trees","year":2008,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Data Management and Algorithms","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":"Mathematics; Weight-balanced tree; Combinatorics; Binary search tree; Theory of computation; Extension (predicate logic); Tree (set theory); Set (abstract data type); Random binary tree; Binary logarithm; Discrete mathematics; Ternary search tree; Constant (computer programming); Binary tree; Algorithm; Tree structure; Computer science; Interval tree","score_opus":0.012954597852491713,"score_gpt":0.20640523636354366,"score_spread":0.19345063851105196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112729204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05508727,0.00008651767,0.63630253,0.0022772327,0.0005801659,0.0005414004,0.000017949795,0.0004240253,0.30468288],"genre_scores_gemma":[0.9117178,0.00012854833,0.086613156,0.00044591594,0.000036884776,0.000010032095,0.000023558463,0.000004681769,0.0010194541],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991951,0.00001207002,0.0003028599,0.00007841755,0.00024764816,0.00016388866],"domain_scores_gemma":[0.9992496,0.000060727896,0.00011042288,0.00049614004,0.000035664936,0.00004744183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013185211,0.000083747036,0.00015480387,0.00010593508,0.000076291944,0.000045226305,0.00088346214,0.000023055212,0.000058682333],"category_scores_gemma":[0.000022768005,0.00006331052,0.00005015631,0.00027442916,0.00005378665,0.0020734812,0.00027708858,0.000050653493,0.00014002265],"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.00009744929,0.00050085154,0.0015085154,0.00030390965,0.00038007557,0.00008173556,0.014544386,0.000020224155,0.00037679443,0.2512127,0.4203132,0.31066015],"study_design_scores_gemma":[0.0054580793,0.00026117696,0.009328156,0.00007638707,0.000029239087,0.00006900748,0.00014588475,0.371096,0.0062221442,0.0030481413,0.6036345,0.0006313222],"about_ca_topic_score_codex":0.00000654346,"about_ca_topic_score_gemma":7.721592e-7,"teacher_disagreement_score":0.8566305,"about_ca_system_score_codex":0.000005930881,"about_ca_system_score_gemma":0.000021309292,"threshold_uncertainty_score":0.2581728},"labels":[],"label_agreement":null},{"id":"W2113284000","doi":"10.1109/icci.1993.315397","title":"Analysis of windowing operations on R/sup +/ trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Object (grammar); Tree (set theory); Computer science; Domain (mathematical analysis); Combinatorics; Theoretical computer science; Discrete mathematics; Data mining; Mathematics; Artificial intelligence","score_opus":0.030251858218655878,"score_gpt":0.24305257663812696,"score_spread":0.21280071841947107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113284000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018195266,0.000024601986,0.9029989,0.0014272827,0.000072805706,0.00007505407,0.0000060999655,0.00011018343,0.077089764],"genre_scores_gemma":[0.9678306,0.000011859562,0.024885751,0.0003517914,0.000015374118,0.000002460838,0.000007911609,0.0000016021264,0.006892632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995381,0.000011952957,0.00009877764,0.00014456501,0.000131656,0.00007494177],"domain_scores_gemma":[0.9995676,0.000020199577,0.000011694003,0.00036581862,0.00001492232,0.00001971801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006739479,0.00004185523,0.000085519685,0.0002545831,0.000045197175,0.000093505354,0.00041606033,0.000008428254,0.00035048462],"category_scores_gemma":[0.000007654452,0.00003322914,0.000057108566,0.0009475471,0.00000866187,0.0004459408,0.00009424386,0.000019792116,0.0000688912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.67823e-7,0.00041385516,0.003536407,0.0000044341596,0.001098154,0.000011061072,0.001130573,0.110192835,0.00029775465,0.4500605,0.010311684,0.4229419],"study_design_scores_gemma":[0.000062555446,0.000021378148,0.003251616,0.0000017946513,0.000047453726,4.5820634e-8,0.000018041288,0.9948295,0.00027232233,0.000023838347,0.0014248505,0.000046606176],"about_ca_topic_score_codex":0.0000308851,"about_ca_topic_score_gemma":0.000029773175,"teacher_disagreement_score":0.9496353,"about_ca_system_score_codex":0.0000043792556,"about_ca_system_score_gemma":0.000001204543,"threshold_uncertainty_score":0.3837561},"labels":[],"label_agreement":null},{"id":"W2114278236","doi":"10.1109/cvpr.1993.341021","title":"Efficient serial associative memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Information Technology Research Centre","keywords":"Computer science; Pruning; Set (abstract data type); Curse of dimensionality; Probabilistic logic; Result set; Tree (set theory); Feature vector; Data mining; Computation; Feature (linguistics); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.019253451064887125,"score_gpt":0.21592706978416104,"score_spread":0.1966736187192739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114278236","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.007573844,0.000039635608,0.50295717,0.0026024652,0.0014964724,0.000174752,0.0000042799647,0.0004535495,0.48469782],"genre_scores_gemma":[0.5811499,0.000021030348,0.21096937,0.0036613494,0.00085470587,0.00002836811,0.000010005549,0.000019759651,0.20328556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936473,0.000020999827,0.00007712022,0.00018923898,0.00018792861,0.00015999548],"domain_scores_gemma":[0.99963707,0.000022649041,0.000029192011,0.0002569129,0.000018562187,0.000035610432],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001341917,0.000057426383,0.000060177026,0.000038146776,0.0000629567,0.00014608835,0.00053074764,0.000015649568,0.00041999487],"category_scores_gemma":[0.00001534126,0.000047405054,0.000027556425,0.0001965249,0.000011073122,0.00017123081,0.0002981466,0.000036863847,0.0010632508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016614596,0.0004042209,0.00011222791,0.000007484875,0.00006917256,0.00004926386,0.0020544447,0.00072775164,0.00012084532,0.22658902,0.32277435,0.44708955],"study_design_scores_gemma":[0.00034032084,0.000031788742,0.0005351172,0.0000021926633,0.0000030585936,6.8860527e-7,0.000046932968,0.9854204,0.00032673788,0.00040638665,0.01274461,0.0001417554],"about_ca_topic_score_codex":0.000008484179,"about_ca_topic_score_gemma":0.0000016571014,"teacher_disagreement_score":0.98469263,"about_ca_system_score_codex":0.000020407582,"about_ca_system_score_gemma":0.0000022951326,"threshold_uncertainty_score":0.99971455},"labels":[],"label_agreement":null},{"id":"W2114454762","doi":"","title":"Social Network Opinion and Posts Mining for Community Preference Discovery","year":2013,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Data Management and Algorithms","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","keywords":"Preference; Data science; Computer science; World Wide Web; Internet privacy; Public relations; Business; Political science; Economics","score_opus":0.05535008070530805,"score_gpt":0.2448965180359668,"score_spread":0.18954643733065873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114454762","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.9648644,0.00007380268,0.031676497,0.0014529538,0.00023816983,0.00046503497,0.000037927628,0.00009225168,0.0010990147],"genre_scores_gemma":[0.97135395,0.000024415764,0.02645661,0.00014675886,0.00010395159,0.0000019418069,0.00007548192,0.0000108735585,0.0018260457],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99867123,0.00021493726,0.0001402623,0.00034246294,0.0002512812,0.00037983086],"domain_scores_gemma":[0.9989159,0.00019786735,0.00018200674,0.00048242463,0.000116404575,0.00010536049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006973715,0.00016827443,0.00024037863,0.00011455727,0.001290787,0.000293961,0.0014470862,0.00011455066,0.000021350796],"category_scores_gemma":[0.000042121595,0.00020037366,0.00009465214,0.0003008347,0.00016246534,0.0048448914,0.0016948774,0.00027782944,0.000022913857],"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.00064392644,0.0011566826,0.44109774,0.0013486543,0.0009433942,0.00002507771,0.03693636,0.00012707055,0.0058751847,0.13996668,0.067216665,0.30466256],"study_design_scores_gemma":[0.0019908738,0.00032591936,0.9707755,0.00013567934,0.00004567956,0.000005116032,0.001997562,0.0034801324,0.00014591526,0.014371597,0.006144185,0.00058187067],"about_ca_topic_score_codex":0.00015650106,"about_ca_topic_score_gemma":0.00008357662,"teacher_disagreement_score":0.52967775,"about_ca_system_score_codex":0.00004388456,"about_ca_system_score_gemma":0.000031347437,"threshold_uncertainty_score":0.99278206},"labels":[],"label_agreement":null},{"id":"W2114523181","doi":"","title":"Effective sampling and learning for mallows models with pairwise-preference data","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":59,"is_retracted":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":"Pairwise comparison; Ranking (information retrieval); Inference; Sampling (signal processing); Machine learning; Computer science; Artificial intelligence; Preference learning; Preference; Parametric statistics; Data mining; Mathematics; Statistics","score_opus":0.0924687703155178,"score_gpt":0.266705355704623,"score_spread":0.1742365853891052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114523181","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.0019182824,0.000012864278,0.99407774,0.00020244291,0.00004021295,0.00027771722,0.0000031327024,0.0001508144,0.0033168036],"genre_scores_gemma":[0.3165203,0.000005920725,0.68243307,0.00014920245,0.000054698678,0.000030819978,0.000045796354,0.000007459466,0.0007527395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912804,0.00004240458,0.00007110174,0.00047247298,0.00011022195,0.00017576583],"domain_scores_gemma":[0.9990131,0.0002702254,0.000034925393,0.00060803327,0.00002875034,0.000044968245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059946347,0.000091968526,0.00010063242,0.000040073483,0.00014288945,0.00028628742,0.00088003185,0.00001681624,0.0000018894373],"category_scores_gemma":[0.00004902792,0.00006659286,0.000008347508,0.00008808096,0.000021232507,0.0015417931,0.0008938325,0.0000766798,0.000004336605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013715778,0.000021688435,0.00064803177,0.000056150602,0.00003434989,6.877817e-7,0.00016724404,0.003948172,0.000031571755,0.18122284,0.00053536653,0.81332016],"study_design_scores_gemma":[0.00032856755,0.00014974744,0.0007407886,0.000019524137,0.000008299543,9.472358e-7,0.000019221801,0.98412514,0.000020310703,0.0055987923,0.0088657,0.00012293606],"about_ca_topic_score_codex":0.000034093653,"about_ca_topic_score_gemma":0.000015101288,"teacher_disagreement_score":0.980177,"about_ca_system_score_codex":0.00000465963,"about_ca_system_score_gemma":0.0000062971594,"threshold_uncertainty_score":0.27606764},"labels":[],"label_agreement":null},{"id":"W2115425457","doi":"10.1109/aina.2003.1192959","title":"An ontology-based method for querying the Web data","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"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":"Hong Kong University of Science and Technology; University of Toronto","keywords":"Computer science; Information retrieval; Search engine; Ontology; World Wide Web; Web search query; The Internet; Web search engine; Web query classification","score_opus":0.08787829871693748,"score_gpt":0.36697855642997357,"score_spread":0.2791002577130361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115425457","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.000020949852,0.000020028767,0.989892,0.002726786,0.00024596314,0.00018493188,0.000013521637,0.00011104069,0.00678477],"genre_scores_gemma":[0.004265803,0.0000015061952,0.9921366,0.0029226684,0.00003004913,0.000015708258,0.000045914465,0.0000039128035,0.0005778336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.00011083123,0.000093014365,0.00035525826,0.00009370355,0.00018103776],"domain_scores_gemma":[0.99792707,0.00018332344,0.0000307925,0.0018072726,0.000019663557,0.00003190079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013667935,0.00006646102,0.000069282236,0.000034692483,0.00013617371,0.00023821744,0.0024940686,0.000017881777,0.000024594025],"category_scores_gemma":[0.00006373613,0.000041010288,0.000018989138,0.00014916882,0.000015877386,0.0008274557,0.00019990467,0.000039968145,0.000013895125],"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.0000015750077,0.0000516275,0.00009019436,0.000006739508,0.000014204076,0.0000020911384,0.000029916377,0.00006015995,0.000139353,0.8074213,0.031465285,0.16071752],"study_design_scores_gemma":[0.00017882395,0.000023558961,0.000026208609,0.0000010505021,0.000005386626,8.408149e-7,0.000022781118,0.7272858,0.00028734969,0.0031655275,0.2689405,0.00006218925],"about_ca_topic_score_codex":0.000028386463,"about_ca_topic_score_gemma":0.00010425092,"teacher_disagreement_score":0.80425584,"about_ca_system_score_codex":0.0000051116353,"about_ca_system_score_gemma":0.000044643148,"threshold_uncertainty_score":0.46346417},"labels":[],"label_agreement":null},{"id":"W2115687261","doi":"10.1109/icde.2011.5767929","title":"Jackpine: A benchmark to evaluate spatial database performance","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":70,"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; Database; Spatial database; Geocoding; Benchmark (surveying); Spatial analysis; Data mining; Search engine indexing; Relational database management system; Relational database; Information retrieval","score_opus":0.04291799912277831,"score_gpt":0.2519456535039992,"score_spread":0.20902765438122092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115687261","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.017186753,0.000007850063,0.87448317,0.00029998663,0.0005674588,0.00022180084,0.0000082700835,0.00018061903,0.10704406],"genre_scores_gemma":[0.46883342,0.000026334246,0.5223578,0.0020383822,0.00016599402,0.000041268297,0.00004691221,0.000010914034,0.0064789313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989472,0.000019142919,0.00013986761,0.00035981528,0.00027199867,0.00026199222],"domain_scores_gemma":[0.9989634,0.000008208297,0.000027983273,0.00084293773,0.00004152835,0.00011592832],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036340725,0.000106840016,0.00008356263,0.00010285336,0.00007342288,0.00010124124,0.0012661283,0.00001351405,0.00076258206],"category_scores_gemma":[0.000015721193,0.00008715332,0.000022974846,0.00031221277,0.000013978369,0.0012612675,0.0010509648,0.000051618597,0.0015639347],"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.000020913583,0.00016954978,0.0024607466,0.000032521144,0.000029775529,0.000035960864,0.0007380522,0.000010837025,0.00021189591,0.039221343,0.06341744,0.89365095],"study_design_scores_gemma":[0.0012385922,0.00074847776,0.08891078,0.00006576395,0.000030145398,0.000011955747,0.000046812493,0.76213276,0.010804921,0.0010495211,0.13390552,0.0010547398],"about_ca_topic_score_codex":0.00023347189,"about_ca_topic_score_gemma":0.000032839027,"teacher_disagreement_score":0.89259624,"about_ca_system_score_codex":0.00001080471,"about_ca_system_score_gemma":0.000019826786,"threshold_uncertainty_score":0.99921346},"labels":[],"label_agreement":null},{"id":"W2116138848","doi":"10.1109/cit.2010.130","title":"Two Novel Semantics of Top-k Queries Processing in Uncertain Database","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"St. Francis Xavier University","funders":"","keywords":"Tuple; Semantics (computer science); Computer science; Ranking (information retrieval); Database; Rank (graph theory); Information retrieval; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Programming language","score_opus":0.02265649673199035,"score_gpt":0.28789280062074507,"score_spread":0.26523630388875474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116138848","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.034034677,0.000010069588,0.9565854,0.0008886593,0.00022487919,0.00009786103,0.0000068553854,0.000067311295,0.008084285],"genre_scores_gemma":[0.3626968,0.000002846017,0.6364762,0.00015925425,0.000028982224,0.0000030126544,0.000010210796,0.000003719396,0.00061894197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993603,0.0000057199977,0.00014948484,0.00019603387,0.00014705601,0.0001413731],"domain_scores_gemma":[0.99947155,0.000014688342,0.000049015347,0.000413109,0.000025497742,0.000026145914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025392562,0.000067116314,0.00008687256,0.00007914297,0.000025842884,0.00009811823,0.0006320583,0.000014935923,0.000032327094],"category_scores_gemma":[0.000031230415,0.00005643679,0.000012385256,0.00035502642,0.00004332505,0.0010864651,0.00053840625,0.00009152336,0.000008706689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005184075,0.00036311173,0.014781485,0.00016274276,0.0000066335215,0.000030363435,0.00071336894,0.00010169756,0.042296004,0.7079872,0.0018415769,0.23171066],"study_design_scores_gemma":[0.0012795994,0.00004636759,0.006372181,0.00008309642,0.000008559179,0.000008828735,0.00026676018,0.9432632,0.02306142,0.0038005344,0.021343239,0.0004662518],"about_ca_topic_score_codex":0.0003209882,"about_ca_topic_score_gemma":0.00051248854,"teacher_disagreement_score":0.9431615,"about_ca_system_score_codex":0.000003719214,"about_ca_system_score_gemma":0.000028699726,"threshold_uncertainty_score":0.23014255},"labels":[],"label_agreement":null},{"id":"W2116595874","doi":"10.1007/11562214_25","title":"Document Clustering with Grouping and Chaining Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Chaining; Cluster analysis; Document clustering; Event (particle physics); Backward chaining; Set (abstract data type); Data mining; Algorithm; Canopy clustering algorithm; Correlation clustering; Artificial intelligence; Information retrieval; Expert system; Programming language","score_opus":0.014362959641179852,"score_gpt":0.2329629422753225,"score_spread":0.21859998263414265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116595874","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.000023396857,0.0004371742,0.9938803,0.00087398756,0.0006946469,0.00033564883,0.000002120109,0.00018293931,0.0035698367],"genre_scores_gemma":[0.0155338915,0.00014230455,0.98153615,0.0013274495,0.00070539064,0.000010622472,0.0000067628503,0.00003873513,0.00069871184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963898,0.000016958033,0.00038384984,0.0016228679,0.0008894163,0.0006971139],"domain_scores_gemma":[0.99831176,0.00015050507,0.00022650477,0.0010593006,0.000081029466,0.00017092575],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082036736,0.0005277054,0.000440234,0.000731676,0.0003034762,0.0013719262,0.0023467008,0.00013612174,0.000011366881],"category_scores_gemma":[0.00001327633,0.00044551745,0.0000489301,0.00042399345,0.0004419752,0.0016315569,0.0029470255,0.0005501746,0.000014830172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024628855,0.0000071839686,0.000015833051,0.000029600295,0.0000131619245,0.00010674267,0.00047302546,0.010813717,0.000006568534,0.007780329,0.000004682396,0.9807467],"study_design_scores_gemma":[0.00046075057,0.0002358714,0.00009308775,0.0006970664,0.000012214043,0.00012943229,5.469434e-7,0.9762155,0.00009581735,0.016816292,0.004375483,0.00086794846],"about_ca_topic_score_codex":0.00001991405,"about_ca_topic_score_gemma":0.000079202786,"teacher_disagreement_score":0.9798787,"about_ca_system_score_codex":0.00018881756,"about_ca_system_score_gemma":0.000118721466,"threshold_uncertainty_score":0.99979967},"labels":[],"label_agreement":null},{"id":"W2117379916","doi":"10.1109/icde.2005.92","title":"Monitoring k-Nearest Neighbor Queries over Moving Objects","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":307,"is_retracted":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":"Search engine indexing; Computer science; Scalability; k-nearest neighbors algorithm; Grid; Data mining; Tree (set theory); Best bin first; Nearest neighbor search; R-tree; Object (grammar); Spatial database; Artificial intelligence; Spatial analysis; Database; Mathematics","score_opus":0.013368878396575917,"score_gpt":0.2457943660586419,"score_spread":0.232425487662066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117379916","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.06814007,0.0003470975,0.7357662,0.002599268,0.0022410988,0.0002806033,0.0000023198124,0.0014910884,0.1891323],"genre_scores_gemma":[0.8051842,0.000040323772,0.18472509,0.0003425222,0.00068111444,0.000008043694,0.0000015460747,0.000009283793,0.009007884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916047,0.000011310199,0.00011497709,0.00026017957,0.00020848449,0.00024455224],"domain_scores_gemma":[0.9994337,0.00002825843,0.00003001871,0.00043189188,0.000018543527,0.00005760579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010772513,0.00009752669,0.000076810764,0.000068427435,0.0001057309,0.00047743908,0.0006724987,0.000020867514,0.00009619522],"category_scores_gemma":[0.000015733727,0.00008516241,0.0000297754,0.00021069763,0.00001579864,0.002239634,0.0005255559,0.000062189596,0.00031481002],"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.0000020710618,0.00006526091,0.012689474,0.000016500275,0.000025738282,0.00002913919,0.00062490394,0.00015115728,0.00057165895,0.09421487,0.004724487,0.88688475],"study_design_scores_gemma":[0.001346576,0.00015096173,0.17566277,0.00014323846,0.000021029455,0.000011766567,0.0005178123,0.39606377,0.042987358,0.0026567283,0.3789272,0.0015107808],"about_ca_topic_score_codex":0.00006412081,"about_ca_topic_score_gemma":0.000020339545,"teacher_disagreement_score":0.88537395,"about_ca_system_score_codex":0.000026337144,"about_ca_system_score_gemma":0.000013379201,"threshold_uncertainty_score":0.4603956},"labels":[],"label_agreement":null},{"id":"W2117538523","doi":"10.1111/j.1467-9671.2012.01353.x","title":"Measuring Dynamic Interaction in Movement Data","year":2012,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":76,"is_retracted":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":"Movement (music); Computer science; Scope (computer science); Object (grammar); Statistic; Sophistication; Data mining; Interval (graph theory); Data science; Artificial intelligence; Mathematics; Statistics","score_opus":0.07975381783471722,"score_gpt":0.29703634588748234,"score_spread":0.21728252805276513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117538523","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.00758546,0.00006968323,0.9891653,0.000512982,0.00079826365,0.00012153983,0.000009415335,0.0000623352,0.001675043],"genre_scores_gemma":[0.97804135,0.000065160515,0.021428542,0.00008055766,0.000019911511,0.000018432936,0.0000213203,0.000005143393,0.00031958133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992117,0.00003216702,0.00017111644,0.00022066578,0.00014305323,0.00022129693],"domain_scores_gemma":[0.9992382,0.000021562553,0.000025457251,0.0006764586,0.0000061108904,0.000032212705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041567624,0.000071341594,0.000071411014,0.00024992652,0.000037159538,0.00006687114,0.00073447893,0.000020327807,0.00006783155],"category_scores_gemma":[0.0000043778937,0.0000758344,0.000014962315,0.00042366586,0.000009299915,0.0032615839,0.00007113356,0.0001395533,0.000056845187],"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.000006240642,0.0006170636,0.0028864243,0.000029051835,0.000025141038,0.000008153984,0.0013941826,0.002270992,0.0003276328,0.001797851,0.00015924365,0.99047804],"study_design_scores_gemma":[0.00078015786,0.000023365132,0.05696172,0.000083735016,0.000013102237,0.000004963332,0.00039405274,0.920485,0.000523565,0.0005794209,0.019808298,0.00034257723],"about_ca_topic_score_codex":0.00030078943,"about_ca_topic_score_gemma":0.0008787616,"teacher_disagreement_score":0.99013543,"about_ca_system_score_codex":0.00010940271,"about_ca_system_score_gemma":0.000008631799,"threshold_uncertainty_score":0.30924374},"labels":[],"label_agreement":null},{"id":"W2117913411","doi":"10.1145/1247480.1247545","title":"Adaptive location constraint processing","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Toronto","funders":"","keywords":"Constraint (computer-aided design); Computer science; Search engine indexing; Set (abstract data type); Constellation; Time constraint; Position (finance); Matching (statistics); Point (geometry); Algorithm; Theoretical computer science; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.023754973195826038,"score_gpt":0.2578563954654535,"score_spread":0.2341014222696275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117913411","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.00011653605,0.000018958879,0.90127003,0.00023330135,0.000068300615,0.00004862246,1.1661651e-7,0.00012105546,0.09812307],"genre_scores_gemma":[0.77982014,6.7212756e-7,0.21897116,0.0002911439,0.000032403877,9.1727406e-7,0.0000014957697,0.000001390468,0.00088066637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.0000037084044,0.00007583899,0.00013631688,0.00010469703,0.00011856973],"domain_scores_gemma":[0.99975365,0.000011299689,0.000024568611,0.00013609597,0.00004577102,0.000028629736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283058,0.00003867895,0.000030603205,0.000047186255,0.000045827586,0.00011000091,0.00027846202,0.0000105190775,0.000010835466],"category_scores_gemma":[0.0000058432656,0.000032478114,0.000007458887,0.00025252727,0.000022674163,0.00066045666,0.000094016264,0.000027022179,0.00006508988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.265154e-7,0.000011555089,0.000032892953,0.0000025480174,0.0000016219943,0.0000044832263,0.00007489467,0.0000052814557,0.000021906086,0.21196146,0.0004221334,0.7874607],"study_design_scores_gemma":[0.0007205342,0.00016118858,0.014873389,0.000064329186,0.0000095898195,0.00002031596,0.0014047666,0.92609775,0.0071481103,0.018745482,0.030156126,0.0005984031],"about_ca_topic_score_codex":0.000007930384,"about_ca_topic_score_gemma":0.0000066931148,"teacher_disagreement_score":0.9260925,"about_ca_system_score_codex":0.000012083215,"about_ca_system_score_gemma":0.000017469561,"threshold_uncertainty_score":0.13244191},"labels":[],"label_agreement":null},{"id":"W2118142335","doi":"10.1109/ismvl.2002.1011089","title":"On functions defined on free Boolean algebras","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Boolean function; Boolean algebra; Mathematics; Ternary operation; Two-element Boolean algebra; Binary number; Discrete mathematics; Binary relation; Boolean expression; Stone's representation theorem for Boolean algebras; Conjunction (astronomy); Parity function; Complete Boolean algebra; Boolean algebras canonically defined; Computer science; Algebra over a field; Arithmetic; Pure mathematics","score_opus":0.024512687309902668,"score_gpt":0.2053565651084609,"score_spread":0.18084387779855823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118142335","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.0010952182,0.000012515797,0.38656792,0.006765711,0.00061604806,0.00009901579,0.0000058963906,0.00045276625,0.6043849],"genre_scores_gemma":[0.4246478,0.000038208993,0.077324964,0.022956813,0.00046195506,0.00004566475,0.000041608742,0.000036344423,0.47444662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992396,0.000013336341,0.000087319,0.00027903906,0.00020675264,0.00017393644],"domain_scores_gemma":[0.99895567,0.00005056655,0.000020294821,0.0009089302,0.000011006281,0.000053556763],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006692903,0.00008816854,0.00005980355,0.000103676546,0.00010865393,0.00018005288,0.0008358974,0.000018548759,0.0009835322],"category_scores_gemma":[0.000029612167,0.000070777634,0.000036870064,0.00024383196,0.000012657384,0.00035991493,0.00024610874,0.00006873244,0.005913897],"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":[5.7961597e-7,0.000067941335,0.000010286062,7.2293983e-7,0.0000053511717,0.0000047321196,0.000011227589,0.00001416547,0.0000022658471,0.50410026,0.44552946,0.050252993],"study_design_scores_gemma":[0.001875695,0.0012045586,0.0036513489,0.000033030345,0.000019193225,0.0000050215244,0.000040457242,0.29870564,0.00048152634,0.08544932,0.6077491,0.0007850789],"about_ca_topic_score_codex":0.000012246804,"about_ca_topic_score_gemma":0.0000108288605,"teacher_disagreement_score":0.4235526,"about_ca_system_score_codex":0.0000131694305,"about_ca_system_score_gemma":0.0000019294496,"threshold_uncertainty_score":0.9999297},"labels":[],"label_agreement":null},{"id":"W2118182253","doi":"10.1613/jair.1081","title":"An Analysis of Phase Transition in NK Landscapes","year":2002,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Infinity; Phase transition; Mathematics; Upper and lower bounds; Polynomial; Perspective (graphical); Phase (matter); Discrete mathematics; Applied mathematics; Statistical physics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.17904413690257273,"score_gpt":0.4374027383675618,"score_spread":0.2583586014649891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118182253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36789516,0.0001535243,0.6307313,0.00081807055,0.00008579144,0.0000729137,0.0000047728045,0.0000064998712,0.00023199721],"genre_scores_gemma":[0.9946961,0.00030545914,0.004882023,0.000013585976,0.00008235592,0.0000011059344,0.0000021834671,0.0000030203175,0.000014185424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784774,0.00026084762,0.00062340643,0.00017116377,0.0008346224,0.0002622205],"domain_scores_gemma":[0.9989027,0.00016112832,0.0001433905,0.0003093814,0.0003817202,0.00010172091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031845674,0.00006538859,0.00024378332,0.002176675,0.000058444013,0.00018444614,0.0010705397,0.00003638712,0.00023363215],"category_scores_gemma":[0.00009533515,0.000055523087,0.0001164256,0.0035038132,0.00006591741,0.001241225,0.000055673117,0.0002845232,0.000018794037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072866984,0.002042434,0.00023311355,0.000020011455,0.000170831,0.000179679,0.004653929,0.012880138,0.007145782,0.016496625,0.00016954071,0.95593506],"study_design_scores_gemma":[0.000062162006,0.00062543445,0.00016758282,0.000025305184,0.000029727353,0.000002900304,0.0009686927,0.983364,0.010905213,0.0036609087,0.00012636131,0.00006172347],"about_ca_topic_score_codex":0.000060735867,"about_ca_topic_score_gemma":0.00012760649,"teacher_disagreement_score":0.97048384,"about_ca_system_score_codex":0.000037152317,"about_ca_system_score_gemma":0.00002500502,"threshold_uncertainty_score":0.25581083},"labels":[],"label_agreement":null},{"id":"W2118265701","doi":"10.1145/1189769.1189772","title":"Adaptive rank-aware query optimization in relational databases","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Query optimization; Query plan; Ranking (information retrieval); Rank (graph theory); Cardinality (data modeling); Key (lock); Query language; Relational database; Join (topology); Operator (biology); Sargable; Theoretical computer science; Database; Data mining; Information retrieval; Web search query; Search engine","score_opus":0.038032297023068214,"score_gpt":0.24930291190045173,"score_spread":0.21127061487738352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118265701","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.00010442628,0.00011437908,0.99602854,0.0003234512,0.00073115434,0.00043201793,0.0012357614,0.00021021794,0.0008200286],"genre_scores_gemma":[0.520306,0.00015710159,0.46957666,0.0002039517,0.00034746574,0.00037051967,0.0062790653,0.000054945824,0.0027042818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811184,0.00014849528,0.00042827308,0.0005855631,0.00044676187,0.00027907116],"domain_scores_gemma":[0.99811226,0.00021498789,0.0001114411,0.0014460988,0.000057598158,0.000057588484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040055026,0.00020059015,0.00018994838,0.00045329373,0.00019306924,0.00014886916,0.00080485485,0.0000437803,0.000051681192],"category_scores_gemma":[0.00002117737,0.00020170935,0.0000532522,0.00082270475,0.00003540338,0.0025984556,0.00005280482,0.00019844262,0.000110399975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003330093,0.00043855843,0.00018533446,0.00005436694,0.000036951184,0.00007391315,0.00004323764,0.9410409,0.000025304538,0.04748416,0.004152541,0.0064314427],"study_design_scores_gemma":[0.00091086427,0.00004338362,0.000403984,0.00019795704,0.00001876389,0.000016480863,0.00011528522,0.98843056,0.000096008356,0.00011695161,0.009310028,0.00033972738],"about_ca_topic_score_codex":0.002186456,"about_ca_topic_score_gemma":0.00030073203,"teacher_disagreement_score":0.5264519,"about_ca_system_score_codex":0.00009749365,"about_ca_system_score_gemma":0.000056915113,"threshold_uncertainty_score":0.82254684},"labels":[],"label_agreement":null},{"id":"W2119234548","doi":"10.1145/1321440.1321491","title":"Extending query translation to cross-language query expansion with markov chain models","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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é de Montréal","funders":"","keywords":"Computer science; Query expansion; Cross-language information retrieval; Query language; Translation (biology); Natural language processing; Artificial intelligence; Query optimization; RDF query language; Graph; Relation (database); Web query classification; Information retrieval; Web search query; Theoretical computer science; Data mining; Search engine","score_opus":0.02034364459976031,"score_gpt":0.2843728339785337,"score_spread":0.2640291893787734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119234548","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.040736828,0.00006432431,0.9412189,0.0003177699,0.00016392847,0.00024265166,0.0000023621255,0.00027843576,0.016974768],"genre_scores_gemma":[0.6652022,0.0000071951963,0.33089522,0.0006519885,0.000093261784,0.0000088481465,0.000017307648,0.000013878707,0.0031101198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985912,0.00002048418,0.00021051386,0.00044638407,0.0003617599,0.00036967333],"domain_scores_gemma":[0.99923915,0.000050260973,0.000042370553,0.0005147227,0.000032782988,0.00012073098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082934246,0.00014732509,0.00011602309,0.00024282075,0.000120957506,0.0003440835,0.00055564515,0.000038649963,0.000027165446],"category_scores_gemma":[0.0000047862063,0.0001169988,0.000034633937,0.0005012763,0.000019865167,0.0021470464,0.00015162311,0.00007671517,0.00003359075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004515776,0.000061648185,0.00021864787,0.000021545487,0.000013845759,0.00011789664,0.0023000522,0.0017388512,0.002026538,0.034716297,0.00045418477,0.95828533],"study_design_scores_gemma":[0.0013294569,0.00028522706,0.006390273,0.00012826163,0.000014108499,0.000023739773,0.0009765925,0.97452134,0.010098986,0.0021846134,0.003084761,0.0009626567],"about_ca_topic_score_codex":0.0001379299,"about_ca_topic_score_gemma":0.00013369879,"teacher_disagreement_score":0.9727825,"about_ca_system_score_codex":0.000031888918,"about_ca_system_score_gemma":0.000015268442,"threshold_uncertainty_score":0.4771073},"labels":[],"label_agreement":null},{"id":"W2119339035","doi":"10.6010/geoinformatics.12.58","title":"Spatial Prediction Models and Applications.","year":2001,"lang":"en","type":"article","venue":"GEOINFORMATICS","topic":"Data Management and Algorithms","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":"Geological Survey of Canada","funders":"","keywords":"Computer science","score_opus":0.014819490109537878,"score_gpt":0.2121460048233019,"score_spread":0.19732651471376403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119339035","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.00027626246,0.000019550842,0.9765194,0.0001449744,0.00006555145,0.00014959453,0.00000544619,0.00012440672,0.0226948],"genre_scores_gemma":[0.33615798,0.0016572877,0.6549949,0.001968049,0.0007244659,0.00025122997,0.00030370592,0.000021601736,0.0039208103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954385,0.0000031763755,0.0001420138,0.000072772564,0.00012800268,0.00011019625],"domain_scores_gemma":[0.999616,0.00000866476,0.000042844153,0.00027280266,0.000020729261,0.0000389226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010452412,0.000051486284,0.000046442776,0.000053327356,0.00008236741,0.00017209165,0.00026202752,0.000018152119,0.000004030197],"category_scores_gemma":[0.0000023100247,0.000047371435,0.000010010442,0.00013033218,0.0000143789175,0.0017760122,0.00020341804,0.000036762263,0.00005715525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.8874854e-7,0.000015595919,0.00019104236,0.000021673999,0.000006811696,8.771629e-7,0.00033361872,0.0010464807,5.105346e-7,0.1168358,0.0020737562,0.87947303],"study_design_scores_gemma":[0.00011537383,0.00001308437,0.00034719892,0.0000027446954,0.0000028745883,0.0000087752205,0.000025957144,0.91454417,0.0000028423058,0.010639168,0.07424777,0.000050052542],"about_ca_topic_score_codex":0.000009343786,"about_ca_topic_score_gemma":0.0000018220119,"teacher_disagreement_score":0.9134977,"about_ca_system_score_codex":0.000007112306,"about_ca_system_score_gemma":0.000006932361,"threshold_uncertainty_score":0.1931751},"labels":[],"label_agreement":null},{"id":"W2119339514","doi":"10.1145/2462356.2462395","title":"Competitive query strategies for minimising the ply of the potential locations of moving points","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Representation (politics); Computer science; Query optimization; Quality (philosophy); Upper and lower bounds; Measure (data warehouse); Sargable; Data mining; Information retrieval; Web search query; Search engine; Mathematics","score_opus":0.01311500691766539,"score_gpt":0.2292175367494753,"score_spread":0.2161025298318099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119339514","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.015128521,0.00001842404,0.9643307,0.004340298,0.00024256569,0.00044243236,0.000009101227,0.00002373876,0.015464224],"genre_scores_gemma":[0.96356356,0.000002175132,0.03574384,0.00018157405,0.00002416427,0.000013405036,0.0000022472004,0.0000024895178,0.00046654168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.000026905167,0.00014570227,0.00010399547,0.00012662676,0.00009341773],"domain_scores_gemma":[0.99934596,0.00009535502,0.000093998344,0.0003473737,0.00010715014,0.000010146976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012794645,0.00004903943,0.00006460275,0.000026318676,0.00009801019,0.00014251327,0.0008039892,0.000010753676,0.00002213664],"category_scores_gemma":[0.000015947642,0.000026080508,0.000049269358,0.00012814516,0.00008785549,0.00066760473,0.00028953957,0.000028407068,0.000005425683],"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.044525e-7,0.000029675175,0.00003741002,0.00001933786,0.000021621438,6.2639664e-8,0.00038881582,0.00024910708,0.00076632336,0.987639,0.0020235563,0.008824387],"study_design_scores_gemma":[0.00074839714,0.00012442484,0.04922691,0.00015259335,0.000056456127,0.0000031120703,0.024061663,0.7606173,0.013896379,0.14768012,0.0031237984,0.00030880896],"about_ca_topic_score_codex":0.00022887226,"about_ca_topic_score_gemma":0.00002843061,"teacher_disagreement_score":0.94843507,"about_ca_system_score_codex":0.0000043098653,"about_ca_system_score_gemma":0.00003952013,"threshold_uncertainty_score":0.14940253},"labels":[],"label_agreement":null},{"id":"W2119462844","doi":"10.1109/icde.2001.914848","title":"Spatial clustering in the presence of obstacles","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":161,"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":"Cluster analysis; Computer science; Data stream clustering; Pruning; CURE data clustering algorithm; Function (biology); Canopy clustering algorithm; Data mining; Scalability; Space (punctuation); Correlation clustering; Obstacle; Artificial intelligence; Geography","score_opus":0.03443696842166376,"score_gpt":0.23324899908527733,"score_spread":0.19881203066361358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119462844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049869088,0.000047052465,0.9543904,0.0013542909,0.00013504118,0.00010273415,6.977811e-7,0.00003102811,0.038951837],"genre_scores_gemma":[0.9842347,0.000014845782,0.014939799,0.00014099712,0.000017871813,0.0000027131177,3.060432e-7,9.5165154e-7,0.00064783334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959326,0.000021208152,0.00008042263,0.00009376122,0.00012917271,0.00008220679],"domain_scores_gemma":[0.9996327,0.000045547426,0.000018640967,0.00029044956,0.0000055539367,0.0000070898423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013405582,0.00003079236,0.000036852627,0.000032309683,0.00001569447,0.000061791616,0.0008839418,0.0000064599813,0.000044778633],"category_scores_gemma":[0.000011988815,0.000019366471,0.000011077234,0.00015736416,0.000014503639,0.00035367493,0.00025558687,0.000027196842,0.000018421357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011075766,0.00014312175,0.0027750602,0.000026027154,0.0000060314464,0.000028917093,0.0032306642,0.0002542153,0.00012428746,0.06729084,0.009649236,0.91647047],"study_design_scores_gemma":[0.00011236415,0.000020832069,0.007906994,0.0000075251787,6.766779e-7,0.0000010470919,0.00008061543,0.986537,0.00018051916,0.00057723245,0.004526147,0.000049080445],"about_ca_topic_score_codex":0.00016718918,"about_ca_topic_score_gemma":0.000117584495,"teacher_disagreement_score":0.98628277,"about_ca_system_score_codex":0.0000020555199,"about_ca_system_score_gemma":9.256234e-7,"threshold_uncertainty_score":0.16425985},"labels":[],"label_agreement":null},{"id":"W2119565875","doi":"10.1002/j.2158-1592.2001.tb00009.x","title":"A HYBRID TRAVEL DISTANCE APPROXIMATION FOR A GIS‐BASED DECISION SUPPORT SYSTEM","year":2001,"lang":"en","type":"article","venue":"Journal of Business Logistics","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Geographic information system; Decision support system; Computer science; Shortest path problem; Operations research; Travel time; Information system; Global Positioning System; Transport engineering; Data mining; Geography; Mathematics; Engineering; Remote sensing; Telecommunications","score_opus":0.03737388903082799,"score_gpt":0.2631662904065242,"score_spread":0.22579240137569617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119565875","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.00022420697,0.000041792,0.99773806,0.0004533861,0.0010555945,0.0001719767,0.000024061937,0.000029778732,0.0002611179],"genre_scores_gemma":[0.5290975,0.000029059416,0.47032565,0.00010720891,0.0003056222,0.0000058903424,0.000021081376,0.000010690746,0.00009730857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986161,0.000019626239,0.0005543909,0.00017237582,0.00043246098,0.0002050344],"domain_scores_gemma":[0.9981696,0.00015816183,0.0005656458,0.00032888394,0.00070781494,0.00006988572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993586,0.00012625927,0.00026167257,0.00019066398,0.0000928458,0.000281044,0.00081719476,0.00003022222,0.0000033516685],"category_scores_gemma":[0.00027640368,0.00010087806,0.00008268221,0.00038796966,0.000028840794,0.0007241928,0.00007127441,0.000077106415,0.0000057375532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007139479,0.0009963494,0.0004958116,0.0013814532,0.00012098877,0.0020219376,0.00013137933,0.084339894,0.00026942318,0.20578434,0.03656659,0.66717786],"study_design_scores_gemma":[0.0013048989,0.0001327056,0.0017959928,0.00019699468,0.000045037275,0.00022572439,0.00002947028,0.97602737,0.0000987878,0.00335538,0.016617943,0.00016970758],"about_ca_topic_score_codex":0.000002226521,"about_ca_topic_score_gemma":0.0000013203635,"teacher_disagreement_score":0.89168745,"about_ca_system_score_codex":0.000087630426,"about_ca_system_score_gemma":0.000111077614,"threshold_uncertainty_score":0.41136882},"labels":[],"label_agreement":null},{"id":"W2121433213","doi":"10.1145/1386118.1386119","title":"Probabilistic top- <i>k</i> and ranking-aggregate queries","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":87,"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; Ranking (information retrieval); Probabilistic logic; Aggregate (composite); Uncertain data; Semantics (computer science); Tuple; Probabilistic database; Search engine indexing; Materialized view; Dimension (graph theory); Information retrieval; Online aggregation; Data mining; Theoretical computer science; Web search query; Sargable; Search engine; Relational database; Artificial intelligence; View; Database theory; Programming language","score_opus":0.027337698147204898,"score_gpt":0.23315272567843237,"score_spread":0.20581502753122746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121433213","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.0062033897,0.0003322276,0.9901506,0.0005983687,0.0009733832,0.00047599987,0.00025288065,0.0003506879,0.00066250825],"genre_scores_gemma":[0.9537305,0.0008514009,0.041115217,0.0003447139,0.00015438489,0.00023866768,0.00013510282,0.00003346149,0.0033965183],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985796,0.000080229685,0.00025486507,0.000511805,0.00030751916,0.00026597723],"domain_scores_gemma":[0.9980938,0.00012304002,0.000069430076,0.0015692523,0.00003872811,0.00010573954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026147993,0.0001838085,0.00019594282,0.00015533055,0.0004232176,0.00020126459,0.0008605283,0.000035997484,0.00001258119],"category_scores_gemma":[0.000034357763,0.00016426615,0.0000423391,0.00037288267,0.00011025054,0.001219848,0.00006301071,0.00014517382,0.00008805279],"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.0003199324,0.0030912985,0.0016549565,0.0036947916,0.0012540238,0.0028169316,0.007839781,0.008262914,0.0027766565,0.33467585,0.047010966,0.5866019],"study_design_scores_gemma":[0.0067403885,0.0010815513,0.0014419389,0.0014808222,0.00027217672,0.0024643522,0.000808921,0.24120818,0.005371025,0.00312376,0.7324467,0.003560237],"about_ca_topic_score_codex":0.00024506304,"about_ca_topic_score_gemma":0.000022105087,"teacher_disagreement_score":0.94903535,"about_ca_system_score_codex":0.000024898718,"about_ca_system_score_gemma":0.000034601664,"threshold_uncertainty_score":0.6698579},"labels":[],"label_agreement":null},{"id":"W2121804177","doi":"10.1145/2666310.2666485","title":"Towards knowledge-enriched path computation","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Closeness; Probabilistic logic; Measure (data warehouse); Path (computing); Geospatial analysis; Ground truth; Routing (electronic design automation); Shortest path problem","score_opus":0.01594114754581812,"score_gpt":0.2600668622141003,"score_spread":0.24412571466828217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121804177","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.00032350072,0.00001237696,0.82973117,0.00047781467,0.00032605557,0.00004768783,2.3533362e-7,0.00023244858,0.16884872],"genre_scores_gemma":[0.7017972,0.000004792266,0.29309848,0.00051735,0.00014273208,0.0000057313173,0.000016047332,0.0000056053923,0.00441206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938464,0.000037535065,0.0000991984,0.00021788327,0.00012314989,0.00013758105],"domain_scores_gemma":[0.99959654,0.000027208314,0.000027278278,0.00026347424,0.000040005656,0.000045495137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028252997,0.000069245834,0.000072103016,0.00006036003,0.000054851953,0.00020195082,0.0005456054,0.000016963308,0.000019908275],"category_scores_gemma":[0.00001781993,0.000056660178,0.000024864581,0.00024733657,0.000011243541,0.00052885164,0.00031904885,0.000035368237,0.00054663396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3687221e-7,0.000031794203,0.000032226555,0.0000052812047,0.0000038685257,6.126584e-7,0.000091809685,0.000018463405,0.000019629135,0.33296946,0.015340122,0.6514865],"study_design_scores_gemma":[0.0002317438,0.000045875157,0.004072813,0.0000030097663,0.00000257175,7.6254895e-7,0.000010108455,0.9127685,0.00007287971,0.017969795,0.06469545,0.0001265039],"about_ca_topic_score_codex":0.000011967095,"about_ca_topic_score_gemma":0.0000025386962,"teacher_disagreement_score":0.91275,"about_ca_system_score_codex":0.000010197576,"about_ca_system_score_gemma":0.000011120123,"threshold_uncertainty_score":0.70260555},"labels":[],"label_agreement":null},{"id":"W2122098189","doi":"10.1109/iasp.2009.5054570","title":"Research on optimized spatial data query algorithm in the spatial database","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Object-based spatial database; Spatial database; Spatial analysis; Spatial query; Computer science; Data mining; Object (grammar); Spatiotemporal database; Database; Information retrieval; View; Database design; Sargable; Web search query; Artificial intelligence; Search engine; Database tuning; Geography; Remote sensing","score_opus":0.13490279937498753,"score_gpt":0.38551729720262573,"score_spread":0.2506144978276382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122098189","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.00010081894,0.000022116832,0.97222704,0.0089663975,0.00028069693,0.0004042446,0.00007463262,0.000092708025,0.017831322],"genre_scores_gemma":[0.09674866,0.00020461177,0.8888447,0.00817954,0.001449841,0.00004537272,0.0021707257,0.000022288208,0.0023342476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699205,0.00042647455,0.00024874907,0.00077670376,0.0010556786,0.00050032337],"domain_scores_gemma":[0.9959865,0.00030872374,0.000037701164,0.003556082,0.000044992663,0.00006596877],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.004079999,0.00014467322,0.00014690644,0.00030777417,0.00017765393,0.00067485723,0.006738208,0.00003870233,0.00008057182],"category_scores_gemma":[0.00009250848,0.00009455886,0.000024812254,0.0008211626,0.000057012676,0.001574201,0.0018529282,0.00042906462,0.000251888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017854909,0.00031342416,0.0000061393807,0.0000023320674,0.00000535542,0.00017888068,0.00008606552,0.00004824561,0.0000073176975,0.02219844,0.0628638,0.9142721],"study_design_scores_gemma":[0.0010369283,0.00022580943,0.0015319906,0.000021828342,0.0000032445453,0.000004306226,0.000118997865,0.9692821,0.00008507447,0.001541101,0.025952937,0.00019570036],"about_ca_topic_score_codex":0.0026295856,"about_ca_topic_score_gemma":0.00030963268,"teacher_disagreement_score":0.9692338,"about_ca_system_score_codex":0.000026124144,"about_ca_system_score_gemma":0.000060853366,"threshold_uncertainty_score":0.9986358},"labels":[],"label_agreement":null},{"id":"W2122137272","doi":"10.1109/icde.1995.380399","title":"Context-dependent interpretations of linguistic terms in fuzzy relational databases","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Interpretation (philosophy); Tuple; Fuzzy logic; Context (archaeology); Computer science; Term (time); Natural language processing; Meaning (existential); Data mining; Relational database; Artificial intelligence; Fuzzy set; Information retrieval; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.050671667147898496,"score_gpt":0.26537370476837646,"score_spread":0.21470203762047796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122137272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015913055,0.00015245836,0.8977901,0.00042965953,0.00031985348,0.00013540263,0.00002978483,0.00006826627,0.09948318],"genre_scores_gemma":[0.96036077,0.000013801903,0.036998738,0.00014759226,0.00002126427,0.0000055796418,0.000020754076,0.0000024325573,0.002429074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932784,0.00001875105,0.00020470204,0.00018136816,0.00017228915,0.000095064424],"domain_scores_gemma":[0.99947923,0.00009505485,0.00004502678,0.00033131306,0.000025975663,0.000023390747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012253138,0.000055169796,0.0000808913,0.00013159364,0.000021921083,0.00003541584,0.00038357414,0.000009296649,0.00019969733],"category_scores_gemma":[0.000115569834,0.000049247563,0.000024759764,0.00018321275,0.00002332984,0.0004902604,0.00023085364,0.000049772938,0.00009393646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011231324,0.00015145478,0.004176996,0.000012119256,0.000018531317,0.00001664399,0.0008314691,0.00010429032,0.000016686578,0.9215455,0.002272921,0.070852235],"study_design_scores_gemma":[0.0009881669,0.000082540355,0.014802853,0.000107186395,0.000016448357,0.0000063487405,0.00011973812,0.9403209,0.00027712228,0.018092312,0.024856566,0.00032982675],"about_ca_topic_score_codex":0.000084747604,"about_ca_topic_score_gemma":0.00008735366,"teacher_disagreement_score":0.95876944,"about_ca_system_score_codex":0.00001194537,"about_ca_system_score_gemma":0.0000048323695,"threshold_uncertainty_score":0.21865456},"labels":[],"label_agreement":null},{"id":"W2122464844","doi":"10.1109/hicss.1988.11924","title":"Fuzzy information management using the roster model","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Unix; Fuzzy logic; Computer science; Fuzzy set; Set (abstract data type); Data mining; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.025261781740607423,"score_gpt":0.23675120627429572,"score_spread":0.2114894245336883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122464844","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.00015459533,0.000003777193,0.7589968,0.00024668124,0.00010682122,0.00009971033,3.7717092e-7,0.00004758748,0.24034365],"genre_scores_gemma":[0.102096066,0.000013256149,0.88672787,0.0045397975,0.000016694166,0.000012164498,0.0000060500374,0.00000421695,0.0065839035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999503,0.000013110355,0.00010156984,0.00008481262,0.00016933105,0.0001281599],"domain_scores_gemma":[0.9995213,0.0000043235104,0.000028381079,0.0004134015,0.000015133467,0.000017470047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021623752,0.000054754517,0.00003234121,0.000051271425,0.000100324796,0.00038841885,0.00048399455,0.000009204171,0.0000079949095],"category_scores_gemma":[0.000002140084,0.000034258548,0.000018609353,0.00018119543,0.0000086092305,0.0023388027,0.00024301371,0.000028181497,0.00009285222],"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":[1.8750258e-7,0.00000612471,0.000009325466,0.0000046127325,0.0000075694757,5.8750504e-7,0.0001146243,0.0058809053,0.0000017744067,0.95529974,0.0037423004,0.034932256],"study_design_scores_gemma":[0.00011697142,0.0000035845683,0.00003357239,0.0000023311238,0.0000050548833,0.0000012719061,0.0000814536,0.9426262,0.00005515052,0.020497609,0.03650464,0.0000722032],"about_ca_topic_score_codex":0.0000031837515,"about_ca_topic_score_gemma":5.55878e-7,"teacher_disagreement_score":0.9367452,"about_ca_system_score_codex":0.0000126560135,"about_ca_system_score_gemma":0.000005299107,"threshold_uncertainty_score":0.37455317},"labels":[],"label_agreement":null},{"id":"W2122471363","doi":"10.1109/tfuzz.2010.2040479","title":"Fuzzy Clustering with Viewpoints","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"","keywords":"Viewpoints; Cluster analysis; Computer science; Data mining; Fuzzy clustering; Perspective (graphical); Fuzzy logic; Domain knowledge; Artificial intelligence; Domain (mathematical analysis); Machine learning; Mathematics","score_opus":0.014409782342732585,"score_gpt":0.22634982170703005,"score_spread":0.21194003936429748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122471363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002386386,0.00001684454,0.9755649,0.000293982,0.0047213817,0.00037776722,0.000016773494,0.00039623334,0.016225742],"genre_scores_gemma":[0.9850662,0.0000124150965,0.011302448,0.00013233123,0.00015830663,0.00009862909,0.0000024606725,0.000023828437,0.0032033846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851084,0.000047042635,0.0002495376,0.00047077358,0.0003914487,0.0003303855],"domain_scores_gemma":[0.9987166,0.000045431578,0.00008204683,0.0009638865,0.000057431276,0.00013460811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029898665,0.00020544254,0.00020305559,0.00021195221,0.00024825067,0.00046619133,0.00087580504,0.00006948511,0.00001253581],"category_scores_gemma":[0.0000013418252,0.00016626294,0.000064863496,0.0004523731,0.00004372484,0.00094976265,0.0000065472095,0.0003486222,0.00044774864],"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.00017893221,0.0018275987,0.00016384467,0.0010361868,0.0009081097,0.00051600987,0.0026954624,0.06422546,0.014932038,0.060662024,0.009803218,0.84305114],"study_design_scores_gemma":[0.008284692,0.00230574,0.0011697799,0.0013007375,0.00031316906,0.0012039007,0.0009840411,0.74741226,0.016320392,0.0019477869,0.2138104,0.0049471026],"about_ca_topic_score_codex":0.0001224394,"about_ca_topic_score_gemma":0.00020832595,"teacher_disagreement_score":0.9826798,"about_ca_system_score_codex":0.000025859526,"about_ca_system_score_gemma":0.000028685554,"threshold_uncertainty_score":0.67800057},"labels":[],"label_agreement":null},{"id":"W2123193503","doi":"10.3233/jcs-2007-15401","title":"Parity-based inference control for multi-dimensional range sum queries","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Security","topic":"Data Management and Algorithms","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":"National Science Foundation","keywords":"Inference; Computer science; Range (aeronautics); Parity (physics); Statistical inference; Subtraction; Control (management); Theoretical computer science; Discrete mathematics; Mathematics; Statistics; Artificial intelligence; Arithmetic","score_opus":0.02731855282240219,"score_gpt":0.29240019902335673,"score_spread":0.26508164620095453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123193503","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.009601152,0.0001492525,0.98742485,0.0009814992,0.001544,0.00020925247,0.00001633437,0.000046537087,0.000027118516],"genre_scores_gemma":[0.51420933,0.00000422165,0.4837544,0.001492401,0.000512486,0.000002150451,0.0000046378345,0.000007250679,0.0000130940125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983058,0.000071631854,0.0005858949,0.00022931489,0.00045534607,0.00035203865],"domain_scores_gemma":[0.9981194,0.0004732981,0.00043615626,0.0003234708,0.00047454174,0.0001731114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018777362,0.00017796269,0.00035011812,0.00022449964,0.00013828163,0.00025870124,0.0010743067,0.000065047796,0.0000064579704],"category_scores_gemma":[0.000061440995,0.00014934661,0.00021096412,0.00020146575,0.00006679189,0.0010756251,0.00018802675,0.0002452751,0.000005531685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021461418,0.0066186553,0.054942377,0.00086940767,0.0013275191,0.0018108458,0.0038904436,0.0065300283,0.00048861565,0.41314918,0.09223101,0.41599578],"study_design_scores_gemma":[0.0067547965,0.0006628313,0.018344728,0.00009597619,0.000040042654,0.00003700976,0.000007964452,0.9297135,0.00048284355,0.0059926165,0.03750584,0.000361845],"about_ca_topic_score_codex":0.0000086440305,"about_ca_topic_score_gemma":0.000021291924,"teacher_disagreement_score":0.9231835,"about_ca_system_score_codex":0.000038703183,"about_ca_system_score_gemma":0.000110042136,"threshold_uncertainty_score":0.6090178},"labels":[],"label_agreement":null},{"id":"W2123567890","doi":"10.1007/978-3-540-69839-5_54","title":"Deriving and Mining Spatiotemporal Event Schemas in In-Situ Sensor Data","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Granularity; Computer science; Data mining; Construct (python library); Event (particle physics); Hierarchical database model; Tree (set theory); Tree structure; Axiom; Schema (genetic algorithms); Theoretical computer science; Algorithm; Binary tree; Information retrieval; Mathematics","score_opus":0.04023980359721857,"score_gpt":0.2652922379323274,"score_spread":0.22505243433510885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123567890","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.0021003264,0.00057778566,0.9942784,0.00071439135,0.0006850729,0.00033247433,0.00000778695,0.00006420553,0.0012395836],"genre_scores_gemma":[0.16704232,0.00026713486,0.8315131,0.00064298674,0.00025693505,0.000004730181,0.00004769992,0.000027331524,0.00019774721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623007,0.000036391782,0.0005458019,0.0018699644,0.0007192491,0.000598513],"domain_scores_gemma":[0.9975082,0.0002636132,0.00021578134,0.0018592937,0.000046324276,0.00010678295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011017125,0.00041534984,0.00046502473,0.001104019,0.00012737793,0.0004283881,0.0035715424,0.00017138963,0.00000359889],"category_scores_gemma":[0.00010083696,0.0004129825,0.000033453656,0.0006912701,0.00037911718,0.0018040402,0.0059170537,0.0005754386,0.000009310117],"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.0000034417913,0.00003962251,0.0021624116,0.000058276688,0.000007255481,0.0007630501,0.0010925194,0.0034556233,0.000053879656,0.0013488488,0.00007923817,0.99093586],"study_design_scores_gemma":[0.0005962928,0.000083330706,0.0057609896,0.0010179493,0.000004701113,0.00010176702,0.0000011534565,0.9824833,0.0002553083,0.0038806791,0.00488066,0.0009338146],"about_ca_topic_score_codex":0.00006182138,"about_ca_topic_score_gemma":0.0008486178,"teacher_disagreement_score":0.99000204,"about_ca_system_score_codex":0.00015134137,"about_ca_system_score_gemma":0.00023520204,"threshold_uncertainty_score":0.9998322},"labels":[],"label_agreement":null},{"id":"W2123914025","doi":"","title":"Approximating Range-Aggregate Queries using Coresets","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Rectangle; Combinatorics; Range (aeronautics); Ball (mathematics); Aggregate (composite); Set (abstract data type); RADIUS; Function (biology); Point (geometry); Mathematics; Approximation algorithm; Value (mathematics); Computer science; Geometry; Statistics","score_opus":0.02188332451805042,"score_gpt":0.2593523324219685,"score_spread":0.23746900790391806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123914025","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.07487359,0.000010645075,0.9029088,0.0004487114,0.00077854574,0.00012275056,0.0000018506781,0.0003198023,0.020535287],"genre_scores_gemma":[0.14680757,0.0000023050893,0.8513509,0.00025764413,0.000114778224,0.000004501521,0.0000040465156,0.000007462713,0.0014507944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992431,0.000012635407,0.00013227857,0.00023062692,0.00017155812,0.0002098332],"domain_scores_gemma":[0.9993659,0.000024297606,0.00005739332,0.0004752401,0.000028285966,0.000048827962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002759519,0.00008513786,0.000084967636,0.000064528,0.00013288841,0.00041201146,0.0007482018,0.000024614252,0.00006308681],"category_scores_gemma":[0.000037023696,0.00006953393,0.00002636132,0.00021489064,0.000041991072,0.0012187517,0.00051955786,0.00011028442,0.000061619074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002738487,0.00006395966,0.0032513079,0.000043001077,0.000027375405,0.000045888402,0.0004951823,0.000024042747,0.015376641,0.6616692,0.0033547205,0.31564593],"study_design_scores_gemma":[0.00028456174,0.000016533188,0.00071321777,0.000013250072,0.0000050747403,0.000015947307,0.000047419217,0.9742163,0.0048742453,0.0040251547,0.015522349,0.00026593814],"about_ca_topic_score_codex":0.00007180435,"about_ca_topic_score_gemma":0.000031368945,"teacher_disagreement_score":0.97419226,"about_ca_system_score_codex":0.000004384397,"about_ca_system_score_gemma":0.0000135425835,"threshold_uncertainty_score":0.3973036},"labels":[],"label_agreement":null},{"id":"W2123965785","doi":"10.1109/cmpsac.1997.625000","title":"Concurrent access to point data","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Concurrency; Concurrency control; Multiversion concurrency control; Non-lock concurrency control; Lock (firearm); Tree (set theory); Concurrent computing; Programming language; B-tree; Theoretical computer science; Distributed computing; Parallel computing; Data structure; Distributed concurrency control; Mathematics","score_opus":0.19836140510693248,"score_gpt":0.3377557586632647,"score_spread":0.1393943535563322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123965785","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.0000524479,0.000032896536,0.9299278,0.01027263,0.00053371926,0.00011515879,0.000011500887,0.00012969061,0.0589241],"genre_scores_gemma":[0.50464195,0.00025629968,0.3648868,0.045860358,0.0009710892,0.000055114517,0.00023917049,0.000037368656,0.08305189],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992297,0.000009298472,0.00008997598,0.00035257547,0.00016117825,0.00015724047],"domain_scores_gemma":[0.9985176,0.000013243754,0.000015755772,0.0013616506,0.000013432127,0.00007831653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012038059,0.000059343532,0.00005605387,0.000053357446,0.000037573976,0.0006788071,0.0047676535,0.0000074235004,0.00078988745],"category_scores_gemma":[0.000015154131,0.00004770576,0.000009516958,0.00025889042,0.0000069235143,0.0025619525,0.0053684786,0.00003078876,0.0022394708],"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":[3.2655496e-8,0.000022593858,0.00003475517,0.0000015436838,0.0000029270198,0.0000042148085,0.000020511527,0.000001669535,0.0000015925391,0.018503256,0.5451076,0.4362993],"study_design_scores_gemma":[0.00011243047,0.000019112991,0.0004712332,0.000004335405,0.0000019040396,0.0000011388772,0.0000046218133,0.34359676,0.00007181464,0.00020943746,0.65538704,0.00012015936],"about_ca_topic_score_codex":0.000014776195,"about_ca_topic_score_gemma":0.000007989674,"teacher_disagreement_score":0.56504107,"about_ca_system_score_codex":0.000006294922,"about_ca_system_score_gemma":0.0000022273173,"threshold_uncertainty_score":0.9985374},"labels":[],"label_agreement":null},{"id":"W2124547665","doi":"10.3138/carto.48.2.1836","title":"Detecting Level-of-Detail Inconsistencies in Volunteered Geographic Information Data Sets","year":2013,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":53,"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":"Volunteered geographic information; Generalization; Computer science; Data mining; Information retrieval; Data science; Mathematics","score_opus":0.054007837470390375,"score_gpt":0.2972475775605441,"score_spread":0.24323974009015373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124547665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16856776,0.00035872633,0.82003266,0.0054853098,0.0028772692,0.0016541821,0.00037614876,0.00015458874,0.00049336336],"genre_scores_gemma":[0.9902862,0.0009509939,0.0061972584,0.0012400931,0.00007789589,0.000081063634,0.0011426642,0.000008398776,0.000015487245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763924,0.000082454535,0.001126442,0.00018385245,0.00067454466,0.00029343803],"domain_scores_gemma":[0.9970025,0.00018354655,0.0008235291,0.00051547907,0.0013882365,0.0000867137],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0017986117,0.00020399674,0.00020202309,0.0020153583,0.00038025368,0.0016157324,0.0020510745,0.000097984,0.000017321303],"category_scores_gemma":[0.0004210982,0.00016061882,0.000116513125,0.0011566593,0.00014859861,0.014725879,0.0006457753,0.00023665496,0.00000837423],"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.00009402999,0.00013628294,0.09360797,0.00022173328,0.00058532995,0.0000020817665,0.004927619,0.00083601143,0.00009752493,0.113317534,0.006645455,0.77952844],"study_design_scores_gemma":[0.0031491206,0.00023180734,0.16410804,0.00023384871,0.00007664124,0.00016754553,0.004039794,0.70533484,0.00009851058,0.025359116,0.0965427,0.0006580214],"about_ca_topic_score_codex":0.0004896885,"about_ca_topic_score_gemma":0.00017358623,"teacher_disagreement_score":0.8217184,"about_ca_system_score_codex":0.0000213624,"about_ca_system_score_gemma":0.00006913268,"threshold_uncertainty_score":0.9994207},"labels":[],"label_agreement":null},{"id":"W2124894008","doi":"10.1109/mwscas.2007.4488662","title":"Exploring different methods for 2DR-tree binary search on a FPGA","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Implementation; Field-programmable gate array; Computer science; Software implementation; Software; Binary tree; Data structure; Tree (set theory); Binary data; Computer architecture; Binary number; Parallel computing; Theoretical computer science; Embedded system; Operating system; Software engineering; Programming language; Arithmetic; Mathematics","score_opus":0.2558867416882275,"score_gpt":0.378630708343344,"score_spread":0.1227439666551165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124894008","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.052082703,0.000026052823,0.9368404,0.0020356616,0.0004957844,0.00048801224,0.0000022843394,0.00030143833,0.007727629],"genre_scores_gemma":[0.6362384,0.00009341513,0.36115807,0.0006894089,0.00020815675,0.0002255058,0.0000094355355,0.000027212935,0.0013503865],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980897,0.000011027153,0.00026210424,0.00067829696,0.00032019403,0.00063869637],"domain_scores_gemma":[0.9990324,0.0001840718,0.00007768014,0.00029221247,0.00023971671,0.00017392868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013856945,0.00023373448,0.0002282878,0.00032148827,0.00019957326,0.000554585,0.0014664128,0.00004226406,0.000012646254],"category_scores_gemma":[0.000109224624,0.00019912125,0.00008044348,0.00042295866,0.000052507905,0.0015389897,0.0006731577,0.00020400966,0.0000344869],"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.000028150236,0.00008543873,0.00021594718,0.00006548156,0.00001771808,0.0000032798414,0.0011905968,3.7807243e-7,0.004659414,0.16130781,0.0011368371,0.83128893],"study_design_scores_gemma":[0.0034434232,0.0032482205,0.037179492,0.0007589507,0.000071231916,0.000017138464,0.003829437,0.33923224,0.37522984,0.038199686,0.19628555,0.0025047888],"about_ca_topic_score_codex":0.0000052833843,"about_ca_topic_score_gemma":9.986667e-7,"teacher_disagreement_score":0.82878417,"about_ca_system_score_codex":0.00005785841,"about_ca_system_score_gemma":0.000026495596,"threshold_uncertainty_score":0.8119929},"labels":[],"label_agreement":null},{"id":"W2126080031","doi":"10.1109/icassp.2004.1326474","title":"Hierarchical annealing for scientific models","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Simulated annealing; Computational complexity theory; Theoretical computer science; Convergence (economics); Computational science; Algorithm","score_opus":0.049093765891834,"score_gpt":0.2666565142974884,"score_spread":0.21756274840565437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126080031","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.0010875148,0.000015778343,0.99098706,0.0022081756,0.00040739236,0.00014097893,0.0000037444893,0.00016520424,0.0049841693],"genre_scores_gemma":[0.15399022,0.0000017285367,0.8425403,0.0004029767,0.00007276318,0.000018255854,0.00001866538,0.0000047493354,0.0029503228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992344,0.0000042383544,0.00009131012,0.00030925585,0.00015179666,0.00020900166],"domain_scores_gemma":[0.99951756,0.00001659643,0.000014987102,0.00036602467,0.00003134686,0.000053462554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687387,0.000055013697,0.00005387523,0.00008321427,0.00018839205,0.0006154912,0.0007559601,0.0000143157495,0.0000037830969],"category_scores_gemma":[0.000007824849,0.000045825618,0.000037240396,0.00023798089,0.000037257512,0.0011128174,0.00024999244,0.00003211506,0.000033373282],"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":[9.245787e-7,0.000018724748,8.496219e-7,0.0000041310127,0.0000027449848,0.0000014337543,0.00007405185,0.0037446097,0.00003951485,0.97062844,0.0013690146,0.024115557],"study_design_scores_gemma":[0.00027003066,0.000026926149,0.0000059009567,0.0000040919067,0.0000012990978,7.58365e-7,0.0000060772186,0.5832149,0.00055279816,0.40626338,0.009578328,0.00007554767],"about_ca_topic_score_codex":0.000006476322,"about_ca_topic_score_gemma":0.000003854735,"teacher_disagreement_score":0.5794703,"about_ca_system_score_codex":0.000013025506,"about_ca_system_score_gemma":0.000027924216,"threshold_uncertainty_score":0.59351957},"labels":[],"label_agreement":null},{"id":"W2126220026","doi":"10.1007/s10619-009-7043-x","title":"Continuously monitoring top-k uncertain data streams: a probabilistic threshold method","year":2009,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Data stream mining; Computer science; Probabilistic logic; Uncertain data; Quantile; Data mining; Data structure; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.07410263996446681,"score_gpt":0.33747829743305896,"score_spread":0.26337565746859215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126220026","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.0034460472,0.0010048726,0.9884417,0.0011194451,0.00020566833,0.00032912593,0.0048404275,0.00028205887,0.00033065886],"genre_scores_gemma":[0.23431115,0.0011206763,0.72472394,0.00060311554,0.000578763,0.00004743572,0.038298827,0.00002417998,0.00029194515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980981,0.00006719214,0.00028414052,0.00085070654,0.00027768684,0.00042218182],"domain_scores_gemma":[0.99769545,0.00014775842,0.00009947382,0.0018553237,0.000048934588,0.00015303589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047871468,0.00024211334,0.00026652878,0.000066070694,0.00020958125,0.00045258814,0.0017261797,0.000033928307,0.000010370016],"category_scores_gemma":[0.00015590807,0.00020883472,0.000031661497,0.00036423263,0.00004463297,0.0018312003,0.0010563271,0.00014365013,0.000013006116],"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.00006876405,0.00068562693,0.01818039,0.00013445059,0.0001606991,0.00048457677,0.0001908808,0.00076578883,0.00016777722,0.16306162,0.06739528,0.74870414],"study_design_scores_gemma":[0.0038442197,0.0005500984,0.03974839,0.00063711696,0.00027682437,0.0001229615,0.00061187235,0.6518872,0.00056761946,0.019252213,0.28011462,0.002386888],"about_ca_topic_score_codex":0.00013347626,"about_ca_topic_score_gemma":0.000011820981,"teacher_disagreement_score":0.74631727,"about_ca_system_score_codex":0.000016947248,"about_ca_system_score_gemma":0.000036367834,"threshold_uncertainty_score":0.85160327},"labels":[],"label_agreement":null},{"id":"W2126431245","doi":"10.1007/s00778-006-0029-7","title":"Algorithms and analyses for maximal vector computation","year":2006,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":177,"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":"Skyline; Curse of dimensionality; Computation; Field (mathematics); Computer science; Running time; Divide and conquer algorithms; Algorithm; Mathematics; Discrete mathematics; Theoretical computer science; Combinatorics; Artificial intelligence; Data mining; Pure mathematics","score_opus":0.04801050073090831,"score_gpt":0.3160797680561167,"score_spread":0.2680692673252084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126431245","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.007514936,0.00028536268,0.98899204,0.0024064141,0.00031577033,0.00009388038,0.00000458361,0.000034172157,0.00035287256],"genre_scores_gemma":[0.5305412,0.0000774954,0.465851,0.00048690222,0.0017735184,0.000011344468,0.000020475209,0.000017416502,0.0012206425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993457,0.000035528952,0.0001548348,0.00012518662,0.00016916204,0.0001695929],"domain_scores_gemma":[0.99961096,0.00007719451,0.000098887016,0.00012508174,0.000052909076,0.000034959066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040688994,0.00007566806,0.0000847071,0.00007739468,0.00031671114,0.0006135868,0.0004253392,0.000014121992,0.000004271776],"category_scores_gemma":[0.0000101554815,0.00004752437,0.00004640043,0.00015983018,0.00003464094,0.0005260815,0.00011313094,0.0000810377,0.0000063670973],"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.000023048324,0.000118907374,0.000401876,0.000021061856,0.00013125801,0.000041662075,0.00028291298,0.0023379114,0.0011856076,0.045242563,0.049108114,0.9011051],"study_design_scores_gemma":[0.0010253954,0.0001734617,0.019844593,0.000016682045,0.000057305286,0.0002369784,0.00006151869,0.8637421,0.00057234184,0.098279536,0.015765116,0.00022498515],"about_ca_topic_score_codex":0.000018254881,"about_ca_topic_score_gemma":0.000002583654,"teacher_disagreement_score":0.9008801,"about_ca_system_score_codex":0.00001266851,"about_ca_system_score_gemma":0.000013736972,"threshold_uncertainty_score":0.5916832},"labels":[],"label_agreement":null},{"id":"W2126574345","doi":"10.1109/93.978352","title":"Spatial object clustering and buffering","year":2002,"lang":"en","type":"article","venue":"IEEE Multimedia","topic":"Data Management and Algorithms","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 Guelph","funders":"","keywords":"Computer science; Cluster analysis; Object (grammar); Polygon (computer graphics); Spatial analysis; Geographic information system; Data mining; Database; Object-based spatial database; Information retrieval; Data science; Spatial database; Artificial intelligence","score_opus":0.025362723315093275,"score_gpt":0.22610200808944578,"score_spread":0.2007392847743525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126574345","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.019164685,0.00019647044,0.97191423,0.00044830004,0.0020374984,0.00017941507,0.0000042835813,0.0003316996,0.005723398],"genre_scores_gemma":[0.9057815,0.00007342414,0.092910945,0.00017309788,0.00033437106,0.000009262027,0.000002107028,0.000009882675,0.00070537534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992638,0.000014732496,0.000104751976,0.00026369657,0.00014515675,0.00020785927],"domain_scores_gemma":[0.99956226,0.00004062444,0.000028710207,0.0002869423,0.000010340171,0.0000710955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009068326,0.000095997406,0.00009057328,0.00006838266,0.000069366986,0.00019317996,0.0003887528,0.00002474044,0.000049798044],"category_scores_gemma":[0.000014993187,0.000091208814,0.000019883959,0.000113382725,0.000026225773,0.00052830594,0.00025436733,0.00006935891,0.0001621869],"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":[8.5625146e-7,0.000021856502,0.00054061465,0.000013521944,0.0000104926985,0.0000394523,0.00070614874,0.00003067864,0.00064339885,0.000055209333,0.0016900518,0.9962477],"study_design_scores_gemma":[0.0003245336,0.000021830167,0.002609456,0.000011201194,0.000003146698,0.0000056675017,0.000007087786,0.99204403,0.00070014864,0.00003436524,0.004105487,0.00013306239],"about_ca_topic_score_codex":0.00008225718,"about_ca_topic_score_gemma":0.000027544935,"teacher_disagreement_score":0.9961147,"about_ca_system_score_codex":0.000012121481,"about_ca_system_score_gemma":0.0000017994731,"threshold_uncertainty_score":0.37193877},"labels":[],"label_agreement":null},{"id":"W2126593637","doi":"10.1111/j.0016-7363.2005.00676.x","title":"Extending the SAND Spatial Database System for the Visualization of Three‐Dimensional Scientific Data","year":2005,"lang":"en","type":"article","venue":"Geographical Analysis","topic":"Data Management and Algorithms","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":"Western University","funders":"University of California, Davis; U.S. Department of Energy; National Science Foundation","keywords":"Voronoi diagram; Computer science; Data mining; Visualization; Context (archaeology); Spatial analysis; Preprocessor; Spatial database; Scientific visualization; Focus (optics); Spatial query; Database; Information retrieval; Artificial intelligence; Mathematics; Geography; Web search query","score_opus":0.034978365885814294,"score_gpt":0.2849930023201093,"score_spread":0.250014636434295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126593637","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.0030587863,0.00042177876,0.99434173,0.0013727268,0.00022519598,0.00022603464,0.00028500153,0.000046028475,0.0000227332],"genre_scores_gemma":[0.9857057,0.000023550749,0.012702009,0.00008496448,0.00017448922,0.000019997682,0.0012430127,0.000005020758,0.000041267416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821824,0.00006622518,0.00031455356,0.00057370745,0.0006083266,0.0002189267],"domain_scores_gemma":[0.99723023,0.00031008667,0.00016476236,0.0021287866,0.00012005259,0.000046091514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125677,0.00010707492,0.00017682368,0.0003692993,0.000666611,0.00045895242,0.002659865,0.000025202107,0.000022743363],"category_scores_gemma":[0.00006135792,0.0000570897,0.00018190882,0.003318765,0.00021232347,0.00068585546,0.001368055,0.00006110802,0.0000056374815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007067148,0.0006057886,0.033190906,0.00022466897,0.005741926,0.000009138762,0.00018524594,0.022752393,0.00051894767,0.37373546,0.013341613,0.54962325],"study_design_scores_gemma":[0.0001517166,0.00001021828,0.007407671,0.00001021613,0.00086638547,8.6080547e-7,0.000012331111,0.9849793,0.000071625254,0.00016532277,0.0062420755,0.00008229926],"about_ca_topic_score_codex":0.00026373437,"about_ca_topic_score_gemma":0.0007588942,"teacher_disagreement_score":0.9826469,"about_ca_system_score_codex":0.0000073757546,"about_ca_system_score_gemma":0.000017263212,"threshold_uncertainty_score":0.51271003},"labels":[],"label_agreement":null},{"id":"W2127094475","doi":"10.1007/s10115-004-0189-y","title":"Optimizing complex queries based on similarities of subqueries","year":2005,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","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":"IBM (Canada)","funders":"International Business Machines Corporation","keywords":"Computer science; Query optimization; Joins; Key (lock); Similarity (geometry); Information retrieval; Graph; Database; Query expansion; Query language; Data mining; Theoretical computer science; Artificial intelligence","score_opus":0.021749295487071173,"score_gpt":0.24014789906072057,"score_spread":0.2183986035736494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127094475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013277468,0.00050018664,0.7749097,0.00061349076,0.0005396666,0.00035840715,0.00004173606,0.00022561954,0.2214835],"genre_scores_gemma":[0.98399043,0.000043682416,0.015164386,0.00027094953,0.00008545162,0.000019860767,0.00005822731,0.000003390834,0.00036361042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993129,0.00003095977,0.0003197676,0.00007807141,0.00014554815,0.00011279036],"domain_scores_gemma":[0.999452,0.000050795214,0.00012245058,0.0002335932,0.000107567714,0.00003361402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027318968,0.0000906757,0.00014267216,0.00018975743,0.00010140267,0.00030115966,0.00024276682,0.000028128019,0.0000068608992],"category_scores_gemma":[0.000016057998,0.00007848248,0.000023721383,0.00016278359,0.000044742967,0.0047620526,0.000099012876,0.00003777944,0.00004626101],"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.00001665493,0.000068521964,0.00030006646,0.00079844974,0.000026174106,4.8192334e-7,0.010201539,0.004699821,0.000027665166,0.8459261,0.02210415,0.11583037],"study_design_scores_gemma":[0.00021659961,0.00004693391,0.00033528658,0.00005466639,0.0000019374172,8.4933606e-7,0.00040388774,0.5573569,0.00018512894,0.000011694002,0.44130236,0.00008376533],"about_ca_topic_score_codex":0.000009567724,"about_ca_topic_score_gemma":0.0000030991328,"teacher_disagreement_score":0.9826627,"about_ca_system_score_codex":0.00001570091,"about_ca_system_score_gemma":0.000021264008,"threshold_uncertainty_score":0.3452373},"labels":[],"label_agreement":null},{"id":"W2127114148","doi":"10.1109/icde.2011.5767832","title":"Decomposing DAGs into spanning trees: A new way to compress transitive closures","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Winnipeg","funders":"","keywords":"Reachability; Digraph; Transitive closure; Combinatorics; Computer science; Transitive relation; Spanning tree; Graph; Transitive reduction; Mathematics; Directed acyclic graph; Theoretical computer science; Discrete mathematics; Line graph; Voltage graph","score_opus":0.04140842396028783,"score_gpt":0.26187042712011094,"score_spread":0.22046200315982312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127114148","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.0053720255,0.00003921638,0.95762676,0.00065434835,0.0002777189,0.00017059778,0.0000012430647,0.00026104372,0.035597023],"genre_scores_gemma":[0.33552736,0.00000369845,0.6615216,0.0010975618,0.00009350492,0.00000579074,0.000005136778,0.0000110793135,0.0017342324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883956,0.000034377117,0.00018804442,0.00043321264,0.00020796135,0.00029687522],"domain_scores_gemma":[0.99922854,0.00003370199,0.000035454257,0.00047969108,0.000031742533,0.00019085185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016211446,0.00015408575,0.00016055725,0.00015384518,0.00012195101,0.00026997106,0.0011757703,0.000026975562,0.000078821664],"category_scores_gemma":[0.000006722058,0.00013439315,0.00005508411,0.0003386035,0.00002237551,0.0011183263,0.00041468616,0.00007327987,0.00015218809],"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.000027420032,0.00013853773,0.00060801534,0.000016796948,0.00008717683,0.00008679746,0.03404684,0.0000896497,0.0014681548,0.09241893,0.02014695,0.8508647],"study_design_scores_gemma":[0.005711886,0.0021327976,0.116048,0.00076895347,0.00018823009,0.00005237347,0.0051511894,0.47095427,0.107929915,0.053950086,0.2323349,0.0047773956],"about_ca_topic_score_codex":0.0013400267,"about_ca_topic_score_gemma":0.00027493804,"teacher_disagreement_score":0.84608734,"about_ca_system_score_codex":0.000017299306,"about_ca_system_score_gemma":0.000016408874,"threshold_uncertainty_score":0.5480394},"labels":[],"label_agreement":null},{"id":"W2127465748","doi":"10.1109/i-span.2009.98","title":"Recommend Touring Routes to Travelers According to Their Sequential Wandering Behaviours","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Athabasca University","funders":"","keywords":"Computer science; Set (abstract data type); Sequential Pattern Mining; Matching (statistics); Information retrieval; Data mining; Mathematics; Programming language","score_opus":0.035371413579015645,"score_gpt":0.2705757647283549,"score_spread":0.23520435114933924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127465748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11313001,0.00000548686,0.87154907,0.0072248676,0.0004978644,0.00023240437,0.0000033552824,0.00032272725,0.0070342254],"genre_scores_gemma":[0.8986072,0.0000023758753,0.0974242,0.0028244238,0.0001490487,0.0000071122035,0.000005353065,0.000008452305,0.0009718466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987928,0.000016747308,0.00017798894,0.00042523173,0.00017602635,0.0004111748],"domain_scores_gemma":[0.9993659,0.000017764223,0.000027233817,0.00038401393,0.00002030904,0.0001847543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000249587,0.00015623709,0.00013984217,0.00020169783,0.00014386124,0.00065466814,0.0010001136,0.000023385433,0.000026187185],"category_scores_gemma":[0.0000096234,0.00013815294,0.00005491495,0.00040428663,0.0000041486396,0.0009497852,0.00047203322,0.00007832919,0.00005021324],"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.0000040910004,0.000039149567,0.00031447696,0.0000021490227,0.000012985971,0.000019934407,0.0011731912,0.00018694632,0.0022697113,0.003402012,0.0051299245,0.9874454],"study_design_scores_gemma":[0.005961228,0.0042363787,0.10984019,0.0008955998,0.00016843282,0.00013193075,0.015449363,0.28987548,0.43918875,0.012988371,0.11127933,0.009984967],"about_ca_topic_score_codex":0.000057992198,"about_ca_topic_score_gemma":0.000021225922,"teacher_disagreement_score":0.97746044,"about_ca_system_score_codex":0.00005051175,"about_ca_system_score_gemma":0.000010026856,"threshold_uncertainty_score":0.631298},"labels":[],"label_agreement":null},{"id":"W2127782281","doi":"","title":"Catching the best views of skyline: a semantic approach based on decisive subspaces","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":245,"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":"Skyline; Linear subspace; Subspace topology; Computer science; Semantics (computer science); Set (abstract data type); Theoretical computer science; Object (grammar); Space (punctuation); Algorithm; Data mining; Mathematics; Artificial intelligence; Pure mathematics; Programming language","score_opus":0.03357830335054178,"score_gpt":0.27134072372388834,"score_spread":0.23776242037334655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127782281","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.0034229655,0.00007002037,0.9620369,0.0035734056,0.00008923886,0.00021615022,0.0000020350697,0.000048618036,0.030540662],"genre_scores_gemma":[0.58800155,0.000020236454,0.40832672,0.002078846,0.000110234585,0.000016274793,0.0000069842486,0.000007310392,0.0014318562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990354,0.00003688594,0.00018429237,0.000265467,0.00031012975,0.00016781977],"domain_scores_gemma":[0.9989717,0.00015011212,0.0000783744,0.00072761625,0.00003987653,0.00003231172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045127195,0.000105889165,0.00012648599,0.00008450995,0.00008504308,0.00014556744,0.0012321175,0.000017882767,0.000015534604],"category_scores_gemma":[0.000034094286,0.000060322807,0.00005774896,0.00033570075,0.00003178728,0.0003889984,0.00022252875,0.0000783971,0.0000887288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001135055,0.00075233594,0.0005365241,0.000054952907,0.000043849228,0.000006739563,0.0010852744,0.015894422,0.000059133446,0.0981432,0.01932735,0.8640849],"study_design_scores_gemma":[0.0002392533,0.000049514787,0.00030349338,0.000022050177,0.000009570465,0.0000010123908,0.00016424239,0.9811926,0.00040382674,0.0003001938,0.017206503,0.000107725944],"about_ca_topic_score_codex":0.00005429008,"about_ca_topic_score_gemma":0.000056689707,"teacher_disagreement_score":0.9652982,"about_ca_system_score_codex":0.000010439154,"about_ca_system_score_gemma":0.000017750686,"threshold_uncertainty_score":0.24598926},"labels":[],"label_agreement":null},{"id":"W2128207581","doi":"10.1109/cmpsac.1991.170198","title":"Dynamic spatial query language: a customized query language for object-oriented database systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Query language; Object Query Language; RDF query language; Data control language; Object (grammar); Query optimization; Query expansion; Query by Example; Spatial query; Information retrieval; Object-based spatial database; View; Sargable; Database; Spatial database; Programming language; Web search query; Database design; Web query classification; Spatial analysis; Artificial intelligence; Search engine","score_opus":0.0105628418730422,"score_gpt":0.2470393899691693,"score_spread":0.2364765480961271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128207581","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.0052251117,0.0007088894,0.9851484,0.00034278366,0.0014583189,0.00093317044,0.00022251124,0.00069316936,0.0052676895],"genre_scores_gemma":[0.71382254,0.00012382673,0.1920404,0.0013417435,0.00073042145,0.0005715662,0.001629171,0.00010089145,0.089639425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808013,0.00008842364,0.00034676446,0.00063444785,0.00035862322,0.0004916073],"domain_scores_gemma":[0.9983696,0.00014349518,0.0001270104,0.0011771347,0.000057259775,0.00012552904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000446711,0.00024399227,0.0003037237,0.00022677613,0.00013816298,0.0003775561,0.0010325947,0.000060604663,0.00014646718],"category_scores_gemma":[0.00009670524,0.00020762722,0.00011268178,0.00039094157,0.00003452924,0.0011362608,0.0005065401,0.00012437571,0.00031489544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030160334,0.0019157806,0.0002457607,0.0014396172,0.000717277,0.0015513714,0.011761654,0.0003382346,0.009821053,0.13244127,0.36277062,0.47669575],"study_design_scores_gemma":[0.0022379716,0.00006295697,0.00004266026,0.000045852903,0.000028182247,0.000012848623,0.0009147604,0.9820316,0.00026210755,0.00001395597,0.013980414,0.00036667858],"about_ca_topic_score_codex":0.0017145041,"about_ca_topic_score_gemma":0.00032396932,"teacher_disagreement_score":0.9816934,"about_ca_system_score_codex":0.00006576397,"about_ca_system_score_gemma":0.000019851592,"threshold_uncertainty_score":0.8466792},"labels":[],"label_agreement":null},{"id":"W2128277764","doi":"10.1109/icpr.1998.711921","title":"Matching spatial relations using DB-tree for image retrieval","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Tree (set theory); Matching (statistics); Computer science; Image retrieval; Spatial relation; Image (mathematics); Segment tree; K-ary tree; Spatial relationship; Artificial intelligence; Interval tree; Tree structure; Pattern recognition (psychology); Algorithm; Mathematics; Binary tree; Combinatorics","score_opus":0.04019237647552226,"score_gpt":0.2627413511290969,"score_spread":0.22254897465357465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128277764","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.0019197981,0.000011468931,0.98209196,0.0008959664,0.0002996044,0.00015465467,0.0000052978035,0.00014904076,0.014472193],"genre_scores_gemma":[0.067895554,0.000002789757,0.92371583,0.00019489345,0.0001746798,0.000002361648,0.000009308795,0.00000833476,0.007996246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930686,0.000011740489,0.00013281946,0.00022366254,0.00014467059,0.00018027876],"domain_scores_gemma":[0.9995268,0.0000493988,0.00004182119,0.00031514032,0.000030034838,0.000036816982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015142128,0.00007115169,0.00006755469,0.000072730894,0.00018089435,0.00030980952,0.00044260744,0.0000213397,0.00016098986],"category_scores_gemma":[0.000019714129,0.00006599743,0.00004424108,0.00019661122,0.000014097181,0.0012737542,0.00022880425,0.00004811397,0.00013476395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013332634,0.0003158193,0.00031252662,0.00006119366,0.00010186154,0.000056927787,0.0018677745,0.0005180759,0.00786123,0.6057078,0.053969786,0.32921362],"study_design_scores_gemma":[0.0002807494,0.000022365119,0.00016604587,0.000006247053,0.000008630438,0.0000029081252,0.000021335945,0.9825518,0.0005237505,0.009639572,0.006645012,0.00013158067],"about_ca_topic_score_codex":0.000062503284,"about_ca_topic_score_gemma":0.000015442076,"teacher_disagreement_score":0.9820337,"about_ca_system_score_codex":0.000020820951,"about_ca_system_score_gemma":0.000004971684,"threshold_uncertainty_score":0.29875},"labels":[],"label_agreement":null},{"id":"W2128445650","doi":"10.1145/967900.968050","title":"Signature file hierarchies and signature graphs","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Winnipeg","funders":"","keywords":"Computer science; Signature (topology); Hierarchy; Graph; Theoretical computer science; Data structure; Mathematics; Programming language","score_opus":0.006163335959788518,"score_gpt":0.20201633530746868,"score_spread":0.19585299934768016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128445650","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.0055928887,0.002717267,0.8715538,0.016392538,0.0010896127,0.00069609575,0.00022826898,0.001693114,0.10003646],"genre_scores_gemma":[0.3053841,0.000294166,0.67150843,0.006089437,0.00019323459,0.000034536675,0.00023468075,0.00002427084,0.016237177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927557,0.000010355077,0.000075810465,0.0002934651,0.00015863427,0.00018614692],"domain_scores_gemma":[0.9995504,0.00003072544,0.000021961408,0.00031727034,0.00001693503,0.000062726234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066037646,0.000104848295,0.000081180726,0.000108471715,0.00010032675,0.0002628301,0.00056720665,0.000048691207,0.00015412706],"category_scores_gemma":[0.0000107479345,0.00008006996,0.000028578414,0.0003821673,0.000044237553,0.0008152565,0.00037458944,0.00014843515,0.00003455919],"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.0000015113853,0.000038689413,0.000022821772,0.000013226964,0.000018732351,0.000041168387,0.00023319518,0.0000315468,0.00021142492,0.8363343,0.094320394,0.068733014],"study_design_scores_gemma":[0.0016142323,0.00028414585,0.008085157,0.000077251374,0.000017140377,0.000029225903,0.00015257014,0.007291942,0.0031641296,0.7018614,0.27647153,0.0009513043],"about_ca_topic_score_codex":0.000015443255,"about_ca_topic_score_gemma":0.000009528749,"teacher_disagreement_score":0.2997912,"about_ca_system_score_codex":0.0000057191332,"about_ca_system_score_gemma":0.000012213529,"threshold_uncertainty_score":0.32651582},"labels":[],"label_agreement":null},{"id":"W2128759130","doi":"10.3166/isi.14.5.35-58","title":"Base de données de capteurs à localisation mobile Modèle et langage","year":2009,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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; Humanities; Philosophy","score_opus":0.03758550440697143,"score_gpt":0.25080257766455516,"score_spread":0.21321707325758374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128759130","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.035110228,0.00078995456,0.94422257,0.001917232,0.00073769724,0.00046179313,0.00008229972,0.0003018617,0.016376363],"genre_scores_gemma":[0.9359078,0.00043882694,0.057424273,0.0041179964,0.00024322188,0.000064051135,0.00043545527,0.000014359278,0.0013540577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812853,0.00022589667,0.00052171474,0.00020021349,0.00033891798,0.0005847088],"domain_scores_gemma":[0.99885464,0.00007047782,0.00028350254,0.0004589894,0.00016792346,0.00016448459],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015260404,0.00024149515,0.00019751443,0.000257052,0.00030339265,0.0014653959,0.0005917233,0.00014749194,0.000056827826],"category_scores_gemma":[0.00017773868,0.00026604038,0.00008529139,0.00054462376,0.00011811375,0.013355509,0.00014434796,0.00023086321,0.00032644495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016840508,0.00011599152,0.0003082745,0.0003925162,0.000030132122,0.000031146606,0.02614646,0.021557918,0.00012786915,0.19972129,0.012311292,0.7392403],"study_design_scores_gemma":[0.00066349417,0.00033937607,0.0059204027,0.00041842982,0.000042974403,0.00008976506,0.0020799902,0.8824769,0.001436509,0.030418139,0.07561844,0.0004955667],"about_ca_topic_score_codex":0.0006199305,"about_ca_topic_score_gemma":0.0000328502,"teacher_disagreement_score":0.90079755,"about_ca_system_score_codex":0.0004940825,"about_ca_system_score_gemma":0.00020088708,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W2128780455","doi":"10.1109/sitis.2008.31","title":"Core Labeling: A New Way to Compress Transitive Closure","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Winnipeg","funders":"","keywords":"Reachability; Transitive closure; Combinatorics; Graph; Bounded function; Tree (set theory); Computer science; Mathematics; Discrete mathematics","score_opus":0.09017840366944073,"score_gpt":0.27481552004055315,"score_spread":0.1846371163711124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128780455","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.007332431,0.000035808,0.9679785,0.0030974622,0.0002615243,0.0001854423,0.000005930486,0.000267212,0.020835731],"genre_scores_gemma":[0.36642513,0.000044553217,0.56903154,0.007884106,0.00035378593,0.000013139204,0.000030764506,0.000020293883,0.056196716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999125,0.000011543283,0.0001149626,0.00031132778,0.00022027089,0.00021691128],"domain_scores_gemma":[0.9993695,0.000022951912,0.000017439212,0.0004013398,0.00003670809,0.00015203934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007030979,0.000101928716,0.00011338048,0.0000676217,0.00010189291,0.00008090378,0.00084120064,0.00002268681,0.000060235136],"category_scores_gemma":[0.0000058484666,0.00008614167,0.000038389193,0.0003483593,0.000017438058,0.00046431232,0.00022411688,0.00006278452,0.00033323732],"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.000018291496,0.00018184443,0.0010529312,0.00001572171,0.00008039965,0.0003718943,0.006279824,0.00026903747,0.00086292176,0.1942984,0.60187435,0.19469437],"study_design_scores_gemma":[0.0034546617,0.0006720316,0.027017795,0.00008390869,0.00003458207,0.00009751066,0.00027748046,0.15319385,0.007553629,0.006021993,0.8000063,0.0015862826],"about_ca_topic_score_codex":0.00012227037,"about_ca_topic_score_gemma":0.000025738429,"teacher_disagreement_score":0.39894694,"about_ca_system_score_codex":0.000008573853,"about_ca_system_score_gemma":0.000020177025,"threshold_uncertainty_score":0.42832026},"labels":[],"label_agreement":null},{"id":"W2129129103","doi":"10.1109/hpcs.2007.25","title":"Parallel Computation of Skyline Queries","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Skyline; Computer science; Context (archaeology); Set (abstract data type); Property (philosophy); Computation; Data mining; Information retrieval; Data set; Database; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Geography","score_opus":0.017167190101722848,"score_gpt":0.26872648909164093,"score_spread":0.2515592989899181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129129103","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.0017893914,0.000017693827,0.97873235,0.0003019748,0.00010893689,0.00003956099,3.8896093e-7,0.00006996273,0.018939728],"genre_scores_gemma":[0.39256933,0.000004611111,0.6061592,0.0001668937,0.000025475618,4.749198e-7,0.000006572863,0.0000016709691,0.0010657844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957967,0.0000049145224,0.00012123956,0.000096332784,0.00011162137,0.00008625184],"domain_scores_gemma":[0.9997561,0.000019589525,0.00003704178,0.00013926237,0.000028818025,0.000019167452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023823298,0.00003588786,0.00005115425,0.000054065913,0.00001866714,0.000029378425,0.00025921638,0.000009586402,0.00000923531],"category_scores_gemma":[0.000005634349,0.00002991467,0.000015148654,0.00016736196,0.000017901626,0.00039274644,0.00012813698,0.000016875541,0.000020852094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035024436,0.000052727977,0.00063059217,0.000013095244,0.00000988211,0.000006304607,0.0001413057,0.00020060316,0.00010654973,0.68485254,0.0035069592,0.31047598],"study_design_scores_gemma":[0.001808387,0.00038548242,0.10529456,0.00004062926,0.000014742147,0.000008072081,0.0003888943,0.75397295,0.011681111,0.06179669,0.063963465,0.0006450407],"about_ca_topic_score_codex":0.000025128365,"about_ca_topic_score_gemma":0.000013889277,"teacher_disagreement_score":0.7537723,"about_ca_system_score_codex":0.0000033045408,"about_ca_system_score_gemma":0.000004372036,"threshold_uncertainty_score":0.12198848},"labels":[],"label_agreement":null},{"id":"W2130076146","doi":"10.3138/carto.46.3.160","title":"Toward the Spatial and Temporal Management of Documents: The GéoTopia Platform","year":2011,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","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":"Thumbnail; Timeline; Computer science; Search engine indexing; Zoom; Information retrieval; Georeference; World Wide Web; Thematic map; Feature (linguistics); Cartography; Geography; Artificial intelligence","score_opus":0.025317449545030304,"score_gpt":0.2668007782623878,"score_spread":0.2414833287173575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130076146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032700524,0.0003530514,0.95360464,0.008105235,0.0022580852,0.0011343972,0.000034760844,0.0000581037,0.0017511772],"genre_scores_gemma":[0.9950873,0.0020344597,0.0015962078,0.0010410188,0.00008382045,0.000050274022,0.00005954096,0.000004593995,0.00004274967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881864,0.000035402405,0.00045322638,0.000103837265,0.00043854638,0.00015033665],"domain_scores_gemma":[0.9989428,0.000055766828,0.00040195542,0.00021913962,0.00033878165,0.00004156285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010512044,0.000120640594,0.000087710214,0.00027754935,0.00044701432,0.00061051315,0.0010602608,0.000035052115,0.000011453853],"category_scores_gemma":[0.000018881034,0.00006146441,0.00009886826,0.00034552065,0.00019117634,0.0018503248,0.0003313574,0.00011534164,0.0000010722795],"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.000063982996,0.00003390905,0.006607968,0.000044485354,0.0004165512,0.000001408894,0.005387351,0.000013127676,0.0000017347701,0.83434105,0.0009153485,0.1521731],"study_design_scores_gemma":[0.005289871,0.00070297904,0.20894538,0.0003156864,0.00041187453,0.0004077037,0.012707064,0.1314456,0.00021577864,0.23582162,0.40293542,0.00080101925],"about_ca_topic_score_codex":0.00011581595,"about_ca_topic_score_gemma":0.00001747638,"teacher_disagreement_score":0.9623868,"about_ca_system_score_codex":0.0000073858737,"about_ca_system_score_gemma":0.000013168711,"threshold_uncertainty_score":0.5887192},"labels":[],"label_agreement":null},{"id":"W2130696419","doi":"10.1145/1189769.1189774","title":"Towards multidimensional subspace skyline analysis","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":117,"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":"Skyline; Linear subspace; Subspace topology; Computer science; Semantics (computer science); Theoretical computer science; Space (punctuation); Object (grammar); Online analytical processing; Algorithm; Data mining; Mathematics; Artificial intelligence; Pure mathematics; Programming language","score_opus":0.017999956148877616,"score_gpt":0.25174250827514694,"score_spread":0.23374255212626932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130696419","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.0012007792,0.00012988341,0.9949945,0.0008265504,0.00077737856,0.00024357522,0.00075702445,0.000305299,0.000764971],"genre_scores_gemma":[0.75475967,0.00005672727,0.23685196,0.00018517257,0.00025129982,0.00011272143,0.0016106354,0.00002807265,0.0061437422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797577,0.0001000853,0.00035425994,0.0006358626,0.00060827204,0.000325754],"domain_scores_gemma":[0.99727774,0.00010262226,0.0000992791,0.0023437361,0.000075415825,0.00010118339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044213198,0.00021809503,0.00027795904,0.000581536,0.00024892157,0.00021744437,0.0011436949,0.000048204343,0.00006639199],"category_scores_gemma":[0.000013856007,0.00019594686,0.00017784929,0.0018119045,0.000034565805,0.0009259198,0.0000625519,0.00015812159,0.00025346674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015019596,0.005940149,0.0015207926,0.00050385133,0.006224702,0.00092953374,0.0004159285,0.416884,0.0055620763,0.29399687,0.0696414,0.19823052],"study_design_scores_gemma":[0.0013507016,0.00010502368,0.0026034534,0.00007437368,0.00065016805,0.000026055504,0.00011210462,0.86800706,0.0024098342,0.00019709002,0.1236247,0.0008394453],"about_ca_topic_score_codex":0.0029060368,"about_ca_topic_score_gemma":0.0002966779,"teacher_disagreement_score":0.7581426,"about_ca_system_score_codex":0.000054080352,"about_ca_system_score_gemma":0.000035683974,"threshold_uncertainty_score":0.7990481},"labels":[],"label_agreement":null},{"id":"W2131197449","doi":"10.1142/s0218195905001853","title":"ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Data Management and Algorithms","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 New Brunswick; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Range (aeronautics); Mathematics; Combinatorics; Binary logarithm; Tree (set theory); Materials science","score_opus":0.05640688424490003,"score_gpt":0.350634776905452,"score_spread":0.29422789266055194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131197449","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.0010424951,0.00014579686,0.99060136,0.006935548,0.00030789553,0.0003749825,0.00014525068,0.000037149242,0.00040954907],"genre_scores_gemma":[0.24264005,0.000041774725,0.7536202,0.0013662429,0.0014377175,0.00011757786,0.00010499424,0.000015328209,0.0006561021],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998136,0.000028682207,0.00049190124,0.0002458782,0.00091841974,0.00017914656],"domain_scores_gemma":[0.99758905,0.000553778,0.0002963786,0.00020684981,0.0012487043,0.00010525344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390725,0.00013407669,0.00015838355,0.00074783503,0.0001226815,0.00027768087,0.0018648527,0.000039159597,0.000042306096],"category_scores_gemma":[0.000048360125,0.00012709557,0.00016468055,0.00041963934,0.00004449441,0.0008041879,0.00016590428,0.00016094572,0.00012591713],"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.000040301165,0.0006268938,0.00010067944,0.000011161073,0.00023203934,0.0000038533894,0.00008224202,0.07932038,0.000041064373,0.27076557,0.0060648085,0.642711],"study_design_scores_gemma":[0.005690303,0.0003378201,0.011919236,0.00008045663,0.00005067983,0.00010919056,0.00006919908,0.32718346,0.0007386674,0.081101395,0.5721415,0.0005780476],"about_ca_topic_score_codex":0.0000015794235,"about_ca_topic_score_gemma":0.0000012537815,"teacher_disagreement_score":0.64213294,"about_ca_system_score_codex":0.0001190612,"about_ca_system_score_gemma":0.00010058439,"threshold_uncertainty_score":0.5182807},"labels":[],"label_agreement":null},{"id":"W2131209872","doi":"10.1109/icdew.2010.5452725","title":"Graphical models for dependencies and queries in uncertain data","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Conjunctive query; Hypergraph; Dependency (UML); Graphical model; Relational database; Probabilistic logic; Probabilistic database; Dependency theory (database theory); Functional dependency; Theoretical computer science; Uncertain data; Relational model; Query optimization; Data mining; Information retrieval; Database theory; Artificial intelligence; Mathematics","score_opus":0.06086420917569164,"score_gpt":0.29119215558275907,"score_spread":0.23032794640706744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131209872","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.0046608266,0.000022537613,0.991599,0.0018439959,0.00015418966,0.00013746908,0.000023399292,0.00005998607,0.0014985866],"genre_scores_gemma":[0.33908418,0.000039100876,0.6596951,0.00036920622,0.00004464147,0.000021800897,0.000064570355,0.0000046856185,0.0006767408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993819,0.000006835259,0.00008532296,0.00029723745,0.00009095419,0.0001377426],"domain_scores_gemma":[0.9992554,0.000059328977,0.000013236187,0.0006273721,0.000012988018,0.00003163923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033764035,0.000056527,0.000065657536,0.00006807776,0.00004258784,0.00020586234,0.0010602053,0.00002578015,0.0000043329737],"category_scores_gemma":[0.000030916217,0.00004485416,0.000007816687,0.00012744471,0.00004499113,0.0019101363,0.0009536968,0.000058131744,0.0000010036593],"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.00000160193,0.00001567304,0.00040288153,0.0000076202073,0.000002917463,0.0000026983012,0.000059460825,0.0000069386633,0.0000665186,0.96130276,0.0025724298,0.0355585],"study_design_scores_gemma":[0.00017381781,0.0000145363265,0.0004671545,0.0000020474124,0.0000014352252,0.0000017987301,0.000039228467,0.85955393,0.000043121807,0.12967154,0.009946608,0.000084752355],"about_ca_topic_score_codex":0.0001155631,"about_ca_topic_score_gemma":0.0017380759,"teacher_disagreement_score":0.859547,"about_ca_system_score_codex":0.0000013369905,"about_ca_system_score_gemma":0.000012991907,"threshold_uncertainty_score":0.19851352},"labels":[],"label_agreement":null},{"id":"W2131795689","doi":"10.1109/mdm.2008.34","title":"Mobile User Profile Acquisition through Network Observables and Explicit User Queries","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Focus (optics); Set (abstract data type); sort; Service (business); Mobile device; User profile; Mobile phone; Ask price; World Wide Web; Phone; Recommender system; Human–computer interaction; Information retrieval; Telecommunications","score_opus":0.025683388428905655,"score_gpt":0.23483874456364917,"score_spread":0.2091553561347435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131795689","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.08518764,0.0007738589,0.88972336,0.0004975912,0.00053294085,0.0006587308,0.0000107637625,0.0006821906,0.021932907],"genre_scores_gemma":[0.11703348,0.0014156578,0.8206781,0.0034111273,0.00057379174,0.00029412008,0.00009965199,0.00002967094,0.0564644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900746,0.00002629248,0.00014797878,0.00035775977,0.00018037691,0.0002801346],"domain_scores_gemma":[0.99939305,0.00002761486,0.000043560187,0.00045743946,0.000033840082,0.000044486384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010072882,0.00013022963,0.00012975198,0.000022611135,0.00025850895,0.00020189225,0.00043191676,0.000036645783,0.00015253913],"category_scores_gemma":[0.0000030524927,0.000107682325,0.000027374632,0.00026802343,0.00004989275,0.0028042733,0.0005290998,0.000049627863,0.00009585753],"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.000011193038,0.00012175547,0.013690156,0.000043354103,0.00005025819,0.00006390827,0.0017233746,0.00022276444,0.00013668883,0.48282424,0.4912323,0.009880011],"study_design_scores_gemma":[0.00069985987,0.00032029193,0.020971438,0.000045345656,0.000014404594,0.000036555397,0.00029125722,0.021759886,0.0022543445,0.009084056,0.9438456,0.0006769237],"about_ca_topic_score_codex":0.00007623951,"about_ca_topic_score_gemma":0.000009360241,"teacher_disagreement_score":0.4737402,"about_ca_system_score_codex":0.000009625006,"about_ca_system_score_gemma":0.000012435757,"threshold_uncertainty_score":0.43911576},"labels":[],"label_agreement":null},{"id":"W2131811358","doi":"10.37236/2541","title":"Common Edges in Rooted Trees and Polygonal Triangulations","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"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":"Mathematics; Combinatorics; Rotation (mathematics); Polygon mesh; Computation; Subdivision; Enhanced Data Rates for GSM Evolution; Time complexity; Distribution (mathematics); Similarity (geometry); Geometry; Algorithm; Computer science; Image (mathematics); Mathematical analysis","score_opus":0.008062309830648522,"score_gpt":0.22125009576519425,"score_spread":0.21318778593454574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131811358","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.80731165,0.0072688297,0.16571067,0.017249571,0.00071392336,0.0003639654,8.7203927e-7,0.000041076244,0.0013394209],"genre_scores_gemma":[0.9992716,0.00028264386,0.00008935847,0.000070769776,0.00003977729,0.0000022035008,6.1604163e-7,0.0000041536114,0.00023889427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990616,0.0000914106,0.00026365777,0.00008007011,0.0002202207,0.0002830331],"domain_scores_gemma":[0.99938065,0.00013241195,0.0001720571,0.00021072928,0.00006280557,0.00004132627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062800164,0.000080394995,0.00014924115,0.00015264895,0.00007896236,0.00016436836,0.0007837098,0.000024040388,0.0000065218173],"category_scores_gemma":[0.000028699997,0.000053954354,0.00003681301,0.00044920022,0.000031867283,0.00074388593,0.00013949742,0.00031038985,0.0000053224194],"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.0000037766542,0.00009246298,0.0015687892,0.0000023698155,0.000030590094,0.0000043145737,0.00018724604,0.00003330946,0.00005357775,0.95582503,0.0011820595,0.041016478],"study_design_scores_gemma":[0.0012600649,0.0003160561,0.06751017,0.000017819693,0.000016214319,0.00005841531,0.0000752113,0.013463387,0.00014486595,0.91412324,0.0028945592,0.0001200109],"about_ca_topic_score_codex":0.00003262083,"about_ca_topic_score_gemma":0.000025680416,"teacher_disagreement_score":0.19195992,"about_ca_system_score_codex":0.0000730925,"about_ca_system_score_gemma":0.00008307662,"threshold_uncertainty_score":0.22001947},"labels":[],"label_agreement":null},{"id":"W2132611668","doi":"10.1109/icpr.2006.879","title":"Object Localization Based on Directional Information: Case of 2D Raster Data","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Raster graphics; Object (grammar); Computer science; Raster data; Space (punctuation); Algorithm; Spatial analysis; Artificial intelligence; Image (mathematics); Computer vision; Theoretical computer science; Mathematics","score_opus":0.017476329888502912,"score_gpt":0.23910420837921367,"score_spread":0.22162787849071075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132611668","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.000113209346,0.0000022516858,0.96429425,0.00018044045,0.00016299482,0.000067080495,0.000030422887,0.000063523185,0.035085823],"genre_scores_gemma":[0.8395028,0.000001949192,0.15421702,0.0020703112,0.00018307012,0.00000835493,0.0022757566,0.0000062613776,0.0017344849],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946505,0.000015528056,0.00015636234,0.0001231122,0.00017081083,0.00006913962],"domain_scores_gemma":[0.999287,0.000027868498,0.00005427361,0.0005763571,0.000041939456,0.000012566028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016906393,0.00005122245,0.00004768057,0.000108454544,0.000047571004,0.00012170895,0.0004112713,0.000013900364,0.000062886545],"category_scores_gemma":[0.000010457472,0.00004275951,0.000011417676,0.00026989955,0.0000127151425,0.0022615537,0.00020634774,0.000021049827,0.000049416714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024287372,0.0004264791,0.0027832347,0.00010887457,0.000028783168,0.00010681564,0.000094703566,0.04329449,0.00001493265,0.15996067,0.48291796,0.31023878],"study_design_scores_gemma":[0.0002122906,0.00002199783,0.00044413438,0.0000050859485,0.000002618955,0.000011009681,0.000007545249,0.96788615,0.00024718887,0.00017595521,0.030928383,0.000057610596],"about_ca_topic_score_codex":0.00020162557,"about_ca_topic_score_gemma":0.000034527784,"teacher_disagreement_score":0.9245917,"about_ca_system_score_codex":0.000008673066,"about_ca_system_score_gemma":0.000017016415,"threshold_uncertainty_score":0.17436822},"labels":[],"label_agreement":null},{"id":"W2132671464","doi":"","title":"Aspects of metric spaces in computation","year":2008,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Data Management and Algorithms","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; University of Waterloo","keywords":"Metric space; Equidistant; Metric (unit); Mathematics; Similarity (geometry); Set (abstract data type); Curse of dimensionality; Space (punctuation); Constraint (computer-aided design); Theoretical computer science; Search engine indexing; Nearest neighbor search; Computer science; Discrete mathematics; Data mining; Information retrieval; Artificial intelligence; Geometry; Statistics","score_opus":0.012183718721649289,"score_gpt":0.2075819277995772,"score_spread":0.19539820907792793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132671464","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.9890511,0.00020865061,0.004179415,0.0003101024,0.0004525809,0.00028815784,0.0000165717,0.00006796457,0.005425468],"genre_scores_gemma":[0.7162455,0.0010265707,0.054140527,0.000013994128,0.000039865765,4.805136e-7,0.00102083,0.00002780933,0.22748445],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99895227,0.000045142155,0.00013503362,0.00033720347,0.00035715633,0.00017318397],"domain_scores_gemma":[0.99919313,0.000035193872,0.00033155712,0.00029141235,0.000109732755,0.000039001705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012238056,0.0001521669,0.00033767155,0.0011383521,0.00005994712,0.000025711823,0.00088583725,0.00011237272,0.000015433878],"category_scores_gemma":[0.000009332706,0.00018424493,0.000092128976,0.0010860609,0.00004330905,0.0006914591,0.00015408381,0.00012712425,0.000022419299],"study_design_candidate":"qualitative","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.00032483897,0.0017095632,0.0044294223,0.0038404474,0.0008032327,0.0014913452,0.5983264,0.0040908493,0.002802675,0.061011195,0.019057676,0.30211234],"study_design_scores_gemma":[0.010098222,0.0018652367,0.43912622,0.0024060537,0.00052518945,0.000020839068,0.3367494,0.17458604,0.012687407,0.012897843,0.0050015855,0.0040359334],"about_ca_topic_score_codex":0.017364886,"about_ca_topic_score_gemma":0.014733807,"teacher_disagreement_score":0.4346968,"about_ca_system_score_codex":0.000043371925,"about_ca_system_score_gemma":0.00006342861,"threshold_uncertainty_score":0.98917854},"labels":[],"label_agreement":null},{"id":"W2132707173","doi":"10.1109/ccece.2003.1226258","title":"Maintaining quality of service for adaptive mobile map clients","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Heuristics; Proxy (statistics); Set (abstract data type); Proxy server; Quality of experience; Generalization; Data mining; Quality of service; Real-time computing; Database; Computer network; Machine learning; Operating system","score_opus":0.05211768313122967,"score_gpt":0.3164084153244743,"score_spread":0.2642907321932446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132707173","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.005452768,0.000010107975,0.98947084,0.0005548262,0.00017169642,0.0002964085,0.000014596769,0.00007378541,0.003954991],"genre_scores_gemma":[0.4504079,0.0000019493461,0.54746515,0.001216968,0.000048662958,0.000059335245,0.000020516827,0.000006001377,0.0007735239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.000015599811,0.00019118113,0.00022782254,0.00015820043,0.00016658264],"domain_scores_gemma":[0.9994024,0.00004646568,0.00008125138,0.00035202212,0.000082515515,0.000035335102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003996575,0.00006763999,0.00010996788,0.000041646417,0.000045284192,0.00004404903,0.0006621335,0.000018171077,0.000012921451],"category_scores_gemma":[0.000008388226,0.00005956453,0.00004041649,0.00018111973,0.000013019367,0.000523419,0.0003430056,0.000028183362,0.000035509125],"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.00001141837,0.00010178588,0.000078863166,0.000037989514,0.000021754086,8.233074e-7,0.00037595798,0.0008973606,0.000082027975,0.97880447,0.00033711037,0.01925046],"study_design_scores_gemma":[0.01388256,0.0026582258,0.012616517,0.00027398803,0.000060104157,0.0000030635135,0.007498855,0.2933194,0.022947663,0.58364624,0.061105605,0.0019877756],"about_ca_topic_score_codex":0.00021799198,"about_ca_topic_score_gemma":0.000051119212,"teacher_disagreement_score":0.4449551,"about_ca_system_score_codex":0.000021886535,"about_ca_system_score_gemma":0.000021233382,"threshold_uncertainty_score":0.24289711},"labels":[],"label_agreement":null},{"id":"W2133246278","doi":"10.14778/1453856.1453895","title":"Efficient search for the top-k probable nearest neighbors in uncertain databases","year":2008,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":149,"is_retracted":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; Data mining; Query optimization; Online aggregation; k-nearest neighbors algorithm; Query language; Semantics (computer science); Information retrieval; Sargable; Object (grammar); Point (geometry); Database; Feature (linguistics); Web query classification; Web search query; Search engine; Artificial intelligence","score_opus":0.05346318793657699,"score_gpt":0.2715280562480217,"score_spread":0.21806486831144467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133246278","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.8509537,0.0015126504,0.086007655,0.03346977,0.0020813877,0.012464797,0.0001696182,0.00037549614,0.012964948],"genre_scores_gemma":[0.9737758,0.00007928286,0.02437377,0.00032936386,0.00009826134,0.00029222222,0.000005310293,0.000014743215,0.0010312637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985974,0.0000072163457,0.00023198513,0.00033261336,0.00046923594,0.00036157123],"domain_scores_gemma":[0.9993073,0.000115224175,0.00010003809,0.00033559575,0.0001031643,0.000038678783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064528687,0.00012818976,0.00013612416,0.00008646279,0.00026629298,0.00009554292,0.0018695262,0.000015520287,0.000005675796],"category_scores_gemma":[0.00006846619,0.00007130609,0.000069953276,0.00061238057,0.000105564766,0.00026189876,0.0011306361,0.00010584273,0.0000052425244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015794214,0.001646169,0.079070285,0.0006771564,0.00019514376,0.000008744637,0.006120609,0.024638068,0.0039788214,0.796243,0.04499962,0.042264413],"study_design_scores_gemma":[0.004220396,0.00039027887,0.047064595,0.0004220211,0.00006859218,0.000025807754,0.0015280664,0.7831204,0.0797512,0.0029186045,0.079629876,0.0008601595],"about_ca_topic_score_codex":0.00019713363,"about_ca_topic_score_gemma":0.0000070675205,"teacher_disagreement_score":0.7933244,"about_ca_system_score_codex":0.00006247049,"about_ca_system_score_gemma":0.000044956945,"threshold_uncertainty_score":0.3474076},"labels":[],"label_agreement":null},{"id":"W2133443743","doi":"10.1007/s10619-007-7023-y","title":"PnP: sequential, external memory, and parallel iceberg cube computation","year":2008,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Management and Algorithms","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":"Dalhousie University; Concordia University; Carleton University","funders":"","keywords":"Computer science; Speedup; Cube (algebra); Scalability; Iceberg; Auxiliary memory; Data cube; Computation; Parallel computing; Pruning; Data structure; Algorithm; Data mining; Mathematics; Computer hardware; Database; Operating system; Geology; Combinatorics","score_opus":0.04727396136730296,"score_gpt":0.2760956854569131,"score_spread":0.22882172408961013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133443743","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.041886166,0.001140817,0.9545969,0.0004329301,0.00020024908,0.00019887694,0.0010909612,0.0001673793,0.00028575285],"genre_scores_gemma":[0.74035126,0.005464917,0.23731446,0.0009589551,0.00036657625,0.00005946828,0.0146716805,0.00003293827,0.0007797514],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848604,0.000070443,0.00026349624,0.0005626366,0.0002832551,0.00033413433],"domain_scores_gemma":[0.99917185,0.00008473512,0.00011028121,0.0004099729,0.00004919726,0.00017398731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016939739,0.00022641168,0.00022409447,0.00008228196,0.00041348638,0.0002446251,0.0004155506,0.00003402287,0.000022340215],"category_scores_gemma":[0.000028328572,0.00020953867,0.000040012415,0.0002175629,0.00015700297,0.0015384245,0.0006129684,0.00011596903,0.00003155679],"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.00038052376,0.0016845751,0.055490673,0.0006750182,0.00071272097,0.0041466407,0.0019918233,0.006216718,0.0012367553,0.20905465,0.45695254,0.26145735],"study_design_scores_gemma":[0.0084101865,0.00044308926,0.18302725,0.0003155707,0.0001950985,0.0013415226,0.00041528002,0.59273577,0.0005218074,0.005567924,0.20428382,0.0027427063],"about_ca_topic_score_codex":0.00025912447,"about_ca_topic_score_gemma":0.000025693882,"teacher_disagreement_score":0.7172824,"about_ca_system_score_codex":0.0000123872605,"about_ca_system_score_gemma":0.000029596202,"threshold_uncertainty_score":0.85447395},"labels":[],"label_agreement":null},{"id":"W2133623058","doi":"10.14778/1687627.1687729","title":"Creating competitive products","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Skyline; Dominance (genetics); Set (abstract data type); Computer science; Competitive advantage; Data mining; Business; Marketing","score_opus":0.011451827037985965,"score_gpt":0.21806801338273515,"score_spread":0.20661618634474918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133623058","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.0867401,0.0004020935,0.0070993854,0.051812388,0.0013743496,0.0025361546,0.000012823213,0.0006803196,0.8493424],"genre_scores_gemma":[0.96070087,0.000018310699,0.03717291,0.0004861972,0.0001053931,0.000011153128,8.573751e-7,0.0000043009763,0.0015000242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999026,0.0000034098975,0.00017259421,0.00027204995,0.0003251069,0.00020086336],"domain_scores_gemma":[0.9994711,0.000011241229,0.00016139884,0.00018852585,0.00013724144,0.000030451916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024950027,0.00010425088,0.00011615428,0.000052560685,0.00012661799,0.00014150384,0.0012662322,0.000013669468,0.0000040257964],"category_scores_gemma":[0.000067928435,0.00007003898,0.00004455069,0.00040223324,0.0000314223,0.00061087083,0.00045613572,0.00007286852,0.0000099921745],"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.0000037080583,0.00012890398,0.0004104213,0.000034790715,0.000019277337,5.602468e-7,0.00066260796,0.0000028430006,0.015575308,0.94460124,0.0043198233,0.0342405],"study_design_scores_gemma":[0.001422418,0.00062235224,0.03279612,0.00046533026,0.00006334319,0.000022001888,0.00080787245,0.006621058,0.8368195,0.06675237,0.052922327,0.00068528636],"about_ca_topic_score_codex":0.0000065727495,"about_ca_topic_score_gemma":1.5630096e-7,"teacher_disagreement_score":0.87784886,"about_ca_system_score_codex":0.000028885672,"about_ca_system_score_gemma":0.000011220066,"threshold_uncertainty_score":0.28561068},"labels":[],"label_agreement":null},{"id":"W2133735693","doi":"10.5267/j.msl.2012.03.007","title":"A new weighted fuzzy grammar on object oriented database queries","year":2012,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Data Management and Algorithms","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":"Computer science; Object (grammar); Database; Grammar; Fuzzy logic; Information retrieval; Programming language; Data mining; Artificial intelligence; Linguistics","score_opus":0.012793631825862621,"score_gpt":0.23719592732618044,"score_spread":0.22440229550031782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133735693","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.012130821,0.00003823112,0.93898755,0.013225313,0.0032105253,0.00069062447,0.000008187478,0.00063616625,0.031072592],"genre_scores_gemma":[0.24014601,0.0000779683,0.71197754,0.03867166,0.00094002817,0.000116208954,0.0001040104,0.00005301771,0.007913541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963054,0.00005119271,0.0002661688,0.0008787148,0.0013230126,0.0011755171],"domain_scores_gemma":[0.99781907,0.000033306773,0.00011866638,0.001647419,0.00001625831,0.00036528314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012047252,0.00029038382,0.00017288675,0.00075223396,0.0005061088,0.00074009004,0.002996823,0.000020437354,0.000050454873],"category_scores_gemma":[0.00002398614,0.00025306025,0.000066218905,0.0028049166,0.0002608471,0.0055152387,0.0018874499,0.00014973048,0.0007210594],"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.000013518545,0.00016508273,0.0026392306,0.00003821496,0.000047000103,0.000085361266,0.0004849107,0.000020195932,0.001446241,0.73746926,0.13806129,0.11952971],"study_design_scores_gemma":[0.0021120468,0.00022666976,0.042383794,0.000167972,0.00009113901,0.000013096933,0.00046366325,0.008926432,0.0054858765,0.0021209924,0.93613315,0.0018751528],"about_ca_topic_score_codex":0.00007287413,"about_ca_topic_score_gemma":0.0000031196328,"teacher_disagreement_score":0.79807186,"about_ca_system_score_codex":0.00013172152,"about_ca_system_score_gemma":0.000015614874,"threshold_uncertainty_score":0.9999922},"labels":[],"label_agreement":null},{"id":"W2134150651","doi":"10.1068/a3722","title":"Reliability of Sequence-Alignment Analysis of Social Processes: Monte Carlo Tests of Clustalg Software","year":2006,"lang":"en","type":"article","venue":"Environment and Planning A Economy and Space","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"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; St. Mary's University; Canada Mortgage and Housing Corporation","funders":"","keywords":"Computer science; Sequence (biology); Set (abstract data type); Reliability (semiconductor); Software; Data mining; Event (particle physics); Matching (statistics); Monte Carlo method; Theoretical computer science; Algorithm; Mathematics; Statistics; Biology","score_opus":0.011528319454089048,"score_gpt":0.21570735415246117,"score_spread":0.20417903469837212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134150651","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.9670618,0.0004601409,0.031459592,0.00015748652,0.00001820026,0.00013727654,0.00006549394,0.000013799879,0.0006261851],"genre_scores_gemma":[0.9913306,0.00005071585,0.00832845,0.000010581051,0.0000130904555,0.000005307249,0.000019261444,0.0000026070659,0.00023933654],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992405,0.000022545986,0.00025400822,0.00026639947,0.00009849571,0.000118030606],"domain_scores_gemma":[0.9994662,0.0000761178,0.00023024736,0.00018805747,0.000012201715,0.000027220047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023626843,0.00010275147,0.0002820934,0.00010888243,0.00005624337,0.00002417611,0.00015466868,0.000035969082,0.000008322854],"category_scores_gemma":[0.0000104143455,0.00009672676,0.000044502114,0.00016501572,0.00012322367,0.00028886728,0.0001711884,0.000038889546,2.743379e-7],"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.000034385394,0.00028698373,0.95459443,0.0006740994,0.0004940996,0.000009704212,0.005938096,0.026275404,0.00022099646,0.004026155,0.00076574704,0.0066798856],"study_design_scores_gemma":[0.0011077145,0.0003513779,0.90675634,0.0001019055,0.0007217388,0.0000017163596,0.0015323586,0.07275319,0.0015272181,0.002854253,0.011664803,0.0006273935],"about_ca_topic_score_codex":0.00014370376,"about_ca_topic_score_gemma":0.000008278729,"teacher_disagreement_score":0.047838114,"about_ca_system_score_codex":0.000015061957,"about_ca_system_score_gemma":0.000012471276,"threshold_uncertainty_score":0.3944403},"labels":[],"label_agreement":null},{"id":"W2134161546","doi":"10.1007/s10707-005-4576-7","title":"Continuous Query Processing of Spatio-Temporal Data Streams in PLACE","year":2005,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":112,"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; Scalability; Spatial query; Data stream mining; Variety (cybernetics); Query language; Global Positioning System; Temporal database; Sliding window protocol; Semantics (computer science); Database; Distributed computing; Window (computing); Web search query; Web query classification; Data mining; Information retrieval; Operating system; Search engine; Artificial intelligence; Programming language","score_opus":0.019862812702019037,"score_gpt":0.2529512089406807,"score_spread":0.23308839623866165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134161546","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.07240374,0.00034209286,0.83838004,0.0039184242,0.00034484573,0.0010328421,0.00015348039,0.00045676072,0.08296779],"genre_scores_gemma":[0.6926134,0.00001875248,0.30580658,0.00032648406,0.00007165219,0.000008017111,0.0004709648,0.0000073224087,0.0006767943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989293,0.000013178231,0.00042707828,0.00015640099,0.00024862777,0.0002253917],"domain_scores_gemma":[0.99888045,0.000026770716,0.00017459685,0.00084979495,0.00002832389,0.000040069637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045138516,0.000093847724,0.00016103184,0.00012725416,0.0000346394,0.00016303676,0.0015274913,0.000025882766,0.000026320411],"category_scores_gemma":[0.000029452776,0.000083842184,0.000015073658,0.00029169326,0.000031311807,0.00475447,0.0008895231,0.00007689879,0.000083872466],"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.000005276937,0.00007203919,0.0012981966,0.00012378667,0.0000067569167,0.0000046430255,0.0014480113,0.00022078122,7.107738e-7,0.0031865668,0.008885921,0.9847473],"study_design_scores_gemma":[0.00038478588,0.000024586589,0.0007021584,0.000071499824,0.000003572743,0.0000036492888,0.00022830623,0.9380546,0.0000390476,0.00014498112,0.060218252,0.00012455299],"about_ca_topic_score_codex":0.000077132405,"about_ca_topic_score_gemma":0.00016292687,"teacher_disagreement_score":0.9846228,"about_ca_system_score_codex":0.000016765101,"about_ca_system_score_gemma":0.0000632593,"threshold_uncertainty_score":0.34468758},"labels":[],"label_agreement":null},{"id":"W2134820668","doi":"10.1002/asi.10344","title":"Spatialization of Web sites using a weighted frequency model of navigation data","year":2003,"lang":"en","type":"article","venue":"Journal of the American Society for Information Science and Technology","topic":"Data Management and Algorithms","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":"St. Francis Xavier University; McMaster University","funders":"","keywords":"Spatialization; A priori and a posteriori; Computer science; Probabilistic logic; Information geometry; Metric (unit); Sensitivity (control systems); Data mining; Artificial intelligence; Algorithm; Mathematics; Geometry; Curvature","score_opus":0.036770052962693076,"score_gpt":0.2922916368838619,"score_spread":0.2555215839211688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134820668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33712974,0.00001899256,0.6621255,0.0005018825,0.000057188357,0.00009120755,0.000018005107,0.000007929492,0.000049533006],"genre_scores_gemma":[0.7029041,0.000051779596,0.29693955,0.000095344105,0.0000038368166,5.719688e-7,0.0000025192476,0.000001037278,0.000001263957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907607,0.000008781126,0.00038113,0.00007234937,0.00036388045,0.000097810385],"domain_scores_gemma":[0.99750406,0.000021700012,0.0013394558,0.000371278,0.0007462964,0.000017235168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011915102,0.00004824009,0.00013263868,0.0002215302,0.00013125037,0.000050839924,0.0012578357,0.000021460792,2.370801e-7],"category_scores_gemma":[0.00023244297,0.000033480297,0.00004567855,0.0022562637,0.0006765151,0.004383247,0.0002715675,0.00005838272,8.357182e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012592791,0.00011965292,0.01064972,0.00018688593,0.0001362045,1.5711805e-7,0.0028855337,0.0025943378,0.23512074,0.5666509,0.0018922213,0.179751],"study_design_scores_gemma":[0.00020343452,0.00007786405,0.000066918976,0.000022442615,0.000018236731,0.000010336051,0.00081650144,0.9806838,0.0077112615,0.009910174,0.0004321001,0.000046951638],"about_ca_topic_score_codex":0.000005269908,"about_ca_topic_score_gemma":2.5198264e-7,"teacher_disagreement_score":0.97808945,"about_ca_system_score_codex":0.000029424573,"about_ca_system_score_gemma":0.00029311946,"threshold_uncertainty_score":0.3177748},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2134971776","doi":"10.1109/ideas.2000.880582","title":"Query result size estimation using the Trapezoidal Attribute Cardinality Map","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Cardinality (data modeling); Histogram; Function (biology); Probability density function; Query optimization; Computer science; Algorithm; Density estimation; Estimation; Heuristic; Mathematics; Mathematical optimization; Data mining; Image (mathematics); Artificial intelligence; Statistics","score_opus":0.05725909767975521,"score_gpt":0.2640166818967036,"score_spread":0.20675758421694837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134971776","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.0032726724,0.0000663801,0.9862904,0.0052129296,0.00038494993,0.000141733,0.000007265471,0.00016998284,0.004453686],"genre_scores_gemma":[0.7388908,0.000019741434,0.25235152,0.0011778272,0.00021922008,0.000008773202,0.000010896121,0.000008957051,0.007312251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904823,0.00006768316,0.00016413479,0.0002522785,0.00026516174,0.00020253606],"domain_scores_gemma":[0.9991765,0.00010088636,0.000052970907,0.0005989317,0.000034344914,0.000036342113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045482733,0.00009094864,0.00008846399,0.000026284803,0.00020306867,0.00038122231,0.00072418293,0.000024079516,0.000056548823],"category_scores_gemma":[0.000042393825,0.000060947248,0.000054880496,0.00027828082,0.000034958615,0.0009815146,0.0002595719,0.00007724885,0.00010445654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009203575,0.000278041,0.0015978325,0.000082795006,0.00018776755,0.00008623538,0.0014698873,0.007641364,0.0004136344,0.1383934,0.21218646,0.63765335],"study_design_scores_gemma":[0.00017378328,0.000013411168,0.0016521678,0.0000060869993,0.000011577269,0.000004872804,0.00003036856,0.9826814,0.00021064997,0.0010048848,0.014089967,0.000120811535],"about_ca_topic_score_codex":0.00010915339,"about_ca_topic_score_gemma":0.000005226233,"teacher_disagreement_score":0.9750401,"about_ca_system_score_codex":0.000027902417,"about_ca_system_score_gemma":0.0000059994222,"threshold_uncertainty_score":0.36761355},"labels":[],"label_agreement":null},{"id":"W2135362144","doi":"10.1109/icpp.2006.5","title":"A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Voronoi diagram; Hausdorff space; Algorithm; Computer science; Parallel algorithm; Diagram; Hausdorff distance; Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence; Geometry","score_opus":0.01095114095527749,"score_gpt":0.22522925614175776,"score_spread":0.21427811518648027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135362144","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.000056464087,0.00004920984,0.9896984,0.0014778397,0.00039518718,0.0004510492,0.000016221695,0.00038488983,0.0074707028],"genre_scores_gemma":[0.0024366975,0.000008670118,0.96869534,0.00058234145,0.00029353704,0.00013549165,0.0001367826,0.00001359679,0.027697517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986674,0.0000251092,0.00023016072,0.00045469322,0.00021015298,0.0004124447],"domain_scores_gemma":[0.9991497,0.00008093278,0.00006247477,0.0005875763,0.000051361472,0.0000679595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032260286,0.00016822766,0.00016367814,0.000083684274,0.00016005045,0.00038315365,0.0009976518,0.000040186893,0.000030090257],"category_scores_gemma":[0.000011873269,0.00014126804,0.00010498183,0.00025128014,0.000037803613,0.0008345576,0.000307626,0.000060148537,0.00011546319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016622203,0.00010863561,0.000028613667,0.0000061968944,0.000014594335,0.000009862309,0.000018829993,0.000029462242,0.000011486183,0.21818854,0.098166294,0.68341583],"study_design_scores_gemma":[0.0010058755,0.00007819708,0.00034903357,0.0000036862305,0.000009146641,0.0000021328026,0.000013750883,0.7808715,0.000107673455,0.022369295,0.19493085,0.00025882563],"about_ca_topic_score_codex":0.00020974198,"about_ca_topic_score_gemma":0.00007151708,"teacher_disagreement_score":0.78084207,"about_ca_system_score_codex":0.000020035168,"about_ca_system_score_gemma":0.000017445509,"threshold_uncertainty_score":0.57607436},"labels":[],"label_agreement":null},{"id":"W2135472213","doi":"10.1109/icdar.1995.602012","title":"Four directional adjacency graphs (FDAG) and their application in locating fields in forms","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adjacency list; Computer science; Adjacency matrix; Horizontal and vertical; Graph; Theoretical computer science; Mathematics; Algorithm; Geometry","score_opus":0.01908069347569015,"score_gpt":0.21079948447227598,"score_spread":0.19171879099658584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135472213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051460497,0.00015952493,0.91623056,0.001772153,0.00008356552,0.00022410353,8.662839e-7,0.000093712544,0.029975029],"genre_scores_gemma":[0.9894684,0.00007148003,0.009789929,0.00019193807,0.00001265128,0.000028255341,0.000002443049,0.0000021177548,0.0004327943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948007,0.00000983242,0.00011771581,0.00020432512,0.000066521105,0.00012156252],"domain_scores_gemma":[0.99974465,0.000032221342,0.000023540813,0.00017185802,0.000008121299,0.00001960041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015176213,0.000059075443,0.000057818514,0.0001288635,0.000032255382,0.000064759224,0.00023384174,0.000023538003,0.0000150412925],"category_scores_gemma":[0.0000077727045,0.000045788474,0.000011240985,0.00039386423,0.000009943223,0.0005908883,0.00013216294,0.000063745225,0.00001057969],"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":[5.8044475e-7,0.000060986036,0.018645283,0.000010090404,0.0000026899124,0.0000018586866,0.00039700107,0.000041028798,0.000030517753,0.07679493,0.0005852929,0.90342975],"study_design_scores_gemma":[0.0003574264,0.000027786344,0.06239969,0.000016068521,6.00079e-7,0.0000039668616,0.00011122657,0.8996244,0.00014377496,0.034682434,0.0024728742,0.00015971615],"about_ca_topic_score_codex":0.00013928227,"about_ca_topic_score_gemma":0.00055617164,"teacher_disagreement_score":0.9380079,"about_ca_system_score_codex":0.000010326019,"about_ca_system_score_gemma":0.000002023271,"threshold_uncertainty_score":0.18671998},"labels":[],"label_agreement":null},{"id":"W2135843591","doi":"10.1145/511446.511489","title":"Probabilistic query expansion using query logs","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":427,"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":"Sargable; Query optimization; Query expansion; Computer science; Probabilistic logic; Query language; RDF query language; Web search query; Web query classification; Query by Example; Boolean conjunctive query; Information retrieval; Data mining; Artificial intelligence; Search engine","score_opus":0.0558195065342248,"score_gpt":0.24033600455912468,"score_spread":0.1845164980248999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135843591","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.014943811,0.000102824706,0.9581107,0.0007604071,0.0005768429,0.00019933641,0.0000012409728,0.00039856957,0.024906287],"genre_scores_gemma":[0.58380646,0.00006205705,0.39506456,0.0019894894,0.00030568693,0.000016550703,0.000009734143,0.000024543011,0.018720899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990689,0.000028199516,0.00014816002,0.00032590306,0.00019985109,0.00022897501],"domain_scores_gemma":[0.9992971,0.000029311144,0.000036909005,0.0005547972,0.000026155898,0.000055734487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014808096,0.00009972078,0.00009290075,0.000085047344,0.00009094848,0.00022248457,0.0006067568,0.000027528333,0.00019672616],"category_scores_gemma":[0.000022709992,0.000082668215,0.00003500229,0.00028473834,0.00002745757,0.0010896552,0.0003993222,0.000058157395,0.00029636707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028192758,0.00055735727,0.0006746617,0.00011600642,0.000040784715,0.00019570308,0.0006535296,0.0010952145,0.0013919063,0.3830292,0.07395373,0.53828907],"study_design_scores_gemma":[0.00014706141,0.00002877509,0.00022906053,0.000018379436,0.0000052925075,0.0000087648805,0.000018265979,0.98715866,0.00017599136,0.0036521584,0.008366163,0.00019140514],"about_ca_topic_score_codex":0.000060077116,"about_ca_topic_score_gemma":0.0000065760196,"teacher_disagreement_score":0.9860635,"about_ca_system_score_codex":0.000027728027,"about_ca_system_score_gemma":0.00000760684,"threshold_uncertainty_score":0.3809298},"labels":[],"label_agreement":null},{"id":"W2135886882","doi":"10.1109/icips.1997.669344","title":"2D-h trees: an index scheme for content-based retrieval of images in multimedia systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Search engine indexing; Scheme (mathematics); Index (typography); Hierarchy; Object (grammar); Salient; Tree (set theory); Information retrieval; Image retrieval; Feature (linguistics); Database index; Content-based image retrieval; Multimedia database; Object-based spatial database; Content (measure theory); Visual Word; Spatial relationship; Image (mathematics); Artificial intelligence; Spatial database; Spatial analysis; Mathematics; World Wide Web; Geography; Remote sensing","score_opus":0.06512474589860029,"score_gpt":0.26336411403584836,"score_spread":0.19823936813724807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135886882","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.021423463,0.00016365045,0.9752159,0.00040001748,0.00043811134,0.0007574601,0.000040595307,0.000162055,0.0013987168],"genre_scores_gemma":[0.81367934,0.000008770294,0.1830537,0.00015106927,0.000072468836,0.000028680308,0.00003114143,0.000011977088,0.0029628503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989389,0.000032296353,0.00028098372,0.0002993381,0.00022677223,0.00022166366],"domain_scores_gemma":[0.9992025,0.00008952118,0.000088419925,0.00048359518,0.00007551461,0.000060464343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033834702,0.0001046934,0.00018522427,0.00018344633,0.000024947223,0.000125228,0.00076003623,0.000039991563,0.000026095002],"category_scores_gemma":[0.000062320585,0.00008872318,0.000043303866,0.00031874326,0.000038496466,0.00086770335,0.00009451746,0.000049501603,0.000013769163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049158296,0.007653604,0.108151115,0.0017624076,0.00033582968,0.0002169042,0.0028910094,0.0017826972,0.06956947,0.07867832,0.072121315,0.6563457],"study_design_scores_gemma":[0.0015570647,0.00014077984,0.0017724022,0.000027008651,0.000002804565,3.1693315e-7,0.00016269385,0.99176675,0.0036644372,0.00001871967,0.00076189556,0.00012511948],"about_ca_topic_score_codex":0.00013938859,"about_ca_topic_score_gemma":0.000027976841,"teacher_disagreement_score":0.98998404,"about_ca_system_score_codex":0.000018059758,"about_ca_system_score_gemma":0.000009858796,"threshold_uncertainty_score":0.3618026},"labels":[],"label_agreement":null},{"id":"W2137206963","doi":"10.1145/1370256.1370286","title":"Answering preference queries with bit-sliced index arithmetic","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Royal Military College of Canada","funders":"","keywords":"Computer science; Preference; Skyline; Arithmetic; Index (typography); Bit (key); Theoretical computer science; SQL; Database; Algorithm; Information retrieval; Data mining; Mathematics; Programming language; Statistics","score_opus":0.03508904335849693,"score_gpt":0.19882240925477937,"score_spread":0.16373336589628246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137206963","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.037853736,0.00002101062,0.9320431,0.00034902466,0.00009906076,0.00012099289,0.0000010226029,0.0003735231,0.02913858],"genre_scores_gemma":[0.8300661,0.00003437151,0.16327174,0.00031609432,0.00003516118,0.000016932532,0.0000037672683,0.000007729632,0.006248092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904656,0.000014236186,0.000113277056,0.0003310553,0.00025683842,0.00023800592],"domain_scores_gemma":[0.99930954,0.000020466827,0.00003677444,0.00053198566,0.000037840975,0.00006337896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075523596,0.00012038246,0.00010915321,0.00009929163,0.00013899649,0.00016212882,0.00079348695,0.000021085127,0.000036136684],"category_scores_gemma":[0.000007058251,0.00008777058,0.000017698583,0.00043398043,0.00007049628,0.0012895678,0.00034857716,0.00007638,0.000069224516],"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.00005833913,0.0005259607,0.092999816,0.00014554439,0.00023780305,0.00079207786,0.0040758234,0.0005647519,0.0005330344,0.55356,0.0113888,0.33511806],"study_design_scores_gemma":[0.0034125678,0.0012118542,0.4237268,0.00017208453,0.000034125074,0.0003655017,0.00048359606,0.42931163,0.009276781,0.0056209825,0.12372999,0.0026540752],"about_ca_topic_score_codex":0.0001169472,"about_ca_topic_score_gemma":0.00005141678,"teacher_disagreement_score":0.79221237,"about_ca_system_score_codex":0.000010693843,"about_ca_system_score_gemma":0.00003207774,"threshold_uncertainty_score":0.35791805},"labels":[],"label_agreement":null},{"id":"W2137819616","doi":"10.1145/1277741.1277980","title":"Focused ranking in a vertical search engine","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Minnow Environmental (Canada)","funders":"","keywords":"Spamdexing; Information retrieval; Computer science; Search engine; PageRank; Ranking (information retrieval); World Wide Web; Hyperlink; Web search engine; Metasearch engine; Semantic search; Web crawler; Search analytics; Search engine optimization; Domain (mathematical analysis); Web page; Web search query","score_opus":0.021885780121617564,"score_gpt":0.2664371022391155,"score_spread":0.24455132211749792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137819616","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.025068058,0.000010809777,0.95829046,0.0006523523,0.00009079399,0.00006079804,8.2214626e-8,0.00008778746,0.015738863],"genre_scores_gemma":[0.87988704,0.000002294457,0.11926338,0.00028552342,0.000041372532,0.0000011967101,0.0000012932287,0.0000030879366,0.0005148163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.000010659197,0.00010308402,0.000166648,0.00018579971,0.00025712958],"domain_scores_gemma":[0.9996563,0.000055625766,0.000002980469,0.0002329194,0.000009928893,0.00004223757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007238076,0.0000448686,0.00005381457,0.00013946,0.000019699528,0.000089913585,0.0004850335,0.000015552365,0.0000336512],"category_scores_gemma":[0.0000137352135,0.00003809796,0.000014631223,0.00042340576,0.000010173921,0.00039474576,0.00027512625,0.00007060431,0.00009499774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059178433,0.00007410662,0.002448135,0.000006318887,0.0000054557586,0.00014662404,0.00022074909,0.000024013736,0.00023541047,0.2323851,0.00056613074,0.76388204],"study_design_scores_gemma":[0.0022545054,0.000104904764,0.07261697,0.000027887494,0.0000030564254,0.0000053522513,0.00006153791,0.8937869,0.012229136,0.0036890798,0.014833356,0.00038732684],"about_ca_topic_score_codex":0.000036424088,"about_ca_topic_score_gemma":0.0000354247,"teacher_disagreement_score":0.8937629,"about_ca_system_score_codex":0.000016743576,"about_ca_system_score_gemma":0.0000073690303,"threshold_uncertainty_score":0.15535899},"labels":[],"label_agreement":null},{"id":"W2138160905","doi":"10.1109/csicc.2009.5349326","title":"A unified framework for evaluating deductive databases with uncertainty","year":2009,"lang":"en","type":"article","venue":"2009 14th International CSI Computer Conference","topic":"Data Management and Algorithms","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":"Certainty; Computer science; Deductive database; Annotation; Database; Database theory; Artificial intelligence; Relational database; Mathematics","score_opus":0.08610360806311745,"score_gpt":0.35261431963211093,"score_spread":0.2665107115689935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138160905","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.0019026009,0.00001843198,0.99099845,0.0036795,0.0008965181,0.0003883858,0.00007728462,0.00019064396,0.0018481959],"genre_scores_gemma":[0.24805388,0.0000075242665,0.74980664,0.0012232536,0.00042800274,0.00003036308,0.00016365723,0.0000073251717,0.00027936426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808913,0.00005191773,0.0002778001,0.00068940385,0.00055461406,0.00033714407],"domain_scores_gemma":[0.998312,0.000229103,0.00019453432,0.00058643357,0.0005816583,0.00009625029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032869057,0.0002389272,0.00020317455,0.00016911906,0.00014584539,0.00059764594,0.0018167063,0.000038190254,0.000039642313],"category_scores_gemma":[0.00008441942,0.00020407989,0.000058903497,0.00027408215,0.000051497784,0.0012471203,0.00030935372,0.00017696546,0.000025044013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051965853,0.00010949546,0.00009768837,0.0000062574222,0.000063114705,0.000009497204,0.00018748798,0.0017919838,0.000024838744,0.7991128,0.0019137898,0.1966311],"study_design_scores_gemma":[0.00077910855,0.00061775703,0.0038934716,0.0001832421,0.000017047907,0.00001661841,0.00003411255,0.91208833,0.00015279722,0.07349756,0.008334075,0.0003858812],"about_ca_topic_score_codex":0.000025302184,"about_ca_topic_score_gemma":0.000008472311,"teacher_disagreement_score":0.9102963,"about_ca_system_score_codex":0.000059863025,"about_ca_system_score_gemma":0.0001292082,"threshold_uncertainty_score":0.8322136},"labels":[],"label_agreement":null},{"id":"W2138271690","doi":"10.1109/icde.2007.367935","title":"Top-k Query Processing in Uncertain Databases","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":428,"is_retracted":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":"Tuple; Computer science; Semantics (computer science); Probabilistic logic; Construct (python library); Database; Query language; Materialized view; Query optimization; Space (punctuation); Theoretical computer science; Information retrieval; Data mining; View; Programming language; Artificial intelligence; Mathematics; Database design","score_opus":0.038690036601686045,"score_gpt":0.30718534086678395,"score_spread":0.26849530426509793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138271690","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.0032717078,0.000071694485,0.9645491,0.00041205043,0.00010412473,0.00006128152,7.99864e-7,0.00012046242,0.03140878],"genre_scores_gemma":[0.37199795,0.000016166412,0.62177026,0.0016906824,0.00012462916,0.0000050383533,0.000027511338,0.0000073813367,0.004360364],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928,0.000008432109,0.0001287747,0.00022376348,0.00013955425,0.00021948165],"domain_scores_gemma":[0.99961895,0.00002285375,0.000023049772,0.0002890231,0.000012343187,0.00003376393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005302543,0.000059553222,0.000057472185,0.00013307689,0.00003442206,0.0001217715,0.000502771,0.00000976198,0.00002040494],"category_scores_gemma":[0.000017577695,0.00004988068,0.000010418955,0.00045442733,0.0000132864425,0.0013168255,0.00030381655,0.000048225014,0.0000360913],"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.0000018803386,0.000058465885,0.0054347888,0.000018583474,0.000001230951,0.000107157815,0.00012109561,0.000013439735,0.00007655337,0.08948026,0.0027983948,0.90188813],"study_design_scores_gemma":[0.0016983892,0.00010496894,0.10391852,0.00024544628,0.000008893512,0.000019378598,0.0012795548,0.43525684,0.0066304496,0.008504734,0.44095227,0.0013805358],"about_ca_topic_score_codex":0.00020625126,"about_ca_topic_score_gemma":0.00020840768,"teacher_disagreement_score":0.9005076,"about_ca_system_score_codex":0.000017064183,"about_ca_system_score_gemma":0.000019828245,"threshold_uncertainty_score":0.20340751},"labels":[],"label_agreement":null},{"id":"W2138414767","doi":"","title":"Probabilistic skylines on uncertain data","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":461,"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":"Skyline; Uncertain data; Probabilistic logic; Computer science; Data mining; Benchmark (surveying); Object (grammar); Set (abstract data type); Data set; Artificial intelligence","score_opus":0.08583155124540513,"score_gpt":0.32339550275575746,"score_spread":0.2375639515103523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138414767","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.00041476727,0.000010014596,0.9239557,0.0014916592,0.000356351,0.00012807373,0.0000067786823,0.00022934531,0.07340735],"genre_scores_gemma":[0.18518543,0.000020885363,0.7600481,0.006577786,0.00088010123,0.000008926755,0.0004382062,0.000023931983,0.04681667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991243,0.000009050982,0.00011695667,0.00036466474,0.00019180671,0.00019325879],"domain_scores_gemma":[0.9983793,0.00008046534,0.0000232213,0.001453012,0.000017900962,0.0000461372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006411989,0.00006988704,0.000056307847,0.000061376086,0.000047042104,0.0001468828,0.0021719378,0.000014146909,0.000044859553],"category_scores_gemma":[0.000068048015,0.000051603212,0.000010106348,0.0002531714,0.000018065923,0.0006240432,0.0009366519,0.00004271211,0.00026627773],"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.0000025856639,0.00008044307,0.000077619756,0.0000084337125,0.0000069232383,0.00003423418,0.000019928773,0.00003154247,0.000009140207,0.53899854,0.040128782,0.42060181],"study_design_scores_gemma":[0.0003858369,0.00013568207,0.003170526,0.000019740297,0.000007252711,0.000004274955,0.000035849553,0.48646864,0.00023522845,0.019684937,0.48949447,0.00035754548],"about_ca_topic_score_codex":0.000029014534,"about_ca_topic_score_gemma":0.00004272193,"teacher_disagreement_score":0.5193136,"about_ca_system_score_codex":0.000010109198,"about_ca_system_score_gemma":0.000010782787,"threshold_uncertainty_score":0.4036037},"labels":[],"label_agreement":null},{"id":"W2139292246","doi":"10.1109/icde.2005.107","title":"PnP: Parallel and External Memory Iceberg Cube Computation","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Concordia University; Dalhousie University","funders":"","keywords":"Iceberg; Cube (algebra); Computer science; Pruning; Data cube; Auxiliary memory; Computation; Novelty; Parallel computing; Data mining; Algorithm; Computer hardware; Geology; Mathematics; Combinatorics","score_opus":0.014397803639399976,"score_gpt":0.24642858386599562,"score_spread":0.23203078022659565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139292246","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.0053217756,0.00009321892,0.97214156,0.0016210295,0.000117761374,0.00006797456,4.993188e-7,0.0001290293,0.020507136],"genre_scores_gemma":[0.24433602,0.000042814707,0.74507964,0.0014303396,0.00018725908,0.0000046355854,0.000005499166,0.000004817727,0.008908987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938375,0.000019514056,0.00010216401,0.00021655514,0.00014691694,0.00013110593],"domain_scores_gemma":[0.9997096,0.000025054165,0.00002904654,0.00017010752,0.00001524175,0.000050936753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016034885,0.000068542206,0.000060601822,0.000050825067,0.00007313675,0.00023593004,0.00031513002,0.0000144500455,0.000035412606],"category_scores_gemma":[0.0000037080363,0.000059143847,0.00001535366,0.000086564796,0.000017717815,0.0011068985,0.0002624044,0.000048386984,0.00014798998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014228782,0.000031569565,0.00014367794,0.000004935485,0.0000070459473,0.0000069172515,0.00013006678,0.00078294566,0.000039804632,0.037307,0.008875154,0.95266944],"study_design_scores_gemma":[0.00046935756,0.000029371391,0.0073606195,0.0000070614738,0.000004137747,0.00001047412,0.000026828722,0.9690814,0.000111001966,0.0034459445,0.019293813,0.00015998284],"about_ca_topic_score_codex":0.000021157552,"about_ca_topic_score_gemma":0.000012944585,"teacher_disagreement_score":0.96829844,"about_ca_system_score_codex":0.00000847043,"about_ca_system_score_gemma":0.000005556741,"threshold_uncertainty_score":0.24118161},"labels":[],"label_agreement":null},{"id":"W2139923606","doi":"10.1109/ccece.2013.6567822","title":"Evaluating the spatial indexing of dense point sets","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; R-tree; Computer science; Tree (set theory); Point (geometry); Benchmark (surveying); Access method; Spatial database; Data mining; Database index; Spatial analysis; Index (typography); Database; Information retrieval; Mathematics; Statistics; Geography; Cartography; Geometry; Combinatorics","score_opus":0.0522531299893662,"score_gpt":0.318124598208659,"score_spread":0.2658714682192928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139923606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13032658,0.000021400321,0.852904,0.0027645994,0.000285269,0.000302083,5.7082764e-7,0.000081363956,0.013314119],"genre_scores_gemma":[0.9057612,0.0000015689047,0.09293064,0.00044717922,0.00003553482,0.000010571997,0.0000010128308,0.0000027558442,0.00080953434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993391,0.00004022938,0.00013546176,0.00013394965,0.00023202153,0.00011921239],"domain_scores_gemma":[0.9994095,0.00006404132,0.000059114504,0.00039906058,0.000048558464,0.00001972265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000473327,0.000049279424,0.000056659013,0.00003149082,0.000059042417,0.0001516779,0.0006719424,0.0000103457,0.00016301297],"category_scores_gemma":[0.000043602304,0.000029038243,0.000024000878,0.00012329745,0.000019971152,0.0005552073,0.00053780334,0.00004257648,0.00012634721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.626238e-7,0.000019243536,0.00047130685,0.000007091016,0.000013177809,8.7499654e-7,0.0003879423,0.00008687022,0.0008155211,0.019149095,0.0027616853,0.97628653],"study_design_scores_gemma":[0.00015298485,0.00006790479,0.010497718,0.000010658806,0.000003500812,0.0000014121816,0.00006677774,0.98004186,0.001223198,0.0076996307,0.00016393076,0.00007043278],"about_ca_topic_score_codex":0.0005994954,"about_ca_topic_score_gemma":0.000014425078,"teacher_disagreement_score":0.97995496,"about_ca_system_score_codex":0.0000053587933,"about_ca_system_score_gemma":0.000011607289,"threshold_uncertainty_score":0.17848776},"labels":[],"label_agreement":null},{"id":"W2140060501","doi":"10.1145/1557670.1557680","title":"Query segmentation using conditional random fields","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Conditional random field; Query optimization; Query expansion; Segmentation; Quality (philosophy); Sargable; Data mining; Field (mathematics); Information retrieval; Web query classification; Relational database; Artificial intelligence; Web search query; Search engine","score_opus":0.02237004621615805,"score_gpt":0.2745286333615625,"score_spread":0.25215858714540446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140060501","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.0035023326,0.000008327646,0.9874475,0.0009123748,0.00012999082,0.00006082408,0.000001166597,0.0000755751,0.007861914],"genre_scores_gemma":[0.7060292,0.000005931079,0.28819147,0.004090075,0.00011917422,0.0000020335171,0.000055764336,0.0000017254102,0.0015046431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959415,0.000011992219,0.00007615115,0.000117175055,0.00011905024,0.000081465165],"domain_scores_gemma":[0.9998024,0.000015665491,0.000021084841,0.00012633576,0.000013912557,0.000020609603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008699585,0.00004101377,0.000042404416,0.000043001804,0.000056412544,0.00013318163,0.00020094047,0.000013398247,0.00008509557],"category_scores_gemma":[0.0000035870228,0.000035811307,0.000020192138,0.00009653831,0.0000057842667,0.0008431729,0.000038533286,0.000025083571,0.000032051248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013276366,0.0001366061,0.00031070187,0.0000068244735,0.000029351819,0.00003524805,0.00019592389,0.0016047537,0.0021517957,0.6632801,0.0393657,0.2928697],"study_design_scores_gemma":[0.002237396,0.00008950444,0.0043838336,0.000009700949,0.000010643664,0.000011490519,0.000044058994,0.9086536,0.0035895864,0.07637804,0.0043180985,0.00027402997],"about_ca_topic_score_codex":0.000008797641,"about_ca_topic_score_gemma":0.0000010401968,"teacher_disagreement_score":0.9070489,"about_ca_system_score_codex":0.000009217028,"about_ca_system_score_gemma":0.000008374025,"threshold_uncertainty_score":0.14603427},"labels":[],"label_agreement":null},{"id":"W2140190241","doi":"10.5860/choice.49-3305","title":"Data mining: concepts and techniques","year":2012,"lang":"en","type":"article","venue":"Choice Reviews Online","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":28877,"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; Data science; Data mining","score_opus":0.15542448392305214,"score_gpt":0.4082003367705969,"score_spread":0.2527758528475448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140190241","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.0039587826,0.45876235,0.5137571,0.007445876,0.001812181,0.0024678116,0.00057790405,0.0012993099,0.009918681],"genre_scores_gemma":[0.0009151367,0.041511193,0.9520352,0.0022408424,0.0012476288,0.000022794444,0.00064172095,0.000014412839,0.0013710541],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990689,0.000056090543,0.00023184341,0.00030389553,0.00010826073,0.00023099525],"domain_scores_gemma":[0.9983847,0.00006124462,0.00010516071,0.0013291644,0.00001552573,0.00010419296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649604,0.00011775207,0.00021564694,0.00004231069,0.000049244885,0.00009890888,0.0014549576,0.000025342477,0.000014134864],"category_scores_gemma":[0.0001949131,0.00008989431,0.000020169351,0.00021028335,0.00003611534,0.002008201,0.0015511763,0.000070557435,0.000041050702],"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":[1.1542182e-7,0.000054270586,0.0009560496,0.00006677691,0.00000437172,6.7455585e-7,0.000029044168,2.095665e-9,0.00003149962,0.0008744557,0.031480532,0.9665022],"study_design_scores_gemma":[0.000059056965,0.000012997281,0.0011279411,0.000110595014,0.000012876522,0.0000042898982,0.0000055766886,0.00090610655,0.000033522883,0.000018875935,0.99758834,0.000119806355],"about_ca_topic_score_codex":0.0000051929646,"about_ca_topic_score_gemma":0.0000064926166,"teacher_disagreement_score":0.9663824,"about_ca_system_score_codex":0.000006861064,"about_ca_system_score_gemma":0.0000075079297,"threshold_uncertainty_score":0.36657837},"labels":[],"label_agreement":null},{"id":"W2140740564","doi":"","title":"Multidimensional Orthogonal Range Search Using Tries.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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":"Rectangle; Range (aeronautics); Competitive analysis; Set (abstract data type); Algorithm; Space (punctuation); Computer science; Range query (database); Online algorithm; Combinatorics; Search algorithm; Mathematics; Theoretical computer science; Search engine; Information retrieval; Upper and lower bounds; Web search query; Engineering; Geometry; Sargable","score_opus":0.06550581335891824,"score_gpt":0.28024586088074516,"score_spread":0.2147400475218269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140740564","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.09372063,0.00009580059,0.87931204,0.0019210662,0.0011521463,0.00041421546,0.0001694834,0.00013138243,0.02308323],"genre_scores_gemma":[0.8879965,0.0000040188706,0.10952823,0.0015911207,0.00007391609,0.0000037399943,0.000102458514,0.000013387353,0.0006866029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797624,0.00011031148,0.00023510115,0.00053088705,0.00061934313,0.0005281152],"domain_scores_gemma":[0.9986491,0.00015889147,0.00005481171,0.00033677256,0.00029033757,0.00051005394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044863144,0.00019882504,0.00017589364,0.0008228378,0.00034605202,0.00029808644,0.00059138687,0.00006844674,0.0006186973],"category_scores_gemma":[0.0000835088,0.00021096207,0.00006422359,0.0010228066,0.00008667968,0.00050255406,0.00008401575,0.00021876246,0.00037026938],"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.0000032094865,0.00003737699,0.0010420559,0.0000075662624,0.00002892255,0.00006829362,0.000051477975,0.015826544,0.00000876809,0.96942663,0.0015589127,0.011940258],"study_design_scores_gemma":[0.0010945622,0.000093961826,0.010447313,0.000049374034,0.000009835324,0.000032936692,0.000083983534,0.94847167,0.00007175733,0.016719162,0.022286762,0.0006386833],"about_ca_topic_score_codex":0.0017920934,"about_ca_topic_score_gemma":0.0007914428,"teacher_disagreement_score":0.95270747,"about_ca_system_score_codex":0.00019410216,"about_ca_system_score_gemma":0.0016901592,"threshold_uncertainty_score":0.86027837},"labels":[],"label_agreement":null},{"id":"W2140924391","doi":"10.1109/icccyb.2005.1511565","title":"Spatial OLAP modeling: an overview base on spatial objects changing over time","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Online analytical processing; Spatial analysis; Data warehouse; Data mining; Spatial query; Spatial database; Geographic information system; Search engine indexing; Context (archaeology); Data modeling; Field (mathematics); Data model (GIS); Interoperability; Geospatial analysis; Database; Information retrieval; Geography; Cartography; Web query classification; Artificial intelligence","score_opus":0.031990848570380884,"score_gpt":0.2568247464844555,"score_spread":0.22483389791407465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140924391","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.010803709,0.000053032236,0.97057104,0.00025227823,0.0003569455,0.00021323156,0.000009677981,0.00040469423,0.0173354],"genre_scores_gemma":[0.96494,0.0000137331845,0.02607228,0.0018764305,0.0010704143,0.000014134223,0.00018875512,0.00002884083,0.00579537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841875,0.000044394914,0.00019517918,0.0005248733,0.0004080784,0.00040872596],"domain_scores_gemma":[0.9991086,0.000018289993,0.0000505314,0.0007132292,0.000028555154,0.00008075231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027506356,0.00018750883,0.0001539685,0.00021740023,0.00013420633,0.00037904343,0.0007510609,0.000041117084,0.00030722228],"category_scores_gemma":[0.0000063537905,0.00016536776,0.00006249474,0.00029857003,0.000010994594,0.0011264984,0.00042963692,0.00008359034,0.00046909112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050896873,0.0015059838,0.0003305302,0.00012997154,0.00007143961,0.00032692013,0.0006076729,0.03295175,0.0012473649,0.3701912,0.017111778,0.5754745],"study_design_scores_gemma":[0.00036278355,0.00011602642,0.00016097967,0.00002897657,0.000006020243,0.000001132861,0.0000039273104,0.9957378,0.0004544279,0.0018537831,0.0010285305,0.0002456386],"about_ca_topic_score_codex":0.0019047392,"about_ca_topic_score_gemma":0.00018150908,"teacher_disagreement_score":0.962786,"about_ca_system_score_codex":0.000030619438,"about_ca_system_score_gemma":0.000021313133,"threshold_uncertainty_score":0.6743502},"labels":[],"label_agreement":null},{"id":"W2141296717","doi":"10.1145/1989734.1989741","title":"MoveMine","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":133,"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":"Army Research Laboratory; Air Force Office of Scientific Research; Division of Computing and Communication Foundations; National Science Foundation","keywords":"Computer science; Data mining; Object (grammar); Swarm behaviour; Focus (optics); Trajectory; Cluster analysis; Data stream mining; Movement (music); Artificial intelligence","score_opus":0.03626296199891101,"score_gpt":0.23551538622712453,"score_spread":0.19925242422821351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141296717","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.0012791478,0.00027344408,0.99456525,0.00063553074,0.0006271501,0.00017467639,0.0000048207758,0.00041565797,0.0020242997],"genre_scores_gemma":[0.9724383,0.00039423115,0.02445271,0.000076867014,0.000018569568,0.00008845296,0.0000015736516,0.000010406093,0.0025189046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992013,0.000012123105,0.00018946936,0.00031504277,0.00009249586,0.00018954395],"domain_scores_gemma":[0.9989673,0.000021865691,0.00004534723,0.0008865892,0.000035429177,0.000043497617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010416776,0.00011491011,0.00013165099,0.00041802015,0.00011030951,0.000052673906,0.0008721337,0.00009555619,0.000034688186],"category_scores_gemma":[0.000008462785,0.00009915229,0.000026112843,0.0004733841,0.000065978675,0.0002272478,0.000043251126,0.00013827418,0.00011728527],"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.0000040544573,0.00017311396,0.00014444525,0.00002551055,0.00007834333,0.000025630176,0.00020278728,0.0000094189045,0.000090878,0.38434455,0.0002899057,0.6146114],"study_design_scores_gemma":[0.0019659027,0.0037855692,0.00082322117,0.0004955689,0.0001875275,0.0007141052,0.0044806567,0.06831716,0.12909915,0.2453701,0.5420275,0.0027335775],"about_ca_topic_score_codex":0.00009115322,"about_ca_topic_score_gemma":0.000006941615,"teacher_disagreement_score":0.97115916,"about_ca_system_score_codex":0.000013633741,"about_ca_system_score_gemma":0.0000064176415,"threshold_uncertainty_score":0.4043313},"labels":[],"label_agreement":null},{"id":"W2141646866","doi":"10.24517/00062794","title":"Linear-Space Algorithms for Distance Preserving Embedding","year":2007,"lang":"en","type":"article","venue":"NPARC","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Distance matrix; Mathematics; Euclidean distance; Euclidean space; Euclidean distance matrix; Embedding; Disjoint sets; Strength of a graph; Discrete mathematics; Linear space; Partition (number theory); Algorithm; Graph; Graph power; Computer science; Line graph; Artificial intelligence","score_opus":0.028730944505920935,"score_gpt":0.3070024107349173,"score_spread":0.27827146622899634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141646866","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.00034989975,0.000041044066,0.9752898,0.0011782949,0.0005094348,0.00023624864,0.0000089134155,0.00020289131,0.022183431],"genre_scores_gemma":[0.03455885,0.000010270835,0.95782423,0.00023126815,0.00038787277,0.000021022834,0.000014008779,0.000014737615,0.0069377446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987385,0.000011029657,0.00017849714,0.00038215308,0.0002500543,0.00043971447],"domain_scores_gemma":[0.99906415,0.00014232239,0.000069066795,0.00057316135,0.000060938626,0.00009036814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074946607,0.00011842206,0.000116948155,0.000073942436,0.00015986286,0.00019383089,0.0011564955,0.000033897937,0.000025449493],"category_scores_gemma":[0.000071320785,0.000113489004,0.000056883724,0.00030785636,0.00002299183,0.00086595543,0.00045903723,0.00008102406,0.000027816883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020821995,0.00011097078,0.00033830127,0.00011178251,0.00004589192,0.000048798174,0.00062076806,0.00020011471,0.002955873,0.38001725,0.043436788,0.57209265],"study_design_scores_gemma":[0.00034753283,0.000043954515,0.00026584874,0.000027113043,0.000005455548,0.0000018948206,0.000046553578,0.7584295,0.0028188399,0.016309205,0.22149147,0.00021259999],"about_ca_topic_score_codex":0.000005264981,"about_ca_topic_score_gemma":0.0000077091545,"teacher_disagreement_score":0.75822943,"about_ca_system_score_codex":0.000029589513,"about_ca_system_score_gemma":0.000013280345,"threshold_uncertainty_score":0.46279472},"labels":[],"label_agreement":null},{"id":"W2142080841","doi":"10.3390/s131013402","title":"GeoCENS: A Geospatial Cyberinfrastructure for the World-Wide Sensor Web","year":2013,"lang":"en","type":"article","venue":"Sensors","topic":"Data Management and Algorithms","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 Calgary","funders":"Jet Propulsion Laboratory; Canarie; Microsoft Research","keywords":"Cyberinfrastructure; Sensor web; Geospatial analysis; Computer science; Architecture; Web Coverage Service; World Wide Web; Web service; Process (computing); Web mapping; Data science; Web modeling; Remote sensing; Geography; Telecommunications; Key distribution in wireless sensor networks","score_opus":0.00877642595381383,"score_gpt":0.21978529625155335,"score_spread":0.21100887029773951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142080841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40010557,0.00031548974,0.48732933,0.07167852,0.008033978,0.0065150307,0.00020599211,0.0017654363,0.024050659],"genre_scores_gemma":[0.56266016,0.00007662308,0.34227344,0.008382871,0.002025383,0.00037736396,0.00007169154,0.000093098,0.08403937],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.00002900363,0.0001782149,0.00035720525,0.00022375467,0.0004014568],"domain_scores_gemma":[0.99874157,0.00029997033,0.000076950026,0.0007373342,0.00007411061,0.0000700596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014193068,0.0001690928,0.00013476564,0.00008960629,0.00021625415,0.0004432074,0.0009601894,0.00003380586,0.00015621289],"category_scores_gemma":[0.00006950236,0.000110469366,0.000090185575,0.00032702772,0.000054277283,0.00043053846,0.0003173962,0.00011760243,0.00033231857],"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.000017254346,0.00006522197,0.0022905543,0.000062574305,0.00023427719,0.000032620377,0.0008096319,0.002946362,0.00043447805,0.04401435,0.5135009,0.43559176],"study_design_scores_gemma":[0.00047182266,0.00003540526,0.01606342,0.00001081327,0.000018962714,0.000006228926,0.00011733749,0.5116854,0.00028706703,0.003058537,0.46795914,0.0002859164],"about_ca_topic_score_codex":0.000102165235,"about_ca_topic_score_gemma":0.00010893012,"teacher_disagreement_score":0.508739,"about_ca_system_score_codex":0.000017435843,"about_ca_system_score_gemma":0.00001933888,"threshold_uncertainty_score":0.450481},"labels":[],"label_agreement":null},{"id":"W2142162160","doi":"10.1016/j.dam.2014.07.023","title":"Finding the closest ultrametric","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Management and Algorithms","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":"Ultrametric space; Mathematics; Multiplicative function; Distortion (music); Combinatorics; Pairwise comparison; Monotonic function; Approximation algorithm; Tree (set theory); Constant (computer programming); Discrete mathematics; Metric space; Statistics; Mathematical analysis; Computer science","score_opus":0.016697596064645652,"score_gpt":0.2383872469492028,"score_spread":0.22168965088455714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142162160","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.0011690814,0.000010143468,0.9040612,0.00044840382,0.0001236386,0.00020909839,0.000001993031,0.00016030317,0.09381616],"genre_scores_gemma":[0.5556984,0.00001585687,0.4426963,0.0006217706,0.00016319352,0.000057425685,0.0000147963365,0.000023468043,0.00070878916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896675,0.000012644246,0.00020779096,0.00024156387,0.00031144585,0.00025980567],"domain_scores_gemma":[0.99858326,0.00029460358,0.0001138502,0.0009471455,0.000013917833,0.000047199195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055695703,0.00013629418,0.0001439819,0.00008748258,0.00018388894,0.0004001591,0.0015326997,0.000029618703,0.000012987603],"category_scores_gemma":[0.00006783626,0.00008579066,0.000048785325,0.00059368217,0.00004617724,0.00020941214,0.00038699468,0.00011149849,0.00033142255],"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":[2.4014423e-7,0.000022853668,0.0000049138944,0.000028466056,0.0000108203285,5.302235e-7,0.000342024,0.000015304462,0.00011137012,0.962695,0.0013685932,0.035399884],"study_design_scores_gemma":[0.00072124036,0.0000697681,0.00047797477,0.000049958784,0.000072892195,0.000011062267,0.0007002305,0.43233773,0.0030392522,0.48752496,0.074197024,0.00079791824],"about_ca_topic_score_codex":0.000001633419,"about_ca_topic_score_gemma":5.997098e-7,"teacher_disagreement_score":0.5545293,"about_ca_system_score_codex":0.000011349799,"about_ca_system_score_gemma":0.0000064812016,"threshold_uncertainty_score":0.4259877},"labels":[],"label_agreement":null},{"id":"W2142560248","doi":"10.5555/1182635.1164151","title":"FIX: feature-based indexing technique for XML documents","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"XPath; Computer science; Search engine indexing; XML; XML database; Twig; Information retrieval; Pruning; Data mining; Feature (linguistics); Document Structure Description; World Wide Web","score_opus":0.00916301481277251,"score_gpt":0.24445006663403096,"score_spread":0.23528705182125845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142560248","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.000027530261,0.000012059351,0.97168994,0.0011908778,0.0001438404,0.00042636218,0.000004338275,0.000228742,0.026276324],"genre_scores_gemma":[0.052432105,7.945265e-7,0.92631984,0.0010678021,0.00013008177,0.00020505355,0.00006529537,0.000010462348,0.019768564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925375,0.0000096585145,0.00009912102,0.00026814095,0.00015220333,0.0002171034],"domain_scores_gemma":[0.9994996,0.000031689608,0.00003946701,0.0003756818,0.000027825894,0.00002572984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020252905,0.000093249626,0.00007624977,0.00009789813,0.00008682418,0.0002802359,0.0006976399,0.000036573558,0.000011866964],"category_scores_gemma":[0.0000060790444,0.00007879719,0.00004547119,0.00021750087,0.000011483178,0.000596645,0.00016299241,0.000047555834,0.000024440205],"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.000008625174,0.00018586042,0.0009505102,0.00006349537,0.000019578707,0.0000165527,0.000011315493,0.00016319162,0.0035176028,0.55262476,0.39682457,0.045613907],"study_design_scores_gemma":[0.0014380852,0.00014360245,0.0011528388,0.000042688327,0.000011794326,0.0000022786337,0.0000048027496,0.098849945,0.10489179,0.05715913,0.7357343,0.00056873675],"about_ca_topic_score_codex":0.00005133034,"about_ca_topic_score_gemma":0.000010452148,"teacher_disagreement_score":0.49546567,"about_ca_system_score_codex":0.000021071372,"about_ca_system_score_gemma":0.000015629867,"threshold_uncertainty_score":0.3213256},"labels":[],"label_agreement":null},{"id":"W2142595897","doi":"10.1109/tkde.2006.146","title":"On the Signature Tree Construction and Analysis","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"University of Winnipeg","funders":"","keywords":"Computer science; Signature (topology); Tree (set theory); Set (abstract data type); Digital signature; Data structure; Data mining; File format; Information retrieval; Theoretical computer science; Database; Programming language; Hash function; Mathematics","score_opus":0.011715846144598278,"score_gpt":0.2185866327377866,"score_spread":0.20687078659318833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142595897","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.0016816572,0.0001793226,0.9968415,0.00022782023,0.00024533257,0.00006917769,0.00008185748,0.00009805433,0.00057530747],"genre_scores_gemma":[0.9823975,0.00011987724,0.016911492,0.000058759808,0.000077680845,0.000011961316,0.000063676,0.000009691909,0.0003493808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993747,0.000013416087,0.000097344506,0.00031447664,0.00008247857,0.00011756974],"domain_scores_gemma":[0.9992066,0.0001251743,0.000017143995,0.00060689804,0.000012672296,0.00003149718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013132248,0.000109377936,0.00009733934,0.00021483631,0.00013903782,0.00017384934,0.00038218198,0.00003353002,0.000007955077],"category_scores_gemma":[0.0000023139992,0.00008180596,0.000026229827,0.0005554708,0.000024562702,0.0004900537,0.00001364415,0.0001410446,0.000008149302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014533351,0.00028572071,0.000051998566,0.00007804209,0.000778729,0.000016788796,0.00024236616,0.03876492,0.0010697014,0.11773752,0.008692375,0.8322673],"study_design_scores_gemma":[0.00018920495,0.000031945325,0.00052481226,0.000016935564,0.00015129126,0.0000046488617,0.000012400486,0.98881423,0.0009803746,0.00026448898,0.0088425195,0.00016711601],"about_ca_topic_score_codex":0.000011665867,"about_ca_topic_score_gemma":0.000037436308,"teacher_disagreement_score":0.9807158,"about_ca_system_score_codex":0.000008256931,"about_ca_system_score_gemma":0.0000047632197,"threshold_uncertainty_score":0.33359504},"labels":[],"label_agreement":null},{"id":"W2143085379","doi":"","title":"Efficiently answering top-k typicality queries on large databases","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Discriminative model; Set (abstract data type); Tree (set theory); Measure (data warehouse); Quality (philosophy); Information retrieval; Data mining; Artificial intelligence; Mathematics","score_opus":0.024676018051859223,"score_gpt":0.292098508945551,"score_spread":0.2674224908936918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143085379","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.016055418,0.00001785789,0.94193405,0.00033254924,0.0003871726,0.00007335992,0.000011658642,0.00025541533,0.040932547],"genre_scores_gemma":[0.89639604,0.000011755896,0.097616345,0.0024193586,0.00016852978,0.0000032532953,0.000049695776,0.0000088796705,0.0033261175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989933,0.000013914484,0.00013920164,0.00031229615,0.00022597148,0.00031532504],"domain_scores_gemma":[0.9991846,0.00006838128,0.000026615498,0.00063509267,0.000018636938,0.00006668132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062809204,0.000089572626,0.00007949633,0.00007514103,0.00010935933,0.00014010193,0.0005917261,0.000013801522,0.000085220665],"category_scores_gemma":[0.000038234175,0.000072357834,0.000027788807,0.00027146406,0.00002196118,0.00058950717,0.0005178303,0.00006451917,0.00020784368],"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.0000068723384,0.00013273094,0.0015592345,0.000007986896,0.000006171613,0.000027017226,0.00005895632,0.0000061806572,0.00004429768,0.94340634,0.0035944032,0.051149793],"study_design_scores_gemma":[0.0005860783,0.00013556979,0.04494345,0.000030110163,0.0000061338346,0.0000031203267,0.00020046886,0.018869787,0.012166459,0.00094775925,0.9216454,0.00046563364],"about_ca_topic_score_codex":0.00003172156,"about_ca_topic_score_gemma":0.000049605,"teacher_disagreement_score":0.94245857,"about_ca_system_score_codex":0.000014231247,"about_ca_system_score_gemma":0.000007239865,"threshold_uncertainty_score":0.29506668},"labels":[],"label_agreement":null},{"id":"W2143682328","doi":"10.1007/s00778-004-0128-2","title":"Supporting top-k join queries in relational databases","year":2004,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":387,"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":"Joins; Computer science; Join (topology); Sort-merge join; Query optimization; Ranking (information retrieval); Hash join; Database; Relational database; Heuristic; Query language; Sargable; Information retrieval; Rank (graph theory); Heuristics; Relational algebra; Query expansion; Theoretical computer science; Web search query; Search engine; Programming language; Mathematics; Artificial intelligence","score_opus":0.04003804845750331,"score_gpt":0.2958259358899701,"score_spread":0.2557878874324668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143682328","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.08592413,0.00024778195,0.89419013,0.01591039,0.000657874,0.00009341004,0.000006407854,0.000056268607,0.0029135987],"genre_scores_gemma":[0.7763634,0.00016512841,0.2193082,0.0016983472,0.0008088802,0.0000058208825,0.000022838836,0.000014401987,0.0016130155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991531,0.000041552248,0.00023064358,0.00011258394,0.00024928644,0.0002128277],"domain_scores_gemma":[0.9995353,0.000043724347,0.00011685778,0.00024414019,0.000021142978,0.0000387867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094245496,0.0000639756,0.000067365305,0.00009654262,0.00020541997,0.00022674275,0.0006272252,0.0000095188625,0.00005282147],"category_scores_gemma":[0.00007608397,0.000042274296,0.000029924397,0.00024418673,0.000034217155,0.0014371225,0.0002795435,0.00021708157,0.00004982662],"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.000011514079,0.00012091346,0.014382721,0.000009410037,0.000034611545,0.00041544854,0.0022386326,0.0041769226,0.00023619803,0.8991257,0.008121914,0.07112599],"study_design_scores_gemma":[0.0048954454,0.0002619804,0.2190561,0.00046893457,0.00004181938,0.0024770394,0.0018277079,0.031794924,0.0031690001,0.44939482,0.28544724,0.0011649864],"about_ca_topic_score_codex":0.000036767797,"about_ca_topic_score_gemma":0.000026290398,"teacher_disagreement_score":0.6904392,"about_ca_system_score_codex":0.000034812856,"about_ca_system_score_gemma":0.00007023131,"threshold_uncertainty_score":0.21864855},"labels":[],"label_agreement":null},{"id":"W2144152591","doi":"10.4028/www.scientific.net/amm.94-96.1957","title":"An Optimal Identifier-Selection Method Based on Recognition Probability of Expressway Network","year":2011,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Data Management and Algorithms","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":"Ministry of Transportation of Ontario","funders":"","keywords":"Identifier; Selection (genetic algorithm); Computer science; Probability model; Data mining; Artificial intelligence; Computer network; Mathematics; Statistics","score_opus":0.04030112681551362,"score_gpt":0.24913007899565576,"score_spread":0.20882895218014214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144152591","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.013126229,0.0000020674854,0.9855335,0.0000074360637,0.00033050447,0.00035489828,0.000017490327,0.00007466006,0.0005532144],"genre_scores_gemma":[0.31973687,0.0000058184064,0.6800155,0.0000736002,0.000056451776,0.000063024985,0.00003702434,0.000007267494,0.000004448247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902594,0.00008509907,0.00022621104,0.00036717096,0.00012945877,0.00016611064],"domain_scores_gemma":[0.999414,0.000021850607,0.00014126225,0.00033722873,0.000038844,0.000046791884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012334872,0.000108862005,0.00016957847,0.000050922463,0.0000703973,0.0001151564,0.0002749208,0.000055014872,0.00008570154],"category_scores_gemma":[0.000006725038,0.00010041911,0.000017169996,0.00012499459,0.000006574798,0.00028104938,0.000108620916,0.000033099634,0.000006640933],"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.00019295962,0.00026134474,9.3581724e-7,0.00010006044,0.00002120244,0.0000012349313,0.00016578396,0.00013567136,0.11823977,0.7772872,0.00015292122,0.10344091],"study_design_scores_gemma":[0.00033416165,0.0002669688,0.00004708324,0.000020348769,0.00002211048,6.6589797e-7,0.000012668581,0.048052214,0.57906055,0.37188694,0.00012211576,0.0001741456],"about_ca_topic_score_codex":0.000023207876,"about_ca_topic_score_gemma":0.0000017711344,"teacher_disagreement_score":0.4608208,"about_ca_system_score_codex":0.0000069298635,"about_ca_system_score_gemma":0.000010398574,"threshold_uncertainty_score":0.40949723},"labels":[],"label_agreement":null},{"id":"W2144586885","doi":"","title":"On dominating your neighborhood profitably","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Scalability; Data mining; Object (grammar); Index (typography); Spatial database; Query optimization; Quality (philosophy); Information retrieval; Spatial query; Database; Sargable; Web search query; Spatial analysis; Search engine; Artificial intelligence; Mathematics","score_opus":0.016671204942364577,"score_gpt":0.26853565743541613,"score_spread":0.25186445249305156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144586885","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.0016697781,0.0000052299556,0.7414112,0.00047626166,0.00023516607,0.00007870618,3.6055476e-7,0.00015770188,0.2559656],"genre_scores_gemma":[0.82812953,0.000001361635,0.15975188,0.00140065,0.0001414683,0.0000037684345,0.000003903919,0.0000073797914,0.010560028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999177,0.00000778178,0.00011954529,0.0002360189,0.00020789295,0.00025178658],"domain_scores_gemma":[0.9994772,0.0000564547,0.000034282864,0.00036035024,0.000021141663,0.000050588882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048761096,0.00007507035,0.000059311747,0.00009235354,0.00007321255,0.0001766387,0.0006518104,0.000017454198,0.000040721232],"category_scores_gemma":[0.000030931173,0.000059369937,0.000023875054,0.00027207847,0.000008247137,0.0006101193,0.00026683972,0.000060735558,0.00030854545],"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.0000012201957,0.000029302952,0.00013956183,0.0000023230655,0.0000035626772,0.000017205613,0.00004820252,0.000001658729,0.00004486343,0.6884122,0.0022692387,0.30903068],"study_design_scores_gemma":[0.005691957,0.0015974661,0.06553758,0.00016036931,0.000033136697,0.000035810222,0.001112904,0.5601672,0.037174594,0.25727507,0.06845854,0.0027553393],"about_ca_topic_score_codex":0.0000070644855,"about_ca_topic_score_gemma":0.0000025274285,"teacher_disagreement_score":0.82645977,"about_ca_system_score_codex":0.000014263913,"about_ca_system_score_gemma":0.0000064829346,"threshold_uncertainty_score":0.39658302},"labels":[],"label_agreement":null},{"id":"W2144687917","doi":"10.1145/2063576.2063628","title":"Factorization-based lossless compression of inverted indices","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Inverted index; Lossless compression; Term (time); Computer science; Compression (physics); Algorithm; Factorization; Matrix (chemical analysis); Matrix decomposition; Greedy algorithm; Sparse matrix; Space (punctuation); Data compression; Search engine indexing; Artificial intelligence","score_opus":0.050618940650993836,"score_gpt":0.22700281014987816,"score_spread":0.17638386949888432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144687917","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.0061437683,0.0000062460067,0.980023,0.0000360208,0.000174498,0.0000650273,0.0000028689112,0.00009318378,0.013455358],"genre_scores_gemma":[0.9562439,0.0000016071714,0.043398123,0.0001292311,0.000008040374,0.0000018421192,0.000015325897,0.0000024117032,0.00019953496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994819,0.000018378036,0.000117756616,0.00014146637,0.00015661225,0.00008389175],"domain_scores_gemma":[0.99953973,0.000018787996,0.000072009265,0.00030162715,0.00003696911,0.000030878215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000658152,0.000055210367,0.00007049506,0.00009175738,0.000030299509,0.000031586584,0.0006910229,0.000019668845,0.00015096435],"category_scores_gemma":[0.0000056964823,0.000042261458,0.000017980641,0.0002497059,0.000024152374,0.0005110829,0.00016505348,0.000025003554,0.000023201426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027832728,0.0012062497,0.18992673,0.0002220572,0.000107661006,0.000022190196,0.003168649,0.00010155741,0.003866829,0.5220918,0.012838596,0.26641983],"study_design_scores_gemma":[0.0011921636,0.0001674954,0.11179461,0.00007421104,0.00001471579,3.0140654e-7,0.000088720604,0.72673935,0.1494849,0.006028034,0.004008278,0.0004072431],"about_ca_topic_score_codex":0.00011278048,"about_ca_topic_score_gemma":0.0000054681327,"teacher_disagreement_score":0.9501001,"about_ca_system_score_codex":0.0000034505815,"about_ca_system_score_gemma":0.0000137666975,"threshold_uncertainty_score":0.17233722},"labels":[],"label_agreement":null},{"id":"W2145284542","doi":"10.1109/time.1998.674148","title":"Generalization for calendar attributes using domain generalization graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Generalization; Pruning; Computer science; Reachability; Graph; Artificial intelligence; Mathematics; Theoretical computer science","score_opus":0.054578747798892525,"score_gpt":0.2607013558819321,"score_spread":0.2061226080830396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145284542","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.0025152678,0.00010490389,0.99565226,0.0006250375,0.00033437434,0.000234812,0.00003784166,0.00017422099,0.00032126321],"genre_scores_gemma":[0.013079789,0.000088716566,0.98263305,0.00095664983,0.000196461,0.00002524505,0.00018489522,0.000016669626,0.0028185365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991241,0.000027202917,0.00017226115,0.00029289394,0.00016484149,0.00021867927],"domain_scores_gemma":[0.9995012,0.000014283565,0.000059912996,0.00031052373,0.00006964569,0.0000444266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015733342,0.00010257131,0.00008937988,0.00012957033,0.0001848974,0.00016290475,0.00040975827,0.000032839573,0.00006901889],"category_scores_gemma":[0.000010742319,0.00009439151,0.000048685128,0.00045764126,0.000016000722,0.0009986535,0.00012355753,0.000019250861,0.000015273628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012020463,0.00008075384,0.00063207216,0.000028880457,0.000030073634,0.0000031982831,0.00017809006,0.0032244665,0.0022023579,0.87007755,0.0938257,0.02971563],"study_design_scores_gemma":[0.0003021872,0.000023603094,0.00006910932,0.0000042246747,0.0000071354484,0.0000017335562,0.0000059184085,0.9385551,0.0012039491,0.011600019,0.048069898,0.00015712803],"about_ca_topic_score_codex":0.000022491673,"about_ca_topic_score_gemma":0.0000070329156,"teacher_disagreement_score":0.9353306,"about_ca_system_score_codex":0.00002414445,"about_ca_system_score_gemma":0.000004498487,"threshold_uncertainty_score":0.38491738},"labels":[],"label_agreement":null},{"id":"W2145352743","doi":"10.1002/jcc.20484","title":"An algorithm for three‐dimensional Voronoi S‐network","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Chemistry","topic":"Data Management and Algorithms","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 Calgary","funders":"Alexander von Humboldt-Stiftung","keywords":"Voronoi diagram; Delaunay triangulation; SPHERES; Algorithm; Realization (probability); Centroidal Voronoi tessellation; Computer science; Bowyer–Watson algorithm; Computational geometry; Mathematics; Geometry; Physics","score_opus":0.008499045044182228,"score_gpt":0.24048199801596423,"score_spread":0.231982952971782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145352743","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.008978055,0.00014765965,0.9897296,0.00040489537,0.00031252153,0.000060795097,0.000014646192,0.000028860035,0.00032300348],"genre_scores_gemma":[0.0655343,8.351581e-7,0.93156606,0.0001686655,0.0023755648,0.0000036930064,0.000116826144,0.000011849031,0.00022222719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987334,0.000012466833,0.00041459122,0.00018007935,0.00046213614,0.00019731474],"domain_scores_gemma":[0.9989218,0.0001274685,0.0003435204,0.00016580323,0.00035673362,0.00008468616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041042158,0.000119054326,0.00016795858,0.000036416706,0.000113620496,0.00015917174,0.00071427703,0.000043330652,0.000023032928],"category_scores_gemma":[0.000007940484,0.000110331406,0.00011788711,0.0001494206,0.000031000458,0.00074112276,0.000078424295,0.00011351069,0.00000398212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014946191,0.0002551624,0.00015901955,0.000023221084,0.00006682366,0.000039063856,0.0000074278255,0.7948957,0.0003100274,0.003866729,0.030790474,0.16957143],"study_design_scores_gemma":[0.00068779726,0.000069587935,0.0019426558,0.000020611178,0.000014441659,0.000091912574,0.0000019378592,0.80245554,0.00046672006,0.18730642,0.0067934655,0.00014890512],"about_ca_topic_score_codex":0.00000255859,"about_ca_topic_score_gemma":6.3995583e-7,"teacher_disagreement_score":0.18343969,"about_ca_system_score_codex":0.00003907659,"about_ca_system_score_gemma":0.00011577586,"threshold_uncertainty_score":0.4499184},"labels":[],"label_agreement":null},{"id":"W2145814045","doi":"10.1145/1097064.1097092","title":"Two ellipse-based pruning methods for group nearest neighbor queries","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Ellipse; Pruning; Tree traversal; Computer science; k-nearest neighbors algorithm; Query optimization; Rectangle; Minimum bounding box; Bounding overwatch; Point (geometry); Nearest neighbor search; k-d tree; Data mining; Algorithm; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.030422471733267113,"score_gpt":0.35255334716373604,"score_spread":0.3221308754304689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145814045","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.00008926958,0.00006109848,0.98812425,0.0028819826,0.0002606424,0.0002557865,0.0000022331753,0.00031841727,0.008006339],"genre_scores_gemma":[0.0048864717,0.0000040593213,0.9907124,0.0015525173,0.00020454879,0.000049359962,0.000020416739,0.000010719453,0.0025594996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989956,0.0000574559,0.00017595947,0.00035135445,0.00012079694,0.00029884916],"domain_scores_gemma":[0.9991145,0.00020804344,0.000054730666,0.0005170144,0.000037434154,0.00006824922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612309,0.00012782497,0.00012865622,0.00008845748,0.00015341582,0.00045363748,0.00086877454,0.000022852584,0.000071101145],"category_scores_gemma":[0.000039069368,0.00010829362,0.00006452534,0.00025291173,0.000032992048,0.0011982771,0.00023918379,0.000055990055,0.00006430846],"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.000003761321,0.000036013545,0.00004965639,0.000010679802,0.0000092172095,8.782274e-7,0.00004684136,0.00022481749,0.0002201197,0.28280732,0.0025187775,0.7140719],"study_design_scores_gemma":[0.00042694833,0.00005420359,0.0000899422,0.0000060663383,0.000005618867,3.7210975e-7,0.000017225986,0.6046733,0.0027084958,0.0016393556,0.39022863,0.00014980407],"about_ca_topic_score_codex":0.000038977392,"about_ca_topic_score_gemma":0.000058744725,"teacher_disagreement_score":0.71392214,"about_ca_system_score_codex":0.000021112839,"about_ca_system_score_gemma":0.000022747752,"threshold_uncertainty_score":0.44160855},"labels":[],"label_agreement":null},{"id":"W2145957360","doi":"10.1007/s00778-011-0230-1","title":"Maximizing bichromatic reverse nearest neighbor for L p -norm in two- and three-dimensional spaces","year":2011,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":33,"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":"Curse of dimensionality; Computer science; k-nearest neighbors algorithm; Norm (philosophy); Fixed-radius near neighbors; Best bin first; Space (punctuation); Algorithm; Nearest neighbor search; Theoretical computer science; Combinatorics; Mathematics; Data mining; Artificial intelligence; Cluster analysis","score_opus":0.046977370759670206,"score_gpt":0.2579352204925931,"score_spread":0.2109578497329229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145957360","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.5514968,0.0011292583,0.4329037,0.008761338,0.0019035339,0.000807393,0.000010502421,0.00010863827,0.002878831],"genre_scores_gemma":[0.63397783,0.00008722584,0.363766,0.0011735898,0.00045760165,0.00001773359,0.0000027028195,0.00002345283,0.0004938332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992262,0.00003655296,0.00018478569,0.00014518524,0.00017404425,0.00023319644],"domain_scores_gemma":[0.9994735,0.00008328381,0.000111718255,0.00023990606,0.000028391758,0.000063190775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084906584,0.000093595976,0.000112110996,0.00010717662,0.0002191027,0.00027093166,0.000641739,0.0000137939005,0.00003354101],"category_scores_gemma":[0.00003195816,0.000058749556,0.000035623976,0.00016901713,0.000052406405,0.00076205225,0.000293374,0.00014567154,0.000014974271],"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.00030164857,0.00066018023,0.030639822,0.00021318578,0.0004259837,0.0009030462,0.012468022,0.0006329119,0.0012680562,0.21602754,0.0412559,0.6952037],"study_design_scores_gemma":[0.0051279576,0.00044773635,0.07537672,0.00044422876,0.00008726793,0.00094190927,0.0005677615,0.68868095,0.00040717432,0.21871825,0.00848255,0.0007175011],"about_ca_topic_score_codex":0.00008908434,"about_ca_topic_score_gemma":0.000113958275,"teacher_disagreement_score":0.6944862,"about_ca_system_score_codex":0.000016075875,"about_ca_system_score_gemma":0.000028946568,"threshold_uncertainty_score":0.26126003},"labels":[],"label_agreement":null},{"id":"W2146327344","doi":"10.1007/s10844-010-0141-4","title":"Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods","year":2010,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":31,"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":"Skyline; Computer science; Uncertain data; Pruning; Probabilistic logic; Bounding overwatch; Data mining; Benchmark (surveying); Object (grammar); Reachability; Algorithm; Artificial intelligence","score_opus":0.08668100124270832,"score_gpt":0.3626044773832188,"score_spread":0.2759234761405105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146327344","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.0039842306,0.00005603836,0.9912395,0.0002728022,0.0022994182,0.0001229588,0.00001096186,0.00003286956,0.0019812095],"genre_scores_gemma":[0.34608674,0.0001548406,0.6517071,0.0005860624,0.00067171466,0.0000124009075,0.000074452284,0.000017218044,0.0006894541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982906,0.000069010086,0.0009200999,0.000122348,0.0004342899,0.00016363233],"domain_scores_gemma":[0.99799335,0.00018928024,0.0008365972,0.00057714235,0.00029989475,0.00010372453],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003585891,0.0001316861,0.00022725285,0.00038372434,0.00011971161,0.0011109496,0.0012712956,0.00005350827,0.0000027715998],"category_scores_gemma":[0.0005378506,0.0000964704,0.000036634065,0.00023583519,0.000033566157,0.0055286647,0.00036290195,0.00031018222,0.000020147783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037067584,0.00007939515,0.00014035634,0.00033939804,0.00012424204,0.000008552291,0.0035971734,0.11194417,0.0002753598,0.4305368,0.006126659,0.4467908],"study_design_scores_gemma":[0.00014558819,0.00008248197,0.000018843277,0.0001086914,0.000011270546,0.000079252335,0.00030636418,0.9216349,0.000073240524,0.0006477061,0.07678195,0.00010966838],"about_ca_topic_score_codex":0.000013626114,"about_ca_topic_score_gemma":0.0000022419497,"teacher_disagreement_score":0.8096908,"about_ca_system_score_codex":0.00003337209,"about_ca_system_score_gemma":0.00007629876,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"W2146776490","doi":"","title":"RankSQL: supporting ranking queries in relational database management systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Ranking (information retrieval); Information retrieval; Relational database management system; Relational database; Database; SQL; Conjunctive query; Spatial query; Web search query; World Wide Web; Web query classification; Search engine","score_opus":0.021944729448840936,"score_gpt":0.2572904370307163,"score_spread":0.23534570758187537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146776490","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.0015321613,0.0001083371,0.92763233,0.0013492287,0.00035286826,0.00028354002,0.0000045678194,0.00020662093,0.06853035],"genre_scores_gemma":[0.47461778,0.000057522786,0.5080056,0.00058904616,0.00024275025,0.00006352215,0.00013399064,0.000014575116,0.0162752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866515,0.0000364389,0.00034605805,0.00034567263,0.00032994532,0.00027675368],"domain_scores_gemma":[0.99937123,0.00004009006,0.00008003818,0.0004541425,0.000016618442,0.000037900918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084528833,0.000103895196,0.00010819204,0.00020538995,0.00008041962,0.00026894873,0.00060283236,0.000018709185,0.000066680426],"category_scores_gemma":[0.0000117425,0.00009640558,0.000024768355,0.00035274617,0.000015870375,0.002339257,0.00057894376,0.00007778458,0.00015606123],"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.0000024006001,0.000039018796,0.0014304359,0.00004052113,0.000014783303,0.000051382463,0.00012694206,0.0014742891,0.000006579746,0.92496073,0.0043145916,0.067538336],"study_design_scores_gemma":[0.0010056216,0.000012096111,0.0032976419,0.0000953731,0.000008043646,0.000008885883,0.0002625874,0.7477035,0.000051676936,0.0007215656,0.24650918,0.00032385156],"about_ca_topic_score_codex":0.00005382863,"about_ca_topic_score_gemma":0.000033226286,"teacher_disagreement_score":0.92423916,"about_ca_system_score_codex":0.00004375285,"about_ca_system_score_gemma":0.000009807602,"threshold_uncertainty_score":0.39313054},"labels":[],"label_agreement":null},{"id":"W2147033904","doi":"10.14778/1687627.1687702","title":"Power-law based estimation of set similarity join size","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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","funders":"","keywords":"Hash function; Exploit; Computer science; Set (abstract data type); Similarity (geometry); Algorithm; Data mining; Signature (topology); Representation (politics); Nearest neighbor search; Mathematics; Theoretical computer science; Pattern recognition (psychology); Artificial intelligence; Law","score_opus":0.013244692484878601,"score_gpt":0.23772138781357566,"score_spread":0.22447669532869705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147033904","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.50521785,0.0003095265,0.16400465,0.07835583,0.0022688874,0.005681021,0.00018784525,0.0010870283,0.24288738],"genre_scores_gemma":[0.95186794,0.0000029206983,0.047347084,0.0006768352,0.0000120641835,0.0000061032383,0.0000015429495,0.000003407336,0.00008207885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988799,0.0000057961624,0.00026946183,0.00022750917,0.00044030845,0.00017704135],"domain_scores_gemma":[0.9993206,0.000034521243,0.00025971324,0.00024340507,0.00010372294,0.000038021688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040692784,0.00011636167,0.00015944766,0.000048112463,0.00007168551,0.00008574753,0.00113078,0.000027506583,0.000013580965],"category_scores_gemma":[0.00008641793,0.00008492072,0.0000832758,0.0003195642,0.000048105634,0.0007320715,0.0002806361,0.00007289115,0.000003362216],"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.000040116716,0.00073275086,0.00063613616,0.0002438461,0.000062686166,0.0000013006453,0.0010119908,0.00076761394,0.034989346,0.921275,0.013934904,0.02630431],"study_design_scores_gemma":[0.0019761736,0.00073618774,0.016511053,0.0002923399,0.00006574018,0.000003990584,0.00013212302,0.17396654,0.70694554,0.09411918,0.0047675455,0.00048358325],"about_ca_topic_score_codex":0.00001843906,"about_ca_topic_score_gemma":4.151098e-7,"teacher_disagreement_score":0.8271558,"about_ca_system_score_codex":0.000031768825,"about_ca_system_score_gemma":0.00001480871,"threshold_uncertainty_score":0.34629664},"labels":[],"label_agreement":null},{"id":"W2147312192","doi":"10.1109/tkde.2006.73","title":"Approximate processing of massive continuous quantile queries over high-speed data streams","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"China Academy of Space Technology; University of New South Wales","keywords":"Computer science; Data stream mining; STREAMS; Quantile; Data mining; Parallel computing; Computer network; Statistics; Mathematics","score_opus":0.020542173346513697,"score_gpt":0.2531488894735193,"score_spread":0.23260671612700562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147312192","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.0045466716,0.00042738352,0.99323213,0.000034154662,0.0003738261,0.00013659979,0.0008634742,0.00018289709,0.00020284079],"genre_scores_gemma":[0.95709425,0.00009609415,0.041925237,0.0000069014486,0.000092239825,0.000006523728,0.0004843466,0.000022505428,0.0002719117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.000012469209,0.00025438092,0.0005469033,0.00014434825,0.00022440772],"domain_scores_gemma":[0.9983445,0.000053552212,0.000067129455,0.0014502899,0.00003809379,0.00004646311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017564607,0.00017950805,0.00021916971,0.00016425026,0.00009856889,0.0001997664,0.0013252309,0.000043473974,0.000008281096],"category_scores_gemma":[0.0000041187095,0.00017172452,0.000018771805,0.00032360517,0.000040351217,0.0023382246,0.0000908865,0.000120526034,0.00000661238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004830552,0.001348965,0.000106611806,0.001475528,0.00027309568,0.00005982704,0.00062941725,0.02520861,0.009699464,0.01511087,0.0075297537,0.9385095],"study_design_scores_gemma":[0.00042440637,0.000038520586,0.00016707051,0.00011155094,0.000041516807,0.0000035405797,0.000029654742,0.98854834,0.00545237,0.000047616075,0.0049022273,0.00023317686],"about_ca_topic_score_codex":0.00012682541,"about_ca_topic_score_gemma":0.000044518085,"teacher_disagreement_score":0.96333975,"about_ca_system_score_codex":0.000011380185,"about_ca_system_score_gemma":0.000026094154,"threshold_uncertainty_score":0.70027226},"labels":[],"label_agreement":null},{"id":"W2147851030","doi":"10.1109/time.2003.1214895","title":"Spatio-temporal data mining with expected distribution domain generalization graphs","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Generalization; Computer science; Domain (mathematical analysis); Data mining; Distribution (mathematics); Temporal database; Artificial intelligence; Information retrieval; Data science; Mathematics","score_opus":0.025006692456521137,"score_gpt":0.24285011470838905,"score_spread":0.21784342225186792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147851030","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.035753474,0.000012500816,0.9625275,0.00065847824,0.0001029601,0.000115848874,0.00003717831,0.00023201852,0.0005600123],"genre_scores_gemma":[0.45185342,0.0000062038494,0.5381465,0.00014746176,0.000049372593,0.0000076253436,0.009620247,0.0000065231225,0.00016266825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904764,0.000020731783,0.00013286909,0.00039041677,0.00024018447,0.00016817151],"domain_scores_gemma":[0.9989824,0.0000057773254,0.00006325373,0.0008662804,0.0000371124,0.000045149787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015061554,0.00009588381,0.00007330724,0.000056453944,0.000113922215,0.00028204982,0.00094874756,0.000019967916,0.0000135916325],"category_scores_gemma":[0.0000071405398,0.000075451026,0.000010713959,0.0005938689,0.000024519684,0.0019212407,0.00043202256,0.000029036079,0.000013593774],"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.00001859362,0.00021588885,0.019259477,0.000018565506,0.00006729068,0.000074280855,0.00055881654,0.00097553927,0.000056117304,0.92393374,0.02227708,0.032544587],"study_design_scores_gemma":[0.012647598,0.0010734971,0.07883787,0.00025939476,0.00011362397,0.00008394842,0.0013152909,0.6754857,0.0034804519,0.07759789,0.14577861,0.0033261408],"about_ca_topic_score_codex":0.00015716761,"about_ca_topic_score_gemma":0.00024148788,"teacher_disagreement_score":0.8463359,"about_ca_system_score_codex":0.00002664825,"about_ca_system_score_gemma":0.000029667184,"threshold_uncertainty_score":0.30768034},"labels":[],"label_agreement":null},{"id":"W2149065333","doi":"10.1109/icsmc.1994.400012","title":"Graphical forms for preference representation: considerations for practical application","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University; Carleton University; University of Waterloo","funders":"","keywords":"Preference; Computer science; Schema (genetic algorithms); Representation (politics); Flexibility (engineering); Process (computing); Preference elicitation; Artificial intelligence; Theoretical computer science; Machine learning; Information retrieval; Data mining; Human–computer interaction; Programming language; Mathematics","score_opus":0.16069616102711543,"score_gpt":0.3428448717452218,"score_spread":0.1821487107181064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149065333","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.000027739323,0.0000059277017,0.9724931,0.020322233,0.000083758845,0.0009653398,0.000010498048,0.00014138498,0.00594999],"genre_scores_gemma":[0.1237361,0.000011766741,0.87255055,0.00084983325,0.00008661751,0.0010400837,0.000041771185,0.000005247745,0.0016780539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992045,0.000010302912,0.00017247054,0.00033095936,0.00012578805,0.0001559625],"domain_scores_gemma":[0.99890655,0.00047376557,0.00005408344,0.00040979654,0.00010656443,0.000049243827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014967304,0.0000676257,0.000074743206,0.00005311177,0.00018294061,0.00026577452,0.00020912943,0.000031884803,0.00004603177],"category_scores_gemma":[0.00021474012,0.00005664179,0.00004881632,0.00016458535,0.000025427182,0.001190375,0.000078611025,0.000036047222,0.000030013609],"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.0000015411237,0.00005662161,0.00003318121,0.000006423333,0.000006239069,2.2305935e-7,0.000029867364,0.0000039895644,0.000031990367,0.9423627,0.041220993,0.01624622],"study_design_scores_gemma":[0.0004116629,0.00007288134,0.00016738342,0.0000014943737,0.000009594089,0.0000047777303,0.000016841417,0.6173289,0.00040306637,0.34911934,0.03236149,0.000102632956],"about_ca_topic_score_codex":0.0000025013817,"about_ca_topic_score_gemma":0.000010544121,"teacher_disagreement_score":0.6173249,"about_ca_system_score_codex":0.0000074408567,"about_ca_system_score_gemma":0.000011041396,"threshold_uncertainty_score":0.25628698},"labels":[],"label_agreement":null},{"id":"W2151322085","doi":"10.1109/iri.2008.4583036","title":"Fuzzy querying of nested XML","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; XML database; XML; Scope (computer science); Database; XML validation; Information retrieval; Efficient XML Interchange; Fuzzy logic; XML Schema Editor; Database query; Data mining; World Wide Web; Programming language; Artificial intelligence","score_opus":0.02914071064020381,"score_gpt":0.22418479782118206,"score_spread":0.19504408718097824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151322085","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.031897843,0.000042997675,0.73528755,0.0005981426,0.0003065414,0.000095145355,0.0000010076907,0.0002428818,0.23152788],"genre_scores_gemma":[0.8297877,0.000028346862,0.16133714,0.0003531061,0.00004166289,0.0000024531307,0.0000038304906,0.0000038072164,0.00844195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956006,0.000008777141,0.00009356823,0.000121641555,0.00012133005,0.00009460716],"domain_scores_gemma":[0.9996083,0.000014599679,0.000028201679,0.00030631194,0.000020083024,0.000022552496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007073345,0.000040617702,0.00006109352,0.00005272397,0.00003923659,0.000020495494,0.00049286685,0.00001002734,0.000014139528],"category_scores_gemma":[0.0000065924473,0.00003348642,0.000021163722,0.00023156274,0.000019723037,0.00051469734,0.00022632214,0.000021908681,0.000058518206],"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.000002204811,0.00013596413,0.0070470665,0.000028474502,0.000029870325,0.00009534763,0.00061639387,0.000043979893,0.00095099764,0.80126905,0.03655527,0.15322536],"study_design_scores_gemma":[0.0045961393,0.0006895159,0.2635183,0.00014858213,0.000042780495,0.00024148385,0.00046216903,0.3651556,0.051281966,0.051380835,0.25999904,0.002483589],"about_ca_topic_score_codex":0.00004824208,"about_ca_topic_score_gemma":0.0000023516839,"teacher_disagreement_score":0.7978899,"about_ca_system_score_codex":0.00000316923,"about_ca_system_score_gemma":0.000009745073,"threshold_uncertainty_score":0.13655366},"labels":[],"label_agreement":null},{"id":"W2151427378","doi":"","title":"Learning a Metric Space for Neighbourhood Topology Estimation: Application to Manifold Learning","year":2013,"lang":"en","type":"article","venue":"Asian Conference on Machine Learning","topic":"Data Management and Algorithms","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; McGill University","funders":"","keywords":"Nonlinear dimensionality reduction; Manifold alignment; Topology (electrical circuits); Manifold (fluid mechanics); Euclidean space; Cluster analysis; Metric (unit); Neighbourhood (mathematics); Density estimation; Computer science; Graph; Mathematics; Euclidean distance; Algorithm; Theoretical computer science; Artificial intelligence; Dimensionality reduction; Mathematical analysis; Combinatorics; Statistics","score_opus":0.013947475986548628,"score_gpt":0.2649391483983309,"score_spread":0.2509916724117823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151427378","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.0017358715,0.000024399498,0.96081746,0.012410698,0.00015866387,0.0008317763,0.0000013180957,0.0005235147,0.023496326],"genre_scores_gemma":[0.9041481,0.000012108325,0.08895947,0.00035241738,0.000114833696,0.0003017857,0.00008731352,0.000031278883,0.0059926854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977033,0.0002137577,0.00033435793,0.0008244794,0.00033618702,0.0005879013],"domain_scores_gemma":[0.99867547,0.00022079285,0.00026694903,0.00046732344,0.0001673838,0.00020209547],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005522904,0.00030455051,0.0003122648,0.0005440555,0.0005876585,0.00079738337,0.0010259679,0.00009730195,0.00026268326],"category_scores_gemma":[0.00047826828,0.00030475392,0.00008614146,0.0009221944,0.00002364802,0.00087456347,0.0004117576,0.00070896384,0.0012459465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007428826,0.00003678257,0.0016972045,0.000025143348,0.000024388424,0.000003024886,0.00048121068,0.013875246,0.00019465703,0.2470137,0.00019540469,0.7364458],"study_design_scores_gemma":[0.00046383133,0.000817703,0.0048943395,0.000032634667,0.000014784998,0.000006638233,0.000420973,0.97155803,0.00009395137,0.0029215198,0.018393926,0.0003816548],"about_ca_topic_score_codex":0.00025778468,"about_ca_topic_score_gemma":0.00001742508,"teacher_disagreement_score":0.9576828,"about_ca_system_score_codex":0.000063561034,"about_ca_system_score_gemma":0.00004247754,"threshold_uncertainty_score":0.99994045},"labels":[],"label_agreement":null},{"id":"W2151749331","doi":"10.1109/tsmcb.2005.848489","title":"MetricMap: An Embedding Technique for Processing Distance-Based Queries in Metric Spaces","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Data Management and Algorithms","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":"Western University","funders":"National Institute of General Medical Sciences; National Cancer Institute","keywords":"Embedding; Oracle; Euclidean distance; Metric space; Cluster analysis; Dimension (graph theory); Mathematics; Euclidean space; Tree (set theory); Edit distance; Class (philosophy); Distance measures; Computer science; Space (punctuation); Metric (unit); Data mining; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Combinatorics","score_opus":0.02385153451401728,"score_gpt":0.2732672958122047,"score_spread":0.24941576129818743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151749331","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.002908203,0.0008170914,0.99319094,0.000285033,0.00048343503,0.0012277148,0.000053485055,0.00023737874,0.0007966905],"genre_scores_gemma":[0.94888353,0.00018036542,0.048026953,0.000106079635,0.00014321794,0.0005619297,0.0000131498045,0.00004736573,0.0020373892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972941,0.00013321832,0.0006455224,0.00084904185,0.00049042114,0.00058766623],"domain_scores_gemma":[0.99856937,0.00018554997,0.000229848,0.0006790577,0.0001257981,0.00021038072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007418178,0.0004018731,0.00045067936,0.0010043175,0.00028343318,0.001009599,0.0007273574,0.00016139193,0.0000080262125],"category_scores_gemma":[0.000012772017,0.00039768196,0.00009791908,0.001405953,0.000117904194,0.00088786095,0.000012402035,0.00026630517,0.000012962178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024705613,0.0032401283,0.00068683224,0.002145552,0.00025264977,0.00007067218,0.0038118516,0.22637692,0.0018418503,0.043582544,0.0023705226,0.7153734],"study_design_scores_gemma":[0.0017386441,0.00064986636,0.00020654133,0.000495408,0.00009225576,0.000017748534,0.0004704496,0.88854265,0.011942187,0.0003594546,0.09443961,0.0010452025],"about_ca_topic_score_codex":0.00012060717,"about_ca_topic_score_gemma":0.00031254298,"teacher_disagreement_score":0.94597536,"about_ca_system_score_codex":0.00013752416,"about_ca_system_score_gemma":0.0000657394,"threshold_uncertainty_score":0.99984753},"labels":[],"label_agreement":null},{"id":"W2152021196","doi":"10.1109/34.895981","title":"Validity measures for the fuzzy cluster analysis of orientations","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Data Management and Algorithms","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":"Rocscience (Canada)","funders":"","keywords":"Fuzzy set; Cluster analysis; Fuzzy logic; Artificial intelligence; Computer science; Fuzzy clustering; Data mining; Identification (biology); Discontinuity (linguistics); Pattern recognition (psychology); Mathematics","score_opus":0.03971663047023295,"score_gpt":0.29447997799330217,"score_spread":0.25476334752306923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152021196","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.0018589215,0.000045618464,0.9967035,0.0007448109,0.000107026644,0.00018566716,0.00020882605,0.000033891494,0.00011172616],"genre_scores_gemma":[0.99598944,0.00049197074,0.002366888,0.0004179934,0.000013384932,0.000046858113,0.000023094335,0.0000051737784,0.0006451812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871206,0.00007559389,0.0003614745,0.0003955625,0.00028508803,0.00017023411],"domain_scores_gemma":[0.9987496,0.00036517088,0.00009302614,0.00064830703,0.00008625527,0.000057643087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043904802,0.00015102373,0.00029909628,0.0005936614,0.00027942233,0.00015131649,0.00062309386,0.000030493338,0.0003321774],"category_scores_gemma":[0.000003760386,0.00010517471,0.00047206643,0.0023585872,0.00007190296,0.00028019692,0.000005336764,0.000099812896,0.000011202331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010646302,0.00011864958,0.0005112188,0.000006411248,0.0029432727,4.7617718e-7,0.00030019763,0.12089764,0.000009141089,0.00016383526,0.000037863778,0.87500066],"study_design_scores_gemma":[0.00010742081,0.00008730864,0.0039549503,0.0000045290913,0.008034147,6.126432e-7,0.000063391875,0.9801612,0.0061659496,0.00032632754,0.0009067805,0.0001873905],"about_ca_topic_score_codex":0.00095124065,"about_ca_topic_score_gemma":0.002414108,"teacher_disagreement_score":0.9943366,"about_ca_system_score_codex":0.000012154536,"about_ca_system_score_gemma":0.000008516421,"threshold_uncertainty_score":0.42889002},"labels":[],"label_agreement":null},{"id":"W2152170845","doi":"10.1109/icde.2004.1320023","title":"Modeling uncertainties in publish/subscribe systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Publication; Dissemination; Computer science; Set (abstract data type); Matching (statistics); Information Dissemination; World Wide Web; Process (computing); Data science; Information retrieval; Telecommunications","score_opus":0.027176091580084896,"score_gpt":0.22911141836129092,"score_spread":0.20193532678120601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152170845","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.005174237,0.00011241574,0.97569114,0.0012292383,0.0005500276,0.00010810368,6.6445256e-7,0.00019702355,0.016937157],"genre_scores_gemma":[0.970127,0.000017814822,0.028144369,0.00023306682,0.00005482411,0.000014210034,0.0000063625544,0.0000047403064,0.0013976438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914056,0.000012562149,0.00016716614,0.00025425063,0.00019894849,0.0002264947],"domain_scores_gemma":[0.999526,0.000006284044,0.000016456035,0.0003831325,0.000030468613,0.000037620568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026888464,0.00007833003,0.00009181823,0.00016667918,0.000038622482,0.0008360425,0.0008784745,0.000022792769,0.0000044570406],"category_scores_gemma":[0.000012606709,0.00006603955,0.000020497866,0.0004098661,0.000009569057,0.002394411,0.000312185,0.00006395913,0.00005727383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.6951774e-7,0.00002696801,0.00006313883,0.000011175639,0.0000042296774,0.000015258953,0.00017795456,0.24896814,0.0000047355134,0.746077,0.00061366876,0.004037273],"study_design_scores_gemma":[0.00025883058,0.000011002445,0.000026262966,0.000021031994,8.1739825e-7,0.0000016202094,0.0002510182,0.98878163,0.000013161245,0.009167968,0.0013569382,0.0001097213],"about_ca_topic_score_codex":0.0018312908,"about_ca_topic_score_gemma":0.00011818156,"teacher_disagreement_score":0.9649527,"about_ca_system_score_codex":0.000049571412,"about_ca_system_score_gemma":0.000027677734,"threshold_uncertainty_score":0.8061977},"labels":[],"label_agreement":null},{"id":"W2152729153","doi":"10.1109/ideas.2002.1029674","title":"Clustering spatial data in the presence of obstacles: a density-based approach","year":2003,"lang":"en","type":"article","venue":"Proceedings - International Database Engineering and Applications Symposium","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Cluster analysis; Constrained clustering; Computer science; CURE data clustering algorithm; Correlation clustering; Constraint (computer-aided design); Data mining; Data stream clustering; Canopy clustering algorithm; Clustering high-dimensional data; Fuzzy clustering; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01807254718542831,"score_gpt":0.23750204376065603,"score_spread":0.21942949657522773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152729153","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.0012092381,0.000041911808,0.99648196,0.0003748298,0.00007230385,0.00030532296,0.00009131429,0.000050722774,0.0013724244],"genre_scores_gemma":[0.81449735,0.000050499562,0.18469714,0.000078614066,0.000082270315,0.00020501838,0.00035376582,0.000009574081,0.0000257406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989563,0.0000074799445,0.00021331383,0.00039887542,0.0002824101,0.0001415813],"domain_scores_gemma":[0.99925095,0.0000812858,0.00007586218,0.00049438945,0.00006396903,0.000033573106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055772567,0.00011132796,0.0000913524,0.0001593534,0.000053442378,0.00019723586,0.0017001161,0.000021187994,0.0000012430464],"category_scores_gemma":[0.00007822928,0.00009667585,0.000014984151,0.0003398132,0.000029223631,0.0008169729,0.00047132562,0.00011574127,0.0000016899307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001385631,0.000741294,0.004768793,0.0007837085,0.000089554494,0.000005639302,0.0009303477,0.012826264,0.015801167,0.9552336,0.001162473,0.0076433197],"study_design_scores_gemma":[0.00023031658,0.000008018203,0.0003749624,0.00004259252,0.0000083652185,0.000012108596,0.00008037308,0.98027295,0.0007606051,0.00009833647,0.017987547,0.00012383543],"about_ca_topic_score_codex":0.000040893552,"about_ca_topic_score_gemma":0.0000022937022,"teacher_disagreement_score":0.9674467,"about_ca_system_score_codex":0.000015168405,"about_ca_system_score_gemma":0.000016957354,"threshold_uncertainty_score":0.39423266},"labels":[],"label_agreement":null},{"id":"W2153516438","doi":"10.1109/icde.1998.655809","title":"High dimensional similarity joins: algorithms and performance evaluation","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":54,"is_retracted":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":"Joins; Search engine indexing; Computer science; Feature (linguistics); Generalization; Algorithm; Variety (cybernetics); Theoretical computer science; Mathematics; Data mining; Artificial intelligence","score_opus":0.040210212335515305,"score_gpt":0.24321096475871068,"score_spread":0.20300075242319537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153516438","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.49879998,0.00092721084,0.46089575,0.009211745,0.0021767458,0.0011003461,0.000015673799,0.00081413187,0.02605841],"genre_scores_gemma":[0.82921815,0.00013072485,0.1669793,0.0010354297,0.00011197999,0.000019104407,0.000019526828,0.0000060128673,0.0024797795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989096,0.000031437055,0.00012838069,0.00031389314,0.0004466093,0.00017009684],"domain_scores_gemma":[0.99949104,0.000020868558,0.000035153313,0.00033329678,0.00006351318,0.000056159613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004375599,0.00009460844,0.000083615836,0.000068636,0.00013877754,0.0001750603,0.00031023924,0.000026336265,0.00034974059],"category_scores_gemma":[0.000015200432,0.00007869209,0.000016338801,0.00019005651,0.000029225199,0.0013607995,0.00033557537,0.000064786036,0.0001347524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.9267505e-7,0.00006229133,0.0005027177,0.0000062479758,0.000011528664,0.0000029727432,0.000055541113,0.000094132796,0.00001646992,0.010835049,0.0110866055,0.9773257],"study_design_scores_gemma":[0.00034122646,0.00005631142,0.017555092,0.000005467936,0.000007034448,0.0000040535797,0.0000025530262,0.9791736,0.00015653118,0.0007472801,0.0018298564,0.00012096675],"about_ca_topic_score_codex":0.000016835462,"about_ca_topic_score_gemma":0.000001974642,"teacher_disagreement_score":0.9790795,"about_ca_system_score_codex":0.000017738863,"about_ca_system_score_gemma":0.000005979179,"threshold_uncertainty_score":0.38294142},"labels":[],"label_agreement":null},{"id":"W2153974857","doi":"10.14778/3402707.3402754","title":"Efficient rank join with aggregation constraints","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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 British Columbia","funders":"","keywords":"Join (topology); Computer science; Rank (graph theory); Probabilistic logic; Semantics (computer science); Theoretical computer science; Data mining; Artificial intelligence; Mathematics; Programming language","score_opus":0.01904745898815237,"score_gpt":0.1970963168557973,"score_spread":0.1780488578676449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153974857","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.60174406,0.00016285547,0.113404095,0.0028814964,0.0012823336,0.002991883,0.0000183265,0.0005226342,0.27699232],"genre_scores_gemma":[0.96600693,0.0000054811358,0.033579387,0.000099674704,0.000019677846,0.00002500987,4.5881185e-7,0.000005642871,0.00025772263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902564,0.00000387405,0.00017157457,0.00024487753,0.00036169853,0.00019233786],"domain_scores_gemma":[0.99947006,0.000007924704,0.00019218386,0.00018522344,0.0001030137,0.0000415713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027603665,0.00011039282,0.00010745942,0.00006884943,0.00008116889,0.000069131376,0.000981235,0.00001712151,0.000023691991],"category_scores_gemma":[0.000016650622,0.000065974054,0.00004374979,0.00030637666,0.00012458814,0.00021788021,0.00040701675,0.00006237887,0.000014783052],"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.000070737166,0.00072849786,0.0068533295,0.00019784346,0.00019565817,0.0000052010814,0.006316897,0.00006390357,0.007089181,0.8023242,0.0038459194,0.17230868],"study_design_scores_gemma":[0.006278842,0.0011124474,0.037374686,0.0010143685,0.00021437342,0.0000978485,0.0017400839,0.06704925,0.85529274,0.023329943,0.005187639,0.0013077559],"about_ca_topic_score_codex":0.000017976505,"about_ca_topic_score_gemma":6.369735e-7,"teacher_disagreement_score":0.8482036,"about_ca_system_score_codex":0.000026271971,"about_ca_system_score_gemma":0.000014708351,"threshold_uncertainty_score":0.2690344},"labels":[],"label_agreement":null},{"id":"W2154768509","doi":"10.14778/1453856.1453934","title":"Efficient network aware search in collaborative tagging sites","year":2008,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":112,"is_retracted":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; Popularity; Cluster analysis; Seekers; Context (archaeology); Upper and lower bounds; Heuristic; Space (punctuation); Information retrieval; Data mining; Machine learning; Artificial intelligence; Mathematics; Geography","score_opus":0.018816654655215464,"score_gpt":0.23477065336095104,"score_spread":0.2159539987057356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154768509","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.9747671,0.00035982757,0.00432007,0.004400143,0.00048864394,0.001326805,0.000009366853,0.00015596596,0.014172111],"genre_scores_gemma":[0.9895294,0.000048593552,0.00972097,0.00018131685,0.000069703354,0.00003373873,0.0000011088049,0.0000070043347,0.0004082226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986108,0.000011078361,0.00023007812,0.00031239146,0.0004804363,0.00035524115],"domain_scores_gemma":[0.999478,0.00003446865,0.00011743337,0.00017955517,0.00014571472,0.00004486928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004507724,0.00012700396,0.00016176351,0.00010441744,0.00020938404,0.00008293162,0.0012235133,0.000022817354,0.0000064809333],"category_scores_gemma":[0.000027871212,0.000091118745,0.000047503312,0.0013564816,0.00008518548,0.00023501576,0.0011413633,0.00012440185,0.000012018997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013794436,0.0021178825,0.30759266,0.0006833361,0.00030709882,0.00007817216,0.038362216,0.07795362,0.016759776,0.40205416,0.12662037,0.027332757],"study_design_scores_gemma":[0.0035446377,0.00045877375,0.06893806,0.00077425846,0.000038441878,0.000036559373,0.0031868154,0.8175385,0.085904926,0.0046848003,0.013697199,0.0011970558],"about_ca_topic_score_codex":0.000024363851,"about_ca_topic_score_gemma":0.0000025083327,"teacher_disagreement_score":0.73958486,"about_ca_system_score_codex":0.00007358609,"about_ca_system_score_gemma":0.000035867382,"threshold_uncertainty_score":0.37157145},"labels":[],"label_agreement":null},{"id":"W2154900736","doi":"10.1145/375663.375693","title":"SPARTAN","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":69,"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":"Spartan; Computer science; Operating system; Field-programmable gate array","score_opus":0.017262406094311268,"score_gpt":0.22872685475344537,"score_spread":0.2114644486591341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154900736","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.0007107478,0.0000044308863,0.6634914,0.0009682329,0.00012151534,0.00001905532,7.766386e-8,0.000117370735,0.33456713],"genre_scores_gemma":[0.36366507,0.000076551754,0.35027492,0.005177044,0.00033166903,0.0000074032387,0.0000065199874,0.0000069803486,0.28045383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99970925,0.0000049801906,0.000038089398,0.00009352796,0.00006260575,0.00009155595],"domain_scores_gemma":[0.9997232,0.000006508688,0.0000070920605,0.00023682951,0.000006232413,0.000020133928],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000629108,0.000024529092,0.000023172868,0.000021388027,0.000030215662,0.000056942954,0.00040951354,0.000005793752,0.00016813006],"category_scores_gemma":[0.000002506578,0.000019374744,0.0000087594335,0.00013365496,0.0000042863353,0.0004260636,0.00017260159,0.000017565682,0.0008227789],"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":[2.3617041e-7,0.000012713722,0.0021627613,7.164993e-7,0.0000034414832,0.000026384592,0.000028197897,0.0000014562052,0.000014403165,0.7123201,0.06485338,0.22057626],"study_design_scores_gemma":[0.00009591116,0.000011343214,0.004339095,0.0000010446599,6.578996e-7,0.000002325425,0.000011560872,0.029134836,0.000049072263,0.0059890845,0.96029794,0.00006711381],"about_ca_topic_score_codex":0.000008559568,"about_ca_topic_score_gemma":0.0000040707364,"teacher_disagreement_score":0.8954446,"about_ca_system_score_codex":0.0000027242093,"about_ca_system_score_gemma":0.0000022994109,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2155121477","doi":"10.1145/1321440.1321508","title":"Rk-hist","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science","score_opus":0.009623351704832018,"score_gpt":0.23530943752982364,"score_spread":0.2256860858249916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155121477","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.0002070494,0.0000074858417,0.7209567,0.00037129823,0.00017532836,0.000018060278,1.1230539e-7,0.00011488275,0.27814913],"genre_scores_gemma":[0.28305265,0.0000072351418,0.63444304,0.003041949,0.00020910251,0.0000014628228,0.0000056496588,0.0000055085557,0.079233415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996105,0.0000021637277,0.0000558122,0.00011441385,0.00009338368,0.00012371982],"domain_scores_gemma":[0.9996751,0.000011580441,0.000009824209,0.00026332116,0.000008381264,0.00003176875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022830247,0.000030917687,0.00002613927,0.000039333467,0.000031150616,0.00008866054,0.0005077301,0.0000074915692,0.000042074884],"category_scores_gemma":[0.0000035926926,0.00002505213,0.000012365366,0.00015310202,0.00000790784,0.00039541515,0.00020368739,0.000020117528,0.00046798267],"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":[2.5602947e-7,0.000014056113,0.00017720825,0.000001069572,0.0000022971797,0.000017992355,0.000021771422,3.0143678e-7,0.00003463638,0.61546683,0.032528747,0.35173482],"study_design_scores_gemma":[0.00017142786,0.000026400954,0.008676834,0.0000020076711,0.0000013823582,0.0000030067733,0.000020878038,0.010755056,0.0016108892,0.005386127,0.9731957,0.00015030314],"about_ca_topic_score_codex":0.000012626851,"about_ca_topic_score_gemma":0.000009163695,"teacher_disagreement_score":0.9406669,"about_ca_system_score_codex":0.0000055996175,"about_ca_system_score_gemma":0.000002707556,"threshold_uncertainty_score":0.6015127},"labels":[],"label_agreement":null},{"id":"W2155352045","doi":"10.54419/msztj8","title":"Automated aggregation of geographic objects. A new approach to the conceptual generalisation of geographic databases","year":2003,"lang":"en","type":"book","venue":"Publications on geodesy. New series","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":38,"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":"Rijkswaterstaat","keywords":"Computer science; Database; Information retrieval; Data science; Geography","score_opus":0.04685294653383381,"score_gpt":0.2573177431917173,"score_spread":0.21046479665788348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155352045","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.0005329505,0.0018140037,0.63658017,0.013263639,0.0014290528,0.006047843,0.0017254703,0.0024332013,0.33617368],"genre_scores_gemma":[0.0044631637,0.0012752266,0.25423187,0.0020101846,0.0006146175,0.0005705898,0.016515741,0.00013690423,0.7201817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701643,0.00015866282,0.0007696902,0.0008607541,0.0008250976,0.0003693748],"domain_scores_gemma":[0.9957864,0.00011394627,0.00084648846,0.0026223361,0.0004290427,0.00020175401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005714877,0.00041755414,0.00048538687,0.0012894783,0.00024328406,0.0003688197,0.002411088,0.00014762889,0.000056538927],"category_scores_gemma":[0.00022700058,0.00035408328,0.00019223259,0.0018690466,0.0003266875,0.0018185301,0.00042996765,0.00024036605,0.000041541283],"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.000010079698,0.00014510445,0.00024376232,0.00006846625,0.00019283763,1.5979388e-7,0.00060784083,0.0007605037,0.000015418744,0.66651404,0.31944492,0.011996859],"study_design_scores_gemma":[0.000677972,0.00021077174,0.00302122,0.0001943217,0.00019869786,0.000009425629,0.00017686843,0.014161642,0.00037790957,0.008994888,0.97116745,0.0008088524],"about_ca_topic_score_codex":0.000609002,"about_ca_topic_score_gemma":0.0001581602,"teacher_disagreement_score":0.65751916,"about_ca_system_score_codex":0.00005331686,"about_ca_system_score_gemma":0.00096236164,"threshold_uncertainty_score":0.9998911},"labels":[],"label_agreement":null},{"id":"W2155858469","doi":"10.5772/13720","title":"Using Markov Models to Mine Temporal and Spatial Data","year":2011,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Data Management and Algorithms","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":"ASTER","funders":"École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg; Centre National de la Recherche Scientifique; Institut National de la Recherche Agronomique; Agence Nationale de la Recherche","keywords":"Markov model; Computer science; Markov chain; Data mining; Variable-order Markov model; Software; Markov process; Hidden Markov model; Spatial analysis; Artificial intelligence; Machine learning; Mathematics; Statistics; Programming language","score_opus":0.15771231079294193,"score_gpt":0.28394901365300773,"score_spread":0.1262367028600658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155858469","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.000005905556,0.0000472642,0.6611733,0.000040273273,0.00030928905,0.00024651262,0.00011495342,0.0000966552,0.33796585],"genre_scores_gemma":[0.010989504,0.000021286305,0.3584509,0.00071850594,0.0005576226,0.00001074586,0.00023552148,0.000096669064,0.62891924],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982978,0.000009485849,0.00028997337,0.00087333715,0.00028132016,0.0002480844],"domain_scores_gemma":[0.9976299,0.00001601754,0.00013285143,0.0020373012,0.00005355465,0.00013040296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025306118,0.00031526867,0.0002943636,0.0002587929,0.00006800886,0.00026996186,0.002622526,0.00013911627,0.000037900063],"category_scores_gemma":[0.0000054103552,0.00030351986,0.000039587667,0.000015317331,0.00007332566,0.00044702625,0.0063713845,0.00022457649,0.000046256962],"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.000016805008,0.0000117072,0.000002497103,0.000051646584,0.00010301899,0.00018144044,0.00021994278,6.1998463e-7,0.00017400982,0.08966868,0.0037218737,0.9058477],"study_design_scores_gemma":[0.0004351299,0.0002163858,0.0000025695017,0.00064709294,0.00011433197,0.00006135533,0.000007602782,0.12091408,0.0008351921,0.23815843,0.6371631,0.0014447328],"about_ca_topic_score_codex":0.00091541815,"about_ca_topic_score_gemma":0.00025652855,"teacher_disagreement_score":0.90440303,"about_ca_system_score_codex":0.00002623635,"about_ca_system_score_gemma":0.000048955033,"threshold_uncertainty_score":0.9999417},"labels":[],"label_agreement":null},{"id":"W2156171684","doi":"10.31979/etd.hwkh-5782","title":"Optimizing a Web Search Engine","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Bigram; Search engine; Information retrieval; Search analytics; Computer science; Spamdexing; Metasearch engine; Web search engine; Weighting; Web crawler; Web search query; Relevance (law); Organic search; Word (group theory); Search-oriented architecture; Inverted index; World Wide Web; Phrase search; Search engine indexing; Artificial intelligence; Trigram; Mathematics","score_opus":0.022029956291254336,"score_gpt":0.27377034284325674,"score_spread":0.2517403865520024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156171684","genre_codex":"other","genre_gemma":"methods","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.0016356576,0.000958661,0.42349297,0.00030939007,0.003708962,0.0004000052,0.0000094353145,0.0007409381,0.568744],"genre_scores_gemma":[0.029895505,0.00022446872,0.49293485,0.0001835448,0.0006967137,0.000043901196,0.0019649582,0.000048567246,0.4740075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989431,0.00001577104,0.00013357977,0.00029573825,0.00030525864,0.00030656994],"domain_scores_gemma":[0.9993121,0.000018687355,0.000038646434,0.0005123438,0.00004333443,0.0000748594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022924575,0.00015210883,0.0001350061,0.00020520586,0.00006219235,0.00029971008,0.0011418421,0.00007586273,0.000273889],"category_scores_gemma":[0.000004902065,0.00013440005,0.000054302083,0.0002705672,0.000004308269,0.0008392091,0.00020135935,0.00017370743,0.00059264526],"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.0000053480785,0.00012226563,0.000023212426,0.00025057947,0.000112653004,0.000027327365,0.0016826924,0.000050141574,0.00043743072,0.11167897,0.028986996,0.8566224],"study_design_scores_gemma":[0.0010545667,0.00012976571,0.0027382665,0.00028040193,0.00010731991,0.0000071712425,0.0011183881,0.60292095,0.006105942,0.0006609314,0.38261425,0.002262033],"about_ca_topic_score_codex":0.000022202987,"about_ca_topic_score_gemma":0.000024960773,"teacher_disagreement_score":0.85436034,"about_ca_system_score_codex":0.000017436396,"about_ca_system_score_gemma":0.00004145043,"threshold_uncertainty_score":0.76174533},"labels":[],"label_agreement":null},{"id":"W2156276760","doi":"","title":"Wavelet-based relative prefix sum methods for range sum queries in data cubes","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"University of Toronto; Acadia University","keywords":"Prefix; Computer science; Range (aeronautics); Wavelet; Cube (algebra); Algorithm; Combinatorics; Mathematics; Data mining; Artificial intelligence","score_opus":0.10394108600485404,"score_gpt":0.3455550852004152,"score_spread":0.2416139991955612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156276760","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.00011855263,0.00014596709,0.98402405,0.0042355787,0.00027757417,0.00036589397,0.000082020335,0.00011024731,0.010640104],"genre_scores_gemma":[0.00506441,0.000030168007,0.9916174,0.0003424769,0.000060787646,0.00006201422,0.000101425845,0.000011586608,0.002709731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866325,0.0001424986,0.00020895447,0.0005253567,0.00015543403,0.00030448742],"domain_scores_gemma":[0.998279,0.0003571616,0.00006387772,0.001219192,0.000033047683,0.000047718175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009161645,0.00013390605,0.00018349958,0.00013361046,0.000088779474,0.00016818094,0.0017203953,0.00004355289,0.00010179951],"category_scores_gemma":[0.00021122635,0.00012081995,0.000036631583,0.0003605236,0.00006262609,0.0017676135,0.00066794996,0.00010512363,0.00003369024],"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.000013031516,0.00015236302,0.00024361107,0.00006007302,0.000029701587,0.000011468178,0.0005140493,0.000005251752,0.00028666458,0.09006304,0.05194021,0.8566805],"study_design_scores_gemma":[0.0007235176,0.000053713848,0.00042339304,0.000024841976,0.000010041624,4.8192084e-7,0.000022232676,0.7673733,0.00078449753,0.013538008,0.216848,0.00019796878],"about_ca_topic_score_codex":0.00001669666,"about_ca_topic_score_gemma":0.00003458067,"teacher_disagreement_score":0.85648257,"about_ca_system_score_codex":0.000025537289,"about_ca_system_score_gemma":0.000015504287,"threshold_uncertainty_score":0.49268943},"labels":[],"label_agreement":null},{"id":"W2156647424","doi":"10.1109/icde.1994.282996","title":"A query sampling method for estimating local cost parameters in a multidatabase system","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":71,"is_retracted":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; Sampling (signal processing); Query optimization; Class (philosophy); Sample (material); Data mining; Artificial intelligence; Detector","score_opus":0.08598551938416749,"score_gpt":0.32345012324581546,"score_spread":0.23746460386164797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156647424","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.0001603486,0.00001816714,0.99804896,0.00019483418,0.0002671809,0.0004950654,0.000012366537,0.00020652378,0.0005965417],"genre_scores_gemma":[0.01082052,8.3401784e-7,0.9886258,0.00019978615,0.000027562917,0.000114863906,0.000011918716,0.000007591098,0.00019109486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884254,0.000051025923,0.00025865991,0.00039831173,0.00014168993,0.00030776323],"domain_scores_gemma":[0.99901587,0.00041200165,0.00006217306,0.0004263989,0.000021204985,0.00006235623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073320867,0.00011600312,0.00016298625,0.00014361911,0.00007328732,0.00022374102,0.0005590861,0.000024886056,0.0000052293817],"category_scores_gemma":[0.00008463886,0.00010378242,0.000045752236,0.00030323985,0.000014378889,0.00079111883,0.0002775061,0.00006985713,0.000038081795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032885775,0.00007168238,0.00005395033,0.00018404615,0.000016109552,0.000027367874,0.00023076308,0.02081501,0.000020813339,0.03448728,0.0018759138,0.9422138],"study_design_scores_gemma":[0.00046654607,0.000018822133,0.000011283063,0.00008470141,0.0000044980325,0.000005876735,0.00020212003,0.9978372,0.00013217803,0.00006673541,0.0010276759,0.00014236465],"about_ca_topic_score_codex":0.00032631884,"about_ca_topic_score_gemma":0.000045844343,"teacher_disagreement_score":0.9770222,"about_ca_system_score_codex":0.00006529887,"about_ca_system_score_gemma":0.0000056095187,"threshold_uncertainty_score":0.42321244},"labels":[],"label_agreement":null},{"id":"W2156892372","doi":"10.1007/s00778-009-0162-1","title":"Threshold-based probabilistic top-k dominating queries","year":2009,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":58,"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":"Randomized algorithm; Scalability; Probabilistic logic; Computer science; Computation; Uncertain data; Set (abstract data type); Efficient algorithm; Dominating set; Algorithm; Theoretical computer science; Data mining; Artificial intelligence; Database","score_opus":0.015818699428412988,"score_gpt":0.24787564485482708,"score_spread":0.23205694542641409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156892372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04245729,0.0003537399,0.90752685,0.034562666,0.0010406319,0.00028166352,0.0000020745995,0.0002081068,0.01356695],"genre_scores_gemma":[0.94902843,0.000016560154,0.04769823,0.0021261044,0.00046322617,0.0000032609175,0.0000013971055,0.0000062928702,0.0006564743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908096,0.000053534208,0.00018807492,0.00013885724,0.00029186884,0.0002467116],"domain_scores_gemma":[0.9993264,0.000057022626,0.00011289282,0.00039412867,0.0000513405,0.00005821304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085827,0.000096133816,0.00009421365,0.00006827714,0.00039130013,0.0007517746,0.0013023642,0.000016669088,0.00002908086],"category_scores_gemma":[0.00006427601,0.00005745108,0.000057264337,0.0002442651,0.000045532357,0.0006292971,0.000109887944,0.00021571323,0.000030155585],"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.000022368713,0.00017121155,0.0003732225,0.000015455142,0.000030872754,0.00017438312,0.0010249282,0.002529836,0.0005067175,0.27802053,0.014272625,0.70285785],"study_design_scores_gemma":[0.0019663484,0.0007369018,0.01244474,0.0001998074,0.00005723157,0.0003899255,0.00024616375,0.560142,0.0022067353,0.3867025,0.034181383,0.00072628807],"about_ca_topic_score_codex":0.0000017475049,"about_ca_topic_score_gemma":0.0000010890271,"teacher_disagreement_score":0.90657115,"about_ca_system_score_codex":0.000025842819,"about_ca_system_score_gemma":0.00004503547,"threshold_uncertainty_score":0.724938},"labels":[],"label_agreement":null},{"id":"W2157044362","doi":"10.1007/s00778-008-0128-8","title":"Top-k typicality queries and efficient query answering methods on large databases","year":2009,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"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; Discriminative model; Set (abstract data type); Tree (set theory); Information retrieval; Measure (data warehouse); Quality (philosophy); Series (stratigraphy); Data mining; Artificial intelligence; Mathematics","score_opus":0.03418460099070763,"score_gpt":0.3495786809841878,"score_spread":0.3153940799934802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157044362","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.035873566,0.0003670431,0.9573062,0.0044531305,0.00039832413,0.00006200497,0.0000060499137,0.000053730448,0.0014799628],"genre_scores_gemma":[0.6142283,0.00045136965,0.3793693,0.0047743698,0.0007101229,0.0000027180422,0.0000056619433,0.000011955365,0.0004461829],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990261,0.00019574408,0.00016028677,0.00017445078,0.00020283234,0.00024058837],"domain_scores_gemma":[0.99929667,0.000112033355,0.00007292708,0.0004200904,0.00002229746,0.00007598586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018326438,0.00009570341,0.00010875339,0.00006448283,0.00036471247,0.0003854737,0.00060342555,0.000012875635,0.000017743578],"category_scores_gemma":[0.00007951713,0.000057523357,0.000035637862,0.00016837813,0.000037087753,0.0003801336,0.00027400142,0.00022113911,0.000009791759],"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.000027751672,0.00016566945,0.000320996,0.0000075106464,0.000028730585,0.000055382905,0.0006347288,0.00020131226,0.00044049768,0.32669386,0.002776769,0.66864675],"study_design_scores_gemma":[0.0022958938,0.0009368299,0.14126079,0.00031155933,0.00009617844,0.0007130667,0.00093927386,0.23940115,0.009359151,0.05078971,0.5527018,0.0011946383],"about_ca_topic_score_codex":0.000004490804,"about_ca_topic_score_gemma":0.0000012187187,"teacher_disagreement_score":0.66745216,"about_ca_system_score_codex":0.00001467214,"about_ca_system_score_gemma":0.00001538099,"threshold_uncertainty_score":0.37171316},"labels":[],"label_agreement":null},{"id":"W2157082519","doi":"10.1007/978-3-319-06028-6_38","title":"Integrating Multiple Resources for Diversified Query Expansion","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"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 Montréal","funders":"","keywords":"Computer science; Query expansion; Information retrieval; Resource (disambiguation); Relevance (law); Query optimization; Sargable; Principal (computer security); Web search query; Web query classification; Data mining; Search engine","score_opus":0.02062620191132638,"score_gpt":0.23480755195424038,"score_spread":0.214181350042914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157082519","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.00006218706,0.00011336901,0.9947742,0.0005130601,0.0018580902,0.0005199082,0.00001156736,0.00019913624,0.0019484478],"genre_scores_gemma":[0.037646454,0.000020875459,0.9583858,0.001521832,0.0008523459,0.00002027548,0.000026748989,0.00003669473,0.0014889553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967452,0.000027705099,0.00041877484,0.0015001403,0.0007214926,0.0005866597],"domain_scores_gemma":[0.99725145,0.00087418995,0.00028902476,0.0012886939,0.00017481133,0.0001218369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010957522,0.00044764928,0.00044082632,0.00069961866,0.00041108215,0.00088491675,0.004050365,0.00020181654,0.00000703572],"category_scores_gemma":[0.00022216597,0.00038630352,0.00014999748,0.00034347444,0.00035675362,0.00072141574,0.002299999,0.00043360458,0.000027075072],"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.000006435384,0.000011952652,0.00003265929,0.00004934559,0.0000088687775,0.000014248725,0.00064408005,0.0023742374,0.00009880746,0.020949343,0.00021554934,0.97559446],"study_design_scores_gemma":[0.00042711655,0.0001885061,0.00004870094,0.00040599643,0.000009500247,0.00000606765,8.1487866e-7,0.9233076,0.0005441469,0.049547944,0.02488487,0.0006287592],"about_ca_topic_score_codex":0.000034649318,"about_ca_topic_score_gemma":0.00008829818,"teacher_disagreement_score":0.9749657,"about_ca_system_score_codex":0.0001342925,"about_ca_system_score_gemma":0.00010711484,"threshold_uncertainty_score":0.9998589},"labels":[],"label_agreement":null},{"id":"W2158532749","doi":"10.1109/lcn.2003.1243174","title":"Feedback mechanism validation and path query messages in the label distribution protocol","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Path (computing); Path vector protocol; Constraint (computer-aided design); Set (abstract data type); Network topology; Protocol (science); Computer network; Routing (electronic design automation); Node (physics); Distributed computing; Routing protocol; Database; Data mining; Topology (electrical circuits); Static routing; Mathematics","score_opus":0.018175010536126437,"score_gpt":0.26451576445056774,"score_spread":0.2463407539144413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158532749","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.0024907715,0.0000018971657,0.9775278,0.0036456077,0.000042815955,0.014767325,0.0000058481987,0.000076250355,0.0014416842],"genre_scores_gemma":[0.8043045,0.00002588226,0.12133779,0.0022232456,0.00017234254,0.070155375,0.00028494175,0.00001865868,0.0014772934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993979,0.000039119015,0.00010051957,0.00018344974,0.00016297608,0.00011604976],"domain_scores_gemma":[0.9996898,0.000012374366,0.000032376956,0.00023590404,0.000013873689,0.00001565786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004278151,0.000064488355,0.00004835246,0.000025793212,0.00006643019,0.00030134156,0.0003721902,0.000019917512,0.000004284373],"category_scores_gemma":[0.000010409821,0.000040974057,0.000008648374,0.00021820464,0.000012958603,0.0008302126,0.0001654657,0.000049623428,0.000014898705],"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.0000015526055,0.00008395969,0.000060563492,0.000014259005,0.000002214408,0.000005393742,0.00015463654,0.0000066201333,0.00008366065,0.9773509,0.0007884828,0.021447746],"study_design_scores_gemma":[0.007376205,0.00050825987,0.026671978,0.00014953727,0.000017427623,0.00002555619,0.0006907799,0.042240024,0.021181922,0.8755103,0.024802515,0.00082549354],"about_ca_topic_score_codex":0.00005738316,"about_ca_topic_score_gemma":0.000011411907,"teacher_disagreement_score":0.85619,"about_ca_system_score_codex":0.000019421343,"about_ca_system_score_gemma":0.000011331719,"threshold_uncertainty_score":0.29058436},"labels":[],"label_agreement":null},{"id":"W2158668414","doi":"10.1007/3-540-45244-3_10","title":"Data Mining with Calendar Attributes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Computer science; Generalization; Probabilistic logic; Granularity; Data mining; Graph; Theoretical computer science; Probability distribution; Domain (mathematical analysis); Set (abstract data type); Artificial intelligence; Mathematics; Statistics; Programming language","score_opus":0.045830102197593814,"score_gpt":0.26138535238206634,"score_spread":0.21555525018447252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158668414","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.000008574215,0.0003891334,0.99127775,0.0012601668,0.001020474,0.0002963358,0.00019432754,0.00022776521,0.005325482],"genre_scores_gemma":[0.0019496136,0.00012661042,0.9935424,0.0014260793,0.0007632495,0.0000054343823,0.00019909372,0.000046810816,0.0019407514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510133,0.000021700933,0.00042046842,0.0024014055,0.0012450487,0.0008100337],"domain_scores_gemma":[0.9949122,0.0003001476,0.00026427166,0.004191811,0.00015238817,0.00017918911],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009981625,0.0005670215,0.00050342863,0.0007207176,0.0002858143,0.000812397,0.01129107,0.0001713939,0.000035371584],"category_scores_gemma":[0.0000557871,0.0004604174,0.000049751274,0.0008954011,0.00066073716,0.0022655118,0.006923625,0.000578329,0.00006321526],"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.0000037632715,0.000023519207,0.00009142369,0.000026867847,0.00002178287,0.0004831954,0.00013072058,0.0019237385,0.000004481988,0.0055415267,0.00089483144,0.99085414],"study_design_scores_gemma":[0.0005465569,0.0003118289,0.00014409408,0.00072018546,0.000030215791,0.00019114859,4.098031e-7,0.81922895,0.000118408076,0.022097427,0.1551746,0.001436207],"about_ca_topic_score_codex":0.000021290114,"about_ca_topic_score_gemma":0.00015830535,"teacher_disagreement_score":0.98941797,"about_ca_system_score_codex":0.00013359156,"about_ca_system_score_gemma":0.00037868702,"threshold_uncertainty_score":0.99978477},"labels":[],"label_agreement":null},{"id":"W2160152607","doi":"10.14778/1687627.1687754","title":"Efficient method for maximizing bichromatic reverse nearest neighbor","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":129,"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; k-nearest neighbors algorithm; Point (geometry); Best bin first; Exponential function; Algorithm; Exponential growth; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.014581193934234049,"score_gpt":0.25726412710710916,"score_spread":0.24268293317287512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160152607","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.02502903,0.00025923093,0.9225783,0.029909458,0.0014680016,0.003988468,0.00002602421,0.0004478864,0.016293654],"genre_scores_gemma":[0.23784995,0.000010376794,0.760218,0.0010742566,0.00010261156,0.000066626446,0.0000015270398,0.0000115799785,0.00066507043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.000006684613,0.00028588108,0.0003376298,0.00036457035,0.0003049485],"domain_scores_gemma":[0.99927527,0.00004986282,0.00024026011,0.00027287612,0.00010518329,0.0000565302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066532433,0.00015014,0.00019244294,0.000094866045,0.00015238248,0.0001758173,0.0014844986,0.000026541322,0.000004913277],"category_scores_gemma":[0.00009940144,0.00010269854,0.00013011043,0.0004159688,0.000023536906,0.00023482196,0.00043015013,0.00006970707,0.0000069882067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035042725,0.0005335892,0.000106609805,0.00037032375,0.000086717766,0.0000016353182,0.0014631114,0.00080195116,0.036367804,0.72198945,0.029689725,0.20855404],"study_design_scores_gemma":[0.0021429516,0.000513093,0.0032801377,0.00038131492,0.00013333779,0.000016350707,0.0003618814,0.8581399,0.08078135,0.029616717,0.02408257,0.0005503957],"about_ca_topic_score_codex":0.000014563547,"about_ca_topic_score_gemma":2.6863043e-7,"teacher_disagreement_score":0.85733795,"about_ca_system_score_codex":0.00005380619,"about_ca_system_score_gemma":0.000015660733,"threshold_uncertainty_score":0.4187925},"labels":[],"label_agreement":null},{"id":"W2160372286","doi":"10.1049/cp:20070352","title":"On middleware support for motion awareness","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Middleware (distributed applications); Computer science; Motion (physics); Artificial intelligence; Distributed computing","score_opus":0.033786586770695466,"score_gpt":0.2886188044754937,"score_spread":0.25483221770479825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160372286","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.0011147892,0.0000015537047,0.98090625,0.0002678677,0.00045129046,0.00014039059,0.0000037495263,0.00015132339,0.01696278],"genre_scores_gemma":[0.64408576,0.0000036966235,0.31091306,0.0032399467,0.0003142245,0.000032236327,0.00019388105,0.0000187074,0.04119845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937767,0.0000035618716,0.00009417359,0.00021249618,0.00013019785,0.00018187729],"domain_scores_gemma":[0.99955946,0.000047763122,0.000022948343,0.00030044495,0.000030497076,0.000038891427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003507924,0.000059053655,0.00005068719,0.0000761316,0.000065796834,0.00009288841,0.0004465225,0.000018828227,0.00003717321],"category_scores_gemma":[0.0000134689735,0.00004921133,0.000030297664,0.00013294865,0.0000064743926,0.00041049204,0.0000983876,0.000021160839,0.00010129309],"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.0000050963804,0.00006792837,0.00028570418,0.000013929859,0.0000060825405,0.000007642228,0.000037126,0.000016245547,0.000019623545,0.56780314,0.017053757,0.41468373],"study_design_scores_gemma":[0.0034756276,0.0014140919,0.033676058,0.000051493196,0.000027510507,0.000011040614,0.00020841822,0.28371578,0.030678948,0.107021526,0.5383363,0.001383214],"about_ca_topic_score_codex":0.000007691967,"about_ca_topic_score_gemma":0.000010864278,"teacher_disagreement_score":0.6699932,"about_ca_system_score_codex":0.000012943513,"about_ca_system_score_gemma":0.000007879296,"threshold_uncertainty_score":0.20067798},"labels":[],"label_agreement":null},{"id":"W2160600700","doi":"10.1109/sccc.2005.1587861","title":"A Geometric Framework to Visualize Fuzzy-clustered Data","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Computer science; Data mining; Fuzzy logic; Cluster analysis; Fuzzy clustering; Visualization; Object (grammar); Artificial intelligence; Scheme (mathematics); Data visualization; Fuzzy set; FLAME clustering; Cluster (spacecraft); Pattern recognition (psychology); Machine learning; Mathematics; CURE data clustering algorithm","score_opus":0.04133289703896613,"score_gpt":0.3064629536711043,"score_spread":0.2651300566321382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160600700","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.00039078807,0.00005123511,0.9652882,0.0022187002,0.0004015769,0.00016533496,0.00001907223,0.0003007132,0.031164382],"genre_scores_gemma":[0.07286779,0.000008339298,0.9131662,0.0030828293,0.00037672842,0.000010705404,0.0001150316,0.000013115388,0.010359262],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985156,0.0000222216,0.00019342567,0.0006047201,0.00034446153,0.00031957513],"domain_scores_gemma":[0.9975354,0.000086001244,0.000038030146,0.0022280884,0.000028121225,0.000084329404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032593982,0.00011846083,0.00012092316,0.00036514713,0.00007739397,0.00062179775,0.003823243,0.000037382317,0.00009894783],"category_scores_gemma":[0.00007924614,0.000102184255,0.000022776781,0.0023624592,0.000011226786,0.0012210715,0.0039258674,0.00007233879,0.0011233728],"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.0000020565983,0.00012637193,0.00035596293,0.000010015624,0.000014485664,0.000026625617,0.000024608331,0.00003264679,0.000012742383,0.29396084,0.5000214,0.20541225],"study_design_scores_gemma":[0.00047148086,0.00012371749,0.0136581855,0.00003219902,0.000016057167,0.000006200006,0.000027140932,0.081111945,0.00021160513,0.040560827,0.8630878,0.0006928745],"about_ca_topic_score_codex":0.000232944,"about_ca_topic_score_gemma":0.000022825217,"teacher_disagreement_score":0.36306638,"about_ca_system_score_codex":0.000015563703,"about_ca_system_score_gemma":0.000012529453,"threshold_uncertainty_score":0.99965435},"labels":[],"label_agreement":null},{"id":"W2161529934","doi":"","title":"Core-Preserving Algorithms","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Multiplicative function; Class (philosophy); Algorithm; Ball (mathematics); Core (optical fiber); Computer science; Set (abstract data type); Mathematics; Out-of-core algorithm; Combinatorics; Artificial intelligence; Geometry","score_opus":0.1065928038436099,"score_gpt":0.27847765368349087,"score_spread":0.17188484983988095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161529934","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.0019335318,0.000034663688,0.91200286,0.0007276503,0.0003538614,0.00007040229,0.0000010288496,0.00039201873,0.084483966],"genre_scores_gemma":[0.044465575,0.00008970126,0.89677054,0.0017561277,0.00021620128,0.000011932702,0.000011614382,0.000011041655,0.056667287],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921036,0.000008765442,0.000103574486,0.00025231825,0.00021771238,0.00020726552],"domain_scores_gemma":[0.9992593,0.000021888556,0.000023360752,0.0006086235,0.000025860269,0.000060985112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108896624,0.00007599827,0.00007345012,0.00006402818,0.00013785907,0.000084425985,0.0013311394,0.000017094104,0.00013756816],"category_scores_gemma":[0.000012429151,0.00006377505,0.000031727966,0.00028971804,0.000025901376,0.0010235742,0.0008214196,0.00005016244,0.0004466882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016867209,0.00014146161,0.0028535917,0.000013222032,0.00004095422,0.00043035677,0.00048653744,0.00006492498,0.00023164626,0.24428211,0.49299094,0.25846258],"study_design_scores_gemma":[0.00033544374,0.000044340217,0.005381307,0.0000054631537,0.0000023786172,0.00004702576,0.00002106699,0.77264386,0.00039537545,0.0037738043,0.21706843,0.00028151643],"about_ca_topic_score_codex":0.000047329268,"about_ca_topic_score_gemma":0.0000023292257,"teacher_disagreement_score":0.7725789,"about_ca_system_score_codex":0.0000085238,"about_ca_system_score_gemma":0.000012327247,"threshold_uncertainty_score":0.5741422},"labels":[],"label_agreement":null},{"id":"W2161824006","doi":"10.1504/ijwet.2008.019943","title":"Web services-oriented architectures for mobile SOLAP applications","year":2008,"lang":"en","type":"article","venue":"International Journal of Web Engineering and Technology","topic":"Data Management and Algorithms","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":"Natural Sciences and Engineering Research Council of Canada; Université Laval; Centre de Géomatique du Québec","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Geospatial analysis; Web service; Mobile device; World Wide Web; Popularity; Mobile computing; Mobile Web; Mobile business development; Mobile technology; Telecommunications","score_opus":0.004142416255261322,"score_gpt":0.2174246229963203,"score_spread":0.21328220674105897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161824006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21463847,0.00052570703,0.78236413,0.0015436558,0.00054691656,0.0001412979,0.000016672575,0.00015292228,0.0000702428],"genre_scores_gemma":[0.92920053,0.0001273227,0.07037473,0.00004249763,0.00015755328,0.00003534436,0.000003372579,0.000005833666,0.000052812706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948597,0.0000022889378,0.0001751197,0.00010676851,0.00013051841,0.00009933052],"domain_scores_gemma":[0.9995588,0.00003178114,0.00009174726,0.00012101076,0.0001669923,0.000029645646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007785481,0.00006806107,0.00009325187,0.00049381953,0.00003784114,0.000029049352,0.00071595854,0.000039171453,0.0000014362619],"category_scores_gemma":[0.000013149497,0.00006126147,0.00003371822,0.00017695253,0.00002570138,0.00009745141,0.00015106724,0.000110917164,0.0000016643945],"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.000060629955,0.0005618441,0.007144826,0.00020402818,0.0013256228,0.00036841456,0.00065064034,0.024380147,0.052233994,0.3009301,0.0025964999,0.60954326],"study_design_scores_gemma":[0.001432974,0.0002502519,0.00038064472,0.000059077523,0.000015381138,0.0012262268,0.000041151037,0.5202198,0.0027961973,0.0032281287,0.47013932,0.00021080648],"about_ca_topic_score_codex":7.539325e-7,"about_ca_topic_score_gemma":6.250046e-7,"teacher_disagreement_score":0.71456206,"about_ca_system_score_codex":0.000014861753,"about_ca_system_score_gemma":0.000022976255,"threshold_uncertainty_score":0.24981701},"labels":[],"label_agreement":null},{"id":"W2162148987","doi":"","title":"Clusterability: A Theoretical Study","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"","keywords":"Cluster analysis; Generality; Computer science; Pairwise comparison; Set (abstract data type); Property (philosophy); Data mining; Theoretical computer science; Artificial intelligence","score_opus":0.00920970011625449,"score_gpt":0.25647706827589223,"score_spread":0.24726736815963773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162148987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011491492,0.0000035397102,0.8928131,0.004831449,0.00011487745,0.00023467185,2.1475302e-7,0.00026667133,0.09024399],"genre_scores_gemma":[0.9761204,4.136777e-7,0.021891866,0.0013147418,0.000027315535,0.0000022237277,5.3000224e-7,9.853896e-7,0.0006415224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993573,0.000034591943,0.000088577974,0.00023167173,0.00015885377,0.0001290443],"domain_scores_gemma":[0.9993793,0.000020366286,0.000009186921,0.00053881557,0.000013281271,0.00003906351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028871445,0.00005430112,0.000061500425,0.000032936143,0.00003944238,0.00021032988,0.00070699514,0.000008713888,0.000091714624],"category_scores_gemma":[0.000013695011,0.000038821432,0.000019543419,0.00017050705,0.000020042547,0.00041082452,0.0002176414,0.000039309085,0.000120955825],"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":[8.8775266e-7,0.00025904545,0.00025170334,3.235739e-7,0.0000026176267,0.000008987085,0.0001275681,4.9390854e-7,0.0000022650197,0.8442063,0.0010494529,0.15409037],"study_design_scores_gemma":[0.0013796313,0.0019142611,0.061523292,0.000004676641,0.00001495508,0.00000629249,0.0003849275,0.30699277,0.00009563561,0.61789936,0.009316547,0.00046762844],"about_ca_topic_score_codex":0.0000017182552,"about_ca_topic_score_gemma":8.532194e-7,"teacher_disagreement_score":0.96462893,"about_ca_system_score_codex":0.0000057144675,"about_ca_system_score_gemma":0.000004348112,"threshold_uncertainty_score":0.20282158},"labels":[],"label_agreement":null},{"id":"W2162526413","doi":"10.1109/icde.1989.47239","title":"Aggregative closure: an extension of transitive closure","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":32,"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":"Government of Canada","keywords":"Transitive closure; Closure (psychology); Closure operator; Extension (predicate logic); Computer science; Transitive relation; Variety (cybernetics); Theoretical computer science; Operator (biology); Transitive reduction; Algorithm; Algebra over a field; Mathematics; Discrete mathematics; Artificial intelligence; Programming language; Graph; Pure mathematics; Closed set; Combinatorics","score_opus":0.01820417521875536,"score_gpt":0.24533103106362364,"score_spread":0.22712685584486828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162526413","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.034262486,0.00008526866,0.92677915,0.00029774787,0.00026374427,0.00020632979,0.000008310105,0.00012736459,0.03796962],"genre_scores_gemma":[0.8833841,0.000025035366,0.115053274,0.00031030018,0.000021903064,0.0000036277083,0.000010153376,0.000006671156,0.0011849097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901927,0.000104735576,0.00015713254,0.00032747234,0.00022752515,0.00016389771],"domain_scores_gemma":[0.9992466,0.000030370886,0.00006303238,0.0005040713,0.000096643715,0.000059295176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339059,0.0001017175,0.00013453212,0.000072979085,0.00005084157,0.000051728017,0.0004257811,0.000032481406,0.00005046775],"category_scores_gemma":[0.000022366661,0.000082107574,0.00005041737,0.0003571933,0.00004653572,0.0010581622,0.000053627944,0.000060455495,0.000023883451],"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.000008703717,0.00026125435,0.00075616187,0.000016394999,0.000044580494,0.000039193572,0.0017257422,0.000023715837,0.0013801651,0.92392296,0.0021942114,0.06962693],"study_design_scores_gemma":[0.0099624125,0.005155953,0.09315417,0.00036869693,0.00021914732,0.0001071406,0.0061724363,0.14649025,0.423214,0.20715226,0.104258284,0.0037452609],"about_ca_topic_score_codex":0.000020447618,"about_ca_topic_score_gemma":0.000013312415,"teacher_disagreement_score":0.84912163,"about_ca_system_score_codex":0.0000070163646,"about_ca_system_score_gemma":0.000021363636,"threshold_uncertainty_score":0.33482498},"labels":[],"label_agreement":null},{"id":"W2162541870","doi":"10.1109/cts.2010.5478494","title":"SWE-FE: Extending folksonomies to the Sensor Web","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Calgary; Canarie","keywords":"Folksonomy; Geospatial analysis; Computer science; World Wide Web; Suite; Sensor web; The Internet; Key (lock); Information retrieval; Remote sensing; Geography; Computer security; Operating system","score_opus":0.012959577582206982,"score_gpt":0.24332096599077352,"score_spread":0.23036138840856654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162541870","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.051646627,0.00001991918,0.78898394,0.04284286,0.004166894,0.0004283677,0.000007483726,0.0005938677,0.11131002],"genre_scores_gemma":[0.53987896,0.000012169705,0.3967673,0.004808692,0.00074581185,0.000032991487,0.0000037607256,0.00001385234,0.0577365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934304,0.0000112080525,0.00008627594,0.00023328996,0.00012582737,0.00020036547],"domain_scores_gemma":[0.9991801,0.000044926986,0.000019603984,0.00068261457,0.000016218677,0.000056544162],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002842797,0.00007410644,0.000058095055,0.000058288904,0.00014434282,0.0004962905,0.0012491475,0.000015572874,0.00010535724],"category_scores_gemma":[0.000026265103,0.000045007597,0.000029359571,0.00020840015,0.000016471093,0.00051623525,0.000701568,0.00009260435,0.0010768088],"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.000001158738,0.00002298977,0.0002821218,0.000003328891,0.000014132294,0.000009536413,0.00021350526,0.000012166682,0.0032224548,0.5106659,0.13283798,0.35271472],"study_design_scores_gemma":[0.00009048953,0.000017804707,0.0018734193,0.0000022297422,0.0000028710779,0.0000041378416,0.00006868281,0.057074346,0.0010569406,0.0008297209,0.93884414,0.00013519949],"about_ca_topic_score_codex":0.000019941981,"about_ca_topic_score_gemma":0.00009022368,"teacher_disagreement_score":0.8060062,"about_ca_system_score_codex":0.0000048754227,"about_ca_system_score_gemma":0.0000099992085,"threshold_uncertainty_score":0.99970096},"labels":[],"label_agreement":null},{"id":"W2162783807","doi":"10.14778/2021017.2021025","title":"Keyword search in graphs","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Substructure; Clique; Computer science; Graph; Combinatorics; Theoretical computer science; Time complexity; Mathematics; Algorithm","score_opus":0.036510813204070874,"score_gpt":0.2195111061961708,"score_spread":0.18300029299209994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162783807","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.6515311,0.00023311931,0.0035395457,0.0030617833,0.0011405783,0.0016707658,0.0000066373755,0.00026579708,0.33855066],"genre_scores_gemma":[0.9822847,0.000039512935,0.016867494,0.00011877169,0.00001440654,0.000025542333,2.550495e-7,0.0000054437082,0.00064386055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903995,0.0000044733943,0.00017841053,0.00023361894,0.00030696095,0.00023657524],"domain_scores_gemma":[0.9996407,0.000007751302,0.000070842114,0.00019388298,0.000051583353,0.00003522365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040177046,0.00008809684,0.000101076876,0.0001424784,0.000042860283,0.000056693843,0.0017915879,0.00001831342,0.000016776954],"category_scores_gemma":[0.000013339024,0.000060204766,0.000053333162,0.0005919952,0.000046072717,0.000541179,0.0010697949,0.00009520025,0.000015416905],"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.0000141689425,0.00032612952,0.039409887,0.00008708902,0.000034361397,0.0000025839072,0.0039617964,0.0000016882801,0.002874808,0.90280986,0.0032588637,0.047218792],"study_design_scores_gemma":[0.002839522,0.00051424874,0.24037719,0.00041102731,0.000041173687,0.000016320679,0.0015112209,0.010010333,0.45108527,0.2804068,0.011857077,0.00092981005],"about_ca_topic_score_codex":0.00012554941,"about_ca_topic_score_gemma":0.000003667571,"teacher_disagreement_score":0.622403,"about_ca_system_score_codex":0.000022814145,"about_ca_system_score_gemma":0.000009097477,"threshold_uncertainty_score":0.3329246},"labels":[],"label_agreement":null},{"id":"W2162954778","doi":"10.1109/ssdbm.2007.32","title":"Effective Summarization of Multi-Dimensional Data Streams for Historical Stream Mining","year":2007,"lang":"en","type":"article","venue":"International Conference on Scientific and Statistical Database Management","topic":"Data Management and Algorithms","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":"Automatic summarization; Computer science; Data stream; Data stream mining; Data mining; ENCODE; Data stream clustering; Cluster analysis; STREAMS; Task (project management); Space (punctuation); Simple (philosophy); Information retrieval; Artificial intelligence","score_opus":0.09385673441405702,"score_gpt":0.34855274837898825,"score_spread":0.25469601396493124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162954778","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.0006807232,0.000015899483,0.99203455,0.00029708727,0.0012478357,0.00044660392,0.0027405352,0.000032261076,0.002504512],"genre_scores_gemma":[0.26547122,0.000020312758,0.72030735,0.00012319203,0.000073661504,0.00003117929,0.010489288,0.0000112616335,0.003472529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978578,0.00003468282,0.0003610622,0.0008394375,0.0006699068,0.00023710907],"domain_scores_gemma":[0.99844706,0.00038549682,0.00013414315,0.000710378,0.00021152008,0.000111415626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014470583,0.00014495068,0.00015578889,0.00029120516,0.00015142703,0.00031571547,0.0011876392,0.000025037274,0.00004839219],"category_scores_gemma":[0.00019175728,0.00013118358,0.00002137626,0.00020233139,0.00014150218,0.00065544026,0.0013141369,0.000063933316,0.000010970662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048428752,0.00024039912,0.0001343339,0.00003886996,0.000055151857,0.000022024242,0.000028109336,0.000009923288,0.000085272455,0.6916754,0.009811604,0.29785043],"study_design_scores_gemma":[0.0012148393,0.00014883747,0.0031957587,0.00010520412,0.00004331364,0.0000016474642,0.00012367697,0.9622474,0.00016196958,0.0039538434,0.028551947,0.00025161597],"about_ca_topic_score_codex":0.00004305902,"about_ca_topic_score_gemma":0.000051676827,"teacher_disagreement_score":0.9622374,"about_ca_system_score_codex":0.00008383086,"about_ca_system_score_gemma":0.00002450663,"threshold_uncertainty_score":0.5349511},"labels":[],"label_agreement":null},{"id":"W2163010693","doi":"10.1109/ssdbm.2004.60","title":"SaIL: a library for efficient application integration of spatial indices","year":2004,"lang":"en","type":"article","venue":"Statistical and Scientific Database Management","topic":"Data Management and Algorithms","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":"Esri (Canada)","funders":"","keywords":"Search engine indexing; Computer science; Index (typography); Focus (optics); Spatial analysis; Interface (matter); Data mining; Spatial database; Extensibility; Information retrieval; Range (aeronautics); Data science; World Wide Web; Geography; Engineering; Remote sensing; Programming language","score_opus":0.013910255542295843,"score_gpt":0.2502628843625411,"score_spread":0.23635262882024527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163010693","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.001173927,0.000041093645,0.99544406,0.0004068444,0.00033307725,0.00067130494,0.001146658,0.00007456733,0.00070845615],"genre_scores_gemma":[0.26287994,0.000018903787,0.7329846,0.00009101513,0.00004105726,0.00014290308,0.0031537204,0.000009922986,0.0006779452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861443,0.000019348863,0.0002665959,0.0005756695,0.00031591355,0.00020803236],"domain_scores_gemma":[0.99922985,0.00005771165,0.00009457303,0.00050213997,0.000030867894,0.00008488007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424781,0.00011244542,0.000120792465,0.00020507239,0.00018936404,0.00043486303,0.0005206468,0.000015776037,0.000015860154],"category_scores_gemma":[0.000021251153,0.00009461974,0.00002382979,0.0003490531,0.00017844606,0.0005534116,0.0006432357,0.00004091205,0.000019354984],"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.000009437964,0.00012477432,0.000008583355,0.00012076322,0.00001185872,0.0000037890798,0.00006898733,0.000057212055,0.000142779,0.74799895,0.0018352091,0.24961767],"study_design_scores_gemma":[0.0031044048,0.00033040275,0.004410218,0.00022529198,0.00014065702,0.0000031229556,0.0003729235,0.7238012,0.0042068707,0.15155734,0.111172415,0.0006751614],"about_ca_topic_score_codex":0.00003747046,"about_ca_topic_score_gemma":0.000013565881,"teacher_disagreement_score":0.723744,"about_ca_system_score_codex":0.000013031255,"about_ca_system_score_gemma":0.00001840041,"threshold_uncertainty_score":0.41933942},"labels":[],"label_agreement":null},{"id":"W2163814946","doi":"10.1145/1557670.1557681","title":"Keyword query cleaning using hidden Markov models","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Ontario Institute of Technology","funders":"","keywords":"Computer science; Hidden Markov model; Query optimization; Probabilistic logic; Web query classification; Data mining; Information retrieval; Keyword spotting; Web search query; Artificial intelligence; Search engine","score_opus":0.0369287846093509,"score_gpt":0.2555249096461961,"score_spread":0.21859612503684522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163814946","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.0029459912,0.00002918332,0.91040593,0.00067543413,0.00016563812,0.00006522229,4.722949e-7,0.0002534903,0.08545866],"genre_scores_gemma":[0.23240781,0.00001298286,0.7618681,0.0017559435,0.0001150404,7.671826e-7,0.0000033545375,0.000005703492,0.00383025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991114,0.000018396633,0.00013523157,0.00028932976,0.00019682199,0.00024878632],"domain_scores_gemma":[0.9994163,0.000012977818,0.000036446796,0.00045833632,0.000020368201,0.0000555599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018814259,0.00009665683,0.00009259927,0.00009217749,0.000093947216,0.00034862576,0.00080316706,0.00002346031,0.00002719273],"category_scores_gemma":[0.00000406428,0.00008682906,0.00003743147,0.00027021737,0.0000092407945,0.0021057855,0.000288043,0.000052784348,0.000032404798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015293994,0.000029724964,0.000025738882,0.00000272944,0.0000073999895,0.0000260308,0.00009395184,0.00038387024,0.00012464532,0.2173691,0.006054235,0.77588105],"study_design_scores_gemma":[0.00011435936,0.000022868859,0.00017816079,0.000011074126,0.000003546746,0.00000393687,0.000021671389,0.96982986,0.00010997093,0.028064998,0.0014882669,0.00015131332],"about_ca_topic_score_codex":0.000032426797,"about_ca_topic_score_gemma":0.0000027086548,"teacher_disagreement_score":0.96944594,"about_ca_system_score_codex":0.000021294163,"about_ca_system_score_gemma":0.000013798674,"threshold_uncertainty_score":0.35407862},"labels":[],"label_agreement":null},{"id":"W2164125443","doi":"10.1109/sisap.2009.9","title":"Curse of Dimensionality in Pivot Based Indexes","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Curse of dimensionality; Search engine indexing; Sublinear function; Metric (unit); Intrinsic dimension; Dimension (graph theory); Sequence (biology); Similarity (geometry)","score_opus":0.010865020135798393,"score_gpt":0.2455646894210683,"score_spread":0.2346996692852699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164125443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110363156,0.00005268439,0.84794664,0.008011332,0.0002580105,0.00024151496,0.0000050956373,0.00017522821,0.032946322],"genre_scores_gemma":[0.9456113,0.0000011390563,0.05304111,0.0009902177,0.000007085531,7.3718195e-7,0.0000034934196,7.928101e-7,0.00034410102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994751,0.000017660761,0.000117124866,0.00014438787,0.00015195139,0.00009373624],"domain_scores_gemma":[0.99962085,0.000020959638,0.000026721918,0.00029531468,0.000015113049,0.00002102243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020681239,0.000044161414,0.0000704852,0.00007800969,0.000010463075,0.000022875622,0.00039505595,0.00001242789,0.000029785908],"category_scores_gemma":[0.000009414963,0.00003596722,0.00001876742,0.00026629076,0.000013644895,0.0003499078,0.00007870961,0.00003053901,0.0000115587745],"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.000007499461,0.00058385683,0.01186502,0.000012060226,0.0000046896066,0.000022420956,0.0000663466,0.00022358913,0.000585807,0.78745043,0.006977939,0.19220036],"study_design_scores_gemma":[0.0013798865,0.00021324011,0.5715653,0.00004565007,0.0000039322767,6.561913e-7,0.000013834344,0.3636159,0.008638946,0.047895394,0.006306605,0.00032070675],"about_ca_topic_score_codex":0.00004213232,"about_ca_topic_score_gemma":0.0000102516815,"teacher_disagreement_score":0.8352482,"about_ca_system_score_codex":0.0000056461245,"about_ca_system_score_gemma":0.000013515991,"threshold_uncertainty_score":0.14667006},"labels":[],"label_agreement":null},{"id":"W2164178448","doi":"10.5194/isprsarchives-xxxix-b2-157-2012","title":"MULTI-CRITERIA PATH FINDING","year":2012,"lang":"en","type":"article","venue":"˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences","topic":"Data Management and Algorithms","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":"Shortest path problem; Computer science; Flexibility (engineering); Constrained Shortest Path First; Mathematical optimization; Path (computing); Enhanced Data Rates for GSM Evolution; Point (geometry); K shortest path routing; Longest path problem; Rank (graph theory); Algorithm; Graph; Mathematics; Theoretical computer science; Artificial intelligence; Computer network; Statistics; Combinatorics","score_opus":0.028394556550633297,"score_gpt":0.2779082881230395,"score_spread":0.24951373157240622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164178448","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.003860872,0.00004377693,0.98095757,0.0038120952,0.0034767606,0.0005942033,0.00009051218,0.00007437797,0.0070898333],"genre_scores_gemma":[0.9733139,0.00014288559,0.02473485,0.0013953516,0.00021267215,4.2603946e-7,0.000041286014,0.000010551913,0.00014802472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515694,0.000327011,0.001390228,0.00043871548,0.0019608857,0.0007262281],"domain_scores_gemma":[0.996444,0.00081923424,0.0015881765,0.00070024084,0.00023608963,0.00021224286],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021302234,0.00045040567,0.00041500264,0.0010026655,0.001554352,0.0014861489,0.003208964,0.00008398652,0.000008796832],"category_scores_gemma":[0.00062998757,0.00028446663,0.00036717122,0.0011784458,0.0021906353,0.0016338219,0.0023292096,0.00042787936,0.00000807757],"study_design_candidate":"design_other","study_design_consensus":null,"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.000044973578,0.000030889103,0.0003821021,0.00003427993,0.00007640065,2.9113076e-7,0.0039726365,0.0005313803,0.0015144333,0.000034200908,0.00010889467,0.9932695],"study_design_scores_gemma":[0.0007084179,0.00009202362,0.00606079,0.00026341618,0.00003354018,0.00010626774,0.0013182677,0.9757165,0.003957907,0.0028565775,0.00854203,0.00034427096],"about_ca_topic_score_codex":0.6028103,"about_ca_topic_score_gemma":0.053065874,"teacher_disagreement_score":0.9929252,"about_ca_system_score_codex":0.000047570946,"about_ca_system_score_gemma":0.00016060853,"threshold_uncertainty_score":0.9999607},"labels":[],"label_agreement":null},{"id":"W2164323312","doi":"10.3233/mis-130154","title":"Modelling Spatio-Temporal Relevancy in Urban Context-Aware Pervasive Systems Using Voronoi Continuous Range Query and Multi-Interval Algebra","year":2013,"lang":"en","type":"article","venue":"RMIT Research Repository (RMIT University Library)","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Voronoi diagram; Interval (graph theory); Context (archaeology); Computer science; Ubiquitous computing; Range (aeronautics); Theoretical computer science; Mathematics; Geography; Human–computer interaction; Engineering; Combinatorics","score_opus":0.04570867605291263,"score_gpt":0.24192920517675612,"score_spread":0.1962205291238435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164323312","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.8242517,0.0014774707,0.16812123,0.0008534855,0.0004978127,0.0016938314,0.000021135083,0.00040675476,0.0026765491],"genre_scores_gemma":[0.96617293,0.00010565069,0.011855009,0.000033535216,0.00018922986,0.000007476197,0.0000279672,0.00003151844,0.021576662],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668396,0.00073954323,0.00036738234,0.0008820833,0.00060404104,0.0007229811],"domain_scores_gemma":[0.99835473,0.00022349849,0.00015441452,0.0007449923,0.00020806013,0.0003143208],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004280243,0.00027017377,0.00039524207,0.00070953846,0.00051959784,0.0011839803,0.0014919802,0.0001524894,0.000018830326],"category_scores_gemma":[0.0000211001,0.00029251483,0.00009990839,0.0006682067,0.00023304224,0.009218562,0.001634492,0.00058223197,0.000040365318],"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.0005186868,0.0017809455,0.7760637,0.0016548083,0.0007248797,0.010587683,0.012205011,0.009096929,0.00060216757,0.07150991,0.068390824,0.046864502],"study_design_scores_gemma":[0.0012327076,0.00011483794,0.0033486267,0.0003018438,0.000011238105,0.000018639956,0.001980574,0.98263973,0.00016960011,0.000049692273,0.009755089,0.00037741556],"about_ca_topic_score_codex":0.010474987,"about_ca_topic_score_gemma":0.00011346607,"teacher_disagreement_score":0.9735428,"about_ca_system_score_codex":0.00021968073,"about_ca_system_score_gemma":0.00021658119,"threshold_uncertainty_score":0.9999527},"labels":[],"label_agreement":null},{"id":"W2164509564","doi":"10.1145/1097064.1097078","title":"Finding corresponding objects when integrating several geo-spatial datasets","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":44,"is_retracted":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":"Join (topology); Computer science; Data mining; k-nearest neighbors algorithm; Precision and recall; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01813873062087971,"score_gpt":0.2586099181512564,"score_spread":0.2404711875303767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164509564","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.0021769153,0.000016026723,0.9796424,0.00086128846,0.0005791772,0.00013235632,0.000036497597,0.00030205323,0.016253272],"genre_scores_gemma":[0.42482728,0.0000046932555,0.5660424,0.0016675616,0.0005283861,0.000010534914,0.0003643918,0.000014361127,0.006540371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986265,0.0000451716,0.00022339403,0.00043138734,0.0002914832,0.00038208664],"domain_scores_gemma":[0.99916536,0.00008549137,0.00007683929,0.00056900235,0.00001815358,0.000085132204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041060604,0.00015763404,0.00012944009,0.00018416657,0.000207646,0.000685911,0.001269895,0.00003430545,0.00025080453],"category_scores_gemma":[0.000067547866,0.00013610438,0.000040055624,0.00023593758,0.000018335044,0.002605782,0.0010159098,0.00014940972,0.00037202876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075511416,0.00006194529,0.0004337162,0.000011666717,0.00002893871,0.00005416447,0.0015367286,0.00019989576,0.0003071204,0.052481163,0.1074403,0.8374368],"study_design_scores_gemma":[0.0004236825,0.000044616656,0.0005619141,0.000035557383,0.0000070893025,0.0000130252765,0.00012986797,0.8913096,0.001216308,0.00066544244,0.10524796,0.00034490353],"about_ca_topic_score_codex":0.00018873312,"about_ca_topic_score_gemma":0.00023077994,"teacher_disagreement_score":0.89110976,"about_ca_system_score_codex":0.00005360256,"about_ca_system_score_gemma":0.00002706052,"threshold_uncertainty_score":0.6614256},"labels":[],"label_agreement":null},{"id":"W2165238029","doi":"10.1109/icsmc.1997.633246","title":"Constructing virtual mines for navigation","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Construct (python library); Computer science; Obstacle; Representation (politics); Software; Object (grammar); 3d model; Artificial intelligence; Human–computer interaction; Programming language; Geography","score_opus":0.030351668809439333,"score_gpt":0.24015105468706477,"score_spread":0.20979938587762542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165238029","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.00272312,0.000008441624,0.97925454,0.00085706526,0.0003053767,0.00008522613,0.0000023765735,0.00011660782,0.016647227],"genre_scores_gemma":[0.25481257,0.0000026710795,0.72412795,0.0004234495,0.00022635215,0.000020563659,0.00002923282,0.0000056649496,0.020351578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996499,0.000003832115,0.00006817705,0.00012603732,0.00006373801,0.00008833262],"domain_scores_gemma":[0.9997695,0.00003409389,0.000021882528,0.00013839033,0.000019555659,0.000016546235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062176085,0.00003667317,0.000035913592,0.000024643836,0.00004897252,0.00013079314,0.00025682218,0.000009312961,0.00003578917],"category_scores_gemma":[0.000012025247,0.000031759984,0.000016804,0.00009365795,0.000011608871,0.00060118403,0.00007939268,0.000011038143,0.00003732042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.3376469e-7,0.000006750065,0.00007892143,0.000002863672,0.0000029401567,6.6672624e-7,0.000037659436,0.0000014389286,0.000026265216,0.40798208,0.012754614,0.5791057],"study_design_scores_gemma":[0.00032802537,0.00005551094,0.000021532973,0.000008099816,0.0000031291024,0.0000055008286,0.00016469293,0.95510674,0.001699587,0.0031477797,0.039330456,0.00012894535],"about_ca_topic_score_codex":0.0000023396706,"about_ca_topic_score_gemma":0.0000013843991,"teacher_disagreement_score":0.9551053,"about_ca_system_score_codex":0.000005272521,"about_ca_system_score_gemma":9.958296e-7,"threshold_uncertainty_score":0.12951346},"labels":[],"label_agreement":null},{"id":"W2166205117","doi":"10.1007/s10707-007-0030-3","title":"PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data","year":2007,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":66,"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; Relational database management system; Search engine indexing; Oracle; Temporal database; Data mining; Space partitioning; Heuristic; Component (thermodynamics); Tree (set theory); Relational database; Algorithm; Information retrieval; Artificial intelligence; Mathematics","score_opus":0.04829495645624118,"score_gpt":0.30978033011690725,"score_spread":0.2614853736606661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166205117","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.00030641104,0.000012646126,0.99465287,0.0011811854,0.00019563142,0.00055767054,0.000018041828,0.000121073506,0.0029544951],"genre_scores_gemma":[0.039992236,0.000002525759,0.9589971,0.00045411006,0.00010150648,0.000027142501,0.00022883975,0.000008854438,0.0001877232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860483,0.00001584094,0.0004181021,0.00029038018,0.00030434618,0.0003665087],"domain_scores_gemma":[0.9984164,0.00014434234,0.00014117424,0.0010803537,0.00005048395,0.00016720303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023216035,0.00012968818,0.00015287014,0.0001492387,0.00018713766,0.00029285584,0.000759795,0.000056539622,0.000008414408],"category_scores_gemma":[0.00015804221,0.00011457855,0.000022047265,0.0001945855,0.000038229988,0.0025565403,0.001085545,0.00012975732,0.000022243235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015520501,0.0008156294,0.00039878776,0.0006111722,0.000075053875,0.00012968451,0.0033918354,0.000080187056,0.000054599186,0.6163404,0.08160672,0.2963407],"study_design_scores_gemma":[0.00043797205,0.00021275414,0.00031664578,0.000022109107,0.000013874843,0.00007811742,0.0001268261,0.7785956,0.00011909744,0.0019126576,0.21788965,0.0002746734],"about_ca_topic_score_codex":0.000038526545,"about_ca_topic_score_gemma":0.000017809183,"teacher_disagreement_score":0.77851546,"about_ca_system_score_codex":0.000102601596,"about_ca_system_score_gemma":0.000054657816,"threshold_uncertainty_score":0.46723777},"labels":[],"label_agreement":null},{"id":"W2166470254","doi":"10.1145/1963192.1963217","title":"CELF++","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":857,"is_retracted":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":"Heuristics; Computer science; Maximization; Greedy algorithm; Simple (philosophy); Node (physics); Set (abstract data type); Mathematical optimization; Monte Carlo method; Quadratic equation; Algorithm; Mathematics","score_opus":0.048721630734645575,"score_gpt":0.1971299117888966,"score_spread":0.14840828105425102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166470254","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.000114743714,0.000003018766,0.56773424,0.000077519886,0.00010825192,0.0000135053415,8.1606956e-8,0.0001051136,0.43184355],"genre_scores_gemma":[0.1889662,0.0000058492064,0.78240687,0.0010470345,0.000039924627,0.0000036847669,0.0000012638372,0.0000029557575,0.027526233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997487,0.000003254745,0.000033047967,0.00009297311,0.00004951479,0.000072507246],"domain_scores_gemma":[0.9997102,0.0000021368978,0.0000068434533,0.00025528166,0.00000550455,0.000020019264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048728412,0.000024411194,0.000020398795,0.000021962878,0.000017135024,0.00003756449,0.00053511374,0.000005105352,0.00024868984],"category_scores_gemma":[0.0000012716638,0.000018736728,0.000009752651,0.00008222902,0.000005233599,0.00045790378,0.00021878109,0.000012670866,0.00071524904],"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":[1.2665176e-7,0.000016491364,0.00018119038,7.2357346e-7,0.000002359427,0.000006640309,0.00010402234,2.1439243e-8,0.0000069039934,0.8744549,0.014833751,0.110392824],"study_design_scores_gemma":[0.0006266869,0.00018388091,0.04376187,0.000006930983,0.000008161841,0.000008519365,0.000102454615,0.0606114,0.012616992,0.14432962,0.737066,0.00067751476],"about_ca_topic_score_codex":0.000019990926,"about_ca_topic_score_gemma":0.0000013222376,"teacher_disagreement_score":0.7301253,"about_ca_system_score_codex":0.0000013728805,"about_ca_system_score_gemma":0.0000020203277,"threshold_uncertainty_score":0.9193318},"labels":[],"label_agreement":null},{"id":"W2167912921","doi":"10.1109/dasfaa.2001.916393","title":"Histogram methods in query optimization: the relation between accuracy and optimality","year":2001,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Histogram; Query optimization; Relation (database); Computer science; Perspective (graphical); Mathematics; Mathematical optimization; Data mining; Pattern recognition (psychology); Artificial intelligence; Image (mathematics)","score_opus":0.0504565396278578,"score_gpt":0.35419588904723354,"score_spread":0.30373934941937575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167912921","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.00047745975,0.00006981239,0.9826332,0.003556573,0.00007499299,0.00013558973,4.0719235e-7,0.000079445905,0.012972544],"genre_scores_gemma":[0.012894113,0.00009522527,0.98585373,0.00023415209,0.000042758824,0.000008230379,0.000010760436,0.0000029717655,0.000858047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992507,0.00014673633,0.00016451784,0.0002167831,0.0001016637,0.000119618664],"domain_scores_gemma":[0.9992909,0.00024904884,0.000051180203,0.00036377867,0.000017917828,0.000027185104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009987022,0.000065392895,0.000077457946,0.00006510552,0.00008638418,0.00021131332,0.0004261475,0.000026776868,0.000029152921],"category_scores_gemma":[0.0000735174,0.000045536864,0.000015776579,0.00044986248,0.000030449643,0.0011941093,0.0003049783,0.000077479024,0.000004740739],"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.0000019673505,0.000028853798,0.024951965,0.000005207714,0.000011311903,0.000005169591,0.0002509087,0.007854589,0.0000031741745,0.05182301,0.00085811625,0.91420573],"study_design_scores_gemma":[0.00019805394,0.00001702772,0.11530126,0.000005119123,0.000006675579,0.0000026485047,0.000030522264,0.85424125,0.000011046631,0.0030415845,0.027026126,0.00011870541],"about_ca_topic_score_codex":0.00010564474,"about_ca_topic_score_gemma":0.000008018816,"teacher_disagreement_score":0.914087,"about_ca_system_score_codex":0.000019247775,"about_ca_system_score_gemma":0.000008582841,"threshold_uncertainty_score":0.20376992},"labels":[],"label_agreement":null},{"id":"W2168268282","doi":"10.2201/niipi.2012.9.5","title":"Implementation issues of clique enumeration algorithm","year":2012,"lang":"en","type":"article","venue":"Progress in Informatics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"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 Ottawa","keywords":"Enumeration; Computer science; Clique problem; Implementation; Clique; Cluster analysis; Clique percolation method; Clique graph; Graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Chordal graph; Artificial intelligence; Programming language; Line graph","score_opus":0.017512544248580602,"score_gpt":0.33306526995043245,"score_spread":0.31555272570185183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168268282","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.011102169,0.0005118452,0.9851246,0.00025965658,0.00075203803,0.00046175867,0.000011582968,0.000096350064,0.0016800023],"genre_scores_gemma":[0.1437263,0.000094998126,0.85578376,0.00009836663,0.00014156578,0.000049369788,0.0000723186,0.000004513992,0.00002877733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991123,0.000020677107,0.0004081587,0.0000443814,0.0002151528,0.00019929398],"domain_scores_gemma":[0.9995112,0.000014411156,0.00017832218,0.00022540709,0.000040417814,0.000030271078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051122345,0.00006955088,0.000091544964,0.00013212372,0.00002729817,0.00009027132,0.00035214768,0.000024761746,0.000011354882],"category_scores_gemma":[0.000005684869,0.00006430213,0.00001750166,0.00025620376,0.000023955694,0.0033640102,0.00020137888,0.000051078565,0.000020409447],"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.5422695e-7,0.000043416283,0.034375574,0.000048201622,0.0000060407133,1.9393477e-7,0.0045522437,0.0000029539815,4.275312e-7,0.024966957,0.0006416032,0.9353619],"study_design_scores_gemma":[0.0022041197,0.00033045752,0.09291869,0.00015435863,0.000029174664,0.000011199285,0.0054320097,0.74928176,0.013307623,0.0042230277,0.13123785,0.00086974853],"about_ca_topic_score_codex":0.000008406259,"about_ca_topic_score_gemma":0.0000022945328,"teacher_disagreement_score":0.9344922,"about_ca_system_score_codex":0.000019142655,"about_ca_system_score_gemma":0.000011042977,"threshold_uncertainty_score":0.26221648},"labels":[],"label_agreement":null},{"id":"W2168503413","doi":"10.1109/icde.2000.839397","title":"DB2 advisor: an optimizer smart enough to recommend its own indexes","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":290,"is_retracted":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; IBM (Canada)","funders":"","keywords":"Knapsack problem; Computer science; Index (typography); Selection (genetic algorithm); Quality (philosophy); Relational database management system; Interface (matter); Data mining; World Wide Web; Algorithm; Artificial intelligence; Relational database; Operating system","score_opus":0.04929654506499023,"score_gpt":0.25215798432311193,"score_spread":0.2028614392581217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168503413","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.002972534,0.00012048381,0.6672298,0.04779606,0.0015248897,0.0006573445,0.000019072657,0.0010331877,0.27864665],"genre_scores_gemma":[0.12603542,0.00013935207,0.7338761,0.014292436,0.00033528023,0.0000572551,0.00003105546,0.000033532397,0.12519957],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986973,0.000040426647,0.00018552954,0.00048562203,0.00023688484,0.00035427485],"domain_scores_gemma":[0.9989279,0.000027559987,0.000035846646,0.00078981067,0.00003488719,0.00018403039],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021387986,0.00015133207,0.00013637125,0.00014056073,0.000115789546,0.00046830127,0.0014150388,0.000036169007,0.0016658987],"category_scores_gemma":[0.000016974816,0.00012820668,0.000037925525,0.00041327122,0.000010825615,0.001986221,0.0006889788,0.00008397025,0.0019024434],"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.0000034631896,0.00031973023,0.00011724966,0.0000083630985,0.000029037321,0.000026310254,0.0007964229,0.00015485282,0.000050648167,0.04821375,0.39570335,0.5545768],"study_design_scores_gemma":[0.00037225775,0.00020693957,0.0003441851,0.000008810971,0.0000052697787,0.000003939368,0.000036978778,0.14789769,0.0005442376,0.0003534729,0.849864,0.00036223946],"about_ca_topic_score_codex":0.000030560444,"about_ca_topic_score_gemma":0.00001866378,"teacher_disagreement_score":0.5542146,"about_ca_system_score_codex":0.000018102268,"about_ca_system_score_gemma":0.0000042413667,"threshold_uncertainty_score":0.9992467},"labels":[],"label_agreement":null},{"id":"W2169227925","doi":"10.1109/icdm.2002.1184042","title":"Clustering spatial data when facing physical constraints","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Cluster analysis; Computer science; Data mining; CURE data clustering algorithm; Constrained clustering; Correlation clustering; Process (computing); Canopy clustering algorithm; Data stream clustering; Artificial intelligence","score_opus":0.05208659589505677,"score_gpt":0.2733264954871608,"score_spread":0.22123989959210405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169227925","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.00038339998,0.0000031157902,0.94540846,0.00019199158,0.00026333987,0.00006504765,0.000008378058,0.000118789554,0.053557485],"genre_scores_gemma":[0.6859111,0.0000017812515,0.31221923,0.00035056827,0.00011258564,0.000002122032,0.000036519836,0.0000059936347,0.0013600742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991571,0.0000269377,0.00008989847,0.00036494757,0.00016649328,0.00019463059],"domain_scores_gemma":[0.9989406,0.000025704872,0.000024250072,0.0009497803,0.000010125698,0.00004953763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001903823,0.0000799481,0.00008293393,0.000032336968,0.00006361452,0.0002780311,0.0012943615,0.0000118535145,0.00010342546],"category_scores_gemma":[0.000028834773,0.0000692546,0.00001573515,0.00007548434,0.000036705005,0.0011620831,0.001120315,0.00005573369,0.00017018348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.787886e-7,0.00007335574,0.00016760228,0.000011951675,0.00002632138,0.000031079726,0.00031795216,0.000035518933,0.00022345655,0.1102651,0.007938678,0.8809083],"study_design_scores_gemma":[0.00031479748,0.000020147767,0.00013118223,0.0000087864755,0.000005525632,0.000007784367,0.000052100015,0.96320796,0.0006153905,0.0029435807,0.032487836,0.00020491627],"about_ca_topic_score_codex":0.00003987824,"about_ca_topic_score_gemma":0.000018546874,"teacher_disagreement_score":0.96317244,"about_ca_system_score_codex":0.0000071589434,"about_ca_system_score_gemma":0.000015700745,"threshold_uncertainty_score":0.28241205},"labels":[],"label_agreement":null},{"id":"W2169459648","doi":"10.1109/icci-cc.2014.6921461","title":"A fuzzy structure similarity algorithm for attributed generalized trees","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Mathematics; Vertex (graph theory); Fuzzy set; Fuzzy number; Fuzzy classification; Fuzzy set operations; Defuzzification; Pattern recognition (psychology); Similarity (geometry); Fuzzy logic; Artificial intelligence; Algorithm; Discrete mathematics; Theoretical computer science; Computer science; Graph; Image (mathematics)","score_opus":0.017784110382046737,"score_gpt":0.24812130767906465,"score_spread":0.2303371972970179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169459648","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.00029293582,0.000019964507,0.99510354,0.0012095295,0.00045031603,0.00029158537,0.00009869703,0.00032553516,0.0022079137],"genre_scores_gemma":[0.009725176,0.0000068302534,0.98589295,0.0015442744,0.00024111457,0.000024144325,0.00021205714,0.000011182673,0.0023422404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876076,0.000050570103,0.00018418074,0.00045205824,0.00021361365,0.00033881053],"domain_scores_gemma":[0.9990395,0.00006967831,0.000059525326,0.0006621144,0.000078871424,0.00009032394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030022397,0.00016542367,0.00020541367,0.00008318054,0.00014872586,0.00033612203,0.0011070082,0.00006171527,0.00003638303],"category_scores_gemma":[0.00003710569,0.00013170423,0.00008516601,0.00027739067,0.00002484831,0.0006430634,0.00036809663,0.000067232235,0.000016311582],"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.0000019506138,0.00003061545,0.00003668734,0.000007383204,0.000032480777,0.000001529524,0.000023248955,0.000029614463,0.00015655319,0.15921022,0.030275958,0.8101938],"study_design_scores_gemma":[0.0011703487,0.000081070786,0.0006057713,0.0000035910734,0.000014377031,0.000002586576,0.0000043259583,0.77920955,0.0011514131,0.053949576,0.16354841,0.00025900325],"about_ca_topic_score_codex":0.000036286532,"about_ca_topic_score_gemma":0.000043945573,"teacher_disagreement_score":0.80993474,"about_ca_system_score_codex":0.000015327096,"about_ca_system_score_gemma":0.0000131599545,"threshold_uncertainty_score":0.5370743},"labels":[],"label_agreement":null},{"id":"W2169796379","doi":"10.1109/aiccsa.2003.1227557","title":"Using graph representation in content-based image retrieval","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Sherbrooke","funders":"","keywords":"Computer science; Matching (statistics); Cluster analysis; Content-based image retrieval; Image retrieval; Graph; Pattern recognition (psychology); Representation (politics); Content (measure theory); Artificial intelligence; Blossom algorithm; Image (mathematics); Mathematics; Theoretical computer science","score_opus":0.10213553031064675,"score_gpt":0.31487492935051237,"score_spread":0.2127393990398656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169796379","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.059383042,0.000007127489,0.93813705,0.00069611176,0.00014480256,0.000112150294,8.891744e-7,0.00008446821,0.0014343578],"genre_scores_gemma":[0.24068685,0.0000027983358,0.7585669,0.00052456185,0.000025358291,0.0000015960775,0.000012266378,0.000004779479,0.00017487629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993021,0.000019018466,0.00013386288,0.00023218914,0.00017018631,0.00014263164],"domain_scores_gemma":[0.9995861,0.000013219339,0.00003497389,0.00031066022,0.000027290984,0.000027757284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017276546,0.000058046255,0.00006519456,0.0001594379,0.00003380164,0.00017700362,0.00035522514,0.000015391379,0.000011110715],"category_scores_gemma":[0.00002391609,0.000053438427,0.000028471839,0.00061490224,0.00002150401,0.0010899086,0.000107973225,0.00004270625,0.000022864897],"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.00012186535,0.0010711841,0.018160095,0.00008487632,0.00006255723,0.0009663992,0.00078142714,0.007853046,0.28635144,0.64520895,0.00072432676,0.0386138],"study_design_scores_gemma":[0.0095512625,0.00018556307,0.03774148,0.00011489135,0.000018683726,0.000010092522,0.0005126293,0.37836134,0.5345764,0.03767779,0.00036924102,0.000880602],"about_ca_topic_score_codex":0.00042153223,"about_ca_topic_score_gemma":0.000026351343,"teacher_disagreement_score":0.6075312,"about_ca_system_score_codex":0.000034383058,"about_ca_system_score_gemma":0.000022083868,"threshold_uncertainty_score":0.21791558},"labels":[],"label_agreement":null},{"id":"W2169813676","doi":"","title":"On distributed robust routing for transportation networks under local information constraints","year":2011,"lang":"en","type":"article","venue":"Lund University Publications (Lund University)","topic":"Data Management and Algorithms","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":"Canadian Institute for Advanced Research","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network; Distributed computing; Static routing; Policy-based routing; Routing protocol","score_opus":0.02472950949099545,"score_gpt":0.1785706005424823,"score_spread":0.15384109105148686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169813676","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.00019532815,8.9278024e-7,0.8142994,0.00047266248,0.00011962754,0.00028685905,0.00022905383,0.0002417051,0.18415447],"genre_scores_gemma":[0.60662603,0.00010886708,0.19363545,0.0015760508,0.00017994051,0.000006543176,0.019968737,0.00005968323,0.17783871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999037,0.00004260244,0.00014592722,0.0003172267,0.0001587801,0.00029844063],"domain_scores_gemma":[0.9989028,0.00008785155,0.00017533981,0.00043355243,0.00025808753,0.00014237626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014385929,0.00014863127,0.00012099974,0.00059369154,0.0006722609,0.00015457488,0.001031966,0.00010344518,0.000052769516],"category_scores_gemma":[0.0000140896955,0.00018849861,0.000093458504,0.0014401766,0.00016186103,0.004733498,0.00010055686,0.00013482341,0.000020306039],"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.00002501183,0.000083121784,0.00006842086,0.000005928724,0.00004663242,0.000003404185,0.00023759171,0.005350621,2.9968413e-7,0.98642474,0.0021526262,0.005601604],"study_design_scores_gemma":[0.0015149108,0.00009998401,0.0044104108,0.000018154766,0.000090497735,0.0000013279391,0.0029302828,0.212956,0.000006268977,0.001509098,0.77610505,0.0003580527],"about_ca_topic_score_codex":0.00008000513,"about_ca_topic_score_gemma":0.000102194164,"teacher_disagreement_score":0.9849156,"about_ca_system_score_codex":0.00024517873,"about_ca_system_score_gemma":0.000093272814,"threshold_uncertainty_score":0.768675},"labels":[],"label_agreement":null},{"id":"W2169872697","doi":"10.1109/icde.2009.70","title":"Online Interval Skyline Queries on Time Series","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":56,"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":"SFU Community Trust Endowment Fund; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Skyline; Interval (graph theory); Computer science; Series (stratigraphy); Set (abstract data type); Time series; Data mining; Time complexity; On the fly; Space (punctuation); Algorithm; Mathematics; Combinatorics; Machine learning","score_opus":0.04585186737646731,"score_gpt":0.27924077977895334,"score_spread":0.23338891240248602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169872697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06378961,0.00017123869,0.6219607,0.13628821,0.008054355,0.0016595314,0.0036366193,0.006628421,0.1578113],"genre_scores_gemma":[0.8342899,0.0002694006,0.15449002,0.002066482,0.0012848421,0.000021209207,0.002752522,0.00004441157,0.0047812047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984556,0.0000027322844,0.00025493314,0.0005814181,0.0004546459,0.0002507058],"domain_scores_gemma":[0.999217,0.000018341207,0.000087294145,0.0004432165,0.00015604556,0.00007810669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019609879,0.0002319796,0.00016946519,0.0002493519,0.000050944676,0.0007352244,0.003336387,0.00004077916,0.00010139549],"category_scores_gemma":[0.00017747574,0.0002214169,0.00003084951,0.00020134203,0.000019910824,0.003317351,0.00080273283,0.00022692628,0.00015171168],"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.000038153583,0.00023236642,0.000021001164,0.000018378207,0.000061648236,0.000017043465,0.00012043403,0.0001394988,0.0023169662,0.9375855,0.009277109,0.050171956],"study_design_scores_gemma":[0.00034272068,0.00041156381,0.0010876877,0.00026423202,0.000008037688,0.00001676236,0.000044276923,0.937379,0.0015318088,0.0022060585,0.056272518,0.00043534784],"about_ca_topic_score_codex":0.0000030713422,"about_ca_topic_score_gemma":6.473442e-7,"teacher_disagreement_score":0.93723947,"about_ca_system_score_codex":0.000047533595,"about_ca_system_score_gemma":0.00001881437,"threshold_uncertainty_score":0.9029119},"labels":[],"label_agreement":null},{"id":"W2170300677","doi":"10.5267/j.msl.2011.12.024","title":"A fuzzy application on MICE hosting: An Iranian case study for locating suitable areas based on P.L Indexes","year":2012,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Data Management and Algorithms","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":"Fuzzy logic; Computer science; Business; Data mining; Artificial intelligence","score_opus":0.02597745523792985,"score_gpt":0.2824678375896739,"score_spread":0.2564903823517441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170300677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3841568,0.000002651735,0.60732156,0.002744213,0.0004819543,0.00234301,0.0000041586964,0.00027938344,0.0026662652],"genre_scores_gemma":[0.95473665,2.1054066e-7,0.03781312,0.006901406,0.0001266269,0.00031784692,0.000007712695,0.000014386009,0.00008202314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971303,0.00006446175,0.0002505567,0.0009284252,0.0008053576,0.0008209502],"domain_scores_gemma":[0.9982787,0.00011630055,0.00015739338,0.0012343972,0.000028036215,0.00018519323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002747387,0.00023373467,0.00014226422,0.0005868508,0.00085501,0.00081551215,0.0019111821,0.00002005578,0.0000018659009],"category_scores_gemma":[0.0000455557,0.0002193759,0.000040035524,0.0014222608,0.0001088316,0.0024572683,0.00042436147,0.000108859625,0.00004653733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010346377,0.0080597,0.14330001,0.0004356576,0.00012886745,0.0008479447,0.008735998,0.029027324,0.0039657285,0.09038721,0.008521008,0.70648706],"study_design_scores_gemma":[0.0035991902,0.0015953981,0.058146127,0.00013425045,0.0001321999,0.000035831185,0.007986899,0.9187201,0.0011770077,0.00048224287,0.006240634,0.0017501167],"about_ca_topic_score_codex":0.00013481615,"about_ca_topic_score_gemma":0.000014848254,"teacher_disagreement_score":0.8896928,"about_ca_system_score_codex":0.00013870135,"about_ca_system_score_gemma":0.0000080740665,"threshold_uncertainty_score":0.89458895},"labels":[],"label_agreement":null},{"id":"W2170892040","doi":"10.1109/icdew.2007.4400999","title":"Self Managing Top-k (Summary, Keyword) Indexes in XML Retrieval","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Computer science; Information retrieval; Relevance (law); XML; Exploit; Keyword search; Index (typography); Data retrieval; XML database; Data mining; Database; World Wide Web","score_opus":0.009753287891364539,"score_gpt":0.24140543600610764,"score_spread":0.2316521481147431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170892040","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.009358891,0.00011629112,0.73801345,0.0013395076,0.0006669543,0.00021509435,7.3537103e-7,0.00052210275,0.24976699],"genre_scores_gemma":[0.47700846,0.00021443424,0.4896006,0.003114102,0.00041075936,0.0000045366373,0.000020374904,0.000030252337,0.029596478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987174,0.000018382916,0.00022369248,0.00036197333,0.00028552682,0.00039299804],"domain_scores_gemma":[0.9993337,0.000053163665,0.000039365365,0.000488785,0.000017552855,0.00006742374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009447906,0.00011265205,0.00010977202,0.00029875583,0.000054460637,0.00023608207,0.0010340908,0.00003753154,0.000030793726],"category_scores_gemma":[0.000013197656,0.000103614184,0.00003143581,0.0008700424,0.000015746029,0.0010522329,0.00070688035,0.00012489299,0.000106333675],"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.00002323657,0.00021685232,0.021744607,0.000059078353,0.000037346534,0.00051424105,0.00077485526,0.000022662329,0.000071951625,0.49135235,0.0099810185,0.4752018],"study_design_scores_gemma":[0.0032285543,0.00027856947,0.08456949,0.00014734801,0.000024330955,0.000026457785,0.0005661029,0.26161975,0.006737716,0.054877162,0.58601457,0.0019099421],"about_ca_topic_score_codex":0.00005967953,"about_ca_topic_score_gemma":0.000067255234,"teacher_disagreement_score":0.57603353,"about_ca_system_score_codex":0.00004367695,"about_ca_system_score_gemma":0.000013246874,"threshold_uncertainty_score":0.4225264},"labels":[],"label_agreement":null},{"id":"W2170896764","doi":"10.1109/icde.2009.102","title":"Ranking with Uncertain Scores","year":2009,"lang":"en","type":"article","venue":"Proceedings - International Conference on Data Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":83,"is_retracted":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":"Ranking (information retrieval); Computer science; Rank (graph theory); Data mining; Set (abstract data type); Uncertain data; Probabilistic logic; Learning to rank; Semantics (computer science); Information retrieval; Ranking SVM; Sampling (signal processing); Machine learning; Artificial intelligence; Mathematics","score_opus":0.05920357991017572,"score_gpt":0.27934363750450186,"score_spread":0.22014005759432614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170896764","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.008208024,0.00003667396,0.9368629,0.008066685,0.00071724405,0.00032189448,0.000075157004,0.0009013112,0.04481014],"genre_scores_gemma":[0.9219407,0.000037389404,0.077161625,0.00032538496,0.00018156104,0.000008337062,0.00015063079,0.000009374357,0.000185035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866635,0.0000015056335,0.00015062783,0.0004987636,0.0004578409,0.00022492642],"domain_scores_gemma":[0.9993753,0.000014807223,0.00006634299,0.00035469123,0.0001288861,0.000059978815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020322595,0.00016389464,0.0001084189,0.00020472695,0.000049609254,0.0008419645,0.0031570017,0.000024168854,0.000027984524],"category_scores_gemma":[0.00006593875,0.0001413128,0.000014259505,0.00023584312,0.000012057377,0.0026647141,0.0004543117,0.00015338227,0.000026714699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014161341,0.000040628474,0.00017786102,0.000012695985,0.00004020184,0.000016759563,0.00009544526,0.00033852275,0.0009174052,0.9563231,0.0015591221,0.04046408],"study_design_scores_gemma":[0.00034202388,0.00011179779,0.0011467118,0.00019759625,0.0000059661656,0.000014048724,0.00002699741,0.98786163,0.00047598904,0.0016247057,0.007923328,0.00026918118],"about_ca_topic_score_codex":0.00000615178,"about_ca_topic_score_gemma":6.575959e-7,"teacher_disagreement_score":0.98752314,"about_ca_system_score_codex":0.000035281526,"about_ca_system_score_gemma":0.000020862171,"threshold_uncertainty_score":0.8119083},"labels":[],"label_agreement":null},{"id":"W2171353987","doi":"","title":"On multi-level k-ranges for range search.","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick; University of Victoria","funders":"","keywords":"Range (aeronautics); Combinatorics; Binary logarithm; Tree (set theory); Mathematics; Physics; Materials science","score_opus":0.1099219150007775,"score_gpt":0.29831106541324254,"score_spread":0.18838915041246504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171353987","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.005019663,0.00002153956,0.98316216,0.007694648,0.00046559656,0.00042790847,0.00047888976,0.00008920407,0.0026404122],"genre_scores_gemma":[0.849431,0.0000053259046,0.14509849,0.0041437116,0.000115506606,0.00004432554,0.0002561804,0.000016481654,0.0008889878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848294,0.000023630506,0.00016676707,0.0004996936,0.0003664928,0.00046047615],"domain_scores_gemma":[0.9988365,0.00018096634,0.000043944867,0.00033494507,0.00021637631,0.0003872503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023983441,0.00018133088,0.00015282753,0.00074396265,0.00025417068,0.00035848762,0.0009336573,0.000059822956,0.00006293957],"category_scores_gemma":[0.00007762426,0.0001864401,0.00006614615,0.0005327992,0.000056956393,0.00033081498,0.0000669235,0.00014310694,0.00038964767],"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.0000070926326,0.00006557599,0.00003578889,0.000016315502,0.0000259355,0.000022194183,0.00009810497,0.02177975,0.0000028240106,0.89669895,0.0029092182,0.07833823],"study_design_scores_gemma":[0.008024179,0.0011251066,0.047706388,0.00029427404,0.00002211496,0.000011824156,0.00017807209,0.6742974,0.0002465826,0.24777244,0.01869596,0.0016256971],"about_ca_topic_score_codex":0.002656978,"about_ca_topic_score_gemma":0.0050627925,"teacher_disagreement_score":0.8444113,"about_ca_system_score_codex":0.00022301722,"about_ca_system_score_gemma":0.0007115647,"threshold_uncertainty_score":0.76028067},"labels":[],"label_agreement":null},{"id":"W2176441584","doi":"10.1109/pacrim.2015.7334826","title":"The Area Code Tree for nearest neighbour searching","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Code (set theory); Nearest neighbour; Trie; Tree (set theory); Sequence (biology); k-nearest neighbors algorithm; Nearest neighbor search; Chain code; Algorithm; Theoretical computer science; Data structure; Data mining; Artificial intelligence; Mathematics; Combinatorics; Programming language","score_opus":0.09276382512785833,"score_gpt":0.2980709151642166,"score_spread":0.20530709003635825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176441584","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.00027551825,0.000030288043,0.9457122,0.0066936063,0.00031772547,0.00016458669,0.0000044709013,0.00011791894,0.046683695],"genre_scores_gemma":[0.30774698,0.000052332878,0.5702741,0.0036265634,0.0009109082,0.00016336392,0.000056860343,0.000041802552,0.117127046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993083,0.000019326151,0.000080843485,0.00017649833,0.00018881781,0.00022620236],"domain_scores_gemma":[0.9992639,0.00013276681,0.00002195822,0.0004562509,0.000043913173,0.00008125768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058463746,0.000057521305,0.000049809743,0.00002437184,0.000188378,0.0007367128,0.0011679664,0.000010379858,0.000002725971],"category_scores_gemma":[0.000074750125,0.000033850563,0.000028446717,0.00011811585,0.00002237742,0.0005318895,0.00043599654,0.00004363135,0.000057944555],"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.0000044189574,0.000016513923,0.00018342804,0.0000026416162,0.000011361668,0.0000031583318,0.00015349641,0.00003811176,0.0000068475115,0.44764987,0.15187968,0.40005046],"study_design_scores_gemma":[0.0003066998,0.00005406579,0.00048339632,0.0000026552104,0.0000019847002,0.000001065267,0.00010928546,0.5386511,0.00006873104,0.017005574,0.44323584,0.00007958917],"about_ca_topic_score_codex":0.000031320185,"about_ca_topic_score_gemma":0.00013161282,"teacher_disagreement_score":0.538613,"about_ca_system_score_codex":0.000012487299,"about_ca_system_score_gemma":0.000030489578,"threshold_uncertainty_score":0.7104139},"labels":[],"label_agreement":null},{"id":"W2183598638","doi":"","title":"SOLAP: A NEW TYPE OF USER INTERFACE TO SUPPORT SPATIO-TEMPORAL MULTIDIMENSIONAL DATA EXPLORATION AND ANALYSIS","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Online analytical processing; Data warehouse; Computer science; Exploit; Spatial database; Database; Data mining; Spatial analysis; Decision support system; Component (thermodynamics); Transaction data; Data science; Database transaction; Geography","score_opus":0.09455095475737456,"score_gpt":0.3248288427895295,"score_spread":0.23027788803215493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183598638","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.009879989,0.000010685043,0.98886245,0.0005274089,0.00011071846,0.00009799248,0.000010600079,0.00003044115,0.00046972575],"genre_scores_gemma":[0.3552258,0.000009621094,0.63927,0.0002090586,0.000013506009,0.000001158242,0.00030961246,0.000004218355,0.0049570305],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916965,0.000029795065,0.00017405034,0.000340325,0.00018372352,0.000102469654],"domain_scores_gemma":[0.99905807,0.000018849689,0.000051764488,0.000737703,0.000052800187,0.00008084109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030268278,0.000074242984,0.00012368018,0.00016424262,0.000025937314,0.000081841245,0.00045644364,0.00001589756,0.00017012397],"category_scores_gemma":[0.000043929933,0.0000636201,0.0000160108,0.00073065906,0.000010188164,0.001575953,0.0006252893,0.000025766118,0.000048788348],"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.000092089795,0.00058873004,0.086243145,0.000055233664,0.0014584621,0.000030443985,0.003066151,0.0036707788,0.0015371628,0.16404592,0.5521523,0.18705963],"study_design_scores_gemma":[0.001134379,0.0005743369,0.010837143,0.000017890654,0.00028431986,0.0000033449423,0.00025422534,0.6661649,0.0057328925,0.0013595655,0.31301022,0.0006268213],"about_ca_topic_score_codex":0.00015602277,"about_ca_topic_score_gemma":0.0002660844,"teacher_disagreement_score":0.6624941,"about_ca_system_score_codex":0.000005605878,"about_ca_system_score_gemma":0.000042143143,"threshold_uncertainty_score":0.25943524},"labels":[],"label_agreement":null},{"id":"W2184216761","doi":"10.1007/978-3-031-38906-1","title":"Algorithms and Data Structures","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":10,"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","funders":"Concordia University","keywords":"Computer science; Data structure; Programming language","score_opus":0.036449678339465635,"score_gpt":0.289143112668365,"score_spread":0.25269343432889935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184216761","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.000006091339,0.00045834194,0.9939894,0.00084656314,0.0030679228,0.00031707215,0.00006746308,0.00036184883,0.00088530517],"genre_scores_gemma":[0.00053290924,0.0002601578,0.9909501,0.0014870762,0.0014098494,0.000008994099,0.00027222722,0.00005835769,0.0050203414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951378,0.000043251814,0.00039837646,0.0026014433,0.0010753752,0.0007437619],"domain_scores_gemma":[0.9952762,0.00041465767,0.00018968133,0.0038631249,0.000084737505,0.00017159035],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013101458,0.00048225286,0.0004604938,0.00092828635,0.00026883942,0.0017797675,0.011321024,0.00020472502,0.000006236535],"category_scores_gemma":[0.00014026543,0.000424645,0.00004097706,0.0014706093,0.00066472666,0.0019285401,0.015378748,0.0006551282,0.0000590917],"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.5535905e-7,0.000008874827,0.00001924687,0.000047102752,0.000012784667,0.00013863001,0.00015914053,0.00080365746,0.0000044110884,0.0042018015,0.0028107776,0.9917928],"study_design_scores_gemma":[0.00019937611,0.000059942355,0.000381563,0.00013322971,0.000009770234,0.00003278358,1.7203868e-7,0.76861864,0.000040425643,0.21956445,0.010379547,0.00058008963],"about_ca_topic_score_codex":0.000026549409,"about_ca_topic_score_gemma":0.00006030609,"teacher_disagreement_score":0.9912127,"about_ca_system_score_codex":0.00012847997,"about_ca_system_score_gemma":0.00054818776,"threshold_uncertainty_score":0.99982053},"labels":[],"label_agreement":null},{"id":"W2186003804","doi":"","title":"Using Ontology Based Knowledge Discovery in Location Based Services","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Ontology; Computer science; Location-based service; Context (archaeology); Domain (mathematical analysis); Process (computing); Domain knowledge; Data science; Service (business); Raw data; Knowledge extraction; Data mining; Service provider; World Wide Web; Artificial intelligence; Geography","score_opus":0.045304923909569285,"score_gpt":0.3018490734310908,"score_spread":0.2565441495215215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186003804","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.015524875,0.000102180275,0.97864085,0.00025393,0.00037190167,0.000084904044,7.481165e-7,0.00006200525,0.004958595],"genre_scores_gemma":[0.9173883,5.160547e-7,0.08172304,0.00057778304,0.000054359392,0.0000047176586,0.0000138538935,0.0000034054697,0.00023398697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935013,0.000051367457,0.00011670823,0.00017185509,0.00007985725,0.00023009535],"domain_scores_gemma":[0.9995447,0.000040768806,0.00003448337,0.00032297597,0.000020870551,0.00003619966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027986668,0.00007386577,0.000077711855,0.00014960268,0.000034330413,0.00012643536,0.00045234986,0.000026352114,0.00001875413],"category_scores_gemma":[0.000004327667,0.000064417436,0.000016066653,0.0004197107,0.000012221545,0.0025031348,0.00014335706,0.000037384092,0.00005785441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033062188,0.0029273785,0.39672652,0.0008674781,0.000040891304,0.000020621927,0.0017186207,0.008227531,0.001577739,0.4044702,0.0015963357,0.18179365],"study_design_scores_gemma":[0.0002707165,0.000009449427,0.022083199,0.000021234551,0.0000029844887,2.918894e-7,0.000025881289,0.97446525,0.00055565464,0.000109851666,0.0023522277,0.000103288214],"about_ca_topic_score_codex":0.00024729222,"about_ca_topic_score_gemma":0.0003922344,"teacher_disagreement_score":0.96623766,"about_ca_system_score_codex":0.000037638936,"about_ca_system_score_gemma":0.000035959853,"threshold_uncertainty_score":0.2626867},"labels":[],"label_agreement":null},{"id":"W2205395973","doi":"","title":"Spatio-temporal trajectory models for target tracking","year":2014,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Data Management and Algorithms","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; Trajectory; Hidden Markov model; BitTorrent tracker; Tracking (education); Context model; Markov chain; Artificial intelligence; Context (archaeology); Scale (ratio); Machine learning; Eye tracking","score_opus":0.04446074168811947,"score_gpt":0.2722947473471788,"score_spread":0.2278340056590593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205395973","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.0010286267,0.0000012355828,0.9374815,0.0016607043,0.0010176088,0.00021589693,0.000032907767,0.00013593592,0.058425553],"genre_scores_gemma":[0.9390443,0.000008930388,0.058448702,0.0011064678,0.00013378229,0.000050411225,0.00080536935,0.0000046640616,0.00039736825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989259,0.000021410553,0.0003171576,0.00016261115,0.00042694932,0.00014595376],"domain_scores_gemma":[0.99915624,0.000045951623,0.00019310195,0.00023475177,0.00032157407,0.000048377355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037583712,0.000116299845,0.00009244146,0.0002484325,0.00011870579,0.00055103697,0.000824554,0.00004411647,0.00011170919],"category_scores_gemma":[0.00005793843,0.00010870578,0.000054810607,0.000093072034,0.000015432382,0.005204383,0.00013030431,0.00007686599,0.00012850258],"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.000019908905,0.000022223247,0.00004032139,0.000009897885,0.000007493856,1.3604058e-7,0.0003524817,0.002550154,0.000018453258,0.8501652,0.002857102,0.14395666],"study_design_scores_gemma":[0.00043152194,0.00007498765,0.00021221864,0.000027258826,0.0000014278066,6.99707e-7,0.00004316101,0.8832859,0.00024502244,0.036236037,0.07931495,0.0001268182],"about_ca_topic_score_codex":0.000016440517,"about_ca_topic_score_gemma":0.000005091344,"teacher_disagreement_score":0.9380157,"about_ca_system_score_codex":0.00004226675,"about_ca_system_score_gemma":0.00003671624,"threshold_uncertainty_score":0.5313662},"labels":[],"label_agreement":null},{"id":"W2215748439","doi":"10.1145/2820783.2820846","title":"Optimal time-dependent sequenced route queries in road networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"European Social Fund; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Pruning; Computer science; Sequence (biology); Set (abstract data type); Heuristic; Enhanced Data Rates for GSM Evolution; Dependency (UML); Travel time; Speedup; Function (biology); Scheme (mathematics); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Parallel computing","score_opus":0.021746509476664955,"score_gpt":0.24062002327376913,"score_spread":0.21887351379710418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215748439","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.0055828253,0.00006899923,0.9549769,0.0009009265,0.00041777303,0.00016017107,0.0000016581943,0.00028657445,0.03760418],"genre_scores_gemma":[0.6036033,0.000038389142,0.3411301,0.0013832079,0.00030786707,0.000048861893,0.000056781835,0.000025201927,0.05340628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989407,0.000040909134,0.00017047684,0.00031313967,0.0002488766,0.00028589682],"domain_scores_gemma":[0.9993692,0.00001203791,0.000036964815,0.00044887754,0.00003219178,0.00010070259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513819,0.0001101357,0.0001220547,0.00008219712,0.00002926159,0.0003195051,0.00093864545,0.000035840105,0.0000392826],"category_scores_gemma":[0.000015257329,0.00009413724,0.00002296134,0.0002985458,0.00002728556,0.0014337077,0.0006802768,0.00008976597,0.00032775963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052402258,0.0003525706,0.005616545,0.000015541871,0.00008564423,0.0008181782,0.0019163496,0.29444394,0.00011190727,0.1475083,0.076674245,0.47240436],"study_design_scores_gemma":[0.000419584,0.00005612179,0.00077804754,0.000007268146,0.0000019797044,0.0000049092123,0.000060819923,0.99277973,0.00008949146,0.00052108505,0.00509013,0.00019081506],"about_ca_topic_score_codex":0.0003399527,"about_ca_topic_score_gemma":0.00005985648,"teacher_disagreement_score":0.6983358,"about_ca_system_score_codex":0.0000542957,"about_ca_system_score_gemma":0.000041517877,"threshold_uncertainty_score":0.42127964},"labels":[],"label_agreement":null},{"id":"W2217207442","doi":"10.1007/978-3-642-32115-3_23","title":"Optimization of Quadtree Representation and Compression","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"McMaster University","funders":"","keywords":"Quadtree; Computer science; Representation (politics); Node (physics); Heuristic; Data compression; Algorithm; Compression (physics); R-tree; Theoretical computer science; Spatial analysis; Artificial intelligence; Spatial database; Mathematics; Statistics","score_opus":0.023680281446400418,"score_gpt":0.26125002521301244,"score_spread":0.23756974376661202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217207442","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.000022424427,0.0005304788,0.99629253,0.00021320728,0.0007620331,0.00022902717,0.0000037126458,0.00005610141,0.0018904615],"genre_scores_gemma":[0.041521907,0.0002474953,0.95753086,0.00019986395,0.00022657988,0.0000035418132,0.000024797839,0.00001673591,0.00022820567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807245,0.000023550381,0.00033598937,0.00072286103,0.000579203,0.00026592647],"domain_scores_gemma":[0.9985088,0.00016475571,0.00028695934,0.0008465885,0.00011192007,0.00008099377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004694179,0.00022907989,0.00028322855,0.0005277963,0.00010073617,0.0002268227,0.0013328891,0.00011827095,0.000015953621],"category_scores_gemma":[0.000032003107,0.0002060091,0.000041553652,0.00034990566,0.00032587367,0.0012474373,0.0014476677,0.00020627405,0.0000054608377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025770144,0.0000190877,0.000119783515,0.00003701659,0.000005919821,0.000006530421,0.00029566255,0.07234131,0.000073189265,0.013955421,0.000022194241,0.9131213],"study_design_scores_gemma":[0.00019441816,0.00005752554,0.00028764797,0.00020667756,0.0000088178695,0.000010637727,1.6228265e-7,0.9760132,0.0009414662,0.02161773,0.00038995466,0.00027179607],"about_ca_topic_score_codex":0.000017802306,"about_ca_topic_score_gemma":0.0000065632066,"teacher_disagreement_score":0.9128495,"about_ca_system_score_codex":0.000043223645,"about_ca_system_score_gemma":0.000052530264,"threshold_uncertainty_score":0.84008074},"labels":[],"label_agreement":null},{"id":"W2239313659","doi":"10.11575/prism/17658","title":"The 2DR-tree: a 2-dimensional spatial access method","year":2004,"lang":"en","type":"dissertation","venue":"PRISM (University of Calgary)","topic":"Data Management and Algorithms","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":"Node (physics); Algorithm; Computer science; Mathematics; Bounding overwatch; Tree (set theory); Partition (number theory); Time complexity; Binary number; Theoretical computer science; Combinatorics; Artificial intelligence","score_opus":0.012118856456450385,"score_gpt":0.2474575217851173,"score_spread":0.2353386653286669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2239313659","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.0006288722,0.0002355994,0.97758406,0.0006834112,0.0008529025,0.00025545913,0.0000011133696,0.00008086491,0.019677687],"genre_scores_gemma":[0.0011982752,0.0005042458,0.9008092,0.00017139518,0.00010192739,0.0000023649734,0.001006489,0.000038423233,0.09616763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998536,0.00007870394,0.00014412835,0.00044364497,0.0005581231,0.00023940072],"domain_scores_gemma":[0.9988143,0.0001022908,0.00029630182,0.0006031458,0.00010591646,0.000078050994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030631598,0.00018936855,0.00024114939,0.00017920144,0.00043775974,0.00016316757,0.0030759482,0.00014234522,0.000050960687],"category_scores_gemma":[0.000018068,0.00018073428,0.00016348939,0.00026800478,0.000058002184,0.00082406536,0.0007660618,0.00027007164,0.00004423801],"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.000039549654,0.000048194335,0.000008131697,0.000044900742,0.00009507641,0.00006218023,0.00038980058,0.000002765252,0.000020826987,0.014925345,0.0057246787,0.9786385],"study_design_scores_gemma":[0.003728258,0.00030779422,0.05744597,0.00047777823,0.0005323285,0.000010942392,0.00029176258,0.57935864,0.0009897255,0.05297536,0.30205083,0.0018306099],"about_ca_topic_score_codex":0.002627128,"about_ca_topic_score_gemma":0.0004899529,"teacher_disagreement_score":0.97680795,"about_ca_system_score_codex":0.000058044483,"about_ca_system_score_gemma":0.00021968459,"threshold_uncertainty_score":0.737013},"labels":[],"label_agreement":null},{"id":"W2257535843","doi":"10.1007/s10601-016-9238-x","title":"ℚ-bounds consistency for the spread constraint with variable mean","year":2016,"lang":"en","type":"article","venue":"Constraints","topic":"Data Management and Algorithms","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":"Variable (mathematics); Constraint (computer-aided design); Mathematics; Consistency (knowledge bases); Piecewise; Local consistency; Algorithm; Extension (predicate logic); Function (biology); Mathematical optimization; Computer science; Constraint satisfaction; Statistics; Discrete mathematics","score_opus":0.021146918477015452,"score_gpt":0.2322014977262077,"score_spread":0.21105457924919227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257535843","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.00023027792,0.00004613151,0.96562713,0.0043824157,0.0004273459,0.00047570202,0.00008438432,0.00013934581,0.028587254],"genre_scores_gemma":[0.72070545,0.000027137245,0.27427897,0.001325716,0.00018878699,0.00016137247,0.000011429009,0.000023073208,0.0032780555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875087,0.000028854227,0.0001979612,0.00041493555,0.00021509534,0.00039229204],"domain_scores_gemma":[0.9984195,0.000493224,0.00009347409,0.0007867177,0.00011778988,0.00008927445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050704926,0.00016480751,0.00015284074,0.000051266972,0.00025589645,0.00027837214,0.0011063357,0.000036995483,0.00017371339],"category_scores_gemma":[0.00006165702,0.00007975278,0.000053567688,0.00019021967,0.0009453857,0.00050435256,0.00019660323,0.00005774721,0.00007447895],"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.0000056099525,0.00002313554,0.00010715678,0.000008270927,0.000071701725,0.000008863103,0.00009663569,6.1496394e-7,0.00023767378,0.68171006,0.0027732565,0.314957],"study_design_scores_gemma":[0.010234199,0.00093915215,0.0019349477,0.000665019,0.0002281702,0.0004571444,0.001538137,0.007299779,0.0023569078,0.19722107,0.77520823,0.0019172283],"about_ca_topic_score_codex":0.000007142566,"about_ca_topic_score_gemma":0.00001035009,"teacher_disagreement_score":0.772435,"about_ca_system_score_codex":0.000026519418,"about_ca_system_score_gemma":0.00017684558,"threshold_uncertainty_score":0.3483313},"labels":[],"label_agreement":null},{"id":"W2266752413","doi":"10.3138/cart.50.4.3126","title":"Maps and the Meaning of the Cloud","year":2015,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","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":"Cloud computing; Workspace; Nexus (standard); Meaning (existential); Computer science; Symbol (formal); Scale (ratio); Data science; Geography; Cartography; Artificial intelligence; Epistemology; Operating system","score_opus":0.014762193782532636,"score_gpt":0.2584982673258402,"score_spread":0.24373607354330756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266752413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047792938,0.0010570422,0.893041,0.044991888,0.008626426,0.0014275747,0.000064419546,0.000094254705,0.002904417],"genre_scores_gemma":[0.9940085,0.0010198114,0.0013308787,0.0031962858,0.00027735034,0.000031709416,0.000053042088,0.0000063333314,0.00007610114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882424,0.00009190756,0.000394424,0.00007994695,0.0004933681,0.00011612357],"domain_scores_gemma":[0.9985245,0.00012209435,0.00041612692,0.0002013136,0.0006851498,0.000050810726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019221056,0.00009359929,0.000094585834,0.0002492994,0.00040926872,0.0007462704,0.00097227446,0.000033846354,0.0000012202064],"category_scores_gemma":[0.00023593724,0.000045288954,0.0001093388,0.00045666238,0.00026512065,0.001436709,0.00032860204,0.00012171816,5.530915e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004924366,0.000008726965,0.0025039401,0.000008656757,0.00009651753,1.2417932e-7,0.0024113385,0.00013735937,0.00000257274,0.9736326,0.0029157882,0.018233137],"study_design_scores_gemma":[0.0065744002,0.00013915876,0.0068507204,0.00011095138,0.00012277634,0.000245984,0.0034778202,0.19514516,0.00009844872,0.3339071,0.45303348,0.0002940275],"about_ca_topic_score_codex":0.000029994639,"about_ca_topic_score_gemma":0.0000104730625,"teacher_disagreement_score":0.94621557,"about_ca_system_score_codex":0.00000786316,"about_ca_system_score_gemma":0.000034736775,"threshold_uncertainty_score":0.7196303},"labels":[],"label_agreement":null},{"id":"W2272548005","doi":"","title":"OPEN DATA EN TRANSPORT URBAIN : QUELLES SONT LES DONNEES MISES A DISPOSITION ? QUELS SONT LES STRATEGIES DES AUTORITES ORGANISATRICES ?","year":2013,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Humanities; Political science; Art","score_opus":0.03676807949528188,"score_gpt":0.2555181290154801,"score_spread":0.21875004952019822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272548005","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.077263005,0.021489257,0.82689166,0.04262057,0.000603691,0.0017160134,0.00063314964,0.0005650885,0.028217565],"genre_scores_gemma":[0.6619908,0.006112402,0.2944673,0.00012143499,0.00013811594,0.0001346957,0.002027254,0.00007889708,0.034929086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9918357,0.004378763,0.0008243015,0.0014180833,0.0006301853,0.0009129322],"domain_scores_gemma":[0.9924955,0.001697373,0.00050054176,0.0035265095,0.0014219335,0.00035815555],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0069908933,0.00053922116,0.00050259155,0.00022072227,0.0013393415,0.006941069,0.0094606485,0.00022698495,0.00082557445],"category_scores_gemma":[0.00066530367,0.0005382794,0.00013916499,0.00089652033,0.0007357329,0.009571241,0.0045303614,0.000400834,0.0001678849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000009000152,0.0011963567,0.0063421163,0.00040550012,0.0001819383,0.000023964876,0.019306472,0.0000398776,0.0017492031,0.4927821,0.006298722,0.47166476],"study_design_scores_gemma":[0.0034570459,0.000020339254,0.15150759,0.009051718,0.00071137643,0.000090242764,0.03213945,0.2818561,0.02272128,0.07746369,0.41691977,0.0040614074],"about_ca_topic_score_codex":0.06857945,"about_ca_topic_score_gemma":0.032544065,"teacher_disagreement_score":0.5847278,"about_ca_system_score_codex":0.00016368547,"about_ca_system_score_gemma":0.0005569261,"threshold_uncertainty_score":0.9999608},"labels":[],"label_agreement":null},{"id":"W2274280163","doi":"10.1007/978-3-642-24412-4_34","title":"Learning a Classifier when the Labeling Is Known","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Classifier (UML); Artificial intelligence; Computer science","score_opus":0.03076799446700004,"score_gpt":0.23714233784831265,"score_spread":0.2063743433813126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274280163","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.000007073166,0.00044222694,0.9716647,0.0019987193,0.001719235,0.0002898382,0.0000027772646,0.00018841491,0.023686977],"genre_scores_gemma":[0.015758708,0.00036383345,0.9418332,0.011556331,0.0018495503,0.000028977782,0.000016020229,0.000109286644,0.02848411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964063,0.00004579052,0.00042621448,0.0014742826,0.0009369198,0.0007104592],"domain_scores_gemma":[0.9974156,0.00029200016,0.00028452373,0.0017276512,0.00016208632,0.0001181268],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012840931,0.00048608755,0.0003746997,0.0005236531,0.0005398454,0.0012195114,0.006347112,0.0002078007,0.00012618469],"category_scores_gemma":[0.000064363536,0.000345423,0.0001332451,0.00048227952,0.0006115197,0.0010227786,0.0036483833,0.0012322844,0.00026238573],"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.0000016023314,0.000011974671,0.000026119424,0.000015571788,0.000016571246,0.000040798594,0.002384147,0.00081392535,0.0000132929,0.030533575,0.0004001535,0.9657423],"study_design_scores_gemma":[0.00024551447,0.00018729716,0.000050052146,0.00034935965,0.000021108423,0.000029897921,7.340422e-7,0.501103,0.000333843,0.35162878,0.14515366,0.000896784],"about_ca_topic_score_codex":0.00003815799,"about_ca_topic_score_gemma":0.000030794276,"teacher_disagreement_score":0.9648455,"about_ca_system_score_codex":0.00011314957,"about_ca_system_score_gemma":0.00021572575,"threshold_uncertainty_score":0.9998998},"labels":[],"label_agreement":null},{"id":"W2277931218","doi":"10.1007/978-3-319-24704-5_18","title":"L-Fuzzy Databases in Arrow Categories","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Brock University","funders":"","keywords":"Computer science; Arrow; Fuzzy logic; Database; Semantics (computer science); Fuzzy set; Information retrieval; Data mining; Theoretical computer science; Artificial intelligence; Natural language processing; Programming language","score_opus":0.043052184250674363,"score_gpt":0.2719023573771973,"score_spread":0.22885017312652295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277931218","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.000012900682,0.00082969083,0.97628564,0.0008319699,0.0022641227,0.00033189147,0.000022344448,0.00016466551,0.019256804],"genre_scores_gemma":[0.03304512,0.00021110161,0.95829517,0.0022486725,0.0012727709,0.000029243167,0.0001581413,0.000081552,0.004658235],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995755,0.000034341938,0.0005205268,0.001719928,0.0012064651,0.0007637073],"domain_scores_gemma":[0.9971526,0.00022693601,0.00022013875,0.00203832,0.00017437451,0.0001875812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013668828,0.0005413073,0.00053892855,0.0012638508,0.00013405489,0.00077230716,0.005085244,0.000121540004,0.000015352938],"category_scores_gemma":[0.00011962134,0.0004945453,0.00007153261,0.0009894699,0.0006240106,0.0021455898,0.0035848147,0.00069638423,0.00011442085],"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.0000052804157,0.0000523117,0.0001813377,0.00005344029,0.000010662868,0.0004967762,0.0005919014,0.008055136,0.000015900312,0.24868394,0.0011795424,0.7406738],"study_design_scores_gemma":[0.0006922349,0.00016098072,0.00019622131,0.0005264678,0.000011970617,0.000057637375,8.86424e-7,0.2250329,0.0003615098,0.7072053,0.064129725,0.0016241769],"about_ca_topic_score_codex":0.00015370957,"about_ca_topic_score_gemma":0.0006354616,"teacher_disagreement_score":0.7390496,"about_ca_system_score_codex":0.000287708,"about_ca_system_score_gemma":0.00053897715,"threshold_uncertainty_score":0.9997506},"labels":[],"label_agreement":null},{"id":"W2278525775","doi":"10.4271/2005-01-1599","title":"A Navigation Assistance Agent: Online Access to LBS","year":2005,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","topic":"Data Management and Algorithms","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":"Université de Sherbrooke","funders":"Xiamen University; Jilin University","keywords":"Computer science; World Wide Web","score_opus":0.023266095078658476,"score_gpt":0.2917587890252124,"score_spread":0.26849269394655395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278525775","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.48404902,0.0013765866,0.002669826,0.24838652,0.0031292778,0.008560433,0.00083892833,0.026153792,0.22483562],"genre_scores_gemma":[0.9191624,0.00016669667,0.06790301,0.010613224,0.0003837622,0.0002726549,0.00016289015,0.00007244784,0.0012629326],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9944845,0.0001319917,0.0010741804,0.0018319029,0.0013713259,0.0011060865],"domain_scores_gemma":[0.99614835,0.00023023946,0.00026867626,0.0026590242,0.00014085647,0.00055284414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007254099,0.00074023625,0.00072505075,0.00032202044,0.00045356437,0.00088653166,0.005268846,0.00041396762,0.00027250807],"category_scores_gemma":[0.00035568784,0.0006623505,0.00034147198,0.0019762653,0.0003774398,0.003506544,0.0025756152,0.00093697786,0.00053596403],"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.00013134726,0.0009793767,0.0001231337,0.00005459191,0.0000517607,0.000109907494,0.000044664514,0.00008504139,0.7024454,0.0661045,0.032532472,0.19733784],"study_design_scores_gemma":[0.00042980682,0.0004782461,0.67716455,0.00018163415,0.000027634704,0.00002591915,0.000015683481,0.0000025066888,0.00010377255,0.0016595151,0.31927305,0.00063764805],"about_ca_topic_score_codex":0.00002909122,"about_ca_topic_score_gemma":0.037217837,"teacher_disagreement_score":0.7023416,"about_ca_system_score_codex":0.00038483564,"about_ca_system_score_gemma":0.00007902966,"threshold_uncertainty_score":0.99958277},"labels":[],"label_agreement":null},{"id":"W2279033101","doi":"10.1007/978-3-540-85902-4_3","title":"XML Retrieval by Improving Structural Relevance Measures Obtained from Summary Models","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Relevance (law); Information retrieval; Ranking (information retrieval); XML; Rank (graph theory); Data mining; Document Structure Description; World Wide Web","score_opus":0.01870901423863776,"score_gpt":0.22113036841028633,"score_spread":0.20242135417164858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279033101","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.000117307136,0.002995883,0.99102247,0.000456904,0.0023612322,0.00044310457,0.0000912391,0.000337181,0.0021746943],"genre_scores_gemma":[0.07199304,0.0010088513,0.92010045,0.0027146244,0.0015278669,0.0000079383335,0.00022005408,0.00012228078,0.0023048637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99377483,0.000052166386,0.0007025849,0.0025423989,0.0019539732,0.000974016],"domain_scores_gemma":[0.9963844,0.00046882906,0.00044000958,0.0022048892,0.0002595786,0.00024230454],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006506285,0.00080915354,0.00071332377,0.00058105885,0.00049485365,0.0010476083,0.006499808,0.0003526752,0.000015066691],"category_scores_gemma":[0.00013508984,0.00074492506,0.0001742983,0.0007106204,0.0007424933,0.0029123304,0.0030045283,0.0010692021,0.000025663952],"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.000022088081,0.000016169131,0.000011689189,0.000028250262,0.000031702937,0.00019919629,0.0005823469,0.014295433,0.0005699701,0.003149656,0.0011758168,0.9799177],"study_design_scores_gemma":[0.00039079494,0.00010286379,0.000024110646,0.00019878925,0.000012705776,0.00002221898,2.061088e-7,0.8932749,0.0013259865,0.10002672,0.0036401115,0.0009805736],"about_ca_topic_score_codex":0.00015311629,"about_ca_topic_score_gemma":0.000033106855,"teacher_disagreement_score":0.9789371,"about_ca_system_score_codex":0.00036958832,"about_ca_system_score_gemma":0.0004154865,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W2279569925","doi":"10.1016/j.jlamp.2015.12.006","title":"Dependencies in relational models of databases","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Data Management and Algorithms","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":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relational database; Computer science; Fuzzy logic; Set (abstract data type); Fuzzy set; Data mining; Relational model; Database; Binary number; Binary relation; Value (mathematics); Database model; Theoretical computer science; Mathematics; Artificial intelligence; Discrete mathematics; Programming language; Machine learning; Arithmetic","score_opus":0.13628566378259063,"score_gpt":0.3716287206328223,"score_spread":0.23534305685023169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279569925","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.022637298,0.00059133925,0.97591174,0.0005283365,0.00009461141,0.00005822662,0.0000010014272,0.000006043002,0.00017138585],"genre_scores_gemma":[0.123036236,0.00015972686,0.876713,0.00003149652,0.000027327265,0.0000019229658,3.1655702e-7,0.000001923789,0.00002808541],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.00024137762,0.0005398721,0.0001567492,0.00024442986,0.00016190627],"domain_scores_gemma":[0.99879974,0.00072266033,0.00025060982,0.00012633228,0.000047784684,0.000052847634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030004845,0.00007825052,0.00023478671,0.00022284473,0.000019557963,0.000032953307,0.00037099878,0.000030703646,0.000010818451],"category_scores_gemma":[0.0004405981,0.00004310924,0.000046298668,0.00029906328,0.00007353661,0.0012304928,0.00029380785,0.0001286087,3.0887188e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008293286,0.00006588216,0.0040139733,0.000011371345,0.0000067183482,0.000036586345,0.00006657034,0.000018138857,0.00037887477,0.21937506,0.0000071868444,0.77601135],"study_design_scores_gemma":[0.0021689015,0.0004900797,0.03054842,0.0007053323,0.00001920635,0.00016872596,0.00021551254,0.021423222,0.0018294362,0.9364905,0.0055946475,0.00034604906],"about_ca_topic_score_codex":0.0000048551065,"about_ca_topic_score_gemma":0.0000032388966,"teacher_disagreement_score":0.7756653,"about_ca_system_score_codex":0.000013947913,"about_ca_system_score_gemma":0.000023340419,"threshold_uncertainty_score":0.17579438},"labels":[],"label_agreement":null},{"id":"W2279683949","doi":"10.1007/978-3-642-38457-8_28","title":"Preference Thresholds Optimization by Interactive Variation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"","keywords":"Weighting; Cluster analysis; Similarity (geometry); Preference; Computer science; Variation (astronomy); Cluster (spacecraft); Statistics; Data mining; Artificial intelligence; Mathematics; Physics","score_opus":0.017747836409253533,"score_gpt":0.22824435531297613,"score_spread":0.2104965189037226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279683949","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.000005952076,0.00011369525,0.9864002,0.0005707748,0.0015639835,0.00050278363,0.000012613636,0.00017516201,0.010654862],"genre_scores_gemma":[0.018040774,0.00011654765,0.97736275,0.001294997,0.00034694234,0.000030606054,0.00009485232,0.000036922596,0.00267558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677086,0.000029554069,0.0004202,0.0014534858,0.0008484474,0.000477449],"domain_scores_gemma":[0.9978554,0.00020173626,0.00034668137,0.0012273836,0.0002519808,0.00011681085],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004703612,0.0004444498,0.0003404351,0.0005827507,0.00018843017,0.0014233727,0.003498967,0.00021908179,0.00014301745],"category_scores_gemma":[0.000053744112,0.00040814755,0.0000651477,0.0005123201,0.00024386623,0.0031322322,0.001767009,0.0005364064,0.0001493732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038909056,0.000052650354,0.000012574126,0.00002717236,0.000023148614,0.00001427373,0.0006541232,0.13478747,0.000081471226,0.026422836,0.00089844916,0.83702195],"study_design_scores_gemma":[0.000173018,0.00009881698,0.00003978912,0.00015072229,0.000006927585,0.000006830005,9.3012474e-8,0.94654006,0.00023887059,0.050792933,0.0014689603,0.0004829739],"about_ca_topic_score_codex":0.00003803487,"about_ca_topic_score_gemma":0.0000105467525,"teacher_disagreement_score":0.836539,"about_ca_system_score_codex":0.00024911165,"about_ca_system_score_gemma":0.00016186404,"threshold_uncertainty_score":0.99983704},"labels":[],"label_agreement":null},{"id":"W2279848971","doi":"10.1109/wi-iat.2015.173","title":"Querying RDF Data with Imprecise Time Phrases","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"RDF; Computer science; SPARQL; Simple Knowledge Organization System; RDF Schema; Information retrieval; RDF query language; Cwm; Semantic Web; Linked data; Representation (politics); RDF/XML; Data mining; Web search query; Web query classification; Search engine","score_opus":0.07435423628405952,"score_gpt":0.2695548766888717,"score_spread":0.19520064040481216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279848971","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.001071546,0.000056545323,0.9282613,0.0009849758,0.00016798296,0.00012707402,0.000016996297,0.00039614362,0.06891742],"genre_scores_gemma":[0.04314416,0.00001607141,0.91099507,0.0013730729,0.0002914371,0.000010491392,0.00035059202,0.00002260057,0.04379651],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991143,0.000016654882,0.00008463912,0.0003612385,0.00024899974,0.00017419911],"domain_scores_gemma":[0.9983177,0.000025664925,0.000030067506,0.001496253,0.000028992554,0.000101298254],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000302025,0.000082520055,0.0000810204,0.000051044863,0.00003759165,0.00035630894,0.0021747402,0.000011741466,0.000048606587],"category_scores_gemma":[0.000023328068,0.000056559995,0.000007580132,0.0002325632,0.00001959612,0.0026308764,0.0017553857,0.000037391896,0.00082812394],"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.000012191065,0.00012535625,0.00057822163,0.000009395326,0.000050429342,0.00010935297,0.000224272,0.000043593263,0.00006207035,0.017241528,0.55155665,0.42998692],"study_design_scores_gemma":[0.00095816795,0.00016592022,0.00019196101,0.000026731737,0.000019029227,0.000020021278,0.00010224906,0.7346028,0.00044338015,0.0013881166,0.26163352,0.00044811916],"about_ca_topic_score_codex":0.00007343887,"about_ca_topic_score_gemma":0.000012706661,"teacher_disagreement_score":0.7345592,"about_ca_system_score_codex":0.000009595947,"about_ca_system_score_gemma":0.000039958966,"threshold_uncertainty_score":0.9999499},"labels":[],"label_agreement":null},{"id":"W2288975584","doi":"10.1007/s10707-016-0245-2","title":"The direction-constrained k nearest neighbor query","year":2016,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"k-nearest neighbors algorithm; Geography; Best bin first; Nearest neighbor search; Cartography; Mathematics; Computer science; Data mining; Artificial intelligence","score_opus":0.0063903637919549405,"score_gpt":0.19970990491244206,"score_spread":0.19331954112048713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288975584","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.00061153475,0.000037820195,0.80855227,0.01385594,0.0010936336,0.00025245434,0.000011552186,0.00043980594,0.17514499],"genre_scores_gemma":[0.74348027,0.00092937006,0.15006343,0.0053711203,0.001217323,0.0003114414,0.000038791248,0.000056223613,0.09853203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918556,0.000015844578,0.00021473064,0.00010532795,0.00020165948,0.00027685173],"domain_scores_gemma":[0.99905556,0.00019314932,0.00006958555,0.0005880526,0.00003234557,0.000061317674],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032249745,0.00008472628,0.000068576104,0.0000418494,0.0003020895,0.00043482622,0.0008715089,0.000019165205,0.00004408661],"category_scores_gemma":[0.00006631906,0.00004005361,0.000041340474,0.00017978554,0.00008154667,0.0017393756,0.0003106732,0.000041994957,0.0012005748],"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.0000015426622,0.0000067272185,0.00002970249,0.000005045268,0.000013594875,0.000001912793,0.00013371541,7.8196325e-7,0.000010837778,0.20213385,0.019903827,0.7777585],"study_design_scores_gemma":[0.00046469638,0.000048383736,0.0018524822,0.00003627777,0.000005916669,0.000014775672,0.0001388555,0.037881475,0.0001950811,0.007196896,0.9519429,0.0002222534],"about_ca_topic_score_codex":0.000007207824,"about_ca_topic_score_gemma":0.000007790708,"teacher_disagreement_score":0.9320391,"about_ca_system_score_codex":0.000016347323,"about_ca_system_score_gemma":0.000031139647,"threshold_uncertainty_score":0.9995771},"labels":[],"label_agreement":null},{"id":"W2290690097","doi":"10.1145/2820783.2820785","title":"Meet-and-go","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point (geometry); Computer science; Aggregate (composite); Simple (philosophy); Impression; World Wide Web; Human–computer interaction; Information retrieval; Mathematics","score_opus":0.03996244385714242,"score_gpt":0.24542442090468836,"score_spread":0.20546197704754593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290690097","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.0005458657,0.00004827796,0.712588,0.0025171053,0.0002270725,0.000034573754,2.7498587e-7,0.00015803278,0.28388077],"genre_scores_gemma":[0.23795545,0.000022920458,0.69552755,0.0036389788,0.000189246,0.00000798237,0.0000046855675,0.0000075960315,0.062645555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969286,0.0000057178913,0.000035594992,0.000107736225,0.00008704571,0.00007106761],"domain_scores_gemma":[0.99972636,0.000005301027,0.0000071213576,0.00019225027,0.000011941907,0.000057021847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012684437,0.0000288785,0.000029554103,0.000022747818,0.000013896815,0.00012737082,0.00030675804,0.000006315937,0.0000069124867],"category_scores_gemma":[0.0000072138955,0.000021810234,0.000005380264,0.000081668484,0.0000081827675,0.0005053622,0.00033713784,0.000011317132,0.00017824343],"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":[2.2804022e-7,0.0000079014535,0.00020894042,0.0000010308418,0.0000031879906,0.000005199531,0.00007243694,8.262173e-7,0.0000035349306,0.76621497,0.13783315,0.0956486],"study_design_scores_gemma":[0.00044945077,0.000064562955,0.0009369762,0.0000028044828,0.0000031839027,0.000005571171,0.000059848444,0.11153799,0.00026489724,0.047208175,0.8392818,0.00018473946],"about_ca_topic_score_codex":0.000011503097,"about_ca_topic_score_gemma":0.0000033243077,"teacher_disagreement_score":0.7190068,"about_ca_system_score_codex":0.0000029317891,"about_ca_system_score_gemma":0.000005729593,"threshold_uncertainty_score":0.2291018},"labels":[],"label_agreement":null},{"id":"W2292015157","doi":"10.1145/2820783.2820791","title":"Graphast","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Order (exchange); Distributed computing; Data mining","score_opus":0.048982047433589054,"score_gpt":0.24592114263520726,"score_spread":0.1969390952016182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292015157","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.00015629953,0.000011183835,0.8077959,0.0008108558,0.00021508339,0.000017930724,1.6004965e-7,0.0001371532,0.19085544],"genre_scores_gemma":[0.28253606,0.0000063176335,0.67538226,0.0027516678,0.00016859027,0.0000072160105,0.000007913141,0.000005909019,0.039134074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997138,0.000004343051,0.000031883552,0.00008814781,0.000092639726,0.00006921979],"domain_scores_gemma":[0.9997047,0.0000026644393,0.0000063532416,0.00022338035,0.000013609515,0.000049298116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009867918,0.000024319777,0.00002215953,0.000030821884,0.000011612017,0.000103232705,0.00045894217,0.0000045443644,0.000010837484],"category_scores_gemma":[0.0000040366,0.00001861277,0.000008746805,0.00015128088,0.0000057774014,0.00053538004,0.00019907235,0.0000122491965,0.0004060297],"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":[1.8705595e-7,0.000014434163,0.0001964681,4.650202e-7,0.000002615957,0.0000065276377,0.000045275563,0.0000019205258,0.0000030324302,0.72535294,0.16956006,0.104816094],"study_design_scores_gemma":[0.0004571853,0.000062558625,0.0007980529,0.0000016681872,0.0000016924386,0.000004196456,0.000057064866,0.06955192,0.00028394093,0.050963234,0.87765014,0.00016831612],"about_ca_topic_score_codex":0.000009247261,"about_ca_topic_score_gemma":0.0000014417867,"teacher_disagreement_score":0.7080901,"about_ca_system_score_codex":0.0000025502984,"about_ca_system_score_gemma":0.000005697541,"threshold_uncertainty_score":0.52188253},"labels":[],"label_agreement":null},{"id":"W2293475867","doi":"","title":"Towards web search engine scale data mining","year":2009,"lang":"en","type":"article","venue":"Australasian Data Mining Conference","topic":"Data Management and Algorithms","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":"Computer science; Scalability; Adaptability; Search engine; Web mining; Data science; Data mining; Context (archaeology); Web search query; Web crawler; Web search engine; Metasearch engine; Search analytics; Construct (python library); Big data; Information retrieval; World Wide Web; Database; Web service","score_opus":0.12955901543971857,"score_gpt":0.33253224259375386,"score_spread":0.2029732271540353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293475867","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.054869063,0.00020839344,0.86054313,0.02536347,0.0018034299,0.00089831714,0.0036457146,0.0016454438,0.051023018],"genre_scores_gemma":[0.5992321,0.000063024294,0.3954629,0.0002864459,0.00022929657,0.0000027527287,0.0031626155,0.000014344663,0.0015465501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996307,0.000086531574,0.0004314037,0.0016690837,0.0006730146,0.00083297153],"domain_scores_gemma":[0.9922827,0.00007112055,0.000116634146,0.0071717333,0.00008556889,0.00027223834],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011243944,0.00033458747,0.0003316863,0.00023246185,0.00020266749,0.0013976339,0.01519033,0.000096641044,0.00015281189],"category_scores_gemma":[0.00014072495,0.0003351947,0.000028971872,0.0007453918,0.00010993386,0.005879886,0.006175507,0.00030653697,0.00017994805],"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.0000042519737,0.00008069877,0.0006312301,0.000018551389,0.000029582994,0.00011030205,0.00042805544,0.0000041242024,0.00018599714,0.0022102331,0.052083112,0.94421387],"study_design_scores_gemma":[0.0010743767,0.0003205574,0.020264715,0.0003027392,0.0000671983,0.00007532038,0.00095432345,0.895548,0.00046170354,0.00023787898,0.07958547,0.0011077382],"about_ca_topic_score_codex":0.000045363235,"about_ca_topic_score_gemma":0.00004323543,"teacher_disagreement_score":0.9431061,"about_ca_system_score_codex":0.000025046655,"about_ca_system_score_gemma":0.00031980913,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W2295016007","doi":"","title":"Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time.","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Intersection (aeronautics); Combinatorics; Line (geometry); Binary logarithm; Point (geometry); Line segment; Reduction (mathematics); Time complexity; Mathematics; Algorithm; Computer science; Discrete mathematics; Geometry","score_opus":0.026179486533430895,"score_gpt":0.22125303109264802,"score_spread":0.19507354455921713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295016007","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.026025224,0.000013030047,0.9038465,0.000258736,0.00047797925,0.00017702421,5.385128e-7,0.00024669833,0.06895428],"genre_scores_gemma":[0.74813026,0.000009107834,0.24220149,0.0008977048,0.000106683554,0.000022499697,0.000012219181,0.000011636417,0.008608423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931335,0.00001952164,0.00017146695,0.0002093795,0.00012570355,0.00016056295],"domain_scores_gemma":[0.99961954,0.0000127992125,0.000043954435,0.0002781051,0.000019758785,0.000025835068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033240762,0.00007386076,0.00008139698,0.00014346211,0.000028747516,0.00007643682,0.00044812614,0.00001829776,0.000311114],"category_scores_gemma":[0.00001295576,0.000062635736,0.00001935716,0.00028494265,0.000011484077,0.00071208674,0.0003126813,0.00005194599,0.0005879944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022077407,0.0014526843,0.006584087,0.00021117406,0.00014835004,0.00023814662,0.011091398,0.00011621377,0.004536904,0.10835043,0.051392943,0.8158556],"study_design_scores_gemma":[0.00060889334,0.00018671642,0.006512693,0.00008082869,0.000008223871,0.000008322677,0.0002389504,0.98238456,0.0036836285,0.0036181964,0.00234633,0.00032266768],"about_ca_topic_score_codex":0.00017714115,"about_ca_topic_score_gemma":0.000046545927,"teacher_disagreement_score":0.98226833,"about_ca_system_score_codex":0.00003566767,"about_ca_system_score_gemma":0.000007658179,"threshold_uncertainty_score":0.75576746},"labels":[],"label_agreement":null},{"id":"W2295019244","doi":"10.5220/0005463203670373","title":"The mqr-tree for Very Large Object Sets","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; R-tree; Object-based spatial database; Spatial database; Benchmark (surveying); Object (grammar); Tree (set theory); Data mining; Index (typography); Access method; Database index; Point (geometry); Spatial query; Spatial analysis; Information retrieval; Database; Artificial intelligence; Web search query; Search engine; Sargable; Geography; Mathematics; World Wide Web","score_opus":0.03595741419305881,"score_gpt":0.27710284631447935,"score_spread":0.24114543212142053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295019244","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.00024983444,0.00009742337,0.938937,0.0030722865,0.0010045512,0.00021750663,0.0000074061522,0.00017375828,0.05624021],"genre_scores_gemma":[0.2719238,0.000113861526,0.5166194,0.009592761,0.0012135867,0.00028297032,0.00013042925,0.00005328657,0.20006989],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937415,0.000014255802,0.000074615455,0.00016215997,0.00015330943,0.00022151106],"domain_scores_gemma":[0.9993578,0.00007285181,0.000021260847,0.00045856673,0.00003821315,0.000051311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055157446,0.00005652948,0.000048230915,0.000021025153,0.00012250457,0.00033496736,0.0009376774,0.000012750998,0.000003266908],"category_scores_gemma":[0.000041881136,0.00003341197,0.000031328887,0.00011687518,0.00001130734,0.0005261136,0.00043528466,0.000026870868,0.00014655743],"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.0000030841254,0.000023996121,0.00008661381,0.0000027147219,0.000013113935,0.0000026252387,0.00009027519,0.000001622153,0.0000020628358,0.27689463,0.566801,0.15607822],"study_design_scores_gemma":[0.0004181801,0.00005381759,0.00027542713,0.0000016731266,0.0000028694524,7.8745023e-7,0.00007878718,0.09441459,0.00009787062,0.013741224,0.89082944,0.00008533795],"about_ca_topic_score_codex":0.000008151233,"about_ca_topic_score_gemma":0.000051841653,"teacher_disagreement_score":0.42231762,"about_ca_system_score_codex":0.0000104539495,"about_ca_system_score_gemma":0.0000240597,"threshold_uncertainty_score":0.3230098},"labels":[],"label_agreement":null},{"id":"W2295356180","doi":"10.1145/2830567","title":"Adaptive and Approximate Orthogonal Range Counting","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Center for Massive Data Algorithmics; Danmarks Grundforskningsfond","keywords":"Range (aeronautics); Mathematics; Combinatorics; Computer science; Discrete mathematics; Algorithm; Statistics; Artificial intelligence","score_opus":0.02557180926512948,"score_gpt":0.23998807247528925,"score_spread":0.21441626321015977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295356180","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.00095465546,0.000048099755,0.9955642,0.0019924673,0.00037428277,0.00018085678,0.000054582248,0.0002645979,0.0005662595],"genre_scores_gemma":[0.2991363,0.00042020078,0.696058,0.0008559849,0.00019259406,0.0001291129,0.0000054803604,0.000043842054,0.0031584643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860334,0.00004048217,0.00019210462,0.0005196199,0.0003126159,0.00033181653],"domain_scores_gemma":[0.9988912,0.00016984699,0.000061973966,0.0007194054,0.000052431762,0.000105178646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028274665,0.000187063,0.00015615424,0.00016747872,0.00025521108,0.00016662675,0.00078693574,0.000052322994,0.00006278072],"category_scores_gemma":[0.000015984539,0.00013345909,0.00006168097,0.000303563,0.000089832356,0.0012576517,0.000056398225,0.000118566124,0.00011596074],"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.000008820534,0.0000653901,0.00002867208,0.000005745794,0.000039871422,0.000014505199,0.00008653558,0.000014617383,0.00006827123,0.003948994,0.000104434,0.9956142],"study_design_scores_gemma":[0.0120554045,0.0017386419,0.013141294,0.0006292575,0.00025397367,0.00026799255,0.00062123133,0.847144,0.005443402,0.05913751,0.055882677,0.003684589],"about_ca_topic_score_codex":0.000013904663,"about_ca_topic_score_gemma":0.000006993845,"teacher_disagreement_score":0.99192953,"about_ca_system_score_codex":0.000032027132,"about_ca_system_score_gemma":0.000020436211,"threshold_uncertainty_score":0.54423034},"labels":[],"label_agreement":null},{"id":"W2295558846","doi":"10.3166/isi.20.2.9-39","title":"Méthode de factorisation progressive pour accroître l’abstraction d’un modèle de classes","year":2015,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Mod; Mathematics; Physics; Combinatorics","score_opus":0.09510193298799904,"score_gpt":0.28081125773537063,"score_spread":0.1857093247473716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295558846","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.05365644,0.0007732124,0.9302221,0.001510814,0.0020318637,0.0005240617,0.00007602523,0.0003341732,0.010871336],"genre_scores_gemma":[0.84239984,0.00014576412,0.1544098,0.00040010994,0.000659324,0.0001058208,0.00040971796,0.000024303867,0.0014453552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755585,0.00025042452,0.0006878723,0.0002564516,0.00053594453,0.0007134643],"domain_scores_gemma":[0.9978404,0.00009668319,0.0007070044,0.00045542518,0.00060144137,0.0002990698],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0014202828,0.0003150856,0.00024123125,0.00029795797,0.00034200918,0.0022226404,0.00065074087,0.0002673219,0.00006235384],"category_scores_gemma":[0.000570379,0.00034395905,0.00009118145,0.00059698237,0.00014051248,0.022155339,0.0002750028,0.00029361778,0.0006538917],"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.000048271122,0.00015337479,0.0032946016,0.0005216098,0.00010775311,0.000037808848,0.023011722,0.006894593,0.00010537127,0.041954875,0.016229339,0.9076407],"study_design_scores_gemma":[0.0014185067,0.0002989363,0.018762512,0.0005217501,0.00011091902,0.00032866353,0.0074344585,0.8121185,0.0046028695,0.06204933,0.09154062,0.0008129512],"about_ca_topic_score_codex":0.00036806872,"about_ca_topic_score_gemma":0.000013156722,"teacher_disagreement_score":0.90682775,"about_ca_system_score_codex":0.001380243,"about_ca_system_score_gemma":0.0007025736,"threshold_uncertainty_score":0.99990124},"labels":[],"label_agreement":null},{"id":"W2301534275","doi":"10.1111/tgis.12205","title":"A Genetic Algorithm for Tributary Selection with Consideration of Multiple Factors","year":2016,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Tributary; Drainage; Generalization; Drainage network; Selection (genetic algorithm); Fitness function; Genetic algorithm; Computer science; Algorithm; Data mining; Aggregate (composite); Drainage system (geomorphology); Drainage basin; Hydrology (agriculture); Geography; Artificial intelligence; Geology; Cartography; Mathematics; Machine learning; Ecology; Geotechnical engineering","score_opus":0.01776401326274799,"score_gpt":0.23192900213908588,"score_spread":0.2141649888763379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301534275","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.015455827,0.000009134931,0.9837848,0.00023001466,0.000106044456,0.00028682902,0.000052835458,0.000054659828,0.000019838388],"genre_scores_gemma":[0.626693,0.000014323622,0.37301192,0.000011830528,0.00001407251,0.0000514976,0.0000051557286,0.00000559756,0.00019258565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993813,0.00002100299,0.00016148303,0.00019984099,0.00010424085,0.00013210034],"domain_scores_gemma":[0.99958926,0.00012970855,0.000046403653,0.0001585411,0.000052836345,0.000023271468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007974046,0.00007723228,0.00009952955,0.00015225145,0.000062306586,0.000026073596,0.00014307254,0.000028373035,0.000026024369],"category_scores_gemma":[0.0000069058906,0.000053212298,0.000032599273,0.00028331266,0.000030231167,0.0005419669,0.0000044383146,0.000031860476,0.0000018729979],"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.000014955626,0.00014984456,0.002680453,0.000016230202,0.000043485416,0.0000015137937,0.00030165474,0.00070509006,0.001481184,0.0003052346,0.00009167725,0.9942087],"study_design_scores_gemma":[0.0060690506,0.0009193841,0.060764216,0.0001146276,0.00007034117,0.000017558368,0.00014356631,0.85468876,0.0691718,0.0019206429,0.005568952,0.00055108755],"about_ca_topic_score_codex":0.000103930484,"about_ca_topic_score_gemma":0.0002434132,"teacher_disagreement_score":0.9936576,"about_ca_system_score_codex":0.000033679466,"about_ca_system_score_gemma":0.000031446605,"threshold_uncertainty_score":0.21699345},"labels":[],"label_agreement":null},{"id":"W2304460499","doi":"","title":"A Trajectory Cleaning Framework for Trajectory Clustering","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Cluster analysis; Trajectory; Computer science; Preprocessor; Data mining; Interpolation (computer graphics); Similarity (geometry); Process (computing); Sample (material); Artificial intelligence; Motion (physics)","score_opus":0.03920083626687594,"score_gpt":0.2799169441624404,"score_spread":0.24071610789556447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304460499","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.0010630989,0.00008820584,0.9903281,0.00016982593,0.0011471491,0.0001895809,0.0000018929505,0.00032551272,0.0066866735],"genre_scores_gemma":[0.20364791,0.0000056266786,0.7941504,0.0006930326,0.00049201003,0.000033664,0.000003711051,0.00001314691,0.0009604576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990186,0.000018939287,0.00014238998,0.00023158277,0.0001447277,0.00044376872],"domain_scores_gemma":[0.99929607,0.00013376786,0.00004174485,0.0004104839,0.000015259118,0.00010269267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038813968,0.00011400409,0.000109133434,0.00008316899,0.00011711496,0.00016173322,0.00067972584,0.00004573205,0.000048543483],"category_scores_gemma":[0.000034153763,0.00010352939,0.00007131454,0.00017035476,0.000011969091,0.0013772377,0.00025539866,0.000091416674,0.0000645271],"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.000008508243,0.00013606841,0.0008749312,0.00007892969,0.000052420834,0.000002386995,0.0017198625,0.000071761424,0.00021502547,0.6173832,0.009390159,0.3700668],"study_design_scores_gemma":[0.001970117,0.0004274975,0.020689685,0.00020193873,0.00007763758,0.000024142624,0.0014121506,0.56390196,0.00366892,0.019699214,0.38568613,0.0022406466],"about_ca_topic_score_codex":0.000005554238,"about_ca_topic_score_gemma":0.0000035745095,"teacher_disagreement_score":0.59768397,"about_ca_system_score_codex":0.000023937975,"about_ca_system_score_gemma":0.000009663499,"threshold_uncertainty_score":0.4221806},"labels":[],"label_agreement":null},{"id":"W2309226206","doi":"","title":"Scalable clustering of categorical data and applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Computer science; Cluster analysis; Data mining; Categorical variable; Tuple; Redundancy (engineering); Scalability; Constrained clustering; Correlation clustering; Canopy clustering algorithm; Artificial intelligence; Machine learning; Database; Mathematics","score_opus":0.03283988717391283,"score_gpt":0.26698512357284127,"score_spread":0.23414523639892842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2309226206","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.000062969564,0.000034570327,0.9920889,0.0004948034,0.000022272767,0.00006872332,0.0000036014085,0.000041089017,0.0071830465],"genre_scores_gemma":[0.2731267,0.00007203003,0.7255021,0.00020459607,0.00006310223,0.000013431487,0.000050062685,0.000004509147,0.0009634987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960566,0.0000025393238,0.0000727835,0.00018164325,0.0000684778,0.00006892899],"domain_scores_gemma":[0.9992931,0.000007973427,0.00001690864,0.00064677664,0.000009254481,0.000026014415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087737884,0.000030906675,0.00004390664,0.000027528815,0.000030633375,0.000059294332,0.0008114195,0.0000083359955,0.0000043139785],"category_scores_gemma":[0.000002679507,0.00002615773,0.000004015584,0.00015398714,0.000018486375,0.0005703923,0.0013794373,0.00001888626,0.000015008388],"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.8970384e-7,0.00007107322,0.00017290293,0.000028356646,0.000009992651,0.0000020904656,0.00004314585,0.00017817781,0.00010090482,0.747401,0.0012976391,0.25069425],"study_design_scores_gemma":[0.0008993115,0.00005939311,0.0020499786,0.000011384497,0.000015921582,0.000017278117,0.00007597094,0.7847677,0.0008689868,0.06292958,0.14800523,0.000299252],"about_ca_topic_score_codex":0.000068099245,"about_ca_topic_score_gemma":0.000012167087,"teacher_disagreement_score":0.7845895,"about_ca_system_score_codex":0.0000041563735,"about_ca_system_score_gemma":0.000008651914,"threshold_uncertainty_score":0.17193699},"labels":[],"label_agreement":null},{"id":"W2315381121","doi":"10.3166/jesa.43.905-919","title":"Exploration aléatoire de modèles","year":2009,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Data Management and Algorithms","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":"Mod; Computer science; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.04487176660726525,"score_gpt":0.2726064993243781,"score_spread":0.22773473271711284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315381121","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.0062086647,0.01457787,0.94609225,0.01615671,0.0030930708,0.00026614213,0.000018438821,0.00041737122,0.013169508],"genre_scores_gemma":[0.297967,0.01162609,0.5657844,0.0038699459,0.0048592514,0.000015540105,0.000034218814,0.00012996388,0.11571358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644965,0.0006083612,0.0008278226,0.00044706956,0.0007473343,0.0009197374],"domain_scores_gemma":[0.998047,0.00007774079,0.0005614362,0.0006187263,0.00027218673,0.00042293087],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013419539,0.0003973291,0.000409863,0.000322744,0.00079682266,0.003615838,0.0014756311,0.00013254507,0.00016184179],"category_scores_gemma":[0.00018772001,0.00038665324,0.00022634256,0.00081036607,0.0001599267,0.007992972,0.00025823733,0.00051500136,0.0006763411],"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.000005271935,0.0001732861,0.00008549653,0.0000847472,0.00006427618,0.0008656605,0.0014610068,0.001420461,0.0001828026,0.07609622,0.03734564,0.88221514],"study_design_scores_gemma":[0.0006971426,0.00061904354,0.10003515,0.0011579075,0.00010604262,0.0027836217,0.00020931134,0.6736348,0.00020023227,0.14366479,0.07627546,0.0006164731],"about_ca_topic_score_codex":0.000044803495,"about_ca_topic_score_gemma":0.000010985218,"teacher_disagreement_score":0.88159865,"about_ca_system_score_codex":0.00038769716,"about_ca_system_score_gemma":0.0002448782,"threshold_uncertainty_score":0.99985856},"labels":[],"label_agreement":null},{"id":"W2335952259","doi":"10.1007/s12145-016-0260-8","title":"A development of spatiotemporal queries to analyze the simulation outcomes from a voxel automata model","year":2016,"lang":"en","type":"article","venue":"Earth Science Informatics","topic":"Data Management and Algorithms","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":"","keywords":"Geospatial analysis; Computer science; Spatial analysis; Representation (politics); Data mining; Cellular automaton; Process (computing); Raster data; Raster graphics; Geographic information system; Field (mathematics); Theoretical computer science; Artificial intelligence; Cartography; Geography; Remote sensing; Mathematics","score_opus":0.03381438578232409,"score_gpt":0.2786010866259727,"score_spread":0.24478670084364862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335952259","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.16421625,8.937668e-7,0.83425057,0.0007252098,0.00010240504,0.00014492827,0.000012221035,0.000057375335,0.00049012556],"genre_scores_gemma":[0.5208599,5.6416144e-7,0.47881678,0.00020585467,0.0000049188734,0.0000036874285,0.00000172836,0.0000013799129,0.000105194136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840784,0.000007918471,0.00046829687,0.00013313226,0.0007536826,0.00022914204],"domain_scores_gemma":[0.9988433,0.000084659354,0.00019985334,0.0006813709,0.00011495909,0.00007586366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000816478,0.00009957803,0.00012060699,0.0001801666,0.000233427,0.00028348886,0.0016358582,0.000015456502,0.0000071238765],"category_scores_gemma":[0.0001483995,0.000051321975,0.000025906209,0.00069107057,0.00015589393,0.0035463262,0.00080744456,0.0000310019,0.000081380706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057895927,0.0000522149,0.0047985436,0.00001917233,0.000026883463,5.887977e-7,0.033417318,0.05958558,0.00050203246,0.02465283,0.0002823293,0.8766567],"study_design_scores_gemma":[0.00013287111,0.000012436553,0.015486662,0.000023579563,0.0000020677064,1.1053118e-7,0.0001608563,0.98016834,0.0012189103,0.0006038705,0.0020875335,0.000102736405],"about_ca_topic_score_codex":0.0000138445985,"about_ca_topic_score_gemma":0.000031031235,"teacher_disagreement_score":0.9205828,"about_ca_system_score_codex":0.00002144846,"about_ca_system_score_gemma":0.00024557105,"threshold_uncertainty_score":0.3039859},"labels":[],"label_agreement":null},{"id":"W2336256035","doi":"","title":"Variations of Distance-Based Invariants of Trees","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"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; Pure mathematics","score_opus":0.013732561208242114,"score_gpt":0.2380394499397507,"score_spread":0.22430688873150859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336256035","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.04506146,0.00006300538,0.94660246,0.00014951281,0.006959168,0.00014973723,0.000003507338,0.000022445673,0.0009887211],"genre_scores_gemma":[0.93459004,0.000007467695,0.065011695,0.000012893476,0.0003609545,6.201531e-7,0.0000012348321,0.000011846491,0.000003250642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975574,0.0001291013,0.0012276261,0.00017840548,0.00069520285,0.0002122359],"domain_scores_gemma":[0.99624145,0.00083562604,0.0018406872,0.000427466,0.00054495485,0.00010980669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020026125,0.0001917025,0.0007116775,0.0002600487,0.00011519226,0.00014547414,0.0010364592,0.00007963875,0.0000029306811],"category_scores_gemma":[0.00056992273,0.00016854443,0.00015555303,0.00048459764,0.000085589076,0.00043060034,0.00032072843,0.00019348478,6.266626e-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.000019360046,0.0004936812,0.00028598853,0.00016292871,0.00006242896,0.0000025316883,0.00031863566,0.0000789967,0.00031846217,0.99357224,0.000112648595,0.0045720767],"study_design_scores_gemma":[0.004491378,0.00097232655,0.00064462476,0.00045026204,0.00009025275,0.000008197956,0.00005672548,0.20224199,0.0023657412,0.78755003,0.0008889267,0.00023955447],"about_ca_topic_score_codex":0.0000071651198,"about_ca_topic_score_gemma":4.5690126e-7,"teacher_disagreement_score":0.8895286,"about_ca_system_score_codex":0.00002572862,"about_ca_system_score_gemma":0.000111796304,"threshold_uncertainty_score":0.68730426},"labels":[],"label_agreement":null},{"id":"W2337712459","doi":"10.24297/ijmit.v4i2.4625","title":"P-Path Minimum Distance Connectivity from Head Quarter to the Cities","year":2013,"lang":"en","type":"article","venue":"INTERNATIONAL JOURNAL OF MANAGEMENT & INFORMATION TECHNOLOGY","topic":"Data Management and Algorithms","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":"Quarter (Canadian coin); Path (computing); Head (geology); Distance matrix; Cluster (spacecraft); Minimum distance; Combinatorics; Computer science; Mathematics; Polynomial; Algorithm; Statistics; Geography; Computer network","score_opus":0.006351623077112952,"score_gpt":0.22714145853437212,"score_spread":0.22078983545725916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337712459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021962339,0.00003300324,0.92183095,0.050150294,0.0015419532,0.0002454613,0.000014309848,0.000080409634,0.0041413046],"genre_scores_gemma":[0.96033293,0.000062815794,0.03588018,0.0032954228,0.00014031008,0.00004178107,0.000015433005,0.0000038378703,0.00022730722],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998684,0.000016870319,0.0004975711,0.00010475442,0.0005389119,0.00015788578],"domain_scores_gemma":[0.99878913,0.000045635115,0.00040350403,0.00036097565,0.00036474556,0.000036014884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002896998,0.00010807349,0.00012452266,0.0006167934,0.00006930766,0.0005095674,0.0026612321,0.00003822105,0.00007758371],"category_scores_gemma":[0.000043616787,0.00007836938,0.00005864804,0.00031910994,0.000043917647,0.0038290082,0.0006608068,0.00014594896,0.00050280365],"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.000017103213,0.000057440608,0.00074812263,0.000009273112,0.0003512435,0.000017854698,0.00074215705,0.00014306777,0.000010196844,0.3813641,0.11738584,0.49915358],"study_design_scores_gemma":[0.0015017961,0.00026461316,0.018469617,0.00014301369,0.00002837139,0.000037777485,0.003899459,0.025163207,0.00035427915,0.117941715,0.8318449,0.00035122412],"about_ca_topic_score_codex":0.00003192551,"about_ca_topic_score_gemma":0.000008809183,"teacher_disagreement_score":0.9383706,"about_ca_system_score_codex":0.00007637573,"about_ca_system_score_gemma":0.000011321903,"threshold_uncertainty_score":0.64626914},"labels":[],"label_agreement":null},{"id":"W2338354263","doi":"","title":"Toward better support for spatial decision making: defining the characteristics of spatial on-line analytical processing (solap)","year":2019,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":154,"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":"Online analytical processing; Exploit; Data warehouse; Computer science; Spatial analysis; Line (geometry); Decision support system; Data mining; Data science; Geography; Cartography; Mathematics; Remote sensing","score_opus":0.029069845078091877,"score_gpt":0.2903889626372823,"score_spread":0.26131911755919046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338354263","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.031507056,0.00000426063,0.96560955,0.0009318023,0.00040799857,0.00035785997,0.000030016037,0.00004582399,0.0011056293],"genre_scores_gemma":[0.91330576,8.355618e-7,0.08559673,0.0008187372,0.00014400142,0.000013824344,0.00003334947,0.000012126017,0.00007464667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984824,0.00002329964,0.00044056386,0.00032486062,0.0004289964,0.00029985534],"domain_scores_gemma":[0.9987505,0.0003285528,0.00021510385,0.00057982665,0.00008522508,0.000040806943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051175297,0.00014863368,0.0002644238,0.00009050298,0.00009000809,0.0002409272,0.00091244787,0.000046988596,0.00008547348],"category_scores_gemma":[0.00016803862,0.0001015169,0.0000850344,0.00015517905,0.000043304983,0.00027320647,0.00040370022,0.00010266563,0.00014864499],"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.00004754439,0.00008713395,0.0019493612,0.00013899391,0.00002593662,0.000006467394,0.0002478349,0.00003346957,0.000009959131,0.0129359355,0.00069865596,0.9838187],"study_design_scores_gemma":[0.0004818131,0.00038904106,0.01351067,0.0001734888,0.000037398175,0.000004184174,0.000019797459,0.9776957,0.000102385275,0.0032007918,0.004203648,0.0001810718],"about_ca_topic_score_codex":0.000007730299,"about_ca_topic_score_gemma":0.0000020463515,"teacher_disagreement_score":0.98363763,"about_ca_system_score_codex":0.000015887876,"about_ca_system_score_gemma":0.000048464506,"threshold_uncertainty_score":0.4139739},"labels":[],"label_agreement":null},{"id":"W2339325713","doi":"10.1145/2872518.2890487","title":"Open Data for Local Search","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science; USable; Originality; Data science; Search engine; Local search (optimization); World Wide Web; Information retrieval; Artificial intelligence","score_opus":0.1692272607389326,"score_gpt":0.36842180668746366,"score_spread":0.19919454594853106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339325713","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.0000070647934,0.00000351378,0.97669846,0.0072877067,0.00010977587,0.00019944369,0.000040589042,0.0000490901,0.015604382],"genre_scores_gemma":[0.039247606,0.000016990238,0.86487293,0.0014877587,0.00014956169,0.000030013494,0.0000966338,0.000009459986,0.09408904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936116,0.000009246859,0.00005903793,0.00032406076,0.00009743147,0.00014903658],"domain_scores_gemma":[0.99846977,0.000057909692,0.000008333439,0.0014086548,0.000018549485,0.000036770052],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00046128625,0.000036484493,0.000045158733,0.00002183393,0.000043800705,0.00037280782,0.008318737,0.000008462686,0.00008102457],"category_scores_gemma":[0.000014010213,0.000019922554,0.0000072510015,0.000077982506,0.000020359521,0.0025703146,0.011502552,0.000010564629,0.00027528114],"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.0000010388973,0.0000095465475,0.000011605431,0.0000014848499,0.0000036566237,8.252299e-7,0.0000025364013,2.2572658e-7,0.000013589254,0.18991397,0.14021732,0.6698242],"study_design_scores_gemma":[0.0005485996,0.00004458701,0.00013368661,0.0000072226862,0.0000015766326,6.622793e-7,0.0000109661905,0.17556128,0.0003871691,0.005666856,0.8175407,0.00009666057],"about_ca_topic_score_codex":0.00003768733,"about_ca_topic_score_gemma":0.000014154634,"teacher_disagreement_score":0.6773234,"about_ca_system_score_codex":0.0000062100294,"about_ca_system_score_gemma":0.000021605127,"threshold_uncertainty_score":0.9970467},"labels":[],"label_agreement":null},{"id":"W2339356764","doi":"10.1145/1862413.1862416","title":"Intrinsic dimensionality","year":2010,"lang":"en","type":"article","venue":"SIGSPATIAL Special","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Curse of dimensionality; Search engine indexing; Similarity (geometry); Computer science; Information retrieval; Workload; Gauge (firearms); Data mining; Theoretical computer science; Artificial intelligence; Geography","score_opus":0.0074448023591275085,"score_gpt":0.22220236922687658,"score_spread":0.21475756686774908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339356764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28657827,0.000021560818,0.41290486,0.013201074,0.053303033,0.0009895292,0.000074838135,0.0012393526,0.23168749],"genre_scores_gemma":[0.92667836,0.000003507214,0.048998088,0.001069423,0.022085872,0.00001200306,0.000047775986,0.000012883756,0.0010920892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990669,0.000020791591,0.00013535445,0.00028294855,0.0002919707,0.00020202204],"domain_scores_gemma":[0.99933964,0.000033895536,0.000044604774,0.0004570974,0.00004331245,0.00008146877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001933373,0.00009129613,0.000093039176,0.000053431926,0.0001139227,0.00018441718,0.0007642197,0.000041372637,0.0006536287],"category_scores_gemma":[0.00006886343,0.000082668106,0.00004459326,0.00020096748,0.000045808298,0.0005080769,0.0005147601,0.00018464295,0.00063410687],"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.0000042802485,0.00005842354,0.00037268325,0.0000018311246,0.000006550824,0.000019465637,0.000055113287,6.8563065e-7,0.000623413,0.48819143,0.02317745,0.4874887],"study_design_scores_gemma":[0.0006722296,0.00007382186,0.05267055,0.0000039384495,0.0000073938336,0.000005621093,0.0000046376467,0.0028632537,0.0020276154,0.052187324,0.88908124,0.00040234815],"about_ca_topic_score_codex":0.000076052944,"about_ca_topic_score_gemma":0.00026257994,"teacher_disagreement_score":0.8659038,"about_ca_system_score_codex":0.000009187024,"about_ca_system_score_gemma":0.000025662732,"threshold_uncertainty_score":0.81503725},"labels":[],"label_agreement":null},{"id":"W2341947765","doi":"","title":"THE BANFF SYSTEM FOR AUTOMATED EDITING AND IMPUTATION","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Imputation (statistics); Computer science; Data science; Usability; Data collection; Graphical user interface; Software engineering; Human–computer interaction; Missing data; Statistics; Programming language; Machine learning; Mathematics","score_opus":0.008995434753622052,"score_gpt":0.24220406396705502,"score_spread":0.23320862921343297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341947765","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.00054351275,0.000039754555,0.9913915,0.0024965664,0.00027706078,0.00015887797,0.0000013460284,0.00071074854,0.004380651],"genre_scores_gemma":[0.6868053,0.0000054037455,0.31081358,0.00023254502,0.0004817857,0.00003578686,0.000010254891,0.0000056145573,0.0016097431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964714,0.000008085291,0.00007723122,0.00010578356,0.000063606196,0.00009813729],"domain_scores_gemma":[0.99975216,0.00006649241,0.000028690956,0.000115503404,0.000021126429,0.000016005726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026106255,0.00003414646,0.000029451634,0.000016391758,0.00018286011,0.0003684183,0.00021230686,0.000008231392,3.0415472e-7],"category_scores_gemma":[0.000010600885,0.000021274824,0.000009169628,0.000062983,0.000007516094,0.0004902003,0.00009837403,0.000011933856,0.00001049116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.105709e-7,0.0000035407236,0.0000138861105,0.000017564798,0.00000908015,4.0113758e-7,0.0000719105,0.00009004408,0.000018649627,0.23703514,0.015562827,0.74717635],"study_design_scores_gemma":[0.00011844439,0.000009386097,0.00021273484,0.0000044741887,0.0000021162264,0.0000015338708,0.00006811684,0.975031,0.00011374555,0.00014415626,0.02426301,0.000031283787],"about_ca_topic_score_codex":0.0000043952946,"about_ca_topic_score_gemma":0.0000053792096,"teacher_disagreement_score":0.97494096,"about_ca_system_score_codex":0.00001001767,"about_ca_system_score_gemma":0.0000034616116,"threshold_uncertainty_score":0.3552666},"labels":[],"label_agreement":null},{"id":"W234276927","doi":"","title":"Log Analysis of Trip Calculation on a Transit Website","year":2004,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Data Management and Algorithms","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":"Transit (satellite); Computer science; The Internet; Calculator; Transport engineering; World Wide Web; Function (biology); Information system; Public transport; Engineering","score_opus":0.011395927464232507,"score_gpt":0.23160964708786005,"score_spread":0.22021371962362754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W234276927","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.0389338,0.00011244526,0.9564348,0.0029450117,0.00007212902,0.00034136727,0.000039940798,0.0004061347,0.0007143667],"genre_scores_gemma":[0.8709711,0.000049353435,0.12725677,0.001192177,0.00003572741,0.00006563398,0.00007015943,0.000016790333,0.00034232298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981268,0.00006410107,0.00043175512,0.00049396255,0.0004683614,0.00041503532],"domain_scores_gemma":[0.99837005,0.000049689428,0.00020446336,0.0011560099,0.00007441469,0.00014535918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050027453,0.00022961234,0.00039358195,0.0013168304,0.00011376766,0.00017668142,0.0010103286,0.0001226014,0.000014124533],"category_scores_gemma":[0.000038796068,0.00022327264,0.00029921264,0.0028661531,0.00004663405,0.0007260413,0.00016977599,0.00017793207,0.000018127312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092647424,0.00089894177,0.012501807,0.000045603414,0.0010994648,0.00012747251,0.000733394,0.26490313,0.0048778276,0.5750021,0.0010078774,0.13870975],"study_design_scores_gemma":[0.0010709083,0.00028832917,0.15883456,0.000044837514,0.00040705013,0.000006986425,0.000016095899,0.82389,0.009004832,0.0044899224,0.0014716722,0.00047485612],"about_ca_topic_score_codex":0.0037261243,"about_ca_topic_score_gemma":0.0015087778,"teacher_disagreement_score":0.83203727,"about_ca_system_score_codex":0.0002102421,"about_ca_system_score_gemma":0.0000744078,"threshold_uncertainty_score":0.9104794},"labels":[],"label_agreement":null},{"id":"W2344430697","doi":"10.3233/web-160335","title":"Accurate and efficient query clustering via top ranked search results","year":2016,"lang":"en","type":"article","venue":"Web Intelligence","topic":"Data Management and Algorithms","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":"National Science Foundation","keywords":"Computer science; Cluster analysis; Data mining; Information retrieval; DBSCAN; Search engine; Web search query; Metric (unit); Feature (linguistics); Hierarchical clustering; Similarity (geometry); Query expansion; Fuzzy clustering; CURE data clustering algorithm; Machine learning; Artificial intelligence","score_opus":0.031748576220429654,"score_gpt":0.27678550056573076,"score_spread":0.2450369243453011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344430697","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.009742327,0.00007816423,0.98539495,0.0019237081,0.00040605754,0.0001586286,0.000010330515,0.00013535799,0.0021504774],"genre_scores_gemma":[0.98537993,0.0001881829,0.01296249,0.00014609328,0.00006803114,0.000007692499,0.0000017568545,0.000007108962,0.0012387325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855286,0.00005487432,0.0002641569,0.0005184874,0.00026623855,0.00034337165],"domain_scores_gemma":[0.9989797,0.00017561375,0.000053707936,0.00063409493,0.000056035267,0.00010085316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067326357,0.00012981091,0.00011474639,0.000117887044,0.00010561368,0.00023090276,0.00097090326,0.000033461463,0.000018540772],"category_scores_gemma":[0.00006952584,0.000088596906,0.000029151612,0.00029815861,0.00008799719,0.00047726763,0.0010678008,0.00007720977,0.00030548897],"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.00003959965,0.00004424366,0.00006725427,0.00002751387,0.000020915191,0.00004943514,0.0005395186,0.00068974495,0.0034748386,0.014146032,0.0005467886,0.98035413],"study_design_scores_gemma":[0.00032564744,0.00009694556,0.0007460406,0.00012891414,0.000004546774,0.000015972282,0.000053071777,0.97058696,0.01823302,0.00071232044,0.008773589,0.0003229947],"about_ca_topic_score_codex":0.00003442612,"about_ca_topic_score_gemma":0.000014148103,"teacher_disagreement_score":0.98003113,"about_ca_system_score_codex":0.00002792017,"about_ca_system_score_gemma":0.00002490845,"threshold_uncertainty_score":0.39265445},"labels":[],"label_agreement":null},{"id":"W2344932587","doi":"10.1109/cjece.2015.2463753","title":"Using Spatial Semijoins Over Multiple Sites in Distributed Spatial Query Processing","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Spatial query; Joins; Computer science; Spatial relation; Spatial analysis; Spatial database; Spatial ecology; Query optimization; Distributed computing; Data mining; Information retrieval; Web search query; Geography; Web query classification; Search engine; Artificial intelligence; Ecology; Remote sensing","score_opus":0.012138330186495714,"score_gpt":0.19677261810347263,"score_spread":0.18463428791697692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344932587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11990362,0.00022515713,0.87947,0.00015507851,0.00018522285,0.000038818653,0.0000050407366,0.000013519718,0.000003564097],"genre_scores_gemma":[0.982142,0.000008397083,0.017480507,0.000053352527,0.0003023955,5.1559914e-7,0.0000015089787,0.000007557131,0.000003782914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906874,0.000016850592,0.00026696062,0.00016508791,0.00012514707,0.00035721413],"domain_scores_gemma":[0.9993995,0.000079037396,0.000077975914,0.00009610094,0.00004756107,0.00029984248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013857547,0.00012308458,0.00018172768,0.00037220473,0.000052345084,0.00019624148,0.00033375894,0.00004173193,0.00000341301],"category_scores_gemma":[0.00005379814,0.00009365694,0.00003956555,0.00034669822,0.000015332253,0.00062648486,0.000058434343,0.00014433752,5.8613995e-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.000013283351,0.00005001104,0.092867,0.000046238674,0.000058561098,0.0010461234,0.00020802159,0.010690464,0.0034025349,0.0015914094,0.00053369004,0.88949263],"study_design_scores_gemma":[0.0004871679,0.000065225024,0.049944237,0.000120565084,0.000004982391,0.00007281401,5.946098e-7,0.9476411,0.00020080985,0.000081937585,0.0012257774,0.0001547947],"about_ca_topic_score_codex":0.0012202798,"about_ca_topic_score_gemma":0.0012971917,"teacher_disagreement_score":0.9369506,"about_ca_system_score_codex":0.0001281973,"about_ca_system_score_gemma":0.00017556737,"threshold_uncertainty_score":0.38192192},"labels":[],"label_agreement":null},{"id":"W2345545768","doi":"10.1016/j.ifacol.2015.06.363","title":"Development of business spatial analysis tools: methodology and framework","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Development (topology); Interface (matter); Software engineering; Work (physics); Architecture; Systems engineering; Engineering","score_opus":0.1563682099173584,"score_gpt":0.32886497665634407,"score_spread":0.17249676673898567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345545768","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.03537232,0.00014437354,0.9628522,0.00095246045,0.0002561406,0.00007921448,0.000011738445,0.000057471352,0.00027408477],"genre_scores_gemma":[0.0128018595,0.000018029634,0.986689,0.0001960931,0.00008864884,0.000005064962,0.00005758361,0.0000055382848,0.00013818806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987521,0.0000852281,0.0002940712,0.0003757219,0.00028224164,0.00021061221],"domain_scores_gemma":[0.99902505,0.00016342614,0.00012946104,0.0004330619,0.0001412642,0.000107729444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080082635,0.000139955,0.00034230686,0.00023163216,0.000053092514,0.000092898175,0.000602068,0.00007059283,0.000021265068],"category_scores_gemma":[0.0003180428,0.00011959744,0.000044171422,0.0011682314,0.0000560806,0.00042401135,0.0005402676,0.00008852711,0.000012575872],"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.000021048936,0.00012366784,0.002356795,0.000034942892,0.0005417289,0.000020586995,0.0031437292,0.0002257844,0.00032341806,0.008448814,0.000015919162,0.98474354],"study_design_scores_gemma":[0.0046188487,0.0004480393,0.35266677,0.00021071851,0.0017402733,0.000033529905,0.00339439,0.5489144,0.005579203,0.011191008,0.06831101,0.002891826],"about_ca_topic_score_codex":0.00008853517,"about_ca_topic_score_gemma":0.00012496715,"teacher_disagreement_score":0.98185176,"about_ca_system_score_codex":0.000020386567,"about_ca_system_score_gemma":0.00008191222,"threshold_uncertainty_score":0.48770422},"labels":[],"label_agreement":null},{"id":"W2349743712","doi":"","title":"ADAPTIVE APPROXIMATION TREE","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"CAE (Canada)","funders":"","keywords":"Computer science; Tree structure; Data structure; Curse of dimensionality; Space partitioning; Tree (set theory); Partition (number theory); Search tree; k-d tree; Skew; Algorithm; Data mining; Trie; Search engine indexing; Tree traversal; Theoretical computer science; Search algorithm; Artificial intelligence; Mathematics","score_opus":0.037830017527624604,"score_gpt":0.2109307021366941,"score_spread":0.1731006846090695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349743712","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.000034435572,0.000011716913,0.7297686,0.00061126176,0.000063450905,0.000038390714,2.2951825e-7,0.00011667336,0.26935527],"genre_scores_gemma":[0.24983324,0.000017913295,0.7029245,0.00079228636,0.00009204325,0.000013694887,0.000004608051,0.0000046933565,0.04631703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963236,0.000007547499,0.00005080809,0.00012803313,0.000099045574,0.00008219336],"domain_scores_gemma":[0.99972266,0.000007851297,0.000014914939,0.00022533594,0.000009785712,0.000019437937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049940252,0.000036680805,0.000031371485,0.000037286933,0.000030597923,0.0000971873,0.00036557796,0.00000831197,0.00014715549],"category_scores_gemma":[0.0000030974027,0.000029793202,0.000013423893,0.0001552865,0.000006645738,0.0008320238,0.0001227962,0.000019555433,0.0007244228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.1380095e-7,0.000021836042,0.000008285948,7.9748895e-7,0.0000029846958,0.000001854504,0.0000730183,0.0000030004944,0.000005724757,0.34722903,0.027295709,0.6253576],"study_design_scores_gemma":[0.00009742011,0.000023399736,0.0002522725,0.0000011865021,9.928563e-7,6.572678e-7,0.0000145814065,0.9810225,0.00013384069,0.0035703173,0.014822369,0.00006048001],"about_ca_topic_score_codex":0.000003642032,"about_ca_topic_score_gemma":0.0000018103922,"teacher_disagreement_score":0.9810195,"about_ca_system_score_codex":0.0000056274007,"about_ca_system_score_gemma":6.9950073e-7,"threshold_uncertainty_score":0.93112314},"labels":[],"label_agreement":null},{"id":"W2355085396","doi":"","title":"Research of Indexing for Moving Object","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Data Management and Algorithms","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":"Search engine indexing; Quadtree; Computer science; Variation (astronomy); Object (grammar); Index (typography); R-tree; Tree (set theory); Data mining; Artificial intelligence; Spatial database; Spatial analysis; Mathematics; Statistics; World Wide Web","score_opus":0.033858118787905414,"score_gpt":0.3266502604672358,"score_spread":0.2927921416793304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2355085396","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.00055449153,0.0000706667,0.99547434,0.00034588037,0.000015378098,0.0007002449,0.00001173503,0.00009072165,0.0027365587],"genre_scores_gemma":[0.043714922,0.0000029717137,0.9548036,0.000060712107,0.00023615641,0.00047082972,0.00004271488,0.000009232516,0.0006588506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901146,0.000023147817,0.00021629417,0.0003302445,0.00016739935,0.00025147016],"domain_scores_gemma":[0.9991347,0.00014690463,0.0000611306,0.00047038394,0.00016180522,0.00002503498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047832786,0.00007256927,0.000097574426,0.00023397083,0.00020217443,0.00015935216,0.0011288859,0.000029103508,0.0000018561715],"category_scores_gemma":[5.4459355e-7,0.00007472297,0.000050611026,0.0006642869,0.000044783996,0.00028469597,0.0004949946,0.00007831125,0.000023647495],"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.0000011746894,0.00015377895,0.00016983403,0.00006470704,0.000013891504,4.4854966e-7,0.00008965165,0.0002059466,0.008282504,0.55274904,0.020327456,0.41794157],"study_design_scores_gemma":[0.0003643354,0.00003517244,0.0019283321,0.00002006015,0.000005117135,0.0000024637552,0.000021456588,0.043148786,0.014551642,0.049623042,0.89011705,0.00018253976],"about_ca_topic_score_codex":0.00006288443,"about_ca_topic_score_gemma":0.0000065200998,"teacher_disagreement_score":0.8697896,"about_ca_system_score_codex":0.000024386474,"about_ca_system_score_gemma":0.000029002887,"threshold_uncertainty_score":0.30471143},"labels":[],"label_agreement":null},{"id":"W2359946253","doi":"","title":"Lightweight Document clustering Algorithm for Forum FAQ Document","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Data Management and Algorithms","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; Document clustering; Cluster analysis; Information retrieval; Data mining; Algorithm; Artificial intelligence","score_opus":0.011945996148695088,"score_gpt":0.24372006109141953,"score_spread":0.23177406494272443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359946253","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.000040543277,0.00014691838,0.99475855,0.002292327,0.000116485986,0.0016473217,0.000023926996,0.00037120873,0.0006027134],"genre_scores_gemma":[0.0007140756,0.00007698351,0.9938419,0.0011432,0.00034141203,0.0018065565,0.00011598812,0.00002201396,0.0019378825],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981325,0.00001839986,0.00038319005,0.00073385186,0.00022461268,0.0005074389],"domain_scores_gemma":[0.99876773,0.000055319986,0.00012239895,0.00083030964,0.00009002066,0.00013423558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001451587,0.00024631686,0.00021126209,0.00016967657,0.00057132053,0.00032914148,0.0016685342,0.000053009644,0.0000120752875],"category_scores_gemma":[2.388365e-7,0.0002402835,0.0001396338,0.00038517028,0.00004787338,0.00084187137,0.0010158048,0.00009290514,0.0002258284],"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":[9.744593e-7,0.00009971799,0.000016894608,0.00001804782,0.000047473975,0.000004631428,0.000184126,0.000045934914,0.00016475156,0.020898355,0.034441773,0.9440773],"study_design_scores_gemma":[0.0005800301,0.00005002429,0.00010211186,0.000009972418,0.000010899771,0.000035187102,0.000010789353,0.060086146,0.0018863367,0.0051485477,0.93175936,0.0003205939],"about_ca_topic_score_codex":0.0000143429725,"about_ca_topic_score_gemma":0.0000039113547,"teacher_disagreement_score":0.9437567,"about_ca_system_score_codex":0.00008525815,"about_ca_system_score_gemma":0.000034661967,"threshold_uncertainty_score":0.97984767},"labels":[],"label_agreement":null},{"id":"W2364483700","doi":"","title":"A New Algorithm to Query Closed Cube","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Data Management and Algorithms","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; Algorithm; Cube (algebra); Set (abstract data type); Efficient algorithm; Data mining; Mathematics","score_opus":0.012627479874508322,"score_gpt":0.22982930198219909,"score_spread":0.21720182210769076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2364483700","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.000072670635,0.00007623274,0.9946292,0.0023647142,0.00005793967,0.00070450094,0.000011885414,0.00045987158,0.0016229722],"genre_scores_gemma":[0.00031271472,0.0000178878,0.992889,0.00239295,0.0004440227,0.00020857074,0.00003765557,0.000014421676,0.003682772],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985888,0.000017741446,0.00024323743,0.0006142523,0.00020063583,0.00033531256],"domain_scores_gemma":[0.99873155,0.000029273671,0.000053050553,0.00087900413,0.00005874574,0.00024839712],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008340941,0.00017665685,0.00015674949,0.0001962407,0.00026707753,0.00019042329,0.0017984029,0.000041006275,0.000020639909],"category_scores_gemma":[3.2449964e-7,0.0001832251,0.000074921394,0.00089523796,0.000022254833,0.00048354323,0.00081690756,0.00010189737,0.0018136443],"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":[3.6934222e-7,0.000054507593,0.00002154121,0.000002667564,0.000012826279,0.000007329873,0.00020269796,0.00001562663,0.00024333072,0.013528623,0.14178489,0.84412557],"study_design_scores_gemma":[0.0002544326,0.000024356243,0.0013235273,0.0000051573284,0.0000043664936,0.000040510527,0.0000034706097,0.00756407,0.0011111546,0.0015909285,0.9878252,0.00025282722],"about_ca_topic_score_codex":0.000065236374,"about_ca_topic_score_gemma":0.0000032428134,"teacher_disagreement_score":0.8460403,"about_ca_system_score_codex":0.000037959242,"about_ca_system_score_gemma":0.00007781083,"threshold_uncertainty_score":0.99896353},"labels":[],"label_agreement":null},{"id":"W2380878665","doi":"","title":"Indexing the Uncertain Trajectories of Network-constrained Moving Objects","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Index (typography); Track (disk drive); Trajectory; Data mining; Tree (set theory); Database index; Artificial intelligence","score_opus":0.025805158195143715,"score_gpt":0.22838668484579616,"score_spread":0.20258152665065243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380878665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01672644,0.00015491211,0.91790676,0.0007588866,0.0006212248,0.00023125025,0.0000019539818,0.00024609186,0.06335248],"genre_scores_gemma":[0.9540117,0.000020379759,0.044142935,0.00027445547,0.00012809991,0.000004603855,0.0000024877552,0.0000040205705,0.0014113446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000034572164,0.00016144782,0.0001776645,0.00020547981,0.000248604],"domain_scores_gemma":[0.9993606,0.00011723547,0.00006435698,0.00039832294,0.000029971123,0.00002948773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003128271,0.00008417648,0.0001054471,0.000037204554,0.0001930923,0.00006155162,0.0008449604,0.000019436453,0.000023912335],"category_scores_gemma":[0.0000289124,0.00005411767,0.000041415322,0.00045736102,0.00010852713,0.0004948432,0.00028390248,0.00006908999,0.0000056701597],"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.000007890586,0.00008038182,0.010899143,0.00003717566,0.00012256124,0.00009588812,0.0053477488,0.0058001797,0.00022616566,0.8479395,0.017065445,0.11237794],"study_design_scores_gemma":[0.0021368368,0.0003852003,0.04917119,0.00016739363,0.000045932724,0.00014552011,0.0026176518,0.8767773,0.0050759283,0.036940333,0.025101598,0.0014351301],"about_ca_topic_score_codex":0.000097638534,"about_ca_topic_score_gemma":0.000034807526,"teacher_disagreement_score":0.93728524,"about_ca_system_score_codex":0.000008996991,"about_ca_system_score_gemma":0.000048525857,"threshold_uncertainty_score":0.22068545},"labels":[],"label_agreement":null},{"id":"W2386814783","doi":"","title":"Observer-Orientation-Based Directional Relations and Query Processing","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Data Management and Algorithms","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; Rectangle; Observer (physics); Orientation (vector space); Query optimization; Set (abstract data type); Algorithm; Sargable; Data mining; Theoretical computer science; Information retrieval; Mathematics; Web search query","score_opus":0.008296399862576883,"score_gpt":0.234087723770853,"score_spread":0.2257913239082761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2386814783","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.0008900671,0.00010946511,0.9940514,0.003226211,0.000020398456,0.00033469664,0.0000067229153,0.0002966001,0.001064435],"genre_scores_gemma":[0.069127366,0.000004358615,0.92871946,0.0013967892,0.00013139311,0.00013571915,0.00010532657,0.0000063249668,0.00037323614],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910027,0.000017097984,0.00018629046,0.0004059006,0.00013177641,0.00015867216],"domain_scores_gemma":[0.9994654,0.000039683073,0.0000731883,0.00027944052,0.000076025965,0.00006626868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099856894,0.0001111843,0.00008298195,0.00012991526,0.00037140548,0.000351418,0.0003955788,0.000032300806,0.0000060914763],"category_scores_gemma":[6.162471e-7,0.000116969546,0.000032136413,0.0005340051,0.00003064456,0.0007213098,0.00008377547,0.000080009675,0.00004792145],"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.0000010187141,0.00015578006,0.0008077443,0.000011506088,0.000007450179,0.0000010591164,0.00011441226,0.00025618714,0.00075840653,0.07727953,0.0039589508,0.916648],"study_design_scores_gemma":[0.00069431105,0.000054994052,0.11644958,0.000033553,0.000023526323,0.000013289218,0.000014160113,0.19494578,0.0008104068,0.019195782,0.6672783,0.0004863502],"about_ca_topic_score_codex":0.0000067087376,"about_ca_topic_score_gemma":0.0000021332069,"teacher_disagreement_score":0.9161616,"about_ca_system_score_codex":0.00003041918,"about_ca_system_score_gemma":0.00004696823,"threshold_uncertainty_score":0.47698796},"labels":[],"label_agreement":null},{"id":"W23877756","doi":"","title":"SEMANTIC HETEROGENEITY OF GEODATA","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Semantic heterogeneity; Computer science; Semantic grid; Semantic computing; Spatial heterogeneity; Information retrieval; Semantic similarity; Semantic Web","score_opus":0.0402596094850267,"score_gpt":0.23641082905071198,"score_spread":0.19615121956568526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23877756","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.01877838,0.00015971455,0.9504233,0.00073573133,0.00018839558,0.000057172965,0.0000039119495,0.00010064408,0.029552754],"genre_scores_gemma":[0.9045823,0.00006359103,0.09114045,0.00035038116,0.00002592351,0.0000013889427,0.000007112473,0.0000029523947,0.0038258838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995423,0.000010882433,0.000087202745,0.00015264824,0.00011316138,0.00009383431],"domain_scores_gemma":[0.9993402,0.000009339569,0.000023700739,0.0005876739,0.000016308693,0.00002278159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006935706,0.000039539827,0.000061422,0.000029699659,0.000018087205,0.00005298775,0.00065897865,0.000009039731,0.00019723622],"category_scores_gemma":[0.0000062857202,0.00003337321,0.000023521665,0.00015736357,0.000012292493,0.00043751416,0.0004627366,0.000017536473,0.00012622077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.808846e-7,0.00057546166,0.007153135,0.0000951606,0.00010299264,0.00008576291,0.00019473163,0.000028747154,0.0015388544,0.29619804,0.119092196,0.57493424],"study_design_scores_gemma":[0.00049228134,0.00007091992,0.008881375,0.000020358075,0.000012897767,0.000013762183,0.000019648365,0.90709174,0.027154969,0.00133754,0.054572787,0.00033172034],"about_ca_topic_score_codex":0.000013519029,"about_ca_topic_score_gemma":0.0000057906414,"teacher_disagreement_score":0.907063,"about_ca_system_score_codex":0.0000019659874,"about_ca_system_score_gemma":0.0000012884914,"threshold_uncertainty_score":0.21595983},"labels":[],"label_agreement":null},{"id":"W2388068227","doi":"","title":"An Improved Indexing Method for Moving Objects","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Trajectory; Index (typography); Convex hull; Property (philosophy); Function (biology); Computer vision; Artificial intelligence; Hull; Regular polygon; Mathematics","score_opus":0.010277079469529183,"score_gpt":0.2975007286245641,"score_spread":0.28722364915503495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388068227","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.000045405788,0.000029067518,0.9972822,0.00078372454,0.000026404907,0.0009232529,0.000008786871,0.000380098,0.0005210657],"genre_scores_gemma":[0.004869679,0.000002154663,0.9922973,0.0020879686,0.00025161114,0.00026777084,0.000056756326,0.000009075954,0.00015769567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988451,0.000022942879,0.00020297607,0.0005572286,0.00008202632,0.00028973608],"domain_scores_gemma":[0.99900675,0.000052875756,0.000081073136,0.00070273376,0.000067972884,0.00008858761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027001192,0.00013974687,0.00012916171,0.00013073026,0.00025203562,0.00047477853,0.0014204785,0.000042427022,0.0000015293053],"category_scores_gemma":[5.377484e-7,0.0001440847,0.00006261082,0.00029031554,0.000009986061,0.0008083553,0.00016554786,0.00007718099,0.000017064662],"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":[8.607309e-7,0.00009208594,0.0000045513657,0.000007141404,0.000008158575,3.0114683e-7,0.00018965654,0.00007186516,0.01885195,0.034995683,0.0008244862,0.94495326],"study_design_scores_gemma":[0.00040510265,0.00010260483,0.0005358299,0.0000067573674,0.000011086893,0.00000560604,0.000016212032,0.7246092,0.006141247,0.018389184,0.24948005,0.00029714537],"about_ca_topic_score_codex":0.0000078204375,"about_ca_topic_score_gemma":0.0000026748432,"teacher_disagreement_score":0.94465613,"about_ca_system_score_codex":0.000029602706,"about_ca_system_score_gemma":0.00002666326,"threshold_uncertainty_score":0.5875603},"labels":[],"label_agreement":null},{"id":"W2393892477","doi":"","title":"A Distributed Database Query Optimization Algorithm for Multi-attribute Classification","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Data Management and Algorithms","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; Partition (number theory); Query optimization; Data mining; Distributed database; Algorithm; Online aggregation; Hash function; Sargable; Materialized view; Boolean conjunctive query; Database; View; Web search query; Information retrieval; Database design; Search engine","score_opus":0.032279587303237975,"score_gpt":0.2866762524649909,"score_spread":0.2543966651617529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393892477","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.000027867982,0.000020121473,0.99571466,0.0009841392,0.00013549945,0.001629572,0.0010031236,0.00046371372,0.000021303382],"genre_scores_gemma":[0.00028791194,0.000013818878,0.9909384,0.00030806838,0.0002825788,0.0015810477,0.0064108702,0.000020027028,0.0001572789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983936,0.000022862905,0.0003507164,0.0007389945,0.0001538941,0.00033994333],"domain_scores_gemma":[0.9983373,0.000072448485,0.00017125472,0.0010462913,0.00024401284,0.00012864098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028887537,0.00020800273,0.00016199079,0.00016358409,0.0003734642,0.0004775238,0.0014756451,0.00009011885,0.000009366568],"category_scores_gemma":[0.0000028857987,0.00021806541,0.00008725001,0.00063849404,0.00005613137,0.0009816646,0.0004433107,0.00018906961,0.000075830416],"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.0000012937812,0.00055446086,0.00007512685,0.00003274841,0.00004568622,0.0000011923469,0.000057550504,0.0005516976,0.008040031,0.039115228,0.016438967,0.935086],"study_design_scores_gemma":[0.0004900524,0.000010632,0.0004510301,0.0000041036483,0.000014308197,0.0000053855724,0.0000063044204,0.73276573,0.0009273154,0.00014056212,0.26497307,0.00021152932],"about_ca_topic_score_codex":0.00001045381,"about_ca_topic_score_gemma":0.0000077510285,"teacher_disagreement_score":0.9348745,"about_ca_system_score_codex":0.000034242756,"about_ca_system_score_gemma":0.000051156458,"threshold_uncertainty_score":0.889245},"labels":[],"label_agreement":null},{"id":"W2394952598","doi":"","title":"Mitigating the Curse of Dimensionality for Exact kNN Retrieval","year":2014,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Curse of dimensionality; Search engine indexing; Computer science; Benchmark (surveying); Data mining; k-nearest neighbors algorithm; Filter (signal processing); Artificial intelligence; Machine learning; Pattern recognition (psychology)","score_opus":0.07136814435032705,"score_gpt":0.3757991783019898,"score_spread":0.3044310339516627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394952598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17727631,0.00033161088,0.7094728,0.10384026,0.0019053144,0.0029751412,0.00009702936,0.0002643995,0.003837165],"genre_scores_gemma":[0.9712677,0.00008272039,0.022404063,0.0018373778,0.0013997355,0.00008204268,0.000029433559,0.000024976258,0.002871976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997473,0.00041127572,0.00021866449,0.00032203255,0.0010832279,0.0004918086],"domain_scores_gemma":[0.9962493,0.0020691159,0.00007744741,0.0011646942,0.00037395363,0.000065493114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01200942,0.000101265076,0.00013890181,0.000021210773,0.00082524546,0.00023106871,0.0023271632,0.000040447532,0.0000115572775],"category_scores_gemma":[0.00065987575,0.000054443128,0.00020475262,0.0006742335,0.0005017907,0.0004108129,0.001295284,0.00041425362,0.000019905377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047426787,0.00011546049,0.0003013241,0.00018708552,0.00018918433,9.5309264e-7,0.0046227966,0.00008693097,0.003663913,0.55976194,0.39238757,0.038635414],"study_design_scores_gemma":[0.0009962195,0.00030199965,0.0034753217,0.00007511364,0.000023217277,0.0000020785153,0.00093191955,0.7438793,0.013188683,0.10646496,0.13038854,0.00027263386],"about_ca_topic_score_codex":0.000058272482,"about_ca_topic_score_gemma":0.0000019065653,"teacher_disagreement_score":0.7939914,"about_ca_system_score_codex":0.000036881607,"about_ca_system_score_gemma":0.00007983827,"threshold_uncertainty_score":0.63472044},"labels":[],"label_agreement":null},{"id":"W2395766643","doi":"10.1007/978-3-319-13186-3_70","title":"BigSAM: Mining Interesting Patterns from Probabilistic Databases of Uncertain Big Data","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Manitoba","funders":"","keywords":"Computer science; Big data; Uncertain data; Probabilistic logic; Database transaction; Data mining; Process (computing); Database; Artificial intelligence","score_opus":0.1140113605752562,"score_gpt":0.2911063442832601,"score_spread":0.17709498370800392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395766643","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.00027364973,0.00017364738,0.9953573,0.0002443027,0.0025316488,0.00031699485,0.00039729,0.00012624834,0.00057892804],"genre_scores_gemma":[0.106473014,0.000041057978,0.89012516,0.000763202,0.0014857621,0.0000071881664,0.0008458116,0.00005209784,0.00020671105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99516845,0.00006221228,0.00077920244,0.0023638972,0.0010254264,0.0006008164],"domain_scores_gemma":[0.99295795,0.0013521187,0.0005927787,0.004801978,0.00015741384,0.00013777037],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013391626,0.0005447683,0.0006649006,0.000728359,0.00015126237,0.00057202304,0.010802563,0.00012294324,0.000021141397],"category_scores_gemma":[0.0005463839,0.00048822275,0.00007090771,0.00046228262,0.0005467918,0.0009572013,0.011770948,0.0004836945,0.000017487924],"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.0000029255407,0.000023240897,0.00031254478,0.0001158208,0.000020415802,0.00006161753,0.00022713498,0.0028681145,0.00003364061,0.0045193103,0.0000901896,0.991725],"study_design_scores_gemma":[0.00028259665,0.00011098441,0.00022975336,0.0021007839,0.000029489735,0.00001133808,6.5291164e-7,0.97145927,0.0002664088,0.021592878,0.0031789425,0.00073687464],"about_ca_topic_score_codex":0.0004265238,"about_ca_topic_score_gemma":0.000561407,"teacher_disagreement_score":0.9909882,"about_ca_system_score_codex":0.00009877768,"about_ca_system_score_gemma":0.00030059318,"threshold_uncertainty_score":0.99975693},"labels":[],"label_agreement":null},{"id":"W2397167913","doi":"","title":"A Data Structure Supporting Exclusion Persistence Range Search.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Set (abstract data type); Data structure; Range (aeronautics); Block (permutation group theory); Space (punctuation); Persistence (discontinuity); Range query (database); Algorithm; Web search query; Mathematics; Combinatorics; Information retrieval; Sargable; Search engine","score_opus":0.10867846574142782,"score_gpt":0.30237502488695656,"score_spread":0.19369655914552875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397167913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10683491,0.00036560587,0.8447862,0.014625936,0.0029944463,0.00091213355,0.0037163561,0.00037989108,0.025384465],"genre_scores_gemma":[0.96499735,0.0000046841997,0.03185187,0.0015335975,0.00024573976,0.000002412251,0.0010376904,0.00001037327,0.00031626862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997895,0.00006508967,0.00022175715,0.00053681474,0.00057054544,0.00071081956],"domain_scores_gemma":[0.9981235,0.00010913296,0.000082217324,0.00087564654,0.00015185065,0.00065763306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054928183,0.00018079417,0.00015270757,0.00055237755,0.00034125897,0.0004144161,0.0023309686,0.00006353254,0.0005012168],"category_scores_gemma":[0.00009855638,0.0001815995,0.000033839755,0.0007818026,0.00006373295,0.0017141553,0.0007170299,0.00023215094,0.00025015185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010400371,0.00012583708,0.019631723,0.00009553781,0.00011379878,0.00010640904,0.0014251734,0.0033770872,0.000046889032,0.5603988,0.042735122,0.3719332],"study_design_scores_gemma":[0.00047828635,0.00007464834,0.04704701,0.00006828555,0.000016080574,0.00003091839,0.00039608602,0.914767,0.000022794173,0.0049869022,0.031452548,0.00065941986],"about_ca_topic_score_codex":0.001974101,"about_ca_topic_score_gemma":0.0019808572,"teacher_disagreement_score":0.91138995,"about_ca_system_score_codex":0.0001360424,"about_ca_system_score_gemma":0.0005639555,"threshold_uncertainty_score":0.74054134},"labels":[],"label_agreement":null},{"id":"W2397334329","doi":"10.1007/978-3-319-26154-6_26","title":"LORI: Linguistically Oriented RDF Interface for Querying Fuzzy Temporal Data","year":2015,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"","keywords":"RDF; Computer science; SPARQL; Linked data; Interface (matter); RDF Schema; Simple Knowledge Organization System; Semantics (computer science); Information retrieval; Semantic Web; Variety (cybernetics); Data model (GIS); Artificial intelligence; Programming language","score_opus":0.07667803835647694,"score_gpt":0.3385215102504843,"score_spread":0.26184347189400736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397334329","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.000004302471,0.025767492,0.9078581,0.000044452994,0.0051033706,0.0008196995,0.00009148307,0.0001566244,0.060154505],"genre_scores_gemma":[0.13505727,0.011694168,0.5573129,0.00047192333,0.012025919,0.00015535088,0.003594231,0.0006301013,0.2790581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99660105,0.00003820959,0.0010535498,0.0013558918,0.00045802054,0.0004932948],"domain_scores_gemma":[0.99726737,0.0003579319,0.0005650516,0.0013849338,0.00026894445,0.00015576577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014187812,0.00049194496,0.0007151226,0.00029459054,0.00015100153,0.0004791973,0.0022333723,0.00016763103,0.0000029024952],"category_scores_gemma":[0.0002197359,0.00046774728,0.000065506334,0.0001196513,0.00009264943,0.00081662287,0.0028801635,0.00037933956,0.000025341194],"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.000017828375,0.000028113609,0.00009772842,0.0006084368,0.00006577186,0.00004577901,0.00022042164,0.001524536,3.7147902e-7,0.8026042,0.0018622209,0.19292459],"study_design_scores_gemma":[0.00020233117,0.00010272161,7.1761093e-7,0.001481239,0.000019413419,0.000013128801,0.00009981575,0.28474385,0.0000018526673,0.012417023,0.70047224,0.0004456547],"about_ca_topic_score_codex":0.000072384064,"about_ca_topic_score_gemma":0.000043119722,"teacher_disagreement_score":0.7901872,"about_ca_system_score_codex":0.00012311593,"about_ca_system_score_gemma":0.00007627429,"threshold_uncertainty_score":0.99977744},"labels":[],"label_agreement":null},{"id":"W2397680708","doi":"10.5281/zenodo.3781050","title":"Geocoding: Adding Another Dimension to Non-Spatial Data","year":2013,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Geocoding; Dimension (graph theory); Computer science; Geographic information system; Computer graphics (images); Cartography; Geography; Mathematics","score_opus":0.05416432425136568,"score_gpt":0.25296482874479304,"score_spread":0.19880050449342734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397680708","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.0021238786,0.000014333314,0.90665084,0.0030904694,0.00026489963,0.00080963946,0.00011571022,0.0010620428,0.085868165],"genre_scores_gemma":[0.91424024,0.000060848066,0.06714315,0.0031213649,0.0007916881,3.1127334e-7,0.0056079435,0.0021354288,0.0068990425],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998456,0.00009823103,0.00016870105,0.0005845685,0.00034975176,0.0003427633],"domain_scores_gemma":[0.9982048,0.000013811661,0.00005709364,0.0013752342,0.00020885892,0.00014020002],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00050172635,0.00011348531,0.000096420954,0.00020274465,0.0010656163,0.0022360717,0.0039935024,0.000026824366,0.0047720294],"category_scores_gemma":[0.00017513664,0.00011161683,0.000018338524,0.00053075707,0.000034409393,0.0015756523,0.009387604,0.000117500575,0.028922526],"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.0000029193416,0.000041372587,0.0000018345485,0.000008838342,0.000011700299,0.0000049478085,0.00027351346,0.000015451309,0.0024551502,0.002274591,0.5341036,0.46080613],"study_design_scores_gemma":[0.00021020103,0.000092450195,0.0006286457,0.000019135827,0.0000033251663,0.000008519755,0.000041927633,0.042470504,0.00027530352,0.00009276175,0.95599943,0.00015782216],"about_ca_topic_score_codex":0.00007942445,"about_ca_topic_score_gemma":3.622288e-7,"teacher_disagreement_score":0.91211635,"about_ca_system_score_codex":0.000043399024,"about_ca_system_score_gemma":0.0000016992545,"threshold_uncertainty_score":0.9987997},"labels":[],"label_agreement":null},{"id":"W2397880522","doi":"","title":"Local PTAS for independent set and vertex cover in location aware unit disk graphs","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Unit disk graph; Vertex cover; Vertex (graph theory); Dominating set; Combinatorics; Bounded function; Approximation algorithm; Embedding; Feedback vertex set; Independent set; Polynomial-time approximation scheme; Unit disk; Constant (computer programming); Edge cover; Graph; Discrete mathematics; Mathematics; Time complexity; Computer science; Wireless network","score_opus":0.020622490485375133,"score_gpt":0.26370231974108216,"score_spread":0.24307982925570704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397880522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039319545,0.00003083752,0.9940171,0.0008452731,0.00008658946,0.0002035808,0.000006582401,0.000047602607,0.00083044905],"genre_scores_gemma":[0.99475,0.000017815455,0.0037819473,0.0007364783,0.000007507166,0.000007543861,0.00004789126,0.0000023760615,0.00064839405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937314,0.00001238142,0.000105994615,0.0002340712,0.00012766515,0.00014672664],"domain_scores_gemma":[0.99966663,0.000022428443,0.000021707609,0.00022327295,0.000026519183,0.000039448445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015364641,0.00007257749,0.0000707888,0.000101638885,0.00004013107,0.0001389125,0.00031108377,0.000026781265,0.000009254326],"category_scores_gemma":[0.0000061880964,0.000062964595,0.000013985311,0.00028317055,0.00001625563,0.00070696755,0.00010525806,0.00004184445,0.000016089607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014928671,0.00013206372,0.002730291,0.000029160214,0.000013421771,0.000011837097,0.0002486727,0.00054881437,0.000009520061,0.37814492,0.014471076,0.6036453],"study_design_scores_gemma":[0.0014008549,0.00022894505,0.09033098,0.000026432079,0.000008237202,0.0000029023975,0.00016249051,0.84591126,0.00017120158,0.047953796,0.013525715,0.00027719844],"about_ca_topic_score_codex":0.00004784201,"about_ca_topic_score_gemma":0.000065240914,"teacher_disagreement_score":0.9908181,"about_ca_system_score_codex":0.000013247826,"about_ca_system_score_gemma":0.000013461391,"threshold_uncertainty_score":0.25676218},"labels":[],"label_agreement":null},{"id":"W2398935836","doi":"","title":"Property Testing on Linked Lists.","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Strategic Research Council; Natural Sciences and Engineering Research Council of Canada; Sino-Danish Center; Tsinghua University; National Natural Science Foundation of China; National Research Foundation; Danmarks Grundforskningsfond; Center for Massive Data Algorithmics; National Science Foundation","keywords":"Property (philosophy); Computer science; Property testing; Combinatorics; Mathematics; Algorithm; Philosophy; Epistemology","score_opus":0.045701287493257935,"score_gpt":0.22887525246382193,"score_spread":0.18317396497056398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398935836","genre_codex":"other","genre_gemma":"methods","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.0030293167,0.000005807747,0.24230428,0.0059563927,0.0003730742,0.00038808977,3.716687e-7,0.00078750745,0.7471552],"genre_scores_gemma":[0.3087185,0.0000023792838,0.5885558,0.005082845,0.00021223907,0.00005482874,0.00000518303,0.000011235543,0.09735699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994293,0.000010198244,0.0000783429,0.00020644479,0.00012670954,0.00014901733],"domain_scores_gemma":[0.9994904,0.00003218795,0.00001968507,0.0003789657,0.000037549595,0.00004122563],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008552174,0.00006086697,0.000047419908,0.0000371497,0.000055773813,0.0003778891,0.0006587395,0.0000126713585,0.00008474743],"category_scores_gemma":[0.000045511955,0.000032585718,0.0000128043785,0.00020459434,0.000009906606,0.0007688748,0.00029413233,0.000048859372,0.0024645817],"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":[1.6954746e-7,0.000041196094,0.00041348033,0.0000048969396,0.000003680054,0.0000040566815,0.00002597237,0.000006107889,0.0001512389,0.024926003,0.05568789,0.9187353],"study_design_scores_gemma":[0.0003072904,0.00021042381,0.027282063,0.000027265518,0.0000019486777,0.0000026452446,0.000013803864,0.8811412,0.00041375041,0.005404815,0.0848536,0.00034122812],"about_ca_topic_score_codex":0.0001504217,"about_ca_topic_score_gemma":0.000001894325,"teacher_disagreement_score":0.9183941,"about_ca_system_score_codex":0.0000070015885,"about_ca_system_score_gemma":0.0000056743656,"threshold_uncertainty_score":0.9983121},"labels":[],"label_agreement":null},{"id":"W2400087804","doi":"","title":"Range Counting with Distinct Constraints.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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":"Range (aeronautics); Range query (database); Computer science; Counting problem; Point (geometry); Data structure; Combinatorics; Mathematics; Algorithm; Sargable; Information retrieval; Search engine; Web search query; Geometry","score_opus":0.04844032645569903,"score_gpt":0.24745062627455283,"score_spread":0.1990102998188538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400087804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012031257,0.00003226158,0.8584856,0.0047167246,0.0005283298,0.0002733343,0.00013718798,0.0001777949,0.123617545],"genre_scores_gemma":[0.97339344,6.068806e-7,0.02459796,0.001360385,0.00007451047,0.0000088032375,0.00012578254,0.00000881831,0.00042969355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985668,0.00003222349,0.00015890162,0.00039458807,0.00047690736,0.00037059086],"domain_scores_gemma":[0.99866396,0.00008427436,0.00007303122,0.00028667922,0.00032566875,0.0005663552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030661395,0.00016106093,0.00014441588,0.00042712304,0.00014230574,0.0004982778,0.0007395857,0.000037614474,0.0001201008],"category_scores_gemma":[0.00006824296,0.0001481586,0.000023475975,0.0006902129,0.00014602445,0.0004940023,0.000074362484,0.00013961669,0.00035794967],"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.000007934104,0.000035690995,0.0075650522,0.000012642739,0.000044967128,0.00024954331,0.00017315222,0.0028290018,3.5663484e-7,0.869772,0.0120115485,0.107298106],"study_design_scores_gemma":[0.0033621457,0.00059687864,0.076317996,0.00020217254,0.000028641429,0.00013903096,0.00059581245,0.7981681,0.000009061386,0.04970753,0.06931739,0.0015552135],"about_ca_topic_score_codex":0.0028454943,"about_ca_topic_score_gemma":0.004813608,"teacher_disagreement_score":0.9613622,"about_ca_system_score_codex":0.00015019397,"about_ca_system_score_gemma":0.0012391333,"threshold_uncertainty_score":0.60417324},"labels":[],"label_agreement":null},{"id":"W2400147605","doi":"10.1007/978-3-319-21470-2_52","title":"Efficient Combined Text and Spatial Search","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Full text search; Rank (graph theory); Combinatorics; Suffix; Tree (set theory); Information retrieval; String (physics); Data structure; Suffix array; Search engine; Mathematics","score_opus":0.02579766932172315,"score_gpt":0.25610899734912235,"score_spread":0.2303113280273992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400147605","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.000091314796,0.00034422838,0.99110496,0.0009031276,0.0014250859,0.00039676556,0.000008279963,0.00013699042,0.0055892365],"genre_scores_gemma":[0.34327555,0.00007867847,0.649766,0.001878781,0.0012718692,0.000016232125,0.00003948194,0.00008921134,0.0035841486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615806,0.000032750802,0.00035310295,0.0014836944,0.001338058,0.00063435483],"domain_scores_gemma":[0.99791247,0.000191383,0.00012715513,0.0012915997,0.00022106752,0.00025629907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013273177,0.00043114615,0.0004196726,0.0007605583,0.00021034763,0.00092924584,0.0031232035,0.00017051006,0.00002037824],"category_scores_gemma":[0.000047958103,0.00038092755,0.000057736477,0.00048145145,0.00071408093,0.00030588062,0.0040834895,0.00057914614,0.00008925119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005417416,0.000030182906,0.000019994965,0.000026277454,0.000008328455,0.00009285952,0.00034620898,0.016186219,0.000013726758,0.024093,0.00010646969,0.95907134],"study_design_scores_gemma":[0.00043254503,0.00022791434,0.000118059026,0.00012645574,0.0000058864907,0.00002155141,1.6562875e-7,0.9611874,0.000094842566,0.034548823,0.0027432514,0.0004930763],"about_ca_topic_score_codex":0.00008362222,"about_ca_topic_score_gemma":0.00005266923,"teacher_disagreement_score":0.9585782,"about_ca_system_score_codex":0.00017224652,"about_ca_system_score_gemma":0.00032552614,"threshold_uncertainty_score":0.9998643},"labels":[],"label_agreement":null},{"id":"W2400921732","doi":"10.1007/11011620_5","title":"D-GridMST: Clustering Large Distributed Spatial Databases","year":2005,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Cluster analysis; Computer science; Partition (number theory); Data mining; Overhead (engineering); Grid; Distributed database; Spatial database; Spatial analysis; Database; CURE data clustering algorithm; Space (punctuation); Correlation clustering; Artificial intelligence; Mathematics","score_opus":0.11456629510891252,"score_gpt":0.3584500276949944,"score_spread":0.24388373258608187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400921732","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":[8.4365826e-7,0.0023443806,0.96344876,0.0005675757,0.0013474037,0.00028675795,0.0006319124,0.00014455586,0.031227812],"genre_scores_gemma":[0.039373174,0.014889432,0.6772385,0.0037837583,0.005187451,0.00021371507,0.010010185,0.00026216405,0.24904159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973423,0.000027149597,0.00069971895,0.0008742736,0.0006399799,0.00041658792],"domain_scores_gemma":[0.9983749,0.00047222388,0.00026987965,0.00057956384,0.00023775497,0.00006567995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003868366,0.0004368894,0.00047692037,0.00030114074,0.00019040355,0.0001306289,0.0013846441,0.0000746652,0.00010526779],"category_scores_gemma":[0.00009711512,0.00044450766,0.00010807017,0.00015508944,0.00019811031,0.0006185817,0.0030075924,0.00038299896,0.00032538714],"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.000007488167,0.000058293488,0.00001610505,0.0001049348,0.00017896165,0.00017226653,0.00027225033,0.05021986,4.8407276e-8,0.807338,0.0062297443,0.13540204],"study_design_scores_gemma":[0.00017977267,0.00005677226,0.000069871785,0.000634954,0.000026760625,0.000018060531,0.00008537608,0.54968953,0.0000058832775,0.12856469,0.31989115,0.0007771738],"about_ca_topic_score_codex":0.000021236187,"about_ca_topic_score_gemma":0.0003840736,"teacher_disagreement_score":0.67877334,"about_ca_system_score_codex":0.00022407775,"about_ca_system_score_gemma":0.00006859099,"threshold_uncertainty_score":0.9998007},"labels":[],"label_agreement":null},{"id":"W2401646429","doi":"10.14778/2831360.2831363","title":"Finding Pareto optimal groups","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Science and Technology Planning Project of Guangdong Province; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Skyline; Computer science; Pruning; Pareto optimal; Scalability; Computation; Point (geometry); Heuristic; Set (abstract data type); Pareto principle; Group (periodic table); Data mining; Algorithm; Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Database","score_opus":0.036021360278773625,"score_gpt":0.24106280418211742,"score_spread":0.2050414439033438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401646429","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.7089795,0.00065942126,0.07446523,0.018097717,0.0053601377,0.0025915573,0.000026315513,0.0009629025,0.18885721],"genre_scores_gemma":[0.9623431,0.000011854415,0.03624926,0.0002009993,0.00011147584,0.00003106839,0.0000011572713,0.000008837936,0.0010422594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988187,0.00000391319,0.00019191476,0.00026104023,0.00047506578,0.00024936773],"domain_scores_gemma":[0.99943733,0.0000113143315,0.0001546911,0.00020776263,0.000103265826,0.00008562455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047612665,0.00011651102,0.00012494589,0.00006957579,0.000075484706,0.00019192022,0.0018031009,0.000022084583,0.0000040668197],"category_scores_gemma":[0.000057193924,0.00007945555,0.00006306719,0.00035341317,0.000038939914,0.00083729555,0.0014597153,0.000080849706,0.000025883435],"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.000027260496,0.00031976608,0.011576944,0.0001331596,0.00013717725,0.0000046173486,0.0043280288,0.00015265618,0.0045431335,0.81665975,0.11962101,0.042496514],"study_design_scores_gemma":[0.0084434245,0.0015880336,0.016628746,0.00076534884,0.0002575864,0.000112594746,0.006869012,0.15252732,0.38453764,0.12861781,0.29696703,0.0026854638],"about_ca_topic_score_codex":0.000014881933,"about_ca_topic_score_gemma":4.294083e-7,"teacher_disagreement_score":0.6880419,"about_ca_system_score_codex":0.000057840807,"about_ca_system_score_gemma":0.000017765855,"threshold_uncertainty_score":0.33506402},"labels":[],"label_agreement":null},{"id":"W2402160301","doi":"","title":"The Large numbers of 2-independent sets in extra-free forests.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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; Forestry; Geography","score_opus":0.01919751744235347,"score_gpt":0.2554542964505641,"score_spread":0.23625677900821063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402160301","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.91358715,0.0010899354,0.009954277,0.0049534854,0.014641503,0.0011736891,0.000035063662,0.00033460464,0.054230314],"genre_scores_gemma":[0.9983592,0.000017168097,0.0011367358,0.000057237667,0.0000047470417,0.00001313948,0.0000049954833,0.000007202214,0.0003995481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869853,0.00006739343,0.00023008174,0.00023334211,0.00045619783,0.0003144248],"domain_scores_gemma":[0.9986386,0.000078755,0.00009263181,0.0010444176,0.000060700688,0.00008490004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553821,0.0001021001,0.00012663814,0.00006484692,0.00006353181,0.00012343739,0.0021773612,0.00003739435,0.0000027852907],"category_scores_gemma":[0.000113020804,0.000078866615,0.00003895704,0.00038129912,0.000037675276,0.0005622487,0.0009968713,0.000115834664,0.00003721164],"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.0000042936185,0.00009412575,0.011162364,0.000004540869,0.000010338882,0.000021604841,0.00029283643,0.0000038294993,0.0000018160626,0.96474594,0.019368721,0.0042896206],"study_design_scores_gemma":[0.00214697,0.00007842379,0.016904922,0.000016270886,0.0000041918224,0.0000024995431,0.00016733159,0.007880217,0.00012766372,0.955012,0.017507534,0.00015195581],"about_ca_topic_score_codex":0.000095049734,"about_ca_topic_score_gemma":0.00031384427,"teacher_disagreement_score":0.084772095,"about_ca_system_score_codex":0.000046479803,"about_ca_system_score_gemma":0.000053579883,"threshold_uncertainty_score":0.40461153},"labels":[],"label_agreement":null},{"id":"W2402181505","doi":"","title":"Orthogonal Range Search using a Distributed Computing Model","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Node (physics); Graph; Message passing; Message Passing Interface; Range (aeronautics); Set (abstract data type); Point (geometry); Combinatorics; Theoretical computer science; Mathematics; Parallel computing","score_opus":0.13569911409660299,"score_gpt":0.28635295350254275,"score_spread":0.15065383940593977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402181505","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.022238709,0.0000062116906,0.9687136,0.000048960308,0.00008401092,0.00007969859,0.0000095815685,0.0001798863,0.00863936],"genre_scores_gemma":[0.501838,0.0000010004131,0.4978096,0.00011817463,0.00003167649,5.6677396e-7,0.000012209084,0.000004234128,0.00018453185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906915,0.000023444198,0.0001313307,0.0002750517,0.00021828875,0.0002827593],"domain_scores_gemma":[0.99949455,0.000012765099,0.00002644621,0.0003527273,0.000044397104,0.000069110516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002787739,0.00008746111,0.00008768333,0.00006888114,0.00011952847,0.00013196433,0.000792216,0.00002089572,0.000035437508],"category_scores_gemma":[0.0000043935293,0.00007600133,0.000037404297,0.00030511696,0.000025672216,0.00067387527,0.0008330456,0.000074501455,0.000043682845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012588438,0.00029598665,0.0068765143,0.000039118255,0.00007489959,0.0000808961,0.0017866419,0.009227176,0.00022657627,0.86938804,0.0025692224,0.10942236],"study_design_scores_gemma":[0.00016751004,0.000010379575,0.0011728605,0.000005587181,0.0000033036008,0.0000022171448,0.0000197403,0.9971645,0.00011621705,0.0011426324,0.00008253536,0.00011252351],"about_ca_topic_score_codex":0.00006254463,"about_ca_topic_score_gemma":0.0000034304799,"teacher_disagreement_score":0.98793733,"about_ca_system_score_codex":0.000016908887,"about_ca_system_score_gemma":0.000027678856,"threshold_uncertainty_score":0.30992442},"labels":[],"label_agreement":null},{"id":"W2402668406","doi":"10.14778/2735461.2735467","title":"Interpretable and informative explanations of outcomes","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":82,"is_retracted":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":"Automatic summarization; Heuristics; Computer science; Construct (python library); Set (abstract data type); Dimension (graph theory); Data mining; Binary classification; Binary number; Machine learning; Sample (material); Artificial intelligence; Mathematics","score_opus":0.0047771768864128625,"score_gpt":0.19223746017089116,"score_spread":0.1874602832844783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402668406","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.45528734,0.00015102426,0.15896405,0.0130461715,0.0012718292,0.0019579008,0.00004436052,0.00026758338,0.36900973],"genre_scores_gemma":[0.98783374,0.000011405014,0.011607975,0.00013078439,0.0000059568533,0.0000120943805,4.563159e-7,0.0000018475821,0.0003957321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947417,0.000002349574,0.00016998197,0.000089268324,0.00017672309,0.00008751735],"domain_scores_gemma":[0.99961185,0.000029341969,0.00016594767,0.00010701339,0.00006608724,0.00001977716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002280105,0.00006099158,0.000108646185,0.00006518534,0.00004201112,0.00005296666,0.0006283052,0.000009992699,0.0000031566074],"category_scores_gemma":[0.000057073343,0.00003788334,0.00003031873,0.0001404005,0.000040062525,0.0007448601,0.00066264276,0.00003435502,0.0000014786871],"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.0000038044534,0.00007656019,0.019864246,0.00014102823,0.000084108746,2.8059977e-8,0.004175443,0.000008451794,0.0012270682,0.9315855,0.0043026395,0.038531125],"study_design_scores_gemma":[0.004728019,0.0009302537,0.1921794,0.00082860957,0.00020600781,0.000013993035,0.004756938,0.21948856,0.33279675,0.17661004,0.066288784,0.0011726365],"about_ca_topic_score_codex":0.000015588615,"about_ca_topic_score_gemma":6.588807e-7,"teacher_disagreement_score":0.75497544,"about_ca_system_score_codex":0.0000082638135,"about_ca_system_score_gemma":0.0000037004836,"threshold_uncertainty_score":0.15448378},"labels":[],"label_agreement":null},{"id":"W2403192553","doi":"","title":"The Crossing Numbers of Cartesian Product of Cone Graph C m + K l with Path P n .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Cartesian product; Mathematics; Combinatorics; Graph; Path (computing); Product (mathematics); Geometry; Computer science","score_opus":0.014605114551273985,"score_gpt":0.21321666928822794,"score_spread":0.19861155473695397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403192553","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.9686766,0.00041779588,0.007507298,0.0003335279,0.0025025518,0.00058699324,0.000008501812,0.0001454623,0.019821253],"genre_scores_gemma":[0.99393696,0.000010644154,0.0058931224,0.000013352857,0.0000032007515,0.0000053426625,0.0000015549949,0.0000065086374,0.00012930612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991119,0.000038597525,0.00019420934,0.00021936378,0.0002450536,0.00019086411],"domain_scores_gemma":[0.9988908,0.000035715308,0.0001792109,0.00075293833,0.0001041589,0.000037161357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003454597,0.00009509461,0.00014098639,0.000042201424,0.00016104619,0.0000924535,0.0008974147,0.000015090491,0.0000027359117],"category_scores_gemma":[0.00001722013,0.000062622086,0.000035463036,0.00042885385,0.0002898494,0.00042514634,0.00019073508,0.000063428495,0.0000031407208],"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.000012774385,0.00011457225,0.008878084,0.000024808023,0.00005263582,0.000008385573,0.0015463686,6.109086e-7,0.00015256942,0.9788498,0.00078757684,0.009571771],"study_design_scores_gemma":[0.0035046865,0.0012737745,0.10556472,0.0002629256,0.000103368926,0.000018335262,0.0008979844,0.0017272404,0.060319915,0.82008475,0.005405226,0.00083705946],"about_ca_topic_score_codex":0.00016894375,"about_ca_topic_score_gemma":0.000009721174,"teacher_disagreement_score":0.15876508,"about_ca_system_score_codex":0.0000067727206,"about_ca_system_score_gemma":0.000047135665,"threshold_uncertainty_score":0.25536543},"labels":[],"label_agreement":null},{"id":"W2404459678","doi":"","title":"(1 + ε)-Approximation for Facility Location in Data Streams∗","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Facility location problem; Approximation algorithm; Simple (philosophy); Space (punctuation); Computer science; Set (abstract data type); Point (geometry); 1-center problem; Streaming algorithm; Decomposition; Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Geometry","score_opus":0.16513186807217373,"score_gpt":0.32114308456516505,"score_spread":0.15601121649299132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404459678","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.00068978005,0.000010347992,0.99612755,0.00090601406,0.00010981324,0.0002189624,0.000026290983,0.0000627357,0.0018485354],"genre_scores_gemma":[0.32619798,0.0000042961815,0.6685038,0.00023190204,0.00006913244,0.00005648684,0.0025345967,0.000003828837,0.002397952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944454,0.000013530797,0.00010197289,0.00024316652,0.00010824026,0.000088531124],"domain_scores_gemma":[0.99912727,0.000016499474,0.00002303634,0.0007583278,0.000046470435,0.000028399789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060208543,0.000039498125,0.000043988504,0.00004484964,0.000014008478,0.00011150924,0.0008755728,0.000013055526,0.0000022420452],"category_scores_gemma":[0.00008144947,0.0000346858,0.000004464715,0.00020816427,0.00000650533,0.0019106343,0.00039864794,0.000017613818,0.000041276093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003444447,0.000084470164,0.0005401349,0.00002200039,0.0000032400217,4.3791567e-7,0.0001392916,0.00013602304,0.0000043699083,0.06114108,0.03438698,0.9035385],"study_design_scores_gemma":[0.00032017185,0.00001996392,0.00049010344,0.000002269123,0.0000010466766,1.4079873e-7,0.000060397415,0.9702243,0.00006548209,0.006952639,0.021805003,0.000058453155],"about_ca_topic_score_codex":0.00007159101,"about_ca_topic_score_gemma":0.00010445766,"teacher_disagreement_score":0.9700883,"about_ca_system_score_codex":0.00002058555,"about_ca_system_score_gemma":0.000028577915,"threshold_uncertainty_score":0.16270466},"labels":[],"label_agreement":null},{"id":"W2404694012","doi":"","title":"Ortsbezogene Visualisierung von komplexen relationalen Daten am Beispiel von Food Environment Maps.","year":2013,"lang":"de","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Computer science","score_opus":0.020645699814456017,"score_gpt":0.21736337065868266,"score_spread":0.19671767084422664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404694012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08875749,0.0032950488,0.8718341,0.0022161894,0.0057602045,0.0052322187,0.0011051543,0.0009395065,0.02086009],"genre_scores_gemma":[0.92307097,0.0018211259,0.05613695,0.0017232817,0.0013813172,0.000529749,0.012114084,0.000107466105,0.0031150815],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957908,0.00014838002,0.001499456,0.0005596478,0.0011217847,0.00087995565],"domain_scores_gemma":[0.99726045,0.00009306697,0.00095212937,0.0011820812,0.00023129662,0.00028096815],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00086650735,0.00056704995,0.0004560456,0.00056924374,0.00067852024,0.0024629957,0.0014180469,0.00026148633,0.00067928206],"category_scores_gemma":[0.000106936015,0.00058247714,0.00017556935,0.00064946746,0.00022679094,0.019211061,0.0012505006,0.00030603443,0.009485676],"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.000043605763,0.0003327243,0.008053523,0.0013652978,0.0011391856,0.00001629588,0.015538201,0.004134285,0.00024191897,0.08235706,0.08599433,0.8007836],"study_design_scores_gemma":[0.0020091364,0.0010090969,0.09203716,0.0006516878,0.00030249395,0.000028638366,0.0012641584,0.36745653,0.00089767604,0.022708377,0.5094237,0.0022113805],"about_ca_topic_score_codex":0.0002498757,"about_ca_topic_score_gemma":0.00000486695,"teacher_disagreement_score":0.83431345,"about_ca_system_score_codex":0.00056944543,"about_ca_system_score_gemma":0.000100785226,"threshold_uncertainty_score":0.99966264},"labels":[],"label_agreement":null},{"id":"W2405459696","doi":"","title":"Searching Circulant Graphs.","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Data Management and Algorithms","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":"Memorial University of Newfoundland","funders":"","keywords":"Circulant matrix; Computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.025711468339408898,"score_gpt":0.23512952671154555,"score_spread":0.20941805837213665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405459696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033405665,0.00043119173,0.920271,0.00076497236,0.014375337,0.0012819545,0.0000086495065,0.0010213306,0.028439945],"genre_scores_gemma":[0.9617444,0.0008628866,0.03643734,0.00048764003,0.000070518596,0.00006111381,0.000064065374,0.00002886929,0.0002431361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985263,0.000103398306,0.00023894834,0.0005137721,0.00028308216,0.0003345366],"domain_scores_gemma":[0.999147,0.000070442395,0.00011943497,0.00044974172,0.000078092155,0.0001352692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037480728,0.00020053644,0.00020046183,0.00031928954,0.00030075616,0.00026541136,0.00063987443,0.00009365995,0.000030437912],"category_scores_gemma":[0.00004309657,0.00018719606,0.00007310578,0.000779294,0.00008258963,0.00066423696,0.00034427768,0.00019667504,0.000009117332],"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.000034570665,0.00022566279,0.00045013436,0.000009139567,0.000038470418,0.00002304458,0.0002886759,0.001043014,0.000005838023,0.9757508,0.00067634694,0.02145428],"study_design_scores_gemma":[0.005410295,0.0012594756,0.0059941006,0.0002066147,0.0000996941,0.000014348868,0.0002541125,0.52273613,0.00019851579,0.45838243,0.0041154283,0.0013288516],"about_ca_topic_score_codex":0.000015898493,"about_ca_topic_score_gemma":0.00000123649,"teacher_disagreement_score":0.92833877,"about_ca_system_score_codex":0.000020894438,"about_ca_system_score_gemma":0.000019483517,"threshold_uncertainty_score":0.76336336},"labels":[],"label_agreement":null},{"id":"W2406104576","doi":"","title":"Some Results On Strong Generalized Neighborhood Systems.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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","score_opus":0.023027847055165997,"score_gpt":0.2497194157725645,"score_spread":0.2266915687173985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406104576","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.4703863,0.010667644,0.03464603,0.009856479,0.22786799,0.004861532,0.00031635084,0.0057825404,0.23561513],"genre_scores_gemma":[0.9971503,0.00003325558,0.0010393509,0.0002183571,0.00015739609,0.000023882152,0.00003514445,0.000015180634,0.0013271214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983122,0.00010470098,0.00027910268,0.00035614183,0.00041251373,0.0005353533],"domain_scores_gemma":[0.9985847,0.0000692973,0.00012474907,0.0010086612,0.000036775084,0.00017585377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572312,0.00018452003,0.00019520552,0.000115621566,0.00013455527,0.0003086736,0.0010851526,0.000055251774,0.000003966423],"category_scores_gemma":[0.00004099132,0.00016605735,0.000056324774,0.0002889966,0.000019666792,0.0017983028,0.0004118053,0.00013200859,0.00045178653],"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.0000074090385,0.00013743913,0.0002308803,0.00000765948,0.000023997629,0.0000059552012,0.00008115313,0.000016175436,0.000014063486,0.97902405,0.018398384,0.0020528166],"study_design_scores_gemma":[0.018429093,0.0012375169,0.018764643,0.0002587192,0.00011151839,0.000021839707,0.0002089408,0.1261863,0.0021215384,0.548633,0.28111005,0.0029169],"about_ca_topic_score_codex":0.000030887895,"about_ca_topic_score_gemma":1.8103938e-7,"teacher_disagreement_score":0.52676404,"about_ca_system_score_codex":0.000060108396,"about_ca_system_score_gemma":0.000017859875,"threshold_uncertainty_score":0.67716223},"labels":[],"label_agreement":null},{"id":"W2407196879","doi":"10.1007/978-3-319-19066-2_68","title":"Combining Constrained CP-Nets and Quantitative Preferences for Online Shopping","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"University of Regina","funders":"","keywords":"Computer science","score_opus":0.08148010704042642,"score_gpt":0.3099909860485635,"score_spread":0.2285108790081371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407196879","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.000106128275,0.00065500254,0.99458086,0.0008086576,0.0011278944,0.0005857308,0.000056776495,0.00012660016,0.0019523334],"genre_scores_gemma":[0.02039167,0.000055955876,0.97818017,0.0007605185,0.00018718893,0.000012732763,0.00006274757,0.00002218123,0.00032685092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970668,0.000025829248,0.00042325107,0.0013252477,0.0006356076,0.0005232731],"domain_scores_gemma":[0.9979069,0.0006846612,0.00027423108,0.0006707696,0.00029774357,0.00016569172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010390972,0.0004295028,0.0005047409,0.0005893195,0.00021805486,0.0008028949,0.002241531,0.00015597789,0.000004824174],"category_scores_gemma":[0.00017415936,0.00038219732,0.00006141373,0.00033242072,0.0008117269,0.0010161449,0.0015317529,0.00038226234,0.0000049310293],"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.000007667395,0.000028243541,0.000024692832,0.00005854623,0.000024323293,0.000023096813,0.0006577294,0.0018827552,0.000033554108,0.12973924,0.000106514715,0.86741364],"study_design_scores_gemma":[0.00060204713,0.00046922354,0.00005382045,0.0004920025,0.000014564375,0.000018170565,0.0000022847175,0.72927064,0.00005226169,0.26405177,0.0043445616,0.0006286588],"about_ca_topic_score_codex":0.00001103557,"about_ca_topic_score_gemma":0.000082242135,"teacher_disagreement_score":0.866785,"about_ca_system_score_codex":0.000083866646,"about_ca_system_score_gemma":0.00033993198,"threshold_uncertainty_score":0.99986297},"labels":[],"label_agreement":null},{"id":"W2407224220","doi":"","title":"An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 Saskatchewan","funders":"","keywords":"Maximal independent set; Computer science; Independent set; Algorithm; Set (abstract data type); Theoretical computer science; Chordal graph; Graph; 1-planar graph","score_opus":0.055230565297083936,"score_gpt":0.2744272080274784,"score_spread":0.21919664273039446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407224220","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.00047338527,0.000043113818,0.99150187,0.0038152572,0.00079887785,0.0005129997,0.0002466888,0.000096439646,0.0025113714],"genre_scores_gemma":[0.561831,0.0000078363055,0.43187454,0.004465511,0.000361609,0.00014881857,0.00078891555,0.000032383006,0.000489389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981269,0.000055030298,0.00024925443,0.0005479617,0.0005200462,0.00050079136],"domain_scores_gemma":[0.99820983,0.00018747794,0.00010937126,0.000491502,0.00038765543,0.00061414216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006863712,0.00020917077,0.00015717154,0.00054343825,0.00036507475,0.0008638529,0.0016735806,0.00006569953,0.000031641994],"category_scores_gemma":[0.00003216862,0.00017436894,0.000060324524,0.0007107927,0.00006879748,0.00075136084,0.00011840318,0.00018395032,0.000082247774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032873536,0.000037111204,0.00020878465,0.000007866164,0.000055121818,0.000024781717,0.0003134979,0.0067963027,5.2529003e-7,0.31121853,0.009789882,0.6715443],"study_design_scores_gemma":[0.00051290024,0.00017952391,0.0011630725,0.000017552993,0.000009954883,0.000010256326,0.00022994899,0.8734124,0.000004057282,0.10488508,0.019307066,0.0002682447],"about_ca_topic_score_codex":0.004165195,"about_ca_topic_score_gemma":0.0031923575,"teacher_disagreement_score":0.8666161,"about_ca_system_score_codex":0.00017266524,"about_ca_system_score_gemma":0.00095519394,"threshold_uncertainty_score":0.8330153},"labels":[],"label_agreement":null},{"id":"W2407385737","doi":"10.1109/bigdataservice.2016.42","title":"A Novel Point of Interest (POI) Location Based Recommender System Utilizing User Location and Web Interactions","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Point of interest; Computer science; Trajectory; Timestamp; Location-based service; Geographic coordinate system; Mobile device; Point (geometry); World Wide Web; Service (business); Recommender system; Information retrieval; Data mining; Real-time computing; Artificial intelligence; Computer network; Geography","score_opus":0.07356407168206223,"score_gpt":0.27432913570110107,"score_spread":0.20076506401903882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407385737","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.0014900329,0.000008775371,0.99286443,0.0029163847,0.00029922312,0.00013537044,0.000004126216,0.00011112143,0.002170524],"genre_scores_gemma":[0.9589622,0.000003852849,0.04023025,0.0001527303,0.000022890437,0.000012907319,0.000005173927,0.000005165434,0.0006048027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931204,0.000028736717,0.00022542122,0.00024432415,0.000081658436,0.00010778771],"domain_scores_gemma":[0.99924564,0.000096983684,0.000108676395,0.0003850788,0.00012436224,0.0000392468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025547802,0.0000827091,0.00008960321,0.00015824659,0.00004448195,0.00009482827,0.00028953864,0.000019149677,0.000021599964],"category_scores_gemma":[0.000032808715,0.000057304347,0.00001846543,0.0002692809,0.000023297514,0.0012581779,0.00019682421,0.000033678327,0.00002591768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019964738,0.0002999164,0.0009552161,0.00039261935,0.00007114969,0.0000017489026,0.00025151498,0.000026735073,0.020009177,0.7267368,0.0060953004,0.2451399],"study_design_scores_gemma":[0.0016576723,0.000112460366,0.0034734325,0.0011577893,0.000027181572,0.000016563823,0.0010139416,0.97152865,0.009779925,0.00032113926,0.010572998,0.00033826887],"about_ca_topic_score_codex":0.00005550724,"about_ca_topic_score_gemma":0.00011343087,"teacher_disagreement_score":0.9715019,"about_ca_system_score_codex":0.000056576475,"about_ca_system_score_gemma":0.000027139784,"threshold_uncertainty_score":0.23368034},"labels":[],"label_agreement":null},{"id":"W2407951356","doi":"","title":"On the path-connectivity of lexicographic product graphs.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Lexicographical order; Mathematics; Path (computing); Product (mathematics); Combinatorics; Computer science; Computer network; Geometry","score_opus":0.024398730678705793,"score_gpt":0.23422302795536384,"score_spread":0.20982429727665805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407951356","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.98305744,0.00014216643,0.0016654166,0.0025259077,0.0033705647,0.0003953932,0.000004581574,0.00017315795,0.008665343],"genre_scores_gemma":[0.999279,0.000007827788,0.0004493903,0.00015478743,0.000005883556,0.000015907974,0.0000024524813,0.000006240033,0.00007849974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988312,0.00011861107,0.0001467577,0.00032009,0.00038634572,0.00019698442],"domain_scores_gemma":[0.9985512,0.00013066453,0.000100874226,0.0010526334,0.00009879999,0.000065852204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009363121,0.0001176788,0.00013595443,0.000112586466,0.00007763721,0.00009214101,0.0012170512,0.00002171155,0.0000039069832],"category_scores_gemma":[0.00018661901,0.00008067037,0.00006441226,0.00084481895,0.000082317114,0.0004365397,0.00034468505,0.000121259975,0.000030419993],"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.0000037242066,0.00014588397,0.0013449964,0.000004786522,0.000018470559,0.000003860659,0.0001338065,0.0000024020835,0.000022343898,0.9819943,0.011241095,0.0050843405],"study_design_scores_gemma":[0.0003790942,0.00019130022,0.004441748,0.000014007974,0.0000060485404,0.0000010428762,0.000024067525,0.0011115236,0.0012114821,0.99080247,0.0016965587,0.00012068942],"about_ca_topic_score_codex":0.000035310026,"about_ca_topic_score_gemma":0.000002009673,"teacher_disagreement_score":0.016221542,"about_ca_system_score_codex":0.000012168994,"about_ca_system_score_gemma":0.000032134103,"threshold_uncertainty_score":0.3289642},"labels":[],"label_agreement":null},{"id":"W2408577007","doi":"","title":"Spanning Eulerian Subgraphs in Generalized Prisms.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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; Eulerian path; Combinatorics; Geometry; Mathematical analysis; Lagrangian","score_opus":0.01706646239536925,"score_gpt":0.24357836005575406,"score_spread":0.22651189766038482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408577007","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.96854645,0.000711938,0.008109738,0.0008447943,0.008209799,0.0003563333,0.0000020917396,0.00037772654,0.012841152],"genre_scores_gemma":[0.9857643,0.000026889367,0.01356309,0.00024249038,0.00002360397,0.000019365318,0.000010570724,0.00001173835,0.0003379447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871397,0.00007300308,0.0002080912,0.00026669775,0.00023305645,0.00050516333],"domain_scores_gemma":[0.9991827,0.000029213788,0.00006689879,0.0005809815,0.000020669637,0.00011951876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613386,0.00013930791,0.00016199522,0.0001935559,0.00007369975,0.00016846029,0.00091035245,0.000046360983,0.000022010998],"category_scores_gemma":[0.000023269804,0.00013943874,0.000046837744,0.0006749249,0.000023798822,0.0015852482,0.0004542335,0.00012132208,0.00012489466],"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.0000017827784,0.00010852542,0.026306743,0.0000058347587,0.000009915331,0.000011357072,0.00041157386,0.0000022810204,0.00009953932,0.96238387,0.0034227741,0.0072358237],"study_design_scores_gemma":[0.005123483,0.00014425683,0.27596137,0.00008383617,0.000023872455,0.000012624349,0.00012928966,0.016352655,0.0029210362,0.5753757,0.12248911,0.0013828136],"about_ca_topic_score_codex":0.00006338991,"about_ca_topic_score_gemma":0.0000028470351,"teacher_disagreement_score":0.3870082,"about_ca_system_score_codex":0.000034207285,"about_ca_system_score_gemma":0.000014173904,"threshold_uncertainty_score":0.56861466},"labels":[],"label_agreement":null},{"id":"W2414522820","doi":"10.1007/s00453-016-0170-7","title":"Succinct Indices for Path Minimum, with Applications","year":2016,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Ackermann function; Path (computing); Combinatorics; Mathematics; Range query (database); Constant (computer programming); Discrete mathematics; Tree traversal; Range (aeronautics); Tree (set theory); Data structure; Inverse; Sigma; Node (physics); Computer science; Algorithm","score_opus":0.009513887450547032,"score_gpt":0.2270798350867203,"score_spread":0.21756594763617326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414522820","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.00037179,0.000041062987,0.9949815,0.0023092623,0.00009694388,0.0005471658,0.000059880793,0.00020557524,0.0013868063],"genre_scores_gemma":[0.095867865,0.000043269825,0.89662665,0.0006869822,0.00055525434,0.0011675105,0.000054663364,0.000036970257,0.004960806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988847,0.000010244258,0.0001513494,0.0004539205,0.00019650714,0.0003032991],"domain_scores_gemma":[0.9989547,0.00014491136,0.000089183864,0.000660213,0.000065287,0.00008571386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016438308,0.00013560193,0.00012563782,0.00009476365,0.00014201534,0.0001233849,0.00105766,0.000033001943,0.00001526594],"category_scores_gemma":[0.000008766026,0.00008050663,0.000042437096,0.00028221973,0.000052913118,0.0007133758,0.00020169551,0.000033963555,0.00012643075],"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.0000063618513,0.00007209059,0.00016524798,0.000014284329,0.000043071755,0.000004882523,0.000045006404,3.6516062e-7,0.00016352982,0.100974664,0.0066955653,0.89181495],"study_design_scores_gemma":[0.0026964487,0.0005457137,0.0015985313,0.00007379038,0.000051788757,0.000018486153,0.00004526269,0.010565442,0.0036435344,0.029202674,0.95080185,0.0007564903],"about_ca_topic_score_codex":0.0000067132296,"about_ca_topic_score_gemma":0.0000037115433,"teacher_disagreement_score":0.9441063,"about_ca_system_score_codex":0.000020902839,"about_ca_system_score_gemma":0.000036128444,"threshold_uncertainty_score":0.3282965},"labels":[],"label_agreement":null},{"id":"W2422676813","doi":"10.1109/icde.2016.7498281","title":"Finding the minimum spatial keyword cover","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Cover (algebra); Pruning; Scalability; Computer science; Approximation algorithm; Set cover problem; Set (abstract data type); Function (biology); Efficient algorithm; Focus (optics); Time complexity; Theoretical computer science; Algorithm; Database","score_opus":0.019515255777372186,"score_gpt":0.23396203631380036,"score_spread":0.21444678053642818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2422676813","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.0012778675,0.00000532522,0.9468284,0.008042731,0.00048155148,0.00006140202,0.0000015799626,0.00008429929,0.043216802],"genre_scores_gemma":[0.87584287,0.000018108776,0.01621571,0.001964333,0.0003295411,0.000009629868,0.0000015560896,0.000006617162,0.10561163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994425,0.000016148264,0.00007223521,0.00016703435,0.00014882286,0.00015325847],"domain_scores_gemma":[0.99943924,0.00007969605,0.000023704979,0.00042355678,0.000010151683,0.00002364063],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016082954,0.000053704414,0.00004087384,0.00002547726,0.000075853575,0.00016245151,0.0009205223,0.000011342473,0.00030122366],"category_scores_gemma":[0.000016145606,0.000022578048,0.000024661005,0.000101017155,0.0000237674,0.0005344684,0.00047581104,0.000021542384,0.0011738966],"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.0000013385564,0.000013667123,0.0005085516,0.0000012930094,0.000010795159,0.0000062307913,0.000059411675,7.045751e-7,0.00021713813,0.12408836,0.106315024,0.7687775],"study_design_scores_gemma":[0.00072946213,0.0000668512,0.0069028325,0.00002262154,0.000007314132,0.000003483432,0.000022766437,0.031891737,0.0027204417,0.0071253036,0.9502088,0.0002984078],"about_ca_topic_score_codex":0.00002216638,"about_ca_topic_score_gemma":0.0000072090284,"teacher_disagreement_score":0.93061274,"about_ca_system_score_codex":0.000008466482,"about_ca_system_score_gemma":0.0000078330295,"threshold_uncertainty_score":0.9996038},"labels":[],"label_agreement":null},{"id":"W2460197302","doi":"10.1145/2948649.2948655","title":"Dynamically ranked top-k spatial keyword search","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; New Brunswick Innovation Foundation","keywords":"Popularity; Computer science; Information retrieval; Relevance (law); Keyword search; Keyword density; World Wide Web; Volume (thermodynamics); Data mining","score_opus":0.011416831503963784,"score_gpt":0.23330730010462822,"score_spread":0.22189046860066444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460197302","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.004872086,0.0000034470095,0.9616587,0.0056875274,0.00025835604,0.00008763719,0.0000024626165,0.00020178681,0.027227977],"genre_scores_gemma":[0.8244403,0.000034211927,0.1283928,0.00087041355,0.0002270773,0.000011154531,0.000006444972,0.000011467977,0.04600614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990523,0.00002925064,0.00011317588,0.0002940538,0.0002594663,0.00025175838],"domain_scores_gemma":[0.9992987,0.000050449515,0.000015164126,0.0005315328,0.0000329545,0.00007122074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002110033,0.000075545075,0.00007535177,0.00006567099,0.000049030223,0.00015754452,0.001065187,0.00002222123,0.0003400149],"category_scores_gemma":[0.000013764099,0.00004386131,0.000034468245,0.00015846646,0.000032457767,0.00062879146,0.0006369057,0.00003646517,0.00093439064],"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.0000035474186,0.000025152603,0.0004805097,0.000002694204,0.00001170947,0.000011932934,0.000019967823,5.8283064e-7,0.0006188913,0.0990766,0.0028430047,0.8969054],"study_design_scores_gemma":[0.006259995,0.00074466266,0.05680893,0.0001444419,0.000030301222,0.00002201576,0.00006407805,0.66035336,0.018179705,0.033108365,0.22211508,0.0021690608],"about_ca_topic_score_codex":0.00010605223,"about_ca_topic_score_gemma":0.000038884282,"teacher_disagreement_score":0.89473635,"about_ca_system_score_codex":0.000018195426,"about_ca_system_score_gemma":0.000017678953,"threshold_uncertainty_score":0.9998435},"labels":[],"label_agreement":null},{"id":"W2460852158","doi":"10.1007/s11390-016-1654-2","title":"Mining Object Similarity for Predicting Next Locations","year":2016,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Similarity (geometry); Markov chain; Trajectory; Object (grammar); Locality; Data mining; Markov model; Sequence (biology); Hidden Markov model; Artificial intelligence; Theory of computation; Machine learning; Algorithm; Image (mathematics)","score_opus":0.021658267926861267,"score_gpt":0.26099372336252996,"score_spread":0.2393354554356687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460852158","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.040308896,0.00007819936,0.94670695,0.012172655,0.00055435696,0.000073774405,7.767736e-7,0.000056658617,0.000047757934],"genre_scores_gemma":[0.5908074,0.000037716913,0.40879837,0.00019348187,0.00013775036,0.0000025951176,6.5272594e-8,0.0000025025583,0.000020142967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999,0.000009034532,0.00025363197,0.00022725028,0.0002661842,0.00024387467],"domain_scores_gemma":[0.99882895,0.00011938685,0.00022126173,0.00028515098,0.0004822203,0.00006301372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011478867,0.00007281879,0.00013629707,0.0006646584,0.00024424068,0.00024515035,0.0014741174,0.000040286668,7.130938e-7],"category_scores_gemma":[0.00018611037,0.000046840338,0.000026293867,0.0008979536,0.00033910898,0.0022514625,0.00057496043,0.00006985162,0.0000010929497],"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.0000014219503,0.0000225359,0.0015387136,0.0000049328874,0.000009529389,0.0000067420774,0.00006565409,0.000003366468,0.0014381417,0.034600873,0.0009311671,0.9613769],"study_design_scores_gemma":[0.004185718,0.0038777187,0.010819114,0.0006138877,0.000068586254,0.0013215874,0.00032156755,0.72065324,0.02690845,0.14321887,0.08714131,0.0008699253],"about_ca_topic_score_codex":5.0983687e-7,"about_ca_topic_score_gemma":9.0977005e-7,"teacher_disagreement_score":0.960507,"about_ca_system_score_codex":0.000030753377,"about_ca_system_score_gemma":0.00016428473,"threshold_uncertainty_score":0.27393013},"labels":[],"label_agreement":null},{"id":"W2466800257","doi":"10.1111/tgis.12219","title":"A New Combined Assessment of Mixed Uncertainty in Spatial Models: Conceptualization and Implementation","year":2016,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Conceptualization; Computer science; Python (programming language); Uncertainty analysis; Monte Carlo method; Fuzzy logic; Propagation of uncertainty; Uncertainty quantification; Data mining; Machine learning; Artificial intelligence; Algorithm; Mathematics; Simulation; Statistics","score_opus":0.024589368697617468,"score_gpt":0.30199854791787606,"score_spread":0.2774091792202586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466800257","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.013764677,0.000007737755,0.98510486,0.0006369097,0.000108973814,0.0001859911,0.000012905482,0.000021207377,0.00015674214],"genre_scores_gemma":[0.9715545,0.00006317472,0.0282394,0.00001521586,0.000005449288,0.000017104052,0.000009717277,0.0000029165153,0.000092507245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933463,0.00004663971,0.0002176624,0.00017246058,0.00012723758,0.00010134094],"domain_scores_gemma":[0.9997135,0.000039586103,0.000049408874,0.00015453363,0.0000183514,0.000024661766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015745299,0.000060394563,0.00009251792,0.00015997211,0.000020971098,0.000025063498,0.00015410673,0.000020140433,0.00008130043],"category_scores_gemma":[0.0000016441905,0.00005053236,0.000014299625,0.00027019696,0.000021790236,0.0007470516,0.000014744871,0.000030046853,5.9517856e-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.000009091113,0.00008096626,0.0019872186,0.000015075856,0.000010645148,0.000001425427,0.0009613657,0.0051134517,0.0004148435,0.05608251,0.00007928276,0.93524414],"study_design_scores_gemma":[0.006787652,0.00023703702,0.0807998,0.000089743764,0.000017721983,9.802611e-7,0.00048380333,0.8909277,0.0009892883,0.018938173,0.0004664956,0.00026162292],"about_ca_topic_score_codex":0.0021458264,"about_ca_topic_score_gemma":0.003629915,"teacher_disagreement_score":0.95778984,"about_ca_system_score_codex":0.00005362281,"about_ca_system_score_gemma":0.000049279195,"threshold_uncertainty_score":0.32438618},"labels":[],"label_agreement":null},{"id":"W2468149677","doi":"10.22215/etd/2012-09696","title":"Exploiting non-uniform query distributions in data structuring problems","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Canadian Heritage; Library and Archives Canada; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Structuring; Computer science; Information retrieval; Mathematics; Political science","score_opus":0.042721301232802926,"score_gpt":0.28299573974565656,"score_spread":0.24027443851285363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468149677","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.011447166,0.00023708513,0.91023546,0.00021112312,0.0032608646,0.0010007607,0.00042938194,0.0004605909,0.07271757],"genre_scores_gemma":[0.5024781,0.00033687358,0.28314334,0.00009958692,0.0012725386,0.00026395908,0.17284997,0.00011829198,0.039437294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982714,0.000015825372,0.00037673974,0.00059957954,0.00028947194,0.00044699936],"domain_scores_gemma":[0.9981422,0.000029103461,0.00017485762,0.0015465227,0.000034804005,0.00007254198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039522964,0.00023163964,0.00021128258,0.00023177365,0.00012819406,0.00042845207,0.0030469855,0.00010450419,0.00005212262],"category_scores_gemma":[0.000027150998,0.00021751589,0.00003377759,0.00042468283,0.000009691634,0.003875869,0.0011296044,0.00028908582,0.00006836696],"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.000008419114,0.00038612878,0.002170101,0.0016845003,0.00017878907,0.00006203107,0.0030143128,0.00014504997,0.00048186345,0.2140161,0.01571281,0.7621399],"study_design_scores_gemma":[0.0024170065,0.000092532835,0.12423105,0.0029907846,0.00021796538,0.000023983614,0.006514188,0.7298541,0.0038554254,0.024010593,0.10008871,0.0057036406],"about_ca_topic_score_codex":0.00037774604,"about_ca_topic_score_gemma":0.0019396074,"teacher_disagreement_score":0.7564363,"about_ca_system_score_codex":0.000058606474,"about_ca_system_score_gemma":0.00005794839,"threshold_uncertainty_score":0.8870041},"labels":[],"label_agreement":null},{"id":"W2473418787","doi":"10.5623/cig2015-108","title":"An Efficient Parallel Map Visualization Framework for Large Vector Data","year":2015,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","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":"China University of Geosciences","keywords":"Visualization; Computer science; Vector map; Graphics; Data mining; Data visualization; Process (computing); Scalable Vector Graphics; Software; Vector graphics; The Internet; Geographic information system; Computer graphics (images); Artificial intelligence; World Wide Web; Geography; Cartography","score_opus":0.06670161258104966,"score_gpt":0.3450724783285144,"score_spread":0.2783708657474647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473418787","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.00042822552,0.000038636364,0.9973653,0.0008130873,0.00056821265,0.00032856522,0.00008049584,0.00020278608,0.00017468953],"genre_scores_gemma":[0.052314516,0.0000018987964,0.9457936,0.00049676694,0.00024497436,0.000038067512,0.0009383965,0.000014031885,0.00015774579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.000039558112,0.00017225096,0.00038206708,0.00027816262,0.00028026273],"domain_scores_gemma":[0.9980813,0.00006169933,0.00006843589,0.0016031874,0.00005785363,0.00012752552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069330196,0.00009668168,0.00011013358,0.00005335589,0.0000930881,0.00035591476,0.0018703038,0.00003955798,0.000015797123],"category_scores_gemma":[0.00016302569,0.00008617443,0.000017590211,0.00019547758,0.000011138486,0.00070505735,0.0006764837,0.000038278096,0.00020855213],"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.000004270611,0.0002188704,0.000047164227,0.000036878628,0.000013316353,0.000002522174,0.00043044405,0.0002802253,0.000001696336,0.96680033,0.027954808,0.0042094467],"study_design_scores_gemma":[0.00031320448,0.00007574,0.00020015179,0.000017815772,0.000009425478,4.850484e-7,0.0000644545,0.9282589,0.00000849492,0.025514808,0.04541102,0.00012547785],"about_ca_topic_score_codex":0.000004568642,"about_ca_topic_score_gemma":0.000002510662,"teacher_disagreement_score":0.94128555,"about_ca_system_score_codex":0.000015094905,"about_ca_system_score_gemma":0.000030939536,"threshold_uncertainty_score":0.35140914},"labels":[],"label_agreement":null},{"id":"W2473523307","doi":"10.5623/cig2015-301","title":"ADVANCES IN GEOSPATIAL STATISTICAL MODELLING, ANALYSIS AND DATA MINING","year":2015,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Simon Fraser University; University of New Brunswick","funders":"","keywords":"Geospatial analysis; Humanities; Geography; Cartography; Philosophy","score_opus":0.05433346667079821,"score_gpt":0.3079598296451203,"score_spread":0.2536263629743221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473523307","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.003087188,0.00017587854,0.9948441,0.00016836854,0.00006449381,0.000052405838,0.000040826708,0.000035996654,0.0015307637],"genre_scores_gemma":[0.13390976,0.00007897764,0.8656857,0.00005759201,0.00003057409,0.0000040881473,0.00017274111,0.000003353563,0.000057190227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.000034439912,0.0001749953,0.000340057,0.0002211438,0.00017616931],"domain_scores_gemma":[0.99909455,0.0000769463,0.000040294355,0.0006856679,0.000016545611,0.00008599184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004598407,0.000071813476,0.00014991144,0.00014918343,0.000027389322,0.0001774866,0.0008060935,0.000015750928,0.000009069159],"category_scores_gemma":[0.00006527635,0.00006428252,0.0000080937725,0.0004546182,0.000029875562,0.0012612342,0.000884489,0.00003950108,0.000016664259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008928429,0.00012582476,0.01487807,0.000055661192,0.00011878507,0.00010606993,0.0016195674,0.011259051,3.615307e-7,0.050488826,0.0029609588,0.9183779],"study_design_scores_gemma":[0.00016830511,0.000017926008,0.0010163649,0.000005980544,0.000037451457,7.191374e-7,0.0000626945,0.9895052,5.854927e-7,0.006442795,0.0026562014,0.00008578768],"about_ca_topic_score_codex":0.000117232856,"about_ca_topic_score_gemma":0.00021379424,"teacher_disagreement_score":0.97824615,"about_ca_system_score_codex":0.000007041377,"about_ca_system_score_gemma":0.000017514012,"threshold_uncertainty_score":0.26213652},"labels":[],"label_agreement":null},{"id":"W2480278432","doi":"10.4018/978-1-60566-172-8.ch014","title":"Retrieval Optimization for Server-Based Repositories in Location-Based Mobile Commerce","year":2009,"lang":"en","type":"book-chapter","venue":"Advances in database research (ADR) book series/Advances in database research series","topic":"Data Management and Algorithms","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; Mobile commerce; Scope (computer science); Database transaction; Heuristic; Transactional leadership; Database; World Wide Web","score_opus":0.05327107552315204,"score_gpt":0.3854372046597578,"score_spread":0.33216612913660576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480278432","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.00015944669,0.3170468,0.4314584,0.014077525,0.005642331,0.048352893,0.03516964,0.0016644478,0.14642851],"genre_scores_gemma":[0.00086559815,0.3912879,0.4423253,0.0007850144,0.0017577101,0.0067403913,0.06732924,0.0007340464,0.0881748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.97918636,0.0023869935,0.0034350783,0.0045695314,0.0068351454,0.0035869163],"domain_scores_gemma":[0.98106974,0.005922986,0.0009352467,0.008248776,0.0031790987,0.00064414873],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","scholarly_communication"],"category_scores_codex":[0.02174672,0.0015432485,0.0020856548,0.005670673,0.0012405965,0.0015618717,0.008212469,0.0006025328,0.00033269986],"category_scores_gemma":[0.0059985896,0.0016160993,0.00028461375,0.0049553947,0.0029485929,0.045461144,0.004228072,0.0045619416,0.00008266099],"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.011951022,0.0026486153,0.0007124938,0.013642508,0.00014314406,0.004888445,0.00058419874,0.21315911,0.00024399684,0.6313297,0.0155032985,0.10519348],"study_design_scores_gemma":[0.0029467414,0.0018134912,0.000020637355,0.0051853633,0.000015467638,0.000017975284,0.00042475114,0.051242203,0.0023666138,0.010481786,0.9237961,0.00168886],"about_ca_topic_score_codex":0.00026307988,"about_ca_topic_score_gemma":0.005608118,"teacher_disagreement_score":0.90829283,"about_ca_system_score_codex":0.0022807096,"about_ca_system_score_gemma":0.0029737155,"threshold_uncertainty_score":0.9997648},"labels":[],"label_agreement":null},{"id":"W2480353330","doi":"10.1109/nafips.2001.944277","title":"Multivalued dependencies in extended possibility-based fuzzy relational databases","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Relational database; Functional dependency; Dependency theory (database theory); Fuzzy logic; Computer science; Fuzzy set; Fuzzy set operations; Data mining; Fuzzy classification; Relational model; Theoretical computer science; Axiom; Type-2 fuzzy sets and systems; Equivalence (formal languages); Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.07438106180287549,"score_gpt":0.2721741915902875,"score_spread":0.197793129787412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480353330","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.015797181,0.00011748651,0.913982,0.0022439775,0.00032917393,0.00037277647,0.00003309993,0.0004290089,0.066695295],"genre_scores_gemma":[0.552592,0.000006760678,0.44282535,0.000631546,0.0000361228,0.00001741287,0.000062041436,0.0000064017763,0.003822383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986768,0.00006483106,0.00022584999,0.00044347678,0.00035550128,0.000233559],"domain_scores_gemma":[0.999055,0.00013827601,0.00004393001,0.0006771255,0.00003195192,0.000053662596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034854043,0.000113275826,0.0001043443,0.00018126171,0.00007463865,0.00011080789,0.0006409466,0.000021879217,0.00038398575],"category_scores_gemma":[0.000103558654,0.000097920856,0.000036816207,0.00044412314,0.00003880144,0.0015263102,0.0002899506,0.000096477226,0.00025418206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013229999,0.0012202526,0.03436889,0.000041791896,0.000024676165,0.00015509927,0.00032943784,0.000872462,0.00023954398,0.8421489,0.013885207,0.1067005],"study_design_scores_gemma":[0.0009424135,0.00003121917,0.077879995,0.000017402523,0.0000031841864,0.0000019894753,0.00003535885,0.9115608,0.00036181087,0.0050750733,0.0038426027,0.00024816755],"about_ca_topic_score_codex":0.0001227274,"about_ca_topic_score_gemma":0.00013062717,"teacher_disagreement_score":0.91068834,"about_ca_system_score_codex":0.000034094217,"about_ca_system_score_gemma":0.000017620217,"threshold_uncertainty_score":0.42043748},"labels":[],"label_agreement":null},{"id":"W2484289422","doi":"","title":"An Object-Oriented Approach for Temporal Data","year":2015,"lang":"en","type":"article","venue":"Hrčak Portal of scientific journals of Croatia (University Computing Centre)","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Computer science; Object (grammar); Class (philosophy); Metaphor; Data model (GIS); Object-oriented programming; Data modeling; Object model; Temporal database; Data mining; Artificial intelligence; Information retrieval; Database; Programming language","score_opus":0.07279038873027313,"score_gpt":0.2838701725139117,"score_spread":0.2110797837836386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484289422","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.14282352,0.00007726001,0.85412645,0.000167853,0.00096037216,0.00028079926,0.00017249388,0.00007220786,0.0013190274],"genre_scores_gemma":[0.72031003,0.0000022209717,0.27876374,0.0000097163265,0.000057332647,1.5751711e-8,0.00045258336,0.000007356124,0.00039703722],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973933,0.000104147926,0.0004641413,0.0007503754,0.0008628547,0.00042515216],"domain_scores_gemma":[0.9965089,0.000051720748,0.00085860275,0.001510576,0.00073503586,0.000335163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029102974,0.00017864609,0.0003679271,0.0005449818,0.00032800608,0.00031151908,0.004006793,0.00005717484,0.000013454148],"category_scores_gemma":[0.000080210004,0.00018982956,0.00011902257,0.0011966989,0.00028895692,0.003367356,0.0013949818,0.00013015409,0.0000034036952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006263721,0.0108154705,0.10786553,0.00114386,0.0017413156,0.0005554445,0.03907254,0.018220967,0.0075491895,0.22444913,0.31801972,0.2699405],"study_design_scores_gemma":[0.0017681135,0.00013349281,0.0035776775,0.00008123134,0.0000767903,0.000018559236,0.0061241626,0.9816026,0.00047512553,0.0004953645,0.0052967975,0.0003500855],"about_ca_topic_score_codex":0.00010060249,"about_ca_topic_score_gemma":0.000019846795,"teacher_disagreement_score":0.96338165,"about_ca_system_score_codex":0.000032876054,"about_ca_system_score_gemma":0.0002764801,"threshold_uncertainty_score":0.77410245},"labels":[],"label_agreement":null},{"id":"W2485167870","doi":"10.1016/j.tcs.2016.07.039","title":"Dynamic range majority data structures","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","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":"University of Waterloo; Dalhousie University","funders":"","keywords":"Data structure; Amortized analysis; Combinatorics; Range (aeronautics); Mathematics; Set (abstract data type); Range query (database); Constant (computer programming); Space (punctuation); Upper and lower bounds; Fraction (chemistry); Discrete mathematics; Computer science; Information retrieval; Search engine; Web search query; Sargable","score_opus":0.017063029502736967,"score_gpt":0.2707024161268978,"score_spread":0.25363938662416086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485167870","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.0033029318,0.000023526734,0.98997223,0.003507378,0.0010286646,0.00013034689,0.000026105354,0.0002827759,0.0017260495],"genre_scores_gemma":[0.6804887,0.000010583212,0.31897303,0.0003903987,0.000086528824,0.0000018000001,0.0000035017617,0.000005276745,0.000040182444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971431,0.000074848846,0.00021620434,0.0011631583,0.0007937003,0.00060897885],"domain_scores_gemma":[0.9962425,0.00018104078,0.00005658116,0.0032082184,0.000083983774,0.00022766039],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015488251,0.00017986106,0.00016705229,0.00016174909,0.00031514425,0.00065717223,0.011292897,0.000033628665,0.00009076754],"category_scores_gemma":[0.00010093599,0.00010623733,0.0000323205,0.0008166511,0.0022937497,0.0030136164,0.008292439,0.00009986144,0.00021368117],"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.000001907564,0.0000152000985,0.00004284896,0.000002476391,0.0000027237445,0.00001075646,0.000020219635,8.0098084e-7,0.00017469587,0.7502822,0.00029316964,0.24915294],"study_design_scores_gemma":[0.00041452117,0.000089230576,0.0053461124,0.000024521945,0.000006355873,0.00002249903,0.0000016349474,0.48519507,0.00043159517,0.50611025,0.002024302,0.00033389067],"about_ca_topic_score_codex":0.0000027116744,"about_ca_topic_score_gemma":0.0000011820932,"teacher_disagreement_score":0.6771858,"about_ca_system_score_codex":0.000044542998,"about_ca_system_score_gemma":0.00006591332,"threshold_uncertainty_score":0.9997283},"labels":[],"label_agreement":null},{"id":"W2485262335","doi":"10.22215/etd/2009-06397","title":"A ubiquitous GIS: framework, services and algorithms, development","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science","score_opus":0.010983593163209513,"score_gpt":0.2541352670870325,"score_spread":0.24315167392382298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485262335","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.009887894,0.007261743,0.8003437,0.0015835669,0.0065828296,0.0018619519,0.000020917194,0.0025782157,0.1698792],"genre_scores_gemma":[0.0018537656,0.0007199905,0.9393991,0.0016199849,0.0003175996,0.00005737087,0.00113907,0.00003492391,0.054858163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813426,0.000021959198,0.00032436757,0.0007396438,0.00044185505,0.00033793587],"domain_scores_gemma":[0.9990497,0.000034263066,0.00016215656,0.0005734652,0.0000696856,0.00011072024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020509538,0.0003383682,0.00029470993,0.00023000708,0.00015539299,0.0008699893,0.0013410049,0.00022822156,0.000029426941],"category_scores_gemma":[0.000006197429,0.00030254317,0.00004068155,0.0002892922,0.000009103808,0.00074299297,0.0002531907,0.0002511815,0.00012205502],"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.0000027803446,0.00004559126,0.000010107013,0.00019621932,0.000048012775,0.000029209346,0.0011545947,4.610805e-7,0.0000032740788,0.013693632,0.0016988076,0.9831173],"study_design_scores_gemma":[0.0010198756,0.00033746372,0.0356949,0.0022892673,0.00014957372,0.000025871115,0.002738579,0.034129355,0.0026621511,0.051567815,0.86537844,0.0040066787],"about_ca_topic_score_codex":0.000055325298,"about_ca_topic_score_gemma":0.00026502967,"teacher_disagreement_score":0.97911066,"about_ca_system_score_codex":0.00002656151,"about_ca_system_score_gemma":0.00007121462,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W2485416360","doi":"10.4018/978-1-61692-868-1.ch001","title":"Region-Based Theories of Space","year":2012,"lang":"en","type":"book-chapter","venue":"Advances in geospatial technologies book series","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Mereology; Variety (cybernetics); Space (punctuation); Computer science; Domain (mathematical analysis); Field (mathematics); Simplicity; Focus (optics); Theoretical computer science; Epistemology; Mathematics; Artificial intelligence; Pure mathematics","score_opus":0.008732744848662068,"score_gpt":0.22078114838217794,"score_spread":0.21204840353351587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485416360","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.0000035159583,0.1109095,0.31713927,0.0035547593,0.0015480419,0.0009897354,0.00010151308,0.0027541146,0.56299955],"genre_scores_gemma":[0.019426195,0.2591351,0.2959321,0.00049301225,0.00042730826,0.00039103767,0.00023766623,0.00026589175,0.42369166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980557,0.000016091657,0.00049977406,0.000598026,0.00038415563,0.0004462779],"domain_scores_gemma":[0.9975578,0.00014686865,0.0005652733,0.00161333,0.00008957683,0.000027160939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017088006,0.00047790783,0.000616809,0.00047841162,0.00008505261,0.000067482535,0.002395996,0.00037517244,0.000030739728],"category_scores_gemma":[0.00010668348,0.00043626432,0.000122051824,0.00017206944,0.0010062613,0.0036935464,0.0013229813,0.000415607,0.0000262823],"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.000016296135,0.000014138,0.00006891222,0.00010858558,0.000014080673,0.000027207667,0.000037367103,0.000024745023,0.0000017808162,0.7710955,0.00021051132,0.22838084],"study_design_scores_gemma":[0.00015043415,0.00015849088,0.0000066434613,0.00025262535,0.000012945533,0.0000032475739,0.000082361345,0.00010460907,0.0014266061,0.37196216,0.6254389,0.00040095465],"about_ca_topic_score_codex":0.000011172723,"about_ca_topic_score_gemma":0.000097581564,"teacher_disagreement_score":0.6252284,"about_ca_system_score_codex":0.00006228768,"about_ca_system_score_gemma":0.000062417486,"threshold_uncertainty_score":0.9998089},"labels":[],"label_agreement":null},{"id":"W2489493656","doi":"10.1016/b978-008045374-3/50011-9","title":"A Data Warehouse Strategy for on-Demand Multiscale Mapping","year":2007,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Data Management and Algorithms","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":"Centre de Géomatique du Québec; Université Laval","funders":"","keywords":"Computer science; Cartographic generalization; Data warehouse; Generalization; Context (archaeology); Representation (politics); Abstraction; Architecture; Data science; Data mining; Database; Geography","score_opus":0.12828918378852253,"score_gpt":0.3107184563530914,"score_spread":0.1824292725645689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489493656","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":[4.946868e-7,0.00036382023,0.11374187,0.00008359146,0.00063407706,0.0010447052,0.0006202302,0.00023905176,0.8832722],"genre_scores_gemma":[0.00002165425,0.00006608412,0.044444207,0.000627532,0.00061312696,0.000031331314,0.0005106459,0.00007658494,0.9536088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972105,0.000015359696,0.0005094062,0.0012802996,0.00047058726,0.0005138625],"domain_scores_gemma":[0.9961766,0.00015273275,0.00027666983,0.0031709264,0.00006981097,0.00015325716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007881714,0.00049091136,0.00047605272,0.0003104764,0.00019203141,0.0004283194,0.003873651,0.00022391793,0.000031469317],"category_scores_gemma":[0.000018036504,0.0004578948,0.00015146784,0.000026335425,0.000080914964,0.0004131826,0.0018454917,0.00035976383,0.00025248874],"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.000005272459,0.0000127611665,2.863484e-7,0.00008959846,0.00008929174,0.00005928625,0.000052463198,0.0000037272687,9.1437596e-7,0.040170427,0.0043913443,0.9551246],"study_design_scores_gemma":[0.00046600035,0.000098181146,0.0000049570267,0.00030710382,0.00004007505,0.0000052223845,0.0000049414807,0.006404559,0.000006377945,0.011366389,0.98074496,0.0005512056],"about_ca_topic_score_codex":5.11371e-7,"about_ca_topic_score_gemma":0.000024726083,"teacher_disagreement_score":0.97635365,"about_ca_system_score_codex":0.00004735422,"about_ca_system_score_gemma":0.00006827728,"threshold_uncertainty_score":0.9997873},"labels":[],"label_agreement":null},{"id":"W2490017848","doi":"10.2495/dne-v11-n3-186-197","title":"Using entity identification and classification for automated integration of spatial-temporal data","year":2016,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Data Management and Algorithms","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":"Identification (biology); Computer science; Artificial intelligence; Data mining; Biology","score_opus":0.06151311774487913,"score_gpt":0.32932349161066005,"score_spread":0.26781037386578094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490017848","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.016123679,0.000099369034,0.98191476,0.0009451897,0.0007147614,0.000106713764,0.00007183491,0.000016182068,0.0000075175285],"genre_scores_gemma":[0.8459965,0.00019417053,0.15360166,0.000026073407,0.000092553964,7.791904e-7,0.00005980494,0.000004017172,0.000024459165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910986,0.000039427847,0.00037665738,0.00016990345,0.00024007769,0.00006407433],"domain_scores_gemma":[0.9986425,0.00011302785,0.00057322107,0.0002040202,0.00043771684,0.000029528523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078984554,0.000070195776,0.00010736538,0.00021878582,0.000035247678,0.00016574733,0.00073074864,0.00006921874,0.0000011398246],"category_scores_gemma":[0.0001770507,0.00005061226,0.000024756357,0.00007400541,0.000033572112,0.0018937504,0.00015602457,0.000073738964,3.1535438e-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.00022172216,0.0002117283,0.004855797,0.000049879436,0.00038705513,0.0000115898865,0.00021134256,0.00013716902,0.16116029,0.060436573,0.0021051022,0.77021176],"study_design_scores_gemma":[0.00047050245,0.000051104977,0.010805001,0.00007846192,0.000027171593,0.000027204167,0.000015284897,0.98104864,0.0010226293,0.006044205,0.00034268602,0.00006713124],"about_ca_topic_score_codex":0.000011214384,"about_ca_topic_score_gemma":0.0000191596,"teacher_disagreement_score":0.98091143,"about_ca_system_score_codex":0.00003922111,"about_ca_system_score_gemma":0.000044336517,"threshold_uncertainty_score":0.20639081},"labels":[],"label_agreement":null},{"id":"W2490635813","doi":"10.4018/987-1-59904-364-7.ch013","title":"Spatial Online Analytical Processing (SOLAP)","year":2007,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"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é Laval","funders":"","keywords":"Online analytical processing; Geospatial analysis; Computer science; Spatial analysis; Geographic coordinate system; Geolocation; Geographic information system; Point (geometry); Data mining; Quadtree; Component (thermodynamics); Geography; Cartography; Information retrieval; Data warehouse; World Wide Web; Remote sensing; Artificial intelligence; Mathematics","score_opus":0.038005467736327285,"score_gpt":0.2890434116484372,"score_spread":0.25103794391210993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490635813","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.0000032465823,0.00011125848,0.26413023,0.000099766614,0.00044063016,0.00016503883,0.0000861814,0.00025609107,0.73470753],"genre_scores_gemma":[0.025684768,0.00001781916,0.15304473,0.0056276973,0.005216455,0.000011190354,0.00021226007,0.00016795823,0.8100171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748945,0.000009022217,0.0004528362,0.0008167394,0.0007305967,0.00050136563],"domain_scores_gemma":[0.9985966,0.000017315164,0.00021639514,0.000841224,0.00011604936,0.00021241792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001990456,0.00044445114,0.00041795685,0.00014226258,0.00011636228,0.0004928103,0.0016391202,0.0002815719,0.00002995618],"category_scores_gemma":[0.000011825456,0.0004244474,0.00018090862,0.00004963888,0.00010937167,0.00024451836,0.0010348331,0.00035645225,0.0002551255],"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.0000044105564,0.000013253234,0.0000035675027,0.000020572234,0.000028488248,0.00018479458,0.000006924874,6.0513884e-7,1.9934416e-7,0.62830967,0.0014412513,0.36998627],"study_design_scores_gemma":[0.0008006234,0.00023194953,0.00014211496,0.0004654036,0.0001839329,0.00007725273,0.0000060440866,0.059656743,0.000008862819,0.38370326,0.5531821,0.0015417248],"about_ca_topic_score_codex":0.00006188732,"about_ca_topic_score_gemma":0.0001454281,"teacher_disagreement_score":0.5517408,"about_ca_system_score_codex":0.00016214757,"about_ca_system_score_gemma":0.0001611993,"threshold_uncertainty_score":0.9998207},"labels":[],"label_agreement":null},{"id":"W2493539536","doi":"10.4018/978-1-60960-521-6.ch012","title":"Cost Modeling and Range Estimation for Top-k Retrieval in Relational Databases","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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; Query optimization; Information retrieval; Relational database; Data mining; Range (aeronautics); Search engine indexing; Database; Sargable; Range query (database); Online aggregation; View; Query expansion; Relational database management system; Database design; Web search query; Search engine","score_opus":0.09564848466483881,"score_gpt":0.2883735946860542,"score_spread":0.1927251100212154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493539536","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.000019023151,0.00014870301,0.69026107,0.000039868657,0.00020829793,0.00046355661,0.00028181617,0.000056483786,0.30852118],"genre_scores_gemma":[0.041226625,0.000087094166,0.8820638,0.0010361138,0.0007415829,0.00011307631,0.00089455605,0.00009849855,0.073738635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988454,0.0000076269293,0.00027124226,0.0004634966,0.00022911394,0.00018311171],"domain_scores_gemma":[0.9993564,0.00003872063,0.00010984969,0.000382899,0.000054434306,0.000057723588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022788552,0.0001986884,0.00019920072,0.000096109856,0.0000677031,0.000112641384,0.00036046613,0.00009781036,0.0000058050264],"category_scores_gemma":[0.000029201547,0.0002074616,0.00004722981,0.000020310881,0.00003083998,0.00044679755,0.00036588404,0.000108652086,0.000017734657],"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.000022291137,0.0000040236846,0.000010824011,0.000026932725,0.0000122525935,0.000008140233,0.000026668946,0.00009977536,1.7522093e-7,0.9702674,0.00034671908,0.029174762],"study_design_scores_gemma":[0.0005407416,0.000032086067,0.000025766272,0.0001706363,0.000025090758,0.0000064829264,0.0000015445063,0.47746712,0.0000021424396,0.5123885,0.009067244,0.0002725899],"about_ca_topic_score_codex":0.00005268752,"about_ca_topic_score_gemma":0.000041243355,"teacher_disagreement_score":0.47736734,"about_ca_system_score_codex":0.00007218703,"about_ca_system_score_gemma":0.000054343975,"threshold_uncertainty_score":0.8460039},"labels":[],"label_agreement":null},{"id":"W2493714127","doi":"10.1109/icc.2016.7511323","title":"Efficient privacy-preserving circular range search on outsourced spatial data","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Encryption; Computer science; Range query (database); Information privacy; Security token; Database; Outsourcing; Security analysis; Tree (set theory); Web search query; Data mining; Information retrieval; Computer security; Web query classification; Search engine; Mathematics","score_opus":0.06408807659871574,"score_gpt":0.28283181650479217,"score_spread":0.21874373990607643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493714127","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.013325635,0.000012301112,0.97102,0.008997549,0.00030515387,0.00021895286,0.000022663702,0.0002331096,0.0058646286],"genre_scores_gemma":[0.97386724,0.0000099904655,0.020646041,0.0013360414,0.00018220377,0.000007823847,0.00003291273,0.000017928813,0.0038997962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980973,0.00007053517,0.00015692395,0.0007068642,0.00060301565,0.00036535526],"domain_scores_gemma":[0.9961331,0.00009892368,0.0000327136,0.0036035313,0.00003318873,0.000098533164],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000704091,0.0001240892,0.00011238556,0.00011880372,0.00010456006,0.00025585783,0.005883355,0.000023975346,0.00021168844],"category_scores_gemma":[0.000108691485,0.000076618795,0.0000319607,0.00021713467,0.000028354942,0.00041783854,0.007623352,0.00006717603,0.0008338947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026029464,0.00040998624,0.0019792984,0.00004662694,0.00009640891,0.00010133651,0.0004938127,0.0006010723,0.0025774913,0.025950758,0.10291643,0.86480075],"study_design_scores_gemma":[0.0010327642,0.00007204967,0.0039391187,0.00005287415,0.0000057672337,0.00000118157,0.000018218389,0.938952,0.0010758295,0.00022285871,0.054341294,0.00028599007],"about_ca_topic_score_codex":0.000116568626,"about_ca_topic_score_gemma":0.0000069781604,"teacher_disagreement_score":0.9605416,"about_ca_system_score_codex":0.000027833405,"about_ca_system_score_gemma":0.000020152936,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W2494146050","doi":"10.1007/978-3-319-23519-6_1625-1","title":"Clustering of Geospatial Big Data in a Distributed Environment","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of GIS","topic":"Data Management and Algorithms","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":"Computer Research Institute of Montréal","funders":"","keywords":"Geospatial analysis; Cluster analysis; Computer science; Big data; Data mining; Data science; Geography; Remote sensing; Artificial intelligence","score_opus":0.05438564057662813,"score_gpt":0.24324921505490563,"score_spread":0.1888635744782775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494146050","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.00003068909,0.000857435,0.56843257,0.00020098763,0.0013062491,0.00048308526,0.002577118,0.000047395344,0.42606446],"genre_scores_gemma":[0.0075673563,0.02385135,0.25297073,0.00013387903,0.0032672742,0.00006222896,0.020889064,0.0002773658,0.69098073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815285,0.000016911566,0.0005402752,0.0005560492,0.0005389415,0.00019498388],"domain_scores_gemma":[0.9974494,0.000040003815,0.00037473414,0.0020440775,0.000023622026,0.00006818999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040344326,0.00023107599,0.00042077608,0.00018685425,0.000013647512,0.000022115073,0.002598745,0.00011481348,0.00007416087],"category_scores_gemma":[0.00003106985,0.00023221472,0.000049193524,0.000057524678,0.00007402791,0.0003555854,0.0043459935,0.00017259626,0.000040083418],"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.00002246479,0.000167525,0.00029993986,0.00028867007,0.00014109959,0.00014015248,0.0004327632,0.00030741649,0.000005171554,0.014607198,0.028837703,0.9547499],"study_design_scores_gemma":[0.0004910179,0.00009758873,0.0005498992,0.00017850283,0.00003688602,0.0000014355653,0.000006744044,0.016041346,0.0000035330568,0.0033363574,0.97890663,0.00035007994],"about_ca_topic_score_codex":0.00017655117,"about_ca_topic_score_gemma":0.00011822371,"teacher_disagreement_score":0.9543998,"about_ca_system_score_codex":0.000051110495,"about_ca_system_score_gemma":0.0000702695,"threshold_uncertainty_score":0.9469442},"labels":[],"label_agreement":null},{"id":"W2496331279","doi":"10.1016/j.pmcj.2016.06.019","title":"Automatic rule generation using crowdsourcing for better relationship type discovery","year":2016,"lang":"en","type":"article","venue":"Pervasive and Mobile Computing","topic":"Data Management and Algorithms","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; Crowdsourcing; Correctness; Data mining; Key (lock); Task (project management); Set (abstract data type); Popularity; Context (archaeology); Data science; Knowledge extraction; Focus (optics); Information retrieval; Machine learning; World Wide Web","score_opus":0.05281647897310366,"score_gpt":0.28722876865682234,"score_spread":0.2344122896837187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496331279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47663274,0.000066909,0.5227714,0.00013165995,0.00019269635,0.0001410303,0.000002058606,0.000043448166,0.000018075569],"genre_scores_gemma":[0.8865006,0.0000064163182,0.112807505,0.0001929653,0.00031907027,0.00000999647,0.000009529952,0.000008908285,0.0001450077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992189,0.000031948366,0.00017104478,0.00029370785,0.000092814436,0.00019162256],"domain_scores_gemma":[0.9993788,0.00022584965,0.00008439669,0.0002184023,0.00005840051,0.000034130553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025547584,0.00009685125,0.00010456766,0.00006977835,0.00030333747,0.0003249722,0.00019669082,0.000027249205,0.0000032011415],"category_scores_gemma":[0.00007502099,0.00007205231,0.000034760924,0.00012215089,0.000022261374,0.0010618832,0.00024151716,0.00003306149,0.0000064652068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002854968,0.00004226823,0.02554666,0.00010728968,0.000046063287,0.000005830818,0.0011767725,0.0007222933,0.019017125,0.008784048,0.0011594683,0.9433893],"study_design_scores_gemma":[0.00035969733,0.000055470693,0.005462181,0.000098685574,0.000017359735,0.000006458543,0.000039722934,0.99037695,0.0011576248,0.0011265576,0.0011160716,0.00018323006],"about_ca_topic_score_codex":0.000006477553,"about_ca_topic_score_gemma":0.0000010659215,"teacher_disagreement_score":0.98965466,"about_ca_system_score_codex":0.00002789463,"about_ca_system_score_gemma":0.000019409308,"threshold_uncertainty_score":0.31337145},"labels":[],"label_agreement":null},{"id":"W2497658231","doi":"","title":"Finding interesting summaries in genspace graphs","year":2005,"lang":"en","type":"dissertation","venue":"oURspace (University of Regina)","topic":"Data Management and Algorithms","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":"University of Regina","funders":"","keywords":"Computer science; Information retrieval; Online analytical processing; Data mining; Consistency (knowledge bases); Graph; Process (computing); Probability distribution; Set (abstract data type); Data science; Theoretical computer science; Artificial intelligence; Data warehouse; Statistics; Mathematics","score_opus":0.016965238637129173,"score_gpt":0.2275960922733133,"score_spread":0.2106308536361841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497658231","genre_codex":"commentary","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.25229874,0.0013244987,0.048473034,0.66525596,0.00215441,0.0008019599,0.000046755024,0.00050674466,0.029137895],"genre_scores_gemma":[0.023216672,0.0014645936,0.15719327,0.0000539734,0.00011976228,0.0000010040535,0.0007237855,0.000052572945,0.8171744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998944,0.00004297259,0.000019621893,0.00043971412,0.0002694427,0.00028429317],"domain_scores_gemma":[0.9990529,0.00005015281,0.00030307364,0.00046961592,0.000067448695,0.000056804893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021437708,0.00019233866,0.00028999703,0.000689186,0.0001379816,0.00009405624,0.0013800872,0.00013739275,0.000004104393],"category_scores_gemma":[0.000028131739,0.0002630322,0.00010501123,0.00065948593,0.000052567466,0.0010583778,0.00028617997,0.000272616,0.00002352859],"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.00006327708,0.000073956704,0.0038656946,0.00057563215,0.00015458881,0.0005582284,0.0072690737,0.00016734327,0.00014066872,0.17523904,0.6482067,0.1636858],"study_design_scores_gemma":[0.0006365964,0.00006997869,0.0066594477,0.0008291356,0.0000552832,0.00000318388,0.020765493,0.00757355,0.00006244119,0.0001640419,0.962606,0.0005748086],"about_ca_topic_score_codex":0.000047244896,"about_ca_topic_score_gemma":0.0061995746,"teacher_disagreement_score":0.78803647,"about_ca_system_score_codex":0.00007777871,"about_ca_system_score_gemma":0.00006810996,"threshold_uncertainty_score":0.9999822},"labels":[],"label_agreement":null},{"id":"W2498735781","doi":"10.1109/mdm.2016.44","title":"K-Closest Pairs Queries in Road Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree traversal; Search engine indexing; Traverse; Pruning; Computer science; Tree (set theory); Metric (unit); Metric space; Breadth-first search; Theoretical computer science; Euclidean space; Algorithm; Mathematics; Combinatorics; Artificial intelligence; Discrete mathematics","score_opus":0.010795592138850882,"score_gpt":0.21231468774939252,"score_spread":0.20151909561054165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2498735781","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.00138161,0.00004037241,0.96790737,0.0031504212,0.00031154853,0.000064602624,6.0509456e-7,0.0001678826,0.026975589],"genre_scores_gemma":[0.93959594,0.00014540412,0.038953096,0.0009216315,0.00014821129,0.00001831727,0.0000027234757,0.000008040232,0.020206664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993943,0.000018347831,0.000101419304,0.00020401845,0.00009155831,0.00019033506],"domain_scores_gemma":[0.99955565,0.000028057862,0.000018883118,0.00035646633,0.000008951294,0.000031968542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016454743,0.00006280396,0.0000635813,0.00005519651,0.000023737237,0.000099723686,0.0005914116,0.000018644036,0.00007633669],"category_scores_gemma":[0.000011182215,0.00003721598,0.000017371975,0.00019846982,0.000024298322,0.0009823571,0.00033564251,0.0000263758,0.00014195617],"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.0000010136843,0.000022295966,0.004145781,0.0000014012318,0.0000034081343,0.00001832563,0.000025346046,0.000013116947,0.000010204533,0.16695888,0.012334117,0.8164661],"study_design_scores_gemma":[0.0022924715,0.00022818046,0.22558236,0.00016452307,0.0000062863573,0.0000082362885,0.00011632667,0.29376906,0.00060955464,0.021587359,0.4544353,0.001200365],"about_ca_topic_score_codex":0.000076144235,"about_ca_topic_score_gemma":0.00011054207,"teacher_disagreement_score":0.9382143,"about_ca_system_score_codex":0.000012368034,"about_ca_system_score_gemma":0.000006793928,"threshold_uncertainty_score":0.18246067},"labels":[],"label_agreement":null},{"id":"W2499221028","doi":"10.1090/gsm/089/04","title":"Models for the web graph","year":2008,"lang":"en","type":"book-chapter","venue":"Graduate studies in mathematics","topic":"Data Management and Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Graph; World Wide Web; Theoretical computer science","score_opus":0.2552848852701486,"score_gpt":0.32188076662289694,"score_spread":0.06659588135274835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499221028","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.0000022622316,0.009941916,0.60304666,0.0025555948,0.0020705722,0.0021512443,0.00010621739,0.00027710243,0.37984845],"genre_scores_gemma":[0.00023407835,0.12378056,0.30650622,0.00041566012,0.0004286434,0.00038025633,0.0000292084,0.00011961129,0.56810576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983013,0.000009078424,0.000492954,0.0004241313,0.00045385523,0.00031864387],"domain_scores_gemma":[0.9978285,0.0006335874,0.0002649221,0.0011111624,0.00013483231,0.000027010017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052818685,0.0003745304,0.0005381722,0.00019395308,0.00025384544,0.000085900916,0.001696823,0.00007554836,0.0000020237458],"category_scores_gemma":[0.000056848214,0.00024784033,0.00020760272,0.00010090287,0.00028166905,0.00026524602,0.0011384167,0.0002399775,0.0000376194],"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":[9.037149e-7,0.000022336948,7.7592176e-8,0.00027679178,0.0002885696,0.000021949805,0.0022903527,0.00014192045,4.6148365e-8,0.865052,0.12325458,0.008650491],"study_design_scores_gemma":[0.00020633539,0.000028437076,2.3917252e-7,0.0002312961,0.000058779115,0.0000075748317,0.00015275004,0.14098813,6.3046025e-7,0.7914574,0.066584505,0.00028392556],"about_ca_topic_score_codex":8.247326e-7,"about_ca_topic_score_gemma":0.000009336054,"teacher_disagreement_score":0.2965404,"about_ca_system_score_codex":0.00004432421,"about_ca_system_score_gemma":0.000025110216,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W2499909973","doi":"10.1017/cbo9780511736261.011","title":"A surprising problem in navigation","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Data Management and Algorithms","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":"McGill University","funders":"","keywords":"Snapshot (computer storage); Excursion; Computer science; Narrative; Mobile robot navigation; Artificial intelligence; Global Positioning System; Computer vision; Geography; Mobile robot; Robot; Art; Telecommunications; Robot control; Political science; Literature","score_opus":0.027710675546539287,"score_gpt":0.1928511416435746,"score_spread":0.1651404660970353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499909973","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.000018245826,0.00003684225,0.04899687,0.0000092751825,0.00016611272,0.00033086404,0.00003053354,0.00015922857,0.95025206],"genre_scores_gemma":[0.00032192768,0.00003785387,0.0054549864,0.000027256983,0.000040262315,5.6521475e-7,0.00005955588,0.000018349336,0.99403924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987837,0.000027022166,0.00016933607,0.0005577175,0.00021977615,0.00024241155],"domain_scores_gemma":[0.9989895,0.000019980862,0.0001800888,0.00066989084,0.00006299007,0.00007752507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016068923,0.00024478682,0.00023646401,0.00027740255,0.00008554691,0.0001191669,0.0012997814,0.00016660067,0.000001526275],"category_scores_gemma":[0.0000015540771,0.00030113207,0.000085945125,0.000018680108,0.00007153814,0.0005398612,0.0011001099,0.00031356336,0.000026433114],"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.0000066044618,0.000007351202,0.0000018114783,0.00004948128,0.000024434155,0.0004343633,0.0000880979,8.9551605e-7,0.0000037789418,0.97695726,0.0050870255,0.017338878],"study_design_scores_gemma":[0.00039893916,0.000031384618,0.000024073895,0.00034435393,0.000034060453,0.000007889071,0.0000064993155,0.00065169163,0.00007805587,0.0004095203,0.99756813,0.00044538593],"about_ca_topic_score_codex":0.00033947683,"about_ca_topic_score_gemma":0.0000035435462,"teacher_disagreement_score":0.9924811,"about_ca_system_score_codex":0.00013098597,"about_ca_system_score_gemma":0.000050076476,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W2500302690","doi":"10.4018/978-1-61520-883-8.ch019","title":"Geo-Aware Digital Cultural Heritage","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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":"Cultural heritage; Interpretation (philosophy); Object (grammar); Dimension (graph theory); Museology; Visual arts; Geography; World Wide Web; Media studies; Sociology; Computer science; Art; Archaeology","score_opus":0.015813207507177563,"score_gpt":0.23150436444890482,"score_spread":0.21569115694172725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500302690","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.000018249257,0.00007621732,0.01070953,0.00012776112,0.0014456827,0.000272005,0.00045756003,0.0004966636,0.9863963],"genre_scores_gemma":[0.02763725,0.0000076129622,0.009855384,0.0010481937,0.0012191882,0.000018902645,0.0001422689,0.00006804,0.96000314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789745,0.000005207247,0.00031584644,0.00079206727,0.0005396418,0.0004497878],"domain_scores_gemma":[0.9983087,0.000013363631,0.00018114706,0.0011990787,0.00009927828,0.00019842849],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006485971,0.0005022013,0.00036383473,0.000054643846,0.00014612067,0.0017128217,0.002301298,0.0003410005,0.000046313333],"category_scores_gemma":[0.000007966653,0.00044561783,0.0002462492,0.00002488971,0.00013136277,0.00083155214,0.0015932446,0.00045876007,0.00126467],"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.0000021100986,0.0000064975234,0.0000034898742,0.000015337773,0.00004730146,0.0001950034,0.000022950546,1.2585711e-7,0.0000031733987,0.93758225,0.006762445,0.055359326],"study_design_scores_gemma":[0.00027203694,0.00006484936,0.000019580446,0.00008113031,0.000026567683,0.00005672244,0.000008360855,0.00019633608,0.000014622807,0.2830146,0.7154817,0.0007634749],"about_ca_topic_score_codex":0.000019378243,"about_ca_topic_score_gemma":0.000031045638,"teacher_disagreement_score":0.70871925,"about_ca_system_score_codex":0.00008501888,"about_ca_system_score_gemma":0.0000688941,"threshold_uncertainty_score":0.99979955},"labels":[],"label_agreement":null},{"id":"W2500435251","doi":"10.1017/cbo9781316091548.016","title":"Dual graphs and cluster algebras","year":2016,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Data Management and Algorithms","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":"Perimeter Institute","funders":"","keywords":"ENCODE; Dual (grammatical number); Simple (philosophy); Computer science; Planar; Cluster (spacecraft); Shell (structure); Square (algebra); Section (typography); Dual graph; Planar graph; Combinatorics; Topology (electrical circuits); Theoretical computer science; Mathematics; Engineering; Geometry; Computer graphics (images); Computer network; Graph; Chemistry; Epistemology; Philosophy; Linguistics; Mechanical engineering","score_opus":0.01594348044719709,"score_gpt":0.18424682413851579,"score_spread":0.1683033436913187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500435251","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.000020309273,0.00009012795,0.022323456,0.00010408193,0.00034651533,0.00026348906,0.00014680727,0.00023665836,0.97646856],"genre_scores_gemma":[0.00010867716,0.00014675118,0.0010993923,0.00018259732,0.000075824675,3.9963106e-7,0.000018339066,0.000021585687,0.99834645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985976,0.000026045109,0.00013472793,0.0006954788,0.00026448205,0.00028164667],"domain_scores_gemma":[0.998748,0.000055457756,0.00014341869,0.00082413765,0.00006533311,0.00016366054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011288037,0.00032092375,0.0002705218,0.0002488326,0.00016956018,0.00018644208,0.001018549,0.00018379644,0.000003231953],"category_scores_gemma":[0.000003069875,0.00030895468,0.00011457973,0.000009087154,0.00021651041,0.00050297444,0.0023028562,0.00020747869,0.000036783636],"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.000008393384,0.000003018101,8.5794704e-7,0.00002615173,0.00007839187,0.00022667741,0.000015282167,3.1816384e-8,0.000003290413,0.9237162,0.0571814,0.018740345],"study_design_scores_gemma":[0.0006087083,0.00004005505,0.000016878714,0.000098946424,0.00007132511,0.000017094178,0.0000031880602,0.00017275441,0.000029319697,0.0006669949,0.9978248,0.00044992176],"about_ca_topic_score_codex":0.000014356805,"about_ca_topic_score_gemma":8.206711e-7,"teacher_disagreement_score":0.9406434,"about_ca_system_score_codex":0.00004575411,"about_ca_system_score_gemma":0.000031384294,"threshold_uncertainty_score":0.9999363},"labels":[],"label_agreement":null},{"id":"W2501089572","doi":"10.4018/978-1-59140-384-5.ch009","title":"An Object-Oriented Approach to Managing Fuzziness in Spatially Explicit Models Coupled to a Geographic Database","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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 Windsor; University of Toronto","funders":"","keywords":"Computer science; Data mining; Fuzzy logic; Database; Spatial database; Schema (genetic algorithms); Component (thermodynamics); Geographic information system; Spatial analysis; Information retrieval; Artificial intelligence; Geography; Cartography","score_opus":0.022896336254403012,"score_gpt":0.24664870596226046,"score_spread":0.22375236970785745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501089572","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.0001187059,0.000039438008,0.533285,0.000092604874,0.00028145456,0.0010502591,0.00018530808,0.00028098957,0.46466625],"genre_scores_gemma":[0.20619884,0.00005080353,0.71668154,0.012613412,0.002063421,0.0010604378,0.001101487,0.0004093451,0.059820734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956466,0.00003619133,0.00065973046,0.0018795579,0.00093998143,0.00083797233],"domain_scores_gemma":[0.99661976,0.000016669665,0.00018477406,0.0025193316,0.00013442429,0.0005250641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044447128,0.00074495794,0.00069317623,0.00080104615,0.00012925308,0.0005928972,0.003219818,0.00019540443,0.000006700419],"category_scores_gemma":[0.000007741584,0.00080148637,0.00014813844,0.00030465605,0.000036000867,0.0009333649,0.0019956145,0.0003292051,0.00011624861],"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.00003474516,0.00007868661,0.0000075828575,0.000043486158,0.000048842754,0.00012193695,0.00019039055,0.003371758,0.000008745162,0.96572244,0.00037870705,0.029992705],"study_design_scores_gemma":[0.0017978454,0.00036648518,0.0001196025,0.00073862396,0.00010984511,0.000031997173,0.000057912992,0.84488934,0.000011194914,0.12331008,0.02561999,0.0029470972],"about_ca_topic_score_codex":0.0009276809,"about_ca_topic_score_gemma":0.00092504965,"teacher_disagreement_score":0.84241235,"about_ca_system_score_codex":0.00021716232,"about_ca_system_score_gemma":0.000111340654,"threshold_uncertainty_score":0.9994436},"labels":[],"label_agreement":null},{"id":"W2502885977","doi":"10.4018/978-1-59140-527-6.ch009","title":"Imprecise and Uncertain Engineering Information Modeling in Databases","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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é de Sherbrooke","funders":"","keywords":"IDEF1X; Computer science; Conceptual schema; Database schema; Database; Information engineering; Logical data model; Database model; Database design; Relational database; Data modeling; Entity–relationship model; Relational model; Schema (genetic algorithms); Information system; Data mining; Software engineering; Information retrieval; Engineering","score_opus":0.038241232157997504,"score_gpt":0.2293924445582798,"score_spread":0.19115121240028232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502885977","genre_codex":"other","genre_gemma":"methods","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.000036030477,0.0001443758,0.40907237,0.000011504803,0.000245284,0.0001959767,0.000093566305,0.00012280208,0.5900781],"genre_scores_gemma":[0.33883345,0.00071877625,0.5939825,0.0031370693,0.0013095987,0.00022622016,0.0008162099,0.0002364511,0.060739696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990592,0.0000036768045,0.0002794667,0.00026286353,0.00018881749,0.00020594968],"domain_scores_gemma":[0.9993528,0.000010237656,0.00008010454,0.0004611073,0.00002853156,0.000067187866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013166602,0.00022481191,0.00019024704,0.00014725258,0.000028748887,0.00019059832,0.00052139215,0.000076233846,0.0000035577218],"category_scores_gemma":[0.000010137505,0.00023088593,0.000033546206,0.000022260829,0.000013005221,0.001063434,0.0007276406,0.00013678306,0.000036860736],"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.0000022516144,0.0000014329918,0.0000020956372,0.000032070962,0.00000969132,0.000014305923,0.000052920535,0.0002675667,3.1042268e-7,0.913429,0.00011648105,0.08607185],"study_design_scores_gemma":[0.00038922214,0.00003241506,0.000011339839,0.00038327245,0.000020537882,0.000015175205,0.00000659427,0.8209325,0.000005224191,0.14470083,0.03289653,0.0006063333],"about_ca_topic_score_codex":0.0002291696,"about_ca_topic_score_gemma":0.000034087952,"teacher_disagreement_score":0.82066494,"about_ca_system_score_codex":0.000064729575,"about_ca_system_score_gemma":0.000034108307,"threshold_uncertainty_score":0.94152546},"labels":[],"label_agreement":null},{"id":"W2504311311","doi":"10.4018/978-1-60566-242-8.ch074","title":"Index and Materialized View Selection in Data Warehouses","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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":"Université du Québec à Montréal","funders":"","keywords":"Materialized view; Data warehouse; Heuristics; Selection (genetic algorithm); Computer science; Index (typography); Focus (optics); Data mining; State (computer science); Information retrieval; Data science; World Wide Web; View; Artificial intelligence; Algorithm; Database design","score_opus":0.03430870571903638,"score_gpt":0.2659318365498237,"score_spread":0.23162313083078734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504311311","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.00003287288,0.0005850743,0.014679734,0.00020426506,0.0005917403,0.0005312222,0.00022181256,0.00037498938,0.9827783],"genre_scores_gemma":[0.093867436,0.0019413262,0.12808353,0.012400559,0.0037790714,0.00010467126,0.000884526,0.00038309587,0.75855577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841255,0.000021032845,0.00029813594,0.00075260614,0.0002677213,0.00024793576],"domain_scores_gemma":[0.9989563,0.000008877897,0.00013523483,0.0008083325,0.000024262119,0.000066951805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018660288,0.00028972834,0.00034295503,0.000105765364,0.000053128573,0.00051864237,0.0014569167,0.00016104436,0.0000128869015],"category_scores_gemma":[0.0000065196377,0.0002844532,0.000028316323,0.000037662354,0.000036392797,0.00044174274,0.0013672436,0.00013225232,0.00004751432],"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.000008892906,0.0000065060017,0.000011704229,0.00003047237,0.000020732448,0.000047986898,0.000009426979,4.6483402e-7,0.000002411951,0.74569285,0.0027434898,0.2514251],"study_design_scores_gemma":[0.0008798825,0.0000846013,0.00042918805,0.00037682793,0.000041645068,0.000052193725,0.0000015515253,0.0027209807,0.000007836788,0.36436194,0.6303336,0.0007097155],"about_ca_topic_score_codex":0.00011760135,"about_ca_topic_score_gemma":0.00026128563,"teacher_disagreement_score":0.6275901,"about_ca_system_score_codex":0.00007613266,"about_ca_system_score_gemma":0.00006180127,"threshold_uncertainty_score":0.9999608},"labels":[],"label_agreement":null},{"id":"W2504924293","doi":"10.4018/978-1-60566-242-8.ch027","title":"The Linkcell Construct and Location-Aware Query Processing for Location-Referent Transactions in Mobile Business","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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":"","keywords":"Computer science; Variety (cybernetics); Mobile commerce; Transactional leadership; Business; World Wide Web; Management","score_opus":0.01752619576803014,"score_gpt":0.24717807600745698,"score_spread":0.22965188023942684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504924293","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.000011805834,0.0022146357,0.81696415,0.00037352435,0.00047534303,0.0013927285,0.0000840964,0.00015040238,0.17833331],"genre_scores_gemma":[0.6411407,0.0010416018,0.0553057,0.0023183103,0.0014030955,0.0016409417,0.00030938958,0.00020822043,0.29663202],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986747,0.000011001076,0.00035433294,0.00048977445,0.00022265167,0.00024753794],"domain_scores_gemma":[0.99883986,0.000054607637,0.0001768717,0.00045813547,0.0004089755,0.00006156049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014568334,0.00027025174,0.00022789519,0.00007872265,0.00029245115,0.00054098247,0.00063712074,0.00014483691,0.0000020094076],"category_scores_gemma":[0.0000072507996,0.00022370614,0.00004038855,0.0001115244,0.00011873941,0.0002581551,0.00006361707,0.00015229722,0.000007279511],"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.000004863399,0.000008734506,0.0000015912808,0.00008650688,0.000012331148,0.0000021726084,0.00003846777,0.00010559289,2.7135937e-7,0.35273823,0.00012561354,0.6468756],"study_design_scores_gemma":[0.001994725,0.00022445747,0.00045160236,0.0018841814,0.00019039678,0.00006227263,0.00017539077,0.058914322,0.00003788383,0.56370336,0.37063763,0.00172377],"about_ca_topic_score_codex":0.000038036793,"about_ca_topic_score_gemma":0.00032834438,"teacher_disagreement_score":0.76165843,"about_ca_system_score_codex":0.000113667316,"about_ca_system_score_gemma":0.0003686105,"threshold_uncertainty_score":0.9122472},"labels":[],"label_agreement":null},{"id":"W2505904285","doi":"10.4018/978-1-60566-748-5.ch001","title":"The LBF R-Tree","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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; Data warehouse; Tree (set theory); Trie; Search engine indexing; Data mining; Block (permutation group theory); Terabyte; Construct (python library); R-tree; Data structure; Theoretical computer science; Database; Information retrieval; Mathematics; Spatial database; Spatial analysis; Statistics","score_opus":0.014247343075986806,"score_gpt":0.22819293482676417,"score_spread":0.21394559175077738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505904285","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":[9.034503e-7,0.00018683083,0.013378611,0.00046204432,0.0020627845,0.00022500241,0.000041327803,0.00023982536,0.98340267],"genre_scores_gemma":[0.00090955483,0.000021950216,0.011850405,0.0011262677,0.00084403984,0.00001634498,0.000007430259,0.000033148644,0.98519087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983753,0.000009645377,0.00024760838,0.00052481313,0.0004791289,0.00036350585],"domain_scores_gemma":[0.9979552,0.000042106807,0.00016525127,0.0016641233,0.00006200543,0.00011131652],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020258105,0.00031907542,0.00020926479,0.000033498214,0.00030561868,0.0008220196,0.0032024283,0.00021525085,0.000014245052],"category_scores_gemma":[0.00001055048,0.00022613241,0.0001613906,0.000018348146,0.00014496957,0.00014877367,0.0014462445,0.0003990783,0.0009843335],"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.0000012095944,0.000001717278,5.646127e-7,0.0000030826216,0.000029112123,0.000035235236,0.0000056841286,3.7844128e-8,0.0000017594136,0.7985824,0.010162214,0.191177],"study_design_scores_gemma":[0.00006881509,0.00001735346,0.000007816509,0.00001560882,0.000011633308,0.000007292405,6.441631e-7,0.00008075913,0.00000919481,0.44677353,0.552832,0.00017533911],"about_ca_topic_score_codex":0.00002071024,"about_ca_topic_score_gemma":0.00020404089,"teacher_disagreement_score":0.54266983,"about_ca_system_score_codex":0.000049481998,"about_ca_system_score_gemma":0.000078244506,"threshold_uncertainty_score":0.9997935},"labels":[],"label_agreement":null},{"id":"W2509540125","doi":"","title":"Machine learning methods and models for ranking","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Ranking (information retrieval); Computer science; Machine learning; Inference; Artificial intelligence; Field (mathematics); Domain (mathematical analysis); Learning to rank; Variety (cybernetics); Data science; Information retrieval","score_opus":0.03379766816942833,"score_gpt":0.33873471763750324,"score_spread":0.3049370494680749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509540125","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.000048584185,0.0006051503,0.9743013,0.000055749624,0.0003927272,0.00030252582,0.0000018737898,0.00013492836,0.02415717],"genre_scores_gemma":[0.00035357242,0.00016903224,0.8983466,0.00006815059,0.000046426892,0.00006517338,0.0004955815,0.000015080699,0.100440405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991615,0.000041627856,0.0001485915,0.00037465035,0.000109971355,0.0001636523],"domain_scores_gemma":[0.9994992,0.000101945785,0.000094291725,0.00022064525,0.000049612794,0.00003432962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045442578,0.00014702835,0.00017770016,0.00012673116,0.00012486344,0.00047767637,0.00048990996,0.00006858431,0.000022132823],"category_scores_gemma":[0.000024729368,0.00012426844,0.000045015055,0.00009214138,0.0000046406326,0.00090868183,0.00013096604,0.00012464263,0.000006432218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020074915,0.0000049259797,0.0000015262647,0.00008877436,0.00002565564,3.6048044e-7,0.000251977,0.00009174286,0.000048242295,0.16006371,0.0005661987,0.8388549],"study_design_scores_gemma":[0.00016360136,0.000022712185,0.000012726207,0.000021761638,0.000016409722,3.5319786e-7,0.00005410163,0.9507492,0.00019901758,0.033762127,0.014828503,0.00016948713],"about_ca_topic_score_codex":0.00007249596,"about_ca_topic_score_gemma":0.000011380421,"teacher_disagreement_score":0.9506575,"about_ca_system_score_codex":0.000006096408,"about_ca_system_score_gemma":0.000009967047,"threshold_uncertainty_score":0.50675195},"labels":[],"label_agreement":null},{"id":"W2517620127","doi":"10.1145/2970398.2970434","title":"Rank-at-a-Time Query Processing","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Ranking (information retrieval); Latency (audio); Rank (graph theory); Information retrieval; Learning to rank; Online aggregation; Query optimization; Query expansion; Sargable; Search engine; Web search query; Theoretical computer science; Data mining; Mathematics","score_opus":0.009759955401003408,"score_gpt":0.21230576778370722,"score_spread":0.2025458123827038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517620127","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.0009364483,0.000032489108,0.9134263,0.0044342447,0.00012083289,0.00006316049,0.0000011133734,0.0003605802,0.08062483],"genre_scores_gemma":[0.18499894,0.000031930173,0.21884198,0.0023512964,0.00029237565,0.000019370733,0.000005576205,0.000020820626,0.5934377],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993502,0.000010798165,0.00008639842,0.00023296497,0.00014536828,0.00017429664],"domain_scores_gemma":[0.99956226,0.000021495858,0.000027347189,0.00032894025,0.000018760164,0.000041163763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014446152,0.00006359413,0.000060274808,0.000046707864,0.00007136735,0.00013193356,0.0006348593,0.0000145301865,0.00028123835],"category_scores_gemma":[0.00000971639,0.000035598103,0.000021149426,0.00013670811,0.00002035992,0.0012308343,0.0005029874,0.00001425453,0.002384337],"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.0000012836115,0.000016535107,0.00012041967,0.0000052748233,0.0000043904056,0.000008395443,0.000027383401,1.6564023e-7,0.0022325595,0.015754407,0.038706284,0.9431229],"study_design_scores_gemma":[0.0021532774,0.00011490338,0.004146084,0.00015975567,0.000014716422,0.000023303039,0.000013885237,0.08068246,0.022974571,0.017177343,0.87149876,0.0010409465],"about_ca_topic_score_codex":0.0000031514503,"about_ca_topic_score_gemma":0.000001258583,"teacher_disagreement_score":0.9420819,"about_ca_system_score_codex":0.000018512897,"about_ca_system_score_gemma":0.00001202003,"threshold_uncertainty_score":0.9983924},"labels":[],"label_agreement":null},{"id":"W2519264255","doi":"10.1145/2938503.2938549","title":"The Hilbert PDC-tree","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University; Carleton University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tree (set theory); Search engine indexing; Overhead (engineering); Hilbert curve; Algorithm; Tree structure; R-tree; Rectangle; Theoretical computer science; Mathematics; Binary tree; Combinatorics; Artificial intelligence; Spatial database; Statistics; Geometry","score_opus":0.01042858524661519,"score_gpt":0.21183685763417232,"score_spread":0.20140827238755712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519264255","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.00008750775,0.000023889126,0.78890455,0.02735247,0.00037210743,0.000043697844,4.0785486e-7,0.00012552398,0.18308985],"genre_scores_gemma":[0.1409582,0.00025336642,0.06568334,0.0030638622,0.00036941623,0.000025536836,0.0000013672299,0.000011872903,0.78963304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995558,0.000010184859,0.00005577581,0.00012955448,0.00011207206,0.00013659097],"domain_scores_gemma":[0.9993602,0.000082637416,0.000013581769,0.00050746865,0.000011462692,0.000024671937],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014756226,0.000038652226,0.00002600405,0.000013308503,0.00009331112,0.00017248429,0.0010628615,0.00000697468,0.00003645847],"category_scores_gemma":[0.000014709121,0.000014504729,0.00001783362,0.0000840394,0.000023227401,0.00048932683,0.00041175447,0.000012870157,0.0009249968],"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":[1.5894518e-7,0.0000025792167,0.000055893677,1.4201751e-7,0.0000023528949,9.0827314e-7,0.0000036610274,1.03506785e-8,0.000026199637,0.35652494,0.06206328,0.58131987],"study_design_scores_gemma":[0.00011568134,0.0000124371745,0.0016485718,0.0000026446403,7.969299e-7,7.8092455e-7,0.0000034410732,0.001438094,0.00044234525,0.014181423,0.9820942,0.000059544967],"about_ca_topic_score_codex":0.0000073664246,"about_ca_topic_score_gemma":0.000023569404,"teacher_disagreement_score":0.92003095,"about_ca_system_score_codex":0.000005617975,"about_ca_system_score_gemma":0.000005051978,"threshold_uncertainty_score":0.9998529},"labels":[],"label_agreement":null},{"id":"W2520788569","doi":"10.1007/978-3-319-45817-5_7","title":"Spica: A Path Bundling Model for Rational Route Recommendation","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science; Heuristic; Rationality; Path (computing); Set (abstract data type); Graph; Artificial intelligence; Operations research; Simulation; Theoretical computer science; Computer network","score_opus":0.032704783676984726,"score_gpt":0.262412621856328,"score_spread":0.2297078381793433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520788569","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.0000018142467,0.00003585883,0.9913135,0.0036701178,0.001451143,0.00052533695,0.00006120691,0.00013003983,0.0028109932],"genre_scores_gemma":[0.0076511335,0.000026324358,0.98735064,0.0017343557,0.00074576965,0.000034728244,0.000078701036,0.000027991551,0.0023503269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714404,0.000013509706,0.00043971217,0.0013314708,0.00056329166,0.0005079595],"domain_scores_gemma":[0.99830085,0.00026898124,0.00027358232,0.0008410599,0.00021290322,0.00010262244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903428,0.00037233258,0.00031869567,0.00052679336,0.00028913817,0.00071462133,0.0024345545,0.00015876425,0.000016567197],"category_scores_gemma":[0.000067114044,0.00030782662,0.00011500531,0.00023579045,0.00019186095,0.0015762363,0.0011800025,0.00025829207,0.000029745719],"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.0000037208813,0.000014226937,0.000004397672,0.000017904236,0.000008247989,0.0000034689053,0.00012469612,0.01083928,0.000030069825,0.1558698,0.00011649419,0.8329677],"study_design_scores_gemma":[0.0002326224,0.000050103263,0.0000046663026,0.00011468771,0.000004632408,0.0000034454592,3.064836e-8,0.71426463,0.00006413495,0.28136787,0.003586016,0.0003071797],"about_ca_topic_score_codex":0.0000023776681,"about_ca_topic_score_gemma":0.000022160802,"teacher_disagreement_score":0.8326605,"about_ca_system_score_codex":0.0002622907,"about_ca_system_score_gemma":0.00036768444,"threshold_uncertainty_score":0.99993736},"labels":[],"label_agreement":null},{"id":"W2522191305","doi":"","title":"Advanced techniques for high performance query optimization in database systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Query optimization; Scalability; Skyline; Online aggregation; View; Data mining; Materialized view; Cardinality (data modeling); Join (topology); Web query classification; Database; Sargable; Query plan; Query language; Key (lock); Task (project management); Query expansion; Result set; Information retrieval; Set (abstract data type); Web search query; Database design; Search engine","score_opus":0.012023784586364208,"score_gpt":0.23800838516904743,"score_spread":0.22598460058268321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522191305","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.001455198,0.00002741436,0.99635553,0.00024802235,0.00021328243,0.0004694378,0.000007670974,0.0002543582,0.0009690954],"genre_scores_gemma":[0.16320986,0.00009035543,0.8359001,0.00012449097,0.000036895603,0.00014409976,0.000088251,0.000005981992,0.00039992676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932784,0.0000073099936,0.00015603108,0.0002432618,0.00010548836,0.00016008894],"domain_scores_gemma":[0.9995216,0.000013525305,0.00004245865,0.000368679,0.00003164646,0.000022071697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021358862,0.000076217955,0.000084550345,0.00012270323,0.000044215223,0.0001232624,0.00047378134,0.000019950683,0.0000020393197],"category_scores_gemma":[0.000009851845,0.00006744658,0.000010228397,0.00026238683,0.0000093591825,0.0021729476,0.00016034995,0.00003372319,0.0000057888838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014897058,0.00016160231,0.00013471037,0.00021790472,0.0000083214645,0.000008958739,0.00006603894,0.36604926,0.00026042588,0.5041557,0.0008360707,0.12808612],"study_design_scores_gemma":[0.0007189007,0.00011711835,0.000118719574,0.00012090033,0.0000023188488,0.0000018991648,0.000025052026,0.9886515,0.006911019,0.00049331534,0.0026227667,0.00021649773],"about_ca_topic_score_codex":0.00008622488,"about_ca_topic_score_gemma":0.0000076118495,"teacher_disagreement_score":0.6226022,"about_ca_system_score_codex":0.000044330667,"about_ca_system_score_gemma":0.000019263844,"threshold_uncertainty_score":0.27503917},"labels":[],"label_agreement":null},{"id":"W2523255603","doi":"10.1007/978-0-387-39940-9_2666","title":"Fuzzy Information Retrieval","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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":"Fuzzy logic; Information retrieval; Computer science; Data mining; Artificial intelligence","score_opus":0.012300861670173576,"score_gpt":0.2176548570040507,"score_spread":0.20535399533387713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523255603","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.0000013876224,0.00082926714,0.034731295,0.00007440104,0.0023323915,0.0006040508,0.0010634551,0.00017935508,0.9601844],"genre_scores_gemma":[0.0001516355,0.005466876,0.017616905,0.00021323092,0.0015548393,0.000014092134,0.008367152,0.00005253229,0.96656275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99746394,0.000028199589,0.00089854305,0.00041538538,0.0009158019,0.0002781132],"domain_scores_gemma":[0.9970792,0.000059267626,0.0007784832,0.0017956868,0.0001642675,0.00012308659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005909534,0.00037076595,0.0005053475,0.0004561833,0.0000660567,0.00021402145,0.0016912693,0.00018122772,0.000028934775],"category_scores_gemma":[0.000051494626,0.00035468343,0.000121346624,0.00013324691,0.00004211095,0.0036640402,0.00066261145,0.00029032948,0.0007638763],"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.000008049788,0.000017310971,0.000002459379,0.0003913065,0.00006617,0.00003517626,0.0001024684,0.000009245623,0.0000020307866,0.80961853,0.119726725,0.0700205],"study_design_scores_gemma":[0.00024728957,0.00007613153,0.000010120986,0.00040352115,0.000041715208,0.000009684984,0.00001054869,0.000761308,0.000004377035,0.0019905579,0.996053,0.00039177033],"about_ca_topic_score_codex":0.000041085634,"about_ca_topic_score_gemma":0.0000019737806,"teacher_disagreement_score":0.87632626,"about_ca_system_score_codex":0.000053849446,"about_ca_system_score_gemma":0.00012174729,"threshold_uncertainty_score":0.9998905},"labels":[],"label_agreement":null},{"id":"W2524143095","doi":"10.3233/jcm-160653","title":"Iterated similarity sequences and factorial level similarities in databases","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Methods in Sciences and Engineering","topic":"Data Management and Algorithms","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":"Iterated function; Similarity (geometry); Constraint (computer-aided design); Simple (philosophy); Mathematics; Database; Computer science; Property (philosophy); Similitude; Data mining; Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.12776568704729097,"score_gpt":0.3856599203283524,"score_spread":0.2578942332810614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524143095","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.058004078,0.00026847442,0.9405537,0.0006670968,0.0004438095,0.000027737438,0.0000060659227,0.0000067848823,0.00002222392],"genre_scores_gemma":[0.21204656,0.000097977885,0.78775686,0.000036470727,0.000056657314,5.493622e-7,2.5684187e-7,0.0000014833852,0.0000031732834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910057,0.000076570366,0.00029943863,0.00015251682,0.00023444471,0.00013649237],"domain_scores_gemma":[0.99886096,0.0009100549,0.00009021232,0.000047368067,0.00004609224,0.00004529255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021142082,0.00007771586,0.00015356032,0.0003540047,0.000042583353,0.00017424273,0.0002894103,0.000016597945,0.0000020438176],"category_scores_gemma":[0.00030235443,0.000051528426,0.000014907099,0.0003745345,0.00008359127,0.0018342283,0.00014775309,0.000082392326,7.257321e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002894881,0.00009992406,0.04164906,0.00012827011,0.00004431139,0.00015376214,0.001641701,0.200432,0.0051131346,0.17354442,0.00017025192,0.57699424],"study_design_scores_gemma":[0.0009547964,0.0001556456,0.13130258,0.00039660346,0.00000463515,0.00008642375,0.000113835944,0.8043413,0.0004848933,0.06053177,0.0013562412,0.00027125116],"about_ca_topic_score_codex":0.000011433574,"about_ca_topic_score_gemma":0.000003830835,"teacher_disagreement_score":0.6039093,"about_ca_system_score_codex":0.000019181925,"about_ca_system_score_gemma":0.000044793207,"threshold_uncertainty_score":0.21012683},"labels":[],"label_agreement":null},{"id":"W2526788202","doi":"","title":"Test semi-paramétrique d'indépendance des composantes d'un vecteur aléatoire","year":2007,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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é de Sherbrooke","funders":"","keywords":"Humanities; Mathematics; Statistical analysis; Combinatorics; Physics; Art; Statistics","score_opus":0.019534161176606224,"score_gpt":0.23329749493406587,"score_spread":0.21376333375745965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526788202","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.019847788,0.006498806,0.87928873,0.014834717,0.0010518384,0.0009791156,0.00025559423,0.00071767456,0.07652572],"genre_scores_gemma":[0.30355036,0.007133922,0.6123383,0.00062476675,0.00020994699,0.00013951726,0.0014468776,0.00017320672,0.07438311],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98811144,0.005574743,0.0014009058,0.0023653244,0.0011345597,0.0014130408],"domain_scores_gemma":[0.98459953,0.0048605283,0.00119891,0.005331686,0.0034132518,0.00059608865],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.012218844,0.0010392382,0.0009241119,0.00047747575,0.0014242592,0.0027180228,0.0070952587,0.0005734449,0.0003306823],"category_scores_gemma":[0.0030022718,0.001185977,0.00047844896,0.0018898688,0.0013747754,0.0014441799,0.0074798944,0.0016365303,0.0006028663],"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.000015335687,0.0024211996,0.007571001,0.00053204346,0.00022657227,0.00016832743,0.009158392,0.00014496033,0.0023153333,0.43565413,0.0034380648,0.53835464],"study_design_scores_gemma":[0.0024481625,0.000006035605,0.05118717,0.011897333,0.00023498897,0.00025757973,0.00031151585,0.33703837,0.17759182,0.039833043,0.37570247,0.0034914988],"about_ca_topic_score_codex":0.0021451928,"about_ca_topic_score_gemma":0.002359689,"teacher_disagreement_score":0.5348632,"about_ca_system_score_codex":0.00032473146,"about_ca_system_score_gemma":0.00042623878,"threshold_uncertainty_score":0.9998757},"labels":[],"label_agreement":null},{"id":"W2527110900","doi":"10.3233/jcm-160652","title":"On the dimension dependence of the level of optimality of certain multidimensional sampling strategies","year":2016,"lang":"en","type":"article","venue":"Journal of Computational Methods in Sciences and Engineering","topic":"Data Management and Algorithms","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":"","keywords":"Hypersphere; Dimension (graph theory); Computer science; Hypercube; Mathematics; Compatibility (geochemistry); Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.14594124310929912,"score_gpt":0.385538836621807,"score_spread":0.23959759351250787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527110900","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.2470208,0.000055032888,0.75238734,0.0003481346,0.00014223499,0.000028810793,0.000002066559,0.0000011701275,0.0000144062105],"genre_scores_gemma":[0.503497,0.0000067523606,0.4964821,0.000006749255,0.000005211569,1.8216453e-7,1.7669311e-8,7.341614e-7,0.0000012852561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891126,0.0001039432,0.00038055147,0.00009302791,0.0004296365,0.00008159874],"domain_scores_gemma":[0.99721485,0.0022437524,0.0003136331,0.000092933384,0.000116907104,0.000017902817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031102884,0.00005861664,0.00014195418,0.00012233412,0.00004277108,0.000020905574,0.0004910301,0.000014211848,0.0000017295573],"category_scores_gemma":[0.0003586029,0.000026613436,0.000045543813,0.00033163303,0.0001370954,0.00041422437,0.00017219395,0.00006787655,3.2155736e-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.0000052809264,0.000020692749,0.00037575772,0.000017690056,0.000009643688,4.74751e-7,0.00015239709,0.73562974,0.01491092,0.22862259,0.000003118263,0.020251721],"study_design_scores_gemma":[0.00028191763,0.00014410568,0.087832026,0.0005192697,0.000005730415,0.00001412638,0.00017957759,0.8316999,0.010118029,0.06911175,0.000015289119,0.00007825096],"about_ca_topic_score_codex":0.000008348744,"about_ca_topic_score_gemma":4.825944e-7,"teacher_disagreement_score":0.2564762,"about_ca_system_score_codex":0.000009557241,"about_ca_system_score_gemma":0.00006648018,"threshold_uncertainty_score":0.10852644},"labels":[],"label_agreement":null},{"id":"W2529060894","doi":"10.1109/bigdatacongress.2016.19","title":"Enhanced State History Tree (eSHT): A Stateful Data Structure for Analysis of Highly Parallel System Traces","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stateful firewall; TRACE (psycholinguistics); Scalability; Data structure; Thread (computing); Heap (data structure); Debugging; Tree (set theory); Theoretical computer science; Distributed computing; Parallel computing; Programming language; Database","score_opus":0.03647089403056068,"score_gpt":0.2544424261053332,"score_spread":0.2179715320747725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529060894","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.0070827557,0.00012186666,0.9901966,0.0002673539,0.00028308993,0.0002603169,0.0009474249,0.00015092424,0.0006897054],"genre_scores_gemma":[0.8183137,0.000055048215,0.169522,0.00009671202,0.000048199126,0.000024907256,0.000370107,0.000015105162,0.011554183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983212,0.000043042033,0.00038002548,0.00065164233,0.0003310003,0.00027312673],"domain_scores_gemma":[0.9976119,0.00012169613,0.0002466165,0.0018534791,0.000096651,0.000069650174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034373265,0.00015948211,0.0003677212,0.00031882126,0.00003729092,0.000059910566,0.002534521,0.00003387899,0.0000504589],"category_scores_gemma":[0.000018689007,0.00009796155,0.00009065244,0.00043150218,0.000049103688,0.0015199877,0.0005415564,0.000030948155,0.0000070069614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013554234,0.0001896217,0.00020714113,0.00044413176,0.004282716,0.000018806782,0.0012362453,0.00048055375,0.017182266,0.13813666,0.07656772,0.7611186],"study_design_scores_gemma":[0.0043038274,0.00041030344,0.0047348063,0.00012158783,0.0015912384,0.0000014523956,0.000357358,0.8314367,0.011344909,0.0020226482,0.14246383,0.0012113521],"about_ca_topic_score_codex":0.000092137365,"about_ca_topic_score_gemma":0.0005109469,"teacher_disagreement_score":0.8309561,"about_ca_system_score_codex":0.00009977215,"about_ca_system_score_gemma":0.000054313645,"threshold_uncertainty_score":0.4709813},"labels":[],"label_agreement":null},{"id":"W2531121659","doi":"10.1016/j.jcss.2016.09.011","title":"Computing source-to-target shortest paths for complex networks in RDBMS","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Management and Algorithms","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 Victoria","funders":"","keywords":"Computer science; Relational database management system; Shortest path problem; Theoretical computer science; Distributed computing; Parallel computing; Relational database; Database; Graph","score_opus":0.02856876478531118,"score_gpt":0.2616750358609549,"score_spread":0.23310627107564375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531121659","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.015953327,0.00012597207,0.9814995,0.00092068757,0.0010717635,0.00018712842,0.0000019516176,0.000028915352,0.00021073288],"genre_scores_gemma":[0.7777815,0.0000066391963,0.22150224,0.00020584169,0.00047113214,0.0000013606804,2.427779e-7,0.0000039627876,0.000027075306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982387,0.00009003166,0.0006096527,0.00031577842,0.00038141565,0.00036445187],"domain_scores_gemma":[0.9988907,0.00035736227,0.00030268094,0.00017863451,0.00011566881,0.00015497221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024803919,0.00014054365,0.0003505859,0.0003477883,0.00020311339,0.0005305294,0.0013190674,0.000030127769,0.0000011345784],"category_scores_gemma":[0.00001554292,0.000083106286,0.000077307646,0.00047716324,0.00008167244,0.00087448925,0.000396567,0.00006228808,0.000002420075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021169639,0.00010053595,0.022500504,0.00008736339,0.00004511813,0.00010592643,0.0010296564,0.025351519,0.0001397433,0.03154997,0.007303248,0.9117652],"study_design_scores_gemma":[0.00058731297,0.00046384666,0.013975372,0.00041575934,0.000004252292,0.00018177286,0.00011652299,0.97741884,0.000007097327,0.00031505822,0.006343533,0.00017063599],"about_ca_topic_score_codex":0.0000049650566,"about_ca_topic_score_gemma":0.0000025920574,"teacher_disagreement_score":0.9520673,"about_ca_system_score_codex":0.00003536621,"about_ca_system_score_gemma":0.000041494204,"threshold_uncertainty_score":0.5115907},"labels":[],"label_agreement":null},{"id":"W2535219971","doi":"10.1109/plans.1988.195469","title":"Digital map dependent functions of automatic vehicle location systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Initialization; Computer science; Digital mapping; Representation (politics); Position (finance); Electronic map; Data mining; Computer vision; Information retrieval; Artificial intelligence; Real-time computing; Geography; Cartography; Programming language","score_opus":0.012544003419259297,"score_gpt":0.20949659875716561,"score_spread":0.19695259533790632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535219971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020648618,0.000055460005,0.96092343,0.00007778574,0.00048727417,0.00011615958,0.000002503573,0.00012763422,0.03614489],"genre_scores_gemma":[0.98052144,9.2318965e-7,0.004203799,0.000018767467,0.000012010478,0.000008805411,0.000007192532,0.0000027858734,0.015224304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942803,0.000016046175,0.0001477165,0.00013661575,0.00017605956,0.000095547926],"domain_scores_gemma":[0.9995167,0.00001961822,0.0000475033,0.00034180342,0.00004550446,0.000028862003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012335465,0.000049655366,0.00006224262,0.00005856445,0.000037250662,0.00023476654,0.00026921628,0.000012953464,0.000021348824],"category_scores_gemma":[0.000015930607,0.00004223834,0.000016834774,0.00022768322,0.000010781226,0.000969846,0.00007024853,0.00002111901,0.0002918169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0725647e-7,0.0003549824,0.00287412,0.00026911736,0.00007547291,0.0000069433822,0.0001371801,0.0021009422,0.0001393706,0.81540555,0.01698356,0.16165194],"study_design_scores_gemma":[0.00042377994,0.00008831741,0.0019266391,0.000043847638,0.000013369079,0.000007630069,0.00038965183,0.97049034,0.0005891086,0.001108992,0.024697995,0.00022035882],"about_ca_topic_score_codex":0.000012291227,"about_ca_topic_score_gemma":0.0000016049164,"teacher_disagreement_score":0.97845656,"about_ca_system_score_codex":0.0000148253275,"about_ca_system_score_gemma":0.00001724491,"threshold_uncertainty_score":0.3750813},"labels":[],"label_agreement":null},{"id":"W2539639989","doi":"10.1109/clei.2012.6427223","title":"Snapshot of the position of a site in the Internet: Vector space model applied to external pages","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Snapshot (computer storage); Computer science; The Internet; Position (finance); Computer graphics (images); World Wide Web; Database","score_opus":0.020221940397885208,"score_gpt":0.23528671233881726,"score_spread":0.21506477194093204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539639989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18662016,0.000023786948,0.7987306,0.0013462051,0.000090992755,0.00022897305,0.000003519945,0.000009452214,0.012946294],"genre_scores_gemma":[0.9809382,0.0000017312049,0.018324366,0.00042052756,0.000021562571,0.0000080113905,0.0000016367057,0.0000018793255,0.00028208835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946386,0.000024710767,0.00010986971,0.00009526995,0.0001881147,0.000118177006],"domain_scores_gemma":[0.9995368,0.000021760268,0.000047838577,0.00036543282,0.000010590277,0.000017576163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002885002,0.000053347092,0.0000650192,0.000044178345,0.000011705522,0.00003458887,0.0008355457,0.000011531238,0.000011799147],"category_scores_gemma":[0.0000037662248,0.000028228988,0.00002689454,0.00020420572,0.000015958783,0.0002655941,0.00039082876,0.00004169429,0.000008044433],"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.000024935163,0.00038084522,0.0049454416,0.000042140786,0.000020812331,9.883463e-7,0.0128670195,0.0016220795,0.039524455,0.9030651,0.009999203,0.027506981],"study_design_scores_gemma":[0.00069847144,0.00012734841,0.22347271,0.00011168401,0.00002475547,0.0000045517227,0.00042131302,0.67364657,0.09482263,0.0052596936,0.0010802526,0.00032998214],"about_ca_topic_score_codex":0.000053251366,"about_ca_topic_score_gemma":0.000024665474,"teacher_disagreement_score":0.8978054,"about_ca_system_score_codex":0.000007735779,"about_ca_system_score_gemma":0.000004261489,"threshold_uncertainty_score":0.15526657},"labels":[],"label_agreement":null},{"id":"W2539741397","doi":"10.1109/plans.1988.195471","title":"Design concepts for knowledge-based route guidance systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Principal (computer security); Automation; Computer science; Process (computing); Knowledge base; Base (topology); Software engineering; Artificial intelligence; Programming language; Operating system; Engineering","score_opus":0.054137795589016574,"score_gpt":0.2959471589853001,"score_spread":0.24180936339628353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539741397","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.000009443541,0.00037662635,0.97604346,0.0001124586,0.0009107712,0.00050595874,0.0000032192886,0.00020204348,0.021836009],"genre_scores_gemma":[0.08919965,0.0000040733394,0.8826867,0.0004232054,0.00008963043,0.0002158504,0.000009136383,0.000014444905,0.027357336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990281,0.00009347975,0.00017016727,0.00033081163,0.00011623529,0.00026123755],"domain_scores_gemma":[0.9990979,0.00018940335,0.000052099604,0.00051623164,0.000084837746,0.000059524205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064676756,0.00011183735,0.00012292658,0.000054180353,0.00009585757,0.00031717544,0.0007516078,0.000027064001,0.000011708023],"category_scores_gemma":[0.000057389523,0.00009420013,0.000040584284,0.00023655733,0.00002113441,0.0004693431,0.000055831126,0.000027899903,0.00012923758],"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.0000031314535,0.00007795598,0.00005021984,0.000056690722,0.000018931274,0.0000038023336,0.00007052826,0.001828452,0.000083636834,0.9002041,0.08324563,0.014356917],"study_design_scores_gemma":[0.00065352063,0.00007657557,0.000015280906,0.000020496358,0.0000051409706,8.660826e-7,0.000019010424,0.6766556,0.0024134126,0.00079800416,0.3191542,0.00018788256],"about_ca_topic_score_codex":0.0000059084073,"about_ca_topic_score_gemma":0.000001307531,"teacher_disagreement_score":0.8994061,"about_ca_system_score_codex":0.000028493181,"about_ca_system_score_gemma":0.000071619965,"threshold_uncertainty_score":0.38413697},"labels":[],"label_agreement":null},{"id":"W2545112008","doi":"10.1109/pvgs.2003.1249038","title":"A parallel framework for simplification of massive meshes","year":2004,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Data Management and Algorithms","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; Thrashing; Parallel computing; Workstation; Polygon mesh; Computation; Virtual memory; Virtual machine; Distributed computing; Memory management; Operating system; Algorithm; Computer graphics (images)","score_opus":0.030465405933257448,"score_gpt":0.28800895691640793,"score_spread":0.25754355098315046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545112008","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.012392921,0.00003886677,0.9839627,0.0026436455,0.0006037781,0.00012603487,0.0000057253324,0.000027132233,0.00019917068],"genre_scores_gemma":[0.26057103,0.00006529746,0.73876685,0.00016127099,0.00029606832,0.0000045428133,0.000001869866,0.000007480722,0.00012561333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991745,0.000021526434,0.00024213218,0.00015581517,0.00021525097,0.00019082267],"domain_scores_gemma":[0.9992326,0.00007561959,0.0002344169,0.00027396574,0.000114553324,0.00006883677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025063718,0.00008388109,0.00012245246,0.000100275174,0.000114597395,0.00015574525,0.00058538286,0.00004163948,0.0000060815278],"category_scores_gemma":[0.00007002862,0.00007155563,0.000089271576,0.00017455958,0.000030076455,0.00050305534,0.000034967412,0.00012990816,0.000015197934],"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.0000448423,0.0002208258,0.000101105434,0.000048270555,0.000158528,0.000051885138,0.0015912404,0.04467607,0.002241867,0.88873845,0.0073001957,0.0548267],"study_design_scores_gemma":[0.0015007581,0.0002874097,0.0011809659,0.00013439273,0.0000360819,0.00008681754,0.00022915252,0.025000606,0.011920074,0.95241255,0.0068931845,0.00031799046],"about_ca_topic_score_codex":0.000002484021,"about_ca_topic_score_gemma":4.719781e-7,"teacher_disagreement_score":0.24817811,"about_ca_system_score_codex":0.000029176763,"about_ca_system_score_gemma":0.000037946622,"threshold_uncertainty_score":0.29179537},"labels":[],"label_agreement":null},{"id":"W2554481486","doi":"10.1007/978-3-319-17885-1_1603","title":"Integration of Spatial Constraint Databases","year":2017,"lang":"en","type":"book-chapter","venue":"Encyclopedia of GIS","topic":"Data Management and Algorithms","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":"Computer Research Institute of Montréal","funders":"","keywords":"Database; Computer science; Constraint (computer-aided design); Spatiotemporal database; Information retrieval; Database design; Mathematics; Database tuning; View; Geometry","score_opus":0.032067260527247704,"score_gpt":0.2643638663434926,"score_spread":0.23229660581624492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554481486","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.000007581182,0.0001064017,0.21853931,0.000087233406,0.0007200591,0.0001592556,0.0003154517,0.000028549646,0.78003615],"genre_scores_gemma":[0.004436563,0.0046843933,0.12538268,0.00006148426,0.00084750855,0.000011927449,0.0011191508,0.000048112197,0.8634082],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878234,0.000010094133,0.0003861392,0.00035016114,0.00035039728,0.00012085804],"domain_scores_gemma":[0.9978665,0.000058093363,0.00064559124,0.001289772,0.00009594243,0.0000441159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019645161,0.00020165111,0.00034839887,0.0001603937,0.00004574094,0.000042778025,0.0012992808,0.00007377783,0.00023187096],"category_scores_gemma":[0.0000760118,0.00018408685,0.00010665461,0.000011933309,0.00021111185,0.00053026294,0.00062140194,0.00014668111,0.00004429281],"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.000002651755,0.000018773453,0.000014904249,0.000053400174,0.000040484643,0.000016118604,0.00008279615,3.9480716e-7,0.000023423901,0.4502275,0.0065790545,0.5429405],"study_design_scores_gemma":[0.00025438692,0.000115254436,0.00040379775,0.00043379245,0.00006476771,0.0000028456468,0.000006850361,0.00075197464,0.00032277047,0.01313815,0.984154,0.0003514063],"about_ca_topic_score_codex":0.00032615935,"about_ca_topic_score_gemma":0.00013880628,"teacher_disagreement_score":0.97757494,"about_ca_system_score_codex":0.000012620721,"about_ca_system_score_gemma":0.00008843913,"threshold_uncertainty_score":0.7506844},"labels":[],"label_agreement":null},{"id":"W25572007","doi":"10.1007/978-3-642-22922-0_3","title":"An Ontology-Based Traffic Accident Risk Mapping Framework","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":20,"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; Ontology; Cluster analysis; Traffic accident; Accident (philosophy); Domain (mathematical analysis); Data mining; Point (geometry); Information retrieval; Transport engineering; Artificial intelligence","score_opus":0.024106046252622606,"score_gpt":0.2502911648562512,"score_spread":0.22618511860362858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25572007","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.0001645986,0.00026456075,0.9941643,0.00036847426,0.0027696826,0.00042198808,0.000008005894,0.00039737055,0.0014410116],"genre_scores_gemma":[0.07882562,0.000055633223,0.918258,0.0021077842,0.0005548287,0.000013215524,0.000017827033,0.00003999781,0.00012706709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953208,0.00007661931,0.0005735155,0.002204062,0.0009365154,0.0008885008],"domain_scores_gemma":[0.9958849,0.00036669127,0.00046499813,0.0028758857,0.00014802025,0.00025953096],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013028083,0.0006510678,0.0005861408,0.0012219795,0.00038769725,0.0010092756,0.007709984,0.00043958926,0.00007184806],"category_scores_gemma":[0.00008617072,0.0006047683,0.00016663784,0.0007284032,0.0006028382,0.0013313971,0.001292216,0.001281888,0.0001319197],"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.000003995923,0.000058372476,0.00018781226,0.00001859034,0.000015110756,0.00012704784,0.0006848944,0.022929592,0.000004029141,0.019613804,0.000030215906,0.95632654],"study_design_scores_gemma":[0.00027204168,0.00029450475,0.0009642169,0.00039844617,0.000018630613,0.000016057835,3.0748237e-7,0.7596337,0.0001297318,0.23400173,0.0032672815,0.0010033218],"about_ca_topic_score_codex":0.000039952247,"about_ca_topic_score_gemma":0.00013347603,"teacher_disagreement_score":0.9553232,"about_ca_system_score_codex":0.00019488003,"about_ca_system_score_gemma":0.00034458327,"threshold_uncertainty_score":0.99964035},"labels":[],"label_agreement":null},{"id":"W2561314860","doi":"10.48550/arxiv.1611.03736","title":"A Formal Definition for Configuration","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Discovery Air (Canada)","funders":"","keywords":"Computer science; Matching (statistics); Task (project management); Relational database; Information retrieval; Set (abstract data type); Keyword search; Key (lock); Process (computing); Space (punctuation); Data mining; Programming language; Mathematics","score_opus":0.10886080436238679,"score_gpt":0.18953618814353276,"score_spread":0.08067538378114597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561314860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026819305,0.000008431453,0.9830913,0.00022288285,0.0006205178,0.00038887007,0.000075097494,0.00019097271,0.012720021],"genre_scores_gemma":[0.98958486,0.000057166002,0.0074737486,0.000119331016,0.00013814191,0.0000047267013,0.00018382739,0.000009823501,0.0024283994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891853,0.000029888228,0.00012174527,0.0006131861,0.000053860647,0.000262763],"domain_scores_gemma":[0.99894273,0.000059111433,0.00016591202,0.00066422415,0.000105809755,0.000062181505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019184865,0.0001651224,0.00014475084,0.00016258957,0.00013624316,0.00017329189,0.0010817046,0.00012088859,0.00001759342],"category_scores_gemma":[0.0000166879,0.00016441474,0.00012653552,0.00014334677,0.0000350307,0.0013372245,0.0010213922,0.00010754635,0.000106103544],"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.000014008505,0.00002373432,0.000032795706,0.00004611189,0.000032305292,0.000017668412,0.000026058178,0.00044167016,0.00001541949,0.9916926,0.0014047936,0.006252861],"study_design_scores_gemma":[0.0009671923,0.00007901158,0.00025516297,0.00008688644,0.000057946956,0.0000011297464,0.000020820802,0.38189596,0.00024434732,0.6076631,0.0082929535,0.00043549357],"about_ca_topic_score_codex":0.000008704173,"about_ca_topic_score_gemma":0.0000054315974,"teacher_disagreement_score":0.9869029,"about_ca_system_score_codex":0.000074179494,"about_ca_system_score_gemma":0.000059950737,"threshold_uncertainty_score":0.67046386},"labels":[],"label_agreement":null},{"id":"W2562653017","doi":"10.1145/2996913.2996994","title":"k-Optimal meeting points based on preferred paths","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Exploit; Computer science; Group (periodic table); Order (exchange); Information retrieval; Data mining; Computer security","score_opus":0.019533678003626875,"score_gpt":0.23203482468197165,"score_spread":0.21250114667834477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562653017","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.0016844214,0.0000020376324,0.8893286,0.0042320266,0.00022674406,0.00008692101,0.0000031650543,0.00027493984,0.104161166],"genre_scores_gemma":[0.5950671,0.0000036751658,0.392876,0.0029898575,0.00010110783,0.000016212643,0.000005361314,0.000012894527,0.0089277895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991248,0.000028666347,0.00010626959,0.00030544557,0.00022514352,0.00020965404],"domain_scores_gemma":[0.9992958,0.000077785284,0.000033442433,0.0005205343,0.000019135347,0.00005331741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002596584,0.000085774744,0.00006364135,0.00007047624,0.000051202867,0.00012457995,0.0007054425,0.000017968048,0.000094645264],"category_scores_gemma":[0.000040492916,0.000049838738,0.000032321266,0.00011794666,0.000013352191,0.0005447745,0.00024738538,0.000026388281,0.00057773036],"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.000013042672,0.00016407533,0.0007376985,0.000008796554,0.000015646241,0.00003560296,0.000050105085,0.00012159658,0.00079349434,0.06445917,0.036356334,0.89724445],"study_design_scores_gemma":[0.002207637,0.0003818764,0.0061257808,0.00017253487,0.000007353305,0.0000013957592,0.000016494685,0.8776282,0.011671346,0.0020316031,0.099133946,0.0006218331],"about_ca_topic_score_codex":0.0000050272133,"about_ca_topic_score_gemma":0.000001151466,"teacher_disagreement_score":0.8966226,"about_ca_system_score_codex":0.000015327489,"about_ca_system_score_gemma":0.000011354042,"threshold_uncertainty_score":0.7425748},"labels":[],"label_agreement":null},{"id":"W2563307839","doi":"10.1145/2996913.2996991","title":"Fast transportation network traversal with hyperedges","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Esri (Canada)","funders":"","keywords":"Computer science; Scalability; Tree traversal; Enhanced Data Rates for GSM Evolution; Joins; Flow network; Distributed computing; Sorting; Relational database; Database; Algorithm","score_opus":0.007426990026595474,"score_gpt":0.18106129709358407,"score_spread":0.1736343070669886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563307839","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.002577374,0.0000060959483,0.98730814,0.0012475034,0.00011213855,0.00005513761,0.0000027656981,0.00014136882,0.008549448],"genre_scores_gemma":[0.8080093,0.000026059575,0.17941797,0.0004329699,0.00019764138,0.000009826973,0.000013008822,0.00000890207,0.011884282],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994884,0.0000066646376,0.00006314064,0.00017638798,0.000117951415,0.00014746317],"domain_scores_gemma":[0.9997085,0.000015711204,0.000019409625,0.00020735139,0.000014472687,0.000034563942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005906874,0.000057617926,0.000049667833,0.000019977459,0.000037715727,0.000057656907,0.00032819645,0.000011224142,0.00005461656],"category_scores_gemma":[6.334354e-7,0.000029595689,0.000013685954,0.00013670206,0.000018530918,0.0007218002,0.0000130618155,0.0000145953245,0.00007635773],"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.000008314505,0.000024767345,0.0034083917,0.000004245691,0.000023768698,0.000020313539,0.00012444414,0.0000652109,0.00010051128,0.26458186,0.012559643,0.71907854],"study_design_scores_gemma":[0.00756386,0.0014001882,0.5357591,0.00027402907,0.00009495864,0.000017929611,0.00032096967,0.031928994,0.0059342044,0.020026399,0.3945467,0.0021327194],"about_ca_topic_score_codex":0.000008959556,"about_ca_topic_score_gemma":0.000054187887,"teacher_disagreement_score":0.8078902,"about_ca_system_score_codex":0.0000049850564,"about_ca_system_score_gemma":0.000007994048,"threshold_uncertainty_score":0.120687716},"labels":[],"label_agreement":null},{"id":"W2563903707","doi":"10.1504/ijipt.2016.081318","title":"K-CEP: a knowledge-based complex event processing framework to manage qualitative spatiotemporal patterns","year":2016,"lang":"en","type":"article","venue":"International Journal of Internet Protocol Technology","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Computer science; Complex event processing; Leverage (statistics); SQL; Data mining; Event (particle physics); Database; Machine learning; Process (computing)","score_opus":0.040949103624080774,"score_gpt":0.406556510535927,"score_spread":0.36560740691184623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563903707","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.0018913867,0.000004871969,0.9669518,0.018180316,0.00042691478,0.012073491,0.000013701584,0.00013203063,0.00032549116],"genre_scores_gemma":[0.77943784,9.09149e-7,0.20313352,0.00067991513,0.00026350984,0.01596651,0.000002872135,0.000023220278,0.0004916823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777013,0.00011981609,0.000846981,0.00037674897,0.0005942071,0.0002920941],"domain_scores_gemma":[0.99773633,0.0001340898,0.00076421956,0.00037911997,0.00088183087,0.000104395476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007098083,0.00022456789,0.00029133714,0.0013054375,0.00003425915,0.0002465995,0.0039277445,0.00012282902,0.00015118468],"category_scores_gemma":[0.00032461376,0.00015620982,0.00012859933,0.00043808096,0.00010116005,0.00083425984,0.00093417027,0.00027459374,0.000096233984],"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.00023285203,0.0006251132,0.0022595397,0.000073922776,0.00022269151,0.00029669373,0.0022293478,0.000022019382,0.000726165,0.07567618,0.0048235264,0.91281193],"study_design_scores_gemma":[0.012218464,0.0057155187,0.0049049235,0.011839883,0.00004445536,0.00043127674,0.0014851256,0.041219585,0.048069134,0.17131217,0.70080394,0.0019555122],"about_ca_topic_score_codex":0.000010569374,"about_ca_topic_score_gemma":0.000015105045,"teacher_disagreement_score":0.9108564,"about_ca_system_score_codex":0.00026577667,"about_ca_system_score_gemma":0.00009478943,"threshold_uncertainty_score":0.7298792},"labels":[],"label_agreement":null},{"id":"W2566486882","doi":"10.1109/iros.2016.7759299","title":"Fast and efficient rendezvous in street networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Rendezvous; Computer science; Scheduling (production processes); Taxis; Schedule; Task (project management); Limiting; Computer network; Operations research; Distributed computing; Real-time computing; Transport engineering; Mathematical optimization; Engineering","score_opus":0.007626359047626582,"score_gpt":0.20224199398305032,"score_spread":0.19461563493542375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566486882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007494643,0.00003820773,0.9822125,0.00082559435,0.000116129784,0.000056837496,9.200027e-7,0.00006745293,0.009187735],"genre_scores_gemma":[0.9866582,0.00003443611,0.0111417305,0.0001610087,0.000027517874,0.0000033119563,8.0585534e-7,0.000002638562,0.0019703133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994626,0.0000122997035,0.00007756765,0.00020874484,0.00008213975,0.00015661531],"domain_scores_gemma":[0.99967,0.000028031509,0.000014999517,0.00024647298,0.0000057311627,0.000034720295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013551391,0.0000517434,0.000051393174,0.000054114855,0.000019320662,0.00007148035,0.0003117309,0.000014148473,0.000013113033],"category_scores_gemma":[0.000004832277,0.00003052896,0.000007971917,0.00014219712,0.000018442131,0.00020538866,0.00038766977,0.000022111853,0.00001562609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.435333e-7,0.000028749717,0.0030302848,0.0000015453929,0.0000027205508,0.000017106826,0.00002511289,0.00033692655,0.0000105791805,0.10013359,0.0021597287,0.8942527],"study_design_scores_gemma":[0.0010162038,0.000073054835,0.04107939,0.000044940836,0.0000021731307,0.0000027880312,0.000038715367,0.94638175,0.000093604045,0.0010745025,0.009920019,0.00027286154],"about_ca_topic_score_codex":0.000021901116,"about_ca_topic_score_gemma":0.000063891915,"teacher_disagreement_score":0.9791636,"about_ca_system_score_codex":0.000008713665,"about_ca_system_score_gemma":0.0000032563448,"threshold_uncertainty_score":0.12449349},"labels":[],"label_agreement":null},{"id":"W2575197938","doi":"","title":"Extremal cactuses for the Schultz and modified Schultz indices.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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; Applied mathematics","score_opus":0.023577891500833704,"score_gpt":0.24419312668460322,"score_spread":0.22061523518376952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575197938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37387174,0.0026232528,0.56565374,0.032216698,0.013817575,0.0031701282,0.00012183709,0.0011743299,0.007350705],"genre_scores_gemma":[0.99560744,0.000112517744,0.0027992055,0.00026258346,0.000026704287,0.0000630527,0.000003033642,0.000011243344,0.0011142517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894935,0.000027261967,0.00015340192,0.00036114294,0.0002129254,0.00029593674],"domain_scores_gemma":[0.9987746,0.00041352373,0.00008431276,0.0006006516,0.00005441633,0.000072481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036360117,0.00013765179,0.00012478235,0.00006710958,0.0002589332,0.0003024062,0.0010738866,0.00004353765,0.000006883929],"category_scores_gemma":[0.00009951711,0.000075357646,0.000042150274,0.00018194442,0.000092422604,0.001006068,0.0004791157,0.000059949307,0.000029021807],"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.0000065998715,0.000032166572,0.0006437219,0.000008849224,0.000032153384,0.0000029841785,0.00010307619,6.4753357e-7,0.00014749663,0.8761904,0.005624671,0.1172072],"study_design_scores_gemma":[0.0060503636,0.00031022693,0.018108428,0.00010442019,0.00006925553,0.000010094373,0.000081434446,0.017791182,0.002402248,0.80627567,0.14803882,0.0007578397],"about_ca_topic_score_codex":0.000022356397,"about_ca_topic_score_gemma":0.000004322749,"teacher_disagreement_score":0.6217357,"about_ca_system_score_codex":0.000018668607,"about_ca_system_score_gemma":0.0000256306,"threshold_uncertainty_score":0.30729955},"labels":[],"label_agreement":null},{"id":"W2578061732","doi":"","title":"Relationships between distance two labellings and circular distance two labellings by group path covering.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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; Path (computing); Group (periodic table); Computer science; Computer network; Physics","score_opus":0.01444856507265261,"score_gpt":0.22663817205344708,"score_spread":0.21218960698079448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578061732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2118874,0.0016700255,0.7812235,0.0019546018,0.0013823607,0.00041715565,0.00014330495,0.00044364174,0.0008780308],"genre_scores_gemma":[0.9934988,0.00032846455,0.0051801307,0.00011661242,0.000030435496,0.000022351087,0.000047180456,0.000028364999,0.0007476848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978505,0.0001134394,0.0003543815,0.0007690868,0.0004400606,0.00047252455],"domain_scores_gemma":[0.9983811,0.00030568705,0.00019969938,0.00084730156,0.00006865809,0.00019755533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074333954,0.00026950668,0.0002797821,0.000068772824,0.0003623639,0.00035051306,0.0010459905,0.00006485239,0.000006153624],"category_scores_gemma":[0.000058474947,0.00022971706,0.00005081352,0.0004708254,0.0001342601,0.0016355291,0.0004253993,0.00022912574,0.00007406033],"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.000004293212,0.00006434422,0.04536861,0.000029555818,0.000039118735,0.00001777015,0.00017225949,0.0000012129414,0.00033290708,0.9385322,0.005322923,0.010114849],"study_design_scores_gemma":[0.0038210992,0.00012908825,0.0062997933,0.00024887876,0.00005253602,0.0000031132663,0.000023843999,0.0036400424,0.00075595686,0.78566086,0.19842489,0.00093991414],"about_ca_topic_score_codex":0.00004438996,"about_ca_topic_score_gemma":0.0000054492843,"teacher_disagreement_score":0.7816114,"about_ca_system_score_codex":0.00008445517,"about_ca_system_score_gemma":0.0000165289,"threshold_uncertainty_score":0.936759},"labels":[],"label_agreement":null},{"id":"W2579692817","doi":"10.1109/ism.2016.0044","title":"E-Tourism: Mobile Dynamic Trip Planner","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Planner; TRIPS architecture; Computer science; Tourism; Recommender system; Orienteering; Algorithm design; Mobile computing; Operations research; Mathematical optimization; World Wide Web; Algorithm; Artificial intelligence; Computer network; Engineering; Operating system; Mathematics","score_opus":0.006716947227403578,"score_gpt":0.22665333874691457,"score_spread":0.219936391519511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579692817","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.0019238814,0.00003202057,0.9700093,0.0016647434,0.00040628394,0.000107418746,0.0000053529507,0.00028750784,0.025563452],"genre_scores_gemma":[0.5488926,0.00011738282,0.10500923,0.001428461,0.00019338865,0.0000809897,0.0000130910985,0.000019257854,0.34424558],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993266,0.000012680614,0.0000923731,0.00024333202,0.00013741505,0.00018758654],"domain_scores_gemma":[0.99940485,0.000031594507,0.000023158564,0.0004799331,0.000012655444,0.00004781003],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000118209755,0.000070783746,0.00006515244,0.000062904786,0.000038297174,0.00009928741,0.0008128639,0.000018805229,0.00022932395],"category_scores_gemma":[0.0000051430566,0.00003877139,0.000028438113,0.00013232105,0.000016731738,0.0007829258,0.00031941332,0.000022565999,0.0011762768],"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.0000015658603,0.000040218503,0.00007617344,0.0000028667614,0.000011844567,0.00003201367,0.000025410762,0.0000019189904,0.0003068358,0.037048593,0.09675099,0.86570156],"study_design_scores_gemma":[0.0013599856,0.00020337258,0.0021249983,0.000027407898,0.000007607446,0.000009975293,0.000029952402,0.05706341,0.0012465849,0.014193085,0.9232154,0.00051825854],"about_ca_topic_score_codex":0.000006346962,"about_ca_topic_score_gemma":0.000003175658,"teacher_disagreement_score":0.8651833,"about_ca_system_score_codex":0.000014134746,"about_ca_system_score_gemma":0.000007720683,"threshold_uncertainty_score":0.9996014},"labels":[],"label_agreement":null},{"id":"W2583219280","doi":"10.1109/bigdata.2016.7840671","title":"Parallel gathering discovery over big trajectory data","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Trajectory; Big data; Computation; Scale (ratio); Urban computing; Distributed computing; Data mining; Data science; Machine learning; Algorithm","score_opus":0.05429180465669192,"score_gpt":0.25997367587873593,"score_spread":0.205681871222044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583219280","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.0017448431,0.000035431305,0.9864614,0.0007202659,0.0004521723,0.000057169495,0.000018225699,0.00016662004,0.010343845],"genre_scores_gemma":[0.47902307,0.00045536918,0.35818586,0.0026595134,0.0013244806,0.000025628688,0.00007898106,0.000052845066,0.15819426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990898,0.000014870236,0.0001042517,0.00041304625,0.00017516324,0.0002028908],"domain_scores_gemma":[0.9982903,0.000042396205,0.000027558053,0.0015932507,0.000005540532,0.000040978164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018167717,0.000086031454,0.00007273407,0.000044572258,0.00003995526,0.00027057627,0.0022573299,0.00001544278,0.00006600526],"category_scores_gemma":[0.00001225673,0.00004926453,0.000021925305,0.00011027919,0.000024034136,0.0035096027,0.0017314245,0.00002643726,0.00018083239],"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.000003352469,0.000059027523,0.001042431,0.000008308042,0.000035616707,0.000023900282,0.000037924252,0.0000033047684,0.0011736954,0.094619535,0.0395254,0.8634675],"study_design_scores_gemma":[0.0023221949,0.000099500954,0.039477028,0.000103461076,0.000020748572,0.0000074527793,0.000037709924,0.060099117,0.00094735716,0.009185747,0.8865935,0.0011061723],"about_ca_topic_score_codex":0.000031694228,"about_ca_topic_score_gemma":0.000024361581,"teacher_disagreement_score":0.8623613,"about_ca_system_score_codex":0.000012557252,"about_ca_system_score_gemma":0.000017413864,"threshold_uncertainty_score":0.41947183},"labels":[],"label_agreement":null},{"id":"W2583598520","doi":"10.1109/bigdata.2016.7840879","title":"Implementing trajectory data stream analysis in parallel","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Partition (number theory); Locality; Workflow; Trajectory; Data mining; Stream processing; Big data; Focus (optics); SPARK (programming language); Data stream; Process (computing); Batch processing; Distributed computing; Parallel computing; Database; Operating system; Programming language; Mathematics","score_opus":0.04496775241824208,"score_gpt":0.2930721111915908,"score_spread":0.24810435877334874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583598520","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.0031860904,0.000016681031,0.9879439,0.0008524035,0.000050528404,0.00006182888,0.000023293118,0.00009113361,0.0077741514],"genre_scores_gemma":[0.73811805,0.000060611528,0.25562307,0.00029391007,0.00007249716,0.000009340676,0.00014152023,0.0000070835285,0.005673898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.000027811056,0.00017972806,0.00043983656,0.00016112959,0.00031009864],"domain_scores_gemma":[0.9985042,0.000048902963,0.000040711766,0.0013619423,0.000008979221,0.000035244746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058539596,0.00007214584,0.000108792,0.0002534335,0.000036609246,0.00012061821,0.0020468347,0.000011854915,0.00022313555],"category_scores_gemma":[0.000013922213,0.00004548557,0.00003116931,0.00075870537,0.000010973582,0.0015776024,0.0018474859,0.00002367123,0.00006138541],"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.0000013122983,0.000079628975,0.07366696,0.0000040869377,0.0002345235,0.000023061004,0.00005599759,0.000016505126,0.00008805577,0.04105599,0.009082869,0.875691],"study_design_scores_gemma":[0.0023889502,0.00006564299,0.31532645,0.000027596432,0.00021633865,0.0000012681594,0.00021805287,0.5058348,0.00026512583,0.003641351,0.17110139,0.0009130502],"about_ca_topic_score_codex":0.00017790502,"about_ca_topic_score_gemma":0.0014466705,"teacher_disagreement_score":0.874778,"about_ca_system_score_codex":0.000013381286,"about_ca_system_score_gemma":0.000011565374,"threshold_uncertainty_score":0.38035622},"labels":[],"label_agreement":null},{"id":"W2587250740","doi":"","title":"Generic Integration in Environmental Information and Decision Support Systems","year":2002,"lang":"en","type":"article","venue":"ScholarsArchive  (Brigham Young University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"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 Waterloo","keywords":"Computer science; Decision support system; Process (computing); Information system; Data science; Management information systems; Software; Risk analysis (engineering); Management science; Knowledge management; Engineering; Data mining; Business","score_opus":0.010228228374316743,"score_gpt":0.17323590012014925,"score_spread":0.1630076717458325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587250740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20017946,0.00008979012,0.77941495,0.00007988799,0.00045710034,0.0003520152,0.000038317503,0.000106342886,0.019282142],"genre_scores_gemma":[0.9725007,0.00050520286,0.025413798,0.00006376955,0.000025014544,0.0000011113779,0.00009211621,0.0000052615737,0.0013930409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917805,0.00005382732,0.00014780105,0.00022983493,0.00021432765,0.0001761643],"domain_scores_gemma":[0.9995643,0.000026994947,0.00007161373,0.0002568508,0.000010099552,0.00007013592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014910825,0.00010711263,0.00009586613,0.00060275785,0.00013555541,0.00038728895,0.00048477517,0.000034375433,0.000021133917],"category_scores_gemma":[0.000009819541,0.00011156192,0.000024168912,0.0003763632,0.00004199357,0.0061943103,0.00036859445,0.0001553364,0.0001330339],"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.000023206403,0.00012817392,0.01527907,0.000019144973,0.000024082901,0.00022212727,0.0018947041,0.00024171999,0.00066315354,0.07300386,0.001518717,0.90698206],"study_design_scores_gemma":[0.0027516673,0.00027076295,0.13624506,0.00010508091,0.000026205395,0.00008600327,0.0012822055,0.71251035,0.0001170143,0.0017406166,0.14414935,0.0007157258],"about_ca_topic_score_codex":0.00004001917,"about_ca_topic_score_gemma":0.000012335777,"teacher_disagreement_score":0.90626633,"about_ca_system_score_codex":0.000094115014,"about_ca_system_score_gemma":0.000007798709,"threshold_uncertainty_score":0.45493633},"labels":[],"label_agreement":null},{"id":"W2589068952","doi":"10.29173/cais150","title":"Performance in ART1-Like Document Clustering with Variable Similarity Thresholds","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI","topic":"Data Management and Algorithms","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; Cluster analysis; Similarity (geometry); Variable (mathematics); Implementation; Massively parallel; Document clustering; Data mining; Information retrieval; Parallel computing; Artificial intelligence; Mathematics","score_opus":0.015078656515238268,"score_gpt":0.21540691538705348,"score_spread":0.2003282588718152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589068952","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.9811269,0.000030353089,0.002056996,0.0014147658,0.0001495248,0.0005389596,0.000014371551,0.00006182109,0.014606279],"genre_scores_gemma":[0.9885807,0.00005576217,0.01046653,0.00022716315,0.000032710243,0.00005750315,0.000002135218,0.000012311768,0.00056518096],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99820083,0.000011078564,0.00040916377,0.00040512197,0.00049731217,0.00047651763],"domain_scores_gemma":[0.99068314,0.000047660902,0.00039979213,0.00035224736,0.008424537,0.000092641705],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0006106369,0.00024683453,0.00035027304,0.00017236268,0.000104868086,0.0034391587,0.0030000473,0.00007858735,0.000027292272],"category_scores_gemma":[0.00062521634,0.00017703178,0.000055372235,0.00066360674,0.0001818296,0.024426242,0.0016790341,0.00024835012,0.0000060368834],"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.00015071394,0.0005144146,0.8635796,0.0014073397,0.00020182687,0.000005402519,0.025681615,0.00046787673,0.005954002,0.058073353,0.005510662,0.038453247],"study_design_scores_gemma":[0.0029427384,0.0013851619,0.71816474,0.0017437862,0.00009903953,0.000070252376,0.0020265563,0.19017577,0.017911231,0.014483553,0.04952789,0.0014692582],"about_ca_topic_score_codex":0.00031324208,"about_ca_topic_score_gemma":0.000022526176,"teacher_disagreement_score":0.1897079,"about_ca_system_score_codex":0.000051553558,"about_ca_system_score_gemma":0.00011376701,"threshold_uncertainty_score":0.99759537},"labels":[],"label_agreement":null},{"id":"W2591095207","doi":"10.3390/ijgi6020054","title":"AHS Model: Efficient Topological Operators for a Sensor Web Publish/Subscribe System","year":2017,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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":"Alberta Innovates; Canarie; Microsoft Research","keywords":"Sensor web; Computer science; Wireless sensor network; Geospatial analysis; Interoperability; Publication; Web mapping; Distributed computing; Data mining; Database; Web service; Web modeling; World Wide Web; Key distribution in wireless sensor networks; Computer network; Remote sensing; Geography","score_opus":0.01739969853041448,"score_gpt":0.2761489247987076,"score_spread":0.2587492262682931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591095207","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.019573685,0.000010851499,0.9661876,0.0052119065,0.0043249447,0.0002209129,0.00008480468,0.00005348558,0.004331813],"genre_scores_gemma":[0.94939154,0.000014074413,0.04951347,0.0005668285,0.00033959036,0.000011016962,0.00003382787,0.000004255037,0.00012541542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982114,0.000021343114,0.00066054304,0.00010845772,0.0007961118,0.00020215141],"domain_scores_gemma":[0.9973567,0.00003961868,0.00093377125,0.0003669,0.0012047589,0.000098223965],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000927852,0.00012942363,0.00017670327,0.00034229705,0.000308431,0.0031553903,0.002735368,0.0000635237,0.000008473411],"category_scores_gemma":[0.00034745527,0.00010166784,0.00015223082,0.00005841548,0.00004265043,0.010264374,0.00043914953,0.00014189995,0.00004397756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022641354,0.00016898151,0.00038893204,0.00009541957,0.00035537698,0.0000499539,0.001367685,0.05379896,0.000113714676,0.78314203,0.03469644,0.12559609],"study_design_scores_gemma":[0.0011599257,0.00008129225,0.00034602988,0.000063166524,0.000013710051,0.000078063786,0.00025026168,0.9689436,0.00020424536,0.00041876655,0.028307565,0.00013337407],"about_ca_topic_score_codex":0.00000994717,"about_ca_topic_score_gemma":0.0000010956112,"teacher_disagreement_score":0.92981786,"about_ca_system_score_codex":0.00017271304,"about_ca_system_score_gemma":0.000114152135,"threshold_uncertainty_score":0.99787945},"labels":[],"label_agreement":null},{"id":"W2591955099","doi":"10.1145/3132847.3133012","title":"Efficient Computation of Subspace Skyline over Categorical Domains","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Army Research Office; Qatar Foundation; Microsoft Research; Qatar National Research Fund; National Science Foundation","keywords":"Skyline; Categorical variable; Computer science; Data mining; Exploit; Tuple; Set (abstract data type); Subspace topology; Theoretical computer science; Machine learning; Artificial intelligence; Mathematics","score_opus":0.018838813719897596,"score_gpt":0.28618756179440474,"score_spread":0.26734874807450715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591955099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03244986,0.00000828848,0.95285076,0.0010143402,0.00029986718,0.00008248995,0.0000014027528,0.00005636772,0.013236642],"genre_scores_gemma":[0.9607416,0.0000023562418,0.03838302,0.00005684113,0.000042377378,0.0000013736209,0.0000036875056,0.0000027719177,0.00076601264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928737,0.00001291668,0.00012434606,0.00020279367,0.00024084974,0.00013171855],"domain_scores_gemma":[0.9991532,0.000017022847,0.000119252894,0.0006333786,0.000035503046,0.000041664938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019543851,0.00006650828,0.00009647921,0.00005192066,0.00014454345,0.00020864577,0.00088500703,0.000018646806,0.000013164789],"category_scores_gemma":[0.00002195016,0.000053389005,0.00003429174,0.00007806849,0.00004831746,0.00020234955,0.0005414854,0.00003678109,0.00003973335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005695922,0.00027337545,0.00195788,0.000025950705,0.000028079989,0.000027116846,0.00020369049,0.0034549127,0.00027558475,0.9183446,0.008559865,0.06684324],"study_design_scores_gemma":[0.00041843017,0.00003651064,0.04669195,0.0000043402288,0.000004598554,0.0000011287435,0.000007530622,0.9485425,0.00039761484,0.0020432272,0.0017554571,0.000096762524],"about_ca_topic_score_codex":0.00010847095,"about_ca_topic_score_gemma":0.000008841095,"teacher_disagreement_score":0.94508755,"about_ca_system_score_codex":0.000012386553,"about_ca_system_score_gemma":0.000011214119,"threshold_uncertainty_score":0.21771404},"labels":[],"label_agreement":null},{"id":"W2592110518","doi":"10.1016/j.neucom.2015.12.142","title":"Iceberg Clique queries in large graphs","year":2017,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Data Management and Algorithms","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":"St. Francis Xavier University","funders":"Natural Science Foundation of Shaanxi Province; National Research Foundation of Korea","keywords":"Computer science; Adjacency matrix; Theoretical computer science; Clique; Graph; Combinatorics; Mathematics","score_opus":0.018554344378203583,"score_gpt":0.27388117163293807,"score_spread":0.2553268272547345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592110518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45843485,0.00007593262,0.48329002,0.004819319,0.0027800086,0.0005559584,0.0000056528424,0.0007390489,0.049299214],"genre_scores_gemma":[0.98191166,0.000011244093,0.017095001,0.0006513101,0.00009647855,0.000004877184,0.0000020613263,0.000009115486,0.00021824852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99884015,0.000044468572,0.00018639122,0.00040506411,0.00015713825,0.00036679546],"domain_scores_gemma":[0.99882114,0.00004547587,0.00014224797,0.0009258622,0.00001926376,0.000046030877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039946902,0.000116436444,0.000129874,0.00011541366,0.00045277007,0.00082038384,0.0019007678,0.000028426919,0.0000035252187],"category_scores_gemma":[0.000073069656,0.00011704435,0.000043692922,0.00013433327,0.00003083093,0.001191814,0.0016315747,0.00017032452,0.000039209033],"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.0000045040656,0.00016057905,0.113962725,0.000053408246,0.000012952651,0.00048123562,0.0006975734,0.000110825036,0.00021680848,0.57950574,0.002050674,0.30274296],"study_design_scores_gemma":[0.0012437998,0.00007918077,0.6158495,0.00010164202,0.000004384831,0.000015388976,0.0000397295,0.30152625,0.00057659054,0.01373162,0.06628118,0.00055076316],"about_ca_topic_score_codex":0.000059455146,"about_ca_topic_score_gemma":0.00006364294,"teacher_disagreement_score":0.56577414,"about_ca_system_score_codex":0.000008429395,"about_ca_system_score_gemma":0.00001337424,"threshold_uncertainty_score":0.791098},"labels":[],"label_agreement":null},{"id":"W2593159659","doi":"","title":"Base64Geo: an efficient data structure and transmission format for large, dense, scalar GIS datasets","year":2016,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Data Management and Algorithms","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":"Scalar (mathematics); Computer science; Data structure; Grid; String (physics); Magnitude (astronomy); Data mining; Tree (set theory); Database; Algorithm; Mathematics; Geometry; Physics; Combinatorics","score_opus":0.012801900714414489,"score_gpt":0.23185445276274097,"score_spread":0.2190525520483265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593159659","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.013496128,0.00015744587,0.9849341,0.00017773283,0.00036749733,0.00019965938,0.00047329738,0.00019364571,4.745281e-7],"genre_scores_gemma":[0.093597464,0.000042810138,0.9058692,0.00019095618,0.00012000021,0.0000054766574,0.00015571606,0.000012149023,0.0000062574645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982205,0.00001115047,0.00016426296,0.00079433765,0.00035561188,0.00045412147],"domain_scores_gemma":[0.9984815,0.00011780201,0.00003536447,0.0010528124,0.000064520464,0.00024801688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072103,0.00017438913,0.00014492558,0.00018366432,0.00032078382,0.0005817109,0.0018440657,0.00003579776,0.0000018647406],"category_scores_gemma":[0.00008696716,0.000120491364,0.000013516943,0.0003480493,0.00007067766,0.003347808,0.0015857876,0.000056268455,0.0000010996724],"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.000003388419,0.000033242428,0.00026366013,0.00010107604,0.000009133613,0.000011064252,0.00023068387,0.00063269545,0.00059624924,0.0033558647,0.001993315,0.9927696],"study_design_scores_gemma":[0.00042139099,0.00006280784,0.0018815264,0.00007248165,0.0000062694685,0.000019279225,0.0000023704238,0.9702404,0.00040337298,0.00008547816,0.026574088,0.00023052863],"about_ca_topic_score_codex":0.0000019391791,"about_ca_topic_score_gemma":9.717204e-7,"teacher_disagreement_score":0.9925391,"about_ca_system_score_codex":0.000018597955,"about_ca_system_score_gemma":0.00004041332,"threshold_uncertainty_score":0.56094515},"labels":[],"label_agreement":null},{"id":"W2594154281","doi":"","title":"Counting rooted nonseparable unicursal planar maps.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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; Planar; Combinatorics; Computer graphics (images); Computer science","score_opus":0.01683502484614639,"score_gpt":0.25220071106849634,"score_spread":0.23536568622234996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594154281","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.43134388,0.0007371318,0.0380573,0.016005399,0.04402837,0.0016142299,0.000099602905,0.0027006965,0.46541336],"genre_scores_gemma":[0.98953766,0.000024217321,0.0067965356,0.00022627643,0.000030678377,0.000012024332,0.00002910497,0.000017444296,0.0033260398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870193,0.000030419953,0.00017512526,0.00039879864,0.00031014788,0.00038356232],"domain_scores_gemma":[0.997915,0.0000427051,0.00019008547,0.0017045632,0.000059569615,0.000088051325],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043809076,0.00015094249,0.00016649207,0.00006834237,0.00075374835,0.0012468323,0.002986683,0.000052600793,0.000013997379],"category_scores_gemma":[0.000082863546,0.0001517256,0.000047509864,0.00012419652,0.00006564611,0.001830886,0.00071866723,0.00014494061,0.00033953373],"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.0000026036043,0.000052509702,0.0027844934,0.000007838286,0.000024249694,0.00006520788,0.00004895086,0.0000019184022,0.00003910841,0.9541352,0.038402285,0.004435664],"study_design_scores_gemma":[0.0023014492,0.00013330836,0.023482107,0.00008216739,0.000024474435,0.000012356188,0.000028691766,0.03333253,0.0008756403,0.7330793,0.20590964,0.00073833304],"about_ca_topic_score_codex":0.00015759158,"about_ca_topic_score_gemma":0.000010280874,"teacher_disagreement_score":0.5581938,"about_ca_system_score_codex":0.000030791944,"about_ca_system_score_gemma":0.0000395925,"threshold_uncertainty_score":0.99978995},"labels":[],"label_agreement":null},{"id":"W2598545891","doi":"10.14313/jamris_1-2017/4","title":"Multi-Strategy Navigation for a Mobile Data Acquisition Platform Using Genetic Algorithms","year":2017,"lang":"en","type":"article","venue":"Journal of Automation Mobile Robotics & Intelligent Systems","topic":"Data Management and Algorithms","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.11555074723646186,"score_gpt":0.3635139512787691,"score_spread":0.24796320404230726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598545891","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.006986358,0.000604308,0.98798126,0.000032747575,0.0030214838,0.0012035163,0.00009387131,0.000063151834,0.000013291747],"genre_scores_gemma":[0.28353956,0.00018597332,0.7148983,0.000018989147,0.0009021783,0.0000628178,0.0001848915,0.000035211928,0.00017207721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973457,0.000064035485,0.0012449023,0.00039101456,0.0006391776,0.00031515548],"domain_scores_gemma":[0.9952262,0.00009185933,0.0023237283,0.001595208,0.00062611984,0.00013689038],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014634358,0.00023511973,0.0003981409,0.00026073193,0.0005103439,0.0016150933,0.0028932316,0.00011476518,0.000006349971],"category_scores_gemma":[0.000053909454,0.0002121941,0.00013895424,0.00012489335,0.000052844076,0.004275509,0.0004866551,0.00015863325,0.000026996002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009974177,0.00020793169,0.00010793611,0.00022756758,0.0001459995,0.000027941145,0.00024208598,0.9263683,0.000732061,0.0007575777,0.0005892364,0.07058342],"study_design_scores_gemma":[0.00052881206,0.00033617613,0.00038376095,0.00031746796,0.00008078083,0.00016097538,0.0002789263,0.9955377,0.00046721954,0.0002018321,0.001478652,0.00022772356],"about_ca_topic_score_codex":0.000052615636,"about_ca_topic_score_gemma":0.0000020126786,"teacher_disagreement_score":0.2765532,"about_ca_system_score_codex":0.00019688126,"about_ca_system_score_gemma":0.00013161972,"threshold_uncertainty_score":0.9994213},"labels":[],"label_agreement":null},{"id":"W2600424944","doi":"","title":"Flow mapping vs movement mapping: a theoretical and cartographic demonstration of their significance at a world scale","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Ministère des Transports","funders":"","keywords":"Flow (mathematics); Scale (ratio); Computer science; Dimension (graph theory); Feature (linguistics); Mathematics; Cartography; Linguistics; Geography; Geometry; Pure mathematics; Philosophy","score_opus":0.016143379286897273,"score_gpt":0.21085912871233478,"score_spread":0.1947157494254375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600424944","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.05010603,0.0007918372,0.9123039,0.009625276,0.00025918888,0.0007914611,0.000093381714,0.00022868418,0.025800208],"genre_scores_gemma":[0.7758227,0.000451373,0.22070892,0.00017017231,0.000027613196,0.00010975541,0.00032402086,0.000027651444,0.002357809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955508,0.0020109338,0.0005969434,0.0009456557,0.0005411201,0.0003545395],"domain_scores_gemma":[0.9955022,0.00051277207,0.0005073025,0.0022283236,0.0010472405,0.00020220746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005499277,0.00033696176,0.0004247107,0.00042546893,0.00023931067,0.0005322549,0.0018962356,0.00013701906,0.000030646566],"category_scores_gemma":[0.00015969941,0.0003298755,0.00015023704,0.0007779852,0.0005462456,0.0003083027,0.0041602473,0.00037438344,0.0000072445946],"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.000020082718,0.0006736872,0.00789187,0.00056848547,0.00021134032,0.000008197751,0.019232135,0.0002101402,0.003323939,0.80453825,0.0030037144,0.16031818],"study_design_scores_gemma":[0.0009032352,0.0000020733844,0.007421561,0.0025165316,0.000049736773,0.000005533412,0.00032386012,0.8617557,0.023980431,0.091003604,0.011154916,0.00088280824],"about_ca_topic_score_codex":0.00018266228,"about_ca_topic_score_gemma":0.00071240263,"teacher_disagreement_score":0.86154556,"about_ca_system_score_codex":0.00009693464,"about_ca_system_score_gemma":0.00015515297,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W2602074824","doi":"","title":"Complement to a Comparative Analysis of Heuristics for the p-Median Problem","year":2007,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Data Management and Algorithms","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Heuristic; Complement (music); Artificial neural network; Series (stratigraphy); Mathematics; Evolutionary algorithm; Variable neighborhood search; Computer science; Mathematical optimization; Artificial intelligence; Algorithm; Metaheuristic","score_opus":0.030612689729685522,"score_gpt":0.29267806898487475,"score_spread":0.26206537925518925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602074824","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.0044494625,0.000029524701,0.99147,0.0023405522,0.00014192905,0.00050613366,0.00006502895,0.000033039607,0.0009643388],"genre_scores_gemma":[0.49767113,0.000009564009,0.50088906,0.0008322777,0.00008631725,0.000040629388,0.000065622145,0.0000047306353,0.00040064348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898446,0.000021572878,0.00026662124,0.00023631995,0.00024074719,0.00025030578],"domain_scores_gemma":[0.9989255,0.00037070358,0.00010822036,0.00042730937,0.0000947003,0.0000735442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006585913,0.000103031954,0.00022025306,0.00024994402,0.00019108204,0.00008779741,0.0008513626,0.000022076241,0.000008629603],"category_scores_gemma":[0.00001516286,0.00007469601,0.00010580965,0.0011065387,0.00008772534,0.000110545974,0.00015875131,0.000066359826,0.0000054911247],"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.000024777113,0.000114327064,0.0011652888,0.000026011621,0.0011744156,0.0000072194953,0.013001027,0.0009986438,0.00006536354,0.8908816,0.019581107,0.07296024],"study_design_scores_gemma":[0.0013091154,0.00052697794,0.03963028,0.000022258317,0.0011625984,0.0000016672774,0.004324488,0.47028062,0.0012687842,0.016943008,0.46385208,0.00067812455],"about_ca_topic_score_codex":0.00007829532,"about_ca_topic_score_gemma":0.0003421253,"teacher_disagreement_score":0.87393856,"about_ca_system_score_codex":0.000042966927,"about_ca_system_score_gemma":0.000011679654,"threshold_uncertainty_score":0.3046015},"labels":[],"label_agreement":null},{"id":"W2603348183","doi":"","title":"Outils de visualisation de données de cartes à puce pour une société de transport collectif","year":2016,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Data Management and Algorithms","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":"Political science","score_opus":0.027024478188954686,"score_gpt":0.2647284395829841,"score_spread":0.2377039613940294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603348183","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.05539058,0.002048978,0.8648526,0.073525645,0.0004930172,0.0008719365,0.0002327383,0.00095270784,0.0016317724],"genre_scores_gemma":[0.70246637,0.0025309026,0.2403359,0.0071915523,0.0010942841,0.0006972675,0.000055496846,0.0001626215,0.045465574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943917,0.0005809847,0.00083950657,0.0010440054,0.00065065024,0.0024931452],"domain_scores_gemma":[0.9966656,0.0005050505,0.00042539617,0.0013473061,0.00022810273,0.00082854065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002967054,0.0007056939,0.00063264626,0.0005355161,0.000657517,0.00082228833,0.0020768112,0.00061519607,0.00013165541],"category_scores_gemma":[0.00039900286,0.0006910109,0.00040317327,0.0014105274,0.000326455,0.002255836,0.0004013843,0.0005274131,0.0000751935],"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.00018941298,0.0014125995,0.095645405,0.00035878157,0.00043715045,0.00088826026,0.006324017,0.0012288692,0.046353098,0.2782377,0.061399788,0.5075249],"study_design_scores_gemma":[0.003658536,0.0006268308,0.19816919,0.0010043221,0.00050787913,0.0006772442,0.0008893602,0.53337353,0.08551623,0.09260248,0.0805721,0.0024023084],"about_ca_topic_score_codex":0.0409483,"about_ca_topic_score_gemma":0.010212925,"teacher_disagreement_score":0.64707583,"about_ca_system_score_codex":0.003030536,"about_ca_system_score_gemma":0.0022618417,"threshold_uncertainty_score":0.9995541},"labels":[],"label_agreement":null},{"id":"W2603660651","doi":"","title":"Ad-hoc Holistic Ranking Aggregation","year":2012,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Data Management and Algorithms","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":"University of Waterloo","keywords":"Ranking (information retrieval); Post hoc; Information retrieval; Computer science; Medicine; Dentistry","score_opus":0.018332695113920952,"score_gpt":0.21679602768244116,"score_spread":0.19846333256852022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603660651","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.9586086,0.0018817995,0.026228972,0.0012173153,0.0045049028,0.00080409995,0.00006749659,0.00056047086,0.006126343],"genre_scores_gemma":[0.06224059,0.0005172969,0.034257926,0.00002852857,0.00012738921,6.9435134e-7,0.0016817107,0.000032147997,0.9011137],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.998837,0.000042081272,0.0001047159,0.00036936146,0.00036026034,0.00028657677],"domain_scores_gemma":[0.99897176,0.000022765591,0.0002810376,0.0005401529,0.00010505467,0.00007920206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018561112,0.00019648553,0.00025949415,0.00032993223,0.00019532077,0.00008526399,0.0012268759,0.00014766782,0.00011185947],"category_scores_gemma":[0.000008093609,0.00023521659,0.00011663595,0.00029773416,0.00003533525,0.001363074,0.00022023046,0.00016417421,0.0002139159],"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.00011338232,0.00022224947,0.0003005311,0.0009621088,0.00030954558,0.0001213185,0.17942499,0.000029838751,0.0011654163,0.01728764,0.010019626,0.79004335],"study_design_scores_gemma":[0.014027949,0.0014916883,0.2072634,0.005989567,0.003621988,0.000036929527,0.41017509,0.073101476,0.0078594275,0.01902739,0.24664162,0.010763471],"about_ca_topic_score_codex":0.002406356,"about_ca_topic_score_gemma":0.0051939012,"teacher_disagreement_score":0.896368,"about_ca_system_score_codex":0.00005293164,"about_ca_system_score_gemma":0.000034503377,"threshold_uncertainty_score":0.9591854},"labels":[],"label_agreement":null},{"id":"W2604861954","doi":"10.3233/fi-2018-1651","title":"On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information","year":2018,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Data Management and Algorithms","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","funders":"","keywords":"Computer science; Functional dependency; Axiom; Semantics (computer science); Relational database; Database; Independence (probability theory); Theoretical computer science; Relational model; Possible world; Information retrieval; Programming language; Mathematics","score_opus":0.031046352721690713,"score_gpt":0.2388561724885678,"score_spread":0.2078098197668771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604861954","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.02803076,0.000002035377,0.94746184,0.00013132778,0.00025490083,0.0002474529,0.000080673264,0.000092821385,0.02369816],"genre_scores_gemma":[0.81762916,0.000009409609,0.17812113,0.0032196988,0.000090244845,0.000026810148,0.0005003397,0.000010597843,0.00039262103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869245,0.000013821278,0.00036816302,0.0001056155,0.0005965042,0.0002234369],"domain_scores_gemma":[0.9989763,0.000072659146,0.00022857795,0.0005706466,0.000094850446,0.000056974302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024334542,0.00013837044,0.00013717657,0.00018638477,0.00015721483,0.00023381111,0.00052091514,0.000019153136,0.000515601],"category_scores_gemma":[0.000034155306,0.00010626659,0.000026721225,0.00036665617,0.00012665229,0.006728293,0.0004783852,0.00007202205,0.0007115132],"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.00019515939,0.00024436845,0.0053255428,0.0004407469,0.00021748953,0.0000040399414,0.0026342098,0.0007548471,0.00008594707,0.82536024,0.12138733,0.043350097],"study_design_scores_gemma":[0.0046226108,0.0031871481,0.053049386,0.0006076301,0.000095959615,0.000048505663,0.0011884997,0.5706326,0.006953308,0.0065194312,0.35179427,0.0013006425],"about_ca_topic_score_codex":0.000042675656,"about_ca_topic_score_gemma":0.0000165405,"teacher_disagreement_score":0.8188408,"about_ca_system_score_codex":0.00004142495,"about_ca_system_score_gemma":0.000041233525,"threshold_uncertainty_score":0.91453004},"labels":[],"label_agreement":null},{"id":"W2606016433","doi":"10.1007/978-3-319-57351-9_34","title":"Probabilistic TCP-net","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Regina","funders":"","keywords":"Net (polyhedron); Computer science; Preference; Bayesian network; Probabilistic logic; Set (abstract data type); Graphical model; Preference relation; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.022462443124361207,"score_gpt":0.2503938629422117,"score_spread":0.2279314198178505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606016433","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.000004418504,0.00020089613,0.9644859,0.0009859102,0.0028065809,0.0004423684,0.000009942237,0.00020024787,0.030863773],"genre_scores_gemma":[0.021717208,0.00012614118,0.9586114,0.0024933883,0.0019301947,0.000031683427,0.000043416596,0.00008594114,0.0149606],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959553,0.000020004516,0.00041480557,0.0018363919,0.0010479232,0.0007255724],"domain_scores_gemma":[0.9957241,0.00019952825,0.00035806795,0.0033836695,0.00016007684,0.00017458333],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009339186,0.000531834,0.00049189373,0.00063903537,0.0004546437,0.0021007168,0.009117804,0.00021501728,0.000034999553],"category_scores_gemma":[0.00014692367,0.0004727427,0.000119427146,0.00020586993,0.0008969443,0.0014644995,0.003999853,0.0006444384,0.00022471219],"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.0000014807868,0.000020822963,0.000010356869,0.000043019798,0.000009682551,0.00016338924,0.00013955045,0.002147757,0.0000065617305,0.07446954,0.0002447681,0.9227431],"study_design_scores_gemma":[0.0002629837,0.00013989607,0.00013635682,0.00036802844,0.000012274665,0.000039096623,3.1820846e-8,0.47664285,0.00010203326,0.48841387,0.032989673,0.0008928875],"about_ca_topic_score_codex":0.000022444741,"about_ca_topic_score_gemma":0.000068858426,"teacher_disagreement_score":0.9218502,"about_ca_system_score_codex":0.00018488003,"about_ca_system_score_gemma":0.00035312818,"threshold_uncertainty_score":0.9997724},"labels":[],"label_agreement":null},{"id":"W2606633748","doi":"10.1007/978-3-319-57351-9_19","title":"Sequence-Based Bidirectional Merge Map-Matching Algorithm for Simplified Road Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Map matching; Merge (version control); Algorithm; Merge algorithm; Outlier; Blossom algorithm; Matching (statistics); Sequence (biology); Global Positioning System; Artificial intelligence; Mathematics","score_opus":0.03445042403683292,"score_gpt":0.276466503553487,"score_spread":0.2420160795166541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606633748","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.0000017383536,0.0002664396,0.9888998,0.0011092355,0.0068236333,0.0007451834,0.00006811113,0.00027844627,0.0018073998],"genre_scores_gemma":[0.000953478,0.000026409947,0.9928571,0.0016063851,0.0023816884,0.000050038347,0.00010653972,0.000051771323,0.0019666143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519414,0.000033699747,0.0005732494,0.0020329792,0.0011114264,0.0010544796],"domain_scores_gemma":[0.99640876,0.0004398265,0.0005526905,0.0021235738,0.00026791502,0.0002072412],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016118152,0.0006757598,0.00064127636,0.00061508064,0.0011189377,0.001823392,0.006009014,0.00029861194,0.000023305725],"category_scores_gemma":[0.000058421192,0.0006405182,0.00026054645,0.00028529708,0.00056424504,0.0013691621,0.0016412226,0.0006368429,0.000052271917],"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.0000035420921,0.000018284316,0.000004205949,0.00003336158,0.000021782032,0.000043781376,0.0000543859,0.03116007,0.00001367003,0.009386236,0.00041941664,0.95884126],"study_design_scores_gemma":[0.00034746338,0.00010081313,0.000023749097,0.00029941904,0.000013655639,0.000009790945,5.575507e-8,0.78202844,0.00012031019,0.1911947,0.02518412,0.0006774718],"about_ca_topic_score_codex":0.00006791933,"about_ca_topic_score_gemma":0.00008129915,"teacher_disagreement_score":0.9581638,"about_ca_system_score_codex":0.00027364647,"about_ca_system_score_gemma":0.00061240763,"threshold_uncertainty_score":0.9996046},"labels":[],"label_agreement":null},{"id":"W2606648713","doi":"10.1007/978-3-319-57529-2_14","title":"MaP2R: A Personalized Maximum Probability Route Recommendation Method Using GPS Trajectories","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Global Positioning System; Recommender system; Smoothing; Graph; Personalization; Information retrieval; Theoretical computer science; World Wide Web; Computer vision","score_opus":0.05690339408799902,"score_gpt":0.3099706010547597,"score_spread":0.25306720696676066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606648713","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.00002150286,0.00010254502,0.99096036,0.0012864404,0.002833686,0.000662296,0.000031041254,0.00020252935,0.003899578],"genre_scores_gemma":[0.0015653073,0.000026527483,0.9963225,0.00054311106,0.0005281539,0.000012314116,0.000041607607,0.00003375269,0.00092671945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995505,0.00010699242,0.0005795754,0.0021384691,0.0009270079,0.00074299396],"domain_scores_gemma":[0.9964516,0.0003115356,0.0005998619,0.0022160378,0.00025758139,0.00016338639],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024865544,0.00063757395,0.0006858451,0.00063434074,0.0007351513,0.0021298013,0.004910117,0.0002715686,0.000064818894],"category_scores_gemma":[0.00016983556,0.00058828964,0.0001986284,0.00032195446,0.00073132984,0.0024816378,0.0025314777,0.00071646075,0.000024600957],"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.000008339446,0.000030740724,0.000048774495,0.0000666347,0.000024207402,0.000034777186,0.0006025649,0.0017543081,0.000045550085,0.016151011,0.000031671465,0.9812014],"study_design_scores_gemma":[0.00041274144,0.00009550255,0.00008678406,0.00023703418,0.000025583706,0.000043028478,3.3991452e-7,0.5725266,0.00029318556,0.41023472,0.015237845,0.00080666365],"about_ca_topic_score_codex":0.00012043508,"about_ca_topic_score_gemma":0.00011367221,"teacher_disagreement_score":0.9803948,"about_ca_system_score_codex":0.0005221333,"about_ca_system_score_gemma":0.0005077689,"threshold_uncertainty_score":0.99965686},"labels":[],"label_agreement":null},{"id":"W2606963904","doi":"","title":"Median of an odd number of permutations","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics","score_opus":0.028531620440564318,"score_gpt":0.25537196201972845,"score_spread":0.22684034157916413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606963904","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.055740647,0.00042727852,0.72837585,0.006692014,0.00088289194,0.00060623075,0.00032524005,0.00015704623,0.20679279],"genre_scores_gemma":[0.5264593,0.0005483509,0.44998056,0.000058431404,0.000038711813,0.000045145327,0.0009970306,0.000045229237,0.021827264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925059,0.0044456227,0.0009964401,0.0009626353,0.0006661239,0.00042329886],"domain_scores_gemma":[0.99057174,0.0008269926,0.0011537584,0.0040178024,0.003152766,0.00027692292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0056280396,0.00037998438,0.0005637032,0.00023907635,0.00023696152,0.0003052908,0.004184952,0.00025541047,0.00086374447],"category_scores_gemma":[0.00078189635,0.00042968692,0.00027465605,0.00078045734,0.00071168906,0.0009921378,0.0030225348,0.00046081384,0.00014509143],"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.000004174936,0.0011377528,0.0016832281,0.0002351567,0.00010621085,0.0000059959134,0.018601209,0.000027783824,0.00042944716,0.85238075,0.0004304656,0.124957845],"study_design_scores_gemma":[0.0028089518,0.0000064557635,0.08609978,0.008405806,0.0006009914,0.000078826975,0.0014679888,0.42194477,0.15667996,0.26105708,0.058102775,0.0027466249],"about_ca_topic_score_codex":0.006118055,"about_ca_topic_score_gemma":0.0023904284,"teacher_disagreement_score":0.5913237,"about_ca_system_score_codex":0.000055925,"about_ca_system_score_gemma":0.00036850752,"threshold_uncertainty_score":0.99981546},"labels":[],"label_agreement":null},{"id":"W2608249025","doi":"10.18357/jcs.v37i2.15201","title":"Count on More than Just Counting with Counting Books","year":2012,"lang":"en","type":"article","venue":"Journal of Childhood Studies","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics","score_opus":0.032004503487076334,"score_gpt":0.28147649549977466,"score_spread":0.24947199201269832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608249025","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.905547,0.018717147,0.03880807,0.012866311,0.0053524314,0.00057529955,0.000014463932,0.00023908097,0.017880172],"genre_scores_gemma":[0.9885209,0.00032533298,0.008739163,0.0010674943,0.0011135879,0.0000024118146,7.0239275e-7,0.000014700291,0.00021566777],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983179,0.000029430947,0.0003651963,0.00015229716,0.0007491643,0.00038600052],"domain_scores_gemma":[0.99875146,0.00010301802,0.00054127467,0.00026444814,0.00025933908,0.000080480946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009807716,0.00018986875,0.00033483404,0.00015590247,0.00028119856,0.00021045994,0.0006357442,0.00002238257,0.0000019667636],"category_scores_gemma":[0.000081597216,0.00012213404,0.00007715202,0.00020274092,0.00006167404,0.0016927011,0.000274214,0.00025363822,0.000013014427],"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.00022994203,0.003914128,0.30925095,0.00064849225,0.009681882,0.00077838474,0.13832614,0.0009820148,0.00017232317,0.12250468,0.21674179,0.19676927],"study_design_scores_gemma":[0.0063919653,0.0027911551,0.77158904,0.003314165,0.00078842975,0.00091671076,0.03266232,0.0016160572,0.0013533519,0.0016091391,0.17489325,0.0020744116],"about_ca_topic_score_codex":0.0000029924333,"about_ca_topic_score_gemma":0.0000025956947,"teacher_disagreement_score":0.4623381,"about_ca_system_score_codex":0.00005899731,"about_ca_system_score_gemma":0.000036978417,"threshold_uncertainty_score":0.49804816},"labels":[],"label_agreement":null},{"id":"W2613838618","doi":"10.1109/iat.2007.39","title":"Agent-based Fault Detection Mechanism in Wireless Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Acadia University","funders":"","keywords":"Wireless sensor network; Computer science; Key distribution in wireless sensor networks; Computer network; Distributed computing; Sensor node; Multicast; Energy consumption; Mobile wireless sensor network; Fault detection and isolation; Real-time computing; Wireless; Wireless network; Engineering; Actuator","score_opus":0.012317582839634281,"score_gpt":0.23042815547265302,"score_spread":0.21811057263301875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613838618","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.014321093,0.0000039878555,0.98250717,0.00013630216,0.0005123436,0.00012526798,3.1494193e-7,0.00019266574,0.0022008312],"genre_scores_gemma":[0.95716685,0.0000034354416,0.04144985,0.0006092584,0.00006935931,0.0000042451543,0.0000046300574,0.0000057708903,0.0006866146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990786,0.00002256548,0.00016066575,0.00027543647,0.00017266774,0.00029008545],"domain_scores_gemma":[0.99953157,0.000037093563,0.000037693033,0.00032229396,0.000019363297,0.00005201007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005370677,0.00009052002,0.000078673496,0.000161898,0.000052032625,0.0001248728,0.00042058964,0.00004645865,0.00001560199],"category_scores_gemma":[0.0000047915814,0.000083310355,0.000029209481,0.0004875248,0.00000908207,0.00037321134,0.00013130535,0.000092175,0.000047943086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012063783,0.00011529862,0.00022771048,0.000010573772,0.0000100435955,0.00016520073,0.00004753024,0.0024151548,0.0020051973,0.06658531,0.00030822417,0.92809767],"study_design_scores_gemma":[0.00033832388,0.000031943007,0.0010670534,0.0000062111694,0.0000016898234,0.0000012453532,0.00002635286,0.9836121,0.013429186,0.00043047097,0.0009224711,0.00013295103],"about_ca_topic_score_codex":0.00009579365,"about_ca_topic_score_gemma":0.0003492694,"teacher_disagreement_score":0.98119694,"about_ca_system_score_codex":0.000036133122,"about_ca_system_score_gemma":0.0000058835903,"threshold_uncertainty_score":0.33972976},"labels":[],"label_agreement":null},{"id":"W2613845756","doi":"10.1109/aina.2017.30","title":"A Compact-Trie-Based Structure for K-Nearest-Neighbour Searching","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Trie; Nearest neighbour; k-nearest neighbors algorithm; Computer science; Grid; Nearest neighbor search; Space (punctuation); Data structure; Space partitioning; Algorithm; Pattern recognition (psychology); Data mining; Mathematics; Artificial intelligence; Geometry","score_opus":0.03684698012904807,"score_gpt":0.3117793133192961,"score_spread":0.274932333190248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613845756","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.0049851486,0.000008038123,0.98134774,0.005432604,0.0003820497,0.0003158321,0.00004567636,0.00016229419,0.00732061],"genre_scores_gemma":[0.8379448,8.661029e-7,0.15900712,0.0005793369,0.00014647415,0.000004557752,0.00002226618,0.0000087794115,0.0022857746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990604,0.000016512602,0.000102079524,0.00030909438,0.00021533041,0.00029659926],"domain_scores_gemma":[0.99852914,0.00007450471,0.00008162321,0.0011794143,0.000046014797,0.00008933337],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021415067,0.00010800653,0.000116094576,0.00006922437,0.00066098105,0.0018878294,0.002286646,0.00002746005,0.000048434318],"category_scores_gemma":[0.00008506889,0.00008538262,0.000057510908,0.00005093939,0.00004308033,0.001086031,0.00033808823,0.00008448883,0.000025472202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003767564,0.0001177061,0.0068804775,0.00014714416,0.00008817523,0.000045815257,0.00024067643,0.00046978338,0.00090888946,0.53955346,0.07855574,0.3729545],"study_design_scores_gemma":[0.0014917481,0.000114165035,0.023127228,0.000026536813,0.000009381507,0.0000016731951,0.000016257209,0.8673784,0.003649513,0.017679505,0.086160965,0.00034462425],"about_ca_topic_score_codex":0.000107492364,"about_ca_topic_score_gemma":0.000043490207,"teacher_disagreement_score":0.8669086,"about_ca_system_score_codex":0.000013843281,"about_ca_system_score_gemma":0.00004333408,"threshold_uncertainty_score":0.9991483},"labels":[],"label_agreement":null},{"id":"W2613865975","doi":"10.11591/ijai.v6.i1.pp1-7","title":"Fuzzy Information Modeling in a Database System","year":2017,"lang":"en","type":"article","venue":"IAES International Journal of Artificial Intelligence","topic":"Data Management and Algorithms","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; Fuzzy logic; Data mining; Fuzzy set operations; Database design; Neuro-fuzzy; Fuzzy classification; Artificial intelligence; Fuzzy set; Fuzzy control system","score_opus":0.07553415624370242,"score_gpt":0.3275671142655698,"score_spread":0.25203295802186737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613865975","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.009101144,0.000029917013,0.983009,0.0011665566,0.0030231723,0.00006305764,0.000009735715,0.000018525729,0.0035788855],"genre_scores_gemma":[0.9711775,0.00003930644,0.028395982,0.00008193094,0.00028559167,0.0000017509152,0.000005081336,0.000002903707,0.000009940275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984061,0.000025904612,0.00071537815,0.000116108895,0.0005936523,0.000142831],"domain_scores_gemma":[0.9984822,0.00003167169,0.00057783216,0.00041129967,0.00044202668,0.000054927314],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000858955,0.000090750626,0.00012826847,0.00039179026,0.000114491006,0.0013246739,0.0034075535,0.000028175882,0.000005831685],"category_scores_gemma":[0.00028104958,0.000082569415,0.00006475724,0.00008210409,0.000037012273,0.0077289063,0.00043674468,0.00016770232,0.00008120581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035478402,0.000054794968,0.0001347285,0.000011859565,0.000033622273,0.00014577524,0.0005462928,0.010326422,0.00008228468,0.41218284,0.000062166975,0.57638377],"study_design_scores_gemma":[0.0000663692,0.000035092256,0.00007469087,0.00021211052,0.0000046940336,0.00005085104,0.0006091086,0.98535943,0.00097434816,0.01189049,0.0006124628,0.000110347544],"about_ca_topic_score_codex":0.0001189138,"about_ca_topic_score_gemma":0.000032766686,"teacher_disagreement_score":0.975033,"about_ca_system_score_codex":0.0000983305,"about_ca_system_score_gemma":0.000060626317,"threshold_uncertainty_score":0.99971205},"labels":[],"label_agreement":null},{"id":"W2614759802","doi":"10.1109/icde.2017.205","title":"Multiple-Query Optimization of Regular Path Queries","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; SPARQL; Path expression; Path (computing); Graph; Query optimization; Query plan; Graph database; Semantic Web; Theoretical computer science; Web search query; Information retrieval; Query language; RDF; Search engine; Sargable; Programming language","score_opus":0.017153646428272697,"score_gpt":0.23521557811791877,"score_spread":0.21806193168964608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614759802","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.0006452248,0.000010444881,0.9855856,0.0005157122,0.00018888184,0.00006195496,0.0000022655772,0.00006347831,0.012926456],"genre_scores_gemma":[0.25845638,0.000036079215,0.73773605,0.00007138547,0.00003778999,0.0000038812373,0.000010374166,0.000004105969,0.0036439747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995318,0.000009707698,0.00009895767,0.00015145655,0.00012109796,0.00008697741],"domain_scores_gemma":[0.9989137,0.000012923557,0.00010379899,0.0009103363,0.000038144583,0.000021103202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001339328,0.000051008647,0.00007098933,0.0000330182,0.00013552699,0.00024422116,0.0009565466,0.000016475351,0.000020375252],"category_scores_gemma":[0.000061714556,0.000042450247,0.000023089382,0.000035726924,0.000047212394,0.0014939588,0.0004988305,0.000019073452,0.000008779424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009003436,0.00015430622,0.011923858,0.00007120053,0.00005412346,0.000025567506,0.0003376653,0.0075365175,0.00038951996,0.7304564,0.015167787,0.23387402],"study_design_scores_gemma":[0.00027946936,0.000030752526,0.007514232,0.000015739892,0.0000035447063,6.415317e-7,0.000023550509,0.9823065,0.0025188732,0.001220721,0.0059684245,0.00011754533],"about_ca_topic_score_codex":0.00006118142,"about_ca_topic_score_gemma":0.000006012179,"teacher_disagreement_score":0.97477,"about_ca_system_score_codex":0.0000037033183,"about_ca_system_score_gemma":0.00000713724,"threshold_uncertainty_score":0.23550302},"labels":[],"label_agreement":null},{"id":"W2615008404","doi":"10.24166/im.03.2018","title":"Subhypergraphs in non-uniform random hypergraphs","year":2018,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Data Management and Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Hypergraph; Mathematics; Random graph; Generalization; Graph; Cluster analysis; Binomial (polynomial); Focus (optics); Relation (database); Section (typography); Discrete mathematics; Combinatorics; Data mining; Computer science; Statistics","score_opus":0.012693409263658108,"score_gpt":0.24062307456692916,"score_spread":0.22792966530327105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615008404","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.045345087,0.000022831246,0.89794457,0.00024048191,0.00061877706,0.00026805967,0.000002540311,0.00016364174,0.055394012],"genre_scores_gemma":[0.77897674,0.00002435107,0.21689165,0.00031167478,0.00011328491,0.00002586692,0.0000057499346,0.000018417239,0.0036322454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988118,0.00001593389,0.0003397684,0.0002858134,0.00024302272,0.00030370205],"domain_scores_gemma":[0.9990531,0.00006864408,0.000091034446,0.00067559065,0.000051967512,0.00005966702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040681838,0.00016170122,0.00022322968,0.0002868775,0.000029994286,0.00022494279,0.0014523298,0.00004718358,0.000068341644],"category_scores_gemma":[0.000037513542,0.00013513865,0.000075029144,0.0005245308,0.00008563303,0.00056227896,0.0004779884,0.00010218792,0.00061606173],"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.000049025628,0.0018746268,0.0024758205,0.00034943374,0.00021896296,0.00023979333,0.0161391,0.000015991809,0.00060927746,0.82178265,0.07001061,0.0862347],"study_design_scores_gemma":[0.0026554756,0.00034867198,0.0006542438,0.00027141283,0.000018918834,0.00003777616,0.00023183663,0.8917422,0.0030152479,0.07801739,0.022408485,0.0005983143],"about_ca_topic_score_codex":0.00004539295,"about_ca_topic_score_gemma":0.00007971174,"teacher_disagreement_score":0.89172626,"about_ca_system_score_codex":0.00001972417,"about_ca_system_score_gemma":0.0000105149065,"threshold_uncertainty_score":0.79184324},"labels":[],"label_agreement":null},{"id":"W2615376099","doi":"","title":"Contribution du raisonnement logique à la cartographie des flux","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Ministère des Transports","funders":"","keywords":"Humanities; Philosophy","score_opus":0.014074099325332438,"score_gpt":0.22140698819337684,"score_spread":0.2073328888680444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615376099","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.011393964,0.0012415826,0.94148594,0.0063102352,0.0005503442,0.0006112163,0.00007075192,0.00057012367,0.037765857],"genre_scores_gemma":[0.82384,0.0013467156,0.16979782,0.00017110365,0.000088095956,0.0001855722,0.0012839406,0.000039621653,0.003247094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99240416,0.004940561,0.0005494353,0.00094104337,0.00054860715,0.00061618304],"domain_scores_gemma":[0.99358314,0.000950859,0.0005124292,0.0029280854,0.0017659663,0.00025949636],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009057428,0.00042731693,0.0003988751,0.00032317772,0.0005304244,0.0012846605,0.0032788457,0.00030232326,0.000100057165],"category_scores_gemma":[0.00097072194,0.00044140252,0.0002715502,0.0006313821,0.00037641864,0.00071079115,0.0049765524,0.0006255512,0.000103704806],"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.0000048069096,0.0007961366,0.0033731344,0.00015896237,0.00015345012,0.000013584199,0.0049292534,0.000033054337,0.0005272732,0.84189034,0.0053691496,0.14275084],"study_design_scores_gemma":[0.0038881206,0.0000032436647,0.06537011,0.00483917,0.0003808294,0.000069523936,0.00028824565,0.120976865,0.064091615,0.11682408,0.61942035,0.0038478367],"about_ca_topic_score_codex":0.00061722734,"about_ca_topic_score_gemma":0.00053230074,"teacher_disagreement_score":0.81244606,"about_ca_system_score_codex":0.0001406688,"about_ca_system_score_gemma":0.00014844268,"threshold_uncertainty_score":0.9998038},"labels":[],"label_agreement":null},{"id":"W2615549044","doi":"","title":"Éléments pour une représentation (carto)graphique des matrices de flux","year":2015,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Ministère des Transports","funders":"","keywords":"Humanities; Art","score_opus":0.028615254127677858,"score_gpt":0.2719356683738202,"score_spread":0.24332041424614237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615549044","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.037822343,0.0009339306,0.8942946,0.011484678,0.00050725153,0.00060793664,0.00008272048,0.0006730961,0.053593438],"genre_scores_gemma":[0.17891915,0.0023994336,0.774384,0.0005829646,0.0001364479,0.00023701435,0.0023638795,0.00009756028,0.040879495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937843,0.003264954,0.000596219,0.0011557455,0.0006635298,0.0005352328],"domain_scores_gemma":[0.99352425,0.00047984978,0.0006429881,0.0031610888,0.0018987822,0.00029302304],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00668817,0.00041061183,0.0003714854,0.0004133365,0.00038162767,0.0014958939,0.0036507316,0.00023640608,0.00004822558],"category_scores_gemma":[0.0007012101,0.00044118275,0.00021001634,0.000997916,0.00021105184,0.00085536,0.003955452,0.00052551785,0.00013162532],"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.000018389252,0.0018918407,0.016531516,0.00077385566,0.00045624067,0.00008737725,0.025830245,0.00059923786,0.0022359446,0.42812103,0.06450474,0.45894957],"study_design_scores_gemma":[0.0028083702,0.0000033984904,0.026454886,0.004156261,0.00026248023,0.000059531925,0.0006356426,0.36820623,0.051033866,0.4654686,0.078260496,0.0026502514],"about_ca_topic_score_codex":0.003082377,"about_ca_topic_score_gemma":0.0006957399,"teacher_disagreement_score":0.45629933,"about_ca_system_score_codex":0.0002201883,"about_ca_system_score_gemma":0.0003909952,"threshold_uncertainty_score":0.999804},"labels":[],"label_agreement":null},{"id":"W2621190814","doi":"10.1145/3019612.3019665","title":"Discovering spatial contrast and common sets with statistically significant co-location patterns","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Contrast (vision); Computer science; Artificial intelligence; Data mining; Statistics; Mathematics","score_opus":0.015223851464387145,"score_gpt":0.268849345548599,"score_spread":0.25362549408421187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621190814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037562847,0.0000016785085,0.9586479,0.00056721113,0.00006714162,0.00013045977,0.000032284872,0.0000445364,0.0029459225],"genre_scores_gemma":[0.9837113,0.0000060487837,0.015995009,0.00008808003,0.000023593713,0.000005911512,0.000026117357,0.000004208045,0.0001397137],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993453,0.000014038989,0.00009494448,0.00023749958,0.00016279361,0.00014543105],"domain_scores_gemma":[0.99931204,0.00003261316,0.00007263286,0.0005005713,0.0000226774,0.000059452675],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00011059281,0.000083372644,0.000093134935,0.000021806842,0.00022863103,0.0011417778,0.0005108632,0.000011942222,0.000012300523],"category_scores_gemma":[0.00001189994,0.00006091151,0.000005821223,0.000016992371,0.00006261175,0.0009243625,0.00023255838,0.000043585234,0.0000103820375],"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.00002280863,0.00008691171,0.18506856,0.00006549035,0.000046684137,0.00010429876,0.0002590722,0.00002838168,0.00013096427,0.1159097,0.00053613243,0.697741],"study_design_scores_gemma":[0.000618558,0.00015040132,0.80575305,0.00003831292,0.000010025359,0.0000027988058,0.000037366735,0.1918096,0.0003500565,0.00059373735,0.000435017,0.00020109948],"about_ca_topic_score_codex":0.0014129034,"about_ca_topic_score_gemma":0.00091165444,"teacher_disagreement_score":0.94614846,"about_ca_system_score_codex":0.0000078042585,"about_ca_system_score_gemma":0.000012720505,"threshold_uncertainty_score":0.99989516},"labels":[],"label_agreement":null},{"id":"W2688773974","doi":"","title":"A luhn-inspired vector re-weighting approach for improving personalized web search","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"","keywords":"Computer science; Information retrieval; Set (abstract data type); Personalization; Weighting; Similarity (geometry); Vector space model; Personalized search; Web search query; Search engine; Rank (graph theory); Zipf's law; Data mining; Result set; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.07217503258343165,"score_gpt":0.25702363088739844,"score_spread":0.18484859830396677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2688773974","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.00085961155,0.00005417385,0.92966306,0.00013089502,0.00016486173,0.00043628717,0.000006179616,0.0003487236,0.06833619],"genre_scores_gemma":[0.17952965,0.0000033193821,0.81413186,0.00022489531,0.00012515542,0.00008101896,0.000020506372,0.000016287706,0.0058673355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985182,0.00003662668,0.00018826031,0.0005460389,0.00026690162,0.0004439723],"domain_scores_gemma":[0.9992064,0.000041857802,0.000055345423,0.00053316494,0.00006952754,0.00009365807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065313233,0.00014481925,0.00015357995,0.00012268146,0.00019962322,0.00026809517,0.0012285883,0.000040702136,0.000065451866],"category_scores_gemma":[0.000024356374,0.000119618795,0.000093339615,0.00030614372,0.000039548155,0.0011989096,0.000575283,0.00008517301,0.000024909845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051594856,0.0003583541,0.00026071316,0.00031950453,0.00010027947,0.000017559081,0.0051017925,0.000004366205,0.002483385,0.7231761,0.0053209444,0.2628054],"study_design_scores_gemma":[0.00081940414,0.0000999209,0.000118048556,0.0000059032877,0.000011298204,0.0000018671008,0.00036557368,0.99366254,0.0013999481,0.0007249936,0.0025452846,0.00024520635],"about_ca_topic_score_codex":0.00011155336,"about_ca_topic_score_gemma":0.0000058295145,"teacher_disagreement_score":0.9936582,"about_ca_system_score_codex":0.000027172739,"about_ca_system_score_gemma":0.000049774386,"threshold_uncertainty_score":0.4877913},"labels":[],"label_agreement":null},{"id":"W2714643361","doi":"10.1016/s0022-0000(02)00034-x","title":"Reachability and connectivity queries in constraint databases","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Reachability; Computer science; Theoretical computer science; Path (computing); Context (archaeology); Set (abstract data type); Time complexity; Constraint (computer-aided design); Query language; Reachability problem; Datalog; Mathematics; Database; Algorithm; Programming language","score_opus":0.031986980961840494,"score_gpt":0.2640258118051083,"score_spread":0.23203883084326782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2714643361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39653355,0.0005692627,0.60025406,0.00029336513,0.0005933911,0.00008764683,0.000002482912,0.00001496602,0.0016512339],"genre_scores_gemma":[0.93451315,0.000027744058,0.06537969,0.000037913767,0.00003478919,5.062759e-7,8.175657e-8,9.04397e-7,0.000005193949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988902,0.00020559486,0.00031138852,0.00021229002,0.00023976126,0.00014071613],"domain_scores_gemma":[0.9993616,0.00021520675,0.00016866413,0.00013691728,0.00004762067,0.00007001448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029692815,0.000080946316,0.00022127057,0.00015937697,0.00011504681,0.00032416926,0.00032002848,0.000012679147,9.285943e-7],"category_scores_gemma":[0.000041427025,0.0000564064,0.000022865455,0.00024462893,0.0002657463,0.0014359963,0.00015005733,0.00007264857,3.383484e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047741764,0.00007757384,0.076041326,0.00013671187,0.000016696924,0.00009976779,0.0008438704,0.000057812573,0.00003598019,0.83544683,0.00025292602,0.08698569],"study_design_scores_gemma":[0.0059113144,0.0035787486,0.46762583,0.0024444405,0.000063441665,0.009694968,0.012699105,0.4406237,0.001095691,0.02373954,0.030660843,0.0018623673],"about_ca_topic_score_codex":0.000030416748,"about_ca_topic_score_gemma":0.000015087422,"teacher_disagreement_score":0.8117073,"about_ca_system_score_codex":0.0000151343,"about_ca_system_score_gemma":0.000060926763,"threshold_uncertainty_score":0.31259716},"labels":[],"label_agreement":null},{"id":"W2725407719","doi":"","title":"Demo Abstract: A Semantic Notication Approach for IoT-Based Sensory Data","year":2017,"lang":"en","type":"article","venue":"The Internet of Things","topic":"Data Management and Algorithms","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; Internet of Things; Semantics (computer science); Presentation (obstetrics); Perception; Sensory system; Analytics; Human–computer interaction; Data science; World Wide Web","score_opus":0.08394379158909927,"score_gpt":0.3056366726760442,"score_spread":0.22169288108694496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725407719","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.004104596,0.00001677239,0.9879558,0.0036861892,0.00020705856,0.00026811173,0.000014797471,0.00005200577,0.0036946572],"genre_scores_gemma":[0.81638074,0.0000013662135,0.18163823,0.00034752698,0.00005284645,0.000007197045,0.000050309074,0.000006984103,0.0015148092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919134,0.000013100523,0.00017186586,0.000295973,0.00018715583,0.00014056855],"domain_scores_gemma":[0.99697995,0.00009690795,0.00028248903,0.0025744974,0.000043595657,0.00002256466],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008931766,0.00008481759,0.00010935947,0.00003624775,0.0001225683,0.00039641184,0.006216829,0.000026880365,0.0000037010495],"category_scores_gemma":[0.00016220126,0.000059832622,0.000039297713,0.000025816462,0.00009177751,0.00086157914,0.0012067172,0.00008264277,0.000015152315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014173474,0.0007905437,0.00074969337,0.001204893,0.0004300251,0.000014326741,0.0043998254,0.00040357263,0.0035140954,0.2307136,0.0684889,0.6891488],"study_design_scores_gemma":[0.00022545115,0.00002219874,0.0010813506,0.000034112996,0.000022360859,0.0000011803905,0.000016935172,0.992035,0.0020722393,0.0016779097,0.0027273344,0.000083945095],"about_ca_topic_score_codex":0.00021068727,"about_ca_topic_score_gemma":0.000002968155,"teacher_disagreement_score":0.9916314,"about_ca_system_score_codex":0.000008010927,"about_ca_system_score_gemma":0.000018927138,"threshold_uncertainty_score":0.99916},"labels":[],"label_agreement":null},{"id":"W2725860187","doi":"","title":"Beyond affinity propagation: message passing algorithms for clustering","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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","funders":"","keywords":"Affinity propagation; Cluster analysis; Inference; Computer science; Propagation of uncertainty; Belief propagation; Set (abstract data type); Benchmark (surveying); Algorithm; Artificial intelligence; Correlation clustering; CURE data clustering algorithm","score_opus":0.03221431082130276,"score_gpt":0.28940464477048916,"score_spread":0.2571903339491864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725860187","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.00010388487,0.00017591847,0.9323389,0.00021270393,0.0037364045,0.0007796671,0.000022479271,0.0003448931,0.06228518],"genre_scores_gemma":[0.018914236,0.00005166552,0.82781935,0.0003674785,0.0018554742,0.00061272294,0.006086998,0.00011315741,0.14417893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981756,0.00003102962,0.00036476387,0.0005843172,0.000385603,0.00045868263],"domain_scores_gemma":[0.9987674,0.00006752257,0.00026778283,0.0006605262,0.0001327294,0.00010408543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004988657,0.00031839355,0.0002913724,0.00019809087,0.0003041908,0.0007689721,0.0011767554,0.00017049622,0.0000728418],"category_scores_gemma":[0.000028403358,0.00029218194,0.00013111012,0.00027886222,0.000013644834,0.0019331211,0.00025130963,0.00017825943,0.000062238134],"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.000010882356,0.0000986779,0.000012116667,0.00050209323,0.00007904523,0.0000051396573,0.00062619033,0.000009776781,0.00013999747,0.03653347,0.007218525,0.95476407],"study_design_scores_gemma":[0.0026814134,0.00034261835,0.005571822,0.000616332,0.00042473685,0.000014833934,0.0013762933,0.81356543,0.011405844,0.018760696,0.14116417,0.004075781],"about_ca_topic_score_codex":0.00001934552,"about_ca_topic_score_gemma":0.00008524428,"teacher_disagreement_score":0.9506883,"about_ca_system_score_codex":0.00005298897,"about_ca_system_score_gemma":0.000066725355,"threshold_uncertainty_score":0.99995303},"labels":[],"label_agreement":null},{"id":"W2732060891","doi":"10.1109/mdm.2017.36","title":"IBS: An Efficient Stateful Algorithm for Optimal Sequenced Group Trip Planning Queries","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stateful firewall; Stateless protocol; Computer science; Context (archaeology); Theoretical computer science; Group (periodic table); Sequence (biology); State (computer science); Algorithm; Geography; Computer network; Traffic engineering","score_opus":0.044302268834994066,"score_gpt":0.3193233892135157,"score_spread":0.27502112037852167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732060891","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.0075454437,0.000029156487,0.9886267,0.00028775036,0.00067184085,0.00036061837,0.00003591068,0.00027921866,0.0021633534],"genre_scores_gemma":[0.03298019,0.000006205828,0.9647608,0.00020483471,0.0001789132,0.0000681271,0.000068093126,0.00001493541,0.0017179187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984949,0.000024107521,0.00021304842,0.0005602931,0.0002657062,0.00044190965],"domain_scores_gemma":[0.9984398,0.000041325424,0.00015073182,0.0011799954,0.00006119674,0.00012697825],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00053527113,0.00017959223,0.00018035286,0.00009127646,0.0007841231,0.0018613802,0.0022063104,0.000040084236,0.000013980724],"category_scores_gemma":[0.00003303143,0.00015173291,0.000061788414,0.000072156814,0.00010101082,0.002233818,0.0006447619,0.00007314535,0.000021762908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017901837,0.00018062646,0.000098226905,0.000025467392,0.00004832841,0.00007442337,0.00087177154,0.002048943,0.00014388391,0.08854035,0.0024796552,0.90547043],"study_design_scores_gemma":[0.0007241502,0.00029024182,0.0009059468,0.000016848493,0.000007792373,0.000002683151,0.00021231738,0.9840982,0.00070820394,0.00061943114,0.012128766,0.0002854101],"about_ca_topic_score_codex":0.00009260277,"about_ca_topic_score_gemma":0.000005855256,"teacher_disagreement_score":0.9820493,"about_ca_system_score_codex":0.000027439022,"about_ca_system_score_gemma":0.000028568362,"threshold_uncertainty_score":0.9991748},"labels":[],"label_agreement":null},{"id":"W2738927942","doi":"10.1007/978-3-319-64367-0_9","title":"Towards Spatially- and Category-Wise k-Diverse Nearest Neighbors Queries","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Skyline; Leverage (statistics); k-nearest neighbors algorithm; Set (abstract data type); Point (geometry); Information retrieval; Variation (astronomy); Data mining; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02146954906912258,"score_gpt":0.24705711732411095,"score_spread":0.22558756825498838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738927942","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.000038357917,0.000448442,0.98369473,0.0011626217,0.002346005,0.00032688671,0.000020973253,0.00015967835,0.011802318],"genre_scores_gemma":[0.12550607,0.00089354755,0.8618632,0.003346655,0.0020044209,0.000025986497,0.00006618954,0.00011357296,0.0061803316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964668,0.000023684097,0.00035646907,0.0016255904,0.00088769034,0.0006397218],"domain_scores_gemma":[0.9970839,0.00011820961,0.00033292908,0.0020844555,0.00015858568,0.00022190405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065202074,0.00056138565,0.0005104419,0.0005886107,0.00062493613,0.002590962,0.0048688618,0.00022767531,0.000030582898],"category_scores_gemma":[0.000099930134,0.0005034971,0.00009063628,0.00017392625,0.0014488471,0.0020435154,0.004758967,0.0005600612,0.000055979446],"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.0000037453137,0.000013806533,0.000099362594,0.000038484868,0.000012249577,0.00023414606,0.0004732532,0.0004528907,0.000007909199,0.043483257,0.00010158935,0.9550793],"study_design_scores_gemma":[0.0011469891,0.00055093085,0.0029527855,0.0006946319,0.00005313951,0.00010367328,0.0000011676265,0.5485183,0.0008163135,0.3786104,0.06373954,0.002812147],"about_ca_topic_score_codex":0.00035175774,"about_ca_topic_score_gemma":0.0004954068,"teacher_disagreement_score":0.95226717,"about_ca_system_score_codex":0.000117271506,"about_ca_system_score_gemma":0.00041650335,"threshold_uncertainty_score":0.9997417},"labels":[],"label_agreement":null},{"id":"W2740924709","doi":"10.1145/3068335","title":"DBSCAN Revisited, Revisited","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2625,"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 Alberta","funders":"","keywords":"Computer science; DBSCAN; Data mining; Heuristics; Information retrieval; Algorithm; Artificial intelligence; Cluster analysis","score_opus":0.03953632886572851,"score_gpt":0.28752780225235086,"score_spread":0.24799147338662236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740924709","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.00016504682,0.00018165381,0.9903804,0.0012666179,0.0012918526,0.00047784034,0.0007400021,0.00034418885,0.0051523754],"genre_scores_gemma":[0.8985859,0.0010683418,0.08268696,0.000776584,0.0007595212,0.00024798347,0.0007591086,0.00008249852,0.015033076],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99810266,0.00009774519,0.00033760883,0.00068082864,0.0004349471,0.00034617627],"domain_scores_gemma":[0.99195564,0.00007793935,0.00022322458,0.0075181434,0.00006713059,0.00015791472],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061441766,0.00022527268,0.00026611713,0.00022134457,0.000998598,0.0015399139,0.0043667434,0.000051836516,0.000059631337],"category_scores_gemma":[0.00009353485,0.0002058787,0.000100106554,0.0002482905,0.000057475037,0.0025277876,0.00015371818,0.00022194604,0.00073983375],"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.00006677807,0.00084321736,0.00051055505,0.0011211472,0.0006515729,0.00061403355,0.00029671265,0.00046478692,0.0013027439,0.13139783,0.11034694,0.75238365],"study_design_scores_gemma":[0.0019656844,0.00021177807,0.001192581,0.001360079,0.00014276197,0.000096235235,0.00011870378,0.07697163,0.0010766507,0.0004371409,0.91517633,0.0012504549],"about_ca_topic_score_codex":0.00028839524,"about_ca_topic_score_gemma":0.000009941318,"teacher_disagreement_score":0.90769345,"about_ca_system_score_codex":0.000043674238,"about_ca_system_score_gemma":0.00002565339,"threshold_uncertainty_score":0.9994966},"labels":[],"label_agreement":null},{"id":"W2741563444","doi":"10.1145/3105831.3105836","title":"Quantifying Eventual Consistency For Aggregate Queries","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Carleton University; Dalhousie University","funders":"","keywords":"Citation; Consistency (knowledge bases); Computer science; Aggregate (composite); Library science; Information retrieval; World Wide Web; Data science; Artificial intelligence","score_opus":0.09404760168267429,"score_gpt":0.3287245843772686,"score_spread":0.2346769826945943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741563444","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.0016539054,0.00005338178,0.97442895,0.0032343757,0.0009149415,0.00019606795,0.0000067375695,0.00015467251,0.019356964],"genre_scores_gemma":[0.6389007,0.00005162634,0.34534913,0.00049679226,0.00016309328,0.000044844248,0.000013052773,0.000010767956,0.014970029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937326,0.0000068803733,0.000105999425,0.0002320392,0.000099939665,0.00018189136],"domain_scores_gemma":[0.9989618,0.000033237404,0.00009422296,0.0008389419,0.000036325757,0.000035441433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020938495,0.00007179278,0.00008704036,0.000031610965,0.00057591865,0.0009254448,0.0012689152,0.000016006343,0.000015110328],"category_scores_gemma":[0.0000872585,0.000059458896,0.000048894148,0.00002426615,0.00005841437,0.0015073391,0.00052552886,0.000025028186,0.000055930726],"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.0000017614304,0.000014167553,0.0005298358,0.0000150805645,0.000014127927,0.000004915232,0.000054796223,3.4533286e-7,0.000041005766,0.84539044,0.006171042,0.14776246],"study_design_scores_gemma":[0.002306152,0.0002986563,0.017282715,0.0001227098,0.00003843424,0.000012053815,0.0003058607,0.17258103,0.0058131795,0.07452856,0.7256523,0.001058369],"about_ca_topic_score_codex":0.00004399485,"about_ca_topic_score_gemma":0.00005378328,"teacher_disagreement_score":0.7708619,"about_ca_system_score_codex":0.00000498048,"about_ca_system_score_gemma":0.000016674263,"threshold_uncertainty_score":0.8924086},"labels":[],"label_agreement":null},{"id":"W2741824765","doi":"10.1007/978-3-319-59511-5_1","title":"GeoComputational Research on Regional Systems","year":2017,"lang":"en","type":"book-chapter","venue":"Advances in geographic information science","topic":"Data Management and Algorithms","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":"Data science; Geographic information system; Heuristics; Computer science; Field (mathematics); Spatial analysis; Context (archaeology); Relation (database); Thematic map; Focus (optics); Geography; Data mining; Cartography","score_opus":0.05994673655828778,"score_gpt":0.35654030714081153,"score_spread":0.2965935705825238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741824765","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.000009161018,0.00049666513,0.06815452,0.0004008654,0.0011596614,0.00047354933,0.000021539303,0.00008823255,0.9291958],"genre_scores_gemma":[0.224215,0.06758458,0.21642892,0.009866153,0.004240715,0.0016798971,0.0020128987,0.00021876002,0.47375306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958603,0.000028549897,0.0004876106,0.00048435555,0.002576233,0.00056299777],"domain_scores_gemma":[0.99744445,0.00020254048,0.00045677504,0.0011348061,0.00064317347,0.00011828316],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0046005743,0.00021519244,0.00020091375,0.0034355412,0.000895565,0.0017708155,0.0042368537,0.00011247484,0.000010660072],"category_scores_gemma":[0.0001123461,0.00020405636,0.00006250576,0.0004809661,0.0012310162,0.017982407,0.0007464143,0.00058762624,0.00033026587],"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.0000021201618,0.000006068799,0.00003597632,0.000029861987,0.0000023882308,0.000005710421,0.000099061755,0.0030564975,1.0774091e-7,0.93236506,0.00044961393,0.06394752],"study_design_scores_gemma":[0.00019305402,0.00007196684,0.00084756094,0.00032885667,0.0000012521742,0.000011262593,0.000030145233,0.055278018,9.303325e-7,0.12360612,0.81936264,0.00026819113],"about_ca_topic_score_codex":0.000023615676,"about_ca_topic_score_gemma":0.0000055015635,"teacher_disagreement_score":0.81891304,"about_ca_system_score_codex":0.00016557332,"about_ca_system_score_gemma":0.0003906108,"threshold_uncertainty_score":0.99926543},"labels":[],"label_agreement":null},{"id":"W2742419825","doi":"","title":"Multiple criteria decision analysis in autonomous computing: a study on independent and coordinated self-management","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Impromptu; Distributed computing; Cloud computing; Multi-agent system; Multiple-criteria decision analysis; Novelty; Mobile ad hoc network; Autonomous agent; Artificial intelligence; Operations research; Engineering; Computer network","score_opus":0.016505393537613846,"score_gpt":0.28572719870640173,"score_spread":0.2692218051687879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742419825","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.829377,0.00007000679,0.1443433,0.000022680764,0.0012846999,0.0024952034,0.000009563595,0.00063165795,0.021765884],"genre_scores_gemma":[0.9730872,0.000020667274,0.023730269,0.000052269024,0.000016675598,0.000040764255,0.00030298767,0.000020303003,0.002728856],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9972228,0.00010935493,0.0005920889,0.00124196,0.00048819248,0.00034563255],"domain_scores_gemma":[0.99853796,0.00009334072,0.00023636593,0.0009649859,0.000071686394,0.00009567921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063715543,0.0004066671,0.00056697003,0.001969382,0.00012196684,0.00072656426,0.0013307626,0.00012431342,0.000039579456],"category_scores_gemma":[0.00001468522,0.00037004528,0.00010153471,0.0016432945,0.000008018102,0.00050180143,0.0007096656,0.00023785567,0.000044296386],"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.00047093673,0.012471451,0.08121094,0.000397082,0.007998566,0.00184126,0.025246883,0.00046037982,0.000012321343,0.018948339,0.0021462482,0.8487956],"study_design_scores_gemma":[0.002285203,0.00040005654,0.73446876,0.000085563064,0.00056404056,6.697045e-7,0.0030176586,0.2576882,0.000023499973,0.0004199143,0.0003576535,0.00068878016],"about_ca_topic_score_codex":0.00048030925,"about_ca_topic_score_gemma":0.0017956938,"teacher_disagreement_score":0.8481068,"about_ca_system_score_codex":0.00008083729,"about_ca_system_score_gemma":0.000019482248,"threshold_uncertainty_score":0.9998751},"labels":[],"label_agreement":null},{"id":"W2748952100","doi":"10.3166/isi.14.5.85-106","title":"Analyse de similarité de trajectoires d'objets mobiles suivant le même itinéraire","year":2009,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Data Management and Algorithms","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":"Humanities; Art","score_opus":0.018219911822722576,"score_gpt":0.2434343150336179,"score_spread":0.2252144032108953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748952100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08702542,0.0022122262,0.8752259,0.0049174246,0.0009901817,0.000653565,0.0001323675,0.00055735937,0.028285524],"genre_scores_gemma":[0.959485,0.00035470902,0.036041517,0.0020595768,0.0002911693,0.000031478976,0.00022269586,0.000015789557,0.0014980792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971824,0.00019111496,0.0008767314,0.00030454964,0.00044608477,0.000999074],"domain_scores_gemma":[0.9983323,0.00008734977,0.00043286956,0.000648372,0.00023916212,0.00025995437],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0012072287,0.0003762525,0.00037077488,0.0004360536,0.0005948459,0.0020978353,0.001066933,0.00021965776,0.000050353283],"category_scores_gemma":[0.0002797147,0.00041458986,0.00019466855,0.0009572052,0.00022424986,0.01629898,0.00022734074,0.00028130153,0.00015515857],"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.000019241183,0.00014077492,0.0005563039,0.00035530346,0.00007915915,0.000061990984,0.00976655,0.004035652,0.00017960278,0.076165065,0.0070048906,0.90163547],"study_design_scores_gemma":[0.0013071821,0.0005679898,0.048561875,0.0009694772,0.00014791489,0.0002981571,0.0036251713,0.796162,0.0042897933,0.060005885,0.0828556,0.0012089562],"about_ca_topic_score_codex":0.00084123004,"about_ca_topic_score_gemma":0.00010366469,"teacher_disagreement_score":0.9004265,"about_ca_system_score_codex":0.00050357037,"about_ca_system_score_gemma":0.0005317131,"threshold_uncertainty_score":0.9998306},"labels":[],"label_agreement":null},{"id":"W2750991217","doi":"10.14778/3137765.3137788","title":"Interactive navigation of open data linkages","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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; Scalability; Cloud computing; The Internet; Big data; Interface (matter); Data mining; Linkage (software); Millisecond; Information retrieval; World Wide Web; Database; Operating system","score_opus":0.07352448097533695,"score_gpt":0.3467404140371007,"score_spread":0.2732159330617637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750991217","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.48272163,0.00036898974,0.031643257,0.052422773,0.006481676,0.00820128,0.00054312707,0.0003067002,0.41731057],"genre_scores_gemma":[0.9792583,0.000025233547,0.019955995,0.000046115416,0.000040815205,0.000013305531,0.000007778519,0.0000044361054,0.00064800703],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991727,0.0000035952316,0.00018765673,0.00027875887,0.00025139295,0.00010593549],"domain_scores_gemma":[0.99829566,0.00001673016,0.0005904602,0.0009603945,0.00011481937,0.000021901882],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0004890842,0.00007657579,0.00012795923,0.000031153922,0.00016594466,0.0006306551,0.013280481,0.000014848073,0.0000044371955],"category_scores_gemma":[0.00011926006,0.000051985196,0.000027841865,0.00007442619,0.000069915994,0.004080686,0.017588599,0.00006786437,0.000004390636],"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.000044339165,0.0007352378,0.01787056,0.00048335668,0.00042779473,0.0000022979493,0.003151432,0.0000061083238,0.042440247,0.36466163,0.05461492,0.51556206],"study_design_scores_gemma":[0.0024688984,0.00031604109,0.07515684,0.001497129,0.00013521075,0.0000091551365,0.0008584633,0.04004428,0.7634811,0.06349241,0.051957164,0.0005833007],"about_ca_topic_score_codex":0.00019393158,"about_ca_topic_score_gemma":0.0000016536487,"teacher_disagreement_score":0.72104084,"about_ca_system_score_codex":0.000015621637,"about_ca_system_score_gemma":0.000013371451,"threshold_uncertainty_score":0.99205816},"labels":[],"label_agreement":null},{"id":"W2751393422","doi":"10.5623/cig2017-102","title":"An Effective Approach to Estimating Computing Time of Vector Data Spatial Computational Domains in WebGIS","year":2017,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"University of California, Santa Barbara","keywords":"Computer science; Decision tree; Visualization; Node (physics); Tree (set theory); Data mining; Estimation; Support vector machine; Supercomputer; Machine learning; Engineering; Operating system","score_opus":0.023262413385873055,"score_gpt":0.2976871799196479,"score_spread":0.27442476653377484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751393422","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.044113122,0.0000019260278,0.95278674,0.00017122236,0.00013732618,0.0004064612,0.000043286793,0.000058248534,0.0022816763],"genre_scores_gemma":[0.49937624,3.1627007e-8,0.5004285,0.000029145998,0.000058586495,0.0000043973946,0.000092765426,0.0000045058023,0.0000058673722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863034,0.000081673694,0.00027876528,0.00046497775,0.0003102513,0.00023399133],"domain_scores_gemma":[0.997867,0.00016095229,0.0002068093,0.0016500906,0.00003963013,0.00007554206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082568417,0.00012057091,0.00022978519,0.00011596354,0.00022828903,0.00039770972,0.003092603,0.0000261077,0.000005653736],"category_scores_gemma":[0.00019785455,0.000117584415,0.000019889494,0.00013464615,0.00006127578,0.001122135,0.0019657596,0.00007586012,0.000063095365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027106587,0.0013858482,0.0068734176,0.00045851202,0.0001510925,0.000043911274,0.0061583794,0.12974234,0.00030214892,0.030218173,0.003344907,0.8212942],"study_design_scores_gemma":[0.0003312231,0.00005408444,0.10762811,0.000058310798,0.000005519675,0.0000019337006,0.000013291357,0.8902287,0.000018531562,0.0015218963,0.000019415113,0.00011898535],"about_ca_topic_score_codex":0.00024398603,"about_ca_topic_score_gemma":0.000011955834,"teacher_disagreement_score":0.82117516,"about_ca_system_score_codex":0.000021456133,"about_ca_system_score_gemma":0.000023451486,"threshold_uncertainty_score":0.5746877},"labels":[],"label_agreement":null},{"id":"W2751679866","doi":"10.1007/s10707-017-0306-1","title":"Knowledge extraction from crowdsourced data for the enrichment of road networks","year":2017,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":13,"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","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data mining; Proxy (statistics); Path (computing); Data science; Attractiveness; Information retrieval; Machine learning","score_opus":0.05533295200460093,"score_gpt":0.31959532437666266,"score_spread":0.26426237237206174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751679866","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.00021741012,0.00012649421,0.9872466,0.0006168872,0.00071597786,0.00032691102,0.000060424223,0.00003868526,0.01065065],"genre_scores_gemma":[0.7933646,0.00025427566,0.20038663,0.0004952305,0.0010053306,0.00012741376,0.0008958737,0.000021092666,0.0034495417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924994,0.000009437389,0.0002626953,0.00015064405,0.00014314728,0.00018412719],"domain_scores_gemma":[0.9963187,0.00016644984,0.00029476167,0.0031450684,0.00004088731,0.000034144345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452834,0.00008569687,0.00011401454,0.000027416194,0.00043914316,0.0005695337,0.0040501878,0.000028114808,0.00001813225],"category_scores_gemma":[0.00007673393,0.000057464324,0.00003863249,0.000045163557,0.000048629718,0.0025533321,0.0014361691,0.00006487952,0.00005387096],"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.000007287747,0.000039120416,0.000029964256,0.000025835767,0.0000711251,3.338389e-7,0.0005814897,0.0002108262,0.0000047782096,0.009281276,0.03604433,0.95370364],"study_design_scores_gemma":[0.00027251622,0.000017882068,0.0048368075,0.00001571986,0.000022631104,4.070874e-7,0.00008091501,0.8674784,0.000024234141,0.00041200506,0.12676783,0.00007068225],"about_ca_topic_score_codex":0.00010232797,"about_ca_topic_score_gemma":0.000018071709,"teacher_disagreement_score":0.95363295,"about_ca_system_score_codex":0.000008557015,"about_ca_system_score_gemma":0.00001770171,"threshold_uncertainty_score":0.7526324},"labels":[],"label_agreement":null},{"id":"W2751694342","doi":"10.14778/3137628.3137630","title":"Trajectory similarity join in spatial networks","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":179,"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":"Beijing Nova Program; King Abdullah University of Science and Technology; National Natural Science Foundation of China; Innovationsfonden","keywords":"Join (topology); Computer science; Pruning; Similarity (geometry); Trajectory; Nearest neighbor search; Heuristic; Matching (statistics); Data mining; Scheduling (production processes); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.017957525548891625,"score_gpt":0.2326463657509419,"score_spread":0.21468884020205029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751694342","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.61113197,0.00068999483,0.12078937,0.034044098,0.009884554,0.005164852,0.00003494446,0.0006155878,0.21764465],"genre_scores_gemma":[0.9957062,0.000034477915,0.0036973408,0.00013590323,0.00010679132,0.000020282738,4.767567e-7,0.000005522338,0.00029297575],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99897367,0.000005084467,0.00020604536,0.00027764752,0.00028817652,0.00024939867],"domain_scores_gemma":[0.99923086,0.00001206393,0.00025904135,0.00041569507,0.000043804364,0.000038550115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047627816,0.000114710565,0.00014758695,0.000057797843,0.00020435259,0.0003233687,0.0027833115,0.000034773304,0.0000067041615],"category_scores_gemma":[0.00006288499,0.000083354986,0.00006796947,0.00009639008,0.00007470499,0.0008001223,0.0015572353,0.00014951445,0.0000033723093],"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.00008183008,0.0012035789,0.24829292,0.00039802957,0.0001467031,0.00001722348,0.0021305052,0.00063407986,0.0059012426,0.23371635,0.033703383,0.47377414],"study_design_scores_gemma":[0.002774164,0.00019681864,0.7102966,0.00032208135,0.000042472344,0.000006086137,0.00012286418,0.22558244,0.03072217,0.018450417,0.010794926,0.00068900123],"about_ca_topic_score_codex":0.00029543447,"about_ca_topic_score_gemma":0.000052325548,"teacher_disagreement_score":0.47308514,"about_ca_system_score_codex":0.000041239076,"about_ca_system_score_gemma":0.000012204574,"threshold_uncertainty_score":0.51721317},"labels":[],"label_agreement":null},{"id":"W2753982414","doi":"10.1145/3126973.3126979","title":"Compressing Trajectory for Trajectory Indexing","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"BC Research (Canada)","funders":"National Research Foundation","keywords":"Trajectory; Computer science; Global Positioning System; Raw data; Volume (thermodynamics); Search engine indexing; Data compression; Big data; Data mining; Artificial intelligence; Telecommunications","score_opus":0.053816577242600604,"score_gpt":0.30010830622253926,"score_spread":0.24629172897993865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753982414","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.0015531543,0.000035708315,0.9581181,0.00042531567,0.0007361898,0.00017217072,0.0000031318746,0.00018754507,0.03876868],"genre_scores_gemma":[0.6461138,0.0000061570036,0.34540486,0.0004934657,0.00033810714,0.000032387623,0.000007619757,0.000014965735,0.007588585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992052,0.000011297957,0.000116005394,0.00029553875,0.00013752317,0.00023445938],"domain_scores_gemma":[0.9988497,0.000063679654,0.00009139764,0.00091877347,0.000025114647,0.000051362393],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00024937876,0.000094440045,0.000107103224,0.000060064933,0.0006404584,0.0011079257,0.0018200735,0.000027253807,0.000015340684],"category_scores_gemma":[0.000038924445,0.000084008076,0.00006017612,0.000028849325,0.00004778068,0.0017266457,0.0003796418,0.000056738067,0.000018195396],"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.0000069300318,0.00008981009,0.0011164388,0.00006427942,0.000052080148,0.000014697357,0.00034032762,0.000071737726,0.0013365383,0.14549588,0.018293267,0.833118],"study_design_scores_gemma":[0.0023437347,0.00013513358,0.03946399,0.00008965072,0.00002598514,0.000003743201,0.00010354858,0.7038543,0.006813972,0.009093254,0.2371739,0.0008987745],"about_ca_topic_score_codex":0.00002635897,"about_ca_topic_score_gemma":0.000014534477,"teacher_disagreement_score":0.83221924,"about_ca_system_score_codex":0.000013270687,"about_ca_system_score_gemma":0.00001927164,"threshold_uncertainty_score":0.999929},"labels":[],"label_agreement":null},{"id":"W2758103571","doi":"","title":"Mining thick skylines over large databases","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Pruning; Computer science; Search engine indexing; Computation; Data mining; Representation (politics); Database; Operator (biology); Information retrieval; Algorithm","score_opus":0.03296461356241734,"score_gpt":0.28417163515554805,"score_spread":0.2512070215931307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758103571","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.005501271,0.000050475624,0.9707309,0.0012350933,0.000332363,0.000056976478,0.0000099709605,0.0002645963,0.02181834],"genre_scores_gemma":[0.16053079,0.000046703743,0.8263283,0.005121718,0.00032251628,0.000008505239,0.000099313416,0.000012801647,0.0075293537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926215,0.000007661474,0.00009685899,0.0002519122,0.00017367073,0.00020774218],"domain_scores_gemma":[0.99940246,0.000021027548,0.000024424262,0.00049618736,0.000015198742,0.00004069161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016674909,0.00007624008,0.00006488846,0.000056964112,0.000078795674,0.00017218413,0.0006438759,0.000010798556,0.000105589206],"category_scores_gemma":[0.000019972746,0.000060556675,0.000023631568,0.00021770767,0.000011298515,0.0014290453,0.00068670866,0.000037395705,0.00020621187],"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":[6.3834744e-7,0.000078093966,0.0008737761,0.0000063933203,0.000010714576,0.00003316945,0.00008943125,0.000017115171,0.00003427749,0.96475106,0.016191714,0.017913641],"study_design_scores_gemma":[0.0025546995,0.000091443726,0.010135364,0.00009214642,0.000018231047,0.000012539381,0.0003055365,0.054689243,0.00335891,0.006209098,0.9217184,0.0008143438],"about_ca_topic_score_codex":0.00010172185,"about_ca_topic_score_gemma":0.000091097725,"teacher_disagreement_score":0.9585419,"about_ca_system_score_codex":0.000012629883,"about_ca_system_score_gemma":0.000016511232,"threshold_uncertainty_score":0.26505053},"labels":[],"label_agreement":null},{"id":"W2760295842","doi":"10.1109/mcg.2017.3621221","title":"ANALYTiC: An Active Learning System for Trajectory Classification","year":2017,"lang":"en","type":"article","venue":"IEEE Computer Graphics and Applications","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Computer science; Trajectory; Task (project management); Active learning (machine learning); Artificial intelligence; Process (computing); Set (abstract data type); Machine learning; Annotation; Domain (mathematical analysis); Semi-supervised learning; Semantic Web","score_opus":0.046744834369461016,"score_gpt":0.29522404153133525,"score_spread":0.24847920716187422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760295842","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.0032669518,0.000014957586,0.99516976,0.00026500033,0.00018360077,0.00044961198,0.000016159604,0.00016225896,0.000471706],"genre_scores_gemma":[0.9629348,0.00003935872,0.03605721,0.000069037385,0.00042127486,0.00034016863,0.00004921837,0.0000110020355,0.00007794749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991129,0.000022683666,0.00014633032,0.0004523125,0.00010843551,0.00015731339],"domain_scores_gemma":[0.9987001,0.000050407627,0.00018750329,0.0008753216,0.00009879771,0.00008790026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000220562,0.00010888523,0.00011922775,0.00011367052,0.0011698897,0.00085900084,0.0009774053,0.000043368054,2.6363523e-7],"category_scores_gemma":[0.0000023426776,0.00010727219,0.000050125538,0.0000998036,0.00007695124,0.0008223187,0.00012135738,0.000096680895,0.0000047770877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017438763,0.000047072663,0.0002447458,0.00003537218,0.000028126655,4.1893603e-7,0.00007856505,0.000040560713,0.000121411875,0.72877914,0.00020202727,0.27042085],"study_design_scores_gemma":[0.00029275668,0.00006761382,0.019249761,0.000013345685,0.00002390413,0.0000025608556,0.00004325027,0.95491743,0.00014848782,0.0035538133,0.02150134,0.00018574287],"about_ca_topic_score_codex":0.000014472383,"about_ca_topic_score_gemma":0.000010687181,"teacher_disagreement_score":0.9596678,"about_ca_system_score_codex":0.000013575724,"about_ca_system_score_gemma":0.000015187479,"threshold_uncertainty_score":0.89979637},"labels":[],"label_agreement":null},{"id":"W2763207634","doi":"","title":"Succinct representation of labeled graphs","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"","keywords":"Computer science; Combinatorics; Vertex (graph theory); Adjacency list; Representation (politics); Planar graph; Graph; Theoretical computer science; Mathematics; Algorithm","score_opus":0.018967866383620594,"score_gpt":0.27900091329780147,"score_spread":0.2600330469141809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763207634","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.033204295,0.000010994059,0.9192096,0.00020964272,0.00016142121,0.0000672055,4.5225178e-7,0.00008509876,0.04705127],"genre_scores_gemma":[0.884141,0.000008128224,0.11327667,0.00014275414,0.000017684722,8.605092e-7,0.000006522713,0.0000022234728,0.0024041329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99950683,0.000007980184,0.00011973584,0.00012908434,0.00013930474,0.00009708728],"domain_scores_gemma":[0.99956685,0.000033807184,0.000038942362,0.00030913364,0.000029262692,0.000021989563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002666156,0.000034195404,0.00005264486,0.00009481333,0.000018798546,0.000029399285,0.0003694542,0.000010125579,0.000030281595],"category_scores_gemma":[0.000011394408,0.00002854655,0.00002291265,0.0004683706,0.000010803087,0.0004516263,0.00013586554,0.000018271447,0.000022821523],"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.0000033650474,0.00005386728,0.008415217,0.0000071791255,0.000015632753,0.000010782086,0.00009709995,0.0000032862076,0.001685135,0.77810025,0.0054323724,0.20617583],"study_design_scores_gemma":[0.0029147125,0.00036826378,0.41936156,0.00003124843,0.000032775275,0.000010087311,0.00042047058,0.06264423,0.37685218,0.11177685,0.024817938,0.00076968956],"about_ca_topic_score_codex":0.00006566404,"about_ca_topic_score_gemma":0.000020243311,"teacher_disagreement_score":0.8509367,"about_ca_system_score_codex":0.000003025851,"about_ca_system_score_gemma":0.000003210975,"threshold_uncertainty_score":0.11640945},"labels":[],"label_agreement":null},{"id":"W2763926089","doi":"10.48550/arxiv.1710.02058","title":"Skyline Computation with Noisy Comparisons","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Computation; Artificial intelligence; Data mining; Algorithm","score_opus":0.10133170189627634,"score_gpt":0.20654120294150002,"score_spread":0.10520950104522368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763926089","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.013487915,0.000022130456,0.9758828,0.00029466095,0.00051041483,0.0002677724,0.000026877846,0.0002936709,0.009213706],"genre_scores_gemma":[0.97349024,0.000053004263,0.022959825,0.00006619619,0.00009042518,7.2321217e-7,0.00015304344,0.000014389578,0.0031721643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983858,0.00005940311,0.00013974523,0.0010032691,0.00012081963,0.0002909889],"domain_scores_gemma":[0.9977405,0.000039450093,0.00037015276,0.0015925794,0.00013321845,0.00012406666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018198363,0.00028383997,0.00031077556,0.00021574393,0.00031412317,0.0005445674,0.002865432,0.000119401404,0.000010035654],"category_scores_gemma":[0.000009113599,0.0002900937,0.0000955883,0.00023213784,0.00012960326,0.000857464,0.003026544,0.0003988777,0.00014464834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006420515,0.00041716016,0.008919976,0.00021621809,0.00046575203,0.0015212465,0.000231725,0.5877348,0.0000044078056,0.3683032,0.019376013,0.0127452575],"study_design_scores_gemma":[0.00061582995,0.00006112583,0.0039337534,0.000094651354,0.00007729934,0.0000027122076,0.000024765364,0.98027164,0.000011271736,0.009514283,0.004947431,0.00044521224],"about_ca_topic_score_codex":0.00018507341,"about_ca_topic_score_gemma":0.00009479874,"teacher_disagreement_score":0.9600023,"about_ca_system_score_codex":0.00007955508,"about_ca_system_score_gemma":0.00010312316,"threshold_uncertainty_score":0.9999551},"labels":[],"label_agreement":null},{"id":"W2765471337","doi":"10.5555/3107979.3107989","title":"Generating stochastic data to simulate a twitter user","year":2017,"lang":"en","type":"article","venue":"Communications and Networking Symposium","topic":"Data Management and Algorithms","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; Recommender system; Collaborative filtering; Similarity (geometry); Weibull distribution; Information retrieval; Cluster analysis; tf–idf; Data mining; Term (time); Machine learning; Artificial intelligence; Mathematics; Statistics","score_opus":0.12875455410999564,"score_gpt":0.34185262015695855,"score_spread":0.2130980660469629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765471337","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.0032429425,0.0008390131,0.97276825,0.019760104,0.0006874178,0.00031665672,0.000010720965,0.00014192643,0.002232948],"genre_scores_gemma":[0.8652562,0.00037532186,0.13201298,0.0011843084,0.00032676687,0.000021007545,0.000063194784,0.000012961284,0.00074730226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991432,0.000047094472,0.00015864286,0.0003438019,0.000098518365,0.00020877058],"domain_scores_gemma":[0.9912432,0.0000914061,0.000107111875,0.008449152,0.000031805466,0.00007733785],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00041511506,0.000102859005,0.00010674481,0.00004864499,0.0014516934,0.0016531806,0.007079501,0.000024504001,0.0000013811698],"category_scores_gemma":[0.000014132661,0.000098497505,0.000014661637,0.00008544716,0.000067754714,0.0009022326,0.012632996,0.000110368615,0.000020632204],"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.000008963876,0.00021720811,0.0034073407,0.000033876393,0.00019362968,0.000012847021,0.0023870864,0.010958437,0.0017104157,0.038169395,0.03550708,0.9073937],"study_design_scores_gemma":[0.00011208013,0.0000137499155,0.00030878396,0.000044661425,0.000010741228,0.0000016910317,0.000006673522,0.84519154,0.0000014352777,0.00015151995,0.15403034,0.00012679034],"about_ca_topic_score_codex":0.000035229852,"about_ca_topic_score_gemma":0.00003657734,"teacher_disagreement_score":0.9072669,"about_ca_system_score_codex":0.000008420842,"about_ca_system_score_gemma":0.000011402594,"threshold_uncertainty_score":0.9998483},"labels":[],"label_agreement":null},{"id":"W2765816511","doi":"10.14778/3151106.3151111","title":"Efficient mining of regional movement patterns in semantic trajectories","year":2017,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Trajectory; Computer science; Focus (optics); Data mining; Movement (music); Scheme (mathematics); Semantics (computer science); Space (punctuation); Key (lock); Artificial intelligence; Mathematics","score_opus":0.023246962939578505,"score_gpt":0.242734101600947,"score_spread":0.21948713866136849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765816511","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.99427193,0.000037474285,0.0012779103,0.0017810205,0.0003438253,0.00033244837,0.0000051970574,0.000018658895,0.0019315606],"genre_scores_gemma":[0.9958568,0.000013570392,0.003828165,0.0000677956,0.000030564166,0.000021614147,4.33814e-7,0.0000049456617,0.00017607815],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99877894,0.0000038720577,0.0002895356,0.0002547335,0.00046444795,0.0002084896],"domain_scores_gemma":[0.999101,0.000016870366,0.00042405093,0.00035988438,0.00007014482,0.000028043352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038973708,0.00011375884,0.00017333038,0.00009333963,0.00012330971,0.00012897934,0.0020039787,0.000019024363,0.0000038330973],"category_scores_gemma":[0.00004274173,0.00008144228,0.00007138026,0.000113043505,0.000074522985,0.00024678087,0.0011461632,0.00005874729,0.0000010370734],"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.000055516328,0.0013932863,0.59383374,0.0011885181,0.00022141686,0.00000770191,0.01128236,0.0006467534,0.034364786,0.31047603,0.0030341714,0.04349568],"study_design_scores_gemma":[0.0024131376,0.00027102363,0.76624763,0.0013611863,0.00005170375,0.000004229427,0.0017373621,0.054835662,0.16468422,0.006889146,0.0009875228,0.00051717914],"about_ca_topic_score_codex":0.00017394153,"about_ca_topic_score_gemma":0.00001076283,"teacher_disagreement_score":0.3035869,"about_ca_system_score_codex":0.00003814222,"about_ca_system_score_gemma":0.000013945787,"threshold_uncertainty_score":0.37239242},"labels":[],"label_agreement":null},{"id":"W2766521183","doi":"10.1017/9781316105450.011","title":"Spatio-temporal Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Data Management and Algorithms","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 Northern British Columbia","funders":"","keywords":"Computer science; Geography","score_opus":0.02772968181758098,"score_gpt":0.20580803190245903,"score_spread":0.17807835008487805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766521183","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.0000044352605,0.00005296411,0.022024367,0.00004202061,0.0006317633,0.00028753793,0.00016635499,0.000274874,0.9765157],"genre_scores_gemma":[0.00025106609,0.00007156625,0.0021685944,0.000060763086,0.000104118815,4.3901727e-7,0.00016499119,0.000023799928,0.99715465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984668,0.000020308285,0.00014938289,0.00071537314,0.00035448663,0.00029363265],"domain_scores_gemma":[0.9974313,0.000021617616,0.00034631332,0.0019381033,0.00010364497,0.0001590576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012307958,0.00035293563,0.0003282873,0.00025370799,0.00040497028,0.00041718743,0.0034656248,0.00020417958,0.0000039478036],"category_scores_gemma":[0.000004776161,0.00041560747,0.00021848857,0.0000052519217,0.00020115536,0.0006669492,0.0021902337,0.000323001,0.000066343215],"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.000007223325,0.0000047953736,0.0000032709602,0.00002809485,0.000076322445,0.00048257798,0.000012319482,2.5196385e-7,3.9982308e-7,0.8830922,0.10394358,0.012348924],"study_design_scores_gemma":[0.0003517813,0.000033594722,0.000022186074,0.0000817873,0.000067126086,0.0000051713555,0.0000020699265,0.00062878156,0.000022061116,0.00024600644,0.99807185,0.00046759468],"about_ca_topic_score_codex":0.00017394667,"about_ca_topic_score_gemma":0.0000065790564,"teacher_disagreement_score":0.89412826,"about_ca_system_score_codex":0.000069778616,"about_ca_system_score_gemma":0.00007116173,"threshold_uncertainty_score":0.9998296},"labels":[],"label_agreement":null},{"id":"W2766616325","doi":"10.5194/isprs-annals-iv-4-w2-125-2017","title":"A SPARK BASED COMPUTING FRAMEWORK FOR SPATIAL DATA","year":2017,"lang":"en","type":"article","venue":"ISPRS annals of the photogrammetry, remote sensing and spatial information sciences","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"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":"National Administration of Surveying, Mapping and Geoinformation of China; Canadian Institute of Steel Construction","keywords":"Spatial query; SPARK (programming language); Computer science; Spatial analysis; Raster graphics; Spatial database; Grid; Raster data; Data mining; Range query (database); Layer (electronics); Database; Information retrieval; Computer graphics (images); Remote sensing; Web query classification; Geography; Web search query","score_opus":0.13931688226471753,"score_gpt":0.3723766269351537,"score_spread":0.2330597446704362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766616325","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.0014482123,0.00001718179,0.99013305,0.0064687864,0.0009942629,0.000317815,0.000048241796,0.00004222918,0.0005302186],"genre_scores_gemma":[0.8393885,0.000013727126,0.15921374,0.0012581537,0.00009917709,9.888863e-8,0.000015379217,0.000003241886,0.000007992115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998369,0.00005291025,0.00040999192,0.0003076384,0.000523984,0.00033651],"domain_scores_gemma":[0.99714565,0.0002439012,0.000790453,0.0015481784,0.00019535566,0.00007643483],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002154533,0.00015026443,0.00020995729,0.00016196832,0.0015704447,0.0020784454,0.0029852858,0.000058691025,0.0000012059055],"category_scores_gemma":[0.0014132331,0.00010767598,0.00008111409,0.0002811481,0.0004469357,0.0015012037,0.0014511896,0.00011349653,0.0000020942705],"study_design_candidate":"design_other","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.0000074150057,0.0000064774263,0.00008831924,0.000026690634,0.000009345276,1.8349276e-7,0.00013479048,0.00015640451,0.000010171022,0.0002525091,0.00057495624,0.99873275],"study_design_scores_gemma":[0.00019120502,0.00007186771,0.0018582086,0.00013400633,0.000008268124,0.0000019841768,0.000066773864,0.98302126,0.0019321572,0.0048495675,0.0077174376,0.00014727475],"about_ca_topic_score_codex":0.07028834,"about_ca_topic_score_gemma":0.0029591082,"teacher_disagreement_score":0.99858546,"about_ca_system_score_codex":0.0000045643847,"about_ca_system_score_gemma":0.00007410566,"threshold_uncertainty_score":0.9997294},"labels":[],"label_agreement":null},{"id":"W2772601103","doi":"10.1109/tits.2017.2774186","title":"Mass Evidence Accumulation and Traveler Risk Scoring Engine in e-Border Infrastructure","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Data Management and Algorithms","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Cover (algebra); Inference; Computer science; Demonstrative; Component (thermodynamics); Estimation; Risk analysis (engineering); Causal inference; Risk assessment; Data science; Operations research; Engineering; Computer security; Systems engineering; Artificial intelligence; Econometrics; Business; Economics","score_opus":0.04974927922742074,"score_gpt":0.32164726835225094,"score_spread":0.2718979891248302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772601103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066766195,0.00010877759,0.93098146,0.00011644017,0.0013720685,0.00045549194,0.000038440136,0.00009416714,0.000066981695],"genre_scores_gemma":[0.9947397,0.0007155273,0.004165664,0.000017693788,0.00004537992,0.00006781015,0.000007612059,0.000014734974,0.00022588622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835736,0.00005977724,0.00048577343,0.00050305016,0.00035756885,0.00023649221],"domain_scores_gemma":[0.99881095,0.00009960664,0.00023871602,0.00068823993,0.000076531476,0.00008593306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041256318,0.00021366091,0.00021594498,0.00031147836,0.00036980805,0.0005887019,0.0006074277,0.00009172622,0.000024811661],"category_scores_gemma":[0.000009549967,0.00020891045,0.00006208412,0.0002165951,0.00004546314,0.0022559154,0.0000012278626,0.0002686404,0.00001949085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005784981,0.00009168831,0.010620492,0.00022055462,0.00009701988,0.000031821543,0.0028591042,0.6239514,0.00041936824,0.0025663052,0.00003079935,0.35905358],"study_design_scores_gemma":[0.00090837415,0.00014719894,0.16777469,0.00082304864,0.00007676697,0.000004754344,0.00043082953,0.8205359,0.006993568,0.0005616828,0.001096784,0.00064638583],"about_ca_topic_score_codex":0.000578594,"about_ca_topic_score_gemma":0.00029623788,"teacher_disagreement_score":0.9279735,"about_ca_system_score_codex":0.000057231482,"about_ca_system_score_gemma":0.000024481604,"threshold_uncertainty_score":0.8519121},"labels":[],"label_agreement":null},{"id":"W2772756146","doi":"10.1155/2017/5656323","title":"A Gradual Approach for Multimodel Journey Planning: A Case Study in Izmir, Turkey","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Data Management and Algorithms","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":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Dijkstra's algorithm; Public transport; Computer science; Router; Graph; Plan (archaeology); Transportation planning; Route planning; Operations research; Motion planning; Routing (electronic design automation); Node (physics); Transport engineering; Routing algorithm; Shortest path problem; Engineering; Robot; Artificial intelligence; Computer network; Routing protocol","score_opus":0.06903255165066252,"score_gpt":0.3468965048434949,"score_spread":0.27786395319283236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772756146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44308242,0.000027348255,0.55631375,0.000069416645,0.0002011017,0.00027195612,0.0000035677715,0.00000807555,0.000022330501],"genre_scores_gemma":[0.7475924,0.0000067322967,0.25228703,0.000013377869,0.000058805595,0.000013100394,0.0000058768815,0.0000064633496,0.000016221562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988557,0.000018342176,0.00048758934,0.00020316467,0.00026206273,0.00017314448],"domain_scores_gemma":[0.99880886,0.00003341964,0.00063181785,0.00032147308,0.00013386017,0.00007058176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005382753,0.00011732383,0.00022286407,0.00020433748,0.00019696211,0.00021245342,0.0006774607,0.000026817152,3.7622416e-7],"category_scores_gemma":[0.00003323918,0.00010203019,0.000084102314,0.00009220821,0.000017712136,0.002989658,0.000011961368,0.00016554334,1.7794807e-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.00061076536,0.0031003247,0.04348984,0.00017343354,0.00023131048,0.015013341,0.047881383,0.7378858,0.00035460782,0.002893356,0.00028204464,0.14808385],"study_design_scores_gemma":[0.027248537,0.00255997,0.45035112,0.00023745417,0.00020260536,0.00089283445,0.021590222,0.4899835,0.00020434885,0.0052259187,0.00066291145,0.00084057555],"about_ca_topic_score_codex":0.00004490749,"about_ca_topic_score_gemma":0.000053452313,"teacher_disagreement_score":0.4068613,"about_ca_system_score_codex":0.000024749435,"about_ca_system_score_gemma":0.000035034223,"threshold_uncertainty_score":0.41606706},"labels":[],"label_agreement":null},{"id":"W2775284932","doi":"","title":"An ontology-based method for quality assessment of spatial data bases","year":2004,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Centre de Géomatique du Québec","funders":"","keywords":"Ontology; Consistency (knowledge bases); Computer science; Data mining; Relation (database); Quality (philosophy); Data integrity; Process (computing); Knowledge base; Data quality; Set (abstract data type); Information retrieval; Database; Artificial intelligence; Engineering; Programming language","score_opus":0.058245010735814416,"score_gpt":0.3523763359320248,"score_spread":0.2941313251962104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775284932","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.0020226105,0.000034991255,0.9860038,0.008163847,0.0001178389,0.0003176824,0.0001876005,0.0001369527,0.003014635],"genre_scores_gemma":[0.21033673,0.000008264948,0.7884242,0.00018605946,0.00001037297,0.00002302209,0.0008478225,0.000008536197,0.00015502053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959107,0.0024350046,0.00040404397,0.00067713216,0.00033296962,0.00024017044],"domain_scores_gemma":[0.99379325,0.0011572089,0.0003281694,0.0038835027,0.0007349323,0.0001029248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009078723,0.00014420712,0.00023804516,0.00011642783,0.00019841043,0.00023618422,0.0034615884,0.000055661643,0.00002173835],"category_scores_gemma":[0.0006576517,0.00014501026,0.000071911025,0.00028983856,0.00009995261,0.0007651358,0.00077498105,0.00010068514,0.0000028918355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069758566,0.0011298222,0.0014374334,0.00007631918,0.000035621735,0.0000015231584,0.0005199349,0.00025381398,0.0027594217,0.7365177,0.00025920695,0.25700223],"study_design_scores_gemma":[0.0018452203,0.000003775689,0.017476076,0.00018832245,0.00003323357,0.0000015321575,0.000051082327,0.9163101,0.041485637,0.011027369,0.011240744,0.00033692154],"about_ca_topic_score_codex":0.0030854521,"about_ca_topic_score_gemma":0.003342159,"teacher_disagreement_score":0.9160563,"about_ca_system_score_codex":0.000045287747,"about_ca_system_score_gemma":0.00026982132,"threshold_uncertainty_score":0.643255},"labels":[],"label_agreement":null},{"id":"W2777217533","doi":"10.1145/3139958.3140007","title":"Best-Compromise In-Route Nearest Neighbor Queries","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Ciência sem Fronteiras; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Compromise; Skyline; Computer science; Context (archaeology); Point of interest; Point (geometry); k-nearest neighbors algorithm; Path (computing); Algorithm; Theoretical computer science; Mathematical optimization; Data mining; Mathematics; Artificial intelligence","score_opus":0.029459686774400497,"score_gpt":0.28215890065086247,"score_spread":0.252699213876462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777217533","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.07582465,0.00009841629,0.3229683,0.014366145,0.0023707708,0.00060677005,0.000009957189,0.00048543434,0.58326954],"genre_scores_gemma":[0.8566037,0.00005181379,0.10948937,0.00058761775,0.00017635745,0.000025458941,0.000008392888,0.000011852889,0.033045467],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992237,0.000011240422,0.00011891522,0.00028794032,0.00014029183,0.00021792718],"domain_scores_gemma":[0.9986211,0.000014330693,0.00005981205,0.0012374556,0.000015618198,0.000051695755],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0001392865,0.0000923596,0.00010288268,0.00005729227,0.00021933077,0.0012733086,0.0020330509,0.000022357113,0.0000603173],"category_scores_gemma":[0.000031467327,0.000077562916,0.000026747894,0.00006185505,0.000059170372,0.002235333,0.0010265665,0.00006410141,0.0004819787],"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.000006367206,0.00015395477,0.034820467,0.000022194385,0.000016353233,0.00018502735,0.0002613151,0.000013800061,0.000080490456,0.47521195,0.00578409,0.48344398],"study_design_scores_gemma":[0.002215279,0.00018954503,0.42152038,0.000092552495,0.000011365399,0.000007372797,0.00012327314,0.2139895,0.0012779142,0.017588891,0.3420326,0.00095129834],"about_ca_topic_score_codex":0.00066106074,"about_ca_topic_score_gemma":0.0002955489,"teacher_disagreement_score":0.780779,"about_ca_system_score_codex":0.000012210158,"about_ca_system_score_gemma":0.000016902097,"threshold_uncertainty_score":0.9997635},"labels":[],"label_agreement":null},{"id":"W2780497540","doi":"10.1145/3139958.3140039","title":"MinMax Routing","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Minimax; Routing (electronic design automation); Computer science; Mathematical optimization; Set (abstract data type); SAFER; Point (geometry); Path (computing); Focus (optics); Computer network; Mathematics","score_opus":0.028351550689226925,"score_gpt":0.2709557054882775,"score_spread":0.2426041547990506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780497540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005476979,0.0000028037357,0.6117135,0.0017160489,0.000295762,0.000023091696,2.08347e-7,0.00008395976,0.3856169],"genre_scores_gemma":[0.8182105,0.0000028400427,0.1531312,0.00040459775,0.0001044749,0.000001756201,7.290918e-7,0.0000023706746,0.028141549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996311,0.0000028621284,0.000040475363,0.00012255755,0.00010519755,0.00009781584],"domain_scores_gemma":[0.9991495,0.0000050825715,0.000031981952,0.0007795551,0.000013082044,0.000020806512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016023869,0.00003077333,0.000030215944,0.000013532657,0.00024024917,0.0008333154,0.0014880416,0.0000067270835,0.000024788733],"category_scores_gemma":[0.000031478125,0.000024705485,0.000013457705,0.000015504984,0.0000120085915,0.0011047977,0.00077235786,0.000019018049,0.0002585749],"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":[1.0208003e-7,0.0000071692075,0.00094538357,0.0000011772727,0.0000035548273,0.000009434609,0.000030814335,3.2303225e-7,0.000016497153,0.56640726,0.015604785,0.41697347],"study_design_scores_gemma":[0.00060962024,0.000043909968,0.061976466,0.000018396762,0.0000056519625,0.0000045712445,0.0000456445,0.45017704,0.0021291524,0.018957142,0.4655814,0.00045103175],"about_ca_topic_score_codex":0.000039692528,"about_ca_topic_score_gemma":0.000005753412,"teacher_disagreement_score":0.8176628,"about_ca_system_score_codex":0.0000040478417,"about_ca_system_score_gemma":0.0000044696167,"threshold_uncertainty_score":0.803568},"labels":[],"label_agreement":null},{"id":"W2781981262","doi":"","title":"Regroupement optimal d'objets à l'intérieur d'un nombre imposé de classes de taille égale","year":2013,"lang":"fr","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Université Laval","keywords":"Humanities; Limiting; Markov chain; Mathematics; Statistics; Philosophy; Engineering","score_opus":0.017946065131416635,"score_gpt":0.239573740625335,"score_spread":0.22162767549391837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781981262","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.036028326,0.0019425187,0.85503846,0.035018343,0.002015517,0.00084551447,0.000025035812,0.00037283095,0.06871343],"genre_scores_gemma":[0.08917247,0.0009020817,0.6620057,0.005568881,0.00085086445,0.00016617664,0.00004276387,0.00005981412,0.2412312],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966047,0.00017725506,0.0004899165,0.00083404686,0.00045840157,0.0014356901],"domain_scores_gemma":[0.99798125,0.00010018425,0.00015255611,0.0011363651,0.00015419844,0.00047542353],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007287158,0.0004134094,0.0003127289,0.00014128258,0.0002993419,0.0017432435,0.0019138571,0.00015953666,0.005092989],"category_scores_gemma":[0.000054601627,0.0003995309,0.00016902588,0.00049250963,0.00017008481,0.0032049962,0.0017701796,0.00030593429,0.0035083327],"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.000006727087,0.0005383917,0.0030992907,0.00013334338,0.0001728675,0.00019029058,0.0010149502,0.00037933406,0.0006929843,0.122632995,0.5173481,0.35379073],"study_design_scores_gemma":[0.0011219885,0.00046402015,0.02077848,0.00011257548,0.00008120355,0.00010427825,0.0007307037,0.5198405,0.0048633674,0.0045702504,0.4463831,0.00094955356],"about_ca_topic_score_codex":0.0022287932,"about_ca_topic_score_gemma":0.00006896855,"teacher_disagreement_score":0.51946115,"about_ca_system_score_codex":0.00021596684,"about_ca_system_score_gemma":0.00019922973,"threshold_uncertainty_score":0.9998457},"labels":[],"label_agreement":null},{"id":"W2788558106","doi":"10.1145/3178876.3186078","title":"Strategies for Geographical Scoping and Improving a Gazetteer","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scope (computer science); Hierarchy; Computer science; Boundary (topology); Baseline (sea); Information retrieval; Probabilistic logic; Quality (philosophy); Pairwise comparison; Volunteered geographic information; Data mining; Geography; Position (finance); Geotagging; Data science; Artificial intelligence; Mathematics","score_opus":0.018918393147419416,"score_gpt":0.26777508309470655,"score_spread":0.24885668994728713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788558106","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.0028057208,0.000028263685,0.99092996,0.0006284343,0.00013486444,0.00015001847,7.5044807e-7,0.00010916324,0.0052128383],"genre_scores_gemma":[0.45921707,0.000008164858,0.5389865,0.0010501997,0.00028493674,0.000027865817,0.0000027696778,0.0000062403938,0.00041626187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948967,0.0000048437555,0.00006915336,0.00021436604,0.00006712044,0.00015488116],"domain_scores_gemma":[0.99971604,0.000025010846,0.000016538543,0.00018316004,0.000029179791,0.000030058696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014961285,0.00005270311,0.000052087817,0.000055996414,0.000104783634,0.00058012817,0.0002733736,0.00001553278,0.000010359999],"category_scores_gemma":[0.0000064704577,0.00004229352,0.00001576032,0.000109671164,0.000055524382,0.0009660122,0.00025503914,0.00002144349,0.000005618389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020523255,0.000011967884,0.00015232537,0.000061895465,0.000010428244,0.0000011084977,0.00011088598,2.8423116e-7,0.00036434626,0.7934873,0.0023644979,0.20343292],"study_design_scores_gemma":[0.0013331088,0.0007248266,0.0037007155,0.00017712443,0.000021173497,0.000008582743,0.00052768044,0.88973606,0.0015147828,0.08627488,0.015307167,0.0006739102],"about_ca_topic_score_codex":0.000019718216,"about_ca_topic_score_gemma":0.000022779053,"teacher_disagreement_score":0.88973576,"about_ca_system_score_codex":0.0000016174135,"about_ca_system_score_gemma":0.00001363998,"threshold_uncertainty_score":0.5594189},"labels":[],"label_agreement":null},{"id":"W2788561287","doi":"10.48550/arxiv.1802.10233","title":"Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources","year":2018,"lang":"en","type":"article","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Data Management and Algorithms","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":"Université du Québec à Montréal; Université TÉLUQ; University of Waterloo","funders":"UT-Battelle; Battelle; U.S. Department of Energy","keywords":"Computer science; Query optimization; Query language; Sargable; View; Extensibility; Architecture; Database; Relational database; Web search query; Programming language; Information retrieval; Database design","score_opus":0.0299497598105161,"score_gpt":0.27958759103575104,"score_spread":0.24963783122523495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788561287","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.008813439,0.00008933342,0.9876299,0.00025343348,0.00032473353,0.0002334913,0.00024461237,0.00009052156,0.0023205164],"genre_scores_gemma":[0.62544864,0.000013220218,0.37135753,0.00019039235,0.00006373542,0.000030515224,0.002797774,0.000005590044,0.00009258054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982727,0.000018754874,0.0005668154,0.00037103036,0.0005228683,0.00024780646],"domain_scores_gemma":[0.99823797,0.00016835374,0.00041857467,0.00078198296,0.00030378925,0.000089331435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007081363,0.00015422805,0.00022017662,0.00022516983,0.0003361571,0.0005396781,0.0012355332,0.00008621376,0.00003184021],"category_scores_gemma":[0.0001966331,0.0001340882,0.00005674584,0.0005018799,0.00057329057,0.0033533436,0.00092077395,0.000049615366,0.000006515396],"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.00032171357,0.0007677476,0.00051542104,0.0004400355,0.00020583364,0.000002027186,0.000058300786,0.0006464203,0.00037956898,0.8368378,0.017868413,0.14195669],"study_design_scores_gemma":[0.004813234,0.0014896612,0.015502483,0.0007447728,0.0003096921,0.000067211644,0.000037821686,0.21268137,0.011406315,0.039443694,0.71165407,0.0018496785],"about_ca_topic_score_codex":0.000008538501,"about_ca_topic_score_gemma":0.0000060361876,"teacher_disagreement_score":0.79739416,"about_ca_system_score_codex":0.000019017194,"about_ca_system_score_gemma":0.000104310595,"threshold_uncertainty_score":0.54679585},"labels":[],"label_agreement":null},{"id":"W2789770672","doi":"","title":"Counting Rooted Non-separable Nearly Cubic Planar Maps.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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; Planar; Separable space; Combinatorics; Pure mathematics; Mathematical analysis; Computer graphics (images); Computer science","score_opus":0.010639028018055953,"score_gpt":0.2313903681729526,"score_spread":0.22075134015489667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789770672","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.6757418,0.0003665888,0.091929495,0.0026831338,0.027518038,0.0012890047,0.000037125727,0.0020022935,0.19843253],"genre_scores_gemma":[0.9862733,0.000012703076,0.010215227,0.0005221503,0.00008885244,0.000015949972,0.000032976048,0.00002353669,0.0028153174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840033,0.000033937627,0.00022863712,0.00048265661,0.00037345896,0.0004809513],"domain_scores_gemma":[0.9987607,0.000045095476,0.000108566266,0.0008687631,0.00011537002,0.00010149913],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042643314,0.00017830062,0.00018411539,0.00012219943,0.00030615125,0.00056688953,0.0015285405,0.000061339844,0.000042107407],"category_scores_gemma":[0.000028852673,0.00017937821,0.00004890093,0.00068066193,0.00007681684,0.0013820517,0.00041139097,0.00014044945,0.0013975968],"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.000006635848,0.00011079934,0.0021621704,0.000017461514,0.000047775222,0.000051909392,0.00031108112,0.0000018157174,0.00042480676,0.84948194,0.1395347,0.007848881],"study_design_scores_gemma":[0.002868924,0.00062336103,0.01057943,0.00011552113,0.000033611053,0.000015233161,0.00006577641,0.075919114,0.0056535206,0.5657433,0.33724213,0.0011400582],"about_ca_topic_score_codex":0.00012349199,"about_ca_topic_score_gemma":0.000007114716,"teacher_disagreement_score":0.3105315,"about_ca_system_score_codex":0.000039994273,"about_ca_system_score_gemma":0.00004306792,"threshold_uncertainty_score":0.99937993},"labels":[],"label_agreement":null},{"id":"W2792994061","doi":"","title":"Strongly Spanning Trailable Graphs with Short Longest Paths.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"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; Combinatorics","score_opus":0.015316116922232373,"score_gpt":0.2302556098121114,"score_spread":0.21493949288987904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792994061","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.88200176,0.00016690009,0.04013717,0.00087305985,0.0057788924,0.0006284983,0.000011791259,0.001043497,0.06935844],"genre_scores_gemma":[0.984423,0.0000074714962,0.014542734,0.000119540266,0.000030032374,0.000015560801,0.000012075808,0.000017905699,0.000831673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847203,0.000031071475,0.00016788747,0.00050680654,0.0003777059,0.0004444756],"domain_scores_gemma":[0.99885404,0.000026250938,0.000052456024,0.00083988096,0.00010721266,0.000120147015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028507697,0.00018852048,0.00017108137,0.00012124852,0.00022145094,0.000373682,0.0012283772,0.00004224042,0.000031624473],"category_scores_gemma":[0.000010197534,0.00016215006,0.000038803242,0.0006549794,0.00012086187,0.0012477634,0.00035714608,0.00013066108,0.00016523818],"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.000008861191,0.00013059627,0.009270282,0.00001034168,0.000053171923,0.00007625135,0.0002838434,0.0000056120566,0.00005719633,0.95968664,0.011291511,0.01912572],"study_design_scores_gemma":[0.006776094,0.0069356123,0.10875318,0.00041884382,0.00020189557,0.000098625904,0.00062272634,0.07446705,0.010186906,0.5990628,0.18852513,0.003951149],"about_ca_topic_score_codex":0.000034400713,"about_ca_topic_score_gemma":0.000014829213,"teacher_disagreement_score":0.3606238,"about_ca_system_score_codex":0.00002541923,"about_ca_system_score_gemma":0.00003735048,"threshold_uncertainty_score":0.6612288},"labels":[],"label_agreement":null},{"id":"W2795112749","doi":"10.1109/icde.2018.00065","title":"Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Skyline; Computer science; Voronoi diagram; Set (abstract data type); Scalability; Data mining; Theoretical computer science; Database; Mathematics; Geometry; Programming language","score_opus":0.02765257858579212,"score_gpt":0.29012473529258176,"score_spread":0.26247215670678964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795112749","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.00086766784,0.000036178124,0.982746,0.006747535,0.000909059,0.00028173678,0.000013054883,0.00017823032,0.008220539],"genre_scores_gemma":[0.57964414,0.000081679726,0.33732584,0.010263037,0.0035411352,0.00024951936,0.00012569226,0.00004304364,0.0687259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999066,0.000017185648,0.0001720586,0.00029366816,0.00016475028,0.0002863523],"domain_scores_gemma":[0.9991035,0.000105692205,0.00005542974,0.0006181145,0.000078080986,0.00003916709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004736641,0.000115701034,0.000104645376,0.000043582197,0.00029084084,0.0004364669,0.0011770315,0.000022882012,0.00008345473],"category_scores_gemma":[0.000050635495,0.00007033612,0.000051600455,0.00020310383,0.000113133,0.0007712819,0.00046514568,0.000045743316,0.000174756],"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.000011090264,0.00006370908,0.00031235671,0.000016614325,0.00004569493,0.0000022816123,0.0004712508,0.000003996831,0.00006143049,0.55670106,0.20543866,0.23687184],"study_design_scores_gemma":[0.00030727717,0.00016257464,0.0005255585,0.000009562868,0.00000993809,0.0000017830733,0.00006133126,0.22360083,0.0011296821,0.0039860783,0.77003264,0.00017272682],"about_ca_topic_score_codex":0.000039213774,"about_ca_topic_score_gemma":0.00013178325,"teacher_disagreement_score":0.6454202,"about_ca_system_score_codex":0.000014212429,"about_ca_system_score_gemma":0.000017448214,"threshold_uncertainty_score":0.42088604},"labels":[],"label_agreement":null},{"id":"W2795346474","doi":"10.5220/0006794601190128","title":"Elcano: A Geospatial Big Data Processing System based on SparkSQL","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Geospatial analysis; Computer science; Big data; Data science; Database; Data mining; Remote sensing; Geography","score_opus":0.06612404947162556,"score_gpt":0.26461536564690713,"score_spread":0.19849131617528157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795346474","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.00017462058,0.0000056965887,0.9512739,0.0004925942,0.00092953694,0.00012789213,0.000014985126,0.00036894687,0.046611793],"genre_scores_gemma":[0.8808393,5.696894e-7,0.11534395,0.0011367686,0.0012443475,0.00000838626,0.00009167104,0.000011839725,0.0013231648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986706,0.000029091563,0.00014900294,0.00056321453,0.0003385973,0.00024953965],"domain_scores_gemma":[0.9981304,0.000019868661,0.000061307815,0.0016722904,0.000051968505,0.00006419429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003779559,0.00011473908,0.00010161536,0.00010175493,0.00016141767,0.0005531367,0.0025049201,0.000024805604,0.000021649932],"category_scores_gemma":[0.000018311162,0.00008949146,0.000014725894,0.0003681667,0.000036925772,0.00082755554,0.0009612461,0.000051533698,0.00035244424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008608607,0.00007883235,0.00015599073,0.00008743009,0.000009227243,0.000026012516,0.00004805724,0.000014744036,0.000022723578,0.012515968,0.030188981,0.95684344],"study_design_scores_gemma":[0.00024276829,0.000087858236,0.00028880918,0.000065486376,0.000005089446,0.0000011925758,0.00001860481,0.95935595,0.00020405077,0.000025749374,0.039566543,0.00013790114],"about_ca_topic_score_codex":0.0001082196,"about_ca_topic_score_gemma":0.00007741924,"teacher_disagreement_score":0.9593412,"about_ca_system_score_codex":0.000023601204,"about_ca_system_score_gemma":0.000070061324,"threshold_uncertainty_score":0.533391},"labels":[],"label_agreement":null},{"id":"W2797901955","doi":"10.3138/carto.46.3.1a","title":"Vers une gestion spatiale et temporelle des documents : l'exemple de la plateforme GeoTopia","year":2011,"lang":"fr","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Political science; Geography","score_opus":0.022746606011623555,"score_gpt":0.2916661334305828,"score_spread":0.26891952741895925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797901955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06869981,0.0010448127,0.9089577,0.008513308,0.0054429052,0.0008682784,0.00016333662,0.00012560881,0.006184229],"genre_scores_gemma":[0.9605884,0.019712783,0.01303865,0.0036971343,0.0005207955,0.00012222481,0.0009449478,0.000038653718,0.0013364159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978418,0.00025193708,0.00072542514,0.00020681508,0.00056136627,0.00041266665],"domain_scores_gemma":[0.9979668,0.0001874499,0.00059720414,0.00023003972,0.0008414117,0.00017709643],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002752623,0.00026568558,0.0001723643,0.00081729545,0.0008919193,0.001964053,0.0009012338,0.00019561524,0.0000909617],"category_scores_gemma":[0.00020803818,0.00022337763,0.00022422448,0.00078368816,0.00051702984,0.006299437,0.0002524874,0.0003573705,0.000012166897],"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.00019249142,0.00021378134,0.026834935,0.00013296206,0.00058924174,0.000012787351,0.020064358,0.00060877495,0.000019449728,0.72116506,0.008504221,0.22166194],"study_design_scores_gemma":[0.0026067363,0.0004198155,0.077843376,0.00037127768,0.00018267173,0.00046623196,0.00184151,0.08958006,0.00007781796,0.13114865,0.6949575,0.00050432567],"about_ca_topic_score_codex":0.0026251571,"about_ca_topic_score_gemma":0.00020025505,"teacher_disagreement_score":0.8959191,"about_ca_system_score_codex":0.000088396155,"about_ca_system_score_gemma":0.00016408335,"threshold_uncertainty_score":0.999072},"labels":[],"label_agreement":null},{"id":"W2798371164","doi":"10.1145/3209978.3210038","title":"Top-k Route Search through Submodularity Modeling of Recurrent POI Features","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Computer science; Pruning; Feature (linguistics); Variety (cybernetics); Point of interest; Heuristic; Class (philosophy); Space (punctuation); Data mining; Information retrieval; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.06527603556412061,"score_gpt":0.3174099566823212,"score_spread":0.2521339211182006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798371164","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.005449088,0.0003939073,0.9699088,0.00096871884,0.001750325,0.00039416223,0.000053341893,0.0002084322,0.020873275],"genre_scores_gemma":[0.3622426,0.0004882594,0.6333571,0.00027154275,0.00060952984,0.000027596592,0.00026673538,0.000027378734,0.002709218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738747,0.00009652223,0.0003971522,0.0009885061,0.00072077627,0.00040955743],"domain_scores_gemma":[0.9974982,0.000025093042,0.00013093138,0.0020340427,0.0002385964,0.000073103314],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00070425356,0.00029644417,0.00039255677,0.00014498697,0.000089466346,0.0004509484,0.0033935541,0.00019557284,0.000044315293],"category_scores_gemma":[0.000025615242,0.00025563495,0.00018434715,0.00025797015,0.0000683623,0.0006819984,0.009342287,0.0005786644,0.00003770147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006008149,0.0009710357,0.0010429309,0.0019302801,0.00073547085,0.000059444163,0.0057989093,0.029468894,0.00004370343,0.64476407,0.051308006,0.2638172],"study_design_scores_gemma":[0.00017507095,0.00006103507,0.00025739602,0.0001469177,0.00002081913,0.0000016263544,0.00003696607,0.94764453,0.0006185538,0.04929032,0.0013723414,0.00037440684],"about_ca_topic_score_codex":0.001206736,"about_ca_topic_score_gemma":0.000047906768,"teacher_disagreement_score":0.91817564,"about_ca_system_score_codex":0.00005842378,"about_ca_system_score_gemma":0.00012165951,"threshold_uncertainty_score":0.99998957},"labels":[],"label_agreement":null},{"id":"W2799147087","doi":"10.1145/3209978.3210066","title":"Split-Lists and Initial Thresholds for WAND-based Search","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Partition (number theory); Search engine; Rank (graph theory); Information retrieval; Data mining; Mathematics; Combinatorics","score_opus":0.04492788530374531,"score_gpt":0.3256248482940918,"score_spread":0.28069696299034647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799147087","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.011463906,0.000010102013,0.9698805,0.0018687652,0.00024267772,0.00020351313,0.000009406165,0.00010808756,0.01621301],"genre_scores_gemma":[0.73430717,0.0000032317496,0.26105663,0.001742961,0.0004215857,0.000020071804,0.000021578804,0.000008033997,0.0024187649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932915,0.00001006639,0.00007642291,0.00025190803,0.00013632674,0.00019612628],"domain_scores_gemma":[0.99954796,0.000033294367,0.000011625271,0.00029828525,0.000054369317,0.00005448546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002657994,0.00006401532,0.000062465,0.000060335475,0.00011536886,0.00030114024,0.00044121713,0.000020477082,0.00004414899],"category_scores_gemma":[0.0000090248095,0.000051501953,0.000018727946,0.00012233516,0.000078901605,0.00043003843,0.00026848505,0.000027723809,0.000040990206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025217294,0.00008478898,0.0007472885,0.000055691104,0.000021123831,0.00001052871,0.0002051014,0.0000022923346,0.00019721995,0.54494387,0.038395427,0.41531146],"study_design_scores_gemma":[0.0022605262,0.0007617163,0.004911936,0.000020219626,0.000010225068,0.000003881797,0.00003256384,0.8532945,0.012021578,0.013984509,0.1122896,0.0004087415],"about_ca_topic_score_codex":0.000021181151,"about_ca_topic_score_gemma":0.000016901646,"teacher_disagreement_score":0.8532922,"about_ca_system_score_codex":0.000005575805,"about_ca_system_score_gemma":0.000022637421,"threshold_uncertainty_score":0.29039022},"labels":[],"label_agreement":null},{"id":"W2806337402","doi":"10.1016/j.patcog.2018.05.030","title":"A fast clustering algorithm based on pruning unnecessary distance computations in DBSCAN for high-dimensional data","year":2018,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":170,"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":"State Key Laboratory of Computer Aided Design and Computer Graphics; National Laboratory of Pattern Recognition; Fujian Provincial Department of Science and Technology; Zhejiang University; Huaqiao University; Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"DBSCAN; Computer science; Pruning; Computation; Cluster analysis; Noise (video); Dimension (graph theory); Algorithm; Search engine indexing; Pattern recognition (psychology); Data mining; Mathematics; Artificial intelligence; CURE data clustering algorithm; Correlation clustering; Combinatorics; Image (mathematics)","score_opus":0.052716270361348704,"score_gpt":0.285088083781462,"score_spread":0.2323718134201133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806337402","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.0031187898,0.000004673942,0.99434716,0.00073116546,0.0005553772,0.00033898524,0.0006363722,0.000102716476,0.00016477171],"genre_scores_gemma":[0.5817257,0.0000020326204,0.41115168,0.0014019965,0.00035420747,0.00007778685,0.0052314843,0.0000205035,0.000034587705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986662,0.000053861557,0.00022992992,0.0005719177,0.00022721548,0.00025086946],"domain_scores_gemma":[0.9990994,0.00014154371,0.0001022934,0.0005301538,0.0000798124,0.000046814755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035656727,0.00013485999,0.00012207514,0.00019661004,0.00015826603,0.0001989416,0.00070359895,0.000031419488,0.00002071235],"category_scores_gemma":[0.000025046033,0.00014126534,0.000020463065,0.00029478,0.000035747827,0.00094034296,0.0003676299,0.00008518115,0.0000651057],"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.000008688505,0.00009568091,0.0001961983,0.00002768021,0.000006878696,0.0000074245972,0.000051279938,0.0005045374,0.000008911801,0.000028975679,0.00072172517,0.99834204],"study_design_scores_gemma":[0.0008582362,0.00012541599,0.0028137884,0.00022427595,0.0000071374247,0.0000013783798,0.000014879564,0.9942054,0.00010034679,0.0011323524,0.00032418856,0.00019258259],"about_ca_topic_score_codex":0.000095848955,"about_ca_topic_score_gemma":0.00029393483,"teacher_disagreement_score":0.99814945,"about_ca_system_score_codex":0.000041355182,"about_ca_system_score_gemma":0.00002293476,"threshold_uncertainty_score":0.57606333},"labels":[],"label_agreement":null},{"id":"W2809243187","doi":"10.1007/s12599-018-0548-y","title":"Conceptual Framework for SDSS Development with an Application in the Retail Industry","year":2018,"lang":"en","type":"article","venue":"Business & Information Systems Engineering","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Process (computing); Decision support system; Set (abstract data type); Visualization; Development (topology); Conceptual framework; Software; Data science; Process management; Systems engineering; Software engineering; Data mining; Engineering","score_opus":0.02048923443639808,"score_gpt":0.2254111283261817,"score_spread":0.20492189388978363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809243187","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.014458277,0.00000884773,0.98435956,0.00009116207,0.00025383217,0.0005322398,0.0000023016162,0.00011736159,0.00017643113],"genre_scores_gemma":[0.8944333,6.052054e-7,0.10474028,0.00012160133,0.00020433168,0.00041052297,0.00007169414,0.000006159463,0.000011512077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992068,0.000009355484,0.0002779101,0.000110681474,0.00022782726,0.00016742825],"domain_scores_gemma":[0.99929714,0.00003414551,0.00010830036,0.00035267413,0.00018255995,0.000025204125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004606659,0.000102575024,0.000090175585,0.00013080622,0.00008740017,0.00041594854,0.00059547246,0.00008082303,6.5891714e-7],"category_scores_gemma":[0.000028765877,0.00007420513,0.000006858374,0.00067316537,0.000017805358,0.0031086835,0.00005512969,0.00010494316,0.000019046116],"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.0000149934995,0.000033652686,0.0007962289,0.00027098946,0.000025847841,0.00000103915,0.0128339175,0.03429868,0.000009573147,0.8730479,0.00024319379,0.07842397],"study_design_scores_gemma":[0.00048119994,0.00004857612,0.01404378,0.00020677145,0.0000044291464,0.000009285559,0.0021211368,0.7031752,0.000074989344,0.000042480817,0.2794727,0.0003194244],"about_ca_topic_score_codex":0.000017994205,"about_ca_topic_score_gemma":0.000003595629,"teacher_disagreement_score":0.879975,"about_ca_system_score_codex":0.00003682664,"about_ca_system_score_gemma":0.000038989307,"threshold_uncertainty_score":0.40110013},"labels":[],"label_agreement":null},{"id":"W2821470430","doi":"10.1109/mdm.2018.00031","title":"A Semi-Supervised Approach for the Semantic Segmentation of Trajectories","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Segmentation; Computer science; Artificial intelligence; Trajectory; Minimum description length; Pattern recognition (psychology); Ground truth; Image segmentation; Set (abstract data type); Machine learning","score_opus":0.029725717442451373,"score_gpt":0.26088706462566585,"score_spread":0.2311613471832145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2821470430","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.0012437607,0.000018660878,0.99462503,0.00027113434,0.00016843971,0.00030641252,0.0000030641363,0.0000487016,0.003314795],"genre_scores_gemma":[0.5120866,0.000008384935,0.4856036,0.00024870972,0.00016770833,0.000057016212,0.000017610833,0.000005179031,0.001805242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995172,0.000011485818,0.000101495825,0.00014609734,0.00012240859,0.00010128569],"domain_scores_gemma":[0.99953526,0.00005820452,0.000033450804,0.000307523,0.00005302935,0.000012550791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021006349,0.00005219811,0.000060025654,0.000029378327,0.0000896199,0.000085242755,0.00056018186,0.000011042824,0.0000137695315],"category_scores_gemma":[0.0000096357135,0.00003127086,0.000030952437,0.0002012098,0.000050660317,0.00038646095,0.000110619876,0.000014816024,0.0000047296817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037352653,0.00035435753,0.0013892618,0.0003121788,0.00027711195,6.4236895e-7,0.0077649727,0.00011065856,0.007944228,0.42716807,0.04308875,0.51155245],"study_design_scores_gemma":[0.0003868995,0.0001266957,0.0007656159,0.0000037170846,0.000018797047,6.3585117e-7,0.0005578389,0.9800356,0.015023941,0.001096589,0.0018960807,0.00008759743],"about_ca_topic_score_codex":0.0000260859,"about_ca_topic_score_gemma":0.0000049374,"teacher_disagreement_score":0.9799249,"about_ca_system_score_codex":0.000004284875,"about_ca_system_score_gemma":0.0000090256235,"threshold_uncertainty_score":0.12751886},"labels":[],"label_agreement":null},{"id":"W28493347","doi":"10.1111/cid.12492","title":"Hybrid Indexing of Moving Objects with Frequent Updates on Fixed Networks.","year":2007,"lang":"en","type":"article","venue":"Clinical Implant Dentistry and Related Research","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Object (grammar); Artificial intelligence","score_opus":0.07329611189131639,"score_gpt":0.3987449713391797,"score_spread":0.3254488594478633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28493347","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.937543,0.00049714727,0.053423464,0.00035275932,0.002987237,0.00041641976,0.000017248729,0.000121167825,0.004641572],"genre_scores_gemma":[0.99664193,0.0003582973,0.0018625221,0.000055211956,0.00009728469,0.0000024619703,0.000037643422,0.00000962176,0.0009350431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975052,0.00023003641,0.00058094197,0.00054014224,0.00056760287,0.0005760756],"domain_scores_gemma":[0.99762034,0.0013860763,0.00013914672,0.00051891117,0.00011219532,0.00022331736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048718643,0.00013088567,0.00024889855,0.00020292649,0.00025427184,0.00021090981,0.00077582395,0.00013637466,0.000014752879],"category_scores_gemma":[0.00020337653,0.00009458883,0.00005767467,0.00049631874,0.00033690376,0.00032721143,0.0006559965,0.0010039248,0.00005137101],"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.001309946,0.0024384754,0.039268397,0.00055488653,0.0017525647,0.15218964,0.0004293953,0.0009611369,0.00096747576,0.111236565,0.029893052,0.6589985],"study_design_scores_gemma":[0.020235322,0.0122170085,0.3970204,0.006587322,0.0003003826,0.042450596,0.0014019224,0.4408711,0.022698712,0.032991234,0.019328453,0.0038975526],"about_ca_topic_score_codex":0.000016043165,"about_ca_topic_score_gemma":0.0000063157245,"teacher_disagreement_score":0.65510094,"about_ca_system_score_codex":0.000014339793,"about_ca_system_score_gemma":0.00004231458,"threshold_uncertainty_score":0.43616095},"labels":[],"label_agreement":null},{"id":"W2851970333","doi":"10.1109/mdm.2018.00017","title":"Optimal Meeting Points for Public Transit Users","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aggregate (composite); Exploit; Computer science; Public transport; Space (punctuation); Order (exchange); Group (periodic table); Transit (satellite); Operations research; Transport engineering; Mathematics; Computer security; Engineering; Economics","score_opus":0.0382260637432487,"score_gpt":0.2589547348088772,"score_spread":0.2207286710656285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2851970333","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.001819448,0.0000040696827,0.96219635,0.0058992123,0.00029001807,0.0001305456,0.0000023120665,0.0001867131,0.029471315],"genre_scores_gemma":[0.10896377,0.0000017218189,0.88701344,0.0015065388,0.00018643559,0.000013494957,0.000008621017,0.000007368587,0.0022985868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992619,0.0000101739215,0.000100227764,0.00025408473,0.000121997306,0.00025159793],"domain_scores_gemma":[0.9995352,0.00002661107,0.00002340829,0.0003007788,0.000058229434,0.00005579468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032246014,0.000067191766,0.00006072868,0.00006587694,0.00012381573,0.00037830687,0.00079858827,0.000017137978,0.000043027485],"category_scores_gemma":[0.00002174374,0.000057320234,0.000038185706,0.00018115068,0.000031157528,0.001172692,0.00016353035,0.00002271245,0.00011470745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008263416,0.00009686075,0.0002684164,0.00002414289,0.00006966985,0.0000052161695,0.0006359225,0.000015510848,0.00030583813,0.5158215,0.10190678,0.38084188],"study_design_scores_gemma":[0.00077671336,0.0002254374,0.00041429515,0.000010149565,0.000007742971,0.0000023260056,0.00009853681,0.5743668,0.0029665483,0.0019979505,0.41883788,0.00029562876],"about_ca_topic_score_codex":0.000008143735,"about_ca_topic_score_gemma":0.000011813617,"teacher_disagreement_score":0.57435125,"about_ca_system_score_codex":0.0000076117985,"about_ca_system_score_gemma":0.000011887197,"threshold_uncertainty_score":0.36480218},"labels":[],"label_agreement":null},{"id":"W286790658","doi":"10.1016/j.ejor.2003.10.029","title":"SARPlan: A decision support system for Canadian Search and Rescue Operations","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Search and rescue; Decision support system; Computer science; Operations research; Engineering; Artificial intelligence; Robot","score_opus":0.0883167890346906,"score_gpt":0.3564225687883026,"score_spread":0.268105779753612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W286790658","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.07199496,0.00016862956,0.9112885,0.010378839,0.0004511068,0.00055742584,0.000067885005,0.000019266514,0.005073364],"genre_scores_gemma":[0.8451707,0.000041984065,0.15373102,0.00014598091,0.0003419645,0.0000037604054,0.000020072692,0.000013099526,0.0005314674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795365,0.0003015524,0.0003598592,0.00021619206,0.0008418386,0.00032690162],"domain_scores_gemma":[0.998256,0.00009763515,0.000011343828,0.0002415536,0.0010282638,0.00036518154],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0070043355,0.000079015874,0.00011172783,0.0005976363,0.0006937227,0.0011277732,0.0009537637,0.000015401221,0.000018756122],"category_scores_gemma":[0.0002941674,0.00006436092,0.00003993318,0.0003338109,0.000060776718,0.0010798573,0.00023460572,0.00026716548,0.0000990068],"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.00012428952,0.0001526834,0.00011737258,0.00008646737,0.00011712152,0.0020855116,0.002103857,0.10921803,0.0018166512,0.7599806,0.01626337,0.107934006],"study_design_scores_gemma":[0.019855848,0.009479524,0.038262863,0.0016734827,0.000051987066,0.005123442,0.0037404618,0.61449045,0.0045596925,0.0021977872,0.2989569,0.0016075738],"about_ca_topic_score_codex":0.00167897,"about_ca_topic_score_gemma":0.00440976,"teacher_disagreement_score":0.77317566,"about_ca_system_score_codex":0.00020291226,"about_ca_system_score_gemma":0.0010789137,"threshold_uncertainty_score":0.99990916},"labels":[],"label_agreement":null},{"id":"W28758523","doi":"10.1080/0142159x.2017.1357805","title":"Top-Down Skiplists.","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Binary number; Combinatorics; Set (abstract data type); Binary logarithm; Amortized analysis; Binary search algorithm; Data structure; Mathematics; Computer science; Search algorithm; Algorithm; Arithmetic","score_opus":0.05040916365503023,"score_gpt":0.17643766280245998,"score_spread":0.12602849914742975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28758523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019647874,0.000027757667,0.9502021,0.0002391088,0.0012553942,0.00021112632,0.000015856143,0.0004306031,0.027970169],"genre_scores_gemma":[0.982644,0.00010071575,0.0043020467,0.00029041065,0.00019024321,8.0038734e-7,0.000058367248,0.000015420956,0.012397977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805695,0.00008329206,0.00016028805,0.0012206588,0.00010774245,0.00037105987],"domain_scores_gemma":[0.99744576,0.00004746648,0.00018586912,0.002091405,0.00007687468,0.00015262942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027512672,0.0002956343,0.00028606397,0.00025427915,0.00013220239,0.00033703638,0.0037853003,0.00017822911,0.000058925936],"category_scores_gemma":[0.000019055671,0.00033610486,0.00018447751,0.00042695232,0.00007669119,0.00057507615,0.0057744416,0.00041401657,0.0005966424],"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.0000074382483,0.000100837766,0.0011758781,0.00011529394,0.000113950024,0.00040033404,0.00009466452,0.026396474,0.0000054946463,0.9494058,0.01369778,0.008486093],"study_design_scores_gemma":[0.00045180315,0.00004083004,0.0010435164,0.00006621578,0.00006391276,0.0000022955587,0.000021942671,0.8589481,0.00004554783,0.09520252,0.043393288,0.0007200095],"about_ca_topic_score_codex":0.00007778929,"about_ca_topic_score_gemma":0.000012598647,"teacher_disagreement_score":0.9629961,"about_ca_system_score_codex":0.00009315013,"about_ca_system_score_gemma":0.00006576496,"threshold_uncertainty_score":0.9999091},"labels":[],"label_agreement":null},{"id":"W2876125642","doi":"10.1109/mdm.2018.00053","title":"Trajectolizer: Interactive Analysis and Exploration of Trajectory Group Dynamics","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trajectory; Computer science; Group (periodic table); Domain (mathematical analysis); Data mining; Tracking (education); Task (project management); Scale (ratio); Data stream mining; Artificial intelligence; Geography; Mathematics; Engineering","score_opus":0.01614914317608099,"score_gpt":0.25583871685633836,"score_spread":0.23968957368025737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2876125642","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.021207415,0.000007029589,0.97252667,0.00013294531,0.00010112779,0.000059745267,0.0000035188416,0.00005108001,0.0059104823],"genre_scores_gemma":[0.94812065,0.000016343267,0.05146313,0.000056520446,0.000028734377,0.0000036154388,0.000020635887,0.00000247818,0.0002878785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994149,0.000027673259,0.00013373399,0.00021885058,0.000115807066,0.00008901678],"domain_scores_gemma":[0.99955934,0.000031533094,0.00006456307,0.00026751123,0.0000488257,0.000028244642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013053323,0.000065890774,0.00012010939,0.0002686686,0.00003734725,0.00008178759,0.00028307497,0.000016868999,0.000028080622],"category_scores_gemma":[0.000007767344,0.00005638529,0.000041553427,0.00073246966,0.00005673197,0.0019507266,0.00014503121,0.0000301293,0.0000068623676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028404382,0.00024279216,0.0049216477,0.000028444203,0.0009446796,0.000005749827,0.0038030508,0.000020246756,0.000630415,0.33353767,0.0006977276,0.65513915],"study_design_scores_gemma":[0.00025635862,0.00023383588,0.019834327,0.0000057640746,0.00012381129,7.3224817e-7,0.0004931686,0.97347015,0.001688029,0.0033863399,0.00034737712,0.00016008074],"about_ca_topic_score_codex":0.000100864425,"about_ca_topic_score_gemma":0.000780728,"teacher_disagreement_score":0.97344995,"about_ca_system_score_codex":0.000014596864,"about_ca_system_score_gemma":0.00000459753,"threshold_uncertainty_score":0.22993253},"labels":[],"label_agreement":null},{"id":"W2884409942","doi":"10.3138/cart.53.2.2017-0004","title":"Location-Based Applications Using Analog Maps for Sustainable Local Tourism Information Services","year":2018,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","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":"Tourism; Business; Computer science; Geography","score_opus":0.00797224240916463,"score_gpt":0.2716887242889953,"score_spread":0.2637164818798307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884409942","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.0012037685,0.000082410246,0.9949323,0.0017498609,0.00065907335,0.001058931,0.000048618003,0.00009216499,0.00017287928],"genre_scores_gemma":[0.95638007,0.00023729457,0.029193185,0.009525273,0.0011322091,0.00066155574,0.0027564198,0.000023156186,0.000090822265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833053,0.000038471473,0.0006707362,0.00016192379,0.000477382,0.00032097936],"domain_scores_gemma":[0.99478865,0.000112625785,0.00060537393,0.00028209866,0.004108809,0.000102428734],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011519784,0.00018662095,0.00013167188,0.0012095646,0.0013213976,0.0022893616,0.0010667964,0.00009492062,0.000005900252],"category_scores_gemma":[0.00006762878,0.00015296452,0.00013956102,0.0010996393,0.0001875024,0.0072557167,0.00015221126,0.000109725064,0.0000055096057],"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.0001584018,0.00008328319,0.0015290566,0.0003942586,0.00029047707,7.0903167e-7,0.0013441835,0.006056485,0.000012272608,0.870333,0.005151922,0.11464591],"study_design_scores_gemma":[0.0010211312,0.00012818813,0.00051323127,0.00004240395,0.000045871824,0.000020472691,0.0012383347,0.58644986,0.00005862263,0.022214523,0.3880717,0.00019569385],"about_ca_topic_score_codex":0.0000832991,"about_ca_topic_score_gemma":0.000021218464,"teacher_disagreement_score":0.96573913,"about_ca_system_score_codex":0.000054386936,"about_ca_system_score_gemma":0.00013091647,"threshold_uncertainty_score":0.9999787},"labels":[],"label_agreement":null},{"id":"W2884886133","doi":"10.5555/3310435.3310618","title":"Exact algorithms and lower bounds for stable instances of euclidean k-means","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Mathematics; Combinatorics; Hamming distance; Euclidean distance; Euclidean geometry; Cluster analysis; Time complexity; Dimension (graph theory); Heuristics; Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.03704816256138506,"score_gpt":0.17964740890551903,"score_spread":0.14259924634413396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884886133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32453406,0.00004140025,0.6678261,0.000061777464,0.000386471,0.00028099888,0.000026792079,0.00007388542,0.0067684883],"genre_scores_gemma":[0.9849176,0.00008179076,0.008343371,0.00005658703,0.000021982045,3.5694157e-7,0.0000068663394,0.0000070513065,0.0065644323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913293,0.00001950121,0.000108104745,0.00044673332,0.00006329831,0.00022941553],"domain_scores_gemma":[0.9992316,0.000071505674,0.00009376779,0.0004770297,0.00006234689,0.000063794185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020520746,0.00011327023,0.0001640556,0.00012252461,0.000076386146,0.000084881205,0.0006688746,0.000035240653,0.00002588187],"category_scores_gemma":[0.000008277533,0.0001175663,0.00005620882,0.0004034872,0.00006421102,0.0013482044,0.00030362295,0.000051859828,0.000021283473],"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.000071699826,0.00020931977,0.018637322,0.00016975719,0.00013628817,0.00005352882,0.00029098467,0.0023695813,0.00023123871,0.9558404,0.0016625017,0.020327354],"study_design_scores_gemma":[0.0019789275,0.00046936926,0.0034407373,0.000053288077,0.000043869273,0.000001693743,0.00033157956,0.9214145,0.00047693047,0.021880917,0.04945574,0.00045247353],"about_ca_topic_score_codex":0.00004094315,"about_ca_topic_score_gemma":0.000020842457,"teacher_disagreement_score":0.9339595,"about_ca_system_score_codex":0.00002394131,"about_ca_system_score_gemma":0.000026318989,"threshold_uncertainty_score":0.47942144},"labels":[],"label_agreement":null},{"id":"W2885204832","doi":"10.1007/s10707-017-0293-2","title":"Uncertain Voronoi cell computation based on space decomposition","year":2017,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"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":"German Academic Exchange Service London; Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; Alberta Innovates - Technology Futures; Research Grants Council, University Grants Committee; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Voronoi diagram; Centroidal Voronoi tessellation; k-nearest neighbors algorithm; Computation; Computer science; Space partitioning; Computational geometry; Object (grammar); Nearest neighbor search; Mathematics; Algorithm; Data mining; Artificial intelligence; Geometry","score_opus":0.014134765706544181,"score_gpt":0.2716939366836894,"score_spread":0.2575591709771452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885204832","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.0011274071,0.0000019369234,0.8838391,0.0022102816,0.00027462802,0.00017069792,0.000005057191,0.00011651888,0.112254426],"genre_scores_gemma":[0.77135485,0.000002381356,0.22695437,0.0009784678,0.000054146814,0.000012763329,0.00008321065,0.0000063347575,0.0005534545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991527,0.000017761391,0.00018365537,0.00015135846,0.00027406248,0.0002204651],"domain_scores_gemma":[0.99882525,0.000046681147,0.00020062258,0.0008251223,0.000034587953,0.000067705376],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026253104,0.0001134799,0.00010008828,0.00009363204,0.00048016815,0.0010260001,0.0009953358,0.000028406928,0.000019852514],"category_scores_gemma":[0.00001610944,0.00010308438,0.000042465756,0.000059982875,0.00003136279,0.002003254,0.00024465608,0.000055935907,0.0008258958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049171085,0.0004655784,0.00035514854,0.00044364276,0.000036998037,0.000054080378,0.0017502599,0.063320555,0.00008909177,0.14463444,0.073946476,0.71485454],"study_design_scores_gemma":[0.00046569106,0.00008442519,0.0018180199,0.000027351736,0.0000044951526,7.2826805e-7,0.000020891162,0.99030447,0.00035084845,0.000963106,0.0058196234,0.00014035615],"about_ca_topic_score_codex":0.000022681936,"about_ca_topic_score_gemma":0.0000024003657,"teacher_disagreement_score":0.9269839,"about_ca_system_score_codex":0.00003250075,"about_ca_system_score_gemma":0.000025131512,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W2887728628","doi":"10.1007/s10844-018-0524-5","title":"REMI: A framework of reusable elements for mining heterogeneous data with missing information","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"Data Management and Algorithms","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 Toronto","funders":"Horizon 2020 Framework Programme; European Commission","keywords":"Computer science; Data mining; Information retrieval; Missing data; Data science; Machine learning","score_opus":0.0448779938772994,"score_gpt":0.29895527494351004,"score_spread":0.25407728106621064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887728628","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.0020890317,0.00005198567,0.99552816,0.00009880382,0.0009717043,0.0003107062,0.00003605639,0.000018536473,0.0008950051],"genre_scores_gemma":[0.26680896,0.000044541794,0.7322688,0.00029993796,0.00037619646,0.000008279561,0.00014434053,0.000008182194,0.000040773866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975473,0.000028323431,0.001568901,0.00007634434,0.0005931205,0.00018595344],"domain_scores_gemma":[0.9959806,0.00009238512,0.0022171978,0.0006522362,0.0009851849,0.00007235099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016492181,0.00011699527,0.00023522356,0.00036989446,0.000119095814,0.00061499566,0.0014560197,0.00005138457,0.000005771033],"category_scores_gemma":[0.00024552224,0.000087679335,0.000045547124,0.00033598064,0.000028838189,0.011575737,0.00026054136,0.00008239771,0.000023093342],"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.00051222055,0.00014550761,0.0007952132,0.0016801235,0.0008011121,0.000004651786,0.022785634,0.0056482307,0.00009534842,0.023819692,0.033542152,0.91017014],"study_design_scores_gemma":[0.0005916944,0.0008597719,0.00001982602,0.0012229206,0.000041033876,0.0001296426,0.0026450201,0.6303788,0.002836729,0.00023298517,0.36082637,0.0002152412],"about_ca_topic_score_codex":0.0000059139784,"about_ca_topic_score_gemma":6.953891e-7,"teacher_disagreement_score":0.90995485,"about_ca_system_score_codex":0.000058111716,"about_ca_system_score_gemma":0.00009973767,"threshold_uncertainty_score":0.83921295},"labels":[],"label_agreement":null},{"id":"W2889053599","doi":"10.5555/3236187.3269462","title":"Efficient construction of approximate ad-hoc ML models through materialization and reuse","year":2018,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Online analytical processing; Reuse; Dimension (graph theory); Cluster analysis; Data warehouse; Data mining; Construct (python library); Variety (cybernetics); Mixture model; Data modeling; Machine learning; Artificial intelligence; Database; Programming language","score_opus":0.04435581347020066,"score_gpt":0.26769465447678786,"score_spread":0.2233388410065872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889053599","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.06484899,0.00017537217,0.93184423,0.00011522015,0.0006737309,0.00016646189,0.001794881,0.00011586709,0.00026527356],"genre_scores_gemma":[0.31679884,0.000747927,0.677894,0.00037092413,0.00023785277,0.000012034481,0.0038317428,0.000025571935,0.00008111493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900067,0.000041236563,0.00019257513,0.00041244808,0.00018311871,0.00016994892],"domain_scores_gemma":[0.9981805,0.000018688363,0.00010728309,0.0016098155,0.000056862755,0.000026862865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027979474,0.00009798915,0.00012182135,0.00006537694,0.00010675533,0.00017857227,0.0010380889,0.000026469723,0.000027217116],"category_scores_gemma":[0.00004554371,0.00008822668,0.000010323864,0.00023152819,0.00010704229,0.0017050186,0.0022082117,0.000022898186,0.000012401455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021737718,0.0011004895,0.000525477,0.00083834096,0.00021234875,0.000040771516,0.0028700742,0.0005514217,0.004961374,0.8115037,0.10888291,0.06829573],"study_design_scores_gemma":[0.00044814637,0.00007473589,0.00006025383,0.000054470216,0.000021416376,0.0000071594354,0.0000712256,0.96395457,0.0036982642,0.0037557133,0.027693294,0.00016078107],"about_ca_topic_score_codex":0.000017085054,"about_ca_topic_score_gemma":0.0000036321285,"teacher_disagreement_score":0.9634031,"about_ca_system_score_codex":0.0000069256253,"about_ca_system_score_gemma":0.000015420132,"threshold_uncertainty_score":0.359778},"labels":[],"label_agreement":null},{"id":"W2889148525","doi":"10.1111/tgis.12464","title":"Integrated compression of vehicle spatio‐temporal trajectories under the road stroke network constraint","year":2018,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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 New Brunswick","funders":"Education Department of Henan Province","keywords":"Huffman coding; Trajectory; Computer science; Feature (linguistics); Constraint (computer-aided design); Artificial intelligence; Computer vision; Data compression; Data mining; Mathematics","score_opus":0.02474127967054755,"score_gpt":0.258426339923819,"score_spread":0.2336850602532715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889148525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036565006,0.000037116562,0.9603018,0.00070670206,0.00061448035,0.00015657075,0.000023780807,0.000072206414,0.0015223422],"genre_scores_gemma":[0.9837119,0.000012171906,0.015732635,0.00007154636,0.00006036583,0.000010249583,0.000009944681,0.000004773323,0.00038640364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915105,0.000078392,0.00022871773,0.00018752403,0.00017278414,0.00018153316],"domain_scores_gemma":[0.9994182,0.000054816664,0.00006286019,0.00038060802,0.000056708126,0.000026813506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024227244,0.000094570685,0.00012002221,0.000068970454,0.00015658392,0.000071879054,0.0005328975,0.00003726805,0.00017522924],"category_scores_gemma":[0.0000027669248,0.00006746665,0.00004478193,0.0005507709,0.0002700937,0.00039181244,0.000023434766,0.00014607313,0.000011153191],"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.000097573815,0.0005357213,0.004513666,0.000036475194,0.00019354642,0.000009687836,0.0041577006,0.015218793,0.0010306494,0.043156542,0.0037079197,0.9273417],"study_design_scores_gemma":[0.0020295284,0.00048171825,0.062278703,0.00021747887,0.000060638507,0.000008608611,0.0025366936,0.8805577,0.008282658,0.005705213,0.03725812,0.0005829348],"about_ca_topic_score_codex":0.0008034293,"about_ca_topic_score_gemma":0.0012430516,"teacher_disagreement_score":0.9471469,"about_ca_system_score_codex":0.000023436109,"about_ca_system_score_gemma":0.000040216866,"threshold_uncertainty_score":0.27512103},"labels":[],"label_agreement":null},{"id":"W2889180561","doi":"10.1007/978-3-319-98530-5_15","title":"Continuous k-Nearest Neighbour Strategies Using the mqrtree","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"k-nearest neighbors algorithm; Best bin first; Computer science; Nearest neighbor search; Nearest neighbor graph; Property (philosophy); Nearest neighbour; Data mining; Pattern recognition (psychology); Algorithm; Artificial intelligence","score_opus":0.05135188821761769,"score_gpt":0.2660235016565628,"score_spread":0.2146716134389451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889180561","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.000029909916,0.010250273,0.96850187,0.007211106,0.00023934315,0.00042990755,0.00038329032,0.0027451662,0.010209161],"genre_scores_gemma":[0.14512703,0.021382015,0.8258028,0.0005423572,0.00037209678,0.000083009865,0.0022096091,0.00022497404,0.0042561134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988448,0.000012743643,0.00022175528,0.00050264254,0.00018310314,0.00023493037],"domain_scores_gemma":[0.9899034,0.0003851067,0.00014036136,0.009495675,0.000055489512,0.00001999532],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0001907829,0.00035163522,0.0002624104,0.00023084479,0.000355239,0.0008455923,0.009656291,0.00026133418,0.000005642744],"category_scores_gemma":[0.00018421619,0.0002500007,0.00003804621,0.00014292554,0.00036546704,0.0004973471,0.0077366447,0.0007591789,0.000018834064],"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.000001979973,0.000021561771,0.0000026295709,0.000052643634,0.00015593779,0.000007647232,0.000101978665,0.0008857964,0.000055507197,0.742537,0.0017656767,0.25441164],"study_design_scores_gemma":[0.00014929629,0.00013055564,0.000014843148,0.00042388152,0.00010380348,0.00003140765,0.000119501885,0.34002495,0.00010614344,0.06295052,0.5951785,0.0007666087],"about_ca_topic_score_codex":0.000020664489,"about_ca_topic_score_gemma":0.000041003517,"teacher_disagreement_score":0.67958647,"about_ca_system_score_codex":0.000025985106,"about_ca_system_score_gemma":0.000035657125,"threshold_uncertainty_score":0.99999523},"labels":[],"label_agreement":null},{"id":"W2889833276","doi":"10.1109/ficloud.2018.00064","title":"Sensing as a Service Middleware Architecture","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Western University","funders":"","keywords":"Computer science; Middleware (distributed applications); Cloud computing; Service (business); Internet of Things; SQL; Wireless sensor network; Service discovery; Architecture; Smart objects; Distributed computing; Message oriented middleware; Service-oriented architecture; Intelligent sensor; Computer network; Web service; Database; World Wide Web; Software architecture; Software; Operating system","score_opus":0.015570528152164044,"score_gpt":0.23856382167238518,"score_spread":0.22299329352022115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889833276","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.004155938,0.000007956852,0.8804167,0.004710548,0.0003204835,0.00007059606,8.8255416e-7,0.000323983,0.10999293],"genre_scores_gemma":[0.17824219,0.0000022539277,0.78546786,0.022901902,0.00068345503,0.0000013307372,0.000011163653,0.00001400501,0.012675869],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931204,0.00001535191,0.00007172816,0.00025786404,0.00015433984,0.00018865053],"domain_scores_gemma":[0.99934065,0.000015191888,0.000020813808,0.0005086458,0.00006263837,0.00005204449],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008985418,0.00007830633,0.000058496335,0.00006051041,0.000099368954,0.0002395495,0.0006482544,0.000019400193,0.00008498287],"category_scores_gemma":[0.0000092969385,0.00006222659,0.000019117959,0.0004042552,0.00001984466,0.00035011835,0.0005369802,0.000050675895,0.001370456],"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.0000039837205,0.000027183432,0.000035778445,0.000023675606,0.000027567252,0.000054634143,0.0020565963,0.0000067255164,0.00059079984,0.058200967,0.016588645,0.9223834],"study_design_scores_gemma":[0.00072136143,0.00026115356,0.0009277138,0.000077914534,0.000015994892,0.00012183679,0.0003656781,0.27425736,0.011378372,0.05753956,0.65354675,0.00078627624],"about_ca_topic_score_codex":0.00012042603,"about_ca_topic_score_gemma":0.00009770848,"teacher_disagreement_score":0.9215972,"about_ca_system_score_codex":0.0000061624364,"about_ca_system_score_gemma":0.000013742747,"threshold_uncertainty_score":0.9994071},"labels":[],"label_agreement":null},{"id":"W2896619815","doi":"","title":"Efficacité d'un test semi-paramétrique d'indépendance entre vecteurs aléatoires","year":2009,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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é de Sherbrooke","funders":"","keywords":"Humanities; Mathematics; Philosophy","score_opus":0.010879621705497501,"score_gpt":0.2130917481783446,"score_spread":0.2022121264728471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896619815","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.013533845,0.009807861,0.7500124,0.1311155,0.0011274046,0.0008473463,0.00015799067,0.0007653764,0.09263226],"genre_scores_gemma":[0.60013735,0.004911426,0.20569393,0.0020126337,0.0002367052,0.00005181163,0.0004892687,0.00009491646,0.18637192],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920994,0.0037379155,0.0008243076,0.0014520019,0.0008147005,0.0010716671],"domain_scores_gemma":[0.9919878,0.0021920418,0.0005685125,0.0033073046,0.0014795727,0.00046471998],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004873011,0.0006093001,0.00052683364,0.00028119487,0.00078760943,0.0018739414,0.0038043058,0.00027884543,0.000374348],"category_scores_gemma":[0.002226698,0.00069331436,0.0002863021,0.0018150081,0.00043550692,0.0016662645,0.0011114817,0.0006990349,0.0005794493],"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.000006837405,0.0015570392,0.0008316051,0.00005962073,0.000052784973,0.00007930534,0.003723575,0.00004669537,0.0011798012,0.30282876,0.009848294,0.67978567],"study_design_scores_gemma":[0.0025268653,0.000009659221,0.026116053,0.003320575,0.00013552293,0.0001493504,0.0001647717,0.20523295,0.11023825,0.017759684,0.63244414,0.001902189],"about_ca_topic_score_codex":0.00042430146,"about_ca_topic_score_gemma":0.0004271961,"teacher_disagreement_score":0.6778835,"about_ca_system_score_codex":0.00015504488,"about_ca_system_score_gemma":0.00023244068,"threshold_uncertainty_score":0.9995518},"labels":[],"label_agreement":null},{"id":"W2897520795","doi":"10.1007/s10707-018-0332-7","title":"Diverse nearest neighbors queries using linear skylines","year":2018,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"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","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Closeness; k-nearest neighbors algorithm; Computer science; Leverage (statistics); Skyline; Set (abstract data type); Euclidean space; Categorical variable; Point (geometry); Space (punctuation); Data mining; Information retrieval; Theoretical computer science; Mathematics; Geography; Combinatorics; Artificial intelligence; Machine learning","score_opus":0.032010437354175386,"score_gpt":0.27436445519887565,"score_spread":0.24235401784470026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897520795","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.020777237,0.000022880808,0.9457594,0.00061270635,0.0011144931,0.00020135847,0.000016651453,0.0003987673,0.031096479],"genre_scores_gemma":[0.1317986,0.000027429627,0.86204255,0.0028833614,0.001072735,0.000008720075,0.000047712332,0.000019469626,0.00209942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990675,0.000011466119,0.00024004655,0.00013939053,0.00023921372,0.0003023971],"domain_scores_gemma":[0.9991749,0.000022174385,0.00008696105,0.0005533043,0.00008329731,0.00007937729],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017504423,0.000121236226,0.000116291056,0.00010497426,0.00027222827,0.0003281344,0.0008152742,0.000030174806,0.000107705266],"category_scores_gemma":[0.000035515997,0.00010180111,0.000040290033,0.0003414565,0.00012799235,0.0029417651,0.00081425573,0.000060970164,0.0011633676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030266898,0.00015661491,0.0016323186,0.0002765915,0.00015768765,0.000062963154,0.014563254,0.00030316584,0.000062711595,0.2972525,0.05836487,0.62713706],"study_design_scores_gemma":[0.00021761308,0.000071788425,0.00046137528,0.00002398293,0.000009518644,0.000008066882,0.00042606104,0.8761212,0.00021198051,0.00077799376,0.121465564,0.00020481143],"about_ca_topic_score_codex":0.00007010913,"about_ca_topic_score_gemma":0.000014373753,"teacher_disagreement_score":0.8758181,"about_ca_system_score_codex":0.000014930331,"about_ca_system_score_gemma":0.00003402081,"threshold_uncertainty_score":0.99961436},"labels":[],"label_agreement":null},{"id":"W2897972190","doi":"10.1145/3282825.3282830","title":"Improving Parallel Performance of Temporally Relevant Top-K Spatial Keyword Search","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Exploit; Ranking (information retrieval); Relevance (law); Information retrieval; Keyword search; Similarity (geometry); Parallelism (grammar); Data mining; Artificial intelligence; Parallel computing","score_opus":0.017214488642603876,"score_gpt":0.24317867895437686,"score_spread":0.22596419031177298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897972190","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.15415438,0.000010802401,0.83023477,0.00043782784,0.00032749475,0.00015154478,0.0000015796745,0.00011704477,0.014564561],"genre_scores_gemma":[0.8054191,0.0000135383625,0.19060363,0.00012165479,0.0001624957,0.000003249866,0.0000038356056,0.000005340094,0.0036671853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888307,0.000021209278,0.00021497195,0.00029769124,0.00031763446,0.00026543505],"domain_scores_gemma":[0.99916357,0.000018365014,0.000064750835,0.00059828704,0.0001012327,0.0000538184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039392573,0.00009362456,0.00011468975,0.00009344848,0.00008846029,0.00011229778,0.001072027,0.000026183812,0.00008202362],"category_scores_gemma":[0.000012639606,0.00007493483,0.000032183536,0.00024772566,0.000079555844,0.0008480108,0.0007929856,0.00007121155,0.0001623872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027549133,0.00008394536,0.009640604,0.00007861036,0.00002137675,0.000008316244,0.00032837858,0.000022222997,0.0016344815,0.02038738,0.002903673,0.9648635],"study_design_scores_gemma":[0.00045710106,0.0006832388,0.009647492,0.000024506273,0.0000043992845,0.000002728932,0.00003484005,0.97192806,0.01112787,0.00018354323,0.0056756064,0.00023060678],"about_ca_topic_score_codex":0.00046564205,"about_ca_topic_score_gemma":0.000038323207,"teacher_disagreement_score":0.9719058,"about_ca_system_score_codex":0.000011737036,"about_ca_system_score_gemma":0.000046826746,"threshold_uncertainty_score":0.3055754},"labels":[],"label_agreement":null},{"id":"W2899185753","doi":"10.1016/j.trpro.2018.10.054","title":"A robust datawarehouse as a requirement to the increasing quantity and complexity of travel survey data","year":2018,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Adaptation (eye); Travel survey; Computer science; Travel behavior; Survey data collection; Data science; Data processing; Data mining; Transport engineering; Engineering; Database; Mathematics","score_opus":0.5154869028348916,"score_gpt":0.42974384900978907,"score_spread":0.08574305382510256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899185753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44563234,0.00006280029,0.54816186,0.0027437108,0.00015714958,0.0014028843,0.0013529483,0.00012501459,0.00036128281],"genre_scores_gemma":[0.967201,0.000038977163,0.031906124,0.000113898386,0.00005852043,0.000017743007,0.00061063725,0.000010444739,0.000042688564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99777263,0.0002505396,0.0002790897,0.00053458253,0.0008531943,0.00030993216],"domain_scores_gemma":[0.99800926,0.00019835102,0.00006447329,0.0011664139,0.0004375121,0.00012399757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006314191,0.000093678194,0.00013218378,0.00015386452,0.00032718616,0.00020522861,0.002154296,0.00002419687,0.000017368551],"category_scores_gemma":[0.00046075587,0.00007212919,0.000011032511,0.00096686254,0.00043559648,0.0011325105,0.0003140701,0.00014333079,0.000035820627],"study_design_candidate":"observational","study_design_consensus":null,"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.0010164392,0.0014170087,0.31941774,0.001256236,0.00034204472,0.00007125815,0.025362806,0.000075093245,0.0026686797,0.48077747,0.075913385,0.09168182],"study_design_scores_gemma":[0.00027332277,0.00020119883,0.9857376,0.00004095091,0.0000061117144,6.738433e-7,0.00024084518,0.011618027,0.00030684163,0.00065636646,0.0008136461,0.00010439243],"about_ca_topic_score_codex":0.013605049,"about_ca_topic_score_gemma":0.03264865,"teacher_disagreement_score":0.66631985,"about_ca_system_score_codex":0.000013300113,"about_ca_system_score_gemma":0.00012852112,"threshold_uncertainty_score":0.99296343},"labels":[],"label_agreement":null},{"id":"W2900653001","doi":"10.1145/3274895.3276476","title":"Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup)","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Upstream (networking); Laptop; Graph; Identification (biology); Data mining; Theoretical computer science; Computer network","score_opus":0.02628290578341722,"score_gpt":0.28414907830178787,"score_spread":0.25786617251837063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900653001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13785686,0.000012435859,0.86109203,0.0000633505,0.0004798126,0.0002756523,0.000009317444,0.000043634773,0.00016687767],"genre_scores_gemma":[0.9798612,0.0000014643131,0.019821247,0.000045849505,0.00009906105,0.000006559089,0.00005077,0.0000051697793,0.00010867796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990687,0.000030300851,0.00025677,0.000274696,0.00015021779,0.00021936248],"domain_scores_gemma":[0.9993606,0.000040966184,0.00012545947,0.0003684912,0.000078050056,0.000026387925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035882465,0.00008457657,0.00011641973,0.0001534691,0.0000775864,0.00010658235,0.0005305102,0.000029894703,0.000010417456],"category_scores_gemma":[0.000024629715,0.00007472884,0.000036027217,0.0003678932,0.00003261523,0.0002151896,0.00024147183,0.000037324266,0.0000046282976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035289355,0.005194415,0.047319207,0.00026804622,0.00032971578,0.0000215603,0.0031211223,0.05211974,0.050474342,0.35307378,0.011588231,0.47613695],"study_design_scores_gemma":[0.0005142652,0.00003547805,0.026857547,0.000016629754,0.000005747084,5.176432e-7,0.000016885408,0.96598375,0.006079285,0.0001880363,0.00021355355,0.00008833492],"about_ca_topic_score_codex":0.0002534985,"about_ca_topic_score_gemma":0.00016482644,"teacher_disagreement_score":0.91386396,"about_ca_system_score_codex":0.00002024043,"about_ca_system_score_gemma":0.000008406088,"threshold_uncertainty_score":0.30473536},"labels":[],"label_agreement":null},{"id":"W2901356348","doi":"10.1145/3274895.3274961","title":"DISTIL","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; SPARK (programming language); Volume (thermodynamics); Throughput; Distributed computing; Distributed database; Real-time computing; Operating system; Wireless","score_opus":0.01122644371644641,"score_gpt":0.23323707337320865,"score_spread":0.22201062965676224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901356348","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.00016233772,0.000001784379,0.74819195,0.00053917913,0.00019723615,0.000012251281,1.8695442e-7,0.000103723876,0.25079137],"genre_scores_gemma":[0.56169623,0.0000026623577,0.38275003,0.0020315037,0.00040412028,0.000002836092,0.0000030523813,0.0000032594978,0.053106338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974376,0.0000027899498,0.000028950215,0.00009670536,0.000057634974,0.0000701862],"domain_scores_gemma":[0.9997116,0.0000037473415,0.000005696277,0.00024961078,0.000011234555,0.000018123554],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000046731002,0.00002215234,0.000018325029,0.000015704498,0.000033274326,0.00009859812,0.00046457376,0.000004127957,0.00012771176],"category_scores_gemma":[0.0000033523013,0.000016581227,0.0000069772123,0.00010062149,0.000017912627,0.00034340812,0.00024034726,0.000008936153,0.0013508651],"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":[1.2458601e-7,0.000007651348,0.00009237847,5.1297314e-7,0.000001738379,0.0000017394256,0.000022789325,2.2489147e-8,0.000013093139,0.7116258,0.069914006,0.21832013],"study_design_scores_gemma":[0.00011401148,0.000059801052,0.004161842,0.0000018072134,0.0000011345419,0.000001205539,0.0000066000334,0.07259284,0.0011398627,0.017900895,0.9039077,0.000112304886],"about_ca_topic_score_codex":0.000006398559,"about_ca_topic_score_gemma":0.0000032263201,"teacher_disagreement_score":0.8339937,"about_ca_system_score_codex":0.00000188036,"about_ca_system_score_gemma":0.0000023406228,"threshold_uncertainty_score":0.9994267},"labels":[],"label_agreement":null},{"id":"W2902521181","doi":"10.1109/tkde.2019.2923914","title":"Skyline Diagram: Efficient Space Partitioning for Skyline Queries","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"National Science Foundation","keywords":"Skyline; Computer science; Voronoi diagram; Set (abstract data type); Scalability; Data mining; Space (punctuation); Theoretical computer science; Database; Mathematics","score_opus":0.0196882249210968,"score_gpt":0.2580137143152098,"score_spread":0.23832548939411302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902521181","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.0025708447,0.00029643512,0.9949624,0.00020584371,0.0011133448,0.00028331106,0.00019143862,0.0002241303,0.00015228013],"genre_scores_gemma":[0.9166816,0.00018358002,0.08110204,0.00005191485,0.00018448083,0.0000837176,0.00020037025,0.000033734836,0.0014785746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990132,0.0000088408615,0.00016587213,0.00046436058,0.000098176046,0.0002495859],"domain_scores_gemma":[0.9989148,0.00012153396,0.00002670463,0.0008236896,0.000035482106,0.00007779722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023094281,0.00015709094,0.0001533866,0.00014726058,0.00011955924,0.00018170186,0.00054781855,0.000036939786,0.000013757688],"category_scores_gemma":[0.000007601591,0.00015333355,0.00003656233,0.00025754562,0.000014397963,0.0006841073,0.000028717604,0.00011132727,0.0000705338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104619,0.0010726505,0.00006924533,0.0011102922,0.0003365323,0.000013965876,0.0013366834,0.42679006,0.0037809173,0.04125494,0.0047380053,0.51943564],"study_design_scores_gemma":[0.0004411974,0.00007429068,0.00005250659,0.00006045029,0.000019920904,0.000002703075,0.000015890197,0.94799036,0.002570663,0.000021789772,0.04855021,0.00020001295],"about_ca_topic_score_codex":0.000005432762,"about_ca_topic_score_gemma":0.000011121091,"teacher_disagreement_score":0.9141107,"about_ca_system_score_codex":0.00001755021,"about_ca_system_score_gemma":0.000016226832,"threshold_uncertainty_score":0.625276},"labels":[],"label_agreement":null},{"id":"W2903819099","doi":"10.1049/iet-its.2018.5036","title":"Efficient processing of distance–time <i>k</i> th‐order skyline queries in bicriteria networks","year":2018,"lang":"en","type":"article","venue":"IET Intelligent Transport Systems","topic":"Data Management and Algorithms","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":"Novelis (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Skyline; Computer science; Order (exchange); Combinatorics; Mathematics; Data mining; Economics","score_opus":0.012067479246454347,"score_gpt":0.23528894678985798,"score_spread":0.22322146754340363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903819099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017169802,0.0010530583,0.9781239,0.000085454514,0.0012836627,0.0004820271,0.000026813934,0.00014970131,0.001625581],"genre_scores_gemma":[0.9948379,0.00004867022,0.0039782235,0.00005525101,0.00023860298,0.00003469028,0.000056008645,0.000021458744,0.00072923733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977069,0.000052604853,0.0008437277,0.0005410791,0.00040982635,0.00044585965],"domain_scores_gemma":[0.99886847,0.00002753706,0.0002053215,0.000615451,0.00020189882,0.00008129754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066628796,0.00025287177,0.00042175053,0.00018818484,0.00008459948,0.00013144534,0.0009875187,0.00007939976,0.000033860375],"category_scores_gemma":[0.000006539443,0.00022038168,0.0000757417,0.0010845667,0.00017108418,0.00032040826,0.0000746206,0.00011907882,0.000045077995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009769737,0.0064981473,0.06643322,0.0076749567,0.00076396717,0.00094319275,0.049037565,0.3653023,0.0053074816,0.1339785,0.009664655,0.35341907],"study_design_scores_gemma":[0.00027895137,0.00014806566,0.0007364076,0.0007090646,0.000017666656,0.000006341822,0.00020193918,0.9637991,0.00093501597,0.000049123373,0.032739248,0.0003790441],"about_ca_topic_score_codex":0.00014200697,"about_ca_topic_score_gemma":0.00008666538,"teacher_disagreement_score":0.97766805,"about_ca_system_score_codex":0.00004030923,"about_ca_system_score_gemma":0.000048453476,"threshold_uncertainty_score":0.89869046},"labels":[],"label_agreement":null},{"id":"W2904055118","doi":"","title":"Proceedings of the Eleventh International Symposium on Combinatorial Search","year":2018,"lang":"en","type":"article","venue":"Symposium on Combinatorial Search","topic":"Data Management and Algorithms","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":"Eleventh; Computer science; Information retrieval; Physics","score_opus":0.017048061752254713,"score_gpt":0.2690321695104767,"score_spread":0.251984107758222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904055118","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.5219391,0.000014677631,0.0009944632,0.030353133,0.11963965,0.003246131,0.00010849887,0.0006291737,0.32307518],"genre_scores_gemma":[0.99500084,0.000023096492,0.00022813719,0.00024846548,0.0028895668,0.00003519566,0.000013128177,0.000037148733,0.0015243998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9951671,0.00013894266,0.00048735848,0.0009090689,0.002566187,0.0007313723],"domain_scores_gemma":[0.99772936,0.00017338565,0.00017173926,0.00089966157,0.00083064847,0.00019520777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015290193,0.00033650448,0.0003245086,0.00026592505,0.00047184172,0.0006099181,0.004965018,0.00016093906,0.00006546012],"category_scores_gemma":[0.00007746811,0.00026385312,0.00019247852,0.0011291293,0.00037229402,0.0007716093,0.0021328533,0.0006095103,0.0002951987],"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.00023502308,0.0008141483,0.0007827895,0.000036025467,0.000085725886,0.000004371608,0.00056689366,0.000009020976,0.009129997,0.97740626,0.009482176,0.0014475896],"study_design_scores_gemma":[0.017358605,0.01192494,0.005602429,0.0007575648,0.000087751076,0.00002003112,0.00036297392,0.024741042,0.6678204,0.08408285,0.18510339,0.0021380445],"about_ca_topic_score_codex":0.00009878856,"about_ca_topic_score_gemma":0.0000015107219,"teacher_disagreement_score":0.8933234,"about_ca_system_score_codex":0.00026219472,"about_ca_system_score_gemma":0.00015111058,"threshold_uncertainty_score":0.99998134},"labels":[],"label_agreement":null},{"id":"W2907125844","doi":"10.4230/lipics.icdt.2019.9","title":"Categorical Range Reporting with Frequencies","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Range (aeronautics); Categorical variable; Computer science; Machine learning; Engineering","score_opus":0.018562575614069335,"score_gpt":0.2422777644464392,"score_spread":0.22371518883236985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907125844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16732347,0.000052900792,0.7886494,0.000905273,0.0017215176,0.0021103644,0.00012299587,0.0007309771,0.038383096],"genre_scores_gemma":[0.85652816,0.000024016115,0.13752623,0.0016835143,0.00022352625,0.00014880137,0.0004726133,0.00005860235,0.0033345309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967575,0.00002039414,0.0013980079,0.0003828371,0.00066200725,0.00077927444],"domain_scores_gemma":[0.99710786,0.00008237623,0.0011739205,0.0012500319,0.00021812612,0.00016771015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009151532,0.00035386244,0.00046564222,0.0002349288,0.00023063962,0.000837523,0.0015721795,0.0001133772,0.000039537037],"category_scores_gemma":[0.00009534711,0.0002689418,0.00016519948,0.00048366011,0.000072700335,0.0040370496,0.0006428292,0.0003128779,0.00045190565],"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.0003192567,0.0013013631,0.24955152,0.0039216625,0.0012795872,0.00035763648,0.029793631,0.00072852976,0.00024581273,0.5067168,0.05202903,0.15375516],"study_design_scores_gemma":[0.011759307,0.0018996568,0.013760084,0.00045750246,0.00015509523,0.0006643461,0.0042941268,0.4171916,0.0014571977,0.0064485283,0.5385594,0.0033531734],"about_ca_topic_score_codex":0.000032242326,"about_ca_topic_score_gemma":0.000010280724,"teacher_disagreement_score":0.6892047,"about_ca_system_score_codex":0.000095905416,"about_ca_system_score_gemma":0.000073738054,"threshold_uncertainty_score":0.9999763},"labels":[],"label_agreement":null},{"id":"W2907216425","doi":"10.1145/3282834.3282841","title":"A Performance Study of Big Spatial Data Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Big data; Computer science; Scalability; SPARK (programming language); Spatial analysis; Benchmark (surveying); Field (mathematics); Variety (cybernetics); Volume (thermodynamics); Computer data storage; Data science; Database; Data mining; Artificial intelligence; Operating system","score_opus":0.0771246113023431,"score_gpt":0.2765820328687794,"score_spread":0.1994574215664363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907216425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27088243,0.0000133071935,0.69889146,0.000055415578,0.002048093,0.00042699525,0.000010388195,0.00014836987,0.027523557],"genre_scores_gemma":[0.9957062,0.0000026132977,0.003017965,0.00001828912,0.00022054368,0.0000029570297,0.0000073458355,0.000002322278,0.0010217797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922544,0.000020398988,0.0001468167,0.00027037604,0.00022576372,0.00011118229],"domain_scores_gemma":[0.9982825,0.00000971046,0.000051993913,0.0015895222,0.000043582088,0.00002270973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029491112,0.00005510381,0.00008520193,0.00005937464,0.000050053863,0.0001058142,0.0023145434,0.000008829204,0.000010124044],"category_scores_gemma":[0.0000063384623,0.00004156011,0.000005157462,0.00022067495,0.000023643897,0.00071012654,0.0018726832,0.000022703016,0.000090234826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012000576,0.0010935209,0.029730782,0.00008793162,0.00011109942,0.0000109142175,0.001454008,0.000022651282,0.000054879314,0.007716519,0.024212413,0.9354933],"study_design_scores_gemma":[0.00036059396,0.0005845972,0.009184254,0.000009642752,0.0000066386588,0.0000010385322,0.00020420902,0.9804061,0.000054341115,0.0000058863257,0.009094333,0.00008833393],"about_ca_topic_score_codex":0.00075224455,"about_ca_topic_score_gemma":0.0001222042,"teacher_disagreement_score":0.98038346,"about_ca_system_score_codex":0.000003351171,"about_ca_system_score_gemma":0.000011387601,"threshold_uncertainty_score":0.43010357},"labels":[],"label_agreement":null},{"id":"W2908981684","doi":"10.1109/iemcon.2018.8614984","title":"Strategies for Continuous Region Query Processing in Moving Point Sets","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Workload; Online aggregation; Point (geometry); Web query classification; Query expansion; Query optimization; Location-based service; Sargable; Web search query; Server; Transmission (telecommunications); Spatial query; Mobile device; Response time; Data mining; Real-time computing; Search engine; Information retrieval; Computer network; Operating system; Telecommunications","score_opus":0.026909964421460462,"score_gpt":0.2763185627897786,"score_spread":0.24940859836831816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908981684","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.0062605347,0.000026727224,0.97475207,0.00087986176,0.0001513822,0.00018040516,4.110035e-7,0.00014696595,0.017601632],"genre_scores_gemma":[0.8555434,0.000003162314,0.14276236,0.00054403034,0.00011128838,0.000021502283,0.0000038376234,0.0000064799156,0.0010039927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993209,0.000011389753,0.00013063622,0.00024908324,0.00008449123,0.00020349368],"domain_scores_gemma":[0.9996628,0.000015097663,0.00003224155,0.00021813573,0.000049906674,0.000021825575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002168315,0.00007177869,0.000084184794,0.000089403926,0.0000707231,0.0005310562,0.00042945574,0.00002087548,0.000003227463],"category_scores_gemma":[0.000011630661,0.0000607414,0.000017898465,0.00018464348,0.00003093307,0.0020401692,0.00017988976,0.000032201413,0.000010162495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009758122,0.00006401756,0.00039330745,0.00008521383,0.0000049627865,0.000026556781,0.00140589,0.00001338894,0.00022087096,0.27115253,0.015807474,0.710816],"study_design_scores_gemma":[0.000864081,0.0002570725,0.0018772905,0.00015001433,0.000004941993,0.00001130253,0.0026652212,0.9043967,0.0009642435,0.07183223,0.016563175,0.00041369477],"about_ca_topic_score_codex":0.000058648744,"about_ca_topic_score_gemma":0.00010138588,"teacher_disagreement_score":0.90438336,"about_ca_system_score_codex":0.000014703165,"about_ca_system_score_gemma":0.000038225917,"threshold_uncertainty_score":0.5120987},"labels":[],"label_agreement":null},{"id":"W2911209624","doi":"10.1109/smc.2018.00714","title":"Extending Conditional Preference Network with User's Genuine Decisions","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Ceteris paribus; Preference; Outcome (game theory); Net (polyhedron); Computer science; Extension (predicate logic); Mathematical economics; Mathematics; Microeconomics; Economics; Statistics","score_opus":0.04382751988778996,"score_gpt":0.25431130348608055,"score_spread":0.2104837835982906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911209624","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.002047217,0.0000137320685,0.97871566,0.00030690062,0.00021638328,0.0000848501,0.000004552192,0.00015490482,0.018455781],"genre_scores_gemma":[0.39109814,0.000012079109,0.60173196,0.0008203153,0.0005291252,0.000013409984,0.000041135343,0.0000068678387,0.0057469653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909455,0.00001512436,0.00010344833,0.00029785378,0.00024923074,0.00023977592],"domain_scores_gemma":[0.9993125,0.00006994738,0.00003757117,0.00043978335,0.00006979974,0.000070353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015200491,0.00008627296,0.000072399685,0.000049032486,0.00020313729,0.00030221842,0.0007863515,0.000016172033,0.0003488919],"category_scores_gemma":[0.000013445875,0.00006075859,0.000015660047,0.00028970974,0.00006587215,0.0008973153,0.00040954718,0.000048055193,0.00038306683],"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.000004880543,0.000030828825,0.0010846154,0.0000010149963,0.00002262525,0.0000135279315,0.000031469437,0.00009156966,0.0000115824305,0.88103,0.07595418,0.04172371],"study_design_scores_gemma":[0.0010996448,0.0007251762,0.06946597,0.00011612573,0.000024552364,0.000045846766,0.000030436187,0.18776529,0.00032556188,0.08434425,0.6553319,0.0007252127],"about_ca_topic_score_codex":0.0000059455797,"about_ca_topic_score_gemma":0.00002744228,"teacher_disagreement_score":0.79668576,"about_ca_system_score_codex":0.000009561572,"about_ca_system_score_gemma":0.000020599113,"threshold_uncertainty_score":0.49236768},"labels":[],"label_agreement":null},{"id":"W2911355891","doi":"10.1109/bigdata.2018.8621966","title":"Trajectory Cluster Lifecycle Analysis: An Evolutionary Perspective","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Cluster (spacecraft); Perspective (graphical); Computer science; Data science; Trajectory; Artificial intelligence","score_opus":0.014315281322586011,"score_gpt":0.27119591305191043,"score_spread":0.2568806317293244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911355891","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.0040469216,0.000039137354,0.9363135,0.000904694,0.000248326,0.000089750574,0.0000037213686,0.00029422634,0.058059733],"genre_scores_gemma":[0.78760374,0.000004440961,0.20363748,0.0016498625,0.00053444004,0.000009784651,0.000022909288,0.000007061875,0.006530288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.00005404256,0.00010460523,0.00042015893,0.00020810956,0.00019451484],"domain_scores_gemma":[0.99910456,0.000016055494,0.000030259038,0.0006523647,0.00011544562,0.00008131357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018029498,0.00008839884,0.00009966933,0.0002516183,0.00013483949,0.00015831116,0.0008058952,0.00002440372,0.00020929259],"category_scores_gemma":[0.000009181238,0.00007518585,0.00007438332,0.00091766415,0.00006920671,0.0016242181,0.0002851889,0.000047284953,0.00045815593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028814879,0.0008217391,0.0075635845,0.000007771406,0.0016079514,0.000027586133,0.0051918584,0.0003871501,0.00011569691,0.848471,0.10656366,0.029213203],"study_design_scores_gemma":[0.00029790954,0.0002392482,0.07008372,0.0000020859854,0.000117953925,0.000002174951,0.0007281332,0.91160506,0.00006893443,0.0066715,0.009895891,0.0002874129],"about_ca_topic_score_codex":0.00011173216,"about_ca_topic_score_gemma":0.00010619778,"teacher_disagreement_score":0.91121787,"about_ca_system_score_codex":0.000047622583,"about_ca_system_score_gemma":0.000021757205,"threshold_uncertainty_score":0.588882},"labels":[],"label_agreement":null},{"id":"W2911937761","doi":"10.1109/bigdata.2018.8621964","title":"Fast and Accurate Mining of Node Importance in Trajectory Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Trajectory; Node (physics); Focus (optics); Similarity (geometry); Data mining; Object (grammar); Cluster analysis; Range (aeronautics); Scale (ratio); Artificial intelligence","score_opus":0.01832773874836648,"score_gpt":0.24578005086766594,"score_spread":0.22745231211929945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911937761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15024237,0.00009928821,0.8334841,0.00016357638,0.00021741058,0.00007604751,9.760263e-7,0.000049946124,0.015666282],"genre_scores_gemma":[0.93485826,0.000023290513,0.06441113,0.00023143635,0.000058201862,0.0000019245913,0.0000014874948,0.0000028426523,0.00041141929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994916,0.000010488772,0.00012853352,0.00017551765,0.00006505734,0.00012885522],"domain_scores_gemma":[0.99968046,0.000020500014,0.00004436951,0.00021808724,0.000014122272,0.000022483322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017344841,0.000051643074,0.00007607468,0.000052452517,0.000019712328,0.000047747933,0.00032021798,0.000015709582,0.000016683069],"category_scores_gemma":[0.000005641534,0.0000444298,0.000008697344,0.00021339934,0.000045265784,0.0004894068,0.00019856011,0.000029284074,0.0000026272542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017059017,0.00012459044,0.21696518,0.000049725102,0.00003846955,0.000051848216,0.0022348992,0.00064739946,0.00035037159,0.041472256,0.013796497,0.7242517],"study_design_scores_gemma":[0.0002821376,0.00005078728,0.08664647,0.000021425973,0.0000017551921,0.0000012991009,0.00009598282,0.91164094,0.00020268901,0.00017147243,0.00076859054,0.00011647566],"about_ca_topic_score_codex":0.000019761761,"about_ca_topic_score_gemma":0.00012171938,"teacher_disagreement_score":0.9109935,"about_ca_system_score_codex":0.000003703234,"about_ca_system_score_gemma":0.0000061505384,"threshold_uncertainty_score":0.18117946},"labels":[],"label_agreement":null},{"id":"W2912457582","doi":"","title":"Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Uncertain data; Computer science; Data science; Data mining; Probabilistic logic; Scalability; Knowledge extraction; Object (grammar); Artificial intelligence; Database","score_opus":0.06236342699461999,"score_gpt":0.29629887884226885,"score_spread":0.23393545184764886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912457582","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.12170542,0.0006490962,0.24659514,0.06596248,0.0035111443,0.001967141,0.00041932467,0.00093886175,0.5582514],"genre_scores_gemma":[0.904814,0.000079430094,0.057528805,0.0026941267,0.00047894765,0.0000063216203,0.000114654504,0.0000140412485,0.034269676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896526,0.000008656738,0.00015813558,0.00045459956,0.00023803808,0.00017532556],"domain_scores_gemma":[0.9981082,0.000094583425,0.000073158495,0.0016617003,0.0000308729,0.000031482647],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00020890257,0.00011333655,0.00011527089,0.000044046225,0.00006978544,0.00038992308,0.006869725,0.0000279013,0.00001527479],"category_scores_gemma":[0.0001014671,0.00006741949,0.000034597808,0.0004731049,0.00003410409,0.002070964,0.0028695683,0.00009691553,0.000038893017],"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.000011817099,0.00040294594,0.00064269686,0.000012066215,0.00003660175,0.0000020633533,0.00042574224,0.00001084067,0.0006161117,0.27224764,0.35817307,0.3674184],"study_design_scores_gemma":[0.0027902455,0.0005197069,0.12615159,0.001133824,0.00013647997,0.000002828073,0.0015395987,0.34312746,0.014385263,0.17740393,0.33083382,0.0019752632],"about_ca_topic_score_codex":0.000029044415,"about_ca_topic_score_gemma":0.000014788049,"teacher_disagreement_score":0.7831086,"about_ca_system_score_codex":0.000014688276,"about_ca_system_score_gemma":0.000021369804,"threshold_uncertainty_score":0.99850357},"labels":[],"label_agreement":null},{"id":"W2912701419","doi":"","title":"Proceedings of the First International Workshop on Keyword Search on Structured Data","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; World Wide Web; Keyword search; XML; Information retrieval; Data science","score_opus":0.04442472414593395,"score_gpt":0.2881679948879358,"score_spread":0.24374327074200186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912701419","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.045971654,0.00002135608,0.06708826,0.35728675,0.003434279,0.0012453843,0.00010210572,0.00047835143,0.52437186],"genre_scores_gemma":[0.9563196,0.000017982948,0.025347948,0.009626961,0.00019375385,0.0000020503494,0.000033632223,0.000006246715,0.008451857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906075,0.0000027125734,0.00009876192,0.0002913583,0.00043321133,0.000113178445],"domain_scores_gemma":[0.9993106,0.000021766959,0.000037628954,0.0005691234,0.00004077237,0.000020098252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016596996,0.00006645653,0.000053375814,0.00006317513,0.000057729663,0.00021014982,0.0040670373,0.000015443466,0.00003688661],"category_scores_gemma":[0.000027444965,0.000040064333,0.000018608902,0.00027466315,0.000019226902,0.0005828301,0.00094841095,0.00009833069,0.000016646347],"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.000015499205,0.00010793469,0.0004705916,0.000004197169,0.000020190075,9.843784e-7,0.000117062125,0.000056481527,0.00005086823,0.41533637,0.25336957,0.33045024],"study_design_scores_gemma":[0.001014924,0.00026268576,0.13091081,0.00021441195,0.000009069256,0.0000031294892,0.00014041114,0.25392225,0.004712878,0.0081096655,0.6002927,0.00040709766],"about_ca_topic_score_codex":0.0000036481488,"about_ca_topic_score_gemma":0.0000034660713,"teacher_disagreement_score":0.91034794,"about_ca_system_score_codex":0.0000128065,"about_ca_system_score_gemma":0.0000071864442,"threshold_uncertainty_score":0.7557634},"labels":[],"label_agreement":null},{"id":"W2913227339","doi":"10.5539/mas.v13n2p258","title":"Extracting Interesting Regions and Trips from Taxi Trajectory Data","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Data Management and Algorithms","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":"University of Jordan","keywords":"Computer science; TRIPS architecture; Trajectory; Taxis; Artificial intelligence; Region of interest; Set (abstract data type); Identification (biology); Point of interest; Global Positioning System; Computer vision; Data science; Transport engineering","score_opus":0.05857205640769624,"score_gpt":0.2665555504015678,"score_spread":0.20798349399387156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913227339","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.057214484,0.00006757755,0.9304827,0.00023872036,0.00032175353,0.00021450962,0.000013764985,0.00016972121,0.011276779],"genre_scores_gemma":[0.89378524,0.000006842756,0.10572366,0.00019056034,0.000052030715,0.0000048471697,0.000013413866,0.0000065157433,0.00021687095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978835,0.000014418488,0.0001814699,0.0011174799,0.0004400661,0.00036308763],"domain_scores_gemma":[0.9978683,0.00013404334,0.00011075717,0.0017546639,0.000021617525,0.00011061901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009293069,0.00013000182,0.0001341503,0.00013790121,0.00028782286,0.0007911491,0.0038545907,0.000025370953,0.000010409595],"category_scores_gemma":[0.000056965433,0.000120984776,0.000012060243,0.00050527544,0.00018332824,0.002495521,0.003095002,0.00017048651,0.00007858121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071198197,0.00006562522,0.0007564692,0.000018023715,0.000012847565,0.000013697623,0.001812384,0.00008158271,0.24330683,0.037060402,0.0007785921,0.71608645],"study_design_scores_gemma":[0.00024844977,0.0000110762785,0.0019491274,0.000021640268,0.0000046447412,0.000003313984,0.00015324737,0.9875657,0.0008157551,0.006833497,0.0021822008,0.00021133866],"about_ca_topic_score_codex":0.000059465237,"about_ca_topic_score_gemma":0.0000135803875,"teacher_disagreement_score":0.9874841,"about_ca_system_score_codex":0.000026168922,"about_ca_system_score_gemma":0.00006896349,"threshold_uncertainty_score":0.76290685},"labels":[],"label_agreement":null},{"id":"W2917106292","doi":"10.14778/3303753.3303756","title":"Correlation constraint shortest path over large multi-relation graphs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Relation (database); Theoretical computer science; Computer science; Reachability; Vertex (graph theory); Tree traversal; Enhanced Data Rates for GSM Evolution; Shortest path problem; Longest path problem; Mathematics; Discrete mathematics; Graph; Algorithm; Data mining; Artificial intelligence","score_opus":0.010235153334248006,"score_gpt":0.2181015650240609,"score_spread":0.20786641168981287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917106292","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.7148809,0.0002322647,0.22136419,0.0019833685,0.0041352655,0.00424825,0.00007326063,0.00054032693,0.052542202],"genre_scores_gemma":[0.9913014,0.000015017662,0.007853547,0.00013347255,0.000019150842,0.000016629368,0.0000063680604,0.0000070834717,0.0006473093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998851,0.000005533761,0.00024357444,0.00029605674,0.00038432344,0.00021951854],"domain_scores_gemma":[0.99940866,0.000020880108,0.00023334788,0.00020974693,0.000089063826,0.00003828408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037835518,0.0001259545,0.00012502396,0.00008863161,0.00008184447,0.00011864792,0.0007432235,0.00003869066,0.000034728106],"category_scores_gemma":[0.000025965068,0.00009112277,0.0000853626,0.0003279725,0.000031891315,0.0008753407,0.0005072589,0.000110571404,0.000045778208],"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.000006531156,0.00026803697,0.17189485,0.00004293268,0.000056242432,4.235593e-7,0.0005922656,0.00008882503,0.005448272,0.8096076,0.0021127919,0.009881196],"study_design_scores_gemma":[0.0030047554,0.00019954379,0.31461275,0.0002777655,0.00006413156,0.000007211438,0.00044090493,0.6583411,0.006341008,0.00939721,0.0067964876,0.00051712187],"about_ca_topic_score_codex":0.000018368497,"about_ca_topic_score_gemma":0.0000014551802,"teacher_disagreement_score":0.8002104,"about_ca_system_score_codex":0.000057331443,"about_ca_system_score_gemma":0.000012298431,"threshold_uncertainty_score":0.37158787},"labels":[],"label_agreement":null},{"id":"W2918480433","doi":"10.1007/978-1-4899-7993-3_80680-1","title":"Rank-Aware Query Processing","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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":"Rank (graph theory); Computer science; Information retrieval; Mathematics; Combinatorics","score_opus":0.01644125424369736,"score_gpt":0.23057280090675578,"score_spread":0.21413154666305842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918480433","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":[7.8184956e-7,0.0028059199,0.2552504,0.000102233054,0.0023167199,0.00055832526,0.0013914822,0.00022602387,0.73734814],"genre_scores_gemma":[0.00029771926,0.0030614473,0.0055704154,0.00005488704,0.0017378137,0.00005048538,0.00084107084,0.00010042003,0.9882857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686974,0.000044211865,0.00085261365,0.0009488874,0.0008760039,0.00040856155],"domain_scores_gemma":[0.9966729,0.0001052615,0.000797417,0.0020839479,0.00018051754,0.00015992136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005843262,0.00051218364,0.0007092374,0.0003872608,0.00010503599,0.00018642146,0.0022279648,0.0001947373,0.000086759435],"category_scores_gemma":[0.00003089443,0.00040396917,0.00015129065,0.000097610726,0.00010035854,0.0018412496,0.0012330898,0.00026039782,0.00051425706],"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.000010784958,0.00005167435,0.000025054505,0.0026928552,0.000172787,0.00030877785,0.00015183972,0.0000026742255,0.00001771817,0.6381247,0.12500796,0.23343319],"study_design_scores_gemma":[0.00035944398,0.000040103525,0.0000036759043,0.0028505446,0.000054655666,0.000016869724,0.000013663151,0.0011364365,0.000007756041,0.0010010545,0.99389225,0.0006235297],"about_ca_topic_score_codex":0.00003899327,"about_ca_topic_score_gemma":0.0000068163445,"teacher_disagreement_score":0.8688843,"about_ca_system_score_codex":0.00005797652,"about_ca_system_score_gemma":0.00022670817,"threshold_uncertainty_score":0.9998412},"labels":[],"label_agreement":null},{"id":"W2918878758","doi":"10.1007/978-0-387-39940-9_297","title":"Query Processing and Optimization in Object Relational Databases","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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; Query optimization; Database; Relational database; Sargable; Information retrieval; Object (grammar); Artificial intelligence; Web search query; Search engine","score_opus":0.023954901432926896,"score_gpt":0.2416569673018848,"score_spread":0.2177020658689579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918878758","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.0000067329984,0.006521144,0.54286426,0.00008152821,0.0006441035,0.0007527001,0.00095140573,0.00012181114,0.4480563],"genre_scores_gemma":[0.00063953036,0.018696122,0.53463554,0.00015706592,0.0014551391,0.000079398815,0.017909188,0.0001464073,0.42628163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978165,0.000044359844,0.0006916289,0.00069552596,0.0005357878,0.00021618184],"domain_scores_gemma":[0.99844474,0.00010189001,0.0004960591,0.00080025656,0.000081770726,0.000075317046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005543197,0.00031512495,0.00043819766,0.0005161733,0.00006582227,0.000109254004,0.00053677935,0.00010004656,0.000018678309],"category_scores_gemma":[0.00005802145,0.00031478866,0.000039052324,0.00014441737,0.000057343063,0.0022563064,0.00048154176,0.0002431963,0.00001278616],"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.000023994,0.00014532953,0.00038384143,0.0020540843,0.000083059174,0.000302237,0.00034179076,0.009651566,0.0000056457466,0.78800535,0.0144644575,0.18453862],"study_design_scores_gemma":[0.0009396317,0.000096457356,0.00026313658,0.004795401,0.000085317646,0.000050684215,0.000043829543,0.31997603,0.0000032467372,0.00081956235,0.6717406,0.0011861048],"about_ca_topic_score_codex":0.000114821305,"about_ca_topic_score_gemma":0.000028352253,"teacher_disagreement_score":0.7871858,"about_ca_system_score_codex":0.000045087334,"about_ca_system_score_gemma":0.00015569798,"threshold_uncertainty_score":0.99993044},"labels":[],"label_agreement":null},{"id":"W2919820325","doi":"","title":"Labeling Mycielski Graphs with a Condition at Distance Two.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"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; Combinatorics; Statistics","score_opus":0.009028724248424968,"score_gpt":0.23720384316054777,"score_spread":0.2281751189121228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919820325","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.84381264,0.00020952855,0.111280195,0.0012269246,0.0062203975,0.0006070366,0.000025720228,0.0009499857,0.035667557],"genre_scores_gemma":[0.9907175,0.000008410191,0.007939161,0.0002984756,0.000018367497,0.000015314567,0.000023662149,0.000010791099,0.0009683596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.000030152803,0.00013476484,0.00039166518,0.00029436572,0.000284405],"domain_scores_gemma":[0.99908817,0.000034950197,0.000085459615,0.00061748875,0.0000981762,0.000075759366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019191002,0.00013366662,0.00011840372,0.00007345107,0.00027644797,0.00020248906,0.00073294877,0.000023796123,0.000029545798],"category_scores_gemma":[0.000010938637,0.00011516004,0.000027750282,0.00053850136,0.000116438154,0.00087484723,0.0003440111,0.00007274952,0.00025058084],"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.000007882225,0.000045968667,0.0014954585,0.00000632157,0.000019067405,0.000020747393,0.00013562209,0.0000013096568,0.00012669819,0.99025375,0.00539375,0.0024934052],"study_design_scores_gemma":[0.0032972058,0.00065324,0.0038691252,0.000106477106,0.00003057074,0.000018811765,0.000039919003,0.015519816,0.004695561,0.9233748,0.047716085,0.0006784345],"about_ca_topic_score_codex":0.000016743084,"about_ca_topic_score_gemma":0.000026135725,"teacher_disagreement_score":0.14690481,"about_ca_system_score_codex":0.000045537443,"about_ca_system_score_gemma":0.000016486472,"threshold_uncertainty_score":0.469609},"labels":[],"label_agreement":null},{"id":"W2923556723","doi":"10.1016/j.disopt.2019.03.004","title":"Combinatorial optimization with interaction costs: Complexity and solvable cases","year":2019,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Parameterized complexity; Combinatorial optimization; Matroid; Mathematics; Quadratic assignment problem; Diagonal; Combinatorics; Matrix (chemical analysis); Mathematical optimization; Intersection (aeronautics); Rank (graph theory); Optimization problem; Computational complexity theory; Algorithm","score_opus":0.014847516591581499,"score_gpt":0.23939515683151302,"score_spread":0.2245476402399315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923556723","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.002153324,0.000017293274,0.98929715,0.00023861995,0.0005798664,0.0003635479,0.000008628362,0.00014552326,0.007196018],"genre_scores_gemma":[0.50394154,0.000093091745,0.49451095,0.00019228988,0.00010048433,0.0000252373,0.0007411702,0.000026678441,0.0003685645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906516,0.000046352816,0.00015267324,0.0003610928,0.00020952262,0.00016521743],"domain_scores_gemma":[0.99936604,0.00003907188,0.00012165113,0.00032801047,0.00009191054,0.00005333994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012496226,0.00013402218,0.00013142425,0.00010000473,0.00012922927,0.00049409794,0.00023937206,0.000037067835,0.00008537112],"category_scores_gemma":[0.0000177969,0.00011712255,0.000017024384,0.0003062956,0.00004011503,0.0025656454,0.00018028423,0.0000704629,0.000016159469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000533781,0.00004902344,0.0010999001,0.000023795648,0.000025089985,0.000006064646,0.00009222897,0.90619045,0.0000067197047,0.09039252,0.00023884326,0.0018219798],"study_design_scores_gemma":[0.0007985167,0.0001860358,0.00014821196,0.00003389612,0.000011988241,0.000010255279,0.000096419746,0.99782205,0.00004326311,0.00021688952,0.00045540265,0.00017707798],"about_ca_topic_score_codex":0.00007948567,"about_ca_topic_score_gemma":0.0000056699087,"teacher_disagreement_score":0.5017882,"about_ca_system_score_codex":0.000057101654,"about_ca_system_score_gemma":0.00001674526,"threshold_uncertainty_score":0.4776119},"labels":[],"label_agreement":null},{"id":"W2927487476","doi":"10.3138/cart.54.1.2018-0022","title":"Central Place Indexing: Hierarchical Linear Indexing Systems for Mixed-Aperture Hexagonal Discrete Global Grid Systems","year":2019,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":42,"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":"Search engine indexing; Geospatial analysis; Grid; Hexagonal tiling; Computer science; Geodesic; Theoretical computer science; Computational science; Algorithm; Topology (electrical circuits); Data mining; Mathematics; Information retrieval; Geometry; Geography; Remote sensing; Combinatorics","score_opus":0.008742193213408935,"score_gpt":0.2652332684159675,"score_spread":0.2564910752025586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927487476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016213536,0.0005507007,0.9669823,0.0030268885,0.010914234,0.001464862,0.0004559513,0.00012649136,0.00026500397],"genre_scores_gemma":[0.98752874,0.0014260181,0.0027508307,0.0026037612,0.0020843195,0.00027160902,0.002994139,0.000032627122,0.0003079759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751174,0.00009679199,0.00080460747,0.000282196,0.0008420888,0.00046255617],"domain_scores_gemma":[0.9978475,0.00026956567,0.0005816838,0.0002805691,0.00083999656,0.00018071155],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012657979,0.00026816214,0.0002464436,0.00055184873,0.0005886236,0.0025414298,0.0012539814,0.00015398252,0.0000042579595],"category_scores_gemma":[0.00016812894,0.00019887426,0.0002601037,0.00061584625,0.00009159147,0.0031946476,0.00025365208,0.00026547862,0.0000045189286],"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.00026578025,0.00006350873,0.020010103,0.0002285152,0.00058062724,0.0000022042618,0.0007275411,0.021278145,0.000011592098,0.9408255,0.008955891,0.0070505515],"study_design_scores_gemma":[0.0013645006,0.00014757451,0.0027890475,0.000111167974,0.000030402696,0.00012970771,0.00048512037,0.63771653,0.0000022144309,0.0016677295,0.35531345,0.00024257711],"about_ca_topic_score_codex":0.000046693265,"about_ca_topic_score_gemma":0.000008184628,"teacher_disagreement_score":0.9713152,"about_ca_system_score_codex":0.00006798872,"about_ca_system_score_gemma":0.00010139579,"threshold_uncertainty_score":0.998494},"labels":[],"label_agreement":null},{"id":"W2931608745","doi":"10.1007/s12652-019-01287-1","title":"Developing FIA5 to FSTPR25 for modeling spatio-temporal relevancy in context-aware wayfinding systems","year":2019,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Context (archaeology); Fuzzy logic; Interval (graph theory); Process (computing); Computational intelligence; Spatial contextual awareness; Artificial intelligence; Fuzzy set; Data mining; Human–computer interaction; Mathematics; Geography","score_opus":0.06657421554706484,"score_gpt":0.3035039872047331,"score_spread":0.23692977165766826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931608745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28224063,0.0002307616,0.7160107,0.00021474241,0.00090801006,0.00034764025,9.313723e-7,0.0000203718,0.000026226893],"genre_scores_gemma":[0.9385512,0.000040230585,0.060974088,0.00019955364,0.00015541486,0.000002904163,0.0000033926276,0.000012408344,0.00006083469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794394,0.00004763307,0.00095818174,0.0003451857,0.0003303264,0.0003747082],"domain_scores_gemma":[0.9987975,0.00016985403,0.00043409163,0.00022116832,0.0002842848,0.00009312597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013916271,0.0001835529,0.00042095958,0.0005050026,0.00017121495,0.000536273,0.0008362075,0.000046295238,0.0000030758354],"category_scores_gemma":[0.00006612577,0.00016907234,0.000082836836,0.00034001932,0.000011507045,0.0008699233,0.00039394235,0.00020990572,0.000011672634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001768245,0.0001561629,0.006843826,0.00072975946,0.0001523681,0.00009585963,0.012785372,0.30741262,0.00020956085,0.36997938,0.00030928495,0.30114895],"study_design_scores_gemma":[0.00041438852,0.0002940944,0.00007129936,0.0012056158,0.000007910277,0.000024835657,0.0016843086,0.99124527,0.00025587648,0.0033273515,0.0012193022,0.00024977655],"about_ca_topic_score_codex":0.00005256341,"about_ca_topic_score_gemma":0.000019759887,"teacher_disagreement_score":0.6838326,"about_ca_system_score_codex":0.0001335924,"about_ca_system_score_gemma":0.00007171228,"threshold_uncertainty_score":0.689457},"labels":[],"label_agreement":null},{"id":"W2932849524","doi":"10.3138/cart.54.1.2018-0010","title":"Geospatial Data Organization Methods with Emphasis on Aperture-3 Hexagonal Discrete Global Grid Systems","year":2019,"lang":"en","type":"article","venue":"Cartographica The International Journal for Geographic Information and Geovisualization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; University of Calgary","keywords":"Computer science; Geospatial analysis; Hierarchy; Grid; Emphasis (telecommunications); Scale (ratio); Wavelet; Data mining; Distributed computing; Theoretical computer science; Remote sensing; Telecommunications; Artificial intelligence; Geography","score_opus":0.01403077564004055,"score_gpt":0.31610286823174427,"score_spread":0.3020720925917037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932849524","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.0068398956,0.00012238888,0.9849298,0.0032083017,0.0034755568,0.0006631265,0.00031711496,0.000105943276,0.00033788045],"genre_scores_gemma":[0.9270561,0.0031032846,0.03991086,0.011453458,0.0017053179,0.00011668217,0.016363915,0.000063287596,0.00022710027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980022,0.00012583354,0.00053454796,0.00030618245,0.00077979296,0.00025144633],"domain_scores_gemma":[0.99765354,0.00018469183,0.0005034816,0.0005881892,0.00096513284,0.00010496083],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001302433,0.00022743328,0.00018083017,0.00046438412,0.00047104486,0.0023513944,0.0019271383,0.00008397849,0.000015970769],"category_scores_gemma":[0.00018192675,0.0001494238,0.00007372575,0.0010450038,0.00007195987,0.0043313634,0.0004183295,0.00016602533,0.000013429486],"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.0003693698,0.00015951354,0.05074573,0.000105691885,0.001267466,0.000005052246,0.0009737776,0.0059227035,0.000032241594,0.726322,0.01182511,0.20227136],"study_design_scores_gemma":[0.002217498,0.00042335858,0.014550178,0.00011771224,0.0000852061,0.0002752494,0.0005610071,0.47189343,0.000015990056,0.0016432621,0.5077638,0.000453317],"about_ca_topic_score_codex":0.00004980769,"about_ca_topic_score_gemma":0.000012882007,"teacher_disagreement_score":0.94501895,"about_ca_system_score_codex":0.000038307753,"about_ca_system_score_gemma":0.0000761248,"threshold_uncertainty_score":0.9986843},"labels":[],"label_agreement":null},{"id":"W2937254335","doi":"10.11575/prism/31331","title":"Modelling and Design of Generic Semantic Trajectory Data Warehouse","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Data warehouse; Trajectory; Data mining; Ontology; Geospatial analysis; Context (archaeology); Semantic data model; Inference; Object (grammar); Information retrieval; Data science; Artificial intelligence","score_opus":0.270021894141485,"score_gpt":0.21350428606604224,"score_spread":0.05651760807544273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937254335","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.013364874,0.00021654717,0.9854471,0.00002381296,0.00030308173,0.00023514566,0.000047019348,0.00010523876,0.0002571557],"genre_scores_gemma":[0.94820344,0.0016462014,0.049268097,0.000015447229,0.00005063562,3.1497987e-7,0.0000546108,0.000015964484,0.0007452736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983116,0.00008954879,0.0001546709,0.0011250543,0.000090323876,0.00022882763],"domain_scores_gemma":[0.99584824,0.00005933966,0.000299729,0.0036525177,0.000053579293,0.000086605556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040806385,0.00022530084,0.0003004663,0.00021258583,0.00015164504,0.00020588917,0.005137051,0.0001134872,0.0000039024217],"category_scores_gemma":[0.000014312794,0.00025491024,0.000051686002,0.00014270701,0.00012309934,0.0010885935,0.007989917,0.00023250552,0.00000989773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074008576,0.000042707987,0.00014792927,0.0001349163,0.00009056033,0.00016495983,0.00008329132,0.99115527,0.0000063200573,0.0057549537,0.00041102065,0.0020006713],"study_design_scores_gemma":[0.00022090225,0.000020796957,0.000066912384,0.00007537111,0.000090252695,0.000001375594,0.000013492798,0.9917131,0.000022567632,0.0073048235,0.0002033786,0.0002670194],"about_ca_topic_score_codex":0.00022089953,"about_ca_topic_score_gemma":0.0000071855957,"teacher_disagreement_score":0.93617904,"about_ca_system_score_codex":0.000027053278,"about_ca_system_score_gemma":0.00009761327,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W2947007575","doi":"10.5194/isprs-annals-iv-2-w5-543-2019","title":"TRAFFIC EVENT DETECTION USING TWITTER DATA BASED ON ASSOCIATION RULES","year":2019,"lang":"en","type":"article","venue":"ISPRS annals of the photogrammetry, remote sensing and spatial information sciences","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Ministry of Transportation of Ontario; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geolocation; Social media; Computer science; Event (particle physics); Association rule learning; Association (psychology); Data mining; Microblogging; Data science; Information retrieval; World Wide Web","score_opus":0.07074856228882728,"score_gpt":0.314196317294391,"score_spread":0.24344775500556373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947007575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17654252,0.000006999966,0.8207815,0.001354998,0.00070861867,0.00020859405,0.000011374611,0.00003505085,0.00035032054],"genre_scores_gemma":[0.9936536,0.000009664264,0.0051312177,0.0011361762,0.000031734864,4.8700407e-8,0.000011414553,0.0000024999183,0.000023659235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998412,0.00009832193,0.00032594427,0.00022968727,0.00070668047,0.00022733396],"domain_scores_gemma":[0.9986811,0.00010637112,0.00046310117,0.0005849208,0.00012425458,0.00004020354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018509544,0.00011393109,0.00013888394,0.00026292042,0.00027466618,0.00056422356,0.0007669491,0.000048023994,0.0000025912466],"category_scores_gemma":[0.00019012057,0.00008102677,0.000057503108,0.00064192247,0.00006407834,0.0011154886,0.00031075923,0.00009664589,0.000011281137],"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.000005400258,0.000008085266,0.000089465604,0.000013724468,0.0000073388796,7.2652924e-8,0.00013574491,0.008371947,0.0001240593,0.000002764601,0.00013116875,0.9911102],"study_design_scores_gemma":[0.0001499201,0.000081870814,0.0012693865,0.00006337704,0.0000064932156,0.0000013549021,0.000092144255,0.9923852,0.0033681192,0.000114782255,0.0023593227,0.000108004795],"about_ca_topic_score_codex":0.014284325,"about_ca_topic_score_gemma":0.00059415743,"teacher_disagreement_score":0.9910022,"about_ca_system_score_codex":0.000022323575,"about_ca_system_score_gemma":0.000042708867,"threshold_uncertainty_score":0.99227965},"labels":[],"label_agreement":null},{"id":"W2947194824","doi":"10.4230/oasics.ldk.2019.13","title":"A Proposal for a Two-Way Journey on Validating Locations in Unstructured and Structured Data","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","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":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Unstructured data; Data science; Database; Data mining; Big data","score_opus":0.027119531376479898,"score_gpt":0.2921384102888953,"score_spread":0.26501887891241543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947194824","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.1779382,0.000046228313,0.802901,0.0022773186,0.0027114777,0.0074784243,0.00348885,0.00034353125,0.0028149448],"genre_scores_gemma":[0.6320911,0.0000124564685,0.36267292,0.0010360384,0.00019884082,0.00014079128,0.003497468,0.0000485664,0.0003017806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976595,0.000033751934,0.00082311174,0.00048625702,0.00038818546,0.00060917565],"domain_scores_gemma":[0.99764425,0.0001524993,0.00037715782,0.0015732883,0.00012267526,0.00013016335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007851934,0.0003283709,0.00037007406,0.00036477967,0.00022719044,0.0009885686,0.0021819968,0.00010230252,0.0000117064],"category_scores_gemma":[0.00012293672,0.0002803128,0.00006965824,0.00035972835,0.000059469945,0.0036249186,0.0011789693,0.00029059846,0.00002961292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043446722,0.0006436133,0.014341561,0.0031520058,0.0005685544,0.000012150827,0.018460602,0.0020234608,0.0004317185,0.5775851,0.018697014,0.3636498],"study_design_scores_gemma":[0.0075395815,0.00036859632,0.0019397939,0.00025832327,0.00003674319,0.00003281202,0.0010502044,0.9527543,0.00057226146,0.009323875,0.0254301,0.00069340214],"about_ca_topic_score_codex":0.000017828115,"about_ca_topic_score_gemma":0.00006831244,"teacher_disagreement_score":0.95073086,"about_ca_system_score_codex":0.00006804948,"about_ca_system_score_gemma":0.00010823951,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2947950257","doi":"10.1186/s40537-019-0203-6","title":"Detecting taxi movements using Random Swap clustering and sequential pattern mining","year":2019,"lang":"en","type":"article","venue":"Journal Of Big Data","topic":"Data Management and Algorithms","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":"Carleton University","keywords":"Cluster analysis; Computer science; Swap (finance); Silhouette; Data mining; Hierarchical clustering; k-means clustering; Artificial intelligence","score_opus":0.11508057947702388,"score_gpt":0.29573302343564384,"score_spread":0.18065244395861996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947950257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2708989,0.0000849652,0.72735035,0.00007053907,0.001439163,0.00006114107,0.000014072827,0.0000089458135,0.000071899005],"genre_scores_gemma":[0.92748106,0.00006223134,0.07140731,0.00025774213,0.0006802068,2.4333292e-7,0.000012569195,0.000012948288,0.00008570193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988453,0.000047207763,0.00035384594,0.00023874498,0.00032227527,0.00019267043],"domain_scores_gemma":[0.9988481,0.00004857783,0.0003928476,0.0006069253,0.00003873906,0.00006482734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010196017,0.00009883478,0.000188282,0.00015216506,0.000078183264,0.00048096292,0.0014032668,0.00002297217,0.000007898645],"category_scores_gemma":[0.000042460437,0.000085810236,0.000029316592,0.00012915203,0.000011682218,0.0022392706,0.0024856876,0.00012558844,0.0000048757133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023189643,0.000024190422,0.0056693503,0.00005767358,0.00011385714,0.000120335404,0.0002571719,0.00027823643,0.0062273038,0.0000044795556,0.0002517714,0.98697245],"study_design_scores_gemma":[0.0031672013,0.000096570315,0.00099652,0.00029499453,0.000037152866,0.0001578616,0.00018174884,0.989181,0.0004930212,0.00006328124,0.0051181586,0.00021251325],"about_ca_topic_score_codex":0.00003367235,"about_ca_topic_score_gemma":0.000008340235,"teacher_disagreement_score":0.98890275,"about_ca_system_score_codex":0.000021019156,"about_ca_system_score_gemma":0.000026390584,"threshold_uncertainty_score":0.46379364},"labels":[],"label_agreement":null},{"id":"W2948323804","doi":"10.5281/zenodo.3241945","title":"Models and Data for Simple Applications of BERT for Ad Hoc Document Retrieval","year":2019,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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":"Simple (philosophy); Computer science; Information retrieval; Post hoc; Medicine","score_opus":0.11441677004267531,"score_gpt":0.3490369527446988,"score_spread":0.2346201827020235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948323804","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.875351e-9,0.00056027976,0.034051996,0.00008403543,0.000054018605,0.0021032875,0.96311235,0.000020561763,0.000013475989],"genre_scores_gemma":[3.3072058e-7,0.00008286047,0.011456136,0.00010994769,0.00009583476,0.00064139906,0.98732674,0.000010632593,0.00027610463],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986248,0.000008604488,0.00023945846,0.00070690736,0.00021125497,0.00020894654],"domain_scores_gemma":[0.9966494,0.00022595754,0.00023669936,0.0027250678,0.00011018241,0.000052703377],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001308754,0.00017320298,0.00025035054,0.00009275553,0.00007004638,0.00022833075,0.0034868491,0.00010011234,0.0010406857],"category_scores_gemma":[0.00013843716,0.0001669864,0.000049718747,0.00014491136,0.0000055070545,0.0008982971,0.002977448,0.00007314979,0.00008925044],"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.000005357929,0.000018324914,6.6291266e-9,0.0010071257,0.000029290632,1.8810451e-7,0.000002959918,0.000006190151,1.11087736e-7,0.00008346279,0.98832095,0.01052606],"study_design_scores_gemma":[0.00030107656,0.00006763591,4.9855237e-7,0.00019496348,0.00003209642,4.3444746e-7,0.0000023441735,0.031633005,0.000004918175,0.0015725087,0.96600384,0.0001867119],"about_ca_topic_score_codex":0.000003666995,"about_ca_topic_score_gemma":0.000007623693,"teacher_disagreement_score":0.031626813,"about_ca_system_score_codex":0.000014508888,"about_ca_system_score_gemma":0.00006799745,"threshold_uncertainty_score":0.9998725},"labels":[],"label_agreement":null},{"id":"W2949063183","doi":"10.1109/icde.2019.00147","title":"Top-K Frequent Term Queries on Streaming Data","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Term (time); Information retrieval; Streaming data; Social media; Data mining; World Wide Web","score_opus":0.031126829572152435,"score_gpt":0.2643527266923595,"score_spread":0.23322589712020705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949063183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10294993,0.000073592324,0.49348295,0.0043783328,0.0026960815,0.00056772714,0.000055538178,0.0008246662,0.3949712],"genre_scores_gemma":[0.7663463,0.00006092269,0.17085882,0.0026366406,0.0002671936,0.000008886303,0.00037394316,0.000019798328,0.059427522],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921185,0.000010424845,0.000075413955,0.000375989,0.00017396914,0.00015236763],"domain_scores_gemma":[0.9981522,0.000024086981,0.000025620215,0.0017593341,0.0000082790975,0.000030465682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012269277,0.0000748551,0.000068424,0.000047562517,0.00003447954,0.00028387134,0.0019283454,0.000013575938,0.00015882595],"category_scores_gemma":[0.000006951989,0.000057733156,0.000012529058,0.00010149895,0.000009868243,0.0012950042,0.0013813693,0.00004432889,0.0008776459],"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.0000015894187,0.00007692047,0.004096609,0.00001646271,0.00001966908,0.000016202981,0.00010159269,0.000006683038,0.00010571719,0.40370923,0.021365197,0.5704841],"study_design_scores_gemma":[0.0012058191,0.0004499863,0.045327082,0.0001272271,0.000017040158,0.0000070172055,0.00041093695,0.23094176,0.0042345813,0.004617844,0.7115198,0.0011409529],"about_ca_topic_score_codex":0.000049382757,"about_ca_topic_score_gemma":0.000006842919,"teacher_disagreement_score":0.69015455,"about_ca_system_score_codex":0.000009989294,"about_ca_system_score_gemma":0.000010628632,"threshold_uncertainty_score":0.9999003},"labels":[],"label_agreement":null},{"id":"W2950253786","doi":"10.1137/1.9781611973068.54","title":"Biased Range Trees","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Data Management and Algorithms","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":"Range query (database); Data structure; Range (aeronautics); Computer science; Range tree; Preprocessor; Set (abstract data type); Tree (set theory); Tree structure; Query optimization; Segment tree; Constant (computer programming); Interval tree; Data mining; Mathematics; Combinatorics; Sargable; Artificial intelligence; Information retrieval; Web search query; Search engine","score_opus":0.013072420826448742,"score_gpt":0.245268440160445,"score_spread":0.23219601933399625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950253786","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.36062777,0.0032151958,0.06308233,0.3162847,0.024384873,0.014151988,0.0021854169,0.007563142,0.20850462],"genre_scores_gemma":[0.8741103,0.0005552035,0.09928513,0.0055950563,0.001509987,0.00013402133,0.000055302742,0.00013045344,0.018624593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962976,0.000031068386,0.0006457839,0.00096941885,0.001238223,0.00081788807],"domain_scores_gemma":[0.99775505,0.00007099299,0.0005301016,0.0010718616,0.00033985765,0.0002321281],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007613216,0.000517853,0.00051073666,0.00031511794,0.00034763664,0.0005285626,0.006360913,0.00013945541,0.000016840655],"category_scores_gemma":[0.00016043051,0.0003631276,0.0004125597,0.0013302068,0.00018020498,0.0024561537,0.0014293868,0.00038701075,0.000056811543],"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.00058065244,0.0031459262,0.0046789143,0.0005669533,0.0007576633,0.000043326516,0.0107772965,0.0002755727,0.038956095,0.12503852,0.38292268,0.4322564],"study_design_scores_gemma":[0.02123266,0.014477438,0.13703327,0.003279952,0.0011775986,0.00017811354,0.005942455,0.19716759,0.21684153,0.1220581,0.26996526,0.01064602],"about_ca_topic_score_codex":0.000024230643,"about_ca_topic_score_gemma":9.655771e-7,"teacher_disagreement_score":0.5134825,"about_ca_system_score_codex":0.000060186336,"about_ca_system_score_gemma":0.000035565678,"threshold_uncertainty_score":0.99988204},"labels":[],"label_agreement":null},{"id":"W2950833175","doi":"10.1145/3299869.3319894","title":"Pessimistic Cardinality Estimation","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":77,"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":"Alberta Innovates - Technology Futures; National Science Foundation","keywords":"Computer science; Cardinality (data modeling); Benchmark (surveying); Hash function; Tuple; Key (lock); Monotonic function; Parameterized complexity; Partition (number theory); Join (topology); Theoretical computer science; Mathematical optimization; Algorithm; Data mining; Mathematics; Discrete mathematics","score_opus":0.007955252744919091,"score_gpt":0.2270172417928118,"score_spread":0.2190619890478927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950833175","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.0027422288,0.0000042441698,0.9015237,0.00035287868,0.00024980644,0.000059417005,5.1144065e-7,0.00011671364,0.094950475],"genre_scores_gemma":[0.8537722,9.3052324e-7,0.1369247,0.00022138783,0.000018754483,0.0000022573058,0.000007678317,0.000001699793,0.009050349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995982,0.000009729028,0.000055757482,0.00014433631,0.000113239235,0.0000787133],"domain_scores_gemma":[0.9995903,0.000013932207,0.000015645986,0.00034772925,0.0000129031005,0.000019534546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012839017,0.000035683373,0.000044155797,0.000022014308,0.000020164225,0.00012744403,0.00035816047,0.000008123026,0.00010222776],"category_scores_gemma":[0.0000072832913,0.000029237866,0.000016100172,0.000103595215,0.0000042355086,0.00056834356,0.00015563628,0.000020504365,0.0010900361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.5725436e-7,0.000022385359,0.002163602,0.000024941228,0.000009972317,0.000003602414,0.000043179203,0.00038567575,0.000034048506,0.7457506,0.009034864,0.24252646],"study_design_scores_gemma":[0.00010835376,0.000014342315,0.010463972,0.000003501538,0.0000022788047,8.849186e-7,0.0000057958614,0.9720003,0.000101399004,0.006940703,0.010277817,0.000080651305],"about_ca_topic_score_codex":0.000014621804,"about_ca_topic_score_gemma":3.8712716e-7,"teacher_disagreement_score":0.9716146,"about_ca_system_score_codex":0.0000080789905,"about_ca_system_score_gemma":0.00000598468,"threshold_uncertainty_score":0.99968773},"labels":[],"label_agreement":null},{"id":"W2950930770","doi":"10.48550/arxiv.cs/0211018","title":"Indexing schemes for similarity search: an illustrated paradigm","year":2002,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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 Ottawa","funders":"Marsden Fund; Fonterra Co-Operative Group; Natural Sciences and Engineering Research Council of Canada; Royal Society Te Apārangi; Royal Society; University of Ottawa","keywords":"Search engine indexing; Similarity (geometry); Nearest neighbor search; Metric (unit); Measure (data warehouse); Similarity measure; Computer science; Variety (cybernetics); Index (typography); Data mining; Information retrieval; Artificial intelligence","score_opus":0.24194109308483916,"score_gpt":0.22537138935229437,"score_spread":0.016569703732544794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950930770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035472263,0.000030984334,0.96029127,0.0002014284,0.00043624488,0.00057200476,0.00009629675,0.00043293874,0.002466561],"genre_scores_gemma":[0.98222166,0.00011708646,0.013685051,0.00013429522,0.00014700882,0.0000023000277,0.00020316936,0.000023161907,0.0034662832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764085,0.00010745064,0.00018942753,0.0013560608,0.00012700412,0.0005791854],"domain_scores_gemma":[0.9978692,0.00006949184,0.00015095093,0.0015532508,0.000117219344,0.00023987923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043415008,0.00032830937,0.00030558044,0.00030808864,0.0002660889,0.00047915115,0.0030475226,0.000257855,0.000051792915],"category_scores_gemma":[0.000022323693,0.00039171008,0.00016987232,0.00058424944,0.00011211464,0.0014046212,0.0023685961,0.0005344357,0.000040431372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031377487,0.00035938478,0.0012050999,0.00027319856,0.0002401141,0.00036978256,0.000300363,0.06359143,0.000009658929,0.9208686,0.0017998384,0.010951196],"study_design_scores_gemma":[0.0005145413,0.000071717506,0.00026103726,0.000042547446,0.000040770672,0.0000011098371,0.000049987077,0.95587355,0.000074201875,0.029284997,0.013290277,0.00049529196],"about_ca_topic_score_codex":0.00008080385,"about_ca_topic_score_gemma":0.000030039051,"teacher_disagreement_score":0.9467494,"about_ca_system_score_codex":0.000096657175,"about_ca_system_score_gemma":0.00010195303,"threshold_uncertainty_score":0.9998535},"labels":[],"label_agreement":null},{"id":"W2951184112","doi":"10.22215/etd/2018-13352","title":"Implementation of Minimum Edge Constraints Sets for Proximity Graphs","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Delaunay triangulation; Computer science; Edge contraction; Enhanced Data Rates for GSM Evolution; Graph; Spanning tree; Constrained Delaunay triangulation; Line graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Voltage graph; Artificial intelligence","score_opus":0.025619668222263095,"score_gpt":0.33094518192445954,"score_spread":0.30532551370219646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951184112","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.062706485,0.00007841467,0.86395407,0.00030761914,0.0068352954,0.005664092,0.000829541,0.00040595775,0.059218533],"genre_scores_gemma":[0.19291902,0.000079893165,0.7606704,0.00041523163,0.0003478224,0.00071082753,0.019905327,0.000081609076,0.024869839],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987719,0.000016613652,0.00035093047,0.00041204132,0.00023779362,0.00021072973],"domain_scores_gemma":[0.99898595,0.0000322764,0.0003096857,0.00040895355,0.00022245328,0.000040707917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027053242,0.00017287352,0.00020857842,0.00019419398,0.00006803492,0.00010835778,0.00078932854,0.00008233651,0.00015697588],"category_scores_gemma":[0.000011823363,0.0001606703,0.00010769144,0.00020223131,0.0000446605,0.00062113145,0.00007835713,0.000046031364,0.00001578154],"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.000015402858,0.00008672448,0.00015748155,0.0005377072,0.00013728363,0.0000012095064,0.00089374866,4.0008057e-8,0.00024682606,0.15391302,0.059136033,0.7848745],"study_design_scores_gemma":[0.015927969,0.004803398,0.066137835,0.0010544328,0.0011700006,0.000011476883,0.028892785,0.029593494,0.33942094,0.39490902,0.11147569,0.006602948],"about_ca_topic_score_codex":0.000036946214,"about_ca_topic_score_gemma":0.00029526398,"teacher_disagreement_score":0.77827156,"about_ca_system_score_codex":0.0000124585085,"about_ca_system_score_gemma":0.000096030606,"threshold_uncertainty_score":0.65519446},"labels":[],"label_agreement":null},{"id":"W2951446960","doi":"10.1145/3299869.3300094","title":"Fingerprints for Compressed Columnar Data Search","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer science; Overhead (engineering); Block (permutation group theory); Data compression; Volume (thermodynamics); Compression (physics); Column (typography); Memory management; Compression ratio; Auxiliary memory; Data structure; Parallel computing; Minimax; Data compression ratio; Computer hardware; Semiconductor memory; Algorithm; Image compression; Artificial intelligence; Operating system; Computer network; Mathematics; Engineering","score_opus":0.08198813717934422,"score_gpt":0.3090936588729068,"score_spread":0.22710552169356257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951446960","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.0017978402,0.000010145838,0.9785023,0.0010192988,0.00037575912,0.00045496516,0.000038975155,0.00013776287,0.017662963],"genre_scores_gemma":[0.20640859,0.000016501748,0.72842056,0.001539972,0.00015871387,0.000026580254,0.0004822547,0.00001891682,0.06292792],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911785,0.000012987016,0.00008900614,0.00040668083,0.0001732903,0.00020016999],"domain_scores_gemma":[0.9981518,0.000078714766,0.000017291575,0.0016828589,0.000031028827,0.00003835051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003453205,0.000057573205,0.000080820195,0.00004095093,0.000046928126,0.00028591123,0.0031774729,0.000015383912,0.00014730709],"category_scores_gemma":[0.000010126872,0.000052038828,0.000016235152,0.00012921052,0.000010665037,0.0009946929,0.0023475843,0.00003802481,0.0007478013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014932898,0.00021675622,0.0028758908,0.0001515886,0.00008287095,0.000006915046,0.00015170862,0.00014688447,0.0011632022,0.29426476,0.41268593,0.28823856],"study_design_scores_gemma":[0.00034728882,0.000031036256,0.00095425564,0.0000054026864,0.0000017726101,3.3738138e-7,0.000011455314,0.7921508,0.00032388384,0.00046265477,0.20561711,0.00009400981],"about_ca_topic_score_codex":0.00003448827,"about_ca_topic_score_gemma":0.0000058034043,"teacher_disagreement_score":0.7920039,"about_ca_system_score_codex":0.0000059478875,"about_ca_system_score_gemma":0.00001796101,"threshold_uncertainty_score":0.9611723},"labels":[],"label_agreement":null},{"id":"W2952004427","doi":"10.25417/uic.14869440","title":"Efficient Computation of Subspace Skyline over Categorical Domains","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Army Research Office; Fonds National de la Recherche Luxembourg; Qatar Foundation; Microsoft Research; Qatar National Research Fund; National Science Foundation","keywords":"Skyline; Categorical variable; Computer science; Data mining; Exploit; Tuple; Set (abstract data type); Subspace topology; Computation; Theoretical computer science; Machine learning; Artificial intelligence; Algorithm; Mathematics","score_opus":0.0636550452972275,"score_gpt":0.21273983833349655,"score_spread":0.14908479303626904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952004427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13617945,0.000035080215,0.8597264,0.00011969811,0.00071834103,0.00022805222,0.000020352147,0.000115273484,0.0028573214],"genre_scores_gemma":[0.99533975,0.00004925612,0.0033938552,0.000022156142,0.00007568981,3.9288267e-7,0.00004713119,0.000010726555,0.0010610503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841046,0.00007655462,0.00019581402,0.0008748234,0.00016989055,0.00027248057],"domain_scores_gemma":[0.99777174,0.0000504307,0.0004729615,0.001471171,0.00012195407,0.00011174102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029353955,0.00024698977,0.00033125049,0.00026484494,0.00016364997,0.00017195361,0.0023538766,0.00015255404,0.000009868159],"category_scores_gemma":[0.000025906349,0.0002717279,0.0001738362,0.0002984821,0.00013721675,0.0002026109,0.0035077943,0.00030253571,0.000045472727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019663441,0.0002521829,0.001048669,0.00012801186,0.00010990498,0.00033427248,0.0001603459,0.604484,0.000015077355,0.39027604,0.0011492841,0.0020225476],"study_design_scores_gemma":[0.0005416131,0.000036022106,0.0041332026,0.000045854573,0.00005773265,0.0000011834524,0.000016842287,0.97634476,0.00003458024,0.017967932,0.0005276772,0.00029257243],"about_ca_topic_score_codex":0.00023014736,"about_ca_topic_score_gemma":0.000021591528,"teacher_disagreement_score":0.8591603,"about_ca_system_score_codex":0.00011946337,"about_ca_system_score_gemma":0.00009450913,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W2952068610","doi":"10.1109/icde.2019.00027","title":"A Semi-Supervised Framework of Clustering Selection for De-Duplication","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Cluster analysis; Computer science; Correlation clustering; Set (abstract data type); Class (philosophy); Sampling (signal processing); Hash function; Domain (mathematical analysis); Data mining; Mathematics; Artificial intelligence; Algorithm","score_opus":0.013568442786025025,"score_gpt":0.25639397814770176,"score_spread":0.24282553536167673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952068610","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.011229444,0.000004796014,0.9864216,0.00030180343,0.00010850888,0.0002316173,7.861273e-7,0.00007821035,0.0016232189],"genre_scores_gemma":[0.45857897,0.0000036549802,0.54005086,0.00019210693,0.000035234043,0.000021295256,0.000004697169,0.0000037906152,0.0011093919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995812,0.0000070753067,0.000088568435,0.00015177047,0.00006871756,0.00010264488],"domain_scores_gemma":[0.9996395,0.000043911485,0.00003425603,0.00023140624,0.000034297285,0.000016636443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015975507,0.000040423307,0.000056556804,0.000045043114,0.000021647724,0.00005244027,0.000319217,0.000026738111,0.000024852512],"category_scores_gemma":[0.000012953052,0.000037784306,0.000025081314,0.00018772297,0.0000033289703,0.00037664492,0.00010502449,0.000027206155,0.000022340279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024923933,0.00014398345,0.013898585,0.0003502917,0.000058595746,1.5503376e-7,0.0008036321,0.0029954123,0.021702038,0.5371564,0.00423901,0.418627],"study_design_scores_gemma":[0.0001348962,0.000049831022,0.0010282781,0.000013696009,0.0000024429921,4.3806983e-7,0.000014263709,0.9889167,0.003425299,0.003958241,0.0024015435,0.000054377095],"about_ca_topic_score_codex":0.000016395827,"about_ca_topic_score_gemma":0.0000049640757,"teacher_disagreement_score":0.98592126,"about_ca_system_score_codex":0.000014343053,"about_ca_system_score_gemma":0.000010066865,"threshold_uncertainty_score":0.15407993},"labels":[],"label_agreement":null},{"id":"W2952098125","doi":"10.1137/1.9781611975482.183","title":"Exact Algorithms and Lower Bounds for Stable Instances of Euclidean <i>k</i>-MEANS","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Data Management and Algorithms","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":"","keywords":"Euclidean geometry; Euclidean algorithm; Algorithm; Mathematics; Combinatorics; Computer science; Discrete mathematics; Geometry","score_opus":0.04989408783899186,"score_gpt":0.242237781629213,"score_spread":0.19234369379022115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952098125","genre_codex":"other","genre_gemma":"methods","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.0002146898,0.00032664565,0.48580804,0.00018986572,0.0012795177,0.00665076,0.0016723797,0.0002041578,0.50365394],"genre_scores_gemma":[0.00042159326,0.00027340907,0.52885807,0.00029628104,0.0010762237,0.0002499852,0.00022795121,0.00016502073,0.46843144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815404,0.0000023782943,0.0005767792,0.0005939738,0.0003197567,0.00035309535],"domain_scores_gemma":[0.99843854,0.00032288337,0.0005524768,0.00051271485,0.000080691374,0.00009268305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064250885,0.0004245547,0.0007644227,0.000057658086,0.00020752092,0.0002978227,0.0005629834,0.00043767807,0.000005855976],"category_scores_gemma":[0.000010377952,0.0003725849,0.0003517017,0.000026282689,0.00021944247,0.00014988637,0.0004379998,0.00025734122,0.0000018076512],"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.000017896005,0.000028738143,1.7671579e-7,0.0007398047,0.00028811579,2.4980807e-7,0.0005834782,9.707361e-7,0.00004839765,0.9114979,0.009436029,0.07735826],"study_design_scores_gemma":[0.003241551,0.0003720928,1.1164246e-7,0.0004109248,0.00033640387,0.0000021293788,0.00033961426,0.0067139426,0.00048097258,0.43844998,0.548854,0.0007982839],"about_ca_topic_score_codex":0.0000022140875,"about_ca_topic_score_gemma":0.0000022167817,"teacher_disagreement_score":0.539418,"about_ca_system_score_codex":0.000028020253,"about_ca_system_score_gemma":0.00011941104,"threshold_uncertainty_score":0.9998726},"labels":[],"label_agreement":null},{"id":"W2952162622","doi":"10.13140/rg.2.2.11166.28489","title":"Random Tessellation Forests","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Mondrian; Computer science; Process (computing); Binary tree; Tree (set theory); Monte Carlo method; Space partitioning; Tessellation (computer graphics); Domain (mathematical analysis); Binary number; Point process; Algorithm; Inference; Theoretical computer science; Mathematics; Artificial intelligence; Computer graphics (images); Statistics","score_opus":0.05804052649545609,"score_gpt":0.1790589830140752,"score_spread":0.1210184565186191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952162622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027922107,0.00003546619,0.9587521,0.00009646794,0.0010883223,0.00038398197,0.000012265209,0.00025391555,0.011455362],"genre_scores_gemma":[0.98973584,0.00010147237,0.0021717611,0.00006220368,0.00008830776,5.1514934e-7,0.00007557465,0.000011499209,0.0077528274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855214,0.0000679733,0.00013630156,0.0008939254,0.00009375387,0.0002558904],"domain_scores_gemma":[0.9982058,0.000075894495,0.00018566527,0.0013807233,0.00007589458,0.00007602201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023185465,0.00022234024,0.00024021482,0.00023324386,0.0000823618,0.00024814575,0.00204001,0.0001486236,0.00003186001],"category_scores_gemma":[0.000015894115,0.00024762328,0.000144488,0.00039192577,0.00003485488,0.0007501804,0.002740223,0.0002770963,0.0005145002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004884087,0.00010996287,0.014448702,0.0001919104,0.00017965958,0.00026800396,0.00013693508,0.59279907,0.0000070838037,0.37767184,0.007600537,0.0065374337],"study_design_scores_gemma":[0.0009578783,0.00002051761,0.003205466,0.000049768383,0.000041365536,7.1894976e-7,0.000009517767,0.95339054,0.000022191569,0.03783376,0.0041319686,0.0003363229],"about_ca_topic_score_codex":0.000049554623,"about_ca_topic_score_gemma":0.000022367443,"teacher_disagreement_score":0.96181375,"about_ca_system_score_codex":0.00007628104,"about_ca_system_score_gemma":0.00006782481,"threshold_uncertainty_score":0.9999976},"labels":[],"label_agreement":null},{"id":"W2952780231","doi":"10.1007/978-1-4614-0110-0_16","title":"Counting Plane Graphs: Flippability and Its Applications","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Plane (geometry); Mathematics; Geometry","score_opus":0.022572560065373858,"score_gpt":0.22584076886558146,"score_spread":0.2032682088002076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952780231","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.0000036223098,0.0015368403,0.13024297,0.00025002362,0.00016610025,0.00048552032,0.0000466929,0.00026653905,0.8670017],"genre_scores_gemma":[0.0022549473,0.0014712613,0.034136344,0.0006243821,0.00048225647,0.00008535851,0.0003005847,0.000039632916,0.9606052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900246,0.0000045358183,0.00018235283,0.00042474864,0.00020161364,0.00018430992],"domain_scores_gemma":[0.99912196,0.000058319303,0.0000979834,0.00060051883,0.00004250452,0.00007872608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025289063,0.00017821329,0.00015993528,0.000094303294,0.00010529833,0.0001839638,0.00065021083,0.0000886093,0.00016808088],"category_scores_gemma":[0.00000383539,0.00016049226,0.000037686517,0.00003696039,0.000035307297,0.0005708776,0.0006255845,0.00013625689,0.00033378444],"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":[1.7191391e-7,0.0000064271853,0.000012307098,0.000037202048,0.0000151098375,6.406738e-7,0.000010206882,4.813103e-8,0.0000017188273,0.9152524,0.0013188281,0.083344966],"study_design_scores_gemma":[0.000063047824,0.000008498075,0.0000699559,0.000016276044,0.000021411024,0.0000036989215,0.00000168297,0.0009838067,0.000008635047,0.058844678,0.93972015,0.000258132],"about_ca_topic_score_codex":0.0000056406934,"about_ca_topic_score_gemma":0.0000060181674,"teacher_disagreement_score":0.93840134,"about_ca_system_score_codex":0.000011828911,"about_ca_system_score_gemma":0.0000105280005,"threshold_uncertainty_score":0.6544684},"labels":[],"label_agreement":null},{"id":"W2954173133","doi":"10.22215/etd/2018-12991","title":"Distributed Real-Time Analysis of High-Velocity Many-Dimensional Data Sets","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Scalability; Distributed computing; Aggregate (composite); Cloud computing; Key (lock); Set (abstract data type); Isolation (microbiology); Database; High availability; Data mining; Real-time computing; Operating system","score_opus":0.021801141265799035,"score_gpt":0.2853062881420922,"score_spread":0.2635051468762932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954173133","genre_codex":"methods","genre_gemma":"dataset","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.2143333,0.00014183465,0.68063647,0.0012083029,0.0054619275,0.0017880166,0.042452514,0.0018038878,0.05217375],"genre_scores_gemma":[0.012028969,0.00006829585,0.25533852,0.00008391999,0.00012274331,0.000010201893,0.70352054,0.000027919474,0.028798873],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745935,0.000052446707,0.00048955885,0.0010177096,0.00071637204,0.0002645537],"domain_scores_gemma":[0.99624985,0.00006807096,0.00041244368,0.002935618,0.0002499945,0.000084016894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047158854,0.00027333281,0.00059941516,0.0005135456,0.000096648655,0.00017433107,0.0039158147,0.00014904604,0.00081597845],"category_scores_gemma":[0.00003889948,0.00024045011,0.0001323949,0.0018516375,0.00003863424,0.0008131096,0.0013327325,0.00010604045,0.00019913666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000879188,0.00067481707,0.00019090067,0.0002579957,0.011505835,0.00007576117,0.00019682353,0.00015912652,0.0005456634,0.049041666,0.85700977,0.0802537],"study_design_scores_gemma":[0.00025434146,0.000048994534,0.058159254,0.000041283496,0.0016552234,4.1415475e-7,0.000023385393,0.9339123,0.00036041305,0.0009658475,0.0040652156,0.0005133627],"about_ca_topic_score_codex":0.0012714448,"about_ca_topic_score_gemma":0.0004475676,"teacher_disagreement_score":0.93375313,"about_ca_system_score_codex":0.000028750157,"about_ca_system_score_gemma":0.00010556629,"threshold_uncertainty_score":0.9805271},"labels":[],"label_agreement":null},{"id":"W2954304876","doi":"10.5194/ica-adv-1-20-2019","title":"Modelling and Analysis of Semantically Enriched Simplified Trajectories Using Graph Databases","year":2019,"lang":"en","type":"article","venue":"Advances in Cartography and GIScience of the ICA","topic":"Data Management and Algorithms","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; University of New Brunswick","funders":"","keywords":"Computer science; Graph database; Trajectory; Geospatial analysis; Database; Visualization; Semantics (computer science); Graph; Data mining; Data structure; Process (computing); Theoretical computer science; Information retrieval; Algorithm; Programming language","score_opus":0.019525022977099345,"score_gpt":0.26945253905669225,"score_spread":0.2499275160795929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954304876","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.6519406,0.0014629439,0.34610498,0.00004562191,0.00012131287,0.00010400546,0.000016999316,0.000008461121,0.00019509747],"genre_scores_gemma":[0.96322936,0.0007531779,0.035984997,0.000021056032,0.0000032107025,0.0000011592452,0.0000014596603,0.0000016605047,0.0000039125666],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989937,0.000035796755,0.00022081926,0.00032573554,0.00025894376,0.00016501689],"domain_scores_gemma":[0.9992057,0.00013953821,0.00013193146,0.00045909866,0.000034220524,0.00002952788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034871235,0.000090347574,0.0002372138,0.00040404906,0.00007409952,0.000040971776,0.0006098249,0.000014314342,0.0000011596476],"category_scores_gemma":[0.00001656317,0.00006277014,0.000080467806,0.0030992152,0.00040028497,0.0012688519,0.0003450286,0.000053561143,3.858219e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024666224,0.00013475327,0.5214819,0.0002187962,0.00019943503,0.000002298658,0.0014648666,0.22794834,0.0072311256,0.22306043,0.0000032117027,0.0182302],"study_design_scores_gemma":[0.00023226032,0.00005450746,0.027453667,0.00007062322,0.00015567578,0.0000011346518,0.00030913594,0.95625985,0.0012879171,0.013790577,0.00018983621,0.0001948347],"about_ca_topic_score_codex":0.00009781318,"about_ca_topic_score_gemma":0.000039331626,"teacher_disagreement_score":0.7283115,"about_ca_system_score_codex":0.0000020741334,"about_ca_system_score_gemma":0.00001137396,"threshold_uncertainty_score":0.2559692},"labels":[],"label_agreement":null},{"id":"W2954484802","doi":"10.1007/978-3-030-19738-4_28","title":"Supervised Classification Box Algorithm Based on Graph Partitioning","year":2019,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Data Management and Algorithms","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; Graph; Pattern recognition (psychology); Artificial intelligence; Algorithm; Theoretical computer science","score_opus":0.026309398559450994,"score_gpt":0.2597019193474782,"score_spread":0.23339252078802722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954484802","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.000008711226,0.004107336,0.88738245,0.00006588836,0.0019936603,0.0005374272,0.00001169737,0.00012919828,0.10576364],"genre_scores_gemma":[0.34729445,0.028034292,0.35244033,0.0035453837,0.0053759045,0.00030155547,0.0022211622,0.0007310437,0.2600559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976327,0.000050674273,0.0006630282,0.0008799002,0.000441683,0.0003320557],"domain_scores_gemma":[0.99852854,0.00023500538,0.0003847997,0.00070428284,0.0000747888,0.00007258625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052832725,0.00037550426,0.00044843229,0.00042434715,0.00015123095,0.00041673507,0.00069400074,0.00014150278,0.000010684301],"category_scores_gemma":[0.000010912629,0.0003655856,0.00009501869,0.0001327463,0.00005286629,0.0005335854,0.00024231302,0.0003323134,0.00008884409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033928363,0.00002717549,0.00014361704,0.00023191184,0.000018645993,0.000018859088,0.00008465601,0.011500833,9.2876735e-7,0.45106184,0.00013790744,0.5367702],"study_design_scores_gemma":[0.00018573209,0.00010035307,0.000037019403,0.0016245248,0.000009418032,0.000003479981,0.00006369921,0.877202,0.000007533919,0.0039156964,0.116443746,0.00040681628],"about_ca_topic_score_codex":0.00001911922,"about_ca_topic_score_gemma":0.0000040938708,"teacher_disagreement_score":0.86570114,"about_ca_system_score_codex":0.00008746286,"about_ca_system_score_gemma":0.000035842964,"threshold_uncertainty_score":0.9998796},"labels":[],"label_agreement":null},{"id":"W2961427308","doi":"10.5194/ica-proc-2-128-2019","title":"Semantically Enriched Simplification of Trajectories","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ICA","topic":"Data Management and Algorithms","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; University of New Brunswick","funders":"","keywords":"Trajectory; Computer science; Offset (computer science); Algorithm; Raster data; Process (computing); Dimension (graph theory); Data structure; Path (computing); Tracing; Object (grammar); Data point; Data mining; Artificial intelligence; Mathematics; Raster graphics","score_opus":0.006214568058820971,"score_gpt":0.19898912530846222,"score_spread":0.19277455724964124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961427308","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.9563865,0.00003729919,0.009792073,0.0033803293,0.000434513,0.00046750827,0.0000035319342,0.00009735971,0.029400876],"genre_scores_gemma":[0.9908059,0.0000053562803,0.0084859105,0.000037336697,0.000017599683,0.0000026111472,3.9561152e-7,0.0000031321442,0.00064170576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937665,0.0000019582324,0.00015487851,0.00014677522,0.00022477096,0.00009494395],"domain_scores_gemma":[0.9995023,0.000022333243,0.00014978957,0.00018661926,0.00012371768,0.000015230983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019113046,0.00005437822,0.000101023936,0.000037227626,0.00002237801,0.000043177788,0.0011720837,0.000019044019,0.0000068177123],"category_scores_gemma":[0.000054152897,0.00003688206,0.00004286061,0.00031939737,0.000035356057,0.0004366875,0.00032787668,0.00004150986,0.000011820009],"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.000007356068,0.00007997369,0.012723329,0.0002073433,0.000027854223,3.7751036e-8,0.0005772219,0.000002005524,0.17032707,0.8063932,0.00196527,0.0076893177],"study_design_scores_gemma":[0.0012671719,0.00042987298,0.3417169,0.00022293013,0.00009234209,0.000005482556,0.00066926365,0.037045535,0.48077092,0.11792365,0.01919469,0.00066125276],"about_ca_topic_score_codex":0.0000042563274,"about_ca_topic_score_gemma":1.07785304e-7,"teacher_disagreement_score":0.6884696,"about_ca_system_score_codex":0.0000056954073,"about_ca_system_score_gemma":0.000009409375,"threshold_uncertainty_score":0.21780425},"labels":[],"label_agreement":null},{"id":"W2963575846","doi":"10.5555/2627817.2627912","title":"Frozen variables in random boolean constraint satisfaction problems","year":2013,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Data Management and Algorithms","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":"Constraint satisfaction problem; Constraint (computer-aided design); Heuristics; Cluster analysis; Constraint satisfaction; Local consistency; Mathematics; Random variable; Algorithm; Computer science; Hypergraph; Discrete mathematics; Mathematical optimization; Statistics","score_opus":0.010199872324038213,"score_gpt":0.22240178705055139,"score_spread":0.21220191472651317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963575846","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.012328087,0.00017885676,0.9213549,0.008655631,0.002345873,0.0032562527,0.00007183638,0.0008717786,0.050936807],"genre_scores_gemma":[0.86452425,0.00045729912,0.12762043,0.0018253397,0.0005761,0.0009281047,0.0002031875,0.00009903946,0.0037662252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734205,0.00015112788,0.00052167213,0.00083130796,0.00051418005,0.0006396628],"domain_scores_gemma":[0.998584,0.000125406,0.00016275527,0.0008897849,0.00006369951,0.00017436391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054927485,0.0003475457,0.000359574,0.00032726143,0.00014408518,0.00075394777,0.00096327235,0.00010905426,0.00018362913],"category_scores_gemma":[0.000025550082,0.00029814296,0.00010849528,0.0005343602,0.00010047264,0.001980294,0.00036407437,0.00028849847,0.0006417702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084859836,0.00072102755,0.009153967,0.00027191927,0.00041910072,0.00018633818,0.0027435373,0.01028732,0.014442563,0.1532087,0.025797425,0.78268325],"study_design_scores_gemma":[0.007969729,0.0006149204,0.023323698,0.0003564257,0.00003921539,0.000029926228,0.00032290784,0.92973167,0.0013649232,0.021684494,0.012964077,0.0015980287],"about_ca_topic_score_codex":0.0013090805,"about_ca_topic_score_gemma":0.000053991927,"teacher_disagreement_score":0.9194443,"about_ca_system_score_codex":0.00010244528,"about_ca_system_score_gemma":0.000055610533,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W2964255032","doi":"10.1109/access.2019.2931005","title":"Scalable Distributed kNN Processing on Clustered Data Streams","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Data Management and Algorithms","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":"York University","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Shandong University","keywords":"Computer science; Scalability; Partition (number theory); Data stream mining; Bounded function; Data mining; Sliding window protocol; Set (abstract data type); Process (computing); Index (typography); Distributed computing; Theoretical computer science; Window (computing); Database; World Wide Web","score_opus":0.061647486904073796,"score_gpt":0.31963422692817056,"score_spread":0.2579867400240968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964255032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11807925,0.00006661239,0.8660907,0.0016338888,0.0024424682,0.000714152,0.0003772597,0.00061591505,0.009979719],"genre_scores_gemma":[0.9944262,0.000009640382,0.0032405981,0.00056650187,0.0001694998,0.000008654565,0.0004807548,0.000014191051,0.0010839476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845445,0.000027275353,0.00017931161,0.0006777524,0.00034098703,0.00032019333],"domain_scores_gemma":[0.99775726,0.000034876623,0.00010416162,0.0019918252,0.000042948217,0.00006893117],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00023778818,0.00014488386,0.00015021117,0.00007943622,0.00010250595,0.0014620768,0.0058955243,0.000037865502,0.00004151649],"category_scores_gemma":[0.000015503934,0.00012357223,0.000020151354,0.00053774525,0.000020055633,0.005293335,0.0018704919,0.000111026944,0.00046316814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023870409,0.00032559282,0.005629447,0.00017852866,0.000048103648,0.00004431753,0.00008926008,0.00067763915,0.00016923113,0.0024119336,0.08087345,0.9095286],"study_design_scores_gemma":[0.0010284701,0.000085780695,0.005449074,0.00015861637,0.000016656033,0.0000032158955,0.00002937187,0.9515796,0.002220953,0.0009958916,0.03794339,0.0004890018],"about_ca_topic_score_codex":0.00006501753,"about_ca_topic_score_gemma":0.000009994711,"teacher_disagreement_score":0.9509019,"about_ca_system_score_codex":0.000025021265,"about_ca_system_score_gemma":0.00003784297,"threshold_uncertainty_score":0.9995745},"labels":[],"label_agreement":null},{"id":"W2964516965","doi":"","title":"Conception Et Développement D’un Outil De Modification De La Segmentation Routière","year":2019,"lang":"fr","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","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":"","keywords":"Geography; Cartography; Humanities; Philosophy","score_opus":0.02786156823984626,"score_gpt":0.3051512344656399,"score_spread":0.27728966622579365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964516965","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.07558734,0.000222032,0.89766955,0.0158028,0.00074862025,0.0005335941,0.000022504988,0.00011252327,0.009301045],"genre_scores_gemma":[0.67940354,0.00035396658,0.31072715,0.0013313504,0.00015572483,0.00006381634,0.00019232665,0.000019646573,0.007752458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998164,0.0004049623,0.00031310853,0.0003642448,0.00033677614,0.0004169048],"domain_scores_gemma":[0.9990288,0.00012369429,0.00017360835,0.0005189037,0.000056335048,0.00009865777],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001425407,0.00017383146,0.0001510506,0.00007723715,0.00010817153,0.00061510643,0.0005085911,0.00010311884,0.00050883356],"category_scores_gemma":[0.000038120445,0.00019247047,0.000057383586,0.000244686,0.00007251316,0.001060699,0.00024202997,0.00014343257,0.0016281938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009613173,0.00035993205,0.0070462814,0.0003084399,0.00009647814,0.000015805117,0.011692296,0.001580321,0.0022310698,0.41583154,0.009194538,0.5516337],"study_design_scores_gemma":[0.0012169826,0.00012795044,0.07667527,0.00020460147,0.00008097985,0.000019383066,0.0010705953,0.8617481,0.0019481519,0.037409868,0.019100383,0.000397726],"about_ca_topic_score_codex":0.00011663662,"about_ca_topic_score_gemma":0.000004040356,"teacher_disagreement_score":0.8601678,"about_ca_system_score_codex":0.00024045707,"about_ca_system_score_gemma":0.00011176855,"threshold_uncertainty_score":0.99914914},"labels":[],"label_agreement":null},{"id":"W2967977841","doi":"10.1007/978-3-030-29029-0_7","title":"Exploring Bit Arrays for Join Processing in Spatial Data Streams","year":2019,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Join (topology); Computer science; STREAMS; Bit (key); Database; Data mining; Mathematics; Computer network","score_opus":0.13167963245567665,"score_gpt":0.301888639843374,"score_spread":0.17020900738769734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967977841","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.00007824174,0.0125284735,0.9667112,0.000035588087,0.0025836523,0.0010093952,0.000039732462,0.000085452324,0.016928239],"genre_scores_gemma":[0.5510965,0.062236995,0.2723323,0.0004988805,0.010905038,0.000494618,0.002988117,0.000849349,0.09859821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971541,0.000024464784,0.0008549888,0.0012079346,0.0003194378,0.00043903795],"domain_scores_gemma":[0.99828345,0.00016901299,0.00046682125,0.0009712207,0.000052737407,0.00005678896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037454,0.00039475944,0.0006092341,0.00039684423,0.000100833386,0.00047440195,0.0016260215,0.00009645446,0.0000017636895],"category_scores_gemma":[0.000026906107,0.00038576868,0.00004757469,0.000111453206,0.000038736456,0.0021545861,0.0014860801,0.00030325883,0.00001225592],"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.0000064512947,0.000016352318,0.00017928304,0.0010278092,0.000009138844,0.00001724345,0.00025352475,0.0033008931,6.944164e-7,0.075794674,0.000028415427,0.9193655],"study_design_scores_gemma":[0.00028413156,0.00008729427,0.000016845663,0.004470688,0.000011383607,0.0000075485596,0.00021323585,0.81880766,0.00000834947,0.0029959506,0.1725319,0.00056501623],"about_ca_topic_score_codex":0.00014829519,"about_ca_topic_score_gemma":0.00016370771,"teacher_disagreement_score":0.91880053,"about_ca_system_score_codex":0.00008668583,"about_ca_system_score_gemma":0.0000565883,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W2968931659","doi":"","title":"An event-driven approach to spatio-temporal mapping","year":2019,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","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":"Event (particle physics); Computer science; Geography; Space (punctuation); Cartography; Data science","score_opus":0.017326103128200217,"score_gpt":0.23926069471250966,"score_spread":0.22193459158430945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968931659","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.057401337,0.0000038483468,0.9251828,0.00046818575,0.00023413952,0.00037801458,0.0000035859896,0.00018267076,0.0161454],"genre_scores_gemma":[0.62148875,4.1261845e-7,0.37684909,0.00041173273,0.000060749662,0.000019702635,0.0000621189,0.000007232927,0.001100183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989422,0.00003519106,0.00016993261,0.0003466917,0.00025357679,0.00025243557],"domain_scores_gemma":[0.9989448,0.000011998422,0.0000481813,0.00086393935,0.000022918814,0.000108114764],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000226095,0.00010145946,0.00012622823,0.000111176254,0.0000568316,0.0002900189,0.0011317804,0.000023120547,0.000056781497],"category_scores_gemma":[0.0000072706694,0.00009320017,0.000031576143,0.00032630897,0.000008084914,0.0008860554,0.00036682346,0.000049730876,0.0016422704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015396694,0.0015135615,0.034470752,0.0005931677,0.00019585533,0.000040069197,0.011042567,0.01419563,0.00076727255,0.5498376,0.06231269,0.32501546],"study_design_scores_gemma":[0.00019669709,0.000076055236,0.008298303,0.00002129111,0.0000031017412,0.000002214126,0.0001265,0.96581215,0.00003311565,0.0014835779,0.02373304,0.00021393406],"about_ca_topic_score_codex":0.000023252773,"about_ca_topic_score_gemma":0.000002349624,"teacher_disagreement_score":0.9516165,"about_ca_system_score_codex":0.000016131073,"about_ca_system_score_gemma":0.00001551622,"threshold_uncertainty_score":0.9991351},"labels":[],"label_agreement":null},{"id":"W2969414045","doi":"10.1007/978-3-030-29948-4_7","title":"Enabling Standard Geospatial Capabilities in Spark for the Efficient Processing of Geospatial Big Data","year":2019,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Geospatial analysis; SPARK (programming language); Computer science; Big data; Geospatial PDF; Data science; Database; Geography; Remote sensing; Data mining","score_opus":0.07821030335994344,"score_gpt":0.30089710571526823,"score_spread":0.2226868023553248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969414045","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.000046973873,0.00060434535,0.98570275,0.000632841,0.00053940486,0.000882964,0.0001528886,0.00002717636,0.011410646],"genre_scores_gemma":[0.3256238,0.006081311,0.66245717,0.0014595288,0.00047619094,0.00019443003,0.0014307576,0.000049935537,0.0022268689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817896,0.000017862081,0.00074191834,0.00032625988,0.00050870207,0.00022628458],"domain_scores_gemma":[0.99546725,0.00043504295,0.0004293943,0.003299015,0.00033634264,0.000032973396],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0025576768,0.00017103828,0.00025579982,0.0006602422,0.00033677687,0.00066716067,0.0069336956,0.00006170481,0.0000017028714],"category_scores_gemma":[0.00009696297,0.00013773245,0.000029465686,0.00040639483,0.00064886594,0.0042015575,0.0060765534,0.0002443491,0.0000037937552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005329835,0.000012660697,0.000033205666,0.00010547099,0.000003995662,5.784077e-8,0.0021195328,0.0026091388,4.5280382e-7,0.11686441,0.00009162727,0.8781541],"study_design_scores_gemma":[0.00032830343,0.000042001084,0.0003874315,0.00022625695,0.0000060232614,0.0000012226451,0.00009494953,0.9137879,0.0000053373446,0.0013256805,0.08363288,0.00016199583],"about_ca_topic_score_codex":0.00006124482,"about_ca_topic_score_gemma":0.00008515215,"teacher_disagreement_score":0.91117877,"about_ca_system_score_codex":0.00008324028,"about_ca_system_score_gemma":0.00051766355,"threshold_uncertainty_score":0.99843925},"labels":[],"label_agreement":null},{"id":"W2975826719","doi":"10.1016/j.asoc.2019.105750","title":"Temporal event searches based on event maps and relationships","year":2019,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Data Management and Algorithms","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":"Douglas College","funders":"Fundamental Research Funds for the Central Universities; Innovation and Technology Fund; Education University of Hong Kong; South China University of Technology; Faculty of Liberal Arts and Social Sciences, Education University of Hong Kong; Research Grants Council, University Grants Committee; Natural Science Foundation of Guangdong Province; Innovation and Technology Commission; National Natural Science Foundation of China","keywords":"Computer science; Event (particle physics); Set (abstract data type); Component (thermodynamics); Graph; Complex event processing; Data mining; Artificial intelligence; Information retrieval; Theoretical computer science","score_opus":0.026727579189967116,"score_gpt":0.24629263421161868,"score_spread":0.21956505502165155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975826719","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.043304916,0.000022201275,0.94576144,0.0010590525,0.00023991567,0.00045844368,0.0000026821854,0.00026471342,0.008886631],"genre_scores_gemma":[0.9383624,6.2534923e-7,0.060874175,0.00047381723,0.00004914388,0.000004829279,0.00002807603,0.000010072603,0.00019683148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986641,0.00005962489,0.0002053365,0.00046459565,0.00032726003,0.0002790847],"domain_scores_gemma":[0.9990085,0.0003178134,0.000088754525,0.0004884196,0.000018536879,0.00007799805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009695752,0.0001400256,0.0001380552,0.00012148032,0.00021952897,0.00021669513,0.00049636135,0.000039268132,0.0000067998767],"category_scores_gemma":[0.000019169274,0.00013413899,0.000034591503,0.00026163287,0.000024157667,0.0001683556,0.00048424088,0.00023295377,0.00022267779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173966,0.0003302204,0.0450406,0.00020741831,0.000063915315,0.000026762196,0.0014426359,0.053033486,0.00021023287,0.4376941,0.004095884,0.457823],"study_design_scores_gemma":[0.00053991796,0.000054024393,0.011340507,0.00004637228,0.0000039862744,0.000001411038,0.00007328656,0.97918016,0.00007403172,0.0037415838,0.0047234623,0.00022126068],"about_ca_topic_score_codex":0.000007755015,"about_ca_topic_score_gemma":7.643468e-7,"teacher_disagreement_score":0.9261467,"about_ca_system_score_codex":0.000033041913,"about_ca_system_score_gemma":0.000028166267,"threshold_uncertainty_score":0.5470029},"labels":[],"label_agreement":null},{"id":"W2980271943","doi":"","title":"Using Clustering Methods in Geospatial Information Systems","year":2019,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","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":"University of Calgary","funders":"","keywords":"Geospatial analysis; Cluster analysis; Geography; Spatial analysis; Field (mathematics); Computer science; Cartography; Data mining; Geographic information system; Space (punctuation); Remote sensing; Artificial intelligence; Mathematics","score_opus":0.029999569720429935,"score_gpt":0.31664505613497257,"score_spread":0.2866454864145426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980271943","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.009770885,0.000011743012,0.98330605,0.000043383123,0.0007369069,0.00023574979,0.0000015401474,0.00006674419,0.0058270055],"genre_scores_gemma":[0.0913656,0.000002005929,0.90833837,0.00010209756,0.000036971483,0.000009478262,0.000009599592,0.000004124431,0.00013173805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925065,0.0000613158,0.00024853443,0.00010865381,0.00015224819,0.00017857084],"domain_scores_gemma":[0.9994747,0.00003884499,0.000079323596,0.00036454896,0.000017550587,0.000024998879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058037136,0.000068605594,0.00011461508,0.00014990002,0.000027659564,0.0003335409,0.00044238204,0.000025605745,0.000012456745],"category_scores_gemma":[0.000020250893,0.00006408149,0.000017489747,0.00025035,0.000005110011,0.0022145575,0.000388136,0.00005084524,0.00024140692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009249543,0.00008224515,0.004399737,0.0012113436,0.00005969456,0.000016056212,0.004876943,0.07946057,0.0008126409,0.1442621,0.00055461685,0.7642548],"study_design_scores_gemma":[0.00017870512,0.000011263663,0.0012174078,0.000046313013,0.0000018203342,0.0000032304995,0.00007564713,0.99493533,0.000025595344,0.00026839325,0.0031496885,0.0000865947],"about_ca_topic_score_codex":0.00018060731,"about_ca_topic_score_gemma":0.0000039890315,"teacher_disagreement_score":0.9154748,"about_ca_system_score_codex":0.00003162078,"about_ca_system_score_gemma":0.000013090194,"threshold_uncertainty_score":0.32163426},"labels":[],"label_agreement":null},{"id":"W2980655200","doi":"10.1016/j.mex.2019.10.001","title":"GrCount: Counting method for uncertain data","year":2019,"lang":"en","type":"article","venue":"MethodsX","topic":"Data Management and Algorithms","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 Alberta","funders":"Government of Canada","keywords":"Interval (graph theory); Interval data; Python (programming language); Mathematics; Fuzzy logic; Algorithm; Computer science; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.10611389428347481,"score_gpt":0.40273554624002594,"score_spread":0.2966216519565511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980655200","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.000046267203,0.00007428031,0.9929057,0.00082731876,0.000983912,0.00038894612,0.000050240702,0.0001414302,0.004581947],"genre_scores_gemma":[0.000119181714,0.000006651035,0.99584514,0.0008137586,0.00015060288,0.000018141054,0.00010079699,0.000012691172,0.0029330538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983492,0.00018400344,0.00020239057,0.0006948091,0.00024527623,0.0003243339],"domain_scores_gemma":[0.9970415,0.0006908371,0.000101150974,0.002066848,0.000055369062,0.000044300283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053127226,0.00012920052,0.00020284634,0.00008618343,0.00009031312,0.0003196968,0.003184099,0.0000387147,0.000041518102],"category_scores_gemma":[0.00022351454,0.00011478176,0.000044591732,0.0003324556,0.00001484185,0.001459471,0.0015180759,0.000084238054,0.00012753042],"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.0000040100435,0.000022408927,0.00014962693,0.00006748398,0.000036059435,0.0000028146821,0.000131088,0.00006524364,0.00043184325,0.089979246,0.009544209,0.899566],"study_design_scores_gemma":[0.00023228521,0.000021683285,0.00010439523,0.000008357966,0.000010569124,0.0000015908876,0.000020773592,0.58380866,0.00024937413,0.0098064495,0.4056,0.00013586806],"about_ca_topic_score_codex":0.00008122544,"about_ca_topic_score_gemma":0.0000036997367,"teacher_disagreement_score":0.8994301,"about_ca_system_score_codex":0.00001937369,"about_ca_system_score_gemma":0.00003202853,"threshold_uncertainty_score":0.5916901},"labels":[],"label_agreement":null},{"id":"W2981816395","doi":"10.22215/etd/2019-13400","title":"A Recommendation System based on Clustering and Classification for Optimal Trajectory Analysis","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Cluster analysis; Computer science; Naive Bayes classifier; Data mining; Classifier (UML); Traffic analysis; Trajectory; Bayes' theorem; Machine learning; Artificial intelligence; Bayesian probability","score_opus":0.02818883269102794,"score_gpt":0.2775842978771662,"score_spread":0.24939546518613825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981816395","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.0006270214,0.000004814364,0.9837996,0.00012649267,0.0006267849,0.0005811354,0.000029806031,0.00015280324,0.014051594],"genre_scores_gemma":[0.6236574,0.00002305204,0.32415912,0.00034283334,0.00020824946,0.0005793032,0.029034339,0.00006660099,0.021929136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880993,0.00003783475,0.00025168987,0.00059059146,0.00016514583,0.00014480451],"domain_scores_gemma":[0.99914294,0.00009657244,0.00022033195,0.0004371543,0.00006700499,0.000036010733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034898394,0.00017797464,0.0002479966,0.00061905244,0.000092084774,0.00037645214,0.0003619583,0.000102636746,0.000019377207],"category_scores_gemma":[0.000009635343,0.00016819905,0.00011368523,0.00040011585,0.000003678939,0.00039953282,0.000029693818,0.00007394979,0.000016773947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027767793,0.00021967993,0.00023034045,0.0034498002,0.0012810659,0.0000023774726,0.000734521,0.013157119,0.0002722071,0.037997913,0.0041164546,0.93826085],"study_design_scores_gemma":[0.00028491512,0.00007792423,0.0024172217,0.000042494026,0.0002239844,8.823531e-8,0.00037131828,0.9950131,0.000041036485,0.0000028319507,0.0013310674,0.00019401804],"about_ca_topic_score_codex":0.000012993784,"about_ca_topic_score_gemma":0.000050451905,"teacher_disagreement_score":0.981856,"about_ca_system_score_codex":0.00007781196,"about_ca_system_score_gemma":0.000029726232,"threshold_uncertainty_score":0.68589586},"labels":[],"label_agreement":null},{"id":"W2982627676","doi":"10.5539/jmr.v11n6p21","title":"Algorithm on Trees With Knots and Their Folding","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Data Management and Algorithms","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":"Mathematics; Folding (DSP implementation); Tree (set theory); Combinatorics; Knot (papermaking); Algorithm","score_opus":0.06104297433271652,"score_gpt":0.33323582073118335,"score_spread":0.27219284639846686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982627676","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.25383288,0.00030355985,0.73280495,0.0020871258,0.00026066814,0.00041935974,0.000003896764,0.000031983745,0.010255552],"genre_scores_gemma":[0.3180105,0.0003039423,0.67792124,0.00008080279,0.00023229384,0.0000041526705,7.292102e-7,0.00002919135,0.003417147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998571,0.00006492072,0.00021537364,0.00013480804,0.00077379413,0.00024010368],"domain_scores_gemma":[0.99878377,0.0004451427,0.00012966823,0.0003551329,0.00019768125,0.000088621884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023062078,0.0000871191,0.00019095484,0.0003715208,0.000075210635,0.00038244022,0.0008438709,0.000023702174,0.000016931699],"category_scores_gemma":[0.00005230096,0.00004889442,0.00003367242,0.0003113135,0.000042049967,0.0005790878,0.00031292412,0.00030941275,0.000044332337],"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.000024640098,0.00064994505,0.0002989886,0.0002465521,0.00021403423,0.00018409648,0.0038967319,0.00007684768,0.0014532655,0.07615005,0.0040176343,0.9127872],"study_design_scores_gemma":[0.0043112263,0.007243845,0.0027690593,0.0023982334,0.000024706762,0.0007478225,0.0069760806,0.79513204,0.008975601,0.14368238,0.027006093,0.00073290634],"about_ca_topic_score_codex":0.0000014836929,"about_ca_topic_score_gemma":8.1637364e-7,"teacher_disagreement_score":0.9120543,"about_ca_system_score_codex":0.000027113056,"about_ca_system_score_gemma":0.00004112441,"threshold_uncertainty_score":0.36878797},"labels":[],"label_agreement":null},{"id":"W2990002113","doi":"10.4230/lipics.isaac.2019.45","title":"Path and Ancestor Queries over Trees with Multidimensional Weight Vectors","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ancestor; Path (computing); Computer science; Theoretical computer science; Tree (set theory); Combinatorics; Mathematics; Algorithm; Geography; Computer network","score_opus":0.00610076255544151,"score_gpt":0.20920867595822878,"score_spread":0.20310791340278728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990002113","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.91042525,0.00010961816,0.08263077,0.00035260673,0.0014441478,0.0013150865,0.00037309076,0.00031066567,0.00303878],"genre_scores_gemma":[0.8261174,0.00012054432,0.16872607,0.0016356095,0.00021761599,0.00011987426,0.00059652264,0.00006358373,0.0024027724],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812865,0.0000186401,0.00047906104,0.00034255537,0.0005007774,0.00053029606],"domain_scores_gemma":[0.9986945,0.00008800113,0.0002578108,0.0007008625,0.00010644736,0.00015242839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026479413,0.0003407197,0.0003429971,0.00018473309,0.00020925338,0.0004311369,0.000700638,0.00008625825,0.00003671169],"category_scores_gemma":[0.000014528823,0.00025047892,0.000082430066,0.0002468402,0.00011637364,0.003928672,0.0005661697,0.00018844374,0.000110737186],"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.00077478687,0.0013829246,0.5322987,0.0029532425,0.0012606174,0.00007530345,0.024913166,0.00037029796,0.00040509738,0.29421207,0.04531512,0.0960387],"study_design_scores_gemma":[0.0091572115,0.0013586461,0.0663972,0.0004854606,0.00007012031,0.00007292638,0.0010478251,0.32290372,0.00074910454,0.00055481185,0.5955387,0.0016643055],"about_ca_topic_score_codex":0.00002030565,"about_ca_topic_score_gemma":0.00002193044,"teacher_disagreement_score":0.5502235,"about_ca_system_score_codex":0.00004701678,"about_ca_system_score_gemma":0.00004437019,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W2990751717","doi":"10.1007/s11634-019-00379-2","title":"Is-ClusterMPP: clustering algorithm through point processes and influence space towards high-dimensional data","year":2019,"lang":"en","type":"article","venue":"Advances in Data Analysis and Classification","topic":"Data Management and Algorithms","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Cluster analysis; Curse of dimensionality; Algorithm; Data point; Computer science; Subspace topology; Mathematics; Statistical physics; Artificial intelligence; Physics","score_opus":0.0354850183539955,"score_gpt":0.31527472121398364,"score_spread":0.27978970285998817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990751717","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.008765176,0.002345034,0.9853937,0.0024317985,0.000118106866,0.00022568119,0.00042405076,0.000052826883,0.000243598],"genre_scores_gemma":[0.49483755,0.01033553,0.48855007,0.00082025054,0.00007595777,0.00002100666,0.0049773487,0.000016254768,0.00036603288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775815,0.000045856057,0.00033455217,0.0012934195,0.00035222003,0.00021579253],"domain_scores_gemma":[0.9968434,0.000078004196,0.00021091952,0.002736243,0.00008149642,0.000049941515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005163235,0.00017475974,0.0002802095,0.00019434698,0.00009763656,0.00042817302,0.0020879111,0.00004318513,0.000014580913],"category_scores_gemma":[0.00007525357,0.00015299155,0.000014691094,0.0013210935,0.00007955178,0.0124877915,0.0035281326,0.00010548496,0.00001503971],"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.00001652698,0.00015825745,0.023267705,0.00033909568,0.00030883984,0.000010778941,0.00048861175,0.0008527351,0.000200702,0.006122715,0.0007680287,0.967466],"study_design_scores_gemma":[0.00028169862,0.000019990744,0.03521664,0.000047402755,0.00011333838,0.0000029168984,0.00011023435,0.9488339,0.000039233535,0.0014266595,0.013678622,0.00022937325],"about_ca_topic_score_codex":0.00018540888,"about_ca_topic_score_gemma":0.0003261496,"teacher_disagreement_score":0.96723664,"about_ca_system_score_codex":0.000019156643,"about_ca_system_score_gemma":0.000038567672,"threshold_uncertainty_score":0.9053347},"labels":[],"label_agreement":null},{"id":"W2994742394","doi":"10.1109/tkde.2019.2960347","title":"Group-Based Skyline for Pareto Optimal Groups","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Skyline; Computer science; Pareto principle; Dimension (graph theory); Heuristic; Group (periodic table); Point (geometry); Pareto optimal; Computation; Set (abstract data type); Theoretical computer science; Data mining; Combinatorics; Artificial intelligence; Mathematics; Algorithm; Mathematical optimization","score_opus":0.02137811809518209,"score_gpt":0.2535165900882512,"score_spread":0.23213847199306914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994742394","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.0019137857,0.000125877,0.9961188,0.00007737754,0.0009574051,0.00027518484,0.00023852763,0.00021291875,0.00008015729],"genre_scores_gemma":[0.81576777,0.00005180188,0.18314175,0.000085488806,0.00014753541,0.00007429668,0.00029110917,0.000033735534,0.00040652443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990436,0.000007559012,0.00014832274,0.00047885577,0.00008995883,0.00023170644],"domain_scores_gemma":[0.9988404,0.00011684176,0.000020171427,0.0009229158,0.000022396685,0.00007725623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020342591,0.00015418313,0.00014290426,0.00015757616,0.00007631885,0.00014408393,0.0008046786,0.000040657145,0.000011442852],"category_scores_gemma":[0.000002784229,0.0001521496,0.000038941205,0.00021827365,0.000009384103,0.000996017,0.000019647263,0.00010702491,0.000059640835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118367134,0.0013225296,0.00006452247,0.0014128616,0.00037127818,0.000020332543,0.00046559214,0.16793877,0.005114954,0.024209086,0.0068372367,0.79212445],"study_design_scores_gemma":[0.00069518515,0.00012126235,0.000034988152,0.000038124348,0.000018526238,0.0000016273897,0.0000072011153,0.96552867,0.0010998956,0.000013537251,0.032239985,0.00020102081],"about_ca_topic_score_codex":0.0000030131866,"about_ca_topic_score_gemma":0.000006484724,"teacher_disagreement_score":0.813854,"about_ca_system_score_codex":0.000015540427,"about_ca_system_score_gemma":0.00001343281,"threshold_uncertainty_score":0.62044805},"labels":[],"label_agreement":null},{"id":"W2994986475","doi":"10.1109/ccece47787.2020.9255682","title":"Dynamic Group Trip Planning Queries in Spatial Databases","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Plan (archaeology); Group (periodic table); Set (abstract data type); Database; Information retrieval; Geography","score_opus":0.03873811214761011,"score_gpt":0.2719478572918074,"score_spread":0.23320974514419732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994986475","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.0029842276,0.00004343207,0.99047047,0.0026374997,0.00014780488,0.00007718841,0.000008177122,0.00017335422,0.0034578303],"genre_scores_gemma":[0.8164738,0.000016487764,0.18054093,0.0023789618,0.00006935391,0.0000095801515,0.00013129477,0.000007679997,0.00037191456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00001911929,0.00012146166,0.00026946847,0.00012837569,0.00015346406],"domain_scores_gemma":[0.9996796,0.000023468569,0.000024375202,0.00022190346,0.0000044678563,0.000046187142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008450592,0.000073898016,0.00008621298,0.00005399702,0.000031600757,0.00013196826,0.0005748696,0.00000905558,0.00004225733],"category_scores_gemma":[0.000024396122,0.00006552528,0.000015149042,0.00026041147,0.000019651066,0.0011025872,0.00055268063,0.000061314815,0.00005572314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047352463,0.00018199635,0.013799728,0.0001354586,0.000030075482,0.0007251696,0.0025018998,0.00049629307,0.00067801017,0.36354765,0.024671802,0.5931846],"study_design_scores_gemma":[0.00051746244,0.00008024494,0.012102484,0.00001982504,0.000002675618,0.0000012757578,0.00016956757,0.9440533,0.00013543825,0.00040834065,0.04227993,0.00022948874],"about_ca_topic_score_codex":0.00028464565,"about_ca_topic_score_gemma":0.00017628296,"teacher_disagreement_score":0.94355696,"about_ca_system_score_codex":0.0000083201585,"about_ca_system_score_gemma":0.000008289481,"threshold_uncertainty_score":0.26720434},"labels":[],"label_agreement":null},{"id":"W2996459922","doi":"","title":"Data Structures for Range-Aggregate Extent Queries.","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Aggregate (composite); Range (aeronautics); Computer science; Engineering; Materials science","score_opus":0.07607027244695423,"score_gpt":0.2844721136917034,"score_spread":0.20840184124474914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996459922","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.00071275135,0.00015374449,0.9934159,0.0011478838,0.0004550742,0.00022690678,0.00008744795,0.00019648137,0.003603817],"genre_scores_gemma":[0.03449341,0.00025456698,0.9457228,0.0017196377,0.00032698925,0.00003099274,0.0003899747,0.000016357073,0.017045267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991121,0.000009732073,0.00011865944,0.0003945153,0.00016410799,0.00020088321],"domain_scores_gemma":[0.9984891,0.000027860262,0.00003772695,0.0013698158,0.00002728152,0.00004825297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335966,0.000090104215,0.000092612434,0.00004527834,0.0001450816,0.00012595556,0.002219112,0.000017352926,0.000044802462],"category_scores_gemma":[0.00002343549,0.00006909338,0.000025430687,0.0001262678,0.000039724622,0.0013118478,0.001141565,0.000032355656,0.000030435222],"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.0000086665705,0.000041526866,0.00031070257,0.000023741826,0.00004277757,0.00004043945,0.0001330959,0.00001115758,0.000037800335,0.29813567,0.46784166,0.23337278],"study_design_scores_gemma":[0.0006966491,0.00005559733,0.0034904769,0.000004993539,0.00000839873,0.000020946298,0.000019420344,0.09907631,0.00044852484,0.009909773,0.8859952,0.00027372068],"about_ca_topic_score_codex":0.000032784337,"about_ca_topic_score_gemma":0.000017399232,"teacher_disagreement_score":0.41815355,"about_ca_system_score_codex":0.0000062438576,"about_ca_system_score_gemma":0.000020033585,"threshold_uncertainty_score":0.4123699},"labels":[],"label_agreement":null},{"id":"W2999873292","doi":"10.1145/376284.375664","title":"Efficient computation of Iceberg cubes with complex measures","year":2001,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Pruning; Computer science; Online analytical processing; Data cube; Computation; Scalability; Cube (algebra); Data mining; Measure (data warehouse); Tree (set theory); Theoretical computer science; Algorithm; Data warehouse; Database; Mathematics; Combinatorics","score_opus":0.042388281774761956,"score_gpt":0.2641887323800171,"score_spread":0.22180045060525516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999873292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14632902,0.000046097757,0.84922737,0.0006208377,0.00023022291,0.00018552954,0.0000027162205,0.00013362002,0.0032245656],"genre_scores_gemma":[0.88069475,0.000013631899,0.11892519,0.000106294254,0.000048182366,0.0000065444056,0.000013903996,0.000008036623,0.00018344789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886733,0.00004530096,0.0002047246,0.00031303382,0.00036123334,0.00020836957],"domain_scores_gemma":[0.99901927,0.00007539913,0.00012103627,0.00062967004,0.00010298837,0.00005163126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021413808,0.00012315507,0.00016937015,0.00012768479,0.000079031466,0.00008756069,0.0010387845,0.000023248569,0.000016574724],"category_scores_gemma":[0.00003448273,0.00009745091,0.000038744784,0.00049217755,0.000052423497,0.00021173363,0.00036214438,0.000060079892,0.0000323939],"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.00004408594,0.00027185923,0.006613934,0.00003496333,0.00007640338,0.00003518337,0.00035531996,0.013352688,0.00058273115,0.0053323107,0.0043590437,0.96894145],"study_design_scores_gemma":[0.0010271006,0.00043791326,0.026779369,0.0000736062,0.00002744445,0.000019169733,0.00008448802,0.9493029,0.0003816665,0.0025133304,0.018981177,0.0003718173],"about_ca_topic_score_codex":0.00011273376,"about_ca_topic_score_gemma":0.000045934685,"teacher_disagreement_score":0.96856964,"about_ca_system_score_codex":0.000017209912,"about_ca_system_score_gemma":0.000019500594,"threshold_uncertainty_score":0.3973933},"labels":[],"label_agreement":null},{"id":"W3003200529","doi":"10.1109/icdm.2019.00160","title":"Efficient Mining and Exploration of Multiple Axis-Aligned Intersecting Objects","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Intersection (aeronautics); Scalability; Key (lock); Computation; Graph; Data structure; Theoretical computer science; Algorithm; Database","score_opus":0.023639313196268677,"score_gpt":0.23551365302381427,"score_spread":0.2118743398275456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003200529","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.59495896,0.000009668224,0.40020934,0.00005219032,0.00023534523,0.00011453903,3.8811322e-7,0.00005331418,0.0043662335],"genre_scores_gemma":[0.94627523,0.0000010503747,0.05330489,0.000039697145,0.0000108687955,0.0000020787963,0.0000019691731,0.000002423521,0.00036180537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994744,0.000014928417,0.00011554076,0.00018999506,0.000108727356,0.00009640747],"domain_scores_gemma":[0.9996344,0.000058127374,0.00005572332,0.00020889279,0.000022566126,0.000020309779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018839179,0.00005311225,0.000073549214,0.00007823997,0.000026148982,0.00007634942,0.0002012566,0.0000120166305,0.00000839634],"category_scores_gemma":[0.000024839841,0.000045663408,0.000014354039,0.00015163716,0.000008996308,0.00047286035,0.00029638593,0.0000124850085,0.000014448255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006383448,0.0004603642,0.037953705,0.00049448776,0.00014770486,0.000021398082,0.06411527,0.0071158535,0.055521112,0.08259644,0.0016318635,0.749878],"study_design_scores_gemma":[0.00035676348,0.00007892013,0.0008656689,0.000030217247,0.0000020381883,7.111315e-7,0.0024077988,0.9896378,0.006386202,0.000058941227,0.000086873566,0.00008808314],"about_ca_topic_score_codex":0.000019408813,"about_ca_topic_score_gemma":0.000009409909,"teacher_disagreement_score":0.98252195,"about_ca_system_score_codex":0.0000058788305,"about_ca_system_score_gemma":0.000004625464,"threshold_uncertainty_score":0.18620996},"labels":[],"label_agreement":null},{"id":"W3004091940","doi":"10.3390/ijgi9020088","title":"A Survey on Big Data for Trajectory Analytics","year":2020,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"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":"Trajectory; Big data; Computer science; Data warehouse; Data science; Field (mathematics); Global Positioning System; Online analytical processing; Analytics; Data management; Urban computing; Volume (thermodynamics); Data analysis; Data mining; Search engine indexing; Information retrieval; Human–computer interaction; Telecommunications","score_opus":0.10564709724002141,"score_gpt":0.3069206289142962,"score_spread":0.2012735316742748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004091940","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.00065781723,0.000012912509,0.9899956,0.005756428,0.0023995095,0.00010240953,0.0005373804,0.000021495476,0.0005164665],"genre_scores_gemma":[0.9011325,0.00019429467,0.07119542,0.020662261,0.0029213775,0.0000053979597,0.003752809,0.000016328437,0.0001195615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985771,0.000030207475,0.0005215454,0.000094444076,0.0006644134,0.0001122714],"domain_scores_gemma":[0.998393,0.00013176764,0.0005139102,0.00028558812,0.0005930904,0.00008265595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083623594,0.000090045076,0.00012496837,0.0002580902,0.000044889075,0.0005108054,0.0027843579,0.000028756354,0.0000088058505],"category_scores_gemma":[0.00062715274,0.00007855933,0.00006449418,0.00018746327,0.000013352289,0.006048036,0.00033441104,0.00012078151,0.00005835187],"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.0002041911,0.000059827464,0.00049745734,0.000021115166,0.00026759054,0.000009221391,0.0005589403,0.0020106724,0.000011191609,0.006228014,0.19980219,0.7903296],"study_design_scores_gemma":[0.0015957606,0.00035498463,0.0145563055,0.000040317944,0.000021851209,0.000010153722,0.000079583166,0.5596665,0.00011819498,0.00041221248,0.42295757,0.0001865192],"about_ca_topic_score_codex":0.00001530774,"about_ca_topic_score_gemma":0.0000055558785,"teacher_disagreement_score":0.9188002,"about_ca_system_score_codex":0.000047696212,"about_ca_system_score_gemma":0.000092976865,"threshold_uncertainty_score":0.5174076},"labels":[],"label_agreement":null},{"id":"W3007997785","doi":"10.1109/bigdata47090.2019.9006496","title":"Modeling Dynamic Spatial-Temporal Cluster Relationships","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Cluster (spacecraft); Computer science; Computer network","score_opus":0.021943881116822106,"score_gpt":0.23497029543021014,"score_spread":0.21302641431338804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007997785","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.015494257,0.000009354289,0.9660375,0.0010956579,0.00035955862,0.00013877919,7.980995e-7,0.00017215018,0.016691916],"genre_scores_gemma":[0.9047756,0.00000192259,0.084480144,0.00022886877,0.000018124561,0.0000027580322,0.000020325657,0.0000047181184,0.010467522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928707,0.000030338302,0.00013059223,0.00024877768,0.00015758388,0.0001456558],"domain_scores_gemma":[0.9994079,0.000020220687,0.000021378784,0.0004962228,0.000020521737,0.00003375068],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002684243,0.000069550726,0.00006669267,0.000075641154,0.000060730305,0.00018425946,0.00054405443,0.000025810725,0.000077456934],"category_scores_gemma":[0.0000071704526,0.000059777594,0.000028612056,0.0001468098,0.0000047386675,0.0010158918,0.00035321884,0.00009088164,0.0014532038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015907139,0.000225168,0.040153027,0.00009919761,0.00009830559,0.000021279084,0.0010544485,0.15557322,0.00011743352,0.5453922,0.008663523,0.2485863],"study_design_scores_gemma":[0.00016370663,0.000011493608,0.00053751445,0.0000049515925,0.0000016234543,7.5198295e-7,0.000018823699,0.9943562,0.0000032028884,0.0036488026,0.001155902,0.000096990705],"about_ca_topic_score_codex":0.00013972372,"about_ca_topic_score_gemma":0.00013359633,"teacher_disagreement_score":0.88928133,"about_ca_system_score_codex":0.000015444219,"about_ca_system_score_gemma":0.0000112261905,"threshold_uncertainty_score":0.99932426},"labels":[],"label_agreement":null},{"id":"W3011151727","doi":"10.11606/d.55.2020.tde-16032020-150627","title":"Construção Automática de Funções de Proximidade para Redes de Termos usando Evolução Gramatical","year":2020,"lang":"pt","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Network for Business Sustainability","funders":"","keywords":"Humanities; Philosophy","score_opus":0.031613580692406565,"score_gpt":0.29580180325658634,"score_spread":0.2641882225641798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011151727","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.015479557,0.00025029015,0.95678055,0.0037294524,0.0008433554,0.0015419957,0.00007968917,0.0009698535,0.02032525],"genre_scores_gemma":[0.43010098,0.00033157083,0.542312,0.0027367088,0.0006110557,0.00042258354,0.0014465292,0.00015589996,0.021882674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946512,0.00038437595,0.0010009727,0.001436977,0.00089203357,0.0016344242],"domain_scores_gemma":[0.99713475,0.00036902638,0.00041913879,0.001107679,0.00014604045,0.0008233407],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085480756,0.00084987294,0.0008766592,0.00029927006,0.00046101108,0.002471171,0.0029629318,0.0005153903,0.0005972878],"category_scores_gemma":[0.0005018258,0.00081618055,0.00035018538,0.00080894097,0.00025778872,0.0010119447,0.0006663,0.00087483623,0.0005025842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041056378,0.0019165919,0.010152704,0.0054458734,0.00162837,0.0021873515,0.025475139,0.00011977445,0.00462905,0.45358703,0.0521298,0.44231775],"study_design_scores_gemma":[0.0011222174,0.0003796976,0.0065334244,0.0006222043,0.00042219774,0.000097230484,0.0025429889,0.97074723,0.0034937249,0.007528111,0.0051901634,0.0013208133],"about_ca_topic_score_codex":0.00017150599,"about_ca_topic_score_gemma":0.000036059748,"teacher_disagreement_score":0.9706274,"about_ca_system_score_codex":0.00027169345,"about_ca_system_score_gemma":0.0012852701,"threshold_uncertainty_score":0.9994289},"labels":[],"label_agreement":null},{"id":"W3011231967","doi":"10.1007/s00453-010-9440-y","title":"Biased Range Trees","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Data structure; Range query (database); Range (aeronautics); Range tree; Theory of computation; Computer science; Mathematics; Tree (set theory); Preprocessor; Tree structure; Set (abstract data type); Query optimization; Combinatorics; Binary tree; Discrete mathematics; Algorithm; Interval tree; Data mining; Sargable; Web search query; Information retrieval; Search engine; Artificial intelligence","score_opus":0.010256384292339894,"score_gpt":0.22795302363897205,"score_spread":0.21769663934663216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011231967","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.014644396,0.0000627464,0.94292814,0.005640151,0.0038963638,0.00036706665,0.000029197143,0.0010952929,0.03133663],"genre_scores_gemma":[0.37358198,0.000019158542,0.61704564,0.0017440626,0.0011624924,0.000054835873,0.000052173047,0.00003580063,0.0063038836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988943,0.000020172538,0.00015181568,0.00037963837,0.00025005307,0.00030404676],"domain_scores_gemma":[0.9988817,0.000056173987,0.000048731705,0.0008698047,0.000036985526,0.00010657887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023113214,0.00013416036,0.0001239185,0.0001209458,0.00011096969,0.00027553606,0.0014388959,0.000052013995,0.00012422702],"category_scores_gemma":[0.000033492775,0.00011898604,0.00006417732,0.00036478534,0.00005182286,0.0007966937,0.00036737145,0.00020067503,0.00060862175],"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.0000018088729,0.00009614047,0.00020958483,0.00000445095,0.000023746781,0.000057115052,0.0000965748,9.1626765e-7,0.001883259,0.067077145,0.020306708,0.91024256],"study_design_scores_gemma":[0.001629485,0.00013313355,0.013050464,0.0000133535905,0.00002566268,0.000036029818,0.000027960641,0.21112183,0.008270632,0.013987596,0.75083584,0.0008680275],"about_ca_topic_score_codex":0.00003467675,"about_ca_topic_score_gemma":0.000027756132,"teacher_disagreement_score":0.90937454,"about_ca_system_score_codex":0.000006210685,"about_ca_system_score_gemma":0.000020635696,"threshold_uncertainty_score":0.78228045},"labels":[],"label_agreement":null},{"id":"W3011592252","doi":"10.14778/3236187.3236199","title":"Efficient construction of approximate ad-hoc ML models through materialization and reuse","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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; Online analytical processing; Reuse; Dimension (graph theory); Cluster analysis; Variety (cybernetics); Data warehouse; Data mining; Construct (python library); Mixture model; Machine learning; Artificial intelligence; Mathematics; Programming language","score_opus":0.0167162247919843,"score_gpt":0.22005666246918465,"score_spread":0.20334043767720034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011592252","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.8782429,0.0001761049,0.11153561,0.0012548182,0.0011440531,0.0009492957,0.000020523074,0.00014041924,0.0065362365],"genre_scores_gemma":[0.857347,0.00012030771,0.14233345,0.000053859596,0.000046469795,0.00001767999,0.0000014892881,0.000008131737,0.00007159434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990968,0.0000052533956,0.00024215007,0.00024535749,0.0002692093,0.00014120842],"domain_scores_gemma":[0.99929297,0.0000054379566,0.0002692447,0.00024777793,0.00016338463,0.000021155745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023166873,0.00009892955,0.00013054845,0.000053211403,0.000087751745,0.00009616457,0.00074541685,0.000024670964,0.000004329851],"category_scores_gemma":[0.000021527581,0.00007025754,0.0000279853,0.00025121451,0.00017364838,0.00044867917,0.0010269454,0.000027420587,0.0000014436985],"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.00006234717,0.00019497969,0.00020988885,0.0004396009,0.00007376381,1.9723541e-7,0.0067503527,0.00017533051,0.06799204,0.90664,0.0017095257,0.015752012],"study_design_scores_gemma":[0.0010513441,0.00029108985,0.00022954712,0.00024001939,0.000055432443,0.000013376674,0.0005180683,0.3404569,0.5452298,0.10984698,0.0018106686,0.000256773],"about_ca_topic_score_codex":0.000010669031,"about_ca_topic_score_gemma":2.0500302e-7,"teacher_disagreement_score":0.796793,"about_ca_system_score_codex":0.00001998862,"about_ca_system_score_gemma":0.000007353367,"threshold_uncertainty_score":0.28650194},"labels":[],"label_agreement":null},{"id":"W3014823298","doi":"10.1111/tgis.12619","title":"Sketch maps for searching in spatial data","year":2020,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Sketch; Computer science; Matching (statistics); Redundancy (engineering); Data mining; Abstraction; Data redundancy; Process (computing); Implementation; Spatial analysis; Information retrieval; Algorithm; Database; Mathematics","score_opus":0.09702760982318206,"score_gpt":0.3116397447962315,"score_spread":0.21461213497304946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014823298","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.00042136916,0.000012316829,0.9913349,0.007302013,0.00014778048,0.00019770162,0.00010148675,0.000053764736,0.00042864645],"genre_scores_gemma":[0.7241482,0.00004862409,0.27448067,0.00065767684,0.00012968626,0.000052821608,0.00017953044,0.000013992577,0.0002888177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992491,0.000024791776,0.00013416767,0.0003159422,0.000110368805,0.00016560136],"domain_scores_gemma":[0.9994611,0.000051714578,0.0000138260375,0.0004296336,0.0000064905144,0.00003719106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023285279,0.00005743692,0.000077384146,0.00009528502,0.000045334127,0.00009693509,0.001124714,0.000018103528,0.000032127402],"category_scores_gemma":[0.000013392516,0.00006135377,0.000017515717,0.0003902123,0.000012613138,0.0008971277,0.00007370512,0.00012429009,0.000018828805],"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.000012240807,0.00008884409,0.00024156575,0.00005351028,0.000008626794,0.000015655321,0.0013476443,0.0013831165,0.000054519423,0.0016380758,0.0013310227,0.9938252],"study_design_scores_gemma":[0.00072268787,0.00004136206,0.0014043596,0.000014532332,0.00000453045,7.0711803e-7,0.0000749781,0.9511207,0.00012727949,0.0009014072,0.045456734,0.00013075018],"about_ca_topic_score_codex":0.00031188276,"about_ca_topic_score_gemma":0.000862679,"teacher_disagreement_score":0.9936944,"about_ca_system_score_codex":0.000014969498,"about_ca_system_score_gemma":0.000023045332,"threshold_uncertainty_score":0.25019342},"labels":[],"label_agreement":null},{"id":"W3015182559","doi":"10.3390/s20072057","title":"A Trajectory Collaboration Based Map Matching Approach for Low-Sampling-Rate GPS Trajectories","year":2020,"lang":"en","type":"article","venue":"Sensors","topic":"Data Management and Algorithms","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Global Positioning System; Map matching; Trajectory; Computer science; Matching (statistics); Sampling (signal processing); Assisted GPS; Computer vision; Mathematics; Statistics; Telecommunications","score_opus":0.03374187162097791,"score_gpt":0.254841267221003,"score_spread":0.22109939560002506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015182559","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.020691263,0.000026003125,0.9751119,0.0024906632,0.0003904563,0.0005064758,0.000055737066,0.0003416515,0.00038586042],"genre_scores_gemma":[0.39208397,0.000003750134,0.60456276,0.0019531196,0.00054572464,0.00007775282,0.0002531449,0.00003666429,0.0004831152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987847,0.000064842025,0.00020600921,0.0004798441,0.00019744677,0.0002671439],"domain_scores_gemma":[0.99933684,0.00010026282,0.00008755738,0.0003029809,0.000074399555,0.00009796513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027112148,0.00016377492,0.00017424792,0.000069736736,0.00016507621,0.00041502825,0.00052141416,0.000045224337,0.000005762921],"category_scores_gemma":[0.00005579409,0.00015984944,0.000067250854,0.00047633288,0.00002614045,0.00053090526,0.00007355058,0.00008729633,0.000020878691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006391993,0.00096807844,0.000499789,0.0041421396,0.0005061196,0.00009732876,0.03916056,0.6450784,0.029625466,0.16633864,0.048892826,0.06405144],"study_design_scores_gemma":[0.0006579617,0.00010311022,0.00014510377,0.000012738144,0.000015615986,3.0808502e-7,0.00064391975,0.9831042,0.0023465103,0.0005080546,0.0121676875,0.00029477917],"about_ca_topic_score_codex":0.000008905033,"about_ca_topic_score_gemma":0.0000041291078,"teacher_disagreement_score":0.3713927,"about_ca_system_score_codex":0.000026476368,"about_ca_system_score_gemma":0.000061853985,"threshold_uncertainty_score":0.6518471},"labels":[],"label_agreement":null},{"id":"W3020899460","doi":"","title":"Watchtower for k-crossing Visibility.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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; University of Manitoba","funders":"","keywords":"Visibility; Computer science; Telecommunications; Environmental science; Physics; Optics","score_opus":0.027419268007542713,"score_gpt":0.26531223596246645,"score_spread":0.23789296795492373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020899460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054391794,0.000036659807,0.91509205,0.006075685,0.0015642162,0.00076190045,0.0001830978,0.00014292693,0.021751687],"genre_scores_gemma":[0.94942176,0.0000010637516,0.044457663,0.0024779693,0.000075125114,0.000016065358,0.00016866777,0.000010628678,0.003371053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985924,0.000019102377,0.00018881951,0.00052551227,0.00027102663,0.0004031909],"domain_scores_gemma":[0.99886113,0.00016435483,0.000058378213,0.00042897917,0.00021584837,0.00027127907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027866376,0.00014619614,0.00015202351,0.00042500402,0.0002262155,0.00094356237,0.000832623,0.000052250558,0.00027358608],"category_scores_gemma":[0.000046753765,0.00015085975,0.00006537633,0.00048022476,0.000048524988,0.0005534359,0.00008584746,0.00010242191,0.0006390088],"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.0000054037932,0.0000311362,0.001375974,0.000030010046,0.000027229562,0.000007869205,0.000111903915,0.0038223653,0.000012824614,0.86408114,0.006170186,0.12432394],"study_design_scores_gemma":[0.00079441146,0.00018815252,0.016767265,0.000052179585,0.0000054412812,0.000004213247,0.000053559925,0.77530813,0.000034839235,0.0851203,0.12117675,0.0004947706],"about_ca_topic_score_codex":0.0009950609,"about_ca_topic_score_gemma":0.0010891622,"teacher_disagreement_score":0.89502996,"about_ca_system_score_codex":0.00013329825,"about_ca_system_score_gemma":0.00072955084,"threshold_uncertainty_score":0.9098793},"labels":[],"label_agreement":null},{"id":"W3021319303","doi":"10.1007/978-3-540-27801-6_4","title":"Optimizing Multiple Spaced Seeds for Homology Search","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":37,"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; University of Waterloo","funders":"","keywords":"Computer science; Homology (biology); Biology; Genetics; Gene","score_opus":0.028448366131551064,"score_gpt":0.2648656440587714,"score_spread":0.23641727792722034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021319303","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.000018530929,0.00021543537,0.99351853,0.001434361,0.001931606,0.00079521077,0.000016297825,0.0002059343,0.0018640948],"genre_scores_gemma":[0.018666534,0.000035586538,0.9787984,0.0010233128,0.00051062,0.000023301318,0.00002870514,0.000040561634,0.0008729948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611616,0.000022458018,0.00041095333,0.0017383277,0.00075104955,0.00096107693],"domain_scores_gemma":[0.9974254,0.0005170991,0.00017163256,0.001499502,0.00021734944,0.00016905382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010307408,0.0005029685,0.0005177753,0.0010395235,0.00034799086,0.0007853629,0.00463104,0.0002743851,0.000017116274],"category_scores_gemma":[0.00007931166,0.00047838403,0.00016205118,0.0005738923,0.00059088867,0.0009098937,0.0025967842,0.0006118441,0.000045960092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011634016,0.0000501881,0.00002427285,0.00010887996,0.00003144713,0.00014270525,0.0009991111,0.12858719,0.00016045012,0.1082997,0.00006338965,0.76152104],"study_design_scores_gemma":[0.0008689186,0.0003008553,0.000031936805,0.00024270499,0.000011002525,0.00003182566,3.6272246e-7,0.86890984,0.0014919675,0.123926364,0.0033963926,0.0007878574],"about_ca_topic_score_codex":0.000037474376,"about_ca_topic_score_gemma":0.000059756898,"teacher_disagreement_score":0.7607332,"about_ca_system_score_codex":0.00033092604,"about_ca_system_score_gemma":0.00048767228,"threshold_uncertainty_score":0.99976677},"labels":[],"label_agreement":null},{"id":"W3021556530","doi":"10.3390/ijgi9050315","title":"Disdyakis Triacontahedron DGGS","year":2020,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Computer science; Grid; Rendering (computer graphics); Modular design; Projection (relational algebra); Atlas (anatomy); Visualization; Polyhedron; Computer graphics (images); Algorithm; Theoretical computer science; Data mining; Mathematics; Geometry","score_opus":0.009389327279779803,"score_gpt":0.23364112496632264,"score_spread":0.22425179768654283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021556530","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.0021605303,0.00002579429,0.96911716,0.021946501,0.0022480555,0.00008361302,0.00002032698,0.000043077842,0.004354966],"genre_scores_gemma":[0.9444142,0.00015279604,0.042702902,0.011365264,0.0011469101,0.0000037226987,0.000098165954,0.000006713265,0.0001093321],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984196,0.000022784889,0.00060397346,0.00006630926,0.00076829153,0.00011903581],"domain_scores_gemma":[0.99871415,0.000032563,0.0005858426,0.00012205863,0.00044067707,0.0001047381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032858932,0.000093793795,0.0001281573,0.0002253829,0.00004478464,0.0006311751,0.0015794067,0.00003065609,0.000068703586],"category_scores_gemma":[0.00016430928,0.00008070586,0.00011073089,0.00017787468,0.000014315844,0.013194413,0.00025087982,0.00014505904,0.00028679354],"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.00017006372,0.000052150543,0.00045252495,0.000021120071,0.00024488708,0.00004776444,0.0029868083,0.0009675379,0.00010491305,0.06914585,0.067168266,0.8586381],"study_design_scores_gemma":[0.0027933086,0.0003217539,0.003383609,0.000055456167,0.000024284642,0.0000854406,0.00035199185,0.115681276,0.00089620514,0.0022246304,0.8739193,0.00026272563],"about_ca_topic_score_codex":0.000009110623,"about_ca_topic_score_gemma":4.491617e-7,"teacher_disagreement_score":0.94225365,"about_ca_system_score_codex":0.00006190774,"about_ca_system_score_gemma":0.000054252545,"threshold_uncertainty_score":0.95656306},"labels":[],"label_agreement":null},{"id":"W3022249602","doi":"","title":"BR 2 : A Travel Behavioral Approach to Personalized Route Recommendation Based on GPS Trajectories.","year":2020,"lang":"en","type":"article","venue":"EDBT/ICDT Workshops","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Global Positioning System; Computer science; Transport engineering; Simulation; Engineering; Telecommunications","score_opus":0.05535183574913088,"score_gpt":0.27549356419122584,"score_spread":0.22014172844209495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022249602","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.0012024527,0.000015982938,0.96860915,0.016813206,0.0007218596,0.000596166,0.000052498668,0.0003674619,0.011621245],"genre_scores_gemma":[0.6155179,0.000010049122,0.36540684,0.013919757,0.0013746828,0.00021402257,0.0009640914,0.00008023293,0.0025124038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977379,0.00010528252,0.000306068,0.00088407076,0.00047975275,0.0004869393],"domain_scores_gemma":[0.99889576,0.00006259787,0.000094592484,0.0005631215,0.000052885865,0.00033103643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033402132,0.00030175023,0.00029560365,0.000117990174,0.00023983001,0.00052720495,0.0012219492,0.00008724862,0.00015676815],"category_scores_gemma":[0.00004329272,0.00029629917,0.00013418285,0.0012090245,0.000034601497,0.0007336882,0.00026691207,0.0002968031,0.00017468673],"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.00023947422,0.0009854145,0.00049311324,0.00006251317,0.00006642847,0.000047857033,0.008156281,0.0012906947,0.00034002628,0.019002154,0.099181704,0.87013435],"study_design_scores_gemma":[0.0028380195,0.0006840346,0.004871366,0.00007236851,0.000075090866,0.000005248285,0.0011206907,0.73931634,0.00052344985,0.00015020522,0.249025,0.0013181908],"about_ca_topic_score_codex":0.000028603543,"about_ca_topic_score_gemma":0.00000496857,"teacher_disagreement_score":0.86881614,"about_ca_system_score_codex":0.00008682387,"about_ca_system_score_gemma":0.000051627147,"threshold_uncertainty_score":0.9999489},"labels":[],"label_agreement":null},{"id":"W3027467598","doi":"10.3390/ijgi9050335","title":"Modelling Offset Regions around Static and Mobile Locations on a Discrete Global Grid System: An IoT Case Study","year":2020,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Cisco Systems","keywords":"Computer science; Offset (computer science); Grid; Internet of Things; Mobile device; UTC offset; Real-time computing; Digital Earth; Distributed computing; Data mining; Global Positioning System; Remote sensing; Telecommunications; Geography; Embedded system; Geodesy","score_opus":0.02485233786019062,"score_gpt":0.2892804052185582,"score_spread":0.26442806735836755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027467598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15261611,0.000012586762,0.8446735,0.0013895648,0.0007172809,0.0002629039,0.000102311315,0.00004148438,0.00018423048],"genre_scores_gemma":[0.98887163,0.000014401472,0.010293855,0.00052568305,0.00022122444,0.000010217745,0.000055718792,0.0000031487828,0.0000040884684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839026,0.00006188025,0.0006219414,0.00012203405,0.00067995844,0.0001239384],"domain_scores_gemma":[0.99868685,0.000040393217,0.00050688523,0.00019129342,0.0004201493,0.00015443489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003601187,0.0001254702,0.00014627205,0.0001948348,0.00015473366,0.0008675366,0.0007108208,0.000025232932,0.0000027055958],"category_scores_gemma":[0.000032296135,0.00010973887,0.000048536058,0.00021364348,0.00002284168,0.0061052837,0.00016860086,0.00014025583,0.000025829118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017550171,0.00037922477,0.0007844981,0.00010335999,0.0004678098,0.0011670706,0.020635918,0.8264528,0.000002130345,0.06069414,0.0037434807,0.08539406],"study_design_scores_gemma":[0.0008132471,0.00058383885,0.00008664615,0.000055530825,0.00003267911,0.00097190915,0.011970198,0.98212415,0.0000026881078,0.00031626914,0.0029245534,0.00011829913],"about_ca_topic_score_codex":0.00016993596,"about_ca_topic_score_gemma":0.000008415617,"teacher_disagreement_score":0.83625555,"about_ca_system_score_codex":0.0001425193,"about_ca_system_score_gemma":0.000065034765,"threshold_uncertainty_score":0.8365675},"labels":[],"label_agreement":null},{"id":"W3032597430","doi":"10.4018/ijdwm.2020070106","title":"Conceptual Model and Design of Semantic Trajectory Data Warehouse","year":2020,"lang":"en","type":"article","venue":"International Journal of Data Warehousing and Mining","topic":"Data Management and Algorithms","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; Data warehouse; Trajectory; Data mining; Geospatial analysis; Context (archaeology); Ontology; Inference; Object (grammar); Semantic data model; Information retrieval; Data modeling; Data science; Database; Artificial intelligence","score_opus":0.22540462770170883,"score_gpt":0.32539442731228885,"score_spread":0.09998979961058002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032597430","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.020168133,0.000683671,0.97746456,0.0012167981,0.00021658595,0.000040189654,0.00016730314,0.000018995046,0.00002376861],"genre_scores_gemma":[0.64635235,0.00031970176,0.35276544,0.00033441925,0.00016168132,1.2426197e-7,0.00005143497,0.000007860447,0.0000070011306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988208,0.000044588123,0.00036077143,0.00028511492,0.0003858115,0.0001029576],"domain_scores_gemma":[0.9989505,0.00013837518,0.0003056954,0.00040391993,0.00011437532,0.000087142354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000569351,0.00009464021,0.00018045232,0.00010680837,0.000042238695,0.00019887874,0.002674123,0.000022282342,0.0000025449026],"category_scores_gemma":[0.00018681667,0.000084805535,0.000013948088,0.00007775175,0.00008786968,0.0029467742,0.0022419237,0.00010800197,4.879834e-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.00022897215,0.00021108071,0.0014985688,0.00009684428,0.0009906418,0.00065160025,0.016339704,0.031129457,0.003624629,0.0029143996,0.02925013,0.91306394],"study_design_scores_gemma":[0.00061461114,0.00008912764,0.00008842414,0.000119872864,0.000037298625,0.000081169936,0.00047366595,0.99668765,0.00006832804,0.00008395451,0.0015533143,0.00010257036],"about_ca_topic_score_codex":0.0000072556954,"about_ca_topic_score_gemma":0.0000011928955,"teacher_disagreement_score":0.96555823,"about_ca_system_score_codex":0.0000074523637,"about_ca_system_score_gemma":0.00008837933,"threshold_uncertainty_score":0.49692303},"labels":[],"label_agreement":null},{"id":"W3033337213","doi":"10.1145/3401071.3401657","title":"Research challenges in deep reinforcement learning-based join query optimization","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Query optimization; Computer science; Sargable; Join (topology); Reinforcement learning; Query plan; Query expansion; Web query classification; Web search query; Set (abstract data type); Theoretical computer science; Data mining; Information retrieval; Artificial intelligence; Search engine; Programming language; Mathematics","score_opus":0.12405690345947706,"score_gpt":0.3115986065888434,"score_spread":0.18754170312936636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033337213","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.00003587942,0.00013343872,0.9572331,0.019462021,0.000042229276,0.00016151578,5.513813e-8,0.00014036022,0.022791415],"genre_scores_gemma":[0.8243152,0.0010273062,0.17058848,0.0021145882,0.00016333941,0.000071534734,0.00005372316,0.000021502363,0.0016443153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869114,0.00013482783,0.00016177855,0.00034076572,0.00041087903,0.00026059183],"domain_scores_gemma":[0.99951446,0.000065009124,0.000027997196,0.00026209734,0.000054744443,0.000075717835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603198,0.000073456016,0.0000848984,0.0001875988,0.00007018873,0.000171103,0.00065489905,0.000028507318,0.00011674425],"category_scores_gemma":[0.00008307735,0.000068129615,0.00001932482,0.00060668745,0.000019953875,0.0005774079,0.0004277679,0.00019431778,0.00012548052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043325745,0.000020953394,0.000038506176,0.000023205715,0.0000029093926,0.000013710905,0.0004294941,0.9551786,0.0000033711424,0.019820578,0.0007231954,0.023741096],"study_design_scores_gemma":[0.00028784902,0.00013711285,0.000086215114,0.000009862727,5.509426e-7,9.132816e-8,0.00030309532,0.9914608,0.00011291182,0.00007488273,0.0074407114,0.00008591401],"about_ca_topic_score_codex":0.00002452012,"about_ca_topic_score_gemma":0.000021343682,"teacher_disagreement_score":0.8242793,"about_ca_system_score_codex":0.00003168716,"about_ca_system_score_gemma":0.000029665773,"threshold_uncertainty_score":0.2778245},"labels":[],"label_agreement":null},{"id":"W3034188862","doi":"10.1007/s10707-020-00408-9","title":"SWS: an unsupervised trajectory segmentation algorithm based on change detection with interpolation kernels","year":2020,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":30,"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; Dalhousie University","funders":"","keywords":"Trajectory; Segmentation; Computer science; Interpolation (computer graphics); Artificial intelligence; Sliding window protocol; Window (computing); Algorithm; Kernel (algebra); Pattern recognition (psychology); Computer vision; Mathematics; Motion (physics)","score_opus":0.03146745409551396,"score_gpt":0.2314241320843101,"score_spread":0.19995667798879613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034188862","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.0023572694,0.0000042637434,0.99503446,0.00056000234,0.00013746216,0.0004849358,0.000012560471,0.00033165165,0.0010774004],"genre_scores_gemma":[0.603698,0.0000064078436,0.38577256,0.009565277,0.0003884683,0.00016827225,0.00034798947,0.000024998573,0.000027986222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989048,0.000042985797,0.00023386508,0.00022879012,0.00037540717,0.00021412753],"domain_scores_gemma":[0.99934924,0.000024829907,0.00010743749,0.00034091435,0.00004344795,0.0001341074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016979639,0.00015815232,0.00012775561,0.0001410137,0.00011679575,0.00029999984,0.00042984297,0.000035390476,0.000036938676],"category_scores_gemma":[0.000007820251,0.00013268474,0.000034082917,0.00045186418,0.000019015784,0.0038621968,0.000067080255,0.000104187435,0.00016827638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029535771,0.00006065229,0.000036674533,0.000055004683,0.000016856566,0.000005141874,0.0045261024,0.00037064686,0.0001069846,0.00029120574,0.00014976323,0.99435145],"study_design_scores_gemma":[0.00070672395,0.00084077945,0.001054546,0.00002920982,0.000011322418,0.0000014246494,0.00036975427,0.99489266,0.00080373185,0.00002477291,0.0010780471,0.0001870604],"about_ca_topic_score_codex":0.00001954059,"about_ca_topic_score_gemma":0.000004913607,"teacher_disagreement_score":0.994522,"about_ca_system_score_codex":0.00003423475,"about_ca_system_score_gemma":0.000019475665,"threshold_uncertainty_score":0.54107267},"labels":[],"label_agreement":null},{"id":"W3035899174","doi":"10.22215/etd/2015-10682","title":"Biased Nearest Neighbour Search","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Nearest neighbour; Nearest neighbor search; Point (geometry); Set (abstract data type); k-nearest neighbors algorithm; Computer science; Data mining; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04134118352643582,"score_gpt":0.3122846023598404,"score_spread":0.27094341883340456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035899174","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.0046228194,0.0002712641,0.06987932,0.0007717757,0.0041851504,0.0005704955,0.000031218573,0.0008222331,0.9188457],"genre_scores_gemma":[0.02121217,0.00009506421,0.060430944,0.00068011996,0.00073661,0.00004674859,0.0068218894,0.00006899983,0.90990746],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985071,0.000032445143,0.0001634784,0.00045082407,0.0005752873,0.0002708647],"domain_scores_gemma":[0.9989047,0.000022560642,0.000054266235,0.0007435885,0.00015273504,0.00012215572],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030529097,0.00017486974,0.00016356194,0.00020639026,0.00006912767,0.0007008167,0.0017196137,0.00009862432,0.00019191232],"category_scores_gemma":[0.00002277286,0.00015183282,0.00005454867,0.00039617642,0.000008599155,0.00064793,0.00021251763,0.00018483057,0.0013841203],"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.000012233258,0.00011043283,0.00005314339,0.00012358457,0.000065649,0.000102550744,0.0007001304,0.000017482911,0.00005300222,0.09548884,0.38512453,0.5181484],"study_design_scores_gemma":[0.0022195163,0.00046753517,0.010748592,0.00028466998,0.000084586354,0.0000073806636,0.002193199,0.26106834,0.0022370738,0.021283992,0.6965518,0.0028533242],"about_ca_topic_score_codex":0.00022753025,"about_ca_topic_score_gemma":0.00016541667,"teacher_disagreement_score":0.5152951,"about_ca_system_score_codex":0.0000296922,"about_ca_system_score_gemma":0.00016548934,"threshold_uncertainty_score":0.9993934},"labels":[],"label_agreement":null},{"id":"W3037488610","doi":"10.4230/lipics.swat.2020.22","title":"Clustering Moving Entities in Euclidean Space","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","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":"Cluster analysis; k-medians clustering; Correlation clustering; Disjoint sets; CURE data clustering algorithm; Combinatorics; Canopy clustering algorithm; Mathematics; Single-linkage clustering; Center (category theory); Algorithm; Sequence (biology); Data stream clustering; Euclidean space; Computer science; Statistics","score_opus":0.022118242785892406,"score_gpt":0.23660286487675364,"score_spread":0.21448462209086122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037488610","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.032552347,0.0000484992,0.9490835,0.0034331786,0.0010482213,0.0009872139,0.0001598265,0.0004664958,0.01222072],"genre_scores_gemma":[0.78788036,0.000095393414,0.2032972,0.0067200204,0.00044154262,0.00011694946,0.0003910314,0.00007278803,0.0009847305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977014,0.000026771135,0.0008189608,0.00032610862,0.0004257358,0.0007010123],"domain_scores_gemma":[0.99879867,0.000071422524,0.00025661633,0.0006042504,0.00007182533,0.00019721124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004334017,0.00031435126,0.00035890812,0.0002584931,0.00018280739,0.000995923,0.0017638346,0.00009008882,0.000024767021],"category_scores_gemma":[0.000090037116,0.00031187094,0.0001442125,0.000505436,0.000054495915,0.0042580185,0.0016038533,0.00030962174,0.0001964386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038022723,0.001210496,0.06138501,0.00938742,0.0008442262,0.00028641868,0.20852068,0.009577203,0.0004947599,0.27032286,0.08931549,0.34827518],"study_design_scores_gemma":[0.0021193014,0.00016196111,0.0009544196,0.00015596415,0.000013455659,0.000009804066,0.0022981307,0.87884104,0.00030395584,0.0005274585,0.114025205,0.0005892888],"about_ca_topic_score_codex":0.000026334434,"about_ca_topic_score_gemma":0.000032261913,"teacher_disagreement_score":0.8692638,"about_ca_system_score_codex":0.0000759631,"about_ca_system_score_gemma":0.000033930144,"threshold_uncertainty_score":0.99993336},"labels":[],"label_agreement":null},{"id":"W3037925904","doi":"10.20382/jocg.v8i1a14","title":"Central Trajectories","year":2015,"lang":"en","type":"preprint","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Danmarks Grundforskningsfond; National Research Foundation","keywords":"Trajectory; Centrality; Combinatorics; RADIUS; Cluster (spacecraft); Cluster analysis; Set (abstract data type); Physics; Mathematics; Computer science","score_opus":0.021899771686030044,"score_gpt":0.22805388347335698,"score_spread":0.20615411178732693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037925904","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.024308687,0.00026809162,0.9661035,0.0009494898,0.0033889764,0.000121854566,0.000054568012,0.00006757434,0.0047372663],"genre_scores_gemma":[0.6644813,0.00024406803,0.32791117,0.00035360118,0.0018755647,2.822842e-7,0.0001943926,0.00003948395,0.0049001435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978499,0.00012285744,0.000419215,0.00031977092,0.0009987715,0.0002895032],"domain_scores_gemma":[0.99745786,0.00012785922,0.00083353603,0.00032582186,0.00097410585,0.00028083564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004548576,0.00024678468,0.00043594014,0.0016446828,0.000090018126,0.0003575865,0.002450177,0.00014337737,0.00002618337],"category_scores_gemma":[0.000059693728,0.00025938128,0.00029497282,0.0010879376,0.00007102116,0.0012695623,0.0015507187,0.0006428237,0.0000101270825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104748266,0.00037820445,0.0018033497,0.00016917581,0.00096279127,0.001889933,0.00076958275,0.7898395,0.000005076491,0.12001824,0.054666314,0.029393107],"study_design_scores_gemma":[0.0057203984,0.0009825489,0.027544951,0.0006255062,0.0005762839,0.00038873527,0.0010408071,0.21207917,0.00008022236,0.20315048,0.54559755,0.0022133482],"about_ca_topic_score_codex":0.000015270569,"about_ca_topic_score_gemma":0.0000015390444,"teacher_disagreement_score":0.6401726,"about_ca_system_score_codex":0.00037051775,"about_ca_system_score_gemma":0.0008727638,"threshold_uncertainty_score":0.9999858},"labels":[],"label_agreement":null},{"id":"W3039098376","doi":"10.1177/0361198120931843","title":"Process for the Encapsulation and Visualization of Dominant Demand and Supply Corridors","year":2020,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Visualization; Cluster analysis; Process (computing); Public transport; Supply and demand; Smoothing; Quality (philosophy); Relevance (law); Operations research; Transport engineering; Data science; Data mining; Engineering; Machine learning","score_opus":0.09678668199962037,"score_gpt":0.39080848396784457,"score_spread":0.2940218019682242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039098376","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.70891434,0.00043118623,0.27822632,0.010862261,0.00017477885,0.0013209932,0.000043239783,0.000012788746,0.0000141183855],"genre_scores_gemma":[0.9959796,0.0014292849,0.002318702,0.00006463643,0.00008333037,0.000045380093,0.000012580087,0.00001579009,0.0000507133],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9965734,0.00035154208,0.00076653226,0.00030411678,0.0016583023,0.00034611594],"domain_scores_gemma":[0.99656236,0.0009132602,0.0003678745,0.00023947607,0.0017330977,0.00018394609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031656588,0.0001315229,0.00025159458,0.00031698443,0.00045751315,0.00016895156,0.00094754185,0.0000635046,0.0000149167],"category_scores_gemma":[0.00021554156,0.00008307973,0.00010299297,0.001305911,0.00037999704,0.0010970044,0.000015520563,0.00043830118,7.3719355e-7],"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.004848988,0.0005688078,0.60141176,0.004332436,0.00070549885,0.000075263946,0.054595172,0.009496521,0.018937541,0.1272095,0.01062348,0.16719504],"study_design_scores_gemma":[0.0023916746,0.0010924087,0.9099316,0.00024862145,0.000080811325,5.9400105e-7,0.0023968676,0.06621255,0.0054813456,0.0075566606,0.0044271797,0.00017970153],"about_ca_topic_score_codex":0.0004817722,"about_ca_topic_score_gemma":0.0010793693,"teacher_disagreement_score":0.30851984,"about_ca_system_score_codex":0.000022576603,"about_ca_system_score_gemma":0.00017393928,"threshold_uncertainty_score":0.35188675},"labels":[],"label_agreement":null},{"id":"W3041888157","doi":"10.1145/376284.375685","title":"Independence is good","year":2001,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":54,"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; Curse of dimensionality; Data mining; Histogram; Independence (probability theory); Exploit; Set (abstract data type); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Image (mathematics)","score_opus":0.025710358788209507,"score_gpt":0.2582570222251933,"score_spread":0.2325466634369838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041888157","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.03927759,0.00016254377,0.8789832,0.010415839,0.0023321165,0.00032401516,0.0000072588637,0.00066958455,0.067827865],"genre_scores_gemma":[0.62724566,0.0006942636,0.31278157,0.0068317824,0.00073053327,0.000051287152,0.000019547682,0.00003992358,0.051605456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987487,0.000023901017,0.00015765418,0.00044346822,0.00031971987,0.00030652428],"domain_scores_gemma":[0.9983273,0.000055938814,0.000061648105,0.0014374733,0.000037987204,0.00007962962],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021748793,0.00012336575,0.0001141766,0.000094478666,0.0000953697,0.00023716458,0.0027731638,0.000052364547,0.00022432729],"category_scores_gemma":[0.000056029974,0.0001131271,0.000050727875,0.00046785458,0.00002013618,0.0012258075,0.001236009,0.0001371754,0.0008396296],"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.0000026468872,0.000050084345,0.010000815,0.000004564468,0.000017295928,0.00007731074,0.000120125216,0.0000012242851,0.00006624984,0.010032169,0.025879033,0.95374846],"study_design_scores_gemma":[0.00068221305,0.00021323768,0.012356679,0.000032198648,0.00001441915,0.000045168086,0.000044688906,0.025244653,0.00080432184,0.06978617,0.8901344,0.00064184924],"about_ca_topic_score_codex":0.00008185939,"about_ca_topic_score_gemma":0.000019825247,"teacher_disagreement_score":0.95310664,"about_ca_system_score_codex":0.000018016617,"about_ca_system_score_gemma":0.000020892872,"threshold_uncertainty_score":0.9999383},"labels":[],"label_agreement":null},{"id":"W3046659318","doi":"10.20382/jocg.v10i1a17","title":"Interesting paths in the mapper complex","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","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":"National Science Foundation","keywords":"Mathematics; Combinatorics; Path (computing); Graph; Enhanced Data Rates for GSM Evolution; Data point; Binary number; Function (biology); Variable (mathematics); Algorithm; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.028764422130967734,"score_gpt":0.24245818655587084,"score_spread":0.21369376442490312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046659318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13337304,0.000019653187,0.852122,0.002295775,0.00040470855,0.00007574246,0.0000036896272,0.000019468303,0.011685925],"genre_scores_gemma":[0.9494106,0.0000044807907,0.049521793,0.0006269725,0.00020675425,3.8177962e-8,0.0000039231154,0.0000031744894,0.00022226587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989367,0.00011673299,0.00023085385,0.00013282985,0.0004280743,0.00015482391],"domain_scores_gemma":[0.99906564,0.0002242486,0.0002402546,0.00015706128,0.0002652135,0.00004761369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617158,0.00008557421,0.00012983166,0.0008958704,0.00011743042,0.00015843862,0.0014944095,0.00002381376,0.000037276135],"category_scores_gemma":[0.000043481377,0.00006875353,0.000075817195,0.001581042,0.000080537946,0.000966931,0.00027713287,0.00017518083,0.000024657224],"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.00016948569,0.00090099615,0.023278708,0.00006789471,0.00035422627,0.0030933295,0.0054186177,0.027760047,0.00023550907,0.6305414,0.05686243,0.2513174],"study_design_scores_gemma":[0.0038609179,0.0012168805,0.28328666,0.00021184132,0.000058423437,0.00054767635,0.003561405,0.25081453,0.000049311144,0.030887727,0.4248625,0.000642158],"about_ca_topic_score_codex":0.000008197043,"about_ca_topic_score_gemma":0.000004472869,"teacher_disagreement_score":0.81603754,"about_ca_system_score_codex":0.000059706344,"about_ca_system_score_gemma":0.00005870712,"threshold_uncertainty_score":0.28036878},"labels":[],"label_agreement":null},{"id":"W3046886793","doi":"","title":"Materialized views for count aggregates of spatial data","year":2012,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Science North","funders":"","keywords":"Aggregate (composite); Online analytical processing; Computer science; Materialized view; Quadtree; Space (punctuation); Spatial analysis; Index (typography); Data mining; Spatial database; Data warehouse; Database; Theoretical computer science; Algorithm; Mathematics; World Wide Web; Statistics","score_opus":0.05278441042897332,"score_gpt":0.3073932149966844,"score_spread":0.2546088045677111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046886793","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.0030889343,0.00026595689,0.9929858,0.00045107616,0.002756432,0.00035092857,0.000033328088,0.000054702887,0.000012835465],"genre_scores_gemma":[0.42717147,0.000010568557,0.57218796,0.00030382528,0.00028873162,0.000008618381,0.000023021177,0.000004749338,0.0000010784805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980824,0.00004157706,0.0003210214,0.0006029645,0.00041563655,0.00053637964],"domain_scores_gemma":[0.9978585,0.00019744731,0.00016552169,0.0016145133,0.0000794147,0.00008458565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017793622,0.00015952416,0.0002449696,0.00021011061,0.000108039065,0.00032154657,0.0045746868,0.000039097944,0.000008097094],"category_scores_gemma":[0.00014229953,0.00012873604,0.000031696734,0.00075145316,0.00021551203,0.0023318906,0.0024453981,0.00006664711,0.0000085765305],"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.000009131228,0.00010674553,0.0012475731,0.000051575527,0.000006609999,0.0000015916696,0.0004951378,0.00050957897,0.0021876495,0.0019673181,0.000115775074,0.99330133],"study_design_scores_gemma":[0.00054682017,0.00009119451,0.0018935432,0.00005977329,0.000006668478,0.000006456355,4.393611e-7,0.95664155,0.028882362,0.004778715,0.0068273717,0.00026509605],"about_ca_topic_score_codex":0.00009176397,"about_ca_topic_score_gemma":0.000031319407,"teacher_disagreement_score":0.9930362,"about_ca_system_score_codex":0.000032868593,"about_ca_system_score_gemma":0.000074609474,"threshold_uncertainty_score":0.8500982},"labels":[],"label_agreement":null},{"id":"W3047749157","doi":"10.1007/978-3-030-57602-8_12","title":"The Spherical k-means++ Algorithm via Local Search","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Unit sphere; Partition (number theory); Combinatorics; Generalization; Cluster analysis; Integer (computer science); Set (abstract data type); Algorithm; Mathematics; Point (geometry); Approximation algorithm; k-means clustering; Computer science; Discrete mathematics; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.016940786532604123,"score_gpt":0.2413999742474191,"score_spread":0.224459187714815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047749157","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":[2.8755372e-7,0.00039751604,0.9884254,0.0047687334,0.0019822852,0.00039159023,0.0000069234056,0.00021841745,0.0038088677],"genre_scores_gemma":[0.0020561735,0.00012264175,0.99228907,0.0032016411,0.0011494145,0.000010778662,0.000014012718,0.000049093214,0.0011072031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949059,0.000059253845,0.0005109311,0.0018094874,0.001793954,0.0009204737],"domain_scores_gemma":[0.9970305,0.0005364054,0.00015631998,0.0018065815,0.00017535868,0.00029485303],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011133846,0.00055325456,0.00045597777,0.00023827009,0.0006194929,0.0016500897,0.008231927,0.00020753709,0.00002330248],"category_scores_gemma":[0.000040533636,0.00040178237,0.00016313794,0.0009704512,0.001547341,0.00078715425,0.004879107,0.0012527879,0.00032679923],"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.000002359076,0.000012382896,0.0000018679273,0.000010567587,0.0000131188035,0.00017395412,0.0001262157,0.005196066,0.0000059397667,0.014301861,0.00017980662,0.9799759],"study_design_scores_gemma":[0.00015933721,0.00015493223,0.000013962532,0.000059224756,0.0000059300987,0.00003162117,3.2008535e-7,0.9004834,0.0001605897,0.06827547,0.030179923,0.000475284],"about_ca_topic_score_codex":0.00003026832,"about_ca_topic_score_gemma":0.000031508844,"teacher_disagreement_score":0.9795006,"about_ca_system_score_codex":0.00023882472,"about_ca_system_score_gemma":0.0003714278,"threshold_uncertainty_score":0.9998434},"labels":[],"label_agreement":null},{"id":"W3048110077","doi":"10.1109/mdm48529.2020.00027","title":"Trade-off Aware Sequenced Routing Queries (or OSR Queries when POIs are not Free)","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Pruning; Skyline; Overhead (engineering); Point of interest; Constraint (computer-aided design); Routing (electronic design automation); Query optimization; Data mining; Sequence (biology); Computer network; Artificial intelligence; Mathematics","score_opus":0.04575828859600797,"score_gpt":0.24511440296721812,"score_spread":0.19935611437121015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048110077","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.003361305,0.00009117941,0.84517455,0.13959396,0.00061917654,0.00045527835,0.000112909875,0.001877091,0.00871458],"genre_scores_gemma":[0.73563576,0.00008668454,0.22673047,0.027578946,0.00072091335,0.000054539618,0.0000776045,0.000057230696,0.009057851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981017,0.0000590217,0.00032503143,0.0006590132,0.0004216008,0.00043360313],"domain_scores_gemma":[0.99878603,0.000076199045,0.00013544636,0.00078873854,0.000035983154,0.00017761886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018004604,0.0002530922,0.00028115863,0.000060040078,0.00024378915,0.0007750351,0.0021358307,0.00005876229,0.0002515301],"category_scores_gemma":[0.00016529043,0.0001988094,0.00008437378,0.0004100238,0.00008802711,0.0023599553,0.0013136002,0.000164902,0.0001037029],"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.00012596615,0.00017251405,0.0045460444,0.0004131657,0.00027312987,0.001033539,0.027227066,0.00013226077,0.0012018536,0.3797629,0.30550292,0.27960864],"study_design_scores_gemma":[0.0033510022,0.00097067276,0.01133505,0.00032106854,0.00009788488,0.000047586567,0.016663434,0.37627086,0.0256138,0.008939295,0.55297524,0.0034141494],"about_ca_topic_score_codex":0.0001937707,"about_ca_topic_score_gemma":0.00017886791,"teacher_disagreement_score":0.7322745,"about_ca_system_score_codex":0.000031607087,"about_ca_system_score_gemma":0.00006395321,"threshold_uncertainty_score":0.8107212},"labels":[],"label_agreement":null},{"id":"W30607122","doi":"10.3747/co.25.4117","title":"Personalized Keyword Search with Partial-Order Preferences.","year":2002,"lang":"en","type":"article","venue":"Brazilian Symposium on Databases","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":15,"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; Order (exchange); Information retrieval; Keyword search","score_opus":0.045043638085699285,"score_gpt":0.2636945420906061,"score_spread":0.21865090400490683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30607122","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.05679112,0.0013522985,0.63833153,0.030543396,0.0022302326,0.0034701452,0.0018425123,0.003405302,0.2620335],"genre_scores_gemma":[0.588627,0.0027561018,0.28698906,0.011151906,0.0015923885,0.0005464003,0.0022444346,0.00024426653,0.105848454],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974428,0.00011643421,0.00022929143,0.0008855214,0.0007552226,0.00057071866],"domain_scores_gemma":[0.9980486,0.00011194269,0.00007286449,0.0014828384,0.000079101046,0.00020467363],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023137346,0.00028917537,0.00023534677,0.0001894344,0.00024444296,0.00045059164,0.0014983689,0.00003158314,0.0008889569],"category_scores_gemma":[0.000019966748,0.00022351666,0.000051342267,0.00079275435,0.00016717333,0.0016913163,0.00053188176,0.00018811927,0.0011554179],"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.00025775027,0.0028527176,0.011166763,0.00031148133,0.00043205524,0.0008122381,0.0030149228,0.00049305655,0.0010816312,0.34612274,0.3695507,0.26390398],"study_design_scores_gemma":[0.0024697084,0.00071164756,0.0012565755,0.00023716084,0.000050458533,0.0000366957,0.0002013507,0.068873875,0.0041318517,0.00006698687,0.92083794,0.0011257668],"about_ca_topic_score_codex":0.00008809048,"about_ca_topic_score_gemma":0.00003560681,"teacher_disagreement_score":0.55128723,"about_ca_system_score_codex":0.000028459996,"about_ca_system_score_gemma":0.000034702243,"threshold_uncertainty_score":0.9996223},"labels":[],"label_agreement":null},{"id":"W3061738491","doi":"10.1007/978-3-030-57811-4_7","title":"Strategies for Alternate Group Trip Planning Queries in Location-Based Services","year":2020,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Sequence (biology); Computer science; Set (abstract data type); Group (periodic table); Point of interest; Permutation (music); Information retrieval; Artificial intelligence","score_opus":0.02530748379290816,"score_gpt":0.2798398126520164,"score_spread":0.25453232885910826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3061738491","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.000053724976,0.020846808,0.96014434,0.00007082489,0.0011725599,0.000691105,0.000012317237,0.00010653376,0.016901774],"genre_scores_gemma":[0.9375929,0.0028099946,0.050439842,0.0008535061,0.0014773078,0.00021041153,0.0004379945,0.000160529,0.006017514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806124,0.000027037782,0.00070122024,0.00070171955,0.00022917283,0.00027963944],"domain_scores_gemma":[0.9989328,0.0002532771,0.00041054413,0.00029272767,0.000057670874,0.00005299841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003672499,0.00033633952,0.00048026477,0.0002775911,0.00009697726,0.0006080781,0.00078752293,0.00009228699,0.0000010515715],"category_scores_gemma":[0.000006404419,0.00033234205,0.00005235029,0.0001231301,0.000042962773,0.00092673337,0.00027167544,0.00021247176,0.000004535539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001492155,0.000012052313,0.00027496475,0.0020351345,0.000021138523,0.000037642127,0.0006336274,0.07811365,9.251326e-7,0.8679727,0.000017871174,0.0508654],"study_design_scores_gemma":[0.00029710284,0.000114931034,0.000015149608,0.0037808213,0.0000081460785,0.0000030982087,0.0009589686,0.8809402,0.0000066165385,0.025435397,0.087999664,0.0004399289],"about_ca_topic_score_codex":0.00012780217,"about_ca_topic_score_gemma":0.00010220443,"teacher_disagreement_score":0.93753916,"about_ca_system_score_codex":0.000057984984,"about_ca_system_score_gemma":0.000040855848,"threshold_uncertainty_score":0.99991286},"labels":[],"label_agreement":null},{"id":"W3081095766","doi":"10.48550/arxiv.2008.11705","title":"Towards A Personal Shopper's Dilemma: Time vs Cost","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Skyline; Order (exchange); Profit (economics); Set (abstract data type); Heuristic; Baseline (sea); Dilemma; Measure (data warehouse); Operations research; Data mining; Business; Microeconomics; Mathematics; Economics; Artificial intelligence","score_opus":0.07958839085075976,"score_gpt":0.18880816698924355,"score_spread":0.10921977613848378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081095766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015003898,0.00003705953,0.96213585,0.002640944,0.0010275155,0.00065590494,0.0002147985,0.0008112852,0.017472751],"genre_scores_gemma":[0.9862444,0.00010754684,0.004293865,0.0007722797,0.00032006437,0.0000025848217,0.0002323463,0.000031490097,0.007995428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975559,0.00009734539,0.00017932474,0.0015256888,0.00019060014,0.00045109994],"domain_scores_gemma":[0.99833167,0.000039400304,0.00017003276,0.0010687924,0.00010069758,0.00028941417],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001997319,0.00039726097,0.00040004542,0.00021859865,0.00016417129,0.00045729728,0.0035186182,0.000190727,0.0002449069],"category_scores_gemma":[0.000028575578,0.00045751425,0.00028085368,0.00065713085,0.00010794769,0.0008422666,0.007195745,0.00060347986,0.0014430397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023472194,0.00068544195,0.0023256207,0.0005796554,0.0013340923,0.009325818,0.001740245,0.02101976,0.000076214565,0.7948928,0.11539967,0.05238595],"study_design_scores_gemma":[0.00053619413,0.00007160804,0.00082487543,0.0000611743,0.000091166316,0.0000038824646,0.000031366668,0.9515364,0.000017866258,0.009131841,0.03702647,0.0006671626],"about_ca_topic_score_codex":0.000107001346,"about_ca_topic_score_gemma":0.000007443527,"teacher_disagreement_score":0.9712405,"about_ca_system_score_codex":0.00017767742,"about_ca_system_score_gemma":0.00020264271,"threshold_uncertainty_score":0.9997877},"labels":[],"label_agreement":null},{"id":"W3081170401","doi":"10.1109/cjece.2020.2966733","title":"UFleSe: User-Friendly Parametric Framework for Expressive Flexible Searches","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Data Management and Algorithms","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":"Computer science; Syntax; Scalability; SQL; JSON; Natural language; Interface (matter); Similarity (geometry); Information retrieval; Fuzzy logic; Programming language; Artificial intelligence; Natural language processing; Data mining; Database","score_opus":0.02210366387799143,"score_gpt":0.2237459265400002,"score_spread":0.20164226266200877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081170401","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.0024870487,0.0008793983,0.9947137,0.0015757199,0.0002021055,0.000090008085,0.0000036669976,0.000027937802,0.000020367224],"genre_scores_gemma":[0.37944588,0.000038261576,0.61911166,0.0007011286,0.0006586876,0.000004625245,0.0000017281187,0.000015224431,0.000022841643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906206,0.000013456876,0.00021550628,0.000189186,0.00014131553,0.00037848813],"domain_scores_gemma":[0.99873805,0.00025983463,0.000067863766,0.00011798443,0.00008127409,0.000734984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013022109,0.00012136018,0.00020422922,0.000310842,0.00007617389,0.00036361962,0.00069278234,0.0000486249,0.0000032350772],"category_scores_gemma":[0.0001881287,0.00011026933,0.000072464005,0.0008099781,0.000014298084,0.00044200313,0.000069429465,0.00027295988,0.0000020648306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024526424,0.000039028462,0.0009860821,0.00018397273,0.000269383,0.0005388247,0.00063918217,0.021063084,0.00010664096,0.61945426,0.029449213,0.3272458],"study_design_scores_gemma":[0.0003750832,0.00070675166,0.0010574698,0.0000592749,0.000014901959,0.000049729024,0.000005978676,0.90315837,0.0004142522,0.0019427345,0.091968656,0.00024677394],"about_ca_topic_score_codex":0.000025784779,"about_ca_topic_score_gemma":0.0000027147125,"teacher_disagreement_score":0.88209534,"about_ca_system_score_codex":0.000034882683,"about_ca_system_score_gemma":0.00014935188,"threshold_uncertainty_score":0.44966528},"labels":[],"label_agreement":null},{"id":"W3081818585","doi":"10.1002/net.21987","title":"Plowing with precedence in polynomial time","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Data Management and Algorithms","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 Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología; Bundesministerium für Bildung und Forschung; Deutscher Akademischer Austauschdienst","keywords":"Heuristics; Traverse; Tree traversal; Time complexity; Computer science; State (computer science); Mathematical optimization; Polynomial; Mathematics; Algorithm; Geography; Cartography","score_opus":0.008302955797465502,"score_gpt":0.17694568193358984,"score_spread":0.16864272613612433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081818585","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.0053189695,0.00008985386,0.9791639,0.0030610028,0.00018255772,0.00017720042,7.876204e-7,0.0002299363,0.011775783],"genre_scores_gemma":[0.9566025,0.000016721908,0.039342742,0.0027495315,0.0006377111,0.000012603775,0.000010458809,0.000014199603,0.0006134872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993311,0.000019378893,0.000085950574,0.0002502773,0.0001158693,0.00019738532],"domain_scores_gemma":[0.999693,0.000022788663,0.0000235137,0.00019419266,0.0000063158404,0.00006022123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008737108,0.00007125919,0.000084395084,0.000023277753,0.00003042693,0.00014716115,0.00064180675,0.000023055925,0.00001691097],"category_scores_gemma":[0.000005859496,0.000060935174,0.000013491148,0.00038931667,0.000013172116,0.0005934691,0.000273667,0.000115877876,0.00008116773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109377455,0.00012598523,0.011385286,0.000031825373,0.000064447704,0.00047236218,0.0020928276,0.12740183,0.00014167107,0.0057338146,0.12239541,0.73004514],"study_design_scores_gemma":[0.0002525813,0.00006310155,0.0013681806,0.000020605872,0.000001856239,9.394624e-7,0.0000049103182,0.989701,0.000016676286,0.00001538952,0.008449996,0.000104763945],"about_ca_topic_score_codex":0.0000084902695,"about_ca_topic_score_gemma":0.0000052985188,"teacher_disagreement_score":0.9512836,"about_ca_system_score_codex":0.000009456215,"about_ca_system_score_gemma":0.000011039736,"threshold_uncertainty_score":0.24848643},"labels":[],"label_agreement":null},{"id":"W3083067449","doi":"10.1109/cec48606.2020.9185609","title":"Discovering Numerous Strassen’s Equivalent Equations Using a Simple Micro Multimodal GA: Evolution in Action","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Strassen algorithm; Simple (philosophy); Action (physics); Computer science; Statistical physics; Physics; Quantum mechanics","score_opus":0.08043503582654463,"score_gpt":0.3102707707902285,"score_spread":0.2298357349636839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083067449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14965352,0.000008783418,0.84906363,0.00069235335,0.00013444865,0.00015056231,0.000005531662,0.00010709717,0.00018405085],"genre_scores_gemma":[0.94291675,0.0000027937597,0.05681707,0.00011183252,0.00007747212,0.000005650309,0.00001683554,0.000005768628,0.00004583336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990443,0.000030653002,0.00018927618,0.00032580885,0.00018166547,0.00022829253],"domain_scores_gemma":[0.9996384,0.000027773023,0.000053567426,0.00020619431,0.000014107556,0.000059975057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001051112,0.0000984467,0.00009225915,0.00008651479,0.00008519072,0.0002298075,0.00035279352,0.000023887475,0.000023024413],"category_scores_gemma":[0.00002765475,0.00009933794,0.000035466965,0.0004076296,0.000010889142,0.0018164525,0.00035584264,0.000084684514,0.00003501704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053966418,0.0008773593,0.021984922,0.00029004997,0.00014469856,0.00013444244,0.004613817,0.3141498,0.22197391,0.2788506,0.0010951607,0.15583129],"study_design_scores_gemma":[0.00030394082,0.000025581303,0.003726498,0.000008069903,0.00000483488,9.903034e-7,0.00021645683,0.99399215,0.00088563445,0.00055143825,0.0001527152,0.0001316742],"about_ca_topic_score_codex":0.0006813822,"about_ca_topic_score_gemma":0.00013918456,"teacher_disagreement_score":0.7932632,"about_ca_system_score_codex":0.00014964945,"about_ca_system_score_gemma":0.00003288758,"threshold_uncertainty_score":0.40508837},"labels":[],"label_agreement":null},{"id":"W3086389904","doi":"10.1109/access.2020.3023376","title":"A Framework for Spatial-Temporal Trajectory Cluster Analysis Based on Dynamic Relationships","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Data Management and Algorithms","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Data mining; Cluster analysis; Merge (version control); Spatial analysis; Trajectory; Crime analysis; Cluster (spacecraft); Identification (biology); Temporal database; Artificial intelligence; Information retrieval; Geography","score_opus":0.07179478281687209,"score_gpt":0.32325340033716315,"score_spread":0.2514586175202911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086389904","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.0035295743,0.0000077086825,0.9894013,0.0060063316,0.00035271226,0.00031096398,0.000032701366,0.00016412862,0.00019461765],"genre_scores_gemma":[0.90617824,9.71422e-7,0.08964646,0.0038667002,0.00012486136,0.000048495152,0.000077264,0.000010348416,0.00004664409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987926,0.000081595856,0.00020647529,0.00046778945,0.00025160558,0.00019993384],"domain_scores_gemma":[0.998886,0.00032203694,0.00010978771,0.0005464715,0.000038267262,0.000097445816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002551321,0.00013124918,0.0001831899,0.00022060517,0.00014893364,0.00051245507,0.0014122025,0.000063379426,0.00002779052],"category_scores_gemma":[0.000101835634,0.00012307764,0.00015421306,0.0012403238,0.000018203737,0.0008186909,0.0001201896,0.00017868156,0.00003691282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006121944,0.0011523172,0.1701364,0.0006679795,0.0023922212,0.00012503733,0.0038412514,0.4865673,0.000065019136,0.045243993,0.06850252,0.22069377],"study_design_scores_gemma":[0.00029140274,0.00006168244,0.011267841,0.000010604451,0.00009512288,4.157803e-8,0.0000078981475,0.98436886,0.00004067957,0.0024934006,0.001197438,0.00016500732],"about_ca_topic_score_codex":0.000048714242,"about_ca_topic_score_gemma":0.000108697386,"teacher_disagreement_score":0.9026487,"about_ca_system_score_codex":0.000025238327,"about_ca_system_score_gemma":0.000028389266,"threshold_uncertainty_score":0.501896},"labels":[],"label_agreement":null},{"id":"W3089750468","doi":"10.1007/978-3-030-58942-4_17","title":"An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Cluster analysis; Cardinality (data modeling); Computer science; Euclidean geometry; Mathematical optimization; Constrained clustering; Algorithm; Correlation clustering; Mathematics; Canopy clustering algorithm; Artificial intelligence; Data mining","score_opus":0.032993069767874895,"score_gpt":0.2621210442020565,"score_spread":0.22912797443418162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089750468","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.000008075563,0.00020140731,0.99406695,0.0009646414,0.0007625359,0.0012274134,0.000043114745,0.00014825819,0.0025775773],"genre_scores_gemma":[0.09701968,0.000020804393,0.9012974,0.0007826101,0.00064363785,0.000040843825,0.000046270623,0.000039586284,0.0001091744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961487,0.000054438857,0.0006381255,0.0016685809,0.0008774508,0.00061267446],"domain_scores_gemma":[0.99688655,0.0005934686,0.00038915774,0.001779679,0.0001869576,0.00016415761],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015693344,0.0005310994,0.00062757125,0.00038524513,0.00033910424,0.00095178187,0.0064357077,0.00016945765,0.0000045928437],"category_scores_gemma":[0.000061729945,0.00039730562,0.00022716976,0.0005671027,0.0007734209,0.00098863,0.0018105615,0.00050224236,0.0000031611576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017440274,0.000049549973,0.000029321152,0.00031371968,0.00006350057,0.00002329234,0.0012450225,0.05078467,0.00019106061,0.03279772,0.00007316299,0.91441154],"study_design_scores_gemma":[0.0003154433,0.0003205782,0.000034825058,0.00013930716,0.000030861986,0.000015421007,0.0000026589146,0.97222525,0.00037405625,0.024208512,0.0018065025,0.00052657677],"about_ca_topic_score_codex":0.000034703495,"about_ca_topic_score_gemma":0.000024718805,"teacher_disagreement_score":0.9214406,"about_ca_system_score_codex":0.000086313725,"about_ca_system_score_gemma":0.00026189638,"threshold_uncertainty_score":0.9998479},"labels":[],"label_agreement":null},{"id":"W3090242834","doi":"10.1155/2020/2098495","title":"Advancing Transportation Routing Decisions Using Riemannian Manifold Surfaces","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Data Management and Algorithms","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":"","keywords":"Routing (electronic design automation); Flexibility (engineering); Set (abstract data type); Curvature; Mathematical optimization; Computer science; Riemannian manifold; Manifold (fluid mechanics); Event (particle physics); Algorithm; Topology (electrical circuits); Mathematics; Simulation; Engineering; Statistics","score_opus":0.024305085659637984,"score_gpt":0.26928555048469055,"score_spread":0.24498046482505256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090242834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3432994,0.000103307044,0.65536386,0.00074718316,0.00031992054,0.000094141054,0.000011180964,0.00004094226,0.000020096453],"genre_scores_gemma":[0.7122006,0.000090956455,0.28738046,0.00019246429,0.00009673184,6.55037e-7,0.00002191535,0.000011382992,0.0000048794072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982114,0.000027182843,0.00077949674,0.00024842971,0.0004997882,0.00023370267],"domain_scores_gemma":[0.99873614,0.000076148055,0.0006570169,0.00015362137,0.0002063567,0.0001706923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002803959,0.00015726872,0.00025198297,0.00012841584,0.00013266005,0.00009938406,0.00051076495,0.000037971964,0.000009480686],"category_scores_gemma":[0.000047859005,0.00015051286,0.00013728456,0.0005497337,0.00001239133,0.0039205374,0.00000478372,0.00018908172,0.000003404213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001423259,0.0001174028,0.0055309036,0.00008452246,0.00010808878,0.00049524184,0.011448252,0.8530454,0.035399754,0.01102309,0.00015452522,0.08245051],"study_design_scores_gemma":[0.007936607,0.0015486046,0.6179578,0.001318191,0.00057748816,0.00004554852,0.008735,0.32147428,0.016055627,0.007969147,0.014601856,0.0017798699],"about_ca_topic_score_codex":0.0000069359307,"about_ca_topic_score_gemma":0.00003598511,"teacher_disagreement_score":0.6124269,"about_ca_system_score_codex":0.000035197758,"about_ca_system_score_gemma":0.00005770938,"threshold_uncertainty_score":0.61377364},"labels":[],"label_agreement":null},{"id":"W3090906250","doi":"10.1145/3406096","title":"Vehicle Trajectory Similarity","year":2020,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":85,"is_retracted":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":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Trajectory; Computer science; Robustness (evolution); Data mining; Similarity (geometry); Preprocessor; Field (mathematics); Artificial intelligence; Mathematics","score_opus":0.09361225653001852,"score_gpt":0.33177787279066506,"score_spread":0.23816561626064653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090906250","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":[4.1707364e-7,0.7801326,0.21691842,0.00012083863,0.0011192148,0.00032937576,0.000027713852,0.0006109491,0.0007404771],"genre_scores_gemma":[0.000011115426,0.9649529,0.033899672,0.00018366652,0.0005470105,0.000006541787,0.00017643446,0.000049686467,0.00017296155],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955679,0.0017000712,0.0006484681,0.0011145629,0.00043709518,0.0005318935],"domain_scores_gemma":[0.99621576,0.0009926184,0.00038224822,0.0021859722,0.000050734765,0.00017263851],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028807265,0.00051703403,0.0014183808,0.00017433323,0.00021155275,0.0005880767,0.0066760555,0.00018101191,0.00001361215],"category_scores_gemma":[0.0004564306,0.00047458897,0.00044060138,0.0011607137,0.00004640096,0.0003896967,0.0049793115,0.00067958405,0.0005858221],"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":[7.319104e-8,0.000026247604,0.0000089777,0.0016627505,0.00007957047,0.000079003636,0.000030264766,0.0000020399912,1.6735429e-8,0.00047319103,0.0046227677,0.9930151],"study_design_scores_gemma":[0.0000957296,0.000030580828,0.00011696967,0.001150677,0.000076315744,0.000007980716,0.0000013987955,0.0070426203,1.8064115e-7,0.00016071582,0.9907925,0.0005243106],"about_ca_topic_score_codex":0.000042915824,"about_ca_topic_score_gemma":0.0000047397593,"teacher_disagreement_score":0.99249077,"about_ca_system_score_codex":0.00007919737,"about_ca_system_score_gemma":0.00019202977,"threshold_uncertainty_score":0.9997706},"labels":[],"label_agreement":null},{"id":"W3096006257","doi":"","title":"5th Workshop on GRAph Searching, Theory and Applications (GRASTA 2012)","year":2012,"lang":"en","type":"book","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Statistics Canada","funders":"","keywords":"Computer science; Graph theory; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.015219171007238035,"score_gpt":0.24061292781547708,"score_spread":0.22539375680823903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096006257","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.000008970526,0.0013513104,0.5673622,0.0017564544,0.00009949316,0.00040988947,0.000041359202,0.00022369763,0.4287466],"genre_scores_gemma":[0.0008960735,0.0022978496,0.041979786,0.0003349583,0.000115878254,0.00014529408,0.0007618932,0.0000651737,0.9534031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951528,0.0025569776,0.0003634987,0.0008904819,0.0005522848,0.000483971],"domain_scores_gemma":[0.99351084,0.0022739775,0.00035125623,0.003092823,0.00049153034,0.00027956386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0070621464,0.00037830792,0.0003096438,0.00039726545,0.00054474425,0.00086249097,0.002732296,0.00019437788,0.00014569811],"category_scores_gemma":[0.00023862305,0.00037718937,0.00013788321,0.00041268705,0.00031028668,0.0007094416,0.0018655871,0.0006336192,0.00030735412],"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.0000022433287,0.00012835902,0.000013251491,0.000037467522,0.00003822406,0.0000012494063,0.0008032056,8.6642484e-7,0.0000063306334,0.72221106,0.018858705,0.25789902],"study_design_scores_gemma":[0.00027377403,5.0509163e-7,0.00026016746,0.00070403283,0.00004221574,0.000005530271,0.000026280348,0.0010541079,0.00013434424,0.09755213,0.89945006,0.00049684],"about_ca_topic_score_codex":0.000025734413,"about_ca_topic_score_gemma":0.00008841548,"teacher_disagreement_score":0.8805914,"about_ca_system_score_codex":0.000075902746,"about_ca_system_score_gemma":0.00014785375,"threshold_uncertainty_score":0.999868},"labels":[],"label_agreement":null},{"id":"W3097495674","doi":"10.1016/j.ejtl.2020.100023","title":"Learning to handle parameter perturbations in Combinatorial Optimization: An application to facility location","year":2020,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Exploit; A priori and a posteriori; Computer science; Optimization problem; Mathematical optimization; Classifier (UML); Combinatorial optimization; Context (archaeology); Variation (astronomy); Constraint (computer-aided design); Perspective (graphical); Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.017901540150668076,"score_gpt":0.2270287146354921,"score_spread":0.209127174484824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097495674","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.042124566,0.000009714306,0.9464477,0.0060187676,0.0002498043,0.0006969575,0.00004468032,0.00020515024,0.0042026686],"genre_scores_gemma":[0.93772095,0.000015889435,0.058385566,0.0012502094,0.000113328744,0.0000675204,0.00045750669,0.0000149185325,0.0019741089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980247,0.0001633492,0.00026035873,0.00083265256,0.00035125107,0.00036766997],"domain_scores_gemma":[0.9989698,0.00009071483,0.00007983323,0.00044443854,0.00014519172,0.00027001926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002128969,0.00022062463,0.00023770379,0.00026537804,0.0003557114,0.00018077849,0.001018475,0.000052473668,0.000022494616],"category_scores_gemma":[0.000079038626,0.0002448871,0.000045389705,0.0011227038,0.000050588045,0.00094808236,0.0009450513,0.00017670501,0.0002572881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019400961,0.0005413485,0.012414922,0.00007017154,0.00008242487,0.000056748144,0.010058324,0.80383307,0.00045525935,0.14930014,0.0022383002,0.020755263],"study_design_scores_gemma":[0.0015284222,0.0008167186,0.036415976,0.000032606436,0.00004485859,0.000004717625,0.0010141855,0.89249396,0.00015449095,0.00056594564,0.06610332,0.0008248124],"about_ca_topic_score_codex":0.00003616915,"about_ca_topic_score_gemma":0.000028019605,"teacher_disagreement_score":0.8955964,"about_ca_system_score_codex":0.00012807953,"about_ca_system_score_gemma":0.000058526253,"threshold_uncertainty_score":0.99862057},"labels":[],"label_agreement":null},{"id":"W3098157538","doi":"10.1007/s41651-020-00066-3","title":"Geospatial Operations of Discrete Global Grid Systems—a Comparison with Traditional GIS","year":2020,"lang":"en","type":"article","venue":"Journal of Geovisualization and Spatial Analysis","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":45,"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":"Geospatial analysis; Computer science; Implementation; Grid; Visualization; Geographic information system; Computation; Development (topology); Data mining; Database; Systems engineering; Software engineering; Algorithm; Engineering; Geography; Mathematics; Remote sensing","score_opus":0.028628589295871098,"score_gpt":0.2733972601617692,"score_spread":0.2447686708658981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098157538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018052608,0.00009744644,0.9804525,0.0010456098,0.00011245209,0.00006647248,0.000075445714,0.000012459421,0.00008504973],"genre_scores_gemma":[0.99323225,0.000039003407,0.0062455875,0.0001315825,0.00022152689,0.0000011418095,0.00011360193,0.0000030567355,0.000012256523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985234,0.00009440647,0.0005861858,0.00016722789,0.0005322696,0.00009650869],"domain_scores_gemma":[0.99902254,0.000022633745,0.00040914377,0.000114654205,0.00029430506,0.00013669813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019066817,0.00010721747,0.00039735157,0.00016314736,0.00009645791,0.00024448516,0.00031639298,0.000028560875,0.000037170168],"category_scores_gemma":[0.000031961892,0.00007988806,0.00011054311,0.001145641,0.00004085226,0.0006867304,0.00006894251,0.00006121304,0.0000011578309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022386378,0.00057483296,0.17793077,0.00017850964,0.004824637,0.000058260048,0.0025881378,0.680553,0.00011896595,0.11048217,0.0032202634,0.019246548],"study_design_scores_gemma":[0.0004998007,0.0004153555,0.02381896,0.000016437194,0.0005573967,0.000006111935,0.00016194495,0.9738586,0.00002769821,0.00003999197,0.0004939686,0.00010373824],"about_ca_topic_score_codex":0.00044233468,"about_ca_topic_score_gemma":0.00028902767,"teacher_disagreement_score":0.9751796,"about_ca_system_score_codex":0.000018018574,"about_ca_system_score_gemma":0.0000559771,"threshold_uncertainty_score":0.32577404},"labels":[],"label_agreement":null},{"id":"W31006655","doi":"10.3233/bd-180350","title":"Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions","year":2007,"lang":"en","type":"article","venue":"Journal of Digital Information Management","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Categorical variable; Online analytical processing; Computer science; Search engine indexing; Data mining; Dimension (graph theory); Feature (linguistics); Cardinality (data modeling); Data warehouse; Relational database; Data cube; Spatial analysis; Information retrieval; Database; Machine learning; Mathematics; Statistics","score_opus":0.016233007136505807,"score_gpt":0.22655437867754596,"score_spread":0.21032137154104016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31006655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036877923,0.0000660795,0.953264,0.00021997635,0.00011010326,0.00013528537,0.0000029077871,0.000011804435,0.009311943],"genre_scores_gemma":[0.9594473,0.000039143746,0.040216856,0.00010457724,0.000019260371,7.151957e-7,0.000010454855,0.0000026556388,0.0001589883],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989615,0.0000074347927,0.000496937,0.000060791066,0.00036443493,0.000108871565],"domain_scores_gemma":[0.9992039,0.000043507163,0.00045790034,0.00010966894,0.00011303127,0.00007196976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053402176,0.000079066376,0.00013654538,0.0003135927,0.000051792773,0.00027631628,0.00016658686,0.00001796079,0.0000014206103],"category_scores_gemma":[0.000015419739,0.000058558206,0.000023808927,0.00021829092,0.000036827863,0.005963877,0.00022694186,0.000077382414,0.0000026418338],"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.000083482344,0.00013021963,0.0059010237,0.00016377772,0.00023959512,0.00008108585,0.0013562982,0.0006010553,0.0000063384205,0.44122544,0.0033202993,0.5468914],"study_design_scores_gemma":[0.010326722,0.0026405724,0.46069044,0.0005422921,0.00027981654,0.00080716674,0.0068974523,0.056195494,0.00020280978,0.023766698,0.43639547,0.0012550879],"about_ca_topic_score_codex":7.573821e-7,"about_ca_topic_score_gemma":5.6629364e-7,"teacher_disagreement_score":0.92256945,"about_ca_system_score_codex":0.000022080621,"about_ca_system_score_gemma":0.0000090403055,"threshold_uncertainty_score":0.43236667},"labels":[],"label_agreement":null},{"id":"W3104298487","doi":"","title":"Towards Knowledge-Enriched Path Computation","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"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; Bundesministerium für Wirtschaft und Technologie; European Commission","keywords":"Computer science; Closeness; Probabilistic logic; Data mining; Point of interest; Geospatial analysis; Measure (data warehouse); Path (computing); Inference; Ground truth; Node (physics); Shortest path problem; Graph; Function (biology); Theoretical computer science; Artificial intelligence; Geography; Mathematics","score_opus":0.02729310518709432,"score_gpt":0.28839647628930437,"score_spread":0.26110337110221005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104298487","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.00016050508,0.0000933335,0.8824256,0.00065075065,0.0020766559,0.00022499441,0.0000039326305,0.0005562866,0.11380792],"genre_scores_gemma":[0.31520298,0.000071042836,0.6738578,0.0006752747,0.0007154854,0.000061052495,0.00040232355,0.000030351615,0.0089836605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835426,0.00009175585,0.00027885774,0.0007373358,0.00028600765,0.00025176044],"domain_scores_gemma":[0.99867725,0.000039058115,0.00014764139,0.0009287784,0.000121062454,0.00008621889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050652603,0.00025327518,0.00027459336,0.000175943,0.00006786604,0.0007479376,0.002028871,0.00013117387,0.000029774377],"category_scores_gemma":[0.000023509394,0.00022299182,0.00010766676,0.00020609566,0.000023910612,0.00032728008,0.0052934857,0.00027762522,0.00061364815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.2652846e-7,0.00011004728,0.00002078415,0.00017339096,0.00005276599,0.000007285247,0.00030357862,0.0009062468,0.0000047076505,0.15163636,0.076845914,0.769938],"study_design_scores_gemma":[0.00018897584,0.000027608374,0.0011316143,0.000033588356,0.000013552553,8.8864573e-7,0.000007457413,0.92181623,0.00001854569,0.048985146,0.027418949,0.00035741358],"about_ca_topic_score_codex":0.00004911498,"about_ca_topic_score_gemma":0.0000045959723,"teacher_disagreement_score":0.92091,"about_ca_system_score_codex":0.000047393427,"about_ca_system_score_gemma":0.000091037466,"threshold_uncertainty_score":0.90933424},"labels":[],"label_agreement":null},{"id":"W3107439925","doi":"10.2200/s01048ed1v01y202009dtm063","title":"Skylines and Other Dominance-Based Queries","year":2020,"lang":"en","type":"article","venue":"Synthesis lectures on data management","topic":"Data Management and Algorithms","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":"Dominance (genetics); Computer science; Information retrieval; Theoretical computer science; Chemistry","score_opus":0.05543170520960824,"score_gpt":0.2604830773332338,"score_spread":0.20505137212362554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107439925","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.00055503205,0.00061314163,0.9371499,0.041422285,0.00036318158,0.0008335381,0.00034926934,0.0006296807,0.018084],"genre_scores_gemma":[0.48057312,0.0007052585,0.4375245,0.0786064,0.0008107818,0.00030126647,0.00026135967,0.00012631604,0.0010909989],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981768,0.000069811955,0.00020012182,0.00092776644,0.00034321728,0.0002822655],"domain_scores_gemma":[0.9979268,0.0001362883,0.00008254793,0.0017458623,0.000011516191,0.00009699833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027833463,0.00023594666,0.00020985631,0.00011502341,0.0001371462,0.0005261014,0.002702142,0.0000309477,0.00007136033],"category_scores_gemma":[0.00011570693,0.00019241813,0.00003266827,0.00031016459,0.000067987145,0.0006460345,0.0018067507,0.00008165088,0.000100671576],"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.000079948666,0.00012240186,0.00019413276,0.00029324295,0.00019812719,0.000105130835,0.0001289864,0.00022673025,0.00003722363,0.08814588,0.12510048,0.7853677],"study_design_scores_gemma":[0.00039199632,0.00007978356,0.00083043694,0.00006986615,0.000057898607,6.822335e-7,0.000038734866,0.06136402,0.001550623,0.00075575593,0.9344714,0.00038879056],"about_ca_topic_score_codex":0.000017777762,"about_ca_topic_score_gemma":0.000010520313,"teacher_disagreement_score":0.80937093,"about_ca_system_score_codex":0.000011872395,"about_ca_system_score_gemma":0.000009590093,"threshold_uncertainty_score":0.7846584},"labels":[],"label_agreement":null},{"id":"W3108171104","doi":"10.1145/3416010.3423239","title":"Calibrating Bus Mobility Data for Bus-based Urban Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Computer science; Global Positioning System; Public transport; Asynchronous communication; Vehicular ad hoc network; Intelligent transportation system; State (computer science); Sample (material); Computer network; Distributed computing; Transport engineering; Wireless ad hoc network; Telecommunications; Engineering; Wireless","score_opus":0.062225196439499385,"score_gpt":0.26521486839021197,"score_spread":0.20298967195071257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108171104","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.00020879765,0.000063955675,0.993752,0.004629766,0.00017527562,0.00035130515,0.000043137778,0.00030514525,0.000470602],"genre_scores_gemma":[0.20793977,0.0000051436855,0.774996,0.014433726,0.00085892604,0.00005615395,0.0013430375,0.000026025838,0.00034123243],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998698,0.00003248421,0.00019345386,0.00065125676,0.00016837245,0.00025644992],"domain_scores_gemma":[0.99836534,0.0001027006,0.000052902815,0.0013339123,0.000030049832,0.00011507164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003732292,0.0001149627,0.00013106123,0.000017629582,0.00011032313,0.00038623728,0.0024440647,0.000031945994,0.000025886695],"category_scores_gemma":[0.00008753463,0.00009884375,0.00003963809,0.00031128223,0.00002227069,0.0011501655,0.0012599659,0.00007845296,0.000013240433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038003567,0.00031737238,0.0026689344,0.00027331625,0.000120518016,0.000052027142,0.00017016672,0.04731493,0.00012461406,0.06582895,0.66365117,0.21944],"study_design_scores_gemma":[0.00028718443,0.000049442915,0.00010608829,0.000004608763,0.000007704668,1.0770422e-7,0.000008734925,0.9429398,0.000097328666,0.00010016732,0.056266826,0.00013199358],"about_ca_topic_score_codex":0.000023936142,"about_ca_topic_score_gemma":0.0000050819253,"teacher_disagreement_score":0.8956249,"about_ca_system_score_codex":0.0000076248957,"about_ca_system_score_gemma":0.000030719966,"threshold_uncertainty_score":0.4541721},"labels":[],"label_agreement":null},{"id":"W3110157014","doi":"10.1109/dsaa49011.2020.00046","title":"MRSweep: Distributed In-Memory Sweep-line for Scalable Object Intersection Problems","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Scalability; Intersection (aeronautics); Line (geometry); Line segment; Computational geometry; Source lines of code; Algorithm; SPARK (programming language); Theoretical computer science; Artificial intelligence; Mathematics; Programming language; Database; Software","score_opus":0.030422264418453967,"score_gpt":0.24350670728128523,"score_spread":0.21308444286283126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110157014","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.0017980286,0.000019687763,0.99006367,0.00474414,0.00030807158,0.00048494476,0.000019921212,0.0002729538,0.0022886032],"genre_scores_gemma":[0.91133714,0.000017416365,0.082317024,0.0027040537,0.00035885023,0.00016787882,0.0003908456,0.000023162183,0.0026836412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989485,0.00001922787,0.00023002598,0.00041078485,0.00013515993,0.0002562952],"domain_scores_gemma":[0.9995318,0.000037126956,0.000050525166,0.00026356758,0.000039376293,0.00007761535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002231309,0.00011344922,0.00013958478,0.00007327798,0.000054028005,0.00020589589,0.0006296275,0.00003184074,0.000032590935],"category_scores_gemma":[0.00005420752,0.000100703124,0.000050572835,0.0006015494,0.000015761416,0.000912073,0.00034897195,0.0000826957,0.0000713264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014311449,0.0007926358,0.0016372086,0.0008285232,0.00017918671,0.000060704562,0.002700951,0.011888989,0.004762628,0.07371777,0.22661282,0.6766755],"study_design_scores_gemma":[0.0010318164,0.0002856968,0.0004732293,0.000022865433,0.00000634133,0.0000012112529,0.000115092946,0.9681077,0.002480882,0.0016599173,0.025595987,0.00021925286],"about_ca_topic_score_codex":0.000082683146,"about_ca_topic_score_gemma":0.000057847235,"teacher_disagreement_score":0.9562187,"about_ca_system_score_codex":0.000036216454,"about_ca_system_score_gemma":0.000018606279,"threshold_uncertainty_score":0.4106554},"labels":[],"label_agreement":null},{"id":"W3110997203","doi":"10.1016/j.is.2020.101687","title":"Efficient top-k recently-frequent term querying over spatio-temporal textual streams","year":2020,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","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 Victoria","funders":"H2020 Marie Skłodowska-Curie Actions; Norges Forskningsråd","keywords":"Computer science; Index (typography); Window (computing); Task (project management); Social media; Data mining; Information retrieval; Term (time); Data stream mining; Mobile device; Data stream; World Wide Web","score_opus":0.019253021858057336,"score_gpt":0.2338663340570475,"score_spread":0.21461331219899016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110997203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032894284,0.000074598975,0.9391429,0.00084021693,0.0017433808,0.0008966379,0.000060599647,0.00062931015,0.023718117],"genre_scores_gemma":[0.99680597,0.0000044260014,0.0018920536,0.00075221516,0.00019138855,0.000029269862,0.00023563954,0.000005562171,0.00008350092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983691,0.000044065873,0.0005767677,0.00019466181,0.00056694786,0.0002484861],"domain_scores_gemma":[0.9990585,0.000021558877,0.00029028376,0.00040367356,0.000085867054,0.000140152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030369157,0.00015326677,0.00016649363,0.00012356527,0.000117531294,0.0010012119,0.00071176316,0.000046708676,0.000023491975],"category_scores_gemma":[0.000031950687,0.00013658412,0.000052738236,0.00040586715,0.000016567094,0.0021149681,0.00030943708,0.00009575304,0.00069826364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006119105,0.0002014407,0.020667244,0.0012664063,0.00021584178,0.000053439555,0.03240594,0.06579607,0.00009551537,0.27329588,0.097365186,0.50857586],"study_design_scores_gemma":[0.0004933562,0.00005297497,0.000856237,0.000053807544,0.0000045715424,0.000004209027,0.0007513235,0.8116585,0.00006981578,0.0000072820235,0.18582486,0.00022307654],"about_ca_topic_score_codex":0.00013500436,"about_ca_topic_score_gemma":0.0000014263998,"teacher_disagreement_score":0.96391165,"about_ca_system_score_codex":0.000076304736,"about_ca_system_score_gemma":0.000040998806,"threshold_uncertainty_score":0.96547097},"labels":[],"label_agreement":null},{"id":"W3111359078","doi":"10.1609/aaai.v35i5.16483","title":"A SAT-based Resolution of Lam's Problem","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University; University of Windsor; University of Waterloo; Carleton University","funders":"","keywords":"Satisfiability; Consistency (knowledge bases); Projective test; Projective plane; Resolution (logic); Computer science; Code (set theory); Plane (geometry); Boolean satisfiability problem; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Programming language; Algebra over a field; Pure mathematics; Geometry","score_opus":0.0691774485863179,"score_gpt":0.2791805394646435,"score_spread":0.21000309087832558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111359078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11292034,0.00018152014,0.7341576,0.032209273,0.0016744698,0.0016968511,0.000062688974,0.0004355884,0.11666165],"genre_scores_gemma":[0.9683263,0.000018775456,0.030988181,0.00017338103,0.000033850793,0.0000148500285,0.0000024382687,0.00000706581,0.0004351888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983589,0.000018749304,0.00046298504,0.00041549487,0.00049509807,0.0002487464],"domain_scores_gemma":[0.9984299,0.000052608037,0.00035021562,0.00037779807,0.0007404424,0.00004903528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046088017,0.00014787001,0.00020895121,0.00010609676,0.00010244833,0.00018597889,0.0016590952,0.000053042597,0.000050733666],"category_scores_gemma":[0.00022808254,0.000117036376,0.00010724803,0.00091197086,0.00017591906,0.00045911493,0.0005178251,0.00015866697,0.000043152846],"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.000020149662,0.00017857995,0.000118612865,0.00007900325,0.000011592774,9.0267133e-7,0.00022781662,0.00007428183,0.030007843,0.9105967,0.00034857684,0.058335934],"study_design_scores_gemma":[0.000036256366,0.00012813631,0.00019842216,0.00028237212,0.00001336874,0.0000014477458,0.00020979135,0.12493897,0.7482799,0.12522769,0.0005249335,0.00015865477],"about_ca_topic_score_codex":0.00002521447,"about_ca_topic_score_gemma":0.00001083512,"teacher_disagreement_score":0.8554059,"about_ca_system_score_codex":0.000024740073,"about_ca_system_score_gemma":0.00013943342,"threshold_uncertainty_score":0.4772605},"labels":[],"label_agreement":null},{"id":"W3112799508","doi":"10.22215/etd/2008-08635","title":"Two results on distribution-sensitive data structures","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Mathematics; Humanities; Art","score_opus":0.03487575735801498,"score_gpt":0.30342258647528164,"score_spread":0.2685468291172667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112799508","genre_codex":"other","genre_gemma":"dataset","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.003599373,0.00018948734,0.2613928,0.0016966409,0.011310414,0.0015194676,0.01926913,0.0015431219,0.6994795],"genre_scores_gemma":[0.07278146,0.0004899763,0.037830375,0.00075537607,0.0010390286,0.000014385095,0.7800382,0.000046920828,0.10700432],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979504,0.000040245188,0.00027833902,0.0009927137,0.0004930741,0.00024525888],"domain_scores_gemma":[0.99726146,0.00007999159,0.00018172432,0.0023210354,0.000092512,0.00006327383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015218476,0.00025908652,0.00020494021,0.00009582958,0.00018456286,0.00030478428,0.0026488001,0.000087423716,0.0000113020205],"category_scores_gemma":[0.000098674645,0.00021654769,0.000043751086,0.0002801389,0.000021122989,0.0007752249,0.00051220885,0.00023157767,0.00018590898],"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.000077933786,0.00006081953,0.0000021037463,0.000021077243,0.00009358875,0.00017383025,0.00023102522,0.000020546362,0.0000071435834,0.25486112,0.62109405,0.12335675],"study_design_scores_gemma":[0.006104936,0.0005937329,0.0399351,0.0004935578,0.00020433101,0.000051445066,0.0014128356,0.114069045,0.008692726,0.016031345,0.8078861,0.0045248456],"about_ca_topic_score_codex":0.00019195942,"about_ca_topic_score_gemma":0.00021026678,"teacher_disagreement_score":0.760769,"about_ca_system_score_codex":0.000031968797,"about_ca_system_score_gemma":0.0000679712,"threshold_uncertainty_score":0.88305587},"labels":[],"label_agreement":null},{"id":"W3113489201","doi":"10.1109/cloud49709.2020.00040","title":"PONCHE: Personalized and Context-Aware Vehicle Rerouting Service","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Context (archaeology); Contextual design; Perception; Service (business); Point (geometry); Data type; Advanced driver assistance systems; Quality (philosophy); Data mining; Human–computer interaction; Data science; Machine learning; Artificial intelligence","score_opus":0.033905940625647925,"score_gpt":0.2307741497907715,"score_spread":0.19686820916512357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113489201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043114748,0.00036869242,0.8065854,0.13493401,0.00019768644,0.00031475796,0.00001004277,0.00091793225,0.013556769],"genre_scores_gemma":[0.9434515,0.000015949032,0.01877289,0.036571532,0.000098113895,0.0000037621846,0.000008077026,0.00000751042,0.0010706553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932253,0.00002002213,0.00009304445,0.0002861512,0.00013086745,0.00014735821],"domain_scores_gemma":[0.999649,0.000027930964,0.000028187289,0.0001676148,0.00003121229,0.000096059906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010239765,0.00007632427,0.00009003519,0.000015321137,0.000081867904,0.00023650678,0.00045731018,0.0000176704,0.000059679584],"category_scores_gemma":[0.000015363225,0.00006685307,0.000016732085,0.00025513192,0.000014979122,0.00062574755,0.00055416254,0.000058305217,0.000109254725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023614508,0.000052788026,0.003877153,0.00018361345,0.00008854402,0.000097401076,0.010704169,0.0000060557604,0.0015372551,0.28727847,0.034846954,0.661304],"study_design_scores_gemma":[0.0012137456,0.000064406806,0.0020063536,0.00001816934,0.000010376165,0.0000040201217,0.0015730567,0.8987239,0.000538979,0.0003818525,0.09517057,0.0002945805],"about_ca_topic_score_codex":0.000057418973,"about_ca_topic_score_gemma":0.00000778877,"teacher_disagreement_score":0.90033674,"about_ca_system_score_codex":0.0000049939613,"about_ca_system_score_gemma":0.000009139447,"threshold_uncertainty_score":0.27261892},"labels":[],"label_agreement":null},{"id":"W3116728211","doi":"10.1109/iemcon51383.2020.9284839","title":"Approximate Continuous Nearest Neighbour Query Processing in Clustered Point Sets","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Nearest neighbour; Computer science; k-nearest neighbors algorithm; Set (abstract data type); Point (geometry); Cluster analysis; Data mining; Nearest-neighbor chain algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics; Fuzzy clustering; Canopy clustering algorithm","score_opus":0.024479007906169137,"score_gpt":0.24103186278618963,"score_spread":0.2165528548800205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116728211","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.008100465,0.00007037673,0.95479435,0.014575446,0.00016026455,0.000354905,0.000004136409,0.0005074739,0.021432593],"genre_scores_gemma":[0.8809787,0.000008543052,0.1121988,0.006071348,0.00009115927,0.000016711248,0.000017893544,0.000015424555,0.00060144486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988489,0.000032170734,0.00022513712,0.00041291688,0.0001886446,0.0002922286],"domain_scores_gemma":[0.999531,0.000011679144,0.000063392625,0.00027094551,0.000024305915,0.00009868432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017785931,0.00012492399,0.00016383719,0.000064709035,0.00005208985,0.0005812336,0.00082585326,0.000029217032,0.000028948454],"category_scores_gemma":[0.000027293607,0.00010831845,0.00002906733,0.0004393291,0.000019546102,0.0013697046,0.0006871752,0.000109432,0.00009494056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003206218,0.00023928998,0.006187093,0.0003519597,0.000018468665,0.00052558654,0.004073935,0.00025990803,0.00041437114,0.032733053,0.018335149,0.93682915],"study_design_scores_gemma":[0.00064148696,0.000054802185,0.0031783574,0.00003373367,0.000002684801,0.0000042257157,0.00017873754,0.99101406,0.0001942293,0.0009220822,0.0035375182,0.00023809561],"about_ca_topic_score_codex":0.00006313547,"about_ca_topic_score_gemma":0.000026245041,"teacher_disagreement_score":0.9907541,"about_ca_system_score_codex":0.000015349358,"about_ca_system_score_gemma":0.000028710941,"threshold_uncertainty_score":0.5604849},"labels":[],"label_agreement":null},{"id":"W3120844761","doi":"10.1007/s10707-020-00429-4","title":"Hidden Markov map matching based on trajectory segmentation with heading homogeneity","year":2021,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"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; National Natural Science Foundation of China","keywords":"Map matching; Global Positioning System; Hidden Markov model; Computer science; Segmentation; Matching (statistics); Artificial intelligence; Trajectory; Markov chain; Markov model; Heading (navigation); Pattern recognition (psychology); Geography; Mathematics; Machine learning; Statistics; Geodesy","score_opus":0.01061293708920493,"score_gpt":0.22345521429437873,"score_spread":0.2128422772051738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120844761","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.008542229,0.00002005289,0.96944594,0.0011461647,0.00025247008,0.00020532474,0.000012001701,0.00020779623,0.020167986],"genre_scores_gemma":[0.12673678,0.00000683515,0.86867833,0.0031739324,0.00007830541,0.00003710216,0.00021558936,0.000015803302,0.0010573287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989055,0.000036770274,0.0002126814,0.00019246865,0.0003914855,0.00026113557],"domain_scores_gemma":[0.9992156,0.000061747356,0.00008181611,0.000529234,0.00003880244,0.00007281883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027391993,0.00013099762,0.00013148249,0.0001068537,0.0001692059,0.00041025568,0.00041058444,0.000023530876,0.00008627785],"category_scores_gemma":[0.0000072396274,0.00011139208,0.000041738243,0.00027822488,0.000016573116,0.0014188986,0.00015148484,0.00009787936,0.0002332687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004452055,0.0003291617,0.0007973081,0.00069276243,0.00015607808,0.0002878354,0.0049378085,0.004749288,0.0002682809,0.03284286,0.02218399,0.9327101],"study_design_scores_gemma":[0.001923545,0.00027457456,0.0042822356,0.00036035661,0.000044626606,0.00003294645,0.0014052674,0.9759355,0.0051756767,0.00087785913,0.00891936,0.0007680591],"about_ca_topic_score_codex":0.000009741791,"about_ca_topic_score_gemma":0.000008141129,"teacher_disagreement_score":0.9711862,"about_ca_system_score_codex":0.000048335613,"about_ca_system_score_gemma":0.00006947299,"threshold_uncertainty_score":0.45424372},"labels":[],"label_agreement":null},{"id":"W3129019482","doi":"10.48550/arxiv.2102.03954","title":"Large-data determinantal clustering","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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é de Montréal","funders":"","keywords":"Cluster analysis; Determinantal point process; Point process; Mathematics; Correlation clustering; Single-linkage clustering; Clustering high-dimensional data; Data point; Algorithm; Eigenvalues and eigenvectors; Computer science; CURE data clustering algorithm; Random matrix; Statistics","score_opus":0.112099694896418,"score_gpt":0.20601875196460612,"score_spread":0.09391905706818812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129019482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036161933,0.000078674326,0.9596286,0.00006279101,0.0012685009,0.00015973629,0.00009583144,0.000251817,0.00229214],"genre_scores_gemma":[0.986464,0.00023766249,0.009995152,0.00012252151,0.00012686748,3.9940693e-7,0.0004460961,0.00001722532,0.0025900544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976064,0.00008507873,0.00016582773,0.0016206509,0.00010436059,0.0004177056],"domain_scores_gemma":[0.99584323,0.00003517841,0.00015691546,0.003783827,0.00005891188,0.00012193677],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0003076751,0.00027333625,0.00027637396,0.00017612129,0.00015842111,0.00057965115,0.006303817,0.00015228901,0.00004706],"category_scores_gemma":[0.000021742844,0.0003324747,0.000116902964,0.00042924492,0.00004078859,0.001644558,0.03499074,0.00040574977,0.00009209402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015396364,0.0036459302,0.02644783,0.0040208036,0.0032646486,0.106111676,0.0051926333,0.18234573,0.00023854997,0.43301073,0.04447875,0.19108875],"study_design_scores_gemma":[0.0003139308,0.000013348911,0.00053872605,0.000096001786,0.000051601502,0.0000078826815,0.00015634342,0.9923954,0.000022135242,0.0012732007,0.004708419,0.0004229796],"about_ca_topic_score_codex":0.000068924564,"about_ca_topic_score_gemma":0.00019694662,"teacher_disagreement_score":0.95030206,"about_ca_system_score_codex":0.00007753105,"about_ca_system_score_gemma":0.00010470111,"threshold_uncertainty_score":0.99991274},"labels":[],"label_agreement":null},{"id":"W3132888396","doi":"10.48550/arxiv.2102.12072","title":"Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Instant; Timestamp; Computer science; Ranking (information retrieval); Function (biology); Window (computing); Sequence (biology); Rank (graph theory); Data mining; Information retrieval; Algorithm; Mathematics; World Wide Web; Combinatorics; Real-time computing","score_opus":0.07096059361997485,"score_gpt":0.17750443204715888,"score_spread":0.10654383842718403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132888396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24316417,0.000040186704,0.74004906,0.00014388267,0.0011865783,0.0003189803,0.000028924302,0.00043571432,0.014632513],"genre_scores_gemma":[0.968833,0.00024211235,0.011558385,0.000077891906,0.00012774939,0.000002881656,0.00017665388,0.000029155846,0.018952146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742895,0.000104115585,0.0002392111,0.0015608942,0.00017853183,0.00048829697],"domain_scores_gemma":[0.9973031,0.00004849628,0.00025811064,0.002008824,0.00019143909,0.00019002847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002358238,0.00039623812,0.0003907565,0.00036783473,0.0003188722,0.0007668412,0.0019899511,0.00017044478,0.00012397935],"category_scores_gemma":[0.000014634991,0.00042652412,0.00016393677,0.0013004268,0.00008669256,0.0017213441,0.0031620187,0.00063294335,0.00008489918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054225384,0.0015305951,0.1483147,0.00085088756,0.0021155532,0.0149403345,0.0013340682,0.24377935,0.00014150095,0.55546165,0.013487157,0.017501965],"study_design_scores_gemma":[0.009288756,0.0010618133,0.043513928,0.0028219328,0.0010831924,0.00008210171,0.00763301,0.73701185,0.0010189734,0.0138245,0.17399,0.008669966],"about_ca_topic_score_codex":0.00060887734,"about_ca_topic_score_gemma":0.00060350716,"teacher_disagreement_score":0.72849065,"about_ca_system_score_codex":0.00022298077,"about_ca_system_score_gemma":0.0002866437,"threshold_uncertainty_score":0.9998187},"labels":[],"label_agreement":null},{"id":"W3134583825","doi":"10.1109/bigcomp51126.2021.00055","title":"Conceptual Modeling and Smart Computing for Big Transportation Data","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":true,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Big data; Computer science; Data science; Popularity; Data modeling; Abstraction; Variety (cybernetics); Smart city; Conceptual model; Intelligent transportation system; Software; World Wide Web; Database; Data mining; Transport engineering; Internet of Things; Engineering; Artificial intelligence","score_opus":0.10966903387442663,"score_gpt":0.288619403781572,"score_spread":0.1789503699071454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134583825","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.008701765,0.000076506614,0.9899812,0.00047625607,0.0002528918,0.00006806702,0.00002888079,0.000065970795,0.0003484589],"genre_scores_gemma":[0.45159712,0.000021892005,0.54651123,0.00051481987,0.00013634293,0.0000019100287,0.0008220372,0.0000050832386,0.00038959226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993785,0.000007822403,0.00010932924,0.0003179481,0.000079685204,0.00010673144],"domain_scores_gemma":[0.9995119,0.00003563746,0.000017775477,0.0003699717,0.000037835423,0.000026874575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016031104,0.000048836133,0.000063085354,0.000018623856,0.000074484204,0.00016326188,0.00038962916,0.000012463044,0.0000025778443],"category_scores_gemma":[0.000011078109,0.000046974437,0.000010434587,0.00009449142,0.00001226281,0.00058176747,0.00016604865,0.000023842416,0.0000016628233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003075064,0.00005112878,0.00075946475,0.00004416626,0.000045170415,0.00001913179,0.0010006415,0.0021785374,0.00020448239,0.46835116,0.0040010717,0.52334195],"study_design_scores_gemma":[0.00024312128,0.000008146424,0.00014413486,0.0000061543833,0.0000060932334,7.307227e-7,0.00020962274,0.99183303,0.00009499324,0.00079532195,0.006587501,0.00007114634],"about_ca_topic_score_codex":0.000018571143,"about_ca_topic_score_gemma":0.000050898216,"teacher_disagreement_score":0.9896545,"about_ca_system_score_codex":0.0000022378981,"about_ca_system_score_gemma":0.000018302348,"threshold_uncertainty_score":0.1915562},"labels":[],"label_agreement":null},{"id":"W3138059096","doi":"10.3390/ijgi10030182","title":"A Decentralized Semantic Reasoning Approach for the Detection and Representation of Continuous Spatial Dynamic Phenomena in Wireless Sensor Networks","year":2021,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Data mining; Object (grammar); Representation (politics); Fuzzy logic; Artificial intelligence; Kernel (algebra); Theoretical computer science; Mathematics","score_opus":0.007102453161193325,"score_gpt":0.246544079804734,"score_spread":0.23944162664354068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138059096","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.020923488,0.000086462416,0.97761464,0.0003862329,0.0007003859,0.00018211821,0.0000067632477,0.000007864763,0.00009202381],"genre_scores_gemma":[0.9774627,0.0003333723,0.021943348,0.00009657933,0.00009195349,0.0000075562252,0.000049152117,0.0000029083271,0.000012448777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988664,0.000049788,0.0005413623,0.00007958097,0.00035127936,0.00011158116],"domain_scores_gemma":[0.998608,0.00012525122,0.0006125097,0.00011925976,0.00051024853,0.000024731744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004959772,0.00007468622,0.00014629701,0.00019219135,0.000054594897,0.00028767958,0.0003523695,0.00003258442,0.000002299721],"category_scores_gemma":[0.00014646568,0.000060953127,0.0000629525,0.00020184179,0.000023150558,0.002495674,0.00010831904,0.00010564457,4.0175576e-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.00019738612,0.00005589106,0.0011474277,0.000035778463,0.00016698094,0.000006775697,0.001208289,0.024008164,0.00031153928,0.002808917,0.00004127242,0.9700116],"study_design_scores_gemma":[0.0013790604,0.000038355018,0.008555439,0.000051149742,0.000020629444,0.00007472178,0.0006436854,0.9880771,0.00048789923,0.00017713706,0.0004314863,0.00006333378],"about_ca_topic_score_codex":0.00007388048,"about_ca_topic_score_gemma":0.000024869907,"teacher_disagreement_score":0.96994823,"about_ca_system_score_codex":0.00006417728,"about_ca_system_score_gemma":0.000033524684,"threshold_uncertainty_score":0.2774101},"labels":[],"label_agreement":null},{"id":"W3138447845","doi":"10.1016/s0925-7721(02)00093-7","title":"Computing contour trees in all dimensions","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":460,"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":"University of North Carolina at Chapel Hill; Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Simple (philosophy); Computer science; Contour line; Algorithm; Mathematics; Artificial intelligence; Cartography; Geography","score_opus":0.04481388461551654,"score_gpt":0.2730690683067274,"score_spread":0.22825518369121084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138447845","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.06715496,0.0005112275,0.9234913,0.0021070878,0.00053190487,0.00017583245,0.000008289673,0.00024565458,0.005773721],"genre_scores_gemma":[0.91498333,0.000009772241,0.08348027,0.0009890697,0.000069040965,0.0000024629883,0.000030859566,0.0000064057654,0.00042878574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.00004161935,0.00025049452,0.00034629725,0.00031916666,0.0002673184],"domain_scores_gemma":[0.99932003,0.00024622967,0.00006861821,0.00024573118,0.00004731237,0.00007208247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021838013,0.00011901566,0.00014215363,0.0004092315,0.00008513018,0.00017178975,0.00064049434,0.00003081738,0.00007584593],"category_scores_gemma":[0.000043206404,0.00012143391,0.000045444373,0.0009000767,0.000029524526,0.00052997936,0.00041024675,0.00011806922,0.00032925274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003897768,0.00082285743,0.014974647,0.000026706044,0.000111088586,0.00028193384,0.0011836697,0.30019924,0.000058648995,0.2780895,0.055676248,0.34857157],"study_design_scores_gemma":[0.00045472436,0.000023950473,0.04074008,0.000016203163,0.0000025708248,0.0000075980083,0.000020379946,0.9464344,0.0000046255636,0.0060950047,0.006039745,0.00016072659],"about_ca_topic_score_codex":0.000015055578,"about_ca_topic_score_gemma":0.000005472115,"teacher_disagreement_score":0.8478284,"about_ca_system_score_codex":0.00003409707,"about_ca_system_score_gemma":0.0000084549365,"threshold_uncertainty_score":0.49519312},"labels":[],"label_agreement":null},{"id":"W3138836727","doi":"10.5383/juspn.15.02.005","title":"Unbounded Spatial Data Stream Query Processing using Spatial Semijoins","year":2021,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Data Management and Algorithms","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":"Spatial query; Computer science; Spatial analysis; Spatial database; Object-based spatial database; Data stream mining; Data mining; Focus (optics); Query optimization; Object (grammar); Web search query; Sargable; Information retrieval; Geography; Artificial intelligence; Remote sensing","score_opus":0.04769116251962889,"score_gpt":0.27910525443777806,"score_spread":0.23141409191814916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138836727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01716415,0.0075687454,0.9714512,0.00025045866,0.0031456354,0.00014132683,0.000022443586,0.000028948132,0.00022706334],"genre_scores_gemma":[0.98234504,0.0008302098,0.011279412,0.00017384104,0.0051245005,0.000001429596,0.000047947557,0.000024460816,0.00017317792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977862,0.00018922098,0.00070995174,0.0004347243,0.0005103602,0.00036954664],"domain_scores_gemma":[0.9978255,0.00009616514,0.00073882204,0.0007052997,0.00045500352,0.00017917651],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008417428,0.00022111634,0.0004807434,0.00011685208,0.00029500507,0.0014307869,0.001101355,0.00011423096,0.0000066830007],"category_scores_gemma":[0.000058811154,0.00018737986,0.00007850742,0.00031165793,0.000050667193,0.0018247754,0.001023059,0.00034922457,0.0000010381256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010852663,0.0005879879,0.0096472,0.0010310813,0.000878254,0.0051767817,0.0018925002,0.054623734,0.001498083,0.002350212,0.017910004,0.9042956],"study_design_scores_gemma":[0.0006539025,0.00013047253,0.00083752867,0.0007190821,0.00009439966,0.0014593786,0.00045039094,0.98530036,0.000043782613,0.00008805135,0.009952097,0.00027056673],"about_ca_topic_score_codex":0.0006585444,"about_ca_topic_score_gemma":0.00031742247,"teacher_disagreement_score":0.9651809,"about_ca_system_score_codex":0.00006194769,"about_ca_system_score_gemma":0.0003834621,"threshold_uncertainty_score":0.99960583},"labels":[],"label_agreement":null},{"id":"W3139152607","doi":"10.1145/3507904","title":"A Survey on Spatio-temporal Data Analytics Systems","year":2022,"lang":"en","type":"preprint","venue":"ACM Computing Surveys","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Analytics; Big data; Data science; NoSQL; Spatial analysis; Temporal database; Popularity; Data mining; Geography; Remote sensing","score_opus":0.1648382059673039,"score_gpt":0.3339813399706263,"score_spread":0.1691431340033224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139152607","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.009634164,0.00035732577,0.97066706,0.000431566,0.012751585,0.0009067895,0.0031277307,0.0009457467,0.0011780441],"genre_scores_gemma":[0.90887874,0.00004541807,0.034082875,0.00026397628,0.00077142817,0.000015257373,0.0543338,0.00009225927,0.0015162263],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900537,0.004743221,0.00088827574,0.0023306916,0.0013093869,0.00067473523],"domain_scores_gemma":[0.98455036,0.0018103325,0.00081103604,0.012489766,0.0001841045,0.00015437494],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.02191166,0.0005720439,0.0007793043,0.00044491148,0.00041852565,0.0020206443,0.021301592,0.00016591897,0.000033718763],"category_scores_gemma":[0.0014670715,0.00060773507,0.000115512834,0.0010042782,0.00005366541,0.00042749124,0.07332441,0.0012405887,0.0001123344],"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.000014595697,0.0006394594,0.36788967,0.00053672877,0.00088378665,0.00034310145,0.0003321921,0.19626194,2.451889e-7,0.003909253,0.30876657,0.120422445],"study_design_scores_gemma":[0.00019194398,0.000057520294,0.23516686,0.00009258135,0.000018841387,0.0000014538851,0.000011206931,0.7546473,3.047398e-7,0.00025277768,0.00898859,0.0005705775],"about_ca_topic_score_codex":0.011963222,"about_ca_topic_score_gemma":0.00065132556,"teacher_disagreement_score":0.9365842,"about_ca_system_score_codex":0.00017604862,"about_ca_system_score_gemma":0.00028793476,"threshold_uncertainty_score":0.9996374},"labels":[],"label_agreement":null},{"id":"W3139941699","doi":"10.15353/acmla.n167.3645","title":"Spatial Analytics Dashboards: Assisting Researchers to Select the Appropriate Tool","year":2021,"lang":"en","type":"article","venue":"Bulletin - Association of Canadian Map Libraries and Archives (ACMLA)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Dashboard; Analytics; Computer science; Session (web analytics); Context (archaeology); Learning analytics; Visualization; Visual analytics; Curriculum; Data science; Data visualization; Software; World Wide Web; Database; Data mining; Geography","score_opus":0.02007211748605098,"score_gpt":0.21526745532543387,"score_spread":0.1951953378393829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139941699","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009770844,0.00079263805,0.17662592,0.6865483,0.0012060364,0.0012236205,0.00057600474,0.00024721146,0.123009406],"genre_scores_gemma":[0.31417665,0.0009289859,0.49627888,0.018454429,0.00187331,0.00012790377,0.0006613475,0.0001299154,0.1673686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982949,0.00024003406,0.0002698583,0.0003539851,0.00037681987,0.00046440001],"domain_scores_gemma":[0.99859804,0.0005521715,0.00015681915,0.0004015142,0.000050922194,0.00024051312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046276688,0.00013086908,0.00019201121,0.00030694334,0.00044955243,0.00097441307,0.00072347757,0.000045799217,0.00009709565],"category_scores_gemma":[0.0006583205,0.00011586357,0.00006495239,0.000664939,0.000067491324,0.00022901515,0.00052498,0.00019273414,0.000017410246],"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.000031899148,0.000061459396,0.022347776,0.00013157446,0.00043382458,0.000079833044,0.0044184155,0.00021037036,0.0001976489,0.39152595,0.24622288,0.33433837],"study_design_scores_gemma":[0.00026713355,0.0000487947,0.02987672,0.000040289953,0.000019080646,0.0000010886148,0.00038287984,0.009704588,0.0002857594,0.005351319,0.9538094,0.00021294125],"about_ca_topic_score_codex":0.003760941,"about_ca_topic_score_gemma":0.00471689,"teacher_disagreement_score":0.7075865,"about_ca_system_score_codex":0.000035879042,"about_ca_system_score_gemma":0.00040484648,"threshold_uncertainty_score":0.9396287},"labels":[],"label_agreement":null},{"id":"W3144812761","doi":"","title":"A privacy preserving framework for efficient computation of trajectory similarity","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Novelis (Canada)","funders":"","keywords":"Homomorphic encryption; Computation; Trajectory; Similarity (geometry); Computer science; Encryption; Protocol (science); Theoretical computer science; Secure multi-party computation; Algorithm; Image (mathematics); Artificial intelligence; Computer security","score_opus":0.07535874184465109,"score_gpt":0.3173116365152341,"score_spread":0.241952894670583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144812761","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.007360062,0.00003311622,0.9899674,0.00047357124,0.00027997073,0.00027321174,0.0000032351452,0.000100972065,0.0015084747],"genre_scores_gemma":[0.3490836,5.164713e-7,0.65069455,0.000094332325,0.00003419434,0.000008837772,0.000005150974,0.000003279015,0.00007554875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.000024115485,0.00015510689,0.00020430054,0.00022060245,0.00013790063],"domain_scores_gemma":[0.9993355,0.000102373946,0.00006989027,0.00032856915,0.0001050376,0.000058594345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004256338,0.00006474952,0.000098349425,0.00006344645,0.000033573462,0.00008079025,0.00069120247,0.000028670847,0.0000031158083],"category_scores_gemma":[0.0001565641,0.000057036745,0.000037900256,0.00021306697,0.000016159469,0.00028715716,0.0003953735,0.00004429078,0.0000044856524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031519012,0.0006275877,0.00087208825,0.00026041755,0.00006553767,0.0000034895986,0.0037301816,0.041284073,0.000079681915,0.821943,0.025528993,0.105573446],"study_design_scores_gemma":[0.00031140764,0.000079761965,0.000953648,0.000021021098,0.0000049449686,2.4611455e-7,0.00005717885,0.95712805,0.00044349793,0.039118297,0.0017958127,0.000086128064],"about_ca_topic_score_codex":0.000015486054,"about_ca_topic_score_gemma":0.0000012519423,"teacher_disagreement_score":0.91584396,"about_ca_system_score_codex":0.000016897733,"about_ca_system_score_gemma":0.00003231032,"threshold_uncertainty_score":0.2325891},"labels":[],"label_agreement":null},{"id":"W3147597394","doi":"10.5441/002/edbt.2021.42","title":"Efficient Contact Similarity Query over Uncertain Trajectories","year":2021,"lang":"en","type":"article","venue":"Movebank","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Similarity (geometry); Query optimization; Information retrieval; Artificial intelligence","score_opus":0.017696849139547718,"score_gpt":0.2506765952562189,"score_spread":0.23297974611667116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147597394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31663197,0.0009909088,0.640735,0.0030648995,0.0039242324,0.00034848906,0.0000872577,0.000720019,0.03349726],"genre_scores_gemma":[0.9744717,0.000023252369,0.017245516,0.0023672068,0.00026427195,0.000016493319,0.0000593901,0.00001615281,0.0055360203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870765,0.00005975002,0.00017122424,0.00043998624,0.0003282975,0.000293116],"domain_scores_gemma":[0.999037,0.00007642953,0.0000472238,0.00070148165,0.00006718343,0.00007063914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023418662,0.0001355853,0.00015146821,0.000050140978,0.00011480269,0.00040327053,0.00059566996,0.000043180622,0.00014805859],"category_scores_gemma":[0.00006613978,0.00012706476,0.00008169095,0.00040756774,0.000025687454,0.00029145455,0.00045167908,0.000116994495,0.000060987986],"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.000026868755,0.0008985592,0.021632534,0.00014279988,0.0002199522,0.0018061069,0.0013212204,0.0048123216,0.002977684,0.8442246,0.044743523,0.07719384],"study_design_scores_gemma":[0.0019175934,0.00012939337,0.26251876,0.00007117178,0.000036442263,0.000022333907,0.00013040239,0.49941233,0.010650161,0.0085775815,0.21541099,0.0011228509],"about_ca_topic_score_codex":0.00008415195,"about_ca_topic_score_gemma":0.000025397132,"teacher_disagreement_score":0.835647,"about_ca_system_score_codex":0.000050389724,"about_ca_system_score_gemma":0.00006904512,"threshold_uncertainty_score":0.51815504},"labels":[],"label_agreement":null},{"id":"W3149546047","doi":"10.1109/ideas.2007.4318110","title":"The LBF R-tree: Efficient Multidimensional Indexing with Graceful Degradation","year":2007,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Search engine indexing; Computer science; Exploit; Range query (database); Tree (set theory); Curse of dimensionality; Data mining; R-tree; Data structure; Range (aeronautics); Theoretical computer science; Web search query; Information retrieval; Search engine; Artificial intelligence; Sargable; Mathematics; Spatial analysis; Spatial database","score_opus":0.009359691985560319,"score_gpt":0.22604001249685227,"score_spread":0.21668032051129194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149546047","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.023853742,0.00002794018,0.9676623,0.0008490716,0.00021752794,0.00012907939,3.406321e-7,0.00011946702,0.007140581],"genre_scores_gemma":[0.6190305,0.000008136625,0.37176642,0.0006122216,0.000101223086,0.000008044175,0.000016849426,0.00001158074,0.008445059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.000015253973,0.00012841656,0.00023103696,0.000388528,0.00024961348],"domain_scores_gemma":[0.99933445,0.00013874764,0.000051229854,0.00037382374,0.00005181958,0.0000499417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075588573,0.00008350167,0.00004829458,0.00006015243,0.00031258797,0.0001887185,0.0004783106,0.000015561667,0.000005146394],"category_scores_gemma":[0.0000143328125,0.000044797565,0.000018584604,0.00034548301,0.000039692175,0.00029810227,0.00025673234,0.00006948664,0.000051500952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015696765,0.000080162565,0.0012305735,0.0000027615595,0.000021888143,0.000026101357,0.00011381689,0.00059562275,0.00017242834,0.48832655,0.0019284625,0.5074859],"study_design_scores_gemma":[0.0010484437,0.00014713487,0.04971343,0.00002764487,0.000011659583,0.000018756424,0.0003388612,0.84571695,0.0057207863,0.0007115078,0.09611398,0.0004308314],"about_ca_topic_score_codex":0.000025395126,"about_ca_topic_score_gemma":0.00012064924,"teacher_disagreement_score":0.8451213,"about_ca_system_score_codex":0.000021075542,"about_ca_system_score_gemma":0.00001580886,"threshold_uncertainty_score":0.24042057},"labels":[],"label_agreement":null},{"id":"W3151440080","doi":"10.1109/tfuzz.2021.3069332","title":"High-Efficient Fuzzy Querying With HiveQL for Big Data Warehousing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Data Management and Algorithms","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 Alberta","funders":"Qinglan Project of Jiangsu Province of China; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Silesian University of Technology; Amazon Web Services","keywords":"Computer science; Data warehouse; Scalability; Big data; Fuzzy logic; Flexibility (engineering); Database; Data mining; Data transformation; Dimensional modeling; Information retrieval; Artificial intelligence","score_opus":0.06450566782920338,"score_gpt":0.2554359208388662,"score_spread":0.19093025300966282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151440080","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.001390199,0.00014761198,0.98928165,0.00039946995,0.006995152,0.00056077505,0.00033586947,0.0003309338,0.0005583244],"genre_scores_gemma":[0.9609834,0.000029598972,0.03625441,0.00014809445,0.0005115548,0.00013804252,0.00011519954,0.000045008765,0.001774692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772274,0.00009456547,0.00034665383,0.00092893577,0.00047571555,0.00043141175],"domain_scores_gemma":[0.9974425,0.00015559618,0.00012091351,0.0020129052,0.0001508878,0.00011720489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041523052,0.00024227756,0.0003085267,0.00021206825,0.00047307851,0.0007244107,0.0012365914,0.00006059133,0.000002335199],"category_scores_gemma":[0.000005739537,0.00021282857,0.000071376155,0.0007276919,0.00003799269,0.0006611288,0.000026267904,0.00016512725,0.00005086465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010866475,0.0014461103,0.000015707217,0.00093372824,0.0006676181,0.00045779138,0.00092943973,0.5592084,0.0026567017,0.011752072,0.008985487,0.41283825],"study_design_scores_gemma":[0.0044903336,0.00057607,0.000054014698,0.0012308051,0.00036543419,0.0002359178,0.0016782035,0.9187281,0.016541062,0.0002750392,0.05395397,0.0018710467],"about_ca_topic_score_codex":0.00021862607,"about_ca_topic_score_gemma":0.000093036775,"teacher_disagreement_score":0.9595932,"about_ca_system_score_codex":0.000085390544,"about_ca_system_score_gemma":0.00013660717,"threshold_uncertainty_score":0.86788976},"labels":[],"label_agreement":null},{"id":"W3165145967","doi":"10.1007/978-3-030-75075-6_13","title":"Triangle Enumeration for Billion-Scale Graphs in RDBMS","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Data Management and Algorithms","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 Victoria","funders":"","keywords":"Relational database management system; Computer science; Enumeration; Graph; Analytics; Relational database; Graph database; Theoretical computer science; Database; Discrete mathematics; Mathematics","score_opus":0.01804466850158521,"score_gpt":0.22600514477976677,"score_spread":0.20796047627818157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165145967","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.000016631073,0.012676989,0.97944826,0.0002377269,0.002003954,0.000860775,0.000017316946,0.00004143007,0.004696939],"genre_scores_gemma":[0.69816273,0.025954224,0.0653763,0.003996832,0.015368054,0.0019474793,0.006202353,0.00065926963,0.18233275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984229,0.00004741811,0.0004561317,0.0006167476,0.00018040751,0.00027637443],"domain_scores_gemma":[0.999,0.00028340655,0.00016971,0.0004543072,0.000045889763,0.000046664205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005104752,0.0002733007,0.0005205072,0.00027825453,0.000069375295,0.00047403944,0.0003589924,0.0003503857,0.0000054763996],"category_scores_gemma":[0.000019351197,0.00023720917,0.00009985379,0.00018646917,0.000024585152,0.00021723237,0.0001541505,0.00028792277,0.0000014513886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034196033,0.00006113714,0.00041659386,0.00057029055,0.00012182751,0.00014078368,0.0004831281,0.08431223,0.000011677115,0.3431242,0.0029512546,0.5677727],"study_design_scores_gemma":[0.0008483614,0.00009283606,0.000056075438,0.0009048508,0.00002017477,0.000011226316,0.0000048201396,0.8857327,0.0000034406378,0.021967713,0.08984958,0.00050822954],"about_ca_topic_score_codex":0.00006328415,"about_ca_topic_score_gemma":0.0005193994,"teacher_disagreement_score":0.9140719,"about_ca_system_score_codex":0.000039922714,"about_ca_system_score_gemma":0.000023401975,"threshold_uncertainty_score":0.9673109},"labels":[],"label_agreement":null},{"id":"W3167470018","doi":"10.1145/3448611","title":"Random Graph-based Multiple Instance Learning for Structured IoT Smart City Applications","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Internet Technology","topic":"Data Management and Algorithms","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":"St. Francis Xavier University; University of Guelph","funders":"","keywords":"Computer science; Probabilistic logic; Theoretical computer science; Core (optical fiber); Graph; Substructure; Random graph; Clustering coefficient; Artificial intelligence; Data mining; Cluster analysis","score_opus":0.01569730639367877,"score_gpt":0.24729888884886145,"score_spread":0.23160158245518267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167470018","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.002664806,0.00006507627,0.9920492,0.0036018533,0.00029017057,0.00045218348,0.000027964916,0.00074490154,0.00010382987],"genre_scores_gemma":[0.756019,0.000015804115,0.2423866,0.00032829313,0.000012865917,0.0004636556,0.00003910431,0.000012830186,0.0007218405],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998783,0.000032875312,0.00023065331,0.00056178524,0.00012292954,0.0002687578],"domain_scores_gemma":[0.9984854,0.00021381232,0.00008041179,0.0010606102,0.000119357734,0.000040439794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009561631,0.00015901598,0.00020069742,0.00038746145,0.00019983081,0.00010024563,0.0013330949,0.00014109723,0.00004631309],"category_scores_gemma":[0.00009194734,0.0001667571,0.00012382714,0.0010376617,0.00010086637,0.00015444512,0.00005004596,0.00034525196,0.00001998416],"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.00008661616,0.0003552067,0.0009833976,0.000042021195,0.00019034732,0.000014770827,0.0000745717,0.0044137887,0.0019772057,0.025623903,0.00070336316,0.9655348],"study_design_scores_gemma":[0.0075782444,0.0004220744,0.0003894079,0.000076127784,0.00008287044,0.000029200814,0.00016887477,0.2588605,0.21554796,0.050832774,0.4652661,0.00074587594],"about_ca_topic_score_codex":0.000015442341,"about_ca_topic_score_gemma":0.00020269112,"teacher_disagreement_score":0.9647889,"about_ca_system_score_codex":0.00003999244,"about_ca_system_score_gemma":0.000038058544,"threshold_uncertainty_score":0.68001574},"labels":[],"label_agreement":null},{"id":"W3167861891","doi":"10.1145/3447548.3467359","title":"Graph Summarization with Controlled Utility Loss","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Victoria","funders":"","keywords":"Automatic summarization; Computer science; Scalability; Theoretical computer science; Graph; Lossless compression; PageRank; Algorithm; Artificial intelligence; Data compression","score_opus":0.010159320837887691,"score_gpt":0.21190662867919735,"score_spread":0.20174730784130965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167861891","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.0014161632,0.000024083805,0.9581887,0.0011136127,0.00011225701,0.00010024807,0.000001177471,0.00012482938,0.038918935],"genre_scores_gemma":[0.8557307,0.000033984066,0.1272482,0.0012498215,0.000052168714,0.000019659825,0.000076125696,0.0000065491004,0.015582791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934435,0.000033285356,0.00009379421,0.00024274472,0.00016748326,0.00011833367],"domain_scores_gemma":[0.99941355,0.000026149795,0.000027640273,0.00041887574,0.00008012144,0.000033691853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000142944,0.00006084623,0.0001058188,0.000032932778,0.00005595939,0.00023476552,0.0003003128,0.000013104047,0.00010491225],"category_scores_gemma":[0.00001532611,0.000042530777,0.000028042414,0.00040738343,0.000019316509,0.00055502425,0.00017430686,0.00003098986,0.000028149232],"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.000064981534,0.0003113489,0.016562367,0.000025338288,0.00015417243,0.00026438734,0.00012346721,0.000041509156,0.00008455557,0.8591782,0.0091946265,0.11399509],"study_design_scores_gemma":[0.023715936,0.000268834,0.06256407,0.00004937008,0.000101887854,0.000040627085,0.00024404521,0.76230615,0.0070942254,0.050016876,0.09242552,0.0011724548],"about_ca_topic_score_codex":0.00001082135,"about_ca_topic_score_gemma":0.000027661272,"teacher_disagreement_score":0.85431457,"about_ca_system_score_codex":0.0000038783996,"about_ca_system_score_gemma":0.000027236563,"threshold_uncertainty_score":0.22638494},"labels":[],"label_agreement":null},{"id":"W3169048261","doi":"10.21428/594757db.efb4fcff","title":"Driving Scene Understanding: How much temporal context and spatial resolution is necessary?","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 British Columbia; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Variety (cybernetics); Context (archaeology); Metadata; Field (mathematics); Modalities; Spatial contextual awareness; Modality (human–computer interaction); Human–computer interaction; Action (physics); Artificial intelligence; Data science; Computer vision; World Wide Web; Geography","score_opus":0.04808237679590738,"score_gpt":0.24879006744626672,"score_spread":0.20070769065035934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169048261","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.002043358,0.00011939831,0.9733901,0.018761016,0.0002907869,0.000065682885,0.0000020665777,0.00010469646,0.005222878],"genre_scores_gemma":[0.9709949,0.000043373264,0.024082141,0.0007336685,0.000073068884,0.0000016546019,0.000016670909,0.0000049437126,0.004049618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990665,0.000036571888,0.00009979143,0.00037867075,0.00021512381,0.00020337095],"domain_scores_gemma":[0.99948764,0.000029362138,0.0000432976,0.00033401558,0.00003502428,0.000070653885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017046147,0.000096333424,0.00010623603,0.00006171777,0.00016479593,0.0007596268,0.00028687998,0.000032027885,0.00005944633],"category_scores_gemma":[0.000020753798,0.000090286994,0.000026690577,0.00023898287,0.000037705635,0.0010435982,0.0005796338,0.00006548907,0.0000110779565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007170927,0.0001323299,0.025675902,0.000053792395,0.00009484196,0.00023683194,0.000961279,0.0000022699787,0.00061844935,0.5299756,0.1749635,0.26727802],"study_design_scores_gemma":[0.0015956635,0.00012595927,0.0063383374,0.00008843607,0.000023995834,0.000031559288,0.004268208,0.9037234,0.0053112446,0.028072335,0.04976648,0.0006543403],"about_ca_topic_score_codex":0.00016458893,"about_ca_topic_score_gemma":0.00049627386,"teacher_disagreement_score":0.9689515,"about_ca_system_score_codex":0.000042897496,"about_ca_system_score_gemma":0.00003000947,"threshold_uncertainty_score":0.73250985},"labels":[],"label_agreement":null},{"id":"W3172623769","doi":"10.1145/3451159","title":"Graph Indexing for Efficient Evaluation of Label-constrained Reachability Queries","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Computer science; Vertex (graph theory); Search engine indexing; Transitive closure; Combinatorics; Graph; Theoretical computer science; Discrete mathematics; Mathematics; Information retrieval","score_opus":0.06869570056074788,"score_gpt":0.31231993113975526,"score_spread":0.2436242305790074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172623769","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.008771741,0.00014588065,0.98769695,0.00030312815,0.0009872316,0.0007476862,0.0009864005,0.000095355936,0.0002656474],"genre_scores_gemma":[0.92510027,0.000017880031,0.07392434,0.00003331338,0.00004246864,0.0003211238,0.00038139563,0.000012020295,0.00016717747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980745,0.00023527484,0.0003884325,0.0004942946,0.00060482573,0.00020270809],"domain_scores_gemma":[0.9974092,0.00026920994,0.00012584918,0.001737981,0.0004003355,0.000057400863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020407997,0.00013577375,0.00020719548,0.00017023853,0.00018077352,0.000113639464,0.00059961376,0.000040773146,0.000017799006],"category_scores_gemma":[0.00018964923,0.00013325983,0.00008556974,0.0006016582,0.00006142744,0.00045419598,0.000039101706,0.00009076017,0.000005651945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010007975,0.0029554563,0.000114156355,0.00200018,0.00068578176,0.000019735517,0.0018205876,0.061248068,0.014671631,0.14905459,0.00090929074,0.7664204],"study_design_scores_gemma":[0.0031149425,0.00018901909,0.00017523709,0.00042589408,0.00025222223,0.000021194806,0.0015114158,0.9653699,0.022258537,0.0017218023,0.004492366,0.00046748485],"about_ca_topic_score_codex":0.0001316686,"about_ca_topic_score_gemma":0.000053816122,"teacher_disagreement_score":0.91632855,"about_ca_system_score_codex":0.000058026908,"about_ca_system_score_gemma":0.00015914126,"threshold_uncertainty_score":0.5434178},"labels":[],"label_agreement":null},{"id":"W3174896615","doi":"10.1145/3448016.3457269","title":"Distributed Stream KNN Join","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Join (topology); Computer science; Data stream mining; Operator (biology); Streaming data; Distributed computing; Data stream; Data mining","score_opus":0.015247584946159742,"score_gpt":0.23047074184687047,"score_spread":0.21522315690071073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174896615","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.0006228624,0.000024690926,0.96356195,0.002584412,0.00022156152,0.000028103663,0.0000149945035,0.0001888605,0.03275257],"genre_scores_gemma":[0.36637104,0.00009815894,0.53417814,0.0039648847,0.0003469153,0.000019397956,0.0010787923,0.000019034582,0.09392363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99944115,0.000014093377,0.000075107426,0.00021162455,0.00012185373,0.00013618506],"domain_scores_gemma":[0.99944556,0.000014033222,0.000014116931,0.00045324242,0.000031185675,0.000041891744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057547684,0.000051335574,0.000055170352,0.000018894438,0.000040853854,0.0002528024,0.00042680005,0.000012115688,0.00020119523],"category_scores_gemma":[0.000015123119,0.000044209006,0.00002566478,0.00031132266,0.000007792134,0.00045298145,0.00049607997,0.00003254331,0.0002697687],"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":[3.8329296e-7,0.00011026792,0.0005153396,0.000006917963,0.000023428049,0.00019441676,0.00002572845,0.000007793135,0.00016438447,0.6329458,0.16544324,0.2005623],"study_design_scores_gemma":[0.0007616675,0.00005113674,0.013478404,0.000016319356,0.000012791105,0.000021553158,0.000125706,0.14551549,0.017899808,0.015572994,0.8060451,0.000498997],"about_ca_topic_score_codex":0.0000104447945,"about_ca_topic_score_gemma":0.000009982672,"teacher_disagreement_score":0.6406019,"about_ca_system_score_codex":0.000007952609,"about_ca_system_score_gemma":0.000018699186,"threshold_uncertainty_score":0.3467421},"labels":[],"label_agreement":null},{"id":"W3179597376","doi":"10.1111/tgis.12787","title":"Building <i>k</i>‐partite association graphs for finding recommendation patterns from questionnaire data","year":2021,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Cisco Systems","keywords":"Association rule learning; Recommender system; Computer science; Centrality; Data mining; Apriori algorithm; Graph; Association (psychology); Information retrieval; Theoretical computer science; Data science; Mathematics; Combinatorics; Psychology","score_opus":0.04648396684555205,"score_gpt":0.30733263696219226,"score_spread":0.2608486701166402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179597376","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.0040264656,0.000030841966,0.99036133,0.003914276,0.0009172451,0.00013101041,0.0004377526,0.00010489234,0.00007620801],"genre_scores_gemma":[0.63206756,0.00025416832,0.36438182,0.00044582054,0.00013862719,0.000094136,0.002043934,0.000019335657,0.0005546237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989377,0.00006620081,0.00022865643,0.0004383156,0.0001385799,0.00019052933],"domain_scores_gemma":[0.9991478,0.00014309764,0.00008632074,0.00054253725,0.0000504861,0.000029796269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042394825,0.0000872218,0.0001054017,0.000123858,0.00015922236,0.0002686022,0.0005200242,0.000050722883,0.000083976796],"category_scores_gemma":[0.00005444252,0.00010480348,0.00004098708,0.00040311008,0.0000047416925,0.0019436879,0.000056735105,0.000113609356,0.000008874227],"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.0000054957445,0.0002304618,0.01030109,0.00004167665,0.00011773504,0.0000082221895,0.00047459244,0.00059521216,0.00066121755,0.009368481,0.0025779144,0.9756179],"study_design_scores_gemma":[0.002253941,0.000049474478,0.039429057,0.0003558932,0.00014612902,0.000003712407,0.00017122574,0.8096005,0.007228813,0.030596858,0.1093966,0.0007678494],"about_ca_topic_score_codex":0.00024993636,"about_ca_topic_score_gemma":0.000816428,"teacher_disagreement_score":0.97485006,"about_ca_system_score_codex":0.00011563202,"about_ca_system_score_gemma":0.00002959045,"threshold_uncertainty_score":0.4273762},"labels":[],"label_agreement":null},{"id":"W3181666189","doi":"10.1109/mdm52706.2021.00022","title":"Efficient Spatio-Textual Similarity Join Processing on NUMA Systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Exploit; Similarity (geometry); Join (topology); Context (archaeology); Architecture; Theoretical computer science; Distributed computing; Parallel computing; Artificial intelligence; Image (mathematics)","score_opus":0.02463191388345858,"score_gpt":0.24975612677665152,"score_spread":0.22512421289319293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181666189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074967425,0.00011592184,0.92894846,0.0012257244,0.000593076,0.00015568378,0.0000055684495,0.00030117136,0.061157625],"genre_scores_gemma":[0.9706471,0.000003415796,0.022492433,0.000740777,0.00014843968,0.000011746204,0.00003027979,0.000008419329,0.00591739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987415,0.000048756483,0.00017380406,0.00042260916,0.00038316866,0.00023018074],"domain_scores_gemma":[0.99926746,0.000030843526,0.00005172241,0.00050069357,0.00008627064,0.00006299085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025711686,0.00010852888,0.000118630065,0.00006142651,0.00014718373,0.0007853209,0.00050448807,0.00002904091,0.000042760177],"category_scores_gemma":[0.000030703948,0.00009180261,0.000033518016,0.00040907683,0.000016105225,0.00022144816,0.0003913363,0.00008585201,0.00019640663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054048023,0.00079346297,0.00044305826,0.00023057095,0.000037756927,0.0003491908,0.0004994172,0.020303123,0.00016435441,0.65100044,0.030092262,0.29608095],"study_design_scores_gemma":[0.00020363553,0.00003090802,0.0006684954,0.000048715254,0.000003770085,0.000006192861,0.00014412732,0.9833671,0.0005262366,0.00013595239,0.014701415,0.0001634799],"about_ca_topic_score_codex":0.000022394976,"about_ca_topic_score_gemma":0.000008491118,"teacher_disagreement_score":0.9631504,"about_ca_system_score_codex":0.000033060238,"about_ca_system_score_gemma":0.00005548764,"threshold_uncertainty_score":0.7572867},"labels":[],"label_agreement":null},{"id":"W3184011463","doi":"10.14778/3476249.3476263","title":"LES <sup>3</sup>","year":2021,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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; York University","funders":"","keywords":"Search engine indexing; Computer science; Set (abstract data type); Pruning; Similarity (geometry); Bitmap; Nearest neighbor search; Representation (politics); Data mining; Encoding (memory); Theoretical computer science; Artificial intelligence","score_opus":0.01984668302522739,"score_gpt":0.22997774859488967,"score_spread":0.2101310655696623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184011463","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.34659728,0.0020105797,0.03541348,0.045955215,0.0020503171,0.0019012189,0.000046191602,0.00096238375,0.56506336],"genre_scores_gemma":[0.94843084,0.00010246688,0.043038886,0.0005595953,0.00013872118,0.000036563895,0.0000027973247,0.000013516567,0.0076766056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894786,0.000004928912,0.00018116944,0.00029035614,0.0003673373,0.0002083744],"domain_scores_gemma":[0.99945295,0.000016022357,0.00010180446,0.0002522951,0.00013601128,0.000040902294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020417517,0.00010676496,0.000121298144,0.0000437259,0.00011113545,0.00019065813,0.0013533733,0.000022704799,0.0000346441],"category_scores_gemma":[0.00004950829,0.00007519621,0.000088331086,0.00040427956,0.00003617477,0.00048015616,0.0014690756,0.00008473796,0.000020600184],"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.0000049259834,0.0002914217,0.0039258767,0.00017901765,0.0001239182,0.000006568027,0.001500877,0.00008233967,0.00863394,0.7888961,0.035746675,0.16060835],"study_design_scores_gemma":[0.0017072883,0.00015627303,0.0068930225,0.00031996964,0.000100060424,0.00005638725,0.0017209504,0.049378242,0.5445997,0.044723555,0.3495947,0.0007498518],"about_ca_topic_score_codex":0.000023651035,"about_ca_topic_score_gemma":6.1175916e-7,"teacher_disagreement_score":0.7441725,"about_ca_system_score_codex":0.000031404317,"about_ca_system_score_gemma":0.000017344935,"threshold_uncertainty_score":0.30664122},"labels":[],"label_agreement":null},{"id":"W3185489179","doi":"10.1016/j.comnet.2021.108337","title":"On the prediction of large-scale road-network constrained trajectories","year":2021,"lang":"en","type":"article","venue":"Computer Networks","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs","keywords":"Computer science; Trajectory; Cluster analysis; Data mining; Scale (ratio); Train; Hierarchical clustering; Machine learning; Artificial intelligence","score_opus":0.012205791133143457,"score_gpt":0.2113775098579765,"score_spread":0.19917171872483302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185489179","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.0015318737,0.0001782651,0.99180526,0.0006739433,0.0025413868,0.00013896059,0.000013059661,0.00014078595,0.0029764818],"genre_scores_gemma":[0.8829774,0.00014078409,0.10863072,0.0033990894,0.0036744613,0.000033062977,0.0001916213,0.000029901967,0.0009229105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867797,0.00012684452,0.00025743243,0.00036451482,0.00024223744,0.00033098235],"domain_scores_gemma":[0.99878734,0.00020694538,0.00009949648,0.0007679529,0.00008741843,0.00005083368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035964185,0.00014358183,0.00018528552,0.00002849681,0.00017598135,0.00018760224,0.0007655685,0.000059024314,0.000042341195],"category_scores_gemma":[0.000009115597,0.00010819807,0.00009307767,0.0005624769,0.00006639917,0.00025067426,0.0005096271,0.00018546537,0.0000100173365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012587581,0.00027626855,0.0010526952,0.000024301191,0.00018631753,0.000060679544,0.0006921118,0.110765465,0.0000073680153,0.46947694,0.23440681,0.18303846],"study_design_scores_gemma":[0.00028902307,0.000079509475,0.0038886736,0.00006204181,0.000010801967,0.0000061227142,0.000016433163,0.9806662,0.000039051425,0.002687342,0.012147259,0.00010750516],"about_ca_topic_score_codex":0.0000019233878,"about_ca_topic_score_gemma":0.0000053916715,"teacher_disagreement_score":0.88317454,"about_ca_system_score_codex":0.000012481116,"about_ca_system_score_gemma":0.000029865423,"threshold_uncertainty_score":0.44121894},"labels":[],"label_agreement":null},{"id":"W318551555","doi":"10.1007/978-3-662-43984-5_26","title":"A Hybrid Scale-Out Cloud-Based Data Service for Worldwide Sensors","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Cloud computing; Scalability; Geospatial analysis; Computer science; Construct (python library); Search engine indexing; Distributed computing; Scale (ratio); Service (business); Architecture; Tree (set theory); Volume (thermodynamics); Data science; Database; Geography; Remote sensing; Computer network; World Wide Web; Cartography; Operating system","score_opus":0.031971041188222526,"score_gpt":0.2619694287126282,"score_spread":0.22999838752440566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W318551555","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.000014924317,0.00010303623,0.98909014,0.004161916,0.0038847649,0.00086448784,0.00016620265,0.000303377,0.0014111664],"genre_scores_gemma":[0.0040333783,0.00001274494,0.98097855,0.011160896,0.0017832501,0.000024480947,0.00040231628,0.00007639297,0.0015279904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941825,0.000046246096,0.00064067025,0.002979161,0.0011668998,0.0009844918],"domain_scores_gemma":[0.9926824,0.0008585245,0.0004014424,0.0054952973,0.0003198577,0.00024248219],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001957644,0.0007199434,0.0006949783,0.00086152746,0.00035280196,0.0013863245,0.013769126,0.00017534214,0.000016578897],"category_scores_gemma":[0.00012204496,0.0006726858,0.00013792705,0.0005519401,0.00041430746,0.0010483215,0.0053104926,0.0005862159,0.00014546457],"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.000017266182,0.00004436599,0.000014683843,0.00023626791,0.000028347265,0.000068027046,0.00016012492,0.021629205,0.000031961412,0.010171843,0.002442396,0.9651555],"study_design_scores_gemma":[0.00048709655,0.00009352063,0.000009129816,0.000335582,0.000023479657,0.0000133165095,6.571935e-8,0.8880533,0.0004984471,0.032515712,0.07718881,0.00078154047],"about_ca_topic_score_codex":0.000028287706,"about_ca_topic_score_gemma":0.00026826322,"teacher_disagreement_score":0.96437395,"about_ca_system_score_codex":0.00015952173,"about_ca_system_score_gemma":0.00043044577,"threshold_uncertainty_score":0.99965036},"labels":[],"label_agreement":null},{"id":"W31871017","doi":"10.1136/jech-2019-213357","title":"Heuristics to Site Observers in a Terrain Represented by a Digital Elevation Matrix.","year":2010,"lang":"en","type":"article","venue":"Brazilian Symposium on GeoInformatics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":7,"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":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Canadian Institutes of Health Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canada Research Chairs","keywords":"Digital elevation model; Elevation (ballistics); Terrain; Heuristics; Computer science; Matrix (chemical analysis); Remote sensing; Geography; Mathematics; Cartography","score_opus":0.005176499113223808,"score_gpt":0.2362771326221698,"score_spread":0.23110063350894597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31871017","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.5905159,0.000009106431,0.34997046,0.011054778,0.00228294,0.0022841357,0.00063052675,0.00092959317,0.042322587],"genre_scores_gemma":[0.88101393,0.000021359909,0.099863656,0.005243012,0.0002428296,0.00010447279,0.0013114145,0.000068654015,0.012130693],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812126,0.000016858035,0.0005830488,0.0003213646,0.0005063191,0.0004511326],"domain_scores_gemma":[0.99843854,0.0000789052,0.00016210917,0.0010637052,0.00006204643,0.0001947147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003503281,0.00023061402,0.00019994067,0.0003630846,0.000089976034,0.00097190513,0.0011606797,0.000087126995,0.000013561966],"category_scores_gemma":[0.0001723719,0.00022820916,0.00005984562,0.00075735745,0.000032852506,0.0024555468,0.00051869196,0.0002548489,0.000585558],"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.00017966397,0.001570508,0.026318502,0.0005723732,0.00012664185,0.00017436703,0.019841744,0.0052774944,0.007404874,0.10241031,0.6792303,0.15689325],"study_design_scores_gemma":[0.001648956,0.00036852225,0.006328513,0.00009645358,0.000010919091,0.000018132574,0.00028431517,0.705602,0.00063199195,0.0009053114,0.2831884,0.0009165097],"about_ca_topic_score_codex":0.000033277505,"about_ca_topic_score_gemma":0.00004605737,"teacher_disagreement_score":0.7003245,"about_ca_system_score_codex":0.000048384685,"about_ca_system_score_gemma":0.00003497804,"threshold_uncertainty_score":0.9372104},"labels":[],"label_agreement":null},{"id":"W3188162669","doi":"10.30564/aia.v3i2.3219","title":"A New Approach of Intelligent Data Retrieval Paradigm","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence Advances","topic":"Data Management and Algorithms","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 Ottawa","funders":"National Institute of Standards and Technology; University of Ottawa","keywords":"Computer science; Ranking (information retrieval); Rank (graph theory); Information retrieval; Focus (optics); Learning to rank; Scheme (mathematics); Raw data; Resource (disambiguation); Data mining","score_opus":0.12242496522354752,"score_gpt":0.3434368944768644,"score_spread":0.22101192925331686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188162669","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.00014830107,0.0028851063,0.99159294,0.0007715041,0.0006953506,0.00013070674,0.000016863962,0.00008534943,0.0036739036],"genre_scores_gemma":[0.09784024,0.003762218,0.89603657,0.00030241738,0.00047269225,0.000005197692,0.00027250184,0.00002312179,0.0012850587],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977603,0.000066219196,0.00054856634,0.0008457772,0.00045210004,0.00032703253],"domain_scores_gemma":[0.9975632,0.00013593677,0.00017224156,0.0019143076,0.000091020935,0.00012332934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047134762,0.00016995423,0.0002541017,0.0000973027,0.000088690096,0.00023049657,0.0030483895,0.000042742635,0.00013217104],"category_scores_gemma":[0.00023368775,0.00016231768,0.000064116095,0.0011929118,0.00009473382,0.0023543662,0.0014751997,0.00013318125,0.00022079334],"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.0000101840715,0.00010458849,0.000020756152,0.000020022628,0.000020158126,0.000017101856,0.00017411342,0.00026869914,0.00018471037,0.37833512,0.0005419062,0.6203026],"study_design_scores_gemma":[0.00004228066,0.00009043505,0.000024330242,0.000053458527,0.000032367167,0.000014431772,0.00089680613,0.19129317,0.2600226,0.42604747,0.1210048,0.0004778519],"about_ca_topic_score_codex":0.000043895518,"about_ca_topic_score_gemma":0.00003122329,"teacher_disagreement_score":0.61982477,"about_ca_system_score_codex":0.000016554855,"about_ca_system_score_gemma":0.00016499346,"threshold_uncertainty_score":0.66191226},"labels":[],"label_agreement":null},{"id":"W3193719172","doi":"10.1145/3468791.3468818","title":"NIR-Tree: A Non-Intersecting R-Tree","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Bounding overwatch; Computer science; Search engine indexing; Tree (set theory); Range query (database); R-tree; B-tree; Range (aeronautics); Point (geometry); Interval tree; K-ary tree; Database index; Segment tree; Range tree; Data mining; Data structure; Access method; Binary tree; Tree structure; Algorithm; Spatial database; Mathematics; Information retrieval; Database; Artificial intelligence; Combinatorics; Spatial analysis; Search engine; Statistics; Web search query; Sargable","score_opus":0.013261753570778207,"score_gpt":0.2352353544712552,"score_spread":0.221973600900477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193719172","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.0016956041,0.000022658307,0.75209314,0.0013566562,0.0005288989,0.000040487903,6.5282967e-7,0.0001661149,0.24409576],"genre_scores_gemma":[0.45007154,0.000021107717,0.45128983,0.0031747483,0.00034912766,0.000012950208,0.000025084726,0.000017304932,0.09503831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991372,0.000016831003,0.000119909346,0.00034370617,0.00016412407,0.00021817916],"domain_scores_gemma":[0.99928284,0.000030419775,0.000028478158,0.00056294777,0.00004208137,0.0000532452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013584192,0.00008429009,0.00008714192,0.00005093387,0.000071161376,0.00037726457,0.0006827671,0.000018341187,0.000118296004],"category_scores_gemma":[0.000024457411,0.000075905424,0.00005093191,0.00038043442,0.000010453294,0.0007398742,0.00093702966,0.000070052076,0.00037693276],"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.0000011161032,0.00009112732,0.0008656006,0.000019460906,0.000046024874,0.0003845592,0.0004001644,0.000005961008,0.0013726935,0.048815064,0.070812725,0.8771855],"study_design_scores_gemma":[0.0017683451,0.00015957771,0.011286941,0.00011638996,0.000032303866,0.00011023548,0.0018514206,0.6333952,0.04520246,0.0074782125,0.29736704,0.0012318922],"about_ca_topic_score_codex":0.00003062744,"about_ca_topic_score_gemma":0.000094748226,"teacher_disagreement_score":0.8759536,"about_ca_system_score_codex":0.00001371229,"about_ca_system_score_gemma":0.000029038234,"threshold_uncertainty_score":0.48448336},"labels":[],"label_agreement":null},{"id":"W3194145758","doi":"10.1145/3469830.3470892","title":"SPRIG: A Learned Spatial Index for Range and kNN Queries","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Spatial query; Data mining; Spatial database; Overhead (engineering); Index (typography); Spatial analysis; Interpolation (computer graphics); Range (aeronautics); Grid; Range query (database); Exploit; Function (biology); Process (computing); Multivariate interpolation; Information retrieval; Artificial intelligence; Sargable; Web search query; Geography; Remote sensing","score_opus":0.023078580823026443,"score_gpt":0.2549051005605764,"score_spread":0.23182651973754997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194145758","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.001402108,0.000059553284,0.9900053,0.00316222,0.00019141403,0.000099159995,0.0000034872498,0.000080438316,0.004996281],"genre_scores_gemma":[0.52685773,0.00015746175,0.41470414,0.0030932731,0.00043839612,0.00007597991,0.000053586726,0.000020929481,0.05459848],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947184,0.000012091057,0.000071081355,0.00023176342,0.00008769943,0.00012552219],"domain_scores_gemma":[0.9996503,0.000032261843,0.00001692993,0.0002354193,0.000032019398,0.000033061147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100069126,0.000056795325,0.000074454765,0.000028134693,0.000062924,0.00028305568,0.00020884004,0.00001777198,0.000048580867],"category_scores_gemma":[0.000026374048,0.000049210637,0.00002170786,0.0001000474,0.00002003454,0.00045847808,0.00035497762,0.000027044156,0.00001275308],"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.000009502519,0.00004218278,0.0022857597,0.00003891162,0.000026603422,0.000028468437,0.00020777935,0.0000014861312,0.000090012116,0.3100112,0.00819481,0.6790633],"study_design_scores_gemma":[0.00253891,0.00015973058,0.02198631,0.000020276908,0.000018213781,0.000013228113,0.00022032455,0.25511408,0.003173621,0.026724322,0.6895306,0.00050033873],"about_ca_topic_score_codex":0.00007233783,"about_ca_topic_score_gemma":0.00016449897,"teacher_disagreement_score":0.6813358,"about_ca_system_score_codex":0.0000037857715,"about_ca_system_score_gemma":0.000018992501,"threshold_uncertainty_score":0.27295125},"labels":[],"label_agreement":null},{"id":"W3204354173","doi":"","title":"Enabling NUMA-aware Main Memory Spatial Join Processing: An Experimental Study.","year":2020,"lang":"en","type":"article","venue":"Very Large Data Bases","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Join (topology); Parallel computing; Computer architecture","score_opus":0.08098202661924112,"score_gpt":0.3075131336643204,"score_spread":0.2265311070450793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204354173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15996343,0.0009747074,0.8276687,0.0018349919,0.0012077397,0.0015285838,0.0047095367,0.001511191,0.00060110743],"genre_scores_gemma":[0.986749,0.000006890447,0.008129829,0.0016957948,0.00055067556,0.000021225957,0.0027515693,0.000024138953,0.00007086087],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977088,0.00012255544,0.00026605686,0.0010193817,0.00048585836,0.0003973403],"domain_scores_gemma":[0.99814177,0.000028192751,0.00009303888,0.0015196088,0.000025570858,0.0001918144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004210277,0.00022103664,0.00021380009,0.00008517055,0.0002815753,0.00085243135,0.0031998993,0.000028958306,0.00014762295],"category_scores_gemma":[0.00006305146,0.00020843893,0.000028634708,0.00039405975,0.000026765318,0.005453504,0.0036838602,0.00013059175,0.00010541449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003844718,0.023596423,0.01052692,0.0007274693,0.00043434548,0.006630842,0.0206987,0.00012902704,0.011021846,0.0029079563,0.49288625,0.43005574],"study_design_scores_gemma":[0.0029775782,0.0012524615,0.00077176245,0.00006591137,0.000061021365,0.000012315651,0.011482479,0.8866907,0.0068654157,0.000037122776,0.08867477,0.0011085027],"about_ca_topic_score_codex":0.00010561502,"about_ca_topic_score_gemma":0.000054338998,"teacher_disagreement_score":0.88656163,"about_ca_system_score_codex":0.000021385618,"about_ca_system_score_gemma":0.00008053022,"threshold_uncertainty_score":0.8499893},"labels":[],"label_agreement":null},{"id":"W3207367190","doi":"10.20382/jocg.v12i1a4","title":"Walking the dog fast in practice: Algorithm engineering of the Fréchet distance","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","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":"Algorithm; Mathematics; Similarity (geometry); Bottleneck; Distance measures; Data structure; Measure (data warehouse); Benchmark (surveying); Computer science; Quadratic equation; Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.0057959754496999015,"score_gpt":0.20680898383789056,"score_spread":0.20101300838819067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207367190","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.012520314,0.00019031158,0.9832496,0.0023924683,0.00051684876,0.00005185031,0.0000077795185,0.000008064069,0.0010627479],"genre_scores_gemma":[0.6911738,0.00011807139,0.30713186,0.0004071028,0.0001985954,1.6576455e-7,0.000006288814,0.000011199003,0.00095295196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882317,0.000110948546,0.00025850246,0.0001304766,0.00054470054,0.00013221709],"domain_scores_gemma":[0.9985412,0.00044659196,0.00038202785,0.00021018878,0.0003819542,0.000038040656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004404256,0.00008563399,0.00014894112,0.0003341169,0.000083245875,0.00009867227,0.001039555,0.000026751499,0.0000070893525],"category_scores_gemma":[0.00014506995,0.00006429865,0.00011332532,0.0022638137,0.000038391976,0.00111093,0.0004283216,0.00027310778,0.000001205288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026889687,0.00042763655,0.0034325437,0.00006625863,0.00046272035,0.001336896,0.0013116495,0.6019498,0.0002185678,0.20728418,0.0011968755,0.18228596],"study_design_scores_gemma":[0.0025687523,0.00013246345,0.11163796,0.00041257995,0.0001490365,0.0004757829,0.0030743787,0.6912237,0.0007904075,0.0044105686,0.18465488,0.00046950954],"about_ca_topic_score_codex":0.0000058508276,"about_ca_topic_score_gemma":0.0000016855488,"teacher_disagreement_score":0.6786535,"about_ca_system_score_codex":0.00009569325,"about_ca_system_score_gemma":0.0001499158,"threshold_uncertainty_score":0.2622023},"labels":[],"label_agreement":null},{"id":"W3209525680","doi":"10.1016/j.knosys.2021.107623","title":"Enabling the interpretability of pretrained venue representations using semantic categories","year":2021,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Data Management and Algorithms","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":"York University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China; Shandong University","keywords":"Interpretability; Computer science; Representation (politics); Semantics (computer science); Embedding; Feature (linguistics); Similarity (geometry); Focus (optics); Artificial intelligence; Popularity; Dimension (graph theory); Natural language processing; Information retrieval; Linguistics; Mathematics","score_opus":0.03900939636961332,"score_gpt":0.29606021368801183,"score_spread":0.2570508173183985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209525680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03651503,0.0025444764,0.9555354,0.0002854446,0.0023350115,0.00041030222,0.000024451838,0.00010921536,0.0022406783],"genre_scores_gemma":[0.9975733,0.0000031507573,0.0019025637,0.000015721242,0.00012655377,0.000024257572,0.00001820832,0.000008905926,0.00032733378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998458,0.00036525383,0.00038355085,0.00036762605,0.00022089355,0.00020467126],"domain_scores_gemma":[0.9980112,0.0003200903,0.00016402751,0.0011572317,0.0003048307,0.0000426265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007755624,0.0001244452,0.0002240461,0.00009051778,0.00018657613,0.0002940842,0.0007566141,0.00003706848,0.0000071337968],"category_scores_gemma":[0.00027748672,0.00009538719,0.00009962704,0.00085187843,0.00009969458,0.0003597407,0.00028741112,0.0001052525,0.000014618584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012310174,0.004434529,0.092323124,0.016485328,0.002124775,0.0005477489,0.091020584,0.07103949,0.11514962,0.48853892,0.012316475,0.10589631],"study_design_scores_gemma":[0.0003845288,0.000028443099,0.0009890473,0.00028810278,0.00005309962,0.000010640341,0.0011701977,0.98037153,0.011829538,0.00065667817,0.004016459,0.00020172383],"about_ca_topic_score_codex":0.00013068924,"about_ca_topic_score_gemma":0.000046156354,"teacher_disagreement_score":0.96105826,"about_ca_system_score_codex":0.000050013634,"about_ca_system_score_gemma":0.00024189237,"threshold_uncertainty_score":0.3889777},"labels":[],"label_agreement":null},{"id":"W3210470410","doi":"","title":"CEONet: A Distributed Resource Discovery Service for the Canadian Geospatial Data Infrastructure","year":2000,"lang":"en","type":"article","venue":"Data Systems in Aerospace","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geospatial analysis; Resource (disambiguation); Web Coverage Service; Data science; Service (business); Computer science; Spatial data infrastructure; Business; World Wide Web; Geography; Web service; Remote sensing; Spatial analysis; Computer network","score_opus":0.03643665144842727,"score_gpt":0.2604137054933642,"score_spread":0.2239770540449369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210470410","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.0019452384,0.0016692122,0.8127443,0.02852033,0.0028009887,0.0042376164,0.14647865,0.00032193726,0.0012817185],"genre_scores_gemma":[0.5718098,0.00047969274,0.045095198,0.009722308,0.0041285213,0.000566607,0.3580276,0.00022792973,0.009942306],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975692,0.00010403328,0.00033167284,0.0009994258,0.0003960367,0.0005996453],"domain_scores_gemma":[0.99219316,0.00019359504,0.00011250734,0.007318895,0.000037571295,0.0001442644],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010658395,0.00023388628,0.00024067223,0.00007520271,0.00040489453,0.002058745,0.012063436,0.00009705101,0.00001873991],"category_scores_gemma":[0.000089882604,0.00017671374,0.000018941719,0.0008238405,0.000047796024,0.0033500707,0.002504038,0.00023110154,0.000048333444],"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.000022780818,0.00003313969,0.0012292068,0.00013130224,0.00008366597,0.000035932007,0.00040441816,0.0058063413,0.000003171622,0.0055342633,0.94793004,0.03878572],"study_design_scores_gemma":[0.00028697567,0.000008498278,0.003231509,0.000041103358,0.000011427947,0.00000611012,0.00010811356,0.4029195,4.1534383e-7,0.000028952783,0.59320045,0.00015695633],"about_ca_topic_score_codex":0.30072793,"about_ca_topic_score_gemma":0.6029743,"teacher_disagreement_score":0.7676491,"about_ca_system_score_codex":0.00012327284,"about_ca_system_score_gemma":0.00022282818,"threshold_uncertainty_score":0.9989772},"labels":[],"label_agreement":null},{"id":"W3211131339","doi":"","title":"The Counting Problem of Slot Mereology","year":2021,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Mereology; Computer science; Artificial intelligence; Philosophy; Epistemology","score_opus":0.018608784687835216,"score_gpt":0.2266465671324772,"score_spread":0.20803778244464197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211131339","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.009251572,0.0055109705,0.7875138,0.055526022,0.0011094471,0.00067140645,0.000043489632,0.00016794245,0.14020538],"genre_scores_gemma":[0.2721798,0.006922878,0.60062546,0.00030373453,0.00010186995,0.00014970037,0.0006974468,0.00008046127,0.11893862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9889504,0.007490859,0.00102206,0.0011480578,0.0007236066,0.0006650584],"domain_scores_gemma":[0.9878291,0.0029981132,0.0011934938,0.003977555,0.0038493825,0.00015238723],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.012785976,0.0004134124,0.0005270206,0.00012911852,0.00086982537,0.0017005383,0.005078805,0.00024968514,0.00013670308],"category_scores_gemma":[0.0011893467,0.0003828671,0.00029732764,0.0008765565,0.00083663745,0.0006002988,0.008091234,0.0007650803,0.0000625142],"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.000002815354,0.00030286075,0.0006331539,0.00017928539,0.00013487798,0.000009052211,0.0051222853,0.000059946087,0.00056957203,0.77382106,0.0011276704,0.21803743],"study_design_scores_gemma":[0.001052681,0.0000016351361,0.008491527,0.0050969506,0.00019996654,0.000047914436,0.0009537351,0.3190658,0.03651941,0.024948832,0.60242003,0.0012014908],"about_ca_topic_score_codex":0.0028946432,"about_ca_topic_score_gemma":0.0033400212,"teacher_disagreement_score":0.7488722,"about_ca_system_score_codex":0.0000907988,"about_ca_system_score_gemma":0.00049780135,"threshold_uncertainty_score":0.99993116},"labels":[],"label_agreement":null},{"id":"W3214334206","doi":"10.1007/s10707-021-00453-y","title":"Personalized route recommendation through historical travel behavior analysis","year":2021,"lang":"en","type":"article","venue":"GeoInformatica","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"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; Global Positioning System; Histogram; Recommender system; Process (computing); Visualization; Shortest path problem; Dependency (UML); Data mining; Graph; Information retrieval; Artificial intelligence; Theoretical computer science","score_opus":0.028794651535476053,"score_gpt":0.2604650121550624,"score_spread":0.23167036061958635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214334206","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.0005254372,0.000030261202,0.9678416,0.0027116262,0.00033168728,0.00010084285,0.000018444185,0.00011230185,0.028327782],"genre_scores_gemma":[0.044203356,0.0001765275,0.91969544,0.0041968655,0.00018323463,0.00013598513,0.0021004907,0.000019536335,0.02928855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883384,0.000035609788,0.0003620258,0.00022432217,0.0002891668,0.00025505977],"domain_scores_gemma":[0.99916923,0.000035913494,0.00011251991,0.00053541304,0.00007816659,0.000068777066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021742076,0.00012140526,0.00023294601,0.00012224108,0.00014213397,0.00032067913,0.0004989084,0.000039242284,0.00058019126],"category_scores_gemma":[0.000024657891,0.00011485205,0.00017713645,0.0011555743,0.000015224762,0.0022305967,0.00030365205,0.00009629269,0.00024312652],"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.000011734835,0.00063600444,0.0014085779,0.00011382887,0.0011604851,0.00013569143,0.014358976,0.000053888194,0.000048897848,0.25039852,0.08698514,0.64468825],"study_design_scores_gemma":[0.001147384,0.00006259355,0.009458142,0.000011468722,0.00088378065,0.00003132869,0.0009610242,0.30154327,0.00025374806,0.0015039257,0.6835238,0.00061955233],"about_ca_topic_score_codex":0.000055190336,"about_ca_topic_score_gemma":0.000013053049,"teacher_disagreement_score":0.6440687,"about_ca_system_score_codex":0.00016746622,"about_ca_system_score_gemma":0.00004514615,"threshold_uncertainty_score":0.63526875},"labels":[],"label_agreement":null},{"id":"W3214905160","doi":"10.1145/3462675","title":"Origin-Aware Location Prediction Based on Historical Vehicle Trajectories","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Data Management and Algorithms","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":"York University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Trajectory; Baseline (sea); Exploit; Markov chain; Data mining; Machine learning; Predictive modelling; Temporal difference learning; Travel time; Artificial intelligence","score_opus":0.02315088312893285,"score_gpt":0.2409021286629922,"score_spread":0.21775124553405936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214905160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014543062,0.00023866301,0.9917936,0.003925056,0.0017802416,0.00018348996,0.00001418862,0.00047705416,0.00013340951],"genre_scores_gemma":[0.99533695,0.0001407683,0.0028739295,0.00007682657,0.000053602074,0.00010658658,0.00001573643,0.000011244178,0.0013843656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988268,0.00004169857,0.00025452283,0.00047021633,0.00021467618,0.0001920765],"domain_scores_gemma":[0.99879164,0.00007697012,0.000058485588,0.0008791766,0.00014202007,0.00005168903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105322724,0.00014504249,0.00016861239,0.00038645236,0.00022112337,0.000115128314,0.00042693867,0.0001484262,0.000017494209],"category_scores_gemma":[0.000029131159,0.0001381698,0.000037528836,0.0010202407,0.000039307382,0.00022938801,0.000018416587,0.00021740072,0.000037826463],"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.000046009696,0.001425901,0.0018222565,0.00033196626,0.00020375839,0.00013190151,0.00027878326,0.013437075,0.0007132405,0.15084033,0.0034801334,0.8272886],"study_design_scores_gemma":[0.0010045099,0.0014573222,0.00038372813,0.00036598498,0.000088930494,0.00008758106,0.0008719864,0.6324142,0.033544034,0.004691631,0.3243783,0.0007117776],"about_ca_topic_score_codex":0.00006955217,"about_ca_topic_score_gemma":0.000016674794,"teacher_disagreement_score":0.99388266,"about_ca_system_score_codex":0.00022563845,"about_ca_system_score_gemma":0.000051996292,"threshold_uncertainty_score":0.5634401},"labels":[],"label_agreement":null},{"id":"W3215823109","doi":"10.5281/zenodo.4665255","title":"A new semantic trajectory ontology model for modelling and reasoning on movement data","year":2021,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Ontology; Trajectory; Movement (music); Data modeling; Semantic data model; Artificial intelligence; Natural language processing; Data model (GIS); Information retrieval; Database","score_opus":0.09626397838339557,"score_gpt":0.27991979541369705,"score_spread":0.18365581703030148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215823109","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.00001632502,0.0005844996,0.9528594,0.0006547468,0.0003321919,0.0005535624,0.0006935584,0.00024903688,0.044056688],"genre_scores_gemma":[0.0028804946,0.0071178353,0.48199412,0.0035284471,0.002161155,8.8449565e-7,0.10036962,0.0060482994,0.39589915],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973996,0.00016930113,0.00030629436,0.0012521413,0.0004005208,0.00047213404],"domain_scores_gemma":[0.99770206,0.00003914535,0.00016992765,0.0016696453,0.00023024989,0.0001889931],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006852346,0.00026585214,0.00030488244,0.00028934894,0.0011793484,0.002067757,0.0036932644,0.00011278949,0.0013500266],"category_scores_gemma":[0.00012793514,0.00029056825,0.000049035523,0.00031988116,0.000048596048,0.0006469146,0.005838769,0.00034135024,0.002058086],"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.000017889206,0.00005619448,1.9853244e-8,0.00015709919,0.0000802356,0.000009725122,0.00035431766,0.015029932,0.0000264787,0.009298058,0.8588692,0.11610083],"study_design_scores_gemma":[0.00028134606,0.000081055616,4.7645233e-7,0.00008658072,0.0000166468,0.0000055526925,0.000022181666,0.53609234,0.000011290578,0.00029377398,0.46293682,0.00017197218],"about_ca_topic_score_codex":0.000035553927,"about_ca_topic_score_gemma":0.0000013106988,"teacher_disagreement_score":0.5210624,"about_ca_system_score_codex":0.000099659075,"about_ca_system_score_gemma":0.000024082869,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W3216398592","doi":"10.20382/jocg.v14i1a1","title":"Approximating Longest Spanning Tree with Neighborhoods","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Computer science; Minimum spanning tree; Tree (set theory); Combinatorics; Mathematics; Algorithm","score_opus":0.01329564247200219,"score_gpt":0.23161460095429337,"score_spread":0.2183189584822912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216398592","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.012959318,0.000067662,0.95346564,0.00079569855,0.0006727446,0.00064175995,0.00013062263,0.00041929173,0.030847287],"genre_scores_gemma":[0.19691329,0.00003818648,0.79668546,0.0024084528,0.0003970533,0.00017352721,0.0012338951,0.00008541572,0.0020647345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970859,0.000035747635,0.0009023024,0.0004498102,0.0006463642,0.0008798692],"domain_scores_gemma":[0.997668,0.00011065008,0.00044095053,0.001282812,0.00028628175,0.00021129756],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00056479726,0.00042301466,0.0004537828,0.00021659855,0.00042182102,0.0015149119,0.0015519528,0.00011749793,0.000027051223],"category_scores_gemma":[0.000087003165,0.00036017637,0.00016369842,0.00075564074,0.00008240934,0.0041467217,0.001089376,0.00036458138,0.000115923685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012474059,0.001393213,0.028547294,0.002781,0.001145928,0.00037413262,0.022324502,0.0009135848,0.00015440314,0.23018448,0.018048247,0.69400847],"study_design_scores_gemma":[0.006739668,0.0005947847,0.0030278042,0.0006923493,0.00013156448,0.0003299784,0.004339641,0.7951546,0.0031123173,0.0018638584,0.18212901,0.001884465],"about_ca_topic_score_codex":0.0000071983454,"about_ca_topic_score_gemma":0.000020758062,"teacher_disagreement_score":0.79424095,"about_ca_system_score_codex":0.00007630858,"about_ca_system_score_gemma":0.00010704754,"threshold_uncertainty_score":0.999885},"labels":[],"label_agreement":null},{"id":"W3217002698","doi":"10.1109/swc50871.2021.00068","title":"Smart City Transportation Data Analytics with Conceptual Models and Knowledge Graphs","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Manitoba","funders":"University of Manitoba","keywords":"Big data; Computer science; Data science; Smart city; Analytics; Timestamp; Conceptual model; Data modeling; Data analysis; Knowledge graph; Data mining; World Wide Web; Computer security; Database; Information retrieval; Internet of Things","score_opus":0.1004552496346959,"score_gpt":0.27714318164638047,"score_spread":0.17668793201168456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217002698","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.008176751,0.00018835634,0.98492545,0.00028840738,0.000065478525,0.000058237994,0.000047564008,0.00007696181,0.006172814],"genre_scores_gemma":[0.817206,0.00018548223,0.17864905,0.00029804275,0.00002436565,0.0000029104335,0.0007561049,0.0000068772697,0.0028711576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922806,0.000016995871,0.00010660568,0.0003961787,0.00013307038,0.00011911416],"domain_scores_gemma":[0.9991397,0.00002300177,0.000025014657,0.00069395744,0.000063682826,0.000054645654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013053688,0.00007702648,0.000094276336,0.000039878905,0.00005716659,0.00016711034,0.00048539438,0.00001721762,0.000020129613],"category_scores_gemma":[0.0000031580428,0.00006203271,0.0000108873965,0.00036276388,0.000060780218,0.0016757968,0.00018067466,0.000046670382,0.000003793881],"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.0000029552123,0.00009016983,0.0024621834,0.000016507714,0.00005955677,0.00004838365,0.0006093256,0.0001021237,0.000009753689,0.96837354,0.0051131155,0.023112366],"study_design_scores_gemma":[0.0005247857,0.000041526328,0.005733307,0.0000132133155,0.000039651444,0.000003553994,0.00027984442,0.9763441,0.00015399366,0.009183174,0.0074740793,0.00020874092],"about_ca_topic_score_codex":0.000035463243,"about_ca_topic_score_gemma":0.0006543978,"teacher_disagreement_score":0.976242,"about_ca_system_score_codex":0.000003285119,"about_ca_system_score_gemma":0.000047549198,"threshold_uncertainty_score":0.25296205},"labels":[],"label_agreement":null},{"id":"W38130022","doi":"10.1111/jcpp.13940","title":"Sphere-of-Influence Graphs on a Sphere.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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":"Mathematics; Combinatorics","score_opus":0.009295260172094756,"score_gpt":0.22710268250822138,"score_spread":0.21780742233612663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38130022","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.97435755,0.00009967692,0.005624549,0.00056835957,0.0023875656,0.00028409663,0.000004692847,0.0002900513,0.016383452],"genre_scores_gemma":[0.9905423,0.000014771001,0.008961667,0.00026597915,0.0000044664957,0.000008890787,0.000003053368,0.000009667087,0.00018921199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987487,0.000024715117,0.00021718776,0.0003700782,0.00036630564,0.0002730119],"domain_scores_gemma":[0.9988479,0.00003887457,0.00010589995,0.0008646423,0.000060336217,0.00008235281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017590253,0.00015209704,0.00016976678,0.0000714502,0.00009700697,0.00015488415,0.0013728073,0.000043247182,0.00002005449],"category_scores_gemma":[0.000032357137,0.00014405535,0.00007153053,0.00063110027,0.00007669638,0.00069951045,0.00031676647,0.00011795264,0.0002326447],"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.0000035064695,0.00015033883,0.00042337747,0.00001142686,0.000016087535,0.00002594542,0.0001014063,0.00014363936,0.00010545443,0.98983246,0.0006593124,0.008527048],"study_design_scores_gemma":[0.0011059442,0.00028026116,0.0053936983,0.000065421205,0.0000070112137,0.0000022595914,0.000018805846,0.00031465938,0.003648451,0.98524195,0.0036945723,0.00022698005],"about_ca_topic_score_codex":0.00010528203,"about_ca_topic_score_gemma":0.000006295839,"teacher_disagreement_score":0.01619424,"about_ca_system_score_codex":0.000033725795,"about_ca_system_score_gemma":0.00006255337,"threshold_uncertainty_score":0.58744067},"labels":[],"label_agreement":null},{"id":"W4205828231","doi":"10.4018/ijsi.292022","title":"A Scalable Real-Time Agent-Based Information Retrieval Engine","year":2022,"lang":"en","type":"article","venue":"International Journal of Software Innovation","topic":"Data Management and Algorithms","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; Rank (graph theory); Information retrieval; Search engine; Scheme (mathematics); Resource (disambiguation); Data mining; Simplicity; Database","score_opus":0.011175712506767103,"score_gpt":0.2419523240304863,"score_spread":0.2307766115237192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205828231","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.03530653,0.000009226876,0.9586532,0.0031643584,0.0022332747,0.00009600616,0.000041110405,0.000097727585,0.00039857536],"genre_scores_gemma":[0.57482886,0.000029603276,0.4172933,0.004729452,0.0008593717,0.000016743812,0.001100774,0.000026700294,0.0011151726],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99789804,0.000040548894,0.0006428957,0.00009621467,0.0012045173,0.00011779002],"domain_scores_gemma":[0.99779683,0.00006426561,0.0007344797,0.00016769048,0.001210487,0.00002623266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450569,0.00008665213,0.00010508843,0.0010429346,0.00010832076,0.0002954741,0.0012551467,0.000020767424,0.0002172442],"category_scores_gemma":[0.00028226193,0.00008879716,0.000052243657,0.0012425369,0.000013759933,0.0032241,0.00032051088,0.00019007415,0.000041738538],"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.0005880241,0.0006448869,0.0032155048,0.00004209688,0.00045595012,0.00027303663,0.00077051815,0.042033244,0.0048989723,0.066281535,0.11887856,0.76191765],"study_design_scores_gemma":[0.007507889,0.0013224287,0.012734835,0.00015770296,0.000049719903,0.00041354157,0.00018017481,0.35975027,0.008533303,0.016080596,0.5923442,0.00092532113],"about_ca_topic_score_codex":0.000007978149,"about_ca_topic_score_gemma":8.251055e-8,"teacher_disagreement_score":0.76099235,"about_ca_system_score_codex":0.00026951445,"about_ca_system_score_gemma":0.0001617454,"threshold_uncertainty_score":0.36210433},"labels":[],"label_agreement":null},{"id":"W4206612087","doi":"10.1109/ickg52313.2021.00042","title":"UFreS: A New Technique for Discovering Frequent Subgraph Patterns in Uncertain Graph Databases","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Subgraph isomorphism problem; Scalability; Graph database; Data mining; Graph; Embedding; Theoretical computer science; Database; Artificial intelligence","score_opus":0.043619745974592325,"score_gpt":0.2913923747721751,"score_spread":0.24777262879758277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206612087","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.0009677069,0.00009081809,0.99674636,0.0009919214,0.00016820732,0.0003567699,0.00006370329,0.00010620934,0.0005083115],"genre_scores_gemma":[0.059167102,0.0002726521,0.9358016,0.0012497635,0.00012923304,0.0003102165,0.0004275754,0.000023427356,0.00261838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881124,0.000026481957,0.00020640253,0.00048885425,0.00016635988,0.00030067432],"domain_scores_gemma":[0.99908197,0.00007018066,0.00003900028,0.00071599113,0.000022742877,0.00007013438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020864577,0.00013208644,0.00013984487,0.0001831763,0.000048139103,0.00024317429,0.00071821245,0.000019949382,0.00003852527],"category_scores_gemma":[0.000033738663,0.0001188186,0.00007305325,0.0005923063,0.00001232935,0.0011262584,0.00057044637,0.00006835849,0.000003983755],"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.000013307195,0.00046330786,0.03213874,0.0003352368,0.00009375335,0.0005652775,0.00048946554,0.00019176531,0.011240469,0.8381176,0.022942713,0.09340834],"study_design_scores_gemma":[0.00852986,0.00062501593,0.032891665,0.0021956398,0.000104173974,0.000113631926,0.0027254422,0.1124138,0.3594228,0.21970554,0.25620693,0.0050654886],"about_ca_topic_score_codex":0.0018066418,"about_ca_topic_score_gemma":0.0025892048,"teacher_disagreement_score":0.6184121,"about_ca_system_score_codex":0.00002414601,"about_ca_system_score_gemma":0.00007026789,"threshold_uncertainty_score":0.48452818},"labels":[],"label_agreement":null},{"id":"W4206852126","doi":"","title":"Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), Montréal, Canada","year":2008,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Representation (politics); Operations research; History; Political science; Mathematics; Law; Politics","score_opus":0.008780881741554574,"score_gpt":0.2016540108123043,"score_spread":0.19287312907074972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206852126","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.41117898,0.0016010072,0.10383202,0.16587462,0.0034718043,0.0029430564,0.00042644746,0.0006960037,0.30997607],"genre_scores_gemma":[0.86415094,0.002300021,0.102671504,0.00046926131,0.0000937773,0.00009587944,0.000531462,0.000058951046,0.02962821],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976875,0.0003998187,0.00038031748,0.00066517934,0.0006706127,0.0001965352],"domain_scores_gemma":[0.9969525,0.00024860003,0.00059442903,0.0010949976,0.0010264427,0.00008306922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013002843,0.00021460443,0.00022171572,0.000095494135,0.0002515637,0.00042310962,0.002345606,0.00008622457,0.000010531481],"category_scores_gemma":[0.00042802992,0.00018946068,0.000084026586,0.00031680707,0.0001237345,0.00035521106,0.0030465457,0.00033446134,0.0000036456947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00007050417,0.0016402678,0.047156695,0.00056471664,0.00082203915,0.00005278387,0.022606524,0.0012588466,0.0048203673,0.37446278,0.38233113,0.16421333],"study_design_scores_gemma":[0.0015752999,0.0000025952916,0.04224808,0.004782358,0.00008640207,0.000070349204,0.00029139442,0.7865681,0.054724924,0.0036262404,0.1046921,0.0013321615],"about_ca_topic_score_codex":0.14751433,"about_ca_topic_score_gemma":0.02788741,"teacher_disagreement_score":0.78530926,"about_ca_system_score_codex":0.00012285249,"about_ca_system_score_gemma":0.00022447926,"threshold_uncertainty_score":0.9898511},"labels":[],"label_agreement":null},{"id":"W4210981376","doi":"10.1007/978-1-4471-7452-3_30","title":"Data Mining","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Web mining; Computer science; Data mining; Knowledge extraction; Data science; Information retrieval; World Wide Web; Web page","score_opus":0.08571840790610807,"score_gpt":0.2643398679505388,"score_spread":0.17862146004443075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210981376","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":[2.5799102e-8,0.00008013413,0.19960864,0.00027611107,0.0006157671,0.00008052268,0.00006765721,0.00013153833,0.7991396],"genre_scores_gemma":[0.0000016687349,0.000052724285,0.101638176,0.00045756626,0.00013623989,2.8399526e-7,0.00049787236,0.000012570087,0.8972029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884003,0.0000024517353,0.00013930025,0.0006325352,0.0002459598,0.0001397096],"domain_scores_gemma":[0.99651396,0.000029091094,0.00007629954,0.0033303066,0.00001586358,0.000034499946],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000161338,0.0001576331,0.00015525639,0.00009233135,0.000026774384,0.00029022028,0.00488731,0.000068767935,0.00053487957],"category_scores_gemma":[0.000003941288,0.00013674391,0.000028917664,0.000018303565,0.000014018282,0.00093287945,0.0056277886,0.00009810248,0.0036869464],"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":[9.63903e-8,0.0000012765927,5.3736727e-7,0.000007145894,0.000017247028,0.000011113047,0.0000031993209,1.05506246e-7,8.135572e-8,0.6202876,0.23619819,0.14347339],"study_design_scores_gemma":[0.00005421118,0.000011075263,0.0000023311095,0.00003018814,0.000008990399,0.0000015705521,0.0000010312297,0.017977709,4.290008e-7,0.003579995,0.9781334,0.00019910121],"about_ca_topic_score_codex":0.0000026045445,"about_ca_topic_score_gemma":0.0000059003614,"teacher_disagreement_score":0.7419352,"about_ca_system_score_codex":0.000008086923,"about_ca_system_score_gemma":0.000038405615,"threshold_uncertainty_score":0.9970888},"labels":[],"label_agreement":null},{"id":"W4214724944","doi":"10.1007/s00357-021-09407-3","title":"On Assessments of Agreement Between Fuzzy Partitions","year":2022,"lang":"en","type":"article","venue":"Journal of Classification","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"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; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Interpretability; Fuzzy logic; Probabilistic logic; Property (philosophy); Monte Carlo method; Mathematics; Measure (data warehouse); Cluster (spacecraft); Computer science; Data mining; Artificial intelligence; Statistics","score_opus":0.07695818300159624,"score_gpt":0.33464940112893354,"score_spread":0.2576912181273373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214724944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08978313,0.00004466159,0.8783214,0.007607693,0.0011581425,0.00023244863,0.00004223867,0.00002425191,0.02278602],"genre_scores_gemma":[0.9914338,0.000010389131,0.008097925,0.000079987236,0.00006552647,0.0000058975143,0.000013370176,0.0000024508074,0.00029063944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99882615,0.00008793773,0.00035987087,0.00009097474,0.00055802835,0.00007702604],"domain_scores_gemma":[0.998996,0.00005800454,0.0005718875,0.00025638106,0.00008171337,0.000036006182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486143,0.00004609738,0.000102184626,0.00018246459,0.00010047892,0.000043583193,0.0006263214,0.000009044619,0.00005056536],"category_scores_gemma":[0.00001628726,0.00004212467,0.000055539458,0.00027739428,0.00001229126,0.00042806467,0.00012833282,0.00012235352,0.000008720878],"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.000034266246,0.0012746705,0.008663041,0.000033918834,0.00024821464,0.000019026134,0.0003834755,0.0017010348,0.004045664,0.535459,0.07229538,0.37584233],"study_design_scores_gemma":[0.0028942928,0.004338931,0.6409728,0.00010553843,0.00019587229,0.000022877086,0.0008237033,0.03002525,0.0038155166,0.1517295,0.16457438,0.00050134887],"about_ca_topic_score_codex":0.0000011443844,"about_ca_topic_score_gemma":1.3576877e-7,"teacher_disagreement_score":0.90165067,"about_ca_system_score_codex":0.00007552034,"about_ca_system_score_gemma":0.00004415225,"threshold_uncertainty_score":0.17177942},"labels":[],"label_agreement":null},{"id":"W4214752466","doi":"10.1007/978-0-387-39940-9_2261","title":"Conceptual Modeling for Spatio-Temporal Applications","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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; Cognitive science; Psychology","score_opus":0.032059078610176046,"score_gpt":0.2537990918078484,"score_spread":0.22174001319767234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214752466","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":[7.1084696e-7,0.0012033245,0.72914135,0.00004099428,0.0006003656,0.0015509555,0.002256018,0.00012673375,0.26507956],"genre_scores_gemma":[0.00088144577,0.0025885513,0.19244976,0.0001393516,0.0035510256,0.0008774695,0.02768809,0.00014386227,0.7716805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976055,0.000019776791,0.00080708385,0.00077056244,0.0005047545,0.00029234253],"domain_scores_gemma":[0.9974223,0.00009372769,0.0005280957,0.001633058,0.00020107646,0.000121760284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042174393,0.00037296064,0.00055389846,0.00024888778,0.00011036673,0.00011055402,0.0015756281,0.00015230599,0.000019611296],"category_scores_gemma":[0.000018292869,0.00037738215,0.00015974206,0.00007861029,0.00006554106,0.0008153427,0.00039913523,0.00018347759,0.00008369493],"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.0000044847416,0.000028588194,0.000002862273,0.00019931955,0.000056013938,0.000005269141,0.000058567857,0.00034887556,9.145428e-7,0.9533716,0.021579789,0.024343701],"study_design_scores_gemma":[0.00028027702,0.00005874888,1.7257827e-7,0.00021198703,0.000051764913,0.0000025348884,0.000027052434,0.101308845,0.0000013841116,0.0025111856,0.89516675,0.0003793201],"about_ca_topic_score_codex":0.000075034186,"about_ca_topic_score_gemma":0.000021632959,"teacher_disagreement_score":0.95086044,"about_ca_system_score_codex":0.000043301625,"about_ca_system_score_gemma":0.00013712181,"threshold_uncertainty_score":0.9998678},"labels":[],"label_agreement":null},{"id":"W4214771680","doi":"10.1109/tdsc.2022.3153759","title":"Towards Efficient and Privacy-Preserving Interval Skyline Queries Over Time Series Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":21,"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 Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Skyline; Encryption; Homomorphic encryption; Security analysis; Information privacy; Data mining; Database; Computer security","score_opus":0.019673830660524024,"score_gpt":0.25014859585316107,"score_spread":0.23047476519263704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214771680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060927548,0.0002293583,0.93648064,0.0009482461,0.00059692527,0.00018774609,0.00013793171,0.00021001829,0.00028155706],"genre_scores_gemma":[0.9712871,0.000044512326,0.027622221,0.0002578578,0.00006750863,0.000008147986,0.000044437707,0.000019837697,0.00064838195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983483,0.00010046917,0.0002468947,0.000658982,0.0003397683,0.0003055609],"domain_scores_gemma":[0.9988832,0.00007900639,0.00007761282,0.00084958435,0.000025943355,0.00008466812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053934695,0.00019209819,0.00021074434,0.00015595791,0.00095539994,0.00045807697,0.0013282202,0.000029107852,0.00011930516],"category_scores_gemma":[0.00000826039,0.00019140386,0.000035482124,0.000341171,0.000051304105,0.0008955138,0.0006354056,0.0003237907,0.000005680408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019985235,0.00090337807,0.00015654898,0.00040382906,0.00047963866,0.000351572,0.009704503,0.12961936,0.0011016645,0.006064841,0.008151985,0.84286284],"study_design_scores_gemma":[0.00039873304,0.00015945689,0.00010773865,0.000032485495,0.000023994917,0.00007548649,0.00020281122,0.9844869,0.00050214323,0.00019608162,0.013562568,0.00025162453],"about_ca_topic_score_codex":0.00009750657,"about_ca_topic_score_gemma":0.000018414608,"teacher_disagreement_score":0.91035956,"about_ca_system_score_codex":0.000029080149,"about_ca_system_score_gemma":0.000035508845,"threshold_uncertainty_score":0.7805223},"labels":[],"label_agreement":null},{"id":"W4226482498","doi":"10.1016/j.tcs.2022.04.002","title":"An efficient oracle for counting shortest paths in planar graphs","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Data Management and Algorithms","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":"Oracle; Combinatorics; Planar graph; Shortest path problem; Voronoi diagram; Vertex (graph theory); Mathematics; Discrete mathematics; Data structure; Computer science; Graph; Geometry","score_opus":0.010823555602555292,"score_gpt":0.2515598887280446,"score_spread":0.24073633312548928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226482498","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.05817122,0.00001362778,0.93960667,0.00045570283,0.00069354207,0.00034615595,0.000015445472,0.00016358701,0.0005340433],"genre_scores_gemma":[0.8383157,6.476042e-7,0.1610382,0.00053494767,0.000045645385,0.000045853467,0.000008411875,0.000007085705,0.000003499493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728274,0.000100923324,0.00027160987,0.0008754184,0.0008078594,0.00066145824],"domain_scores_gemma":[0.9986937,0.00018091746,0.00006302707,0.00083669776,0.000067306864,0.0001583215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033611706,0.00015039564,0.00016831477,0.00035390627,0.0008067674,0.0005947283,0.003971282,0.000016368418,0.000025065687],"category_scores_gemma":[0.000032816257,0.00014169027,0.000047105856,0.0018135842,0.0006734431,0.00070857425,0.0013628129,0.00018262152,0.000008930889],"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.0000061049145,0.00017930946,0.00017299804,0.0000037221666,0.0000013108448,0.000020144642,0.00032572725,0.0054253205,0.00012432797,0.96104705,0.00005447284,0.032639496],"study_design_scores_gemma":[0.0002614453,0.0003348072,0.0009792306,0.00000599085,0.0000022055747,0.000009368788,0.000040070125,0.9273008,0.00014922857,0.07024491,0.00046579028,0.00020611867],"about_ca_topic_score_codex":0.00000783875,"about_ca_topic_score_gemma":0.000001428357,"teacher_disagreement_score":0.92187554,"about_ca_system_score_codex":0.0000788922,"about_ca_system_score_gemma":0.00007778575,"threshold_uncertainty_score":0.73796964},"labels":[],"label_agreement":null},{"id":"W4226501514","doi":"10.1007/978-3-030-98974-3_3","title":"Fuzzy Relations","year":2022,"lang":"en","type":"book-chapter","venue":"Big and integrated artificial intelligence","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.07253563816006178,"score_gpt":0.25900066062391675,"score_spread":0.18646502246385496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226501514","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.0000046774644,0.00065509777,0.20580025,0.0008623665,0.0014673047,0.0002398466,0.00009159854,0.00026390512,0.79061496],"genre_scores_gemma":[0.00562922,0.0022218737,0.0110933725,0.0006327434,0.00051567407,0.00005061315,0.0005074118,0.00007315748,0.97927594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981984,0.000028270957,0.00047523828,0.000699591,0.00034051752,0.00025801323],"domain_scores_gemma":[0.9988861,0.000083702806,0.00018050922,0.00064112066,0.00010100789,0.00010753752],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002719088,0.00032134133,0.0002617302,0.00033579505,0.00036915566,0.00041322538,0.0009957482,0.00014798572,0.0010299431],"category_scores_gemma":[0.00004233918,0.0003002071,0.00009941391,0.00020337063,0.00014104397,0.00042354496,0.0006617263,0.00061760744,0.000714001],"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.000002196305,0.000010574774,3.0581782e-7,0.0000033968265,0.000018006142,0.000018216288,0.000062408384,0.000010442717,0.00000521372,0.5983115,0.0023354453,0.3992223],"study_design_scores_gemma":[0.000008326364,0.000083266554,0.0000011303141,0.000040179875,0.000018576873,0.000006332631,0.00005333653,0.0061240657,0.000095200645,0.3970018,0.59626,0.0003077783],"about_ca_topic_score_codex":0.00009337439,"about_ca_topic_score_gemma":0.000065734166,"teacher_disagreement_score":0.5939245,"about_ca_system_score_codex":0.000062154104,"about_ca_system_score_gemma":0.00009414202,"threshold_uncertainty_score":0.999945},"labels":[],"label_agreement":null},{"id":"W4229516452","doi":"10.4018/978-1-60960-818-7.ch804","title":"Pattern Discovery as Event Association","year":2011,"lang":"en","type":"book-chapter","venue":"Machine Learning","topic":"Data Management and Algorithms","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":"Pattern Discovery Technologies (Canada); University of Waterloo","funders":"","keywords":"Event (particle physics); Association (psychology); Task (project management); Binary number; Mathematics; Computer science; Artificial intelligence; Algorithm; Combinatorics; Discrete mathematics; Arithmetic; Psychology; Physics","score_opus":0.012529066127516131,"score_gpt":0.2193140326999921,"score_spread":0.20678496657247597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229516452","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.0000144093765,0.0002599073,0.33652982,0.0004915396,0.00073005253,0.00014267922,0.000013957882,0.00026055946,0.6615571],"genre_scores_gemma":[0.005673633,0.0001774801,0.0006224104,0.00038465083,0.00028018063,0.0000051699894,0.000230852,0.00004055862,0.99258506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998474,0.000040873696,0.00025342195,0.000500502,0.0004675197,0.00026368944],"domain_scores_gemma":[0.99896073,0.000053440526,0.0004315214,0.00046716054,0.00003356448,0.000053553613],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004285406,0.00027250475,0.00025176624,0.00015596296,0.0001388023,0.0004394505,0.00088620966,0.00014098354,0.0004415338],"category_scores_gemma":[0.000043480435,0.00026204466,0.00014644284,0.000035288016,0.000009777906,0.00078662595,0.0009398203,0.00059409946,0.0014933748],"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.0000032167657,0.000029958579,0.0029825415,0.00005315784,0.0002397533,0.0001262827,0.0003433008,0.000078156816,0.0000029962907,0.22750868,0.005990798,0.76264113],"study_design_scores_gemma":[0.00020568435,0.00010664798,0.0004717639,0.00011120554,0.000045273504,0.0000037797652,0.0000017315257,0.011463156,0.000006221677,0.0191623,0.9679385,0.00048373998],"about_ca_topic_score_codex":0.00018933055,"about_ca_topic_score_gemma":0.000028519451,"teacher_disagreement_score":0.9619477,"about_ca_system_score_codex":0.00012941842,"about_ca_system_score_gemma":0.000022861168,"threshold_uncertainty_score":0.9999832},"labels":[],"label_agreement":null},{"id":"W4230187284","doi":"10.1177/0361198105190200113","title":"Spatiotemporal Data Model and Query Language for Tracking Land Use Change","year":2005,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Data Management and Algorithms","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":"Object Query Language; Computer science; Query language; Data model (GIS); Object (grammar); Context (archaeology); Data modeling; Spatial analysis; Representation (politics); Geographic information system; Database; Data mining; Programming language; Sargable; Information retrieval; Artificial intelligence; Geography; Web search query; Remote sensing","score_opus":0.32818616778389326,"score_gpt":0.43141805838158304,"score_spread":0.10323189059768978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230187284","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.8232091,0.00034666766,0.16278437,0.011551326,0.00026430096,0.0013830194,0.0003917335,0.000045449324,0.000024032168],"genre_scores_gemma":[0.9178466,0.0008432026,0.080006,0.00015556443,0.00038675882,0.00006439637,0.00013186267,0.0000350355,0.00053052756],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9956844,0.00036761857,0.0007889479,0.0005045723,0.002008106,0.00064636866],"domain_scores_gemma":[0.9966365,0.00067755,0.00028917444,0.0009233925,0.0012222336,0.0002511646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004811175,0.00017966375,0.00028615916,0.00068614393,0.0004665912,0.0005708606,0.002426229,0.00009733793,0.000016516018],"category_scores_gemma":[0.00015503354,0.0001371015,0.0001289974,0.00091297686,0.00022341675,0.005894687,0.000046126777,0.00088861835,0.000004319645],"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.0014165743,0.00078676833,0.27086025,0.00087480055,0.0003932002,0.00020148807,0.017318824,0.004086921,0.001880024,0.03052119,0.031979002,0.6396809],"study_design_scores_gemma":[0.0028162347,0.00043097616,0.7265744,0.0003428538,0.000060780127,9.713268e-7,0.00067070493,0.22857875,0.00049015455,0.0029495822,0.03671364,0.00037092628],"about_ca_topic_score_codex":0.004686541,"about_ca_topic_score_gemma":0.04300677,"teacher_disagreement_score":0.63931,"about_ca_system_score_codex":0.000073589894,"about_ca_system_score_gemma":0.00022363682,"threshold_uncertainty_score":0.9744559},"labels":[],"label_agreement":null},{"id":"W4230523959","doi":"10.22215/etd/2008-08073","title":"Algorithms for static and dynamic path problems in trees","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Path (computing); Computer science; Humanities; Art; Operating system","score_opus":0.01727759919918152,"score_gpt":0.2691569636644638,"score_spread":0.25187936446528225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230523959","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.007486308,0.0013156693,0.9780863,0.00034621902,0.0013327163,0.0028165549,0.00010474739,0.0003348267,0.008176637],"genre_scores_gemma":[0.02161575,0.006726006,0.75611013,0.00043398637,0.0001338035,0.0013816522,0.0096375,0.00013260305,0.20382854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872416,0.000016000406,0.00027421382,0.0005276938,0.0001956292,0.00026228713],"domain_scores_gemma":[0.9994371,0.00005450656,0.00010885589,0.0003170078,0.000037877267,0.000044662727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014771384,0.00021326012,0.0002463103,0.000266631,0.00006435714,0.000200828,0.000571477,0.000082658815,0.000005172275],"category_scores_gemma":[0.00001299791,0.00018836393,0.000041615185,0.0002352202,0.000014363341,0.00057319854,0.00007699242,0.000100772195,0.0000075472803],"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.000007110774,0.00015562373,0.000091721944,0.0006067056,0.000049023958,0.00002790524,0.00240912,0.000052662697,0.00002697971,0.007824078,0.004809914,0.9839392],"study_design_scores_gemma":[0.0011644249,0.00022931151,0.008247934,0.00026894268,0.00002080812,0.0000041956296,0.0005424471,0.97047216,0.000024151132,0.010854277,0.0074968836,0.000674485],"about_ca_topic_score_codex":0.00010108397,"about_ca_topic_score_gemma":0.0012517491,"teacher_disagreement_score":0.9832647,"about_ca_system_score_codex":0.000027834201,"about_ca_system_score_gemma":0.00004536799,"threshold_uncertainty_score":0.76812583},"labels":[],"label_agreement":null},{"id":"W4231860724","doi":"10.4018/9781591403845.ch009.ch000","title":"An Object-Oriented Approach to Managing Fuzziness in Spatially Explicit Models Coupled to a Geographic Database","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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 Windsor; University of Toronto","funders":"","keywords":"Computer science; Fuzzy logic; Data mining; Schema (genetic algorithms); Component (thermodynamics); Spatial database; Database; Geographic information system; Spatial analysis; Database schema; Information retrieval; Database design; Artificial intelligence; Geography; Cartography","score_opus":0.030830684915060545,"score_gpt":0.24227002449647236,"score_spread":0.2114393395814118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231860724","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.00009678189,0.000027100714,0.5225718,0.000030297719,0.0003240179,0.00095750013,0.00015530457,0.000245821,0.47559136],"genre_scores_gemma":[0.33514506,0.000050675393,0.5931592,0.009877651,0.0013164432,0.0013680417,0.0010788087,0.0004909281,0.057513207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588346,0.000038128226,0.00062547287,0.0018519206,0.0007958684,0.00080513826],"domain_scores_gemma":[0.9964544,0.000013775519,0.00019410807,0.0026663537,0.00014599283,0.0005253467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044829547,0.0007311621,0.00068686885,0.0007765412,0.00012203591,0.0004535431,0.0034206386,0.00019704814,0.000007801938],"category_scores_gemma":[0.0000076343185,0.000771798,0.00014455187,0.00027431484,0.000040324,0.0008631105,0.0022438986,0.0003114147,0.00012343936],"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.000042541684,0.00007762586,0.000010985088,0.000052378415,0.00005380973,0.00014318374,0.0003051309,0.00048591002,0.000007638218,0.9819683,0.0002923654,0.016560145],"study_design_scores_gemma":[0.0022263136,0.0006772208,0.00022787007,0.0010923326,0.00017370297,0.00004082103,0.000076537974,0.42613408,0.000022457552,0.5494399,0.015717436,0.0041713156],"about_ca_topic_score_codex":0.0019348541,"about_ca_topic_score_gemma":0.00074365607,"teacher_disagreement_score":0.43252838,"about_ca_system_score_codex":0.00014596205,"about_ca_system_score_gemma":0.00010503066,"threshold_uncertainty_score":0.9994733},"labels":[],"label_agreement":null},{"id":"W4232351833","doi":"10.1109/icra.2011.5980094","title":"Offline navigation summaries","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Surprise; Computer science; Artificial intelligence; Context (archaeology); Sampling (signal processing); Trajectory; Task (project management); Set (abstract data type); Robotics; Noise (video); Robot; Sample (material); Focus (optics); Machine learning; Computer vision; Geography","score_opus":0.04136571761821523,"score_gpt":0.221183433797658,"score_spread":0.17981771617944278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232351833","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.00095840666,0.000009286991,0.84222156,0.00021802564,0.00019874147,0.000037809168,9.170611e-7,0.00017888576,0.15617636],"genre_scores_gemma":[0.23544607,0.000009916608,0.7433972,0.00072679325,0.00008731926,0.000007382056,0.00005081269,0.000005282654,0.020269237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99968094,0.00000566631,0.00005741115,0.000108195854,0.000072450544,0.00007536961],"domain_scores_gemma":[0.99971026,0.0000047594417,0.000015122936,0.00023515837,0.000015483714,0.000019192868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081509424,0.000033768636,0.00002952952,0.000023962211,0.00003106026,0.00006537973,0.00039738038,0.000008431229,0.00009423576],"category_scores_gemma":[0.0000032747553,0.000026886924,0.000010970352,0.00011293569,0.000012472099,0.00080261484,0.00019162179,0.00001855774,0.00023002953],"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":[6.1414363e-7,0.000023067321,0.00047077562,0.0000027914962,0.0000044354288,0.0000059013682,0.00022589545,1.8527317e-7,0.000016845983,0.8752042,0.0071534803,0.116891816],"study_design_scores_gemma":[0.0010969677,0.00031227828,0.046000615,0.00003990268,0.000021785021,0.000012111692,0.000291478,0.22440124,0.022720579,0.27339876,0.4307154,0.0009888742],"about_ca_topic_score_codex":0.000064114945,"about_ca_topic_score_gemma":0.000004199227,"teacher_disagreement_score":0.60180545,"about_ca_system_score_codex":0.0000026012071,"about_ca_system_score_gemma":0.0000037328552,"threshold_uncertainty_score":0.2956641},"labels":[],"label_agreement":null},{"id":"W4232957048","doi":"10.1007/978-1-4939-7131-2_101350","title":"Time-Aware Social Search","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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.03418376257417852,"score_gpt":0.25580859171379383,"score_spread":0.22162482913961531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232957048","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":[4.3234718e-7,0.000012074043,0.08743305,0.0006416557,0.00026213308,0.00011839101,0.00002190208,0.00025380793,0.91125655],"genre_scores_gemma":[0.000008332311,0.000011852845,0.0058635063,0.00040171095,0.00083211163,0.0000016244769,0.000085113075,0.000019963327,0.9927758],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986993,0.000007903932,0.00014461264,0.0004769336,0.00043217427,0.00023907932],"domain_scores_gemma":[0.99924105,0.00001555571,0.000048481546,0.0005596891,0.00008053891,0.0000546909],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018205158,0.0001972165,0.00018361003,0.00013338777,0.00013923566,0.00030512537,0.0016527999,0.00013652143,0.007971468],"category_scores_gemma":[0.0000012013434,0.0001760003,0.00009629034,0.00003690266,0.00010819993,0.0003728468,0.0015012606,0.00016462231,0.023348033],"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":[5.8399434e-7,0.0000046921173,8.454613e-8,0.000009959224,0.000032713488,0.000018961955,0.00006926221,4.557954e-8,5.734614e-7,0.40352476,0.541261,0.05507735],"study_design_scores_gemma":[0.0000900656,0.00004169442,0.0000027854226,0.000015906748,0.0000091124775,0.0000014686619,0.0000031704622,0.006254859,0.000008505501,0.017562566,0.97571343,0.00029641116],"about_ca_topic_score_codex":0.0000041082235,"about_ca_topic_score_gemma":0.0000022465952,"teacher_disagreement_score":0.43445244,"about_ca_system_score_codex":0.000028756647,"about_ca_system_score_gemma":0.000041765266,"threshold_uncertainty_score":0.99293536},"labels":[],"label_agreement":null},{"id":"W4233297996","doi":"10.1007/978-3-030-24124-7_13","title":"Towards Dynamic Data Placement for Polystore Ingestion","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Workload; Computer science; Latency (audio); Data warehouse; Benchmark (surveying); Context (archaeology); Database; Distributed computing; Operating system","score_opus":0.025926823530976573,"score_gpt":0.26740734649487397,"score_spread":0.24148052296389738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233297996","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.0000023838102,0.0004252386,0.9835933,0.0015407632,0.00088625343,0.00076423644,0.00013861952,0.00016897048,0.012480221],"genre_scores_gemma":[0.046637855,0.0009565356,0.8670192,0.007197864,0.001128234,0.00021924132,0.062068522,0.00025807964,0.014514471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998124,0.0000070724154,0.0006196375,0.00046501422,0.0004887166,0.00029554614],"domain_scores_gemma":[0.9978242,0.0000619206,0.0006359848,0.0010987187,0.00034551782,0.000033670138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045342604,0.0003773786,0.00033795522,0.0006308043,0.00014195194,0.000933534,0.0018934252,0.00028894964,0.000016976517],"category_scores_gemma":[0.00020644705,0.0003536225,0.000037232734,0.00028855723,0.00003609427,0.007202901,0.0010116121,0.0002796658,0.000046693654],"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.000020219282,0.000007822518,0.0000032278151,0.0011986032,0.000014903373,0.0000010967196,0.0002470865,0.0045655197,9.243977e-7,0.010689577,0.00023002802,0.983021],"study_design_scores_gemma":[0.000669677,0.00002748208,0.000079461184,0.0011947667,0.00003909219,0.000005781776,0.000006014991,0.77872044,0.000017618428,0.011796979,0.20681198,0.0006307112],"about_ca_topic_score_codex":0.000008967854,"about_ca_topic_score_gemma":0.000029777917,"teacher_disagreement_score":0.9823903,"about_ca_system_score_codex":0.00022154003,"about_ca_system_score_gemma":0.00041006642,"threshold_uncertainty_score":0.9998916},"labels":[],"label_agreement":null},{"id":"W4233755731","doi":"10.1007/978-1-4419-9380-9_5","title":"Probabilistic Ranking Queries on Uncertain Data","year":2011,"lang":"en","type":"book-chapter","venue":"˜The œKluwer international series on advances in database systems","topic":"Data Management and Algorithms","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":"Probabilistic logic; Probabilistic database; Ranking (information retrieval); Computer science; Probabilistic relevance model; Uncertain data; Section (typography); Statistical model; Data mining; Information retrieval; Probabilistic analysis of algorithms; Machine learning; Artificial intelligence; Database theory; Database design","score_opus":0.055439776905385395,"score_gpt":0.2888677037111156,"score_spread":0.23342792680573018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233755731","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.0000042084052,0.0040698154,0.066788785,0.0010109164,0.018112605,0.0019826014,0.007730123,0.00037284908,0.8999281],"genre_scores_gemma":[0.0090608075,0.012273836,0.010751276,0.0021475023,0.0043776915,0.00072126044,0.025413051,0.00032911243,0.93492544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960507,0.000098073346,0.0008075377,0.001420523,0.0012353483,0.00038782024],"domain_scores_gemma":[0.99495786,0.00031347308,0.0005945266,0.003915091,0.00014503881,0.00007402898],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010112807,0.00058755034,0.00047974222,0.0003755842,0.00018252357,0.00056232035,0.008068312,0.00011635564,0.0001626012],"category_scores_gemma":[0.00010644748,0.0004432126,0.00007886425,0.00012309835,0.0002790249,0.00392499,0.0030875946,0.00057913375,0.00039994656],"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.0001062029,0.000056111858,0.000006774329,0.0001335121,0.000088644556,0.00015248929,0.000082008,0.00048549927,5.674479e-7,0.96915925,0.008424511,0.021304449],"study_design_scores_gemma":[0.00029537917,0.0001107086,0.000004653487,0.0012845679,0.000016337619,0.00002799141,0.000045852583,0.007475005,0.0000026283064,0.01900057,0.9712248,0.00051152223],"about_ca_topic_score_codex":0.00016950566,"about_ca_topic_score_gemma":0.0008185063,"teacher_disagreement_score":0.96280026,"about_ca_system_score_codex":0.0002284457,"about_ca_system_score_gemma":0.00007923038,"threshold_uncertainty_score":0.999802},"labels":[],"label_agreement":null},{"id":"W4233789597","doi":"10.1007/978-1-4939-7131-2_100901","title":"Preference Propagation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Preference; Mathematics; Statistics","score_opus":0.05099018862218241,"score_gpt":0.22651968490105398,"score_spread":0.17552949627887157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233789597","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":[1.7302334e-7,0.000012423455,0.36322692,0.00011329555,0.00023375804,0.00011567307,0.0000025941222,0.00015677878,0.6361384],"genre_scores_gemma":[0.000038665203,0.0000312171,0.035239697,0.00018437002,0.0001994037,0.0000041519907,0.000041695625,0.000009234906,0.9642516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910927,0.0000034083919,0.0001332788,0.000391682,0.00024630292,0.000116033894],"domain_scores_gemma":[0.9990972,0.0000082254455,0.000086952685,0.00070550165,0.000065978646,0.0000361157],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009830486,0.00014680957,0.00010461381,0.00008788953,0.000043178577,0.0002354011,0.0010734017,0.000075414326,0.0013239308],"category_scores_gemma":[0.000003465464,0.00011951367,0.000034785357,0.000022976063,0.000034722038,0.0005501371,0.0005942136,0.000082738,0.004088167],"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":[2.540897e-7,0.000002429391,1.8425096e-7,0.00000844144,0.000008611821,0.0000027260444,0.000013785688,4.1931713e-8,8.2647733e-7,0.86138934,0.055018887,0.0835545],"study_design_scores_gemma":[0.000051471885,0.000053738248,0.000006578598,0.000040766357,0.0000067991787,0.0000011973478,4.6656416e-7,0.00399627,0.00004543146,0.14706069,0.8485218,0.00021478251],"about_ca_topic_score_codex":0.0000019611607,"about_ca_topic_score_gemma":0.0000042345873,"teacher_disagreement_score":0.7935029,"about_ca_system_score_codex":0.00001658007,"about_ca_system_score_gemma":0.000025024625,"threshold_uncertainty_score":0.99958897},"labels":[],"label_agreement":null},{"id":"W4234739062","doi":"10.22215/etd/2005-07989","title":"Parallel implementation of bisector epsilon-approximation shortest path algorithm for concurrent queries","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; University of Ottawa; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Computer science; Path (computing); Combinatorics; Mathematics; Algorithm; Theoretical computer science; Operating system","score_opus":0.02094093202601259,"score_gpt":0.3157385165097247,"score_spread":0.29479758448371207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234739062","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.0006724029,0.00020074213,0.993787,0.000109152854,0.0015209774,0.0015032997,0.00032796818,0.0001581978,0.001720275],"genre_scores_gemma":[0.008515755,0.00030419507,0.96030253,0.00008926825,0.000323941,0.0008081172,0.02299917,0.00005189757,0.0066051506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798805,0.000028644286,0.0006709375,0.00056700857,0.00044286923,0.00030249232],"domain_scores_gemma":[0.9986347,0.00005579226,0.0005396465,0.00045325092,0.00025478902,0.00006184921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026743862,0.0003184777,0.0003713727,0.0002560687,0.00010416073,0.00022627733,0.00078890927,0.00011402484,0.00012021261],"category_scores_gemma":[0.000010856376,0.0003001458,0.00015987532,0.0002584093,0.000020527697,0.0011378439,0.00008589985,0.00009278898,0.000013160956],"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.000004190917,0.000084865576,0.000040656025,0.00013858508,0.00006983585,6.0603804e-7,0.0005030055,0.000009379492,0.00004825617,0.05241736,0.0056542256,0.941029],"study_design_scores_gemma":[0.0051633953,0.0013947327,0.0148914885,0.00039317145,0.00043728735,0.0000036876168,0.008851714,0.86881834,0.015732856,0.0051099644,0.07647349,0.002729856],"about_ca_topic_score_codex":0.00010620653,"about_ca_topic_score_gemma":0.00048197256,"teacher_disagreement_score":0.9382992,"about_ca_system_score_codex":0.000056350636,"about_ca_system_score_gemma":0.00012595725,"threshold_uncertainty_score":0.99994504},"labels":[],"label_agreement":null},{"id":"W4235981791","doi":"10.1007/978-1-4939-7131-2_101245","title":"Spatiotemporal Context-Aware Recommendation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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; Context (archaeology); Geography; Archaeology","score_opus":0.03487420251450731,"score_gpt":0.2421463464023778,"score_spread":0.2072721438878705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235981791","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":[1.6777774e-7,0.0000095326495,0.39952677,0.0012626019,0.00064192334,0.00012641287,0.000019836669,0.00018709827,0.59822565],"genre_scores_gemma":[0.00019959698,0.000038176604,0.01438407,0.0013006103,0.00038822513,0.0000039679076,0.0006265176,0.000020514195,0.9830383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989123,0.000008810535,0.00024252734,0.00048454278,0.00019660871,0.00015525373],"domain_scores_gemma":[0.9990238,0.000021073243,0.00017462586,0.00063450326,0.00008854012,0.000057488644],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017723218,0.00021894305,0.00018473007,0.00014478731,0.0000775986,0.00028755702,0.00089630677,0.00012594933,0.0064350357],"category_scores_gemma":[0.0000038421936,0.00020006044,0.000072542985,0.00002880943,0.000040822022,0.00077954447,0.00061174587,0.00012855994,0.0035325019],"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":[6.753713e-7,0.000003969085,0.0000012147445,0.0000062643626,0.000020448286,0.0000036408505,0.00001888802,1.752035e-8,6.2637554e-8,0.35665515,0.29256332,0.35072637],"study_design_scores_gemma":[0.00012458436,0.0000584092,0.0000063379894,0.00003149528,0.000008267131,0.0000013854384,0.000004071708,0.00461196,0.000012792425,0.032788154,0.96208715,0.00026537818],"about_ca_topic_score_codex":0.000021593341,"about_ca_topic_score_gemma":0.00005138431,"teacher_disagreement_score":0.66952384,"about_ca_system_score_codex":0.00003754801,"about_ca_system_score_gemma":0.000028447508,"threshold_uncertainty_score":0.99724334},"labels":[],"label_agreement":null},{"id":"W4237406792","doi":"10.1007/978-1-4939-7131-2_101314","title":"Task-Based Search","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Task (project management); Computer science; Engineering; Systems engineering","score_opus":0.03424247913284766,"score_gpt":0.2480588993063463,"score_spread":0.21381642017349864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237406792","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":[1.2963605e-7,0.000019264951,0.3697029,0.0004886385,0.00025605873,0.000092480426,0.000009208024,0.00017228104,0.62925905],"genre_scores_gemma":[0.000018059478,0.000015161513,0.05092423,0.0009516436,0.00026755503,0.0000022165066,0.00006438725,0.000017463124,0.9477393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987093,0.000006560959,0.00014368838,0.0005027465,0.0004177141,0.00021998136],"domain_scores_gemma":[0.9986789,0.00002637588,0.000045242094,0.0011026944,0.000070995564,0.00007579175],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020733445,0.00019241798,0.00015345067,0.00018569521,0.000063264844,0.00031608643,0.0017578317,0.000096902695,0.0030905926],"category_scores_gemma":[0.0000024036822,0.00016367476,0.00008061873,0.00003940742,0.00006978676,0.00027970102,0.0007633379,0.00014430782,0.007868345],"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":[7.3593594e-7,0.000006801256,4.5452634e-7,0.000015327916,0.000020215952,0.000029981738,0.000010338192,8.09433e-7,0.0000012501739,0.7356297,0.20931558,0.054968838],"study_design_scores_gemma":[0.00011234027,0.000062885054,0.0000022757715,0.000029229634,0.0000065322215,7.129355e-7,5.5254486e-7,0.015570748,0.000040961007,0.021604829,0.96231997,0.00024898324],"about_ca_topic_score_codex":0.000007839226,"about_ca_topic_score_gemma":0.000005307615,"teacher_disagreement_score":0.7530044,"about_ca_system_score_codex":0.00002362365,"about_ca_system_score_gemma":0.00006023668,"threshold_uncertainty_score":0.99782073},"labels":[],"label_agreement":null},{"id":"W4239171964","doi":"10.1007/s00454-011-9347-7","title":"Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Killam Trusts; Dalhousie University; Canada Research Chairs","keywords":"Computer science; Cache; Range (aeronautics); Space (punctuation); Information retrieval; Parallel computing; Materials science; Operating system","score_opus":0.03748508906001073,"score_gpt":0.2570956064961202,"score_spread":0.21961051743610943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239171964","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.15691869,0.00013649702,0.83639634,0.00040357918,0.00021120248,0.00019232433,0.000018662711,0.00030514877,0.0054175365],"genre_scores_gemma":[0.62596977,0.0000047903754,0.3730882,0.00016409109,0.00009536226,0.000014710711,0.00010269009,0.000018249722,0.0005421247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997728,0.00004979808,0.0005795725,0.0006075105,0.0006323329,0.0004028047],"domain_scores_gemma":[0.9986195,0.00009255768,0.00048751917,0.0004985522,0.00017421633,0.00012765675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720639,0.00024088123,0.0002642665,0.0003064649,0.0002297016,0.0003148393,0.0007727019,0.000047144073,0.000079945574],"category_scores_gemma":[0.00012997667,0.00020035262,0.00008705533,0.0009342941,0.00014133575,0.0016081772,0.00048294629,0.00016233239,0.00006550863],"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.00031944836,0.00079741626,0.19578859,0.00034869957,0.000978919,0.002945813,0.0138707785,0.050014704,0.000084825006,0.64339936,0.0076064235,0.08384503],"study_design_scores_gemma":[0.002487352,0.0011538096,0.3814673,0.00022942924,0.00012169343,0.00042528918,0.0017740155,0.58858466,0.0006313262,0.012613587,0.00830674,0.002204778],"about_ca_topic_score_codex":0.00016933792,"about_ca_topic_score_gemma":0.000009775828,"teacher_disagreement_score":0.63078576,"about_ca_system_score_codex":0.00003027778,"about_ca_system_score_gemma":0.00007960844,"threshold_uncertainty_score":0.8170143},"labels":[],"label_agreement":null},{"id":"W4239565922","doi":"10.5220/0008124300002366","title":"A New Data Structure for Processing Natural Language Database Queries","year":2019,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Computer science; Database; Information retrieval; Database design; Data structure; Database theory; Data definition language; Natural language processing; Programming language","score_opus":0.017211160907278516,"score_gpt":0.28174308514309687,"score_spread":0.26453192423581834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239565922","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.0014710679,0.00046005394,0.9946133,0.00084025867,0.0005576953,0.000319452,0.00018074208,0.00020488245,0.0013525466],"genre_scores_gemma":[0.073118046,0.0000026758294,0.906526,0.00068887294,0.00020449195,0.0000020571704,0.0014460656,0.000009043815,0.018002734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991755,0.0000059600948,0.000086151085,0.0004097164,0.00014372494,0.00017893717],"domain_scores_gemma":[0.99866813,0.000020068423,0.000037367583,0.0012167179,0.000017502307,0.00004018505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009281547,0.00008898293,0.00008403132,0.000041338506,0.000048551894,0.00044555025,0.0019927355,0.000015437032,0.00008580098],"category_scores_gemma":[0.00002017818,0.00006600099,0.000012837434,0.00015755881,0.0000075804687,0.0034945642,0.0013664828,0.000057692618,0.000029324163],"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.0000069627454,0.000009177581,0.00010932194,0.000119002114,0.00001534755,0.000005532293,0.00035073402,0.000001999668,0.001542752,0.034301862,0.08951709,0.8740202],"study_design_scores_gemma":[0.0010549463,0.00004835386,0.00037919622,0.000053202304,0.000016881286,0.00000878733,0.00045049534,0.7661271,0.002322069,0.0012585416,0.22780848,0.0004719636],"about_ca_topic_score_codex":0.000068592904,"about_ca_topic_score_gemma":0.00007377757,"teacher_disagreement_score":0.87354827,"about_ca_system_score_codex":0.0000055597357,"about_ca_system_score_gemma":0.0000516636,"threshold_uncertainty_score":0.42964512},"labels":[],"label_agreement":null},{"id":"W4240507166","doi":"10.1145/584865.584867","title":"Discovering approximate keys in XML data","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; XML; Document Structure Description; Information retrieval; Key (lock); XML validation; XML database; Streaming XML; Well-formed document; Set (abstract data type); XML Encryption; Representation (politics); Search engine indexing; XML Schema Editor; Data mining; Database; World Wide Web; Programming language; Computer security","score_opus":0.08292524527261654,"score_gpt":0.25329512341279864,"score_spread":0.17036987814018212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240507166","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.0015861682,0.000059257123,0.90942734,0.001415258,0.00021157452,0.00009746827,0.0000072227904,0.00016214896,0.08703353],"genre_scores_gemma":[0.5971149,0.00019412805,0.38444024,0.00089420594,0.00013766994,0.000012869037,0.00009034307,0.000015989053,0.017099619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929154,0.0000097309585,0.00009710957,0.00031203186,0.00011924849,0.00017032174],"domain_scores_gemma":[0.99882287,0.000011019752,0.00001637829,0.0011226352,0.0000026934542,0.00002440999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001510021,0.000057861664,0.000059144455,0.000060101334,0.000021698806,0.00025995605,0.001976789,0.000009622602,0.00009981386],"category_scores_gemma":[0.00000859152,0.00004830179,0.000007768351,0.0002495216,0.000009440156,0.0023809206,0.0020776938,0.000042640357,0.00022563925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.248675e-7,0.00021154097,0.0021941063,0.00003334843,0.000014305893,0.00010579561,0.0004686862,0.000118526026,0.000052617106,0.22326826,0.035920702,0.7376114],"study_design_scores_gemma":[0.00013579756,0.000005487416,0.0004993644,0.000005825838,7.2883955e-7,9.3083815e-7,0.000022855997,0.98215836,0.000036275233,0.00074285147,0.016300466,0.000091024696],"about_ca_topic_score_codex":0.000055116845,"about_ca_topic_score_gemma":0.000029533525,"teacher_disagreement_score":0.98203987,"about_ca_system_score_codex":0.0000071845343,"about_ca_system_score_gemma":0.000001520402,"threshold_uncertainty_score":0.36733988},"labels":[],"label_agreement":null},{"id":"W4240799125","doi":"10.22215/etd/2006-07651","title":"Generating longitudinally correlated binary data","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Canadian Heritage","funders":"","keywords":"Binary number; Physics; Humanities; Arithmetic; Computer science; Mathematics; Art","score_opus":0.03229451580461643,"score_gpt":0.2786084530962388,"score_spread":0.24631393729162235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240799125","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.006414741,0.0013820108,0.683332,0.00035622573,0.008851338,0.00074071507,0.00014874445,0.0015523002,0.29722187],"genre_scores_gemma":[0.003266389,0.00010438124,0.30326962,0.0002978931,0.00063885277,0.000021004522,0.12121844,0.00006114735,0.5711222],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981837,0.000025419056,0.00031600028,0.0008612643,0.00035674125,0.0002568309],"domain_scores_gemma":[0.9977578,0.000024551506,0.00018138021,0.0019276938,0.00006678909,0.00004180679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023282466,0.00024300041,0.00020142211,0.00017692927,0.00015522659,0.00067699497,0.0038267053,0.00012792938,0.000085711756],"category_scores_gemma":[0.000017364211,0.00022332334,0.000039239363,0.0004080447,0.0000080674245,0.0014734009,0.0009247676,0.00021295743,0.00032411845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046317023,0.00013020459,0.00010201255,0.00010881363,0.00011898254,0.00025574732,0.00006653923,0.00036132723,0.00022970652,0.01343333,0.7960153,0.18917339],"study_design_scores_gemma":[0.00020476832,0.00003871297,0.0019081838,0.00007917274,0.00005366613,0.0000034279237,0.000038525643,0.9699422,0.00007089751,0.00022133085,0.026899269,0.0005398201],"about_ca_topic_score_codex":0.00022801587,"about_ca_topic_score_gemma":0.0003422531,"teacher_disagreement_score":0.9695809,"about_ca_system_score_codex":0.000017997783,"about_ca_system_score_gemma":0.000068880676,"threshold_uncertainty_score":0.91068614},"labels":[],"label_agreement":null},{"id":"W4241057454","doi":"10.1007/978-1-4939-7131-2_100407","title":"Geodesic Distance: Graph Theoretic Distance","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Geodesic; Mathematics; Graph; Combinatorics; Computer science; Geometry","score_opus":0.012596886361347901,"score_gpt":0.21546677841841333,"score_spread":0.20286989205706543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241057454","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":[2.2819053e-7,0.0002032333,0.49512666,0.00014869904,0.00044581774,0.00013280295,0.000019675126,0.00020616801,0.5037167],"genre_scores_gemma":[0.00035628836,0.00038543929,0.022122424,0.000481954,0.0003104327,0.0000110415795,0.000079947524,0.00004057364,0.9762119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978915,0.000012144991,0.0003090031,0.0008949527,0.0005124654,0.00037997478],"domain_scores_gemma":[0.99776614,0.00004453128,0.00018502196,0.0018145707,0.00007942909,0.00011033437],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002309004,0.00041475095,0.000325554,0.00015621044,0.00013903528,0.0004768357,0.0025797368,0.00013390608,0.0017550961],"category_scores_gemma":[0.0000063653124,0.00034121357,0.00016783258,0.00009449711,0.0003527534,0.00060298527,0.00077630684,0.00021220761,0.0017958023],"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.000002223628,0.000007864026,0.0000011319917,0.000025285812,0.00003112802,0.000027335305,0.000033542256,2.2376136e-7,1.3897976e-7,0.9288958,0.052737687,0.018237645],"study_design_scores_gemma":[0.00008553973,0.000041051928,0.000002710134,0.0000650378,0.000015435751,0.0000014921692,0.0000024973958,0.00093631126,0.0000038306703,0.5171603,0.48136467,0.00032114997],"about_ca_topic_score_codex":0.0000025667905,"about_ca_topic_score_gemma":0.00002115559,"teacher_disagreement_score":0.47300422,"about_ca_system_score_codex":0.000042029093,"about_ca_system_score_gemma":0.00003715992,"threshold_uncertainty_score":0.999904},"labels":[],"label_agreement":null},{"id":"W4241572164","doi":"10.32920/14639637","title":"Personalized Multi-Criteria Decision Strategies in Location-based Decision Support","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision support system; Space (punctuation); Outcome (game theory); Decision analysis; Decision model; Operator (biology); Data mining; Machine learning; Artificial intelligence; Operations research; Mathematics","score_opus":0.040734581604727885,"score_gpt":0.3292917507183061,"score_spread":0.2885571691135782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241572164","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.005169174,0.00018210686,0.99119985,0.00032587638,0.0014721507,0.0003988715,0.000012848722,0.00019495384,0.001044147],"genre_scores_gemma":[0.13496448,0.000077196164,0.862954,0.00043075957,0.000056239795,0.00006572614,0.0005138673,0.000019227453,0.0009185021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700767,0.00010317218,0.00061076,0.0012402398,0.00068484305,0.00035331942],"domain_scores_gemma":[0.99763095,0.0002504478,0.0001585142,0.0016040883,0.00025412202,0.000101883874],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007944152,0.0003611288,0.0004278982,0.0004753626,0.000073208495,0.002683889,0.002302122,0.0002070062,0.0006659331],"category_scores_gemma":[0.00012728936,0.00033449935,0.00014346984,0.00064814155,0.000050845752,0.0012034831,0.0026558335,0.00035117802,0.000100951205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106481,0.0015998237,0.0013671374,0.00059363653,0.00009898484,0.0009971517,0.0019093362,0.02517914,0.00017985204,0.034758966,0.01642048,0.916789],"study_design_scores_gemma":[0.0016227566,0.000036551846,0.0059910715,0.00052379613,0.000012034283,0.00000243226,0.00048492703,0.9826259,0.00013300373,0.0043041967,0.0036842057,0.0005790957],"about_ca_topic_score_codex":0.0002977709,"about_ca_topic_score_gemma":0.00048232055,"teacher_disagreement_score":0.9574468,"about_ca_system_score_codex":0.000112552545,"about_ca_system_score_gemma":0.00076237257,"threshold_uncertainty_score":0.9999107},"labels":[],"label_agreement":null},{"id":"W4242283844","doi":"10.1007/978-1-4939-7131-2_101248","title":"Spatio-temporal Querying of Big Data and Results Summarization","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Automatic summarization; Computer science; Big data; Information retrieval; Data mining","score_opus":0.08041800393860918,"score_gpt":0.258592237879088,"score_spread":0.17817423394047885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242283844","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.0000036337706,0.0000610373,0.43712762,0.00026330235,0.0005320664,0.00015865733,0.0003194597,0.00007711636,0.5614571],"genre_scores_gemma":[0.0013672874,0.000338463,0.11349244,0.00015920834,0.00064215745,0.000001219318,0.007904488,0.000027487013,0.8760673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868333,0.000008789656,0.00037678372,0.00057147996,0.00025623717,0.000103370934],"domain_scores_gemma":[0.9979773,0.00003390918,0.00030703773,0.0015715586,0.000072744515,0.000037449783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004360978,0.00015146552,0.00017979115,0.00016417912,0.000044882105,0.00017196113,0.0013468179,0.00008333229,0.0000350466],"category_scores_gemma":[0.00003075604,0.00013538009,0.000017290178,0.000046412675,0.000070602946,0.0007324728,0.0025815074,0.0000666136,0.00003439223],"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.0000150820415,0.000014475227,0.00011092033,0.00009860486,0.000072098956,0.000011526738,0.00012907833,5.7734616e-7,0.0000017324061,0.45346594,0.12647012,0.41960984],"study_design_scores_gemma":[0.00030034664,0.000063113315,0.000043181735,0.00013065686,0.000022984943,0.000001236923,0.0000038915446,0.036459424,0.00001962105,0.015658295,0.9470329,0.0002643156],"about_ca_topic_score_codex":0.000102929116,"about_ca_topic_score_gemma":0.00023376454,"teacher_disagreement_score":0.82056284,"about_ca_system_score_codex":0.00000754101,"about_ca_system_score_gemma":0.00003398254,"threshold_uncertainty_score":0.552064},"labels":[],"label_agreement":null},{"id":"W4242613513","doi":"10.1007/978-0-387-39940-9_3665","title":"Spatio-Temporal Stream Processing","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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; Stream processing; Parallel computing","score_opus":0.017612522034230034,"score_gpt":0.23660218689026782,"score_spread":0.2189896648560378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242613513","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.000005855113,0.0028825677,0.062590614,0.00008040472,0.0014511872,0.0007288703,0.0009236753,0.00027364408,0.9310632],"genre_scores_gemma":[0.001040907,0.0018762936,0.032153957,0.00007164669,0.0016318448,0.000031363797,0.0063725593,0.000089865105,0.95673156],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970015,0.000034801906,0.0008601605,0.000861492,0.00088601594,0.0003560095],"domain_scores_gemma":[0.9970209,0.00004456857,0.0008707439,0.0017585097,0.00015309085,0.00015216158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004689248,0.00049552374,0.00066853815,0.0003774403,0.000096446674,0.00024360947,0.0018704601,0.00017285421,0.000050260795],"category_scores_gemma":[0.000023119663,0.00046824937,0.00012860307,0.00012886815,0.000064742875,0.0016048962,0.0006656831,0.00030640935,0.00019203997],"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.000010516326,0.00011510845,0.000096303105,0.001477228,0.00011723838,0.00031680416,0.00019155032,0.000025132746,0.0000024465721,0.31817085,0.12188408,0.55759275],"study_design_scores_gemma":[0.00024259613,0.00009185235,0.000015542371,0.0011271507,0.00005331251,0.000011777775,0.000013075764,0.0045735054,0.0000045941138,0.0008924173,0.9924199,0.0005542804],"about_ca_topic_score_codex":0.00014071006,"about_ca_topic_score_gemma":0.00003101287,"teacher_disagreement_score":0.8705358,"about_ca_system_score_codex":0.000053569034,"about_ca_system_score_gemma":0.00020812801,"threshold_uncertainty_score":0.9997769},"labels":[],"label_agreement":null},{"id":"W4242716906","doi":"10.1007/978-1-4939-7131-2_100943","title":"Querying and Summarizing Social Networks Posts with Respect to Spatial and Temporal Dimensions","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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; Data science; Geography; Cartography","score_opus":0.020847042173267383,"score_gpt":0.23417018421835104,"score_spread":0.21332314204508365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242716906","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.0003525761,0.00019639314,0.72034854,0.0016806641,0.0005237417,0.00065522204,0.000020280284,0.00030716107,0.27591544],"genre_scores_gemma":[0.06238891,0.00025122962,0.24200214,0.004111673,0.0039007335,0.000023775823,0.00021844309,0.00019076758,0.6869123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986326,0.000013724844,0.00018155832,0.0006504899,0.0002520915,0.00026951206],"domain_scores_gemma":[0.99935794,0.00004176396,0.000095894065,0.0003271045,0.000049210288,0.00012809022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020624934,0.00027502747,0.00026867492,0.00016740925,0.0003221481,0.0005488157,0.00035476746,0.00011668856,0.000040590814],"category_scores_gemma":[0.0000045135653,0.00022112149,0.000028441282,0.00005327238,0.00010561608,0.00038255387,0.0014001492,0.00018476123,0.000017864035],"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.000101305326,0.000025386571,0.0008911496,0.00005547141,0.0002925237,0.00034557885,0.0010611517,0.0000051430984,0.000010456815,0.65587884,0.07222776,0.26910523],"study_design_scores_gemma":[0.0025870306,0.0023809022,0.004617349,0.0013253379,0.0003271959,0.00011939793,0.00012903199,0.08883835,0.000024774707,0.033480696,0.86152786,0.004642049],"about_ca_topic_score_codex":0.0002167142,"about_ca_topic_score_gemma":0.0008287447,"teacher_disagreement_score":0.78930014,"about_ca_system_score_codex":0.00002179238,"about_ca_system_score_gemma":0.000024065377,"threshold_uncertainty_score":0.9017073},"labels":[],"label_agreement":null},{"id":"W4242803917","doi":"10.1002/9781118786352.wbieg0454","title":"Data Structure: Spatial Data on the Web","year":2017,"lang":"en","type":"other","venue":"International Encyclopedia of Geography","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; The Internet; Spatial analysis; Web mapping; GRASP; Heading (navigation); Service (business); Geographic information system; World Wide Web; Database; Geography; Cartography; Web navigation; Remote sensing","score_opus":0.02569035306180688,"score_gpt":0.27781368929499384,"score_spread":0.25212333623318695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242803917","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.0000027505828,0.00028599275,0.01571498,0.0021181942,0.005804719,0.00027299175,0.018672151,0.000116195726,0.957012],"genre_scores_gemma":[0.0030319523,0.023358898,0.056804623,0.0021098214,0.012878381,0.000045292036,0.055833247,0.0005825752,0.8453552],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781936,0.00003987629,0.00022417004,0.0008632569,0.00086741813,0.00018591543],"domain_scores_gemma":[0.9918391,0.0000944808,0.0005523397,0.0074243057,0.000046141908,0.00004360709],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0002897674,0.00025443357,0.00021198693,0.00044599458,0.000074473974,0.00029230418,0.027493447,0.000102572274,0.0009079185],"category_scores_gemma":[0.00014919048,0.00017882984,0.00006629957,0.000114352486,0.00016140076,0.0006350031,0.007501948,0.00023995091,0.00006921838],"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.0000024808007,0.00003544591,0.00038944275,0.000009449843,0.00024303191,0.000010108621,0.0000036560348,4.7060257e-7,4.2547754e-7,0.008285225,0.90630573,0.08471455],"study_design_scores_gemma":[0.00016914056,0.000017252056,0.00089648506,0.00011067364,0.000026522508,0.0000012772658,0.0000012521849,0.006196698,9.341078e-7,0.0009288176,0.99145746,0.00019347704],"about_ca_topic_score_codex":0.0008138447,"about_ca_topic_score_gemma":0.000786278,"teacher_disagreement_score":0.111656815,"about_ca_system_score_codex":0.000005535873,"about_ca_system_score_gemma":0.000064473876,"threshold_uncertainty_score":0.9941071},"labels":[],"label_agreement":null},{"id":"W4243973573","doi":"10.1007/s41019-017-0053-1","title":"Sliding Window Top-K Monitoring over Distributed Data Streams","year":2017,"lang":"en","type":"article","venue":"Data Science and Engineering","topic":"Data Management and Algorithms","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":"York University","funders":"National Key Research and Development Program of China; Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Sliding window protocol; Distributed computing; Overhead (engineering); Data stream mining; Distributed Computing Environment; Distributed algorithm; Aggregate (composite); Window (computing); Data stream; Real-time computing; Data mining; Database; Operating system","score_opus":0.06100806266574163,"score_gpt":0.2964756951502873,"score_spread":0.2354676324845457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243973573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110952236,0.0003019855,0.8813727,0.0010429416,0.0035425103,0.00025004585,0.0014274786,0.00044445758,0.00066565775],"genre_scores_gemma":[0.9587761,0.00013897356,0.040398516,0.00001713022,0.00030232928,0.0000023208524,0.0003348603,0.000007696809,0.00002208261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982539,0.0000031604466,0.000121339,0.00078739616,0.00044433118,0.0003898717],"domain_scores_gemma":[0.9946198,0.000026019477,0.000059880298,0.0051323585,0.000030609586,0.00013136712],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["scholarly_communication","open_science"],"category_scores_codex":[0.0010963974,0.00012169081,0.00010512486,0.00009794666,0.0007027101,0.0031264392,0.010981954,0.00001973652,0.0000016858763],"category_scores_gemma":[0.0004513682,0.00011328382,0.0000063272973,0.00027431472,0.00008403722,0.017487697,0.013336392,0.00009992831,0.000007220816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030978574,0.00007361923,0.04368083,0.00011982535,0.000065403234,0.00017399086,0.0003049994,0.0007323258,0.018088695,0.034617417,0.006391246,0.89574856],"study_design_scores_gemma":[0.00016248785,0.000008438465,0.07451992,0.000056315705,0.0000073695774,0.000005125585,0.00002392729,0.9027177,0.000720812,0.000028375955,0.021521224,0.00022831025],"about_ca_topic_score_codex":0.00008497927,"about_ca_topic_score_gemma":0.0000018443773,"teacher_disagreement_score":0.90198535,"about_ca_system_score_codex":0.000023093624,"about_ca_system_score_gemma":0.00003921987,"threshold_uncertainty_score":0.9979084},"labels":[],"label_agreement":null},{"id":"W4243988023","doi":"10.1007/978-1-4939-7131-2_100606","title":"Link-Based Ranking","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Ranking (information retrieval); Computer science; Information retrieval","score_opus":0.02552812000136311,"score_gpt":0.2264357580925119,"score_spread":0.20090763809114878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243988023","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.0773732e-8,0.000029381172,0.43718836,0.00043382862,0.0004212559,0.00007259081,0.0000030859615,0.00020249444,0.56164896],"genre_scores_gemma":[0.000017907329,0.00001326459,0.09424095,0.0014250115,0.00060050184,0.000002152002,0.000046414265,0.000019293344,0.9036345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988554,0.000004619194,0.00017331952,0.00047104617,0.00031218684,0.00018340192],"domain_scores_gemma":[0.9987945,0.000029301998,0.0000941189,0.0009780326,0.000053248827,0.000050830204],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018286235,0.000208072,0.00017289826,0.00016600119,0.00006820083,0.00032998697,0.0015247255,0.00011313589,0.002164704],"category_scores_gemma":[0.0000037561013,0.0001800753,0.00009730329,0.00003215643,0.000046196456,0.00029988802,0.0005488556,0.0001328279,0.0033570107],"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":[7.1109514e-7,0.0000030642273,4.345028e-7,0.000014248677,0.00002209813,0.00002518338,0.000010183743,8.508252e-7,5.1665035e-7,0.77300036,0.067405745,0.15951659],"study_design_scores_gemma":[0.00014629129,0.00003572481,0.0000016473497,0.000060437975,0.000010843541,6.3525715e-7,2.2972831e-7,0.0160799,0.00002324041,0.052228652,0.9311498,0.0002626264],"about_ca_topic_score_codex":0.0000032023993,"about_ca_topic_score_gemma":0.000004291052,"teacher_disagreement_score":0.863744,"about_ca_system_score_codex":0.000018922165,"about_ca_system_score_gemma":0.000036066736,"threshold_uncertainty_score":0.99874747},"labels":[],"label_agreement":null},{"id":"W4245107420","doi":"10.14778/3236187.3269462","title":"Efficient construction of approximate ad-hoc ML models through materialization and reuse","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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; Online analytical processing; Reuse; Dimension (graph theory); Cluster analysis; Data mining; Variety (cybernetics); Construct (python library); Data warehouse; Mixture model; Machine learning; Artificial intelligence; Mathematics","score_opus":0.0167162247919843,"score_gpt":0.22005666246918465,"score_spread":0.20334043767720034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245107420","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.8782429,0.0001761049,0.11153561,0.0012548182,0.0011440531,0.0009492957,0.000020523074,0.00014041924,0.0065362365],"genre_scores_gemma":[0.857347,0.00012030771,0.14233345,0.000053859596,0.000046469795,0.00001767999,0.0000014892881,0.000008131737,0.00007159434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990968,0.0000052533956,0.00024215007,0.00024535749,0.0002692093,0.00014120842],"domain_scores_gemma":[0.99929297,0.0000054379566,0.0002692447,0.00024777793,0.00016338463,0.000021155745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023166873,0.00009892955,0.00013054845,0.000053211403,0.000087751745,0.00009616457,0.00074541685,0.000024670964,0.000004329851],"category_scores_gemma":[0.000021527581,0.00007025754,0.0000279853,0.00025121451,0.00017364838,0.00044867917,0.0010269454,0.000027420587,0.0000014436985],"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.00006234717,0.00019497969,0.00020988885,0.0004396009,0.00007376381,1.9723541e-7,0.0067503527,0.00017533051,0.06799204,0.90664,0.0017095257,0.015752012],"study_design_scores_gemma":[0.0010513441,0.00029108985,0.00022954712,0.00024001939,0.000055432443,0.000013376674,0.0005180683,0.3404569,0.5452298,0.10984698,0.0018106686,0.000256773],"about_ca_topic_score_codex":0.000010669031,"about_ca_topic_score_gemma":2.0500302e-7,"teacher_disagreement_score":0.796793,"about_ca_system_score_codex":0.00001998862,"about_ca_system_score_gemma":0.000007353367,"threshold_uncertainty_score":0.28650194},"labels":[],"label_agreement":null},{"id":"W4245210711","doi":"10.1145/376284.375666","title":"Iceberg-cube computation with PC clusters","year":2001,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Data Management and Algorithms","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 British Columbia Hospital","funders":"","keywords":"Computer science; Computation; Cube (algebra); Cuboid; Parallel computing; Algorithm; Data cube; Data mining; Mathematics","score_opus":0.020947862199152976,"score_gpt":0.246467051847856,"score_spread":0.22551918964870302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245210711","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.033772737,0.000022543763,0.95373136,0.002843852,0.00059167045,0.00020096403,0.0000014257735,0.00028749465,0.008547944],"genre_scores_gemma":[0.47282907,0.00011158727,0.51725453,0.002190662,0.00038639896,0.00003913827,0.000075760865,0.000037616912,0.0070752176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988676,0.00003681889,0.00015780146,0.0004066963,0.0002555898,0.00027551697],"domain_scores_gemma":[0.9989706,0.00008267341,0.00008535161,0.0007390859,0.00004721163,0.000075051226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016443193,0.00013943041,0.00012809748,0.00011544859,0.000114820505,0.00025654197,0.0012268721,0.000032114895,0.000026365493],"category_scores_gemma":[0.00002370938,0.00011460221,0.000034357377,0.0005057715,0.000030775293,0.0011550363,0.00050437107,0.00009264735,0.00017908686],"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.00002103898,0.000065014705,0.0030394008,0.0000110079645,0.000037690614,0.0000837494,0.00017784692,0.00038507918,0.000021383861,0.0018481325,0.015463976,0.97884566],"study_design_scores_gemma":[0.0028081778,0.00094332075,0.012947051,0.00010116142,0.000054349675,0.00010116076,0.00018675312,0.69024825,0.00019471943,0.01520523,0.27602318,0.00118666],"about_ca_topic_score_codex":0.000088330344,"about_ca_topic_score_gemma":0.00007430787,"teacher_disagreement_score":0.97765905,"about_ca_system_score_codex":0.000028185535,"about_ca_system_score_gemma":0.0000190466,"threshold_uncertainty_score":0.46733424},"labels":[],"label_agreement":null},{"id":"W4245730866","doi":"10.1137/1.9781611973105.18","title":"Adaptive and Approximate Orthogonal Range Counting","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Natural Sciences and Engineering Research Council of Canada; Center for Massive Data Algorithmics","keywords":"Range (aeronautics); Computer science; Algorithm; Mathematics; Engineering","score_opus":0.015671469470899358,"score_gpt":0.20491975323049333,"score_spread":0.18924828375959396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245730866","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.010023399,0.00004257173,0.94088864,0.00067964353,0.00009702773,0.00017116625,0.0000012385686,0.00015562738,0.04794067],"genre_scores_gemma":[0.6155651,0.00002442951,0.37686044,0.0012649283,0.000098747514,0.000042291522,0.0000058029655,0.0000083612995,0.0061298986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947757,0.000008942762,0.00006954399,0.000188758,0.00011258557,0.0001425921],"domain_scores_gemma":[0.9997297,0.000018959025,0.000023030736,0.00016574354,0.000026126796,0.000036429734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011984532,0.000058732752,0.00005602415,0.00003394673,0.00005885054,0.00031753688,0.0002764649,0.000011468223,0.000087629036],"category_scores_gemma":[0.0000040828486,0.0000454312,0.000010914705,0.0000989769,0.000021045835,0.001317707,0.00036104248,0.000033597928,0.00016481607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010400747,0.000029461235,0.0028767535,0.0000141798955,0.000021255646,0.000007431885,0.0001944926,0.000003422818,0.00005171062,0.6300528,0.012658607,0.3540888],"study_design_scores_gemma":[0.00027961042,0.000029944142,0.0135165425,0.000006997428,0.00000309826,0.000004201825,0.00009440709,0.9716326,0.000050958548,0.009756989,0.00445047,0.00017420744],"about_ca_topic_score_codex":0.00004802972,"about_ca_topic_score_gemma":0.0000032518592,"teacher_disagreement_score":0.97162914,"about_ca_system_score_codex":0.0000032544342,"about_ca_system_score_gemma":0.000003957686,"threshold_uncertainty_score":0.30620155},"labels":[],"label_agreement":null},{"id":"W4245795676","doi":"10.32920/14639637.v1","title":"Personalized Multi-Criteria Decision Strategies in Location-based Decision Support","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decision support system; Space (punctuation); Outcome (game theory); Decision analysis; Decision model; Operator (biology); Data mining; Machine learning; Operations research; Mathematics","score_opus":0.040734581604727885,"score_gpt":0.3292917507183061,"score_spread":0.2885571691135782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245795676","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.005169174,0.00018210686,0.99119985,0.00032587638,0.0014721507,0.0003988715,0.000012848722,0.00019495384,0.001044147],"genre_scores_gemma":[0.13496448,0.000077196164,0.862954,0.00043075957,0.000056239795,0.00006572614,0.0005138673,0.000019227453,0.0009185021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700767,0.00010317218,0.00061076,0.0012402398,0.00068484305,0.00035331942],"domain_scores_gemma":[0.99763095,0.0002504478,0.0001585142,0.0016040883,0.00025412202,0.000101883874],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007944152,0.0003611288,0.0004278982,0.0004753626,0.000073208495,0.002683889,0.002302122,0.0002070062,0.0006659331],"category_scores_gemma":[0.00012728936,0.00033449935,0.00014346984,0.00064814155,0.000050845752,0.0012034831,0.0026558335,0.00035117802,0.000100951205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106481,0.0015998237,0.0013671374,0.00059363653,0.00009898484,0.0009971517,0.0019093362,0.02517914,0.00017985204,0.034758966,0.01642048,0.916789],"study_design_scores_gemma":[0.0016227566,0.000036551846,0.0059910715,0.00052379613,0.000012034283,0.00000243226,0.00048492703,0.9826259,0.00013300373,0.0043041967,0.0036842057,0.0005790957],"about_ca_topic_score_codex":0.0002977709,"about_ca_topic_score_gemma":0.00048232055,"teacher_disagreement_score":0.9574468,"about_ca_system_score_codex":0.000112552545,"about_ca_system_score_gemma":0.00076237257,"threshold_uncertainty_score":0.9999107},"labels":[],"label_agreement":null},{"id":"W4245831121","doi":"10.4018/978-1-4666-0333-2.ch012","title":"Describing Spatio-Temporal Phenomena for Environmental System Development","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Temporalities; Temporality; Rotation formalisms in three dimensions; Computer science; Simple (philosophy); Focus (optics); Extension (predicate logic); Field (mathematics); Cognitive science; Presentation (obstetrics); Epistemology; Programming language; Psychology; Mathematics; Philosophy","score_opus":0.03622930235892268,"score_gpt":0.2134441766372524,"score_spread":0.17721487427832971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245831121","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.000009793973,0.00055874966,0.19653724,0.00001731984,0.0010324694,0.0008684228,0.00020488519,0.00028594636,0.8004852],"genre_scores_gemma":[0.17526315,0.000017449462,0.374958,0.00095038867,0.003125135,0.00046067522,0.0008780189,0.00024998147,0.4440972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978135,0.000011612012,0.00047561093,0.0006742056,0.00048334003,0.0005417101],"domain_scores_gemma":[0.9987056,0.000017099017,0.00030803037,0.0007064892,0.000019222816,0.00024353224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025660184,0.00047460233,0.00038187712,0.0000806249,0.00022462603,0.0002931695,0.0011838953,0.00016520175,0.000019696068],"category_scores_gemma":[0.0000022394393,0.00048084758,0.00015209494,0.000012918345,0.000045888413,0.00032668197,0.0009072243,0.000117357486,0.0003815675],"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.0000054185894,0.0000096538215,0.00001366566,0.00005818724,0.000083730185,0.00001213808,0.0000618645,5.419487e-7,0.000001199816,0.75495166,0.00073500647,0.24406691],"study_design_scores_gemma":[0.0006844851,0.00007864308,0.000022982402,0.0003594308,0.000086143744,0.000023393426,0.00003483791,0.0013081918,0.00006064289,0.008246344,0.987993,0.0011018853],"about_ca_topic_score_codex":0.0000073763713,"about_ca_topic_score_gemma":0.000011802114,"teacher_disagreement_score":0.987258,"about_ca_system_score_codex":0.00081254815,"about_ca_system_score_gemma":0.00010967113,"threshold_uncertainty_score":0.9997643},"labels":[],"label_agreement":null},{"id":"W4246148897","doi":"10.1007/978-1-4614-8265-9_80680","title":"Rank-Aware Query Processing","year":2018,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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; Rank (graph theory); Information retrieval; Web search query; Search engine; Mathematics; Combinatorics","score_opus":0.01851590366942882,"score_gpt":0.23699367722465758,"score_spread":0.21847777355522877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246148897","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.0000037709376,0.002843136,0.21001382,0.000054466524,0.003286699,0.000714054,0.0011711671,0.00028549272,0.7816274],"genre_scores_gemma":[0.00027433093,0.00231145,0.013822238,0.00007958396,0.0030446681,0.000052648185,0.002309482,0.00012552545,0.9779801],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967982,0.000044204968,0.0008655885,0.0009874065,0.00090255454,0.000402018],"domain_scores_gemma":[0.99653155,0.00007184692,0.0008062313,0.0021882018,0.00024479168,0.00015737765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006629271,0.0005186469,0.0007102015,0.00039375786,0.00012498887,0.00024955213,0.0023586012,0.00020631176,0.00018362308],"category_scores_gemma":[0.000031889973,0.00047847314,0.0001440396,0.00013533955,0.00014165486,0.0016781739,0.001365025,0.000302858,0.00069797755],"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.000018506618,0.00010720694,0.000033125285,0.005050093,0.00029847605,0.00041902412,0.0006824006,0.000007133629,0.000013062933,0.23683251,0.6548305,0.10170791],"study_design_scores_gemma":[0.0002728989,0.00006552185,0.0000035743967,0.0018477039,0.00006670436,0.000017993449,0.00003473207,0.004349142,0.000007901452,0.0007020898,0.9920194,0.0006123015],"about_ca_topic_score_codex":0.000080883925,"about_ca_topic_score_gemma":0.0000140051425,"teacher_disagreement_score":0.3371889,"about_ca_system_score_codex":0.0000503346,"about_ca_system_score_gemma":0.00022734291,"threshold_uncertainty_score":0.9997667},"labels":[],"label_agreement":null},{"id":"W4246166785","doi":"10.1109/wi.2004.10005","title":"Clustering Web Surfers with Probabilistic Models in a Real Application","year":2005,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'04)","topic":"Data Management and Algorithms","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":"Open Text (Canada); York University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Probabilistic logic; Machine learning; Artificial intelligence","score_opus":0.07176416831107739,"score_gpt":0.30816714513295246,"score_spread":0.23640297682187505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246166785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022512889,0.000020102885,0.9238992,0.0042600147,0.0010248782,0.000962486,0.00007821054,0.00037951718,0.046862703],"genre_scores_gemma":[0.9694934,0.00031880493,0.028080394,0.00044779744,0.00029040425,0.00022816066,0.00008123177,0.000029740047,0.0010300749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964344,0.00009033374,0.00070108846,0.0011821712,0.0010136254,0.00057840307],"domain_scores_gemma":[0.9976575,0.00016022887,0.00028545997,0.0012579776,0.00046884708,0.00016998997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000624685,0.00043063634,0.00033068177,0.0005322036,0.00011667284,0.0006192523,0.003971954,0.00012062182,0.00013576903],"category_scores_gemma":[0.000104845465,0.000399319,0.00008328473,0.0005852666,0.00017142318,0.0020447038,0.00058227486,0.000432143,0.00048368718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020597322,0.00063178036,0.00074795383,0.00006689725,0.000103610575,0.000054514054,0.0011629013,0.14276388,0.001023886,0.6041993,0.0009494192,0.2480899],"study_design_scores_gemma":[0.00033026072,0.00017339249,0.000194902,0.00021946171,0.00000913701,0.000010453672,0.00015172176,0.9808796,0.0007793393,0.014051979,0.002705937,0.000493824],"about_ca_topic_score_codex":0.0002566463,"about_ca_topic_score_gemma":0.0017279373,"teacher_disagreement_score":0.9469805,"about_ca_system_score_codex":0.00041301778,"about_ca_system_score_gemma":0.00030406378,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W4246220482","doi":"10.1007/978-3-319-24612-3_1278","title":"Aggregating Data","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Western University","funders":"","keywords":"Computer science","score_opus":0.09370094832609663,"score_gpt":0.25740525504357503,"score_spread":0.1637043067174784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246220482","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":[2.458564e-9,0.00009264436,0.3038613,0.0016274719,0.0002276805,0.00006627336,0.000036495152,0.00022577263,0.6938624],"genre_scores_gemma":[0.000004048645,0.000071276256,0.15893905,0.0018657995,0.00030285877,6.5334984e-7,0.00052561774,0.000016831293,0.8382739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987336,0.0000033044078,0.00016806224,0.0007028466,0.00027050494,0.00012169654],"domain_scores_gemma":[0.99764687,0.000024540606,0.00010765407,0.0021520006,0.00001570377,0.00005322374],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000112794485,0.0001707005,0.00016135782,0.000050385628,0.000047022953,0.00036219423,0.0049126963,0.00005560147,0.00025551885],"category_scores_gemma":[0.000014787263,0.00015253494,0.000032985106,0.000030403442,0.000018044138,0.00086397654,0.007029606,0.00016918273,0.0018608542],"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":[8.484204e-8,8.804704e-7,1.1144714e-7,0.000008403821,0.000016327724,0.00003578212,0.0000040611094,8.6683166e-8,1.620545e-7,0.64650255,0.14585222,0.20757934],"study_design_scores_gemma":[0.000046416513,0.0000110639285,3.8827e-7,0.000036101115,0.000009854917,0.0000016426395,7.4988094e-7,0.04260128,0.000001804829,0.0233557,0.9337353,0.00019971396],"about_ca_topic_score_codex":0.0000046807795,"about_ca_topic_score_gemma":0.0000035480043,"teacher_disagreement_score":0.78788304,"about_ca_system_score_codex":0.0000078456715,"about_ca_system_score_gemma":0.000025533605,"threshold_uncertainty_score":0.9989163},"labels":[],"label_agreement":null},{"id":"W4246292764","doi":"10.1504/ijipt.2016.10002231","title":"K-CEP: a knowledge-based complex event processing framework to manage qualitative spatiotemporal patterns","year":2016,"lang":"en","type":"article","venue":"International Journal of Internet Protocol Technology","topic":"Data Management and Algorithms","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é Laval","funders":"","keywords":"Computer science; Complex event processing; Leverage (statistics); SQL; Data mining; Event (particle physics); Data science; Database; Machine learning; Process (computing)","score_opus":0.040949103624080774,"score_gpt":0.406556510535927,"score_spread":0.36560740691184623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246292764","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.0018913867,0.000004871969,0.9669518,0.018180316,0.00042691478,0.012073491,0.000013701584,0.00013203063,0.00032549116],"genre_scores_gemma":[0.77943784,9.09149e-7,0.20313352,0.00067991513,0.00026350984,0.01596651,0.000002872135,0.000023220278,0.0004916823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777013,0.00011981609,0.000846981,0.00037674897,0.0005942071,0.0002920941],"domain_scores_gemma":[0.99773633,0.0001340898,0.00076421956,0.00037911997,0.00088183087,0.000104395476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007098083,0.00022456789,0.00029133714,0.0013054375,0.00003425915,0.0002465995,0.0039277445,0.00012282902,0.00015118468],"category_scores_gemma":[0.00032461376,0.00015620982,0.00012859933,0.00043808096,0.00010116005,0.00083425984,0.00093417027,0.00027459374,0.000096233984],"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.00023285203,0.0006251132,0.0022595397,0.000073922776,0.00022269151,0.00029669373,0.0022293478,0.000022019382,0.000726165,0.07567618,0.0048235264,0.91281193],"study_design_scores_gemma":[0.012218464,0.0057155187,0.0049049235,0.011839883,0.00004445536,0.00043127674,0.0014851256,0.041219585,0.048069134,0.17131217,0.70080394,0.0019555122],"about_ca_topic_score_codex":0.000010569374,"about_ca_topic_score_gemma":0.000015105045,"teacher_disagreement_score":0.9108564,"about_ca_system_score_codex":0.00026577667,"about_ca_system_score_gemma":0.00009478943,"threshold_uncertainty_score":0.7298792},"labels":[],"label_agreement":null},{"id":"W4246628364","doi":"10.32920/ryerson.14662971","title":"Implementation of meta search engine with different rank aggregation algorithms","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"Fuse (electrical); Rank (graph theory); Ranking (information retrieval); Computer science; Condorcet method; Search engine; Metasearch engine; Algorithm; Learning to rank; Data mining; Information retrieval; Mathematics; Voting; Web search query; Engineering","score_opus":0.04202704840148233,"score_gpt":0.30186209072411707,"score_spread":0.25983504232263477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246628364","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.025983559,0.00025213155,0.9718499,0.00063704787,0.00029901153,0.0005388334,0.000032764216,0.00011479737,0.00029192105],"genre_scores_gemma":[0.42232114,0.0005281992,0.5737457,0.00013928041,0.00015894402,0.00021273438,0.0015894866,0.00003672273,0.0012677466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781096,0.00010564562,0.00038573542,0.0006959928,0.00074590585,0.00025576793],"domain_scores_gemma":[0.99838203,0.00004433608,0.00020000937,0.0010847169,0.00022217771,0.000066754845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036862923,0.0002856761,0.00048436248,0.00023915397,0.000046588306,0.000437762,0.001108404,0.00006853646,0.00032581948],"category_scores_gemma":[0.0000035994,0.00020221621,0.0001656223,0.00032146575,0.000029414372,0.00056763424,0.0022214516,0.00023564651,0.0000034858506],"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.000009352958,0.0002838717,0.000755669,0.0006564337,0.0040899534,0.00004950413,0.0012099852,0.003089152,0.00015464278,0.011026414,0.00067536003,0.9779997],"study_design_scores_gemma":[0.0033232127,0.000542481,0.015426373,0.00030508128,0.002270455,0.000014001452,0.001830419,0.85751116,0.11470799,0.0014833508,0.00086550857,0.0017199673],"about_ca_topic_score_codex":0.00066426955,"about_ca_topic_score_gemma":0.00018151778,"teacher_disagreement_score":0.9762797,"about_ca_system_score_codex":0.00004511913,"about_ca_system_score_gemma":0.00010011659,"threshold_uncertainty_score":0.82461375},"labels":[],"label_agreement":null},{"id":"W4247346550","doi":"10.22215/etd/2011-07299","title":"Road distance estimation from co-ordinates using Adaptive Tertiary Search schemes","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Ordinate; Computer science; Mathematics; Information retrieval; Geometry","score_opus":0.03837977242108923,"score_gpt":0.30081913381743036,"score_spread":0.2624393613963411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247346550","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.020248652,0.00026562955,0.9582378,0.000024459485,0.0006173684,0.00031471887,0.00005907542,0.0002390649,0.019993206],"genre_scores_gemma":[0.19906518,0.000082285245,0.7640398,0.00011655496,0.00020052522,0.000043522814,0.0064216587,0.00006078844,0.029969694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983363,0.000047001206,0.000270272,0.0006582718,0.00040724943,0.00028091687],"domain_scores_gemma":[0.99902284,0.00003691901,0.00015895675,0.00061234675,0.00010183368,0.00006712033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015408319,0.00027412642,0.00023358442,0.00018818548,0.00016036573,0.00041318726,0.0012059167,0.00012366314,0.00015191526],"category_scores_gemma":[0.0000133681,0.0002534514,0.00007182939,0.00023730878,0.000027905744,0.0017821288,0.00017231665,0.00020392874,0.00016478373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040594998,0.00015078379,0.0004560094,0.00012459356,0.00023343113,0.000045179073,0.0023919893,0.000077083976,0.00042846793,0.05139174,0.0018715237,0.9427886],"study_design_scores_gemma":[0.00022788,0.000034722252,0.0070111323,0.00023979958,0.000043983575,5.274274e-7,0.00059895386,0.97493035,0.009871521,0.0058207563,0.000651893,0.0005684774],"about_ca_topic_score_codex":0.0014832782,"about_ca_topic_score_gemma":0.000077865756,"teacher_disagreement_score":0.9748533,"about_ca_system_score_codex":0.000050588595,"about_ca_system_score_gemma":0.00007104893,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W4247603740","doi":"10.32920/14638896","title":"A Hybrid Spatio-Temporal Data Indexing Method for Trajectory Databases","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"National High-tech Research and Development Program; National Natural Science Foundation of China","keywords":"Computer science; Search engine indexing; Tree (set theory); Data mining; Hash table; Database; Hash function; Trajectory; Access method; NoSQL; R-tree; Temporal database; Data structure; Database index; Table (database); Field (mathematics); Spatial database; Big data; Information retrieval; Spatial analysis; Mathematics","score_opus":0.13078521545752836,"score_gpt":0.35878698639044077,"score_spread":0.2280017709329124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247603740","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.00008581885,0.0002589787,0.99349034,0.0006031098,0.0017488976,0.0006527391,0.0014908864,0.00034080262,0.0013284152],"genre_scores_gemma":[0.0009657542,0.000045143246,0.9649063,0.00060370466,0.00036841386,0.00008213893,0.031470913,0.000024502895,0.00153313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967917,0.0001380023,0.00042799403,0.0018521056,0.00041573276,0.00037446985],"domain_scores_gemma":[0.99402404,0.00025342483,0.00023412988,0.0052895243,0.00009972634,0.000099164645],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015087319,0.0003321917,0.00042887102,0.00020083801,0.000118570984,0.0012438076,0.005962738,0.000057063935,0.00009710707],"category_scores_gemma":[0.00016464903,0.0003230175,0.000120473436,0.00012470318,0.000025012452,0.0020971901,0.02208007,0.0003341696,0.000010101648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283484,0.0003498405,0.000518331,0.0012015214,0.00056455407,0.00022974258,0.00025336276,0.00061514496,0.000019181125,0.03267838,0.2638187,0.699735],"study_design_scores_gemma":[0.0002672654,0.000014765157,0.00009679262,0.0001079835,0.000052306386,0.0000059453555,0.00004278652,0.81503814,0.0003689027,0.0010693696,0.18245733,0.0004784368],"about_ca_topic_score_codex":0.00087950175,"about_ca_topic_score_gemma":0.00042201823,"teacher_disagreement_score":0.81442297,"about_ca_system_score_codex":0.000041688847,"about_ca_system_score_gemma":0.00036308734,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W4248071932","doi":"10.22215/etd/2014-10204","title":"Parallel Olap on Multi/Many-Core and Cloud Platforms","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Online analytical processing; Computer science; Data cube; Cloud computing; Parallel computing; Multi-core processor; Cube (algebra); Distributed computing; Data warehouse; Database; Data mining; Operating system","score_opus":0.02843647196615171,"score_gpt":0.2734157038382292,"score_spread":0.2449792318720775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248071932","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.034401603,0.00026672526,0.7921462,0.00031985596,0.010448386,0.0012333468,0.000024219258,0.0010424954,0.16011718],"genre_scores_gemma":[0.03645776,0.00054319494,0.3170414,0.003197246,0.0018708665,0.0001415675,0.0060836817,0.0001306092,0.63453364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865115,0.000005822145,0.00021233021,0.00058552227,0.00029118962,0.00025400406],"domain_scores_gemma":[0.9990757,0.000036918926,0.00012778997,0.0006412035,0.00003245473,0.000085920445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001742485,0.00026906835,0.00023551391,0.00015805654,0.000114429655,0.00035709678,0.0009779583,0.00014151167,0.0000298136],"category_scores_gemma":[0.000016339245,0.00020317033,0.00005672448,0.00012172659,0.00001411622,0.00047798242,0.00017054693,0.00020066708,0.000310611],"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.00002666448,0.00010111817,0.00009533698,0.00018190831,0.000066682136,0.000022164015,0.0004943754,0.000015472036,0.0000086170385,0.74932843,0.044323612,0.20533563],"study_design_scores_gemma":[0.0049653654,0.000981541,0.037654597,0.00067382416,0.00012450204,0.000008650249,0.00079378893,0.6231176,0.00050155853,0.033608783,0.2939679,0.0036018512],"about_ca_topic_score_codex":0.000044770764,"about_ca_topic_score_gemma":0.0001189124,"teacher_disagreement_score":0.71571964,"about_ca_system_score_codex":0.000012691553,"about_ca_system_score_gemma":0.000016171934,"threshold_uncertainty_score":0.82850456},"labels":[],"label_agreement":null},{"id":"W4248175911","doi":"10.32920/ryerson.14662971.v1","title":"Implementation of meta search engine with different rank aggregation algorithms","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"Fuse (electrical); Rank (graph theory); Ranking (information retrieval); Condorcet method; Computer science; Metasearch engine; Search engine; Algorithm; Learning to rank; Data mining; Information retrieval; Mathematics; Voting; Engineering; Web search query; Combinatorics","score_opus":0.04202704840148233,"score_gpt":0.30186209072411707,"score_spread":0.25983504232263477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248175911","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.025983559,0.00025213155,0.9718499,0.00063704787,0.00029901153,0.0005388334,0.000032764216,0.00011479737,0.00029192105],"genre_scores_gemma":[0.42232114,0.0005281992,0.5737457,0.00013928041,0.00015894402,0.00021273438,0.0015894866,0.00003672273,0.0012677466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781096,0.00010564562,0.00038573542,0.0006959928,0.00074590585,0.00025576793],"domain_scores_gemma":[0.99838203,0.00004433608,0.00020000937,0.0010847169,0.00022217771,0.000066754845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036862923,0.0002856761,0.00048436248,0.00023915397,0.000046588306,0.000437762,0.001108404,0.00006853646,0.00032581948],"category_scores_gemma":[0.0000035994,0.00020221621,0.0001656223,0.00032146575,0.000029414372,0.00056763424,0.0022214516,0.00023564651,0.0000034858506],"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.000009352958,0.0002838717,0.000755669,0.0006564337,0.0040899534,0.00004950413,0.0012099852,0.003089152,0.00015464278,0.011026414,0.00067536003,0.9779997],"study_design_scores_gemma":[0.0033232127,0.000542481,0.015426373,0.00030508128,0.002270455,0.000014001452,0.001830419,0.85751116,0.11470799,0.0014833508,0.00086550857,0.0017199673],"about_ca_topic_score_codex":0.00066426955,"about_ca_topic_score_gemma":0.00018151778,"teacher_disagreement_score":0.9762797,"about_ca_system_score_codex":0.00004511913,"about_ca_system_score_gemma":0.00010011659,"threshold_uncertainty_score":0.82461375},"labels":[],"label_agreement":null},{"id":"W4248395555","doi":"10.1080/15427951.2012.678140","title":"Special Issue on Algorithms and Models for the Web Graph","year":2013,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Data Management and Algorithms","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":"Frieze; Mathematics; Graph; Algorithm; French horn; Theoretical computer science; Discrete mathematics; Computer science; Art history","score_opus":0.029427968311985117,"score_gpt":0.2512374160329353,"score_spread":0.22180944772095018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248395555","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.00040819938,0.000029362795,0.9780398,0.0019214056,0.0008333419,0.0006033547,0.000008778083,0.000081647464,0.018074112],"genre_scores_gemma":[0.02220403,0.00025281246,0.91977924,0.002683451,0.008899318,0.0005382433,0.000013069407,0.0000670981,0.045562755],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992299,0.0000089479,0.00017883576,0.00021533637,0.00018016726,0.00018680388],"domain_scores_gemma":[0.99917716,0.00022003085,0.000067632085,0.00045205964,0.00004079229,0.00004230372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001865725,0.00012461528,0.00012221269,0.000059906204,0.000053069874,0.0005183218,0.0009153594,0.000028431376,0.00009464759],"category_scores_gemma":[0.000020514373,0.000078139616,0.000048784234,0.00008980009,0.000045244517,0.00050435594,0.00032713244,0.000067234185,0.0002454458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011261552,0.000103524755,0.0000011136759,0.000040996452,0.00004385576,0.0000016581719,0.0011211506,0.000043105712,0.0000034597667,0.32540023,0.45755023,0.21568955],"study_design_scores_gemma":[0.00016462324,0.00007674879,0.000007125424,0.000024300392,0.000008566512,0.0000031362615,0.00008267877,0.80735695,0.000056237648,0.11039176,0.08173065,0.00009720103],"about_ca_topic_score_codex":0.0000140263155,"about_ca_topic_score_gemma":0.000003686036,"teacher_disagreement_score":0.80731386,"about_ca_system_score_codex":0.000008221814,"about_ca_system_score_gemma":0.000005233585,"threshold_uncertainty_score":0.49981892},"labels":[],"label_agreement":null},{"id":"W4250011572","doi":"10.1007/s00454-009-9177-z","title":"On Approximate Range Counting and Depth","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":19,"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":"Mathematics; Las vegas; Range (aeronautics); Combinatorics; Tree (set theory); Expected value; Monte Carlo method; Value (mathematics); Binary logarithm; Discrete mathematics; Statistics","score_opus":0.012770673390030974,"score_gpt":0.2538683223519223,"score_spread":0.24109764896189134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250011572","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.036299285,0.000117521726,0.9513189,0.0014830027,0.0001530526,0.00014210484,0.00001238334,0.00017673042,0.010296994],"genre_scores_gemma":[0.92828864,0.0000070192145,0.06912898,0.002255912,0.000067407906,0.0000033337276,0.00007883454,0.000005937359,0.00016394087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988388,0.000022223066,0.00016165808,0.00036820848,0.00038901542,0.00022013248],"domain_scores_gemma":[0.99949926,0.00011138426,0.000070584945,0.00020934328,0.000042034764,0.000067390625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023901853,0.00013218353,0.0001226079,0.00021776088,0.00014969023,0.00036720527,0.00040670778,0.000025539115,0.000010742746],"category_scores_gemma":[0.00002961076,0.000121280595,0.000035939272,0.00048448207,0.000028786255,0.0006425484,0.00014893494,0.000092196286,0.00004632861],"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.0000123754135,0.000085921994,0.0015292946,0.000023781813,0.000030622192,0.000032167023,0.00015288043,0.0069166613,0.000009824722,0.7457538,0.0034973938,0.24195525],"study_design_scores_gemma":[0.0006701751,0.00014773455,0.12638134,0.00003348411,0.000008062764,0.000010357354,0.000022680586,0.7519189,0.000011994966,0.1189231,0.0015652311,0.00030694238],"about_ca_topic_score_codex":0.0000030746623,"about_ca_topic_score_gemma":3.6099058e-7,"teacher_disagreement_score":0.89198935,"about_ca_system_score_codex":0.0000151243285,"about_ca_system_score_gemma":0.000011572867,"threshold_uncertainty_score":0.49456793},"labels":[],"label_agreement":null},{"id":"W4251527353","doi":"10.1007/978-94-017-1506-5_1","title":"Random Media","year":2003,"lang":"en","type":"book-chapter","venue":"Mathematical modelling: theory and applications","topic":"Data Management and Algorithms","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","funders":"","keywords":"Markov chain; Ergodic theory; Martingale (probability theory); Markov property; Mathematics; Markov renewal process; Markov process; Statistical physics; Variable-order Markov model; Computer science; Discrete mathematics; Pure mathematics; Markov model; Applied mathematics; Statistics; Physics","score_opus":0.02993747984002548,"score_gpt":0.2327226450670196,"score_spread":0.2027851652269941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251527353","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":[1.6738613e-7,0.00028011395,0.6238583,0.00015198167,0.00002429024,0.0003444857,0.000015274425,0.00009597276,0.37522942],"genre_scores_gemma":[0.00044763018,0.0014164794,0.32963452,0.0011855483,0.00044350658,0.00058922113,0.0001551606,0.0001164264,0.6660115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986351,0.000033872006,0.00035836495,0.0005314819,0.00023624915,0.00020493797],"domain_scores_gemma":[0.998066,0.0007018522,0.00012672391,0.0009198756,0.000042060256,0.00014348091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075822097,0.00028309555,0.0003565433,0.00009846273,0.00018033698,0.00020608901,0.00073974463,0.00015679469,0.0001852304],"category_scores_gemma":[0.00001669388,0.00024123544,0.000103566395,0.000051112198,0.0001593103,0.00018101271,0.00024822756,0.00023955325,0.0004884535],"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.0000032034268,0.000029693838,8.071503e-9,0.000056750017,0.000029998535,0.0000016941325,0.000072778836,0.000082267565,4.085852e-7,0.9845233,0.00040582285,0.014794086],"study_design_scores_gemma":[0.00016660658,0.000005690612,7.6371665e-9,0.000039256505,0.00005085074,0.0000053222193,0.0000042942434,0.039129384,0.00000468799,0.7621197,0.19826174,0.00021245352],"about_ca_topic_score_codex":9.340461e-8,"about_ca_topic_score_gemma":5.7019193e-8,"teacher_disagreement_score":0.2942238,"about_ca_system_score_codex":0.000010886955,"about_ca_system_score_gemma":0.000013077376,"threshold_uncertainty_score":0.9837296},"labels":[],"label_agreement":null},{"id":"W4251529305","doi":"10.1007/978-3-319-17885-1_1625","title":"Clustering of Geospatial Big Data in a Distributed Environment","year":2017,"lang":"en","type":"book-chapter","venue":"Encyclopedia of GIS","topic":"Data Management and Algorithms","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":"Computer Research Institute of Montréal","funders":"","keywords":"Geospatial analysis; Cluster analysis; Computer science; Big data; Data science; Data mining; Geography; Cartography; Artificial intelligence","score_opus":0.03924912840173062,"score_gpt":0.23981079524989043,"score_spread":0.20056166684815982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251529305","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.0000303958,0.00044251911,0.46186078,0.00022636254,0.0014471908,0.00046615076,0.002457877,0.000037293445,0.53303146],"genre_scores_gemma":[0.009444866,0.032813348,0.15057002,0.000093251285,0.002671271,0.000048722006,0.0116072465,0.00020091938,0.7925503],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828655,0.000012715848,0.0004916643,0.000587685,0.00042368943,0.00019772757],"domain_scores_gemma":[0.9960999,0.000041779622,0.00056879217,0.003224657,0.000014483784,0.000050395432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003065967,0.00023371006,0.0004310739,0.00016278586,0.00003531805,0.000043578308,0.0039071334,0.000117862284,0.00006934678],"category_scores_gemma":[0.00003620639,0.00023611952,0.00006165367,0.000018960878,0.00010414114,0.00044630867,0.005141871,0.00017946424,0.000034460314],"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.00001244621,0.00009627377,0.00034976547,0.00024168845,0.00010785033,0.00012274859,0.0002280706,0.00006185563,0.0000051265793,0.00770863,0.005965597,0.9851],"study_design_scores_gemma":[0.0005035847,0.00008422115,0.0026174197,0.00031884186,0.0000452876,0.0000015287876,0.00000346031,0.012927145,0.00000791533,0.0027619125,0.98031443,0.00041425595],"about_ca_topic_score_codex":0.00023557567,"about_ca_topic_score_gemma":0.00019046597,"teacher_disagreement_score":0.9846857,"about_ca_system_score_codex":0.000031557956,"about_ca_system_score_gemma":0.000049646213,"threshold_uncertainty_score":0.9628675},"labels":[],"label_agreement":null},{"id":"W4252131373","doi":"10.1155/2013/284904","title":"Modelling Spatio-Temporal Relevancy in Urban Context-Aware Pervasive Systems Using Voronoi Continuous Range Query and Multi-Interval Algebra","year":2013,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Data Management and Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Voronoi diagram; Context (archaeology); Interval (graph theory); Range (aeronautics); Process (computing); Space (punctuation); Data mining; Theoretical computer science; Mathematics; Geography","score_opus":0.02270075350401192,"score_gpt":0.22803275788379027,"score_spread":0.20533200437977833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252131373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15737343,0.0009038994,0.8380891,0.000035320038,0.0010396006,0.0021508331,0.000031008938,0.0002007124,0.00017605949],"genre_scores_gemma":[0.9955242,0.000028160604,0.0034094683,0.00007852566,0.00012771458,0.0004398558,0.000098439945,0.000013756159,0.0002798694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978195,0.00012854759,0.001031358,0.00029231107,0.0003610052,0.000367302],"domain_scores_gemma":[0.9985963,0.00006318711,0.0004921109,0.00047534626,0.0002620623,0.00011098881],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058709073,0.00025745435,0.00042246023,0.0003398359,0.00013440491,0.001564247,0.00052368187,0.00010911458,0.000006486583],"category_scores_gemma":[0.000015631877,0.00024187888,0.000057903388,0.0002610855,0.000038261733,0.010172658,0.0002644943,0.0001583837,0.00017129545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00005233273,0.00031122688,0.0611959,0.003228826,0.00025295344,0.000046297915,0.046783235,0.6964251,0.0000281131,0.019032123,0.008020597,0.16462332],"study_design_scores_gemma":[0.0009451697,0.00004791715,0.00023912013,0.0003294397,0.000006084045,0.000017966247,0.004252128,0.9836086,0.000005354382,0.000004619123,0.0102608865,0.00028268623],"about_ca_topic_score_codex":0.0074338047,"about_ca_topic_score_gemma":0.000053070227,"teacher_disagreement_score":0.8381508,"about_ca_system_score_codex":0.00015609445,"about_ca_system_score_gemma":0.00004479321,"threshold_uncertainty_score":0.9994722},"labels":[],"label_agreement":null},{"id":"W4253829582","doi":"10.32920/14638896.v1","title":"A Hybrid Spatio-Temporal Data Indexing Method for Trajectory Databases","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"National High-tech Research and Development Program; National Natural Science Foundation of China","keywords":"Computer science; Search engine indexing; Data mining; Tree (set theory); Hash table; Database; Temporal database; Trajectory; Hash function; R-tree; NoSQL; Access method; Data structure; Database index; Table (database); Field (mathematics); Spatial database; Big data; Information retrieval; Spatial analysis; Mathematics","score_opus":0.13078521545752836,"score_gpt":0.35878698639044077,"score_spread":0.2280017709329124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253829582","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.00008581885,0.0002589787,0.99349034,0.0006031098,0.0017488976,0.0006527391,0.0014908864,0.00034080262,0.0013284152],"genre_scores_gemma":[0.0009657542,0.000045143246,0.9649063,0.00060370466,0.00036841386,0.00008213893,0.031470913,0.000024502895,0.00153313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967917,0.0001380023,0.00042799403,0.0018521056,0.00041573276,0.00037446985],"domain_scores_gemma":[0.99402404,0.00025342483,0.00023412988,0.0052895243,0.00009972634,0.000099164645],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015087319,0.0003321917,0.00042887102,0.00020083801,0.000118570984,0.0012438076,0.005962738,0.000057063935,0.00009710707],"category_scores_gemma":[0.00016464903,0.0003230175,0.000120473436,0.00012470318,0.000025012452,0.0020971901,0.02208007,0.0003341696,0.000010101648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283484,0.0003498405,0.000518331,0.0012015214,0.00056455407,0.00022974258,0.00025336276,0.00061514496,0.000019181125,0.03267838,0.2638187,0.699735],"study_design_scores_gemma":[0.0002672654,0.000014765157,0.00009679262,0.0001079835,0.000052306386,0.0000059453555,0.00004278652,0.81503814,0.0003689027,0.0010693696,0.18245733,0.0004784368],"about_ca_topic_score_codex":0.00087950175,"about_ca_topic_score_gemma":0.00042201823,"teacher_disagreement_score":0.81442297,"about_ca_system_score_codex":0.000041688847,"about_ca_system_score_gemma":0.00036308734,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W4254895427","doi":"10.22215/etd/2010-09029","title":"OLAP for trajectories","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Online analytical processing; Computer science; Information retrieval; Data mining; Data warehouse","score_opus":0.01249896302712996,"score_gpt":0.2690094075350616,"score_spread":0.25651044450793165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254895427","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.00046462973,0.000078169214,0.5977336,0.0005499407,0.029471375,0.0007750094,0.000043008404,0.000668408,0.37021586],"genre_scores_gemma":[0.0010296553,0.00004121802,0.37247273,0.00022411665,0.00086696574,0.00016478401,0.0044131335,0.000028785025,0.6207586],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993219,0.000002769467,0.00010792654,0.00029496316,0.00012969712,0.00014274479],"domain_scores_gemma":[0.99940217,0.000021897513,0.00005723291,0.0004346401,0.000056199133,0.000027858583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000888714,0.00011778852,0.00010911899,0.00007956537,0.00006702984,0.0003854381,0.0012759994,0.00011279915,0.000059478156],"category_scores_gemma":[0.000018679111,0.00010084682,0.000065616405,0.0000900135,0.0000044824533,0.00049672497,0.000048215494,0.00010564062,0.0000457363],"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.0000070320157,0.00003555142,0.000006734503,0.00009932636,0.000047098434,0.0000024376893,0.0004181934,1.2884801e-7,0.00025274072,0.31319374,0.09203076,0.5939063],"study_design_scores_gemma":[0.0001908163,0.000033807217,0.00031450036,0.000010877192,0.000016716858,2.6937894e-7,0.0001435199,0.0024297964,0.002978243,0.0068543237,0.9867278,0.00029933063],"about_ca_topic_score_codex":0.000014399489,"about_ca_topic_score_gemma":0.00021861073,"teacher_disagreement_score":0.894697,"about_ca_system_score_codex":0.000004419851,"about_ca_system_score_gemma":0.000025849546,"threshold_uncertainty_score":0.41124138},"labels":[],"label_agreement":null},{"id":"W4254983785","doi":"10.1109/tsmcb.2008.925728","title":"A Multifaceted Perspective at Data Analysis: A Study in Collaborative Intelligent Agents","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Computer science; Context (archaeology); Perspective (graphical); Process (computing); Exploit; Consistency (knowledge bases); Heuristics; Focus (optics); Function (biology); Fuzzy logic; Cluster analysis; Data science; Human–computer interaction; Artificial intelligence","score_opus":0.06271541074539363,"score_gpt":0.29962480710807243,"score_spread":0.2369093963626788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254983785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33954433,0.0011757088,0.6481657,0.00035047505,0.0018724814,0.0040734983,0.00060173974,0.00037731987,0.0038387382],"genre_scores_gemma":[0.99162567,0.000669199,0.001112913,0.00006912792,0.000049775444,0.0001452905,0.000038949664,0.000029977513,0.006259078],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960063,0.00042227792,0.0007598077,0.001505701,0.00077390246,0.00053203036],"domain_scores_gemma":[0.9970745,0.0001383228,0.00023212079,0.0020854608,0.0002146682,0.00025494245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054683065,0.00046025007,0.0006594319,0.00076795084,0.00042711676,0.00043325772,0.0014746316,0.00011741465,0.00004233884],"category_scores_gemma":[0.00001200271,0.00045068478,0.000101889695,0.0022804174,0.00021155148,0.00048770575,0.00012031268,0.00032877183,0.00016177281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013293712,0.04059661,0.065403014,0.0005385606,0.030280676,0.00561857,0.39869943,0.35251665,0.00032874756,0.018184362,0.03489013,0.051613856],"study_design_scores_gemma":[0.004421034,0.0013523309,0.020390851,0.00016045455,0.0011441947,0.000060061946,0.016464826,0.93878555,0.0004386956,0.000103579514,0.015034975,0.0016434246],"about_ca_topic_score_codex":0.0014302048,"about_ca_topic_score_gemma":0.0034472833,"teacher_disagreement_score":0.6520814,"about_ca_system_score_codex":0.00026793117,"about_ca_system_score_gemma":0.000078101984,"threshold_uncertainty_score":0.9997945},"labels":[],"label_agreement":null},{"id":"W4255315553","doi":"10.1017/s0001867800011642","title":"Density approximation and exact simulation of random variables that are solutions of fixed-point equations","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Data Management and Algorithms","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":"Mathematics; Fixed point; Random variable; Probabilistic logic; Applied mathematics; Class (philosophy); Limit (mathematics); Sampling (signal processing); Mathematical analysis; Statistics","score_opus":0.03694009101673632,"score_gpt":0.2498786806779737,"score_spread":0.21293858966123738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255315553","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.009472008,0.00024795535,0.98759526,0.000088204266,0.00005189143,0.0005974277,0.000010520763,0.000038472474,0.0018982629],"genre_scores_gemma":[0.9156592,0.00006943705,0.084199816,0.000010097704,0.0000069445737,0.00003720871,0.000009323046,0.0000024375167,0.0000055541213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898785,0.000060838865,0.00032180682,0.0003007948,0.00019067412,0.00013800246],"domain_scores_gemma":[0.9988201,0.00041483156,0.00025873724,0.0004318456,0.000050909122,0.000023540175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069842895,0.00009244905,0.0002074057,0.00008134532,0.00007233743,0.000025176043,0.00024358404,0.00003512454,0.000011690049],"category_scores_gemma":[0.00015095752,0.000087728484,0.000025632819,0.0003438623,0.0001183579,0.0009218775,0.00019920785,0.00006275875,0.0000014643429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005125735,0.00068970065,0.009172719,0.00056955434,0.000021612714,4.768929e-7,0.0009836131,0.2645858,0.00032752397,0.46888146,0.000020240486,0.254696],"study_design_scores_gemma":[0.0006919798,0.000016315933,0.0032241568,0.000025854335,0.000008573657,1.4905615e-7,0.00004464386,0.8265488,0.00057415327,0.16866407,0.00010702015,0.00009425623],"about_ca_topic_score_codex":0.000008915329,"about_ca_topic_score_gemma":0.000036327816,"teacher_disagreement_score":0.9061872,"about_ca_system_score_codex":0.000030976284,"about_ca_system_score_gemma":0.0000063192806,"threshold_uncertainty_score":0.35774636},"labels":[],"label_agreement":null},{"id":"W4255361341","doi":"10.1007/978-1-4614-6170-8_100779","title":"Preference Propagation","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Psychology","score_opus":0.04001202717700208,"score_gpt":0.21315088920023195,"score_spread":0.17313886202322987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255361341","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":[3.535296e-8,0.000009421455,0.47858137,0.00014639579,0.00015047075,0.0000876743,0.0000011558241,0.00012926072,0.5208942],"genre_scores_gemma":[0.00013784031,0.000028676766,0.026684327,0.00026300407,0.00012563702,0.000004689747,0.000044426648,0.000009570074,0.97270185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991276,0.000004730385,0.00013826927,0.0003727953,0.00024485923,0.00011170014],"domain_scores_gemma":[0.9991108,0.000013209466,0.00009256406,0.00070385647,0.000042130665,0.000037422127],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011844178,0.00014890822,0.00012220153,0.000086024185,0.000037329304,0.00021877566,0.001032172,0.00007380566,0.00025643848],"category_scores_gemma":[0.0000040736727,0.00012167982,0.00003831781,0.000018124469,0.000018565117,0.00029156983,0.00048033628,0.00010185274,0.0018353125],"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":[1.336867e-7,0.0000011426929,1.8927662e-7,0.000009592087,0.000005308472,0.0000013528431,0.000003501396,2.9472127e-7,5.585869e-7,0.77575654,0.014524708,0.20969671],"study_design_scores_gemma":[0.000055463213,0.00003352161,0.000007822084,0.000036847356,0.0000064883243,9.737745e-7,1.4763988e-7,0.010080502,0.000020675188,0.08517604,0.9043705,0.00021104891],"about_ca_topic_score_codex":0.0000024059548,"about_ca_topic_score_gemma":0.000003113775,"teacher_disagreement_score":0.8898458,"about_ca_system_score_codex":0.000013981345,"about_ca_system_score_gemma":0.000017475022,"threshold_uncertainty_score":0.9989419},"labels":[],"label_agreement":null},{"id":"W4256193303","doi":"10.1016/b978-012088469-8/50128-5","title":"Efficient Constraint Processing for Highly Personalized Location Based Services","year":2004,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Computer science; Tracking (education); Location-based service; Wireless; Constraint (computer-aided design); Positioning technology; Video tracking; Distributed computing; Object (grammar); Human–computer interaction; Real-time computing; Artificial intelligence; Computer network; Telecommunications; Engineering","score_opus":0.015810502446586456,"score_gpt":0.2379889543604717,"score_spread":0.22217845191388524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256193303","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.000004261353,0.000765324,0.21239096,0.00042704292,0.00046025185,0.0014482758,0.000063148094,0.00031155703,0.7841292],"genre_scores_gemma":[0.0040123635,0.000007802639,0.10165151,0.0017155096,0.00038043846,0.00019414985,0.00027964928,0.0000884311,0.89167017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980349,0.000012908307,0.00039092058,0.0007620628,0.00046568367,0.000333513],"domain_scores_gemma":[0.99861985,0.000040432362,0.00036065435,0.0006222358,0.00025456486,0.00010228546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003495368,0.00040133458,0.0003687321,0.00021515987,0.00022012094,0.0004686158,0.0010735684,0.0001569146,0.000029021056],"category_scores_gemma":[0.0000047548633,0.0003763214,0.00017197765,0.000037240025,0.0001415085,0.000114500996,0.00020561965,0.0001696147,0.000060031613],"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.0000061505143,0.000013948275,1.2637143e-7,0.000745137,0.000028107346,0.000008434497,0.00018845762,0.0001623511,0.000004964521,0.1266821,0.000015174148,0.87214506],"study_design_scores_gemma":[0.0013750147,0.0000942229,0.000002885249,0.00197034,0.0001227805,0.0000042106376,0.00001719305,0.13320297,0.00005436714,0.0180005,0.8444051,0.00075039745],"about_ca_topic_score_codex":6.9570024e-7,"about_ca_topic_score_gemma":0.0000037991545,"teacher_disagreement_score":0.87139463,"about_ca_system_score_codex":0.00014359843,"about_ca_system_score_gemma":0.00037226055,"threshold_uncertainty_score":0.99986887},"labels":[],"label_agreement":null},{"id":"W4256228093","doi":"10.1007/3-540-36175-8_56","title":"DBRS: A Density-Based Spatial Clustering Method with Random Sampling","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":63,"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 Regina","funders":"","keywords":"DBSCAN; Cluster analysis; Computer science; Sampling (signal processing); Point (geometry); Data mining; Pattern recognition (psychology); Artificial intelligence; Algorithm; Correlation clustering; CURE data clustering algorithm; Mathematics; Computer vision","score_opus":0.02417341461940737,"score_gpt":0.2638808334063544,"score_spread":0.239707418786947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256228093","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.0000049648415,0.00008680615,0.9955524,0.0004890474,0.0016563323,0.0005360651,0.000004872438,0.0002007218,0.0014687821],"genre_scores_gemma":[0.0022275592,0.0000078835465,0.9941754,0.0029604698,0.0003989527,0.000010714598,0.000012213031,0.00003996831,0.0001668789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956491,0.000074424584,0.0004724872,0.0018825684,0.0011494579,0.00077193946],"domain_scores_gemma":[0.99700356,0.00056460354,0.00031091447,0.0016512257,0.00029097902,0.00017874599],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016086125,0.0006374747,0.0006729066,0.00089833693,0.0003387764,0.0012441394,0.0031834422,0.0001998552,0.000016342165],"category_scores_gemma":[0.000100411125,0.0005314795,0.00012879354,0.00066751527,0.0003571691,0.00077908486,0.0012806954,0.00071087014,0.000022062042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003085428,0.00002689155,0.000028039069,0.00006650768,0.000024983461,0.00016351684,0.00015602756,0.14402042,0.000035516136,0.0025357106,0.00002357606,0.8528879],"study_design_scores_gemma":[0.001295509,0.0001871144,0.000025447936,0.00046473488,0.000023217819,0.000038744813,1.2082516e-7,0.97514546,0.0008876749,0.016328216,0.004767988,0.00083575107],"about_ca_topic_score_codex":0.00007281151,"about_ca_topic_score_gemma":0.0002854317,"teacher_disagreement_score":0.8520522,"about_ca_system_score_codex":0.00019991638,"about_ca_system_score_gemma":0.00033217622,"threshold_uncertainty_score":0.99979264},"labels":[],"label_agreement":null},{"id":"W4281929615","doi":"10.3390/ijgi11060322","title":"Efficient Calculation of Distance Transform on Discrete Global Grid Systems","year":2022,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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":"Geospatial analysis; Distance transform; Computer science; Distortion (music); Discretization; Grid; Polygon mesh; Algorithm; Boundary (topology); Artificial intelligence; Mathematics; Image (mathematics); Geography; Remote sensing; Geometry; Computer graphics (images)","score_opus":0.005550111020099068,"score_gpt":0.24163025902686566,"score_spread":0.2360801480067666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281929615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010874423,0.00003917097,0.9785383,0.001491057,0.005122442,0.00016805281,0.00027352347,0.00002047758,0.00347259],"genre_scores_gemma":[0.99793744,0.000011065813,0.0016064558,0.00017894975,0.00012647932,0.000006268301,0.00009988715,0.0000020875052,0.000031381933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997601,0.000041571908,0.0007075946,0.00007224262,0.0014580188,0.00011961733],"domain_scores_gemma":[0.99864006,0.000028064766,0.0007683549,0.00016023543,0.0003578398,0.00004543043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599862,0.00009387313,0.00013428432,0.00025488468,0.00010380851,0.00021662055,0.001102889,0.000018157236,0.000016353166],"category_scores_gemma":[0.000031387644,0.00008323817,0.00010946726,0.00026257595,0.00001926136,0.002095142,0.00015491345,0.00012924222,0.000012469213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024916747,0.00013195546,0.00037143443,0.000040227504,0.00015873421,0.000017101574,0.0012486902,0.6037372,0.000012670797,0.2666017,0.005052324,0.12237882],"study_design_scores_gemma":[0.001399923,0.00035072005,0.0039444664,0.00008581278,0.000018397099,0.00009968755,0.00044428112,0.8697602,0.00009407253,0.0007925288,0.1228335,0.00017640289],"about_ca_topic_score_codex":0.000033367425,"about_ca_topic_score_gemma":9.500915e-7,"teacher_disagreement_score":0.987063,"about_ca_system_score_codex":0.0003469181,"about_ca_system_score_gemma":0.000058080615,"threshold_uncertainty_score":0.3394354},"labels":[],"label_agreement":null},{"id":"W4282821942","doi":"10.3390/a15060206","title":"Correction: Filion, G.J. Analytic Combinatorics for Computing Seeding Probabilities. Algorithms 2018, 11, 3","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Management and Algorithms","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":"Seeding; Computer science; Algorithm; Combinatorics; Mathematics; Physics","score_opus":0.024576397843192536,"score_gpt":0.2545848241560057,"score_spread":0.23000842631281315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282821942","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.0006628363,0.00024044186,0.9773709,0.0015481119,0.016375886,0.0011546465,0.00009274148,0.00080872246,0.0017456922],"genre_scores_gemma":[0.17620312,0.00011191363,0.71875536,0.00379105,0.004593069,0.0018464507,0.0014774882,0.00036647578,0.09285507],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620384,0.00013889068,0.00066600944,0.0011610676,0.0009348126,0.0008953567],"domain_scores_gemma":[0.99772567,0.00046214001,0.00032497253,0.0010501281,0.00023884316,0.00019822901],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016086792,0.0003965403,0.00047419645,0.00043035945,0.0016176573,0.0005741974,0.0022030727,0.000071043054,0.00009110286],"category_scores_gemma":[0.00013359248,0.00043724326,0.00025156152,0.0019319132,0.000090302776,0.0011566384,0.0020438877,0.0004025138,0.000032609976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002206141,0.0009683323,0.0013063918,0.00019063396,0.0002931763,0.00013897823,0.0022409684,0.010685879,0.000032246448,0.0654892,0.56438607,0.35424602],"study_design_scores_gemma":[0.0008899694,0.0003232918,0.00019167179,0.0000172857,0.000036089277,0.00007543017,0.0006192434,0.83187056,0.00005465917,0.0059260214,0.15948807,0.000507726],"about_ca_topic_score_codex":0.00011900903,"about_ca_topic_score_gemma":0.0000051964957,"teacher_disagreement_score":0.8211847,"about_ca_system_score_codex":0.00044037533,"about_ca_system_score_gemma":0.00013801709,"threshold_uncertainty_score":0.99980795},"labels":[],"label_agreement":null},{"id":"W4283587045","doi":"10.1613/jair.1.13544","title":"Path Counting for Grid-Based Navigation","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Data Management and Algorithms","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":"Autodesk (Canada)","funders":"","keywords":"Grid; Computer science; Vertex (graph theory); Traverse; Dijkstra's algorithm; Visibility; Any-angle path planning; Algorithm; Shortest path problem; Grid method multiplication; Theoretical computer science; Motion planning; Mathematics; Artificial intelligence; Graph; Geometry; Geography","score_opus":0.19304573332997296,"score_gpt":0.4236703514921283,"score_spread":0.23062461816215532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283587045","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.00804695,0.000080115315,0.987725,0.002711023,0.0010233601,0.00023999656,0.000011718856,0.000016300888,0.00014551541],"genre_scores_gemma":[0.92118335,0.000019459465,0.077352956,0.00017471818,0.0010274642,0.000050765895,0.000017108565,0.000016193442,0.00015798165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973619,0.00022607103,0.0004943218,0.00019317336,0.0013616158,0.0003629366],"domain_scores_gemma":[0.99822193,0.00049709674,0.00022899607,0.00026081013,0.0007110755,0.0000801087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008383004,0.00006847283,0.00012691678,0.00042988587,0.0006646231,0.00042278008,0.0015647564,0.00001848453,0.00005996568],"category_scores_gemma":[0.00032362432,0.00006384293,0.00009788247,0.0010145588,0.000062747575,0.00068189873,0.00038614095,0.00048048823,0.000017369399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016042014,0.0004697714,0.00010006064,0.000084979234,0.000035147594,0.00014103945,0.0007796942,0.014978965,0.0035339023,0.14289653,0.011713724,0.8251058],"study_design_scores_gemma":[0.000067579764,0.0009685333,0.00002144001,0.00004244893,0.0000051834877,0.000017359813,0.0013621482,0.8902517,0.014139067,0.06031915,0.032678742,0.00012663432],"about_ca_topic_score_codex":0.00001865753,"about_ca_topic_score_gemma":0.0000017986941,"teacher_disagreement_score":0.9131364,"about_ca_system_score_codex":0.00014964036,"about_ca_system_score_gemma":0.00026508016,"threshold_uncertainty_score":0.51118106},"labels":[],"label_agreement":null},{"id":"W4285043084","doi":"10.1007/s12652-022-04306-w","title":"Correction to: E-ware: a big data system for the incremental discovery of spatio-temporal events from microblogs","year":2022,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Microblogging; Computer science; Big data; Social media; Computational intelligence; Data science; Information retrieval; Data mining; World Wide Web; Artificial intelligence","score_opus":0.07142351939846545,"score_gpt":0.28310853218444604,"score_spread":0.2116850127859806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285043084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11021257,0.0002534886,0.88364106,0.00017852578,0.0053500636,0.00027954805,0.000059398397,0.000014016656,0.000011304713],"genre_scores_gemma":[0.98647994,0.000019368645,0.012922387,0.00012678314,0.00032893562,0.0000031248844,0.00005523859,0.000007365514,0.00005684875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840325,0.00009026085,0.0006446783,0.00027374286,0.00041838703,0.00016969453],"domain_scores_gemma":[0.9983675,0.0003349714,0.00070063974,0.0004464297,0.00010903612,0.00004140672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001399144,0.000115755625,0.00023516649,0.00015933959,0.0004802365,0.00023839175,0.0019323278,0.000011586962,0.0000049923897],"category_scores_gemma":[0.000052368443,0.00009003569,0.00007829883,0.0002647677,0.000024977577,0.0006017739,0.0023047652,0.00017634276,0.0000010307168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007745069,0.0009092945,0.008370137,0.00024885577,0.000996363,0.0000590355,0.010924038,0.0143109625,0.004227673,0.0098597435,0.035797127,0.91352224],"study_design_scores_gemma":[0.0012283067,0.0016764442,0.0023359538,0.0006734506,0.0002052059,0.00013675544,0.010947006,0.9572863,0.007810098,0.0011959686,0.016037669,0.00046687058],"about_ca_topic_score_codex":0.0003719433,"about_ca_topic_score_gemma":0.000043295884,"teacher_disagreement_score":0.9429753,"about_ca_system_score_codex":0.00008799004,"about_ca_system_score_gemma":0.00005282526,"threshold_uncertainty_score":0.36936393},"labels":[],"label_agreement":null},{"id":"W4285223139","doi":"10.1109/jiot.2022.3177474","title":"EPGQ: Efficient and Private Feature-Based Group Nearest Neighbor Query Over Road Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Data Management and Algorithms","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; Information retrieval; Location-based service; Encryption; Feature (linguistics); k-nearest neighbors algorithm; Data mining; Similarity (geometry); Set (abstract data type); Theoretical computer science; Point of interest; Artificial intelligence; Computer security; Computer network; Image (mathematics)","score_opus":0.00861508327016352,"score_gpt":0.22031883312549314,"score_spread":0.2117037498553296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285223139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16225094,0.0004562489,0.8328106,0.0009453273,0.0029809198,0.00014231888,0.000004716324,0.00006402056,0.00034492364],"genre_scores_gemma":[0.9829285,0.000020034506,0.014865367,0.0014516332,0.00021791713,0.0000064415945,0.000006038903,0.000017018798,0.0004870571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982992,0.00012759493,0.00032857692,0.00032772377,0.00058808475,0.00032884203],"domain_scores_gemma":[0.999044,0.000060049544,0.00038605905,0.00034068068,0.000041766936,0.0001274138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010483,0.00017441533,0.00021628471,0.00021345961,0.00020463916,0.0005883676,0.0015115809,0.00003801064,0.0000738436],"category_scores_gemma":[0.000020505244,0.000154899,0.00011731464,0.00026004962,0.0000620291,0.0006626576,0.0008395867,0.0007119185,0.0000027818505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075719267,0.0019928983,0.013649995,0.0002200618,0.00086463697,0.0023909041,0.0059174593,0.19657394,0.0035092202,0.04264954,0.26086998,0.47060415],"study_design_scores_gemma":[0.0008128568,0.000303049,0.0037347646,0.00007597622,0.000017937366,0.00013598798,0.00002062751,0.97958875,0.00027403352,0.00035278968,0.014471283,0.00021191727],"about_ca_topic_score_codex":0.000061336235,"about_ca_topic_score_gemma":0.0000015102185,"teacher_disagreement_score":0.8206776,"about_ca_system_score_codex":0.000081041246,"about_ca_system_score_gemma":0.000026289781,"threshold_uncertainty_score":0.63165975},"labels":[],"label_agreement":null},{"id":"W4286656147","doi":"10.1109/tbdata.2022.3186857","title":"Efficient Learned Spatial Index With Interpolation Function Based Learned Model","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Big Data","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Leverage (statistics); Spatial database; Data mining; Spatial analysis; Spatial query; Index (typography); Overhead (engineering); Interpolation (computer graphics); Multivariate interpolation; Function (biology); Machine learning; Artificial intelligence; Information retrieval; Sargable; Web search query; Bilinear interpolation; Mathematics","score_opus":0.08700016958677916,"score_gpt":0.2643861053845783,"score_spread":0.17738593579779915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286656147","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.0010904518,0.0000043887794,0.99602586,0.0007989803,0.0010370304,0.00025567968,0.00032086344,0.00024321735,0.0002235016],"genre_scores_gemma":[0.99064463,0.0000019624733,0.008099445,0.0003956991,0.000044688746,0.000055588764,0.0003045861,0.00001726506,0.00043615745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814326,0.00010149906,0.00019108532,0.0007193324,0.0006105567,0.00023424646],"domain_scores_gemma":[0.99808806,0.00003930411,0.0000892185,0.0016837904,0.000033346125,0.00006625238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003821409,0.00016214089,0.00011897707,0.0003277408,0.00053364574,0.00019218579,0.0014443456,0.000029277937,0.0000983257],"category_scores_gemma":[0.0000027539238,0.00015476672,0.000037594327,0.0006447109,0.000033701708,0.00044711248,0.00005811228,0.0003449027,0.000040121377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016084127,0.00026099308,0.000006865684,0.000005193311,0.000024258963,0.0000037928335,0.000044870136,0.76185906,0.00008138117,0.00008490954,0.00039873034,0.23706909],"study_design_scores_gemma":[0.0009015304,0.00030304358,0.000059432947,0.000008457155,0.00003164753,0.0000025002655,0.0000351815,0.99554753,0.00011256208,0.00007362397,0.0027296145,0.00019488354],"about_ca_topic_score_codex":0.00018027029,"about_ca_topic_score_gemma":0.00014090518,"teacher_disagreement_score":0.98955417,"about_ca_system_score_codex":0.00007237039,"about_ca_system_score_gemma":0.00010825682,"threshold_uncertainty_score":0.6311203},"labels":[],"label_agreement":null},{"id":"W4288420235","doi":"10.48550/arxiv.1903.02076","title":"Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal\\n Joins","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Joins; Computer science; Intersection (aeronautics); Binary number; Query optimization; Query plan; Matching (statistics); Vertex (graph theory); Partition (number theory); Theoretical computer science; Graph; Mathematics; Sargable; Data mining; Search engine; Combinatorics; Information retrieval","score_opus":0.054827228183465124,"score_gpt":0.18231339072625027,"score_spread":0.12748616254278516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288420235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43782294,0.00071063364,0.5547235,0.0002405775,0.0017478913,0.00090243545,0.00015985713,0.0003249798,0.0033671672],"genre_scores_gemma":[0.976026,0.0041607264,0.011518212,0.00019648777,0.00007916747,0.0000022726476,0.00014817483,0.00006639717,0.007802544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994321,0.00036262383,0.0005999684,0.0033152623,0.00023734316,0.00116381],"domain_scores_gemma":[0.995686,0.00027817304,0.00073569885,0.0025672691,0.00019869782,0.0005341645],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00081994996,0.0010695369,0.0010051099,0.00088250113,0.0010006313,0.0014722599,0.0028435795,0.00047231527,0.00014088118],"category_scores_gemma":[0.00003232063,0.0013496531,0.00037790026,0.0016259088,0.0007240182,0.0035843162,0.011004606,0.0012453198,0.00017608883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043339728,0.0014001926,0.012402362,0.0016673894,0.0021108752,0.046698287,0.006544059,0.601349,0.000121000325,0.30060408,0.016502384,0.010167002],"study_design_scores_gemma":[0.0017381775,0.00036320332,0.00022170914,0.00045099788,0.0003531034,0.0001834541,0.0022217224,0.9846647,0.000047694808,0.0014854586,0.0065635503,0.0017062357],"about_ca_topic_score_codex":0.0005018095,"about_ca_topic_score_gemma":0.000027286094,"teacher_disagreement_score":0.5432053,"about_ca_system_score_codex":0.00018747785,"about_ca_system_score_gemma":0.00017941561,"threshold_uncertainty_score":0.9995643},"labels":[],"label_agreement":null},{"id":"W4288754847","doi":"10.5311/josis.2022.24.199","title":"Temporally relevant parallel top-k spatial keyword search","year":2022,"lang":"en","type":"article","venue":"Journal of Spatial Information Science","topic":"Data Management and Algorithms","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; New Brunswick Innovation Foundation","keywords":"Computer science; Exploit; Search engine indexing; Information retrieval; Ranking (information retrieval); Data mining; Relevance (law); Visitor pattern","score_opus":0.019932350311511565,"score_gpt":0.26737424443389285,"score_spread":0.2474418941223813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288754847","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.012530954,0.000013305216,0.97936904,0.0030522714,0.0015227668,0.00014759574,0.0000071939953,0.00003149829,0.0033253632],"genre_scores_gemma":[0.94691396,0.0000226278,0.051840477,0.0009153922,0.00015651922,0.000005167017,0.0000058784153,0.0000031735615,0.00013680497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642193,0.00005705087,0.0007348522,0.00014002692,0.0023307747,0.00031533578],"domain_scores_gemma":[0.9983338,0.00003832217,0.0006251169,0.0003716548,0.0004716416,0.00015942943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036096661,0.000101898615,0.00015686001,0.00076830894,0.00063837203,0.00084937376,0.0029067674,0.000015626701,0.00011406879],"category_scores_gemma":[0.00012657479,0.00008694045,0.00007274622,0.0012390163,0.00013464906,0.012465359,0.0013658969,0.00033363356,0.000057391397],"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.00007539001,0.00011913137,0.0013504368,0.000020122743,0.00001808354,0.000050235365,0.004106441,0.0218302,0.00059718726,0.022255959,0.005295414,0.9442814],"study_design_scores_gemma":[0.0015859364,0.0012611459,0.017464021,0.0000257237,0.0000103605835,0.00025666418,0.0012044206,0.7898218,0.0010945578,0.0015657353,0.18528351,0.0004261121],"about_ca_topic_score_codex":0.0003662277,"about_ca_topic_score_gemma":0.000007969899,"teacher_disagreement_score":0.9438553,"about_ca_system_score_codex":0.00016522087,"about_ca_system_score_gemma":0.00061211473,"threshold_uncertainty_score":0.9037084},"labels":[],"label_agreement":null},{"id":"W4289977807","doi":"","title":"Logical consistency for vague spatiotemporal objects and relations","year":2007,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Consistency (knowledge bases); Theoretical computer science; Artificial intelligence","score_opus":0.02550412377743246,"score_gpt":0.24695914231199764,"score_spread":0.22145501853456517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289977807","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.0034575958,0.00069584284,0.9426437,0.009658184,0.00033980532,0.00071694405,0.00007207935,0.0003028565,0.042112965],"genre_scores_gemma":[0.3261189,0.00029741702,0.6622173,0.00024311947,0.000046027246,0.00010192581,0.00083011866,0.000028897894,0.0101162745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672407,0.0011178243,0.0005023683,0.0009482325,0.00034776694,0.00035973775],"domain_scores_gemma":[0.9949406,0.0014577472,0.00040604608,0.0019373315,0.0010805537,0.00017771503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048970063,0.00028952892,0.00031723685,0.00025244209,0.00044569332,0.0008514748,0.0016131933,0.00025551204,0.000026781792],"category_scores_gemma":[0.0010618325,0.0003006809,0.00015044154,0.00033658708,0.0002182615,0.00039726973,0.00272864,0.00042602012,0.000023657749],"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.0000053270323,0.00032044857,0.0013203089,0.00015536165,0.00007132608,0.000008860328,0.00291078,0.000024069272,0.00006523385,0.86109704,0.0041282857,0.12989298],"study_design_scores_gemma":[0.002944641,0.000004959283,0.029584702,0.0027245781,0.00021249312,0.000037097987,0.00028996982,0.5850296,0.007933804,0.24695216,0.12175377,0.002532213],"about_ca_topic_score_codex":0.0002921023,"about_ca_topic_score_gemma":0.0005435177,"teacher_disagreement_score":0.61414486,"about_ca_system_score_codex":0.00006343155,"about_ca_system_score_gemma":0.00018517241,"threshold_uncertainty_score":0.9999445},"labels":[],"label_agreement":null},{"id":"W4292904533","doi":"10.1007/978-3-319-07153-4_19-1","title":"Variable Neighborhood Search","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable (mathematics); Computer science; Mathematics; Mathematical analysis","score_opus":0.0215776124563754,"score_gpt":0.22285010164376273,"score_spread":0.20127248918738733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292904533","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":[2.5652038e-9,0.00003471361,0.46347255,0.00040024743,0.00026551526,0.00007584643,0.000011628048,0.00014039791,0.5355991],"genre_scores_gemma":[0.000008385081,0.00006554235,0.05626716,0.0004201503,0.0002750026,0.0000027856065,0.000015580139,0.000020442949,0.942925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985905,0.000006731558,0.00017193289,0.0005472559,0.00039528767,0.00028823328],"domain_scores_gemma":[0.99860114,0.000045244167,0.000050353323,0.0011516744,0.000060088925,0.00009150848],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021606368,0.00021705177,0.0001912734,0.00015444428,0.00006439819,0.00030443145,0.0018666597,0.00011893082,0.0030715796],"category_scores_gemma":[0.0000034587256,0.0001526985,0.0000649692,0.000039804305,0.000030976855,0.000637324,0.0014301295,0.00015231494,0.0053071855],"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.3946932e-7,0.000003939267,4.6561328e-7,0.000008065673,0.000027827622,0.0000142260915,0.0000033392573,1.3100728e-7,0.0000018856651,0.8674515,0.025256693,0.10723157],"study_design_scores_gemma":[0.000107206775,0.000024700954,0.0000011633323,0.000041942352,0.000005996351,0.000001996053,2.894634e-7,0.0011838005,0.0000077706,0.31442383,0.68398315,0.0002181641],"about_ca_topic_score_codex":0.000004215049,"about_ca_topic_score_gemma":6.5639534e-7,"teacher_disagreement_score":0.65872645,"about_ca_system_score_codex":0.000031451502,"about_ca_system_score_gemma":0.000066103654,"threshold_uncertainty_score":0.99783975},"labels":[],"label_agreement":null},{"id":"W4295767229","doi":"10.1109/fuzz-ieee55066.2022.9882645","title":"Transportation Analytics with Fuzzy Logic and Regression","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","topic":"Data Management and Algorithms","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 Manitoba","funders":"","keywords":"Schedule; Public transport; Fuzzy logic; Computer science; Transport engineering; Transit (satellite); Analytics; Real-time computing; Regression analysis; Operations research; Engineering; Data mining; Artificial intelligence; Machine learning","score_opus":0.05806613571502524,"score_gpt":0.2879523163196346,"score_spread":0.22988618060460936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295767229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37962344,0.0008735631,0.38748464,0.016038172,0.0395754,0.0046132007,0.002636907,0.0018167188,0.16733797],"genre_scores_gemma":[0.99146515,0.0001279382,0.0010521491,0.00038181382,0.00026119122,0.00016705832,0.00025959135,0.000025023803,0.006260098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657845,0.00018208478,0.00050253083,0.0008797525,0.0015024382,0.00035471117],"domain_scores_gemma":[0.9985176,0.00007451691,0.00041005263,0.0006203281,0.00023164877,0.00014587227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005980779,0.00033707664,0.0003370854,0.0004572207,0.00038005557,0.0005990361,0.001571965,0.00006340718,0.00010137974],"category_scores_gemma":[0.000010925553,0.00028589283,0.0000778845,0.00053747563,0.0000775857,0.0008615558,0.00012189025,0.00041935008,0.000051971892],"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.00033947176,0.0006153719,0.003827191,0.00019479397,0.00053403544,0.00082425965,0.001818153,0.015058053,0.0030877905,0.92312735,0.030095642,0.020477906],"study_design_scores_gemma":[0.0060530156,0.002759764,0.008144587,0.00091333006,0.00022196556,0.00029203744,0.005658882,0.89061767,0.0011733518,0.02247743,0.058564674,0.0031233216],"about_ca_topic_score_codex":0.00019808683,"about_ca_topic_score_gemma":0.000057656067,"teacher_disagreement_score":0.9006499,"about_ca_system_score_codex":0.0001843468,"about_ca_system_score_gemma":0.00010689075,"threshold_uncertainty_score":0.99995935},"labels":[],"label_agreement":null},{"id":"W4296289779","doi":"10.48550/arxiv.0812.0146","title":"Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact\\n Similarity Search in High Dimensions","year":2008,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Mathematics; Omega; Combinatorics; Nearest neighbor search; Tree (set theory); Search engine indexing; Dimension (graph theory); Context (archaeology); Metric (unit); Metric space; Intrinsic dimension; Discrete mathematics; Upper and lower bounds; Curse of dimensionality; Computer science; Artificial intelligence; Statistics; Mathematical analysis","score_opus":0.09612717945864159,"score_gpt":0.2153419356837935,"score_spread":0.11921475622515192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296289779","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.83677053,0.000053053624,0.15920536,0.00008427386,0.00093389925,0.0009824571,0.00007500921,0.00007193993,0.0018234764],"genre_scores_gemma":[0.99035037,0.002778983,0.0040619364,0.00007699549,0.000087771215,0.0000037182479,0.000068394525,0.0000343737,0.0025374682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99547887,0.00021312956,0.00065821654,0.0022069588,0.0004271047,0.0010157143],"domain_scores_gemma":[0.9960802,0.0005426156,0.00049868476,0.00222763,0.000395959,0.00025486297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011080449,0.00066748203,0.0009080999,0.0024700845,0.0005266487,0.00018299438,0.0034901567,0.00042555237,0.000038868875],"category_scores_gemma":[0.00011933844,0.0007878465,0.00040793998,0.004344786,0.00044284883,0.0016282331,0.004443107,0.0011664027,0.00004283594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016430129,0.0046256254,0.07767809,0.0016319313,0.0008501667,0.0010300915,0.0009124405,0.63782436,0.0000781697,0.22308517,0.00079448114,0.049846463],"study_design_scores_gemma":[0.002400941,0.00082819985,0.0221236,0.00046523302,0.00010924482,0.0000020026368,0.000081577295,0.96869963,0.0008082665,0.001564727,0.002038944,0.0008776546],"about_ca_topic_score_codex":0.00032842037,"about_ca_topic_score_gemma":0.00005345243,"teacher_disagreement_score":0.33087525,"about_ca_system_score_codex":0.00048644625,"about_ca_system_score_gemma":0.00039086048,"threshold_uncertainty_score":0.99945724},"labels":[],"label_agreement":null},{"id":"W4297970676","doi":"10.1561/1100000046","title":"Supporting and Exploiting Spatial Memory in User Interfaces","year":2013,"lang":"en","type":"article","venue":"Foundations and Trends® in Human–Computer Interaction","topic":"Data Management and Algorithms","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 Saskatchewan","funders":"","keywords":"Computer science; Human–computer interaction; Cognitive psychology; Psychology","score_opus":0.028109450966757737,"score_gpt":0.3175107030948831,"score_spread":0.2894012521281254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297970676","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.7896458,0.000016147069,0.20733218,0.0006967297,0.00062953087,0.00015198097,0.0000013332972,0.00008240292,0.0014439286],"genre_scores_gemma":[0.9876636,0.0000071989743,0.01156846,0.000084982334,0.00013407134,0.000041739906,0.00004843992,0.000007623474,0.00044385588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.000053532603,0.00038647457,0.00041179458,0.00010527572,0.00022743909],"domain_scores_gemma":[0.99952596,0.00006442382,0.00013509524,0.00020175232,0.00003094661,0.000041819112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020783102,0.00013839923,0.00014235119,0.0006696434,0.00014232064,0.0009819207,0.0002184977,0.000033295968,0.00016567463],"category_scores_gemma":[0.000007584877,0.00013895104,0.000021226188,0.00027169625,0.000032345408,0.0035990302,0.0003989893,0.00017117795,0.000021059981],"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.0000016131058,0.00007721239,0.0049839676,0.000015496957,0.000012043394,0.000008275661,0.0014879303,0.000118820826,0.0001531042,0.0036228737,0.0005648657,0.98895377],"study_design_scores_gemma":[0.0012365492,0.00017277431,0.33219755,0.00020916894,0.000010287433,0.00003444958,0.00077172683,0.65674627,0.00030207753,0.0037909565,0.0040208115,0.00050740445],"about_ca_topic_score_codex":0.0015370414,"about_ca_topic_score_gemma":0.00094851357,"teacher_disagreement_score":0.9884464,"about_ca_system_score_codex":0.00004273363,"about_ca_system_score_gemma":0.0000045012016,"threshold_uncertainty_score":0.9468684},"labels":[],"label_agreement":null},{"id":"W4298176586","doi":"10.1007/978-1-4939-7131-2_100611","title":"Location-Based Recommendation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Computer science; Business","score_opus":0.02729451194850085,"score_gpt":0.23875779239850933,"score_spread":0.21146328045000848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298176586","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":[1.6256305e-8,0.0000064666156,0.50252163,0.00097155414,0.00030518355,0.00006863243,0.0000024991916,0.00012062255,0.49600336],"genre_scores_gemma":[0.000042239295,0.000009717445,0.06891686,0.0015867251,0.00024059392,0.0000047551343,0.00034454142,0.000013749601,0.9288408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992119,0.0000051998136,0.00016129857,0.00036087958,0.00015516739,0.000105550534],"domain_scores_gemma":[0.9991038,0.00002796344,0.00010705271,0.00061239133,0.00011142589,0.00003737991],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015219909,0.00014520828,0.000101199075,0.00014514863,0.000057920577,0.00021401979,0.00075087545,0.00007507034,0.0039392407],"category_scores_gemma":[0.000005539499,0.00013454883,0.00003811912,0.000044434186,0.000026507576,0.0003811286,0.00021021292,0.00007179287,0.0039386],"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":[4.94413e-7,0.00000642127,4.6920763e-7,0.000016019707,0.000013200062,0.0000011852073,0.000007026105,0.0000015211476,1.5365515e-7,0.6129443,0.21582632,0.17118287],"study_design_scores_gemma":[0.00008683069,0.00003313991,0.0000030517347,0.000033955264,0.0000068862287,2.3861526e-7,5.620282e-7,0.042824697,0.000016130443,0.028019907,0.9287867,0.00018791272],"about_ca_topic_score_codex":0.000004962172,"about_ca_topic_score_gemma":0.000008915383,"teacher_disagreement_score":0.71296036,"about_ca_system_score_codex":0.00003300305,"about_ca_system_score_gemma":0.000047750862,"threshold_uncertainty_score":0.9969713},"labels":[],"label_agreement":null},{"id":"W4298780211","doi":"","title":"Development of business spatial analysis tools: methodology and framework","year":2015,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Data science; Systems engineering; Software engineering; Engineering","score_opus":0.06654460554948696,"score_gpt":0.27478097921575,"score_spread":0.20823637366626305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298780211","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.021451592,0.00016792648,0.9712741,0.0024545165,0.000095082236,0.00008894186,0.000004668224,0.000074817835,0.0043884036],"genre_scores_gemma":[0.18821743,0.000032614404,0.8111087,0.0000468183,0.0000066126686,0.000008030339,0.000053892032,0.000005257345,0.00052062375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997109,0.0017027265,0.0003255342,0.0003921239,0.00028737602,0.00018322922],"domain_scores_gemma":[0.9966115,0.00092891586,0.00021950953,0.0010687181,0.0010545555,0.00011682738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005950499,0.00011980464,0.00024964463,0.00024287034,0.000120660836,0.0002458175,0.001070211,0.000065003325,0.000017787275],"category_scores_gemma":[0.0016941899,0.00011668598,0.000046733316,0.0013585772,0.00010411073,0.00041651615,0.0010524883,0.00009755228,0.000009612986],"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.000004480368,0.00017494187,0.0026756455,0.000025677957,0.00018730942,0.0000024449123,0.010855902,0.000031347197,0.00028112845,0.28120527,0.00015220788,0.70440364],"study_design_scores_gemma":[0.0027809306,0.0000027647902,0.27653685,0.0008944261,0.0006208751,0.000018446786,0.0014011455,0.40450525,0.097850524,0.050738893,0.1627106,0.0019392874],"about_ca_topic_score_codex":0.00032731195,"about_ca_topic_score_gemma":0.00059414894,"teacher_disagreement_score":0.70246434,"about_ca_system_score_codex":0.000024612724,"about_ca_system_score_gemma":0.00011879996,"threshold_uncertainty_score":0.47583163},"labels":[],"label_agreement":null},{"id":"W4299716523","doi":"","title":"Extraction et gestion de connaissances dans un contexte spatio-temporel : applications à la géomatique pour la gestion des territoires","year":2008,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Political science; Humanities; Philosophy","score_opus":0.02885394583863831,"score_gpt":0.2566578654040829,"score_spread":0.2278039195654446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299716523","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.02088784,0.0011893783,0.890398,0.038903948,0.00025942188,0.0010292004,0.00014397524,0.0005609121,0.046627294],"genre_scores_gemma":[0.60477656,0.009191121,0.3631439,0.0001736131,0.000101391066,0.0007088736,0.0015464262,0.000085436295,0.020272713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98254985,0.013616513,0.0010238277,0.0014616105,0.00069949054,0.00064874],"domain_scores_gemma":[0.98963034,0.004412043,0.0011749073,0.002539466,0.0019046289,0.000338619],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009813759,0.00067433383,0.00054021284,0.00031846215,0.0013292918,0.0017930549,0.0025539724,0.0006462291,0.00007805505],"category_scores_gemma":[0.0017558493,0.00078150287,0.0002911527,0.0007557931,0.0012847491,0.0017328312,0.0015657934,0.0012652824,0.00011432071],"study_design_candidate":"theoretical_or_conceptual","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.000011418918,0.0011564022,0.0031108183,0.0002533932,0.00012261688,0.00003194909,0.015953276,0.00093342474,0.0020029747,0.5113633,0.0022919879,0.4627684],"study_design_scores_gemma":[0.001465914,0.0000037732525,0.22992057,0.0058543305,0.00020921139,0.0004375283,0.000504151,0.35694396,0.02004173,0.06297055,0.3200494,0.0015988712],"about_ca_topic_score_codex":0.010177775,"about_ca_topic_score_gemma":0.005067746,"teacher_disagreement_score":0.5838887,"about_ca_system_score_codex":0.00046238405,"about_ca_system_score_gemma":0.00067515095,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W4300934746","doi":"10.1007/978-1-4614-6170-8_100572","title":"Location-Based Recommendation","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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; Geography","score_opus":0.021004065057828605,"score_gpt":0.22433946377126268,"score_spread":0.2033353987134341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300934746","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":[4.1874584e-9,0.0000057714756,0.52205837,0.0014361867,0.00023288686,0.00006118949,0.0000013453306,0.00011650957,0.47608772],"genre_scores_gemma":[0.00014521957,0.000009185626,0.054443818,0.0022757344,0.00015898992,0.00000547167,0.00037526677,0.000014576978,0.94257176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992254,0.000007104631,0.00016704305,0.00034433577,0.00015430912,0.00010180288],"domain_scores_gemma":[0.99912,0.000043897817,0.00011361537,0.0006110454,0.00007278813,0.000038671536],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018184178,0.00014718513,0.00011730471,0.00014227701,0.00005041388,0.00019967784,0.00072356826,0.000073550334,0.00083262287],"category_scores_gemma":[0.0000064635565,0.00013686776,0.000041795694,0.000035454366,0.000014610371,0.00020872026,0.00017173537,0.000087515924,0.0018448867],"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":[1.8591605e-7,0.0000021703138,3.341858e-7,0.000012504298,0.000005763691,4.2172704e-7,0.0000013234899,0.000006716855,7.334789e-8,0.6874317,0.044769127,0.26776966],"study_design_scores_gemma":[0.000089509194,0.000020301228,0.0000034617813,0.000029600973,0.0000063242915,1.8814826e-7,1.8111962e-7,0.09392989,0.000007345819,0.015460167,0.89027554,0.00017748075],"about_ca_topic_score_codex":0.0000060160073,"about_ca_topic_score_gemma":0.000006657397,"teacher_disagreement_score":0.8455064,"about_ca_system_score_codex":0.000028036178,"about_ca_system_score_gemma":0.000033935015,"threshold_uncertainty_score":0.9989323},"labels":[],"label_agreement":null},{"id":"W4302611064","doi":"10.1007/978-0-387-39940-9_849","title":"Answering Queries Using Views","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.04029706804401342,"score_gpt":0.2609331415122563,"score_spread":0.22063607346824285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302611064","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.0000085020265,0.004775548,0.17025791,0.00003364385,0.0026890566,0.0006465461,0.00065179577,0.00019341995,0.82074356],"genre_scores_gemma":[0.000101110585,0.005821439,0.09513746,0.000101477206,0.0020216687,0.000022562821,0.0013405578,0.00012308797,0.8953306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997301,0.000041667958,0.0008657999,0.0007705112,0.0006651189,0.00035589613],"domain_scores_gemma":[0.99700475,0.00005518643,0.0006823852,0.0020370428,0.000093208684,0.00012741762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005315788,0.00048534042,0.000758857,0.00036210852,0.0000985972,0.00018552956,0.0016978441,0.00014991287,0.00004200438],"category_scores_gemma":[0.000023839191,0.00046771186,0.00015544092,0.00011405904,0.00006918419,0.0015443475,0.00088583404,0.0002726069,0.0001119835],"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.000008746924,0.00007030331,0.000024089457,0.0016622449,0.00024357806,0.00044794148,0.00036274167,0.00013308009,0.00011451059,0.80832,0.055320468,0.13329232],"study_design_scores_gemma":[0.00014538693,0.000045502988,0.000004454278,0.0010635471,0.00005398207,0.000020601372,0.000014218338,0.004692026,0.00001242298,0.00046835913,0.99295753,0.0005219917],"about_ca_topic_score_codex":0.00015592006,"about_ca_topic_score_gemma":0.000016924985,"teacher_disagreement_score":0.93763703,"about_ca_system_score_codex":0.00006114179,"about_ca_system_score_gemma":0.00011200157,"threshold_uncertainty_score":0.99977744},"labels":[],"label_agreement":null},{"id":"W4307918117","doi":"10.1007/s00453-022-01054-3","title":"Selected Papers of the 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021","year":2022,"lang":"en","type":"editorial","venue":"Algorithmica","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Theory of computation; Computer science; Algorithm; Library science","score_opus":0.007573675400381433,"score_gpt":0.23803725725127073,"score_spread":0.2304635818508893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307918117","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000552989,0.0001213085,0.0038703536,0.0014886158,0.98070174,0.0005795956,0.0008197073,0.00016198133,0.012251164],"genre_scores_gemma":[0.00027748547,0.00057350734,0.010208445,0.0003148577,0.9674729,0.00027825785,0.0033314615,0.00017755525,0.017365536],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932454,0.00035745776,0.00080532284,0.0014018721,0.0035208084,0.0006690866],"domain_scores_gemma":[0.9952016,0.0011224893,0.00077630347,0.0022664259,0.0004957528,0.00013745954],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007690489,0.0006521462,0.00068493263,0.00039019377,0.0004240969,0.00046045263,0.008930612,0.0005138913,0.0008018672],"category_scores_gemma":[0.0009760285,0.00054697285,0.00039289176,0.0019090234,0.00017798918,0.00048253237,0.0041710213,0.0020262606,0.000071053124],"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.00002565306,0.00025587468,0.0000020046298,0.000018587038,0.00031387343,0.000032688902,0.0000889873,0.000027308439,0.0000116853535,0.004438585,0.90944636,0.085338384],"study_design_scores_gemma":[0.001225166,0.00016363611,0.000029489021,0.00011024495,0.00007476966,0.0000022964605,0.000041248735,0.0055252216,0.0001420771,0.0009820077,0.99111694,0.00058690703],"about_ca_topic_score_codex":0.000087750646,"about_ca_topic_score_gemma":0.0000065542436,"teacher_disagreement_score":0.08475148,"about_ca_system_score_codex":0.00039208558,"about_ca_system_score_gemma":0.0006518664,"threshold_uncertainty_score":0.99969816},"labels":[],"label_agreement":null},{"id":"W4312241835","doi":"10.1007/978-3-030-95995-1_6","title":"Distance-Based Classification","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Point (geometry); Class (philosophy); Feature (linguistics); Space (punctuation); Mathematics; Pattern recognition (psychology); Combinatorics; Artificial intelligence; Computer science; Geometry; Philosophy; Linguistics","score_opus":0.039564482123288044,"score_gpt":0.23114231360837664,"score_spread":0.1915778314850886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312241835","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":[1.1443473e-8,0.00003314733,0.4380024,0.00081496633,0.00026676123,0.00008317069,0.0000116099245,0.00015289415,0.56063503],"genre_scores_gemma":[0.0001084638,0.00004063535,0.02039995,0.0006510957,0.00007280674,0.000018787418,0.00032643875,0.000016020747,0.9783658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891347,0.000006946951,0.00015737853,0.00044139833,0.00036188963,0.000118903],"domain_scores_gemma":[0.998868,0.000024175513,0.000111742396,0.000937326,0.000021467227,0.000037285878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000120053825,0.0001504258,0.00011924385,0.00011985255,0.00009968288,0.00017897996,0.0012646222,0.00004358263,0.0026115277],"category_scores_gemma":[0.0000022095971,0.00014377967,0.000072351075,0.000044961733,0.000023401197,0.00033315583,0.00038046483,0.00015246951,0.0003708543],"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":[5.858052e-7,0.00000602865,8.784611e-7,0.000007244578,0.0000071455606,0.000007996517,0.0000026451182,0.0000026220487,4.74732e-7,0.9077256,0.030436069,0.06180276],"study_design_scores_gemma":[0.00007760272,0.000019725847,0.00001485304,0.0000072069997,0.00000656957,2.4736917e-7,9.12464e-7,0.024663286,0.0000020197251,0.021375168,0.95364624,0.00018617764],"about_ca_topic_score_codex":0.000004187574,"about_ca_topic_score_gemma":0.000004134177,"teacher_disagreement_score":0.92321014,"about_ca_system_score_codex":0.000070539165,"about_ca_system_score_gemma":0.000042248474,"threshold_uncertainty_score":0.9983002},"labels":[],"label_agreement":null},{"id":"W4312505544","doi":"10.1109/tsc.2022.3219099","title":"Efficient and Privacy-Preserving Spatial-Feature-Based Reverse kNN Query","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Data Management and Algorithms","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 New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Homomorphic encryption; Data mining; Encryption; Location-based service; Feature (linguistics); Leverage (statistics); Artificial intelligence; Computer security; Computer network","score_opus":0.01077334907041782,"score_gpt":0.22364905085688136,"score_spread":0.21287570178646353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312505544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044819858,0.000041569558,0.95176786,0.0013889326,0.0010862675,0.00026716563,0.000021433276,0.0003549157,0.0002519869],"genre_scores_gemma":[0.9618156,0.0000029925375,0.036395848,0.0015505549,0.000054202377,0.000017952847,0.000008775456,0.00001840409,0.00013565947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998128,0.00015823498,0.00023475398,0.0006258383,0.0004961167,0.00035703793],"domain_scores_gemma":[0.99876124,0.00015914916,0.00013302907,0.00080769334,0.00004033529,0.000098529876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047486436,0.00020997938,0.00018566064,0.00028720056,0.0010933286,0.00031492364,0.0013991724,0.00003382393,0.000045565266],"category_scores_gemma":[0.0000015945383,0.00022734016,0.0000821453,0.0006848853,0.000022946348,0.00023462383,0.00013950182,0.00039030032,0.00001594822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000267195,0.0003128013,0.000078021156,0.00019579616,0.00005289784,0.000047475078,0.0013931711,0.8679671,0.0003241219,0.0003209676,0.0002798054,0.12900111],"study_design_scores_gemma":[0.00053217093,0.00008907727,0.00027747222,0.000056401856,0.00001957726,0.000008202627,0.00018353948,0.9944251,0.0005293609,0.000056605455,0.003572482,0.00024998662],"about_ca_topic_score_codex":0.00039986073,"about_ca_topic_score_gemma":0.000052555748,"teacher_disagreement_score":0.91699576,"about_ca_system_score_codex":0.00007357017,"about_ca_system_score_gemma":0.00003418566,"threshold_uncertainty_score":0.92706627},"labels":[],"label_agreement":null},{"id":"W4312828852","doi":"10.1609/socs.v4i1.18276","title":"Invited Speakers","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","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; Graph; Linguistics; Theoretical computer science; Philosophy","score_opus":0.015686973692458896,"score_gpt":0.24841830991334163,"score_spread":0.23273133622088274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312828852","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.53858477,0.000040355164,0.0009472008,0.26340804,0.028182093,0.0006447303,0.000032520773,0.0002764259,0.16788386],"genre_scores_gemma":[0.9950186,0.00003489145,0.0014792507,0.0015533518,0.0005324824,0.000011720677,0.000007628581,0.000013586984,0.0013484637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817747,0.000010924679,0.00020773403,0.00033255416,0.0010810766,0.0001902393],"domain_scores_gemma":[0.99898195,0.000057493336,0.000095000396,0.00021384175,0.0005977833,0.000053950436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039250284,0.00010416348,0.00011056084,0.000071553426,0.00009840627,0.00037298922,0.0026231082,0.00003875893,0.000019482448],"category_scores_gemma":[0.00012455977,0.00008312854,0.00009563974,0.00053399557,0.000049919763,0.00054192916,0.0015771973,0.00018449141,0.000022855105],"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.000028567965,0.00027123562,0.0021272488,0.00002078436,0.00008279904,0.000004389153,0.00017718934,0.000015129967,0.04745058,0.9234004,0.024702156,0.001719508],"study_design_scores_gemma":[0.0021138554,0.00019885664,0.003808613,0.00016999633,0.000017266106,0.000017827031,0.00013129195,0.011520932,0.79292005,0.055240586,0.13348578,0.00037493822],"about_ca_topic_score_codex":0.00002581463,"about_ca_topic_score_gemma":5.490347e-7,"teacher_disagreement_score":0.86815983,"about_ca_system_score_codex":0.000094504714,"about_ca_system_score_gemma":0.000025927553,"threshold_uncertainty_score":0.48744312},"labels":[],"label_agreement":null},{"id":"W4312981500","doi":"10.1609/socs.v3i1.18231","title":"Preface","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","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":"Philosophy","score_opus":0.015604662883654495,"score_gpt":0.25272188448375094,"score_spread":0.23711722160009643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312981500","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.4168236,0.000054890897,0.0013661599,0.09052603,0.028838264,0.00067501736,0.000030434623,0.00027600076,0.4614096],"genre_scores_gemma":[0.9938968,0.000029332557,0.001325435,0.00028633233,0.00038858433,0.000011414304,0.0000033088093,0.000009487592,0.0040493063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99828905,0.0000093524195,0.00018286274,0.00031615124,0.0010286992,0.00017388462],"domain_scores_gemma":[0.9990263,0.000052427706,0.00008369796,0.00021136252,0.00058046763,0.000045723715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036218175,0.000093873925,0.00009955173,0.000047438618,0.00009703681,0.0003541802,0.0027411229,0.000035143934,0.000028560113],"category_scores_gemma":[0.00010217837,0.00007329549,0.00008570135,0.0003805428,0.000039321974,0.0005350279,0.0017222866,0.0001675688,0.000033850487],"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.000014619596,0.00018048177,0.0009200377,0.000014666759,0.000042643187,0.000001655274,0.00009771186,0.000011391849,0.030280035,0.961489,0.005721481,0.0012262538],"study_design_scores_gemma":[0.0012755207,0.00014644324,0.0020209644,0.0001166513,0.00001076001,0.000011769723,0.00006582107,0.0072410735,0.84788483,0.057901762,0.083076425,0.00024797954],"about_ca_topic_score_codex":0.000017020928,"about_ca_topic_score_gemma":3.4746662e-7,"teacher_disagreement_score":0.9035873,"about_ca_system_score_codex":0.00007829097,"about_ca_system_score_gemma":0.00004591706,"threshold_uncertainty_score":0.5093734},"labels":[],"label_agreement":null},{"id":"W4313125234","doi":"10.1109/igarss46834.2022.9883531","title":"An Improved Progressive Transmission Method for the Vector Map Data","year":2022,"lang":"en","type":"article","venue":"IGARSS 2022 - 2022 IEEE International Geoscience and Remote Sensing Symposium","topic":"Data Management and Algorithms","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":"Ministry of Natural Resources","keywords":"Voronoi diagram; Monotone polygon; Intersection (aeronautics); Chain (unit); Computer science; Algorithm; Diagram; Transmission (telecommunications); Topology (electrical circuits); Mathematics; Combinatorics; Engineering; Physics","score_opus":0.02628385807562654,"score_gpt":0.3188998251329902,"score_spread":0.29261596705736365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313125234","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.00041197747,0.00023651181,0.97497016,0.01806253,0.005295434,0.000575628,0.0002263551,0.000106563595,0.000114827526],"genre_scores_gemma":[0.013658505,0.00027984168,0.9730249,0.00411677,0.0011387364,0.000017373965,0.00066793,0.000054150158,0.0070417714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972599,0.00016813226,0.00029025393,0.0010793654,0.0008209528,0.0003813556],"domain_scores_gemma":[0.9982415,0.00024133833,0.00019350393,0.0011115522,0.000103281796,0.00010885458],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018275959,0.00019800094,0.00015790567,0.00017317424,0.0013030296,0.00072689063,0.0037725659,0.00003202405,0.000028591536],"category_scores_gemma":[0.000029755123,0.00015218437,0.00006711991,0.0004492838,0.00012761173,0.0012466663,0.0014429932,0.00028236702,0.0000021556605],"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.00004571706,0.00007553524,0.0000024693327,0.000016714517,0.00006023863,0.000043933138,0.00076819793,0.00047478295,0.04113797,0.0012485089,0.004070257,0.9520557],"study_design_scores_gemma":[0.00031216975,0.00016199419,0.00003856942,0.000013517973,0.000022949074,0.000083806015,0.00022836894,0.8795477,0.0009872036,0.00091671734,0.117484935,0.00020207501],"about_ca_topic_score_codex":0.00031588806,"about_ca_topic_score_gemma":0.000014186994,"teacher_disagreement_score":0.9518536,"about_ca_system_score_codex":0.000069144946,"about_ca_system_score_gemma":0.00010733808,"threshold_uncertainty_score":0.99999714},"labels":[],"label_agreement":null},{"id":"W4313400513","doi":"10.1007/s10878-022-00976-6","title":"Approximation algorithms for the lower bounded correlation clustering problem","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Data Management and Algorithms","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":"University of New Brunswick","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Postdoctoral Research Foundation of China; National Natural Science Foundation of China","keywords":"Rounding; Mathematics; Cluster analysis; Bounded function; Combinatorics; Theory of computation; Approximation algorithm; Algorithm; Correlation clustering; Generalization; Discrete mathematics; Time complexity; Computer science","score_opus":0.01637880291401984,"score_gpt":0.24217942203516082,"score_spread":0.225800619121141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313400513","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.00003562696,0.000058361766,0.9882629,0.0012311056,0.009705113,0.00045718224,0.0000029407433,0.000029462493,0.00021734028],"genre_scores_gemma":[0.044617265,0.000043906348,0.9537602,0.00019112375,0.0009467416,0.00008992017,0.000044685876,0.00002411963,0.00028203806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867964,0.00009076041,0.0004308778,0.00013107395,0.0005301609,0.00013747721],"domain_scores_gemma":[0.99870336,0.0001463808,0.00063995185,0.0002099523,0.00026762826,0.000032727592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318017,0.000091029935,0.00013131165,0.00014260245,0.00052730954,0.00035369713,0.00075373956,0.00002597349,0.000019049172],"category_scores_gemma":[0.00006373126,0.00007299134,0.00009110193,0.00042401862,0.000014773061,0.0014056095,0.00026285514,0.00016768006,7.7999476e-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.00005860666,0.00013731785,0.0000059790564,0.0000083257855,0.000033231066,0.0000017920282,0.00021007098,0.9321685,0.0000059692147,0.04962706,0.0019722607,0.015770894],"study_design_scores_gemma":[0.0014031322,0.00046768037,0.0000119143715,0.000007667118,0.000030035924,0.000015689147,0.000055139364,0.97174203,0.000014214358,0.014600534,0.011563842,0.00008812358],"about_ca_topic_score_codex":0.000002317158,"about_ca_topic_score_gemma":8.7253895e-8,"teacher_disagreement_score":0.044581637,"about_ca_system_score_codex":0.00013687607,"about_ca_system_score_gemma":0.00007088879,"threshold_uncertainty_score":0.4055692},"labels":[],"label_agreement":null},{"id":"W4315629677","doi":"10.1109/globecom48099.2022.10000905","title":"PPsky: Privacy-Preserving Skyline Queries with Secret Sharing in eHealthcare","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Data Management and Algorithms","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skyline; Computer science; Secret sharing; Scheme (mathematics); Information privacy; Security analysis; Computer security; Cryptography; Data mining","score_opus":0.04884211409982258,"score_gpt":0.3001426850261781,"score_spread":0.2513005709263555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315629677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2059743,0.012837753,0.4515623,0.1448584,0.004725047,0.007097024,0.005052651,0.0040373094,0.16385524],"genre_scores_gemma":[0.95297205,0.00063900126,0.0431965,0.0010325046,0.000037729893,0.00062326924,0.0006845151,0.000024105393,0.0007903027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965336,0.00052396784,0.0005987365,0.0008947787,0.00077936606,0.0006695767],"domain_scores_gemma":[0.99315536,0.00011214404,0.00029581934,0.006109704,0.00016145017,0.00016552296],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0009640718,0.00032922506,0.00037688125,0.0002224715,0.0012121171,0.000574876,0.0146165965,0.0000503961,0.00046005571],"category_scores_gemma":[0.000073711446,0.00036219513,0.00007350043,0.0027812321,0.00016341641,0.0013955826,0.019125894,0.00085533835,0.000034047836],"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.00009931161,0.00088359637,0.08059225,0.00015836426,0.00016524366,0.00015808367,0.002965314,0.0023912382,0.000088277426,0.8216751,0.018034138,0.07278906],"study_design_scores_gemma":[0.0021934407,0.00056528236,0.030309387,0.00020029234,0.00004749975,0.00012308816,0.0055775256,0.65791535,0.00003521099,0.042005472,0.25934985,0.0016775688],"about_ca_topic_score_codex":0.003007535,"about_ca_topic_score_gemma":0.0051481794,"teacher_disagreement_score":0.77966964,"about_ca_system_score_codex":0.0006055507,"about_ca_system_score_gemma":0.00038777757,"threshold_uncertainty_score":0.999883},"labels":[],"label_agreement":null},{"id":"W4318147483","doi":"10.1109/bigdata55660.2022.10020802","title":"A Graph-based Analysis Approach to Cluster Lifetime Dynamics","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Big Data (Big Data)","topic":"Data Management and Algorithms","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; Cluster analysis; Cluster (spacecraft); Graph; Data mining; Outlier; Power graph analysis; Theoretical computer science; Visualization; Data visualization; Artificial intelligence","score_opus":0.21032828965218048,"score_gpt":0.3246473363864822,"score_spread":0.11431904673430171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318147483","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.0003097974,0.000009977057,0.9414078,0.0062627173,0.0037287306,0.00037179986,0.037258036,0.00015871362,0.010492417],"genre_scores_gemma":[0.5332628,0.00006379114,0.06993852,0.012126741,0.0013396335,0.00036224487,0.37746486,0.00006759883,0.005373806],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948825,0.00023367653,0.0004965543,0.0020436472,0.0019056961,0.00043792583],"domain_scores_gemma":[0.99295884,0.00010760339,0.00024716175,0.00634312,0.00014037706,0.00020289555],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014154958,0.0003269168,0.0003446902,0.001321944,0.0003466252,0.0010574168,0.021185935,0.00004510137,0.00029319056],"category_scores_gemma":[0.00010608916,0.00034173718,0.00010051252,0.0023416216,0.00006490536,0.0014052421,0.013042934,0.00045240554,0.00017830069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022469474,0.0020029785,0.0009651868,0.000035022862,0.0022376466,0.00011498693,0.00017883524,0.016623057,0.0000765644,0.12649281,0.4143861,0.43666214],"study_design_scores_gemma":[0.00048268354,0.00008182899,0.00037263715,0.0000080639775,0.00010749328,0.0000039525025,0.000081814054,0.9087697,0.000007672517,0.00047609856,0.08921655,0.00039145473],"about_ca_topic_score_codex":0.00029131744,"about_ca_topic_score_gemma":0.00036381066,"teacher_disagreement_score":0.8921467,"about_ca_system_score_codex":0.00018088298,"about_ca_system_score_gemma":0.00020398309,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W4318978541","doi":"10.5206/mt.v3i1.15951","title":"About this issue","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Data Management and Algorithms","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; Presentation (obstetrics); Function (biology); Constant (computer programming); Variety (cybernetics); Point (geometry); State (computer science); Software; Computation; Programming language; Mathematics; Artificial intelligence","score_opus":0.018005705759383678,"score_gpt":0.2493585582749102,"score_spread":0.23135285251552654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318978541","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.000110020555,0.000026079846,0.97005343,0.0046383725,0.0008145565,0.00008497826,0.000016327069,0.00092694414,0.023329284],"genre_scores_gemma":[0.117634,0.0008302269,0.09897883,0.003280906,0.00065396976,0.00025529708,0.00020452842,0.00006432282,0.7780979],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932635,0.000014140754,0.00009136057,0.00020973416,0.000156143,0.00020224413],"domain_scores_gemma":[0.9994646,0.000024977366,0.000013928888,0.00041579528,0.000014747328,0.00006596675],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000104067156,0.000067823974,0.00006214506,0.00014075499,0.00018406841,0.00015766744,0.00055338326,0.00002158038,0.0007974387],"category_scores_gemma":[0.0000029980201,0.00006664035,0.000049499897,0.00083369017,0.000017143913,0.00056115014,0.000025515208,0.00007348866,0.006032761],"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.0000020954212,0.000082398066,0.00003481642,0.00003382147,0.00005580923,0.00004547204,0.0016285616,0.00040371297,0.00019832261,0.02356237,0.2826714,0.6912812],"study_design_scores_gemma":[0.00013224849,0.00001810169,0.0002986501,0.000004948888,0.0000057993757,0.0000016845253,0.00006122393,0.052898224,0.0002763995,0.00094876596,0.94524235,0.00011161989],"about_ca_topic_score_codex":0.000042560307,"about_ca_topic_score_gemma":0.000012170069,"teacher_disagreement_score":0.8710746,"about_ca_system_score_codex":0.000009698918,"about_ca_system_score_gemma":0.000013605791,"threshold_uncertainty_score":0.99474114},"labels":[],"label_agreement":null},{"id":"W4319159023","doi":"10.3390/su15032717","title":"A Knowledge-Based AI Framework for Mobility as a Service","year":2023,"lang":"en","type":"article","venue":"Sustainability","topic":"Data Management and Algorithms","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":"Cape Breton University","funders":"","keywords":"Computer science; Knowledge management; Data science; Knowledge base; Process (computing); Service (business); Knowledge integration; Knowledge extraction; Artificial intelligence","score_opus":0.021114956024867734,"score_gpt":0.3372967855999437,"score_spread":0.31618182957507596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319159023","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.019210756,0.000027577124,0.94478625,0.03216947,0.00047991038,0.0016257424,0.000023841661,0.0011579823,0.0005184936],"genre_scores_gemma":[0.93909436,0.0000019554054,0.054477666,0.0034629647,0.00020666134,0.0010485973,0.00008372611,0.000028735883,0.0015953239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980296,0.00010493777,0.0002535804,0.00079004787,0.00022563429,0.00059623877],"domain_scores_gemma":[0.9965094,0.0006075578,0.000057400906,0.0016731659,0.0010214383,0.00013107792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016327972,0.00018198651,0.00020409617,0.00014785204,0.0002439083,0.00027480643,0.0014098631,0.000095249176,0.000023116614],"category_scores_gemma":[0.0019874256,0.00017452482,0.00012968895,0.002220405,0.00006973451,0.00062248384,0.0007657298,0.00017412088,0.00019302487],"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.00004344552,0.0004681239,0.0020718202,0.0012919282,0.000021230066,0.000014063416,0.00091161893,0.0003198464,0.0000021918727,0.91114175,0.0067368792,0.07697708],"study_design_scores_gemma":[0.0003368264,0.00009964877,0.008629971,0.0000129282735,0.000008010142,2.2655968e-7,0.00023630857,0.18682648,0.00008048859,0.7545223,0.049039744,0.00020704693],"about_ca_topic_score_codex":0.0001081832,"about_ca_topic_score_gemma":0.000026465392,"teacher_disagreement_score":0.9198836,"about_ca_system_score_codex":0.00033725807,"about_ca_system_score_gemma":0.00066567713,"threshold_uncertainty_score":0.71169156},"labels":[],"label_agreement":null},{"id":"W4319719500","doi":"10.11606/d.55.2022.tde-09022023-114906","title":"ORTree: Aumentando a eficiência de buscas por similaridade diversificadas por meio de particionamento de dados","year":2022,"lang":"pt","type":"dissertation","venue":"","topic":"Data Management and Algorithms","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":"Adidas (Canada)","funders":"","keywords":"Humanities; Physics; Philosophy","score_opus":0.023288165020737186,"score_gpt":0.2872527515110828,"score_spread":0.26396458649034565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319719500","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.09325208,0.0014619621,0.86262697,0.011465503,0.0050323657,0.004296711,0.0009292308,0.0013886031,0.019546555],"genre_scores_gemma":[0.56995136,0.0011000625,0.05801513,0.010248624,0.00066262373,0.0010815618,0.012599582,0.0003324688,0.34600863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937631,0.00039808074,0.00090509874,0.0016177279,0.0015085118,0.0018074716],"domain_scores_gemma":[0.99709797,0.0002035907,0.00060587254,0.0013479127,0.00012524871,0.0006193932],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017149183,0.0008378963,0.00068884395,0.00049269927,0.0011364517,0.0013537455,0.0032533067,0.00030703782,0.0045789164],"category_scores_gemma":[0.000117358235,0.0009035859,0.0004101648,0.0011062648,0.00007882453,0.0011648891,0.0015621308,0.0008342622,0.00021928693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015625389,0.007151817,0.035852235,0.0021177707,0.004624175,0.00905402,0.07440148,0.004721696,0.00416376,0.15824428,0.31279677,0.38530946],"study_design_scores_gemma":[0.0052570016,0.0011091875,0.025553066,0.00039538284,0.002308711,0.000113464805,0.037564497,0.7017716,0.0042892634,0.002174959,0.21555836,0.003904473],"about_ca_topic_score_codex":0.001724485,"about_ca_topic_score_gemma":0.0003911016,"teacher_disagreement_score":0.80461186,"about_ca_system_score_codex":0.0014187081,"about_ca_system_score_gemma":0.0009636879,"threshold_uncertainty_score":0.99968296},"labels":[],"label_agreement":null},{"id":"W4322747644","doi":"10.1007/978-3-031-23876-5_14","title":"Locating Billboards with the Jefferson-d’Hondt Method","year":2023,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Art","score_opus":0.08032925403072175,"score_gpt":0.41906517235668495,"score_spread":0.33873591832596317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322747644","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.00028084416,0.00007273913,0.06846717,0.07317794,0.0036620542,0.0055103535,0.00014777198,0.00038122162,0.8482999],"genre_scores_gemma":[0.022014333,0.0033937579,0.11884962,0.00048277806,0.0004902356,0.0027937372,0.0003272006,0.00014039683,0.85150796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9764118,0.000522834,0.001497084,0.0037867152,0.015317388,0.002464139],"domain_scores_gemma":[0.9921872,0.00048705642,0.00015430988,0.0032619226,0.003522398,0.00038710097],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","scholarly_communication","open_science"],"category_scores_codex":[0.030032719,0.000836466,0.0005580701,0.0139876325,0.0052546235,0.012602692,0.023117874,0.00018043042,0.0006499198],"category_scores_gemma":[0.0009234849,0.0006776331,0.00015715382,0.01111429,0.00885123,0.0140795745,0.016538413,0.002340409,0.00090834143],"study_design_candidate":"theoretical_or_conceptual","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.000072441915,0.00016627015,0.00004749398,0.00006823495,0.00014880166,0.0004538468,0.00093093043,0.07217144,0.000103408696,0.9070764,0.0036043022,0.01515642],"study_design_scores_gemma":[0.002243087,0.00062463223,0.0031659727,0.0016156359,0.000045191195,0.00008738207,0.012164869,0.48450682,0.00054558605,0.055505384,0.4371191,0.0023763475],"about_ca_topic_score_codex":0.00095085043,"about_ca_topic_score_gemma":0.007969543,"teacher_disagreement_score":0.851571,"about_ca_system_score_codex":0.0038685491,"about_ca_system_score_gemma":0.00097413955,"threshold_uncertainty_score":0.99996126},"labels":[],"label_agreement":null},{"id":"W4323076526","doi":"10.48550/arxiv.2303.01415","title":"Local data structures","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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; Data structure; Metric space; Context (archaeology); Theoretical computer science; Metric (unit); Set (abstract data type); Cluster analysis; Mathematics; Algorithm; Data mining; Discrete mathematics; Geography; Artificial intelligence","score_opus":0.19860409782974342,"score_gpt":0.21640594140014635,"score_spread":0.01780184357040293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323076526","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.002216404,0.000027183176,0.99350876,0.0002173182,0.0014480359,0.00017122834,0.00018268304,0.00064569147,0.0015827144],"genre_scores_gemma":[0.9833929,0.00021521606,0.0072597372,0.00013947449,0.0001628039,3.7233912e-7,0.000815563,0.000026276242,0.007987643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977595,0.00006451782,0.000139092,0.0015900345,0.00011805355,0.0003287636],"domain_scores_gemma":[0.99535024,0.00005489314,0.00013271756,0.0043004984,0.000046536028,0.000115117284],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00025388334,0.000251831,0.00022478405,0.00024633217,0.00011760992,0.00031464786,0.00914263,0.00015263191,0.000029791683],"category_scores_gemma":[0.000021681166,0.00027963409,0.00007784679,0.0005706985,0.00010938526,0.00094511145,0.02552435,0.00042107652,0.00043971188],"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.000009543844,0.00005112388,0.0006451778,0.00013075401,0.00024229012,0.0016765752,0.0000691904,0.10462117,0.0000015384144,0.82451946,0.051836625,0.016196547],"study_design_scores_gemma":[0.0001847562,0.000012171003,0.0018227613,0.000027909233,0.000045270765,0.0000011462405,0.000042377767,0.8513423,0.000006426427,0.1372437,0.008920989,0.00035014213],"about_ca_topic_score_codex":0.00025833907,"about_ca_topic_score_gemma":0.00007718513,"teacher_disagreement_score":0.986249,"about_ca_system_score_codex":0.000064485255,"about_ca_system_score_gemma":0.00009313784,"threshold_uncertainty_score":0.9999656},"labels":[],"label_agreement":null},{"id":"W4324118149","doi":"10.1109/bdcat56447.2022.00012","title":"Fast Exploratory Analysis with Spatio-temporal Aggregation over Polygonal Regions","year":2022,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Exploratory data analysis; Data mining; Polygon (computer graphics); Exploratory analysis; Set (abstract data type); A priori and a posteriori; Grid; Computation; Workflow; Theoretical computer science; Algorithm; Database; Data science; Mathematics","score_opus":0.016754648369545558,"score_gpt":0.22427603746533048,"score_spread":0.20752138909578494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324118149","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.012266634,0.000018113027,0.98226774,0.0013058558,0.00011875852,0.00010442707,0.000016494347,0.00018693844,0.0037150662],"genre_scores_gemma":[0.95692855,0.0000032036362,0.035625964,0.00083937065,0.00005329429,0.00006639269,0.0003837136,0.000008033891,0.0060914783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988769,0.000056589044,0.00012334355,0.00032636127,0.0004618721,0.00015490674],"domain_scores_gemma":[0.9993104,0.000014559179,0.00008292896,0.0005133435,0.000027154341,0.0000516439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018723002,0.00008892051,0.000101149926,0.00032421618,0.0002784528,0.0001754067,0.00062486815,0.0000086034115,0.000535244],"category_scores_gemma":[0.0000021809337,0.00007604782,0.000058647107,0.0018835247,0.00002269462,0.0010970416,0.00052077795,0.00007912191,0.000021121094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058552887,0.00059884845,0.12974887,0.000014708621,0.001502993,0.00021267668,0.002306373,0.017471569,0.000018196772,0.6512873,0.11484735,0.08193258],"study_design_scores_gemma":[0.0010392531,0.00032310316,0.0300146,0.0000052310015,0.00025296205,0.000007836171,0.001073088,0.8420794,0.00009494695,0.002618725,0.12181049,0.0006803464],"about_ca_topic_score_codex":0.00012195707,"about_ca_topic_score_gemma":0.00025492883,"teacher_disagreement_score":0.94664174,"about_ca_system_score_codex":0.000042734293,"about_ca_system_score_gemma":0.000037859725,"threshold_uncertainty_score":0.5860546},"labels":[],"label_agreement":null},{"id":"W43621356","doi":"10.1007/978-3-319-08783-2_39","title":"Improved Approximation for Time-Dependent Shortest Paths","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Carleton University","funders":"","keywords":"Lambda; Combinatorics; Shortest path problem; Approximation algorithm; Binary logarithm; Time complexity; Computation; Dijkstra's algorithm; Mathematics; Path (computing); Piecewise linear function; Node (physics); Function (biology); Algorithm; Discrete mathematics; Computer science; Physics; Mathematical analysis; Graph","score_opus":0.012753644988605888,"score_gpt":0.2283138038738385,"score_spread":0.2155601588852326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43621356","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.0000030814936,0.00007398755,0.99409693,0.0005373024,0.0015597418,0.0009718869,0.000019513811,0.00023347976,0.002504078],"genre_scores_gemma":[0.0076307305,0.000018742341,0.9854786,0.0015297353,0.0010563124,0.00006570719,0.0000965156,0.000058861082,0.0040647984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964508,0.000020946649,0.0004975967,0.0016400462,0.00075352006,0.0006371351],"domain_scores_gemma":[0.9974185,0.00034106357,0.00031334735,0.0015800394,0.00021183539,0.00013521644],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013674648,0.0004899216,0.00046931583,0.00061363063,0.00024403186,0.0010453156,0.003952049,0.00022337004,0.000016500657],"category_scores_gemma":[0.00008657085,0.00044635,0.00013637773,0.00030707195,0.00025835817,0.0008105131,0.0015645261,0.00036719267,0.00008355722],"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.0000032252037,0.000020291902,0.0000023422324,0.00004268632,0.000010425706,0.0000075660437,0.00010119123,0.0028529656,0.00024042056,0.019984903,0.00012166071,0.9766123],"study_design_scores_gemma":[0.00029443443,0.00019367792,0.000006586304,0.00010744016,0.000011086234,0.0000089633395,4.3503338e-8,0.92444193,0.0008255822,0.068634495,0.004937103,0.0005386433],"about_ca_topic_score_codex":0.0000067322912,"about_ca_topic_score_gemma":0.000014770865,"teacher_disagreement_score":0.9760737,"about_ca_system_score_codex":0.00017546723,"about_ca_system_score_gemma":0.00019627267,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W4362606319","doi":"10.1007/s10723-023-09653-2","title":"Mining Skyline Patterns from Big Data Environments based on a Spark Framework","year":2023,"lang":"en","type":"article","venue":"Journal of Grid Computing","topic":"Data Management and Algorithms","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":"Brandon University","funders":"","keywords":"Skyline; Computer science; SPARK (programming language); Big data; Cloud computing; Data mining; Edge computing; Distributed Computing Environment; Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence; Operating system","score_opus":0.07696542449973474,"score_gpt":0.2824288848869958,"score_spread":0.20546346038726104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362606319","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.07479517,0.00003177835,0.9201477,0.0012404837,0.0035460992,0.000050244536,0.000037778234,0.000057009733,0.00009372394],"genre_scores_gemma":[0.7583927,0.00003866654,0.23541428,0.0013377778,0.004615089,3.969919e-7,0.00013363636,0.000023708068,0.00004375145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807376,0.00008632289,0.0004937891,0.00037024,0.00066867983,0.00030720126],"domain_scores_gemma":[0.99784106,0.0005436741,0.00046895424,0.0010190689,0.000017866427,0.000109369634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048975,0.00015603905,0.00024387582,0.0002696858,0.000136105,0.000314675,0.0027969107,0.00004332124,0.000011428784],"category_scores_gemma":[0.00015134111,0.00013714694,0.00007140156,0.0003897595,0.000015645406,0.00047404034,0.0015761772,0.00032917442,0.00006932101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021772697,0.00020182012,0.02154432,0.000021085643,0.00013934703,0.00091627584,0.00035701183,0.019559355,0.0000919722,0.00019462357,0.018234894,0.93871754],"study_design_scores_gemma":[0.0005067554,0.00012340146,0.041929983,0.00045949226,0.000019837273,0.00000545685,0.000052705836,0.94199806,0.00008336605,0.00035256403,0.014291103,0.00017729787],"about_ca_topic_score_codex":0.000010425675,"about_ca_topic_score_gemma":8.1176074e-7,"teacher_disagreement_score":0.9385402,"about_ca_system_score_codex":0.000032959957,"about_ca_system_score_gemma":0.000028695737,"threshold_uncertainty_score":0.559269},"labels":[],"label_agreement":null},{"id":"W4378603520","doi":"10.1007/978-3-031-34500-5","title":"Variable Neighborhood Search","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"HEC Montréal","funders":"","keywords":"Computer science; Variable (mathematics); Variable neighborhood search; Algorithm; Metaheuristic; Mathematics","score_opus":0.0202929384344353,"score_gpt":0.2562958123320804,"score_spread":0.23600287389764507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378603520","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.0000012844185,0.00011761206,0.98046887,0.00074031786,0.0036060952,0.00037167472,0.000013493477,0.00051473564,0.014165917],"genre_scores_gemma":[0.00074965775,0.00005407993,0.96775866,0.0019490251,0.00147251,0.000024164949,0.000064712585,0.00007170692,0.02785551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949425,0.000060707385,0.00043068695,0.0019287998,0.0015253929,0.0011119061],"domain_scores_gemma":[0.99675995,0.0005116611,0.00013540476,0.0022186486,0.00017965892,0.00019466404],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017825313,0.00047223974,0.00046990867,0.0012758553,0.00029722156,0.0016803395,0.008150632,0.00023556815,0.000026253336],"category_scores_gemma":[0.00010229428,0.00043836323,0.00009363855,0.0036200003,0.00040149837,0.0013831643,0.005584936,0.0009004392,0.00058362546],"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.0000017256482,0.000047426754,0.000031092433,0.000092061506,0.000020270225,0.00022438524,0.00033315225,0.021752413,0.000023959106,0.07559189,0.0031418456,0.89873976],"study_design_scores_gemma":[0.00019318424,0.000089905676,0.000063469015,0.0002076275,0.0000053390245,0.000012274373,1.1103155e-7,0.72714037,0.00011238572,0.266206,0.0054428643,0.00052646874],"about_ca_topic_score_codex":0.0000257261,"about_ca_topic_score_gemma":0.00001629643,"teacher_disagreement_score":0.8982133,"about_ca_system_score_codex":0.0003773475,"about_ca_system_score_gemma":0.0014126449,"threshold_uncertainty_score":0.9998068},"labels":[],"label_agreement":null},{"id":"W4379390584","doi":"10.1145/3555041.3589408","title":"An Overview of Reachability Indexes on Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reachability; Computer science; Transitive closure; Transitive reduction; Theoretical computer science; Vertex (graph theory); Graph; Search engine indexing; Modular decomposition; Pathwidth; Mathematics; Discrete mathematics; Information retrieval; Voltage graph; Line graph","score_opus":0.09244482801013996,"score_gpt":0.3401269591744718,"score_spread":0.2476821311643318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379390584","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.68957335,0.00030914138,0.17681436,0.0070273047,0.0022142825,0.0012233402,0.000070060654,0.004568982,0.11819917],"genre_scores_gemma":[0.98074687,0.00019550261,0.01615489,0.0006142639,0.000029693141,0.000011217038,0.000033003544,0.000006976951,0.0022075821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993722,0.000029960895,0.00010143316,0.0002130903,0.0001765994,0.000106728345],"domain_scores_gemma":[0.9991934,0.000031012685,0.00002553116,0.00070345413,0.000015391097,0.000031230422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003768486,0.000050041945,0.000074688294,0.000107093445,0.000024850278,0.000044098448,0.0007031627,0.000013578859,0.000026607931],"category_scores_gemma":[0.000010500638,0.000038941274,0.000030713974,0.0006513744,0.00002005314,0.0004589339,0.00020834955,0.000029598503,0.0000911603],"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":[9.718009e-7,0.00007421388,0.0022407572,0.000025072273,0.0000056630547,0.0000024326987,0.000072637624,0.000010449771,0.00006824075,0.77899206,0.004447437,0.21406007],"study_design_scores_gemma":[0.0006210099,0.0009011825,0.47167498,0.00007261268,0.000010543166,7.696628e-7,0.000120682984,0.12736289,0.0046769497,0.35771722,0.036313064,0.0005280894],"about_ca_topic_score_codex":0.00006803039,"about_ca_topic_score_gemma":0.000011276635,"teacher_disagreement_score":0.46943423,"about_ca_system_score_codex":0.0000034059674,"about_ca_system_score_gemma":0.000005382921,"threshold_uncertainty_score":0.1587979},"labels":[],"label_agreement":null},{"id":"W4379931434","doi":"10.1109/tits.2023.3280114","title":"A Novel Scalable Framework to Reconstruct Vehicular Trajectories From Unreliable GPS Datasets","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Data Management and Algorithms","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 Ottawa","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs","keywords":"Global Positioning System; Scalability; Computer science; Artificial intelligence; Telecommunications","score_opus":0.03441121252716296,"score_gpt":0.2679881560483463,"score_spread":0.23357694352118336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379931434","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.008939955,0.00004136972,0.9795169,0.00028168198,0.0061493665,0.0007162886,0.0034961228,0.0007893375,0.00006896872],"genre_scores_gemma":[0.9467042,0.00019015957,0.049122896,0.00032850425,0.00021347201,0.0005327203,0.0015289219,0.00006900283,0.0013101151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972173,0.000055856264,0.0007093605,0.00086136354,0.0006825473,0.00047356813],"domain_scores_gemma":[0.9982452,0.00028076905,0.000119623524,0.0010100441,0.00010459906,0.0002397962],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037310817,0.00032183225,0.0003526059,0.0005238397,0.0003127778,0.00046743656,0.00097503886,0.00014635686,0.00010649956],"category_scores_gemma":[0.000008567616,0.0003267412,0.00014951327,0.0021442042,0.000040650306,0.0009851957,0.0000024228975,0.0002827057,0.0013461107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013571353,0.00081560115,0.00026620014,0.00030284835,0.00078277424,0.00015193492,0.0060901134,0.8750463,0.0044333064,0.02505332,0.016873684,0.07004819],"study_design_scores_gemma":[0.0026408816,0.0010227661,0.0041462407,0.003196354,0.00055677333,0.000029556484,0.0065384484,0.5267636,0.16299306,0.0036535694,0.28405192,0.004406807],"about_ca_topic_score_codex":0.0014157575,"about_ca_topic_score_gemma":0.0002126244,"teacher_disagreement_score":0.9377642,"about_ca_system_score_codex":0.00007819141,"about_ca_system_score_gemma":0.000057579873,"threshold_uncertainty_score":0.99991846},"labels":[],"label_agreement":null},{"id":"W4379933229","doi":"10.48550/arxiv.2306.04005","title":"Edge Addition and the Change in Kemeny's Constant","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Constant (computer programming); Enhanced Data Rates for GSM Evolution; Random walk; Distance matrix; Discrete mathematics; Statistics; Computer science","score_opus":0.1375193075662365,"score_gpt":0.19693387827846523,"score_spread":0.05941457071222872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379933229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08156177,0.0005352794,0.86946356,0.007811982,0.0050601056,0.004114731,0.00049865164,0.0014112307,0.029542677],"genre_scores_gemma":[0.9964349,0.0011230698,0.00036495132,0.00023779318,0.00009268286,0.0000065834824,0.000071461116,0.000009617964,0.001658914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884623,0.00011200262,0.000115785355,0.0006468162,0.00006517366,0.00021398063],"domain_scores_gemma":[0.99898875,0.000113054535,0.00010983154,0.00071189104,0.000029150815,0.000047353005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043785688,0.00015931089,0.00018769733,0.00023895003,0.000090231886,0.00017280444,0.0011534616,0.000082321094,0.000019520494],"category_scores_gemma":[0.000017694545,0.0001406305,0.000057785717,0.0005013163,0.00017327398,0.00048622675,0.0034156735,0.00027907212,0.000074770745],"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.000019364456,0.000028530703,0.00087159936,0.00005146113,0.00004080138,0.00036822888,0.00037746338,0.000512859,4.0713357e-7,0.99055797,0.001737299,0.0054340344],"study_design_scores_gemma":[0.0017493305,0.00002337041,0.0067270105,0.00016371987,0.00004437948,0.0000015955669,0.0001490481,0.83005834,0.000003454185,0.15605702,0.004643164,0.00037955632],"about_ca_topic_score_codex":0.00040695735,"about_ca_topic_score_gemma":0.00019321719,"teacher_disagreement_score":0.9148732,"about_ca_system_score_codex":0.000057613957,"about_ca_system_score_gemma":0.000027949594,"threshold_uncertainty_score":0.5734745},"labels":[],"label_agreement":null},{"id":"W4380343454","doi":"10.1007/978-981-99-2295-6_8","title":"Geometry of Space: A New Look","year":2023,"lang":"en","type":"book-chapter","venue":"Behaviormetrics","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Contingency table; Row; Table (database); Space (punctuation); Geometry; Row and column spaces; Computer science; Graphical display; Mathematics; Computer graphics (images); Data mining; Statistics; Programming language","score_opus":0.05719337939217942,"score_gpt":0.2660201728423437,"score_spread":0.20882679345016428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380343454","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.00006311165,0.001462635,0.45957893,0.00037716024,0.0048755845,0.0009634145,0.00033588574,0.0011054781,0.5312378],"genre_scores_gemma":[0.000051242703,0.00065404555,0.024442885,0.00004215607,0.00018165597,0.0000034845698,0.00010323383,0.000060884493,0.9744604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768806,0.0000062196536,0.00043888087,0.00059663225,0.00094543345,0.0003247582],"domain_scores_gemma":[0.9978872,0.000102192076,0.00037098955,0.0013581576,0.00011266818,0.00016878975],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030660318,0.00032884825,0.00044739115,0.0025593461,0.000045966517,0.00017368751,0.002025825,0.00027361512,0.00014932585],"category_scores_gemma":[0.00006528339,0.00033852895,0.00022538018,0.0013980424,0.000050658306,0.00040081347,0.0015014312,0.00033630576,0.0010723791],"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.0000011698047,0.000034164004,0.00014187058,0.000055316308,0.000038767324,0.00013149266,0.000025033072,0.0000016661749,0.000003834594,0.4583926,0.08187526,0.45929885],"study_design_scores_gemma":[0.0006471232,0.0002954777,0.0019154313,0.0002226039,0.00030615978,0.000010875013,0.000009367634,0.0003445982,0.0001252045,0.017401252,0.97758603,0.0011358599],"about_ca_topic_score_codex":0.000054020496,"about_ca_topic_score_gemma":0.000004969553,"teacher_disagreement_score":0.89571077,"about_ca_system_score_codex":0.00006377086,"about_ca_system_score_gemma":0.0001534008,"threshold_uncertainty_score":0.99990666},"labels":[],"label_agreement":null},{"id":"W4380352252","doi":"10.1007/978-3-031-42935-4_2","title":"Diversifying Top-k Answers in a Query by Example Setting","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Tuple; Query optimization; Information retrieval; Diversification (marketing strategy); Set (abstract data type); Constraint (computer-aided design); Measure (data warehouse); Web query classification; Result set; Query plan; Query language; Theoretical computer science; Data mining; Web search query; Sargable; Search engine; Mathematics; Discrete mathematics; Programming language","score_opus":0.024240341476337985,"score_gpt":0.23897511389018275,"score_spread":0.21473477241384475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380352252","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.00007570717,0.00015819473,0.99338895,0.00088081294,0.0018127959,0.0003193659,0.000015650083,0.0002775247,0.003070982],"genre_scores_gemma":[0.039492283,0.00035319565,0.9447342,0.00621038,0.0011136488,0.000040061506,0.00015963278,0.00016994396,0.007726652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599737,0.00003391668,0.00045236564,0.0017344872,0.00094407244,0.00083777006],"domain_scores_gemma":[0.9979593,0.00045712164,0.00020396076,0.0011883511,0.00006457722,0.00012668564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013541549,0.00044630197,0.00041669214,0.0011775012,0.00023260186,0.000865938,0.0041248146,0.00019699833,0.000012807436],"category_scores_gemma":[0.00007127276,0.0004513511,0.000092293856,0.0011878214,0.00030878469,0.001346477,0.0035381687,0.00071702246,0.000094207295],"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.0000023752339,0.000021521011,0.00040247617,0.000059371647,0.000012051774,0.00032802473,0.001196327,0.005637301,0.0000627344,0.009879244,0.0008485601,0.98155004],"study_design_scores_gemma":[0.0007192243,0.00015343756,0.0004186794,0.0010011023,0.000011729638,0.00001992659,0.0000034609955,0.87756646,0.0004975727,0.10087143,0.017017614,0.0017193604],"about_ca_topic_score_codex":0.00028779768,"about_ca_topic_score_gemma":0.00017876782,"teacher_disagreement_score":0.9798307,"about_ca_system_score_codex":0.0002669901,"about_ca_system_score_gemma":0.00017942241,"threshold_uncertainty_score":0.9997938},"labels":[],"label_agreement":null},{"id":"W4382866761","doi":"10.1609/socs.v16i1.27299","title":"Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","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":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Artificial neural network; Constraint (computer-aided design); Graph; Overhead (engineering); Vehicle routing problem; Routing (electronic design automation); Inference; Artificial intelligence; Task (project management); Constraint programming; Route planning; Mathematical optimization; Machine learning; Theoretical computer science; Engineering; Computer network; Mathematics","score_opus":0.023424752202367352,"score_gpt":0.2782809439319044,"score_spread":0.25485619172953705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866761","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.9556564,0.000008324505,0.017749857,0.01340862,0.006483017,0.0016453504,0.00007888642,0.00042916197,0.0045404006],"genre_scores_gemma":[0.99859047,0.0000023799496,0.0007128004,0.000102008955,0.0003390587,0.000063599284,0.000059714366,0.00001888744,0.000111097856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977065,0.00001063015,0.00027667926,0.00043685312,0.0011858217,0.00038356183],"domain_scores_gemma":[0.99873793,0.00024385731,0.00015176319,0.00018091184,0.00060759473,0.00007795587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973107,0.00016905184,0.0001562303,0.00019778288,0.00024640773,0.00048767184,0.0021916397,0.00004565413,0.0000044331746],"category_scores_gemma":[0.000047025347,0.00012875824,0.00010932753,0.0005623553,0.0001314732,0.0005800552,0.00043161167,0.00028444186,0.0000051435413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001085423,0.0005549347,0.006191266,0.00025483096,0.000321313,0.000022590815,0.00039736842,0.055494927,0.011686872,0.9041523,0.008574914,0.011263289],"study_design_scores_gemma":[0.0023414348,0.00051963556,0.0029768988,0.00024280787,0.000014252375,0.000007368831,0.00008394174,0.9485594,0.034233704,0.010118,0.00063952105,0.00026305806],"about_ca_topic_score_codex":0.00002918415,"about_ca_topic_score_gemma":1.9951351e-7,"teacher_disagreement_score":0.89403427,"about_ca_system_score_codex":0.00008235452,"about_ca_system_score_gemma":0.000049075,"threshold_uncertainty_score":0.5250609},"labels":[],"label_agreement":null},{"id":"W4384521155","doi":"10.2139/ssrn.4504635","title":"A Fast Algorithm for Computing Product Moments of Multivariate Normal Random Variables","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Multivariate statistics; Algorithm; Computer science; Product (mathematics); Mathematics; Statistics","score_opus":0.011536197865815537,"score_gpt":0.2543669894587774,"score_spread":0.24283079159296186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384521155","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.0023013263,0.0001804063,0.9958699,0.00038636502,0.0006300353,0.00034388242,0.000010408655,0.00011340299,0.00016431512],"genre_scores_gemma":[0.47216144,0.0020834699,0.5076904,0.00021146971,0.0027790102,0.00007722026,0.00018171838,0.00012736603,0.014687865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693453,0.00007456356,0.00040618182,0.00033550567,0.00035254774,0.0018966559],"domain_scores_gemma":[0.99912614,0.00010532056,0.00027768416,0.00029963962,0.00012893941,0.000062277686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035447234,0.00016475459,0.0002595293,0.0002680324,0.0002757065,0.00017322604,0.0011097039,0.000029694576,0.0000025227682],"category_scores_gemma":[0.0000662837,0.0001439719,0.00012404441,0.00069917843,0.000026986147,0.0007574652,0.00036619112,0.00046466992,0.00001504779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027174023,0.00009509545,0.00007611262,0.00002360021,0.00030915605,0.000005544789,0.00026510426,0.0009326625,0.00039099253,0.077912286,0.0004622881,0.9195],"study_design_scores_gemma":[0.005025178,0.0003216176,0.00026748626,0.000047879028,0.00004228876,0.000073125,0.00027493032,0.92440546,0.0005987238,0.06569046,0.0029667104,0.00028617572],"about_ca_topic_score_codex":0.000031822456,"about_ca_topic_score_gemma":0.0000085893025,"teacher_disagreement_score":0.92347276,"about_ca_system_score_codex":0.00014061743,"about_ca_system_score_gemma":0.00047003845,"threshold_uncertainty_score":0.5871004},"labels":[],"label_agreement":null},{"id":"W4385317406","doi":"10.1007/978-3-031-38906-1_21","title":"General Space-Time Tradeoffs via Relational Queries","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Conjunctive query; Relational database; Theoretical computer science; Data structure; Relational algebra; Query language; Data mining; Programming language","score_opus":0.020505409110681057,"score_gpt":0.22861862985513853,"score_spread":0.20811322074445748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317406","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.000012444417,0.00009582119,0.9860406,0.0025543026,0.0024171053,0.00029067803,0.000017039494,0.0004351462,0.008136865],"genre_scores_gemma":[0.0013898287,0.000056545337,0.96476847,0.0013638223,0.0015493245,0.000015156482,0.00009415803,0.00007494067,0.030687774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960015,0.000029063309,0.0004586179,0.0015658317,0.0012650427,0.00067998125],"domain_scores_gemma":[0.99789673,0.0002964134,0.00022541072,0.001313867,0.00011357328,0.00015397566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007928284,0.00050700805,0.0004423724,0.00094769977,0.0003046835,0.00074563816,0.0033837508,0.00024228253,0.0000653201],"category_scores_gemma":[0.000048758327,0.00047918296,0.00014152029,0.0008738677,0.0005962642,0.0013782055,0.0021524695,0.00062130357,0.0007206974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040672508,0.00002585799,0.000036017096,0.00003255027,0.000032802767,0.00024046536,0.00038711086,0.018832363,0.00013982951,0.34094602,0.0009878164,0.6383351],"study_design_scores_gemma":[0.00017537503,0.000083350984,0.00027433343,0.00011657253,0.0000078630765,0.000027531547,4.283373e-8,0.7283059,0.00018465721,0.25906834,0.011119393,0.0006366805],"about_ca_topic_score_codex":0.000019595162,"about_ca_topic_score_gemma":0.000024940831,"teacher_disagreement_score":0.7094735,"about_ca_system_score_codex":0.00017407951,"about_ca_system_score_gemma":0.00027283945,"threshold_uncertainty_score":0.999766},"labels":[],"label_agreement":null},{"id":"W4385724181","doi":"10.1061/9780784485019.025","title":"But Why There? A Data-Driven Approach to Route Selection","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Stantec (Canada)","funders":"","keywords":"Computer science; Selection (genetic algorithm); Artificial intelligence","score_opus":0.06794077054296215,"score_gpt":0.27541543638705523,"score_spread":0.20747466584409308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385724181","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.0008412994,0.0000025518996,0.9520786,0.001520242,0.0002002864,0.00016683068,0.0000146271595,0.00076860713,0.04440695],"genre_scores_gemma":[0.07372558,0.000027537457,0.8380287,0.004483956,0.0004989356,0.00008577387,0.0008152647,0.00003295053,0.082301244],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989848,0.000022960709,0.00009237149,0.00046939502,0.0002088306,0.00022160621],"domain_scores_gemma":[0.9990309,0.000014104925,0.000018876653,0.00085762277,0.000019292858,0.0000591945],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002507353,0.00007867691,0.00007267367,0.00013003875,0.00008193086,0.00035795436,0.001896423,0.000017967715,0.000014926324],"category_scores_gemma":[0.000011269296,0.00006457922,0.000015900316,0.0011075262,0.0000064079554,0.001131338,0.0017778579,0.00003690135,0.0011451358],"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.0000018778229,0.00008426333,0.00021361765,0.000012495548,0.00004008329,0.00000656771,0.00016835995,0.00090614305,0.00007215492,0.083468504,0.7226232,0.19240269],"study_design_scores_gemma":[0.00008883765,0.000018144348,0.001449307,0.000001979043,0.0000031413713,0.0000012329301,0.000036618098,0.8273022,0.000041834068,0.0003984444,0.17055476,0.00010349756],"about_ca_topic_score_codex":0.00015748412,"about_ca_topic_score_gemma":0.000028640668,"teacher_disagreement_score":0.82639605,"about_ca_system_score_codex":0.000013013883,"about_ca_system_score_gemma":0.0000124632925,"threshold_uncertainty_score":0.9996326},"labels":[],"label_agreement":null},{"id":"W4386128170","doi":"10.14778/3611479.3611493","title":"Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study","year":2023,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Chase; Set (abstract data type); Class (philosophy); Focus (optics); Existential quantification; Existentialism; Theoretical computer science; Implementation; Key (lock); Algorithm; Programming language; Database; Artificial intelligence; Mathematics; Computer security","score_opus":0.0371439558842468,"score_gpt":0.3083710072932785,"score_spread":0.2712270514090317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386128170","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.9928727,0.00002210111,0.001990473,0.0005053973,0.0007868177,0.002162327,0.000028143277,0.000319892,0.0013121088],"genre_scores_gemma":[0.99344987,0.000004879849,0.0049221893,0.00005868208,0.00016537945,0.00033071262,0.000015154686,0.000014271151,0.00103888],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998673,0.0000070300407,0.00024572446,0.0003870617,0.0004330339,0.00025412237],"domain_scores_gemma":[0.99942654,0.00001614866,0.00016616582,0.00024140716,0.00009626859,0.00005346214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049890816,0.00014072358,0.00014129512,0.0001488755,0.00018802407,0.00019068157,0.0013271574,0.00002276348,0.000004552625],"category_scores_gemma":[0.000027498561,0.00010571983,0.00008245828,0.00036827906,0.000032150863,0.0008786215,0.0008622242,0.000051454503,0.00001582575],"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.0004182665,0.025071308,0.00739454,0.0011857076,0.0008322506,0.000032620635,0.08050522,0.00016973027,0.38959378,0.1839927,0.0676931,0.24311078],"study_design_scores_gemma":[0.009569158,0.006787746,0.007942491,0.00022141643,0.0001942136,0.000016657661,0.02194554,0.2898438,0.64228183,0.0076946607,0.012223901,0.0012786065],"about_ca_topic_score_codex":0.00001604763,"about_ca_topic_score_gemma":9.053474e-7,"teacher_disagreement_score":0.28967407,"about_ca_system_score_codex":0.000043285203,"about_ca_system_score_gemma":0.000010694377,"threshold_uncertainty_score":0.43111295},"labels":[],"label_agreement":null},{"id":"W4386204732","doi":"10.1145/3603719.3603732","title":"Indexing Temporal Relations for Range-Duration Queries","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Search engine indexing; Computer science; Duration (music); Range (aeronautics); Range query (database); Information retrieval; Search engine; Web search query; Query by Example","score_opus":0.03437978022151286,"score_gpt":0.27408667090911526,"score_spread":0.2397068906876024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386204732","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.0005111617,0.0000039564607,0.9874104,0.0039409036,0.00025477272,0.0001598848,0.0000037056054,0.00049018965,0.007225022],"genre_scores_gemma":[0.31198782,0.0000129543305,0.55763453,0.0006592613,0.00031253052,0.00020390212,0.00046777356,0.00001814205,0.1287031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995507,0.000007678855,0.00009809998,0.00013683001,0.00008697169,0.000119722616],"domain_scores_gemma":[0.9997104,0.00004430972,0.000026076586,0.0001775607,0.000022820826,0.000018880162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023654236,0.000039975057,0.000039248553,0.00009446677,0.000135974,0.00018226974,0.00023082127,0.000014978627,0.000017515958],"category_scores_gemma":[0.00003446543,0.000035461737,0.000021921262,0.00038864432,0.000008775575,0.0011175575,0.000121411045,0.000020501971,0.00017325803],"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.000001454852,0.000008812123,0.0026459275,0.00000903293,0.000009418899,0.0000018820914,0.00028550858,0.00007001285,0.000027124606,0.82995933,0.12139178,0.045589734],"study_design_scores_gemma":[0.00030121845,0.00003240423,0.006684778,0.0000064433484,0.000003674582,4.1723396e-7,0.00012938933,0.74268115,0.0001427733,0.029437888,0.22044007,0.00013978904],"about_ca_topic_score_codex":0.000015163697,"about_ca_topic_score_gemma":0.000035071072,"teacher_disagreement_score":0.80052143,"about_ca_system_score_codex":0.000008200847,"about_ca_system_score_gemma":0.00001247767,"threshold_uncertainty_score":0.22269392},"labels":[],"label_agreement":null},{"id":"W4386282413","doi":"10.1109/tvcg.2023.3309941","title":"A Grid-Based Method for Removing Overlaps of Dimensionality Reduction Scatterplot Layouts","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"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; Government of Canada","keywords":"Dimensionality reduction; Computer science; Reduction (mathematics); Grid; Visualization; Curse of dimensionality; Data visualization; Computational science; Artificial intelligence; Algorithm; Data mining; Computer graphics (images); Mathematics","score_opus":0.032083599165866415,"score_gpt":0.318647892528477,"score_spread":0.2865642933626106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386282413","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.0026140625,0.000006576452,0.9952999,0.0002461131,0.001162742,0.00029666917,0.000045085948,0.00032141717,0.0000074758136],"genre_scores_gemma":[0.7403026,0.00019692443,0.2560403,0.0022567627,0.00032939838,0.00016696728,0.000312522,0.000076206255,0.00031831147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987342,0.000109006476,0.00029231663,0.00041285038,0.00027769202,0.00017396816],"domain_scores_gemma":[0.99919516,0.00015719447,0.00011703194,0.00032829418,0.00014023867,0.00006208706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051461434,0.00014427575,0.0001744584,0.00052207446,0.0002637714,0.00011105265,0.00023949197,0.000061712075,0.000002782489],"category_scores_gemma":[0.000003113638,0.00014657353,0.00010508884,0.0012215045,0.00004479738,0.00039752168,0.0000085750335,0.00007218483,0.0000029650344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008858187,0.00064269063,0.00006901575,0.00043194738,0.00017845529,0.000003909742,0.0007824912,0.021859495,0.0006859626,0.8741,0.005965584,0.09519184],"study_design_scores_gemma":[0.0005565716,0.0001659381,0.00052457605,0.00005390243,0.000025807863,0.0000028372879,0.000016340042,0.991906,0.004217546,0.0014243283,0.0009477703,0.00015837527],"about_ca_topic_score_codex":0.000020973439,"about_ca_topic_score_gemma":0.000004289016,"teacher_disagreement_score":0.9700465,"about_ca_system_score_codex":0.000012877145,"about_ca_system_score_gemma":0.000028397726,"threshold_uncertainty_score":0.5977095},"labels":[],"label_agreement":null},{"id":"W4387074962","doi":"10.48550/arxiv.2309.13287","title":"Approximating Queries on Probabilistic Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Computer science; Combinatorics; Chordal graph; Conjunctive query; Mathematics; Theoretical computer science; Discrete mathematics; Graph; Artificial intelligence; Information retrieval","score_opus":0.1214280963833,"score_gpt":0.19408442997314262,"score_spread":0.07265633358984262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387074962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041324016,0.00001740712,0.9457985,0.00033958428,0.0017784175,0.0007185803,0.000048986505,0.0017275362,0.008246962],"genre_scores_gemma":[0.98050874,0.00010218205,0.009909508,0.00012971059,0.000092320195,0.0000054923094,0.000097804885,0.000036418853,0.009117825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801606,0.0000870391,0.00019667594,0.0012156866,0.00012754936,0.00035699623],"domain_scores_gemma":[0.9980015,0.000118625365,0.00021697665,0.0015001353,0.000065612934,0.00009714756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003410671,0.00029557644,0.00027144607,0.00036402047,0.00018517279,0.00033000333,0.0023997356,0.00013034484,0.000010029627],"category_scores_gemma":[0.000078587684,0.00032495562,0.00015688277,0.0008024948,0.00010143101,0.00047500915,0.0037733468,0.0004276185,0.0003331612],"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.000005747224,0.00005682459,0.00025025144,0.00016404582,0.000058944966,0.00024809342,0.00011224573,0.04925618,0.0000010838726,0.9466041,0.00095077464,0.002291717],"study_design_scores_gemma":[0.00017389953,0.000047605787,0.00049470505,0.00014183042,0.000032584747,5.889932e-7,0.00006235252,0.5830557,0.0000110101855,0.41492337,0.0006601265,0.0003962447],"about_ca_topic_score_codex":0.00008493469,"about_ca_topic_score_gemma":0.000024192732,"teacher_disagreement_score":0.9391847,"about_ca_system_score_codex":0.000092130045,"about_ca_system_score_gemma":0.00006143991,"threshold_uncertainty_score":0.99992025},"labels":[],"label_agreement":null},{"id":"W4387378868","doi":"10.1007/s11222-023-10300-9","title":"Optimization via Rejection-Free Partial Neighbor Search","year":2023,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Data Management and Algorithms","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":"Knapsack problem; Simulated annealing; Mathematics; Mathematical optimization; Local search (optimization); Combinatorial optimization; Computer science; Quadratic unconstrained binary optimization; Algorithm","score_opus":0.018477776299225347,"score_gpt":0.26422557706139665,"score_spread":0.24574780076217131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387378868","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.00049374934,0.0000127174935,0.9980312,0.00029141028,0.00040499395,0.00007014984,0.000019733978,0.00019449771,0.00048152174],"genre_scores_gemma":[0.13813196,0.000051231113,0.8608649,0.00014141304,0.00026519614,0.0000027061583,0.00010844078,0.000012873656,0.00042130242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991926,0.000029789415,0.00013411294,0.00024450195,0.00018486082,0.00021412845],"domain_scores_gemma":[0.9995081,0.00009984765,0.00003661983,0.0002578871,0.000046976314,0.00005058302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028775723,0.00007055058,0.000072787916,0.00009049526,0.00024982743,0.00031780812,0.0003330789,0.000016902843,0.0000073904516],"category_scores_gemma":[0.000038083683,0.000071554,0.000009911355,0.0004315886,0.000023376611,0.00018011327,0.00069431553,0.00006412638,0.000026975415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002896212,0.000023835286,0.0004871856,0.000055743218,0.000025963382,0.000051649735,0.00047281134,0.08025315,0.000020014004,0.3094704,0.014304473,0.5948319],"study_design_scores_gemma":[0.0001680975,0.000033070864,0.001163811,0.00000862444,0.00000332697,0.000002127937,0.000022818143,0.99279416,0.000016382737,0.005104128,0.0005936957,0.00008978908],"about_ca_topic_score_codex":0.00003533321,"about_ca_topic_score_gemma":0.0000021279814,"teacher_disagreement_score":0.912541,"about_ca_system_score_codex":0.0000081437665,"about_ca_system_score_gemma":0.000013436584,"threshold_uncertainty_score":0.3064631},"labels":[],"label_agreement":null},{"id":"W4387398448","doi":"10.1145/3624575","title":"Authenticated Range Querying of Historical Blockchain Healthcare Data Using Authenticated Multi-Version Index","year":2023,"lang":"en","type":"article","venue":"Distributed Ledger Technologies Research and Practice","topic":"Data Management and Algorithms","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; University of New Brunswick","funders":"","keywords":"Computer science; Blockchain; Scalability; Node (physics); Index (typography); Computer security; Data mining; Database; World Wide Web","score_opus":0.31173369032416065,"score_gpt":0.43695296066040984,"score_spread":0.1252192703362492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387398448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061144315,0.0046511656,0.81048614,0.11351876,0.0008415808,0.002055262,0.0016470652,0.0054546283,0.00020110562],"genre_scores_gemma":[0.978983,0.00084213796,0.019051954,0.000023654486,0.000022857168,0.000024829285,0.0007491473,0.000020164936,0.000282277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678934,0.00044551436,0.0003850391,0.00082872005,0.0007944596,0.00075691065],"domain_scores_gemma":[0.9958984,0.0013104373,0.00019629503,0.0019254814,0.00056025374,0.00010913189],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0037550274,0.00017590016,0.0002761514,0.000827103,0.00047894643,0.0002539616,0.0029219394,0.0002160679,0.0000045297975],"category_scores_gemma":[0.0083759315,0.00016508043,0.000031244683,0.0045840098,0.0003352362,0.001117051,0.0063504092,0.00074455974,0.000042269636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014764387,0.004489904,0.024606807,0.0024934623,0.0013303315,0.002563561,0.0038267763,0.00012227306,0.017770035,0.060281668,0.19726317,0.6837756],"study_design_scores_gemma":[0.0015194935,0.000295174,0.0017600076,0.00016718285,0.00004965846,0.00004292221,0.006848062,0.8908573,0.0012501377,0.0033815312,0.09334929,0.00047927795],"about_ca_topic_score_codex":0.0007195396,"about_ca_topic_score_gemma":0.000014839901,"teacher_disagreement_score":0.9178387,"about_ca_system_score_codex":0.0002475173,"about_ca_system_score_gemma":0.00012416644,"threshold_uncertainty_score":0.99997693},"labels":[],"label_agreement":null},{"id":"W4387928372","doi":"10.48550/arxiv.2310.13098","title":"SRAI: Towards Standardization of Geospatial AI","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Geospatial analysis; Python (programming language); Computer science; Standardization; Geospatial PDF; Embedding; Data science; Database; Software engineering; Artificial intelligence; Geography; Programming language; Cartography; Operating system","score_opus":0.0898239813681688,"score_gpt":0.20472702499769493,"score_spread":0.11490304362952614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387928372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059156083,0.000010672246,0.990474,0.00023033227,0.0010824368,0.00020926083,0.00012767462,0.0003026176,0.0016474064],"genre_scores_gemma":[0.9912867,0.0001730659,0.0043945755,0.000065428976,0.00009967496,6.700798e-7,0.00015892107,0.000017744987,0.003803224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986101,0.00006567075,0.00018962329,0.0007495798,0.00016023216,0.00022482454],"domain_scores_gemma":[0.998415,0.0000258856,0.00022053026,0.0010863803,0.00018061112,0.00007160073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028223594,0.00019470794,0.00026223253,0.00030868157,0.000071079034,0.00012578872,0.001885248,0.00013609379,0.000027215314],"category_scores_gemma":[0.000030370427,0.00022764604,0.00014259515,0.0006950955,0.00006227267,0.00055638846,0.0037396366,0.0002427105,0.0000692535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032488788,0.00013093525,0.0017833757,0.00033537706,0.00029699298,0.000374714,0.0003895423,0.4638551,0.000015419546,0.50519174,0.009110744,0.018483546],"study_design_scores_gemma":[0.00048851373,0.0000652563,0.0028024374,0.00010311066,0.00007745281,4.192215e-7,0.000041323732,0.9234521,0.00023017643,0.0679886,0.0043351077,0.00041552522],"about_ca_topic_score_codex":0.00030155468,"about_ca_topic_score_gemma":0.000055012624,"teacher_disagreement_score":0.9860794,"about_ca_system_score_codex":0.00008689571,"about_ca_system_score_gemma":0.0001609317,"threshold_uncertainty_score":0.9283136},"labels":[],"label_agreement":null},{"id":"W4388190725","doi":"10.18280/mmep.100542","title":"Employing the Bellman-Ford Algorithm with Score Functions to Address the Linear Diophantine Fuzzy Shortest Path Problem in Network Analysis","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Data Management and Algorithms","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":"","keywords":"Shortest path problem; Diophantine equation; Path (computing); K shortest path routing; Algorithm; Mathematical optimization; Mathematics; Computer science; Fuzzy logic; Discrete mathematics; Artificial intelligence; Graph","score_opus":0.028542255779392418,"score_gpt":0.22211575283799054,"score_spread":0.1935734970585981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388190725","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.0051315012,0.00009198778,0.9929852,0.00071679504,0.0000613533,0.0004991383,0.0000059501,0.00033881786,0.00016925196],"genre_scores_gemma":[0.31327918,0.0001737892,0.6841925,0.00014444767,0.0003190397,0.00066622335,0.000063237625,0.000082678365,0.0010789395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983706,0.00002304659,0.00033897418,0.00041385763,0.00032199704,0.0005315509],"domain_scores_gemma":[0.99904734,0.00021078136,0.00004622413,0.00056118675,0.000036734265,0.00009770532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941846,0.0002244442,0.00028337236,0.00022039033,0.00026510633,0.0003341784,0.00062226725,0.0000412211,0.000002381381],"category_scores_gemma":[0.000013321417,0.00012548084,0.00006376357,0.0030711186,0.00003160401,0.00024689865,0.00038176365,0.00025730024,0.000028712957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011971489,0.000022751326,0.00010582422,0.00006256174,0.0001012342,0.0000072904827,0.00058223744,0.98905784,0.0000025193458,0.006058143,0.0000945716,0.003903808],"study_design_scores_gemma":[0.00010779201,0.000045501092,0.00014701586,0.00022778448,0.000085960855,0.000005028446,0.00004035951,0.9955022,0.0000016696966,0.0030391677,0.000602816,0.00019471906],"about_ca_topic_score_codex":0.000027323606,"about_ca_topic_score_gemma":0.000008400418,"teacher_disagreement_score":0.30879274,"about_ca_system_score_codex":0.00001319283,"about_ca_system_score_gemma":0.000009235307,"threshold_uncertainty_score":0.51169604},"labels":[],"label_agreement":null},{"id":"W4388860803","doi":"10.1145/3615885.3628008","title":"A Data Augmentation Algorithm for Trajectory Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Canada First Research Excellence Fund; Ocean Frontier Institute; Dalhousie University","keywords":"Trajectory; Computer science; Data mining; Perturbation (astronomy); Raw data; Machine learning; Field (mathematics); Data point; Artificial intelligence; Mathematics","score_opus":0.17815192730234253,"score_gpt":0.3579250594167012,"score_spread":0.1797731321143587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388860803","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.000015180056,0.000015783098,0.99531657,0.0010252999,0.0005890381,0.00026500865,0.0011535493,0.00051807053,0.0011015324],"genre_scores_gemma":[0.00013597865,0.000046864836,0.972515,0.00048233147,0.00023665438,0.000028661414,0.01888878,0.000011164097,0.0076545775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.000015250151,0.00013356727,0.00062726316,0.00020015764,0.00020987036],"domain_scores_gemma":[0.99696094,0.00007808544,0.000034036726,0.0028693872,0.00001755464,0.000039989438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006739915,0.000076084456,0.00007227101,0.000105590094,0.00009070934,0.00028290015,0.005064747,0.000016494025,0.000023972449],"category_scores_gemma":[0.000025974643,0.00006852287,0.000012431738,0.00046163032,0.000012986742,0.0031544706,0.0036961297,0.000029802977,0.0002753649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.1175918e-7,0.000011912341,0.0000031349837,0.000005294243,0.000012077905,0.0000027102321,0.000015230185,0.0000018119848,0.000010625457,0.0025091625,0.34040716,0.65702057],"study_design_scores_gemma":[0.0002496231,0.000015393518,0.0001888776,0.0000023795092,0.0000065523936,4.903304e-7,0.00004168267,0.7872596,0.000027488924,0.00064202,0.2114822,0.00008372679],"about_ca_topic_score_codex":0.000022478669,"about_ca_topic_score_gemma":0.000021572941,"teacher_disagreement_score":0.78725773,"about_ca_system_score_codex":0.000007915048,"about_ca_system_score_gemma":0.000025966265,"threshold_uncertainty_score":0.94116443},"labels":[],"label_agreement":null},{"id":"W4389519537","doi":"10.18653/v1/2023.emnlp-industry.71","title":"An Integrated Search System for Korea Weather Data","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"National Institute of Meteorological Sciences","keywords":"Computer science; Weather forecasting; Simple (philosophy); Data science; Data mining; Meteorology; Geography","score_opus":0.09566007743853336,"score_gpt":0.3289321525492549,"score_spread":0.23327207511072154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389519537","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.00043971383,0.0000052783726,0.9931432,0.00054118974,0.00029867716,0.00023777121,0.00010976587,0.0009960775,0.0042283507],"genre_scores_gemma":[0.2748876,0.00003953355,0.6435955,0.00062364637,0.0006821822,0.000150364,0.008299912,0.00007781353,0.07164346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908453,0.000027441818,0.000096022806,0.00040640513,0.00016310284,0.00022252451],"domain_scores_gemma":[0.9983017,0.000036775364,0.000013061589,0.0015561335,0.00003886185,0.00005348026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007003925,0.000067632034,0.000073966396,0.00010669553,0.000074390686,0.00026833685,0.0028857498,0.000018639648,0.000014436531],"category_scores_gemma":[0.000008692585,0.000049506787,0.000014284114,0.00058199983,0.000011439242,0.0011937815,0.00088169123,0.000034947363,0.00035354003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050717786,0.000054941305,0.00016699328,0.000087973305,0.000044868237,0.000026883768,0.00018274387,0.000052482887,0.00016161393,0.2388276,0.2481299,0.51225895],"study_design_scores_gemma":[0.00014524191,0.00003678766,0.00013440072,0.000009149316,0.0000027202382,7.982923e-7,0.00034837902,0.9236137,0.00018761976,0.00010704709,0.07533461,0.00007951141],"about_ca_topic_score_codex":0.00010198953,"about_ca_topic_score_gemma":0.000017656523,"teacher_disagreement_score":0.9235613,"about_ca_system_score_codex":0.00001237236,"about_ca_system_score_gemma":0.0000209259,"threshold_uncertainty_score":0.5362489},"labels":[],"label_agreement":null},{"id":"W4389763747","doi":"10.5194/isprs-archives-xlviii-1-w2-2023-861-2023","title":"AN APPROACH OF HIGH DEFINITION MAP INFORMATION INTERACTION","year":2023,"lang":"en","type":"article","venue":"˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences","topic":"Data Management and Algorithms","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; Focus (optics); Interaction information; Realization (probability); Information system; Cloud computing; Interaction design; Human–computer interaction; Real-time computing; Engineering","score_opus":0.025963783411451623,"score_gpt":0.2612936949151712,"score_spread":0.23532991150371957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389763747","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.007133832,0.0000092940345,0.9796408,0.0030697626,0.0023345535,0.00061390246,0.0001347513,0.00010210884,0.006960989],"genre_scores_gemma":[0.9845479,0.00012918365,0.014181451,0.0007672892,0.00011375642,6.8529926e-7,0.00020686386,0.000008404158,0.00004448079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518377,0.00031104212,0.0015747052,0.00039468618,0.0020487956,0.00048702437],"domain_scores_gemma":[0.9960812,0.0006943816,0.0020208687,0.00069852755,0.00036649627,0.00013856187],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018431635,0.00038423282,0.0004031399,0.001588202,0.0010910331,0.0012468484,0.0027517271,0.000089041474,0.0000048428383],"category_scores_gemma":[0.0004469187,0.00025499362,0.00030320822,0.0016727821,0.0018235386,0.0025021394,0.0014189666,0.00037963476,0.0000091064685],"study_design_candidate":"design_other","study_design_consensus":null,"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.00008500168,0.000026288028,0.00009750887,0.00006603591,0.000071135575,1.8950047e-7,0.0033653325,0.0056838607,0.0007297495,0.00014501742,0.000094938245,0.98963493],"study_design_scores_gemma":[0.00066560385,0.00016001026,0.003851148,0.00022842408,0.000032463224,0.000058181762,0.0024403888,0.9714661,0.0039123665,0.013860509,0.003044644,0.0002801589],"about_ca_topic_score_codex":0.6375093,"about_ca_topic_score_gemma":0.033775844,"teacher_disagreement_score":0.9893548,"about_ca_system_score_codex":0.000042638858,"about_ca_system_score_gemma":0.00017604035,"threshold_uncertainty_score":0.9999902},"labels":[],"label_agreement":null},{"id":"W4390100413","doi":"10.1145/3589132.3625622","title":"PathletRL: Trajectory Pathlet Dictionary Construction using Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"York University","funders":"","keywords":"Computer science; Merge (version control); Trajectory; Reinforcement learning; Dictionary learning; Range (aeronautics); Artificial intelligence; Set (abstract data type); Speedup; Parallel computing","score_opus":0.02792953563845239,"score_gpt":0.24590444093413888,"score_spread":0.2179749052956865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390100413","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.013780684,0.000012963747,0.9721866,0.00017253359,0.0010250234,0.00013723667,9.9824e-7,0.0011538739,0.011530057],"genre_scores_gemma":[0.8031004,0.00017921254,0.18169442,0.0009663642,0.0006431525,0.000047440026,0.00020708339,0.00004411265,0.0131178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989709,0.000035898076,0.00017757839,0.00028745472,0.00028444204,0.00024368479],"domain_scores_gemma":[0.9995701,0.000027863356,0.000059180788,0.0002690908,0.000027923339,0.00004589073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027718002,0.000099892895,0.000084538486,0.00023161771,0.0002365622,0.0001551463,0.00033267212,0.000029350522,0.0000691359],"category_scores_gemma":[0.0000142131385,0.00009534498,0.000045509787,0.00071201357,0.000031036612,0.0009212389,0.00034532507,0.00010566981,0.00024232533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009073405,0.000059455037,0.006845975,0.00007446355,0.00012062443,0.00019866913,0.0008704048,0.11643278,0.0035573277,0.19947614,0.014753987,0.6576011],"study_design_scores_gemma":[0.0002032189,0.000045906185,0.0015038989,0.000013098219,0.0000052675655,0.000010528021,0.0002253875,0.9687129,0.00021745556,0.0005922988,0.028304575,0.00016546565],"about_ca_topic_score_codex":0.00002805962,"about_ca_topic_score_gemma":7.420572e-7,"teacher_disagreement_score":0.85228014,"about_ca_system_score_codex":0.000041146555,"about_ca_system_score_gemma":0.000023172784,"threshold_uncertainty_score":0.38880554},"labels":[],"label_agreement":null},{"id":"W4390120254","doi":"10.1109/tkde.2023.3344662","title":"ODIN: Object Density Aware Index for C$k$k NN Queries Over Moving Objects on Road Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University; York University","funders":"National Natural Science Foundation of China","keywords":"Notation; Object (grammar); Computer science; Index (typography); Identification (biology); Theoretical computer science; Algorithm; Data mining; Artificial intelligence; Information retrieval; Mathematics; Programming language; Arithmetic","score_opus":0.026107012340016018,"score_gpt":0.2666511080454351,"score_spread":0.2405440957054191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390120254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029010612,0.00009834963,0.9944217,0.00004184894,0.0014931187,0.00023738174,0.00013956531,0.00056551065,0.00010147314],"genre_scores_gemma":[0.99633527,0.00023096625,0.0025305126,0.000052149484,0.0002049049,0.000051698862,0.00012238449,0.000029422008,0.00044268474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987468,0.000015688585,0.00017069714,0.00057757995,0.00013305631,0.0003561466],"domain_scores_gemma":[0.99875283,0.0001845537,0.000028132768,0.0009105349,0.000030749186,0.00009318731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028098084,0.00021396953,0.00018549208,0.00029139846,0.00026920284,0.00025584883,0.00069635955,0.00007261045,0.000004249906],"category_scores_gemma":[0.000011992978,0.00021625769,0.000050869912,0.0005918192,0.000017697224,0.0011186873,0.00005427465,0.0002044318,0.000029488174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008113032,0.0002600525,0.00009420323,0.00045268124,0.0003029473,0.00005349104,0.0009160552,0.31688714,0.00026962959,0.0017860137,0.012816125,0.66608053],"study_design_scores_gemma":[0.00036034812,0.00008137461,0.0013021075,0.00008757894,0.000019269877,0.000002481183,0.000025875283,0.9924268,0.0004512751,0.000022713028,0.004962809,0.0002573366],"about_ca_topic_score_codex":0.000023728055,"about_ca_topic_score_gemma":0.00007076229,"teacher_disagreement_score":0.9934342,"about_ca_system_score_codex":0.00003155604,"about_ca_system_score_gemma":0.00002306852,"threshold_uncertainty_score":0.88187325},"labels":[],"label_agreement":null},{"id":"W4390480779","doi":"10.1109/tkde.2023.3346377","title":"A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University; University of Toronto; York University","funders":"National Natural Science Foundation of China","keywords":"Shortest path problem; Graph; Computer science; Centrality; Computation; Notation; Algorithm; Scalability; Theoretical computer science; Combinatorics; Mathematics; Database","score_opus":0.016598783254482878,"score_gpt":0.26794138589068084,"score_spread":0.25134260263619795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390480779","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.00044462868,0.00086049014,0.9958399,0.00006145356,0.0016050139,0.00023579634,0.00055067625,0.00039038374,0.000011690789],"genre_scores_gemma":[0.98630214,0.000089566645,0.01276172,0.000008562737,0.0000715831,0.00004056896,0.0006566238,0.000016974944,0.000052244704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990764,0.000009050448,0.00015940463,0.0004574551,0.00008480495,0.00021285178],"domain_scores_gemma":[0.99939156,0.00012113163,0.000013696633,0.00039071555,0.000022340033,0.000060557995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019724676,0.00014231431,0.00010508949,0.00015708109,0.00012303295,0.0003181822,0.00035322932,0.000044434277,0.0000018559504],"category_scores_gemma":[0.0000035060002,0.00014134488,0.000037912487,0.00037657702,0.000011824766,0.00061682676,0.000020578998,0.00012458386,0.0000096450185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000437103,0.00009084258,5.099738e-7,0.00010322655,0.000055205925,0.000006975913,0.00007012914,0.43976057,0.00012242542,0.00057974533,0.00088191195,0.5583241],"study_design_scores_gemma":[0.00017941701,0.000046388686,0.00012099933,0.000094829666,0.000036780228,0.000006125729,0.0000031780128,0.99545056,0.000028288645,0.000012354037,0.003858145,0.00016290997],"about_ca_topic_score_codex":0.000005568426,"about_ca_topic_score_gemma":0.000009564855,"teacher_disagreement_score":0.98585755,"about_ca_system_score_codex":0.000047516834,"about_ca_system_score_gemma":0.00001751166,"threshold_uncertainty_score":0.57638764},"labels":[],"label_agreement":null},{"id":"W4390599221","doi":"10.1111/tgis.13126","title":"<scp>QuadGridSIM</scp>: A quadrilateral grid‐based method for high‐performance and robust trajectory similarity analysis","year":2024,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Data Management and Algorithms","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":"National Natural Science Foundation of China","keywords":"Trajectory; Robustness (evolution); Computer science; Quadrilateral; Similarity (geometry); Similarity measure; Grid; Data mining; Cluster analysis; Algorithm; Mathematics; Artificial intelligence; Engineering","score_opus":0.023582689494635357,"score_gpt":0.27273237979237264,"score_spread":0.2491496902977373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390599221","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.012013596,0.00015141806,0.9858906,0.000510404,0.00059282733,0.00026616108,0.0001190336,0.00024873944,0.00020722223],"genre_scores_gemma":[0.4396557,0.000115940915,0.5581534,0.0002080703,0.00010268939,0.00016745058,0.000068174355,0.000021064221,0.0015075642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857026,0.00006896015,0.00027904994,0.0005748655,0.00019167314,0.00031519707],"domain_scores_gemma":[0.9990794,0.00036369174,0.00003300201,0.00042401746,0.00003031116,0.000069573514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064714154,0.00018412675,0.00026246416,0.0007485792,0.00015473919,0.00036570508,0.000430876,0.00007298887,0.000031266776],"category_scores_gemma":[0.000009510435,0.00017498758,0.00014006808,0.0018085423,0.000041833304,0.0010942956,0.00001927541,0.00021367763,0.00000692255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024150098,0.0004939895,0.0018110111,0.0010738103,0.0015191938,0.00006302493,0.002342599,0.42753202,0.00029588555,0.00536081,0.0042113108,0.5552722],"study_design_scores_gemma":[0.0003319889,0.000065590444,0.0072854627,0.000029155386,0.00027436815,0.0000018027138,0.000024984603,0.9808591,0.0007140925,0.00019592149,0.010109058,0.000108500964],"about_ca_topic_score_codex":0.00019625692,"about_ca_topic_score_gemma":0.00030339602,"teacher_disagreement_score":0.5551637,"about_ca_system_score_codex":0.000053555166,"about_ca_system_score_gemma":0.000044782184,"threshold_uncertainty_score":0.71357864},"labels":[],"label_agreement":null},{"id":"W4391093905","doi":"10.1109/bigdata59044.2023.10386216","title":"Knowledge Graphs in Spatial-Temporal Cluster Evolution Analysis","year":2023,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Cluster (spacecraft); Knowledge graph; Data mining; Theoretical computer science; Data science; Artificial intelligence","score_opus":0.01909388420110801,"score_gpt":0.2670023461446523,"score_spread":0.24790846194354427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391093905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011410709,0.00003219188,0.97672987,0.0007229483,0.00030483416,0.00011298719,0.00000233198,0.00036731648,0.010316835],"genre_scores_gemma":[0.98864335,0.000009881659,0.0050939303,0.00006794444,0.000026583943,0.0000113187925,0.000058001526,0.0000033928266,0.006085627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991417,0.000046156925,0.00015904418,0.00030017702,0.00014284352,0.00021010614],"domain_scores_gemma":[0.9994804,0.00002594814,0.000027679347,0.00040843853,0.000021125019,0.000036391833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040598362,0.00007516415,0.00011323313,0.0010307278,0.000040952335,0.00012467145,0.0005634418,0.000024693818,0.00004011106],"category_scores_gemma":[0.000008944829,0.00006599899,0.000075021024,0.0052295825,0.000013823981,0.000597021,0.0004864164,0.000046153524,0.00065763685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069405687,0.00027225295,0.30793735,0.000044704095,0.00027755077,0.00006353107,0.0009546764,0.0016092766,0.000028493605,0.43688616,0.07341772,0.17850134],"study_design_scores_gemma":[0.00017734703,0.0000118109365,0.17587563,0.0000024811247,0.00001700555,1.0521336e-7,0.000023425806,0.81574285,0.000009413081,0.0058887913,0.0021508003,0.00010034562],"about_ca_topic_score_codex":0.0009399228,"about_ca_topic_score_gemma":0.0044263755,"teacher_disagreement_score":0.97723264,"about_ca_system_score_codex":0.000025848702,"about_ca_system_score_gemma":0.000012704849,"threshold_uncertainty_score":0.84528106},"labels":[],"label_agreement":null},{"id":"W4391419540","doi":"","title":"DynaClose : Une approche de fouille de données pour la sélection des index de jointure binaires dans les entrepôts de données","year":2007,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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 Outaouais","funders":"","keywords":"Humanities; Art","score_opus":0.02375445345232931,"score_gpt":0.23755264733906403,"score_spread":0.2137981938867347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391419540","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.15096694,0.0020727725,0.7976277,0.017844925,0.00022535695,0.00029439357,0.000023565033,0.0003395478,0.030604802],"genre_scores_gemma":[0.6758707,0.0023138148,0.284539,0.00025815525,0.00013100849,0.000039810497,0.00009657641,0.00006372499,0.03668719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923125,0.004358263,0.0005941794,0.00090112526,0.00051969994,0.0013142487],"domain_scores_gemma":[0.9948088,0.0017282952,0.00042522632,0.0016244407,0.00092655886,0.00048667184],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010997503,0.00046850072,0.0003422976,0.0003643343,0.00114815,0.0013778937,0.0022437351,0.00038138512,0.00009975815],"category_scores_gemma":[0.0016376663,0.0005164314,0.00024286492,0.0015170502,0.0007568994,0.0010385199,0.0011498218,0.00068339455,0.00005548342],"study_design_candidate":"design_other","study_design_consensus":null,"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.000042165626,0.0016875938,0.0495501,0.00045183697,0.00017836518,0.00013910784,0.07763087,0.0003784913,0.013972902,0.21352017,0.0063979,0.6360505],"study_design_scores_gemma":[0.0021189866,0.000008112177,0.21692221,0.0031736242,0.00022900348,0.000498772,0.0054821456,0.4202622,0.15307361,0.05314221,0.14360043,0.0014887227],"about_ca_topic_score_codex":0.012510746,"about_ca_topic_score_gemma":0.021984339,"teacher_disagreement_score":0.6345618,"about_ca_system_score_codex":0.0007707031,"about_ca_system_score_gemma":0.0006009458,"threshold_uncertainty_score":0.99972874},"labels":[],"label_agreement":null},{"id":"W4391786199","doi":"10.1080/10095020.2024.2310590","title":"Stronger compact representations of object trajectories","year":2024,"lang":"en","type":"article","venue":"Geo-spatial Information Science","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Xunta de Galicia; Ministerio de Ciencia e Innovación","keywords":"Object (grammar); Computer science; Artificial intelligence","score_opus":0.01905193954378181,"score_gpt":0.2940601720607943,"score_spread":0.2750082325170125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391786199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004852152,0.00002886911,0.9727816,0.00061337056,0.0012588964,0.0001762191,0.000042765914,0.0002133163,0.02003283],"genre_scores_gemma":[0.99278754,0.000010991273,0.006910378,0.00007525072,0.000045032968,0.000005317167,0.000020209678,0.0000018965902,0.00014336655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985012,0.000016354375,0.0003418325,0.00019076595,0.0007207687,0.0002291034],"domain_scores_gemma":[0.9991334,0.00006543959,0.00009692849,0.00045360465,0.00018408106,0.0000665495],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00069953117,0.000088219924,0.000096718235,0.00049633416,0.00019018134,0.0011167824,0.0010660762,0.00001847438,0.000053807915],"category_scores_gemma":[0.00010563937,0.00007510435,0.000043791686,0.0018927831,0.00023496871,0.015451305,0.00023915918,0.00007890843,0.00016777152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005492806,0.00003500212,0.0005767796,0.00011083644,0.000025651745,0.0000034365958,0.00944719,0.0030181208,0.0013811355,0.39777702,0.005707195,0.58191216],"study_design_scores_gemma":[0.00020489733,0.00010451345,0.041802816,0.000054902073,0.0000104074725,0.000007290308,0.0005624351,0.91103184,0.0119560305,0.001995546,0.032002293,0.00026704982],"about_ca_topic_score_codex":0.0004892039,"about_ca_topic_score_gemma":0.0000189013,"teacher_disagreement_score":0.9879354,"about_ca_system_score_codex":0.00003900265,"about_ca_system_score_gemma":0.00022312437,"threshold_uncertainty_score":0.9999201},"labels":[],"label_agreement":null},{"id":"W4392172125","doi":"10.2139/ssrn.4737334","title":"Spatial Search","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Data Management and Algorithms","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":"Computer science","score_opus":0.010141526569555722,"score_gpt":0.2533841095656469,"score_spread":0.24324258299609117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172125","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.0015718654,0.002524526,0.98864824,0.003067079,0.00079799275,0.000045620443,7.9233286e-7,0.00014451053,0.0031994015],"genre_scores_gemma":[0.98301345,0.0025494862,0.0025419684,0.00012741312,0.0009523499,0.0000022973354,0.0000035961905,0.000014868409,0.0107945725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783546,0.000039253,0.00012194198,0.00021271384,0.0003091244,0.0014814942],"domain_scores_gemma":[0.9996757,0.000021459055,0.0000148407735,0.00020976277,0.000023362763,0.000054896438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014398223,0.00008239519,0.00006626131,0.00016002008,0.00012236046,0.00077595346,0.0009338886,0.00002189382,0.000027621403],"category_scores_gemma":[0.0000069794332,0.00006674035,0.0000650309,0.00031390338,0.000015987374,0.00089215353,0.00020926735,0.001097673,0.00040062578],"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":[7.9270035e-7,0.0000072527437,0.000018963055,0.0000027876358,0.00003510067,0.000024500681,0.00003991422,0.0000045601514,0.00002099003,0.55224174,0.0005493443,0.44705403],"study_design_scores_gemma":[0.00033836966,0.00037301725,0.00022030946,0.000041665236,0.000019699391,0.0008466411,0.00020649565,0.15377362,0.00018851188,0.73154515,0.11213187,0.00031462603],"about_ca_topic_score_codex":0.000047700843,"about_ca_topic_score_gemma":0.000079671736,"teacher_disagreement_score":0.9861062,"about_ca_system_score_codex":0.0002588357,"about_ca_system_score_gemma":0.0009060734,"threshold_uncertainty_score":0.7482537},"labels":[],"label_agreement":null},{"id":"W4392213001","doi":"","title":"An algebra for the spatio-temporal representation and manipulation of the semantics of mobile object trajectories","year":2015,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Data Management and Algorithms","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":"Representation (politics); Object (grammar); Semantics (computer science); Computer science; Algebra over a field; Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.03766401892173175,"score_gpt":0.2719344270683672,"score_spread":0.23427040814663544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392213001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14003392,0.0010934997,0.84756386,0.006893039,0.00087575475,0.0018862399,0.0001633702,0.000059772196,0.0014305294],"genre_scores_gemma":[0.92798173,0.00037805637,0.06786462,0.000025468575,0.000041403724,0.000106750755,0.0004799669,0.000024761264,0.0030972282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511445,0.0028015585,0.00069087563,0.0006195814,0.00054781034,0.00022573188],"domain_scores_gemma":[0.9925781,0.0013360438,0.0011121084,0.0027504275,0.002143587,0.000079733014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060302503,0.00025378694,0.00034735643,0.00007295572,0.00035981383,0.0004245773,0.0020655699,0.00014432815,0.000021040627],"category_scores_gemma":[0.00077897875,0.00019706215,0.00016874114,0.0005689082,0.00052370573,0.00063530286,0.001663886,0.00022864105,0.0000020739292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048206195,0.00090901024,0.041565966,0.0006874032,0.00025603312,0.0000010641348,0.046399947,0.0056018364,0.00088916323,0.67298424,0.0025724873,0.22808462],"study_design_scores_gemma":[0.00079802296,0.0000057886305,0.0665784,0.0008521063,0.00023079455,0.000006362013,0.0008357715,0.85949886,0.030354971,0.028313883,0.012134025,0.00039098473],"about_ca_topic_score_codex":0.0033767638,"about_ca_topic_score_gemma":0.0025174578,"teacher_disagreement_score":0.85389704,"about_ca_system_score_codex":0.000050933566,"about_ca_system_score_gemma":0.00019849488,"threshold_uncertainty_score":0.80359614},"labels":[],"label_agreement":null},{"id":"W4392452257","doi":"10.1007/978-3-031-55598-5_14","title":"On Approximate Colored Path Counting","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Dalhousie University; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Colored; Path (computing); Artificial intelligence; Algorithm; Computer network","score_opus":0.014044541462618677,"score_gpt":0.2327552379191174,"score_spread":0.2187106964564987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392452257","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.000013030939,0.00023369657,0.96498597,0.001015658,0.0033855494,0.00038067653,0.000014491516,0.00038264398,0.029588297],"genre_scores_gemma":[0.036603346,0.00014457016,0.93990237,0.008939238,0.0018979812,0.000047961108,0.00007012738,0.00017168369,0.012222747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957677,0.000013924611,0.00043073145,0.0018936896,0.0011920632,0.0007018793],"domain_scores_gemma":[0.99780303,0.00029000273,0.00019109425,0.0014892014,0.00010506289,0.00012159225],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000992683,0.00054237235,0.0004342963,0.00089773553,0.00022702866,0.0018770656,0.004178868,0.00019692397,0.000021895898],"category_scores_gemma":[0.00004701139,0.0004657421,0.00012127052,0.0007434663,0.00039445906,0.000789707,0.0026723912,0.0008150414,0.0003493916],"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.0000035554785,0.000026433663,0.0000033897493,0.00009849387,0.000018191138,0.0003629841,0.00026191917,0.0052841865,0.000020105515,0.5013418,0.0004616337,0.4921173],"study_design_scores_gemma":[0.00011612858,0.00012021159,0.000005557834,0.00045339856,0.0000074101513,0.000013881792,7.88758e-8,0.61623836,0.00011310613,0.37546647,0.007010527,0.00045489412],"about_ca_topic_score_codex":0.000008311312,"about_ca_topic_score_gemma":0.000011674484,"teacher_disagreement_score":0.61095417,"about_ca_system_score_codex":0.00023170759,"about_ca_system_score_gemma":0.00018542909,"threshold_uncertainty_score":0.9997794},"labels":[],"label_agreement":null},{"id":"W4392452947","doi":"10.2139/ssrn.4748027","title":"Spatial Search","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Data Management and Algorithms","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 Toronto","funders":"","keywords":"Geography; Computer science","score_opus":0.010141526569555722,"score_gpt":0.2533841095656469,"score_spread":0.24324258299609117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392452947","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.0015718654,0.002524526,0.98864824,0.003067079,0.00079799275,0.000045620443,7.9233286e-7,0.00014451053,0.0031994015],"genre_scores_gemma":[0.98301345,0.0025494862,0.0025419684,0.00012741312,0.0009523499,0.0000022973354,0.0000035961905,0.000014868409,0.0107945725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783546,0.000039253,0.00012194198,0.00021271384,0.0003091244,0.0014814942],"domain_scores_gemma":[0.9996757,0.000021459055,0.0000148407735,0.00020976277,0.000023362763,0.000054896438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014398223,0.00008239519,0.00006626131,0.00016002008,0.00012236046,0.00077595346,0.0009338886,0.00002189382,0.000027621403],"category_scores_gemma":[0.0000069794332,0.00006674035,0.0000650309,0.00031390338,0.000015987374,0.00089215353,0.00020926735,0.001097673,0.00040062578],"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":[7.9270035e-7,0.0000072527437,0.000018963055,0.0000027876358,0.00003510067,0.000024500681,0.00003991422,0.0000045601514,0.00002099003,0.55224174,0.0005493443,0.44705403],"study_design_scores_gemma":[0.00033836966,0.00037301725,0.00022030946,0.000041665236,0.000019699391,0.0008466411,0.00020649565,0.15377362,0.00018851188,0.73154515,0.11213187,0.00031462603],"about_ca_topic_score_codex":0.000047700843,"about_ca_topic_score_gemma":0.000079671736,"teacher_disagreement_score":0.9861062,"about_ca_system_score_codex":0.0002588357,"about_ca_system_score_gemma":0.0009060734,"threshold_uncertainty_score":0.7482537},"labels":[],"label_agreement":null},{"id":"W4392453829","doi":"10.1007/978-3-031-55598-5_18","title":"Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 British Columbia","funders":"","keywords":"Computer science","score_opus":0.01916650100272064,"score_gpt":0.2392212954782524,"score_spread":0.22005479447553178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392453829","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.000032135496,0.000375978,0.99101704,0.0030638983,0.0028950067,0.00048350816,0.000030785523,0.000037739086,0.0020638928],"genre_scores_gemma":[0.37985027,0.00025908533,0.60289574,0.003426085,0.0011523953,0.00006366564,0.000014173638,0.00009837208,0.012240239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979617,0.000019940358,0.0004141597,0.00065744953,0.00061972596,0.00032704184],"domain_scores_gemma":[0.9972227,0.001013145,0.00030636878,0.0012881476,0.00013736867,0.000032231248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007318586,0.0002535549,0.00030238286,0.00023073785,0.00020570436,0.0003069697,0.0046866247,0.00007957413,0.0000037313753],"category_scores_gemma":[0.00012303276,0.00014863424,0.00023242868,0.00049072213,0.0009408014,0.00033235445,0.002453645,0.0003008439,0.0000018973808],"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.000007031738,0.000028529204,0.000025425983,0.00041613064,0.00007468833,0.000007870144,0.0027501492,0.027132092,0.00021043257,0.8124885,0.00060868653,0.15625049],"study_design_scores_gemma":[0.00018178874,0.00008447183,0.000046156685,0.0012426553,0.000039973977,0.000007654805,0.0000050036547,0.49140805,0.0013446959,0.49729034,0.008035307,0.00031388],"about_ca_topic_score_codex":0.00003870906,"about_ca_topic_score_gemma":0.00006196549,"teacher_disagreement_score":0.46427596,"about_ca_system_score_codex":0.000075783275,"about_ca_system_score_gemma":0.00018083122,"threshold_uncertainty_score":0.87089926},"labels":[],"label_agreement":null},{"id":"W4392966781","doi":"10.20944/preprints202403.1007.v1","title":"DSTree: A Spatio-Temporal Indexing Data Structure for Distributed Networks","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University","funders":"Global Water Futures","keywords":"Search engine indexing; Computer science; Data mining; Information retrieval","score_opus":0.1377305705771439,"score_gpt":0.35062159400363224,"score_spread":0.21289102342648833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392966781","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.020720406,0.00038967887,0.96363604,0.0018831666,0.005170833,0.0018252333,0.0046776123,0.0010529927,0.0006440391],"genre_scores_gemma":[0.9493255,0.000054701857,0.022534406,0.00016931444,0.0011421294,0.00015676036,0.025670916,0.00006583398,0.00088045833],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553615,0.00008700954,0.000643784,0.002626246,0.00048623543,0.0006205556],"domain_scores_gemma":[0.9930798,0.00009573543,0.00037260106,0.006157517,0.00012758849,0.00016675527],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00094503525,0.00054022373,0.0005067753,0.00020401565,0.00016734742,0.000671668,0.008188677,0.00037814528,0.00011987551],"category_scores_gemma":[0.00018328257,0.00053628674,0.00017499947,0.000445102,0.000069742186,0.00067342236,0.050031412,0.0012802087,0.0001593707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023750315,0.0007221178,0.4242316,0.0062912228,0.0043885102,0.00059609447,0.001926937,0.0793956,0.00015443684,0.11495,0.113919556,0.25318643],"study_design_scores_gemma":[0.00037075617,0.000014655361,0.010964989,0.00033080913,0.00013231538,0.000005050333,0.000017682709,0.86943895,0.00022919178,0.04394844,0.0737682,0.000778949],"about_ca_topic_score_codex":0.00016544592,"about_ca_topic_score_gemma":0.00011775784,"teacher_disagreement_score":0.9411016,"about_ca_system_score_codex":0.00011982819,"about_ca_system_score_gemma":0.00020690195,"threshold_uncertainty_score":0.9997089},"labels":[],"label_agreement":null},{"id":"W4393089540","doi":"10.5267/j.dsl.2024.1.002","title":"A novel scenario planning approach considering criteria interaction in multi-criteria evaluation: An application to urban mobility","year":2024,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Data Management and Algorithms","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; Management science; Transport engineering; Operations research; Risk analysis (engineering); Mathematical optimization; Process management; Engineering; Business; Mathematics","score_opus":0.12490406144744177,"score_gpt":0.40931124396273105,"score_spread":0.2844071825152893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393089540","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.21646492,0.00001808582,0.7807315,0.0010809243,0.000951154,0.00051732524,0.000003346376,0.00013646047,0.00009626568],"genre_scores_gemma":[0.66868484,3.9566874e-7,0.32994467,0.001186344,0.00006157619,0.000099410536,0.0000110130695,0.0000066492407,0.000005113409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677765,0.00006860436,0.00041717378,0.0013362091,0.0010206874,0.0003796504],"domain_scores_gemma":[0.9986059,0.00012547502,0.000058650112,0.0009523263,0.000101928614,0.0001557009],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046238294,0.00017338873,0.00015603843,0.0009414513,0.00021236925,0.0025255329,0.001510267,0.00003390178,0.000013200269],"category_scores_gemma":[0.00023624783,0.00016369676,0.000036303496,0.0024779933,0.00011705442,0.005649576,0.00063156785,0.00017693188,0.00006100748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031790965,0.00040101077,0.0011039134,0.000044649754,0.000008525894,0.000032975237,0.0104498,0.023072526,0.4300207,0.0018476745,0.0037086133,0.5292778],"study_design_scores_gemma":[0.00024091845,0.00002514299,0.01488701,0.000094403,0.0000035903454,0.000016245292,0.0002031159,0.98134696,0.000517884,0.00016171411,0.0022995395,0.00020347786],"about_ca_topic_score_codex":0.0000695084,"about_ca_topic_score_gemma":0.000010542502,"teacher_disagreement_score":0.9582744,"about_ca_system_score_codex":0.00031021147,"about_ca_system_score_gemma":0.000081391896,"threshold_uncertainty_score":0.99850994},"labels":[],"label_agreement":null},{"id":"W4393394735","doi":"10.1109/tsp.2024.3383284","title":"Spatial Registration of Heterogeneous Sensors on Mobile Platforms","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Data Management and Algorithms","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":"Polytechnique Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Computer vision","score_opus":0.020629043937227504,"score_gpt":0.2605317007188656,"score_spread":0.2399026567816381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393394735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01436836,0.00006403919,0.9840724,0.00006642362,0.00037194559,0.0001491886,0.000013285421,0.00022796684,0.0006663765],"genre_scores_gemma":[0.99665064,0.0000113067335,0.002745582,0.000048114314,0.000058594174,0.000021329492,0.0000035596222,0.000012177905,0.000448692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988944,0.000011402585,0.00023847833,0.00034137047,0.00035110323,0.00016324728],"domain_scores_gemma":[0.99960196,0.000049728184,0.000058573896,0.00021131194,0.000035290013,0.000043165353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015230288,0.00013121453,0.0001112483,0.00020971084,0.00014017131,0.00029519756,0.00028238166,0.000046008154,0.000032549182],"category_scores_gemma":[7.436576e-7,0.000112609465,0.00007594164,0.00035973985,0.000038041955,0.00080157304,0.0000021971014,0.00015880706,0.000047130783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020577181,0.00010696019,3.3508695e-7,0.00013035712,0.000024375855,0.00003462445,0.00030113154,0.07120592,0.0016624117,0.00027830186,0.00006179943,0.9261732],"study_design_scores_gemma":[0.00014705553,0.0003997565,0.0000028293246,0.00024250256,0.000019894947,0.000017327025,0.000031666477,0.8581593,0.13932908,0.00071052334,0.0007689826,0.00017110183],"about_ca_topic_score_codex":0.000016278052,"about_ca_topic_score_gemma":0.0000064804344,"teacher_disagreement_score":0.9822823,"about_ca_system_score_codex":0.000034164066,"about_ca_system_score_gemma":0.000051008992,"threshold_uncertainty_score":0.45920807},"labels":[],"label_agreement":null},{"id":"W4393764489","doi":"10.5281/zenodo.3269890","title":"Models and Data for Simple Applications of BERT for Ad Hoc Document Retrieval","year":2019,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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; Simple (philosophy); Information retrieval","score_opus":0.11441677004267531,"score_gpt":0.3490369527446988,"score_spread":0.2346201827020235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393764489","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.875351e-9,0.00056027976,0.034051996,0.00008403543,0.000054018605,0.0021032875,0.96311235,0.000020561763,0.000013475989],"genre_scores_gemma":[3.3072058e-7,0.00008286047,0.011456136,0.00010994769,0.00009583476,0.00064139906,0.98732674,0.000010632593,0.00027610463],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986248,0.000008604488,0.00023945846,0.00070690736,0.00021125497,0.00020894654],"domain_scores_gemma":[0.9966494,0.00022595754,0.00023669936,0.0027250678,0.00011018241,0.000052703377],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001308754,0.00017320298,0.00025035054,0.00009275553,0.00007004638,0.00022833075,0.0034868491,0.00010011234,0.0010406857],"category_scores_gemma":[0.00013843716,0.0001669864,0.000049718747,0.00014491136,0.0000055070545,0.0008982971,0.002977448,0.00007314979,0.00008925044],"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.000005357929,0.000018324914,6.6291266e-9,0.0010071257,0.000029290632,1.8810451e-7,0.000002959918,0.000006190151,1.11087736e-7,0.00008346279,0.98832095,0.01052606],"study_design_scores_gemma":[0.00030107656,0.00006763591,4.9855237e-7,0.00019496348,0.00003209642,4.3444746e-7,0.0000023441735,0.031633005,0.000004918175,0.0015725087,0.96600384,0.0001867119],"about_ca_topic_score_codex":0.000003666995,"about_ca_topic_score_gemma":0.000007623693,"teacher_disagreement_score":0.031626813,"about_ca_system_score_codex":0.000014508888,"about_ca_system_score_gemma":0.00006799745,"threshold_uncertainty_score":0.9998725},"labels":[],"label_agreement":null},{"id":"W4393771746","doi":"10.5281/zenodo.7386967","title":"Three-way model differencing and conflict detection","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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; Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.04718132228837098,"score_gpt":0.23891334886151788,"score_spread":0.19173202657314692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393771746","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004207394,0.00009542327,0.3176704,0.00021858767,0.00028034626,0.0004799347,0.67768407,0.0007909352,0.0027382025],"genre_scores_gemma":[0.00033302503,0.00036695693,0.00065984624,0.00016961318,0.000114420785,1.3944812e-7,0.99751836,0.0005272124,0.00031042672],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980265,0.0001596394,0.00023085717,0.0007166528,0.0005231737,0.0003431774],"domain_scores_gemma":[0.9985597,0.000019924248,0.00015383061,0.0009882371,0.00014206469,0.00013625243],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00061435584,0.00021486521,0.00018889268,0.00038970594,0.0024948134,0.002185777,0.002755114,0.00007424623,0.010754172],"category_scores_gemma":[0.0001470799,0.00023122146,0.000042908483,0.00048229427,0.00007886663,0.00057102385,0.007993823,0.00050666765,0.00090331933],"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.000005766098,0.00003667191,2.8852366e-8,0.00005787276,0.00002655184,0.000012554386,0.00007792737,0.000044391065,0.000047884303,0.000715689,0.88590217,0.11307252],"study_design_scores_gemma":[0.00022969389,0.0001356753,0.000017556473,0.000012748258,0.000018570681,0.00003875467,0.000021397846,0.04858703,0.000013244199,0.0002800847,0.950404,0.00024127589],"about_ca_topic_score_codex":0.00005819715,"about_ca_topic_score_gemma":0.0000028839736,"teacher_disagreement_score":0.31983426,"about_ca_system_score_codex":0.00012599873,"about_ca_system_score_gemma":0.0000032792382,"threshold_uncertainty_score":0.9998746},"labels":[],"label_agreement":null},{"id":"W4393832861","doi":"10.5281/zenodo.3544492","title":"Three-dimensional Stable Matching with Cyclic Preferences: Computational proofs log files","year":2018,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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; University of Ottawa","funders":"","keywords":"Mathematical proof; Matching (statistics); Computer science; Mathematics; Combinatorics; Theoretical computer science; Statistics; Geometry","score_opus":0.03992379600801263,"score_gpt":0.25368434339321644,"score_spread":0.2137605473852038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393832861","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017428468,0.00007847579,0.0016707326,0.000052969135,0.00015685784,0.0004299338,0.9973096,0.00015904148,0.00014063914],"genre_scores_gemma":[0.000003296169,0.0000011511576,0.020614332,0.00029113865,0.00029276736,0.00019478751,0.9784549,0.000017048551,0.00013057404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975206,0.00003575638,0.00027960265,0.00087759434,0.00085429725,0.000432112],"domain_scores_gemma":[0.9982811,0.00016659663,0.00031570764,0.00092865963,0.00019330737,0.00011460992],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00009219182,0.00039676094,0.00031059992,0.00018735036,0.00025758304,0.0008139074,0.0024159448,0.00014898801,0.048199635],"category_scores_gemma":[0.00006302738,0.00031150796,0.000059374655,0.00030280728,0.00002327893,0.0010351309,0.0016378803,0.00033652986,0.0043769777],"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.0000038032765,0.000053757172,7.365476e-7,0.00025157884,0.000053684205,0.00004420567,0.000007599725,0.00041051934,3.0794624e-8,0.00003515552,0.9980277,0.0011112344],"study_design_scores_gemma":[0.00021768438,0.00012015522,0.00014129603,0.002220294,0.000015630896,0.0000140910115,0.0000013377326,0.008918117,0.0000019505555,0.0029556882,0.9849101,0.0004836925],"about_ca_topic_score_codex":0.00008920676,"about_ca_topic_score_gemma":0.00030111443,"teacher_disagreement_score":0.043822657,"about_ca_system_score_codex":0.000041623334,"about_ca_system_score_gemma":0.0002561035,"threshold_uncertainty_score":0.9999337},"labels":[],"label_agreement":null},{"id":"W4393838383","doi":"10.5281/zenodo.7386968","title":"Three-way model differencing and conflict detection","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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; Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.04718132228837098,"score_gpt":0.23891334886151788,"score_spread":0.19173202657314692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393838383","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004207394,0.00009542327,0.3176704,0.00021858767,0.00028034626,0.0004799347,0.67768407,0.0007909352,0.0027382025],"genre_scores_gemma":[0.00033302503,0.00036695693,0.00065984624,0.00016961318,0.000114420785,1.3944812e-7,0.99751836,0.0005272124,0.00031042672],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980265,0.0001596394,0.00023085717,0.0007166528,0.0005231737,0.0003431774],"domain_scores_gemma":[0.9985597,0.000019924248,0.00015383061,0.0009882371,0.00014206469,0.00013625243],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00061435584,0.00021486521,0.00018889268,0.00038970594,0.0024948134,0.002185777,0.002755114,0.00007424623,0.010754172],"category_scores_gemma":[0.0001470799,0.00023122146,0.000042908483,0.00048229427,0.00007886663,0.00057102385,0.007993823,0.00050666765,0.00090331933],"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.000005766098,0.00003667191,2.8852366e-8,0.00005787276,0.00002655184,0.000012554386,0.00007792737,0.000044391065,0.000047884303,0.000715689,0.88590217,0.11307252],"study_design_scores_gemma":[0.00022969389,0.0001356753,0.000017556473,0.000012748258,0.000018570681,0.00003875467,0.000021397846,0.04858703,0.000013244199,0.0002800847,0.950404,0.00024127589],"about_ca_topic_score_codex":0.00005819715,"about_ca_topic_score_gemma":0.0000028839736,"teacher_disagreement_score":0.31983426,"about_ca_system_score_codex":0.00012599873,"about_ca_system_score_gemma":0.0000032792382,"threshold_uncertainty_score":0.9998746},"labels":[],"label_agreement":null},{"id":"W4394078363","doi":"10.6084/m9.figshare.19929380.v2","title":"FUZZY LOGIC APPLIED IN THE PROSPECTING OF SUITABLE AREAS FOR THE ESTABLISHMENT OF COMMERCIAL FOREST PLANTATIONS","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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":"Prospecting; Fuzzy logic; Computer science; Agroforestry; Forestry; Agricultural engineering; Artificial intelligence; Environmental science; Geography; Mining engineering; Engineering","score_opus":0.058060798596516854,"score_gpt":0.284850170661525,"score_spread":0.22678937206500815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394078363","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5610553e-7,0.00007912447,0.000094125426,0.00015770066,0.00010740849,0.001319961,0.997668,0.000011865826,0.0005612361],"genre_scores_gemma":[0.00013317699,0.000008951013,0.0002831193,0.00017574328,0.00006764921,0.0016125712,0.99768835,0.000005534977,0.000024928513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880093,0.00004018309,0.00029861857,0.00026511974,0.0003786853,0.00021645802],"domain_scores_gemma":[0.9979297,0.00081521895,0.0003641141,0.0008313083,0.000045906447,0.000013749134],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036365088,0.00014369121,0.00020847806,0.00011515103,0.00020322716,0.00016823066,0.0030772914,0.00004711323,0.008065721],"category_scores_gemma":[0.00025488008,0.00009246325,0.00006843404,0.00048335752,0.0000105749905,0.0001844323,0.0010762439,0.0002441914,0.000012005191],"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.0000044379453,0.00007625047,0.0000065560735,0.00029696387,0.000017569757,0.000002777202,0.00012224654,0.00016746963,7.479427e-8,0.0016857907,0.99651635,0.0011035412],"study_design_scores_gemma":[0.00026117195,0.00005895469,0.00085634406,0.00015995484,0.000024537274,0.0000015029317,0.00027332237,0.00038243752,0.000003805424,0.0008601172,0.996992,0.00012586142],"about_ca_topic_score_codex":0.00015274012,"about_ca_topic_score_gemma":0.00053789857,"teacher_disagreement_score":0.008053715,"about_ca_system_score_codex":0.00002810415,"about_ca_system_score_gemma":0.00006591297,"threshold_uncertainty_score":0.99284106},"labels":[],"label_agreement":null},{"id":"W4394322198","doi":"10.6084/m9.figshare.19929380","title":"FUZZY LOGIC APPLIED IN THE PROSPECTING OF SUITABLE AREAS FOR THE ESTABLISHMENT OF COMMERCIAL FOREST PLANTATIONS","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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":"Prospecting; Fuzzy logic; Agroforestry; Forestry; Business; Agricultural engineering; Computer science; Environmental science; Geography; Artificial intelligence; Mining engineering; Engineering","score_opus":0.058060798596516854,"score_gpt":0.284850170661525,"score_spread":0.22678937206500815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394322198","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5610553e-7,0.00007912447,0.000094125426,0.00015770066,0.00010740849,0.001319961,0.997668,0.000011865826,0.0005612361],"genre_scores_gemma":[0.00013317699,0.000008951013,0.0002831193,0.00017574328,0.00006764921,0.0016125712,0.99768835,0.000005534977,0.000024928513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880093,0.00004018309,0.00029861857,0.00026511974,0.0003786853,0.00021645802],"domain_scores_gemma":[0.9979297,0.00081521895,0.0003641141,0.0008313083,0.000045906447,0.000013749134],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036365088,0.00014369121,0.00020847806,0.00011515103,0.00020322716,0.00016823066,0.0030772914,0.00004711323,0.008065721],"category_scores_gemma":[0.00025488008,0.00009246325,0.00006843404,0.00048335752,0.0000105749905,0.0001844323,0.0010762439,0.0002441914,0.000012005191],"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.0000044379453,0.00007625047,0.0000065560735,0.00029696387,0.000017569757,0.000002777202,0.00012224654,0.00016746963,7.479427e-8,0.0016857907,0.99651635,0.0011035412],"study_design_scores_gemma":[0.00026117195,0.00005895469,0.00085634406,0.00015995484,0.000024537274,0.0000015029317,0.00027332237,0.00038243752,0.000003805424,0.0008601172,0.996992,0.00012586142],"about_ca_topic_score_codex":0.00015274012,"about_ca_topic_score_gemma":0.00053789857,"teacher_disagreement_score":0.008053715,"about_ca_system_score_codex":0.00002810415,"about_ca_system_score_gemma":0.00006591297,"threshold_uncertainty_score":0.99284106},"labels":[],"label_agreement":null},{"id":"W4394335133","doi":"10.6084/m9.figshare.19929380.v1","title":"FUZZY LOGIC APPLIED IN THE PROSPECTING OF SUITABLE AREAS FOR THE ESTABLISHMENT OF COMMERCIAL FOREST PLANTATIONS","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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":"Prospecting; Fuzzy logic; Agricultural engineering; Forestry; Computer science; Agroforestry; Geography; Environmental science; Mining engineering; Geology; Artificial intelligence; Engineering","score_opus":0.058060798596516854,"score_gpt":0.284850170661525,"score_spread":0.22678937206500815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394335133","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.5610553e-7,0.00007912447,0.000094125426,0.00015770066,0.00010740849,0.001319961,0.997668,0.000011865826,0.0005612361],"genre_scores_gemma":[0.00013317699,0.000008951013,0.0002831193,0.00017574328,0.00006764921,0.0016125712,0.99768835,0.000005534977,0.000024928513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880093,0.00004018309,0.00029861857,0.00026511974,0.0003786853,0.00021645802],"domain_scores_gemma":[0.9979297,0.00081521895,0.0003641141,0.0008313083,0.000045906447,0.000013749134],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036365088,0.00014369121,0.00020847806,0.00011515103,0.00020322716,0.00016823066,0.0030772914,0.00004711323,0.008065721],"category_scores_gemma":[0.00025488008,0.00009246325,0.00006843404,0.00048335752,0.0000105749905,0.0001844323,0.0010762439,0.0002441914,0.000012005191],"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.0000044379453,0.00007625047,0.0000065560735,0.00029696387,0.000017569757,0.000002777202,0.00012224654,0.00016746963,7.479427e-8,0.0016857907,0.99651635,0.0011035412],"study_design_scores_gemma":[0.00026117195,0.00005895469,0.00085634406,0.00015995484,0.000024537274,0.0000015029317,0.00027332237,0.00038243752,0.000003805424,0.0008601172,0.996992,0.00012586142],"about_ca_topic_score_codex":0.00015274012,"about_ca_topic_score_gemma":0.00053789857,"teacher_disagreement_score":0.008053715,"about_ca_system_score_codex":0.00002810415,"about_ca_system_score_gemma":0.00006591297,"threshold_uncertainty_score":0.99284106},"labels":[],"label_agreement":null},{"id":"W4394747849","doi":"10.1016/j.engappai.2024.108365","title":"TL-TSD: A two-layer traffic sub-area division framework based on trajectory clustering","year":2024,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"","keywords":"Computer science; Cluster analysis; Trajectory; Data mining; Division (mathematics); Dynamic time warping; Metric (unit); Matching (statistics); Euclidean distance; Artificial intelligence","score_opus":0.02751727852393089,"score_gpt":0.28014337161276803,"score_spread":0.25262609308883716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394747849","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.003167048,0.00014752368,0.99497974,0.00025703743,0.0004138156,0.0003121111,0.000012071858,0.0005680791,0.00014256898],"genre_scores_gemma":[0.88479793,0.0000130791905,0.11486461,0.000033079643,0.000109047636,0.00013216346,0.000011234321,0.00002064106,0.000018200895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985754,0.000014574566,0.00036272942,0.00049570046,0.00029881852,0.00025277832],"domain_scores_gemma":[0.9987108,0.0003429978,0.00004445546,0.0007833048,0.000042576907,0.00007586201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032745712,0.00018447591,0.0001502536,0.0003868913,0.00008180869,0.0002641816,0.00092848815,0.00005753911,0.000021574144],"category_scores_gemma":[0.000046819765,0.0001888158,0.000092945644,0.0011413939,0.000029503479,0.0003001443,0.00013876722,0.00024560612,0.00015036692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017380421,0.00006311206,0.0000010643603,0.000057106903,0.000009424807,0.0000029376024,0.00011607737,0.6187782,0.0019303872,0.061985943,0.00004394333,0.31701002],"study_design_scores_gemma":[0.000010151293,0.00004605215,0.000023756602,0.00017963114,0.0000076137326,6.6235907e-7,0.000017545022,0.9802575,0.01617604,0.0013829803,0.001708935,0.00018914325],"about_ca_topic_score_codex":0.000006791278,"about_ca_topic_score_gemma":0.0000027038375,"teacher_disagreement_score":0.8816309,"about_ca_system_score_codex":0.000044708355,"about_ca_system_score_gemma":0.000030462457,"threshold_uncertainty_score":0.7699685},"labels":[],"label_agreement":null},{"id":"W4398169855","doi":"10.5753/ercemapi.2023.236434","title":"Uma análise comparativa de técnicas de detecção de pontos de parada em ambientes urbanos","year":2023,"lang":"pt","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Humanities; Computer science; Philosophy","score_opus":0.042620707764202605,"score_gpt":0.300246464850381,"score_spread":0.25762575708617835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398169855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2972151,0.00053948554,0.6903989,0.0036962298,0.00080240954,0.0008326473,0.00008198066,0.001320367,0.005112896],"genre_scores_gemma":[0.8791479,0.00030296767,0.05665694,0.0029808194,0.00042181936,0.00011091016,0.00008179758,0.00007182214,0.06022501],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531955,0.00042568697,0.0006039031,0.0010126588,0.00060250534,0.0020357035],"domain_scores_gemma":[0.9972282,0.00041312337,0.00020308905,0.0014215468,0.00008188248,0.0006521593],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014968845,0.0005138001,0.00049851765,0.00035430715,0.00045806568,0.0014886364,0.0029378457,0.00017980614,0.00035297504],"category_scores_gemma":[0.00017710745,0.0005131508,0.00023972725,0.0016619035,0.00012970208,0.0011974246,0.0016580842,0.0004217497,0.0016772143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010914281,0.0008756271,0.04278875,0.00030354265,0.00042984847,0.0023856638,0.013190007,0.0018011158,0.0025617385,0.02144405,0.73428893,0.17982158],"study_design_scores_gemma":[0.0010826711,0.00025304616,0.036276143,0.00013151458,0.000084185645,0.00006927628,0.0013812114,0.92782944,0.0047263987,0.0018904977,0.025529508,0.0007461325],"about_ca_topic_score_codex":0.0008419078,"about_ca_topic_score_gemma":0.0007612683,"teacher_disagreement_score":0.9260283,"about_ca_system_score_codex":0.00035735624,"about_ca_system_score_gemma":0.0004134318,"threshold_uncertainty_score":0.999732},"labels":[],"label_agreement":null},{"id":"W4398624482","doi":"10.7910/dvn/omdh4h","title":"rail data (railway lines, stations)","year":2019,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Data Management and Algorithms","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":"Canadian Nautical Research Society","funders":"","keywords":"Transport engineering; Geography; Computer science; Engineering","score_opus":0.04873948775276314,"score_gpt":0.2802284006062698,"score_spread":0.23148891285350665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398624482","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2260526e-7,0.0000043189357,0.0447696,0.00005199533,0.002780392,0.00043458198,0.95150656,0.0001443405,0.00030808218],"genre_scores_gemma":[1.4636899e-7,0.0007091072,0.021644933,0.00094452215,0.00045070832,0.000016107193,0.9728876,0.000021978036,0.0033249264],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99639267,0.00011667718,0.00050403265,0.0016377079,0.00081233756,0.0005365918],"domain_scores_gemma":[0.9856602,0.00014756962,0.00035444708,0.013580459,0.00009324233,0.00016405716],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.000767299,0.00046936423,0.00045033984,0.0003770766,0.00015938726,0.0011675092,0.0147238895,0.00019776452,0.006452279],"category_scores_gemma":[0.0002497434,0.0004547784,0.000074536336,0.00053826184,0.00007233412,0.004771434,0.013367094,0.0004734784,0.35992035],"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.000004136875,0.00008563071,0.0000011392975,0.00012324013,0.00008880544,0.00010607989,0.00000700581,0.0000074223512,7.7808807e-7,0.00042382794,0.99385846,0.0052934974],"study_design_scores_gemma":[0.00047281315,0.000031345095,0.000011634901,0.00006424344,0.00009741623,0.000007833109,0.000012283949,0.007938819,0.0000012628017,0.000054784392,0.9907528,0.0005547607],"about_ca_topic_score_codex":0.00029748247,"about_ca_topic_score_gemma":0.00011498943,"teacher_disagreement_score":0.35346806,"about_ca_system_score_codex":0.00005075081,"about_ca_system_score_gemma":0.0002540472,"threshold_uncertainty_score":0.99986935},"labels":[],"label_agreement":null},{"id":"W4398864","doi":"10.1016/0006-2952(71)90175-4","title":"Searching through spatial relationships using the 2DR-tree.","year":2006,"lang":"en","type":"article","venue":"IMSA","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Optimal binary search tree; Tree (set theory); Computer science; Binary search tree; Ternary search tree; Binary tree; Data mining; Random binary tree; Spatial analysis; Curse of dimensionality; Binary data; Tree traversal; Space partitioning; Binary number; Artificial intelligence; Interval tree; Mathematics; Tree structure; Algorithm; Statistics","score_opus":0.064313225270257,"score_gpt":0.28421519169776815,"score_spread":0.21990196642751114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398864","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.014436455,0.000051401643,0.9669546,0.0016209788,0.00028677357,0.00009563622,0.0000018075102,0.000092750124,0.016459582],"genre_scores_gemma":[0.9027513,0.0000027178191,0.09580787,0.00016695574,0.00038388884,0.0000031070072,0.0000104408755,0.0000063886914,0.00086729805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.0000793545,0.000108364206,0.00017725462,0.00021209261,0.00017895615],"domain_scores_gemma":[0.9994296,0.00008573054,0.000041492684,0.00041234712,0.000016728873,0.000014136386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003115838,0.00006355426,0.00004880621,0.000031108186,0.00037626462,0.0003407124,0.0006479358,0.000017228807,0.00000823977],"category_scores_gemma":[0.000019792074,0.000045509678,0.0000293229,0.00023727931,0.000034504686,0.0008461113,0.00032618616,0.00014030415,0.00006159643],"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.0000022752015,0.00006454909,0.0057154587,0.000009817827,0.000020645803,0.000038157097,0.00092728913,0.004098702,0.0004233861,0.852959,0.0081280265,0.1276127],"study_design_scores_gemma":[0.00030903306,0.000019340408,0.032077204,0.000023399361,0.000014599173,0.000012491941,0.00009653471,0.78575736,0.0005945191,0.107211284,0.07362889,0.00025531702],"about_ca_topic_score_codex":0.0012220863,"about_ca_topic_score_gemma":0.00017115884,"teacher_disagreement_score":0.88831484,"about_ca_system_score_codex":0.000017692424,"about_ca_system_score_gemma":0.000016069596,"threshold_uncertainty_score":0.32854977},"labels":[],"label_agreement":null},{"id":"W4399058103","doi":"10.1007/978-3-031-60599-4_6","title":"LEO: Learning Efficient Orderings for Multiobjective Binary Decision Diagrams","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Binary decision diagram; Computer science; Binary number; Influence diagram; Artificial intelligence; Operations research; Theoretical computer science; Decision tree; Mathematics; Arithmetic","score_opus":0.013037306246668113,"score_gpt":0.254650362214452,"score_spread":0.24161305596778387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058103","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.000097241784,0.0005389867,0.9920875,0.00039294845,0.0038465224,0.0008149285,0.000009901905,0.0003753801,0.0018366147],"genre_scores_gemma":[0.05826735,0.00009542236,0.9365101,0.000579823,0.0008772837,0.00007253741,0.000036669302,0.0000978668,0.0034629593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570006,0.000015748145,0.00047113796,0.0021259913,0.0009456367,0.0007414015],"domain_scores_gemma":[0.9976028,0.0008178131,0.00019780401,0.0010238306,0.00021546103,0.00014227974],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096708175,0.0005678397,0.00047019165,0.0011375273,0.00040189293,0.00141273,0.0031710188,0.00022257172,0.000009427015],"category_scores_gemma":[0.000161219,0.000497031,0.00020593901,0.0008779779,0.000374557,0.0006019075,0.003192488,0.0008274783,0.00011813472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071706195,0.000026639247,0.0000058052856,0.000059686234,0.000014732763,0.00007213626,0.0004804092,0.17913833,0.000034135453,0.020899082,0.000044741504,0.7992171],"study_design_scores_gemma":[0.00027078335,0.00028063016,0.0000290092,0.0005550998,0.0000137091865,0.000013642253,5.2112523e-7,0.90229744,0.00022772714,0.08396334,0.011765243,0.0005828466],"about_ca_topic_score_codex":0.000014032014,"about_ca_topic_score_gemma":0.000023516646,"teacher_disagreement_score":0.7986343,"about_ca_system_score_codex":0.00030426474,"about_ca_system_score_gemma":0.00019045093,"threshold_uncertainty_score":0.9997481},"labels":[],"label_agreement":null},{"id":"W4399207140","doi":"10.3390/mca29030042","title":"DSTree: A Spatio-Temporal Indexing Data Structure for Distributed Networks","year":2024,"lang":"en","type":"article","venue":"Mathematical and Computational Applications","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University","funders":"Global Water Futures","keywords":"Search engine indexing; Computer science; Information retrieval","score_opus":0.027176071559373224,"score_gpt":0.285693085630551,"score_spread":0.2585170140711778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399207140","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.00015192688,0.0001593459,0.99568105,0.0025547084,0.000041210267,0.00044798403,0.0006452627,0.00019763912,0.00012086882],"genre_scores_gemma":[0.4061591,0.0000039279466,0.58583784,0.00019449418,0.00017804641,0.0002332041,0.0072694034,0.000012260337,0.00011172079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.000009601126,0.00020673846,0.0004111903,0.00015951594,0.00014128533],"domain_scores_gemma":[0.999171,0.00030647172,0.000034354638,0.0003790853,0.000043976044,0.000065111344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013813851,0.000104117615,0.00010572736,0.000050124112,0.00014621207,0.00054351985,0.0006445123,0.00003427774,0.0000176549],"category_scores_gemma":[0.000013056811,0.000087648914,0.000024535735,0.0003176908,0.000044937864,0.00044737133,0.00046616019,0.000078019606,0.000013936915],"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.993258e-7,0.000026814847,0.000011774464,0.00008364719,0.000024664112,9.66617e-7,0.000020748164,0.0021402694,8.1019846e-7,0.92765206,0.002543566,0.06749391],"study_design_scores_gemma":[0.000053344593,0.000005602187,0.0000507445,0.00001329884,0.000009761281,0.0000046741916,0.0000045062266,0.5625627,9.379885e-7,0.42064542,0.016586676,0.00006231377],"about_ca_topic_score_codex":0.0000012773268,"about_ca_topic_score_gemma":0.0000016560053,"teacher_disagreement_score":0.5604225,"about_ca_system_score_codex":0.000010630768,"about_ca_system_score_gemma":0.000028057178,"threshold_uncertainty_score":0.52411747},"labels":[],"label_agreement":null},{"id":"W4399246642","doi":"10.1007/s10796-024-10495-w","title":"Efficiently Labeling and Retrieving Temporal Anomalies in Relational Databases","year":2024,"lang":"en","type":"article","venue":"Information Systems Frontiers","topic":"Data Management and Algorithms","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":"Université de Sherbrooke","funders":"Provincia autonoma di Bolzano - Alto Adige; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Database; Relational database; Information retrieval; Temporal database","score_opus":0.01802214673386673,"score_gpt":0.23028306140069993,"score_spread":0.2122609146668332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399246642","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.0046422356,0.0020347505,0.9881278,0.00023513299,0.0020228694,0.0002009571,0.000035336005,0.00019112036,0.0025097528],"genre_scores_gemma":[0.90460455,0.00009911972,0.09376382,0.0001511982,0.00012171316,0.000029552546,0.00039873607,0.000008717685,0.00082258444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991012,0.000026221258,0.0003451223,0.00013798689,0.00025271846,0.00013670592],"domain_scores_gemma":[0.9996589,0.000034992147,0.00006539207,0.00017785015,0.000029477304,0.000033387783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063441694,0.00008106181,0.00009677437,0.00043865922,0.000071511226,0.0008462554,0.00019359624,0.000023706456,0.0000012593454],"category_scores_gemma":[0.000038709208,0.00007515064,0.000014905154,0.00050131447,0.0000206709,0.007727398,0.000150217,0.00007808029,0.000040753373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012679366,0.000024005947,0.054570895,0.0011223741,0.00008944281,0.000043641576,0.008053122,0.006134899,0.000013033026,0.6788426,0.095029026,0.15606427],"study_design_scores_gemma":[0.00013386735,0.000007574796,0.0013029618,0.00016073581,0.0000024562173,0.000006769775,0.0006167039,0.7391418,0.000003914617,0.00004612208,0.25847524,0.00010182751],"about_ca_topic_score_codex":0.00007683202,"about_ca_topic_score_gemma":0.0000020293064,"teacher_disagreement_score":0.8999623,"about_ca_system_score_codex":0.000049783735,"about_ca_system_score_gemma":0.00003310143,"threshold_uncertainty_score":0.816046},"labels":[],"label_agreement":null},{"id":"W4399261742","doi":"10.1609/socs.v17i1.31553","title":"Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Denver; Canadian Institute for Advanced Research; University of Alberta; National Science Foundation","keywords":"Clique; Computer science; Mathematics; Combinatorics","score_opus":0.012409085446213029,"score_gpt":0.26638053095995334,"score_spread":0.2539714455137403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261742","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.9005185,0.00012338482,0.0060006543,0.05022695,0.0044713127,0.0010589923,0.000060266837,0.00031963337,0.03722031],"genre_scores_gemma":[0.99852204,0.000019638985,0.00052849005,0.00010989552,0.0001321046,0.000014611551,0.000006973989,0.000010804279,0.0006554599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980546,0.000029122744,0.00028309127,0.0004585463,0.000935554,0.00023908545],"domain_scores_gemma":[0.9992533,0.00023684568,0.00005521118,0.00015443233,0.00024075576,0.000059469647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014606052,0.0001343729,0.00020454127,0.00052160025,0.000078491525,0.0009609741,0.0016383342,0.000058361955,0.000019464556],"category_scores_gemma":[0.000062537314,0.00010646297,0.0000994059,0.00123801,0.000117863274,0.00056806434,0.00076525676,0.00029501945,0.000016110878],"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.00010575218,0.00028771829,0.0123271635,0.0001264465,0.0005025893,0.000011638362,0.0005293522,0.00024210988,0.043377496,0.9334217,0.0011404238,0.0079276245],"study_design_scores_gemma":[0.0015216009,0.00026824203,0.0068528755,0.00038953166,0.00009022355,0.0000036964075,0.00005280073,0.8601962,0.11176824,0.007698028,0.010783504,0.00037509992],"about_ca_topic_score_codex":0.00019831798,"about_ca_topic_score_gemma":0.0000019753502,"teacher_disagreement_score":0.9257237,"about_ca_system_score_codex":0.00013817239,"about_ca_system_score_gemma":0.000058289097,"threshold_uncertainty_score":0.92666954},"labels":[],"label_agreement":null},{"id":"W4399328367","doi":"10.1080/03610918.2024.2360136","title":"A fast algorithm for computing product moments of multivariate normal random variables","year":2024,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Data Management and Algorithms","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":"Multivariate statistics; Random variable; Product (mathematics); Algorithm; Computer science; Mathematics; Statistics; Geometry","score_opus":0.07866160872159249,"score_gpt":0.4008946615529053,"score_spread":0.3222330528313128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399328367","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.00023342737,0.00033138742,0.998108,0.00016189879,0.00022434528,0.0005496804,0.00013121721,0.00008814695,0.00017188326],"genre_scores_gemma":[0.40552816,0.00003413183,0.5939758,0.000016316473,0.000017159115,0.00001788449,0.0003618409,0.0000069181383,0.0000418068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988358,0.000120381046,0.00047284973,0.00027528696,0.00015547343,0.0001401772],"domain_scores_gemma":[0.9979253,0.0012954918,0.00013283952,0.00043755275,0.00017858256,0.000030280911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061055575,0.00011459413,0.00016840256,0.00027107907,0.00016408108,0.0002647575,0.00047058333,0.00002793822,0.0000015321872],"category_scores_gemma":[0.000090200156,0.00012174633,0.000023585899,0.00048347164,0.00006656199,0.0005422535,0.00037985016,0.00009480232,0.0000021082471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004682744,0.00007400855,0.000044890443,0.00007956398,0.000025279767,5.9738994e-7,0.0008627275,0.15795834,0.0000139141475,0.0943924,0.00007321015,0.7464704],"study_design_scores_gemma":[0.0009195924,0.000033965247,0.0010445411,0.0000859878,0.000017954304,8.6330857e-7,0.000042206328,0.9797942,0.000011354461,0.01662363,0.0013050189,0.00012067146],"about_ca_topic_score_codex":0.000032114043,"about_ca_topic_score_gemma":0.0000059861923,"teacher_disagreement_score":0.8218359,"about_ca_system_score_codex":0.000033151347,"about_ca_system_score_gemma":0.000040984964,"threshold_uncertainty_score":0.4964671},"labels":[],"label_agreement":null},{"id":"W4399386969","doi":"10.3390/a17060246","title":"Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Data Management and Algorithms","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Upper and lower bounds; Mathematical optimization; Mathematics; Mathematical analysis","score_opus":0.011892679398638221,"score_gpt":0.24317464642662545,"score_spread":0.23128196702798723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399386969","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.005755265,0.00093314314,0.9855203,0.0021131986,0.0033590242,0.00058833143,0.00013483013,0.0006717152,0.00092416623],"genre_scores_gemma":[0.016319267,0.000059833557,0.9502992,0.0008126678,0.0014012322,0.00027578446,0.00037012633,0.00006894366,0.030392937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816036,0.00003764142,0.00028947415,0.0006866921,0.00033832132,0.00048748153],"domain_scores_gemma":[0.9991837,0.00011614645,0.000049083406,0.00044894227,0.00007365595,0.00012845987],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000430774,0.00022225702,0.00021163958,0.00027661273,0.00028479003,0.0012146496,0.00075611396,0.000068550384,0.000108847824],"category_scores_gemma":[0.000050201048,0.00022231214,0.00013225645,0.0003918065,0.000040609433,0.0015280652,0.0005997147,0.00009770984,0.00061774475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003878524,0.00020887991,0.00006592564,0.0006320672,0.0005956518,0.001012578,0.0030107144,0.0014699982,0.02129479,0.050105125,0.25816885,0.66339666],"study_design_scores_gemma":[0.0003709749,0.00016569317,0.00016833744,0.00015766945,0.000051054787,0.000040663883,0.000062702515,0.9262614,0.0013159192,0.008534106,0.062308714,0.00056274247],"about_ca_topic_score_codex":0.00006573423,"about_ca_topic_score_gemma":0.000006140728,"teacher_disagreement_score":0.9247914,"about_ca_system_score_codex":0.00013212285,"about_ca_system_score_gemma":0.000060783947,"threshold_uncertainty_score":0.9998222},"labels":[],"label_agreement":null},{"id":"W4399543318","doi":"10.2139/ssrn.4861223","title":"Optimizing Emission-Efficient Long-Distance Travel Using Modal Substitutions","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Data Management and Algorithms","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":"Modal; Computer science; Transport engineering; Engineering; Materials science","score_opus":0.02021537679567413,"score_gpt":0.271511751814411,"score_spread":0.25129637501873686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399543318","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.008628471,0.012330076,0.97409546,0.0007961849,0.0027449725,0.00025393526,0.000022577395,0.00017320743,0.00095513894],"genre_scores_gemma":[0.9418151,0.0037642212,0.04863783,0.00008706614,0.0013773881,0.000019774487,0.00004912235,0.000079385485,0.0041701626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951203,0.0000846661,0.0005625927,0.000880734,0.00071409176,0.0026376292],"domain_scores_gemma":[0.9985227,0.000025422021,0.0003084521,0.0008406361,0.000117944335,0.00018485682],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001811153,0.0004379377,0.00037054613,0.00044073944,0.0005396339,0.0014235261,0.0025308437,0.00018268701,0.000010470762],"category_scores_gemma":[0.000027089713,0.00039918342,0.00033230011,0.00052626966,0.00007684988,0.00033220332,0.0025462818,0.0055558016,0.000042734686],"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.0000087472,0.00014432636,0.000011615778,0.00010506821,0.00036729214,0.00016971714,0.00040303872,0.14646304,0.00013959515,0.82896304,0.00021298857,0.023011558],"study_design_scores_gemma":[0.00021987612,0.000035692683,0.000021550875,0.00040401245,0.0001043257,0.0003882873,0.00023623962,0.78040874,0.00006734631,0.21729526,0.00033538908,0.00048326177],"about_ca_topic_score_codex":0.00006021427,"about_ca_topic_score_gemma":0.000055554814,"teacher_disagreement_score":0.9331866,"about_ca_system_score_codex":0.0021217435,"about_ca_system_score_gemma":0.0046153427,"threshold_uncertainty_score":0.999846},"labels":[],"label_agreement":null},{"id":"W4400909560","doi":"10.1109/icde60146.2024.00084","title":"Learning k-Determinantal Point Processes for Personalized Ranking","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Google (Canada)","funders":"","keywords":"Determinantal point process; Ranking (information retrieval); Computer science; Point process; Point (geometry); Artificial intelligence; Mathematics; Statistics; Physics; Geometry","score_opus":0.017101827042279753,"score_gpt":0.2700053144373386,"score_spread":0.25290348739505886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400909560","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.0008107772,0.00035484057,0.9913026,0.0010773699,0.00033991635,0.00015980603,0.0000019803228,0.00055230124,0.005400389],"genre_scores_gemma":[0.5824965,0.00014360744,0.30897617,0.00059103884,0.00052935287,0.00016425374,0.000049231858,0.000041587144,0.10700822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932617,0.000009059533,0.00009073807,0.00029023862,0.00010636839,0.00017743201],"domain_scores_gemma":[0.9997222,0.00009719597,0.000014627745,0.0001136141,0.000027443783,0.000024953553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022868697,0.000078029174,0.00007434987,0.00007801063,0.00010619638,0.00075425254,0.00039817416,0.000014513297,0.00002994361],"category_scores_gemma":[0.000043300566,0.000060761802,0.000046885638,0.00025226647,0.00001552274,0.001068644,0.00018138748,0.000052926767,0.000046225927],"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.000006746783,0.000025320256,0.000106737134,0.0007473248,0.0000425738,0.00004782405,0.001640189,0.000013070089,0.00027872392,0.32085952,0.0073996047,0.66883236],"study_design_scores_gemma":[0.00042678183,0.00016416573,0.00004603835,0.0001584792,0.000017789482,0.000023502742,0.00024048128,0.51013106,0.0012158029,0.0075975754,0.4796801,0.00029824025],"about_ca_topic_score_codex":0.0000035809103,"about_ca_topic_score_gemma":0.0000017189407,"teacher_disagreement_score":0.68232644,"about_ca_system_score_codex":0.000010519337,"about_ca_system_score_gemma":0.000032663746,"threshold_uncertainty_score":0.72732747},"labels":[],"label_agreement":null},{"id":"W4400909730","doi":"10.1109/icde60146.2024.00383","title":"GaussDB-Global: A Geographically Distributed Database System","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Distributed database; Database; Spatiotemporal database; Database design; Database tuning; View","score_opus":0.009484433151845805,"score_gpt":0.23913363774244187,"score_spread":0.22964920459059607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400909730","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.000121550016,0.00026082265,0.9810935,0.0015100512,0.0007940503,0.00012237976,0.00029572475,0.0019016259,0.01390028],"genre_scores_gemma":[0.7809368,0.00008436568,0.21386522,0.00078388944,0.00035817924,0.00006303039,0.0012403538,0.000023479035,0.0026446918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998788,0.00002534305,0.0001669371,0.00047681312,0.00027838655,0.00026452905],"domain_scores_gemma":[0.9990858,0.000027662536,0.00001564421,0.00073862995,0.000026056623,0.0001061937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590175,0.00011958853,0.00009848493,0.000081475366,0.00006318789,0.0010368037,0.0010897225,0.00002570755,0.000027369004],"category_scores_gemma":[0.0000091502925,0.00009127021,0.000063792904,0.0012301775,0.000025207411,0.0010687878,0.0007791224,0.00007032806,0.0005043707],"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":[5.717963e-7,0.000016313603,0.000096259064,0.000089151414,0.000030652336,0.00026134367,0.0000039978345,0.0000023890698,0.000010650684,0.9519157,0.03495153,0.012621448],"study_design_scores_gemma":[0.00017274261,0.000036937003,0.00093294354,0.00016256676,0.00002669757,0.000045967063,0.000038327784,0.57862747,0.000035601082,0.0019963295,0.41761997,0.00030442842],"about_ca_topic_score_codex":0.000054786688,"about_ca_topic_score_gemma":0.000009563797,"teacher_disagreement_score":0.94991934,"about_ca_system_score_codex":0.000036686986,"about_ca_system_score_gemma":0.00002553019,"threshold_uncertainty_score":0.99979216},"labels":[],"label_agreement":null},{"id":"W4400909774","doi":"10.1109/icde60146.2024.00408","title":"Robust Query Optimization in the Era of Machine Learning: State-of-the-Art and Future Directions","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"IBM (Canada); University of Ottawa","funders":"","keywords":"Computer science; Query optimization; State (computer science); Artificial intelligence; Machine learning; Information retrieval; Programming language","score_opus":0.011671235054987046,"score_gpt":0.21825128872434152,"score_spread":0.20658005366935447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400909774","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.0017875505,0.0009835562,0.97981924,0.01003923,0.00054347666,0.00017690458,0.0000059032545,0.00007707362,0.0065670614],"genre_scores_gemma":[0.4681983,0.010353866,0.4785715,0.0012344304,0.0005376362,0.000064246145,0.00012859574,0.000049581722,0.04086185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959975,0.00004661865,0.000091911985,0.00010849124,0.0000996464,0.00005354962],"domain_scores_gemma":[0.9997641,0.000037519938,0.0000214104,0.00015819256,0.000011830913,0.000006947579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021663774,0.00004002639,0.000045125897,0.000048261663,0.000039615894,0.00009653038,0.0002524394,0.000009253973,0.000015289865],"category_scores_gemma":[0.0000066744738,0.000021767317,0.000017296417,0.0004921283,0.000019789119,0.00032790087,0.00013676075,0.00010899294,0.0000013719209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036923586,0.000112652924,0.0025012153,0.00012510185,0.000043297834,0.000007544178,0.0035957494,0.15844086,0.000025765215,0.06886528,0.009350921,0.7569279],"study_design_scores_gemma":[0.000046616715,0.000016648308,0.0016116047,0.000015697346,0.0000038368185,0.0000017056183,0.00005450507,0.9380764,0.000034847006,0.00022285088,0.059881985,0.000033342425],"about_ca_topic_score_codex":0.0000552322,"about_ca_topic_score_gemma":0.000066869194,"teacher_disagreement_score":0.7796355,"about_ca_system_score_codex":0.0000038447906,"about_ca_system_score_gemma":0.000009128643,"threshold_uncertainty_score":0.09308446},"labels":[],"label_agreement":null},{"id":"W4401353058","doi":"10.14778/3675034.3675040","title":"Incremental Sliding Window Connectivity over Streaming Graphs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Search engine indexing; Sliding window protocol; Computation; Leverage (statistics); Latency (audio); Window (computing); Stream processing; Throughput; Graph; Theoretical computer science; Data mining; Parallel computing; Algorithm; Artificial intelligence","score_opus":0.012101642950259544,"score_gpt":0.2308971289352785,"score_spread":0.21879548598501897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401353058","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.9635087,0.0006268731,0.00550683,0.0017941558,0.0021258737,0.00092913856,0.000025787334,0.00055437046,0.024928248],"genre_scores_gemma":[0.9964734,0.00003247933,0.0030276396,0.00010001422,0.00006995688,0.00002607836,0.0000010419368,0.000010994226,0.00025840598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986052,0.0000066268694,0.00021655994,0.00041372175,0.00047949774,0.00027838603],"domain_scores_gemma":[0.99957377,0.00004595874,0.00009813009,0.00019231558,0.000041523137,0.00004830046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048575492,0.00016356882,0.00014741211,0.0001542772,0.00014208046,0.0004736598,0.0011631026,0.000026865928,0.000017078719],"category_scores_gemma":[0.000031268388,0.00011568248,0.00012874384,0.0006147509,0.000038642294,0.0013665155,0.001306697,0.00013901952,0.00001115981],"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.0000067163555,0.00013136766,0.0084956745,0.0002925964,0.00019239866,0.0000052273026,0.0008001485,0.0000044966737,0.0850118,0.8448679,0.006433308,0.053758364],"study_design_scores_gemma":[0.0017424822,0.00037516758,0.03896959,0.0014757494,0.0002169297,0.00004851704,0.0010866739,0.06186323,0.7781497,0.09128588,0.023601832,0.0011842482],"about_ca_topic_score_codex":0.000067988054,"about_ca_topic_score_gemma":0.0000028582542,"teacher_disagreement_score":0.753582,"about_ca_system_score_codex":0.00008570928,"about_ca_system_score_gemma":0.00001638894,"threshold_uncertainty_score":0.47173947},"labels":[],"label_agreement":null},{"id":"W4401468895","doi":"10.1016/j.geomat.2024.100004","title":"Understanding the impact of geotagging on location inference models for accurate generalization to non-geotagged datasets","year":2024,"lang":"en","type":"article","venue":"GEOMATICA","topic":"Data Management and Algorithms","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":"Geotagging; Inference; Generalization; Computer science; Geography; Data mining; Artificial intelligence; Information retrieval; Mathematics","score_opus":0.11570116180420643,"score_gpt":0.34759595285791156,"score_spread":0.23189479105370514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401468895","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.0018060928,0.000014351225,0.9961837,0.00086850196,0.0001539929,0.0004469432,0.000116656214,0.00007100393,0.00033878736],"genre_scores_gemma":[0.98987406,0.0000075068124,0.009604068,0.00011499725,0.000041338626,0.000041138963,0.00023932547,0.000008058476,0.000069509486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991637,0.000024083496,0.00019597865,0.00024229128,0.00018497724,0.0001889652],"domain_scores_gemma":[0.9991776,0.00018474164,0.000055780685,0.00051075895,0.000031360298,0.00003979265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004086778,0.000103459,0.00009761392,0.0001433208,0.00011694351,0.0004448905,0.00059734425,0.000018610479,0.0000058342375],"category_scores_gemma":[0.00005770568,0.00006844172,0.000042167965,0.00056846463,0.000015271824,0.0009201761,0.0001952419,0.000040707622,0.00002481021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054927114,0.00002502198,0.000006469769,0.000117410666,0.00005428522,0.0000013753173,0.0008178492,0.5768901,0.00008849405,0.39590156,0.016432684,0.009659227],"study_design_scores_gemma":[0.00008100928,0.00007590803,0.00012233727,0.00013690842,0.0000105739955,4.6236485e-7,0.00003204556,0.95907754,0.00010009287,0.040172696,0.00010546879,0.00008496297],"about_ca_topic_score_codex":0.00005311635,"about_ca_topic_score_gemma":0.0000044695757,"teacher_disagreement_score":0.988068,"about_ca_system_score_codex":0.00008281305,"about_ca_system_score_gemma":0.000053534724,"threshold_uncertainty_score":0.42900893},"labels":[],"label_agreement":null},{"id":"W4401608703","doi":"10.1109/tvt.2024.3443742","title":"Dynamic Virtual Network Embedding Leveraging Neighborhood and Preceding Mappings Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Data Management and Algorithms","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Computer science; Computer network; Distributed computing; Artificial intelligence","score_opus":0.005898160685220277,"score_gpt":0.22235520348653262,"score_spread":0.21645704280131234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401608703","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.007349205,0.00017659018,0.98765814,0.001977181,0.0010502207,0.00017591716,0.0000042506763,0.001359971,0.00024852977],"genre_scores_gemma":[0.97756594,0.000138206,0.02191495,0.00016387703,0.00002159309,0.00004317759,0.000005336978,0.0000115079865,0.00013540426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989452,0.000016766164,0.00021871249,0.0003396603,0.00016616857,0.00031352884],"domain_scores_gemma":[0.9995137,0.000040290717,0.00003870289,0.00034153202,0.000026134072,0.00003966713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020234231,0.00016276995,0.00013441795,0.00057862286,0.00041937552,0.00078375393,0.00043589744,0.00013825916,0.0000066144858],"category_scores_gemma":[0.000003904845,0.0001641074,0.00004969854,0.001075308,0.000055915945,0.0019219514,0.000020906193,0.00039062873,0.00007315057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002732984,0.000018948027,0.000005564642,0.000047602363,0.0000969677,0.000027477583,0.00026021953,0.030178387,0.00036486497,0.036137413,0.00020168499,0.93265814],"study_design_scores_gemma":[0.00017485872,0.0000853632,0.000010928813,0.0001317541,0.000023256327,0.00005306183,0.00012313186,0.98491,0.00068857864,0.003987819,0.009618258,0.00019297612],"about_ca_topic_score_codex":0.0000045426177,"about_ca_topic_score_gemma":0.0000027479568,"teacher_disagreement_score":0.97021675,"about_ca_system_score_codex":0.00006426222,"about_ca_system_score_gemma":0.00002000283,"threshold_uncertainty_score":0.75577575},"labels":[],"label_agreement":null},{"id":"W4402265611","doi":"10.1109/tqcebt59414.2024.10545107","title":"Complex Event Processing in Web Streams with Ontology-Based Abstraction Layers for Smart City Frameworks","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Horizon College and Seminary","funders":"","keywords":"Computer science; Ontology; Abstraction; Complex event processing; Event (particle physics); STREAMS; World Wide Web; Programming language; Process (computing); Computer network","score_opus":0.02955860682144413,"score_gpt":0.29752522578589885,"score_spread":0.26796661896445473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402265611","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.009289769,0.000034101104,0.98501796,0.0028367785,0.0001951662,0.00027787348,0.0000051404436,0.00026575287,0.0020774805],"genre_scores_gemma":[0.8389747,0.000001417288,0.16035704,0.000274933,0.00003389611,0.000041700176,0.00003174548,0.000006127345,0.00027842226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991143,0.000012126356,0.00014508843,0.00036031526,0.00015300204,0.00021516475],"domain_scores_gemma":[0.9996372,0.00005260525,0.00003356903,0.00021341708,0.000027204078,0.00003601456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002378202,0.00010443236,0.000102080674,0.0001387487,0.00006031558,0.00038300952,0.0003127364,0.000068396716,0.000031051506],"category_scores_gemma":[0.0000070206247,0.00008027992,0.00003037986,0.0003304981,0.000025405165,0.0007049696,0.00005231631,0.00019044518,0.000008110702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000413677,0.0002555433,0.005113763,0.00030322498,0.000030911197,0.00005973122,0.00017706725,0.002973701,0.0001056629,0.023180593,0.0064352453,0.9613232],"study_design_scores_gemma":[0.00029285776,0.00008321289,0.006916177,0.000102880564,0.000006862821,0.000001741025,0.000039842136,0.9840087,0.000077310964,0.0010186271,0.0073227016,0.00012906925],"about_ca_topic_score_codex":0.00007447092,"about_ca_topic_score_gemma":0.0007823606,"teacher_disagreement_score":0.981035,"about_ca_system_score_codex":0.00005142787,"about_ca_system_score_gemma":0.000083743886,"threshold_uncertainty_score":0.36933696},"labels":[],"label_agreement":null},{"id":"W4402351867","doi":"10.1109/ijcnn60899.2024.10651125","title":"GS-SQL: Modeling Spatial Semantics in Spatial Text-to-SQL","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Chongqing Municipal Education Commission; Ministry of Natural Resources","keywords":"Computer science; SQL; SQL/PSM; Programming language; Data definition language; Semantics (computer science); PL/SQL; Database; Query by Example; Information retrieval","score_opus":0.01877647370813558,"score_gpt":0.2581648012388266,"score_spread":0.23938832753069106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402351867","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.003647697,0.000042534495,0.985008,0.0031272746,0.001127928,0.0001771137,0.0000044804997,0.0003547013,0.006510283],"genre_scores_gemma":[0.9357864,0.000016512617,0.06124187,0.0005084718,0.00031298597,0.0000103049815,0.000012062044,0.000014926949,0.0020964162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985632,0.00002277027,0.00024679548,0.00051649316,0.00031821633,0.00033256813],"domain_scores_gemma":[0.9993899,0.000030513796,0.000013620724,0.00046118643,0.000022350512,0.00008242594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003119467,0.00014483985,0.00013463091,0.00029706504,0.000046452635,0.0007337122,0.0008888705,0.000039706414,0.000065766675],"category_scores_gemma":[0.000017818398,0.000127637,0.000045519922,0.00056020165,0.000010490686,0.0007691362,0.00085000077,0.00014024765,0.00069860526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006184677,0.00010042171,0.0004519756,0.00011007554,0.000026728252,0.00033775787,0.000892359,0.020752463,0.0001438762,0.11965219,0.007582077,0.8499439],"study_design_scores_gemma":[0.00011900539,0.00003348243,0.00014652344,0.0000490374,0.000004483497,0.0000020940456,0.000018559223,0.98936737,0.000115806266,0.0020106547,0.007942433,0.00019055924],"about_ca_topic_score_codex":0.0016110941,"about_ca_topic_score_gemma":0.0008632038,"teacher_disagreement_score":0.9686149,"about_ca_system_score_codex":0.000033695764,"about_ca_system_score_gemma":0.000038075585,"threshold_uncertainty_score":0.897939},"labels":[],"label_agreement":null},{"id":"W4402564288","doi":"10.48550/arxiv.2408.07650","title":"Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Nearest neighbor search; Similarity (geometry); Index (typography); Metric (unit); Range (aeronautics); Trajectory; Tree (set theory); Mathematics; Computer science; Range query (database); Data mining; Algorithm; Artificial intelligence; Combinatorics; Information retrieval; Search engine; Web search query; Engineering; Physics; World Wide Web; Sargable","score_opus":0.06774126754605381,"score_gpt":0.21009785073267936,"score_spread":0.14235658318662556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402564288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29932064,0.0001908559,0.69778556,0.00010532277,0.00035517293,0.0007317655,0.000096748176,0.000307443,0.0011065276],"genre_scores_gemma":[0.9942345,0.000098317294,0.004246663,0.000043237527,0.00007750212,0.000003977641,0.00004456469,0.00002420819,0.001227028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977535,0.00010640437,0.00014131391,0.0014209608,0.00017465188,0.0004031498],"domain_scores_gemma":[0.9984439,0.00012333493,0.00008513529,0.0010375867,0.000119017146,0.00019103198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053236395,0.0003341281,0.00032458446,0.0007654962,0.00018888027,0.0005220794,0.0013982396,0.00016240636,0.000008756167],"category_scores_gemma":[0.000014820979,0.0003190498,0.000108735396,0.0011059676,0.00017643739,0.0004479906,0.002804967,0.0005266687,0.00001090032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000683568,0.0012681546,0.01993717,0.0041115903,0.0014253225,0.0026746613,0.0030758388,0.31426406,0.000021969361,0.5938767,0.0020347398,0.05662622],"study_design_scores_gemma":[0.0007403013,0.00023895265,0.007485706,0.000089981695,0.00014691481,0.0000033655576,0.00021023313,0.98461354,0.000034004985,0.005085264,0.0008174943,0.00053426414],"about_ca_topic_score_codex":0.00022319847,"about_ca_topic_score_gemma":0.00018268799,"teacher_disagreement_score":0.69491386,"about_ca_system_score_codex":0.00012883847,"about_ca_system_score_gemma":0.000163753,"threshold_uncertainty_score":0.99992615},"labels":[],"label_agreement":null},{"id":"W4402626604","doi":"10.1109/tfuzz.2024.3464848","title":"A Granular Aggregation of Multifaceted Gaussian Process Models","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Data Management and Algorithms","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":"National Natural Science Foundation of China","keywords":"Gaussian process; Process (computing); Computer science; Statistical physics; Biological system; Gaussian; Physics; Chemistry; Computational chemistry","score_opus":0.023399261755128183,"score_gpt":0.2563447556756685,"score_spread":0.23294549392054031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402626604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001745229,0.0002959106,0.9932811,0.00016139066,0.001998895,0.00043473527,0.000050885268,0.00042318716,0.0016086315],"genre_scores_gemma":[0.99714154,0.00003405692,0.0017098333,0.000013294857,0.000041189473,0.0000930448,0.000006151872,0.000015581578,0.00094530324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862826,0.000057588568,0.00031437437,0.000402326,0.00040153624,0.00019589455],"domain_scores_gemma":[0.99928105,0.00003935175,0.000059841816,0.00048863346,0.00006677598,0.00006432196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024510836,0.0001520719,0.00018139,0.00035598472,0.00009693734,0.00030501818,0.00051276834,0.00006114435,0.0000043065293],"category_scores_gemma":[0.0000011054129,0.00013396506,0.00009307765,0.00082324026,0.000029190043,0.0013827622,0.0000022780212,0.00013505958,0.00007526299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000299984,0.00050303264,0.0000052647574,0.0026208602,0.0002778009,0.00008948992,0.005103837,0.6023877,0.0017018353,0.04588816,0.00091571856,0.34047627],"study_design_scores_gemma":[0.00020842002,0.00006701768,0.0000033863637,0.00038695516,0.000027047952,0.000009033714,0.00013599718,0.99297875,0.0043543987,0.0011818863,0.0004875357,0.00015959123],"about_ca_topic_score_codex":0.000113054084,"about_ca_topic_score_gemma":0.0000074252343,"teacher_disagreement_score":0.9953963,"about_ca_system_score_codex":0.000037993264,"about_ca_system_score_gemma":0.00004241716,"threshold_uncertainty_score":0.5462937},"labels":[],"label_agreement":null},{"id":"W4402628937","doi":"10.1109/icee63041.2024.10667760","title":"Enhancing Kriging with Inductive Spatio-Temporal GraphODE","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Kriging; Machine learning","score_opus":0.01307233720259102,"score_gpt":0.24014385444668745,"score_spread":0.22707151724409644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402628937","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.0069540585,0.000056309058,0.9738204,0.0005976688,0.0003479494,0.000081707905,9.648078e-7,0.00046400735,0.017676976],"genre_scores_gemma":[0.70772886,0.0000064717933,0.28858304,0.00021365589,0.000103562445,0.000011023674,0.000012300318,0.000009331361,0.0033317523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992377,0.000012409534,0.00008822156,0.00031920473,0.00017576259,0.00016669469],"domain_scores_gemma":[0.999654,0.000022189684,0.000015735906,0.0002539202,0.000017889448,0.000036289006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015838067,0.00008639516,0.0000658282,0.00015196632,0.00006053253,0.00056520663,0.00037777374,0.000013093997,0.00004790336],"category_scores_gemma":[0.0000024964222,0.000060544033,0.000021529742,0.0005809412,0.000018848206,0.0016391656,0.00018218,0.00008070941,0.00009850691],"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.0000036900535,0.00003194701,0.001511497,0.00006374529,0.00009748818,0.00022675864,0.00121026,0.000026074082,0.000220725,0.7928021,0.007295107,0.19651063],"study_design_scores_gemma":[0.0007764602,0.00047605674,0.0020252103,0.00058366824,0.00006192354,0.00005551606,0.001250467,0.57387555,0.03385297,0.04704116,0.33837828,0.0016227202],"about_ca_topic_score_codex":0.0001395614,"about_ca_topic_score_gemma":0.00014735146,"teacher_disagreement_score":0.7457609,"about_ca_system_score_codex":0.000012747029,"about_ca_system_score_gemma":0.000030488725,"threshold_uncertainty_score":0.54503006},"labels":[],"label_agreement":null},{"id":"W4402671649","doi":"10.18653/v1/2024.acl-long.311","title":"A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"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":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Preference; Artificial intelligence; Economics; Microeconomics","score_opus":0.025607229488819706,"score_gpt":0.2552919323939405,"score_spread":0.22968470290512077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402671649","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.0014957598,0.00029969413,0.9885016,0.002364526,0.0002276301,0.00030958056,0.0000018344156,0.00031305506,0.0064863106],"genre_scores_gemma":[0.88173646,0.00006869519,0.11717798,0.00030825014,0.00003484765,0.00007302684,0.0000038414514,0.0000063944976,0.0005905034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989667,0.000038325823,0.000189114,0.0003254481,0.0003145716,0.00016582111],"domain_scores_gemma":[0.9992281,0.00011475139,0.000032436852,0.0005796379,0.000012352963,0.000032691514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032581738,0.0001066969,0.000097262186,0.0000794595,0.00005688753,0.00027957078,0.0012109003,0.00002247532,0.00002370703],"category_scores_gemma":[0.000011353324,0.000060264,0.000057777877,0.00037037884,0.000065037166,0.00024872608,0.00069691904,0.00007408716,0.000025982969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010655374,0.00007312544,0.000012143048,0.00004136724,0.00003560961,0.00000836572,0.002439982,0.000039241957,0.0002503986,0.27912536,0.0024608618,0.71551245],"study_design_scores_gemma":[0.000071918366,0.0002200824,0.0002828905,0.000099124874,0.000026389158,0.000003314148,0.000262958,0.8952246,0.03847749,0.0188046,0.04628724,0.0002394224],"about_ca_topic_score_codex":0.0000640442,"about_ca_topic_score_gemma":0.00000816008,"teacher_disagreement_score":0.89518535,"about_ca_system_score_codex":0.000024309484,"about_ca_system_score_gemma":0.00001641532,"threshold_uncertainty_score":0.26959077},"labels":[],"label_agreement":null},{"id":"W4402922096","doi":"10.1038/s41598-024-72504-x","title":"A framework for spatial-temporal cluster evolution representation and analysis based on graphs","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Data Management and Algorithms","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; Cluster (spacecraft); Representation (politics); Theoretical computer science; Computational biology; Data mining; Biology; Computer network","score_opus":0.020341029762146592,"score_gpt":0.29174854833627367,"score_spread":0.2714075185741271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402922096","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.0040801456,0.00007073411,0.9883884,0.0008635654,0.005831792,0.00035043046,0.000006457578,0.00017792528,0.00023053652],"genre_scores_gemma":[0.9084356,8.7336866e-7,0.090100564,0.000073660354,0.00005835561,0.000051357787,0.00019812117,0.000006803134,0.0010746919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979776,0.000038857237,0.0002868949,0.0010527907,0.00044933977,0.000194519],"domain_scores_gemma":[0.9986348,0.0001278431,0.00011129756,0.0009903985,0.00006969859,0.00006597566],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014000053,0.000104411745,0.0001287116,0.00079737237,0.00023140431,0.0019579285,0.00020238094,0.0000426356,0.0000157437],"category_scores_gemma":[0.00014842492,0.00009030335,0.0001456903,0.0022877804,0.00007289158,0.00067713653,0.00011537263,0.00006475685,0.000008305779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068197565,0.00048255976,0.080830246,0.00057168683,0.0010489206,0.0014412083,0.0016990947,0.01196138,0.0005454627,0.3486351,0.13805878,0.41465735],"study_design_scores_gemma":[0.00004134366,0.000029008783,0.0033129884,0.00004272429,0.00008807544,0.000004575088,0.000009203325,0.82003164,0.00014416367,0.17044984,0.005736133,0.000110279565],"about_ca_topic_score_codex":0.0000666845,"about_ca_topic_score_gemma":0.00003194421,"teacher_disagreement_score":0.9043554,"about_ca_system_score_codex":0.00003077517,"about_ca_system_score_gemma":0.000046971178,"threshold_uncertainty_score":0.99907815},"labels":[],"label_agreement":null},{"id":"W4403095001","doi":"10.1109/ms.2024.3472016","title":"On Build Hermeticity in Bazel-Based Build Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Software","topic":"Data Management and Algorithms","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; Systems engineering; Software engineering; Engineering","score_opus":0.014388998615915189,"score_gpt":0.2513422562157066,"score_spread":0.2369532575997914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403095001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026958099,0.0004453678,0.9660643,0.0005522077,0.004022154,0.0003058722,0.000034962275,0.0009965262,0.00062053924],"genre_scores_gemma":[0.9842285,0.000008272493,0.013634452,0.00060629565,0.00019743173,0.00003697496,0.000015777303,0.000024005132,0.0012482799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985575,0.000058056696,0.00020225179,0.0005317692,0.0003385441,0.0003118729],"domain_scores_gemma":[0.9990344,0.00020828257,0.000027926219,0.00063608773,0.00002323927,0.00007003056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736153,0.00016316591,0.00015958084,0.0002739364,0.000083565275,0.00048627178,0.0009216546,0.00005704464,0.000014714831],"category_scores_gemma":[0.000050139577,0.0001456641,0.00006281859,0.00071410555,0.000026439831,0.0004598074,0.00016638142,0.0001980268,0.00034077413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048960716,0.0010633838,0.0077012572,0.003003314,0.00021091994,0.004166395,0.0013169057,0.06688552,0.0007001457,0.27806178,0.22332029,0.4135211],"study_design_scores_gemma":[0.0010102377,0.0003273499,0.0026673845,0.0016376516,0.00002522158,0.000010837405,0.000024687366,0.8537265,0.0018275031,0.007825332,0.12988456,0.001032724],"about_ca_topic_score_codex":0.00009826778,"about_ca_topic_score_gemma":0.000015035943,"teacher_disagreement_score":0.9572704,"about_ca_system_score_codex":0.00007689826,"about_ca_system_score_gemma":0.00005258419,"threshold_uncertainty_score":0.594001},"labels":[],"label_agreement":null},{"id":"W4403165798","doi":"10.61091/jcmcc122-06","title":"Neighbor Locating Coloring on Graphs: Three Products","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Data Management and Algorithms","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":"Graph coloring; Complete coloring; Computer science; Combinatorics; Greedy coloring; Business; Mathematics; Graph; Line graph","score_opus":0.019782868263130166,"score_gpt":0.25251457148166506,"score_spread":0.2327317032185349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4007167,0.0035208114,0.42473632,0.0029879953,0.15793322,0.0013208126,0.0000057942707,0.00081256934,0.007965764],"genre_scores_gemma":[0.9717879,0.000054295768,0.025891319,0.000040328232,0.0021727646,0.0000026550813,0.0000010936761,0.00003684189,0.0000127925505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720544,0.00007002565,0.0009879569,0.00042302615,0.00089505705,0.00041847795],"domain_scores_gemma":[0.9977071,0.0007517089,0.0005411407,0.00046257215,0.00036914757,0.00016833124],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022717468,0.00033181455,0.0005752292,0.0004357843,0.0002968862,0.001519973,0.001163952,0.00009958687,0.000002531606],"category_scores_gemma":[0.0004339787,0.0002773986,0.00015776153,0.00096086273,0.00006401743,0.00096539105,0.0006049507,0.0006081391,0.000011525112],"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.000013945724,0.00022350572,0.00002417477,0.00033137217,0.000113396294,0.00010691499,0.00044208,0.000029078545,0.00014791058,0.9749494,0.0007670833,0.022851117],"study_design_scores_gemma":[0.0016339044,0.0011727889,0.00007035044,0.0013603738,0.00008225251,0.000110436806,0.00010391136,0.11218252,0.000937109,0.8774431,0.004458633,0.0004446322],"about_ca_topic_score_codex":0.0000039646916,"about_ca_topic_score_gemma":1.5867995e-7,"teacher_disagreement_score":0.5710712,"about_ca_system_score_codex":0.00008374428,"about_ca_system_score_gemma":0.00015329805,"threshold_uncertainty_score":0.9999678},"labels":[],"label_agreement":null},{"id":"W4403450086","doi":"10.2139/ssrn.4989700","title":"On Approximate Colored Path Counting","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Data Management and Algorithms","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":"Dalhousie University; Université du Québec en Outaouais","funders":"","keywords":"Colored; Path (computing); Mathematics; Combinatorics; Computer science; Materials science; Computer network","score_opus":0.009498252363250003,"score_gpt":0.23812494107412205,"score_spread":0.22862668871087205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403450086","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.010325526,0.00593241,0.9532089,0.0062780282,0.0065829647,0.00062960986,0.000029605499,0.00072947657,0.016283456],"genre_scores_gemma":[0.93413144,0.014903284,0.022225041,0.0018693728,0.0039900835,0.00012526725,0.00017055444,0.00024536808,0.0223396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995665,0.000082610015,0.00040198228,0.0007230624,0.0006558567,0.0024714489],"domain_scores_gemma":[0.9987695,0.000045462995,0.00030253583,0.00072517956,0.00007354199,0.00008373298],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002926559,0.00035798998,0.0003141637,0.0003197934,0.00021441732,0.0017303082,0.0025994868,0.00015090307,0.000009700885],"category_scores_gemma":[0.000039430935,0.00030619605,0.00021854782,0.0002869996,0.000029822571,0.0002900504,0.0030083375,0.006315637,0.00024938234],"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.0000072201824,0.00004755259,0.0000055960245,0.00006464945,0.00024005618,0.00006048998,0.0000880786,0.00021633517,0.0000074991235,0.92930007,0.0038407028,0.06612172],"study_design_scores_gemma":[0.00021214627,0.00016435985,0.000007291048,0.00020338409,0.000044199376,0.00010019915,0.00007832805,0.08311751,0.000012531973,0.9124213,0.003307398,0.00033135232],"about_ca_topic_score_codex":0.000021720367,"about_ca_topic_score_gemma":0.0000331735,"teacher_disagreement_score":0.9309839,"about_ca_system_score_codex":0.0010000817,"about_ca_system_score_gemma":0.0019367122,"threshold_uncertainty_score":0.999939},"labels":[],"label_agreement":null},{"id":"W4403471969","doi":"10.1016/j.is.2024.102475","title":"Explaining results of path queries on graphs: Single-path results for context-free path queries","year":2024,"lang":"en","type":"article","venue":"Information Systems","topic":"Data Management and Algorithms","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":"Path (computing); Computer science; Context (archaeology); Path expression; Longest path problem; Theoretical computer science; Graph; Data mining; Shortest path problem; Query language; Computer network; Geography","score_opus":0.030239839670588683,"score_gpt":0.24362238565523436,"score_spread":0.21338254598464568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403471969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047200015,0.00087967125,0.9147851,0.0017158348,0.0096544605,0.002556787,0.0052303434,0.0015923168,0.058865514],"genre_scores_gemma":[0.9913693,0.00004506467,0.0066707646,0.00019296614,0.00016782538,0.0001698891,0.0006563237,0.000014206122,0.00071367464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99765897,0.00006115508,0.0011680879,0.0002794186,0.00055093365,0.00028144167],"domain_scores_gemma":[0.99799085,0.00033182176,0.00046945104,0.0009209434,0.00022353847,0.00006338715],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013832131,0.00021052128,0.00028213204,0.00037620927,0.0001518227,0.0012041562,0.0009039534,0.0000760938,5.2609875e-7],"category_scores_gemma":[0.00044006374,0.00017567625,0.00010237098,0.00050101767,0.00005682242,0.0057080006,0.00025262774,0.000097306925,0.000046715122],"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.0002637179,0.000039833547,0.000010199657,0.0010260175,0.00007920244,0.000009262326,0.021914251,0.00027768058,0.000034468474,0.75870126,0.135264,0.08238013],"study_design_scores_gemma":[0.0024579775,0.00088943465,0.000070324015,0.0019895448,0.000016436445,0.0000115972025,0.008820411,0.14580698,0.0006645699,0.0013161718,0.83751005,0.0004464844],"about_ca_topic_score_codex":0.00014009206,"about_ca_topic_score_gemma":0.000009593414,"teacher_disagreement_score":0.9866493,"about_ca_system_score_codex":0.000055125296,"about_ca_system_score_gemma":0.000060226368,"threshold_uncertainty_score":0.9998327},"labels":[],"label_agreement":null},{"id":"W4403486757","doi":"10.3233/faia240991","title":"On Parallel External-Memory Bidirectional Search","year":2024,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Data Management and Algorithms","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 Alberta","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Parallel computing","score_opus":0.04542716143602398,"score_gpt":0.28629372500191125,"score_spread":0.24086656356588726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403486757","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.0000017760971,0.00115068,0.82030886,0.0005607101,0.00060540996,0.00039485487,0.000030588875,0.00009425075,0.17685288],"genre_scores_gemma":[0.0013546345,0.00428115,0.09889105,0.00055469497,0.001185568,0.0005067911,0.00012932927,0.000074863055,0.89302194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845684,0.000008540492,0.0003311821,0.0007025002,0.00028629712,0.00021465916],"domain_scores_gemma":[0.99927086,0.00005138424,0.000056398872,0.0005086912,0.000035056666,0.00007763099],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002116924,0.00021792906,0.00019761335,0.00047362072,0.00013012161,0.00031885348,0.0007070171,0.00012359857,0.000060092734],"category_scores_gemma":[0.0000036593963,0.00022080594,0.00007236109,0.00017773073,0.00014461829,0.00019152107,0.00028062947,0.00040629547,0.0007855956],"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.000002985889,0.00001919276,9.738926e-7,0.000013855354,0.000012192122,0.0000073174087,0.000031476095,0.00023550348,0.0000013694145,0.6349718,0.0035461357,0.36115718],"study_design_scores_gemma":[0.000009421207,0.000031507367,0.0000026604007,0.00009319448,0.000010178009,0.0000020135228,0.000033842647,0.033959944,0.00005668112,0.837465,0.1281196,0.00021593767],"about_ca_topic_score_codex":0.0000146618195,"about_ca_topic_score_gemma":0.000011266777,"teacher_disagreement_score":0.7214178,"about_ca_system_score_codex":0.00006304789,"about_ca_system_score_gemma":0.00003912528,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W4403513002","doi":"10.1145/3681770.3698572","title":"Realistic Trajectory Generation using Simple Probabilistic Language Models","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Trajectory; Probabilistic logic; Computer science; Simple (philosophy); Algorithm; Artificial intelligence","score_opus":0.06612016735095674,"score_gpt":0.2932081473075745,"score_spread":0.22708797995661775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403513002","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.007103224,0.00017334633,0.9861512,0.00009079973,0.0003448959,0.00012858355,0.000008707561,0.00041117074,0.0055880644],"genre_scores_gemma":[0.9010507,0.0000072361236,0.09620408,0.00021251285,0.00035702816,0.000011973687,0.00008822466,0.000013872799,0.002054361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923503,0.000024686506,0.00011996952,0.00030953027,0.00015759544,0.00015318942],"domain_scores_gemma":[0.9995767,0.000024212766,0.0000124134785,0.0003346784,0.00001553609,0.00003649883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018055149,0.00008196233,0.00006518488,0.0000899599,0.00005802904,0.0005436563,0.0003240802,0.000019657757,0.00003773321],"category_scores_gemma":[0.000010238689,0.00006846163,0.000029548693,0.0002652203,0.000013160275,0.0010719025,0.00013571545,0.00004808686,0.000036678186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.9050965e-7,0.00003028502,0.0000014065707,0.00009202049,0.000021737687,0.00009620459,0.00073026563,0.035317488,0.0031127904,0.88114226,0.00901751,0.07043753],"study_design_scores_gemma":[0.000033672553,0.000011084443,0.0000029339474,0.000008268207,0.000009112257,0.000004135644,0.00002198073,0.9871254,0.00016890143,0.011937998,0.00057735323,0.0000991492],"about_ca_topic_score_codex":0.000108740285,"about_ca_topic_score_gemma":0.00003523413,"teacher_disagreement_score":0.9518079,"about_ca_system_score_codex":0.00004121682,"about_ca_system_score_gemma":0.000035063713,"threshold_uncertainty_score":0.524249},"labels":[],"label_agreement":null},{"id":"W4403532159","doi":"10.5194/isprs-annals-x-4-2024-51-2024","title":"Geometry, Topology and p-Adic Numbers in Geospatial Data Modelling, Management and Processing: Review and Future Approaches","year":2024,"lang":"en","type":"article","venue":"ISPRS annals of the photogrammetry, remote sensing and spatial information sciences","topic":"Data Management and Algorithms","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":"Deutsche Forschungsgemeinschaft","keywords":"Geospatial analysis; Topology (electrical circuits); Geometry; Computer science; Mathematics; Geography; Cartography; Combinatorics","score_opus":0.10059758468005499,"score_gpt":0.313896075041476,"score_spread":0.213298490361421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403532159","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.0044205626,0.01673399,0.9666348,0.0105972355,0.0003351057,0.0004923314,0.000021584083,0.000043253956,0.00072110235],"genre_scores_gemma":[0.91652334,0.047434628,0.033943158,0.0018962487,0.00009838192,0.0000010926484,0.000030150572,0.000008084425,0.0000649177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986812,0.00005848654,0.00035789827,0.000369433,0.00029827806,0.0002347104],"domain_scores_gemma":[0.99935603,0.000046977944,0.00015239796,0.00034439424,0.00003636018,0.00006381723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014859497,0.00014918977,0.00022251974,0.00032251465,0.00022047857,0.00075781107,0.00050072814,0.000046449233,8.896722e-7],"category_scores_gemma":[0.00003251516,0.0001033251,0.00002076275,0.0009246466,0.0003873268,0.0013135902,0.0009459492,0.00012414259,4.2959144e-7],"study_design_candidate":"design_other","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.0000019704535,0.0000039507454,0.000044255907,0.00067498203,0.000011597511,0.0000010953049,0.00044143322,0.0000366324,4.4123686e-7,0.00023884833,0.00028888354,0.9982559],"study_design_scores_gemma":[0.00009164006,0.000034644534,0.0004944386,0.00038294372,0.000025678488,0.00002670801,0.00032529462,0.9740046,0.000018731125,0.0010492726,0.023417633,0.00012839885],"about_ca_topic_score_codex":0.015157509,"about_ca_topic_score_gemma":0.001378791,"teacher_disagreement_score":0.9981275,"about_ca_system_score_codex":0.0000040924583,"about_ca_system_score_gemma":0.000024118854,"threshold_uncertainty_score":0.99140066},"labels":[],"label_agreement":null},{"id":"W4403636704","doi":"10.1145/3681769.3698586","title":"Machine Learning Model Specification for Cataloging Spatio-Temporal Models (Demo Paper)","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Programming language; Cataloging; Software engineering; Artificial intelligence; Human–computer interaction; World Wide Web","score_opus":0.04760925276183622,"score_gpt":0.26199836097217066,"score_spread":0.21438910821033444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403636704","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.00006859501,0.00024599666,0.98501456,0.0021090426,0.00020322595,0.00020735536,0.0000142837625,0.00059982,0.011537111],"genre_scores_gemma":[0.5295927,0.000076953074,0.45358703,0.00022553783,0.00012792912,0.00004589711,0.00064579205,0.000018928322,0.01567926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999036,0.000012928485,0.00017157034,0.00041599167,0.00016490187,0.0001985888],"domain_scores_gemma":[0.9995437,0.00004258234,0.000029633828,0.00031489754,0.00002808428,0.000041072544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033199418,0.000108452245,0.00008717299,0.00011420155,0.00012340845,0.0005783892,0.000529658,0.000025899706,0.000016914679],"category_scores_gemma":[0.000009737806,0.000093049,0.000053311684,0.00022342279,0.0000113918,0.002439895,0.00022304662,0.000093339484,0.000058872873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002261261,0.00001649061,0.000020631378,0.00004496063,0.000014211714,0.0000036443114,0.00021979422,0.080894545,0.00005300617,0.74012196,0.0053556976,0.17325282],"study_design_scores_gemma":[0.000081760874,0.000016604028,0.000004391744,0.000011187447,0.0000051408665,9.845685e-7,0.000011057853,0.9041232,0.000057197267,0.053857572,0.041708674,0.00012224082],"about_ca_topic_score_codex":0.00005419845,"about_ca_topic_score_gemma":0.000022640106,"teacher_disagreement_score":0.82322866,"about_ca_system_score_codex":0.000028399101,"about_ca_system_score_gemma":0.000023985978,"threshold_uncertainty_score":0.557742},"labels":[],"label_agreement":null},{"id":"W4403741421","doi":"10.1016/j.omega.2024.103219","title":"Integrating machine learning models to learn potentially non-monotonic preferences for multi-criteria sorting from large-scale assignment examples","year":2024,"lang":"en","type":"article","venue":"Omega","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":18,"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":"Fundamental Research Funds for the Central Universities; China Scholarship Council; Scientific Research Fund of Liaoning Provincial Education Department; Ministry of Education of the People's Republic of China; Humanities and Social Science Fund of Ministry of Education of China; Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Sorting; Computer science; Monotonic function; Scale (ratio); Machine learning; Artificial intelligence; Mathematics; Algorithm","score_opus":0.06573342038570237,"score_gpt":0.295418315511876,"score_spread":0.2296848951261736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403741421","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.013546747,0.000275381,0.983618,0.00028982013,0.0006704338,0.00042824488,0.00007530067,0.00033429818,0.0007617738],"genre_scores_gemma":[0.48147032,0.000022231714,0.51587206,0.000106266976,0.00014590185,0.000108227294,0.00012358373,0.000023300208,0.0021280972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810034,0.00005937344,0.00034595243,0.00075285166,0.00027407115,0.00046738973],"domain_scores_gemma":[0.9993001,0.00012232582,0.00008024551,0.00035066227,0.000041941592,0.00010471796],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006452296,0.00022004425,0.00022677716,0.00016082957,0.00026529562,0.0014739988,0.0008970194,0.00004888357,0.000030632884],"category_scores_gemma":[0.000043978052,0.0001891292,0.00009706588,0.00028563256,0.000013395343,0.001212473,0.00078780146,0.0002188381,0.000054993616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021921709,0.00021297122,0.0004977403,0.00017700715,0.00020177402,0.000033669443,0.011062456,0.009998523,0.012262015,0.010542997,0.001612618,0.9533763],"study_design_scores_gemma":[0.00027467127,0.000109571454,0.00012430886,0.00016754479,0.00001913389,5.47443e-7,0.00042449657,0.9803048,0.0006441709,0.0024621028,0.015217979,0.000250725],"about_ca_topic_score_codex":0.0003313148,"about_ca_topic_score_gemma":0.00024284479,"teacher_disagreement_score":0.9703062,"about_ca_system_score_codex":0.00004839586,"about_ca_system_score_gemma":0.000041238465,"threshold_uncertainty_score":0.99956256},"labels":[],"label_agreement":null},{"id":"W4403963877","doi":"10.48550/arxiv.2410.04350","title":"TIS-DPO: Token-level Importance Sampling for Direct Preference Optimization With Estimated Weights","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Institute for Catastrophic Loss Reduction","keywords":"Preference; Security token; Sampling (signal processing); Statistics; Computer science; Mathematics; Computer network; Telecommunications","score_opus":0.2090452637902154,"score_gpt":0.22210805677221626,"score_spread":0.01306279298200086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403963877","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.009287802,0.00010117902,0.9853404,0.0000827534,0.00057527295,0.0006803091,0.00018115454,0.0005590459,0.0031920678],"genre_scores_gemma":[0.6300984,0.00027145026,0.36408636,0.00006341533,0.00010921128,0.000012471706,0.00049240707,0.000046840272,0.0048194677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782354,0.000033428456,0.00020774534,0.0014391803,0.00012112717,0.0003749641],"domain_scores_gemma":[0.9983155,0.00008846908,0.00022088102,0.0010855686,0.00017461427,0.000114982715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020434838,0.00036392277,0.00031503767,0.00028218862,0.00017460818,0.0004731712,0.001727939,0.00015234608,0.000019146988],"category_scores_gemma":[0.000017579045,0.00035346267,0.00010603458,0.00070574146,0.000060728154,0.00068773696,0.0020609607,0.00031620427,0.000033265955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000372121,0.00006111454,0.0005805784,0.00030592183,0.00018749271,0.00013253017,0.000089308356,0.8755519,0.0000028090667,0.11990057,0.0007203282,0.0024302376],"study_design_scores_gemma":[0.00034753868,0.000062020605,0.0003455693,0.00034509756,0.00013598827,0.0000019409176,0.000011483216,0.97494996,0.00005264351,0.022743281,0.0005131065,0.0004913952],"about_ca_topic_score_codex":0.000052152383,"about_ca_topic_score_gemma":0.000040988234,"teacher_disagreement_score":0.6212541,"about_ca_system_score_codex":0.00015636599,"about_ca_system_score_gemma":0.0001709515,"threshold_uncertainty_score":0.99989176},"labels":[],"label_agreement":null},{"id":"W4404612136","doi":"10.1145/3678717.3691289","title":"Query Compilation based Distributed Morsel-driven Parallel Spatial Query Processing","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Query optimization; Sargable; Query expansion; Spatial query; RDF query language; Web search query; Query by Example; Parallel processing; Parallel computing; Web query classification; Information retrieval; Search engine","score_opus":0.017979051525039914,"score_gpt":0.25114758667003334,"score_spread":0.23316853514499342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404612136","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.0003607596,0.000068912785,0.99387944,0.0021190685,0.00040532107,0.00015691582,0.00004125778,0.00083898957,0.002129315],"genre_scores_gemma":[0.79867256,0.0000064642195,0.19872,0.0004521325,0.00024065534,0.00002683211,0.0008807016,0.00001569279,0.0009849389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883854,0.000032825083,0.00020195705,0.00041704212,0.00028150788,0.00022810533],"domain_scores_gemma":[0.9995027,0.000042296277,0.000038341957,0.0003137985,0.000041970135,0.000060886083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017084139,0.0001354544,0.00011265611,0.00012353393,0.000110701185,0.0009543659,0.00053054944,0.000038059254,0.000052842766],"category_scores_gemma":[0.000009704626,0.000113873095,0.00005197028,0.00046572354,0.000028013155,0.0014295303,0.00020066209,0.000101550264,0.00014493758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016764558,0.00023996693,0.0027681538,0.0004287719,0.00006836883,0.00024469648,0.00029117012,0.019663107,0.00030089475,0.10283473,0.05180587,0.8213375],"study_design_scores_gemma":[0.00015969254,0.000020832684,0.004004383,0.00006203787,0.000008621455,0.0000014304571,0.00000949422,0.9752019,0.0000911929,0.00061090477,0.019661436,0.00016804325],"about_ca_topic_score_codex":0.00007968604,"about_ca_topic_score_gemma":0.000028502975,"teacher_disagreement_score":0.9555388,"about_ca_system_score_codex":0.00004047423,"about_ca_system_score_gemma":0.00007575352,"threshold_uncertainty_score":0.9202972},"labels":[],"label_agreement":null},{"id":"W4404848238","doi":"10.1109/focs61266.2024.00098","title":"Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"McGill University","funders":"National Science Foundation","keywords":"Computer science; Binary number; Graph; Graph theory; Theoretical computer science; Algorithm; Combinatorics; Mathematics; Arithmetic","score_opus":0.021176371067237423,"score_gpt":0.24705088714302964,"score_spread":0.22587451607579223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848238","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.0022448543,0.0022978184,0.9822552,0.0008406067,0.0019097356,0.00029485303,0.000011044386,0.0004728689,0.009672991],"genre_scores_gemma":[0.7336372,0.00065801264,0.18168852,0.0009835958,0.0011737595,0.00022641303,0.00009681949,0.000065718734,0.08146993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992217,0.000009186749,0.00012302116,0.0003272608,0.00012738837,0.00019144556],"domain_scores_gemma":[0.9996073,0.000070105714,0.000017227194,0.000246391,0.000019705682,0.000039218838],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036823435,0.000087038956,0.00008683604,0.00012767337,0.000112614754,0.001543955,0.00034856048,0.000021710055,0.0000054670363],"category_scores_gemma":[0.0000058957507,0.00007006828,0.00003179845,0.00027777327,0.000024090357,0.00093633455,0.00027179072,0.00003991852,0.000034200362],"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.0000015211197,0.000019315832,0.00012951138,0.00038780732,0.000048777227,0.000039952673,0.00013737139,0.000026657965,0.00010697176,0.83567905,0.11392237,0.04950066],"study_design_scores_gemma":[0.00010475307,0.000045168574,0.00005547176,0.00005392906,0.00000937457,0.000007410885,0.000065268054,0.6382816,0.000021443768,0.0025534981,0.35867706,0.00012505853],"about_ca_topic_score_codex":0.000043228487,"about_ca_topic_score_gemma":0.0000028653153,"teacher_disagreement_score":0.8331256,"about_ca_system_score_codex":0.000008328194,"about_ca_system_score_gemma":0.0000134956545,"threshold_uncertainty_score":0.9994925},"labels":[],"label_agreement":null},{"id":"W4404848320","doi":"10.1109/focs61266.2024.00120","title":"Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"National Science Foundation","keywords":"Duality (order theory); Flow (mathematics); Computer science; Algorithm; Mathematics; Mathematical optimization; Discrete mathematics; Geometry","score_opus":0.02647731292047804,"score_gpt":0.29523271375545673,"score_spread":0.2687554008349787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848320","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.0010289081,0.00030402758,0.99317956,0.002136054,0.0006307241,0.00065017416,0.00013900579,0.0004369469,0.001494598],"genre_scores_gemma":[0.0054705716,0.00007085282,0.9779735,0.0015471847,0.0003484025,0.00015334577,0.00050333416,0.00003953657,0.013893222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985497,0.000019836387,0.00022068221,0.00062233186,0.00025944435,0.0003279922],"domain_scores_gemma":[0.99931043,0.00008242628,0.000024755764,0.00042238482,0.000036708723,0.00012327057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004388333,0.00018760773,0.00015858683,0.00012889621,0.00012901364,0.00051392225,0.00055967574,0.000043764638,0.00009162613],"category_scores_gemma":[0.0000114845325,0.00015503707,0.000087755194,0.00035044726,0.00006113318,0.0010871948,0.0004993381,0.00007488243,0.00015680373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007736862,0.000102752354,0.0000694801,0.00012696593,0.00014804519,0.000061957704,0.0003483854,0.000008623126,0.00041872766,0.017148687,0.073967315,0.90759134],"study_design_scores_gemma":[0.00030906987,0.00007116825,0.00014098914,0.000019275229,0.000022332873,0.0000134505,0.00003403941,0.91521263,0.00085501414,0.0032527058,0.07983542,0.00023391355],"about_ca_topic_score_codex":0.000034368197,"about_ca_topic_score_gemma":0.0000058975834,"teacher_disagreement_score":0.915204,"about_ca_system_score_codex":0.000021178701,"about_ca_system_score_gemma":0.000019854708,"threshold_uncertainty_score":0.63222283},"labels":[],"label_agreement":null},{"id":"W4404914989","doi":"10.1109/ismar-adjunct64951.2024.00059","title":"Gander: the Preliminary Design and Evaluation of an AR+Tablet System for Geospatial Analysis","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"Mitacs","keywords":"Geospatial analysis; Computer science; Remote sensing; Geography","score_opus":0.0439134113893441,"score_gpt":0.29712840775197247,"score_spread":0.25321499636262834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404914989","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.0034226081,0.00023988243,0.9951158,0.00024606287,0.00013301597,0.000452407,0.000005507348,0.00007233296,0.00031237185],"genre_scores_gemma":[0.9303697,0.000005153479,0.069223575,0.000018466118,0.000042170024,0.00006359506,0.000022288927,0.000003284308,0.00025177829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991716,0.00011184195,0.00012439686,0.00022892372,0.00027746204,0.00008577477],"domain_scores_gemma":[0.9994227,0.00012943038,0.000030006888,0.00032684536,0.00007146591,0.00001950402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021603643,0.000056200566,0.000088183,0.00011535022,0.00006526604,0.0002795246,0.00032958656,0.000015267437,0.000007692695],"category_scores_gemma":[0.000010281461,0.000033985187,0.00003779231,0.00043547677,0.00001393623,0.0005595539,0.00010762449,0.000019253404,0.0000018290796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000268253,0.000060785635,0.000090115,0.00029406033,0.00089933607,0.000004071739,0.0009781636,0.029158594,0.00008334515,0.08599872,0.0042923535,0.8781136],"study_design_scores_gemma":[0.0001216284,0.0001251812,0.00068558566,0.000011295866,0.0005820589,0.0000011021443,0.0001128889,0.99681705,0.00036389322,0.000932073,0.00019911586,0.000048128677],"about_ca_topic_score_codex":0.000034030978,"about_ca_topic_score_gemma":0.000009276129,"teacher_disagreement_score":0.96765846,"about_ca_system_score_codex":0.000013651522,"about_ca_system_score_gemma":0.0000275994,"threshold_uncertainty_score":0.2695462},"labels":[],"label_agreement":null},{"id":"W4405112553","doi":"10.1016/j.procs.2024.11.088","title":"Evaluating Safe Region Sizes for Accuracy in Approximate Continuous Nearest Neighbour Queries","year":2024,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Nearest neighbour; k-nearest neighbors algorithm; Data mining; Artificial intelligence; Pattern recognition (psychology); Information retrieval","score_opus":0.049995626381539336,"score_gpt":0.33551698660068136,"score_spread":0.28552136021914204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405112553","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.00972551,0.00031888307,0.984664,0.0019048804,0.0018684327,0.0007154558,0.0000037628647,0.0004358898,0.0003631439],"genre_scores_gemma":[0.33755097,0.000040045372,0.6610421,0.00048149578,0.0004638909,0.00018263278,0.0000069869457,0.000018445178,0.00021341999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972267,0.000032136297,0.0003654845,0.0011216477,0.00058553705,0.00066847523],"domain_scores_gemma":[0.9986251,0.0004122237,0.0000989642,0.000573125,0.00017814728,0.00011243056],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016579867,0.0002189636,0.00022266412,0.0004147042,0.00028966417,0.0029581513,0.0023855118,0.000037039827,0.0000023299458],"category_scores_gemma":[0.0003647369,0.00019182132,0.00006135272,0.0019158481,0.00023401683,0.0047559477,0.0012125833,0.00015127585,0.000029321489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008710655,0.000055210203,0.0005657789,0.000288909,0.000007699334,0.000051632618,0.0019195668,0.0004888549,0.00047282726,0.0976938,0.0014504514,0.89699656],"study_design_scores_gemma":[0.00027178225,0.00016541604,0.001114444,0.00018600425,0.000003858612,0.000025175857,0.00002401184,0.9832945,0.0006678019,0.01032509,0.0036447586,0.00027716657],"about_ca_topic_score_codex":0.000018789533,"about_ca_topic_score_gemma":0.000006871488,"teacher_disagreement_score":0.9828056,"about_ca_system_score_codex":0.000079981655,"about_ca_system_score_gemma":0.0003521783,"threshold_uncertainty_score":0.99807686},"labels":[],"label_agreement":null},{"id":"W4405173271","doi":"10.1109/tvcg.2024.3513275","title":"The Census-Stub Graph Invariant Descriptor","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Visualization and Computer Graphics","topic":"Data Management and Algorithms","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; Invariant (physics); Census; Graph; Theoretical computer science; Artificial intelligence; Mathematics; Population; Demography","score_opus":0.02331838280266489,"score_gpt":0.2638073537679133,"score_spread":0.2404889709652484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405173271","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.00023108115,0.00026423237,0.9956033,0.00042437043,0.002716459,0.00017515702,0.000017128456,0.00046506446,0.00010320396],"genre_scores_gemma":[0.9807788,0.0060354457,0.007038464,0.0042506214,0.00040999075,0.00011042386,0.00004682745,0.00007261612,0.0012567911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987704,0.000089495894,0.00022676802,0.00041153532,0.00028170564,0.00022008657],"domain_scores_gemma":[0.9993195,0.00012927735,0.000031389416,0.0003749807,0.00005857492,0.0000862611],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002962599,0.00016938342,0.000100866026,0.0003011668,0.0006220264,0.0015033282,0.00046484958,0.00005477742,0.000004395597],"category_scores_gemma":[0.0000011753667,0.00012511214,0.0000858179,0.0011118996,0.00009094012,0.0006436981,0.000011626078,0.00016777024,0.000018122488],"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.0000028600941,0.000049641996,0.0000024548492,0.000020994416,0.000055143253,0.00000828263,0.00022731065,0.000050590355,0.000003063543,0.9448726,0.0032081364,0.051498882],"study_design_scores_gemma":[0.00015647497,0.00010369752,0.00006695182,0.00004640457,0.000021553504,0.0000121241455,0.000019795973,0.93383235,0.00016387278,0.0048344126,0.06056476,0.00017760038],"about_ca_topic_score_codex":0.000010890473,"about_ca_topic_score_gemma":0.000018361783,"teacher_disagreement_score":0.98856485,"about_ca_system_score_codex":0.0000131532415,"about_ca_system_score_gemma":0.000023359298,"threshold_uncertainty_score":0.99953324},"labels":[],"label_agreement":null},{"id":"W4405692022","doi":"10.1007/s10489-024-05927-8","title":"Efficient strategies for spatial data clustering using topological relations","year":2024,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"National Foundation for Science and Technology Development","keywords":"Computer science; Cluster analysis; Topology (electrical circuits); Spatial analysis; Data mining; Artificial intelligence; Remote sensing; Mathematics","score_opus":0.11480727300849575,"score_gpt":0.3420600388496763,"score_spread":0.22725276584118054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405692022","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.00049201096,0.000115506955,0.99425536,0.00021134384,0.0006477601,0.00028221068,0.000026151003,0.00024654626,0.003723114],"genre_scores_gemma":[0.75308645,0.000006490712,0.24656098,0.00006205515,0.00013998362,0.000020097243,0.000040071383,0.0000069687785,0.00007691158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988647,0.0000086737555,0.00019927468,0.00054885156,0.00015203074,0.00022648278],"domain_scores_gemma":[0.99907297,0.00013757653,0.000027738586,0.0007077386,0.00001727199,0.000036734073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124385,0.00010756861,0.00008897303,0.00007843002,0.00014656047,0.0007079822,0.0014261106,0.000037380807,0.000029379862],"category_scores_gemma":[0.000015682046,0.00009340466,0.000026331943,0.00028293187,0.000056055575,0.00034939597,0.0011567194,0.00009615365,0.00010117352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024338735,0.00001926509,0.0000013036307,0.000028148113,0.000013564637,0.000005629084,0.00017536117,0.042944033,0.00023747227,0.80976176,0.00034359333,0.14646743],"study_design_scores_gemma":[0.000018750236,0.000017234493,0.000007748564,0.000018380075,0.000009772808,0.000002849362,0.00017690317,0.9700961,0.000227601,0.023657702,0.005644685,0.00012224227],"about_ca_topic_score_codex":0.00004090867,"about_ca_topic_score_gemma":0.000016843296,"teacher_disagreement_score":0.9271521,"about_ca_system_score_codex":0.00002733985,"about_ca_system_score_gemma":0.000056597975,"threshold_uncertainty_score":0.6827089},"labels":[],"label_agreement":null},{"id":"W4405908075","doi":"10.1109/tpami.2024.3524180","title":"Efficient Signed Graph Sampling via Balancing &amp; Gershgorin Disc Perfect Alignment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Data Management and Algorithms","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":"Simon Fraser University; York University; College of Veterinarians of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Graph; Graph theory; Algorithm; Computer vision; Combinatorics; Pattern recognition (psychology); Mathematics; Theoretical computer science","score_opus":0.022572477060658368,"score_gpt":0.27460941314012693,"score_spread":0.2520369360794686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405908075","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.003032743,0.0002756544,0.99518657,0.0004060899,0.0005928752,0.00015607859,0.00004519668,0.00022083732,0.00008393179],"genre_scores_gemma":[0.9935047,0.00019345638,0.0056619747,0.0001837904,0.00003664622,0.000028794597,0.00001656223,0.000014711465,0.00035938056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979728,0.00007296366,0.00038126236,0.0008268748,0.00040746195,0.00033865956],"domain_scores_gemma":[0.9990216,0.00015394775,0.000054628337,0.0006039403,0.000028578957,0.00013730081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004627243,0.00028086273,0.00029291713,0.0008116354,0.00026432239,0.0005904117,0.0005267524,0.00004310343,0.00017985924],"category_scores_gemma":[0.0000019622203,0.00023172698,0.0003382258,0.0016603841,0.000048662103,0.00022078345,0.000019198898,0.0002385146,0.00011059329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000390328,0.00013059663,0.00008701366,0.00004973847,0.00070612296,0.000020370973,0.00051570556,0.104334824,0.00066812045,0.00023715197,0.000013537116,0.89323294],"study_design_scores_gemma":[0.00005759398,0.00007594497,0.00017980316,0.00006495637,0.00055610616,0.000008303961,0.000040622228,0.9852007,0.012675407,0.00035328,0.00042000017,0.00036725463],"about_ca_topic_score_codex":0.0007450662,"about_ca_topic_score_gemma":0.00044495857,"teacher_disagreement_score":0.99047196,"about_ca_system_score_codex":0.00005316363,"about_ca_system_score_gemma":0.000011341024,"threshold_uncertainty_score":0.94495517},"labels":[],"label_agreement":null},{"id":"W4406162498","doi":"10.1007/s10619-024-07452-6","title":"Indexing temporal relations for range-duration queries","year":2025,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Data Management and Algorithms","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":"Université de Sherbrooke","funders":"Università degli Studi di Padova","keywords":"Search engine indexing; Computer science; Data structure; Range (aeronautics); Duration (music); Information retrieval; Data mining; Programming language","score_opus":0.02640828025020287,"score_gpt":0.2848948208440601,"score_spread":0.25848654059385723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406162498","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.00067842304,0.00028469943,0.9943663,0.0019082695,0.00015987943,0.00023551795,0.001816469,0.00011501868,0.00043543294],"genre_scores_gemma":[0.5084632,0.00036569452,0.41350865,0.0011785892,0.00020753985,0.00039386482,0.07113906,0.000017362461,0.004726061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993157,0.00002153697,0.00017201602,0.0002531282,0.00007450849,0.00016313212],"domain_scores_gemma":[0.99946433,0.00011538497,0.00005304766,0.00029044654,0.000042092004,0.00003467742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017042569,0.000092236696,0.00010016858,0.000074408745,0.00030119406,0.00021096894,0.00023405212,0.000020534222,0.000007252578],"category_scores_gemma":[0.0001099519,0.00008541193,0.00002714769,0.00026154652,0.00003621555,0.0011336651,0.00020157962,0.000045737223,0.0000045902693],"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.000022066775,0.00005312148,0.01800357,0.000058983,0.000043777945,0.0000038008434,0.00005555782,0.00006483351,0.000015677026,0.85632515,0.109101295,0.016252177],"study_design_scores_gemma":[0.0011137186,0.000036273683,0.018307064,0.00008377077,0.000038404884,0.0000017234375,0.00016300805,0.108963385,0.0000940402,0.009143189,0.8617762,0.00027923143],"about_ca_topic_score_codex":0.00005865975,"about_ca_topic_score_gemma":0.00007725712,"teacher_disagreement_score":0.847182,"about_ca_system_score_codex":0.000011084265,"about_ca_system_score_gemma":0.000033938173,"threshold_uncertainty_score":0.34829974},"labels":[],"label_agreement":null},{"id":"W4406195461","doi":"10.1016/j.trpro.2024.12.227","title":"Understanding Traffic Patterns using Clustered Semantic Trajectories and Local Geographic Units","year":2025,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Data Management and Algorithms","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":"Fonds de recherche du Québec – Nature et technologies; Mitacs","keywords":"Computer science; Transport engineering; Geography; Engineering","score_opus":0.17699123757716012,"score_gpt":0.35227255125766077,"score_spread":0.17528131368050065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406195461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31953913,0.00008159576,0.6793548,0.00036468793,0.00010575833,0.00031015335,0.000014385509,0.000150802,0.000078679346],"genre_scores_gemma":[0.99797046,0.00014164887,0.0016666465,0.000044748536,0.00002145577,0.000019953955,0.00004282984,0.000010273885,0.000081979255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840903,0.00006622945,0.0002261837,0.000411004,0.0004890053,0.0003985315],"domain_scores_gemma":[0.99936986,0.00010796357,0.000034322933,0.00022369277,0.0001777832,0.00008637348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061228446,0.00012276781,0.00013309994,0.0006413197,0.0003379532,0.0003009791,0.00042938083,0.000056166904,0.0000051125303],"category_scores_gemma":[0.000021214499,0.00012122722,0.000024142331,0.00195453,0.00016654214,0.0009821644,0.000035714766,0.00023520752,0.0000019943827],"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.0001059291,0.00031829593,0.12983838,0.0040449277,0.00035437776,0.00027456848,0.013703108,0.0054574013,0.00041303816,0.7787722,0.0011563817,0.0655614],"study_design_scores_gemma":[0.002320458,0.00022928226,0.28572497,0.0007629278,0.000075451135,0.0000030632414,0.009361027,0.6887977,0.00040480608,0.010969199,0.0007231353,0.00062796805],"about_ca_topic_score_codex":0.00014532915,"about_ca_topic_score_gemma":0.00091390754,"teacher_disagreement_score":0.767803,"about_ca_system_score_codex":0.000053727064,"about_ca_system_score_gemma":0.00013661847,"threshold_uncertainty_score":0.49435025},"labels":[],"label_agreement":null},{"id":"W4406206083","doi":"10.4230/lipics.icdt.2024.15","title":"Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Data Management and Algorithms","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":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Computer science; Conjunctive query; Theoretical computer science; Artificial intelligence; Information retrieval; Relational database","score_opus":0.02464285751339443,"score_gpt":0.2679624310476123,"score_spread":0.24331957353421788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406206083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10186404,0.0004451875,0.83639085,0.0050290795,0.006795802,0.0076019606,0.0022074108,0.0014180559,0.03824761],"genre_scores_gemma":[0.9810436,0.00005749109,0.016551437,0.00096803764,0.00012724817,0.00037554943,0.0002941792,0.00003875624,0.00054373953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977334,0.000054339784,0.0008233701,0.00036074853,0.0005463739,0.00048176156],"domain_scores_gemma":[0.9978569,0.00043374277,0.00022231198,0.0011941909,0.00020589195,0.00008693427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009811937,0.0003269615,0.00034557647,0.00022650042,0.00023510902,0.00071562646,0.0016705443,0.00009333023,0.000012865649],"category_scores_gemma":[0.00018552515,0.00021075274,0.00025604034,0.000647259,0.00035020843,0.0020712938,0.0005023173,0.0003355744,0.000084649044],"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.00007029455,0.000334662,0.00031660896,0.0016357212,0.00026192283,0.000004331524,0.008394965,0.0001002102,0.000009761136,0.9173837,0.00807838,0.06340949],"study_design_scores_gemma":[0.002570703,0.0018474851,0.0022233033,0.0009441671,0.0001901325,0.000034812114,0.003292918,0.57430816,0.0019645717,0.12771134,0.2835874,0.0013249941],"about_ca_topic_score_codex":0.000011183604,"about_ca_topic_score_gemma":0.000007986419,"teacher_disagreement_score":0.87917954,"about_ca_system_score_codex":0.00007205011,"about_ca_system_score_gemma":0.00007714945,"threshold_uncertainty_score":0.85942477},"labels":[],"label_agreement":null},{"id":"W4406460507","doi":"10.1109/bigdata62323.2024.10825523","title":"Scalable Big Spatial Data Processing with SQL Query Compilation and Distributed Morsel-driven Parallelism","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Scalability; SQL; Parallel computing; Parallelism (grammar); Spatial query; Query by Example; Query optimization; Sargable; Big data; Query language; Database; Programming language; Web search query; Information retrieval; Operating system; Search engine","score_opus":0.03632082855626306,"score_gpt":0.25692752069968505,"score_spread":0.220606692143422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406460507","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.0010792521,0.00016401794,0.99554044,0.0014053537,0.00015679961,0.00013019111,0.00014213288,0.00034169742,0.0010401175],"genre_scores_gemma":[0.83234257,0.000057031837,0.16263397,0.00019342366,0.00027651453,0.000011493696,0.0030401174,0.000016610984,0.0014282982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989848,0.000016202046,0.00012386034,0.00049469585,0.00020873734,0.00017166621],"domain_scores_gemma":[0.9993627,0.000022085544,0.000028158813,0.00050705875,0.000027833647,0.000052142546],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00015115277,0.00010658278,0.00009516701,0.00006758109,0.000108343884,0.0012077199,0.00065054296,0.000022831819,0.000010850952],"category_scores_gemma":[0.000005205094,0.000076291726,0.000007533768,0.00035257387,0.00004156525,0.0020168282,0.0007648949,0.00007402142,0.000018106235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009990715,0.000066692024,0.0032435663,0.00021425285,0.000055310506,0.00009912149,0.00020933698,0.000596882,0.000059644255,0.018740898,0.02001869,0.9566856],"study_design_scores_gemma":[0.00016414904,0.000026088468,0.004168728,0.000071811344,0.000013561821,0.000007281277,0.000018026867,0.96830785,0.00002507429,0.00032922902,0.026732516,0.00013571142],"about_ca_topic_score_codex":0.00011800017,"about_ca_topic_score_gemma":0.00008917889,"teacher_disagreement_score":0.9677109,"about_ca_system_score_codex":0.000011585041,"about_ca_system_score_gemma":0.000043198994,"threshold_uncertainty_score":0.9998291},"labels":[],"label_agreement":null},{"id":"W4406523973","doi":"10.1109/tits.2024.3516956","title":"Elevation-Aware Map Matching Model Leveraging Transfer Learning in Sparse Data Conditions","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Data Management and Algorithms","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":"Computer science; Transfer of learning; Elevation (ballistics); Artificial intelligence; Map matching; Matching (statistics); Computer vision; Engineering; Mathematics; Global Positioning System; Telecommunications; Statistics","score_opus":0.055004626816275916,"score_gpt":0.29345577014528507,"score_spread":0.23845114332900916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406523973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00584405,0.00005462423,0.9906336,0.0005002695,0.0014516104,0.0006347151,0.00026165848,0.0003767934,0.00024270045],"genre_scores_gemma":[0.99461454,0.00009840284,0.0020972404,0.00016729327,0.000021876109,0.00015704507,0.00051595876,0.000021398368,0.002306252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974729,0.000108145185,0.0008383325,0.00079618586,0.0004357314,0.00034873985],"domain_scores_gemma":[0.99873686,0.00013673257,0.0000751696,0.00087549776,0.00010073857,0.000074981224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005409139,0.0002750018,0.00029227798,0.0008069524,0.00034051787,0.00033215873,0.0011347008,0.000100016994,0.00003083541],"category_scores_gemma":[0.000001972548,0.0003044536,0.00009555552,0.0009455753,0.00003378959,0.0018438181,0.0000027274518,0.00045526001,0.00006882149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012319096,0.00016100654,0.0001051799,0.0001510275,0.000071699425,0.000012396429,0.0014858192,0.9777467,0.00014117503,0.013331552,0.00019618866,0.0065849],"study_design_scores_gemma":[0.00047410943,0.000024113078,0.00023231858,0.00042237705,0.000052514322,0.000001203054,0.0012078831,0.9935005,0.0013617747,0.0007414817,0.0016618677,0.00031988538],"about_ca_topic_score_codex":0.00036849186,"about_ca_topic_score_gemma":0.0004202795,"teacher_disagreement_score":0.9887705,"about_ca_system_score_codex":0.000114916926,"about_ca_system_score_gemma":0.00012226388,"threshold_uncertainty_score":0.99994075},"labels":[],"label_agreement":null},{"id":"W4406785293","doi":"10.48550/arxiv.2501.13274","title":"T-Graphormer: Using Transformers for Spatiotemporal Forecasting","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Data Management and Algorithms","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":"Fonds de recherche du Québec – Nature et technologies; Alliance de recherche numérique du Canada","keywords":"Transformer; Computer science; Engineering; Electrical engineering; Voltage","score_opus":0.14765918188500718,"score_gpt":0.3131391285356081,"score_spread":0.16547994665060092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406785293","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.07654178,0.00016691523,0.91738635,0.00054359576,0.0020692663,0.00084955717,0.000114341565,0.00021674726,0.0021114484],"genre_scores_gemma":[0.6193462,0.00017750246,0.3754347,0.00084592466,0.0007006625,0.00023580714,0.00063281046,0.00005583353,0.0025705819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793655,0.000033209082,0.00044634833,0.0008570555,0.00024111175,0.00048572363],"domain_scores_gemma":[0.99889034,0.00007515962,0.00022793874,0.0006213355,0.00010242447,0.00008280626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046846372,0.00034001714,0.0003611969,0.0003367333,0.00024381562,0.000283945,0.0013993793,0.00018018342,0.0000070686297],"category_scores_gemma":[0.000039404942,0.00034926026,0.00029889593,0.00038433872,0.00004746671,0.00065289834,0.0010860394,0.00034446936,0.0000069247953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052087566,0.00026395274,0.120671645,0.0029645239,0.00085522234,0.000053876967,0.0013866848,0.0023552887,0.00022399225,0.0075917672,0.0065648537,0.8570161],"study_design_scores_gemma":[0.00080017484,0.00007923452,0.0041916794,0.00057835045,0.00015671762,0.0000028164252,0.00007848323,0.9656734,0.0012589195,0.0039732615,0.022291603,0.0009153961],"about_ca_topic_score_codex":0.00020551108,"about_ca_topic_score_gemma":0.000031848114,"teacher_disagreement_score":0.96331805,"about_ca_system_score_codex":0.000071580966,"about_ca_system_score_gemma":0.00017964309,"threshold_uncertainty_score":0.99989593},"labels":[],"label_agreement":null},{"id":"W4407086046","doi":"10.3390/ijgi14020058","title":"A Novel Context-Aware Douglas–Peucker (CADP) Trajectory Compression Method","year":2025,"lang":"en","type":"article","venue":"ISPRS International Journal of Geo-Information","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"","keywords":"Trajectory; Computer science; Scalability; Context (archaeology); Piecewise; Robustness (evolution); Segmentation; Artificial intelligence; Algorithm; Mathematics","score_opus":0.009724316283204451,"score_gpt":0.29348982257214606,"score_spread":0.2837655062889416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407086046","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.00050724135,0.00005444999,0.98498017,0.0033887438,0.0067642955,0.00011598241,0.000032317203,0.000043951026,0.0041128476],"genre_scores_gemma":[0.62143624,0.0002014553,0.3623769,0.013129497,0.0011980499,0.000019330175,0.00023517925,0.000014237096,0.0013891071],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816203,0.00004826771,0.0007584044,0.000102468875,0.0007685116,0.0001603209],"domain_scores_gemma":[0.9981064,0.00011213024,0.0006399345,0.00022775956,0.00085217546,0.000061565755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198592,0.00014194532,0.00018978493,0.00074499124,0.000100363024,0.00061183027,0.0017445147,0.00006579674,0.000050145056],"category_scores_gemma":[0.000102654645,0.000120930905,0.00014417387,0.000262089,0.000026194448,0.008735641,0.00037308867,0.0002545379,0.000056767567],"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.0001429648,0.00014691219,0.00040653354,0.00004113101,0.00039904812,0.000014751551,0.0011945583,0.0017158042,0.00032244585,0.11767524,0.07346899,0.8044716],"study_design_scores_gemma":[0.0037286603,0.00010813179,0.008831168,0.00042241238,0.00004483445,0.00012661377,0.00057601597,0.21177179,0.0020677522,0.0031033533,0.768919,0.00030027167],"about_ca_topic_score_codex":0.00004617354,"about_ca_topic_score_gemma":0.0000041417993,"teacher_disagreement_score":0.8041714,"about_ca_system_score_codex":0.00014000613,"about_ca_system_score_gemma":0.00012523428,"threshold_uncertainty_score":0.6333129},"labels":[],"label_agreement":null},{"id":"W4407189050","doi":"10.1007/978-3-031-82670-2_18","title":"Representing Hypergraphs by Point-Line Incidences","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Saskatchewan","funders":"","keywords":"Computer science; Point (geometry); Line (geometry); Theoretical computer science; Mathematics; Geometry","score_opus":0.013225429642853382,"score_gpt":0.24809922291847442,"score_spread":0.23487379327562102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407189050","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.000016737318,0.0011032164,0.9796469,0.0016865492,0.0020669557,0.00032137855,0.000014395538,0.00024886997,0.014894977],"genre_scores_gemma":[0.017492991,0.00056577835,0.95360106,0.0054719714,0.00086669734,0.000023954288,0.000074107535,0.000052593998,0.021850815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954672,0.0000337535,0.0006003641,0.0020618315,0.0011190852,0.00071778195],"domain_scores_gemma":[0.9971128,0.00041106762,0.00030813366,0.0018501745,0.00018366412,0.00013416109],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012245696,0.0004894121,0.0005105964,0.00092374714,0.0003572155,0.001731853,0.006334791,0.0002131583,0.0000333123],"category_scores_gemma":[0.00017471856,0.00048340907,0.00015044796,0.0011863215,0.0005609727,0.0015755395,0.0045205224,0.0006926441,0.000038298716],"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.0000016773516,0.000026789527,0.00007966106,0.00004396587,0.000019535262,0.00012136621,0.00010862904,0.0014118069,0.000057210214,0.016516868,0.0023685016,0.979244],"study_design_scores_gemma":[0.00035149907,0.00013709703,0.000046268317,0.0009510288,0.000021604628,0.000041574913,4.1501002e-7,0.6975201,0.0012724053,0.2741019,0.024361903,0.0011941902],"about_ca_topic_score_codex":0.00013751035,"about_ca_topic_score_gemma":0.00011074836,"teacher_disagreement_score":0.9780498,"about_ca_system_score_codex":0.000114063536,"about_ca_system_score_gemma":0.00026408886,"threshold_uncertainty_score":0.99976176},"labels":[],"label_agreement":null},{"id":"W4407277142","doi":"10.1145/3716825","title":"Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Spatial Algorithms and Systems","topic":"Data Management and Algorithms","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 Fredericton; University of New Brunswick","funders":"","keywords":"Nearest neighbor search; Metric (unit); Similarity (geometry); Range (aeronautics); Trajectory; Index (typography); Tree (set theory); Computer science; Metric space; Range query (database); Cover tree; Mathematics; Algorithm; Theoretical computer science; Data mining; Combinatorics; Discrete mathematics; Artificial intelligence; Information retrieval; Search engine; Physics; Web search query; World Wide Web; Materials science","score_opus":0.02446961917894443,"score_gpt":0.27160186745058723,"score_spread":0.2471322482716428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407277142","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.011450575,0.00031391892,0.9860128,0.00038208946,0.00055990333,0.00091485155,0.000098381584,0.0001363545,0.00013108978],"genre_scores_gemma":[0.97761005,0.00009965716,0.021323945,0.000080980826,0.00008490494,0.00019734504,0.000016170472,0.000016528182,0.0005704213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982409,0.00011568153,0.00027813262,0.0006637359,0.00036277072,0.00033877027],"domain_scores_gemma":[0.99874157,0.00024425384,0.00005814565,0.00069615763,0.0001196959,0.00014019494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895359,0.0002457608,0.0003331036,0.00052094593,0.0005102167,0.0005974612,0.0005315906,0.000094333394,0.0000034430618],"category_scores_gemma":[0.000014090374,0.0001960307,0.000053619933,0.0007151955,0.000110257555,0.00051551795,0.000038861344,0.0001931488,0.0000011967293],"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.00016547226,0.0004774339,0.0010355874,0.00039068772,0.0002359793,0.000017659911,0.00078467536,0.0052337055,0.000029718123,0.002943758,0.00007705136,0.9886083],"study_design_scores_gemma":[0.0020507989,0.0008566744,0.014288349,0.00010307981,0.00007535868,0.000013007036,0.00060417154,0.97877383,0.00016929736,0.00011049342,0.0025765386,0.00037839176],"about_ca_topic_score_codex":0.0020107536,"about_ca_topic_score_gemma":0.00045975327,"teacher_disagreement_score":0.9882299,"about_ca_system_score_codex":0.000044586144,"about_ca_system_score_gemma":0.00006612855,"threshold_uncertainty_score":0.79939},"labels":[],"label_agreement":null},{"id":"W4407694635","doi":"10.1016/j.comgeo.2025.102172","title":"Approximating average bounded-angle minimum spanning trees","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","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":"University of British Columbia; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Minimum spanning tree; Mathematics; Spanning tree; Combinatorics; Mathematical analysis","score_opus":0.014400568408841604,"score_gpt":0.2617562545055416,"score_spread":0.24735568609669997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407694635","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.0095349355,0.0001933945,0.9718748,0.00076392834,0.0005352147,0.00011753279,0.000006167238,0.00022773874,0.016746286],"genre_scores_gemma":[0.51572716,0.0000025710933,0.47899908,0.0010829716,0.00010668511,0.000014880591,0.00009728718,0.00000834136,0.0039610174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.000033991724,0.00028072778,0.00040102334,0.00032885012,0.00025190017],"domain_scores_gemma":[0.9992222,0.00024149862,0.00009279338,0.00031882987,0.000077137534,0.000047512753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032451304,0.00013610364,0.00015429892,0.00046484557,0.00024933755,0.000538778,0.00087849,0.000035954454,0.000026540412],"category_scores_gemma":[0.00008579709,0.00014156302,0.00006568689,0.0013063557,0.000040156454,0.0007377812,0.0006755563,0.00011352298,0.00009420637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004866914,0.0001832353,0.002973994,0.00009973883,0.00013701405,0.00003489659,0.00030731328,0.06071165,0.000041584095,0.61902803,0.017690513,0.29878718],"study_design_scores_gemma":[0.00035402985,0.00001888641,0.010169134,0.00004717586,0.0000070525307,0.000002915219,0.00004248523,0.90255517,0.00004734696,0.07818023,0.008398482,0.00017707533],"about_ca_topic_score_codex":0.0000058767937,"about_ca_topic_score_gemma":7.1400865e-7,"teacher_disagreement_score":0.84184355,"about_ca_system_score_codex":0.000042043353,"about_ca_system_score_gemma":0.00006065303,"threshold_uncertainty_score":0.57727724},"labels":[],"label_agreement":null},{"id":"W4407718984","doi":"10.1016/j.jag.2025.104400","title":"Efficient management of ubiquitous location information using geospatial grid region name","year":2025,"lang":"en","type":"article","venue":"International Journal of Applied Earth Observation and Geoinformation","topic":"Data Management and Algorithms","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":"3v Geomatics (Canada)","funders":"National Key Research and Development Program of China; Fuzhou University; Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Geospatial analysis; Geography; Grid; Geospatial PDF; Cartography; Data science; Computer science","score_opus":0.012664202562075426,"score_gpt":0.23579968046636537,"score_spread":0.22313547790428995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407718984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11460485,0.000027112468,0.8814163,0.0006580447,0.0010806677,0.00021113294,0.000003568004,0.00002288875,0.0019754132],"genre_scores_gemma":[0.92549443,0.00013414596,0.073530056,0.00059013924,0.0001009792,0.000005113508,0.00008449473,0.0000032401801,0.00005742201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984579,0.000012369941,0.00080409757,0.000081681545,0.0005424474,0.000101486985],"domain_scores_gemma":[0.99821436,0.000023016712,0.00085883314,0.00015306396,0.00071844645,0.00003225239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043102077,0.000102719314,0.00013250537,0.00049679354,0.00006780409,0.00021936759,0.00045542786,0.000044789595,0.0000037973173],"category_scores_gemma":[0.000016464639,0.000098358956,0.00004211618,0.0003874305,0.000021443573,0.0019667016,0.00017230358,0.00008426721,0.0000055877363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015674623,0.00007532775,0.00034424933,0.00021557508,0.00019490217,0.0000033011443,0.0012481493,0.14658776,0.000079760604,0.23734829,0.0004907969,0.61325514],"study_design_scores_gemma":[0.0016170611,0.000051861283,0.029053088,0.000271929,0.000038203634,0.000016286145,0.00048309992,0.95418566,0.00083814305,0.0021958484,0.011104755,0.0001440838],"about_ca_topic_score_codex":0.00001433262,"about_ca_topic_score_gemma":0.0000012220958,"teacher_disagreement_score":0.81088954,"about_ca_system_score_codex":0.00006936977,"about_ca_system_score_gemma":0.00005759011,"threshold_uncertainty_score":0.4010962},"labels":[],"label_agreement":null},{"id":"W4407924522","doi":"10.1016/j.cstp.2025.101399","title":"Unveiling Route Choice Preferences and Classifying Travelers Based on Distinct Travel Patterns Using Trajectory Data","year":2025,"lang":"en","type":"article","venue":"Case Studies on Transport Policy","topic":"Data Management and Algorithms","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":"University of Waterloo; University of Toronto","funders":"Tongji University; National Natural Science Foundation of China","keywords":"Computer science; Trajectory; Operations research; Transport engineering; Data mining; Engineering","score_opus":0.12727698713095956,"score_gpt":0.3623982295108463,"score_spread":0.23512124237988677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407924522","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.7755901,0.00040123728,0.2149818,0.0014881166,0.0009155258,0.00067323906,0.00087229087,0.0002820618,0.004795644],"genre_scores_gemma":[0.9963166,0.000107777974,0.0022640035,0.00088533224,0.00016161574,0.000014652575,0.0000897361,0.000013975795,0.00014627978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979147,0.00006325279,0.00039598762,0.0009355055,0.00026714054,0.00042342558],"domain_scores_gemma":[0.99843985,0.00027291063,0.00010935503,0.0010380062,0.000039241717,0.00010062437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037267682,0.00033605995,0.0003794681,0.00040511365,0.0004537488,0.000121224926,0.00087300234,0.000053884993,0.0000030959102],"category_scores_gemma":[0.000072279916,0.00029310657,0.00006373776,0.00056945777,0.00013965218,0.00061231194,0.00016031691,0.00022309394,0.0000020443642],"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.00029888452,0.0017561382,0.121093534,0.0052468055,0.002979667,0.011917209,0.013774365,0.0074418834,0.00033296886,0.052489527,0.0016518895,0.7810171],"study_design_scores_gemma":[0.0047717346,0.0005697427,0.2938862,0.002150931,0.0006294342,0.0000941965,0.0041358746,0.6862648,0.0007331941,0.00043294887,0.0043077995,0.0020230976],"about_ca_topic_score_codex":0.0006384576,"about_ca_topic_score_gemma":0.00093279796,"teacher_disagreement_score":0.778994,"about_ca_system_score_codex":0.000093114126,"about_ca_system_score_gemma":0.00015409647,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W4407953359","doi":"10.1145/3701551.3703480","title":"Query Performance Prediction: Theory, Techniques and Applications","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Data mining","score_opus":0.004753132183198136,"score_gpt":0.22032447132221142,"score_spread":0.21557133913901327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407953359","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.000070024,0.00006853615,0.8080107,0.00046322227,0.00003865441,0.00012643731,0.0000011842543,0.00031457044,0.19090666],"genre_scores_gemma":[0.21379626,0.0023349556,0.5630084,0.0035849628,0.00051094114,0.0012179903,0.0000426432,0.000014135415,0.21548969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996662,0.000007874315,0.00006272174,0.00015435438,0.00004600177,0.00006282085],"domain_scores_gemma":[0.9996556,0.000016785694,0.000010716453,0.00028942208,0.000014266413,0.000013191462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015722043,0.000039016413,0.000033587137,0.000066824665,0.00009231054,0.00011956523,0.00030491568,0.000013502405,0.0000079565125],"category_scores_gemma":[0.0000013281308,0.000032306612,0.0000072594553,0.00021174559,0.000025666623,0.0005390899,0.00026259333,0.00003047189,0.000009291509],"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":[2.3745518e-7,0.000005461515,0.0002888448,0.000006571601,0.0000025854943,1.2651365e-7,0.0000038423186,1.2686914e-7,0.000003214346,0.54042596,0.0020550848,0.45720798],"study_design_scores_gemma":[0.00008654018,0.000024473651,0.0025995227,0.000016611693,0.0000056813687,0.0000029542855,0.00001717887,0.016272439,0.0020174186,0.037350476,0.9415283,0.00007835474],"about_ca_topic_score_codex":0.0000016709959,"about_ca_topic_score_gemma":3.148483e-7,"teacher_disagreement_score":0.9394733,"about_ca_system_score_codex":0.0000051908155,"about_ca_system_score_gemma":0.000008178403,"threshold_uncertainty_score":0.13174255},"labels":[],"label_agreement":null},{"id":"W4407973770","doi":"10.2139/ssrn.5081944","title":"Learning and Uncertainty in Spatial Resource Management &lt;br&gt;","year":2025,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Resource (disambiguation); Environmental resource management; Computer science; Environmental science","score_opus":0.0038257941207572163,"score_gpt":0.2227181784823419,"score_spread":0.2188923843615847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407973770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02196884,0.002725273,0.92150414,0.004749319,0.00036572348,0.00029455376,5.804253e-7,0.00012758166,0.04826396],"genre_scores_gemma":[0.97457725,0.0043023285,0.0021234392,0.00029068923,0.00011309376,0.0000085800475,0.0000052174396,0.000010555085,0.018568823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789184,0.00010603165,0.00022181001,0.0003015476,0.00022026125,0.0012585141],"domain_scores_gemma":[0.99964267,0.000032938344,0.000075628996,0.00019006274,0.000017659939,0.000041045332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016891102,0.00012511596,0.00013112748,0.0003377877,0.00020125562,0.00028061055,0.00067182624,0.000032517077,0.000004892246],"category_scores_gemma":[0.000019391291,0.000116916584,0.000037098725,0.00044852286,0.000027407683,0.00034885938,0.00049485266,0.0009776955,0.000008599983],"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.000010092652,0.000022636379,0.0007056255,0.000009339482,0.000041135154,0.000017885943,0.00006099701,0.0002405317,0.00000937413,0.41206384,0.00019938285,0.58661914],"study_design_scores_gemma":[0.004117016,0.000578578,0.009871717,0.00023473086,0.000066901215,0.00012695862,0.0027196798,0.07895036,0.000024115769,0.53652847,0.36609542,0.0006860629],"about_ca_topic_score_codex":0.000050115897,"about_ca_topic_score_gemma":0.0004687131,"teacher_disagreement_score":0.9526084,"about_ca_system_score_codex":0.00035196505,"about_ca_system_score_gemma":0.0001807908,"threshold_uncertainty_score":0.476772},"labels":[],"label_agreement":null},{"id":"W4408061162","doi":"10.14778/3705829.3705830","title":"RED: Effective Trajectory Representation Learning with Comprehensive Information","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Trajectory; Representation (politics); Computer science; Artificial intelligence; Human–computer interaction; Political science; Physics; Politics","score_opus":0.00837476942388125,"score_gpt":0.22392301270177595,"score_spread":0.2155482432778947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408061162","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.50482297,0.0010483109,0.30609658,0.012289286,0.0039993245,0.008744637,0.00002257394,0.0027657133,0.1602106],"genre_scores_gemma":[0.99161595,0.000031390922,0.0077938302,0.00008765902,0.00004694363,0.00009178045,0.000004958463,0.0000065005133,0.00032097983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918926,0.000008761836,0.00015242465,0.00018225826,0.00033949007,0.0001278246],"domain_scores_gemma":[0.99960095,0.000043033066,0.000111518326,0.0001022394,0.00011978534,0.000022488197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015877608,0.00009620791,0.000093263916,0.00012075528,0.00008824639,0.00030655164,0.00045676983,0.000017122982,0.0000033134613],"category_scores_gemma":[0.000023445611,0.000060406554,0.00004611606,0.0005008037,0.000034420314,0.002183919,0.00029361848,0.00013057487,0.000014051015],"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.00011139493,0.00013040379,0.0047144457,0.0015957385,0.000576887,0.0000062074128,0.016582046,0.0029343327,0.02219659,0.22430067,0.021517243,0.70533407],"study_design_scores_gemma":[0.003112573,0.001867511,0.06459003,0.0020825483,0.00029530784,0.00008982325,0.0065757865,0.36436224,0.33117238,0.012997905,0.21163271,0.0012211954],"about_ca_topic_score_codex":0.000020865606,"about_ca_topic_score_gemma":3.3791656e-7,"teacher_disagreement_score":0.7041128,"about_ca_system_score_codex":0.000051598316,"about_ca_system_score_gemma":0.000011564071,"threshold_uncertainty_score":0.29560846},"labels":[],"label_agreement":null},{"id":"W4408401921","doi":"10.1109/icftic64248.2024.10913131","title":"A Modular Agent-Based Approach to Complex Data Question-Answering with SQL Generation and Parameter-Efficient Fine-Tuning","year":2024,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Modular design; Computer science; SQL; Question answering; Stored procedure; Programming language; Artificial intelligence; Database; Information retrieval; Query by Example; Search engine","score_opus":0.09667619869056282,"score_gpt":0.288333229888341,"score_spread":0.19165703119777816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408401921","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.009650783,0.00006649794,0.9881554,0.00064229034,0.00012738965,0.00025359733,0.0000218859,0.0002748282,0.0008072891],"genre_scores_gemma":[0.40884572,0.0000013887042,0.5902909,0.0002394373,0.00005876388,0.00001836943,0.00032135032,0.00000882655,0.00021526532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986976,0.00003410539,0.00013468758,0.0006936686,0.00025060165,0.00018936119],"domain_scores_gemma":[0.9990013,0.00002937488,0.00001823536,0.00084703724,0.000021967237,0.00008206934],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00037048195,0.00012866473,0.000099589306,0.00015070471,0.00010819287,0.0011608901,0.00069900905,0.000016641105,0.0000067407236],"category_scores_gemma":[0.000013862085,0.00009999988,0.000011907608,0.00042277406,0.000020518819,0.0005796844,0.00062273146,0.0000606481,0.000011070954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001001237,0.00030789693,0.00016386776,0.0002816267,0.00012809207,0.00009588432,0.00063993875,0.4768947,0.006488941,0.16795836,0.012945653,0.33408502],"study_design_scores_gemma":[0.00011696009,0.000048312573,0.00018727509,0.000031346815,0.000011890494,0.000004189931,0.000014455315,0.99276525,0.0001429451,0.000022113572,0.006495678,0.00015956545],"about_ca_topic_score_codex":0.00006430358,"about_ca_topic_score_gemma":0.00001514266,"teacher_disagreement_score":0.5158706,"about_ca_system_score_codex":0.000019437788,"about_ca_system_score_gemma":0.00002281115,"threshold_uncertainty_score":0.999876},"labels":[],"label_agreement":null},{"id":"W4408429872","doi":"10.5194/egusphere-egu25-14940","title":"Evaluation the suitability of contrasting performance metrics and signature measures with the identifiability quote index","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"Identifiability; Signature (topology); Index (typography); Statistics; Mathematics; Computer science; Econometrics; World Wide Web","score_opus":0.03165842985264215,"score_gpt":0.27016410818721676,"score_spread":0.2385056783345746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408429872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13156912,0.001239808,0.8585356,0.002360127,0.0005384859,0.0021132275,0.000033136996,0.000090441645,0.0035200897],"genre_scores_gemma":[0.9967049,0.000050002574,0.002869529,0.000079983096,0.0000296886,0.00005817886,0.000009318033,0.0000029992016,0.00019544722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971733,0.0004668383,0.00030444807,0.0005911308,0.0012826581,0.000181596],"domain_scores_gemma":[0.9967976,0.0006405293,0.00028074768,0.0014417925,0.0008149397,0.00002435997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010947511,0.00019748945,0.00024629373,0.000108383436,0.0002239636,0.00044730993,0.0018173293,0.00009870578,0.0000063095345],"category_scores_gemma":[0.00065263326,0.000093282644,0.000053426735,0.00076697144,0.000202077,0.00041861986,0.002412069,0.0005457157,3.5749164e-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.00002798554,0.00013691548,0.04296808,0.00093014655,0.0004140658,5.2414333e-7,0.0013217535,0.009682311,0.000021437349,0.0056736963,0.00095923094,0.9378638],"study_design_scores_gemma":[0.00022842166,0.000030888783,0.13770479,0.00007787329,0.00017013919,4.2176163e-7,0.00014230124,0.85724676,0.00026043007,0.0037165617,0.00026772046,0.00015369449],"about_ca_topic_score_codex":0.00017893057,"about_ca_topic_score_gemma":0.00014793866,"teacher_disagreement_score":0.93771017,"about_ca_system_score_codex":0.00006030521,"about_ca_system_score_gemma":0.00024798955,"threshold_uncertainty_score":0.431342},"labels":[],"label_agreement":null},{"id":"W4408439263","doi":"10.5194/egusphere-egu25-5476","title":"Tracking Air Pollution: Global Near Real-Time Fire PM2.5 Retrievals from Multisource Data Fusion","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"Environmental science; Tracking (education); Air pollution; Fusion; Remote sensing; Sensor fusion; Meteorology; Pollution; Computer science; Geography; Artificial intelligence","score_opus":0.0393983557257031,"score_gpt":0.29781036345746886,"score_spread":0.25841200773176576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408439263","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.004879407,0.00076646416,0.9109843,0.011703323,0.004579154,0.0013513203,0.011288291,0.002550907,0.05189686],"genre_scores_gemma":[0.04490684,0.0014045923,0.8956779,0.003304794,0.0016289055,0.000028041333,0.02082724,0.0000469645,0.0321747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995836,0.00016832358,0.00059169665,0.0021510324,0.00077313074,0.00047979856],"domain_scores_gemma":[0.99352,0.00010037621,0.00029887224,0.0058315797,0.00010413928,0.0001450298],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00070503587,0.00046800746,0.00052525534,0.00007591015,0.00033515875,0.001383996,0.008904141,0.00034487297,0.00026289327],"category_scores_gemma":[0.00013565595,0.00045246337,0.00014234519,0.00068339234,0.00007581264,0.0013589569,0.032413095,0.0004328058,0.0003952788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002932536,0.00022351868,0.000253281,0.00016209339,0.00029416493,0.00012968681,0.00024778864,0.0033349623,0.000042622887,0.004732707,0.31426883,0.67628103],"study_design_scores_gemma":[0.0004896094,0.000024749816,0.0077683795,0.0004644501,0.00009158726,0.0000021544158,0.000025295367,0.8912341,0.000057432164,0.0030420665,0.09608804,0.0007121584],"about_ca_topic_score_codex":0.004495415,"about_ca_topic_score_gemma":0.00006554755,"teacher_disagreement_score":0.8878991,"about_ca_system_score_codex":0.00017469734,"about_ca_system_score_gemma":0.00026150595,"threshold_uncertainty_score":0.9997927},"labels":[],"label_agreement":null},{"id":"W4408892882","doi":"10.1061/jhend8.hyeng-14163","title":"Simulation of Water Quality in Pipeline Networks: A Graph Theory Approach","year":2025,"lang":"en","type":"article","venue":"Journal of Hydraulic Engineering","topic":"Data Management and Algorithms","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; BC Hydro (Canada)","funders":"","keywords":"Water quality; Graph theory; Pipeline (software); Computer science; Petroleum engineering; Pipeline transport; Environmental science; Geology; Environmental engineering; Mathematics; Programming language","score_opus":0.011218728333639584,"score_gpt":0.25179111741739885,"score_spread":0.24057238908375927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408892882","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.008323644,0.00024892317,0.99059916,0.00010626327,0.00027143123,0.000050009217,2.213247e-7,0.000015469868,0.0003848535],"genre_scores_gemma":[0.9758824,0.000016851869,0.0239216,0.000051440253,0.000060495746,8.8059056e-7,0.0000014281436,0.000003518674,0.000061368424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908215,0.00004569367,0.0004822455,0.000093979965,0.00015637616,0.0001395315],"domain_scores_gemma":[0.9994859,0.00013784949,0.00010652462,0.00019609294,0.000049251288,0.0000243588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463065,0.00007755993,0.00019675758,0.00037149875,0.000011789295,0.000038145095,0.00045428122,0.000028811375,0.000001718105],"category_scores_gemma":[0.00007473323,0.000057130103,0.00007102366,0.0003919479,0.000008369931,0.0005064527,0.0001282839,0.00015073859,3.628877e-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.0000066807347,0.00004036813,0.00010559038,0.00004382474,0.00002041525,0.0000045007373,0.00011823952,0.98306775,0.00011759191,0.0063240957,0.000032804346,0.010118145],"study_design_scores_gemma":[0.00033058992,0.000014491736,0.0013926846,0.00006622179,0.000007301321,0.0000012735767,0.00001665615,0.99593884,0.0002819292,0.0012463143,0.0006428056,0.000060875154],"about_ca_topic_score_codex":0.0000031426764,"about_ca_topic_score_gemma":3.3135416e-7,"teacher_disagreement_score":0.9675588,"about_ca_system_score_codex":0.00001961382,"about_ca_system_score_gemma":0.000008372052,"threshold_uncertainty_score":0.23296979},"labels":[],"label_agreement":null},{"id":"W4408968267","doi":"10.61091/ars162-11","title":"Counting nodes in Smolyak grids","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","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":"Mathematics","score_opus":0.008651257426982471,"score_gpt":0.24075948327289914,"score_spread":0.23210822584591667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408968267","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.7523694,0.00077217916,0.040333893,0.0061927694,0.018071128,0.0006600387,0.0000055999785,0.0008934689,0.18070152],"genre_scores_gemma":[0.9952261,0.000016763774,0.0029472804,0.0004748893,0.0000053152253,0.000012848268,0.000004949016,0.000004431911,0.0013074126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911946,0.000029462444,0.00017159211,0.00028606888,0.00015702515,0.00023640548],"domain_scores_gemma":[0.99938476,0.00006115762,0.000036005764,0.000464874,0.000029574852,0.000023632863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035874144,0.00009412795,0.00011835219,0.00018367094,0.00007211949,0.00023866165,0.0009940634,0.000032681768,0.000005839597],"category_scores_gemma":[0.00004110096,0.0000968848,0.000027190232,0.00081461394,0.000022039489,0.0006588972,0.0005709318,0.00010937382,0.00005266655],"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":[8.27317e-7,0.00004921886,0.009981236,0.000011809683,0.0000070939222,0.000015813406,0.000044402328,0.000004757826,0.000023968187,0.9702601,0.0042978968,0.015302913],"study_design_scores_gemma":[0.0011428364,0.000024278319,0.0383897,0.000093542214,0.000006205251,8.004449e-7,0.000041725252,0.03361725,0.00062589097,0.8991376,0.026664328,0.0002558442],"about_ca_topic_score_codex":0.00007301914,"about_ca_topic_score_gemma":0.000006679602,"teacher_disagreement_score":0.24285671,"about_ca_system_score_codex":0.000041766583,"about_ca_system_score_gemma":0.000033053908,"threshold_uncertainty_score":0.39508477},"labels":[],"label_agreement":null},{"id":"W4409363673","doi":"10.1609/aaai.v39i18.34151","title":"OmniCount: Multi-label Object Counting with Semantic-Geometric Priors","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Prior probability; Object (grammar); Computer science; Artificial intelligence; Mathematics; Pattern recognition (psychology); Bayesian probability","score_opus":0.06264939534395512,"score_gpt":0.29685181977362796,"score_spread":0.23420242442967282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10847386,0.00012618233,0.8438176,0.006426905,0.0013706114,0.0015611697,0.000013493206,0.00044132626,0.037768867],"genre_scores_gemma":[0.9760986,0.000052666936,0.021920918,0.00035402074,0.00003389462,0.000027007594,8.1942403e-7,0.000011779456,0.0015002842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977339,0.000013179998,0.0005166484,0.0006615615,0.00062244275,0.0004522856],"domain_scores_gemma":[0.99831426,0.00010269015,0.00038392516,0.00046736488,0.00067376904,0.0000579773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007229444,0.00027838445,0.00030562092,0.0005020385,0.0003070695,0.00072624953,0.00318663,0.00007057787,0.000020782052],"category_scores_gemma":[0.0003726994,0.00019399045,0.00007459586,0.0032430054,0.00024892096,0.00090245856,0.00086541695,0.00031005827,0.00007372983],"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.000038746268,0.00033104737,0.0012080573,0.00011242514,0.00005710231,0.0000014387912,0.0004527428,0.000018994046,0.0046367073,0.7530141,0.00035193062,0.23977673],"study_design_scores_gemma":[0.0002094165,0.0003375847,0.0011514495,0.0010448827,0.000076624376,0.000004168106,0.0011980705,0.6247524,0.3426178,0.027437665,0.0005501999,0.00061969896],"about_ca_topic_score_codex":0.0000745284,"about_ca_topic_score_gemma":0.00002433277,"teacher_disagreement_score":0.86762476,"about_ca_system_score_codex":0.000055544577,"about_ca_system_score_gemma":0.00013196556,"threshold_uncertainty_score":0.7910701},"labels":[],"label_agreement":null},{"id":"W4409579938","doi":"10.61091/jcmcc127a-070","title":"Combinatorial Optimization Algorithms in Tourism Planning and Emergency Management and Their Application to Resource Allocation","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Data Management and Algorithms","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":"","keywords":"Resource allocation; Computer science; Tourism; Mathematical optimization; Resource planning; Operations research; Algorithm; Engineering; Environmental resource management; Mathematics; Geography; Environmental science","score_opus":0.00958854311294038,"score_gpt":0.2522237586805554,"score_spread":0.24263521556761503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409579938","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.040743314,0.00067133707,0.9481249,0.00068734185,0.00731096,0.00073819695,0.0000013540824,0.000058927777,0.0016636865],"genre_scores_gemma":[0.9342964,0.00016104843,0.06485612,0.000066457804,0.0005546445,0.000014424289,0.0000051187317,0.000024114477,0.00002167135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771523,0.000110514266,0.0010402753,0.00042218238,0.0003966693,0.00031511713],"domain_scores_gemma":[0.9984776,0.00023719046,0.0005683463,0.0003441217,0.0002162363,0.00015650831],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017460315,0.00029927553,0.0005427328,0.0006265614,0.00027114063,0.00041005766,0.00064926245,0.00012334973,6.829854e-7],"category_scores_gemma":[0.00011806039,0.00028184245,0.000055315864,0.0008529716,0.000041181956,0.0005432271,0.00093344756,0.00030156973,4.5763974e-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.00004495958,0.00030770493,0.0003149175,0.00023431308,0.00008686402,0.000011617273,0.0015920992,0.0015308156,0.000049839007,0.9663606,0.00050180656,0.028964425],"study_design_scores_gemma":[0.004594577,0.00040282175,0.0007705077,0.0006007447,0.00006206203,0.000019781372,0.0008779129,0.40237823,0.00016213335,0.5866244,0.003080762,0.00042610944],"about_ca_topic_score_codex":0.000009935908,"about_ca_topic_score_gemma":2.3416267e-7,"teacher_disagreement_score":0.8935531,"about_ca_system_score_codex":0.00008451007,"about_ca_system_score_gemma":0.000036690963,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W4410235836","doi":"10.1016/j.oceaneng.2025.121404","title":"TrajReducer: a cross-dimension indexer-based reducer for vessel destination prediction","year":2025,"lang":"en","type":"article","venue":"Ocean Engineering","topic":"Data Management and Algorithms","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, Okanagan Campus","funders":"","keywords":"Reducer; Dimension (graph theory); Marine engineering; Computer science; Engineering; Mathematics; Mechanical engineering; Combinatorics","score_opus":0.009081502940013645,"score_gpt":0.2459964538396883,"score_spread":0.23691495089967465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410235836","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.04207219,0.000043435954,0.95570654,0.0003288312,0.000925381,0.00024920522,0.000008997605,0.0004126225,0.00025282367],"genre_scores_gemma":[0.91117543,0.000002690454,0.08811464,0.00008211906,0.000085221494,0.00002388898,0.000058453883,0.000012564851,0.00044496276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.000006043765,0.00016017727,0.00028240442,0.00012220952,0.00019303129],"domain_scores_gemma":[0.9995354,0.000049854723,0.000032909084,0.00028713376,0.000059976268,0.00003477035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022448014,0.00011015746,0.0000873514,0.0002280831,0.000092218004,0.00020960186,0.000334231,0.000042228377,0.0000016475785],"category_scores_gemma":[0.0000604496,0.00011836334,0.00004242428,0.0003934754,0.000010221056,0.00058072165,0.00007581902,0.000068993766,0.000002535956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047129794,0.00035242064,0.00405941,0.00087088946,0.00013237572,0.0000126112955,0.00033296636,0.613313,0.016387343,0.119380265,0.03256409,0.21254751],"study_design_scores_gemma":[0.0005054922,0.00002841711,0.007815947,0.00007985328,0.000009886089,6.0216047e-7,0.0000029950922,0.9746575,0.008843553,0.0002640766,0.007681425,0.00011025113],"about_ca_topic_score_codex":0.0000016652085,"about_ca_topic_score_gemma":7.78901e-8,"teacher_disagreement_score":0.86910325,"about_ca_system_score_codex":0.000059114314,"about_ca_system_score_gemma":0.000031627067,"threshold_uncertainty_score":0.4826717},"labels":[],"label_agreement":null},{"id":"W4410416203","doi":"10.1007/978-981-97-9855-1_33","title":"Analyze User Navigational Patterns from Log Data Using Hadoop Techniques","year":2025,"lang":"en","type":"book-chapter","venue":"Learning and analytics in intelligent systems","topic":"Data Management and Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Database","score_opus":0.060646770989884614,"score_gpt":0.3123121297863696,"score_spread":0.25166535879648494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410416203","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.00006456678,0.0016804883,0.9648799,0.00009794064,0.0007229232,0.00029357194,0.0003354843,0.00019182866,0.031733338],"genre_scores_gemma":[0.02540383,0.0067673293,0.042374715,0.00028757786,0.0016137629,0.00001741692,0.008171778,0.00015196514,0.9152116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974357,0.00007338718,0.00071143336,0.0010394964,0.00047098767,0.0002690222],"domain_scores_gemma":[0.9980925,0.0002087524,0.0004007901,0.0011285896,0.000093103445,0.000076284414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006762847,0.00037579567,0.0005496231,0.00053492165,0.00014386054,0.00079619593,0.0016932547,0.00025689375,0.000043505057],"category_scores_gemma":[0.00005213647,0.00037554122,0.000077821154,0.00013117318,0.000059801514,0.0004063771,0.0018850813,0.0007600502,0.00002352686],"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.000014467275,0.00012102232,0.024908617,0.0011591399,0.0015960697,0.0005415111,0.0004366661,0.006157296,0.000018233399,0.7352436,0.009043114,0.22076024],"study_design_scores_gemma":[0.000065545835,0.00002153605,0.000026394076,0.0026080376,0.00010092981,0.0000050916724,0.00005885046,0.6785373,0.000012804794,0.0030761322,0.315047,0.0004404017],"about_ca_topic_score_codex":0.00097085093,"about_ca_topic_score_gemma":0.000041798274,"teacher_disagreement_score":0.92250514,"about_ca_system_score_codex":0.00011594373,"about_ca_system_score_gemma":0.00006133041,"threshold_uncertainty_score":0.99986964},"labels":[],"label_agreement":null},{"id":"W4410461442","doi":"10.1007/s43069-025-00467-4","title":"Time-Dependent Routing and Road Network Precision","year":2025,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Data Management and Algorithms","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Computer network","score_opus":0.029420819693897735,"score_gpt":0.34907756549632113,"score_spread":0.31965674580242337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410461442","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.00479607,0.00049221603,0.9224247,0.019226898,0.00037989524,0.0008371989,0.0000078046405,0.0001606995,0.051674534],"genre_scores_gemma":[0.6411215,0.0004232518,0.11380991,0.0008941518,0.00030599668,0.00022557961,0.00008091086,0.00002121741,0.2431175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986153,0.00014813153,0.0001425025,0.0003282933,0.0003625923,0.00040316544],"domain_scores_gemma":[0.99923444,0.00008761859,0.000006722794,0.0004902051,0.00012556848,0.00005541917],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015948832,0.00006446137,0.000074133604,0.00018111111,0.0009196347,0.0011590854,0.00069281785,0.000029782674,0.0000340591],"category_scores_gemma":[0.00015059278,0.000056426015,0.000016231914,0.000744351,0.00005543281,0.00091887754,0.0017524945,0.00017566975,0.00018690302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046441123,0.000060610786,0.00032562908,0.000007547692,0.000027062611,0.000008718844,0.00013173961,0.006663962,0.00028044492,0.2653941,0.09488841,0.63220716],"study_design_scores_gemma":[0.00018143264,0.000044221175,0.0006336651,0.000040554787,0.0000015846622,9.569972e-7,0.00007828979,0.964948,0.00013382528,0.002549551,0.031314287,0.00007363487],"about_ca_topic_score_codex":0.00008641771,"about_ca_topic_score_gemma":0.00011030363,"teacher_disagreement_score":0.958284,"about_ca_system_score_codex":0.000035040113,"about_ca_system_score_gemma":0.000070587186,"threshold_uncertainty_score":0.9998778},"labels":[],"label_agreement":null},{"id":"W4410475241","doi":"10.56553/popets-2025-0093","title":"A non comparison oblivious sort and its application to k-NN","year":2025,"lang":"en","type":"article","venue":"Proceedings on Privacy Enhancing Technologies","topic":"Data Management and Algorithms","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é du Québec à Montréal","funders":"","keywords":"sort; Computer science; Parallel computing; Information retrieval","score_opus":0.01208223661284677,"score_gpt":0.27345112539574384,"score_spread":0.2613688887828971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410475241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3489288,0.00025407868,0.6260161,0.014301173,0.00019915309,0.001175928,0.0000018230777,0.004671802,0.0044511566],"genre_scores_gemma":[0.96362966,0.00006597515,0.035505455,0.00030279235,0.000012181482,0.00021907117,0.0000015424009,0.000007869589,0.00025546885],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854165,0.0000017354379,0.0002561992,0.00067309954,0.00020582933,0.0003214719],"domain_scores_gemma":[0.9993426,0.00003087915,0.000104796134,0.00039009814,0.00009984691,0.00003173696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768298,0.00019043188,0.00022089714,0.00057503034,0.00017808494,0.00035001512,0.0017456863,0.00009923858,4.4035116e-7],"category_scores_gemma":[0.00033115307,0.00017905608,0.000023646577,0.0012023383,0.000030423085,0.0006141604,0.0022731915,0.00020367393,0.000048409718],"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.000012108907,0.00012228447,0.00285484,0.00020028058,0.000030201101,0.0000014438222,0.0005690891,0.000007487832,0.03449987,0.31465015,0.007728287,0.63932395],"study_design_scores_gemma":[0.0004572066,0.0003715769,0.003404677,0.000416849,0.000025310115,0.0000029996247,0.00090086524,0.101760074,0.8063803,0.04593531,0.039723143,0.0006217072],"about_ca_topic_score_codex":0.0000049515033,"about_ca_topic_score_gemma":0.0000017298412,"teacher_disagreement_score":0.7718804,"about_ca_system_score_codex":0.000061345614,"about_ca_system_score_gemma":0.000015482297,"threshold_uncertainty_score":0.7301695},"labels":[],"label_agreement":null},{"id":"W4410527555","doi":"10.46298/dmtcs.12743","title":"On Separating Path and Tree Systems in Graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Data Management and Algorithms","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; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Mathematics; Combinatorics; Path (computing); Tree (set theory); Computer science","score_opus":0.010106605733822108,"score_gpt":0.26072299739890475,"score_spread":0.25061639166508265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527555","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.012544487,0.00005216343,0.9669975,0.0004586335,0.0003963633,0.000297328,0.000002241655,0.00010848038,0.019142775],"genre_scores_gemma":[0.81298184,0.000009111755,0.1866398,0.00029010576,0.000016131164,0.000017580467,0.0000012133324,0.000005639493,0.00003856132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978762,0.00006875699,0.0003793925,0.0006852596,0.0005294508,0.00046091567],"domain_scores_gemma":[0.9985288,0.00039899265,0.000077555036,0.00082946895,0.00005264117,0.00011256496],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012865079,0.0002061137,0.00027201787,0.00042480463,0.0002492922,0.0012426967,0.0018504261,0.000038477905,0.0000029653309],"category_scores_gemma":[0.000105397594,0.00015811206,0.00004104897,0.0014755095,0.0008729379,0.0006276327,0.0013595126,0.00016855808,0.000014619259],"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.0000014336921,0.00005181714,0.000031412743,0.00005347264,0.0000040882533,0.0000118787475,0.0003826717,0.00007720517,0.000038003374,0.98911524,0.0000749569,0.010157844],"study_design_scores_gemma":[0.0001441247,0.000047844722,0.00014809876,0.0001800526,0.0000030768826,0.0000028111838,0.00003594288,0.6040877,0.000042925887,0.39516965,0.000020960291,0.00011680106],"about_ca_topic_score_codex":0.0000036424842,"about_ca_topic_score_gemma":8.397476e-7,"teacher_disagreement_score":0.8004374,"about_ca_system_score_codex":0.000029745419,"about_ca_system_score_gemma":0.000040607065,"threshold_uncertainty_score":0.9997941},"labels":[],"label_agreement":null},{"id":"W4410887374","doi":"10.1109/syscon64521.2025.11014824","title":"A Fuzzy Set-Theoretic Approach to Occupancy Grid Mapping","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Occupancy grid mapping; Occupancy; Computer science; Fuzzy set; Grid; Fuzzy logic; Set (abstract data type); Data mining; Artificial intelligence; Mathematics; Engineering; Programming language","score_opus":0.02098207250555116,"score_gpt":0.2523479548286725,"score_spread":0.23136588232312133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410887374","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.00018281778,0.00001910064,0.6198217,0.0009895668,0.00034207976,0.00014377375,0.0000017282846,0.00017912882,0.37832007],"genre_scores_gemma":[0.113008834,0.000014794738,0.83766973,0.007900009,0.00018541649,0.00008993839,0.000030404268,0.000010465573,0.04109043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990044,0.00002471614,0.00014495541,0.00041361194,0.0001530562,0.00025924435],"domain_scores_gemma":[0.99919254,0.00002371119,0.000019059114,0.0006807616,0.000023930013,0.00006000095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025516155,0.00010638799,0.000110676476,0.00022636741,0.000086451015,0.00032103067,0.0013004121,0.000021718439,0.000011219285],"category_scores_gemma":[0.000019419698,0.0000900398,0.000037884023,0.0009704783,0.00001837902,0.00039410265,0.0009985225,0.00006177927,0.00024465728],"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.837843e-7,0.000030429508,0.00015407006,0.000026227217,0.000012338005,0.0000022662089,0.00014726544,0.000010198646,0.000010209678,0.9033449,0.054721802,0.041539486],"study_design_scores_gemma":[0.0011815529,0.0000979753,0.009785552,0.0001562748,0.00003197,0.00000764431,0.00068812893,0.19943719,0.0006074874,0.21195613,0.57489115,0.0011589612],"about_ca_topic_score_codex":0.000014815116,"about_ca_topic_score_gemma":8.090899e-7,"teacher_disagreement_score":0.6913888,"about_ca_system_score_codex":0.00001873418,"about_ca_system_score_gemma":0.000021087293,"threshold_uncertainty_score":0.36717165},"labels":[],"label_agreement":null},{"id":"W4410996627","doi":"10.1175/mwr-d-24-0090.1","title":"A Feature-Based Framework to Investigate Atmospheric Predictability","year":2025,"lang":"en","type":"article","venue":"Monthly Weather Review","topic":"Data Management and Algorithms","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":"Environment and Climate Change Canada","funders":"Deutsche Forschungsgemeinschaft","keywords":"Predictability; Feature (linguistics); Environmental science; Climatology; Computer science; Atmospheric models; Meteorology; Geology; Mathematics; Atmosphere (unit); Statistics; Geography","score_opus":0.011039534345529475,"score_gpt":0.2658798652350494,"score_spread":0.25484033088951996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410996627","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.00018325396,0.1005531,0.8273369,0.06020177,0.0005969306,0.001646776,0.00001675307,0.000492562,0.008971958],"genre_scores_gemma":[0.002231448,0.0040110266,0.8816883,0.10344202,0.00011274463,0.0006572658,0.000029202407,0.000032902528,0.007795098],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842143,0.00013803801,0.00024428472,0.0006176101,0.00026656655,0.00031206344],"domain_scores_gemma":[0.99801177,0.00008173013,0.00006976351,0.0016355774,0.000056267192,0.00014491279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006405229,0.00022091866,0.00037064575,0.000022765895,0.00009120755,0.00018345485,0.0015843956,0.000057460442,0.00004800284],"category_scores_gemma":[0.00027938306,0.00017853093,0.00013385923,0.0015743172,0.000039381754,0.00029635004,0.00048214817,0.00018868074,0.00018942013],"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.0000068095956,0.00019781594,0.0039594835,0.0033863029,0.000083743296,0.00002550398,0.00010224661,0.00015682056,0.0000072878634,0.05272676,0.35733956,0.58200765],"study_design_scores_gemma":[0.00013195847,0.00004742907,0.0024489583,0.0045122984,0.00004658863,1.6082686e-7,0.000001452586,0.01010031,0.000024911737,0.0058443765,0.9766186,0.00022295606],"about_ca_topic_score_codex":0.000017478,"about_ca_topic_score_gemma":0.0000067960286,"teacher_disagreement_score":0.619279,"about_ca_system_score_codex":0.00005603192,"about_ca_system_score_gemma":0.00007886352,"threshold_uncertainty_score":0.728028},"labels":[],"label_agreement":null},{"id":"W4411174390","doi":"10.1007/978-3-031-90200-0_14","title":"Towards Using Partitioned GPU Virtual Functions for Mixture of Experts","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Computer graphics (images); Computational science; Parallel computing","score_opus":0.02732884269420938,"score_gpt":0.2680875058637235,"score_spread":0.2407586631695141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411174390","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.00001372807,0.00019290825,0.9938208,0.000522262,0.0028943424,0.00047559172,0.00005641937,0.00009076591,0.0019332016],"genre_scores_gemma":[0.011316928,0.00002821296,0.9843996,0.0011248013,0.0005681585,0.000026807762,0.00005423273,0.00002348103,0.0024577882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974467,0.000017739756,0.00045005625,0.0010631903,0.0005978498,0.00042445236],"domain_scores_gemma":[0.998096,0.0002325585,0.00023499307,0.0010820574,0.0002734159,0.00008101474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046882583,0.0003522011,0.00042939401,0.00078070903,0.00025473707,0.00033863576,0.002263218,0.00019535734,0.000016522761],"category_scores_gemma":[0.00007971265,0.00032584512,0.00016366268,0.00061452825,0.0003653276,0.00076496537,0.0012787011,0.0002291809,0.0000034561156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008776605,0.000046701756,0.0000090295025,0.000077267956,0.0000317872,0.000012019989,0.00031744025,0.015968984,0.00020290457,0.06878084,0.00057935604,0.91396487],"study_design_scores_gemma":[0.00039038275,0.00021997053,0.0000170421,0.00047259466,0.0000287704,0.0000055706987,7.7929894e-7,0.910523,0.0018955937,0.073516704,0.012403809,0.0005257935],"about_ca_topic_score_codex":0.000018494427,"about_ca_topic_score_gemma":0.000025925785,"teacher_disagreement_score":0.9134391,"about_ca_system_score_codex":0.00013831933,"about_ca_system_score_gemma":0.00045050404,"threshold_uncertainty_score":0.99991935},"labels":[],"label_agreement":null},{"id":"W4411259610","doi":"10.1145/3735950.3735953","title":"Arborescent Garbage Collection: A Dynamic Graph Approach to Immediate Cycle Collection","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Garbage collection; Computer science; Manual memory management; Graph; Parallel computing; Database; Garbage; Programming language; Theoretical computer science","score_opus":0.00653791225284416,"score_gpt":0.22886111602886475,"score_spread":0.22232320377602058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411259610","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.0008155556,0.000031372332,0.88242847,0.0019219355,0.00092804135,0.00045159573,0.000002022658,0.0003251619,0.11309582],"genre_scores_gemma":[0.4584339,0.00019609001,0.36961234,0.005016275,0.00014359775,0.00055754534,0.00007103625,0.00003127485,0.16593795],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987516,0.000039276605,0.00019272676,0.0005104657,0.00022460605,0.00028135465],"domain_scores_gemma":[0.9992864,0.000021438538,0.000034294488,0.0005270873,0.000049545913,0.0000812213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002314723,0.0001363752,0.00013504457,0.00050801557,0.00025133483,0.00033980468,0.00071463507,0.00003866387,0.000013536721],"category_scores_gemma":[0.000016554128,0.00012689242,0.000059906433,0.0031385627,0.000019651323,0.00038861198,0.00044564347,0.00008971741,0.00006037247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000759889,0.0014428388,0.0010577805,0.00015935264,0.00028425414,0.000021636259,0.0009415521,0.0016686362,0.00048129944,0.34313253,0.55843157,0.09230255],"study_design_scores_gemma":[0.0009241567,0.00010728349,0.016313422,0.000025139861,0.000021555876,0.0000032867845,0.000108211636,0.9504051,0.00047523816,0.0065533747,0.024701942,0.0003612524],"about_ca_topic_score_codex":0.0001089215,"about_ca_topic_score_gemma":0.00006186927,"teacher_disagreement_score":0.9487365,"about_ca_system_score_codex":0.00010972733,"about_ca_system_score_gemma":0.000050318085,"threshold_uncertainty_score":0.5174523},"labels":[],"label_agreement":null},{"id":"W4411319974","doi":"10.1145/3717823.3718194","title":"Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Cluster analysis; Correlation; Graph; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.015816673114113618,"score_gpt":0.24884199260412274,"score_spread":0.23302531949000913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411319974","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.00067413505,0.000044391367,0.97991717,0.010697173,0.00031691464,0.00010838098,0.0000016498119,0.00017349332,0.008066703],"genre_scores_gemma":[0.3999462,0.00030000714,0.561819,0.0026987968,0.00017304353,0.000060973907,0.00005292736,0.000015076431,0.03493396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992472,0.000026060237,0.00014113919,0.0002988788,0.000115718685,0.00017098071],"domain_scores_gemma":[0.9995166,0.000048173682,0.00003261378,0.0003279862,0.000025262441,0.00004933463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021125995,0.000087596185,0.000085885345,0.00012843257,0.00012012453,0.00031903453,0.0003951739,0.000039728653,0.00000861893],"category_scores_gemma":[0.000008495085,0.00008159716,0.00002194579,0.00039486142,0.000038030495,0.0004412771,0.0003488675,0.00007541579,0.000009923467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037019322,0.00006481705,0.003448801,0.000046484784,0.00004234229,0.000008866121,0.00043463142,0.00032333797,0.00009772756,0.31976482,0.021377599,0.6543869],"study_design_scores_gemma":[0.00022227383,0.000014732247,0.012618678,0.000018259705,0.000008992221,0.0000030972762,0.00008450095,0.9658713,0.00007538915,0.0091460245,0.011823771,0.00011301732],"about_ca_topic_score_codex":0.000053538297,"about_ca_topic_score_gemma":0.000035843837,"teacher_disagreement_score":0.9655479,"about_ca_system_score_codex":0.000027043836,"about_ca_system_score_gemma":0.000024694322,"threshold_uncertainty_score":0.33274356},"labels":[],"label_agreement":null},{"id":"W4411374364","doi":"10.1145/3722212.3724440","title":"Including Bloom Filters in Bottom-up Optimization","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Data Management and Algorithms","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":"Bloom filter; Bloom; Computer science; Geology; Algorithm; Oceanography","score_opus":0.03709317963472425,"score_gpt":0.2897979060623975,"score_spread":0.2527047264276733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411374364","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.00008054407,0.000046903184,0.96516615,0.0013193181,0.0018145244,0.00025739297,0.000010174373,0.00023486513,0.03107015],"genre_scores_gemma":[0.004846859,0.00024257686,0.97111756,0.0009686343,0.000096122465,0.00005904803,0.00022419755,0.000008797919,0.022436198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986174,0.00004670232,0.00027451033,0.00062849396,0.00021324765,0.00021962942],"domain_scores_gemma":[0.9989669,0.000040690662,0.00009043272,0.0008363207,0.00003200535,0.000033695735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034110987,0.00018066657,0.00019656953,0.00045433137,0.000049147606,0.0005055427,0.0018899662,0.000110859815,0.000050521423],"category_scores_gemma":[0.000029816178,0.00018184527,0.000054608783,0.00044439317,0.000013189463,0.0005204969,0.007215879,0.0003222388,0.000017192788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055893383,0.00015675397,0.00114689,0.00043293915,0.000110558496,0.000059855593,0.00088785344,0.6509972,0.0000051824427,0.11767824,0.037608046,0.19091088],"study_design_scores_gemma":[0.00019479368,0.000005107582,0.000104722654,0.00014577383,0.000006650588,1.6474603e-7,0.000016059186,0.9949283,0.000055722478,0.0023979228,0.001931195,0.0002135915],"about_ca_topic_score_codex":0.00019359743,"about_ca_topic_score_gemma":0.00002263059,"teacher_disagreement_score":0.34393108,"about_ca_system_score_codex":0.000072655144,"about_ca_system_score_gemma":0.0000744978,"threshold_uncertainty_score":0.8994077},"labels":[],"label_agreement":null},{"id":"W4411687193","doi":"10.61091/um123-15","title":"Alpha-trees over paths and caterpillars","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Data Management and Algorithms","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":"Mathematics; Alpha (finance); Statistics","score_opus":0.009181463388676548,"score_gpt":0.25228080326702074,"score_spread":0.2430993398783442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05174454,0.0016077932,0.7845587,0.005266071,0.00074770156,0.00078053836,0.000029791292,0.0007126186,0.15455224],"genre_scores_gemma":[0.86171895,0.0001116965,0.12659524,0.001288541,0.000039529874,0.000046741046,0.000010673774,0.000014727877,0.010173869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991617,0.000021549591,0.00017735657,0.00029058522,0.00015117988,0.00019762239],"domain_scores_gemma":[0.9991768,0.00010297855,0.000033201948,0.0006241908,0.000018358065,0.000044496235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023926562,0.000115441646,0.00014773825,0.00010416443,0.00008199816,0.00022091427,0.00056670845,0.000027854645,0.000048752692],"category_scores_gemma":[0.00005388044,0.000094508694,0.000033427958,0.00022807787,0.000054698106,0.0004017554,0.0006322528,0.000048929316,0.00007127207],"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.0000013541362,0.00007639259,0.0003739597,0.00014193477,0.000043249234,0.00001273535,0.0004408163,2.4425097e-7,0.000044700213,0.91531724,0.023785623,0.05976175],"study_design_scores_gemma":[0.00069114356,0.000070039365,0.017363656,0.0002520855,0.000058903046,0.00000835431,0.0002569695,0.09894165,0.0005315151,0.7758316,0.105549775,0.00044434846],"about_ca_topic_score_codex":0.000007047303,"about_ca_topic_score_gemma":0.0000029059945,"teacher_disagreement_score":0.80997443,"about_ca_system_score_codex":0.000011069233,"about_ca_system_score_gemma":0.000013797959,"threshold_uncertainty_score":0.38539526},"labels":[],"label_agreement":null},{"id":"W4411687194","doi":"10.61091/um123-03","title":"Maps of combinatorial trees with weakly connected Markov graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Data Management and Algorithms","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":"Mathematics; Markov chain; Combinatorics; Discrete mathematics; Statistics","score_opus":0.008671139799528452,"score_gpt":0.23015525979199436,"score_spread":0.22148411999246592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411687194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026734915,0.00044738382,0.61324143,0.0035748214,0.0021593748,0.0019549066,0.00015840172,0.0010601098,0.35066867],"genre_scores_gemma":[0.8352619,0.000012889243,0.1620371,0.00014081706,0.000023773548,0.00005305744,0.000039375333,0.000015573372,0.0024155166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988396,0.000049327784,0.000302675,0.00030105692,0.0002857712,0.00022153712],"domain_scores_gemma":[0.9987088,0.00019214906,0.00010116064,0.0008703411,0.00008330147,0.000044247307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031858482,0.0001518129,0.0002863082,0.00019820742,0.000066713816,0.000092122864,0.001009653,0.000037871705,0.000052284926],"category_scores_gemma":[0.0000862521,0.00011549531,0.00006329209,0.00073365314,0.000115254996,0.00032699024,0.00034291518,0.000074006624,0.000024138388],"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.000015471158,0.00019815956,0.00007978685,0.00016476352,0.00008885093,0.0000058717546,0.00017000508,3.3332992e-7,0.000035273777,0.9809248,0.011468852,0.006847853],"study_design_scores_gemma":[0.0018609578,0.00030520817,0.0019577607,0.00043507808,0.00010350464,0.0000044071508,0.00033490843,0.017717866,0.0014665266,0.9641316,0.011324636,0.00035755604],"about_ca_topic_score_codex":0.000009822433,"about_ca_topic_score_gemma":0.0000037314232,"teacher_disagreement_score":0.808527,"about_ca_system_score_codex":0.000011939542,"about_ca_system_score_gemma":0.00004118914,"threshold_uncertainty_score":0.47097623},"labels":[],"label_agreement":null},{"id":"W4412202024","doi":"10.1145/3747591","title":"Minimum Plane Bichromatic Spanning Trees","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Data Management and Algorithms","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 Windsor","funders":"","keywords":"Spanning tree; Combinatorics; Plane (geometry); Mathematics; Minimum degree spanning tree; Computer science; Discrete mathematics; Physics; Geometry","score_opus":0.01779323630805467,"score_gpt":0.265220523802979,"score_spread":0.24742728749492432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412202024","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.00062963774,0.00008596882,0.9905046,0.0034758789,0.0012764175,0.00021396844,0.000019329642,0.00046611048,0.0033280668],"genre_scores_gemma":[0.12610066,0.00014828774,0.84966046,0.0023459606,0.00013647924,0.00014317648,0.000036073685,0.00003234845,0.021396529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.00004793372,0.00029211963,0.00051257655,0.0003007804,0.00035952093],"domain_scores_gemma":[0.99825597,0.0002003401,0.000056262557,0.0013722178,0.00003448027,0.000080741636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021175809,0.00021847212,0.00021638333,0.00046391384,0.00031099515,0.00029818134,0.0017933968,0.000069173235,0.00008489379],"category_scores_gemma":[0.000024710303,0.00020657732,0.00010459761,0.0009986024,0.00005415593,0.00070161367,0.000057828936,0.00021589365,0.00025517147],"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.0000052636287,0.00020664131,0.000009601701,0.000026683485,0.00011709867,0.00003222331,0.00017865376,0.0005480271,0.00013228135,0.0023192703,0.002537707,0.99388653],"study_design_scores_gemma":[0.0032663213,0.00052492274,0.004063834,0.0004786851,0.00021197117,0.00003651185,0.0005606068,0.8801373,0.006517561,0.019413501,0.08349192,0.0012968536],"about_ca_topic_score_codex":0.000046462555,"about_ca_topic_score_gemma":0.00001573561,"teacher_disagreement_score":0.9925897,"about_ca_system_score_codex":0.000049683313,"about_ca_system_score_gemma":0.00004910575,"threshold_uncertainty_score":0.84239787},"labels":[],"label_agreement":null},{"id":"W4412376451","doi":"10.55016/ojs/cdm.v10i1.62293","title":"Chasing robbers on percolated random geometric graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Combinatorics; Mathematics; Random graph; Discrete mathematics; Graph","score_opus":0.025639752924634742,"score_gpt":0.2881849538665438,"score_spread":0.2625452009419091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376451","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.0035309854,0.000066639215,0.98708135,0.0024665147,0.00037329432,0.0005954569,0.00009416047,0.00030733747,0.0054842597],"genre_scores_gemma":[0.8287363,0.000023601979,0.16794801,0.000905486,0.00014985188,0.00013694774,0.00016862684,0.000039189188,0.0018919538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984029,0.000052613497,0.000334016,0.00033674788,0.0004513232,0.0004224319],"domain_scores_gemma":[0.99834347,0.00017112873,0.00010321701,0.0008209703,0.0002471201,0.0003140823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085727364,0.0001953022,0.0002815379,0.0005728999,0.00021468615,0.0004884126,0.0009471654,0.00005356964,0.000012203503],"category_scores_gemma":[0.0010339478,0.00016532867,0.00010051296,0.0021322072,0.000034994282,0.0005394778,0.00038675734,0.00012826789,0.0005144418],"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.00002763021,0.0003571666,0.000044122346,0.00003629647,0.0001422185,0.00003827533,0.001570507,0.0012435992,0.00008033723,0.94937694,0.03242691,0.0146559905],"study_design_scores_gemma":[0.010903458,0.00095473044,0.00045111877,0.00040083114,0.00022784866,0.0000456363,0.0011418875,0.7178319,0.0015758324,0.19857056,0.06606008,0.0018360934],"about_ca_topic_score_codex":0.000008657873,"about_ca_topic_score_gemma":0.0000018435877,"teacher_disagreement_score":0.8252053,"about_ca_system_score_codex":0.0001385021,"about_ca_system_score_gemma":0.000052874937,"threshold_uncertainty_score":0.67419076},"labels":[],"label_agreement":null},{"id":"W4412514797","doi":"10.1007/978-3-031-98679-6_11","title":"Assessing the Quality of Binomial Samplers: A Statistical Distance Framework","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Computer science; Binomial (polynomial); Quality (philosophy); Negative binomial distribution; Statistics; Mathematics; Poisson distribution","score_opus":0.04402618707810627,"score_gpt":0.3454310784813723,"score_spread":0.301404891403266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412514797","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.000011319248,0.00019852887,0.9932563,0.0011106869,0.0017907893,0.00029811467,0.000045966113,0.000072026196,0.0032162988],"genre_scores_gemma":[0.037588537,0.000026786154,0.96066123,0.0011337649,0.00031208483,0.0000064893356,0.000014837638,0.0000128270285,0.00024344865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996414,0.00009233382,0.00070275384,0.001194621,0.0011021998,0.0004940589],"domain_scores_gemma":[0.99463856,0.0028568343,0.0004095088,0.0018504886,0.0001661527,0.000078471145],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018783739,0.00037153938,0.00053549116,0.00035988184,0.00027419353,0.0012999483,0.00492731,0.00018454314,0.00002013395],"category_scores_gemma":[0.0005394314,0.00027387045,0.000108807704,0.00075184694,0.0011834376,0.00092593906,0.0024175202,0.00080743304,0.000007508658],"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.0000023697492,0.00001707399,0.000055587225,0.000056713427,0.000010758635,0.000010691598,0.00015447545,0.000748867,0.0000059930007,0.47633165,0.00007524915,0.52253056],"study_design_scores_gemma":[0.00019735986,0.00006186938,0.0013819316,0.00074514985,0.000015280679,0.0000031307384,8.7006606e-7,0.27580214,0.00010687985,0.71682465,0.0043174215,0.0005433175],"about_ca_topic_score_codex":0.00005315053,"about_ca_topic_score_gemma":0.00003946284,"teacher_disagreement_score":0.52198726,"about_ca_system_score_codex":0.00015046069,"about_ca_system_score_gemma":0.00048217186,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W4413232535","doi":"10.1007/978-3-032-00281-5_9","title":"A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Center (category theory); Algorithm; Cactus","score_opus":0.010870916836559892,"score_gpt":0.23094171266794614,"score_spread":0.22007079583138625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413232535","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":[7.060263e-7,0.0002196202,0.9879211,0.0026950624,0.0020601065,0.0015336728,0.0000561323,0.00019276,0.0053208205],"genre_scores_gemma":[0.00025296712,0.000090564296,0.9828613,0.0054823165,0.00048390334,0.000117243646,0.000067116416,0.00004551422,0.0105990805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602973,0.000034886067,0.0005182426,0.001682724,0.0009441842,0.0007902174],"domain_scores_gemma":[0.996398,0.0010852616,0.0002620489,0.0019333947,0.00020831915,0.00011302901],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009510816,0.00062842725,0.00050922815,0.0009136095,0.000515374,0.0012020635,0.005678416,0.00020925548,0.000029441067],"category_scores_gemma":[0.000034229226,0.0004316548,0.00023324697,0.000856438,0.00047889983,0.0006291934,0.0016260259,0.00063333847,0.00009624704],"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.000004029913,0.000045252487,0.0000013421991,0.00003308846,0.000037022488,0.000023229533,0.00011297988,0.00042531863,0.0000034823627,0.038538925,0.0013472744,0.9594281],"study_design_scores_gemma":[0.0004505555,0.0002126402,0.000007068123,0.00035274195,0.000022309847,0.000009206128,7.6255574e-8,0.82090604,0.00012708239,0.15055959,0.026874878,0.0004778102],"about_ca_topic_score_codex":0.0000121743215,"about_ca_topic_score_gemma":0.000016836437,"teacher_disagreement_score":0.9589502,"about_ca_system_score_codex":0.00017666348,"about_ca_system_score_gemma":0.00030010048,"threshold_uncertainty_score":0.9998348},"labels":[],"label_agreement":null},{"id":"W4413360655","doi":"10.1109/icde65448.2025.00101","title":"A Length Enhanced B<sup>+</sup>-Tree Based Index for Efficient Set Similarity Query","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Computer science; Set (abstract data type); Index (typography); Similarity (geometry); Tree (set theory); Algorithm; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.016089858702479858,"score_gpt":0.26462293099022155,"score_spread":0.24853307228774169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413360655","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.0031181204,0.000016961285,0.97807527,0.0026187557,0.0002843793,0.0005449821,0.000028771354,0.00032802307,0.014984754],"genre_scores_gemma":[0.86557794,0.0000038985795,0.1211765,0.005159855,0.00007709046,0.00015378246,0.00008003292,0.000012441231,0.007758429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984354,0.000043758664,0.00025122365,0.0006069861,0.0002639636,0.00039867286],"domain_scores_gemma":[0.99868786,0.00021597833,0.000051478466,0.0008859559,0.00008958598,0.000069146314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954556,0.00018613871,0.00019806318,0.00023298006,0.00017107224,0.00031376045,0.0012654257,0.00006376225,0.00003631918],"category_scores_gemma":[0.00008188175,0.00016383693,0.000112158006,0.0006273542,0.00003852395,0.00034043324,0.0005484232,0.00010851143,0.000031371612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010910252,0.001032232,0.0009536871,0.00042492006,0.00020794061,0.000019431585,0.0005233105,0.055354983,0.00027689224,0.31131032,0.15477769,0.47500947],"study_design_scores_gemma":[0.0009382557,0.000048052472,0.0005091154,0.000026559343,0.000011895282,8.499235e-8,0.000051317853,0.9676665,0.0030620846,0.0014463431,0.02604054,0.00019922234],"about_ca_topic_score_codex":0.000040117604,"about_ca_topic_score_gemma":0.000030507228,"teacher_disagreement_score":0.91231155,"about_ca_system_score_codex":0.000051155417,"about_ca_system_score_gemma":0.000112035515,"threshold_uncertainty_score":0.6681076},"labels":[],"label_agreement":null},{"id":"W4413827533","doi":"10.14778/3725688.3725702","title":"G-View: View Management for Graph Databases","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Computer science; Graph database; Database; Graph; Information retrieval; Theoretical computer science","score_opus":0.019736695528153752,"score_gpt":0.26537238348359177,"score_spread":0.24563568795543803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413827533","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.003544098,0.006517343,0.704534,0.035432015,0.0055776085,0.011312382,0.00018390757,0.00082023244,0.2320784],"genre_scores_gemma":[0.17980383,0.0072743976,0.75260484,0.0101361275,0.00033248452,0.0033335306,0.00006298009,0.00007294657,0.046378836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876356,0.000004120002,0.0002830835,0.0003938288,0.00028852464,0.00026690282],"domain_scores_gemma":[0.99931353,0.000029142644,0.00014984363,0.0003834215,0.00009272903,0.00003134461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043670257,0.00015272021,0.00018168143,0.00015752122,0.00015486337,0.00014173915,0.00208151,0.000013445477,0.000005517251],"category_scores_gemma":[0.000023908227,0.00010605235,0.00012885721,0.000667628,0.000044324534,0.0005555601,0.0018403237,0.000052735813,0.0000058386513],"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.0000057830116,0.00010536232,0.00018654476,0.00061891007,0.00010865628,2.525989e-7,0.000037891277,0.0000020560362,0.00024206744,0.81674397,0.07242507,0.10952346],"study_design_scores_gemma":[0.0010053793,0.000059796213,0.0010373612,0.0005483097,0.00014111033,0.0000011326885,0.00014447422,0.0018008369,0.022867534,0.052304223,0.91984177,0.0002480948],"about_ca_topic_score_codex":0.000010796845,"about_ca_topic_score_gemma":0.000001143375,"teacher_disagreement_score":0.8474167,"about_ca_system_score_codex":0.00003307833,"about_ca_system_score_gemma":0.000009844149,"threshold_uncertainty_score":0.43246895},"labels":[],"label_agreement":null},{"id":"W4414116777","doi":"10.1109/tkde.2025.3609302","title":"Flexible Keyword-Aware Top-$k$k Route Search","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Management and Algorithms","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":"York University","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Process (computing); Sequence (biology); Route planning; Semantics (computer science); Point of interest","score_opus":0.028948581485631814,"score_gpt":0.29190815446982205,"score_spread":0.26295957298419026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414116777","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.0001955702,0.0002994586,0.9958434,0.00022474353,0.00093519967,0.000114782546,0.000098893724,0.00044787972,0.0018400656],"genre_scores_gemma":[0.91044,0.0008920927,0.06764233,0.0002474034,0.00021676409,0.00006329647,0.00016624336,0.000042809534,0.020289019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902993,0.000013497785,0.00014281466,0.00046739634,0.000102139864,0.00024419275],"domain_scores_gemma":[0.99872655,0.00007075886,0.000009412231,0.0010943898,0.000028226548,0.00007068584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019831726,0.00014198055,0.00012700261,0.00030378983,0.00014835528,0.00024260492,0.0010844113,0.000042267402,0.000012751349],"category_scores_gemma":[0.0000025387349,0.00014308817,0.000027113068,0.0006220347,0.000015368933,0.0010594995,0.000061945975,0.00019351568,0.00006436149],"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.000010277882,0.0002566554,0.000035458976,0.00031082498,0.00017421911,0.000018948096,0.00031746476,0.012527918,0.00028200913,0.011846078,0.00953548,0.96468467],"study_design_scores_gemma":[0.00031783863,0.000027404232,0.00012825124,0.000094286755,0.000021618245,0.0000025344548,0.00001933707,0.9221727,0.0042568115,0.000043254215,0.072721325,0.00019459403],"about_ca_topic_score_codex":0.00001888418,"about_ca_topic_score_gemma":0.00001152035,"teacher_disagreement_score":0.96449006,"about_ca_system_score_codex":0.000026191246,"about_ca_system_score_gemma":0.00003892922,"threshold_uncertainty_score":0.58349663},"labels":[],"label_agreement":null},{"id":"W4414149036","doi":"10.21203/rs.3.rs-7172530/v1","title":"Group Querying in Tridimensional Social Networks","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Data Management and Algorithms","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":"Université du Québec en Outaouais","funders":"","keywords":"Metric (unit); Similarity (geometry); Scalability; Group (periodic table); Process (computing); Meaning (existential); Empirical research","score_opus":0.07863004852963112,"score_gpt":0.39979602427041877,"score_spread":0.32116597574078765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414149036","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.004330411,0.002975761,0.93792766,0.011751133,0.0038867826,0.003411701,0.00019829957,0.0006733157,0.034844946],"genre_scores_gemma":[0.84103405,0.003298616,0.11134739,0.0013923702,0.0062492425,0.0021501414,0.0027683235,0.00013069605,0.031629134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611914,0.0006187225,0.0003268685,0.00093705737,0.001194339,0.0008038734],"domain_scores_gemma":[0.9984975,0.0003488388,0.00006361378,0.0008225773,0.00018262745,0.00008488371],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0032975974,0.00020934262,0.00030609415,0.00093383034,0.00030843937,0.00071079406,0.0025428447,0.0002623342,0.00003207006],"category_scores_gemma":[0.00010949497,0.00021269596,0.0001322943,0.001305181,0.00008117887,0.00036276245,0.011947666,0.0017308268,0.000028215356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060604165,0.00046918562,0.0013030164,0.0012842527,0.000100498604,0.0005163848,0.0006541512,0.0038573784,0.000011677888,0.51924634,0.11032288,0.36217365],"study_design_scores_gemma":[0.0009972746,0.000103192404,0.009405742,0.0014929201,0.0000063050047,0.0000015303085,0.0001555472,0.8716514,0.000012333909,0.05380727,0.061684307,0.0006821848],"about_ca_topic_score_codex":0.0003187924,"about_ca_topic_score_gemma":0.00012768725,"teacher_disagreement_score":0.86779404,"about_ca_system_score_codex":0.00026688032,"about_ca_system_score_gemma":0.00028084705,"threshold_uncertainty_score":0.9960435},"labels":[],"label_agreement":null},{"id":"W4414266787","doi":"10.14778/3750601.3750638","title":"SQL:Trek Automated Index Design at Airbnb","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"Air Canada","funders":"","keywords":"Index (typography); Scalability; Index selection; False positive paradox; Selection (genetic algorithm); Database index; Compiler; Relational database","score_opus":0.011183793592322706,"score_gpt":0.22989208488466692,"score_spread":0.2187082912923442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414266787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09391152,0.0014062906,0.49477482,0.04851554,0.007466677,0.008349009,0.000042305317,0.007322901,0.33821094],"genre_scores_gemma":[0.94988614,0.00005203732,0.035834104,0.00093905977,0.00004267291,0.00010579652,0.0000019063585,0.0000134043175,0.013124888],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874806,0.00000896589,0.00025617183,0.00034632138,0.00036168986,0.00027880847],"domain_scores_gemma":[0.99937415,0.000034744382,0.00016546533,0.00028317844,0.00010178428,0.00004068915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039438205,0.00015342745,0.00016317112,0.00014418873,0.0001651807,0.00016570257,0.001996736,0.000035887246,0.000011883264],"category_scores_gemma":[0.00004769432,0.000107206026,0.0000785027,0.0007392616,0.000056989233,0.00048799376,0.0020723739,0.00008212798,0.000027246571],"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.000072010334,0.0005130765,0.010418103,0.00042493502,0.00040788445,0.000004529574,0.0010985931,0.00042074014,0.024659628,0.306394,0.5821592,0.07342727],"study_design_scores_gemma":[0.0025296554,0.00020708084,0.02239292,0.0004769096,0.000116302064,0.000010076249,0.00020324248,0.5147537,0.3541705,0.03187958,0.07259785,0.00066221436],"about_ca_topic_score_codex":0.00002275244,"about_ca_topic_score_gemma":9.749665e-7,"teacher_disagreement_score":0.8559746,"about_ca_system_score_codex":0.00011267105,"about_ca_system_score_gemma":0.000027929878,"threshold_uncertainty_score":0.4371735},"labels":[],"label_agreement":null},{"id":"W4414360375","doi":"10.24963/ijcai.2025/999","title":"Bidirectional Search while Ensuring Meet-In-The-Middle via Effective and Efficient-to-Compute Termination Conditions","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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 Prince Edward Island","funders":"","keywords":"Property (philosophy); Heuristic; Range (aeronautics); Inefficiency; Search algorithm; Quality (philosophy)","score_opus":0.015822225543947615,"score_gpt":0.26390766193258963,"score_spread":0.24808543638864203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414360375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14114484,0.000023248798,0.83866894,0.0021423209,0.00038841035,0.000611794,0.000006035271,0.00011459175,0.016899839],"genre_scores_gemma":[0.99011517,0.0000017764366,0.008530261,0.00042751885,0.000032838427,0.00006225228,0.000010063641,0.000002562418,0.000817585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910235,0.00008901724,0.0001219602,0.0003122066,0.00019916939,0.00017531638],"domain_scores_gemma":[0.9994458,0.00023538836,0.000016452686,0.00022893434,0.000043422588,0.0000300356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724864,0.00008026206,0.00007773771,0.00035825817,0.00020412715,0.0002537363,0.00040123198,0.000019679983,0.000007091896],"category_scores_gemma":[0.000015784275,0.00006544025,0.000020913549,0.00083947973,0.000028730221,0.00026527574,0.0003285115,0.00007025478,0.000029787903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013404537,0.0006233295,0.0060756314,0.00013293652,0.00009118593,0.00005443555,0.0033633322,0.0075348057,0.0016050519,0.59892374,0.009318159,0.372264],"study_design_scores_gemma":[0.000616836,0.00007846581,0.15890242,0.00008216599,0.000010129165,0.000011687074,0.0001542113,0.8303396,0.0024508631,0.0034485685,0.0036922556,0.00021276424],"about_ca_topic_score_codex":0.000045503588,"about_ca_topic_score_gemma":0.000029587978,"teacher_disagreement_score":0.8489703,"about_ca_system_score_codex":0.000035879904,"about_ca_system_score_gemma":0.000013803948,"threshold_uncertainty_score":0.2668576},"labels":[],"label_agreement":null},{"id":"W4414638560","doi":"10.1007/978-981-96-9248-4_45","title":"Exploring Complex Fuzzy Sets for Enhanced Rank Data Generation Using Visualization Ranking Comparison","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Data Management and Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Ranking (information retrieval); Rank (graph theory); Visualization; Fuzzy logic; Key (lock); Data visualization","score_opus":0.2603575309839385,"score_gpt":0.3457335903140132,"score_spread":0.0853760593300747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414638560","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.00003411895,0.00344814,0.99150443,0.00003974137,0.002533108,0.0010261267,0.000044857767,0.00008411331,0.0012853425],"genre_scores_gemma":[0.8906125,0.0030774802,0.081733875,0.0005791863,0.0070985784,0.00022476642,0.014412381,0.00018002678,0.002081198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783516,0.00006750293,0.0006366309,0.0008995899,0.00025673505,0.0003043606],"domain_scores_gemma":[0.99835646,0.00026075073,0.0003508027,0.0009086473,0.000082948405,0.000040366802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006664811,0.00035412714,0.0006163549,0.0002599559,0.0002432792,0.0007807495,0.0008217603,0.00022049327,0.00000174831],"category_scores_gemma":[0.000036277786,0.0003467521,0.000049640017,0.00015646669,0.000025084104,0.0007525783,0.0006037093,0.0002231621,5.1401224e-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.000023225208,0.000020835823,0.000043779768,0.0006901215,0.00016376116,0.000006959961,0.0003661424,0.6038365,0.00015366392,0.08863683,0.0015784841,0.30447972],"study_design_scores_gemma":[0.00041708816,0.000024657687,0.000005599548,0.000834935,0.00004967569,0.0000018124193,0.0000032704454,0.9851254,0.000014334284,0.00088550366,0.0122903185,0.00034735535],"about_ca_topic_score_codex":0.00005325182,"about_ca_topic_score_gemma":0.000129018,"teacher_disagreement_score":0.90977055,"about_ca_system_score_codex":0.00007109122,"about_ca_system_score_gemma":0.000029275165,"threshold_uncertainty_score":0.99989843},"labels":[],"label_agreement":null},{"id":"W4414874910","doi":"10.1007/s10115-025-02552-w","title":"LINDAS: a learned approach to index algorithm selection","year":2025,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Management and Algorithms","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","funders":"National Natural Science Foundation of China","keywords":"Search engine indexing; Index (typography); Selection (genetic algorithm); Hash function; Index selection; Range (aeronautics)","score_opus":0.012550522390299163,"score_gpt":0.2511002347204886,"score_spread":0.23854971233018943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414874910","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.00007132782,0.0001371476,0.8365177,0.000099455436,0.0005633287,0.00032071682,0.000002663563,0.0001480274,0.16213961],"genre_scores_gemma":[0.85140175,0.00023810587,0.094872355,0.002469576,0.0008318606,0.0008217132,0.00027965545,0.00002323446,0.049061727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992145,0.000036196765,0.0002921486,0.00015920601,0.00013764936,0.00016035771],"domain_scores_gemma":[0.9994842,0.000016044974,0.00006507611,0.00021689187,0.00015648818,0.000061343046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041517467,0.00010161928,0.00012845549,0.0004508929,0.00015693741,0.0007615437,0.00033740522,0.00005536457,8.740039e-7],"category_scores_gemma":[0.000019328805,0.00009124732,0.0000212673,0.00097333314,0.00000966753,0.0039059825,0.0002536025,0.00007779367,0.00021361308],"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.000002618065,0.00003751556,0.00016420489,0.00016752744,0.000027105285,8.650459e-8,0.0018137451,0.00014769862,0.000002454457,0.14056532,0.02589077,0.83118093],"study_design_scores_gemma":[0.00020026613,0.000018353709,0.0005297449,0.000026903073,0.0000025284555,0.0000022179688,0.0001827867,0.5257933,0.000013349312,0.000054635195,0.47309965,0.00007626199],"about_ca_topic_score_codex":0.000027478303,"about_ca_topic_score_gemma":0.0000010467595,"teacher_disagreement_score":0.85133046,"about_ca_system_score_codex":0.00003892784,"about_ca_system_score_gemma":0.000044262906,"threshold_uncertainty_score":0.7343584},"labels":[],"label_agreement":null},{"id":"W4414898614","doi":"10.1109/cluster59342.2025.11186497","title":"Cascade: a Collaborative Algorithm for Scalable and Efficient Neighborhood Allgather","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Queen's University","funders":"Alliance de recherche numérique du Canada","keywords":"Speedup; Scalability; Cascade; Multiplication (music); Sparse matrix; Feature (linguistics); Message passing","score_opus":0.006544639729131289,"score_gpt":0.24746304096440166,"score_spread":0.24091840123527036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414898614","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.00012171371,0.000255432,0.9731305,0.0018471987,0.00026867882,0.00047621233,0.000019529738,0.00011801919,0.023762694],"genre_scores_gemma":[0.0149133345,0.00005373499,0.9390912,0.002449329,0.00007711256,0.00019555497,0.000017404858,0.000013062395,0.043189265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991201,0.00001848804,0.00013068231,0.0003849964,0.00011595806,0.0002297679],"domain_scores_gemma":[0.99943674,0.000080139034,0.00003092755,0.00031090603,0.00009287211,0.000048434355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021779008,0.000113597955,0.00012834875,0.00010904743,0.00013899973,0.00033953972,0.00043519234,0.000033507615,0.00001275395],"category_scores_gemma":[0.000017117065,0.00009209425,0.000026126652,0.00062071905,0.000035261834,0.00028129382,0.00039306912,0.00004091368,0.000013291901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000225534,0.000081060934,0.000028467877,0.000015369305,0.00005000099,0.000002898953,0.0001475161,0.000021408243,0.00003310761,0.37996414,0.021905914,0.59774786],"study_design_scores_gemma":[0.0007523587,0.000058449008,0.00015772994,0.0000147099945,0.000013093941,7.368143e-7,0.000118705764,0.9216009,0.0009973719,0.004934127,0.07121042,0.00014140668],"about_ca_topic_score_codex":0.000012953418,"about_ca_topic_score_gemma":0.0000043307414,"teacher_disagreement_score":0.9215795,"about_ca_system_score_codex":0.000019061092,"about_ca_system_score_gemma":0.000049716433,"threshold_uncertainty_score":0.37554944},"labels":[],"label_agreement":null},{"id":"W4415048008","doi":"10.1109/tits.2025.3615448","title":"RouteKG: A Knowledge Graph-Based Framework for Route Prediction on Road Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Data Management and Algorithms","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":"McGill University","funders":"University Research Committee, University of Hong Kong; National Natural Science Foundation of China","keywords":"Intelligent transportation system; ENCODE; Construct (python library); Variety (cybernetics); Graph; Baseline (sea); Focus (optics); Traffic congestion; Trajectory; Flow network","score_opus":0.026743408871309295,"score_gpt":0.28493064231384835,"score_spread":0.2581872334425391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415048008","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.00031884538,0.00014743386,0.9879919,0.00027451507,0.008380377,0.0015584682,0.00031653218,0.00060018763,0.00041168337],"genre_scores_gemma":[0.988046,0.00008650007,0.008692363,0.00029946314,0.0001349172,0.0011299526,0.00017481232,0.000030755415,0.0014052613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976233,0.000094778086,0.00077560946,0.0007640339,0.000349526,0.0003927283],"domain_scores_gemma":[0.99842876,0.00031970523,0.00016310622,0.00077106454,0.00020197334,0.0001153673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041518628,0.0003445619,0.00033121623,0.00070814294,0.00039079107,0.00032520725,0.00070590276,0.00022138427,0.0000121319845],"category_scores_gemma":[0.0000047025433,0.00034198654,0.00033389544,0.0012679294,0.000043811007,0.0004902346,7.2095816e-7,0.0003303008,0.000043822212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020678868,0.00068037823,0.000067501125,0.00022915879,0.00024913,0.0000038854687,0.00044514434,0.7804428,0.0000117822665,0.1200187,0.0010111593,0.09663359],"study_design_scores_gemma":[0.0009091888,0.0005651828,0.00060867995,0.00090660143,0.0001576797,5.242721e-7,0.00019137793,0.9766755,0.0025784438,0.0013514082,0.015628347,0.0004270645],"about_ca_topic_score_codex":0.00007884179,"about_ca_topic_score_gemma":0.00008188047,"teacher_disagreement_score":0.9877271,"about_ca_system_score_codex":0.00014396949,"about_ca_system_score_gemma":0.000085578,"threshold_uncertainty_score":0.9999032},"labels":[],"label_agreement":null},{"id":"W4415147752","doi":"10.1145/3748777.3748782","title":"The Batch Insertion Operator for Shared Mobility Route Planning on Time-Dependent Road Networks","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Route planning; Operator (biology); Routing (electronic design automation); Key (lock); Sequence (biology)","score_opus":0.013986780086820957,"score_gpt":0.2688720991100636,"score_spread":0.25488531902324263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415147752","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.0025713753,0.00007508545,0.9862577,0.001978467,0.0007060329,0.0005933799,0.000007767278,0.00020898992,0.007601202],"genre_scores_gemma":[0.83590287,0.00005101693,0.030114092,0.007629957,0.00047735532,0.00075094023,0.00022159741,0.000030941854,0.124821216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990327,0.0000405429,0.00018061906,0.00036144833,0.00014824246,0.0002364975],"domain_scores_gemma":[0.99914396,0.00013053336,0.00003505336,0.00061043963,0.000047606365,0.000032431213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061587786,0.00010471566,0.000092943104,0.00003889316,0.00035596773,0.00073225197,0.0010066815,0.00003584322,0.000013926009],"category_scores_gemma":[0.00003855029,0.000068728186,0.000045549717,0.00021470938,0.000014158749,0.0005070747,0.00042096086,0.00008186574,0.000037088073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001135757,0.00023364362,0.0008719683,0.000026575084,0.00013460082,0.000005560647,0.00017905419,0.021158632,0.00011104062,0.075682655,0.16361621,0.73786646],"study_design_scores_gemma":[0.00031780763,0.00005839115,0.0037218945,0.000022896606,0.0000055424784,1.188461e-7,0.000024685352,0.97536427,0.00021854008,0.00074733526,0.019419022,0.000099495366],"about_ca_topic_score_codex":0.000027811853,"about_ca_topic_score_gemma":0.000010042685,"teacher_disagreement_score":0.9561436,"about_ca_system_score_codex":0.000046851044,"about_ca_system_score_gemma":0.000025515854,"threshold_uncertainty_score":0.70611227},"labels":[],"label_agreement":null},{"id":"W4415180125","doi":"10.23919/ecc65951.2025.11187259","title":"Robust Shortest Path with Incremental Information Revelation","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Shortest path problem; Pruning; Partially observable Markov decision process; Markov decision process; Graph; Path (computing); Dynamic programming; Markov process; State space","score_opus":0.011217913153176613,"score_gpt":0.19917325262242164,"score_spread":0.18795533946924503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415180125","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.00084244134,0.0000030385374,0.90386796,0.00064629375,0.00008852231,0.00011424092,0.0000013584722,0.00011806014,0.09431811],"genre_scores_gemma":[0.62115014,0.000009499144,0.37163785,0.0021776306,0.000027109927,0.000020837688,0.0001796556,0.000002664525,0.0047946083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956644,0.0000075067155,0.00010823223,0.0000964427,0.00013452386,0.00008686261],"domain_scores_gemma":[0.99969363,0.000008720426,0.000029569883,0.00022111327,0.00003143975,0.00001549752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013132907,0.000052855044,0.00004142422,0.000100424535,0.00006606511,0.0002636359,0.00029915877,0.000012604072,0.000018821918],"category_scores_gemma":[0.000005353703,0.00003996461,0.0000086497275,0.00036112164,0.000008827249,0.0033187487,0.00018016527,0.00003292469,0.000056993213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058274813,0.000044273893,0.009255043,0.000017823368,0.000030721632,0.0000026236303,0.00015342103,0.0007031004,0.000019172818,0.67973834,0.039454874,0.27057478],"study_design_scores_gemma":[0.00092040334,0.00011977122,0.06890577,0.00007310307,0.000017468456,0.0000026365428,0.00022394778,0.8560753,0.00052596064,0.0018089977,0.0710178,0.00030887252],"about_ca_topic_score_codex":0.000031033047,"about_ca_topic_score_gemma":0.000011560119,"teacher_disagreement_score":0.8553722,"about_ca_system_score_codex":0.0000220067,"about_ca_system_score_gemma":0.000019472298,"threshold_uncertainty_score":0.25422472},"labels":[],"label_agreement":null},{"id":"W4415250303","doi":"10.1007/978-3-032-00385-0_19","title":"Variable Neighborhood Search","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Metaheuristic; Local search (optimization); Variable (mathematics); Mathematical proof; Linear programming; Graph; Nonlinear programming","score_opus":0.016921106003505958,"score_gpt":0.22826170864385356,"score_spread":0.2113406026403476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415250303","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":[1.1846362e-9,0.00005889968,0.45885018,0.00032480853,0.00030298083,0.00008896009,0.000009788645,0.00014419408,0.5402202],"genre_scores_gemma":[0.000002548981,0.00006386562,0.10376333,0.0007121717,0.000109880166,0.0000029544951,0.000050691,0.000009622181,0.89528495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998697,0.000006737854,0.00017668639,0.0005429667,0.00033505296,0.00024156648],"domain_scores_gemma":[0.99867374,0.000047447964,0.0000375598,0.0011170623,0.00006345399,0.000060724407],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019610315,0.00020848817,0.0002044711,0.00022338127,0.00007288851,0.0004007847,0.0019330181,0.0001216533,0.0013473025],"category_scores_gemma":[0.0000047951153,0.00018732705,0.00006754572,0.0000887358,0.000021061836,0.0004166548,0.0018478001,0.00023749591,0.0010179554],"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":[2.8344866e-7,0.0000052134433,4.1341696e-7,0.00002133909,0.000035684727,0.00001225056,0.0000034112497,0.0000011102426,3.100711e-7,0.8210803,0.103059664,0.07578002],"study_design_scores_gemma":[0.00008605844,0.000018340637,0.0000011790065,0.000050970077,0.000011812115,8.1990703e-7,6.7103304e-7,0.012455199,0.0000050843455,0.20750478,0.7796654,0.00019969321],"about_ca_topic_score_codex":0.0000175578,"about_ca_topic_score_gemma":0.0000014884204,"teacher_disagreement_score":0.67660576,"about_ca_system_score_codex":0.00003058613,"about_ca_system_score_gemma":0.00012134376,"threshold_uncertainty_score":0.99975985},"labels":[],"label_agreement":null},{"id":"W4415303479","doi":"10.1002/pra2.1451","title":"A <scp>GenAI</scp> Approach to Suggesting Broad and Narrow Queries for Exploratory Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the Association for Information Science and Technology","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Exploratory search; Timeline; Web search query; Semantic search; Interface (matter); Filter (signal processing); Search engine; Search engine indexing; Control (management); Relevance (law)","score_opus":0.012309618062336146,"score_gpt":0.24383383150836554,"score_spread":0.2315242134460294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415303479","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.6669195,0.00019871295,0.22612445,0.036684535,0.00090164866,0.0060314992,0.00008139711,0.0008652225,0.06219303],"genre_scores_gemma":[0.9341096,0.000018058681,0.063698895,0.0007876239,0.000016886475,0.0003769258,0.000003479231,0.0000037248305,0.0009848053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999087,0.0000017560891,0.00021143058,0.00017249107,0.00029976844,0.00022755354],"domain_scores_gemma":[0.9983436,0.00008729574,0.0002210956,0.000096659925,0.0012253645,0.000026021187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019922948,0.00006739872,0.00010436827,0.00066894176,0.00048654075,0.00041667838,0.0008352524,0.00006264702,1.761444e-8],"category_scores_gemma":[0.003291383,0.00005454118,0.000016593118,0.0022952359,0.00014549638,0.0038685906,0.00065198314,0.00006147958,5.7827515e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015888402,0.000012618753,0.005472004,0.00018399666,0.000010195239,1.864479e-9,0.002116199,0.000004171796,0.0012545262,0.95180786,0.007778462,0.031358358],"study_design_scores_gemma":[0.0027965254,0.0005301109,0.016765557,0.00022690449,0.00007193084,0.000005664484,0.03765809,0.20434281,0.17886794,0.11818605,0.44012314,0.00042530138],"about_ca_topic_score_codex":0.0000017413973,"about_ca_topic_score_gemma":2.95344e-7,"teacher_disagreement_score":0.83362186,"about_ca_system_score_codex":0.00007492427,"about_ca_system_score_gemma":0.000082684885,"threshold_uncertainty_score":0.40180394},"labels":[],"label_agreement":null},{"id":"W4415439859","doi":"10.1177/23998083251387986","title":"Route network simplification for transport planning","year":2025,"lang":"en","type":"article","venue":"Environment and Planning B Urban Analytics and City Science","topic":"Data Management and Algorithms","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":"Esri (Canada)","funders":"Economic and Social Research Council","keywords":"Visualization; Transport network; Representation (politics); Data visualization; Voronoi diagram; Graph drawing; Resource (disambiguation); Flow network","score_opus":0.024271326318475516,"score_gpt":0.2510681349085155,"score_spread":0.22679680859003998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415439859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04092237,0.00048671264,0.95594996,0.00051789277,0.00016187874,0.000173032,0.0000080988275,0.00003713997,0.0017429154],"genre_scores_gemma":[0.97247523,0.000080186204,0.024844948,0.00039592054,0.000071377646,0.000008803253,0.000022020004,0.0000032094188,0.0020983082],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989112,0.0000057958946,0.00015646398,0.00045984343,0.00018514109,0.0002815412],"domain_scores_gemma":[0.9995322,0.00006052792,0.000060169372,0.0002561304,0.000009856117,0.00008107853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064966053,0.000111042056,0.00011883241,0.00011346774,0.00052961754,0.0002753794,0.000439092,0.000027894406,0.000001891889],"category_scores_gemma":[0.00001175316,0.000104465,0.000022598237,0.00030806128,0.0001933735,0.000497951,0.00015724536,0.000066410066,8.19586e-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.00001699091,0.000052189695,0.7811172,0.000050443414,0.00005060564,0.000009238862,0.001095351,0.010587153,0.00023844429,0.17639278,0.005953103,0.02443652],"study_design_scores_gemma":[0.00030559054,0.00005490653,0.40351716,0.00005684182,0.000039121067,9.550313e-7,0.00007932624,0.5349566,0.00006901013,0.007486459,0.053193554,0.00024049636],"about_ca_topic_score_codex":0.000006089228,"about_ca_topic_score_gemma":4.1781414e-7,"teacher_disagreement_score":0.9315529,"about_ca_system_score_codex":0.000021391004,"about_ca_system_score_gemma":0.000019196195,"threshold_uncertainty_score":0.4259959},"labels":[],"label_agreement":null},{"id":"W4416039378","doi":"10.1007/978-3-032-06161-4_26","title":"Evaluating the Accuracy of Random User Trajectories in Cluster-Based Continuous Query Processing","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Focus (optics); Path (computing); Trajectory; Nearest neighbour; k-nearest neighbors algorithm; Online aggregation","score_opus":0.05138139314045795,"score_gpt":0.31106526572596693,"score_spread":0.25968387258550896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416039378","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.00010876799,0.019244457,0.9647307,0.010992763,0.0001429342,0.0009999084,0.00023806769,0.0013230472,0.0022193808],"genre_scores_gemma":[0.36496335,0.0068968097,0.62452155,0.00039948407,0.00004818123,0.00027447238,0.0013640433,0.00008226367,0.0014498373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988628,0.000030739135,0.00035675237,0.00039671516,0.00018823259,0.00016476342],"domain_scores_gemma":[0.99237376,0.002279078,0.00021722997,0.0050580436,0.00006294884,0.0000089540345],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005240107,0.000270424,0.0003510964,0.00038767382,0.00014967579,0.00022082333,0.0058860513,0.0002010205,6.581278e-7],"category_scores_gemma":[0.0017392795,0.00019663983,0.000037385707,0.00026163322,0.00017990217,0.0003060535,0.003182181,0.00071549235,6.2453864e-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.000013233718,0.000028061071,0.000013706461,0.00024247148,0.00004447011,0.0000011568089,0.00008175417,0.005400109,0.000044503315,0.04637258,0.00014217496,0.9476158],"study_design_scores_gemma":[0.0008500007,0.00013159035,0.000032962278,0.0021955117,0.000089959525,0.000002438389,0.000047918602,0.95141804,0.00041710175,0.007542219,0.03679103,0.00048121833],"about_ca_topic_score_codex":0.000021267399,"about_ca_topic_score_gemma":0.000036583217,"teacher_disagreement_score":0.94713455,"about_ca_system_score_codex":0.000026172529,"about_ca_system_score_gemma":0.00007765151,"threshold_uncertainty_score":0.9994926},"labels":[],"label_agreement":null},{"id":"W4416371852","doi":"10.2316/j.2026.206-1247","title":"GRASPING TASK PLANNING ALGORITHM FOR DEXTEROUS HAND BASED ON SCENE UNDERSTANDING AND SEMANTIC INFORMATION. 295-306","year":2025,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Task (project management); Feature (linguistics); Key (lock); Complete information; Semantics (computer science)","score_opus":0.019458827815113863,"score_gpt":0.27649595280646144,"score_spread":0.25703712499134757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416371852","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.0009415577,0.000055331915,0.9955355,0.0024516713,0.0007782615,0.00009074248,0.0000045307097,0.0000174247,0.00012496601],"genre_scores_gemma":[0.7473397,0.00002999079,0.2519385,0.0005713074,0.00007629785,0.0000020072207,0.000019642815,0.0000033198132,0.000019238554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992402,0.000014510236,0.00030662693,0.00008846148,0.00026043967,0.0000897476],"domain_scores_gemma":[0.99935204,0.000119090815,0.00025317818,0.000067488196,0.00017648334,0.00003172705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033329625,0.00008049809,0.00010494944,0.00046365752,0.00013849193,0.0008887886,0.0002525137,0.00002751108,4.9691226e-7],"category_scores_gemma":[0.000054493106,0.00007287036,0.00003170534,0.000105990446,0.000024318211,0.0012919606,0.000075929594,0.00006648318,4.403103e-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.000035835816,0.00008549171,0.0013064746,0.00011475203,0.00023213516,0.000021004458,0.00055169285,0.13093711,0.00012576739,0.1200098,0.0010733982,0.7455065],"study_design_scores_gemma":[0.0008961462,0.000081507096,0.0020627966,0.0003574636,0.000017493052,0.000013088775,0.00008564375,0.9868715,0.00008165848,0.009166758,0.00029541703,0.00007053446],"about_ca_topic_score_codex":0.0000020627372,"about_ca_topic_score_gemma":4.2268732e-7,"teacher_disagreement_score":0.8559344,"about_ca_system_score_codex":0.000072635085,"about_ca_system_score_gemma":0.000036632067,"threshold_uncertainty_score":0.8570609},"labels":[],"label_agreement":null},{"id":"W4416956238","doi":"10.1145/3769102.3774388","title":"Poster: Leveraging Geo-Spatiality in Geo-Distributed Vector Databases","year":2025,"lang":"","type":"article","venue":"","topic":"Data Management and Algorithms","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":true,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Embedding; Replication (statistics); k-nearest neighbors algorithm; Routing (electronic design automation); Throughput; Web query classification; Query expansion; Nearest neighbor search","score_opus":0.035788439689870825,"score_gpt":0.28698101447256547,"score_spread":0.25119257478269463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416956238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010278721,0.00055194733,0.96410394,0.008983928,0.0031817222,0.00075337465,0.0007245691,0.00025822033,0.011163568],"genre_scores_gemma":[0.97846025,0.00020584502,0.009975788,0.0030531806,0.00018841632,0.000033471002,0.0012216502,0.000017831495,0.006843578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582314,0.00027760965,0.00092715444,0.0014672864,0.0005207122,0.0009840898],"domain_scores_gemma":[0.9972521,0.00022290724,0.00017885874,0.002071728,0.00012615952,0.00014826834],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011465611,0.00046782507,0.00052130304,0.00050922006,0.0002918091,0.001216901,0.002419622,0.00008375657,0.000575958],"category_scores_gemma":[0.00018888964,0.00048178178,0.0001261929,0.0023230845,0.00012326693,0.0028112323,0.004685137,0.0004041503,0.00020729692],"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.000120906574,0.0019764008,0.085021995,0.0009484979,0.00040753512,0.00063429156,0.00079585885,0.00034062297,0.00021955316,0.20561075,0.085848145,0.61807543],"study_design_scores_gemma":[0.0027640485,0.000099863486,0.3449517,0.0007353929,0.000101640064,0.00000472259,0.00020265908,0.5075799,0.0016739274,0.0016271953,0.13899055,0.0012683542],"about_ca_topic_score_codex":0.0052894293,"about_ca_topic_score_gemma":0.0008184496,"teacher_disagreement_score":0.9681815,"about_ca_system_score_codex":0.00020627398,"about_ca_system_score_gemma":0.0002683351,"threshold_uncertainty_score":0.99981993},"labels":[],"label_agreement":null},{"id":"W4417496854","doi":"10.1145/3785662","title":"Semi-Oblivious Chase Termination for Linear Existential Rules and Beyond: An Experimental Analysis","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Data Management and Algorithms","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Existentialism; Chase; Set (abstract data type); Generalization; Linearization; Class (philosophy); Focus (optics)","score_opus":0.023561886560447394,"score_gpt":0.30921964395633783,"score_spread":0.28565775739589044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417496854","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.009767524,0.00017434634,0.9870277,0.00021963038,0.0007089726,0.0005413606,0.0011965707,0.00016064543,0.00020327274],"genre_scores_gemma":[0.93248063,0.000048306454,0.063268416,0.0001886226,0.00010591331,0.00040413128,0.001724005,0.000015399153,0.0017645571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862945,0.000073881754,0.00028195715,0.00058567047,0.00021861786,0.00021044063],"domain_scores_gemma":[0.99843156,0.0000911571,0.00007519678,0.0012664833,0.000049589176,0.00008603382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003309369,0.00017251018,0.00022500473,0.00066050753,0.00034280948,0.0003591552,0.00073500484,0.000047361154,0.000009650723],"category_scores_gemma":[0.000012962694,0.00016941434,0.00009862363,0.0006345482,0.000038526476,0.0013236965,0.00005379794,0.00007860427,0.0000083736695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055532646,0.009360514,0.00035791608,0.0020159981,0.007024628,0.00020140628,0.0046804273,0.010674972,0.028546542,0.16964263,0.009514221,0.7574254],"study_design_scores_gemma":[0.0016109127,0.00030326328,0.000114892275,0.0000802726,0.00060871296,0.000009322295,0.0009705128,0.97539127,0.0075085014,0.00015949694,0.012803142,0.0004396963],"about_ca_topic_score_codex":0.00016666038,"about_ca_topic_score_gemma":0.00004062989,"teacher_disagreement_score":0.9647163,"about_ca_system_score_codex":0.000040483683,"about_ca_system_score_gemma":0.000023774295,"threshold_uncertainty_score":0.6908516},"labels":[],"label_agreement":null},{"id":"W49657471","doi":"10.1609/aiide.v6i1.12400","title":"A Comparison of High-Level Approaches for Speeding Up Pathfinding","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Data Management and Algorithms","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 Alberta","funders":"","keywords":"Pathfinding; Computer science; Heuristics; Abstraction; Waypoint; Graph; Theoretical computer science; Variety (cybernetics); Artificial intelligence; Shortest path problem","score_opus":0.16633179665656853,"score_gpt":0.3307709812536276,"score_spread":0.16443918459705906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49657471","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.8015455,0.000008475296,0.187382,0.0016220324,0.0013363981,0.0009957657,0.00010088382,0.000044090633,0.0069648637],"genre_scores_gemma":[0.99695724,0.000005321332,0.0026743822,0.00003848238,0.000049495382,0.00003649742,0.0000053639983,0.000009155625,0.00022406317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846977,0.000004381944,0.00051667343,0.00043039644,0.0003239222,0.00025486274],"domain_scores_gemma":[0.9989178,0.0001261484,0.00047226893,0.00019228028,0.00022730246,0.00006420619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024647982,0.00020952105,0.0003091953,0.00014071907,0.00011585094,0.000525424,0.0011040911,0.000050018974,0.000011507662],"category_scores_gemma":[0.00023553122,0.00015440969,0.00011807335,0.0001886886,0.00018756263,0.0014045258,0.0006001595,0.00022609397,0.000005018102],"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.00009131309,0.00030042883,0.0007425247,0.000053266693,0.00004418956,8.584564e-8,0.002056476,0.0000049062583,0.011276254,0.6715689,0.00008902441,0.31377265],"study_design_scores_gemma":[0.00012679968,0.0007090482,0.0005828162,0.0003193859,0.0000253744,0.00000250536,0.0066362703,0.1266878,0.78031886,0.083909556,0.000365365,0.00031622328],"about_ca_topic_score_codex":0.00001230061,"about_ca_topic_score_gemma":0.000003761738,"teacher_disagreement_score":0.7690426,"about_ca_system_score_codex":0.000023612964,"about_ca_system_score_gemma":0.000019261548,"threshold_uncertainty_score":0.6296645},"labels":[],"label_agreement":null},{"id":"W5261904","doi":"10.1016/0030-4220(70)90406-8","title":"Recent developments in the von Mises transformation and its applications in the computational sciences","year":2009,"lang":"en","type":"article","venue":"International Conference on Mathematical methods, Computational techniques and Intelligent systems","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"von Mises yield criterion; Computer science; Transformation (genetics); Applied mathematics; Jacobian matrix and determinant; Mathematical economics; Mathematics; Engineering; Finite element method; Structural engineering","score_opus":0.14571765047391075,"score_gpt":0.4207321048796926,"score_spread":0.27501445440578187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5261904","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.0009574896,0.00021479558,0.9763027,0.008182057,0.00006372077,0.001034956,0.000008179886,0.000051077255,0.013185022],"genre_scores_gemma":[0.5906492,0.0007677624,0.4068466,0.0012369921,0.000056890018,0.00033557753,0.0000639228,0.000005647016,0.00003738625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979114,0.00036829227,0.00056357624,0.00033339314,0.0006573969,0.0001659371],"domain_scores_gemma":[0.99859124,0.0009637605,0.00013784716,0.00012806735,0.00014575258,0.000033320044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025659197,0.00016839373,0.0001746383,0.00029570755,0.00016693198,0.0006533475,0.0009957151,0.000047211808,0.0000084243],"category_scores_gemma":[0.00007683121,0.000104212144,0.000027303702,0.00041894458,0.00007911594,0.00050796755,0.000065135195,0.00017705711,0.0000070215983],"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.000003142372,0.000114105685,0.000013760287,0.000017649607,0.0000053479444,0.0000019083686,0.0009307923,0.0005139092,0.0000043036257,0.8592466,0.00003260893,0.13911584],"study_design_scores_gemma":[0.00010713089,0.00010363264,0.0006288361,0.00014664323,0.0000031414297,0.000044348097,0.00078146096,0.4550217,0.000053151845,0.53629506,0.006682269,0.0001326297],"about_ca_topic_score_codex":0.000004931706,"about_ca_topic_score_gemma":8.9877454e-7,"teacher_disagreement_score":0.5896917,"about_ca_system_score_codex":0.000042062777,"about_ca_system_score_gemma":0.00004039116,"threshold_uncertainty_score":0.63002455},"labels":[],"label_agreement":null},{"id":"W571841459","doi":"","title":"Innover dans la collecte de données transport pour des données actuelles et de meilleure qualité","year":2014,"lang":"fr","type":"article","venue":"Transportation 2014: Past, Present, Future - 2014 Conference and Exhibition of the Transportation Association of Canada // Transport 2014 : Du passé vers l'avenir - 2014 Congrès et Exposition de 'Association des transports du Canada","topic":"Data Management and Algorithms","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":"Humanities; Political science; Art","score_opus":0.011495645274408113,"score_gpt":0.2132189711707632,"score_spread":0.20172332589635508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W571841459","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.7414218,0.00089492457,0.1909536,0.046080813,0.0028992905,0.002077336,0.012003398,0.0002619576,0.0034068634],"genre_scores_gemma":[0.97994393,0.00762762,0.0023801879,0.0016684834,0.00059129915,0.00016342619,0.004093202,0.00013954939,0.0033922968],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.98941875,0.0018696794,0.002816153,0.0013116086,0.002917194,0.0016666079],"domain_scores_gemma":[0.99116063,0.0011843198,0.0035114642,0.0008291018,0.002507924,0.000806544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004663183,0.0012200609,0.0015493463,0.00037170554,0.0009854876,0.0002751483,0.0011897578,0.0009917967,0.000692172],"category_scores_gemma":[0.0001149462,0.0013061636,0.0007200891,0.00084858073,0.00053984736,0.00285695,0.000014077687,0.0010363107,0.000004719532],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060608855,0.00077511603,0.7211038,0.0025144734,0.0014936806,0.00015849948,0.024643308,0.017275093,0.0020932471,0.07781199,0.15027559,0.0012491031],"study_design_scores_gemma":[0.004509205,0.00020822545,0.85814244,0.0008453016,0.0014987243,0.000021435582,0.0022782588,0.001999282,0.0030070788,0.0028357627,0.123314,0.0013402718],"about_ca_topic_score_codex":0.58111984,"about_ca_topic_score_gemma":0.9709024,"teacher_disagreement_score":0.38978258,"about_ca_system_score_codex":0.0031637403,"about_ca_system_score_gemma":0.009838155,"threshold_uncertainty_score":0.9989388},"labels":[],"label_agreement":null},{"id":"W58252060","doi":"10.1007/978-3-642-24873-3_8","title":"Efficiently Eliciting Preferences from a Group of Users","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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; Group (periodic table); Human–computer interaction","score_opus":0.027811000839785306,"score_gpt":0.2309118307609883,"score_spread":0.203100829921203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58252060","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.0006642931,0.0002920186,0.98811644,0.00007556949,0.0014343336,0.0002878034,0.000024118708,0.00012545419,0.008979992],"genre_scores_gemma":[0.24979667,0.00009078233,0.74874187,0.0006119489,0.0004233304,0.000008866898,0.000036520287,0.000036941557,0.00025304029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963721,0.00003081175,0.0005839266,0.0014777699,0.0009852718,0.0005500895],"domain_scores_gemma":[0.99743974,0.0003476944,0.00047181293,0.0014784541,0.00014150438,0.00012081572],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006967221,0.00045318517,0.000530403,0.000756417,0.00014275828,0.00040769222,0.0055209724,0.00018866689,0.000048727325],"category_scores_gemma":[0.000053577547,0.00039925225,0.00012488679,0.00058359455,0.00062505173,0.00090986845,0.0025942288,0.00046371768,0.000038728158],"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.000004121722,0.000040412055,0.0001150192,0.000031633117,0.000021400581,0.000030241115,0.0009057926,0.0010446431,0.000121683894,0.028730948,0.000020135338,0.96893394],"study_design_scores_gemma":[0.0006008816,0.00046956405,0.0009882527,0.0013565429,0.00003913379,0.000009033955,0.0000011660508,0.37499878,0.0036198322,0.6139424,0.0025078321,0.001466619],"about_ca_topic_score_codex":0.00022385792,"about_ca_topic_score_gemma":0.00009890763,"teacher_disagreement_score":0.96746737,"about_ca_system_score_codex":0.00007783643,"about_ca_system_score_gemma":0.00014700423,"threshold_uncertainty_score":0.99985963},"labels":[],"label_agreement":null},{"id":"W585824775","doi":"","title":"Geometric ordering of concepts, logical disjunction, and learning by induction","year":2004,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"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":"Mereology; Computer science; Distributive property; Theoretical computer science; Convexity; Distributive lattice; Representation (politics); Boolean algebra; Closure (psychology); Artificial intelligence; Algorithm; Mathematics; Pure mathematics","score_opus":0.10093473530874908,"score_gpt":0.32903458272633357,"score_spread":0.2280998474175845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W585824775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021330414,0.000042492225,0.97450626,0.0011025786,0.00022497022,0.00010127531,0.000005352055,0.00006573808,0.0026209322],"genre_scores_gemma":[0.99351096,0.00006920581,0.006132955,0.00009491937,0.000047853813,0.000007677532,0.000018607474,0.0000035098572,0.00011431844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987045,0.00004434597,0.00027274602,0.0003346607,0.0004961139,0.00014764522],"domain_scores_gemma":[0.9993235,0.00009555685,0.00012105039,0.000108370434,0.00029863155,0.00005290422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042469334,0.00010590136,0.0001156601,0.00024045275,0.00016213761,0.00016413724,0.00032851342,0.000052491778,0.000060779064],"category_scores_gemma":[0.00040630487,0.00010046694,0.000023895427,0.00077669293,0.00012247024,0.0005661846,0.00012307924,0.0002160041,0.000050060637],"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.0000064771352,0.00007635309,0.000037951937,0.0000049416003,0.0000064754045,7.478725e-7,0.00009647039,0.002625106,0.0012414809,0.7465611,0.000048086422,0.24929479],"study_design_scores_gemma":[0.00028149944,0.0011958898,0.004305908,0.00013712274,0.000016013028,0.000014167477,0.0011307831,0.18767221,0.09386558,0.70538294,0.005141131,0.0008567385],"about_ca_topic_score_codex":0.000045756544,"about_ca_topic_score_gemma":0.0000057307807,"teacher_disagreement_score":0.97218055,"about_ca_system_score_codex":0.000048663962,"about_ca_system_score_gemma":0.000060817798,"threshold_uncertainty_score":0.4096923},"labels":[],"label_agreement":null},{"id":"W62729806","doi":"10.1007/978-3-642-38457-8_17","title":"Construction of Privacy Preserving Hypertree Agent Organization as Distributed Maximum Spanning Tree","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Guelph","funders":"","keywords":"Soundness; Computer science; Hyperbolic tree; Probabilistic logic; Spanning tree; Tree (set theory); Theoretical computer science; Constraint (computer-aided design); Multi-agent system; Distributed computing; Artificial intelligence; Mathematics; Programming language; Discrete mathematics","score_opus":0.015507017129936787,"score_gpt":0.22268750221011288,"score_spread":0.20718048508017609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62729806","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.00043501827,0.00010812306,0.9942207,0.0007326368,0.0013495751,0.00043713133,0.0000120592995,0.00016292058,0.002541839],"genre_scores_gemma":[0.06221456,0.00009295762,0.93578917,0.0004335026,0.000454869,0.000009191242,0.00016408293,0.000057914396,0.0007837633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968392,0.000029887715,0.0005645388,0.0011755449,0.00092172687,0.00046906297],"domain_scores_gemma":[0.99733835,0.0001553421,0.00047938072,0.0014857247,0.00041963093,0.000121587174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041402437,0.00041216245,0.00043764894,0.0006427449,0.00020368963,0.000676749,0.0036570725,0.00019133055,0.00010354138],"category_scores_gemma":[0.00020914582,0.00038515992,0.00007383302,0.0010606492,0.00042290907,0.001597662,0.0031781849,0.00037363256,0.000073119474],"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.0000023558484,0.000034637073,0.0003151684,0.00008287602,0.000027108064,0.000037041737,0.0003972004,0.005766795,0.00032649408,0.025409227,0.00019040481,0.9674107],"study_design_scores_gemma":[0.00068014226,0.000275984,0.0016299838,0.0008880964,0.000042209296,0.00010741687,0.000001645234,0.71947956,0.008362262,0.26097777,0.006296147,0.0012587808],"about_ca_topic_score_codex":0.000051289288,"about_ca_topic_score_gemma":0.000008889238,"teacher_disagreement_score":0.9661519,"about_ca_system_score_codex":0.00018295416,"about_ca_system_score_gemma":0.00022788637,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W62987670","doi":"10.1007/978-3-642-41218-9_5","title":"Some New Progress in Analyzing and Mining Uncertain and Probabilistic Data for Big Data Analytics","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Big data; Probabilistic logic; Computer science; Data science; Analytics; Probabilistic database; Data analysis; Uncertain data; Data mining; Artificial intelligence","score_opus":0.10132424590722992,"score_gpt":0.29906607045976674,"score_spread":0.1977418245525368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62987670","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.00007947633,0.0029584595,0.9936193,0.001477336,0.00086061144,0.000809347,0.00008518813,0.00005868071,0.000051603478],"genre_scores_gemma":[0.004144478,0.00028803642,0.99306124,0.0005224264,0.00128339,0.0000119814795,0.00033549714,0.00003493002,0.00031803444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958255,0.000023757304,0.0004997234,0.0025396538,0.0005023414,0.0006089917],"domain_scores_gemma":[0.9953781,0.00053753867,0.00025233452,0.0035715047,0.00007683927,0.0001837301],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00149869,0.0004318769,0.00051884225,0.00080402754,0.00016357163,0.0017617203,0.0071430113,0.00014845494,0.0000014663732],"category_scores_gemma":[0.00022302354,0.00038328647,0.000021762376,0.0005780149,0.00060459087,0.0026412783,0.0115342075,0.0003350259,0.000002162454],"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.0000023914363,0.000013975194,0.00030378622,0.00012026851,0.000014685459,0.000026454694,0.0001553626,0.00093736005,0.0000010060071,0.0058086584,0.00026354566,0.9923525],"study_design_scores_gemma":[0.00033783482,0.00007873034,0.00024885027,0.00039184027,0.000023294864,0.000011746673,4.8809426e-7,0.9273582,0.00000194538,0.067796595,0.003293181,0.00045730596],"about_ca_topic_score_codex":0.000055820652,"about_ca_topic_score_gemma":0.000265517,"teacher_disagreement_score":0.9918952,"about_ca_system_score_codex":0.00007357883,"about_ca_system_score_gemma":0.00036057463,"threshold_uncertainty_score":0.9998619},"labels":[],"label_agreement":null},{"id":"W64917140","doi":"10.1137/1.9781611972757.64","title":"Building Decision Trees on Records Linked through Key References","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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; Key (lock); XML; Table (database); Decision tree; Table of contents; Information retrieval; Classifier (UML); Relational database; Tree (set theory); Data mining; Artificial intelligence; World Wide Web; Mathematics; Combinatorics","score_opus":0.04288259887349749,"score_gpt":0.30237248232717645,"score_spread":0.25948988345367896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64917140","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.015024692,0.000037865586,0.8952549,0.0026339148,0.0004320023,0.00008359175,0.0000012642412,0.00028086087,0.08625089],"genre_scores_gemma":[0.14525613,0.00010365894,0.84907186,0.0010821421,0.00024284153,0.0000048549255,0.0000030337699,0.000005024622,0.0042304643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888575,0.000021712298,0.00018102916,0.0003930135,0.00030299963,0.00021552014],"domain_scores_gemma":[0.99922186,0.00011648821,0.000047574213,0.0005484291,0.00002420617,0.000041435756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022979159,0.000114811184,0.00010714765,0.00008434034,0.000110503446,0.00035029682,0.001156717,0.000035036348,0.00012802123],"category_scores_gemma":[0.00003411625,0.00008370466,0.000039835075,0.00030032013,0.000015993774,0.0015605217,0.00036813333,0.00008326944,0.0004385797],"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.000002915468,0.000032726148,0.00004189098,8.261243e-7,0.00000448855,0.0000023123905,0.00006393667,0.000056366993,0.000024122692,0.20734094,0.016123751,0.77630574],"study_design_scores_gemma":[0.00047029744,0.00024022697,0.0033243084,0.0000670608,0.000005450019,0.0000018964006,0.00003442894,0.104235254,0.0016492389,0.046859737,0.84276414,0.00034795533],"about_ca_topic_score_codex":0.000048011287,"about_ca_topic_score_gemma":0.00010197902,"teacher_disagreement_score":0.82664037,"about_ca_system_score_codex":0.000022985294,"about_ca_system_score_gemma":0.000010163362,"threshold_uncertainty_score":0.5637201},"labels":[],"label_agreement":null},{"id":"W649264798","doi":"10.1007/s13042-015-0386-x","title":"Analysis of spatiotemporal data relationship using information granules","year":2015,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Data Management and Algorithms","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":"University of Alberta","funders":"Communication University of China; National Natural Science Foundation of China","keywords":"Computer science; Data mining; Granular computing; Granulation; Representation (politics); Computational intelligence; Fuzzy logic; Process (computing); Artificial intelligence; Pattern recognition (psychology); Rough set","score_opus":0.0590416853413767,"score_gpt":0.3212517047273116,"score_spread":0.2622100193859349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W649264798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14145945,0.00031701333,0.8564338,0.0007475236,0.00039910674,0.000027468277,0.000031408475,0.000013369151,0.0005708554],"genre_scores_gemma":[0.94843847,0.00005917028,0.051248364,0.00003396774,0.000055833327,6.645048e-8,0.00012013828,0.0000021440517,0.000041853036],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989126,0.00006673432,0.00039124576,0.00007279916,0.00050012144,0.000056501103],"domain_scores_gemma":[0.99877346,0.00008005728,0.0005621984,0.00015162914,0.00037937547,0.000053255033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008432376,0.00005852277,0.00013164041,0.0005081732,0.000026740572,0.00017175604,0.00079838553,0.000022807792,0.000003999325],"category_scores_gemma":[0.00039643614,0.000051364514,0.00003826677,0.00029429907,0.000026262771,0.0015205155,0.00037507393,0.00014987006,0.000001302097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045948767,0.000076375654,0.76804644,0.00001059534,0.0011532755,0.000019020346,0.001533414,0.05519418,0.000010974608,0.02317215,0.00038412833,0.15035348],"study_design_scores_gemma":[0.00038336572,0.00005363841,0.03141097,0.000018222867,0.0001588275,0.000019282194,0.000085974316,0.9588227,0.000008374726,0.0010061208,0.007971709,0.000060800034],"about_ca_topic_score_codex":0.00012533896,"about_ca_topic_score_gemma":0.000011253468,"teacher_disagreement_score":0.9036285,"about_ca_system_score_codex":0.0000191056,"about_ca_system_score_gemma":0.000041194675,"threshold_uncertainty_score":0.20945841},"labels":[],"label_agreement":null},{"id":"W68466192","doi":"","title":"Geometrically Distributed Random Variables And Permutations Avoiding Consecutive 3-Letter Patterns.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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; Combinatorics; Discrete mathematics","score_opus":0.010723194242734557,"score_gpt":0.22109577845445608,"score_spread":0.21037258421172153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68466192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09513094,0.00022759852,0.89839333,0.001071213,0.0017931409,0.0003725241,0.000070438575,0.00021373446,0.0027270492],"genre_scores_gemma":[0.9960508,0.000047527676,0.003087186,0.00056742394,0.000006900241,0.000023196648,0.00005031403,0.000008935038,0.00015773167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998687,0.0001814799,0.00021129381,0.00038940652,0.00023225692,0.00029851584],"domain_scores_gemma":[0.99891835,0.00045576057,0.000080065765,0.0003636448,0.000079507896,0.00010264837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189982,0.00015368662,0.00018800277,0.00017122563,0.0002904841,0.0004219698,0.00042276116,0.00004563293,0.000027496986],"category_scores_gemma":[0.0003096818,0.00014613452,0.000039511993,0.0007095819,0.000048169153,0.0006793476,0.00022250977,0.00016206075,0.000028070406],"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.0000030110582,0.0000638281,0.004195371,0.000010370458,0.000043696436,0.00003303994,0.00013621771,0.00000510893,0.00003024834,0.9892779,0.0049413526,0.0012598274],"study_design_scores_gemma":[0.010336858,0.00021315667,0.021709807,0.0000811798,0.00010442146,0.00005022959,0.0002783196,0.016835611,0.00142877,0.8820385,0.0657868,0.0011363529],"about_ca_topic_score_codex":0.000018766772,"about_ca_topic_score_gemma":8.6983664e-7,"teacher_disagreement_score":0.90091985,"about_ca_system_score_codex":0.000029382702,"about_ca_system_score_gemma":0.00002689865,"threshold_uncertainty_score":0.5959193},"labels":[],"label_agreement":null},{"id":"W68506346","doi":"10.1007/1-4020-5392-4_4","title":"Spatial Data and Spatial Database Systems","year":2007,"lang":"en","type":"book-chapter","venue":"˜The œGeojournal library","topic":"Data Management and Algorithms","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":"University of Waterloo","funders":"","keywords":"Spatial database; Spatial analysis; Database; Object-based spatial database; Computer science; Spatiotemporal database; Geography; Database design; Remote sensing; View; Database tuning","score_opus":0.04561211621966977,"score_gpt":0.24163762913345407,"score_spread":0.1960255129137843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68506346","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.0000027522267,0.0045383233,0.6630357,0.0010573195,0.0032649343,0.00048382505,0.0018252984,0.0002440203,0.32554784],"genre_scores_gemma":[0.003431915,0.00482047,0.019214088,0.003217653,0.01409293,0.000009990038,0.0073195384,0.0002884576,0.94760495],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724776,0.000060983664,0.00060355,0.0008707062,0.00078336836,0.00043364323],"domain_scores_gemma":[0.9961541,0.00015793231,0.0004700352,0.002935895,0.000025352909,0.00025665408],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00075281993,0.00045081065,0.00040329117,0.00029249358,0.0003247096,0.001878989,0.005736407,0.00017449603,0.00025349745],"category_scores_gemma":[0.000005934088,0.00032711163,0.00007796342,0.00007819201,0.00014818458,0.005152542,0.008050353,0.00090592075,0.00023196968],"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.00004678825,0.00004388727,0.000097340446,0.00016695067,0.00031699915,0.0019249918,0.000066634406,0.0000049281916,0.0000024742133,0.19345462,0.25061306,0.55326134],"study_design_scores_gemma":[0.0003034372,0.0000544598,0.00006448803,0.00025495928,0.00006637132,0.00025140095,0.0000072781268,0.07021919,0.0000014031408,0.003785695,0.9245555,0.00043581112],"about_ca_topic_score_codex":0.00018770483,"about_ca_topic_score_gemma":0.000053552736,"teacher_disagreement_score":0.67394245,"about_ca_system_score_codex":0.000014337649,"about_ca_system_score_gemma":0.00012719032,"threshold_uncertainty_score":0.99997234},"labels":[],"label_agreement":null},{"id":"W6888440185","doi":"10.20382/v16i1a5","title":"Density approximation for moving groups","year":2023,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Data Management and Algorithms","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":"Kernel density estimation; Track (disk drive); Group (periodic table); Kernel (algebra); Tracking (education); Density estimation; Maxima","score_opus":0.01758062281630666,"score_gpt":0.2240018861337144,"score_spread":0.20642126331740776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888440185","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.08800251,0.000008435151,0.9102129,0.00072103157,0.00041232764,0.00009069549,0.000006481854,0.000064453954,0.0004811851],"genre_scores_gemma":[0.7310312,0.000027112414,0.26658493,0.00022351283,0.00032644338,3.4015528e-7,0.00006646399,0.000012220291,0.0017278094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990273,0.000038614162,0.00021347852,0.00015654723,0.00039998972,0.0001640431],"domain_scores_gemma":[0.9988544,0.00026259516,0.00029833944,0.00012183597,0.00038486664,0.00007795086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005138828,0.000086156746,0.00015404262,0.0013528594,0.00016127242,0.00012996604,0.0006987404,0.00003453745,0.0000051076395],"category_scores_gemma":[0.00006671461,0.00009198691,0.00013336116,0.0018942154,0.000023069972,0.0015130026,0.00023351495,0.000095839634,0.000018133876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010281867,0.00019191245,0.002149692,0.00014099476,0.0003484261,0.00037926092,0.000467375,0.2208253,0.0002459748,0.63820076,0.022856945,0.11409057],"study_design_scores_gemma":[0.0022866584,0.00030269162,0.029276583,0.000058062982,0.00006555818,0.000059394017,0.00047408193,0.8607525,0.0001938947,0.064112954,0.04206416,0.00035344242],"about_ca_topic_score_codex":0.0000017900863,"about_ca_topic_score_gemma":4.815456e-7,"teacher_disagreement_score":0.64362794,"about_ca_system_score_codex":0.00008343287,"about_ca_system_score_gemma":0.00007083162,"threshold_uncertainty_score":0.37511173},"labels":[],"label_agreement":null},{"id":"W6890023240","doi":"10.3389/fonc.2023.1086118.s002","title":"Image_2_The clinical and neurocognitive functional changes with awake brain mapping for gliomas invading eloquent areas: Institutional experience and the utility of The Montreal Cognitive Assessment.tif","year":2023,"lang":"en","type":"other","venue":"Figshare","topic":"Data Management and Algorithms","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":"Neurocognitive; Glioma; Perioperative; Craniotomy; Awake craniotomy; Temporal lobe; Frontal lobe; Brain mapping","score_opus":0.08587390184835457,"score_gpt":0.313848822907975,"score_spread":0.22797492105962042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6890023240","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065809244,0.001907179,0.10211949,0.0084022675,0.002580035,0.017167034,0.61280984,0.0014253901,0.2529307],"genre_scores_gemma":[0.51947606,0.00076612213,0.015898278,0.016423397,0.00810452,0.032578483,0.13164921,0.0022450092,0.27285892],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9985219,0.0001572152,0.00019085662,0.0005891466,0.00033705973,0.00020378933],"domain_scores_gemma":[0.9981502,0.0010705313,0.0003062928,0.0002985977,0.000119063814,0.00005526324],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031223122,0.0002244725,0.00026837972,0.0001033283,0.0002655108,0.00019370951,0.0005030681,0.00008128761,0.001235478],"category_scores_gemma":[0.00075518794,0.00012987376,0.00007132366,0.0002932969,0.0003091893,0.00022928242,0.00093327474,0.00020308365,0.0000076155084],"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.00015215085,0.00016092662,0.0021387662,0.00067423424,0.00073475216,0.0000740742,0.0016681293,9.757637e-7,0.000001807469,0.0058222422,0.79226285,0.19630912],"study_design_scores_gemma":[0.0111447945,0.0003217766,0.6161977,0.017021695,0.00023898117,0.0000908441,0.0030592491,0.0506901,0.000029747822,0.0017504068,0.29808834,0.001366349],"about_ca_topic_score_codex":0.000053862077,"about_ca_topic_score_gemma":0.00026973503,"teacher_disagreement_score":0.614059,"about_ca_system_score_codex":0.000009372378,"about_ca_system_score_gemma":0.00010787544,"threshold_uncertainty_score":0.99967754},"labels":[],"label_agreement":null},{"id":"W6893899281","doi":"10.5281/zenodo.4665254","title":"A new semantic trajectory ontology model for modelling and reasoning on movement data","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Trajectory; Ontology; Inference; Raw data; Semantic data model; Movement (music); Semantics (computer science)","score_opus":0.0930868861795873,"score_gpt":0.2686038527552753,"score_spread":0.17551696657568802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893899281","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.0004224658,0.00011047066,0.9903415,0.0011404188,0.00006779297,0.00022108071,0.00009404533,0.00029055538,0.0073116766],"genre_scores_gemma":[0.12707089,0.0009515901,0.8402646,0.0037033504,0.00058686297,2.8978752e-7,0.008948633,0.0020425124,0.016431255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986294,0.00008686539,0.00015642501,0.0006276661,0.00022329275,0.00027633284],"domain_scores_gemma":[0.9987413,0.000024057708,0.00005466372,0.0009169677,0.00014452332,0.0001184758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048616985,0.0001033379,0.00011328158,0.00010862672,0.0008126936,0.000949309,0.0015498508,0.000028655799,0.00020022143],"category_scores_gemma":[0.00014263557,0.00011214064,0.000020647469,0.00023724235,0.000026541087,0.00061257265,0.002832028,0.0001120505,0.00018529566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003801001,0.00015667357,0.0000011662655,0.00010826234,0.00008768253,0.000036452,0.0013231402,0.025376104,0.0005336841,0.17312051,0.25675777,0.54246056],"study_design_scores_gemma":[0.00036515095,0.00006828519,0.0000092903765,0.000023772587,0.000008970212,0.000008593851,0.000043021526,0.82512057,0.00008218335,0.0022719663,0.17189184,0.000106352905],"about_ca_topic_score_codex":0.000012092865,"about_ca_topic_score_gemma":0.0000011370796,"teacher_disagreement_score":0.7997445,"about_ca_system_score_codex":0.000039505343,"about_ca_system_score_gemma":0.00000907578,"threshold_uncertainty_score":0.91542083},"labels":[],"label_agreement":null},{"id":"W6901554265","doi":"10.60692/dbmpb-4q392","title":"A Semi-Supervised Approach for the Semantic Segmentation of Trajectories","year":2018,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Data Management and Algorithms","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":"Dalhousie University","funders":"","keywords":"Segmentation; Trajectory; Pattern recognition (psychology); Set (abstract data type); Process (computing); Image segmentation; Object (grammar); Scale-space segmentation","score_opus":0.03965301900595358,"score_gpt":0.22388507271090113,"score_spread":0.18423205370494755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901554265","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.010667964,0.0000019235567,0.9867905,0.00004057391,0.00037434848,0.0006169799,0.00003801058,0.000111426765,0.0013582994],"genre_scores_gemma":[0.9719403,8.167967e-8,0.02766878,0.0000707365,0.00009595009,0.00010403187,0.000026246478,0.0000032749406,0.00009064787],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915665,0.000024253794,0.0003420867,0.000108788896,0.00022939897,0.00013880606],"domain_scores_gemma":[0.9991777,0.000012429754,0.00019526466,0.00042413973,0.000168238,0.000022228523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040877244,0.00009309935,0.000113349066,0.00010912292,0.00016405537,0.0002656751,0.00053428166,0.000027889278,0.0000024648318],"category_scores_gemma":[0.000008192878,0.000059509246,0.000049302846,0.00028141995,0.00003794813,0.001540201,0.000099081364,0.000023195185,0.00004173401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018282887,0.000028231208,0.03874072,0.005297641,0.0006460343,8.9692503e-7,0.82244074,0.0009973681,0.00006409333,0.05858982,0.0050745984,0.06793702],"study_design_scores_gemma":[0.0009459549,0.00009874528,0.0053502126,0.000042532152,0.000036055346,0.0000053343697,0.016819905,0.9734874,0.0026150018,0.000006717556,0.00043799152,0.00015415724],"about_ca_topic_score_codex":0.00000531111,"about_ca_topic_score_gemma":7.4474904e-8,"teacher_disagreement_score":0.97249,"about_ca_system_score_codex":0.000021298243,"about_ca_system_score_gemma":0.000014223452,"threshold_uncertainty_score":0.25619113},"labels":[],"label_agreement":null},{"id":"W6944799364","doi":"10.18910/84851","title":"Estimating gaits of an ancient crocodile-line archosaur","year":2021,"lang":"en","type":"article","venue":"OUKA (Osaka University Knowledge Archive) (Osaka University)","topic":"Data Management and Algorithms","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":"Motion (physics); Gait; Adaptive control; Adaptive filter; Motion analysis","score_opus":0.015170702497595315,"score_gpt":0.21936717270503844,"score_spread":0.20419647020744314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944799364","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.067833595,0.000085339576,0.7781369,0.0005572703,0.0007750815,0.0003964836,0.00030538428,0.00046298365,0.15144697],"genre_scores_gemma":[0.25243518,0.00026152306,0.67449826,0.00025133355,0.00045643622,7.653649e-7,0.0009615713,0.00008153799,0.07105341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99679977,0.0004747602,0.00029323992,0.0012404411,0.00045106685,0.0007407383],"domain_scores_gemma":[0.99712867,0.00023914312,0.00027266977,0.0014615341,0.00041103526,0.0004869644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037009476,0.0003935671,0.0005051877,0.0010850884,0.0006625567,0.00016102202,0.0030665677,0.00010705836,0.00010603787],"category_scores_gemma":[0.00008058069,0.0005019536,0.00027767423,0.002437143,0.00032972207,0.0028879603,0.003280493,0.00039053266,0.00014734562],"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.0002864339,0.003809757,0.0018244622,0.00059155753,0.0005989433,0.008494917,0.009504935,0.0044607725,0.0085968,0.76870424,0.009361417,0.18376577],"study_design_scores_gemma":[0.0044004116,0.00048618883,0.003925631,0.00030558734,0.00023566108,0.00006825996,0.0029727088,0.36601993,0.0039032775,0.0020713012,0.6141924,0.0014186299],"about_ca_topic_score_codex":0.000095196425,"about_ca_topic_score_gemma":0.00038565297,"teacher_disagreement_score":0.7666329,"about_ca_system_score_codex":0.00021272842,"about_ca_system_score_gemma":0.0005253246,"threshold_uncertainty_score":0.9997432},"labels":[],"label_agreement":null},{"id":"W6945021117","doi":"10.25316/ir-11323","title":"Nanaimo Free Press [Monday, October 7, 1895]","year":2019,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Data Management and Algorithms","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":"","score_opus":0.009823111398815568,"score_gpt":0.19343307518437616,"score_spread":0.1836099637855606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945021117","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":[9.527187e-8,0.00025610527,0.08012204,0.00026544978,0.0031299798,0.00041550287,0.00023544165,0.00055285404,0.91502255],"genre_scores_gemma":[0.000017606004,0.0004731946,0.0054701567,0.00011983112,0.0002698929,0.0000010310113,0.0000028029972,0.00016070354,0.9934848],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977361,0.00007903007,0.00012575473,0.0009914913,0.0005207411,0.00054690236],"domain_scores_gemma":[0.9971304,0.000041246873,0.00027385322,0.002354692,0.000051216404,0.00014859947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008955481,0.0004850271,0.00046613303,0.00078351155,0.00010821396,0.00022939558,0.003854106,0.00030759338,0.00030770924],"category_scores_gemma":[0.000012660236,0.0004889781,0.00017936026,0.0006752558,0.00007835558,0.0007992356,0.0022930223,0.00032808614,0.0005861557],"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.0000064305664,0.000052013427,0.0000010844299,0.00007455556,0.00014205903,0.00022155029,0.000093717674,0.000010950037,0.0000012664281,0.01282592,0.98387283,0.0026976173],"study_design_scores_gemma":[0.0012181744,0.000054591084,0.0000017935131,0.0001291339,0.000074530595,0.0000013062244,0.00005530952,0.00079998974,0.000010208852,0.00009994275,0.99690604,0.0006489939],"about_ca_topic_score_codex":0.0009978911,"about_ca_topic_score_gemma":0.001171337,"teacher_disagreement_score":0.07846225,"about_ca_system_score_codex":0.000102136626,"about_ca_system_score_gemma":0.000096750555,"threshold_uncertainty_score":0.9997562},"labels":[],"label_agreement":null},{"id":"W6945236346","doi":"10.24385/lincoln.25162595","title":"Small Machine Talks","year":2024,"lang":"en","type":"other","venue":"Lincoln Repository (University of Lincoln)","topic":"Data Management and Algorithms","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":"Work (physics); Key (lock); Government (linguistics)","score_opus":0.011089437830360257,"score_gpt":0.1810510820432166,"score_spread":0.16996164421285634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945236346","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.00001105538,0.0025886225,0.07153702,0.00035122797,0.0030348783,0.00045989445,0.000094009185,0.0009745398,0.92094874],"genre_scores_gemma":[0.00019523743,0.00018264928,0.05100582,0.00005008333,0.0004530089,9.3517355e-7,0.000047286678,0.00015623288,0.94790876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980969,0.000080624486,0.00022603066,0.00088286557,0.00041018968,0.00030341043],"domain_scores_gemma":[0.99805075,0.000031705935,0.00038822196,0.0013168205,0.00005389314,0.0001586331],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019688134,0.00034825582,0.000499418,0.00052113447,0.00012497268,0.00016716,0.0025935161,0.00034688576,0.00022586393],"category_scores_gemma":[0.0000052873374,0.0004116272,0.00028462263,0.0005556851,0.00014881112,0.0002874426,0.0018153823,0.00038650926,0.0008877238],"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.000014239473,0.0002131377,0.00006405538,0.00076925394,0.0004620097,0.002466248,0.00039193215,0.000008299301,0.000039608134,0.013249064,0.9597527,0.022569494],"study_design_scores_gemma":[0.00035862112,0.000096695345,0.000038257185,0.000413571,0.00014586383,0.00002182918,0.000096988464,0.006921755,0.000024986566,0.000362441,0.9910754,0.0004436143],"about_ca_topic_score_codex":0.0015618227,"about_ca_topic_score_gemma":0.00044140057,"teacher_disagreement_score":0.031322718,"about_ca_system_score_codex":0.00008718191,"about_ca_system_score_gemma":0.00012019188,"threshold_uncertainty_score":0.9998902},"labels":[],"label_agreement":null},{"id":"W6945284300","doi":"10.25316/ir-10040","title":"Nanaimo Free Press [Wednesday, July 28, 1897]","year":2019,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.010652567463136036,"score_gpt":0.19596767729494124,"score_spread":0.1853151098318052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945284300","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":[3.1946957e-8,0.00024651136,0.062522925,0.00021747751,0.006640391,0.00046117324,0.00027803177,0.0006066795,0.9290268],"genre_scores_gemma":[0.0000076003594,0.00050766923,0.004204057,0.00011775503,0.0003244915,0.0000011691233,0.0000021229885,0.00016389428,0.9946712],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976104,0.00008676023,0.00013655424,0.001041641,0.0005463826,0.0005782512],"domain_scores_gemma":[0.99701107,0.000046091314,0.0003026364,0.0024217484,0.00005662119,0.00016181894],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001004467,0.0005135745,0.00049790926,0.00084605656,0.00012236902,0.00024641422,0.004210766,0.00032321882,0.00016431545],"category_scores_gemma":[0.000015086713,0.00051874644,0.00018856212,0.00073178444,0.000088118635,0.0008305875,0.002274191,0.00035192678,0.0008339062],"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.000007823723,0.0000559709,4.0346376e-7,0.00009405864,0.00014405201,0.0002450737,0.000080777776,0.000012619378,0.0000010138624,0.010142714,0.98745537,0.0017601307],"study_design_scores_gemma":[0.001316364,0.00006685357,9.871874e-7,0.00015219007,0.00008213368,0.000001490531,0.000061738036,0.00075614284,0.000008305012,0.00011001178,0.9967577,0.0006860955],"about_ca_topic_score_codex":0.00077449926,"about_ca_topic_score_gemma":0.0006334649,"teacher_disagreement_score":0.065644465,"about_ca_system_score_codex":0.00010883141,"about_ca_system_score_gemma":0.00011435342,"threshold_uncertainty_score":0.99994403},"labels":[],"label_agreement":null},{"id":"W6945287142","doi":"10.25318/3410025401-eng","title":"Average expected useful life of new publicly owned public transit assets, Infrastructure Canada","year":2019,"lang":"en","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Data Management and Algorithms","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":"Public transport; Transit (satellite); Transit system; Value (mathematics); Government (linguistics)","score_opus":0.01099130798205808,"score_gpt":0.22897916843077304,"score_spread":0.21798786044871496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945287142","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014935925,0.000056387984,0.16645123,0.000762802,0.0016809482,0.00032858207,0.83064806,0.00002240368,0.00003466058],"genre_scores_gemma":[0.0011012171,0.00005267834,0.0060500195,0.00032968572,0.00011678105,0.000011106033,0.9913574,0.000024347784,0.00095679855],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99620223,0.00008726251,0.00069837895,0.0007221968,0.0017510661,0.00053883845],"domain_scores_gemma":[0.9968002,0.00027171167,0.00070057693,0.0013515024,0.0004442909,0.0004317388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017759962,0.00045977897,0.0005431522,0.00030690082,0.000121929515,0.0004909287,0.0023192621,0.00017244735,0.00040999413],"category_scores_gemma":[0.0006531449,0.000471386,0.000036447233,0.0008882011,0.000029862349,0.0007073538,0.0003030634,0.00039463644,0.0000032765308],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030984727,0.000019142879,0.00003918393,0.00022012265,0.00009474913,0.0000626888,0.0000228705,0.00006294386,0.0000019913941,0.0013425116,0.99031055,0.007820123],"study_design_scores_gemma":[0.00029474543,0.000034930767,0.008068102,0.00006218867,0.000051433235,0.000003279972,0.000048788355,0.002277956,0.00001771999,0.00014911372,0.98844427,0.00054750213],"about_ca_topic_score_codex":0.94153726,"about_ca_topic_score_gemma":0.9964547,"teacher_disagreement_score":0.1607093,"about_ca_system_score_codex":0.0006385437,"about_ca_system_score_gemma":0.010166098,"threshold_uncertainty_score":0.9997738},"labels":[],"label_agreement":null},{"id":"W6945504519","doi":"10.25384/sage.c.6161234","title":"The Games We Play: Prosocial Choices Under Time Pressure Reflect Context-Sensitive Information Priorities","year":2022,"lang":"en","type":"other","venue":"Sage Journals Data","topic":"Data Management and Algorithms","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":"Prosocial behavior; Deliberation; Altruism (biology); Information processing; Field (mathematics); Social pressure; Negative information","score_opus":0.03149210806396833,"score_gpt":0.2927622431464673,"score_spread":0.26127013508249897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945504519","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.0000012479197,0.14493175,0.05702503,0.020270746,0.004901813,0.002970812,0.026019182,0.0011518848,0.7427275],"genre_scores_gemma":[0.000029559767,0.038164496,0.002588518,0.0015095134,0.0017514622,0.00004166029,0.0018371559,0.00013701404,0.95394063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976569,0.00027723354,0.00039681006,0.000395857,0.0008948374,0.00037836382],"domain_scores_gemma":[0.9971829,0.00018821689,0.0007867945,0.0017239434,0.00004904471,0.000069075315],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011997409,0.00028838892,0.00031767366,0.0002943001,0.0005902714,0.0025014107,0.0044980384,0.000116371935,0.0021097767],"category_scores_gemma":[0.000107669,0.00020890783,0.00006855416,0.0003847224,0.000101307465,0.0036672838,0.0038755087,0.0005879171,0.00024961453],"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.000004189671,0.00000942205,0.000002119587,0.000024617157,0.00024785113,0.000009795082,0.00023190386,0.0000011725647,0.0000011320916,0.0004673545,0.746705,0.25229546],"study_design_scores_gemma":[0.0002799382,0.000032157932,0.00005595416,0.000362235,0.000070214635,0.000013056139,0.00034100018,0.0016121824,0.000004002136,0.00060279964,0.99635774,0.0002687408],"about_ca_topic_score_codex":0.0000745793,"about_ca_topic_score_gemma":0.00011619948,"teacher_disagreement_score":0.25202674,"about_ca_system_score_codex":0.000045372046,"about_ca_system_score_gemma":0.00016376631,"threshold_uncertainty_score":0.9988024},"labels":[],"label_agreement":null},{"id":"W6945539858","doi":"10.25549/wpacards-m24784","title":"WPA block face card for household census of Hoefner, Eagle, Eastmont Streets, in Los Angeles County","year":2012,"lang":"en","type":"dataset","venue":"University of Southern California Digital Library","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Census; Block (permutation group theory); Face (sociological concept); Quarter (Canadian coin)","score_opus":0.013540571051100425,"score_gpt":0.17088302897468505,"score_spread":0.15734245792358462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945539858","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005123501,0.00022787684,0.00077681884,0.00004521897,0.000075872355,0.00034222976,0.997661,0.00007755646,0.00028106757],"genre_scores_gemma":[0.0008813673,0.00006310113,0.0012808708,0.000034395434,0.00007666043,5.924803e-7,0.9973774,0.000025708006,0.00025991956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984427,0.000032440672,0.00030924423,0.00045807258,0.00037615208,0.00038135576],"domain_scores_gemma":[0.9985868,0.00008436731,0.00038946397,0.0007631175,0.000031973042,0.00014427768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000967341,0.00031830178,0.00049357384,0.0002968409,0.000058349655,0.00013520863,0.0020042937,0.00019656007,0.000009024101],"category_scores_gemma":[0.000011922002,0.00033153652,0.00021778604,0.00030584342,0.00016382124,0.0010402863,0.0013463916,0.0001904586,0.000061008937],"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.000054812706,0.00024871438,0.0010540221,0.000318058,0.00006691948,0.000033661065,0.000015205634,0.00002570157,5.95489e-7,0.000025116193,0.9950992,0.0030579926],"study_design_scores_gemma":[0.00057079655,0.00003999792,0.000042038755,0.00015122368,0.00005144198,0.0000014500624,0.0004267576,0.00037201212,0.000011233284,0.00006547731,0.9979257,0.00034189416],"about_ca_topic_score_codex":0.0001419145,"about_ca_topic_score_gemma":0.000023687524,"teacher_disagreement_score":0.0028264758,"about_ca_system_score_codex":0.000033190816,"about_ca_system_score_gemma":0.00008811895,"threshold_uncertainty_score":0.9999137},"labels":[],"label_agreement":null},{"id":"W6945585410","doi":"10.25446/oxford.25920505","title":"Lucky escape of Helen Meyer and her dinner guests","year":2024,"lang":"en","type":"other","venue":"University of Oxford","topic":"Data Management and Algorithms","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":"nobody; Nazism; Charge (physics); Judaism; Antique; Quarter (Canadian coin); Nazi Germany","score_opus":0.007468774890618561,"score_gpt":0.18923047327029585,"score_spread":0.1817616983796773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945585410","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.000103245395,0.00083484134,0.023002703,0.00034422163,0.00040179363,0.00014674931,0.00007201301,0.0001374869,0.9749569],"genre_scores_gemma":[0.000440725,0.0006332289,0.021959469,0.000019668858,0.00003521392,4.684599e-8,0.000014734366,0.00003766,0.9768593],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940944,0.000011622119,0.00006202934,0.000262845,0.00015031554,0.00010376648],"domain_scores_gemma":[0.9994969,0.0000070107703,0.00009014452,0.00035446402,0.000016239914,0.000035265708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006329853,0.000108662454,0.00018734792,0.000247086,0.00001430053,0.00002167474,0.00066371914,0.00007627602,0.00032538458],"category_scores_gemma":[0.0000018624343,0.000111843765,0.000051625397,0.0001570832,0.00007888456,0.00015969237,0.0007730287,0.00006641746,0.000049618022],"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.0000031188033,0.000030852672,0.00009467238,0.00030254322,0.00014411868,0.00005044292,0.00024248798,3.7227355e-7,0.000008406051,0.018154085,0.95742065,0.023548247],"study_design_scores_gemma":[0.00016016747,0.00003098959,0.00010660117,0.00015779355,0.000041287545,7.655407e-7,0.000062612955,0.0004951027,0.000010772721,0.00036309284,0.9984477,0.0001230895],"about_ca_topic_score_codex":0.00018472588,"about_ca_topic_score_gemma":0.000072724186,"teacher_disagreement_score":0.041027073,"about_ca_system_score_codex":0.000008125349,"about_ca_system_score_gemma":0.000012812905,"threshold_uncertainty_score":0.45608565},"labels":[],"label_agreement":null},{"id":"W6945648459","doi":"10.25384/sage.24492828.v1","title":"sj-docx-1-cjk-10.1177_20543581231209233 – Supplemental material for Associations of Estradiol With Mortality and Health Outcomes in Patients Undergoing Hemodialysis: A Prospective Cohort Study","year":2023,"lang":"en","type":"article","venue":"Figshare","topic":"Data Management and Algorithms","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":"Prospective cohort study; Cohort study; Disease; Cohort; Kidney disease","score_opus":0.05473571344020473,"score_gpt":0.3219925450276592,"score_spread":0.2672568315874545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945648459","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45233202,0.0000034931181,0.00009694019,0.00019212803,0.000109333225,0.0045350785,0.5424447,0.00016723682,0.00011909702],"genre_scores_gemma":[0.8588832,5.5170005e-7,0.0006965246,0.000029431356,0.00002156025,0.0006312273,0.13965906,0.000010734496,0.000067718065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99861014,0.000048433365,0.00031152533,0.0004125468,0.0003425984,0.00027475372],"domain_scores_gemma":[0.99928266,0.00008424458,0.00022138227,0.0002896109,0.00007123545,0.00005084901],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002715669,0.0001407514,0.0003212511,0.00015124501,0.00010083546,0.00015835512,0.0003346436,0.000022506878,0.002542709],"category_scores_gemma":[0.00008065403,0.0001246161,0.00003766115,0.00045956465,0.0000060538437,0.000544164,0.00031132242,0.000045512115,0.000017741193],"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.00000532144,0.00025807598,0.9792251,0.000058325975,0.00014669342,0.000002531158,0.0004425631,0.000011338788,1.4751868e-7,0.000057018377,0.019366477,0.00042643683],"study_design_scores_gemma":[0.0017836988,0.00046715816,0.9958887,0.000058782753,0.000017644918,8.524762e-8,0.00017253058,0.001265251,0.000014213867,0.0000819489,0.00011844376,0.00013150819],"about_ca_topic_score_codex":0.0001312009,"about_ca_topic_score_gemma":0.0009342824,"teacher_disagreement_score":0.40655118,"about_ca_system_score_codex":0.00012057561,"about_ca_system_score_gemma":0.00008818045,"threshold_uncertainty_score":0.9983691},"labels":[],"label_agreement":null},{"id":"W6946069757","doi":"10.25549/webster-c100-17635","title":"Conference on Civil Disorders, 1980-06-30/1980-07-01","year":2021,"lang":"en","type":"dataset","venue":"University of Southern California Digital Library","topic":"Data Management and Algorithms","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":"Commission; Newspaper; Royal Commission; Economic Justice; Variety (cybernetics)","score_opus":0.00938042102451549,"score_gpt":0.16744342395800213,"score_spread":0.15806300293348663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946069757","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028916334,0.000073830764,0.0030374483,0.0007785434,0.00011664053,0.00017558169,0.98735535,0.00018917097,0.008244539],"genre_scores_gemma":[0.00014842757,0.00028495543,0.0006059833,0.00025565896,0.0000880202,3.639594e-7,0.9948606,0.000024498024,0.0037314934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978737,0.00006311829,0.00025587177,0.0008367044,0.00056759705,0.00040295837],"domain_scores_gemma":[0.998063,0.00008035924,0.000299871,0.0013152712,0.0000348157,0.00020664597],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000064928114,0.00042857582,0.00046803936,0.00026830338,0.00016988644,0.00078196323,0.0032346111,0.00022283898,0.0025676321],"category_scores_gemma":[0.000017961593,0.00045700918,0.00026504893,0.00038413468,0.00022485477,0.0012904198,0.002901462,0.00038816733,0.030755311],"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.000016133807,0.0002259546,0.00008710024,0.000115900286,0.00008776744,0.00018050644,0.000035430825,0.0000037884636,1.5561679e-7,0.0005997395,0.9940484,0.0045991144],"study_design_scores_gemma":[0.00038681214,0.000061903986,0.0000066150787,0.00020859428,0.000036069054,0.0000020020445,0.00045179977,0.00035877826,0.000001918846,0.0013478994,0.996638,0.0004996272],"about_ca_topic_score_codex":0.000055440905,"about_ca_topic_score_gemma":0.000020455933,"teacher_disagreement_score":0.02818768,"about_ca_system_score_codex":0.00002811291,"about_ca_system_score_gemma":0.00021367846,"threshold_uncertainty_score":0.99978817},"labels":[],"label_agreement":null},{"id":"W6946423915","doi":"10.3389/fpsyg.2018.01306.s003","title":"Table_3_Predictors of Language Dominance: An Integrated Analysis of First Language Attrition and Second Language Acquisition in Late Bilinguals.pdf","year":2018,"lang":"en","type":"dataset","venue":"Figshare","topic":"Data Management and Algorithms","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":"Second-language acquisition; First language; Second-language attrition; Focus (optics); Comprehension approach; Language acquisition; Dominance (genetics); Second language; Process (computing)","score_opus":0.013834964133683196,"score_gpt":0.2664173534764833,"score_spread":0.25258238934280014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946423915","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019914119,0.0006334882,0.000027023074,0.0000053026906,0.00007212933,0.00027496243,0.97899014,0.000041562802,0.000041298303],"genre_scores_gemma":[0.0032401977,0.00003433889,0.000497781,0.000043642616,0.00008070864,0.000040928735,0.99589115,0.000012124967,0.00015911275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981296,0.00011216247,0.0005284254,0.000628514,0.0003302361,0.0002710396],"domain_scores_gemma":[0.99807996,0.00011933319,0.0005223782,0.0010828846,0.000118916265,0.00007655475],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027904683,0.00029640025,0.0006537419,0.0011529045,0.000044875935,0.00013271216,0.0010849794,0.00023774957,0.04015717],"category_scores_gemma":[0.00021846672,0.00028376706,0.00011532445,0.0018608534,0.00003322287,0.0007841199,0.0005670777,0.00022096289,0.00008121053],"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.0000148821755,0.00012678641,0.000038033813,0.001005239,0.00020037494,0.00013062175,0.0015825726,0.000022878728,0.00008642206,0.0000010605144,0.9950592,0.0017319578],"study_design_scores_gemma":[0.0048552197,0.0013248039,0.018456293,0.015316463,0.0018828415,0.000014348298,0.004338443,0.098677,0.00793959,0.000031292868,0.84406894,0.003094745],"about_ca_topic_score_codex":0.0008801298,"about_ca_topic_score_gemma":0.00508333,"teacher_disagreement_score":0.15099022,"about_ca_system_score_codex":0.00004569367,"about_ca_system_score_gemma":0.000042224994,"threshold_uncertainty_score":0.99996144},"labels":[],"label_agreement":null},{"id":"W6946459488","doi":"10.34943/d9e96ae3-679c-47a0-8c7f-4b54d58103d2","title":"China Creek Power Supply Deployed 2019-11-04","year":2019,"lang":"en","type":"dataset","venue":"Ocean Networks Canada Society","topic":"Data Management and Algorithms","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":"China; Software deployment; Power (physics); Quality (philosophy); Quality assurance","score_opus":0.0051470943270911845,"score_gpt":0.19304031323791027,"score_spread":0.1878932189108191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946459488","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020154106,0.0006958078,0.013015166,0.0011434723,0.0056789387,0.0005544951,0.97868407,0.00014892667,0.00005899322],"genre_scores_gemma":[0.00017530307,0.00086879125,0.002207649,0.004546518,0.0006975998,0.000006771242,0.9875839,0.00005863072,0.0038548755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958002,0.00009298091,0.0005188373,0.0012753386,0.0011248739,0.0011877476],"domain_scores_gemma":[0.99633205,0.00009364661,0.00039120388,0.0027583656,0.00007815793,0.0003466046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046127697,0.0006755061,0.00066038215,0.000045154404,0.0003605915,0.00096547673,0.0047708447,0.00040834298,0.00013984751],"category_scores_gemma":[0.000013858696,0.0007113808,0.00038983984,0.0006397661,0.00008844459,0.00067487295,0.0017225675,0.000982594,0.000015900729],"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.000001447517,0.000034926736,0.00005940536,0.000050833325,0.00017579184,0.00007343037,0.000014583475,0.0010683821,2.1064476e-8,0.00006213581,0.9977505,0.0007085508],"study_design_scores_gemma":[0.00037352083,0.00004032,0.0010608695,0.00007229314,0.00006777697,0.000007591899,0.000018844628,0.03039735,1.4603518e-7,0.0000221088,0.9671186,0.00082054397],"about_ca_topic_score_codex":0.5256459,"about_ca_topic_score_gemma":0.4740956,"teacher_disagreement_score":0.051550284,"about_ca_system_score_codex":0.0003853238,"about_ca_system_score_gemma":0.0010234219,"threshold_uncertainty_score":0.9995337},"labels":[],"label_agreement":null},{"id":"W6946681999","doi":"10.34989/swp-2023-10","title":"Exporting and Investment Under Credit Constraints","year":2023,"lang":"en","type":"article","venue":"Econstor (Econstor)","topic":"Data Management and Algorithms","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":true,"ca_institutions":"Lakehead University; Bank of Canada","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Leverage (statistics); Productivity; Credit crunch; Investment (military); Trade credit; Financial market; Bond market; Empirical research","score_opus":0.027265859200013814,"score_gpt":0.24945479664906123,"score_spread":0.2221889374490474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946681999","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.90303683,0.0003308911,0.027266994,0.0023379778,0.003946856,0.00052369933,0.000054766097,0.0013337014,0.061168276],"genre_scores_gemma":[0.9608272,0.00016387845,0.02655487,0.004456555,0.00069513684,0.00011092804,0.00009046762,0.000057519544,0.0070434576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978896,0.000059206744,0.00046501862,0.0007318364,0.00027914616,0.0005752238],"domain_scores_gemma":[0.9986384,0.00017030236,0.00021078925,0.0006851266,0.00004017538,0.00025519737],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007233184,0.00026204393,0.0002905444,0.00034209224,0.0002743541,0.0003714084,0.00073154544,0.000080399004,0.00026561518],"category_scores_gemma":[0.000076893964,0.00026934515,0.00007914778,0.00046657014,0.00044614612,0.0011117331,0.00078254566,0.0001787741,0.00090338336],"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.000004960221,0.00012544062,0.3214337,0.00008942553,0.0002526066,0.00040898504,0.0010001609,0.00004514493,0.0003545932,0.4734906,0.14465529,0.058139123],"study_design_scores_gemma":[0.0055688485,0.00049074437,0.6639912,0.0003975338,0.00014846075,0.0005608421,0.0034847227,0.072161995,0.001588663,0.05842806,0.18930969,0.0038692332],"about_ca_topic_score_codex":0.000014972944,"about_ca_topic_score_gemma":0.000013398579,"teacher_disagreement_score":0.41506252,"about_ca_system_score_codex":0.0000767677,"about_ca_system_score_gemma":0.0001320347,"threshold_uncertainty_score":0.99997586},"labels":[],"label_agreement":null},{"id":"W6946785650","doi":"10.34990/fk2/4nifdr","title":"Spread of honey bee (Apis mellifera L.) viruses to wax by worker traffic and aerosolization","year":2023,"lang":"en","type":"dataset","venue":"Borealis","topic":"Data Management and Algorithms","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":"Honey bee; Wax; Honey Bees; Cage; Aerosolization; Drone; Apoidea","score_opus":0.02032566374458735,"score_gpt":0.2623920251206981,"score_spread":0.24206636137611073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946785650","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034363096,0.00018158424,0.007422707,0.00034175796,0.00025278595,0.00031434098,0.9913036,0.00013308391,0.000015737818],"genre_scores_gemma":[0.0000065347795,0.0010765266,0.0016177095,0.00057166343,0.00012482496,0.000038029975,0.9963182,0.00002230769,0.00022416716],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982333,0.000053664116,0.00035058393,0.0006131786,0.00045531587,0.00029391545],"domain_scores_gemma":[0.99866164,0.00007712271,0.00017294714,0.0008899646,0.00005934133,0.00013901031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002463554,0.00027538624,0.00035457587,0.00026318146,0.000073616124,0.00031712803,0.0013492903,0.00014199913,0.0000068274308],"category_scores_gemma":[0.00006666198,0.00026019654,0.000053519405,0.00061890436,0.000049353974,0.00041095476,0.00079189794,0.00011507735,0.0000967221],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000004598946,0.000039891926,0.0000027422961,0.00006782258,0.00004298548,0.000010646244,0.00004901002,0.000032521813,0.000041893105,0.00010387291,0.98933065,0.010273369],"study_design_scores_gemma":[0.00017268842,0.000071821196,0.000048480833,0.00010883789,0.000045984845,0.0000010250757,0.000009271364,0.00068454124,0.00045175108,0.000040282674,0.9980598,0.000305525],"about_ca_topic_score_codex":0.008317177,"about_ca_topic_score_gemma":0.002529601,"teacher_disagreement_score":0.009967844,"about_ca_system_score_codex":0.000020752594,"about_ca_system_score_gemma":0.00002965774,"threshold_uncertainty_score":0.99998504},"labels":[],"label_agreement":null},{"id":"W6947358344","doi":"10.3897/zookeys.332.4753.habitus13","title":"Habitus 13 from: Barney R, LeSage L, Savard K (2013) Pachybrachis (Coleoptera, Chrysomelidae, Cryptocephalinae) of Eastern Canada. ZooKeys 332: 95-176. https://doi.org/10.3897/zookeys.332.4753","year":2013,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Habitus; Field (mathematics); Scale (ratio); Identity (music)","score_opus":0.02138287649124515,"score_gpt":0.21220651111963842,"score_spread":0.19082363462839327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947358344","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.00054812816,0.0005592,0.01421939,0.00092408963,0.00072261965,0.0012858342,0.0004047257,0.0011891471,0.9801469],"genre_scores_gemma":[0.009440396,0.00076315994,0.00225893,0.0006716007,0.00093547505,0.0000010199092,0.003653673,0.0042448235,0.9780309],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946299,0.0005757917,0.00075902353,0.0015377732,0.001521689,0.0009758067],"domain_scores_gemma":[0.9957733,0.0000654573,0.0006779882,0.0024827812,0.00047171942,0.0005287677],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00057642255,0.00071988645,0.0007294474,0.0005445561,0.00087437977,0.0016177051,0.0058260057,0.00025760723,0.29157087],"category_scores_gemma":[0.00026519288,0.00073618576,0.00016950304,0.00079004397,0.00026686155,0.0006593325,0.004433761,0.0008154543,0.15696019],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000023295774,0.0001957736,0.00003721182,0.00015370046,0.0002103381,0.000080012476,0.00017089695,0.000017232815,0.000042433934,0.002201814,0.94190204,0.054965246],"study_design_scores_gemma":[0.00090610876,0.00026676248,0.00090378005,0.00027556447,0.000049042115,0.000001983587,0.000050068124,0.003651257,0.0000928006,0.000070442824,0.9930062,0.0007259813],"about_ca_topic_score_codex":0.08531218,"about_ca_topic_score_gemma":0.00073896657,"teacher_disagreement_score":0.1346107,"about_ca_system_score_codex":0.00030196886,"about_ca_system_score_gemma":0.0000553307,"threshold_uncertainty_score":0.99955297},"labels":[],"label_agreement":null},{"id":"W6947673242","doi":"10.4224/23000148","title":"A greenhouse on Venus","year":2014,"lang":"en","type":"article","venue":"NPARC","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Herzberg Institute of Astrophysics","funders":"","keywords":"","score_opus":0.012983332569192242,"score_gpt":0.21914950595384028,"score_spread":0.20616617338464804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947673242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084254,0.0000045220822,0.6405428,0.003476958,0.0006344462,0.00009215244,0.0000021599274,0.00035455782,0.346467],"genre_scores_gemma":[0.934327,0.0000041139497,0.060035706,0.0021760974,0.00024313254,0.000008833467,0.0000036890312,0.00000850151,0.0031929072],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999522,0.00001818502,0.000047909543,0.00015992652,0.00013274589,0.00011927232],"domain_scores_gemma":[0.99948,0.00002193002,0.000017534509,0.00043948303,0.000007301377,0.000033712673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013244052,0.000046139503,0.000045576606,0.000039188268,0.000039625123,0.00008629498,0.000579217,0.000011036492,0.000027575596],"category_scores_gemma":[0.000017354647,0.000040404248,0.000017799375,0.00010196246,0.000009901559,0.00018596271,0.00015553657,0.00004120924,0.0007458423],"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.0000010610808,0.000026042306,0.000043993896,0.0000028916197,0.000003212906,0.000006794805,0.000043727337,0.0000039878378,0.0001955574,0.3416006,0.029052151,0.62902],"study_design_scores_gemma":[0.00042861237,0.00021780345,0.0033804034,0.00001751706,0.0000037273605,0.000002380147,0.0000027174729,0.11142052,0.0010486258,0.07972256,0.8035435,0.0002116157],"about_ca_topic_score_codex":0.0000019690715,"about_ca_topic_score_gemma":9.1180243e-7,"teacher_disagreement_score":0.9259016,"about_ca_system_score_codex":0.0000054789944,"about_ca_system_score_gemma":0.000003112447,"threshold_uncertainty_score":0.9586542},"labels":[],"label_agreement":null},{"id":"W6947713066","doi":"10.3897/zookeys.179.2598.map18","title":"Map 18 from: Webster R, Sweeney J, DeMerchant I (2012) New Coleoptera records from New Brunswick, Canada: Mycetophagidae, Tetratomidae, and Melandryidae. ZooKeys 179: 215-242. https://doi.org/10.3897/zookeys.179.2598","year":2012,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Triacetin; Fusible alloy","score_opus":0.03091813504345756,"score_gpt":0.22178097596731206,"score_spread":0.1908628409238545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947713066","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.0004321408,0.0042642714,0.034406044,0.0018060835,0.0019275004,0.00124466,0.00035420418,0.001585059,0.95398],"genre_scores_gemma":[0.0008008705,0.0009902415,0.0068823947,0.0007428224,0.0026058739,2.0605006e-7,0.0044548423,0.003031542,0.9804912],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99490315,0.0004724658,0.00068730995,0.0016188087,0.0011513704,0.0011668751],"domain_scores_gemma":[0.99613196,0.000084603904,0.0004920169,0.001911383,0.0002500016,0.00113004],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005451778,0.00077886845,0.0007240523,0.0005874186,0.00092053175,0.0023002042,0.004152463,0.0003414142,0.34371844],"category_scores_gemma":[0.00015974639,0.0007971088,0.00012010766,0.00065475615,0.00016894122,0.0012434126,0.004696782,0.000890419,0.08961945],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0000326145,0.00007358753,0.00015931038,0.00006213128,0.00027421914,0.00007269043,0.00026162033,0.0000011635468,0.000022327553,0.0014302455,0.9286686,0.06894146],"study_design_scores_gemma":[0.0013244785,0.00012707259,0.0035708714,0.00021651207,0.00010989955,0.00000356801,0.00004832107,0.0005000338,0.000089640256,0.00020814396,0.99292654,0.00087490224],"about_ca_topic_score_codex":0.33914098,"about_ca_topic_score_gemma":0.012572511,"teacher_disagreement_score":0.32656848,"about_ca_system_score_codex":0.00032555498,"about_ca_system_score_gemma":0.00029985287,"threshold_uncertainty_score":0.999448},"labels":[],"label_agreement":null},{"id":"W6947772399","doi":"10.3897/zookeys.179.2625.map2","title":"Map 2 from: Webster R, LeSage L, DeMerchant I (2012) New Coleoptera records from New Brunswick, Canada: Megalopodidae and Chrysomelidae. ZooKeys 179: 312-348. https://doi.org/10.3897/zookeys.179.2625","year":2012,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Data collection; Historical record; Topographic map (neuroanatomy); Field (mathematics)","score_opus":0.02718877606141553,"score_gpt":0.21503767500928217,"score_spread":0.18784889894786663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947772399","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.00033540023,0.005082905,0.04810472,0.0036051825,0.0021716908,0.0014042241,0.0003759826,0.0018934462,0.93702644],"genre_scores_gemma":[0.00049358717,0.0011767878,0.0076353224,0.0007550819,0.0026807303,1.7389976e-7,0.0047017937,0.003207951,0.9793486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951386,0.00044517848,0.00063903263,0.001558436,0.0010961477,0.0011226365],"domain_scores_gemma":[0.9963354,0.00006887093,0.0004668586,0.0019007653,0.00020795435,0.0010201589],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052677223,0.0007306566,0.00067240227,0.00055091886,0.0009515874,0.0023307984,0.004250779,0.00030836373,0.33097976],"category_scores_gemma":[0.0001414012,0.000760478,0.00011436244,0.0005819358,0.00016965062,0.0013060787,0.005473191,0.00084595074,0.103713386],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000024000372,0.00006888355,0.00004717208,0.00006184318,0.00022532577,0.0000630221,0.0003483474,0.0000010276161,0.000024316769,0.0015436737,0.91394055,0.08365184],"study_design_scores_gemma":[0.0010680417,0.0001133875,0.0024695175,0.00022081537,0.000090447924,0.0000025308718,0.0000629326,0.00040401134,0.000046365294,0.00018852732,0.9944996,0.00083377294],"about_ca_topic_score_codex":0.40091452,"about_ca_topic_score_gemma":0.015479125,"teacher_disagreement_score":0.3854354,"about_ca_system_score_codex":0.00036066893,"about_ca_system_score_gemma":0.00024098509,"threshold_uncertainty_score":0.9994846},"labels":[],"label_agreement":null},{"id":"W6947785541","doi":"10.3897/zookeys.327.5908.figures11-13","title":"Figures 11-13 from: Klimaszewski J, Webster R, Langor D, Bourdon C, Jacobs J (2013) Review of Canadian species of the genus Dinaraea Thomson, with descriptions of six new species (Coleoptera, Staphylinidae, Aleocharinae, Athetini). ZooKeys 327: 65-101. https://doi.org/10.3897/zookeys.327.5908","year":2013,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Aedeagus; Spermatheca; Genus; Male genitalia; Taxonomy (biology); Type species; Type (biology)","score_opus":0.03857428474321903,"score_gpt":0.21891260112260855,"score_spread":0.18033831637938952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947785541","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.000771662,0.0024047988,0.0017856193,0.00200275,0.0003012108,0.0014728634,0.0005503834,0.00024699088,0.99046373],"genre_scores_gemma":[0.0025130226,0.008825681,0.0020889847,0.00032775282,0.00037012497,7.9617485e-7,0.001111402,0.0011619772,0.98360026],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966841,0.00038533268,0.00065945234,0.0007673415,0.00093522173,0.00056858023],"domain_scores_gemma":[0.99633175,0.000049533617,0.0008127901,0.0019648636,0.000540931,0.00030012082],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004764742,0.00044898925,0.00064407685,0.00087138865,0.0004711039,0.00045183784,0.004045058,0.00014279576,0.15722533],"category_scores_gemma":[0.00023235178,0.00034802328,0.00019964571,0.0012954402,0.00042380448,0.00040088253,0.0017112545,0.00042087876,0.01481637],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001391563,0.00011779705,0.0001722087,0.0007925124,0.0001436597,0.0000102325575,0.0003808207,0.0000049925875,0.00004878228,0.0063817166,0.98758006,0.0043532955],"study_design_scores_gemma":[0.00041558166,0.000300588,0.0063659027,0.002699717,0.0000747794,0.0000013869176,0.00011117537,0.000082228355,0.00020036718,0.000031634758,0.9893651,0.0003515665],"about_ca_topic_score_codex":0.03105743,"about_ca_topic_score_gemma":0.0011504139,"teacher_disagreement_score":0.14240895,"about_ca_system_score_codex":0.00010196924,"about_ca_system_score_gemma":0.00005405955,"threshold_uncertainty_score":0.9998972},"labels":[],"label_agreement":null},{"id":"W6948018149","doi":"10.5061/dryad.sf7m0cg2k","title":"Behavioural plasticity is associated with reduced extinction risk in birds","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Nucleofection; Gestational period; TSG101; Diafiltration; Dysgeusia; Liquation; Hyporeflexia; Fusible alloy; Triacetin","score_opus":0.039270869105776096,"score_gpt":0.23838697925788185,"score_spread":0.19911611015210576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948018149","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006322647,0.0000101577225,0.009730275,0.00046019576,0.00020290617,0.0005383499,0.98616326,0.0008606174,0.0014019485],"genre_scores_gemma":[0.0023051298,0.00010715045,0.00034629073,0.00016418239,0.000101128746,9.494027e-8,0.99629843,0.000510757,0.00016684436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973474,0.000442616,0.00032081196,0.0008071316,0.0006613278,0.00042067358],"domain_scores_gemma":[0.9984952,0.00003257453,0.0003229832,0.0006532865,0.00032791775,0.0001680174],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005487986,0.0002582573,0.00026024057,0.0004118908,0.0010198967,0.0017690085,0.002814539,0.00012515673,0.0021758946],"category_scores_gemma":[0.00082987617,0.00025628056,0.0000435427,0.0016347221,0.000092756265,0.0006937021,0.0029238358,0.00074734434,0.005857923],"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.000024992269,0.0001413673,0.0000033304018,0.000025666752,0.00004745813,0.00007726923,0.00014229513,0.000012072521,0.000013483284,0.000041998304,0.9871274,0.012342651],"study_design_scores_gemma":[0.000639112,0.0003485113,0.0013012125,0.0000711866,0.000042316155,0.000017463033,0.000029965015,0.0024543977,0.000027081516,0.000027273722,0.9947291,0.00031237915],"about_ca_topic_score_codex":0.00012207273,"about_ca_topic_score_gemma":0.000006886446,"teacher_disagreement_score":0.012030273,"about_ca_system_score_codex":0.00022922069,"about_ca_system_score_gemma":0.000009569181,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W6948169205","doi":"10.48550/arxiv.astro-ph/0506288","title":"A Deep Infrared Search for AXP 1E 1841-045","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Pulsar; Infrared; Photometry (optics); Limiting; Position (finance); Limiting magnitude","score_opus":0.08690087589726818,"score_gpt":0.20388470585486668,"score_spread":0.1169838299575985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948169205","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.00702038,0.0000628747,0.9792527,0.0002392141,0.0005960708,0.00065967336,0.00004352809,0.00033326156,0.011792308],"genre_scores_gemma":[0.8738304,0.0004659298,0.07191098,0.00059132266,0.0007343273,0.000011251653,0.00034991425,0.00006299978,0.052042913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773496,0.00007540742,0.00019908186,0.0012996875,0.00014068176,0.00055020466],"domain_scores_gemma":[0.9977191,0.00010185208,0.0001461323,0.0016847671,0.00016306427,0.00018505797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036095,0.00032327042,0.0003142425,0.00040747918,0.00020432172,0.00038835377,0.0037680324,0.00021176231,0.000057694575],"category_scores_gemma":[0.000019193625,0.00038317364,0.00025182313,0.0005791936,0.000085988184,0.00092574797,0.0048092874,0.0004220117,0.00022870577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007856621,0.00037556334,0.0010871249,0.00038529173,0.00043490247,0.00046483218,0.00070101593,0.20684308,0.000014646102,0.7276298,0.013931712,0.048053466],"study_design_scores_gemma":[0.0007371584,0.000055915345,0.00040125713,0.000045604134,0.000058310783,0.0000013591242,0.00006105136,0.9494979,0.0000729831,0.022803407,0.025744649,0.00052044576],"about_ca_topic_score_codex":0.000057462643,"about_ca_topic_score_gemma":0.000030520863,"teacher_disagreement_score":0.9073417,"about_ca_system_score_codex":0.00017792854,"about_ca_system_score_gemma":0.00013933584,"threshold_uncertainty_score":0.999862},"labels":[],"label_agreement":null},{"id":"W6948185420","doi":"10.48448/4gcb-xp21","title":"HELPD: Mitigating Hallucination of LVLMs by Hierarchical Feedback Learning with Vision-enhanced Penalty Decoding","year":2024,"lang":"en","type":"other","venue":"Underline Science Inc.","topic":"Data Management and Algorithms","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Decoding methods; Object (grammar); Sentence; Image (mathematics); Association (psychology); Encoding (memory); Modality (human–computer interaction); Generative grammar; Channel (broadcasting)","score_opus":0.008228171800360307,"score_gpt":0.26922926896420385,"score_spread":0.26100109716384357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948185420","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.00016321463,0.00033717643,0.80541795,0.0005987749,0.00053176144,0.00030775814,0.000019074829,0.00044218393,0.19218208],"genre_scores_gemma":[0.0760217,0.00015966389,0.59612286,0.00021417794,0.00037781917,0.000026406306,0.00016265565,0.00029575697,0.32661894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665564,0.000057951842,0.00038155168,0.001126301,0.0012633522,0.00051521446],"domain_scores_gemma":[0.9986514,0.00007993244,0.00038626016,0.0006134887,0.00012146907,0.00014749262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010851322,0.00031389936,0.00033830776,0.0007886963,0.00021179151,0.0007187727,0.001994792,0.00010463047,0.00013039004],"category_scores_gemma":[0.000113985756,0.00025128957,0.00004927042,0.0018031376,0.0006130313,0.0009709439,0.0009865016,0.0005104592,0.00016474248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118137095,0.00027805855,0.00007929732,0.00083386863,0.0001423843,0.000057459565,0.0012245727,0.00076561177,0.011308212,0.045668736,0.13426729,0.8053627],"study_design_scores_gemma":[0.000821673,0.0007122303,0.000039073835,0.0029442261,0.00006401797,0.000016958447,0.00038755208,0.9049979,0.0044205775,0.0029204453,0.08148397,0.0011914059],"about_ca_topic_score_codex":0.00007369381,"about_ca_topic_score_gemma":0.000052224335,"teacher_disagreement_score":0.90423226,"about_ca_system_score_codex":0.00008539069,"about_ca_system_score_gemma":0.00021306463,"threshold_uncertainty_score":0.9999939},"labels":[],"label_agreement":null},{"id":"W6948210343","doi":"10.5061/dryad.51c59zw62","title":"Defining Relictual Biodiversity: Conservation Units in Speckled Dace (Leuciscidae: Rhinichthys osculus) of the Greater Death Valley Ecosystem","year":2020,"lang":"en","type":"dataset","venue":"Open MIND","topic":"Data Management and Algorithms","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":"Coalescent theory; Population; Threatened species; Biodiversity; Metapopulation; Habitat; Population fragmentation; Wildlife conservation; Ecosystem; Conservation biology","score_opus":0.06258344746041572,"score_gpt":0.26535257073492635,"score_spread":0.20276912327451063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948210343","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021491898,0.00004616082,0.0005767555,0.0012925727,0.00066711736,0.0010001638,0.9931565,0.00000596004,0.0011055873],"genre_scores_gemma":[0.0008964209,0.00009625077,0.010029107,0.00069719227,0.00007236866,0.000021032201,0.98760253,0.000014424447,0.0005707007],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779767,0.00024322928,0.00046545075,0.00074993604,0.00048186598,0.0002618279],"domain_scores_gemma":[0.99792564,0.00009668761,0.0004203873,0.0014040478,0.00008648511,0.0000667571],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075207674,0.00027305578,0.00047525862,0.00016940851,0.00013751171,0.00060500443,0.005644146,0.00013626111,0.0001824451],"category_scores_gemma":[0.00013586882,0.00021457567,0.00007868517,0.0009823302,0.000035166668,0.00082810596,0.006150148,0.0003082585,0.001425678],"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.000013647074,0.000032160075,0.0004570945,0.000043635064,0.00008084284,0.000060685168,0.00031087524,0.00001887754,0.0000010299378,0.000072895265,0.9964168,0.0024914618],"study_design_scores_gemma":[0.00068607915,0.000062866326,0.0008780595,0.00022331609,0.00008472435,0.0000039758484,0.00010947377,0.001230971,0.00007568255,0.000012365207,0.99636185,0.00027064912],"about_ca_topic_score_codex":0.0007948031,"about_ca_topic_score_gemma":0.00092872925,"teacher_disagreement_score":0.009452352,"about_ca_system_score_codex":0.00006487329,"about_ca_system_score_gemma":0.00022874482,"threshold_uncertainty_score":0.9997358},"labels":[],"label_agreement":null},{"id":"W6948267428","doi":"10.48597/pc2e-sua8","title":"Measurement of Particle_number_size_distribution at London - North Kensington","year":2023,"lang":"en","type":"dataset","venue":"EBAS","topic":"Data Management and Algorithms","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":"Quarter (Canadian coin); Sample (material); Period (music)","score_opus":0.029605780682171606,"score_gpt":0.24437867206919503,"score_spread":0.21477289138702343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948267428","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026436168,0.00009874788,0.0051944237,0.00020835636,0.001465509,0.00021639721,0.9923851,0.00013167967,0.000035432007],"genre_scores_gemma":[0.00025701785,0.00011658914,0.00029416376,0.000055843444,0.0001077973,0.000013352275,0.99897057,0.000009753182,0.00017488924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796045,0.000057337722,0.0003236247,0.00045779502,0.0009041492,0.00029663648],"domain_scores_gemma":[0.9983953,0.000019797933,0.00023721262,0.0011476647,0.00013007989,0.00006990804],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043108786,0.00019560056,0.00024907914,0.00010289507,0.00008277957,0.000098506986,0.0010675301,0.00007093203,0.000013503727],"category_scores_gemma":[0.00007771278,0.000191737,0.000089356465,0.00048246223,0.000036680674,0.00023071338,0.0010029863,0.00012308889,0.0018193311],"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.000004180296,0.000068456735,0.000054587854,0.000094084884,0.000040006555,0.000025965766,0.000005144155,0.0000071753293,0.000008408688,0.000063576976,0.99638265,0.003245785],"study_design_scores_gemma":[0.00023325226,0.00006444835,0.002278838,0.00008374814,0.000042968666,0.0000012542636,0.0000014244883,0.0008940399,0.000359379,0.000049812486,0.99577343,0.00021738154],"about_ca_topic_score_codex":0.00040361081,"about_ca_topic_score_gemma":0.00090753613,"teacher_disagreement_score":0.006585501,"about_ca_system_score_codex":0.0001499156,"about_ca_system_score_gemma":0.000042767748,"threshold_uncertainty_score":0.9989579},"labels":[],"label_agreement":null},{"id":"W6948291645","doi":"10.5061/dryad.pg4f4qrpf","title":"Variable strength of predator-mediated effects on species occurrence in an arctic terrestrial vertebrate community","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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é de Sherbrooke; Université Laval; Université du Québec à Rimouski","funders":"","keywords":"Predation; Trophic level; Habitat; Food web; Vertebrate; Herbivore; Predator; Competition (biology); Arctic","score_opus":0.040493019700205975,"score_gpt":0.2524051740059981,"score_spread":0.21191215430579213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948291645","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012089774,0.000028511617,0.0016066983,0.00007821038,0.0006285572,0.0006354435,0.9934976,0.0003097801,0.0020062393],"genre_scores_gemma":[0.0022543524,0.000113480346,0.00046349724,0.000073626,0.000114248294,1.03997756e-7,0.99675614,0.0001812434,0.00004331836],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99634063,0.0017904128,0.00037529174,0.0005438321,0.00057065516,0.00037914715],"domain_scores_gemma":[0.99736136,0.00017803488,0.00023866093,0.0018411399,0.0002342099,0.000146606],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001102549,0.00024609672,0.00033018025,0.00046523043,0.0007451287,0.0013755619,0.004672343,0.00011164907,0.0012603868],"category_scores_gemma":[0.001609748,0.00025968294,0.00004199099,0.0012313097,0.00011827222,0.00078946084,0.0041712057,0.0008967664,0.0010195983],"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.000032024593,0.0005610884,0.000002172098,0.00033258265,0.00003559597,0.000043108597,0.00013545254,0.000020940864,0.00007055603,0.00045548435,0.9855379,0.012773078],"study_design_scores_gemma":[0.0007786854,0.00061770424,0.00022934507,0.00028765266,0.000016446664,0.0000055342525,0.00005831868,0.0013868384,0.00011326955,0.00007590674,0.9961758,0.00025449673],"about_ca_topic_score_codex":0.00014679797,"about_ca_topic_score_gemma":0.00000785852,"teacher_disagreement_score":0.012518581,"about_ca_system_score_codex":0.00012836773,"about_ca_system_score_gemma":0.000018141567,"threshold_uncertainty_score":0.9999855},"labels":[],"label_agreement":null},{"id":"W6948325603","doi":"10.48550/arxiv.astro-ph/0009306","title":"Multiresolution Analysis of Substructure in Dark Matter Halos","year":2000,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Halo; Substructure; Dark matter; Population; Cluster analysis; Wavelet; Wavelet transform; Multiresolution analysis","score_opus":0.03962676767940601,"score_gpt":0.17718666999983115,"score_spread":0.13755990232042514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948325603","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.71853775,0.000038805727,0.2746176,0.0000749095,0.00024258488,0.00024199052,0.00008967499,0.000080859405,0.0060758395],"genre_scores_gemma":[0.9969816,0.00007078053,0.0018387127,0.000054624234,0.00001471821,3.9759024e-7,0.00014339035,0.000006511091,0.0008892676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852335,0.000088966044,0.00021764163,0.0008367151,0.00009539546,0.00023792878],"domain_scores_gemma":[0.99843603,0.000028325992,0.00019505234,0.001241977,0.00004251001,0.000056105502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014360095,0.00020859961,0.00038109627,0.0011392583,0.000039103954,0.00007080354,0.0017667165,0.00016448957,0.00014622456],"category_scores_gemma":[0.0000038760923,0.00023788429,0.00022630561,0.0020253833,0.00006414458,0.00044443217,0.0012589891,0.00028791433,0.000045569046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043717166,0.00020803187,0.15698852,0.00013828315,0.001247828,0.00042421155,0.00057165325,0.80679667,0.000023627425,0.027100798,0.0017089134,0.0047477437],"study_design_scores_gemma":[0.0002801554,0.000008301117,0.18797143,0.000036535537,0.00035784664,2.6613841e-7,0.000018538978,0.80028534,0.00001643544,0.010602164,0.0001508025,0.00027218083],"about_ca_topic_score_codex":0.0005987428,"about_ca_topic_score_gemma":0.00023729882,"teacher_disagreement_score":0.27844387,"about_ca_system_score_codex":0.00009491554,"about_ca_system_score_gemma":0.0000326851,"threshold_uncertainty_score":0.970064},"labels":[],"label_agreement":null},{"id":"W6948376403","doi":"10.5061/dryad.p8cz8w9vz","title":"Density and genetic diversity of grizzly bears at the northern edge of their distribution","year":2023,"lang":"en","type":"dataset","venue":"DRYAD","topic":"Data Management and Algorithms","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 Victoria; University of Calgary","funders":"","keywords":"Genetic diversity; Tundra; Range (aeronautics); Ursus; Population; Population density; Species richness; Grizzly Bears; Habitat","score_opus":0.01653240462580413,"score_gpt":0.21302272866317334,"score_spread":0.1964903240373692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948376403","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029666578,0.00010243053,0.0022094008,0.00011718147,0.0003352987,0.00015913835,0.9673839,0.00002061127,0.000005414942],"genre_scores_gemma":[0.0025797416,0.00045445588,0.000105796295,0.000032037227,0.00005780405,0.0000027889814,0.9966,0.0000049937826,0.00016238494],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999137,0.000049737195,0.0001521654,0.00027719155,0.0002480019,0.00013590424],"domain_scores_gemma":[0.9988627,0.00007035391,0.0001881365,0.0007948565,0.00005367255,0.000030309277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019420867,0.00012421541,0.00018926013,0.00004088597,0.00017540049,0.00003412656,0.0011494502,0.000061685234,0.0000031716015],"category_scores_gemma":[0.000020970516,0.00008824094,0.000059421855,0.00022178204,0.00014077433,0.000098269236,0.005165004,0.00009627473,0.00006732699],"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.000003255557,0.000022902233,0.0018583804,0.000074730575,0.000047491674,0.000012107819,0.000049935494,0.0000023954897,0.0000045031165,0.000030955965,0.99059325,0.007300082],"study_design_scores_gemma":[0.000426114,0.00012969965,0.30575347,0.000090630405,0.00017111914,0.0000066699868,0.00005385987,0.0009790517,0.0002836276,0.0007507305,0.69094753,0.0004074702],"about_ca_topic_score_codex":0.0010112262,"about_ca_topic_score_gemma":0.0014188255,"teacher_disagreement_score":0.30389512,"about_ca_system_score_codex":0.00002539162,"about_ca_system_score_gemma":0.000016109128,"threshold_uncertainty_score":0.64378077},"labels":[],"label_agreement":null},{"id":"W6948431325","doi":"10.48550/arxiv.astro-ph/0011041","title":"Tidal stirring and the origin of dwarf spheroidals in the Local Group","year":2000,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","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":"Dwarf galaxy; Dark matter; Cuspy halo problem; Local Group; Milky Way; Dark matter halo; Halo; Galaxy","score_opus":0.049562823294764385,"score_gpt":0.18430613141371718,"score_spread":0.1347433081189528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948431325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36763364,0.00018044066,0.62224287,0.0003601217,0.00025347818,0.0005409058,0.00001328282,0.00006709426,0.008708195],"genre_scores_gemma":[0.9983404,0.00029719592,0.0007253792,0.000106061736,0.00003259131,9.902406e-7,0.000006742956,0.000005643267,0.00048498347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987338,0.00022120305,0.00016909117,0.0005478258,0.00011199284,0.00021607279],"domain_scores_gemma":[0.99869394,0.00017643921,0.00013198458,0.00094352267,0.000019197141,0.000034890723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966206,0.00018077176,0.00023988505,0.00011346667,0.00008351648,0.00014585661,0.0024996742,0.00008075301,0.000018937428],"category_scores_gemma":[0.000008232209,0.00012547683,0.00008604629,0.00045966648,0.00032562652,0.00034703568,0.0017236312,0.00038355603,0.000013995796],"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.000080887134,0.00010306989,0.0029104908,0.00009051692,0.00008383846,0.00028521605,0.0010162252,0.050173085,0.0000020002797,0.92306054,0.00042178214,0.02177237],"study_design_scores_gemma":[0.0021884039,0.000054575798,0.006689971,0.00014485356,0.00008688298,0.0000057573875,0.0006095674,0.8870805,0.000014717506,0.09893093,0.0037685696,0.00042529107],"about_ca_topic_score_codex":0.00061299483,"about_ca_topic_score_gemma":0.000120405915,"teacher_disagreement_score":0.8369074,"about_ca_system_score_codex":0.000033479395,"about_ca_system_score_gemma":0.00003181069,"threshold_uncertainty_score":0.5116797},"labels":[],"label_agreement":null},{"id":"W6948616277","doi":"10.5061/dryad.t4b8gtj19","title":"Divergence in life history and behaviour between hybridizing Phymata","year":2021,"lang":"en","type":"dataset","venue":"Open MIND","topic":"Data Management and Algorithms","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":"Parapatric speciation; Divergence (linguistics); Life history theory; Life history; Gene flow; Natural selection; Juvenile; Vertebrate","score_opus":0.08198395331410434,"score_gpt":0.29664740360567093,"score_spread":0.21466345029156658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948616277","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004905641,0.0013560537,0.0005920442,0.00015726523,0.0008440152,0.00034308547,0.9958044,0.0000030027768,0.00040956904],"genre_scores_gemma":[0.000051675124,0.00033777376,0.014234643,0.00012449457,0.00015246456,0.000017282173,0.9838256,0.000009072443,0.0012469564],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816996,0.000080402846,0.0003075754,0.000883986,0.00028368825,0.00027439187],"domain_scores_gemma":[0.9984565,0.000049075083,0.00017097009,0.0011675514,0.00002280446,0.00013311178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080598,0.00022670954,0.00039851764,0.00017314298,0.00006384711,0.0006625122,0.003795595,0.00008900077,0.00069802604],"category_scores_gemma":[0.000055295928,0.0002450368,0.00003248536,0.0002044344,0.000045403136,0.0012013284,0.007803461,0.00029658718,0.00028228704],"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":[6.177682e-7,0.000031352018,0.00063618686,0.000017654264,0.000015204166,0.0003021584,0.00003750606,2.1179693e-7,6.037044e-7,0.0000031321902,0.95599145,0.042963937],"study_design_scores_gemma":[0.00019122339,0.000016291033,0.0022493512,0.000117046475,0.00003501631,0.0000032579528,0.000019290956,0.00007126555,0.000009137356,0.000007725704,0.9969693,0.00031113465],"about_ca_topic_score_codex":0.0008747038,"about_ca_topic_score_gemma":0.00023122007,"teacher_disagreement_score":0.042652804,"about_ca_system_score_codex":0.000101026875,"about_ca_system_score_gemma":0.00020765606,"threshold_uncertainty_score":0.99923104},"labels":[],"label_agreement":null},{"id":"W6948637795","doi":"10.5281/zenodo.11691086","title":"Qss facts mcdonalds pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Nucleofection; Quality (philosophy); Work (physics); Population; TSG101; Limiting","score_opus":0.029635298586989937,"score_gpt":0.24202891009161756,"score_spread":0.21239361150462763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948637795","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":[6.446544e-7,0.00028786558,0.055513397,0.0008865997,0.00048024947,0.00028135304,0.0002107201,0.002484616,0.93985456],"genre_scores_gemma":[0.00013514164,0.00020415467,0.0023309875,0.00022512168,0.0004301964,3.2487826e-8,0.0017441701,0.00521979,0.9897104],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805725,0.00013600737,0.00018344582,0.00072840985,0.0005088019,0.0003861032],"domain_scores_gemma":[0.9986626,0.0000070571627,0.000100992926,0.0009715466,0.00010248834,0.00015530104],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039223843,0.00022172755,0.00017294499,0.00055633654,0.0004517718,0.0028842138,0.0034486086,0.00010441933,0.08594828],"category_scores_gemma":[0.000089617075,0.00022573372,0.00006789743,0.000721783,0.00008595052,0.0003311897,0.0046602623,0.00032063999,0.37327513],"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.0000012247897,0.000031236217,3.4339223e-8,0.0001059972,0.00005497298,0.00004759536,0.00008839522,9.689609e-7,0.000013725937,0.017257405,0.8915724,0.09082602],"study_design_scores_gemma":[0.00014051305,0.000063524574,0.0000042505912,0.00010753752,0.000014208188,0.000027180773,0.000017976228,0.000717807,0.000015340143,0.000612187,0.99802536,0.00025409012],"about_ca_topic_score_codex":0.000021618434,"about_ca_topic_score_gemma":4.4189414e-7,"teacher_disagreement_score":0.28732684,"about_ca_system_score_codex":0.00006802585,"about_ca_system_score_gemma":0.0000030784624,"threshold_uncertainty_score":0.9981509},"labels":[],"label_agreement":null},{"id":"W6948663810","doi":"10.5281/zenodo.11333709","title":"Sylvilagus (Sylvilagus) nuttallii","year":2005,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Subspecies; IUCN Red List; Allopatric speciation; Fauna; Endangered species","score_opus":0.027875214653893397,"score_gpt":0.23386471504264264,"score_spread":0.20598950038874925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948663810","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.0029331257,0.0003008886,0.45030725,0.00783128,0.00039594676,0.0006920254,0.00011875326,0.0043446585,0.5330761],"genre_scores_gemma":[0.9132536,0.00053362024,0.054846082,0.0030431924,0.0016522662,1.8950334e-7,0.0027333421,0.0030058497,0.020931834],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820894,0.0001437809,0.00022790757,0.00053019344,0.00044918034,0.0004399692],"domain_scores_gemma":[0.9986152,0.000015255739,0.000082027844,0.0008735858,0.00023504866,0.00017887271],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005975665,0.00014849342,0.00012203673,0.00023403259,0.0014827674,0.001982856,0.0031722183,0.000042437205,0.0048236633],"category_scores_gemma":[0.00015415197,0.00015433846,0.000052883464,0.0006942076,0.00008437478,0.0013838937,0.003003687,0.00019531208,0.026319154],"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.0000061690275,0.00012109465,0.0000011326126,0.000017377399,0.000021831476,0.000016402499,0.00038348374,0.000062594794,0.00049778644,0.067780554,0.3209653,0.61012626],"study_design_scores_gemma":[0.000337205,0.00009269601,0.00018139265,0.000011720192,0.000005233841,0.00004463728,0.00004318006,0.010074007,0.00035749248,0.00038758875,0.98827326,0.00019159146],"about_ca_topic_score_codex":0.0000054491147,"about_ca_topic_score_gemma":2.5299616e-7,"teacher_disagreement_score":0.9103205,"about_ca_system_score_codex":0.00010274958,"about_ca_system_score_gemma":0.0000024552112,"threshold_uncertainty_score":0.9998172},"labels":[],"label_agreement":null},{"id":"W6948728287","doi":"10.5255/ukda-sn-8809-1","title":"Quarterly Labour Force Survey Household Dataset, January - March, 2021","year":2021,"lang":"en","type":"other","venue":"UK Data Archive","topic":"Data Management and Algorithms","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":"Quarter (Canadian coin); Unemployment; Work (physics); Sample (material); Survey data collection; Northern ireland; Work force; Data collection; Data source","score_opus":0.04867880581222507,"score_gpt":0.2716636286344817,"score_spread":0.22298482282225662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948728287","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014346155,0.00095349294,0.357367,0.00024782796,0.0013061791,0.00051809446,0.5376145,0.0001908023,0.10180061],"genre_scores_gemma":[0.0000056662334,0.0006249096,0.06625055,0.00051172654,0.0006756003,0.000019669278,0.59623075,0.00018996294,0.33549115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959626,0.00044327535,0.00036301895,0.0019595637,0.00060939486,0.00066215306],"domain_scores_gemma":[0.99043727,0.00025691182,0.00027044144,0.008807762,0.00001723492,0.00021035441],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007352014,0.0005007149,0.00052052067,0.0003938041,0.00010905596,0.000777285,0.010373406,0.000120705234,0.0015247267],"category_scores_gemma":[0.00006494848,0.0004971105,0.00006318721,0.0005119113,0.000120016026,0.00070213515,0.00748621,0.00047041345,0.0005047133],"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.0000036567162,0.00006216841,0.000070696435,0.000084412386,0.00016162421,0.0003365678,0.000033896922,4.1518547e-7,0.0000045876973,0.003937269,0.9677461,0.027558649],"study_design_scores_gemma":[0.00032134049,0.000058291153,0.002281212,0.00019454649,0.00002777246,0.000010433272,0.00002009245,0.0019845087,0.0000012205235,0.00064421893,0.9938384,0.0006179382],"about_ca_topic_score_codex":0.006161458,"about_ca_topic_score_gemma":0.008371417,"teacher_disagreement_score":0.29111645,"about_ca_system_score_codex":0.000016561771,"about_ca_system_score_gemma":0.0001624033,"threshold_uncertainty_score":0.99974805},"labels":[],"label_agreement":null},{"id":"W6948853753","doi":"10.5281/zenodo.10817998","title":"Probabilités et statistique : sciences de la nature","year":2023,"lang":"fr","type":"book","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Cegep Edouard Montpetit","funders":"","keywords":"Statistical analysis; Context (archaeology); Field (mathematics); Natural (archaeology)","score_opus":0.0730909250878944,"score_gpt":0.3304073033254954,"score_spread":0.257316378237601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948853753","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.00010646821,0.00024742182,0.17905939,0.0051504676,0.0006015672,0.00093323586,0.0013057156,0.0020357543,0.81056],"genre_scores_gemma":[0.01030554,0.0030305842,0.102675505,0.0031498729,0.0017014181,6.725218e-7,0.01754743,0.008580796,0.85300815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.994566,0.0021396675,0.00039276353,0.0011984988,0.0009177595,0.0007852928],"domain_scores_gemma":[0.99771273,0.00033174912,0.00023557118,0.00091052806,0.0005454531,0.00026395873],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006194677,0.00035230618,0.0002791943,0.0005028685,0.0037199126,0.00693388,0.005262928,0.0003426262,0.0042728777],"category_scores_gemma":[0.0022142103,0.00037658546,0.00009602928,0.0013943645,0.0014819972,0.0012226906,0.007194779,0.0014744807,0.014459915],"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.0000052949026,0.000071802635,0.0000011867993,0.00019060442,0.00003757902,0.000091335656,0.0006257399,0.00013516292,0.000024105637,0.5518261,0.34959605,0.097395],"study_design_scores_gemma":[0.00024520303,0.00029840914,0.00048115518,0.00023685538,0.000021876416,0.000097170596,0.00008892851,0.010856565,0.000015915424,0.03225624,0.95501435,0.00038733231],"about_ca_topic_score_codex":0.00003749503,"about_ca_topic_score_gemma":0.0000014902165,"teacher_disagreement_score":0.6054183,"about_ca_system_score_codex":0.00040835267,"about_ca_system_score_gemma":0.000082483166,"threshold_uncertainty_score":0.99986863},"labels":[],"label_agreement":null},{"id":"W6948974085","doi":"10.5281/zenodo.12020037","title":"les voyelles orales et nasales pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Feature (linguistics); Work (physics); Context (archaeology)","score_opus":0.0665771695601961,"score_gpt":0.27745813939132624,"score_spread":0.21088096983113014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948974085","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.00003299741,0.0020216058,0.060402106,0.004494098,0.00068382017,0.00050995837,0.00044156378,0.001388881,0.930025],"genre_scores_gemma":[0.0019205777,0.0012898061,0.0038969936,0.00030053803,0.0005504646,7.154941e-8,0.002600812,0.004954217,0.9844865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657494,0.0006108771,0.00039291818,0.0011464625,0.0006462958,0.0006284934],"domain_scores_gemma":[0.9981224,0.00003700273,0.00018866749,0.0010878602,0.00033262084,0.00023142496],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009783113,0.00042634906,0.00031954373,0.00061322656,0.0013360877,0.009043006,0.0038201453,0.00018487792,0.17731163],"category_scores_gemma":[0.00031006,0.00043922558,0.00014272385,0.0009870146,0.0004182432,0.0010478966,0.006762546,0.0006270977,0.40898484],"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.0000047022017,0.00008279191,4.0469303e-7,0.00028157132,0.0000979624,0.00008151205,0.0005402011,0.000009814985,0.000049271926,0.24853484,0.53036594,0.21995097],"study_design_scores_gemma":[0.00024130389,0.00017787979,0.00007709544,0.00044182094,0.00005148867,0.00007875389,0.00019894908,0.0020617258,0.000028421966,0.0015799192,0.9945869,0.0004757735],"about_ca_topic_score_codex":0.00009701464,"about_ca_topic_score_gemma":0.0000055330615,"teacher_disagreement_score":0.4642209,"about_ca_system_score_codex":0.00015764308,"about_ca_system_score_gemma":0.000008469106,"threshold_uncertainty_score":0.99996406},"labels":[],"label_agreement":null},{"id":"W6949009258","doi":"10.5281/zenodo.11843940","title":"Geographie gebhardt pdf","year":2024,"lang":"de","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Plan (archaeology); Statistical analysis; Quarter (Canadian coin)","score_opus":0.02640309473926354,"score_gpt":0.23485727150310476,"score_spread":0.2084541767638412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949009258","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.000008054519,0.0018401673,0.0306333,0.0014939538,0.0017389607,0.00078563316,0.0006788742,0.0021027524,0.96071833],"genre_scores_gemma":[0.00054315635,0.0024441332,0.002393364,0.00047246457,0.0019783129,9.399096e-8,0.0068758163,0.009943481,0.9753492],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956904,0.0004203195,0.00047227257,0.0015757032,0.00096556626,0.00087571307],"domain_scores_gemma":[0.9972409,0.000018002767,0.00023545393,0.0017852419,0.00036404992,0.00035632332],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0011552301,0.00049488095,0.0003791339,0.001334958,0.0018167199,0.008295707,0.0057611605,0.00021625854,0.25710052],"category_scores_gemma":[0.000213933,0.0005239424,0.00021608187,0.0021389083,0.00036490348,0.0006133846,0.009103805,0.0007964034,0.8066679],"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.0000074375725,0.00010911431,2.0561477e-7,0.00027068073,0.00024121866,0.00013887978,0.00026967056,0.0000030581416,0.000028219025,0.021862503,0.808371,0.16869801],"study_design_scores_gemma":[0.00034832046,0.00021363341,0.00002734679,0.00029230255,0.000100210425,0.000052264542,0.000069743626,0.0017730742,0.000012223151,0.0012985326,0.9952423,0.00057002966],"about_ca_topic_score_codex":0.000025915047,"about_ca_topic_score_gemma":4.2424602e-7,"teacher_disagreement_score":0.5495674,"about_ca_system_score_codex":0.00013433566,"about_ca_system_score_gemma":0.000006004876,"threshold_uncertainty_score":0.9997212},"labels":[],"label_agreement":null},{"id":"W6949152593","doi":"10.5281/zenodo.14981045","title":"Fig. 80 in A revision of the genus Sclerocoelus Marshall (Diptera: Sphaeroceridae)","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Data Management and Algorithms","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":"Genus; Dorsum; Scale (ratio); Taxonomy (biology)","score_opus":0.023500312835162185,"score_gpt":0.2352306461710854,"score_spread":0.21173033333592323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949152593","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.000025167352,0.00048065133,0.031053904,0.0007712215,0.00031595124,0.0007995682,0.00023675624,0.0005537478,0.96576303],"genre_scores_gemma":[0.019380644,0.0027118954,0.010613311,0.0010396603,0.00057295413,1.7970899e-7,0.0019214371,0.007060673,0.95669925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822044,0.00025692515,0.00028279287,0.00052342506,0.00043111615,0.00028529807],"domain_scores_gemma":[0.99844843,0.000011612872,0.00021001838,0.0011339391,0.0001383043,0.000057698173],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047616742,0.00018137906,0.0002180202,0.000441742,0.0003424348,0.00054391014,0.004112883,0.00009009196,0.006907625],"category_scores_gemma":[0.00020444099,0.0001561862,0.00006975758,0.0010635925,0.000086671396,0.00021175502,0.0056340373,0.00027045875,0.0019383978],"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.0000039102492,0.000048104914,0.0000014281595,0.00014291483,0.000019147434,0.0000075418498,0.00009754301,0.000003891563,0.000015126751,0.0056909476,0.63114214,0.36282733],"study_design_scores_gemma":[0.0003095127,0.00003906068,0.000217123,0.00046557383,0.000008192264,0.000004901213,0.000014938066,0.0007305912,0.00002123938,0.000081334,0.9979623,0.0001452138],"about_ca_topic_score_codex":0.00006168381,"about_ca_topic_score_gemma":0.000001975643,"teacher_disagreement_score":0.3668202,"about_ca_system_score_codex":0.000079972,"about_ca_system_score_gemma":0.0000078805215,"threshold_uncertainty_score":0.9988387},"labels":[],"label_agreement":null},{"id":"W6990512358","doi":"","title":"Disk-based Indexing for NIR-Trees using Polygon Overlays","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Data Management and Algorithms","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":"Search engine indexing; Polygon (computer graphics); Set (abstract data type); Bounding overwatch; Point (geometry); Extension (predicate logic); Construct (python library); Spurious relationship; Range (aeronautics); Data structure","score_opus":0.017077268630315043,"score_gpt":0.22746914627542125,"score_spread":0.2103918776451062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990512358","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.89210385,0.00043891193,0.09989724,0.0014663229,0.0031521777,0.0010617395,0.0002985372,0.0005117998,0.0010694079],"genre_scores_gemma":[0.058209613,0.00006759386,0.17501283,0.00008875512,0.0002624426,0.0000024542335,0.0029363984,0.0001034509,0.76331645],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.000024044433,0.00012071808,0.00057469704,0.0003143537,0.00031108773],"domain_scores_gemma":[0.9991013,0.00003998585,0.00020233772,0.0004951484,0.00009055437,0.000070703216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015916524,0.00024974137,0.00031266705,0.0004939867,0.00022377988,0.00018785174,0.0011642412,0.00016633348,0.000023925955],"category_scores_gemma":[0.000007319927,0.0002887994,0.00022973899,0.00036009168,0.00003787074,0.00079202047,0.00022918952,0.0001641156,0.000026199281],"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.0012958162,0.0013250484,0.0017338613,0.017664818,0.003295824,0.0011506754,0.42367977,0.0075787357,0.040907126,0.11177117,0.07202034,0.31757683],"study_design_scores_gemma":[0.0021805633,0.0004188316,0.0019643863,0.0019759585,0.0008545386,0.0000023755683,0.06592628,0.9023656,0.0057443357,0.0035593032,0.01317276,0.001835061],"about_ca_topic_score_codex":0.008751633,"about_ca_topic_score_gemma":0.010466201,"teacher_disagreement_score":0.8947869,"about_ca_system_score_codex":0.00008553284,"about_ca_system_score_gemma":0.000102298676,"threshold_uncertainty_score":0.9999564},"labels":[],"label_agreement":null},{"id":"W6990527104","doi":"","title":"Distributed Spatial Data Sharing: a new era in sharing spatial data","year":2023,"lang":"en","type":"article","venue":"Scholars Commons (Wilfrid Laurier University)","topic":"Data Management and Algorithms","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":"Spatial analysis; Variety (cybernetics); Data sharing; Tree (set theory); Process (computing); Geographic information system; Set (abstract data type); Distributed database; Information sharing","score_opus":0.07518964620542996,"score_gpt":0.2697038739696385,"score_spread":0.19451422776420857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990527104","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.046946976,0.00011147487,0.92130834,0.011290231,0.002215272,0.0010697397,0.005399616,0.0021489915,0.009509336],"genre_scores_gemma":[0.8376235,0.00045373949,0.058603417,0.00089478283,0.0013309539,0.00000600686,0.075844385,0.00021078308,0.02503247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99644816,0.0001043854,0.00032187309,0.0018543251,0.00053373177,0.0007375357],"domain_scores_gemma":[0.99216115,0.00008799506,0.00013756163,0.0072519663,0.000046984565,0.00031434605],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0010355097,0.00030338072,0.000323874,0.000999982,0.0004069456,0.0011077035,0.020626683,0.000109791705,0.00007174639],"category_scores_gemma":[0.00019202776,0.00036592068,0.000054150572,0.0036439223,0.00007601794,0.008072229,0.04065114,0.00075456355,0.00027487494],"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.0002321938,0.0007982076,0.27557638,0.00013282534,0.0006093555,0.008665316,0.00089945435,0.0010753443,0.0001702015,0.115614936,0.29435673,0.30186906],"study_design_scores_gemma":[0.0019603823,0.000043027514,0.04062556,0.00009569351,0.000058014477,0.0000057630127,0.00012176937,0.40851822,0.000032176842,0.0015182234,0.5463713,0.00064987276],"about_ca_topic_score_codex":0.004502902,"about_ca_topic_score_gemma":0.009179735,"teacher_disagreement_score":0.86270493,"about_ca_system_score_codex":0.0001326453,"about_ca_system_score_gemma":0.00021757961,"threshold_uncertainty_score":0.99992925},"labels":[],"label_agreement":null},{"id":"W6996646632","doi":"","title":"Succinct and Compact Data Structures for Intersection Graphs","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Data Management and Algorithms","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":"University of Waterloo","keywords":"Chordal graph; Tree traversal; Interval graph; Intersection (aeronautics); Data structure; Interval (graph theory); Indifference graph; Graph; Space (punctuation); Intersection graph","score_opus":0.02664222795657068,"score_gpt":0.24213324484190177,"score_spread":0.2154910168853311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996646632","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.9878727,0.00010112007,0.0067549,0.001086261,0.002270195,0.0007322156,0.000574144,0.00033770286,0.00027073483],"genre_scores_gemma":[0.14619713,0.00068405556,0.04216143,0.000054912914,0.00019206187,0.0000011007899,0.02891886,0.0000922509,0.7816982],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9990227,0.000023125831,0.000081781596,0.0005210322,0.00017210298,0.00017926219],"domain_scores_gemma":[0.9989662,0.00004022776,0.0001644996,0.0007126387,0.00006380516,0.00005259277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015932608,0.00016234152,0.00023957061,0.0003630739,0.00018099972,0.00010874194,0.001503952,0.00009821335,0.00001110247],"category_scores_gemma":[0.000010116431,0.00017866609,0.000063311716,0.00022986115,0.000037769816,0.000941867,0.00040022374,0.000104710765,0.000008259557],"study_design_candidate":"qualitative","study_design_consensus":null,"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.00070454285,0.00021164116,0.00221103,0.004240523,0.0020153872,0.00016388897,0.20970733,0.00007760928,0.0017551982,0.059675988,0.3745653,0.34467155],"study_design_scores_gemma":[0.0070655723,0.0015178644,0.26604477,0.0011276728,0.0014382099,0.000016198577,0.47307703,0.16516921,0.0015416916,0.052250635,0.02727326,0.0034778921],"about_ca_topic_score_codex":0.0149478195,"about_ca_topic_score_gemma":0.034276675,"teacher_disagreement_score":0.8416756,"about_ca_system_score_codex":0.000018273524,"about_ca_system_score_gemma":0.000023062386,"threshold_uncertainty_score":0.9916117},"labels":[],"label_agreement":null},{"id":"W7015107224","doi":"","title":"Solving Canadian Traveller Problem","year":2019,"lang":"sk","type":"dissertation","venue":"Brno University of Technology Digital Library (Brno University of Technology)","topic":"Data Management and Algorithms","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":"Context (archaeology); Government (linguistics); Field (mathematics)","score_opus":0.004536303439662006,"score_gpt":0.1519327285313811,"score_spread":0.1473964250917191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015107224","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.5246673,0.0029185365,0.018729044,0.034896698,0.0023632261,0.00619295,0.0127142435,0.0071843658,0.39033365],"genre_scores_gemma":[0.74893636,0.002194008,0.070391536,0.00008177806,0.000039519222,4.4877444e-7,0.004319634,0.00016152798,0.17387517],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957489,0.000041674357,0.00056985416,0.0018319971,0.00054222054,0.0012653783],"domain_scores_gemma":[0.9957521,0.00006130315,0.001291924,0.0022400776,0.0003336663,0.00032095012],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00012858072,0.0008810133,0.0014391203,0.008168428,0.00072509184,0.0001679727,0.00984612,0.0028214343,0.00054148573],"category_scores_gemma":[0.0000418924,0.0012744806,0.00056947663,0.0047952645,0.002101695,0.0056151953,0.003646333,0.0014361638,0.00062014174],"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.0006129319,0.0016031434,0.05322401,0.0021981245,0.0033061046,0.0035548215,0.0022076583,0.000100541176,0.0008164205,0.28246206,0.061490078,0.5884241],"study_design_scores_gemma":[0.0056529106,0.0021145237,0.0066814306,0.003241428,0.0009654169,0.00010706232,0.06395978,0.0049313325,0.002974346,0.015120121,0.89005023,0.0042014085],"about_ca_topic_score_codex":0.0047983117,"about_ca_topic_score_gemma":0.0029831815,"teacher_disagreement_score":0.8285602,"about_ca_system_score_codex":0.00025161591,"about_ca_system_score_gemma":0.0015112032,"threshold_uncertainty_score":0.9989705},"labels":[],"label_agreement":null},{"id":"W70182391","doi":"10.1007/978-3-642-31603-6_10","title":"Fuzzy Logic Ranking for Personalized Geographic Information Retrieval","year":2012,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Data Management and Algorithms","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":"Memorial University of Newfoundland","funders":"","keywords":"Information retrieval; Ranking (information retrieval); Computer science; Fuzzy logic; Artificial intelligence","score_opus":0.02428969269139836,"score_gpt":0.2655734433281391,"score_spread":0.24128375063674073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70182391","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.000019403615,0.047349848,0.89886916,0.000038625814,0.0024534008,0.0009555382,0.000017690758,0.00012605666,0.050170276],"genre_scores_gemma":[0.36097497,0.17079335,0.2771934,0.0033263913,0.012225287,0.0003815922,0.0028045413,0.0005617412,0.17173871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805576,0.000025901654,0.0007497325,0.00040932788,0.00035221817,0.00040704678],"domain_scores_gemma":[0.9986851,0.00020761663,0.00057229574,0.0003520288,0.00011069581,0.00007225387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009796198,0.0003394286,0.0004709341,0.00043297725,0.00018894604,0.00042631658,0.0006402264,0.00015331992,0.0000040211075],"category_scores_gemma":[0.000027499149,0.00031596638,0.00012634901,0.00011047263,0.00006964556,0.0018718863,0.00040703092,0.0002393911,0.00002034481],"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.0000100803945,0.0000056765402,0.000084297586,0.0004033742,0.00002604978,0.000001971801,0.00026236792,0.00030266785,2.5641282e-7,0.7869873,0.000029920953,0.21188605],"study_design_scores_gemma":[0.00048061798,0.00010246053,0.000023669809,0.001346701,0.000035149853,0.000023108656,0.00016354816,0.06651495,0.0000036344802,0.052950155,0.87769103,0.00066495436],"about_ca_topic_score_codex":0.0000127768335,"about_ca_topic_score_gemma":0.000002102432,"teacher_disagreement_score":0.8776611,"about_ca_system_score_codex":0.000060719016,"about_ca_system_score_gemma":0.000016178876,"threshold_uncertainty_score":0.99992925},"labels":[],"label_agreement":null},{"id":"W7022295737","doi":"","title":"Editorial","year":2025,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Data Management and Algorithms","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":"The Journal of Student Science and Technology","funders":"","keywords":"Commit; Pleasure; Directory; Mistake; Publishing; Ridiculous","score_opus":0.16447767475935532,"score_gpt":0.5401351807391032,"score_spread":0.37565750597974784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022295737","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015818495,0.015702277,0.37989762,0.00338705,0.4149681,0.0017256329,0.00009104232,0.0005260433,0.16788372],"genre_scores_gemma":[0.6425899,0.04573624,0.06273973,0.010830293,0.18412943,0.0004942288,0.00018557635,0.00029638043,0.052998185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975634,0.00014237482,0.0006023812,0.00052505126,0.0007939192,0.00037282496],"domain_scores_gemma":[0.99804515,0.0002074401,0.00039401496,0.00095808035,0.0002482845,0.00014705874],"candidate_categories":["scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013720994,0.0002366528,0.00046550998,0.00087121566,0.00025886638,0.0046303966,0.010388054,0.00008187628,0.0013046045],"category_scores_gemma":[0.00021177439,0.00021537936,0.00014308978,0.0018318616,0.00007342159,0.0068691657,0.00513834,0.00031608657,0.00005084511],"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.000020228137,0.00011790778,0.011669084,0.000030981235,0.000100815305,0.000013387942,0.00002793187,0.000022815717,0.0019006905,0.0061039976,0.9123982,0.067593925],"study_design_scores_gemma":[0.0006642256,0.0000074165782,0.057562597,0.00023708459,0.00004384239,0.0000013995792,0.000015232856,0.0011323857,0.0043543642,0.044531256,0.891061,0.0003892153],"about_ca_topic_score_codex":0.00028286123,"about_ca_topic_score_gemma":0.000010628033,"teacher_disagreement_score":0.62677145,"about_ca_system_score_codex":0.000060204573,"about_ca_system_score_gemma":0.00015172595,"threshold_uncertainty_score":0.99960834},"labels":[],"label_agreement":null},{"id":"W7026718464","doi":"","title":"ARCHIVEIT-3490-PATCH-ERMBEN-20130129204122-00000-wbgrp-crawl065.us.archive.org-6681.warc.gz","year":2013,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Data Management and Algorithms","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":"Process (computing); Identification (biology); Product (mathematics)","score_opus":0.005793147156845324,"score_gpt":0.17965805814514155,"score_spread":0.17386491098829623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026718464","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.000017860602,0.00020536574,0.00054362003,0.0003850908,0.0009630047,0.0010402208,0.0003704374,0.0007301676,0.9957442],"genre_scores_gemma":[0.00007822493,0.0006181787,0.02164504,0.0008248612,0.00045083527,0.00006652847,0.0007641614,0.00018120724,0.97537094],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99602675,0.00018164044,0.0011199656,0.000726968,0.001061082,0.00088360184],"domain_scores_gemma":[0.9965681,0.0001767379,0.0010620714,0.0017064933,0.00013912506,0.0003475165],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038800665,0.0008192862,0.00080469047,0.000361309,0.00017925657,0.00045587905,0.0030417442,0.00039063318,0.23760432],"category_scores_gemma":[0.00007575004,0.0007856155,0.00034377718,0.00003856889,0.00029821746,0.0000044535295,0.0013635723,0.00059640844,0.08791629],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000017523922,0.000102776685,0.000013066094,0.00051259884,0.00013491577,0.000045113957,0.00018843162,0.000036959536,8.7011273e-7,0.0009896989,0.9846789,0.01327914],"study_design_scores_gemma":[0.0007415065,0.00019206063,0.000083411425,0.0003313563,0.00005640012,0.000047287587,0.00004552878,0.00094771,0.000009429064,0.00014310566,0.9965385,0.0008636731],"about_ca_topic_score_codex":0.007476644,"about_ca_topic_score_gemma":0.00083380117,"teacher_disagreement_score":0.14968802,"about_ca_system_score_codex":0.00005942377,"about_ca_system_score_gemma":0.000072438415,"threshold_uncertainty_score":0.9994595},"labels":[],"label_agreement":null},{"id":"W7028363456","doi":"","title":"Enchansing the Ionic Purity of Hydrophilic Channels by Blending Fully Sulfonated Graft Copolymers with PVDF Homopolymer.","year":2013,"lang":"en","type":"article","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Data Management and Algorithms","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":"Copolymer; Ionic bonding; Polymer; Ionic liquid; Polymerization","score_opus":0.006322794460151059,"score_gpt":0.17143946225631151,"score_spread":0.16511666779616047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028363456","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.5505306,0.0015652266,0.40196124,0.010909602,0.0005087788,0.0038882615,0.0003398919,0.0010514718,0.029244892],"genre_scores_gemma":[0.9852554,0.00054050895,0.011079548,0.00007788184,0.000023572653,7.450585e-7,0.000039545306,0.000030890264,0.0029518947],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99569273,0.00032464752,0.0006037548,0.0011557232,0.0013000871,0.0009230504],"domain_scores_gemma":[0.99587995,0.0005177599,0.0008962896,0.0018482567,0.00046831436,0.00038941496],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00081733917,0.0005707216,0.0010461283,0.0006033485,0.00066711975,0.00009315886,0.0055502113,0.0004777026,0.000849291],"category_scores_gemma":[0.00008782393,0.0005598192,0.00048946653,0.0025215228,0.0024739997,0.0018352647,0.002956575,0.00089901465,0.00012417459],"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.0039701266,0.011830995,0.0068172775,0.002352547,0.0048894584,0.002632421,0.0034978674,0.0012666385,0.43235907,0.1590659,0.26151824,0.109799445],"study_design_scores_gemma":[0.0832825,0.030569235,0.08724366,0.0126153305,0.011139414,0.002625556,0.037379704,0.18883272,0.27538055,0.04365483,0.19710486,0.030171629],"about_ca_topic_score_codex":0.0019309926,"about_ca_topic_score_gemma":0.00020193026,"teacher_disagreement_score":0.43472478,"about_ca_system_score_codex":0.00028067108,"about_ca_system_score_gemma":0.00023381223,"threshold_uncertainty_score":0.99983025},"labels":[],"label_agreement":null},{"id":"W7036937941","doi":"","title":"Chas. Nelson Making Canoe Mile Record on Moosehead Lake, Maine","year":2013,"lang":"en","type":"article","venue":"DigitalCommons (California Polytechnic State University)","topic":"Data Management and Algorithms","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":"Mile; Historical record; Quarter (Canadian coin); Plank","score_opus":0.018556149998232144,"score_gpt":0.2114615323804029,"score_spread":0.19290538238217075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036937941","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.030209063,0.00005499164,0.43163288,0.0056045507,0.0007730982,0.0016072989,0.0015491835,0.002808422,0.52576053],"genre_scores_gemma":[0.95699215,0.00011863043,0.017334819,0.001302514,0.00011193169,0.000018128398,0.00033254712,0.0000737694,0.023715528],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792224,0.000049585244,0.0002740245,0.00067259977,0.00035226694,0.0007293079],"domain_scores_gemma":[0.9982909,0.00009601355,0.00016827168,0.0011575521,0.000072802985,0.00021447877],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012380257,0.00034102576,0.00028987144,0.00084300543,0.0002556826,0.0004976665,0.0020305912,0.00008141788,0.00015877376],"category_scores_gemma":[0.000024014767,0.0003523424,0.00015309703,0.0014261459,0.00010761007,0.0017856361,0.001155499,0.00026178162,0.0015152459],"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.000043659787,0.0004446648,0.00206727,0.000043564232,0.00013882278,0.0004813195,0.0000948782,0.0001407759,0.00011445046,0.10604687,0.07497009,0.81541365],"study_design_scores_gemma":[0.00072986947,0.00022292857,0.0015385032,0.00009663766,0.000017451699,0.000010017732,0.00008181418,0.01127194,0.00021631227,0.0032973299,0.9818434,0.00067378563],"about_ca_topic_score_codex":0.00020761885,"about_ca_topic_score_gemma":0.0003705699,"teacher_disagreement_score":0.9267831,"about_ca_system_score_codex":0.00018194439,"about_ca_system_score_gemma":0.0000565766,"threshold_uncertainty_score":0.99989283},"labels":[],"label_agreement":null},{"id":"W7039283916","doi":"","title":"Letter from Charles Maltby to Lewis V. Bogy, 1866","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Whiting; Quarter (Canadian coin); Mercantilism; Period (music)","score_opus":0.02558401916080072,"score_gpt":0.2239214044289957,"score_spread":0.19833738526819497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039283916","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.019135563,0.0000526992,0.93018,0.022791356,0.0006636205,0.00014815752,0.000014939657,0.00033556504,0.026678113],"genre_scores_gemma":[0.13257523,0.0000814225,0.69560874,0.105089016,0.0014507491,0.00003964197,0.000071329996,0.000026775619,0.065057084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991078,0.000013879795,0.000111661284,0.0003470286,0.00019444409,0.00022519754],"domain_scores_gemma":[0.9992743,0.000023288061,0.000019355479,0.00058324786,0.000016031725,0.00008378528],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006318033,0.00009554479,0.00009520681,0.000072841955,0.000092908456,0.0001356579,0.0010104919,0.000019920975,0.0002722284],"category_scores_gemma":[0.0000068989734,0.00008028682,0.000032637956,0.00020222765,0.000020933981,0.0007138797,0.0006122306,0.000048744732,0.0026877078],"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.0000011052732,0.00003123125,0.0008930483,0.0000013311268,0.0000133049925,0.00008066544,0.00022354863,0.0000029199587,0.00017400504,0.010562127,0.93228734,0.055729374],"study_design_scores_gemma":[0.00018361314,0.000032617685,0.01286824,0.00000455987,0.0000025763231,0.0000038230387,0.000007535779,0.003995292,0.001479181,0.00088588055,0.980316,0.00022070332],"about_ca_topic_score_codex":0.00032710668,"about_ca_topic_score_gemma":0.000021608581,"teacher_disagreement_score":0.23457123,"about_ca_system_score_codex":0.0000097122775,"about_ca_system_score_gemma":0.0000076404485,"threshold_uncertainty_score":0.99808884},"labels":[],"label_agreement":null},{"id":"W7042704397","doi":"","title":"IN QUEBEC &amp;amp;\\\\-⓶௵(+27`72`994`9256)&amp;amp;\\\\-⓶௵BLACK MAGIC *MARRIAGE SPELL* QUEBEC, QUEBEC","year":2021,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Data Management and Algorithms","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":"Thriving; Happiness; Spell; MAGIC (telescope); Happening; Appeasement","score_opus":0.023296864008367328,"score_gpt":0.26901574355412117,"score_spread":0.24571887954575383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042704397","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.00032397668,0.00007987201,0.117245845,0.001660506,0.0034002003,0.002371107,0.00013090711,0.0008093788,0.8739782],"genre_scores_gemma":[0.00004162453,0.00084961974,0.041271497,0.0009262372,0.0009189157,0.00011245354,0.0012293598,0.0006334144,0.95401686],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98358625,0.0018409792,0.0020705871,0.008224182,0.0019582128,0.00231979],"domain_scores_gemma":[0.9783778,0.0005889972,0.0013708781,0.018619966,0.0002449373,0.00079741905],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science","insufficient_payload"],"category_scores_codex":[0.005460853,0.0019909441,0.0021654656,0.0017061918,0.00018273653,0.0026109393,0.0104714,0.0013014944,0.7503607],"category_scores_gemma":[0.0016550244,0.0022784316,0.0008901201,0.00195917,0.00069068273,0.0019018418,0.014133325,0.002170397,0.92750746],"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.000040129307,0.0008278961,0.00080174126,0.0007021856,0.0004635339,0.00028720938,0.0014707387,0.00020910737,0.00042654603,0.008754271,0.9610875,0.024929134],"study_design_scores_gemma":[0.0012883937,9.175237e-7,0.000760146,0.0009523086,0.00011881382,0.000033559918,0.00006946595,0.00027080844,0.00014603567,0.00269579,0.99142563,0.0022381425],"about_ca_topic_score_codex":0.35361096,"about_ca_topic_score_gemma":0.87248814,"teacher_disagreement_score":0.51887715,"about_ca_system_score_codex":0.0014359839,"about_ca_system_score_gemma":0.0011792474,"threshold_uncertainty_score":0.99999505},"labels":[],"label_agreement":null},{"id":"W7043032612","doi":"","title":"Similarity search and applications 5th international conference, SISAP 2012, Toronto, ON, Canada, August 9 - 10, 2012 ; proceedings","year":2012,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Similarity (geometry); Similitude; Feature (linguistics); Nearest neighbor search; Search engine indexing","score_opus":0.033676597567305545,"score_gpt":0.28072333174730646,"score_spread":0.24704673418000092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043032612","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.0009884374,0.00021236413,0.1432574,0.004276431,0.0005285838,0.00050691335,0.00006532265,0.0001690399,0.8499955],"genre_scores_gemma":[0.63871163,0.00024405874,0.049971096,0.0032979366,0.0014543684,0.00023715205,0.00018938811,0.000029027653,0.30586532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998861,0.000008192369,0.00013519965,0.00028293207,0.0003933478,0.0003193084],"domain_scores_gemma":[0.9993825,0.00002334827,0.000033496217,0.00023080234,0.00013500403,0.00019484664],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002637024,0.000116864874,0.00009084033,0.000041409177,0.00012956304,0.00030829964,0.0008244012,0.000032332733,0.0022034338],"category_scores_gemma":[0.0000068030545,0.00010267919,0.000015211192,0.00010452571,0.000037735208,0.003095845,0.0005234012,0.00008575475,0.00006270676],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.0000019483282,0.00008258741,0.0014088341,0.000008836329,0.000020845388,3.325989e-7,0.000050081624,4.8946094e-7,0.00000935174,0.595024,0.37422827,0.029164413],"study_design_scores_gemma":[0.00021582935,0.000024431996,0.018695466,0.0000063691646,0.0000071185545,0.000002790943,0.00017788717,0.012534935,0.00010072461,0.00036294182,0.967644,0.00022752713],"about_ca_topic_score_codex":0.05944542,"about_ca_topic_score_gemma":0.0717216,"teacher_disagreement_score":0.6377232,"about_ca_system_score_codex":0.00010790937,"about_ca_system_score_gemma":0.00008684681,"threshold_uncertainty_score":0.99870867},"labels":[],"label_agreement":null},{"id":"W7097865146","doi":"","title":"Abstract","year":2008,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Online analytical processing; Data cube; Cube (algebra); Visualization; Row; Search engine indexing; Terabyte; Data visualization","score_opus":0.0302815369291705,"score_gpt":0.2266563152090262,"score_spread":0.19637477827985572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097865146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043548425,0.000012281613,0.5950431,0.00072148535,0.00017289325,0.000027671093,2.569923e-7,0.00023088144,0.39943656],"genre_scores_gemma":[0.8311554,0.000027503609,0.15011743,0.00086442794,0.000063332205,0.0000019753488,0.0000023611235,0.0000023332002,0.01776519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972486,0.0000013405362,0.0000373995,0.00009013378,0.00007523449,0.00007100791],"domain_scores_gemma":[0.99974614,0.000005523679,0.0000073671754,0.00021527888,0.000005661775,0.000020032989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003369448,0.000024952946,0.000022554506,0.000021074626,0.000041421677,0.00003203305,0.00040209736,0.000005275068,0.00009721852],"category_scores_gemma":[0.0000020145771,0.000019661327,0.000011372845,0.00008052739,0.000008313449,0.0005020687,0.00011777485,0.000016981856,0.00075040566],"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":[4.0171605e-7,0.0000678431,0.0011218538,0.0000037455068,0.000009427567,0.00018689105,0.00012154716,0.0000060008524,0.000123776,0.44801155,0.2936546,0.25669238],"study_design_scores_gemma":[0.00041483002,0.00003673151,0.25571316,0.0000039867396,0.0000013445881,0.000037149504,0.000013499088,0.02759994,0.002032069,0.006549467,0.7072402,0.00035761375],"about_ca_topic_score_codex":0.000009635004,"about_ca_topic_score_gemma":5.631854e-7,"teacher_disagreement_score":0.8268006,"about_ca_system_score_codex":0.0000020132716,"about_ca_system_score_gemma":0.0000043057858,"threshold_uncertainty_score":0.9645197},"labels":[],"label_agreement":null},{"id":"W7099915757","doi":"","title":"Diverse methodological approaches and considerations for SOTL in higher education. The Canadian Journal for the Scholarship of Teaching and","year":2010,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Scholarship of Teaching and Learning; Scholarship; Higher education; Educational research; Openness to experience; Transformational leadership","score_opus":0.42885223037755493,"score_gpt":0.37356781407432754,"score_spread":0.05528441630322739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099915757","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.06879984,0.0004976257,0.7271137,0.19351761,0.0027120837,0.0019922422,0.000026123322,0.000027479406,0.0053132605],"genre_scores_gemma":[0.6056432,0.0000018151246,0.39308885,0.00056649145,0.00006467228,0.0000245572,7.7640084e-7,0.0000013157567,0.0006082926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996103,0.000083301406,0.000080905214,0.000094393574,0.00004134035,0.0000897678],"domain_scores_gemma":[0.9984436,0.0013230689,0.000033220673,0.00012818378,0.000028288703,0.000043605713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023131547,0.000037605,0.00004896538,0.00004567473,0.00076047285,0.00053660985,0.00022669099,0.000022617745,0.000013021092],"category_scores_gemma":[0.00058043364,0.00001872571,0.000014037014,0.000033654025,0.00008915752,0.00037627565,0.00006179625,0.00019070286,1.1004217e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.5032103e-7,0.000007831843,0.0016160987,0.0000030408341,0.000006619725,9.5396615e-8,0.00032117512,0.0000029448481,0.000015737578,0.9468648,0.0017944236,0.049366675],"study_design_scores_gemma":[0.0007148303,0.0000708326,0.19276056,0.000011091294,0.000046525485,0.000035623238,0.0023333393,0.031241061,0.000101193145,0.71075183,0.061737895,0.00019518477],"about_ca_topic_score_codex":0.0012359093,"about_ca_topic_score_gemma":0.023030069,"teacher_disagreement_score":0.5368434,"about_ca_system_score_codex":0.0000044902786,"about_ca_system_score_gemma":0.000112142174,"threshold_uncertainty_score":0.9947971},"labels":[],"label_agreement":null},{"id":"W7100737388","doi":"","title":"BAKILLAH MOHAMED REAL TIME SEMANTIC INTEROPERABILITY IN AD HOC NETWORKS OF GEOSPATIAL DATABASES: DISASTER MANAGEMENT CONTEXT","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Interoperability; Context (archaeology); Geospatial analysis; Semantics (computer science); Emergency management; Semantic interoperability","score_opus":0.009913733190089067,"score_gpt":0.22818062014972287,"score_spread":0.2182668869596338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100737388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09996691,0.000043284123,0.88608253,0.00032301925,0.00039860766,0.00052083196,0.000010538455,0.00013017091,0.012524104],"genre_scores_gemma":[0.9712044,0.000125256,0.025863273,0.00035781373,0.00005209948,0.000021782489,0.00008223998,0.000012292165,0.0022808446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982002,0.00015181999,0.00045546933,0.00057594746,0.00027446166,0.00034210473],"domain_scores_gemma":[0.9984669,0.00008647107,0.00010112336,0.0012390495,0.000034908946,0.00007156109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007363374,0.00018643796,0.00030266505,0.0001269362,0.000034761902,0.00011005822,0.0011568764,0.000028922592,0.00016825306],"category_scores_gemma":[0.000018176559,0.00015135355,0.000059413356,0.00030423683,0.00007896703,0.00080367515,0.0016349456,0.00009502897,0.000120782126],"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.00005576666,0.00042495204,0.0030849779,0.0001405301,0.000080608675,0.00002328895,0.0006301193,0.0003157867,0.000060860966,0.027465582,0.004631058,0.9630865],"study_design_scores_gemma":[0.0013429354,0.00016831164,0.0276162,0.000121585945,0.000019153165,0.000001115893,0.0001900766,0.96131325,0.00005271583,0.0003087446,0.008530799,0.0003350882],"about_ca_topic_score_codex":0.00024018783,"about_ca_topic_score_gemma":0.0004699865,"teacher_disagreement_score":0.9627514,"about_ca_system_score_codex":0.000031394495,"about_ca_system_score_gemma":0.0000061471114,"threshold_uncertainty_score":0.61720186},"labels":[],"label_agreement":null},{"id":"W7116947360","doi":"10.1016/j.eswa.2025.130889","title":"Skyline operators in multi-criteria decision making: A review of characterization, comparison, and perspectives","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Data Management and Algorithms","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 British Columbia; Saint Mary's University","funders":"","keywords":"Skyline; Robustness (evolution); Preference; Operator (biology); Decision support system","score_opus":0.027474986559130412,"score_gpt":0.34044039518064284,"score_spread":0.31296540862151245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116947360","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.00043155174,0.018040003,0.9794349,0.00073743076,0.000058829595,0.0010251658,0.000011191534,0.00004667769,0.0002142378],"genre_scores_gemma":[0.7974779,0.008029707,0.1909944,0.0006848669,0.00006107699,0.0022360194,0.000094997464,0.000016912667,0.0004041097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899936,0.000045355155,0.00038687463,0.00034200796,0.0001249174,0.0001015152],"domain_scores_gemma":[0.9991406,0.000043115007,0.00012350791,0.0005232014,0.00014331304,0.000026221533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022812223,0.00010411538,0.00025414032,0.00017224399,0.00007195345,0.00010449773,0.00043112735,0.000023017607,0.0000033860042],"category_scores_gemma":[0.000022357715,0.00008357525,0.00001433961,0.00084664696,0.00003907653,0.00032677993,0.000165401,0.000044544046,0.0000033342621],"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.00005275014,0.0025904812,0.031114401,0.0091702435,0.00023893932,0.000009339634,0.012832916,0.00007039297,0.005597986,0.6373166,0.015754482,0.2852515],"study_design_scores_gemma":[0.0029198208,0.00015002105,0.07885452,0.03649957,0.000046585315,0.000019157915,0.0038978744,0.41405615,0.00037314292,0.00021477575,0.46193963,0.0010287286],"about_ca_topic_score_codex":0.000023558503,"about_ca_topic_score_gemma":0.0000066201983,"teacher_disagreement_score":0.79704636,"about_ca_system_score_codex":0.000027516602,"about_ca_system_score_gemma":0.000033250104,"threshold_uncertainty_score":0.34081},"labels":[],"label_agreement":null},{"id":"W7118015757","doi":"10.1145/3712285.3787168","title":"10.1145/3712285.3787168","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Session (web analytics); k-nearest neighbors algorithm; Nearest neighbor search; Key (lock)","score_opus":0.005783491473290162,"score_gpt":0.1698792218710571,"score_spread":0.16409573039776695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118015757","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.000042168493,0.000019913045,0.0009465207,0.00080917106,0.0000071418385,0.00011583908,0.0000053451295,0.00027445963,0.9977794],"genre_scores_gemma":[0.000028436954,3.1417377e-7,0.006337913,0.00021691978,0.000089040084,0.000009005102,0.000011523755,0.0000075277526,0.9932993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991138,0.000019707262,0.0001145249,0.00029860382,0.00019865052,0.0002547248],"domain_scores_gemma":[0.9992304,0.00001728299,0.000016738097,0.0006135309,0.000017708517,0.00010436683],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014063192,0.0001026586,0.0000962409,0.000074006755,0.00006990484,0.00022553571,0.0010964635,0.00002162696,0.9540979],"category_scores_gemma":[0.00000674088,0.000098058066,0.000035075638,0.00035274014,0.000013673052,0.00055598834,0.00025442967,0.000048939146,0.9875627],"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.0000022488096,0.000019539382,4.734494e-8,0.0000012372107,0.0000048452885,0.000007646254,0.0000067164997,0.000016283975,0.0000035167418,0.00006249392,0.27909008,0.7207854],"study_design_scores_gemma":[0.00012068055,0.000063171836,0.000032129876,0.0000053007084,0.0000035135408,0.0000021276255,1.6475701e-7,0.00940853,0.00002577695,0.000050451108,0.9901459,0.00014221916],"about_ca_topic_score_codex":0.000008712638,"about_ca_topic_score_gemma":5.5084612e-8,"teacher_disagreement_score":0.72064316,"about_ca_system_score_codex":0.000013162753,"about_ca_system_score_gemma":0.000010072659,"threshold_uncertainty_score":0.39986917},"labels":[],"label_agreement":null},{"id":"W7125181930","doi":"10.1109/sensors59705.2025.11331069","title":"Personalized POI Prediction from GPS Data Using Graph-Enhanced Transformers: Toward an Intelligent Navigation System","year":2025,"lang":"","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Global Positioning System; Navigation system; Assisted GPS; Navigational aid; Satellite navigation; Field (mathematics)","score_opus":0.07706063031217932,"score_gpt":0.3135691226733787,"score_spread":0.23650849236119942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125181930","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.014717879,0.00067138736,0.9742134,0.00033484556,0.0046979827,0.0011202082,0.0010137056,0.00045783294,0.0027727322],"genre_scores_gemma":[0.92565596,0.00035565358,0.067736864,0.00019084313,0.0003817317,0.0000239771,0.005018458,0.000027203785,0.00060930615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522996,0.00024925492,0.0010602056,0.0019921581,0.0008520116,0.0006163909],"domain_scores_gemma":[0.9971265,0.0000652119,0.0002574201,0.002153298,0.00018367937,0.0002138702],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010684038,0.0005021151,0.00051480025,0.000424989,0.0005008834,0.0017809358,0.003317977,0.00019505143,0.00015603921],"category_scores_gemma":[0.000016896905,0.00049998367,0.0001616702,0.0016836326,0.00016542723,0.008153897,0.0010219429,0.00030426515,0.000047033085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026021962,0.0007142655,0.00012485165,0.0012725313,0.0012545745,0.00004529998,0.008896449,0.000739994,0.0064740777,0.10030135,0.0012011781,0.8787152],"study_design_scores_gemma":[0.0010987695,0.00013532837,0.00012260798,0.0012646086,0.00042998765,0.000003528445,0.0072617577,0.9819854,0.004231797,0.0012245637,0.0017867277,0.00045493076],"about_ca_topic_score_codex":0.0020955568,"about_ca_topic_score_gemma":0.000049614275,"teacher_disagreement_score":0.9812454,"about_ca_system_score_codex":0.00030401218,"about_ca_system_score_gemma":0.00023361146,"threshold_uncertainty_score":0.9997452},"labels":[],"label_agreement":null},{"id":"W7125586383","doi":"10.1109/cascon66301.2025.00049","title":"Jackpine3D: A Benchmark for Evaluating 3D Spatial Database Features","year":2025,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","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":"National Research Council Canada; Queen's University; University of New Brunswick","funders":"","keywords":"Benchmark (surveying); Spatial database; Suite; Spatial analysis; Spatiotemporal database; Spatial query","score_opus":0.024203318033109655,"score_gpt":0.331581221013276,"score_spread":0.3073779029801663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125586383","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.00014303329,0.00007194652,0.96870655,0.0016731715,0.0006691753,0.00035083917,0.000022692062,0.00012955877,0.02823305],"genre_scores_gemma":[0.010273969,0.000009213174,0.96747106,0.0021733553,0.00015344509,0.00008951361,0.00022053221,0.000005644948,0.019603277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990523,0.000024017943,0.00014392578,0.00037515073,0.00018626732,0.00021834132],"domain_scores_gemma":[0.99915564,0.00011650181,0.000036848578,0.00060070184,0.000058214784,0.00003207917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004805755,0.000099877536,0.00009924964,0.00011489575,0.00014030302,0.00030084176,0.00090341346,0.000021661392,0.000059106416],"category_scores_gemma":[0.0001382582,0.00008356598,0.000041746032,0.0002839978,0.000014505253,0.0006150719,0.00071931933,0.000055455206,0.000017281529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076485685,0.000040817373,0.00006940912,0.000048776164,0.000029457846,0.0000024056303,0.000036661604,0.000021621598,0.00021988378,0.16946314,0.14858459,0.6814756],"study_design_scores_gemma":[0.0010630077,0.0001128861,0.0018930527,0.00005838425,0.000031409785,9.1876825e-7,0.000029943878,0.89354676,0.0012119883,0.006911973,0.09488587,0.00025382484],"about_ca_topic_score_codex":0.00012989962,"about_ca_topic_score_gemma":0.00006718565,"teacher_disagreement_score":0.8935251,"about_ca_system_score_codex":0.000014336744,"about_ca_system_score_gemma":0.000047573078,"threshold_uncertainty_score":0.34077218},"labels":[],"label_agreement":null},{"id":"W7140790900","doi":"10.1109/fpl68686.2025.00066","title":"Versatile Place and Route with Continuous Routing Runtime Prediction and Smart Route Termination","year":2025,"lang":"","type":"article","venue":"","topic":"Data Management and Algorithms","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":"Routing (electronic design automation); Process (computing); Key (lock); Sequence (biology)","score_opus":0.00466020797550005,"score_gpt":0.2026068102082478,"score_spread":0.19794660223274776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140790900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1259283,0.000439183,0.8104388,0.0035176345,0.0014084269,0.0014200489,0.00009510336,0.00040594407,0.056346554],"genre_scores_gemma":[0.9458862,0.00015442596,0.014240778,0.00036314005,0.00008325883,0.000019047091,0.000052977124,0.000013269068,0.03918692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978584,0.00008122582,0.0003966672,0.00091646495,0.00033012425,0.00041713862],"domain_scores_gemma":[0.99900794,0.000107930835,0.00018308297,0.0004897348,0.00010778255,0.00010354285],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006252611,0.0003158118,0.00031187347,0.00025991205,0.00046604534,0.0016641427,0.00038665868,0.000096590724,0.000024094941],"category_scores_gemma":[0.000037701462,0.0002846565,0.000028834644,0.00057989213,0.00016245389,0.0027126423,0.0009428472,0.00018536185,0.000010345979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010525136,0.00015868367,0.11322291,0.00023083673,0.00030481466,0.0000477174,0.0020674993,0.000053819844,0.000070864255,0.034125626,0.00487035,0.84474164],"study_design_scores_gemma":[0.002250456,0.00036103325,0.12176938,0.00036835877,0.0001977267,0.000016384569,0.0005628593,0.8622289,0.0001983767,0.00020850144,0.011475071,0.00036297605],"about_ca_topic_score_codex":0.00030924278,"about_ca_topic_score_gemma":0.0000882001,"teacher_disagreement_score":0.86217505,"about_ca_system_score_codex":0.000075209166,"about_ca_system_score_gemma":0.000084347186,"threshold_uncertainty_score":0.99996054},"labels":[],"label_agreement":null},{"id":"W75042331","doi":"10.1007/978-3-642-22922-0_39","title":"Efficient Spatio-temporal Sensor Data Loading for a Sensor Web Browser","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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 Calgary","funders":"","keywords":"Sensor web; Computer science; Mashup; Wireless sensor network; Cache; Web server; Web API; Computer network; Web service; Web navigation; Distributed computing; The Internet; World Wide Web; Key distribution in wireless sensor networks; Operating system","score_opus":0.049109525857391284,"score_gpt":0.26437931111356133,"score_spread":0.21526978525617005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75042331","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.00006631809,0.00017492572,0.9923286,0.0006337292,0.002944621,0.0010072337,0.00017170639,0.00026534803,0.0024075317],"genre_scores_gemma":[0.017132599,0.000023501012,0.97848886,0.0011996474,0.0009919477,0.000018978524,0.00022757036,0.00006900247,0.0018479154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99452233,0.000034914312,0.0006618154,0.0027811625,0.0010260403,0.00097374996],"domain_scores_gemma":[0.99472237,0.00039597653,0.0004233292,0.003986341,0.0002518788,0.00022011304],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015719306,0.000680203,0.00062051753,0.000939482,0.00036580456,0.0010175761,0.0084470045,0.00025444393,0.000043283664],"category_scores_gemma":[0.00013001199,0.0006188726,0.00014327826,0.00059394824,0.0005078947,0.0008566148,0.005714662,0.0005368284,0.0001189912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037916867,0.00015416619,0.0001295558,0.00024920137,0.00008064407,0.00026492274,0.0009016122,0.01734379,0.00012645556,0.03691492,0.0016004862,0.9421963],"study_design_scores_gemma":[0.00044146297,0.00013265366,0.000020348149,0.0002554236,0.00002297066,0.000029862107,2.7920913e-7,0.9514791,0.00023487039,0.014394987,0.032164827,0.00082322786],"about_ca_topic_score_codex":0.00003807442,"about_ca_topic_score_gemma":0.00009369731,"teacher_disagreement_score":0.9413731,"about_ca_system_score_codex":0.00017216333,"about_ca_system_score_gemma":0.00041344887,"threshold_uncertainty_score":0.9996263},"labels":[],"label_agreement":null},{"id":"W79208629","doi":"10.14778/2732269.2732275","title":"Computing k-regret minimizing sets","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Data Management and Algorithms","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":"University of Victoria","funders":"","keywords":"Regret; Dimension (graph theory); Relaxation (psychology); Set (abstract data type); Greedy algorithm; Linear programming relaxation; Dynamic programming; Linear programming; Duality (order theory); Mathematics; Combinatorics; Computer science; Mathematical optimization; Algorithm; Statistics","score_opus":0.011085699081155623,"score_gpt":0.21721503497013323,"score_spread":0.2061293358889776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79208629","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.45378727,0.00034630904,0.22654872,0.024933774,0.005233695,0.002512747,0.000014398966,0.0013056644,0.28531742],"genre_scores_gemma":[0.93735296,0.000006539087,0.061782744,0.00041853587,0.00008893707,0.0000061442947,7.6645745e-7,0.00000844547,0.00033490823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988177,0.0000073209817,0.00023412456,0.00029790046,0.00037572687,0.0002672703],"domain_scores_gemma":[0.999373,0.00003741206,0.00022471715,0.00023869042,0.000077916644,0.00004827343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567185,0.00012956068,0.00015346892,0.000069609654,0.00014169746,0.00018763503,0.0018037357,0.00002261317,0.0000039544416],"category_scores_gemma":[0.00006562323,0.000089213696,0.00007868458,0.00030710903,0.00004220296,0.00046237308,0.0014521478,0.00008981234,0.0000157704],"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.00000790178,0.00019155622,0.0066395523,0.00026583177,0.00010160838,7.8856993e-7,0.0019584685,0.00006957029,0.009921095,0.5897314,0.030256039,0.3608562],"study_design_scores_gemma":[0.002958069,0.0004134999,0.017951425,0.0008355926,0.000111503796,0.00003574712,0.0006513271,0.59521705,0.20629328,0.048918616,0.12536195,0.0012519498],"about_ca_topic_score_codex":0.0000129950595,"about_ca_topic_score_gemma":3.7176676e-7,"teacher_disagreement_score":0.59514743,"about_ca_system_score_codex":0.000025796258,"about_ca_system_score_gemma":0.000006999463,"threshold_uncertainty_score":0.36380288},"labels":[],"label_agreement":null},{"id":"W81184795","doi":"10.1007/978-3-642-22351-8_5","title":"Using Medians to Generate Consensus Rankings for Biological Data","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":30,"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 Montréal","funders":"","keywords":"Ranking (information retrieval); Computer science; Heuristic; Set (abstract data type); Permutation (music); Information retrieval; Data mining; Theoretical computer science; Artificial intelligence","score_opus":0.17465872594774828,"score_gpt":0.31319250443270624,"score_spread":0.13853377848495796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81184795","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.00004712866,0.00016255945,0.9945684,0.00086696044,0.0025712578,0.00074552884,0.000111459034,0.0001387365,0.00078795827],"genre_scores_gemma":[0.003005952,0.000026094789,0.9930778,0.002847979,0.00072978536,0.000008510233,0.00006484173,0.000026818929,0.00021221858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959773,0.000027135558,0.00046588847,0.0022328729,0.0005452958,0.0007515512],"domain_scores_gemma":[0.9964184,0.00034784141,0.00021416538,0.0026287762,0.0001836813,0.00020713275],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014405466,0.00047198212,0.00049877824,0.0006567871,0.00027434135,0.0006441051,0.008589904,0.00022498948,0.000016417882],"category_scores_gemma":[0.00016662682,0.00039548083,0.00007827892,0.00049435126,0.00050173147,0.00051764626,0.006089606,0.0003361505,0.000037432437],"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.000013219719,0.000029165485,0.000016988604,0.000030516409,0.00002691849,0.00011856681,0.00038667143,0.003143957,0.00032899674,0.037185695,0.00055090524,0.9581684],"study_design_scores_gemma":[0.00034426706,0.00020081534,0.000015639838,0.00017674026,0.000016909837,0.000042063468,1.2257962e-7,0.8564949,0.00063103065,0.11997195,0.021246292,0.0008592308],"about_ca_topic_score_codex":0.000034774926,"about_ca_topic_score_gemma":0.000044258806,"teacher_disagreement_score":0.9573092,"about_ca_system_score_codex":0.0001033056,"about_ca_system_score_gemma":0.00028243137,"threshold_uncertainty_score":0.99984974},"labels":[],"label_agreement":null},{"id":"W83853472","doi":"10.1007/978-3-642-29063-3_13","title":"Automated Traffic Route Identification Through the Shared Nearest Neighbour Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in geoinformation and cartography","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Identification (biology); Cluster analysis; Position (finance); Computer science; Data mining; Noise (video); k-nearest neighbors algorithm; Range (aeronautics); Key (lock); Algorithm; Artificial intelligence; Engineering","score_opus":0.011443266391156106,"score_gpt":0.22529386623457487,"score_spread":0.21385059984341875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83853472","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.00005141128,0.0037706513,0.9533754,0.001725179,0.001190658,0.0011213627,0.00021406512,0.0010416748,0.037509628],"genre_scores_gemma":[0.5412092,0.022285419,0.33911368,0.027960932,0.0051735924,0.001026377,0.03168994,0.00066259,0.030878268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828154,0.000029669916,0.0005614254,0.0003380425,0.00044386927,0.00034546223],"domain_scores_gemma":[0.9986426,0.00008742166,0.00037726015,0.00074102695,0.000086240005,0.00006542509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031482833,0.000367699,0.00026799442,0.000391121,0.00025701,0.0009333619,0.0007909957,0.0002590839,0.00005496058],"category_scores_gemma":[0.000016063308,0.00027916298,0.000157145,0.0003682342,0.00010506177,0.0023424635,0.00024346446,0.0004069613,0.0000898937],"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.000002998119,0.0000142812005,0.000018508938,0.000064316635,0.000059626538,0.0000028952954,0.003101016,0.0008045267,0.0000014690578,0.033330917,0.0015275406,0.9610719],"study_design_scores_gemma":[0.0006572276,0.000057342073,0.0021935296,0.00016337945,0.00009446034,0.000030284351,0.000038665486,0.5444038,0.000027003494,0.015724532,0.43575275,0.0008570247],"about_ca_topic_score_codex":0.000030351552,"about_ca_topic_score_gemma":0.00005190239,"teacher_disagreement_score":0.96021485,"about_ca_system_score_codex":0.00003155131,"about_ca_system_score_gemma":0.000027809723,"threshold_uncertainty_score":0.999966},"labels":[],"label_agreement":null},{"id":"W85822258","doi":"10.1007/978-3-319-06483-3_10","title":"Analyzing User Trajectories from Mobile Device Data with Hierarchical Dirichlet Processes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Computer science; Trajectory; Latent Dirichlet allocation; Hierarchical Dirichlet process; Variety (cybernetics); Cluster analysis; Hierarchical clustering; Domain (mathematical analysis); Artificial intelligence; Dirichlet distribution; Human–computer interaction; Data mining; Machine learning; Topic model","score_opus":0.022440963865522252,"score_gpt":0.25676246133965075,"score_spread":0.2343214974741285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85822258","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.00012382792,0.0006509366,0.9964409,0.0004001866,0.000754188,0.00040783605,0.00008444753,0.00024210753,0.0008955881],"genre_scores_gemma":[0.0355239,0.00013303451,0.9606897,0.0012682067,0.0013161878,0.000026400521,0.0003642271,0.00006663077,0.0006117125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487925,0.00004437408,0.00047894815,0.0026958406,0.0011919197,0.0007096795],"domain_scores_gemma":[0.9947195,0.00086694246,0.00030250323,0.0036744738,0.00024245736,0.00019412352],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007826943,0.0006389354,0.00064694515,0.0005955854,0.00031385585,0.0017364947,0.010572331,0.00019007717,0.000025206948],"category_scores_gemma":[0.00012703468,0.0004934179,0.000049413047,0.0011944243,0.0007414563,0.0020155853,0.005003014,0.0007681549,0.00004157918],"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.000014772507,0.00005475311,0.0006117915,0.00015885642,0.000072725576,0.0001589792,0.00060873065,0.0067628156,0.000019814,0.006859652,0.0002510852,0.984426],"study_design_scores_gemma":[0.0009925542,0.0006882654,0.00058253546,0.0017164066,0.00012645296,0.0000496381,0.0000012486386,0.7937054,0.0007793279,0.05681631,0.14146832,0.0030735186],"about_ca_topic_score_codex":0.000090566515,"about_ca_topic_score_gemma":0.0005232989,"teacher_disagreement_score":0.9813525,"about_ca_system_score_codex":0.000094749186,"about_ca_system_score_gemma":0.0005584239,"threshold_uncertainty_score":0.99975175},"labels":[],"label_agreement":null},{"id":"W954180850","doi":"10.1007/978-3-642-33398-9_2","title":"Basic Structure of High-Dimensional Spaces","year":2012,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Data Management and Algorithms","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":"Queen's University","funders":"","keywords":"Simple (philosophy); Space (punctuation); Point (geometry); Computer science; Data structure; High dimensional; Theoretical computer science; Mathematics; Epistemology; Artificial intelligence; Geometry; Philosophy; Programming language","score_opus":0.013379262102407011,"score_gpt":0.218162839136037,"score_spread":0.20478357703363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W954180850","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.0046082796,0.0011691677,0.9537746,0.0006891857,0.009923338,0.00080386276,0.00008376266,0.00033224822,0.02861556],"genre_scores_gemma":[0.2899681,0.0001134955,0.6956579,0.00067163643,0.0012710073,0.000004256544,0.000027395072,0.00006877455,0.012217425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622303,0.000018695131,0.0005371032,0.0011929802,0.0013667089,0.00066146394],"domain_scores_gemma":[0.99744314,0.00007872826,0.00041119062,0.0017063688,0.00017027534,0.00019028748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006916347,0.00044253888,0.00053891225,0.000873221,0.00013790258,0.00036180415,0.0043540997,0.0001582528,0.0001423814],"category_scores_gemma":[0.000013772739,0.00041800633,0.00010338718,0.00048644893,0.00071507925,0.0017657258,0.0042189406,0.0004466597,0.00006431293],"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.0000024461956,0.00002802383,0.00006543907,0.000055813736,0.000017387954,0.00003284581,0.00010936423,0.0005212428,0.000246527,0.7594964,0.00029167082,0.23913284],"study_design_scores_gemma":[0.0031795013,0.00090975146,0.023563273,0.0030254968,0.0001408218,0.00020697965,0.00000452841,0.31561878,0.018710505,0.4852955,0.14221975,0.0071250913],"about_ca_topic_score_codex":0.000060329534,"about_ca_topic_score_gemma":0.000021547037,"teacher_disagreement_score":0.31509754,"about_ca_system_score_codex":0.00012434613,"about_ca_system_score_gemma":0.00024540644,"threshold_uncertainty_score":0.9998272},"labels":[],"label_agreement":null},{"id":"W95632006","doi":"10.1007/978-3-642-40131-2_8","title":"Discovering Co-location Patterns in Datasets with Extended Spatial Objects","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":17,"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":"Data mining; Computer science; Grid; A priori and a posteriori; Database transaction; Spatial analysis; Geography; Pattern recognition (psychology); Artificial intelligence; Database; Remote sensing","score_opus":0.012426441170611957,"score_gpt":0.23879380284367144,"score_spread":0.2263673616730595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95632006","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.00023599982,0.000064747626,0.99674314,0.00021883761,0.00071229134,0.00055560324,0.00004968188,0.000093701216,0.0013260003],"genre_scores_gemma":[0.6925442,0.00007105926,0.30453283,0.0012283406,0.0006097574,0.000049327657,0.0005356108,0.00006317172,0.00036569408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642384,0.000028742974,0.00040868475,0.001557978,0.0009564156,0.0006243235],"domain_scores_gemma":[0.9977951,0.00013772538,0.00024298523,0.0016264721,0.000079191275,0.00011851076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004808501,0.00047919276,0.000396875,0.0008204888,0.00013347983,0.0011311696,0.0033366953,0.00013519937,0.000032183358],"category_scores_gemma":[0.000026902337,0.0003992003,0.000038049344,0.0005499978,0.0002745192,0.0022471128,0.0015159243,0.0005374326,0.000079998244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007201188,0.00005929734,0.00041429646,0.00009485008,0.000012801891,0.00024424572,0.00059549656,0.015160222,0.000029828974,0.0048460653,0.00006500613,0.9784707],"study_design_scores_gemma":[0.0008814805,0.0003465275,0.0074940184,0.0013231699,0.000011673563,0.000048331967,0.0000010919986,0.9696046,0.0009367208,0.016616235,0.001349885,0.0013862718],"about_ca_topic_score_codex":0.0004640802,"about_ca_topic_score_gemma":0.0014444069,"teacher_disagreement_score":0.9770844,"about_ca_system_score_codex":0.00021431799,"about_ca_system_score_gemma":0.00024805957,"threshold_uncertainty_score":0.99990577},"labels":[],"label_agreement":null},{"id":"W966483212","doi":"10.1007/978-1-4020-6264-3_37","title":"Implementation of a Spatial Data Structure on a FPGA","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Data Management and Algorithms","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 Lethbridge","funders":"","keywords":"Computer science; Implementation; Field-programmable gate array; Spatial analysis; Software; Software implementation; Data structure; Computer architecture; Data mining; Software engineering; Embedded system; Operating system; Geography; Remote sensing","score_opus":0.06790560313765769,"score_gpt":0.3248515901510272,"score_spread":0.2569459870133695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W966483212","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.0000033973422,0.000020013602,0.5395143,0.00016978745,0.000465906,0.00029385684,0.00072617555,0.00007009172,0.45873648],"genre_scores_gemma":[0.008163136,0.00016323464,0.24661173,0.0025003369,0.0016047411,0.0000040837776,0.012570428,0.00010610924,0.7282762],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986284,0.00000476632,0.00027166886,0.0005136669,0.00043973513,0.00014180651],"domain_scores_gemma":[0.9980098,0.000022484037,0.00020588988,0.0016892456,0.000036630816,0.000035970013],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016004851,0.00018138827,0.00017817396,0.00020210589,0.000027500197,0.00008486893,0.0020587086,0.000080084654,0.001150026],"category_scores_gemma":[0.0000022507832,0.00015422751,0.00003488753,0.000031756623,0.000024602872,0.00041764302,0.0013835629,0.00012434408,0.000049266037],"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.0000018238829,0.0000036773763,0.0000027806639,0.000013878502,0.000032566048,0.000008166639,0.000014233416,4.255925e-7,0.0000023398281,0.41864964,0.009516858,0.5717536],"study_design_scores_gemma":[0.0008054311,0.000334259,0.00041210768,0.000088970344,0.00007384779,0.0000042314323,0.000021076135,0.005211418,0.0007096675,0.042057045,0.9496209,0.0006610634],"about_ca_topic_score_codex":0.00028305323,"about_ca_topic_score_gemma":0.000850737,"teacher_disagreement_score":0.940104,"about_ca_system_score_codex":0.000018024743,"about_ca_system_score_gemma":0.00003600365,"threshold_uncertainty_score":0.9997631},"labels":[],"label_agreement":null},{"id":"W99206240","doi":"10.4018/978-1-59140-041-7.ch013","title":"Entity Identification of Fuzzy Multidatabase Systems with Incompatible Keys","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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; Schema (genetic algorithms); Fuzzy logic; Identification (biology); Data mining; Data integration; Relational database; Focus (optics); Database; Theoretical computer science; Information retrieval; Artificial intelligence","score_opus":0.0238865712327487,"score_gpt":0.2306072496955817,"score_spread":0.20672067846283299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99206240","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.000059165617,0.00013871753,0.16853723,0.0000069393395,0.00071488915,0.0005207941,0.0004083606,0.0001582022,0.8294557],"genre_scores_gemma":[0.63695323,0.000028296956,0.016229654,0.00009882179,0.00038421052,0.000076728946,0.00022282345,0.00008364118,0.3459226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797434,0.00002609681,0.00055162504,0.0006408786,0.0005650852,0.00024197655],"domain_scores_gemma":[0.9974475,0.000014570534,0.00068336626,0.0015536463,0.0001967664,0.00010417626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026981073,0.00033017545,0.0004054716,0.00013563878,0.00007815689,0.00025099376,0.001505072,0.0001238205,0.000009133627],"category_scores_gemma":[0.0000055712885,0.00029446805,0.000092952105,0.000048867125,0.000104692444,0.0004691056,0.0006731081,0.00014255506,0.00024227439],"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.000008939761,0.000023922132,0.000046754223,0.00015149773,0.00009209499,0.000030466235,0.000034468103,0.0000061847586,0.000015768917,0.9930928,0.0017355282,0.0047616065],"study_design_scores_gemma":[0.0041915504,0.0010571224,0.0016809611,0.003693074,0.0009816467,0.0001240781,0.00006239656,0.011845272,0.0025644735,0.83016664,0.1386985,0.0049342634],"about_ca_topic_score_codex":0.0008044389,"about_ca_topic_score_gemma":0.000113335765,"teacher_disagreement_score":0.63689405,"about_ca_system_score_codex":0.000085498374,"about_ca_system_score_gemma":0.00008905158,"threshold_uncertainty_score":0.99995077},"labels":[],"label_agreement":null},{"id":"W99233158","doi":"10.4018/978-1-59140-560-3.ch105","title":"Signature Files and Signature File Construction","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Data Management and Algorithms","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; University of Winnipeg","funders":"","keywords":"Computer science; Signature (topology); Inverted index; Information retrieval; Keyword search; File format; Search engine indexing; Database; Mathematics","score_opus":0.00858681020888056,"score_gpt":0.2090336344345606,"score_spread":0.20044682422568005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W99233158","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.0000019520094,0.0011585588,0.0053864755,0.00019447927,0.0006812004,0.00028072353,0.0018106595,0.0003038117,0.99018216],"genre_scores_gemma":[0.0029444874,0.00013518515,0.16793445,0.0033395898,0.0027160116,0.000041662795,0.0005641898,0.00009566021,0.8222288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835426,0.000012459281,0.0002390678,0.00072330073,0.00037796656,0.00029292464],"domain_scores_gemma":[0.9989368,0.000035700836,0.00019172477,0.0006397342,0.00006686863,0.00012917694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006626104,0.00041299235,0.00031905618,0.00008790622,0.00012992298,0.00041530054,0.0008380945,0.00048745747,0.00036095164],"category_scores_gemma":[0.00000900013,0.00039181768,0.000110544286,0.000033242635,0.00013410668,0.00030972378,0.00066422444,0.00044534059,0.00013157581],"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.0000024057942,0.00000253063,4.78311e-7,0.000015553356,0.000037982463,0.000042125215,0.00001087631,0.0000011493197,0.0000024026162,0.7294057,0.104559034,0.16591975],"study_design_scores_gemma":[0.00023690419,0.000054156928,0.000020356252,0.00016529446,0.000041241798,0.0000720345,0.000005216542,0.00067831494,0.000016064332,0.29216003,0.7060135,0.0005368885],"about_ca_topic_score_codex":0.000007796646,"about_ca_topic_score_gemma":0.000016818869,"teacher_disagreement_score":0.60145444,"about_ca_system_score_codex":0.00007289338,"about_ca_system_score_gemma":0.000061275845,"threshold_uncertainty_score":0.9998534},"labels":[],"label_agreement":null},{"id":"W995150301","doi":"10.1007/978-3-319-06483-3_11","title":"Use of Ontology and Cluster Ensembles for Geospatial Clustering Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","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":"Husky Energy (Canada); University of Calgary; Petro-Canada","funders":"","keywords":"Cluster analysis; Geospatial analysis; Computer science; Ontology; Data mining; Consensus clustering; Correlation clustering; Clustering high-dimensional data; Fuzzy clustering; Information retrieval; CURE data clustering algorithm; Artificial intelligence; Geography; Remote sensing","score_opus":0.02788286127351197,"score_gpt":0.25147343388740095,"score_spread":0.22359057261388898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W995150301","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.00012773288,0.000087123655,0.9981377,0.00040023684,0.0006701076,0.00036205162,0.000017197006,0.00004739828,0.00015044243],"genre_scores_gemma":[0.048110228,0.000039800816,0.9500784,0.0010235122,0.00024322918,0.000010302486,0.000024195304,0.000019966996,0.00045035002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747556,0.00003048703,0.00047686038,0.0011643012,0.00042174553,0.00043103923],"domain_scores_gemma":[0.99758315,0.00077573786,0.00033017495,0.0010600552,0.00015961876,0.00009124609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071129075,0.00034388588,0.00067667174,0.0011706157,0.00012906086,0.00045860265,0.0017090812,0.00018559863,0.0000048071474],"category_scores_gemma":[0.000085823434,0.00030961074,0.00015511113,0.00045854738,0.00042205004,0.0005834862,0.0019013222,0.00020476813,0.0000018717193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013684675,0.000012796832,0.00019390954,0.00009636724,0.000119299315,0.000008516612,0.0003085641,0.039281372,0.000030720475,0.014323665,0.000035908317,0.9455752],"study_design_scores_gemma":[0.00023156687,0.00015244623,0.00028193934,0.000077795834,0.00009073922,0.000006980776,6.6209246e-8,0.98214275,0.00013061045,0.013975547,0.0025636635,0.00034591314],"about_ca_topic_score_codex":0.000077873025,"about_ca_topic_score_gemma":0.0009816383,"teacher_disagreement_score":0.9452293,"about_ca_system_score_codex":0.000048781523,"about_ca_system_score_gemma":0.000067012144,"threshold_uncertainty_score":0.9999356},"labels":[],"label_agreement":null}]}