{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002030826,0.0004057192,0.0007439919,0.0003967398,0.00008161527,0.00002684219,0.001845074,0.0003068823,0.0002974988],"category_scores_gemma":[0.00003987756,0.0003243765,0.0003227777,0.0001202526,0.0002645467,0.0004916131,0.0008717031,0.0002754078,0.00006731615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000251475,"about_ca_system_score_gemma":0.0001843398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003726585,"about_ca_topic_score_gemma":0.000002464742,"domain_scores_codex":[0.9972013,0.00003746478,0.0009297513,0.0007274657,0.0008135639,0.0002904946],"domain_scores_gemma":[0.9963586,0.0003437215,0.0009254651,0.001839076,0.0003748674,0.0001583015],"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.00001225319,0.00009514334,0.000031605,0.0001108879,0.0001639812,0.00003687739,0.0002945958,0.00001376131,0.0001455489,0.7338787,0.01748489,0.2477317],"study_design_scores_gemma":[0.00129496,0.0003453894,0.0004821784,0.001142804,0.000116945,0.00002833926,0.00001320785,0.003527092,0.001174234,0.3529004,0.6378673,0.001107178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000006610139,0.001038817,0.2500349,0.0001429966,0.001127805,0.0003253513,0.0004099403,0.0001061074,0.7468075],"genre_scores_gemma":[0.0004696382,0.009841667,0.3022364,0.00007974142,0.0007424636,0.000044008,0.0002099031,0.0001433991,0.6862327],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6203824,"threshold_uncertainty_score":0.9999208,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001194149,0.0001745957,0.0002245999,0.00008964821,0.0002745354,0.00003559113,0.000950858,0.00007499109,0.00004283465],"category_scores_gemma":[0.00003338183,0.0001514075,0.0000761864,0.0004141517,0.0001171318,0.000814561,0.000344503,0.0001625707,0.00007338372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002810027,"about_ca_system_score_gemma":0.0001559656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000902455,"about_ca_topic_score_gemma":0.00001021639,"domain_scores_codex":[0.9984441,0.0000418997,0.0003530704,0.0004172238,0.000457392,0.0002862676],"domain_scores_gemma":[0.998776,0.00007442221,0.00007745049,0.0007906602,0.0001424692,0.0001389682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000534313,0.003529109,0.005311812,0.0001523024,0.0003350657,0.0007660317,0.01565216,0.03732824,0.001965215,0.2745332,0.338019,0.3223545],"study_design_scores_gemma":[0.001889654,0.0004345372,0.02420517,0.000116798,0.00002893044,0.0003606601,0.0001864351,0.4489777,0.002294149,0.005457855,0.5146762,0.001371933],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006818705,0.0005124644,0.9778014,0.0005195296,0.001442397,0.0001660819,0.00003483414,0.0001601873,0.01254441],"genre_scores_gemma":[0.1448385,0.002972076,0.8413752,0.0004233375,0.001523897,0.00005955295,0.00005979831,0.00004094308,0.008706652],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4116495,"threshold_uncertainty_score":0.6174219,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002046334,0.0003381058,0.0004024903,0.0003032228,0.00007310695,0.00003103735,0.000574066,0.0002802673,0.0001701982],"category_scores_gemma":[0.00001791056,0.0002952165,0.0002395833,0.00009689759,0.00008300961,0.000303317,0.0001229603,0.0002351443,0.0001880811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006876719,"about_ca_system_score_gemma":0.0002931401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001776537,"about_ca_topic_score_gemma":0.000005429604,"domain_scores_codex":[0.9981134,0.00002752678,0.0004765578,0.0005806525,0.0005709074,0.000230964],"domain_scores_gemma":[0.9986345,0.0001699076,0.0002994704,0.000482927,0.0003011686,0.0001120482],"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.00001010068,0.00003100915,0.000001769767,0.00004397881,0.0001168765,0.00004793908,0.0003848547,0.00008499825,0.00005809473,0.4003675,0.001794873,0.597058],"study_design_scores_gemma":[0.00091107,0.0004633263,0.0003057407,0.0003591882,0.00008806926,0.00006789681,0.000006157878,0.008996659,0.0001739556,0.3199352,0.6675939,0.001098829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001243502,0.0008109246,0.4699828,0.0005841756,0.001049534,0.0002014691,0.00009129893,0.0000783643,0.527189],"genre_scores_gemma":[0.00121101,0.002240672,0.0666647,0.0001434985,0.0008305672,0.00001653116,0.00009892989,0.00005504691,0.9287391],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6657991,"threshold_uncertainty_score":0.99995,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002043849,0.0003955611,0.0006404357,0.0005526438,0.000180649,0.00003285732,0.001557111,0.0002716669,0.00009762168],"category_scores_gemma":[0.00004455803,0.0003909491,0.0002074685,0.0002625945,0.0001107666,0.0004174089,0.0007844435,0.0003587343,0.0001105754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007296386,"about_ca_system_score_gemma":0.000308866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005746617,"about_ca_topic_score_gemma":0.000004698824,"domain_scores_codex":[0.9972954,0.00002250871,0.0009004872,0.0007344776,0.0007470772,0.0003000142],"domain_scores_gemma":[0.9973385,0.0002099483,0.00061931,0.001256398,0.000370294,0.0002055517],"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.000009650986,0.0001485727,0.0000503287,0.0001909239,0.0001308911,0.00004588337,0.002846728,0.0004359039,0.0001262465,0.1381044,0.01241209,0.8454983],"study_design_scores_gemma":[0.0003448518,0.0002074848,0.0003298022,0.0005105425,0.00004838813,0.00005610734,0.0000370557,0.004868378,0.0003000692,0.009417387,0.9830887,0.0007912391],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001293661,0.00117143,0.5965236,0.000104461,0.0003582153,0.0006359332,0.0001576658,0.00009660947,0.4009391],"genre_scores_gemma":[0.001682344,0.01101712,0.7810414,0.0002059737,0.001356703,0.0002647727,0.0003044413,0.0001660144,0.2039612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9706766,"threshold_uncertainty_score":0.9998543,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001440403,0.0003555446,0.0004408386,0.0003298929,0.0001046421,0.00002596179,0.0005621251,0.0002960607,0.00009148481],"category_scores_gemma":[0.00001567652,0.0003718017,0.0002638795,0.0001418184,0.00009621828,0.0002760845,0.0001132485,0.0003477883,0.0001161969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006417897,"about_ca_system_score_gemma":0.0003572364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005437527,"about_ca_topic_score_gemma":0.00000718769,"domain_scores_codex":[0.9980139,0.00002674319,0.0005057155,0.0005858433,0.0006406875,0.0002271855],"domain_scores_gemma":[0.9986879,0.0001272958,0.0002949953,0.0004712408,0.0003047468,0.0001138698],"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.00002660506,0.0001390815,0.000005758314,0.0001260064,0.0003378618,0.0003610433,0.003039823,0.001990614,0.0000509105,0.1444796,0.01955846,0.8298842],"study_design_scores_gemma":[0.0007979496,0.0005080642,0.0005687849,0.0001832358,0.00008144562,0.000232897,0.000009475972,0.03467265,0.0001129859,0.04358247,0.918097,0.001153079],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00004875812,0.002458666,0.3994597,0.0003955711,0.001298479,0.000309731,0.00008343534,0.0001227308,0.5958229],"genre_scores_gemma":[0.00182248,0.01209299,0.1530589,0.0002297704,0.0009444096,0.00002176126,0.0003538097,0.00008049956,0.8313954],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8985385,"threshold_uncertainty_score":0.9998734,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002922577,0.0002696846,0.0005085533,0.0001864461,0.00005012305,0.00003630574,0.0005556268,0.0002091738,0.00006101383],"category_scores_gemma":[0.00002502901,0.000259364,0.00008695316,0.00006928371,0.000164261,0.0001808934,0.0003642178,0.0002345551,0.00001109309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002065421,"about_ca_system_score_gemma":0.00007255503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003475199,"about_ca_topic_score_gemma":0.000002570898,"domain_scores_codex":[0.9983928,0.0000191397,0.0005155115,0.0004122613,0.0004421533,0.0002182007],"domain_scores_gemma":[0.9986489,0.0001337713,0.0003887539,0.0004707048,0.0002246408,0.0001331898],"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.00003559949,0.0002184439,0.0001971608,0.002357909,0.0004576635,0.00004523639,0.006934348,0.01076404,0.0003885013,0.2134422,0.01411567,0.7510432],"study_design_scores_gemma":[0.001106494,0.0006765607,0.00004121271,0.000565681,0.00005068544,0.00002579631,0.0000522789,0.1284566,0.001286857,0.005850381,0.8608112,0.00107634],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000695179,0.00153335,0.2666758,0.0001421414,0.000765593,0.0008756587,0.000122836,0.0001683608,0.7290211],"genre_scores_gemma":[0.001714313,0.02204415,0.1650025,0.0001116009,0.0003734059,0.00003758619,0.00008106633,0.0001307639,0.8105047],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8466955,"threshold_uncertainty_score":0.9999859,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002438814,0.0003076398,0.0003819049,0.0008845823,0.0000641059,0.00003615472,0.0007319337,0.0002406318,0.0002641575],"category_scores_gemma":[0.00006024645,0.0002634727,0.0002009065,0.0002709419,0.0000660218,0.0003079714,0.0002716112,0.0001927744,0.000396415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006758286,"about_ca_system_score_gemma":0.0002388828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002771711,"about_ca_topic_score_gemma":9.404049e-7,"domain_scores_codex":[0.9980392,0.00001658969,0.0004877684,0.0005498085,0.0006622244,0.0002444272],"domain_scores_gemma":[0.998403,0.0002341169,0.0003743272,0.0005860111,0.000269351,0.0001332223],"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.000002330229,0.00001720686,0.000002856206,0.00002245755,0.00005397783,0.00001780846,0.00004708946,0.0000730924,0.000006894119,0.3778618,0.008424898,0.6134696],"study_design_scores_gemma":[0.0003137789,0.000153148,0.00009647109,0.00009733086,0.0000264435,0.00002024875,0.000001130757,0.001060864,0.0001231222,0.1063962,0.8912234,0.0004878502],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000004392914,0.001068391,0.3488593,0.000327641,0.001397382,0.0001431785,0.00002782889,0.00007777997,0.6480941],"genre_scores_gemma":[0.0002306121,0.002354924,0.06419917,0.00009350024,0.001117532,0.000009274956,0.00003474862,0.00003611144,0.9319241],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8827985,"threshold_uncertainty_score":0.9999818,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003161627,0.0002599687,0.0004615302,0.0007514055,0.00005839268,0.00002146898,0.0007345591,0.0002593872,0.00009450418],"category_scores_gemma":[0.0000303004,0.0002651352,0.0001977962,0.0004953588,0.00007842677,0.000113824,0.0002384745,0.0002407381,0.00004898082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002962383,"about_ca_system_score_gemma":0.0001326206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008816495,"about_ca_topic_score_gemma":0.000001798925,"domain_scores_codex":[0.998157,0.00002118566,0.0006505901,0.0004590914,0.0005245336,0.0001876295],"domain_scores_gemma":[0.997885,0.0002831695,0.0006258301,0.0006925899,0.0004127545,0.0001006852],"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.00000183013,0.00003020625,0.000006217483,0.0000496602,0.00005339943,0.00000131956,0.00003541355,0.007107002,0.000001631712,0.3143019,0.003870652,0.6745408],"study_design_scores_gemma":[0.0002372009,0.0001527039,0.0001449991,0.00006246703,0.0000543285,0.000009398486,0.000001320187,0.05382084,0.00005153913,0.03573468,0.9093306,0.0003998877],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000001885888,0.001380597,0.7226579,0.00006034449,0.000458008,0.0002500248,0.00001477602,0.00004008555,0.2751364],"genre_scores_gemma":[0.003736813,0.004412937,0.2524793,0.0001488673,0.002720479,0.00009371171,0.0003301668,0.00007971165,0.735998],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.90546,"threshold_uncertainty_score":0.9999801,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003918781,0.0004830443,0.0006546956,0.0002582154,0.0001313828,0.0001113583,0.001113013,0.0003443516,0.00004554967],"category_scores_gemma":[0.00003181581,0.0004477031,0.000127543,0.00007236425,0.0001250875,0.0003799062,0.001093102,0.000506439,0.00004162908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004323041,"about_ca_system_score_gemma":0.0001120929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005795982,"about_ca_topic_score_gemma":0.000006372903,"domain_scores_codex":[0.9974406,0.00002311,0.0006514064,0.0008536485,0.0005907916,0.0004403919],"domain_scores_gemma":[0.9978918,0.0001775756,0.0005086582,0.001036076,0.0001320368,0.0002538557],"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.000003299535,0.00002371416,0.00006968101,0.000221134,0.0000642463,0.00003672006,0.0002720694,0.00003789993,0.00001487447,0.1881251,0.001776188,0.8093551],"study_design_scores_gemma":[0.0006381895,0.0002626323,0.0003810478,0.0009636458,0.00005797481,0.00006465669,0.000005997323,0.01251006,0.00009276464,0.03022872,0.9537672,0.001027108],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00008794616,0.003816234,0.4627506,0.0001089663,0.001386095,0.0005198104,0.00005844244,0.0002636554,0.5310082],"genre_scores_gemma":[0.002590789,0.02572063,0.4233429,0.0001623146,0.003117939,0.00005545649,0.0002244746,0.0003047342,0.5444807],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.951991,"threshold_uncertainty_score":0.9997975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002672341,0.0004638081,0.0005555117,0.000292522,0.00008448868,0.0001228517,0.001387201,0.0002509113,0.0002968035],"category_scores_gemma":[0.00002949839,0.000366775,0.0001408542,0.000090639,0.0002810918,0.0008831453,0.00115594,0.0002959285,0.0001960523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000416582,"about_ca_system_score_gemma":0.0000542948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001056479,"about_ca_topic_score_gemma":0.000009236856,"domain_scores_codex":[0.9977002,0.00002391835,0.0005860442,0.0008343039,0.0004937941,0.000361758],"domain_scores_gemma":[0.9981986,0.0001464855,0.000437743,0.0009568112,0.00009778448,0.0001625758],"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.000004403863,0.00001740393,0.0000103983,0.00007018793,0.0001074679,0.0001005195,0.0002613047,1.233693e-7,0.000001748831,0.3197005,0.005022177,0.6747038],"study_design_scores_gemma":[0.0005031223,0.0002020237,0.0001156702,0.0005092526,0.00005937271,0.00001745325,0.00001135928,0.00123659,0.000006836809,0.07378496,0.9228688,0.0006845621],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000007589083,0.002877461,0.03389673,0.0007271108,0.00200181,0.0003677708,0.0002290022,0.0001926456,0.9596999],"genre_scores_gemma":[0.0001114227,0.01442428,0.02316871,0.00008083305,0.0005415311,0.00001861564,0.00007453134,0.00007133275,0.9615088],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9178466,"threshold_uncertainty_score":0.9998784,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004165548,0.0005801569,0.0007922439,0.0002880543,0.0001617338,0.00009095835,0.002191202,0.0005126885,0.0002144342],"category_scores_gemma":[0.00002717292,0.0005081668,0.0002854786,0.00007123838,0.0001073629,0.0004432814,0.001457688,0.0005961513,0.000219158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005145533,"about_ca_system_score_gemma":0.000131238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002374792,"about_ca_topic_score_gemma":0.000001161515,"domain_scores_codex":[0.9967719,0.0000482111,0.000792033,0.0009852049,0.0009937232,0.0004089295],"domain_scores_gemma":[0.9966629,0.0001785356,0.0007242889,0.002028572,0.0001749228,0.0002308353],"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.00001148405,0.00005326332,0.000002757776,0.0001938725,0.00006869607,0.0001019191,0.0005555429,0.00008776753,0.0002559163,0.3091353,0.04385585,0.6456776],"study_design_scores_gemma":[0.0003365285,0.0001306075,0.00001510235,0.0008120504,0.00002895463,0.00002890614,0.000005362378,0.004709099,0.0004845686,0.09899413,0.8937311,0.0007236095],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.000006577194,0.0009070011,0.5542098,0.00008561013,0.001327247,0.0002100134,0.00003801267,0.0001872482,0.4430285],"genre_scores_gemma":[0.00007572193,0.002511401,0.4303663,0.0001404192,0.001542624,0.00001838411,0.0001526664,0.0001286721,0.5650638],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8498752,"threshold_uncertainty_score":0.999737,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003093069,0.0003539959,0.000571433,0.0001427236,0.00004951927,0.00003680572,0.001041387,0.0003453651,0.0002801991],"category_scores_gemma":[0.00001166553,0.0003414893,0.0002322002,0.00007200948,0.00009281129,0.0002998811,0.00009159595,0.0003728899,0.0002082653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008102304,"about_ca_system_score_gemma":0.0003900321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002499225,"about_ca_topic_score_gemma":0.000004301024,"domain_scores_codex":[0.9977146,0.00001673506,0.0005912705,0.0005419899,0.0008778541,0.0002575621],"domain_scores_gemma":[0.9983033,0.00005531849,0.0003495297,0.000743088,0.0003488508,0.0001998913],"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.00001297969,0.00009336456,0.000002263413,0.0001347775,0.0002222967,0.0001643986,0.00068578,0.000207085,0.000005880165,0.2784045,0.171461,0.5486057],"study_design_scores_gemma":[0.0003294571,0.00008260473,0.00001052295,0.0001224513,0.00002154749,0.00004224372,0.000006586102,0.001654271,0.00001002612,0.01631279,0.9810098,0.0003976843],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000001010239,0.002262857,0.1804033,0.0001376477,0.002038327,0.0001869663,0.0002003412,0.0001078221,0.8146617],"genre_scores_gemma":[0.000145375,0.0006417379,0.02062274,0.00004697992,0.0008430887,0.00001615482,0.00007740097,0.00004385129,0.9775627],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8095489,"threshold_uncertainty_score":0.9999037,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004389285,0.0006294985,0.001098124,0.0005411232,0.0000879408,0.00002820032,0.0020234,0.0004301505,0.00009823588],"category_scores_gemma":[0.00005854917,0.0004900693,0.0005018197,0.000151356,0.0003312042,0.0001632398,0.0007683535,0.0005017222,0.00005548841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004381907,"about_ca_system_score_gemma":0.000286154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002162906,"about_ca_topic_score_gemma":0.000004121054,"domain_scores_codex":[0.9966554,0.00005337489,0.001043682,0.0008808433,0.000856427,0.0005102513],"domain_scores_gemma":[0.9966658,0.0003872982,0.001027671,0.001418648,0.0003012499,0.0001993435],"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.00001029095,0.00006736021,0.0000200573,0.0001819103,0.0002033164,0.00007981773,0.0005787415,0.00003223126,0.00004245698,0.4075115,0.002627065,0.5886453],"study_design_scores_gemma":[0.001767141,0.001799649,0.0007597409,0.003273537,0.0001959295,0.0001639106,0.00001907,0.1047575,0.0005920964,0.2947732,0.5888215,0.003076736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002107403,0.002778376,0.224932,0.000700848,0.002729865,0.0004846143,0.0003215604,0.0003080185,0.767534],"genre_scores_gemma":[0.003430761,0.008829474,0.2300663,0.0002195383,0.003586914,0.00002267066,0.00008138761,0.0003165742,0.7534463],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5861944,"threshold_uncertainty_score":0.9997551,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004985413,0.0004922776,0.0006698439,0.0006481605,0.00006485669,0.00004860106,0.001662728,0.0003278558,0.0002096102],"category_scores_gemma":[0.00005837773,0.0004057682,0.0001691602,0.0001698617,0.0001924142,0.0006272345,0.000497899,0.0005899079,0.0001532973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001526401,"about_ca_system_score_gemma":0.0003450413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000320724,"about_ca_topic_score_gemma":0.000024095,"domain_scores_codex":[0.9967229,0.00005809794,0.0008664202,0.0008020001,0.001050828,0.0004996914],"domain_scores_gemma":[0.997947,0.0001654249,0.0004528398,0.0008377635,0.0004023547,0.0001945761],"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.000009629685,0.0001098804,0.00005348322,0.00006397547,0.00007164438,0.00005623989,0.0006699032,0.0005689752,0.000003878655,0.05656978,0.0004949784,0.9413276],"study_design_scores_gemma":[0.002846411,0.0008825802,0.0004569233,0.00191591,0.00003480903,0.00004289071,0.00002077737,0.177178,0.000174339,0.05764399,0.7567307,0.002072655],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001822553,0.0007929783,0.280855,0.0004772335,0.001141695,0.0005718447,0.0001294378,0.0001358186,0.7158777],"genre_scores_gemma":[0.0003744796,0.0372746,0.1925951,0.0002270878,0.001049081,0.00004960963,0.00007578947,0.000134099,0.7682201],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.939255,"threshold_uncertainty_score":0.9998394,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001760394,0.0003754862,0.0006285774,0.000376378,0.00006125304,0.00002098361,0.001468938,0.0003395653,0.0003312539],"category_scores_gemma":[0.00004231774,0.000295627,0.0002651693,0.0001007617,0.0002028827,0.0004463297,0.0008897838,0.0003069295,0.0001050817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000541101,"about_ca_system_score_gemma":0.0001999594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005183371,"about_ca_topic_score_gemma":0.00001007639,"domain_scores_codex":[0.997797,0.00002608922,0.0007555018,0.0005945782,0.0005680358,0.0002587622],"domain_scores_gemma":[0.9974141,0.0001687513,0.0006801044,0.001283985,0.000305157,0.0001479754],"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.00001436248,0.0000993839,0.00001946792,0.0001289679,0.0001954164,0.00003972976,0.0005382652,0.000003040383,0.0001173178,0.2377859,0.02564311,0.735415],"study_design_scores_gemma":[0.00081089,0.0004376628,0.0001873861,0.001349065,0.00007689465,0.00004252956,0.00001170442,0.004356973,0.0005738226,0.07021912,0.9210374,0.0008965611],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00000949248,0.0005724464,0.288631,0.000120482,0.001980447,0.0002194615,0.0002379863,0.0001105828,0.7081181],"genre_scores_gemma":[0.0006359001,0.005883337,0.1253803,0.0001065831,0.001185292,0.00002536785,0.0001031446,0.0001235825,0.8665565],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8953943,"threshold_uncertainty_score":0.9999496,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003330415,0.0003849221,0.0005914946,0.0002950003,0.0001218696,0.00003101942,0.0005873874,0.0002696459,0.00007462384],"category_scores_gemma":[0.0001788508,0.0002906848,0.0001366845,0.0001165313,0.0002750952,0.0002441231,0.0004141978,0.0004715571,0.00005701272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002635114,"about_ca_system_score_gemma":0.0001667577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000449779,"about_ca_topic_score_gemma":0.00000152492,"domain_scores_codex":[0.9979223,0.00003927992,0.0007216363,0.0005929753,0.0004452377,0.0002785728],"domain_scores_gemma":[0.9981487,0.0001715562,0.0006426528,0.0006511399,0.0002583761,0.0001275892],"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.00000793742,0.00004823862,0.0001679479,0.0002673543,0.0002040822,0.00003467037,0.0007235693,0.00002199443,0.0003191633,0.04038347,0.0008106118,0.957011],"study_design_scores_gemma":[0.00362624,0.002855366,0.002835354,0.01002226,0.0006389801,0.0007478905,0.0001103596,0.03641725,0.001194271,0.08494374,0.8521662,0.004442085],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002477374,0.002995324,0.009262455,0.0003069995,0.001257312,0.0003016552,0.00005010001,0.0002188147,0.9853596],"genre_scores_gemma":[0.002620545,0.0008008697,0.0419381,0.00002549237,0.0004580958,0.00001228436,0.00001097703,0.00008675955,0.9540468],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9525689,"threshold_uncertainty_score":0.9999545,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007958019,0.0006174198,0.0007663937,0.0003611023,0.0001806868,0.0001027617,0.001095118,0.0003584392,0.000007901706],"category_scores_gemma":[0.0001449896,0.0005896266,0.0002119485,0.0001456249,0.0001886524,0.0002774853,0.0003897979,0.0004577636,0.00002554728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008405736,"about_ca_system_score_gemma":0.00031973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002708319,"about_ca_topic_score_gemma":0.000001981041,"domain_scores_codex":[0.9966417,0.00004044453,0.0008602988,0.001340869,0.0006672135,0.000449508],"domain_scores_gemma":[0.9966822,0.0002569291,0.0008203693,0.001315885,0.0006705123,0.0002541057],"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.00002443031,0.00008883968,0.000007321528,0.0003102024,0.00011865,0.000007990027,0.001015532,0.0003298626,0.00006779621,0.1443004,0.007269989,0.8464589],"study_design_scores_gemma":[0.0007759441,0.0004132879,0.0001086307,0.0001896763,0.00007919761,0.00005713428,0.00001019117,0.4183849,0.00009795686,0.07336198,0.5056712,0.0008498564],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002191239,0.01448878,0.9224223,0.002185011,0.003807885,0.003724793,0.0004330583,0.00077928,0.05193975],"genre_scores_gemma":[0.0007496926,0.003200197,0.8415178,0.00007163446,0.003112565,0.0002029646,0.0004059322,0.0002441993,0.150495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8456091,"threshold_uncertainty_score":0.9996555,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000817258,0.0003372901,0.000489609,0.0000261574,0.0001046804,0.00001275622,0.0003745174,0.0003239785,0.001944203],"category_scores_gemma":[0.00001246509,0.0001432642,0.0003093948,0.00005441711,0.000119158,0.00007470636,0.0001172859,0.0002993342,0.0001936164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003036535,"about_ca_system_score_gemma":0.000027743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001010726,"about_ca_topic_score_gemma":0.00008713282,"domain_scores_codex":[0.9984902,0.00001191165,0.0004510367,0.0004121682,0.0003435508,0.0002910998],"domain_scores_gemma":[0.9992141,0.0001759467,0.0002730682,0.0001114855,0.00008336802,0.0001420948],"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.00001891276,0.00006041972,0.0006878254,0.00002390664,0.00009503835,0.0001097905,0.000484478,0.000002243914,0.0001526015,0.001611928,0.0240185,0.9727343],"study_design_scores_gemma":[0.0000881281,0.000128693,0.004695186,0.00006030592,0.0000300376,0.00001490933,0.00002119985,0.000005937745,0.00006796196,0.0006336794,0.9938769,0.0003770971],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0322156,0.001738088,0.000002308831,0.0001456732,0.0004001144,0.000268371,0.00004641155,0.00007747337,0.965106],"genre_scores_gemma":[0.01470201,0.02156642,0.0007167166,0.00009418344,0.002933731,0.00002393253,0.0004286562,0.00001094645,0.9595234],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9723573,"threshold_uncertainty_score":0.9989682,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005733123,0.00063133,0.0007947328,0.0003701788,0.0001937405,0.0001100326,0.00208661,0.0003886702,0.0001939845],"category_scores_gemma":[0.00005018471,0.0005308096,0.0003524025,0.00009189243,0.000163522,0.0003373376,0.00112414,0.0009582,0.0003499927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006252158,"about_ca_system_score_gemma":0.0001906566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002754059,"about_ca_topic_score_gemma":0.000004064002,"domain_scores_codex":[0.9962647,0.00007323847,0.0007138725,0.001070363,0.001356071,0.0005217791],"domain_scores_gemma":[0.9970202,0.0003664557,0.0004919333,0.001665107,0.0001564639,0.0002997812],"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.00002324788,0.00003883784,0.00001888302,0.00009043059,0.00008190407,0.0001000505,0.0002454017,0.0000584079,0.00000435527,0.4208194,0.01154493,0.5669742],"study_design_scores_gemma":[0.0006293512,0.0005297104,0.0002834023,0.000676667,0.00003964302,0.00002929687,0.000003378677,0.01544662,0.0000219493,0.0243121,0.957087,0.0009408388],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001481015,0.0004283071,0.3340032,0.000206776,0.001623455,0.0003113725,0.0001876122,0.0001715569,0.6630529],"genre_scores_gemma":[0.0004990544,0.0042617,0.2523936,0.0005636968,0.005003451,0.00004845766,0.0005096014,0.000267243,0.7364532],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9455421,"threshold_uncertainty_score":0.9997144,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001503303,0.000430885,0.0007779947,0.001405842,0.00006836024,0.0000856445,0.003763329,0.000531281,0.0001101871],"category_scores_gemma":[0.0002090863,0.0004566426,0.000164629,0.0009992531,0.0001686419,0.0003905286,0.001825681,0.001516072,0.00008840269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003030795,"about_ca_system_score_gemma":0.0004616838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007468624,"about_ca_topic_score_gemma":0.00002410171,"domain_scores_codex":[0.996415,0.0001232762,0.0009660639,0.0007084159,0.001167244,0.0006199562],"domain_scores_gemma":[0.9959155,0.0007562818,0.0005373295,0.00206593,0.0004529099,0.0002720046],"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.000007927292,0.00006656441,0.0001226696,0.00004483081,0.00005743538,0.0001038469,0.0002777583,0.01566401,2.740102e-7,0.03772983,0.02069185,0.925233],"study_design_scores_gemma":[0.0007918118,0.0001733748,0.0004219608,0.0004699214,0.00001530776,0.00003811658,0.000009470841,0.4319488,0.000002009354,0.008832634,0.5564321,0.0008644281],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000007903496,0.01769813,0.194992,0.000170284,0.0007465953,0.0004412869,0.000007019332,0.0001296699,0.7858071],"genre_scores_gemma":[0.003309855,0.04472214,0.1730736,0.00007515357,0.002011421,0.00009429269,0.0001272133,0.0002613593,0.7763249],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9243686,"threshold_uncertainty_score":0.9997885,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002452098,0.0003260935,0.0004043618,0.0009354995,0.0000709493,0.00003696499,0.0007617152,0.0002566475,0.0002039996],"category_scores_gemma":[0.00005480208,0.0002804353,0.0001932619,0.0002657991,0.00006628866,0.0003009826,0.0001708554,0.0002072797,0.0003900438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007066834,"about_ca_system_score_gemma":0.000240256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004064868,"about_ca_topic_score_gemma":0.000001474599,"domain_scores_codex":[0.9979539,0.00001805851,0.0005032485,0.000572334,0.0006908534,0.0002616226],"domain_scores_gemma":[0.9984004,0.0002544854,0.0003855043,0.0005832134,0.0002319379,0.0001444982],"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.000003783193,0.00002052367,0.000004331754,0.00002804897,0.00007266447,0.00003063495,0.00006320093,0.00006556449,0.000009057278,0.4820967,0.01394502,0.5036605],"study_design_scores_gemma":[0.0003583166,0.0001822916,0.0001203289,0.0001106241,0.00003042317,0.00002735991,0.000001595133,0.0008597719,0.00008726479,0.1502,0.8474799,0.0005421301],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000004508981,0.001062014,0.3715094,0.0003669612,0.001384248,0.000153601,0.00004658606,0.00008173568,0.6253909],"genre_scores_gemma":[0.0002264655,0.002287815,0.07282561,0.0001222875,0.001308193,0.00001043051,0.00006321196,0.00004211719,0.9231139],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8335349,"threshold_uncertainty_score":0.9999648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002002717,0.0005791472,0.0007740514,0.0003811048,0.0001392029,0.00004311375,0.001702765,0.0004660012,0.0001995192],"category_scores_gemma":[0.0001065863,0.0004802686,0.0002849742,0.0001439915,0.000239703,0.0003501734,0.0006284809,0.001161567,0.0003515795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006329382,"about_ca_system_score_gemma":0.0003943577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008626542,"about_ca_topic_score_gemma":0.000003158671,"domain_scores_codex":[0.9971779,0.00004399657,0.0006654127,0.0008787466,0.0008224257,0.0004115364],"domain_scores_gemma":[0.9974779,0.0002615781,0.0006294543,0.001144384,0.0002822147,0.0002044158],"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.00000445772,0.00006665293,0.00006044006,0.00005681724,0.0001463209,0.0002219047,0.001848221,0.00005937984,0.000002697644,0.07331271,0.0109838,0.9132366],"study_design_scores_gemma":[0.000335872,0.0002977774,0.0002441071,0.000190587,0.00003010159,0.0000706941,0.000006794996,0.004547659,0.00003039179,0.01760452,0.9757618,0.0008796612],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001476583,0.0008657148,0.07918315,0.0002698298,0.001609252,0.0002486006,0.00002956507,0.0002828445,0.9174963],"genre_scores_gemma":[0.0001959809,0.007850405,0.139891,0.0001106488,0.001175624,0.00001661706,0.00003532311,0.00008752268,0.8506368],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.964778,"threshold_uncertainty_score":0.9997649,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004409582,0.00067458,0.001049793,0.0009382065,0.0003364648,0.0001097433,0.001886318,0.0005086051,0.00474457],"category_scores_gemma":[0.0008763185,0.0005153579,0.0004050976,0.0003626178,0.000249805,0.0003204511,0.0003413557,0.0004383522,0.004047897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001238501,"about_ca_system_score_gemma":0.0004143688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005733901,"about_ca_topic_score_gemma":6.718486e-7,"domain_scores_codex":[0.9938729,0.0002927313,0.001778993,0.001501959,0.00200722,0.000546177],"domain_scores_gemma":[0.9930167,0.002763233,0.001121796,0.001844704,0.0007232135,0.0005304167],"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.00003081149,0.000034523,1.273752e-7,0.000003489944,0.00006671017,0.00001757735,0.000405043,0.0002118182,0.0001056851,0.1643662,0.01890035,0.8158577],"study_design_scores_gemma":[0.0002296821,0.0002473118,0.000001634722,0.0001488014,0.00006677797,0.00002925255,0.00006973802,0.001221718,0.002040468,0.7915998,0.2037154,0.0006293622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[3.18525e-7,0.0000911517,0.6857115,0.0005460157,0.0009930645,0.0009478266,0.0001602376,0.00009711572,0.3114527],"genre_scores_gemma":[0.00004781641,0.0003212283,0.3830179,0.0001469963,0.0009707037,0.0001069143,0.000006783997,0.00009950215,0.6152821],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8152283,"threshold_uncertainty_score":0.9997298,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009116257,0.0004400439,0.0004680581,0.00007993531,0.000084967,0.00001271629,0.0004429431,0.0004432679,0.001551268],"category_scores_gemma":[0.00001661589,0.0003578705,0.0001528272,0.00003109884,0.0002034999,0.00008886581,0.0001186247,0.0005187404,0.00005666933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003257952,"about_ca_system_score_gemma":0.0003270613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003871035,"about_ca_topic_score_gemma":0.00001508395,"domain_scores_codex":[0.9983472,0.00000335025,0.0004607053,0.0005227473,0.0002996791,0.0003663004],"domain_scores_gemma":[0.998353,0.00009171361,0.0004819052,0.0007752856,0.0001472722,0.0001508173],"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.0003022345,0.0002359291,0.0006978551,0.00223804,0.00120416,0.0007132834,0.001494144,0.0001245931,0.07027744,0.5463174,0.008272863,0.3681221],"study_design_scores_gemma":[0.0004890685,0.00008265248,0.000004012417,0.001214688,0.0001306937,0.0001506231,0.00001743872,0.00003640923,0.0370211,0.08675626,0.8731408,0.0009563362],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0003780005,0.0002267531,0.04473242,0.00009310815,0.0000318054,0.0002382927,0.0003214515,0.0002242832,0.9537539],"genre_scores_gemma":[0.000251031,0.00320104,0.2561528,0.00004336155,0.000863173,0.0001577562,0.00007306881,0.0001884831,0.7390693],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8648679,"threshold_uncertainty_score":0.9998873,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203724,0.0003366623,0.0004730095,0.0006104787,0.00004806848,0.00004234524,0.001062482,0.0002836716,0.0001553166],"category_scores_gemma":[0.0000562192,0.0002724699,0.0001666914,0.0001148236,0.0001159654,0.0001377351,0.0003781299,0.0004893832,0.00006188352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007106244,"about_ca_system_score_gemma":0.0001934966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003919655,"about_ca_topic_score_gemma":0.00005105669,"domain_scores_codex":[0.997931,0.0000455433,0.0005891614,0.0005933105,0.0004701685,0.0003708388],"domain_scores_gemma":[0.9985723,0.0001672352,0.000281009,0.0006872002,0.0001376116,0.0001546208],"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.00001195869,0.0001247386,0.001835615,0.0001122268,0.00009580894,0.000223019,0.002252887,0.001328256,0.00001636229,0.1015215,0.0008500509,0.8916276],"study_design_scores_gemma":[0.01099114,0.001900685,0.01980797,0.006622323,0.0003040993,0.0001981329,0.0001019547,0.1657908,0.0005428586,0.2941213,0.4899714,0.00964736],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00005895205,0.0008365072,0.1907149,0.0005709608,0.0005976362,0.0005672378,0.00005456708,0.0001439415,0.8064553],"genre_scores_gemma":[0.002658458,0.003161378,0.2423237,0.000118815,0.0005100904,0.0000465323,0.00003766096,0.0001274652,0.7510159],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8819802,"threshold_uncertainty_score":0.9999728,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003029317,0.0004722759,0.000584242,0.0002581508,0.0001229059,0.00008814059,0.001082764,0.0003304941,0.0000716206],"category_scores_gemma":[0.00002746441,0.0003741751,0.0001248373,0.00006222987,0.0001401163,0.0006626847,0.001153937,0.0003756867,0.00005512629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000561001,"about_ca_system_score_gemma":0.0001445036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002415686,"about_ca_topic_score_gemma":0.000003929599,"domain_scores_codex":[0.9974698,0.00001825321,0.0006249187,0.0008507772,0.0005763111,0.0004599561],"domain_scores_gemma":[0.9979594,0.0001838073,0.0004809215,0.0009890936,0.0001353851,0.0002513903],"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.000003460238,0.00002239375,0.00005898633,0.000121439,0.00005960287,0.00005075601,0.0001874155,0.00000394557,0.00003013894,0.1807313,0.0009591761,0.8177714],"study_design_scores_gemma":[0.0009351842,0.0002685435,0.0004121302,0.001869459,0.00005816273,0.00008314497,0.000006503618,0.002013249,0.0001913819,0.07766221,0.9152496,0.001250475],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00006318871,0.004881422,0.2271031,0.0001790455,0.001434755,0.000529311,0.0001324186,0.0002558025,0.765421],"genre_scores_gemma":[0.001169392,0.03699571,0.2238005,0.00008965335,0.002586709,0.00005026513,0.00008160127,0.0002459774,0.7349802],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9142904,"threshold_uncertainty_score":0.999871,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002280876,0.0003840969,0.0007047612,0.0003764899,0.00006549372,0.00002654332,0.001510189,0.0003538899,0.0002100351],"category_scores_gemma":[0.00004906711,0.0003540725,0.0002709477,0.0001172441,0.00018104,0.0002554542,0.0008426914,0.0004143724,0.00007916753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004163213,"about_ca_system_score_gemma":0.000154768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001246304,"about_ca_topic_score_gemma":0.00001639616,"domain_scores_codex":[0.9977525,0.0000330752,0.0007876485,0.0005965895,0.0005824304,0.0002476961],"domain_scores_gemma":[0.9973252,0.0001630274,0.0007195094,0.001345272,0.0002975443,0.0001494316],"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.00001403882,0.0001079794,0.00002367891,0.0002414984,0.0002160456,0.00002944562,0.0008025435,0.00003030272,0.00005930042,0.2533032,0.04851965,0.6966524],"study_design_scores_gemma":[0.0005407672,0.0004190504,0.0001700581,0.0006780697,0.00007505995,0.00003235267,0.00001056257,0.02659946,0.0002717989,0.0266605,0.9438217,0.0007205763],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001236999,0.0004168137,0.46982,0.00006834135,0.001786217,0.0002011546,0.0000977208,0.0001064106,0.527491],"genre_scores_gemma":[0.001539886,0.004414112,0.2589954,0.0002099487,0.001551491,0.00003037973,0.0003091354,0.0001662956,0.7327834],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8953021,"threshold_uncertainty_score":0.9998911,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007578803,0.0004179412,0.0005242098,0.0002212041,0.00003207384,0.000007137873,0.0002848594,0.0004323539,0.0007150683],"category_scores_gemma":[0.000005818841,0.0004479733,0.000192393,0.00003289978,0.00007845914,0.00006510164,0.00004502172,0.0004135674,0.0001848101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009805994,"about_ca_system_score_gemma":0.00004637461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004569761,"about_ca_topic_score_gemma":0.000001018209,"domain_scores_codex":[0.9986124,0.000004890688,0.0004909983,0.0002605211,0.0003698952,0.0002612863],"domain_scores_gemma":[0.9992634,0.00004236459,0.0001023156,0.0004314887,0.000058799,0.0001016328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000827274,0.0000533348,0.00001169197,0.0005811975,0.0005725343,0.0003156005,0.001103629,0.000413937,0.000154521,0.009404331,0.5782399,0.409141],"study_design_scores_gemma":[0.0001643047,0.00009976789,0.000009708027,0.0001619399,0.00005172725,0.00002970383,0.000004594892,0.0003050097,0.0005672771,0.002629483,0.9954193,0.0005571409],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000007488651,0.004286356,0.01130663,0.00000461683,0.000631062,0.0003233454,0.00009227061,0.000654473,0.9826937],"genre_scores_gemma":[0.0005355812,0.1081859,0.01010161,0.00003735151,0.001276574,0.00006601856,0.0001624065,0.0003809005,0.8792537],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.4171794,"threshold_uncertainty_score":0.9997972,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002624203,0.0004149321,0.0008333551,0.0003968254,0.00008722913,0.00003388343,0.001896365,0.0003196921,0.0001896576],"category_scores_gemma":[0.00004616445,0.0003878414,0.0003297435,0.0001397701,0.0002362546,0.0002821353,0.0008258587,0.0003708684,0.00005092304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001940064,"about_ca_system_score_gemma":0.0001432303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008926766,"about_ca_topic_score_gemma":0.000003987408,"domain_scores_codex":[0.9971417,0.00004738455,0.0009689958,0.0007298914,0.0008338423,0.0002781742],"domain_scores_gemma":[0.9962381,0.0003320514,0.0009785597,0.001925891,0.0003656349,0.0001598395],"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.00001117366,0.00009628823,0.00003558738,0.0001926497,0.0001689635,0.00002552507,0.000408385,0.0001252817,0.00006874062,0.7565876,0.03083561,0.2114442],"study_design_scores_gemma":[0.001003133,0.0003829109,0.0005044165,0.0006696539,0.000132112,0.00002499685,0.00001381098,0.02461712,0.0006461891,0.1630999,0.8078744,0.001031323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.000008567678,0.0007586448,0.4188363,0.00008131874,0.001016864,0.0002982409,0.0001693203,0.0001020623,0.5787287],"genre_scores_gemma":[0.0009510035,0.006287796,0.5117066,0.0001323856,0.0008218196,0.00004460037,0.0005289146,0.0001631115,0.4793637],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.7770388,"threshold_uncertainty_score":0.9998574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002754336,0.0004729163,0.0008831709,0.0002005496,0.0000532623,0.00001900718,0.0004244659,0.0001905742,0.002940571],"category_scores_gemma":[0.000007161922,0.0004835495,0.0004316999,0.00007028713,0.0001431843,0.00008811768,0.000232098,0.0004963987,0.0001286844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008972018,"about_ca_system_score_gemma":0.0002099693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001502509,"about_ca_topic_score_gemma":0.0000266351,"domain_scores_codex":[0.9981692,0.00002785957,0.0005531373,0.0005062253,0.0004548261,0.000288701],"domain_scores_gemma":[0.998174,0.0001108796,0.000544841,0.000714947,0.0003052653,0.0001501377],"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.00002589034,0.0001808533,0.0005320276,0.00005185745,0.001137591,0.00001940475,0.0002128195,0.00006695578,0.00001075282,0.2714348,0.07350902,0.652818],"study_design_scores_gemma":[0.0002439623,0.0001064067,0.00006834044,0.00009774468,0.0002826003,0.000001447183,0.00001790742,0.001296604,0.00001341478,0.2992678,0.6980014,0.0006023631],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001184388,0.0006871169,0.01375975,0.00003947661,0.0002771581,0.0003120855,0.0002371573,0.0001177034,0.9844511],"genre_scores_gemma":[0.02067384,0.0003115508,0.01070711,0.00001464643,0.001754054,0.00004348041,0.0006544431,0.0001871832,0.9656537],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6522157,"threshold_uncertainty_score":0.9997616,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002162948,0.0004436766,0.0008138948,0.0003059582,0.00005084447,0.0000377562,0.001452894,0.0004298074,0.0001934649],"category_scores_gemma":[0.00002555814,0.0004483968,0.0002265491,0.000155906,0.0001024792,0.0003631738,0.0002973769,0.0004949798,0.0001411291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009453871,"about_ca_system_score_gemma":0.0002606526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008452692,"about_ca_topic_score_gemma":0.00002469476,"domain_scores_codex":[0.9972829,0.00002367981,0.0008808713,0.0007508699,0.0006691799,0.000392452],"domain_scores_gemma":[0.9981385,0.00008260029,0.000441785,0.001036553,0.0001551263,0.0001454349],"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.00003119984,0.0003608376,0.0001420725,0.0004622392,0.0002595854,0.003268121,0.006076529,0.0002113253,0.00001837252,0.08819748,0.3390881,0.5618841],"study_design_scores_gemma":[0.0007221212,0.0001051642,0.0005504772,0.000565761,0.00001118173,0.00008898963,0.0000105137,0.002341221,0.00001696393,0.003757513,0.9910162,0.0008139046],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00002435042,0.003477295,0.008455131,0.0001149462,0.001498507,0.0003875272,0.0001799247,0.0001014586,0.9857609],"genre_scores_gemma":[0.0008391771,0.01027724,0.04299933,0.000177677,0.001039327,0.00006611357,0.0002732277,0.0001154674,0.9442124],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6519281,"threshold_uncertainty_score":0.9997968,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001595405,0.0002791145,0.0004767086,0.0004655098,0.00004966733,0.00001583368,0.0006750849,0.0002117884,0.0001127308],"category_scores_gemma":[0.00001769703,0.0002666947,0.0002608198,0.0001452857,0.0001647734,0.0004327236,0.00009855425,0.0002207339,0.00006040474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001623051,"about_ca_system_score_gemma":0.0001812812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000246837,"about_ca_topic_score_gemma":0.000001758668,"domain_scores_codex":[0.9978688,0.00001239997,0.000978398,0.0002732325,0.0006758253,0.0001913217],"domain_scores_gemma":[0.9978288,0.00008899742,0.00105229,0.0005853308,0.00035312,0.00009148138],"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.00001122105,0.00008631818,0.0000641556,0.0002524075,0.0001713193,0.00003938137,0.004846047,0.0001457304,0.00000670547,0.7871025,0.03202917,0.1752451],"study_design_scores_gemma":[0.0005469028,0.0004644289,0.0006310919,0.0002341127,0.00004529635,0.0000473943,0.00007503323,0.02891569,0.0003823939,0.07322341,0.8946363,0.0007979891],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.0002274167,0.001109913,0.1854798,0.00008313875,0.0009514262,0.0003013652,0.00007017627,0.000136927,0.8116399],"genre_scores_gemma":[0.01166382,0.1902262,0.4044016,0.0008088022,0.001294124,0.00009937013,0.001413982,0.0003529846,0.3897391],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8626071,"threshold_uncertainty_score":0.9999785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}