{"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004508981,0.0010620138,0.37150937,0.00036696118,0.0013842483,0.00015360101,0.000046586058,0.000081735685,0.62539095],"genre_scores_gemma":[0.00022646555,0.0022878146,0.07282561,0.00012228747,0.0013081933,0.0000104305145,0.00006321196,0.000042117194,0.9231139],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979539,0.000018058508,0.00050324854,0.000572334,0.0006908534,0.0002616226],"domain_scores_gemma":[0.9984004,0.0002544854,0.00038550433,0.0005832134,0.00023193794,0.00014449816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024520984,0.00032609346,0.00040436175,0.0009354995,0.0000709493,0.00003696499,0.00076171523,0.0002566475,0.00020399962],"category_scores_gemma":[0.000054802083,0.00028043528,0.00019326192,0.00026579914,0.00006628866,0.00030098262,0.00017085536,0.00020727969,0.00039004383],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037831933,0.000020523668,0.000004331754,0.000028048966,0.00007266447,0.00003063495,0.00006320093,0.00006556449,0.000009057278,0.48209667,0.013945015,0.5036605],"study_design_scores_gemma":[0.0003583166,0.00018229157,0.00012032887,0.000110624074,0.000030423169,0.000027359913,0.0000015951333,0.0008597719,0.000087264794,0.15019996,0.84747994,0.00054213015],"about_ca_topic_score_codex":0.000004064868,"about_ca_topic_score_gemma":0.0000014745987,"teacher_disagreement_score":0.8335349,"about_ca_system_score_codex":0.00007066834,"about_ca_system_score_gemma":0.00024025603,"threshold_uncertainty_score":0.9999648},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012435019,0.0008109246,0.46998277,0.0005841756,0.0010495336,0.00020146911,0.00009129893,0.000078364304,0.527189],"genre_scores_gemma":[0.0012110099,0.0022406715,0.0666647,0.0001434985,0.00083056715,0.000016531161,0.00009892989,0.00005504691,0.9287391],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981134,0.000027526781,0.00047655782,0.0005806525,0.00057090743,0.00023096395],"domain_scores_gemma":[0.99863446,0.00016990764,0.0002994704,0.00048292696,0.00030116862,0.000112048234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020463335,0.00033810583,0.0004024903,0.0003032228,0.00007310695,0.000031037354,0.000574066,0.00028026727,0.00017019817],"category_scores_gemma":[0.000017910563,0.0002952165,0.0002395833,0.000096897595,0.00008300961,0.00030331698,0.0001229603,0.00023514431,0.00018808112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010100682,0.000031009153,0.0000017697672,0.00004397881,0.000116876494,0.000047939076,0.0003848547,0.00008499825,0.000058094727,0.4003675,0.0017948726,0.597058],"study_design_scores_gemma":[0.00091107003,0.00046332626,0.0003057407,0.00035918818,0.00008806926,0.000067896806,0.0000061578776,0.008996659,0.00017395563,0.31993517,0.6675939,0.0010988285],"about_ca_topic_score_codex":0.0000017765369,"about_ca_topic_score_gemma":0.0000054296042,"teacher_disagreement_score":0.6657991,"about_ca_system_score_codex":0.00006876719,"about_ca_system_score_gemma":0.0002931401,"threshold_uncertainty_score":0.99995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012936607,0.0011714302,0.59652364,0.00010446102,0.00035821533,0.0006359332,0.00015766583,0.000096609474,0.4009391],"genre_scores_gemma":[0.001682344,0.011017123,0.78104144,0.00020597375,0.0013567026,0.00026477265,0.00030444126,0.0001660144,0.20396118],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99729544,0.000022508708,0.0009004872,0.0007344776,0.0007470772,0.00030001422],"domain_scores_gemma":[0.9973385,0.00020994834,0.00061930995,0.0012563983,0.000370294,0.0002055517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020438488,0.0003955611,0.00064043567,0.0005526438,0.000180649,0.000032857322,0.0015571112,0.00027166685,0.00009762168],"category_scores_gemma":[0.000044558026,0.00039094914,0.00020746852,0.0002625945,0.00011076657,0.0004174089,0.0007844435,0.0003587343,0.00011057541],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009650986,0.00014857271,0.0000503287,0.00019092388,0.0001308911,0.00004588337,0.0028467278,0.0004359039,0.0001262465,0.13810442,0.012412094,0.8454983],"study_design_scores_gemma":[0.0003448518,0.00020748477,0.00032980225,0.00051054254,0.00004838813,0.000056107343,0.000037055695,0.0048683784,0.00030006916,0.009417387,0.9830887,0.0007912391],"about_ca_topic_score_codex":0.00005746617,"about_ca_topic_score_gemma":0.000004698824,"teacher_disagreement_score":0.9706766,"about_ca_system_score_codex":0.000072963856,"about_ca_system_score_gemma":0.00030886597,"threshold_uncertainty_score":0.99985427},"labels":[],"label_agreement":null},{"id":"W1540196280","doi":"10.1007/978-1-4939-2864-4_256","title":"Nearest Neighbor Interchange and Related Distances","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Algorithms","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Geography; Computer science; Artificial intelligence","score_opus":0.011835362371953729,"score_gpt":0.21984664656121664,"score_spread":0.2080112841892629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540196280","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007589083,0.0028774613,0.033896726,0.0007271108,0.0020018101,0.00036777082,0.00022900217,0.00019264565,0.95969987],"genre_scores_gemma":[0.0001114227,0.014424277,0.023168707,0.00008083305,0.0005415311,0.000018615638,0.00007453134,0.00007133275,0.96150875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770015,0.000023918354,0.0005860442,0.0008343039,0.0004937941,0.000361758],"domain_scores_gemma":[0.9981986,0.00014648547,0.000437743,0.0009568112,0.000097784476,0.0001625758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026723414,0.0004638081,0.0005555117,0.00029252202,0.00008448868,0.00012285172,0.0013872014,0.00025091125,0.0002968035],"category_scores_gemma":[0.000029498391,0.00036677497,0.0001408542,0.000090639,0.00028109178,0.00088314526,0.00115594,0.00029592848,0.00019605232],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044038634,0.00001740393,0.0000103982975,0.00007018793,0.00010746788,0.000100519515,0.0002613047,1.2336933e-7,0.0000017488305,0.31970048,0.0050221775,0.6747038],"study_design_scores_gemma":[0.0005031223,0.00020202373,0.000115670155,0.0005092526,0.00005937271,0.000017453252,0.000011359282,0.0012365903,0.0000068368086,0.07378496,0.9228688,0.00068456214],"about_ca_topic_score_codex":0.000010564785,"about_ca_topic_score_gemma":0.000009236856,"teacher_disagreement_score":0.9178466,"about_ca_system_score_codex":0.0000416582,"about_ca_system_score_gemma":0.000054294804,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008794616,0.0038162344,0.4627506,0.000108966335,0.0013860946,0.00051981036,0.00005844244,0.00026365544,0.53100824],"genre_scores_gemma":[0.002590789,0.02572063,0.42334294,0.00016231462,0.0031179395,0.00005545649,0.00022447458,0.00030473416,0.54448074],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744064,0.000023109997,0.00065140636,0.0008536485,0.00059079163,0.00044039186],"domain_scores_gemma":[0.9978918,0.00017757557,0.00050865824,0.0010360759,0.00013203683,0.00025385566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039187813,0.00048304428,0.00065469556,0.00025821538,0.00013138281,0.00011135835,0.0011130125,0.00034435163,0.000045549667],"category_scores_gemma":[0.000031815805,0.00044770312,0.00012754303,0.00007236425,0.0001250875,0.0003799062,0.0010931016,0.000506439,0.000041629082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032995354,0.000023714165,0.00006968101,0.000221134,0.0000642463,0.00003672006,0.0002720694,0.000037899932,0.000014874472,0.18812507,0.0017761877,0.8093551],"study_design_scores_gemma":[0.0006381895,0.0002626323,0.00038104775,0.00096364575,0.00005797481,0.00006465669,0.000005997323,0.012510056,0.00009276464,0.030228721,0.9537672,0.001027108],"about_ca_topic_score_codex":0.000057959816,"about_ca_topic_score_gemma":0.0000063729035,"teacher_disagreement_score":0.951991,"about_ca_system_score_codex":0.00004323041,"about_ca_system_score_gemma":0.00011209285,"threshold_uncertainty_score":0.99979746},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000695179,0.0015333501,0.26667577,0.00014214145,0.00076559297,0.0008756587,0.00012283605,0.00016836077,0.72902113],"genre_scores_gemma":[0.0017143132,0.022044154,0.16500245,0.00011160094,0.00037340587,0.000037586185,0.000081066326,0.00013076386,0.8105047],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839276,0.0000191397,0.0005155115,0.0004122613,0.00044215334,0.00021820074],"domain_scores_gemma":[0.99864894,0.0001337713,0.00038875395,0.00047070478,0.00022464081,0.0001331898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002922577,0.00026968456,0.00050855335,0.00018644612,0.00005012305,0.000036305737,0.0005556268,0.00020917384,0.000061013827],"category_scores_gemma":[0.000025029007,0.00025936397,0.00008695316,0.00006928371,0.00016426103,0.00018089336,0.00036421785,0.00023455506,0.000011093091],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035599493,0.00021844386,0.00019716083,0.0023579092,0.0004576635,0.00004523639,0.0069343485,0.010764042,0.00038850133,0.21344222,0.0141156735,0.7510432],"study_design_scores_gemma":[0.0011064938,0.00067656074,0.00004121271,0.00056568097,0.000050685445,0.00002579631,0.0000522789,0.12845656,0.0012868571,0.0058503808,0.8608112,0.0010763402],"about_ca_topic_score_codex":0.000034751985,"about_ca_topic_score_gemma":0.0000025708978,"teacher_disagreement_score":0.8466955,"about_ca_system_score_codex":0.00002065421,"about_ca_system_score_gemma":0.00007255503,"threshold_uncertainty_score":0.9999859},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024350416,0.003477295,0.008455131,0.000114946226,0.0014985065,0.00038752717,0.00017992471,0.00010145861,0.98576087],"genre_scores_gemma":[0.00083917705,0.010277243,0.042999335,0.00017767701,0.0010393274,0.00006611357,0.00027322772,0.00011546742,0.94421244],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972829,0.000023679811,0.00088087126,0.0007508699,0.00066917995,0.00039245203],"domain_scores_gemma":[0.9981385,0.000082600294,0.00044178497,0.0010365527,0.0001551263,0.00014543494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002162948,0.0004436766,0.00081389485,0.00030595818,0.00005084447,0.000037756196,0.001452894,0.0004298074,0.00019346493],"category_scores_gemma":[0.000025558138,0.00044839678,0.00022654909,0.000155906,0.00010247918,0.00036317378,0.00029737692,0.00049497985,0.0001411291],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031199837,0.00036083758,0.00014207255,0.00046223923,0.00025958536,0.0032681213,0.006076529,0.00021132527,0.000018372519,0.08819748,0.33908814,0.5618841],"study_design_scores_gemma":[0.0007221212,0.0001051642,0.00055047724,0.000565761,0.000011181731,0.00008898963,0.000010513699,0.0023412209,0.000016963928,0.0037575127,0.9910162,0.00081390457],"about_ca_topic_score_codex":0.00008452692,"about_ca_topic_score_gemma":0.000024694758,"teacher_disagreement_score":0.65192807,"about_ca_system_score_codex":0.000094538715,"about_ca_system_score_gemma":0.00026065263,"threshold_uncertainty_score":0.9997968},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001885888,0.0013805972,0.7226579,0.00006034449,0.00045800803,0.0002500248,0.000014776021,0.000040085553,0.27513635],"genre_scores_gemma":[0.0037368126,0.0044129365,0.2524793,0.00014886729,0.0027204794,0.00009371171,0.0003301668,0.00007971165,0.735998],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815696,0.000021185657,0.0006505901,0.00045909136,0.00052453356,0.0001876295],"domain_scores_gemma":[0.997885,0.00028316947,0.0006258301,0.0006925899,0.0004127545,0.00010068523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031616265,0.00025996874,0.0004615302,0.0007514055,0.00005839268,0.000021468975,0.0007345591,0.00025938716,0.00009450418],"category_scores_gemma":[0.000030300398,0.00026513523,0.00019779618,0.00049535884,0.00007842677,0.00011382405,0.00023847447,0.00024073811,0.000048980815],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018301299,0.00003020625,0.000006217483,0.000049660197,0.00005339943,0.00000131956,0.000035413548,0.007107002,0.000001631712,0.31430188,0.0038706523,0.67454076],"study_design_scores_gemma":[0.00023720089,0.00015270388,0.00014499905,0.00006246703,0.000054328502,0.000009398486,0.0000013201875,0.05382084,0.000051539126,0.035734676,0.9093306,0.0003998877],"about_ca_topic_score_codex":0.000008816495,"about_ca_topic_score_gemma":0.0000017989246,"teacher_disagreement_score":0.90546,"about_ca_system_score_codex":0.000029623829,"about_ca_system_score_gemma":0.00013262055,"threshold_uncertainty_score":0.9999801},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000065771937,0.0009070011,0.5542098,0.000085610125,0.0013272468,0.00021001339,0.000038012673,0.00018724821,0.44302845],"genre_scores_gemma":[0.00007572193,0.002511401,0.43036634,0.0001404192,0.0015426241,0.00001838411,0.00015266641,0.00012867214,0.5650638],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967719,0.000048211095,0.000792033,0.0009852049,0.0009937232,0.00040892954],"domain_scores_gemma":[0.99666286,0.00017853556,0.00072428887,0.002028572,0.00017492282,0.00023083527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041655477,0.0005801569,0.0007922439,0.00028805432,0.00016173377,0.000090958354,0.0021912016,0.0005126885,0.00021443421],"category_scores_gemma":[0.000027172924,0.0005081668,0.0002854786,0.000071238384,0.00010736292,0.00044328143,0.0014576877,0.0005961513,0.000219158],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011484049,0.000053263324,0.0000027577764,0.00019387255,0.00006869607,0.00010191905,0.00055554294,0.00008776753,0.00025591627,0.30913535,0.043855846,0.64567757],"study_design_scores_gemma":[0.00033652852,0.00013060751,0.000015102345,0.0008120504,0.000028954631,0.000028906135,0.0000053623776,0.004709099,0.0004845686,0.09899413,0.89373106,0.0007236095],"about_ca_topic_score_codex":0.00002374792,"about_ca_topic_score_gemma":0.0000011615149,"teacher_disagreement_score":0.8498752,"about_ca_system_score_codex":0.00005145533,"about_ca_system_score_gemma":0.00013123798,"threshold_uncertainty_score":0.99973696},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006818705,0.0005124644,0.9778014,0.0005195296,0.0014423965,0.00016608191,0.000034834142,0.00016018734,0.012544409],"genre_scores_gemma":[0.1448385,0.0029720764,0.84137523,0.0004233375,0.0015238973,0.000059552953,0.000059798305,0.000040943076,0.008706652],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844414,0.0000418997,0.00035307044,0.00041722384,0.00045739196,0.00028626758],"domain_scores_gemma":[0.998776,0.000074422205,0.00007745049,0.0007906602,0.00014246916,0.00013896821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011941488,0.0001745957,0.00022459992,0.00008964821,0.00027453536,0.00003559113,0.000950858,0.00007499109,0.000042834654],"category_scores_gemma":[0.00003338183,0.0001514075,0.0000761864,0.0004141517,0.00011713176,0.000814561,0.00034450297,0.00016257066,0.00007338372],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053431297,0.0035291088,0.0053118123,0.00015230244,0.00033506574,0.00076603174,0.015652156,0.037328236,0.0019652147,0.27453318,0.33801895,0.32235453],"study_design_scores_gemma":[0.0018896535,0.00043453719,0.024205174,0.000116798,0.000028930435,0.00036066014,0.00018643508,0.44897774,0.0022941486,0.005457855,0.51467615,0.0013719326],"about_ca_topic_score_codex":0.0000902455,"about_ca_topic_score_gemma":0.000010216389,"teacher_disagreement_score":0.41164953,"about_ca_system_score_codex":0.00002810027,"about_ca_system_score_gemma":0.00015596561,"threshold_uncertainty_score":0.61742187},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024773736,0.0029953243,0.009262455,0.0003069995,0.0012573123,0.00030165524,0.000050100007,0.00021881475,0.9853596],"genre_scores_gemma":[0.0026205454,0.0008008697,0.041938104,0.000025492365,0.0004580958,0.00001228436,0.000010977028,0.00008675955,0.95404685],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979223,0.000039279916,0.0007216363,0.0005929753,0.00044523767,0.00027857278],"domain_scores_gemma":[0.9981487,0.00017155618,0.0006426528,0.00065113994,0.00025837612,0.00012758918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033304148,0.00038492214,0.00059149455,0.00029500027,0.00012186964,0.000031019415,0.0005873874,0.00026964585,0.00007462384],"category_scores_gemma":[0.00017885084,0.00029068484,0.00013668451,0.000116531344,0.00027509523,0.0002441231,0.0004141978,0.0004715571,0.00005701272],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000793742,0.000048238617,0.00016794789,0.0002673543,0.00020408221,0.000034670367,0.0007235693,0.00002199443,0.00031916326,0.040383473,0.0008106118,0.957011],"study_design_scores_gemma":[0.0036262404,0.0028553663,0.0028353538,0.010022263,0.00063898007,0.0007478905,0.000110359564,0.036417246,0.0011942709,0.08494374,0.8521662,0.0044420846],"about_ca_topic_score_codex":0.0000449779,"about_ca_topic_score_gemma":0.0000015249195,"teacher_disagreement_score":0.9525689,"about_ca_system_score_codex":0.000026351136,"about_ca_system_score_gemma":0.00016675769,"threshold_uncertainty_score":0.9999545},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021074027,0.002778376,0.22493199,0.000700848,0.0027298653,0.00048461428,0.00032156042,0.0003080185,0.767534],"genre_scores_gemma":[0.003430761,0.008829474,0.23006631,0.00021953825,0.0035869144,0.00002267066,0.00008138761,0.0003165742,0.75344634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966554,0.000053374893,0.0010436818,0.0008808433,0.000856427,0.00051025127],"domain_scores_gemma":[0.9966658,0.0003872982,0.0010276708,0.001418648,0.00030124988,0.0001993435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043892852,0.0006294985,0.0010981238,0.0005411232,0.000087940796,0.000028200322,0.0020234003,0.00043015045,0.000098235876],"category_scores_gemma":[0.000058549165,0.0004900693,0.0005018197,0.00015135601,0.00033120418,0.00016323985,0.0007683535,0.00050172216,0.00005548841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010290949,0.00006736021,0.000020057301,0.00018191032,0.00020331638,0.00007981773,0.00057874154,0.00003223126,0.00004245698,0.4075115,0.0026270654,0.5886453],"study_design_scores_gemma":[0.0017671407,0.0017996489,0.00075974094,0.0032735371,0.00019592948,0.00016391065,0.000019069998,0.10475751,0.00059209636,0.29477322,0.5888215,0.003076736],"about_ca_topic_score_codex":0.000021629061,"about_ca_topic_score_gemma":0.0000041210537,"teacher_disagreement_score":0.5861944,"about_ca_system_score_codex":0.00004381907,"about_ca_system_score_gemma":0.000286154,"threshold_uncertainty_score":0.9997551},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006318871,0.0048814216,0.22710305,0.00017904547,0.0014347549,0.00052931096,0.00013241859,0.00025580253,0.765421],"genre_scores_gemma":[0.0011693916,0.03699571,0.22380053,0.000089653346,0.0025867093,0.000050265135,0.00008160127,0.00024597743,0.73498017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974698,0.00001825321,0.00062491867,0.0008507772,0.0005763111,0.00045995612],"domain_scores_gemma":[0.9979594,0.00018380728,0.00048092153,0.0009890936,0.00013538508,0.0002513903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030293173,0.00047227586,0.000584242,0.00025815077,0.00012290587,0.000088140594,0.0010827638,0.0003304941,0.0000716206],"category_scores_gemma":[0.000027464414,0.00037417514,0.00012483732,0.00006222987,0.00014011626,0.0006626847,0.0011539371,0.0003756867,0.000055126286],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003460238,0.000022393746,0.00005898633,0.00012143896,0.00005960287,0.000050756007,0.00018741554,0.00000394557,0.000030138941,0.18073133,0.0009591761,0.8177714],"study_design_scores_gemma":[0.0009351842,0.00026854352,0.00041213018,0.001869459,0.00005816273,0.00008314497,0.0000065036184,0.0020132489,0.00019138189,0.07766221,0.9152496,0.0012504751],"about_ca_topic_score_codex":0.00002415686,"about_ca_topic_score_gemma":0.000003929599,"teacher_disagreement_score":0.91429037,"about_ca_system_score_codex":0.0000561001,"about_ca_system_score_gemma":0.00014450362,"threshold_uncertainty_score":0.999871},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048758124,0.0024586662,0.3994597,0.00039557114,0.0012984786,0.00030973103,0.00008343534,0.00012273075,0.59582293],"genre_scores_gemma":[0.0018224803,0.012092985,0.15305886,0.00022977042,0.0009444096,0.000021761261,0.00035380968,0.00008049956,0.83139545],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801385,0.00002674319,0.0005057155,0.0005858433,0.0006406875,0.0002271855],"domain_scores_gemma":[0.99868786,0.00012729585,0.0002949953,0.00047124084,0.00030474676,0.000113869755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014404034,0.00035554462,0.00044083863,0.00032989288,0.0001046421,0.000025961792,0.00056212506,0.0002960607,0.000091484806],"category_scores_gemma":[0.00001567652,0.0003718017,0.00026387948,0.0001418184,0.00009621828,0.0002760845,0.00011324852,0.0003477883,0.00011619694],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026605056,0.0001390815,0.0000057583143,0.00012600636,0.00033786177,0.00036104335,0.0030398231,0.0019906138,0.000050910498,0.14447957,0.019558463,0.82988423],"study_design_scores_gemma":[0.0007979496,0.0005080642,0.00056878495,0.00018323581,0.00008144562,0.00023289704,0.000009475972,0.034672648,0.000112985945,0.043582473,0.91809696,0.0011530785],"about_ca_topic_score_codex":0.000005437527,"about_ca_topic_score_gemma":0.00000718769,"teacher_disagreement_score":0.8985385,"about_ca_system_score_codex":0.000064178974,"about_ca_system_score_gemma":0.00035723642,"threshold_uncertainty_score":0.9998734},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018225528,0.0007929783,0.28085503,0.00047723347,0.0011416948,0.0005718447,0.00012943776,0.00013581861,0.7158777],"genre_scores_gemma":[0.00037447957,0.0372746,0.19259514,0.0002270878,0.0010490813,0.000049609633,0.00007578947,0.00013409897,0.7682201],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99672294,0.000058097943,0.0008664202,0.00080200005,0.0010508276,0.0004996914],"domain_scores_gemma":[0.99794704,0.0001654249,0.00045283977,0.00083776354,0.0004023547,0.00019457607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004985413,0.00049227756,0.0006698439,0.0006481605,0.000064856686,0.000048601058,0.0016627283,0.00032785584,0.00020961018],"category_scores_gemma":[0.00005837773,0.00040576817,0.00016916022,0.00016986171,0.00019241417,0.00062723446,0.00049789896,0.00058990787,0.00015329734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009629685,0.000109880384,0.000053483218,0.00006397547,0.00007164438,0.00005623989,0.0006699032,0.00056897517,0.000003878655,0.05656978,0.0004949784,0.94132763],"study_design_scores_gemma":[0.0028464114,0.0008825802,0.00045692333,0.0019159098,0.000034809033,0.000042890708,0.000020777368,0.17717797,0.00017433905,0.057643995,0.75673074,0.0020726547],"about_ca_topic_score_codex":0.000032072396,"about_ca_topic_score_gemma":0.000024095,"teacher_disagreement_score":0.939255,"about_ca_system_score_codex":0.00015264009,"about_ca_system_score_gemma":0.00034504134,"threshold_uncertainty_score":0.9998394},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074886507,0.0042863563,0.011306626,0.00000461683,0.000631062,0.00032334536,0.00009227061,0.000654473,0.98269373],"genre_scores_gemma":[0.0005355812,0.1081859,0.010101606,0.00003735151,0.001276574,0.00006601856,0.00016240652,0.00038090046,0.8792537],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986124,0.0000048906877,0.0004909983,0.00026052113,0.0003698952,0.00026128627],"domain_scores_gemma":[0.9992634,0.000042364587,0.00010231556,0.00043148873,0.000058798996,0.0001016328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000075788026,0.0004179412,0.0005242098,0.00022120414,0.00003207384,0.000007137873,0.0002848594,0.00043235387,0.0007150683],"category_scores_gemma":[0.0000058188407,0.0004479733,0.00019239295,0.00003289978,0.00007845914,0.00006510164,0.00004502172,0.0004135674,0.00018481008],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000827274,0.000053334796,0.000011691971,0.0005811975,0.00057253434,0.00031560045,0.0011036294,0.00041393697,0.00015452103,0.009404331,0.5782399,0.409141],"study_design_scores_gemma":[0.0001643047,0.000099767894,0.000009708027,0.00016193991,0.000051727246,0.000029703833,0.000004594892,0.00030500971,0.00056727714,0.002629483,0.9954193,0.00055714085],"about_ca_topic_score_codex":0.000004569761,"about_ca_topic_score_gemma":0.0000010182085,"teacher_disagreement_score":0.4171794,"about_ca_system_score_codex":0.00009805994,"about_ca_system_score_gemma":0.000046374607,"threshold_uncertainty_score":0.9997972},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043929135,0.0010683914,0.34885925,0.000327641,0.0013973825,0.0001431785,0.000027828888,0.000077779965,0.6480941],"genre_scores_gemma":[0.00023061215,0.0023549243,0.06419917,0.00009350024,0.0011175318,0.000009274956,0.000034748617,0.000036111436,0.9319241],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980392,0.000016589693,0.00048776838,0.0005498085,0.00066222437,0.0002444272],"domain_scores_gemma":[0.99840295,0.00023411686,0.00037432724,0.0005860111,0.00026935103,0.00013322229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002438814,0.00030763977,0.0003819049,0.0008845823,0.0000641059,0.000036154717,0.0007319337,0.00024063182,0.00026415748],"category_scores_gemma":[0.000060246453,0.0002634727,0.0002009065,0.00027094194,0.0000660218,0.00030797144,0.00027161118,0.00019277439,0.00039641495],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023302287,0.000017206858,0.0000028562058,0.000022457549,0.000053977827,0.00001780846,0.000047089456,0.0000730924,0.0000068941185,0.3778618,0.008424898,0.6134696],"study_design_scores_gemma":[0.00031377887,0.000153148,0.00009647109,0.00009733086,0.000026443498,0.000020248752,0.0000011307567,0.0010608641,0.00012312217,0.10639621,0.8912234,0.00048785016],"about_ca_topic_score_codex":0.000002771711,"about_ca_topic_score_gemma":9.404049e-7,"teacher_disagreement_score":0.8827985,"about_ca_system_score_codex":0.00006758286,"about_ca_system_score_gemma":0.00023888284,"threshold_uncertainty_score":0.99998176},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010102386,0.0022628568,0.18040329,0.0001376477,0.002038327,0.00018696625,0.00020034118,0.00010782215,0.81466174],"genre_scores_gemma":[0.00014537502,0.00064173795,0.020622741,0.000046979916,0.00084308867,0.000016154818,0.000077400975,0.000043851287,0.97756267],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977146,0.000016735063,0.00059127045,0.0005419899,0.00087785407,0.0002575621],"domain_scores_gemma":[0.9983033,0.000055318495,0.00034952973,0.000743088,0.0003488508,0.00019989134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030930692,0.00035399586,0.000571433,0.00014272363,0.00004951927,0.00003680572,0.0010413874,0.00034536514,0.00028019914],"category_scores_gemma":[0.000011665526,0.00034148933,0.00023220024,0.000072009476,0.000092811286,0.0002998811,0.000091595946,0.00037288992,0.00020826534],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012979685,0.000093364564,0.0000022634129,0.00013477754,0.00022229666,0.00016439863,0.00068577996,0.00020708503,0.000005880165,0.27840453,0.17146097,0.5486057],"study_design_scores_gemma":[0.0003294571,0.00008260473,0.000010522949,0.00012245127,0.000021547488,0.000042243722,0.0000065861022,0.0016542712,0.000010026125,0.016312787,0.98100984,0.0003976843],"about_ca_topic_score_codex":0.000024992254,"about_ca_topic_score_gemma":0.000004301024,"teacher_disagreement_score":0.80954885,"about_ca_system_score_codex":0.00008102304,"about_ca_system_score_gemma":0.00039003207,"threshold_uncertainty_score":0.99990374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022741666,0.0011099135,0.18547976,0.00008313875,0.0009514262,0.00030136522,0.00007017627,0.00013692705,0.8116399],"genre_scores_gemma":[0.011663823,0.19022618,0.40440163,0.0008088022,0.0012941242,0.000099370125,0.0014139818,0.00035298456,0.3897391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786884,0.000012399965,0.000978398,0.00027323252,0.0006758253,0.00019132167],"domain_scores_gemma":[0.9978288,0.00008899742,0.0010522899,0.0005853308,0.00035312003,0.00009148138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001595405,0.00027911447,0.00047670858,0.0004655098,0.000049667335,0.000015833677,0.0006750849,0.00021178839,0.000112730835],"category_scores_gemma":[0.000017697028,0.00026669473,0.00026081983,0.0001452857,0.00016477342,0.0004327236,0.00009855425,0.00022073388,0.00006040474],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011221051,0.00008631818,0.0000641556,0.00025240754,0.0001713193,0.00003938137,0.0048460467,0.00014573045,0.00000670547,0.78710246,0.03202917,0.17524508],"study_design_scores_gemma":[0.00054690277,0.00046442886,0.00063109194,0.00023411271,0.000045296354,0.000047394296,0.000075033226,0.028915688,0.00038239386,0.07322341,0.8946363,0.00079798914],"about_ca_topic_score_codex":0.0000246837,"about_ca_topic_score_gemma":0.000001758668,"teacher_disagreement_score":0.86260706,"about_ca_system_score_codex":0.000016230513,"about_ca_system_score_gemma":0.00018128117,"threshold_uncertainty_score":0.99997854},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014765834,0.0008657148,0.07918315,0.00026982982,0.0016092521,0.00024860064,0.00002956507,0.00028284453,0.91749626],"genre_scores_gemma":[0.00019598087,0.007850405,0.13989104,0.00011064884,0.0011756236,0.000016617061,0.00003532311,0.000087522676,0.85063684],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971779,0.000043996573,0.0006654127,0.0008787466,0.0008224257,0.00041153637],"domain_scores_gemma":[0.99747795,0.00026157807,0.00062945427,0.0011443836,0.00028221472,0.00020441583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020027172,0.0005791472,0.00077405135,0.00038110482,0.00013920294,0.000043113752,0.0017027654,0.00046600122,0.00019951916],"category_scores_gemma":[0.000106586325,0.00048026862,0.00028497423,0.00014399154,0.000239703,0.00035017336,0.00062848086,0.0011615673,0.0003515795],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044577196,0.00006665293,0.000060440063,0.000056817236,0.00014632092,0.00022190473,0.0018482208,0.000059379836,0.000002697644,0.073312715,0.010983802,0.9132366],"study_design_scores_gemma":[0.00033587203,0.00029777744,0.00024410713,0.00019058704,0.00003010159,0.0000706941,0.000006794996,0.004547659,0.000030391793,0.017604519,0.97576183,0.00087966124],"about_ca_topic_score_codex":0.00008626542,"about_ca_topic_score_gemma":0.0000031586706,"teacher_disagreement_score":0.964778,"about_ca_system_score_codex":0.00006329382,"about_ca_system_score_gemma":0.00039435766,"threshold_uncertainty_score":0.9997649},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.18525e-7,0.0000911517,0.6857115,0.00054601574,0.0009930645,0.0009478266,0.00016023764,0.00009711572,0.31145275],"genre_scores_gemma":[0.000047816407,0.00032122832,0.38301793,0.00014699635,0.0009707037,0.00010691427,0.000006783997,0.000099502155,0.6152821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99387294,0.0002927313,0.0017789932,0.0015019594,0.00200722,0.00054617703],"domain_scores_gemma":[0.99301666,0.0027632334,0.0011217956,0.001844704,0.00072321354,0.0005304167],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0044095824,0.00067458,0.0010497926,0.0009382065,0.00033646476,0.00010974335,0.0018863176,0.0005086051,0.00474457],"category_scores_gemma":[0.00087631855,0.0005153579,0.00040509755,0.00036261784,0.00024980496,0.00032045113,0.00034135568,0.00043835223,0.0040478967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030811494,0.000034523,1.2737517e-7,0.0000034899442,0.00006671017,0.000017577351,0.00040504296,0.0002118182,0.00010568505,0.16436616,0.018900352,0.8158577],"study_design_scores_gemma":[0.00022968213,0.00024731184,0.0000016347218,0.00014880141,0.00006677797,0.000029252546,0.000069738024,0.0012217177,0.0020404684,0.7915998,0.20371543,0.00062936224],"about_ca_topic_score_codex":0.000005733901,"about_ca_topic_score_gemma":6.7184857e-7,"teacher_disagreement_score":0.81522834,"about_ca_system_score_codex":0.00012385013,"about_ca_system_score_gemma":0.00041436875,"threshold_uncertainty_score":0.9997298},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037800055,0.00022675311,0.04473242,0.00009310815,0.000031805397,0.00023829269,0.00032145155,0.00022428315,0.9537539],"genre_scores_gemma":[0.00025103096,0.00320104,0.2561528,0.00004336155,0.000863173,0.00015775619,0.00007306881,0.00018848309,0.7390693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983472,0.0000033502502,0.00046070534,0.0005227473,0.00029967906,0.00036630043],"domain_scores_gemma":[0.998353,0.000091713606,0.0004819052,0.0007752856,0.0001472722,0.00015081734],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009116257,0.00044004392,0.00046805813,0.00007993531,0.000084967,0.000012716288,0.0004429431,0.00044326793,0.0015512678],"category_scores_gemma":[0.000016615888,0.00035787054,0.00015282715,0.000031098843,0.00020349986,0.00008886581,0.00011862467,0.00051874045,0.000056669327],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003022345,0.0002359291,0.0006978551,0.0022380399,0.00120416,0.00071328337,0.0014941435,0.0001245931,0.07027744,0.5463174,0.008272863,0.36812207],"study_design_scores_gemma":[0.00048906845,0.00008265248,0.0000040124173,0.0012146881,0.00013069368,0.00015062306,0.000017438717,0.00003640923,0.037021097,0.08675626,0.87314075,0.00095633615],"about_ca_topic_score_codex":0.00003871035,"about_ca_topic_score_gemma":0.000015083947,"teacher_disagreement_score":0.86486787,"about_ca_system_score_codex":0.0003257952,"about_ca_system_score_gemma":0.00032706125,"threshold_uncertainty_score":0.99988735},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0322156,0.0017380875,0.0000023088307,0.00014567316,0.00040011443,0.00026837096,0.000046411547,0.00007747337,0.96510595],"genre_scores_gemma":[0.014702005,0.021566423,0.0007167166,0.00009418344,0.0029337308,0.000023932527,0.0004286562,0.0000109464545,0.9595234],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984902,0.00001191165,0.00045103673,0.00041216818,0.00034355078,0.00029109977],"domain_scores_gemma":[0.99921405,0.00017594671,0.0002730682,0.00011148553,0.000083368024,0.00014209477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000817258,0.0003372901,0.00048960897,0.0000261574,0.00010468044,0.000012756216,0.00037451743,0.00032397846,0.0019442027],"category_scores_gemma":[0.000012465093,0.00014326416,0.00030939485,0.00005441711,0.00011915796,0.00007470636,0.00011728586,0.0002993342,0.00019361639],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018912759,0.00006041972,0.00068782544,0.000023906645,0.000095038355,0.00010979051,0.00048447802,0.0000022439142,0.00015260153,0.0016119282,0.024018498,0.97273433],"study_design_scores_gemma":[0.0000881281,0.00012869305,0.0046951864,0.000060305923,0.000030037596,0.00001490933,0.000021199854,0.0000059377453,0.000067961955,0.0006336794,0.9938769,0.00037709708],"about_ca_topic_score_codex":0.00010107256,"about_ca_topic_score_gemma":0.00008713282,"teacher_disagreement_score":0.9723573,"about_ca_system_score_codex":0.000030365345,"about_ca_system_score_gemma":0.000027743003,"threshold_uncertainty_score":0.9989682},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000148101535,0.00042830707,0.3340032,0.00020677596,0.0016234552,0.00031137245,0.00018761224,0.00017155691,0.6630529],"genre_scores_gemma":[0.0004990544,0.0042617004,0.25239363,0.0005636968,0.005003451,0.00004845766,0.00050960144,0.00026724298,0.7364532],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962647,0.000073238465,0.00071387255,0.0010703632,0.0013560709,0.0005217791],"domain_scores_gemma":[0.99702024,0.00036645567,0.0004919333,0.0016651071,0.00015646387,0.00029978124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005733123,0.00063132995,0.00079473277,0.00037017875,0.00019374052,0.00011003257,0.0020866098,0.00038867022,0.00019398452],"category_scores_gemma":[0.00005018471,0.00053080963,0.0003524025,0.00009189243,0.000163522,0.0003373376,0.0011241402,0.00095819996,0.00034999268],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023247878,0.000038837843,0.000018883018,0.000090430585,0.00008190407,0.00010005051,0.00024540172,0.0000584079,0.0000043552704,0.4208194,0.011544933,0.56697416],"study_design_scores_gemma":[0.0006293512,0.0005297104,0.00028340233,0.00067666697,0.000039643022,0.000029296865,0.0000033786773,0.015446622,0.000021949303,0.0243121,0.95708704,0.00094083877],"about_ca_topic_score_codex":0.000027540587,"about_ca_topic_score_gemma":0.0000040640016,"teacher_disagreement_score":0.9455421,"about_ca_system_score_codex":0.000062521576,"about_ca_system_score_gemma":0.00019065656,"threshold_uncertainty_score":0.9997144},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012369992,0.00041681374,0.46981996,0.00006834135,0.0017862167,0.00020115462,0.0000977208,0.00010641065,0.52749103],"genre_scores_gemma":[0.0015398861,0.004414112,0.2589954,0.00020994867,0.0015514913,0.000030379731,0.00030913542,0.00016629556,0.7327834],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775255,0.000033075197,0.0007876485,0.0005965895,0.0005824304,0.00024769607],"domain_scores_gemma":[0.99732524,0.00016302742,0.0007195094,0.0013452718,0.00029754426,0.00014943155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022808758,0.00038409693,0.00070476125,0.0003764899,0.000065493725,0.000026543325,0.0015101891,0.00035388995,0.00021003507],"category_scores_gemma":[0.00004906711,0.00035407252,0.0002709477,0.00011724409,0.00018103997,0.0002554542,0.0008426914,0.00041437242,0.00007916753],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014038818,0.000107979366,0.000023678911,0.00024149836,0.00021604558,0.000029445619,0.0008025435,0.000030302721,0.000059300422,0.25330317,0.048519652,0.69665235],"study_design_scores_gemma":[0.0005407672,0.00041905037,0.00017005815,0.00067806966,0.00007505995,0.00003235267,0.000010562571,0.026599463,0.00027179887,0.026660502,0.9438217,0.00072057627],"about_ca_topic_score_codex":0.0001246304,"about_ca_topic_score_gemma":0.000016396156,"teacher_disagreement_score":0.89530206,"about_ca_system_score_codex":0.00004163213,"about_ca_system_score_gemma":0.00015476799,"threshold_uncertainty_score":0.9998911},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007903496,0.017698128,0.19499199,0.000170284,0.00074659527,0.00044128695,0.000007019332,0.00012966988,0.78580713],"genre_scores_gemma":[0.0033098545,0.044722136,0.17307362,0.00007515357,0.0020114211,0.00009429269,0.0001272133,0.00026135932,0.7763249],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996415,0.00012327623,0.0009660639,0.0007084159,0.0011672438,0.00061995623],"domain_scores_gemma":[0.99591553,0.00075628184,0.00053732947,0.00206593,0.0004529099,0.00027200457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015033027,0.000430885,0.00077799475,0.0014058419,0.00006836024,0.000085644504,0.0037633285,0.000531281,0.00011018705],"category_scores_gemma":[0.00020908633,0.00045664262,0.00016462905,0.0009992531,0.0001686419,0.00039052858,0.0018256813,0.0015160721,0.00008840269],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007927292,0.00006656441,0.00012266963,0.00004483081,0.00005743538,0.000103846854,0.00027775826,0.015664015,2.7401018e-7,0.037729826,0.020691855,0.925233],"study_design_scores_gemma":[0.0007918118,0.00017337476,0.0004219608,0.00046992136,0.000015307764,0.000038116577,0.000009470841,0.43194884,0.0000020093541,0.008832634,0.5564321,0.0008644281],"about_ca_topic_score_codex":0.00007468624,"about_ca_topic_score_gemma":0.000024101713,"teacher_disagreement_score":0.92436856,"about_ca_system_score_codex":0.00030307955,"about_ca_system_score_gemma":0.0004616838,"threshold_uncertainty_score":0.9997885},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011843878,0.0006871169,0.013759748,0.000039476607,0.00027715813,0.0003120855,0.00023715726,0.000117703385,0.9844511],"genre_scores_gemma":[0.020673836,0.00031155083,0.010707112,0.00001464643,0.0017540535,0.000043480406,0.00065444305,0.00018718318,0.9656537],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816924,0.000027859574,0.0005531373,0.00050622533,0.0004548261,0.00028870103],"domain_scores_gemma":[0.99817395,0.00011087957,0.000544841,0.000714947,0.00030526533,0.00015013771],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027543365,0.0004729163,0.0008831709,0.00020054965,0.0000532623,0.000019007179,0.0004244659,0.00019057417,0.0029405712],"category_scores_gemma":[0.0000071619224,0.00048354955,0.00043169985,0.00007028713,0.00014318433,0.00008811768,0.00023209804,0.00049639866,0.00012868442],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025890342,0.00018085334,0.00053202757,0.000051857452,0.0011375911,0.000019404752,0.00021281952,0.000066955785,0.000010752818,0.27143478,0.07350902,0.652818],"study_design_scores_gemma":[0.00024396228,0.00010640674,0.000068340436,0.000097744676,0.00028260026,0.0000014471834,0.000017907423,0.0012966037,0.000013414779,0.29926783,0.6980014,0.0006023631],"about_ca_topic_score_codex":0.0001502509,"about_ca_topic_score_gemma":0.000026635103,"teacher_disagreement_score":0.65221566,"about_ca_system_score_codex":0.000089720175,"about_ca_system_score_gemma":0.00020996928,"threshold_uncertainty_score":0.99976164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021912389,0.014488778,0.9224223,0.002185011,0.003807885,0.003724793,0.00043305827,0.00077928,0.051939752],"genre_scores_gemma":[0.00074969255,0.0032001974,0.8415178,0.00007163446,0.0031125653,0.00020296458,0.0004059322,0.00024419933,0.15049502],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966417,0.000040444527,0.0008602988,0.0013408689,0.00066721346,0.000449508],"domain_scores_gemma":[0.9966822,0.00025692905,0.00082036934,0.0013158846,0.00067051227,0.00025410575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007958019,0.00061741984,0.0007663937,0.00036110225,0.00018068678,0.00010276171,0.001095118,0.00035843917,0.000007901706],"category_scores_gemma":[0.0001449896,0.0005896266,0.00021194849,0.00014562487,0.00018865241,0.00027748535,0.0003897979,0.00045776364,0.000025547282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024430314,0.000088839675,0.000007321528,0.00031020242,0.00011864997,0.000007990027,0.0010155317,0.00032986264,0.00006779621,0.14430045,0.0072699892,0.8464589],"study_design_scores_gemma":[0.0007759441,0.0004132879,0.000108630724,0.00018967631,0.00007919761,0.00005713428,0.000010191171,0.41838494,0.00009795686,0.07336198,0.5056712,0.0008498564],"about_ca_topic_score_codex":0.00002708319,"about_ca_topic_score_gemma":0.000001981041,"teacher_disagreement_score":0.84560907,"about_ca_system_score_codex":0.000084057356,"about_ca_system_score_gemma":0.00031972997,"threshold_uncertainty_score":0.9996555},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008567678,0.00075864483,0.41883633,0.000081318736,0.0010168635,0.00029824095,0.00016932031,0.000102062266,0.5787287],"genre_scores_gemma":[0.00095100346,0.006287796,0.5117066,0.00013238558,0.0008218196,0.000044600365,0.00052891456,0.00016311153,0.47936374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971417,0.00004738455,0.0009689958,0.0007298914,0.0008338423,0.00027817418],"domain_scores_gemma":[0.99623805,0.00033205142,0.0009785597,0.001925891,0.00036563489,0.00015983952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002624203,0.0004149321,0.00083335506,0.0003968254,0.00008722913,0.00003388343,0.0018963651,0.00031969213,0.00018965764],"category_scores_gemma":[0.00004616445,0.0003878414,0.00032974352,0.00013977008,0.00023625464,0.00028213527,0.0008258587,0.00037086842,0.000050923045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011173655,0.00009628823,0.00003558738,0.00019264975,0.00016896348,0.00002552507,0.00040838504,0.0001252817,0.00006874062,0.75658756,0.03083561,0.2114442],"study_design_scores_gemma":[0.0010031334,0.00038291086,0.0005044165,0.00066965393,0.00013211199,0.000024996845,0.000013810976,0.024617124,0.00064618915,0.16309991,0.80787444,0.0010313226],"about_ca_topic_score_codex":0.00008926766,"about_ca_topic_score_gemma":0.000003987408,"teacher_disagreement_score":0.7770388,"about_ca_system_score_codex":0.000019400637,"about_ca_system_score_gemma":0.00014323034,"threshold_uncertainty_score":0.99985737},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000949248,0.00057244644,0.288631,0.000120481986,0.0019804465,0.00021946146,0.00023798626,0.000110582805,0.7081181],"genre_scores_gemma":[0.00063590007,0.005883337,0.12538028,0.000106583095,0.001185292,0.000025367848,0.000103144615,0.00012358249,0.8665565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997797,0.000026089217,0.0007555018,0.00059457816,0.00056803576,0.00025876221],"domain_scores_gemma":[0.99741405,0.00016875134,0.0006801044,0.0012839852,0.000305157,0.00014797541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017603938,0.0003754862,0.00062857737,0.00037637804,0.00006125304,0.000020983607,0.0014689378,0.00033956527,0.00033125386],"category_scores_gemma":[0.000042317744,0.00029562705,0.00026516934,0.00010076174,0.00020288274,0.00044632968,0.00088978384,0.00030692952,0.00010508174],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014362479,0.0000993839,0.000019467916,0.00012896789,0.00019541645,0.000039729755,0.00053826516,0.0000030403835,0.00011731783,0.23778592,0.025643107,0.73541504],"study_design_scores_gemma":[0.00081089,0.0004376628,0.00018738607,0.0013490648,0.00007689465,0.000042529562,0.000011704425,0.0043569733,0.00057382265,0.07021912,0.9210374,0.00089656113],"about_ca_topic_score_codex":0.000051833707,"about_ca_topic_score_gemma":0.000010076391,"teacher_disagreement_score":0.89539427,"about_ca_system_score_codex":0.0000541101,"about_ca_system_score_gemma":0.00019995942,"threshold_uncertainty_score":0.9999496},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058952046,0.0008365072,0.19071488,0.0005709608,0.0005976362,0.00056723785,0.000054567077,0.00014394148,0.8064553],"genre_scores_gemma":[0.0026584584,0.0031613775,0.24232368,0.00011881497,0.0005100904,0.0000465323,0.00003766096,0.00012746516,0.7510159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997931,0.000045543296,0.0005891614,0.00059331045,0.0004701685,0.00037083877],"domain_scores_gemma":[0.99857235,0.00016723515,0.00028100898,0.00068720017,0.00013761161,0.00015462081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203724,0.0003366623,0.00047300948,0.0006104787,0.000048068483,0.000042345237,0.0010624815,0.0002836716,0.00015531662],"category_scores_gemma":[0.000056219204,0.0002724699,0.00016669137,0.00011482356,0.00011596545,0.0001377351,0.00037812995,0.0004893832,0.00006188352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011958691,0.00012473861,0.0018356153,0.0001122268,0.00009580894,0.00022301904,0.0022528865,0.0013282561,0.000016362294,0.10152154,0.00085005094,0.89162755],"study_design_scores_gemma":[0.010991136,0.0019006854,0.019807966,0.0066223233,0.00030409932,0.00019813293,0.00010195469,0.16579084,0.0005428586,0.29412127,0.48997137,0.00964736],"about_ca_topic_score_codex":0.000039196548,"about_ca_topic_score_gemma":0.000051056686,"teacher_disagreement_score":0.8819802,"about_ca_system_score_codex":0.00007106244,"about_ca_system_score_gemma":0.00019349658,"threshold_uncertainty_score":0.99997276},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066101393,0.0010388171,0.25003493,0.00014299662,0.0011278054,0.00032535126,0.00040994032,0.000106107356,0.74680746],"genre_scores_gemma":[0.00046963818,0.009841667,0.30223644,0.00007974142,0.0007424636,0.000044008004,0.00020990311,0.00014339907,0.68623275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99720126,0.00003746478,0.0009297513,0.00072746567,0.00081356394,0.00029049462],"domain_scores_gemma":[0.9963586,0.0003437215,0.0009254651,0.0018390763,0.00037486744,0.0001583015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020308256,0.00040571918,0.0007439919,0.00039673978,0.00008161527,0.000026842188,0.0018450739,0.00030688228,0.00029749877],"category_scores_gemma":[0.00003987756,0.00032437645,0.00032277775,0.000120252625,0.00026454666,0.0004916131,0.0008717031,0.00027540777,0.00006731615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012253193,0.00009514334,0.000031605003,0.0001108879,0.00016398118,0.000036877394,0.00029459575,0.000013761314,0.00014554893,0.73387873,0.01748489,0.24773175],"study_design_scores_gemma":[0.0012949602,0.00034538945,0.00048217844,0.0011428044,0.000116944975,0.000028339256,0.000013207848,0.0035270923,0.0011742343,0.35290036,0.63786733,0.0011071783],"about_ca_topic_score_codex":0.000037265854,"about_ca_topic_score_gemma":0.0000024647416,"teacher_disagreement_score":0.6203824,"about_ca_system_score_codex":0.000025147501,"about_ca_system_score_gemma":0.00018433983,"threshold_uncertainty_score":0.99992085},"labels":[],"label_agreement":null}]}