{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"70df5d166ff1","filters":{"venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06"}},"results":[{"id":"W4254779780","doi":"10.1145/1109557.1109599","title":"Rank/select operations on large alphabets","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Search engine indexing; Rank (graph theory); Generalization; String (physics); Alphabet; Variety (cybernetics); Representation (politics); Computer science; Combinatorics; Binary number; Binary search algorithm; Theoretical computer science; Mathematics; Algorithm; Search algorithm; Arithmetic; Information retrieval; Artificial intelligence","authors":[{"name":"Alexander Golynski","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006358395880270913,"gpt":0.2351972356445886,"spread":0.2288388397643177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001459467,0.000619885,0.001755974,0.00126584,0.001348392,0.002537076,0.00177156,0.001474533,0.01236642],"category_scores_gemma":[0.009729339,0.0004079432,0.00073848,0.003232681,0.001338231,0.008518698,0.00275747,0.001638666,0.003829368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006898492,"about_ca_system_score_gemma":0.001090169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001032096,"about_ca_topic_score_gemma":0.001462654,"domain_scores_codex":[0.9972264,0.000483817,0.0002501259,0.0004797947,0.001090592,0.0004692261],"domain_scores_gemma":[0.991407,0.00416594,0.0006882462,0.00281984,0.0005971694,0.0003217886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003091218,0.0005978096,0.00227008,0.0008166234,0.00006490247,0.0009270312,0.0007937951,0.07352174,0.04260734,0.2157857,0.0404939,0.6190299],"study_design_scores_gemma":[0.0004283435,0.0008977134,0.000764027,0.0001136257,0.00008632644,0.001449868,0.0008940404,0.4678518,0.07605795,0.4109309,0.0403974,0.0001280305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2301281,0.00129481,0.7352485,0.002422084,0.0003011656,0.0003582899,0.002374929,0.007302158,0.02056991],"genre_scores_gemma":[0.6165663,0.0008094101,0.3592553,0.0007935178,0.0005201496,0.000307497,0.002717926,0.0006841974,0.01834564],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01236642,"threshold_uncertainty_score":0.0413698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","authors":[{"name":"Tuğkan Batu","is_ca":true},{"name":"Funda Ergün","is_ca":true},{"name":"Cenk Sahinalp","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006974374443870286,"gpt":0.2227324276354105,"spread":0.2157580531915402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271982,0.001361506,0.001515083,0.001347062,0.0007320627,0.002604861,0.004009307,0.002234647,0.004242427],"category_scores_gemma":[0.01679778,0.0009143192,0.000987153,0.002704248,0.001553785,0.01038757,0.003720789,0.003306946,0.002048926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00238648,"about_ca_system_score_gemma":0.001185446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673685,"about_ca_topic_score_gemma":0.001748053,"domain_scores_codex":[0.9963533,0.0008605585,0.0002752525,0.0008759529,0.001293388,0.0003416342],"domain_scores_gemma":[0.9915592,0.003401706,0.000760979,0.003641743,0.0004562396,0.000180033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007541944,0.0002930541,0.001361395,0.0003721482,0.0001075858,0.0002464811,0.0004017309,0.5978806,0.009300991,0.1905442,0.006172647,0.1925649],"study_design_scores_gemma":[0.00005359076,0.00009631454,0.0001817931,0.00002397024,0.00002486623,0.0002108495,0.00004930002,0.8024178,0.006650481,0.1854507,0.004812004,0.00002836564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01968241,0.0004757719,0.974861,0.0003054425,0.00005737911,0.00005450277,0.0002393872,0.001836989,0.002487109],"genre_scores_gemma":[0.3564612,0.0006400464,0.633437,0.0002885243,0.0001387787,0.0003334756,0.001251939,0.0005590546,0.00688996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004242427,"threshold_uncertainty_score":0.01731521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952250066","doi":"10.1145/1109557.1109597","title":"Distributed selfish load balancing","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Nash equilibrium; Computer science; Convergence (economics); Distributed computing; Resource allocation; Distributed algorithm; Mathematical optimization; Load balancing (electrical power); Martingale (probability theory); Multi-agent system; Mathematics; Computer network; Artificial intelligence","authors":[{"name":"Petra Berenbrink","is_ca":true},{"name":"Tom Friedetzky","is_ca":false},{"name":"Leslie Ann Goldberg","is_ca":false},{"name":"Paul W. Goldberg","is_ca":false},{"name":"Zengjian Hu","is_ca":true},{"name":"Russell Martin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01542529705734717,"gpt":0.2864759561525841,"spread":0.271050659095237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364764,0.0004812904,0.0007002752,0.0003856428,0.0008683308,0.001389446,0.001956998,0.0008419714,0.003650232],"category_scores_gemma":[0.004262364,0.0003193457,0.000314963,0.0004207867,0.0009948844,0.002010947,0.002049982,0.0006327553,0.0006054533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009575831,"about_ca_system_score_gemma":0.0008093524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000897876,"about_ca_topic_score_gemma":0.000866721,"domain_scores_codex":[0.9989435,0.0002840399,0.00004961747,0.0002540539,0.0002920249,0.0001767591],"domain_scores_gemma":[0.9982777,0.0006057016,0.0002750779,0.0004119252,0.000239179,0.0001904255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008584269,0.0002137664,0.002024675,0.0002003474,0.0001229364,0.0005063142,0.0006072083,0.6838487,0.02566433,0.209666,0.005730987,0.07055636],"study_design_scores_gemma":[0.00005564721,0.00006901599,0.0002080828,0.000007220983,0.00001180692,0.0001051163,0.00005330793,0.9491212,0.002179971,0.04476003,0.003415549,0.00001301222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0853254,0.0002556427,0.9001933,0.0006846666,0.0001204978,0.0001557256,0.0000887421,0.0007641863,0.0124118],"genre_scores_gemma":[0.9529914,0.0001270623,0.04017876,0.0001303646,0.00006072596,0.0001506725,0.00006702631,0.00004571979,0.00624815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003650232,"threshold_uncertainty_score":0.0122112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240527869","doi":"10.1145/1109557.1109689","title":"A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Convex hull; Amortized analysis; Computational geometry; k-nearest neighbors algorithm; Regular polygon; Mathematics; Set (abstract data type); Euclidean geometry; Plane (geometry); Data structure; Point (geometry); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00865335346951196,"gpt":0.2471302054288218,"spread":0.2384768519593098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728131,0.000980309,0.00239216,0.002083252,0.002102232,0.002844837,0.006173715,0.002066689,0.00750082],"category_scores_gemma":[0.01166303,0.001302857,0.001614044,0.004966989,0.001886345,0.008303378,0.008064879,0.002971072,0.003376024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002021526,"about_ca_system_score_gemma":0.002610717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002966573,"about_ca_topic_score_gemma":0.003943322,"domain_scores_codex":[0.9964088,0.0004652448,0.0004301048,0.0007355862,0.001607969,0.0003523388],"domain_scores_gemma":[0.9918527,0.001865526,0.000673527,0.004312178,0.0008689635,0.0004271494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001943134,0.0008848081,0.004181194,0.0006688155,0.0001755182,0.0004205189,0.0006575831,0.188889,0.02669711,0.2064081,0.06328851,0.5057856],"study_design_scores_gemma":[0.0004021287,0.0004484029,0.0005370597,0.00006411768,0.00005989783,0.0004090534,0.0001606305,0.8215416,0.01455149,0.1239466,0.03774539,0.0001335866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01321419,0.000439498,0.9750611,0.0009009539,0.0001595573,0.0002400687,0.001824119,0.005961315,0.002199175],"genre_scores_gemma":[0.1888257,0.0003799115,0.7975419,0.000534906,0.0002248263,0.001231621,0.006239123,0.0008282258,0.004193781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00750082,"threshold_uncertainty_score":0.02509278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4252592952","doi":"10.1145/1109557.1109605","title":"Asymmetric balanced allocation with simple hash functions","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Computer science; Simple (philosophy); Extension (predicate logic); Hash table; Double hashing; Function (biology); Scheme (mathematics); Hash chain; Theoretical computer science; Algorithm; Mathematics","authors":[{"name":"Philipp Woelfel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006219280445767619,"gpt":0.2195216495694598,"spread":0.2133023691236922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002399307,0.0007798006,0.001116732,0.0009314904,0.001472673,0.002210537,0.002365764,0.001394675,0.009335534],"category_scores_gemma":[0.007960805,0.000485318,0.0004463564,0.001666841,0.001975944,0.007532095,0.005716812,0.001519525,0.004216805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001234234,"about_ca_system_score_gemma":0.001292595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004479869,"about_ca_topic_score_gemma":0.0003403221,"domain_scores_codex":[0.9964089,0.0007991886,0.0002318448,0.0004459616,0.001482404,0.0006317203],"domain_scores_gemma":[0.9947349,0.00110911,0.0003929267,0.003008355,0.000527908,0.0002267907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001606368,0.0002719393,0.001157444,0.0002100577,0.00004828632,0.0002520925,0.0003587723,0.05261933,0.02989011,0.7202071,0.008253293,0.1851252],"study_design_scores_gemma":[0.0003145211,0.0003367809,0.0004742298,0.00006182631,0.00005925569,0.0007119135,0.00009020494,0.4027212,0.0410181,0.5169528,0.03715669,0.0001024704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06646977,0.0005558283,0.9134891,0.0004168836,0.0002420277,0.0002318097,0.000198765,0.001186328,0.0172096],"genre_scores_gemma":[0.7628538,0.0005032293,0.2159367,0.0003521094,0.0002801647,0.0004320171,0.0003388545,0.0002980947,0.01900506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009335534,"threshold_uncertainty_score":0.03123051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249211545","doi":"10.1145/1109557.1109583","title":"Morphing orthogonal planar graph drawings","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Planarity testing; Morphing; Vertex (graph theory); Planar graph; Orthogonality; Computer science; Combinatorics; Planar; Book embedding; Graph drawing; Graph; Mathematics; Line graph; Pathwidth; Geometry; Computer graphics (images)","authors":[{"name":"Anna Lubiw","is_ca":true},{"name":"Mark Petrick","is_ca":true},{"name":"Michael J. Spriggs","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006601419581088751,"gpt":0.2205228613318167,"spread":0.2139214417507279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003458127,0.0005930436,0.0005636691,0.0009419368,0.0005202388,0.0009079847,0.0009146358,0.0005751759,0.007181399],"category_scores_gemma":[0.002192973,0.0005508423,0.0007539985,0.0008103513,0.0007754357,0.001411799,0.002568903,0.001133482,0.00113591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004324713,"about_ca_system_score_gemma":0.0003730914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001114582,"about_ca_topic_score_gemma":0.001518885,"domain_scores_codex":[0.999435,0.00006010066,0.00003426455,0.0001164116,0.0002751555,0.00007908683],"domain_scores_gemma":[0.9993652,0.0001452979,0.00007391356,0.000240077,0.0001323321,0.00004325363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002083686,0.00008362439,0.001348034,0.0002373156,0.00004363048,0.0002739636,0.0003324641,0.1052325,0.04125747,0.1698454,0.01062176,0.6705155],"study_design_scores_gemma":[0.0000920839,0.0001919748,0.0008868194,0.00005526776,0.00006197474,0.0007621345,0.0003249833,0.6642469,0.0491894,0.2089336,0.07518265,0.00007231761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03005451,0.00008829161,0.9609537,0.0001137464,0.00007042054,0.000109995,0.0001758253,0.001798876,0.00663458],"genre_scores_gemma":[0.2109934,0.0002111094,0.7800451,0.00008449594,0.00002639199,0.000133701,0.000703354,0.0006343199,0.007168123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007181399,"threshold_uncertainty_score":0.02402419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230719382","doi":"10.1145/1109557.1109603","title":"Implicit dictionaries with <i>O</i>(1) modifications per update and fast search","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Constant (computer programming); Computer science; Set (abstract data type); Order (exchange); Combinatorics; Binary logarithm; Search cost; Search problem; Mathematics; Discrete mathematics; Theoretical computer science; Algorithm; Programming language","authors":[{"name":"Gianni Franceschini","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00571366836197134,"gpt":0.2340760520787537,"spread":0.2283623837167824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001287559,0.0008250035,0.001618174,0.0005995124,0.0009706671,0.002829825,0.003382086,0.001841021,0.005918453],"category_scores_gemma":[0.01587225,0.001118745,0.0007672643,0.002387487,0.002397555,0.0155864,0.003607992,0.002519149,0.003649771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040319,"about_ca_system_score_gemma":0.00181221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001208216,"about_ca_topic_score_gemma":0.002281119,"domain_scores_codex":[0.9974408,0.0004207319,0.0002908411,0.0005325213,0.000878884,0.0004361859],"domain_scores_gemma":[0.9824473,0.006781947,0.002092816,0.007422042,0.000903982,0.0003519097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003270603,0.0006325871,0.006238894,0.001340736,0.0001294785,0.0005587483,0.001427685,0.1251881,0.04642679,0.2290077,0.03010303,0.5556756],"study_design_scores_gemma":[0.0007259132,0.001592817,0.002973864,0.000254882,0.0001778633,0.00235789,0.0006197913,0.6092141,0.05825653,0.2797224,0.04389153,0.0002124402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1613961,0.001796008,0.8135396,0.00198318,0.0003070269,0.0002951159,0.0007329882,0.003557757,0.01639222],"genre_scores_gemma":[0.4531761,0.0008124901,0.5263714,0.0006517754,0.0004369874,0.0004486859,0.001189239,0.0008119656,0.01610132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005918453,"threshold_uncertainty_score":0.01979917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}