{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":32,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":32,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"08df8c589447","filters":{"venue":"Encyclopedia of Algorithms"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","authors":[{"name":"J. Ian Munro","is_ca":true},{"name":"Patrick K. Nicholson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01480105077713292,"gpt":0.2518319579986708,"spread":0.2370309072215379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002231739,0.000942106,0.0006563932,0.001766469,0.0003116799,0.001668756,0.00116018,0.0008564636,0.02637943],"category_scores_gemma":[0.002221566,0.0003996047,0.0004481991,0.002663822,0.0005669513,0.002320431,0.001450855,0.001573039,0.007681739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004972364,"about_ca_system_score_gemma":0.0004906193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009229023,"about_ca_topic_score_gemma":0.00138142,"domain_scores_codex":[0.9996094,0.00007726238,0.00001951369,0.00007103394,0.0001923924,0.00003030507],"domain_scores_gemma":[0.9993644,0.0001860924,0.00003226693,0.0002698438,0.0001204209,0.000026916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001499916,0.00006792604,0.0001336131,0.0004396416,0.000041924,0.0001745684,0.0001496453,0.04670577,0.01065338,0.2015751,0.1121466,0.6277617],"study_design_scores_gemma":[0.00005658055,0.00009383116,0.0004838887,0.000252173,0.00004000565,0.0008483421,0.0001627584,0.3031604,0.01719669,0.485187,0.192464,0.00005439736],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01675464,0.008173979,0.8789784,0.002081779,0.00161553,0.0001786351,0.005935484,0.005579304,0.08070221],"genre_scores_gemma":[0.241533,0.01644165,0.5888804,0.001226517,0.001717809,0.0004870054,0.03006332,0.00268904,0.1169613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02637943,"threshold_uncertainty_score":0.08824801,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Süleyman Cenk Şahinalp","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01426117440055015,"gpt":0.2400185813164199,"spread":0.2257574069158698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428614,0.0006068068,0.001217046,0.002495685,0.0008442478,0.002526952,0.001240491,0.001426115,0.009571289],"category_scores_gemma":[0.01019449,0.000377886,0.0006074448,0.003596522,0.001365136,0.007871785,0.002765244,0.0020426,0.003290517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007515642,"about_ca_system_score_gemma":0.0009212893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006132089,"about_ca_topic_score_gemma":0.000433917,"domain_scores_codex":[0.9973714,0.0005754712,0.0002515105,0.000604251,0.001041635,0.0001557519],"domain_scores_gemma":[0.9936521,0.00279481,0.0004542739,0.001850432,0.00101471,0.0002337262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001740425,0.00005970293,0.0003796024,0.0001373658,0.00003489219,0.000176368,0.0001954215,0.008103325,0.003583035,0.8355449,0.009877465,0.141734],"study_design_scores_gemma":[0.00002264998,0.0001419336,0.0004000701,0.00003216415,0.00002902767,0.000598371,0.00006215626,0.05968788,0.006951443,0.901226,0.03081517,0.00003314265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05163447,0.002697536,0.9073832,0.001618313,0.0008986799,0.00009562229,0.001434863,0.001069982,0.03316736],"genre_scores_gemma":[0.5828079,0.004703689,0.3261576,0.0009079045,0.002084131,0.0004508775,0.004340214,0.0009962473,0.07755148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009571289,"threshold_uncertainty_score":0.03201914,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Closure (psychology); Transitive relation; Computer science; Mathematics; Combinatorics; Political science","authors":[{"name":"Valerie King","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007245124310746306,"gpt":0.223361274430009,"spread":0.2161161501192627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007800987,0.0008918734,0.0008016262,0.001246603,0.001771166,0.004668352,0.001215956,0.0008178927,0.03589922],"category_scores_gemma":[0.002903192,0.0007192502,0.0009837146,0.001319154,0.002774285,0.009543137,0.003365288,0.002468881,0.01114833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001209238,"about_ca_system_score_gemma":0.001083023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008442356,"about_ca_topic_score_gemma":0.0009923739,"domain_scores_codex":[0.9984183,0.0002174725,0.0001254357,0.0004632586,0.00059563,0.0001798883],"domain_scores_gemma":[0.9987067,0.0003873098,0.0000773579,0.0005406301,0.0002217437,0.00006622574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001586154,0.00001403186,0.00004470224,0.00007017461,0.000005368053,0.00005383734,0.0002287115,0.0003825889,0.0007553798,0.9524982,0.01229091,0.03364017],"study_design_scores_gemma":[0.000006555711,0.000008389017,0.00004633574,0.00004271646,0.000007840257,0.0001911394,0.00008530408,0.001438854,0.001146669,0.8888013,0.1082132,0.00001169303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.01452095,0.002374532,0.33836,0.00152264,0.00103656,0.000163641,0.001948399,0.002105134,0.6379681],"genre_scores_gemma":[0.5041146,0.004944898,0.1693113,0.001147878,0.001079098,0.0004561489,0.006847274,0.003520749,0.3085782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03589922,"threshold_uncertainty_score":0.1200948,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Encoding (memory); Search engine indexing; Computer science; Information retrieval; Artificial intelligence","authors":[{"name":"Jérémy Barbay","is_ca":false},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01961642112949077,"gpt":0.2595110612893998,"spread":0.239894640159909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138707,0.0009696198,0.0009266956,0.001461795,0.00077422,0.002909146,0.001692384,0.001214909,0.01277062],"category_scores_gemma":[0.007211948,0.0005705872,0.0006053607,0.004421635,0.001203773,0.005231283,0.002274221,0.001962494,0.004685697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008648629,"about_ca_system_score_gemma":0.001406357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008801188,"about_ca_topic_score_gemma":0.001489108,"domain_scores_codex":[0.9988886,0.0003078486,0.0001268846,0.0001428861,0.0004595197,0.00007424849],"domain_scores_gemma":[0.9970048,0.001317216,0.0001601484,0.001026398,0.0004078856,0.00008363288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003840461,0.0001482352,0.0002299004,0.0004299021,0.00002278645,0.0001829797,0.0002828801,0.02385548,0.008291682,0.35562,0.03982612,0.5707259],"study_design_scores_gemma":[0.0001306984,0.0001309063,0.0001437789,0.0001867722,0.00003776881,0.0004899738,0.0001255655,0.1330082,0.0153685,0.7771818,0.07313085,0.00006526127],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01109506,0.002227826,0.9607731,0.001106682,0.0006342846,0.0001873368,0.001639916,0.003503267,0.01883255],"genre_scores_gemma":[0.1485316,0.003685728,0.8198861,0.0006434668,0.0005754522,0.0005197987,0.004448924,0.001149763,0.020559],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01277062,"threshold_uncertainty_score":0.04272199,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Transitive relation; Closure (psychology); Mathematics; Computer science; Combinatorics; Political science","authors":[{"name":"Valerie King","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009003476063443532,"gpt":0.2208613655850807,"spread":0.2118578895216371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175412,0.0008912856,0.0009112548,0.001271792,0.00199425,0.004518836,0.001285293,0.000854383,0.0356824],"category_scores_gemma":[0.002817139,0.0007981753,0.001097612,0.001414056,0.002814174,0.01034153,0.003365694,0.002487546,0.009988907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232455,"about_ca_system_score_gemma":0.00109034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000912382,"about_ca_topic_score_gemma":0.001056774,"domain_scores_codex":[0.9983652,0.0002255113,0.0001306053,0.0004826468,0.0005956512,0.0002003516],"domain_scores_gemma":[0.9985165,0.000428463,0.00008030791,0.0006508431,0.000251453,0.00007245057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001964141,0.00001750921,0.00005182152,0.00006641677,0.000006218739,0.00006078486,0.0002592542,0.0003849099,0.0008685261,0.952723,0.01244514,0.03309684],"study_design_scores_gemma":[0.000007701754,0.000009832561,0.0000524506,0.00003398659,0.000009572437,0.0002128003,0.00009640952,0.001598346,0.001431793,0.9008152,0.09571922,0.00001256936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.01682531,0.001746744,0.3785033,0.001424873,0.0008672573,0.0001926971,0.002082844,0.002506889,0.5958501],"genre_scores_gemma":[0.5065885,0.003450135,0.1858929,0.001026226,0.0008398225,0.0004777271,0.006566077,0.003206227,0.2919525],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.0356824,"threshold_uncertainty_score":0.1193696,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science","authors":[{"name":"Paola Flocchini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008348345353350049,"gpt":0.2254689951017301,"spread":0.2171206497483801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002386409,0.0007877418,0.0007726034,0.0003943319,0.000384984,0.001052693,0.001336275,0.0006713322,0.00283616],"category_scores_gemma":[0.001520909,0.0004489607,0.0005631335,0.0007766041,0.0008856264,0.002089725,0.001620289,0.0006520744,0.0007282294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004669253,"about_ca_system_score_gemma":0.0002371909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005944361,"about_ca_topic_score_gemma":0.0004129388,"domain_scores_codex":[0.9994482,0.0001507411,0.00002581948,0.0001528529,0.0001231027,0.00009923107],"domain_scores_gemma":[0.9992399,0.0003074015,0.0001472678,0.0002007429,0.00006199056,0.00004280476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008360086,0.00007925885,0.0008388438,0.0006602892,0.0001066708,0.0003871208,0.0003133351,0.3994675,0.04826527,0.3566095,0.008757948,0.1836784],"study_design_scores_gemma":[0.00006866178,0.0003664423,0.000678357,0.00006574586,0.00004983882,0.0006300154,0.000127597,0.7533848,0.02999722,0.1910431,0.02351738,0.00007081404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08027805,0.002362796,0.8955516,0.0001913491,0.0001407647,0.00004501707,0.0003124503,0.0006252067,0.02049278],"genre_scores_gemma":[0.8247289,0.003624855,0.1500766,0.0001250448,0.0001716466,0.0001343569,0.0003991447,0.0001561467,0.02058336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00283616,"threshold_uncertainty_score":0.009487927,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","authors":[{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Giri Narasimhan","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01276372950238561,"gpt":0.2277644876599408,"spread":0.2150007581575552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001511369,0.001010671,0.0006392566,0.001558878,0.0006755988,0.002140358,0.000940054,0.0005469535,0.1058073],"category_scores_gemma":[0.0004385308,0.0003790765,0.0004031851,0.00164748,0.000972214,0.002388538,0.002081165,0.001576249,0.0511917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004567452,"about_ca_system_score_gemma":0.0005021445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004112882,"about_ca_topic_score_gemma":0.0009482283,"domain_scores_codex":[0.999755,0.00001956024,0.00001114864,0.00006648721,0.0001268965,0.00002091052],"domain_scores_gemma":[0.9999007,0.00001586545,0.000005731919,0.00002837023,0.00003304001,0.00001626379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001949443,0.00002496762,0.0000766611,0.0002040017,0.000007969733,0.00006702723,0.0001715293,0.001839161,0.002370935,0.5358351,0.09563923,0.3637439],"study_design_scores_gemma":[0.000003834115,0.00002243624,0.000137138,0.0001018519,0.000005735452,0.000272958,0.00006519875,0.001491655,0.001159707,0.2076443,0.7890857,0.000009519654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002945157,0.005706999,0.09109542,0.0003733286,0.001487219,0.00006813546,0.0006210734,0.001193353,0.8965093],"genre_scores_gemma":[0.0409125,0.01007598,0.06049659,0.0004378071,0.000854913,0.0001411664,0.002643992,0.00138583,0.8830513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1058073,"threshold_uncertainty_score":0.3539606,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Computer science; Distributed computing","authors":[{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Giri Narasimhan","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008183999606666405,"gpt":0.2208145528534027,"spread":0.2126305532467363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003200617,0.0009491991,0.0005330998,0.00161793,0.0005227178,0.001651709,0.001116671,0.0009312202,0.01807972],"category_scores_gemma":[0.001084126,0.0003887871,0.000510246,0.002364697,0.0009405458,0.002303948,0.002098449,0.001422808,0.004167287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007818483,"about_ca_system_score_gemma":0.0004151432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005177009,"about_ca_topic_score_gemma":0.0007983609,"domain_scores_codex":[0.9996775,0.00006074236,0.00001501391,0.00006741686,0.0001541551,0.00002509173],"domain_scores_gemma":[0.9996752,0.0001388377,0.00002256278,0.00006459676,0.00006710873,0.00003181319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002139602,0.00002590798,0.0001530401,0.0002946269,0.000018872,0.00009853711,0.0001000637,0.01992774,0.002395475,0.739002,0.02157616,0.2163862],"study_design_scores_gemma":[0.000005669068,0.00002606418,0.0001804507,0.0001573184,0.00001220591,0.0004450522,0.00006457497,0.04009686,0.001487124,0.7409266,0.2165817,0.00001647347],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01098569,0.05261104,0.4540277,0.002122488,0.00266285,0.00009629581,0.0003821992,0.0008327976,0.476279],"genre_scores_gemma":[0.2463811,0.1302459,0.3627113,0.001165263,0.004763908,0.0003089596,0.001583264,0.0007788575,0.2520615],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01807972,"threshold_uncertainty_score":0.06048274,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Substring; String (physics); Computer science; Mathematics; Physics; Theoretical physics; Programming language; Data structure","authors":[{"name":"Lusheng Wang","is_ca":false},{"name":"Ming Li","is_ca":true},{"name":"Bin Ma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0129309171825568,"gpt":0.214215555415739,"spread":0.2012846382331822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122281,0.001254992,0.001851709,0.002492615,0.001041753,0.003282323,0.002277837,0.002245678,0.02479325],"category_scores_gemma":[0.005254074,0.0005409254,0.0008910461,0.008250393,0.0019238,0.006750103,0.002667313,0.003738642,0.01085592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211911,"about_ca_system_score_gemma":0.001175622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006065918,"about_ca_topic_score_gemma":0.0005530962,"domain_scores_codex":[0.9984231,0.0002550783,0.0001098119,0.0003138004,0.0008357337,0.00006240491],"domain_scores_gemma":[0.9988911,0.0005820722,0.00006975763,0.000255939,0.0001518205,0.00004931042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005319667,0.00006588216,0.00016225,0.0007520181,0.00003071898,0.0001163078,0.0001267209,0.0109526,0.0009040342,0.4305581,0.08531644,0.4709617],"study_design_scores_gemma":[0.00001464591,0.00002260065,0.0001186335,0.0001412734,0.00001355539,0.0004274793,0.00004676568,0.0143446,0.0006508386,0.884962,0.09924071,0.00001695494],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008845926,0.07164707,0.6206198,0.006121702,0.005136332,0.0001635789,0.001332995,0.001583956,0.2845487],"genre_scores_gemma":[0.1147681,0.0861453,0.5363491,0.001999326,0.00918587,0.0005371823,0.006574403,0.001583683,0.2428571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02479325,"threshold_uncertainty_score":0.08294165,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Geography; Computer science; Artificial intelligence","authors":[{"name":"Bhaskar DasGupta","is_ca":false},{"name":"Xin He","is_ca":false},{"name":"Ming Li","is_ca":true},{"name":"John Tromp","is_ca":false},{"name":"Louxin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01183536237195373,"gpt":0.2198466465612166,"spread":0.2080112841892629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205872,0.0007313103,0.001315849,0.00299335,0.001214206,0.003206898,0.002380059,0.0016502,0.009554674],"category_scores_gemma":[0.006567522,0.0003804387,0.0006931052,0.008530152,0.002018414,0.005468808,0.002276221,0.002395141,0.004731889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001448469,"about_ca_system_score_gemma":0.0008486531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001480373,"about_ca_topic_score_gemma":0.001457549,"domain_scores_codex":[0.9978916,0.0005223062,0.0001353199,0.0003726352,0.0009890267,0.00008902744],"domain_scores_gemma":[0.998792,0.0004904245,0.0001090713,0.0002555883,0.0003153236,0.00003766855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002128116,0.00002876497,0.0001639308,0.0003126429,0.00001688111,0.00008246511,0.0001632744,0.003819601,0.0003536329,0.7511264,0.02048848,0.2234228],"study_design_scores_gemma":[0.000006679771,0.0000234971,0.0002144959,0.0001758259,0.0000179907,0.0004860532,0.000133721,0.01463367,0.0005850201,0.8155591,0.1681367,0.00002727399],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005917746,0.06812359,0.6633696,0.001983116,0.004790034,0.0001632523,0.0006101538,0.000432069,0.2546104],"genre_scores_gemma":[0.1287899,0.08082681,0.6408452,0.001861529,0.004557079,0.000585502,0.002642513,0.0006756816,0.1392158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009554674,"threshold_uncertainty_score":0.03196359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Matching (statistics); Expression (computer science); Computer science; Computational biology; Mathematics; Biology; Programming language; Statistics","authors":[{"name":"Lucian Ilie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009862854529614681,"gpt":0.2215367229555709,"spread":0.2116738684259562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006473816,0.0009034162,0.0009360184,0.001900518,0.000736744,0.002205534,0.001741897,0.0008847555,0.06694527],"category_scores_gemma":[0.00236514,0.000567992,0.0009142086,0.003353025,0.0007329083,0.004100387,0.001950298,0.001437642,0.04924276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007591354,"about_ca_system_score_gemma":0.001055565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000949921,"about_ca_topic_score_gemma":0.001144044,"domain_scores_codex":[0.9989516,0.0001107125,0.00008631215,0.0002882287,0.0004877251,0.00007532279],"domain_scores_gemma":[0.9995158,0.0001231196,0.00002289165,0.0001927874,0.0001250156,0.00002050127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005518332,0.00007995763,0.0001349098,0.0002935323,0.00002206424,0.0000945182,0.0001153672,0.002072014,0.004534421,0.1690823,0.1031908,0.7203251],"study_design_scores_gemma":[0.00001505642,0.00003088675,0.0002416033,0.0001960929,0.00003415381,0.0006601304,0.00007945673,0.01439758,0.01361858,0.2896012,0.6810947,0.00003053437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.005039811,0.005575403,0.6733837,0.00140462,0.001066032,0.0003051906,0.003388789,0.01026337,0.2995732],"genre_scores_gemma":[0.05714658,0.008099866,0.4634806,0.00122708,0.0004934938,0.0003347803,0.01791021,0.004932409,0.446375],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.06694527,"threshold_uncertainty_score":0.2239543,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Transactional memory; Computer science; Database; Database transaction","authors":[{"name":"Nir Shavit","is_ca":true},{"name":"Alexander Matveev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02210301758359371,"gpt":0.2418736888112772,"spread":0.2197706712276835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003643081,0.001238758,0.0008733557,0.001472659,0.0007227048,0.003860254,0.001753469,0.0008881455,0.1036463],"category_scores_gemma":[0.001177129,0.0005850075,0.0004215174,0.003773409,0.0006806328,0.004355789,0.001418592,0.001748991,0.07059478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005822071,"about_ca_system_score_gemma":0.0009622992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006300488,"about_ca_topic_score_gemma":0.001127921,"domain_scores_codex":[0.9996161,0.00003469748,0.00003235022,0.00008380476,0.0002000518,0.00003294623],"domain_scores_gemma":[0.9995388,0.0001032623,0.00002381057,0.0001473203,0.0001506333,0.00003622399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005089934,0.00004561125,0.00009813135,0.0006530505,0.00002207662,0.00006714191,0.0001701572,0.0009569309,0.004055686,0.1052887,0.2656612,0.6229305],"study_design_scores_gemma":[0.000008013308,0.00002275999,0.0001145744,0.0002040594,0.00001374518,0.0002664863,0.00003226989,0.001235345,0.001576101,0.03851253,0.9579995,0.00001458751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"review","genre_scores_codex":[0.002498974,0.1022155,0.1825273,0.002328687,0.005694869,0.0002313817,0.00251691,0.006787305,0.6951991],"genre_scores_gemma":[0.02182366,0.04123757,0.05584906,0.001415538,0.001853775,0.0002161107,0.004304041,0.001720535,0.8715796],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.1036463,"threshold_uncertainty_score":0.3467314,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Quantum; Computer science; Quantum mechanics; Physics; Machine learning","authors":[{"name":"Ashwin Nayak","is_ca":true},{"name":"Peter C. Richter","is_ca":true},{"name":"Márió Szegedy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009786744468596042,"gpt":0.2224366937681339,"spread":0.2126499492995378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008595769,0.0005387674,0.0007924504,0.001319943,0.001168666,0.002944043,0.0008356598,0.001404401,0.01604607],"category_scores_gemma":[0.00389128,0.0004718609,0.0007596271,0.001004023,0.003984787,0.003504333,0.001453996,0.002854194,0.001590256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001618672,"about_ca_system_score_gemma":0.001122482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001097895,"about_ca_topic_score_gemma":0.0008721091,"domain_scores_codex":[0.9992297,0.0002650753,0.00003600696,0.0001358614,0.0002323276,0.000101109],"domain_scores_gemma":[0.9984464,0.0007716892,0.0001593697,0.0002550684,0.0002297446,0.0001377282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002378811,0.000003001123,0.000007335771,0.000007647793,9.24384e-7,0.000004270943,0.00001685499,0.0004361558,0.00005244892,0.9980604,0.0004436885,0.0009648867],"study_design_scores_gemma":[0.000003063337,0.000003050632,0.00002405635,0.000008251565,8.756568e-7,0.00001113128,0.000006563357,0.00308705,0.00003968874,0.9935827,0.00323012,0.000003386775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.05667482,0.009533961,0.2791243,0.00465336,0.002456592,0.0001092847,0.0006125774,0.0003931453,0.6464419],"genre_scores_gemma":[0.8144966,0.008684914,0.05503441,0.001507268,0.003798107,0.0002551026,0.0005743394,0.0003749518,0.1152743],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01604607,"threshold_uncertainty_score":0.05367947,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Algorithm","authors":[{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02655674190309722,"gpt":0.2609203849088435,"spread":0.2343636430057462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01223277,0.002984179,0.002737787,0.004292773,0.0009122386,0.007097766,0.003655457,0.00388294,0.009084582],"category_scores_gemma":[0.04692836,0.0005872068,0.001209855,0.008543062,0.005017832,0.01286001,0.003102605,0.005415649,0.002387017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003454508,"about_ca_system_score_gemma":0.001319175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00063624,"about_ca_topic_score_gemma":0.0003822721,"domain_scores_codex":[0.9849249,0.009127934,0.000605144,0.001249587,0.003450625,0.0006418866],"domain_scores_gemma":[0.9618272,0.03076755,0.001403044,0.002887496,0.002574652,0.0005400305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001060613,0.00008288002,0.000305702,0.0003776611,0.0000514756,0.00002460901,0.00008287258,0.0278213,0.0002883105,0.8646908,0.007143662,0.09902464],"study_design_scores_gemma":[0.00001782983,0.00008791512,0.0003197374,0.0002018937,0.00003538453,0.00006202141,0.00005743241,0.1220357,0.0005008617,0.8675527,0.009096852,0.00003173186],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009093663,0.03607633,0.9010896,0.003026582,0.00140338,0.00007177229,0.0002622859,0.0004282569,0.04854812],"genre_scores_gemma":[0.5094396,0.03180398,0.417747,0.001543318,0.007904947,0.0006331153,0.0008588208,0.001021474,0.02904773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01223277,"threshold_uncertainty_score":0.06469381,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","authors":[{"name":"Andrew W. Kane","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01391259716655928,"gpt":0.2344966190011312,"spread":0.2205840218345719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004656385,0.0008021482,0.0008501674,0.004843331,0.001957714,0.005032666,0.001755998,0.0009210864,0.04562691],"category_scores_gemma":[0.003709799,0.0008672713,0.0007839301,0.006525429,0.001392387,0.008572126,0.002988035,0.00203339,0.01795389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170844,"about_ca_system_score_gemma":0.001401325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000710757,"about_ca_topic_score_gemma":0.0009030147,"domain_scores_codex":[0.9985678,0.0001348222,0.0001161921,0.0003170017,0.0007241586,0.0001400879],"domain_scores_gemma":[0.998324,0.0005200002,0.0001483431,0.0003544466,0.0005679621,0.00008530862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008650692,0.00003717009,0.0004230939,0.0003055679,0.00001782808,0.0001520958,0.0002742195,0.001634856,0.002125642,0.7094122,0.03313705,0.2523938],"study_design_scores_gemma":[0.0000142773,0.00005357033,0.0003097057,0.0001574113,0.00002965751,0.0008025195,0.0002305237,0.008159302,0.007857339,0.7058241,0.2765209,0.00004076551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.03039928,0.008885241,0.4593389,0.001415777,0.001249535,0.0002547885,0.004794316,0.005362583,0.4882996],"genre_scores_gemma":[0.2687132,0.01141868,0.4166571,0.0008323195,0.001721691,0.0005008992,0.01751115,0.002906346,0.2797387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04562691,"threshold_uncertainty_score":0.1526372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","authors":[{"name":"Eric Blais","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01527830851210519,"gpt":0.2099358348545564,"spread":0.1946575263424513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007257596,0.001962283,0.001715407,0.002347233,0.001464371,0.00510911,0.005079574,0.00331366,0.01049737],"category_scores_gemma":[0.08491667,0.001033493,0.003297962,0.002540706,0.00588737,0.0162178,0.00412694,0.005423747,0.001279174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230504,"about_ca_system_score_gemma":0.002986186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001238652,"about_ca_topic_score_gemma":0.001859379,"domain_scores_codex":[0.9863993,0.00387333,0.001105325,0.003221671,0.004156027,0.001244327],"domain_scores_gemma":[0.8585399,0.1251354,0.003645505,0.007960568,0.003522237,0.001196384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003614154,0.001317197,0.02933079,0.002192038,0.0006486551,0.0009699069,0.0008768071,0.08296921,0.01100529,0.5929701,0.02542572,0.2486801],"study_design_scores_gemma":[0.0001765723,0.0002036289,0.001049614,0.0001514968,0.0001237162,0.0003783493,0.0002243171,0.1167945,0.005480151,0.8730602,0.002315938,0.00004148402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4614586,0.00444133,0.4575636,0.01042867,0.001356931,0.0004247538,0.005103942,0.005254545,0.05396774],"genre_scores_gemma":[0.9018371,0.001080844,0.08343166,0.001346962,0.0008303219,0.0002671756,0.004735212,0.0008049349,0.005665882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01049737,"threshold_uncertainty_score":0.03838229,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Robin Kothari","is_ca":true},{"name":"Ashwin Nayak","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02569944537201024,"gpt":0.2769524869051991,"spread":0.2512530415331888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008069747,0.001338089,0.001101619,0.00124555,0.001194301,0.003187667,0.002038288,0.001696821,0.02364302],"category_scores_gemma":[0.002835699,0.0007370077,0.0008369057,0.002778292,0.003066498,0.005546571,0.002333946,0.003739477,0.007454153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094925,"about_ca_system_score_gemma":0.001571679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008386995,"about_ca_topic_score_gemma":0.001096228,"domain_scores_codex":[0.9987473,0.000307201,0.00006033262,0.0001784168,0.0006048895,0.0001017615],"domain_scores_gemma":[0.9992435,0.0003822322,0.0000357614,0.0001978328,0.0001162194,0.00002446678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001472431,0.00002022831,0.00003182907,0.0001345105,0.000009831208,0.00001262961,0.00006125998,0.002504635,0.0005162555,0.8959674,0.01528568,0.08544111],"study_design_scores_gemma":[0.0000112328,0.000009465717,0.00004879684,0.00005507602,0.000004732225,0.00005244906,0.00001552205,0.01216276,0.0007571398,0.9458703,0.04099973,0.00001270248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004580867,0.01715802,0.7781669,0.002801497,0.001382569,0.0001603883,0.0003466317,0.001461751,0.1939414],"genre_scores_gemma":[0.2332109,0.02515137,0.5670233,0.001465566,0.002989356,0.0008023576,0.001238735,0.001195604,0.1669229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02364302,"threshold_uncertainty_score":0.07909375,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Substring; Computer science; Maximum parsimony; Biology; Programming language; Phylogenetics; Data structure; Genetics","authors":[{"name":"Mathieu Blanchette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01765482590702099,"gpt":0.1949067312643805,"spread":0.1772519053573595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006674465,0.0011748,0.001329204,0.002051214,0.0006901717,0.001929392,0.001912633,0.001079505,0.07790738],"category_scores_gemma":[0.003271422,0.0008209532,0.0009926755,0.00324682,0.0005538817,0.002113817,0.00172584,0.00167167,0.04882833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004439546,"about_ca_system_score_gemma":0.000839598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008746177,"about_ca_topic_score_gemma":0.002376218,"domain_scores_codex":[0.9994837,0.0001096925,0.00003654183,0.0001378832,0.0002007048,0.00003138198],"domain_scores_gemma":[0.9991365,0.0004280936,0.00002905557,0.0002577179,0.0001185288,0.0000301938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008162533,0.00007413807,0.0004654179,0.0006450328,0.00008428662,0.0001270155,0.0001023124,0.0102275,0.0031119,0.05187479,0.1553751,0.7778308],"study_design_scores_gemma":[0.00006425173,0.00006559776,0.0009303151,0.0003197208,0.00008866062,0.0008731975,0.00008239227,0.1134353,0.008560965,0.318856,0.5566669,0.0000567606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003992804,0.005417877,0.86478,0.0005584282,0.0006431174,0.0001795492,0.008681471,0.02092918,0.09481757],"genre_scores_gemma":[0.02557984,0.002567699,0.89634,0.0003276888,0.0001951664,0.0003305069,0.01693634,0.006479866,0.05124287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07790738,"threshold_uncertainty_score":0.2606261,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Range (aeronautics); Computer science; Computational science; Engineering; Aerospace engineering","authors":[{"name":"Yakov Nekrich","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01382886315599423,"gpt":0.2463296812034269,"spread":0.2325008180474327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001781102,0.000315399,0.0006211885,0.0005912601,0.0002273967,0.0007169716,0.0006822366,0.0003171037,0.007203684],"category_scores_gemma":[0.001204315,0.0002370591,0.0002033758,0.001590671,0.0005291107,0.001143441,0.001512207,0.0006943938,0.001581229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002876159,"about_ca_system_score_gemma":0.0003090544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006229865,"about_ca_topic_score_gemma":0.0005834461,"domain_scores_codex":[0.9997432,0.00004593375,0.00001456866,0.0000324683,0.0001381838,0.00002572209],"domain_scores_gemma":[0.9997082,0.0001421476,0.00001784027,0.00007357752,0.00004214871,0.00001593385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001633061,0.00005044476,0.0003117924,0.0003303303,0.00001899008,0.00009422516,0.0001228359,0.1096915,0.01087601,0.2934659,0.01904649,0.5658281],"study_design_scores_gemma":[0.00005355929,0.00005934538,0.0002358221,0.00006105916,0.0000097804,0.0003270876,0.00007948168,0.7360143,0.00682302,0.2192889,0.0370229,0.00002485238],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02378719,0.002565777,0.922546,0.0003224983,0.0002469061,0.0000439906,0.0001833033,0.0008809615,0.04942339],"genre_scores_gemma":[0.3102945,0.004515061,0.6460999,0.000201797,0.000211603,0.0001445441,0.0006898046,0.0004940781,0.03734865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007203684,"threshold_uncertainty_score":0.02409875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec","funders":"","keywords":"Broadcasting (networking); Computer science; Radio networks; Telecommunications; Computer network; Wireless network; Wireless","authors":[{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04223837822188591,"gpt":0.2816343587414353,"spread":0.2393959805195494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001687758,0.0007016179,0.0005899817,0.0008409871,0.0004736236,0.001424413,0.0008341888,0.0007779103,0.0106131],"category_scores_gemma":[0.0008937973,0.0003398821,0.0002658341,0.001929119,0.001293623,0.001535237,0.0008711946,0.00138659,0.003609617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001063454,"about_ca_system_score_gemma":0.0005028115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008096336,"about_ca_topic_score_gemma":0.0007197024,"domain_scores_codex":[0.9997727,0.00006697442,0.000006342628,0.00003660392,0.00009338904,0.00002390122],"domain_scores_gemma":[0.9998121,0.0001050826,0.00001465942,0.0000253321,0.00002929523,0.00001357939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002051896,0.00001879693,0.00006283468,0.0002651195,0.000009882958,0.00004854608,0.000122307,0.01710309,0.001279874,0.8103946,0.03804301,0.1326314],"study_design_scores_gemma":[0.00001608693,0.00003421585,0.0001757032,0.0001247733,0.00001609554,0.0002464885,0.0000809011,0.03076974,0.0007334686,0.7230383,0.2447483,0.00001600279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.01238384,0.0586454,0.317131,0.002731737,0.00245922,0.0001001814,0.0002382122,0.0008718492,0.6054386],"genre_scores_gemma":[0.3068828,0.1069438,0.1427501,0.001665257,0.00517678,0.0004117892,0.001101318,0.0006712434,0.4343969],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.0106131,"threshold_uncertainty_score":0.0355044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Planar; Computer science; Computer graphics (images)","authors":[{"name":"Joachim Gudmundsson","is_ca":false},{"name":"Giri Narasimhan","is_ca":false},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01321160507583427,"gpt":0.2261636170528436,"spread":0.2129520119770094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001043115,0.0009301268,0.0005378208,0.0011915,0.0005137427,0.001339984,0.0008305962,0.0004771006,0.06054517],"category_scores_gemma":[0.0003031742,0.0003665766,0.0003410565,0.001289911,0.0007663629,0.001701103,0.001958861,0.001298432,0.02267896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003269416,"about_ca_system_score_gemma":0.0003772835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002602155,"about_ca_topic_score_gemma":0.0005862712,"domain_scores_codex":[0.9997972,0.00001455692,0.000008029125,0.00004992536,0.0001106202,0.00001976268],"domain_scores_gemma":[0.999933,0.0000102147,0.000005660851,0.00001875642,0.00002085577,0.0000115029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002728274,0.00003161228,0.00009565922,0.0002220685,0.00001099228,0.00008883063,0.0001407064,0.005494263,0.006280249,0.5710124,0.05189092,0.3647051],"study_design_scores_gemma":[0.000008970765,0.00005915874,0.0002641271,0.0001125187,0.00001125512,0.0005283382,0.0001153589,0.006592555,0.004371437,0.3807287,0.6071885,0.00001909951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.009746955,0.003779522,0.1655426,0.0002967925,0.000991139,0.00008791379,0.0006441145,0.001191042,0.8177199],"genre_scores_gemma":[0.1241981,0.009702612,0.1107866,0.0003990568,0.0007206358,0.0001872987,0.0031622,0.001316673,0.7495268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.06054517,"threshold_uncertainty_score":0.2025438,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Inference; Computer science; Artificial intelligence","authors":[{"name":"Sandra Zilles","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01542445246030213,"gpt":0.2490726583235104,"spread":0.2336482058632082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619731,0.001077742,0.0009523578,0.002120896,0.001236644,0.002920516,0.003319893,0.001156964,0.1011371],"category_scores_gemma":[0.005187902,0.000858728,0.001585087,0.001675827,0.00185838,0.004824515,0.003042701,0.003391451,0.05455716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001092462,"about_ca_system_score_gemma":0.001213058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008829197,"about_ca_topic_score_gemma":0.001818789,"domain_scores_codex":[0.9985423,0.000379029,0.00007632643,0.0003825974,0.0005388645,0.00008085978],"domain_scores_gemma":[0.9981686,0.0009910861,0.00004141665,0.0005132374,0.0002427279,0.00004289803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002779199,0.00005789448,0.0003031568,0.0004055516,0.000043674,0.0000643122,0.0001608071,0.001525672,0.0009455211,0.5986593,0.09727625,0.30053],"study_design_scores_gemma":[0.00001290987,0.000009423217,0.0001993101,0.0001657748,0.00002770071,0.0001750804,0.00004296118,0.006329412,0.002358343,0.6924317,0.2982293,0.00001804079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008452468,0.002457611,0.6969149,0.001798179,0.0006602335,0.0001524023,0.001700451,0.003283943,0.2921869],"genre_scores_gemma":[0.06326502,0.006358203,0.6034265,0.00291748,0.001687195,0.0006574987,0.01008394,0.002443706,0.3091604],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1011371,"threshold_uncertainty_score":0.3383372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Bayesian probability; Mechanism (biology); Computer science; Algorithm; Artificial intelligence; Physics","authors":[{"name":"Yang Cai","is_ca":true},{"name":"Constantinos Daskalakis","is_ca":false},{"name":"S. Matthew Weinberg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07076634097219593,"gpt":0.325856788531771,"spread":0.2550904475595751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003745466,0.001179076,0.001460364,0.0008351639,0.0004609918,0.003103788,0.001938747,0.002180867,0.008386558],"category_scores_gemma":[0.01328811,0.0009686315,0.001149221,0.001593704,0.001778717,0.003269635,0.002404223,0.00420905,0.002467161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001561903,"about_ca_system_score_gemma":0.002108868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006630759,"about_ca_topic_score_gemma":0.0006222783,"domain_scores_codex":[0.9958739,0.002209073,0.0001667937,0.0003821909,0.001244541,0.0001236193],"domain_scores_gemma":[0.9957073,0.003306902,0.0001328865,0.0004922702,0.0002927249,0.00006783214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000349303,0.00008393995,0.0001255113,0.0004273083,0.00006240607,0.00003624356,0.0001082572,0.04761972,0.0006512643,0.7385668,0.01288482,0.1993987],"study_design_scores_gemma":[0.00002473417,0.00002294294,0.00003933688,0.00008269741,0.00001617716,0.00004026186,0.00001105495,0.06685562,0.000377212,0.9162714,0.01624713,0.00001139948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009240887,0.002037103,0.9799351,0.0007851567,0.0001778067,0.00004862099,0.00004032698,0.0001444656,0.01590739],"genre_scores_gemma":[0.1063501,0.008523925,0.854702,0.0008771134,0.001161128,0.0005895317,0.0002867339,0.000327289,0.02718213],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008386558,"threshold_uncertainty_score":0.02805579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Computational biology; Chemistry; Biology","authors":[{"name":"Bin Ma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01161642105683867,"gpt":0.2426256229071885,"spread":0.2310092018503498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097669,0.001659646,0.001013055,0.001625341,0.0004838592,0.001910546,0.00195488,0.0008930154,0.01704029],"category_scores_gemma":[0.001150346,0.0008175595,0.000678993,0.001725078,0.0003966775,0.002157651,0.001584373,0.001739482,0.03235175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003555025,"about_ca_system_score_gemma":0.000634182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002414173,"about_ca_topic_score_gemma":0.0004969043,"domain_scores_codex":[0.999329,0.00005783787,0.00004569439,0.0002257622,0.0003119136,0.00002988221],"domain_scores_gemma":[0.99967,0.0001065745,0.00002326328,0.0000816753,0.00009862168,0.00001977359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001927278,0.00008397161,0.000193289,0.001457349,0.0001088998,0.000168593,0.00006024392,0.00152212,0.2743972,0.01306985,0.05872185,0.6500239],"study_design_scores_gemma":[0.00002709017,0.00009415626,0.0006062682,0.0002080309,0.00006477693,0.001793711,0.00002619794,0.01430016,0.3503731,0.02846624,0.6039309,0.0001093596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006160945,0.02686042,0.8892905,0.0008338286,0.001639993,0.0003158289,0.005738137,0.01437818,0.05478223],"genre_scores_gemma":[0.02309613,0.02635769,0.8467107,0.001585666,0.0005744786,0.0004643382,0.01504332,0.004161938,0.08200565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01704029,"threshold_uncertainty_score":0.05700541,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Multi-core processor; Computer science; Parallel computing; Computer architecture; Embedded system","authors":[{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Alejandro Salinger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01548729466320558,"gpt":0.2563340607380659,"spread":0.2408467660748603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662497,0.0006455758,0.0005375686,0.001084714,0.0004444488,0.001314398,0.00125727,0.0007864952,0.002338426],"category_scores_gemma":[0.004892778,0.000473855,0.0004713341,0.002258732,0.0005073402,0.001920978,0.0006483921,0.0009578477,0.0003130704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016821,"about_ca_system_score_gemma":0.001243796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008156831,"about_ca_topic_score_gemma":0.01350677,"domain_scores_codex":[0.9993985,0.000114571,0.00002874767,0.00009415449,0.0002682427,0.00009577593],"domain_scores_gemma":[0.9982686,0.001150513,0.0001108034,0.0002071708,0.0002126994,0.00005019771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001950724,0.0001826108,0.01539604,0.0004631907,0.0001571654,0.0001626998,0.0003101999,0.7427241,0.01541044,0.02028245,0.008661744,0.1960543],"study_design_scores_gemma":[0.00000544599,0.00003015386,0.00222639,0.00003127908,0.00002254258,0.00005745761,0.00007661954,0.9747593,0.00399489,0.01704591,0.001738547,0.00001144719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6455922,0.01762061,0.3123993,0.001132496,0.0002188881,0.00008785169,0.001266112,0.003012329,0.01867017],"genre_scores_gemma":[0.8772094,0.003842784,0.1065634,0.0001552062,0.0001005586,0.00008783342,0.001757008,0.0008018491,0.009481886],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.008156831,"threshold_uncertainty_score":0.01621872,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lusheng Wang","is_ca":false},{"name":"Ming Li","is_ca":true},{"name":"Bin Ma","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01393923514751617,"gpt":0.2182260767107492,"spread":0.204286841563233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007594871,0.001297695,0.001889523,0.002513019,0.001072619,0.00353752,0.002309525,0.00240384,0.0258719],"category_scores_gemma":[0.005774557,0.0005441072,0.0009209807,0.00808962,0.002014769,0.007159673,0.002913916,0.003890783,0.01130531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214796,"about_ca_system_score_gemma":0.001251909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005951546,"about_ca_topic_score_gemma":0.0005327257,"domain_scores_codex":[0.9983334,0.0002706308,0.0001185584,0.0003410641,0.0008717301,0.00006459114],"domain_scores_gemma":[0.9988494,0.000597022,0.00007540744,0.0002747688,0.0001504207,0.00005306083],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005585658,0.00006493154,0.000167484,0.0007756298,0.00003165274,0.0001176668,0.0001320526,0.01094691,0.0008597259,0.4641339,0.08117647,0.4415376],"study_design_scores_gemma":[0.00001329055,0.00002002813,0.0001008533,0.0001268881,0.00001260221,0.0003744699,0.00004275758,0.01311712,0.0005445424,0.9007297,0.08490294,0.00001480885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00910053,0.06667147,0.6234804,0.006317574,0.005191707,0.0001611319,0.001382834,0.001561916,0.2861325],"genre_scores_gemma":[0.1219053,0.08396705,0.5292763,0.002055428,0.009490544,0.0005346463,0.007013054,0.001668683,0.244089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0258719,"threshold_uncertainty_score":0.08655012,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","authors":[{"name":"Andrew W. Kane","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01298772532371074,"gpt":0.2306436617568922,"spread":0.2176559364331814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344656,0.0007861051,0.0008375978,0.004710116,0.001903937,0.004764988,0.001724376,0.0008817649,0.04524378],"category_scores_gemma":[0.003394928,0.0008520616,0.0007531939,0.006523645,0.001335522,0.008216133,0.002827258,0.001988783,0.01746483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001167596,"about_ca_system_score_gemma":0.001338972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007149047,"about_ca_topic_score_gemma":0.0009359969,"domain_scores_codex":[0.9986604,0.0001244781,0.0001048737,0.0002888595,0.0006891905,0.0001321124],"domain_scores_gemma":[0.9984597,0.0004815338,0.0001320494,0.0003200389,0.0005290395,0.00007768287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008416393,0.00003727255,0.0004095704,0.0003037046,0.00001746236,0.0001520993,0.000276058,0.001666593,0.002227047,0.6902102,0.03533928,0.2692765],"study_design_scores_gemma":[0.00001439829,0.0000545604,0.00032572,0.000162936,0.00002970525,0.0008392474,0.0002417166,0.008313049,0.00824019,0.6786333,0.303103,0.00004219061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0290235,0.009317925,0.4500739,0.001388052,0.001225843,0.0002493106,0.004519233,0.005211847,0.4989904],"genre_scores_gemma":[0.2551689,0.01193717,0.4214731,0.0008111845,0.001674356,0.0004960175,0.01647996,0.002813909,0.2891454],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.04524378,"threshold_uncertainty_score":0.1513555,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","authors":[{"name":"Andrew Kennings","is_ca":true},{"name":"Igor L. Markov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01549660837969183,"gpt":0.2032974256714188,"spread":0.187800817291727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001267624,0.001327087,0.0006077798,0.001409049,0.000564847,0.001309004,0.001423588,0.0007493382,0.1258225],"category_scores_gemma":[0.0003958591,0.0005260236,0.0004818316,0.001779013,0.0003049608,0.0009599746,0.0008715176,0.0009043072,0.08421862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004637398,"about_ca_system_score_gemma":0.00077298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005126289,"about_ca_topic_score_gemma":0.001713648,"domain_scores_codex":[0.9997863,0.0000137594,0.000008706641,0.00004701786,0.0001257617,0.00001850638],"domain_scores_gemma":[0.9998512,0.00001957713,0.000006677536,0.00005234038,0.00005835796,0.00001174678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003992517,0.00004075505,0.00007847638,0.0003983901,0.00001726392,0.0001146029,0.00003612192,0.005945728,0.01037068,0.03605426,0.1437104,0.8031934],"study_design_scores_gemma":[0.00002652206,0.0001025745,0.0002366531,0.0001587779,0.00002603962,0.001022195,0.00003286999,0.01304752,0.01370984,0.04501376,0.9266003,0.00002300387],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002341898,0.008035131,0.3903118,0.000597843,0.001841133,0.0002657754,0.001121143,0.008029275,0.5874559],"genre_scores_gemma":[0.03992701,0.01040801,0.3292743,0.0007242792,0.0006524453,0.0002605197,0.003683104,0.001425024,0.6136454],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1258225,"threshold_uncertainty_score":0.4209182,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science; Combinatorics","authors":[{"name":"J. Ian Munro","is_ca":true},{"name":"Patrick K. Nicholson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01386666027089655,"gpt":0.2479936810213288,"spread":0.2341270207504322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002150722,0.000921568,0.0006572351,0.001729435,0.0003131498,0.001572529,0.001156791,0.0008262675,0.02604169],"category_scores_gemma":[0.002068058,0.0004021581,0.0004391858,0.002688799,0.0005533788,0.002258216,0.00137124,0.001548074,0.007496806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005023724,"about_ca_system_score_gemma":0.0004697326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009328004,"about_ca_topic_score_gemma":0.001410666,"domain_scores_codex":[0.9996233,0.00007401054,0.00001840886,0.00006760487,0.0001876518,0.00002902917],"domain_scores_gemma":[0.9993871,0.0001851168,0.00003031602,0.0002543144,0.0001177822,0.00002535115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001394532,0.00006542827,0.0001220365,0.0004204065,0.00004016974,0.0001645008,0.0001408461,0.04460162,0.01056649,0.1866062,0.1141683,0.6429645],"study_design_scores_gemma":[0.00005777671,0.00009455127,0.000508127,0.0002571829,0.00004023318,0.0008788879,0.0001650726,0.3049864,0.01834552,0.4692786,0.2053311,0.00005653048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01615059,0.008754526,0.8779288,0.002079566,0.001599797,0.0001759214,0.005609636,0.005592065,0.08210906],"genre_scores_gemma":[0.2262669,0.01705455,0.6031525,0.001215405,0.001704736,0.0004833322,0.02785588,0.002632458,0.1196343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02604169,"threshold_uncertainty_score":0.08711815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","authors":[{"name":"Valerie King","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01552478098106779,"gpt":0.2677711492939692,"spread":0.2522463683129014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001711498,0.0005954232,0.0004275646,0.0007989446,0.0005012722,0.001557941,0.0007960287,0.0006432508,0.02919171],"category_scores_gemma":[0.001264518,0.0003368095,0.000278185,0.001007303,0.0007099119,0.002771995,0.001376161,0.001367086,0.007168641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005371115,"about_ca_system_score_gemma":0.0004386883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006595015,"about_ca_topic_score_gemma":0.001019379,"domain_scores_codex":[0.9997967,0.00002338327,0.000007501492,0.00007693177,0.00007236622,0.00002316776],"domain_scores_gemma":[0.9997117,0.00009261449,0.00001975609,0.00009537931,0.00005526483,0.0000251908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002846002,0.00001871055,0.0001321344,0.000200975,0.00001934525,0.00008054236,0.000075693,0.01462054,0.002746443,0.7167948,0.06437535,0.200907],"study_design_scores_gemma":[0.000009539097,0.00001623723,0.0002419916,0.00008584566,0.00001504267,0.0003227071,0.0000327917,0.03520935,0.001462854,0.7673135,0.1952729,0.00001702011],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.009613078,0.00560686,0.4539721,0.001880106,0.00102876,0.00009850908,0.001621824,0.00128521,0.5248936],"genre_scores_gemma":[0.3640759,0.01862571,0.1949423,0.001529659,0.001843735,0.0004716571,0.005756244,0.001343595,0.4114112],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02919171,"threshold_uncertainty_score":0.09765595,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Psychology","authors":[{"name":"Eric Ruppert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01438385155006809,"gpt":0.2243466511130711,"spread":0.209962799563003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002974306,0.0006439614,0.0007793731,0.0009113754,0.0006623375,0.003039073,0.001081596,0.0006869484,0.02795755],"category_scores_gemma":[0.00139927,0.0005732275,0.0003297724,0.002288437,0.0009046454,0.004241229,0.001669486,0.001442358,0.009554936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006356566,"about_ca_system_score_gemma":0.0006223358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001028217,"about_ca_topic_score_gemma":0.001366504,"domain_scores_codex":[0.9996682,0.00006439291,0.00002574394,0.00006773982,0.0001413444,0.00003251708],"domain_scores_gemma":[0.9996123,0.0001128,0.00001994486,0.0001625692,0.00006316414,0.00002930874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005554785,0.00002875643,0.0002024166,0.000288415,0.00001703124,0.00009650326,0.0002790987,0.004995802,0.001321992,0.5132705,0.0902679,0.3891761],"study_design_scores_gemma":[0.00001917613,0.00003033299,0.0003075591,0.0002195155,0.00002423658,0.0004211714,0.0001119103,0.01657633,0.002504701,0.4575498,0.5222112,0.00002407477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009165433,0.06025815,0.5281025,0.002371446,0.003545156,0.0001226741,0.0009975951,0.008589497,0.3868475],"genre_scores_gemma":[0.1821574,0.04584484,0.2541706,0.0008986127,0.001974452,0.000261697,0.00347759,0.003039086,0.5081757],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02795755,"threshold_uncertainty_score":0.09352738,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Teleportation; Quantum teleportation; Superdense coding; Quantum; Physics; Quantum mechanics; Quantum entanglement; Quantum channel","authors":[{"name":"Rahul Jain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01066450491765862,"gpt":0.2190079050128339,"spread":0.2083434000951753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004516007,0.0005795202,0.0006532011,0.0007024384,0.0009552876,0.002463115,0.001069233,0.00131133,0.02118453],"category_scores_gemma":[0.001499591,0.0004798622,0.0006201217,0.0011351,0.002885952,0.00379447,0.001866133,0.002309822,0.002717875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009149152,"about_ca_system_score_gemma":0.0006818118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002149797,"about_ca_topic_score_gemma":0.0002044355,"domain_scores_codex":[0.999461,0.000131117,0.0000226056,0.00008594578,0.0002347641,0.00006465342],"domain_scores_gemma":[0.999427,0.0002912863,0.00003439785,0.0001802624,0.00004512599,0.00002191007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001405525,0.000009549,0.00001546545,0.00006346658,0.000005016291,0.00002752771,0.00008422203,0.001213788,0.00112867,0.9744357,0.003529056,0.01947353],"study_design_scores_gemma":[0.00001481517,0.00002131514,0.00005544864,0.00005747974,0.000005606531,0.0001574466,0.00002808074,0.006246261,0.003725069,0.9316041,0.05806708,0.0000172444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02100775,0.008587919,0.3293337,0.003034527,0.001872093,0.0001828134,0.0003307671,0.0006862048,0.6349642],"genre_scores_gemma":[0.5834853,0.01703284,0.11493,0.001162655,0.001504302,0.0005870023,0.0005584573,0.0005348587,0.2802045],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02118453,"threshold_uncertainty_score":0.07086933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}