{"meta":{"query_hash":"08df8c589447","filters":{"venue":"Encyclopedia of Algorithms"},"cohort_total":32,"direct_labels_cover":0,"predictions_cover":32,"exported":32,"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/08df8c589447","api":"https://metacan.xera.ac/api/v1/cohort?venue=Encyclopedia+of+Algorithms"},"results":[{"id":"W1494793116","doi":"10.1007/978-1-4939-2864-4_294","title":"Planar Geometric Spanners","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Computational Geometry and Mesh Generation","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":"Planar; Computer science; Computer graphics (images)","score_opus":0.01321160507583427,"score_gpt":0.22616361705284363,"score_spread":0.21295201197700936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494793116","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009746955,0.0037795224,0.1655426,0.0002967925,0.000991139,0.00008791379,0.0006441145,0.0011910421,0.81771994],"genre_scores_gemma":[0.12419811,0.009702612,0.11078665,0.00039905676,0.00072063575,0.00018729869,0.0031622003,0.0013166734,0.7495268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979717,0.0000145569165,0.000008029125,0.000049925362,0.00011062016,0.000019762678],"domain_scores_gemma":[0.999933,0.000010214704,0.0000056608515,0.000018756422,0.000020855767,0.000011502895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010431147,0.0009301268,0.0005378208,0.0011915001,0.0005137427,0.0013399835,0.0008305962,0.00047710064,0.060545173],"category_scores_gemma":[0.00030317422,0.00036657663,0.00034105647,0.0012899111,0.0007663629,0.0017011029,0.001958861,0.0012984315,0.022678962],"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.000027282744,0.00003161228,0.00009565922,0.00022206854,0.000010992278,0.00008883063,0.00014070638,0.005494263,0.0062802485,0.5710124,0.051890917,0.3647051],"study_design_scores_gemma":[0.000008970765,0.000059158738,0.00026412713,0.00011251867,0.000011255122,0.0005283382,0.000115358904,0.0065925545,0.0043714372,0.38072872,0.60718846,0.000019099507],"about_ca_topic_score_codex":0.00026021546,"about_ca_topic_score_gemma":0.00058627117,"teacher_disagreement_score":0.060545173,"about_ca_system_score_codex":0.00032694158,"about_ca_system_score_gemma":0.0003772835,"threshold_uncertainty_score":0.2025438},"labels":[],"label_agreement":null},{"id":"W1501937057","doi":"10.1007/978-1-4939-2864-4_158","title":"Fully Dynamic Transitive Closure","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Computational Geometry and Mesh Generation","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":"Transitive closure; Closure (psychology); Transitive relation; Computer science; Mathematics; Combinatorics; Political science","score_opus":0.007245124310746306,"score_gpt":0.223361274430009,"score_spread":0.2161161501192627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501937057","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014520946,0.0023745324,0.33835995,0.0015226396,0.0010365603,0.00016364096,0.0019483989,0.0021051338,0.6379681],"genre_scores_gemma":[0.5041146,0.0049448977,0.16931127,0.0011478775,0.0010790982,0.0004561489,0.0068472736,0.0035207488,0.30857816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841833,0.00021747248,0.00012543575,0.00046325865,0.00059563003,0.00017988827],"domain_scores_gemma":[0.9987067,0.00038730982,0.0000773579,0.0005406301,0.00022174373,0.00006622574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078009866,0.00089187344,0.00080162624,0.0012466034,0.0017711661,0.0046683517,0.0012159559,0.00081789267,0.035899222],"category_scores_gemma":[0.0029031923,0.0007192502,0.0009837146,0.001319154,0.0027742854,0.009543137,0.0033652883,0.0024688812,0.011148328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015861542,0.000014031858,0.000044702243,0.00007017461,0.0000053680533,0.00005383734,0.0002287115,0.00038258889,0.00075537985,0.9524982,0.012290908,0.033640172],"study_design_scores_gemma":[0.0000065557115,0.000008389017,0.00004633574,0.000042716456,0.000007840257,0.00019113939,0.00008530408,0.0014388538,0.0011466686,0.8888013,0.10821321,0.00001169303],"about_ca_topic_score_codex":0.00084423565,"about_ca_topic_score_gemma":0.0009923739,"teacher_disagreement_score":0.035899222,"about_ca_system_score_codex":0.0012092377,"about_ca_system_score_gemma":0.0010830233,"threshold_uncertainty_score":0.120094836},"labels":[],"label_agreement":null},{"id":"W1517466281","doi":"10.1007/978-0-387-30162-4_411","title":"Succinct Encoding of Permutations: Applications to Text Indexing","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Encoding (memory); Search engine indexing; Computer science; Information retrieval; Artificial intelligence","score_opus":0.01961642112949077,"score_gpt":0.25951106128939977,"score_spread":0.239894640159909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517466281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011095064,0.002227826,0.9607731,0.0011066821,0.00063428463,0.0001873368,0.0016399161,0.003503267,0.018832548],"genre_scores_gemma":[0.14853163,0.0036857277,0.81988615,0.00064346683,0.00057545217,0.00051979866,0.0044489237,0.0011497635,0.020559],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888855,0.00030784862,0.00012688455,0.00014288614,0.00045951974,0.00007424849],"domain_scores_gemma":[0.9970048,0.0013172163,0.00016014837,0.0010263977,0.00040788556,0.00008363288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138707,0.00096961984,0.0009266956,0.0014617947,0.00077422,0.0029091462,0.001692384,0.0012149093,0.012770616],"category_scores_gemma":[0.0072119483,0.00057058723,0.0006053607,0.004421635,0.0012037731,0.0052312827,0.002274221,0.0019624943,0.004685697],"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.00038404608,0.00014823518,0.00022990041,0.00042990208,0.000022786453,0.00018297971,0.0002828801,0.02385548,0.008291682,0.35562,0.03982612,0.5707259],"study_design_scores_gemma":[0.00013069836,0.00013090631,0.00014377889,0.00018677217,0.000037768812,0.00048997375,0.00012556546,0.13300815,0.015368502,0.7771818,0.07313085,0.000065261265],"about_ca_topic_score_codex":0.0008801188,"about_ca_topic_score_gemma":0.0014891076,"teacher_disagreement_score":0.012770616,"about_ca_system_score_codex":0.0008648629,"about_ca_system_score_gemma":0.001406357,"threshold_uncertainty_score":0.042721987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005917746,0.068123594,0.6633696,0.0019831157,0.0047900337,0.00016325229,0.00061015383,0.00043206904,0.2546104],"genre_scores_gemma":[0.12878987,0.08082681,0.64084524,0.0018615292,0.004557079,0.000585502,0.0026425135,0.00067568163,0.1392158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978916,0.00052230625,0.00013531993,0.00037263523,0.0009890267,0.00008902744],"domain_scores_gemma":[0.998792,0.00049042446,0.000109071276,0.0002555883,0.0003153236,0.000037668546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012058716,0.00073131034,0.0013158495,0.00299335,0.001214206,0.0032068978,0.002380059,0.0016502001,0.009554674],"category_scores_gemma":[0.006567522,0.00038043867,0.0006931052,0.008530152,0.0020184135,0.0054688076,0.0022762213,0.002395141,0.004731889],"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.000021281157,0.00002876497,0.00016393077,0.00031264292,0.000016881115,0.00008246511,0.00016327438,0.0038196011,0.00035363287,0.7511264,0.020488482,0.22342275],"study_design_scores_gemma":[0.000006679771,0.000023497103,0.00021449587,0.0001758259,0.000017990702,0.0004860532,0.00013372098,0.01463367,0.00058502005,0.81555915,0.16813666,0.00002727399],"about_ca_topic_score_codex":0.0014803734,"about_ca_topic_score_gemma":0.0014575488,"teacher_disagreement_score":0.009554674,"about_ca_system_score_codex":0.0014484692,"about_ca_system_score_gemma":0.0008486531,"threshold_uncertainty_score":0.031963587},"labels":[],"label_agreement":null},{"id":"W1590367822","doi":"10.1007/978-3-642-27848-8_73-2","title":"Closest String and Substring Problems","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Substring; String (physics); Computer science; Mathematics; Physics; Theoretical physics; Programming language; Data structure","score_opus":0.012930917182556796,"score_gpt":0.214215555415739,"score_spread":0.2012846382331822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590367822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008845926,0.07164707,0.6206198,0.006121702,0.0051363325,0.00016357888,0.0013329947,0.0015839564,0.2845487],"genre_scores_gemma":[0.11476811,0.0861453,0.53634906,0.0019993256,0.00918587,0.0005371823,0.0065744035,0.0015836832,0.24285711],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984231,0.0002550783,0.00010981186,0.00031380044,0.00083573366,0.00006240491],"domain_scores_gemma":[0.99889106,0.00058207224,0.00006975763,0.00025593903,0.00015182047,0.00004931042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122281,0.0012549919,0.0018517087,0.002492615,0.0010417531,0.0032823232,0.0022778367,0.0022456783,0.024793249],"category_scores_gemma":[0.005254074,0.0005409254,0.00089104613,0.008250393,0.0019237997,0.006750103,0.0026673132,0.0037386424,0.010855922],"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.00005319667,0.00006588216,0.00016225003,0.00075201807,0.000030718977,0.00011630783,0.00012672092,0.010952601,0.0009040342,0.4305581,0.08531644,0.47096172],"study_design_scores_gemma":[0.000014645906,0.000022600649,0.000118633485,0.00014127335,0.000013555394,0.00042747927,0.000046765683,0.014344595,0.0006508386,0.884962,0.099240705,0.000016954942],"about_ca_topic_score_codex":0.00060659176,"about_ca_topic_score_gemma":0.0005530962,"teacher_disagreement_score":0.024793249,"about_ca_system_score_codex":0.0012119112,"about_ca_system_score_gemma":0.0011756215,"threshold_uncertainty_score":0.08294165},"labels":[],"label_agreement":null},{"id":"W171011166","doi":"10.1007/978-3-642-27848-8_594-1","title":"Uniform Covering of Rings and Lines by Memoryless Mobile Sensors","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Optimization and Search Problems","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 Ottawa","funders":"","keywords":"Computer science","score_opus":0.008348345353350049,"score_gpt":0.22546899510173013,"score_spread":0.21712064974838008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171011166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080278054,0.002362796,0.89555156,0.00019134909,0.0001407647,0.000045017066,0.00031245028,0.0006252067,0.02049278],"genre_scores_gemma":[0.8247289,0.003624855,0.15007655,0.00012504478,0.0001716466,0.00013435692,0.00039914474,0.0001561467,0.020583356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944824,0.00015074112,0.000025819478,0.00015285292,0.00012310268,0.000099231074],"domain_scores_gemma":[0.9992399,0.00030740147,0.0001472678,0.00020074294,0.00006199056,0.000042804764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386409,0.0007877418,0.0007726034,0.00039433193,0.000384984,0.0010526933,0.0013362749,0.0006713322,0.0028361604],"category_scores_gemma":[0.0015209089,0.0004489607,0.0005631335,0.0007766041,0.0008856264,0.0020897246,0.001620289,0.0006520744,0.0007282294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083600864,0.00007925885,0.0008388438,0.0006602892,0.00010667082,0.00038712076,0.0003133351,0.39946747,0.04826527,0.35660946,0.008757948,0.1836784],"study_design_scores_gemma":[0.00006866178,0.00036644225,0.000678357,0.00006574586,0.000049838818,0.00063001545,0.000127597,0.7533848,0.029997217,0.19104306,0.023517378,0.00007081404],"about_ca_topic_score_codex":0.0005944361,"about_ca_topic_score_gemma":0.00041293883,"teacher_disagreement_score":0.0028361604,"about_ca_system_score_codex":0.00046692527,"about_ca_system_score_gemma":0.00023719094,"threshold_uncertainty_score":0.009487927},"labels":[],"label_agreement":null},{"id":"W1861659989","doi":"10.1007/978-0-387-30162-4_380","title":"Snapshots in Shared Memory","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Distributed systems and fault tolerance","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; Psychology","score_opus":0.01438385155006809,"score_gpt":0.22434665111307106,"score_spread":0.20996279956300298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861659989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009165433,0.06025815,0.52810246,0.002371446,0.0035451564,0.00012267406,0.0009975951,0.008589497,0.3868475],"genre_scores_gemma":[0.1821574,0.04584484,0.2541706,0.00089861266,0.0019744523,0.00026169705,0.0034775904,0.003039086,0.50817573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966824,0.00006439291,0.00002574394,0.00006773982,0.00014134438,0.00003251708],"domain_scores_gemma":[0.9996123,0.00011280002,0.00001994486,0.00016256918,0.00006316414,0.000029308743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029743055,0.0006439614,0.0007793731,0.0009113754,0.0006623375,0.003039073,0.0010815957,0.0006869484,0.027957547],"category_scores_gemma":[0.0013992704,0.0005732275,0.00032977242,0.0022884367,0.00090464536,0.0042412286,0.0016694862,0.0014423577,0.009554936],"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.000055547855,0.000028756433,0.00020241662,0.00028841503,0.000017031238,0.00009650326,0.00027909875,0.004995802,0.0013219919,0.5132705,0.090267904,0.38917607],"study_design_scores_gemma":[0.00001917613,0.000030332985,0.00030755912,0.00021951547,0.000024236577,0.00042117137,0.000111910296,0.01657633,0.0025047006,0.45754975,0.5222112,0.000024074767],"about_ca_topic_score_codex":0.0010282173,"about_ca_topic_score_gemma":0.0013665044,"teacher_disagreement_score":0.027957547,"about_ca_system_score_codex":0.00063565664,"about_ca_system_score_gemma":0.00062233576,"threshold_uncertainty_score":0.09352738},"labels":[],"label_agreement":null},{"id":"W1885865461","doi":"10.1007/978-3-642-27848-8_15-2","title":"Applications of Geometric Spanner Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Computational Geometry and Mesh Generation","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":"Spanner; Computer science; Distributed computing","score_opus":0.008183999606666405,"score_gpt":0.22081455285340273,"score_spread":0.21263055324673633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885865461","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010985692,0.052611038,0.45402768,0.0021224876,0.0026628498,0.00009629581,0.00038219916,0.00083279755,0.47627902],"genre_scores_gemma":[0.2463811,0.13024594,0.36271128,0.0011652631,0.004763908,0.00030895957,0.0015832644,0.0007788575,0.25206146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967754,0.00006074236,0.000015013912,0.000067416855,0.00015415515,0.000025091735],"domain_scores_gemma":[0.99967515,0.00013883773,0.000022562777,0.00006459676,0.000067108725,0.000031813186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032006172,0.0009491991,0.00053309975,0.0016179302,0.00052271783,0.0016517091,0.0011166715,0.0009312202,0.018079719],"category_scores_gemma":[0.0010841262,0.00038878707,0.00051024597,0.0023646972,0.0009405458,0.0023039477,0.0020984486,0.0014228082,0.004167287],"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.000021396017,0.000025907979,0.00015304006,0.00029462692,0.000018871999,0.00009853711,0.00010006373,0.01992774,0.0023954748,0.739002,0.021576162,0.21638615],"study_design_scores_gemma":[0.000005669068,0.000026064185,0.00018045072,0.00015731838,0.000012205906,0.0004450522,0.00006457497,0.040096864,0.0014871235,0.74092656,0.21658166,0.000016473474],"about_ca_topic_score_codex":0.00051770086,"about_ca_topic_score_gemma":0.00079836085,"teacher_disagreement_score":0.018079719,"about_ca_system_score_codex":0.00078184827,"about_ca_system_score_gemma":0.0004151432,"threshold_uncertainty_score":0.06048274},"labels":[],"label_agreement":null},{"id":"W1891841982","doi":"10.1007/978-3-642-27848-8_340-2","title":"Regular Expression Matching","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Western University","funders":"","keywords":"Matching (statistics); Expression (computer science); Computer science; Computational biology; Mathematics; Biology; Programming language; Statistics","score_opus":0.009862854529614681,"score_gpt":0.22153672295557092,"score_spread":0.21167386842595623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891841982","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005039811,0.0055754026,0.67338365,0.00140462,0.0010660319,0.00030519062,0.0033887892,0.010263374,0.2995732],"genre_scores_gemma":[0.057146575,0.008099866,0.46348056,0.0012270801,0.0004934938,0.00033478034,0.017910214,0.004932409,0.446375],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895155,0.000110712484,0.00008631215,0.0002882287,0.00048772508,0.000075322794],"domain_scores_gemma":[0.9995158,0.00012311956,0.000022891654,0.00019278738,0.0001250156,0.000020501267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006473816,0.0009034162,0.00093601836,0.0019005183,0.000736744,0.0022055337,0.0017418973,0.0008847555,0.06694527],"category_scores_gemma":[0.0023651402,0.000567992,0.0009142086,0.0033530246,0.0007329083,0.004100387,0.0019502976,0.0014376417,0.049242757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055183322,0.00007995763,0.00013490979,0.00029353233,0.000022064241,0.000094518204,0.00011536717,0.0020720137,0.004534421,0.16908228,0.10319077,0.72032505],"study_design_scores_gemma":[0.000015056419,0.000030886753,0.0002416033,0.00019609286,0.00003415381,0.0006601304,0.00007945673,0.014397582,0.013618576,0.2896012,0.6810947,0.000030534367],"about_ca_topic_score_codex":0.000949921,"about_ca_topic_score_gemma":0.0011440443,"teacher_disagreement_score":0.06694527,"about_ca_system_score_codex":0.0007591354,"about_ca_system_score_gemma":0.0010555651,"threshold_uncertainty_score":0.22395426},"labels":[],"label_agreement":null},{"id":"W2146094628","doi":"10.1007/978-0-387-30162-4_122","title":"Edit Distance Under Block Operations","year":2008,"lang":"en","type":"article","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Edit distance; Combinatorics; Substring; Character (mathematics); Block (permutation group theory); Alphabet; Mathematics; Permutation (music); Discrete mathematics; Computer science; Algorithm; Physics; Data structure; Geometry","score_opus":0.01426117440055015,"score_gpt":0.2400185813164199,"score_spread":0.22575740691586976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146094628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051634472,0.0026975365,0.9073832,0.0016183127,0.0008986799,0.00009562229,0.0014348632,0.0010699816,0.03316736],"genre_scores_gemma":[0.5828079,0.004703689,0.3261576,0.00090790447,0.0020841314,0.00045087747,0.004340214,0.0009962473,0.077551484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737144,0.0005754712,0.0002515105,0.000604251,0.0010416354,0.0001557519],"domain_scores_gemma":[0.9936521,0.00279481,0.00045427386,0.0018504321,0.00101471,0.00023372623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014286144,0.00060680683,0.0012170462,0.0024956854,0.00084424776,0.0025269517,0.001240491,0.0014261153,0.009571289],"category_scores_gemma":[0.010194489,0.00037788603,0.00060744485,0.0035965217,0.0013651359,0.007871785,0.0027652436,0.0020426004,0.0032905168],"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.00017404252,0.00005970293,0.0003796024,0.00013736579,0.00003489219,0.00017636803,0.00019542148,0.008103325,0.0035830352,0.8355449,0.009877465,0.14173399],"study_design_scores_gemma":[0.000022649976,0.00014193356,0.00040007007,0.00003216415,0.000029027671,0.00059837097,0.000062156265,0.059687875,0.0069514434,0.901226,0.030815175,0.000033142645],"about_ca_topic_score_codex":0.00061320886,"about_ca_topic_score_gemma":0.000433917,"teacher_disagreement_score":0.009571289,"about_ca_system_score_codex":0.00075156416,"about_ca_system_score_gemma":0.00092128926,"threshold_uncertainty_score":0.03201914},"labels":[],"label_agreement":null},{"id":"W2203314088","doi":"10.1007/978-1-4939-2864-4_709","title":"Testing Juntas and Related Properties of Boolean Functions","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Machine Learning 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","score_opus":0.015278308512105186,"score_gpt":0.20993583485455644,"score_spread":0.19465752634245126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203314088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46145862,0.00444133,0.45756358,0.01042867,0.0013569308,0.00042475385,0.0051039415,0.0052545452,0.05396774],"genre_scores_gemma":[0.90183705,0.0010808443,0.08343166,0.0013469617,0.0008303219,0.0002671756,0.004735212,0.0008049349,0.0056658825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863993,0.0038733298,0.0011053252,0.0032216706,0.004156027,0.0012443267],"domain_scores_gemma":[0.8585399,0.12513539,0.0036455053,0.007960568,0.003522237,0.0011963837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072575957,0.0019622834,0.0017154074,0.0023472335,0.0014643715,0.00510911,0.005079574,0.0033136602,0.01049737],"category_scores_gemma":[0.08491667,0.0010334934,0.0032979618,0.0025407064,0.00588737,0.0162178,0.0041269404,0.0054237475,0.001279174],"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.003614154,0.0013171966,0.029330792,0.0021920379,0.0006486551,0.00096990686,0.00087680714,0.08296921,0.011005288,0.5929701,0.025425725,0.24868008],"study_design_scores_gemma":[0.00017657234,0.0002036289,0.0010496137,0.00015149685,0.00012371616,0.00037834933,0.00022431713,0.11679446,0.0054801507,0.8730602,0.0023159385,0.000041484018],"about_ca_topic_score_codex":0.0012386516,"about_ca_topic_score_gemma":0.0018593788,"teacher_disagreement_score":0.01049737,"about_ca_system_score_codex":0.0023050397,"about_ca_system_score_gemma":0.002986186,"threshold_uncertainty_score":0.03838229},"labels":[],"label_agreement":null},{"id":"W2487380303","doi":"10.1007/978-1-4939-2864-4_302","title":"Quantum Analogues of Markov Chains","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Quantum Computing Algorithms and Architecture","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":"Markov chain; Quantum; Computer science; Quantum mechanics; Physics; Machine learning","score_opus":0.009786744468596042,"score_gpt":0.22243669376813388,"score_spread":0.21264994929953784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487380303","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056674823,0.009533961,0.27912435,0.0046533598,0.0024565922,0.00010928474,0.0006125774,0.00039314525,0.6464419],"genre_scores_gemma":[0.8144966,0.008684914,0.05503441,0.0015072676,0.0037981072,0.00025510255,0.00057433936,0.0003749518,0.11527425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922967,0.00026507527,0.00003600696,0.00013586137,0.00023232758,0.000101109006],"domain_scores_gemma":[0.9984464,0.00077168917,0.00015936968,0.00025506844,0.00022974459,0.00013772816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595769,0.00053876743,0.0007924504,0.0013199426,0.0011686656,0.002944043,0.0008356598,0.0014044009,0.016046071],"category_scores_gemma":[0.0038912797,0.00047186093,0.00075962715,0.0010040227,0.0039847866,0.0035043329,0.0014539957,0.0028541936,0.0015902558],"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.0000023788114,0.000003001123,0.000007335771,0.000007647793,9.2438404e-7,0.0000042709426,0.000016854992,0.00043615577,0.000052448915,0.9980604,0.00044368848,0.0009648867],"study_design_scores_gemma":[0.0000030633373,0.000003050632,0.000024056348,0.000008251565,8.756568e-7,0.000011131283,0.0000065633567,0.0030870498,0.000039688737,0.99358267,0.00323012,0.000003386775],"about_ca_topic_score_codex":0.0010978951,"about_ca_topic_score_gemma":0.00087210914,"teacher_disagreement_score":0.016046071,"about_ca_system_score_codex":0.0016186723,"about_ca_system_score_gemma":0.0011224824,"threshold_uncertainty_score":0.053679466},"labels":[],"label_agreement":null},{"id":"W2951833220","doi":"10.1007/978-1-4939-2864-4_73","title":"Closest String and Substring Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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; University of Waterloo","funders":"","keywords":"Substring; Combinatorics; Hamming distance; String (physics); Approximate string matching; String searching algorithm; Mathematics; Edit distance; Discrete mathematics; Logarithm; Set (abstract data type); Algorithm; Pattern matching; Computer science; Artificial intelligence","score_opus":0.013939235147516165,"score_gpt":0.21822607671074917,"score_spread":0.204286841563233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951833220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00910053,0.06667147,0.6234804,0.006317574,0.0051917066,0.00016113193,0.0013828338,0.0015619156,0.28613248],"genre_scores_gemma":[0.121905334,0.08396705,0.52927625,0.0020554278,0.009490544,0.00053464633,0.0070130536,0.0016686831,0.24408902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983334,0.0002706308,0.00011855839,0.00034106412,0.0008717301,0.000064591135],"domain_scores_gemma":[0.9988494,0.000597022,0.00007540744,0.00027476883,0.00015042067,0.000053060827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007594871,0.0012976953,0.0018895234,0.0025130194,0.0010726189,0.0035375198,0.0023095247,0.0024038397,0.025871897],"category_scores_gemma":[0.005774557,0.00054410717,0.0009209807,0.00808962,0.0020147688,0.0071596727,0.0029139165,0.0038907826,0.011305314],"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.000055856584,0.00006493154,0.00016748405,0.00077562983,0.00003165274,0.000117666816,0.00013205256,0.010946914,0.00085972593,0.46413386,0.081176475,0.44153765],"study_design_scores_gemma":[0.000013290551,0.000020028134,0.00010085334,0.0001268881,0.000012602214,0.00037446988,0.00004275758,0.013117116,0.0005445424,0.90072966,0.08490294,0.000014808847],"about_ca_topic_score_codex":0.0005951546,"about_ca_topic_score_gemma":0.00053272565,"teacher_disagreement_score":0.025871897,"about_ca_system_score_codex":0.001214796,"about_ca_system_score_gemma":0.0012519086,"threshold_uncertainty_score":0.08655012},"labels":[],"label_agreement":null},{"id":"W4214706793","doi":"10.1007/978-0-387-30162-4_158","title":"Fully Dynamic Transitive Closure","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Computational Geometry and Mesh Generation","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 Victoria","funders":"","keywords":"Transitive closure; Transitive relation; Closure (psychology); Mathematics; Computer science; Combinatorics; Political science","score_opus":0.009003476063443532,"score_gpt":0.22086136558508068,"score_spread":0.21185788952163714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214706793","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016825309,0.0017467444,0.37850326,0.0014248731,0.0008672573,0.00019269709,0.002082844,0.0025068894,0.5958501],"genre_scores_gemma":[0.50658846,0.003450135,0.18589285,0.0010262261,0.0008398225,0.00047772712,0.006566077,0.0032062272,0.2919525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983652,0.0002255113,0.00013060535,0.0004826468,0.0005956512,0.00020035157],"domain_scores_gemma":[0.9985165,0.00042846304,0.00008030791,0.0006508431,0.000251453,0.00007245057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175412,0.0008912856,0.0009112548,0.0012717921,0.0019942503,0.004518836,0.0012852926,0.00085438305,0.0356824],"category_scores_gemma":[0.0028171395,0.0007981753,0.0010976122,0.0014140563,0.002814174,0.010341531,0.0033656943,0.0024875458,0.009988907],"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.000019641413,0.000017509212,0.00005182152,0.000066416775,0.000006218739,0.000060784863,0.0002592542,0.00038490986,0.00086852605,0.952723,0.012445144,0.033096842],"study_design_scores_gemma":[0.000007701754,0.000009832561,0.000052450603,0.000033986595,0.000009572437,0.00021280027,0.00009640952,0.0015983463,0.0014317927,0.9008152,0.09571922,0.000012569358],"about_ca_topic_score_codex":0.00091238203,"about_ca_topic_score_gemma":0.0010567739,"teacher_disagreement_score":0.0356824,"about_ca_system_score_codex":0.0012324555,"about_ca_system_score_gemma":0.0010903401,"threshold_uncertainty_score":0.11936957},"labels":[],"label_agreement":null},{"id":"W4232099961","doi":"10.1007/978-1-4939-2864-4_13","title":"Alternative Performance Measures in Online Algorithms","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Optimization and Search Problems","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; Algorithm","score_opus":0.026556741903097224,"score_gpt":0.26092038490884345,"score_spread":0.23436364300574622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232099961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009093663,0.036076326,0.9010896,0.0030265818,0.0014033797,0.00007177229,0.00026228587,0.00042825693,0.04854812],"genre_scores_gemma":[0.5094396,0.031803984,0.41774702,0.0015433182,0.007904947,0.0006331153,0.0008588208,0.0010214743,0.02904773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98492485,0.009127934,0.000605144,0.0012495872,0.0034506253,0.0006418866],"domain_scores_gemma":[0.9618272,0.030767547,0.0014030442,0.002887496,0.0025746515,0.00054003054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012232773,0.0029841794,0.0027377869,0.004292773,0.00091223855,0.007097766,0.0036554572,0.0038829397,0.009084582],"category_scores_gemma":[0.04692836,0.0005872068,0.0012098547,0.008543062,0.0050178324,0.012860007,0.0031026055,0.0054156487,0.0023870175],"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.00010606127,0.00008288002,0.00030570198,0.00037766114,0.000051475603,0.000024609015,0.00008287258,0.0278213,0.0002883105,0.8646908,0.0071436623,0.09902464],"study_design_scores_gemma":[0.000017829827,0.00008791512,0.0003197374,0.00020189368,0.00003538453,0.00006202141,0.000057432408,0.12203574,0.00050086173,0.8675527,0.009096852,0.00003173186],"about_ca_topic_score_codex":0.00063624,"about_ca_topic_score_gemma":0.00038227206,"teacher_disagreement_score":0.012232773,"about_ca_system_score_codex":0.0034545083,"about_ca_system_score_gemma":0.0013191748,"threshold_uncertainty_score":0.06469381},"labels":[],"label_agreement":null},{"id":"W4232809888","doi":"10.1007/978-0-387-30162-4_69","title":"Circuit Placement","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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","score_opus":0.015496608379691827,"score_gpt":0.20329742567141884,"score_spread":0.187800817291727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232809888","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002341898,0.008035131,0.39031184,0.00059784297,0.001841133,0.0002657754,0.0011211428,0.008029275,0.5874559],"genre_scores_gemma":[0.039927013,0.01040801,0.32927433,0.0007242792,0.0006524453,0.00026051968,0.0036831042,0.0014250239,0.6136454],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997863,0.000013759395,0.000008706641,0.000047017857,0.00012576165,0.000018506376],"domain_scores_gemma":[0.9998512,0.000019577132,0.000006677536,0.000052340376,0.000058357957,0.000011746776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012676242,0.0013270873,0.00060777983,0.0014090488,0.00056484697,0.0013090039,0.0014235881,0.00074933824,0.12582248],"category_scores_gemma":[0.00039585907,0.0005260236,0.00048183155,0.001779013,0.00030496082,0.0009599746,0.00087151764,0.0009043072,0.08421862],"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.000039925173,0.000040755047,0.00007847638,0.00039839005,0.000017263917,0.00011460292,0.00003612192,0.005945728,0.010370676,0.036054257,0.14371039,0.8031934],"study_design_scores_gemma":[0.000026522055,0.00010257447,0.00023665308,0.0001587779,0.000026039623,0.0010221946,0.00003286999,0.013047519,0.013709838,0.045013756,0.9266003,0.000023003875],"about_ca_topic_score_codex":0.0005126289,"about_ca_topic_score_gemma":0.0017136476,"teacher_disagreement_score":0.12582248,"about_ca_system_score_codex":0.00046373982,"about_ca_system_score_gemma":0.00077298004,"threshold_uncertainty_score":0.42091817},"labels":[],"label_agreement":null},{"id":"W4233545931","doi":"10.1007/978-1-4939-2864-4_167","title":"Geometric Spanners","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.01276372950238561,"score_gpt":0.22776448765994078,"score_spread":0.21500075815755518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233545931","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029451568,0.0057069995,0.09109542,0.0003733286,0.0014872187,0.000068135465,0.0006210734,0.0011933533,0.8965093],"genre_scores_gemma":[0.0409125,0.010075984,0.060496595,0.0004378071,0.00085491297,0.00014116635,0.002643992,0.0013858296,0.88305134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975497,0.00001956024,0.0000111486415,0.00006648721,0.00012689654,0.00002091052],"domain_scores_gemma":[0.9999007,0.000015865446,0.000005731919,0.000028370228,0.00003304001,0.000016263786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015113688,0.0010106706,0.0006392566,0.001558878,0.0006755988,0.002140358,0.000940054,0.0005469535,0.10580728],"category_scores_gemma":[0.00043853084,0.00037907652,0.0004031851,0.0016474796,0.00097221404,0.0023885383,0.0020811646,0.0015762495,0.051191702],"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.000019494433,0.00002496762,0.000076661105,0.00020400173,0.000007969733,0.000067027235,0.00017152933,0.0018391614,0.0023709354,0.5358351,0.09563923,0.36374393],"study_design_scores_gemma":[0.0000038341145,0.000022436237,0.000137138,0.00010185188,0.000005735452,0.00027295802,0.00006519875,0.0014916551,0.0011597074,0.20764433,0.7890857,0.000009519654],"about_ca_topic_score_codex":0.0004112882,"about_ca_topic_score_gemma":0.0009482283,"teacher_disagreement_score":0.10580728,"about_ca_system_score_codex":0.00045674518,"about_ca_system_score_gemma":0.0005021445,"threshold_uncertainty_score":0.35396057},"labels":[],"label_agreement":null},{"id":"W4240851185","doi":"10.1007/978-3-642-27848-8_607-1","title":"Transactional Memory","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Distributed systems and fault tolerance","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Transactional memory; Computer science; Database; Database transaction","score_opus":0.022103017583593707,"score_gpt":0.2418736888112772,"score_spread":0.21977067122768348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240851185","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024989743,0.10221547,0.18252726,0.0023286873,0.0056948694,0.00023138165,0.00251691,0.006787305,0.69519913],"genre_scores_gemma":[0.021823658,0.041237567,0.055849064,0.0014155384,0.0018537753,0.00021611065,0.0043040407,0.0017205355,0.87157965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961615,0.000034697485,0.000032350217,0.000083804756,0.00020005183,0.00003294623],"domain_scores_gemma":[0.9995388,0.00010326235,0.000023810575,0.00014732027,0.00015063334,0.000036223988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036430813,0.0012387583,0.00087335566,0.0014726593,0.0007227048,0.0038602543,0.001753469,0.00088814547,0.10364629],"category_scores_gemma":[0.0011771292,0.0005850075,0.00042151744,0.003773409,0.00068063283,0.0043557887,0.0014185923,0.001748991,0.07059478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050899336,0.000045611254,0.00009813135,0.0006530505,0.000022076618,0.00006714191,0.00017015722,0.00095693086,0.004055686,0.105288714,0.26566115,0.62293047],"study_design_scores_gemma":[0.000008013308,0.00002275999,0.00011457444,0.00020405944,0.000013745175,0.00026648628,0.000032269894,0.0012353453,0.0015761012,0.038512528,0.9579995,0.00001458751],"about_ca_topic_score_codex":0.0006300488,"about_ca_topic_score_gemma":0.001127921,"teacher_disagreement_score":0.10364629,"about_ca_system_score_codex":0.00058220705,"about_ca_system_score_gemma":0.0009622992,"threshold_uncertainty_score":0.34673136},"labels":[],"label_agreement":null},{"id":"W4243714770","doi":"10.1007/978-0-387-30162-4_421","title":"Teleportation of Quantum States","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Quantum Information and Cryptography","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":"Teleportation; Quantum teleportation; Superdense coding; Quantum; Physics; Quantum mechanics; Quantum entanglement; Quantum channel","score_opus":0.010664504917658617,"score_gpt":0.2190079050128339,"score_spread":0.2083434000951753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243714770","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021007746,0.008587919,0.32933372,0.003034527,0.0018720933,0.00018281343,0.0003307671,0.00068620476,0.6349642],"genre_scores_gemma":[0.5834853,0.01703284,0.11493,0.0011626553,0.0015043016,0.0005870023,0.00055845734,0.0005348587,0.28020453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999461,0.00013111705,0.000022605604,0.00008594578,0.00023476414,0.000064653424],"domain_scores_gemma":[0.99942696,0.00029128627,0.00003439785,0.00018026245,0.00004512599,0.000021910066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045160067,0.00057952025,0.00065320113,0.0007024384,0.0009552876,0.0024631147,0.0010692327,0.0013113299,0.021184534],"category_scores_gemma":[0.0014995907,0.00047986224,0.0006201217,0.0011350996,0.0028859521,0.00379447,0.0018661327,0.0023098225,0.0027178752],"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.000014055248,0.0000095489995,0.000015465446,0.000063466585,0.000005016291,0.00002752771,0.000084222025,0.0012137876,0.0011286704,0.9744357,0.0035290557,0.019473532],"study_design_scores_gemma":[0.000014815174,0.000021315142,0.000055448636,0.00005747974,0.0000056065314,0.00015744664,0.00002808074,0.0062462613,0.0037250693,0.93160415,0.058067076,0.0000172444],"about_ca_topic_score_codex":0.00021497974,"about_ca_topic_score_gemma":0.00020443555,"teacher_disagreement_score":0.021184534,"about_ca_system_score_codex":0.00091491523,"about_ca_system_score_gemma":0.00068181177,"threshold_uncertainty_score":0.07086933},"labels":[],"label_agreement":null},{"id":"W4244641834","doi":"10.1007/978-0-387-30162-4_189","title":"Inductive Inference","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Machine Learning 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":"Inference; Computer science; Artificial intelligence","score_opus":0.015424452460302133,"score_gpt":0.24907265832351036,"score_spread":0.23364820586320822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244641834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084524683,0.0024576113,0.6969149,0.0017981795,0.00066023355,0.00015240232,0.0017004505,0.0032839433,0.29218695],"genre_scores_gemma":[0.06326502,0.006358203,0.6034265,0.00291748,0.0016871953,0.0006574987,0.010083936,0.0024437057,0.3091604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985423,0.00037902896,0.000076326425,0.00038259744,0.0005388645,0.000080859776],"domain_scores_gemma":[0.9981686,0.0009910861,0.00004141665,0.0005132374,0.0002427279,0.000042898027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016197306,0.0010777423,0.00095235783,0.0021208962,0.001236644,0.0029205158,0.0033198928,0.0011569638,0.10113708],"category_scores_gemma":[0.0051879017,0.00085872796,0.0015850872,0.0016758274,0.0018583799,0.004824515,0.0030427012,0.003391451,0.054557156],"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.000027791986,0.00005789448,0.00030315682,0.0004055516,0.000043674005,0.000064312204,0.0001608071,0.001525672,0.00094552105,0.59865934,0.09727625,0.30053005],"study_design_scores_gemma":[0.00001290987,0.000009423217,0.0001993101,0.00016577478,0.000027700708,0.0001750804,0.00004296118,0.006329412,0.0023583435,0.6924317,0.29822934,0.000018040793],"about_ca_topic_score_codex":0.0008829197,"about_ca_topic_score_gemma":0.0018187887,"teacher_disagreement_score":0.10113708,"about_ca_system_score_codex":0.0010924616,"about_ca_system_score_gemma":0.001213058,"threshold_uncertainty_score":0.33833718},"labels":[],"label_agreement":null},{"id":"W4246323230","doi":"10.1007/978-1-4939-2864-4_787","title":"Reducing Bayesian Mechanism Design to Algorithm Design","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Bayesian probability; Mechanism (biology); Computer science; Algorithm; Artificial intelligence; Physics","score_opus":0.07076634097219593,"score_gpt":0.32585678853177097,"score_spread":0.25509044755957505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246323230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009240887,0.0020371028,0.9799351,0.0007851567,0.00017780665,0.000048620986,0.00004032698,0.00014446564,0.015907386],"genre_scores_gemma":[0.106350146,0.008523925,0.854702,0.00087711343,0.0011611276,0.00058953173,0.00028673394,0.00032728905,0.027182132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587387,0.0022090734,0.00016679367,0.00038219086,0.0012445413,0.00012361928],"domain_scores_gemma":[0.9957073,0.0033069022,0.00013288653,0.0004922702,0.00029272493,0.00006783214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037454665,0.0011790763,0.0014603637,0.0008351639,0.00046099178,0.0031037882,0.0019387475,0.0021808667,0.008386558],"category_scores_gemma":[0.013288111,0.0009686315,0.0011492212,0.0015937035,0.0017787166,0.003269635,0.0024042227,0.0042090495,0.0024671613],"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.000034930297,0.00008393995,0.00012551132,0.00042730835,0.00006240607,0.00003624356,0.000108257176,0.047619723,0.00065126433,0.7385668,0.012884825,0.19939873],"study_design_scores_gemma":[0.000024734169,0.00002294294,0.000039336883,0.000082697414,0.000016177159,0.000040261857,0.00001105495,0.066855624,0.000377212,0.91627145,0.016247129,0.000011399477],"about_ca_topic_score_codex":0.0006630759,"about_ca_topic_score_gemma":0.00062227825,"teacher_disagreement_score":0.008386558,"about_ca_system_score_codex":0.0015619032,"about_ca_system_score_gemma":0.0021088677,"threshold_uncertainty_score":0.028055787},"labels":[],"label_agreement":null},{"id":"W4248103311","doi":"10.1007/978-1-4939-2864-4_286","title":"Peptide De Novo Sequencing with MS/MS","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Advanced Proteomics Techniques and Applications","field":"Chemistry","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; Western University","funders":"","keywords":"Computational biology; Chemistry; Biology","score_opus":0.01161642105683867,"score_gpt":0.24262562290718848,"score_spread":0.23100920185034982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248103311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006160945,0.026860418,0.8892905,0.00083382864,0.0016399929,0.00031582895,0.0057381373,0.014378182,0.054782227],"genre_scores_gemma":[0.023096127,0.02635769,0.84671074,0.0015856661,0.00057447865,0.00046433823,0.01504332,0.004161938,0.08200565],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999329,0.00005783787,0.000045694393,0.00022576215,0.0003119136,0.000029882212],"domain_scores_gemma":[0.99967,0.00010657446,0.000023263277,0.0000816753,0.00009862168,0.000019773586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097669,0.0016596462,0.0010130545,0.0016253407,0.00048385918,0.001910546,0.0019548796,0.0008930154,0.017040292],"category_scores_gemma":[0.0011503465,0.00081755954,0.000678993,0.0017250781,0.00039667747,0.002157651,0.0015843727,0.0017394818,0.03235175],"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.00019272779,0.00008397161,0.00019328902,0.0014573492,0.000108899825,0.00016859305,0.000060243925,0.0015221202,0.27439716,0.013069853,0.05872185,0.65002394],"study_design_scores_gemma":[0.000027090171,0.00009415626,0.0006062682,0.00020803089,0.00006477693,0.0017937113,0.00002619794,0.014300161,0.35037306,0.028466238,0.6039309,0.000109359615],"about_ca_topic_score_codex":0.00024141734,"about_ca_topic_score_gemma":0.0004969043,"teacher_disagreement_score":0.017040292,"about_ca_system_score_codex":0.0003555025,"about_ca_system_score_gemma":0.00063418195,"threshold_uncertainty_score":0.057005405},"labels":[],"label_agreement":null},{"id":"W4253490486","doi":"10.1007/978-0-387-30162-4_409","title":"Substring Parsimony","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Cocoa and Sweet Potato Agronomy","field":"Agricultural and Biological Sciences","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":"Substring; Computer science; Maximum parsimony; Biology; Programming language; Phylogenetics; Data structure; Genetics","score_opus":0.017654825907020992,"score_gpt":0.19490673126438052,"score_spread":0.17725190535735952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253490486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039928043,0.005417877,0.86478,0.0005584282,0.00064311735,0.00017954918,0.008681471,0.020929182,0.09481757],"genre_scores_gemma":[0.025579838,0.002567699,0.89633995,0.00032768882,0.00019516642,0.00033050688,0.016936336,0.0064798663,0.05124287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994837,0.00010969245,0.000036541827,0.00013788321,0.0002007048,0.000031381984],"domain_scores_gemma":[0.9991365,0.00042809357,0.000029055567,0.00025771788,0.00011852879,0.000030193796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066744647,0.0011748004,0.0013292042,0.002051214,0.0006901717,0.0019293921,0.001912633,0.0010795051,0.07790738],"category_scores_gemma":[0.0032714223,0.00082095317,0.0009926755,0.0032468198,0.0005538817,0.0021138168,0.0017258404,0.0016716699,0.048828334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008162533,0.00007413807,0.00046541786,0.0006450328,0.00008428662,0.00012701548,0.000102312384,0.010227499,0.0031119,0.051874794,0.15537511,0.77783084],"study_design_scores_gemma":[0.00006425173,0.00006559776,0.0009303151,0.0003197208,0.00008866062,0.00087319745,0.000082392275,0.11343526,0.008560965,0.318856,0.5566669,0.0000567606],"about_ca_topic_score_codex":0.0008746177,"about_ca_topic_score_gemma":0.0023762183,"teacher_disagreement_score":0.07790738,"about_ca_system_score_codex":0.00044395463,"about_ca_system_score_gemma":0.00083959795,"threshold_uncertainty_score":0.26062614},"labels":[],"label_agreement":null},{"id":"W4293568415","doi":"10.1007/978-3-642-27848-8_631-1","title":"Orthogonal Range Searching on Discrete Grids","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Range (aeronautics); Computer science; Computational science; Engineering; Aerospace engineering","score_opus":0.013828863155994233,"score_gpt":0.2463296812034269,"score_spread":0.23250081804743267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293568415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02378719,0.0025657772,0.92254597,0.0003224983,0.00024690607,0.000043990603,0.00018330327,0.00088096154,0.049423385],"genre_scores_gemma":[0.31029448,0.004515061,0.6460999,0.00020179695,0.00021160304,0.0001445441,0.0006898046,0.0004940781,0.037348654],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974316,0.000045933753,0.000014568657,0.000032468295,0.00013818375,0.000025722087],"domain_scores_gemma":[0.99970824,0.0001421476,0.000017840266,0.000073577525,0.000042148706,0.000015933847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017811023,0.000315399,0.0006211885,0.00059126015,0.00022739673,0.0007169716,0.00068223657,0.00031710372,0.007203684],"category_scores_gemma":[0.0012043151,0.00023705912,0.00020337578,0.0015906708,0.00052911066,0.0011434414,0.0015122073,0.0006943938,0.0015812289],"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.0001633061,0.000050444763,0.00031179245,0.00033033034,0.00001899008,0.00009422516,0.00012283595,0.10969149,0.010876014,0.29346594,0.019046485,0.56582814],"study_design_scores_gemma":[0.00005355929,0.000059345377,0.00023582211,0.00006105916,0.0000097804,0.00032708762,0.00007948168,0.7360143,0.00682302,0.21928889,0.037022896,0.000024852385],"about_ca_topic_score_codex":0.0006229865,"about_ca_topic_score_gemma":0.0005834461,"teacher_disagreement_score":0.007203684,"about_ca_system_score_codex":0.00028761593,"about_ca_system_score_gemma":0.0003090544,"threshold_uncertainty_score":0.024098754},"labels":[],"label_agreement":null},{"id":"W4299119775","doi":"10.1007/978-3-642-27848-8_628-1","title":"Intersections of Inverted Lists","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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","score_opus":0.012987725323710736,"score_gpt":0.23064366175689216,"score_spread":0.21765593643318143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299119775","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0290235,0.009317925,0.4500739,0.001388052,0.0012258427,0.00024931063,0.0045192325,0.005211847,0.49899045],"genre_scores_gemma":[0.25516894,0.011937174,0.42147306,0.0008111845,0.0016743563,0.0004960175,0.016479962,0.0028139094,0.28914544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866045,0.00012447815,0.00010487371,0.0002888595,0.0006891905,0.00013211237],"domain_scores_gemma":[0.9984597,0.00048153385,0.0001320494,0.00032003887,0.00052903953,0.00007768287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043446565,0.0007861051,0.0008375978,0.004710116,0.001903937,0.004764988,0.0017243762,0.0008817649,0.045243785],"category_scores_gemma":[0.0033949278,0.00085206155,0.00075319386,0.0065236455,0.0013355224,0.008216133,0.0028272578,0.0019887828,0.017464833],"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.000084163934,0.000037272548,0.00040957038,0.00030370458,0.000017462364,0.00015209934,0.00027605795,0.001666593,0.002227047,0.69021016,0.035339277,0.26927653],"study_design_scores_gemma":[0.000014398288,0.0000545604,0.00032572,0.00016293605,0.00002970525,0.00083924737,0.00024171661,0.008313049,0.00824019,0.67863333,0.30310297,0.00004219061],"about_ca_topic_score_codex":0.0007149047,"about_ca_topic_score_gemma":0.0009359969,"teacher_disagreement_score":0.045243785,"about_ca_system_score_codex":0.0011675956,"about_ca_system_score_gemma":0.0013389718,"threshold_uncertainty_score":0.1513555},"labels":[],"label_agreement":null},{"id":"W4299162314","doi":"10.1007/978-3-642-27848-8_56-2","title":"Broadcasting in Geometric Radio Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Wireless Communication Networks Research","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","funders":"","keywords":"Broadcasting (networking); Computer science; Radio networks; Telecommunications; Computer network; Wireless network; Wireless","score_opus":0.042238378221885906,"score_gpt":0.28163435874143533,"score_spread":0.2393959805195494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299162314","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012383836,0.058645405,0.31713104,0.0027317372,0.0024592201,0.00010018137,0.00023821216,0.00087184925,0.6054386],"genre_scores_gemma":[0.30688283,0.10694383,0.14275007,0.0016652568,0.00517678,0.0004117892,0.001101318,0.0006712434,0.43439686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997727,0.00006697442,0.0000063426282,0.000036603917,0.00009338904,0.000023901222],"domain_scores_gemma":[0.99981207,0.00010508259,0.0000146594175,0.000025332103,0.000029295234,0.000013579393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016877583,0.0007016179,0.00058998173,0.00084098714,0.00047362357,0.0014244126,0.0008341888,0.0007779103,0.010613099],"category_scores_gemma":[0.0008937973,0.00033988213,0.0002658341,0.0019291195,0.001293623,0.0015352367,0.00087119464,0.0013865901,0.0036096175],"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.00002051896,0.000018796925,0.000062834675,0.00026511945,0.000009882958,0.000048546077,0.00012230698,0.01710309,0.0012798735,0.8103946,0.03804301,0.13263138],"study_design_scores_gemma":[0.000016086933,0.000034215846,0.00017570323,0.00012477333,0.000016095542,0.00024648852,0.000080901096,0.030769745,0.0007334686,0.7230383,0.24474826,0.00001600279],"about_ca_topic_score_codex":0.00080963364,"about_ca_topic_score_gemma":0.0007197024,"teacher_disagreement_score":0.010613099,"about_ca_system_score_codex":0.0010634541,"about_ca_system_score_gemma":0.00050281145,"threshold_uncertainty_score":0.0355044},"labels":[],"label_agreement":null},{"id":"W4300422063","doi":"10.1007/978-3-642-27848-8_152-2","title":"Fully Dynamic Connectivity","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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","score_opus":0.015524780981067793,"score_gpt":0.2677711492939692,"score_spread":0.2522463683129014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300422063","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009613078,0.0056068604,0.4539721,0.0018801058,0.0010287599,0.00009850908,0.001621824,0.0012852099,0.5248936],"genre_scores_gemma":[0.36407587,0.018625714,0.19494227,0.0015296591,0.0018437352,0.00047165705,0.0057562436,0.0013435953,0.41141123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997967,0.000023383272,0.0000075014923,0.00007693177,0.000072366216,0.000023167762],"domain_scores_gemma":[0.9997117,0.000092614486,0.000019756088,0.00009537931,0.000055264834,0.0000251908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017114982,0.0005954232,0.0004275646,0.0007989446,0.0005012722,0.001557941,0.0007960287,0.0006432508,0.029191708],"category_scores_gemma":[0.0012645182,0.00033680955,0.000278185,0.0010073032,0.0007099119,0.0027719948,0.001376161,0.0013670856,0.007168641],"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.000028460016,0.000018710549,0.00013213439,0.00020097502,0.000019345252,0.00008054236,0.000075693,0.014620543,0.0027464435,0.7167948,0.06437535,0.20090704],"study_design_scores_gemma":[0.000009539097,0.000016237233,0.00024199163,0.000085845655,0.00001504267,0.00032270706,0.000032791697,0.03520935,0.0014628541,0.76731354,0.19527291,0.00001702011],"about_ca_topic_score_codex":0.0006595015,"about_ca_topic_score_gemma":0.0010193785,"teacher_disagreement_score":0.029191708,"about_ca_system_score_codex":0.0005371115,"about_ca_system_score_gemma":0.00043868826,"threshold_uncertainty_score":0.09765595},"labels":[],"label_agreement":null},{"id":"W4300704647","doi":"10.1007/978-3-642-27848-8_303-2","title":"Quantum Algorithms for Matrix Multiplication and Product Verification","year":2015,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Quantum Computing Algorithms and Architecture","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":"Matrix multiplication; Computer science; Algorithm; Product (mathematics); Quantum; Matrix (chemical analysis); Multiplication (music); Arithmetic; Mathematics; Physics; Quantum mechanics; Materials science; Combinatorics","score_opus":0.025699445372010243,"score_gpt":0.2769524869051991,"score_spread":0.25125304153318884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300704647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045808665,0.017158022,0.7781669,0.0028014965,0.0013825693,0.00016038826,0.00034663166,0.0014617507,0.19394135],"genre_scores_gemma":[0.2332109,0.02515137,0.56702334,0.0014655665,0.0029893564,0.0008023576,0.0012387354,0.0011956039,0.16692285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874735,0.00030720097,0.000060332623,0.00017841681,0.00060488953,0.000101761456],"domain_scores_gemma":[0.9992435,0.00038223225,0.0000357614,0.00019783282,0.00011621942,0.00002446678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008069747,0.001338089,0.001101619,0.0012455501,0.0011943011,0.003187667,0.0020382884,0.0016968214,0.023643019],"category_scores_gemma":[0.0028356994,0.0007370077,0.00083690573,0.0027782922,0.0030664983,0.0055465708,0.0023339463,0.003739477,0.0074541527],"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.0000147243145,0.000020228312,0.000031829066,0.00013451047,0.000009831208,0.0000126296145,0.00006125998,0.0025046354,0.0005162555,0.89596736,0.015285676,0.08544111],"study_design_scores_gemma":[0.000011232802,0.000009465717,0.000048796835,0.00005507602,0.0000047322246,0.000052449057,0.000015522051,0.012162763,0.00075713976,0.94587034,0.040999725,0.000012702481],"about_ca_topic_score_codex":0.0008386995,"about_ca_topic_score_gemma":0.0010962277,"teacher_disagreement_score":0.023643019,"about_ca_system_score_codex":0.0020949247,"about_ca_system_score_gemma":0.0015716794,"threshold_uncertainty_score":0.079093754},"labels":[],"label_agreement":null},{"id":"W4301905878","doi":"10.1007/978-3-642-27848-8_646-1","title":"Compressed Representations of Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Mathematics; Computer science; Combinatorics","score_opus":0.013866660270896551,"score_gpt":0.2479936810213288,"score_spread":0.23412702075043224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301905878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01615059,0.008754526,0.8779288,0.0020795665,0.0015997969,0.00017592136,0.0056096357,0.0055920654,0.08210906],"genre_scores_gemma":[0.22626688,0.017054552,0.60315245,0.0012154053,0.0017047361,0.00048333217,0.027855882,0.0026324585,0.11963429],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996233,0.00007401054,0.000018408857,0.000067604866,0.00018765182,0.000029029166],"domain_scores_gemma":[0.99938715,0.00018511685,0.00003031602,0.00025431436,0.00011778217,0.000025351152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021507221,0.00092156796,0.0006572351,0.0017294348,0.00031314977,0.0015725289,0.0011567908,0.00082626747,0.026041692],"category_scores_gemma":[0.0020680577,0.00040215807,0.0004391858,0.0026887986,0.0005533788,0.0022582158,0.0013712405,0.0015480741,0.0074968063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013945324,0.00006542827,0.000122036465,0.0004204065,0.000040169736,0.0001645008,0.00014084607,0.04460162,0.010566485,0.18660624,0.1141683,0.6429645],"study_design_scores_gemma":[0.00005777671,0.00009455127,0.000508127,0.0002571829,0.00004023318,0.0008788879,0.00016507256,0.30498636,0.01834552,0.46927857,0.20533112,0.000056530476],"about_ca_topic_score_codex":0.00093280035,"about_ca_topic_score_gemma":0.0014106662,"teacher_disagreement_score":0.026041692,"about_ca_system_score_codex":0.0005023724,"about_ca_system_score_gemma":0.00046973262,"threshold_uncertainty_score":0.08711815},"labels":[],"label_agreement":null},{"id":"W65034588","doi":"10.1007/978-1-4939-2864-4_628","title":"Intersections of Inverted Lists","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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","score_opus":0.013912597166559282,"score_gpt":0.2344966190011312,"score_spread":0.2205840218345719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65034588","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030399283,0.008885241,0.45933887,0.0014157767,0.0012495347,0.0002547885,0.0047943164,0.0053625833,0.48829958],"genre_scores_gemma":[0.2687132,0.011418675,0.41665706,0.0008323195,0.0017216909,0.0005008992,0.017511148,0.0029063458,0.27973866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985678,0.00013482224,0.000116192125,0.0003170017,0.0007241586,0.00014008791],"domain_scores_gemma":[0.998324,0.00052000023,0.0001483431,0.00035444656,0.0005679621,0.000085308624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046563853,0.0008021482,0.0008501674,0.0048433314,0.0019577136,0.0050326665,0.0017559981,0.0009210864,0.045626912],"category_scores_gemma":[0.003709799,0.0008672713,0.0007839301,0.006525429,0.0013923866,0.008572126,0.002988035,0.00203339,0.01795389],"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.000086506916,0.000037170088,0.0004230939,0.00030556787,0.000017828079,0.00015209579,0.00027421952,0.0016348565,0.002125642,0.7094122,0.033137046,0.25239375],"study_design_scores_gemma":[0.000014277296,0.000053570333,0.00030970573,0.00015741127,0.000029657509,0.0008025195,0.00023052367,0.008159302,0.0078573385,0.70582414,0.27652088,0.000040765506],"about_ca_topic_score_codex":0.00071075704,"about_ca_topic_score_gemma":0.00090301473,"teacher_disagreement_score":0.045626912,"about_ca_system_score_codex":0.0011708444,"about_ca_system_score_gemma":0.0014013255,"threshold_uncertainty_score":0.15263724},"labels":[],"label_agreement":null},{"id":"W745574","doi":"10.1007/978-1-4939-2864-4_534","title":"Analyzing Cache Behaviour in Multicore Architectures","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Optimization and Search Problems","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":"Cache; Multi-core processor; Computer science; Parallel computing; Computer architecture; Embedded system","score_opus":0.01548729466320558,"score_gpt":0.2563340607380659,"score_spread":0.24084676607486033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W745574","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6455922,0.017620608,0.3123993,0.0011324957,0.00021888808,0.00008785169,0.001266112,0.0030123289,0.01867017],"genre_scores_gemma":[0.8772094,0.0038427836,0.10656343,0.00015520616,0.00010055863,0.000087833425,0.0017570081,0.0008018491,0.009481886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939847,0.000114570976,0.000028747665,0.000094154486,0.00026824267,0.00009577593],"domain_scores_gemma":[0.9982686,0.001150513,0.00011080341,0.00020717077,0.00021269944,0.000050197712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662497,0.00064557575,0.0005375686,0.001084714,0.0004444488,0.0013143984,0.0012572705,0.00078649516,0.0023384264],"category_scores_gemma":[0.004892778,0.00047385498,0.00047133406,0.0022587315,0.00050734024,0.0019209782,0.0006483921,0.0009578477,0.00031307037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019507238,0.00018261085,0.015396036,0.00046319066,0.00015716538,0.00016269977,0.00031019992,0.74272406,0.015410442,0.020282455,0.008661744,0.19605426],"study_design_scores_gemma":[0.00000544599,0.000030153862,0.00222639,0.00003127908,0.000022542585,0.00005745761,0.00007661954,0.9747593,0.0039948905,0.017045913,0.0017385471,0.0000114471895],"about_ca_topic_score_codex":0.008156831,"about_ca_topic_score_gemma":0.013506768,"teacher_disagreement_score":0.008156831,"about_ca_system_score_codex":0.0010168212,"about_ca_system_score_gemma":0.0012437955,"threshold_uncertainty_score":0.016218722},"labels":[],"label_agreement":null},{"id":"W94197046","doi":"10.1007/978-1-4939-2864-4_646","title":"Compressed Representations of Graphs","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Algorithms and Data Compression","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":"Computer science","score_opus":0.01480105077713292,"score_gpt":0.2518319579986708,"score_spread":0.23703090722153788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94197046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016754638,0.008173979,0.87897843,0.002081779,0.0016155302,0.00017863513,0.0059354836,0.0055793044,0.08070221],"genre_scores_gemma":[0.24153304,0.016441647,0.58888036,0.0012265168,0.0017178088,0.00048700543,0.030063318,0.0026890403,0.11696134],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996094,0.00007726238,0.000019513685,0.000071033945,0.00019239236,0.00003030507],"domain_scores_gemma":[0.99936444,0.00018609235,0.000032266933,0.0002698438,0.00012042086,0.000026916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022317386,0.000942106,0.0006563932,0.001766469,0.0003116799,0.001668756,0.0011601803,0.0008564636,0.026379427],"category_scores_gemma":[0.002221566,0.0003996047,0.00044819913,0.0026638224,0.00056695135,0.002320431,0.0014508546,0.0015730386,0.0076817386],"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.00014999164,0.00006792604,0.00013361311,0.0004396416,0.000041923995,0.0001745684,0.00014964529,0.04670577,0.010653384,0.20157515,0.11214662,0.6277617],"study_design_scores_gemma":[0.000056580546,0.00009383116,0.00048388867,0.000252173,0.000040005652,0.0008483421,0.00016275838,0.3031604,0.017196694,0.48518702,0.19246398,0.000054397362],"about_ca_topic_score_codex":0.0009229023,"about_ca_topic_score_gemma":0.00138142,"teacher_disagreement_score":0.026379427,"about_ca_system_score_codex":0.00049723644,"about_ca_system_score_gemma":0.0004906193,"threshold_uncertainty_score":0.088248014},"labels":[],"label_agreement":null}]}