{"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":"29504458dac8","filters":{"venue":"Nonconvex optimization and its applications"}},"results":[{"id":"W2072075444","doi":"10.1007/978-1-4757-3145-3_23","title":"A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Subgradient method; Cutting-plane method; Lagrangian relaxation; Mathematical optimization; Mathematics; Heuristics; Relaxation (psychology); Linear programming relaxation; Integer programming; Plane (geometry); Algorithm; Geometry","authors":[{"name":"O. du Merle","is_ca":false},{"name":"Jean‐Louis Goffin","is_ca":true},{"name":"C. Trouiller","is_ca":false},{"name":"J.‐P. Vial","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01322765246990476,"gpt":0.2059457367271104,"spread":0.1927180842572057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008865314,0.0009000131,0.001352141,0.0006254361,0.0004584007,0.001194315,0.001528455,0.001396585,0.007133671],"category_scores_gemma":[0.001730092,0.0008884963,0.0009776391,0.001391892,0.0006288299,0.001200516,0.0008846438,0.002120966,0.001110827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008355153,"about_ca_system_score_gemma":0.001681296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003747163,"about_ca_topic_score_gemma":0.003540594,"domain_scores_codex":[0.9995831,0.0001407328,0.00001328142,0.00005644655,0.0001586566,0.00004789926],"domain_scores_gemma":[0.9995468,0.000284269,0.00003286337,0.0000393992,0.00007612429,0.00002042049],"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.00007690126,0.0001155509,0.000105306,0.0001328622,0.00002242783,0.00005711308,0.00006170374,0.8920653,0.001627664,0.03480849,0.006020654,0.06490595],"study_design_scores_gemma":[0.00001796649,0.00002047981,0.0000432823,0.000009833707,0.000004327526,0.00001456323,0.000007947334,0.9931741,0.000262493,0.005296316,0.001144226,0.000004325303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007059705,0.0001931458,0.9777871,0.0001771871,0.00007043594,0.00006516795,0.0001074044,0.000210308,0.01432949],"genre_scores_gemma":[0.1224993,0.0003452363,0.8671155,0.0001050274,0.00006232293,0.0002345719,0.0003569204,0.0002398927,0.009041195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007133671,"threshold_uncertainty_score":0.02386451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1538503321","doi":"10.1007/978-1-4757-3145-3_25","title":"Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"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":"Heuristics; Clique; Quadratic programming; Computer science; Quadratic equation; Theoretical computer science; Clique problem; Graph; Mathematics; Mathematical optimization; Combinatorics; Line graph; Pathwidth","authors":[{"name":"Marcello Pelillo","is_ca":false},{"name":"Kaleem Siddiqi","is_ca":true},{"name":"Steven W. Zucker","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006590814491085934,"gpt":0.2189472659255289,"spread":0.212356451434443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728682,0.001703603,0.003150359,0.002913414,0.001126622,0.002404177,0.003510632,0.00245712,0.00731588],"category_scores_gemma":[0.007312993,0.001342694,0.001275347,0.005995904,0.001894656,0.003466995,0.002015969,0.003116361,0.001386515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002235164,"about_ca_system_score_gemma":0.002798513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0161263,"about_ca_topic_score_gemma":0.02007258,"domain_scores_codex":[0.9991087,0.0002469789,0.00004547519,0.0002459015,0.0002521868,0.0001007313],"domain_scores_gemma":[0.9958904,0.002643102,0.0002409322,0.0004711843,0.0005692501,0.0001851827],"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.0001848863,0.0002482235,0.0003915724,0.0002687268,0.0000792077,0.00008617419,0.0001292141,0.4952449,0.002640853,0.05562636,0.01523755,0.4298624],"study_design_scores_gemma":[0.0000360776,0.00003114582,0.0001041064,0.00001391129,0.00001159243,0.00002823395,0.00002960428,0.9689651,0.000715315,0.02853309,0.001519089,0.00001275832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00456603,0.0005097428,0.9918044,0.0001024242,0.00005368706,0.00006893857,0.0000910966,0.001106902,0.001696902],"genre_scores_gemma":[0.04899392,0.0003888377,0.9472865,0.00008309728,0.00007117665,0.0001510826,0.000355886,0.000515582,0.00215383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0161263,"threshold_uncertainty_score":0.03206486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W76416230","doi":"10.1007/978-1-4613-0251-3_7","title":"Exact parallel algorithms for the location depth and the maximum feasible subsystem problems","year":2004,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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":"Hyperplane; Parallelizable manifold; Mathematics; Enumeration; Generalization; Dimension (graph theory); Point location; Algorithm; Point (geometry); Parametric statistics; Set (abstract data type); Space (punctuation); Combinatorics; Mathematical optimization; Computer science; Geometry; Mathematical analysis; Statistics","authors":[{"name":"K. Fukuda","is_ca":true},{"name":"Vera Rosta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03167241883879291,"gpt":0.2544493348698125,"spread":0.2227769160310196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008417214,0.001640444,0.001575481,0.000824005,0.0008932605,0.001194116,0.001819095,0.001130472,0.009151787],"category_scores_gemma":[0.003290908,0.001043065,0.0009171968,0.001860271,0.001113174,0.002293678,0.001931232,0.002112714,0.001506146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001580001,"about_ca_system_score_gemma":0.001604961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005935237,"about_ca_topic_score_gemma":0.01255369,"domain_scores_codex":[0.9995862,0.0001045423,0.00001860461,0.00007117443,0.0001552312,0.00006426989],"domain_scores_gemma":[0.9991704,0.0004998115,0.0000512052,0.0001247137,0.0001209665,0.0000328384],"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.000126773,0.00007402479,0.0002116901,0.0001746058,0.00003207049,0.00003616909,0.0001011207,0.7332165,0.001183799,0.1116405,0.007515689,0.1456869],"study_design_scores_gemma":[0.00003750935,0.00001388421,0.00006063123,0.000009696881,0.000007362772,0.00001502341,0.00001889677,0.9053038,0.0004851773,0.09177711,0.002265057,0.000005892133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00460398,0.0004082611,0.9864621,0.0001551295,0.00005341891,0.00003053271,0.00008791128,0.0003749556,0.007823709],"genre_scores_gemma":[0.1407054,0.0006128264,0.8459929,0.0001131734,0.0001054897,0.0002980463,0.0003004558,0.0004854879,0.01138623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009151787,"threshold_uncertainty_score":0.03061575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W579949368","doi":"10.1007/978-1-4613-0279-7_25","title":"Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Complexity and Algorithms in Graphs","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":"Semidefinite programming; Maximum cut; Semidefinite embedding; Mathematics; Relaxation (psychology); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematical optimization; Computer science; Quadratically constrained quadratic program; Artificial intelligence; Quadratic programming","authors":[{"name":"Miguel F. Anjos","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03075724069593366,"gpt":0.2522711380501114,"spread":0.2215138973541777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823092,0.001762682,0.001236652,0.0009285711,0.0005963254,0.00220335,0.002216316,0.001261074,0.01140026],"category_scores_gemma":[0.00741222,0.0008383644,0.001090992,0.001763942,0.001333499,0.003817086,0.001856798,0.007711682,0.002511916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324245,"about_ca_system_score_gemma":0.001230617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008733041,"about_ca_topic_score_gemma":0.001223471,"domain_scores_codex":[0.998562,0.0006138438,0.00006192482,0.0001877885,0.0004780141,0.00009642701],"domain_scores_gemma":[0.9968684,0.001934292,0.0002247875,0.000402995,0.0004497544,0.000119639],"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.000238511,0.000249754,0.0001440912,0.0006650362,0.00005420596,0.0001402226,0.000182871,0.201216,0.003869859,0.6093438,0.0451057,0.1387901],"study_design_scores_gemma":[0.00006199072,0.00008156099,0.0001796882,0.0001233495,0.00002460624,0.0001568318,0.00005278201,0.5393908,0.001876579,0.4359551,0.02206404,0.00003268426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007099376,0.001371114,0.9494917,0.001297671,0.0003660865,0.00009549438,0.0004092576,0.0002722323,0.03959707],"genre_scores_gemma":[0.2079222,0.003935267,0.7342532,0.001140144,0.001116102,0.0008118775,0.001767445,0.0008165099,0.04823739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01140026,"threshold_uncertainty_score":0.03813761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W310879469","doi":"10.1007/978-1-4613-0279-7_24","title":"An Analytic Center Self-Concordant Cut Method for the Convex Feasibility Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Center (category theory); Regular polygon; Set (abstract data type); Convex analysis; Combinatorics; Convex set; Convex optimization; Discrete mathematics; Mathematical optimization; Computer science; Geometry","authors":[{"name":"Faranak Sharifi Mokhtarian","is_ca":true},{"name":"Jean‐Louis Goffin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07041449983146163,"gpt":0.3974612581906012,"spread":0.3270467583591395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683636,0.0007565201,0.0008670068,0.001040723,0.0004582513,0.001210797,0.001489173,0.001192633,0.005303223],"category_scores_gemma":[0.002324246,0.0005157829,0.0006652035,0.0008026926,0.0008984897,0.00108623,0.001243254,0.002281482,0.001104717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007075897,"about_ca_system_score_gemma":0.0008945151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007287421,"about_ca_topic_score_gemma":0.0009902677,"domain_scores_codex":[0.9996498,0.00009037603,0.00000973487,0.00004471937,0.000187874,0.00001749246],"domain_scores_gemma":[0.9993906,0.0003360365,0.00003242569,0.00004917068,0.0001621719,0.00002957919],"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.0001653186,0.0001299247,0.0002400163,0.0003839478,0.00006150023,0.0001394885,0.0001739086,0.1820862,0.01526574,0.4834664,0.02154805,0.2963396],"study_design_scores_gemma":[0.00002113683,0.0000322445,0.00009360417,0.00003241964,0.00001320193,0.0001052912,0.00001442275,0.9174803,0.002686202,0.06784217,0.0116627,0.00001623825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001317325,0.0002000008,0.9931796,0.00008436491,0.00006763277,0.00002927426,0.00002734397,0.00008555147,0.005008863],"genre_scores_gemma":[0.04380968,0.0004588192,0.9431854,0.000179903,0.0001302385,0.0001984259,0.0001546596,0.0002476988,0.01163502],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005303223,"threshold_uncertainty_score":0.01774108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W24073905","doi":"10.1007/978-1-4757-3141-5_9","title":"Conditions (S)+ and (S) + 1 : Applications to Complementarity Theory","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Variational Analysis","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":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Mathematical economics; Compact space; Mathematics; Mixed complementarity problem; Complementarity theory; Pure mathematics; Mathematical optimization; Physics; Quantum mechanics","authors":[{"name":"G. Isac","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01832681258036193,"gpt":0.2653044174696567,"spread":0.2469776048892948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008631509,0.0005020101,0.0005788446,0.0008170059,0.0009629746,0.001380961,0.0006177197,0.001117142,0.01739547],"category_scores_gemma":[0.002735741,0.0003612164,0.0003556915,0.001032475,0.002154003,0.002319728,0.0009528692,0.001824093,0.003525673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000950279,"about_ca_system_score_gemma":0.001657293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002830324,"about_ca_topic_score_gemma":0.003157866,"domain_scores_codex":[0.9996095,0.00009927672,0.00002399829,0.00007604127,0.0001504343,0.00004079969],"domain_scores_gemma":[0.9992375,0.0003658947,0.00005797162,0.00005161263,0.0002427743,0.00004425082],"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.00003675368,0.000018242,0.00007772568,0.0002160806,0.000004830248,0.00007141262,0.0001169982,0.00239054,0.002078895,0.9140891,0.02444015,0.05645932],"study_design_scores_gemma":[0.00001897838,0.00002678924,0.0003782364,0.0001050646,0.000008832479,0.0001567956,0.0001302946,0.009701635,0.003193157,0.9000464,0.08620758,0.00002625957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02122827,0.007718669,0.5799327,0.006992615,0.002220035,0.0003035455,0.0009696871,0.0004501532,0.3801842],"genre_scores_gemma":[0.4061879,0.01086346,0.4239168,0.002634788,0.002305042,0.0007466764,0.001150792,0.0005044062,0.1516902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01739547,"threshold_uncertainty_score":0.05819362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4252034049","doi":"10.1007/978-1-4757-3623-6_1","title":"Introduction","year":2002,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Variational Analysis","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":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Differentiable function; Mathematics; Pure mathematics; Stationary point; Degree (music); Point (geometry); Mathematical analysis; Applied mathematics; Mathematical economics; Physics; Geometry","authors":[{"name":"G. Isac","is_ca":true},{"name":"V. A. Bulavsky","is_ca":false},{"name":"Vyacheslav V. Kalashnikov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01370672516444267,"gpt":0.2146830561545367,"spread":0.200976330990094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005864685,0.0009353568,0.0005196084,0.001465245,0.001184985,0.003357322,0.001494733,0.001501971,0.473067],"category_scores_gemma":[0.002207517,0.0002910452,0.0004821617,0.001323227,0.0006094325,0.002676751,0.002101575,0.001655934,0.3703451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001104104,"about_ca_system_score_gemma":0.001534495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001460006,"about_ca_topic_score_gemma":0.002223045,"domain_scores_codex":[0.9994528,0.00005594414,0.00001884662,0.0001233748,0.0002865475,0.00006260012],"domain_scores_gemma":[0.9992332,0.0001104076,0.00002961472,0.0001245961,0.0003611251,0.0001408841],"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.00002881742,0.00003413443,0.0001023062,0.0001614552,0.000003029667,0.00005129271,0.0001164328,0.0002057292,0.0005666474,0.07646705,0.7267494,0.1955138],"study_design_scores_gemma":[0.000001627869,0.000005802241,0.00006097627,0.00004732619,0.000001026787,0.00003713039,0.0000262808,0.0000415692,0.00012381,0.007652486,0.9919993,0.000002673378],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0005164898,0.002673955,0.01093763,0.003179504,0.005005626,0.0001158561,0.001865282,0.0009105713,0.974795],"genre_scores_gemma":[0.002185789,0.001819581,0.002732323,0.001181148,0.0008745891,0.00007872855,0.001516404,0.0002919564,0.9893194],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.473067,"threshold_uncertainty_score":0.7516059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}