{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006499834,0.0006396371,0.0005757731,0.0002876454,0.0008914202,0.000444891,0.004012912,0.0002108196,0.0000246255],"category_scores_gemma":[0.00011208,0.0004528865,0.0004256069,0.0009773214,0.0001476517,0.001695121,0.001817675,0.0005910155,0.000113261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001391842,"about_ca_system_score_gemma":0.0000919248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001556765,"about_ca_topic_score_gemma":0.000007760523,"domain_scores_codex":[0.9954686,0.00006195262,0.0008366218,0.001170881,0.001430181,0.001031721],"domain_scores_gemma":[0.9976414,0.0001110783,0.000411563,0.001042971,0.0005531668,0.0002397984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004950535,0.009399571,0.005323042,0.0006227093,0.0008501148,0.00004911057,0.006130023,0.004943384,0.04134895,0.319816,0.5397025,0.0713195],"study_design_scores_gemma":[0.01227397,0.005444584,0.02030077,0.002566015,0.0004107683,0.0002303789,0.001854122,0.4194803,0.3001698,0.02371479,0.2084505,0.005104043],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5762157,0.002616488,0.2477671,0.08083202,0.009403009,0.01338974,0.0105115,0.004488959,0.05477545],"genre_scores_gemma":[0.9323636,0.0001270232,0.05713166,0.001640877,0.00136348,0.0002298076,0.0002689043,0.0001424737,0.006732172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4145369,"threshold_uncertainty_score":0.9997923,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005444703,0.0005557214,0.0005299973,0.0003005002,0.000757683,0.0004911797,0.00294614,0.0001586857,0.000005893668],"category_scores_gemma":[0.0001123284,0.0004495749,0.0003383676,0.001193181,0.0004382588,0.001571499,0.001827227,0.0005363292,0.00001220074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152112,"about_ca_system_score_gemma":0.00004967035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000105183,"about_ca_topic_score_gemma":0.000005520781,"domain_scores_codex":[0.9962016,0.00003323377,0.0007886583,0.001025339,0.001115894,0.0008352345],"domain_scores_gemma":[0.9978788,0.0001578043,0.0006277444,0.0006908718,0.0004311498,0.0002136272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001128594,0.002160055,0.009607502,0.001051372,0.0004710163,0.00001860715,0.009404365,0.0005947599,0.00442465,0.8579901,0.05301607,0.06114862],"study_design_scores_gemma":[0.007379677,0.002101461,0.03394243,0.003267061,0.000512538,0.0005242334,0.005181706,0.2861042,0.05994083,0.47963,0.1155989,0.005817014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5430543,0.003060088,0.3515787,0.05194069,0.005739221,0.007557295,0.002989768,0.003262237,0.03081764],"genre_scores_gemma":[0.8841506,0.000137678,0.1114032,0.0004204896,0.0009662409,0.0001511844,0.00004145127,0.00008808266,0.002641052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3783601,"threshold_uncertainty_score":0.9997956,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002575339,0.0005540891,0.000705285,0.0002266464,0.0006885711,0.0004048674,0.003885036,0.0002159785,0.0001054771],"category_scores_gemma":[0.001175562,0.0003728855,0.0006091823,0.00186853,0.0004606635,0.0008327718,0.001114332,0.0005195237,0.0003306142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002166592,"about_ca_system_score_gemma":0.0001082077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001016867,"about_ca_topic_score_gemma":0.000007803882,"domain_scores_codex":[0.9936321,0.00008716414,0.001440938,0.001136417,0.002833466,0.0008698496],"domain_scores_gemma":[0.995555,0.0005582513,0.001141962,0.001006759,0.001472548,0.0002654809],"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.000684799,0.003730353,0.0595573,0.0002749593,0.0005493303,0.00001445126,0.00605752,0.001920337,0.04693817,0.1206146,0.7266488,0.03300935],"study_design_scores_gemma":[0.004476578,0.0008879933,0.08070387,0.0007442627,0.000480746,0.0001622038,0.01392069,0.007289282,0.1476727,0.3699547,0.3709805,0.002726557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9316576,0.0002350615,0.003240271,0.02178233,0.0008520866,0.002174746,0.0046661,0.0005012463,0.03489057],"genre_scores_gemma":[0.9876739,0.0000159938,0.002337938,0.0003418213,0.0005462998,0.0001049665,0.00007849935,0.00005758542,0.008842991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3556683,"threshold_uncertainty_score":0.9998723,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003374231,0.00036419,0.0003644868,0.0001650346,0.000413956,0.0003480455,0.002262522,0.0001273572,0.000005485927],"category_scores_gemma":[0.000133214,0.0002797011,0.0001304473,0.0005259945,0.0001861832,0.001374357,0.001450725,0.0002128967,0.000003909424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005589282,"about_ca_system_score_gemma":0.00008602074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004790243,"about_ca_topic_score_gemma":0.00001267509,"domain_scores_codex":[0.9975306,0.00002338495,0.0005110517,0.0008704371,0.0006143241,0.0004502192],"domain_scores_gemma":[0.9982322,0.0001461124,0.0004226881,0.0006217911,0.0004579892,0.0001191781],"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.001049606,0.002470558,0.01225475,0.003397838,0.001506382,0.00001687515,0.01022028,0.009808023,0.1007137,0.4419043,0.1618329,0.2548248],"study_design_scores_gemma":[0.004233625,0.001411941,0.02836257,0.0005019939,0.0002753737,0.0001723158,0.001180307,0.7891692,0.04045589,0.06919228,0.06319441,0.001850102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6990702,0.001886757,0.2335579,0.04338728,0.003037459,0.006351812,0.01028231,0.0007438758,0.001682423],"genre_scores_gemma":[0.8867319,0.00005110764,0.1098505,0.0004725886,0.0004496007,0.00006091347,0.0005872264,0.00004893128,0.001747251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7793612,"threshold_uncertainty_score":0.9999655,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004258737,0.0005334148,0.0004813874,0.0003703877,0.0006268645,0.0003444926,0.002882116,0.000163474,0.00001057227],"category_scores_gemma":[0.00008010958,0.0003596639,0.0002591174,0.001945332,0.0001878834,0.001811978,0.001279379,0.0004283026,0.00005388851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00015343,"about_ca_system_score_gemma":0.00009348222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002664527,"about_ca_topic_score_gemma":0.000007514237,"domain_scores_codex":[0.99615,0.00003770514,0.0006891622,0.00102661,0.001332882,0.0007636247],"domain_scores_gemma":[0.997339,0.0001091452,0.00069321,0.0009395898,0.00071384,0.0002051975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007114823,0.00646378,0.03606915,0.0009509601,0.001070056,0.00003013624,0.003120492,0.006194255,0.02044633,0.07510085,0.6067901,0.2430525],"study_design_scores_gemma":[0.01401238,0.006493737,0.1454124,0.002278304,0.0007900245,0.0004486816,0.003428751,0.3415755,0.1362661,0.03036045,0.3126108,0.006322843],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1793767,0.001360343,0.7392468,0.02814128,0.003293169,0.00683206,0.003014917,0.002681941,0.03605275],"genre_scores_gemma":[0.9167901,0.00007340709,0.07623648,0.0005059955,0.000828451,0.0002078979,0.0003205968,0.0001070539,0.004929984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7374135,"threshold_uncertainty_score":0.9998856,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006127068,0.0004603483,0.0004018372,0.0003876884,0.0005597042,0.0003138577,0.002332516,0.0001462478,0.000009174373],"category_scores_gemma":[0.00008308202,0.000365852,0.0004157608,0.001285684,0.0001519002,0.001369477,0.0007066553,0.0003928573,0.00003370844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009616178,"about_ca_system_score_gemma":0.00008614246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000705201,"about_ca_topic_score_gemma":0.000003062748,"domain_scores_codex":[0.9963912,0.00003780472,0.0007382656,0.0008554573,0.001323458,0.0006538278],"domain_scores_gemma":[0.9981456,0.000117381,0.0005783775,0.0004444188,0.0005398651,0.0001743207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003549927,0.003151565,0.02097085,0.0008205105,0.0009005388,0.00004864442,0.007488407,0.02195719,0.07087651,0.633946,0.176835,0.06264977],"study_design_scores_gemma":[0.008390503,0.002826588,0.1015413,0.001865049,0.000530135,0.0007492015,0.002184163,0.1828467,0.2729125,0.3252743,0.09503976,0.005839838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8157505,0.0007175857,0.1367341,0.02759249,0.002728824,0.002360794,0.0006860798,0.0009819086,0.01244762],"genre_scores_gemma":[0.9434463,0.00003151465,0.05181307,0.0007664975,0.0009693163,0.00006644573,0.0001098471,0.00005497337,0.002742041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3086717,"threshold_uncertainty_score":0.9998794,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003547194,0.0004289722,0.0003602336,0.0002394615,0.0006083705,0.0004440928,0.002316058,0.0001372245,0.000004068802],"category_scores_gemma":[0.00003565527,0.0002861091,0.000140067,0.000748042,0.0004344942,0.001440446,0.001229816,0.0004880834,0.0000103195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009358863,"about_ca_system_score_gemma":0.00007070493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001573789,"about_ca_topic_score_gemma":0.000004651166,"domain_scores_codex":[0.997116,0.00002889755,0.0004704751,0.0008372547,0.0009392752,0.0006080913],"domain_scores_gemma":[0.9981732,0.00006317734,0.0003486031,0.0005952749,0.0006711737,0.0001485417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003376545,0.00164973,0.01408771,0.0009196105,0.0005149129,0.00001580198,0.008803829,0.0003468297,0.05396241,0.8145075,0.03056314,0.07429087],"study_design_scores_gemma":[0.005246606,0.002936308,0.02686488,0.002255008,0.0005611288,0.001140613,0.005660557,0.04869679,0.644381,0.2231113,0.0340827,0.00506307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4124996,0.008468738,0.4144404,0.1368523,0.0008865905,0.007529718,0.002492151,0.005412511,0.01141803],"genre_scores_gemma":[0.7355933,0.0001028655,0.2620862,0.0003905298,0.0002139835,0.0001245714,0.00003605488,0.00006060369,0.001391885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5913962,"threshold_uncertainty_score":0.9999591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}