{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001332256,0.0003808011,0.0003504409,0.0001999863,0.0002267803,0.00009107052,0.0002113547,0.0003219914,0.0003003418],"category_scores_gemma":[0.000007453123,0.0003185515,0.00006769696,0.0002014998,0.00009621224,0.0002524532,0.00002888105,0.0003572856,0.00001444956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006945918,"about_ca_system_score_gemma":0.0000585729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001260589,"about_ca_topic_score_gemma":0.00003588271,"domain_scores_codex":[0.9985579,0.00002777967,0.0006087723,0.0003813373,0.000216431,0.0002077429],"domain_scores_gemma":[0.9988113,0.00005908593,0.0003688271,0.0003789969,0.0002604252,0.0001213524],"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.00002402759,0.00006034154,0.00001802745,0.0003779924,0.0001948926,9.074837e-7,0.002444747,0.9623023,0.0003340048,0.007261127,0.00008755701,0.0268941],"study_design_scores_gemma":[0.0008203773,0.00007907242,0.0000142708,0.0004988898,0.0001315527,0.00002257625,0.0001086194,0.9862375,0.0003585221,0.0001602291,0.01107568,0.0004927333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007930937,0.00067467,0.9059638,0.0001836428,0.0001138587,0.003027752,0.0003471155,0.0006697571,0.08894013],"genre_scores_gemma":[0.0425356,0.006085805,0.8798378,0.0005416883,0.0004102199,0.001036604,0.00463967,0.0009616168,0.06395105],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04245629,"threshold_uncertainty_score":0.9999266,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001204464,0.0003525938,0.0003545952,0.0002898613,0.0003576714,0.0002084377,0.0003594116,0.0002256438,0.00002691155],"category_scores_gemma":[0.000003190371,0.0003316874,0.00006063674,0.0001798004,0.0001064525,0.0001752665,0.00006933584,0.0001466295,0.00002000211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002033149,"about_ca_system_score_gemma":0.00006109219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001161451,"about_ca_topic_score_gemma":0.000003436382,"domain_scores_codex":[0.998403,0.00001746057,0.0003615058,0.0008166881,0.0001969755,0.0002044357],"domain_scores_gemma":[0.9985197,0.0001736021,0.0002312509,0.0005312808,0.000314882,0.0002292476],"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.00004997706,0.0000746636,0.000002203488,0.00006835811,0.00003637488,9.575942e-7,0.00008776788,0.02966568,0.00002040644,0.8157183,0.0006569796,0.1536183],"study_design_scores_gemma":[0.0009676127,0.0005321595,0.00001310285,0.00008999679,0.00007883769,0.00001549502,0.000003345646,0.7919625,0.00004887458,0.02374096,0.1819619,0.0005852024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003720334,0.0002462667,0.9875162,0.0009716154,0.00003921485,0.002413414,0.0001293115,0.0001810416,0.008499267],"genre_scores_gemma":[0.004475737,0.001018343,0.9716192,0.003579461,0.0003511205,0.001834798,0.0009608885,0.0001452349,0.01601518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7919773,"threshold_uncertainty_score":0.9999135,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831628,0.0002649974,0.0002424911,0.0001207973,0.0007866786,0.000374571,0.0004127358,0.0001805427,0.00002096003],"category_scores_gemma":[0.0000257577,0.000178478,0.00007405181,0.0002090422,0.0001251425,0.0002783501,0.0001119196,0.0001678515,0.00001473117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006246447,"about_ca_system_score_gemma":0.0002160147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001011451,"about_ca_topic_score_gemma":0.00001791028,"domain_scores_codex":[0.9985764,0.00003157941,0.0004184963,0.0005413985,0.0002660232,0.0001661021],"domain_scores_gemma":[0.9981828,0.0004004645,0.0003542854,0.0004519096,0.0005263247,0.00008417525],"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.000005411457,0.00001191346,4.374725e-7,0.0000603206,0.00003747535,6.258842e-8,0.0001654008,0.2621792,0.000001561695,0.7199528,0.0002082885,0.01737709],"study_design_scores_gemma":[0.001221193,0.00003592848,0.00001237827,0.00004638617,0.00007920079,0.00002046551,0.0000166927,0.9031783,0.000008254416,0.03359735,0.0615494,0.0002344172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[5.253327e-7,0.006629331,0.9760784,0.004449022,0.0001506128,0.003619907,0.00002043801,0.00008760888,0.008964187],"genre_scores_gemma":[0.07681076,0.0370544,0.558872,0.00509129,0.004031036,0.01800731,0.00273409,0.0003535747,0.2970456],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6863555,"threshold_uncertainty_score":0.7278122,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002089746,0.0003131581,0.0002517302,0.0001820402,0.001000311,0.0003653205,0.000751167,0.0002413639,0.0001022381],"category_scores_gemma":[0.000025364,0.00026653,0.0001425981,0.0002545848,0.0001195667,0.0002690879,0.0002038041,0.0002871839,0.00002654176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004261314,"about_ca_system_score_gemma":0.0001225883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004145845,"about_ca_topic_score_gemma":0.00001273955,"domain_scores_codex":[0.9983873,0.00001539761,0.0004719329,0.000624187,0.000243721,0.0002574781],"domain_scores_gemma":[0.9978314,0.000523621,0.0004104901,0.000708385,0.0004103617,0.0001157274],"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.00000176423,0.00002887478,7.094851e-7,0.00003167345,0.00004851861,2.342938e-7,0.0001348417,0.006705541,7.797309e-7,0.878615,0.0005205103,0.1139116],"study_design_scores_gemma":[0.0002338707,0.00003380793,7.899532e-7,0.00003998655,0.00005932959,0.00001143816,0.00001387309,0.3574862,0.000004874538,0.03755789,0.6043054,0.0002525666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.054528e-7,0.001008575,0.9068833,0.002623453,0.00009252688,0.002421708,0.00008147977,0.0002601756,0.0866287],"genre_scores_gemma":[0.0002452194,0.007822995,0.7846038,0.0009269472,0.0004532297,0.004267463,0.0006268008,0.0001143507,0.2009392],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8410571,"threshold_uncertainty_score":0.9999787,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000855309,0.0005534742,0.0006706346,0.0002427045,0.0006945633,0.0001988732,0.000585016,0.0004468101,0.001040055],"category_scores_gemma":[0.0001346869,0.0004506466,0.0002001453,0.0002348094,0.0001533543,0.000309554,0.0001269051,0.0005112094,0.00003377331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002530927,"about_ca_system_score_gemma":0.0002704496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003704554,"about_ca_topic_score_gemma":0.00002224937,"domain_scores_codex":[0.9970157,0.00009439892,0.0009266672,0.001032464,0.0004994108,0.0004313322],"domain_scores_gemma":[0.9950762,0.001382344,0.0006549542,0.001173178,0.001398928,0.0003143807],"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.00009742162,0.0006905766,0.00002083265,0.0007055875,0.0005834588,0.000002255927,0.0006436109,0.08438703,0.00001678089,0.8930953,0.003304717,0.0164525],"study_design_scores_gemma":[0.001090704,0.0001021052,0.000001062451,0.00004322961,0.000302959,0.00002510815,0.00008877175,0.7962425,0.00002552722,0.04599235,0.1556032,0.000482551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[4.669896e-7,0.0002951814,0.9369568,0.0009479135,0.00005539333,0.007308297,0.0003820927,0.0003135602,0.05374029],"genre_scores_gemma":[0.00006690541,0.003443066,0.885698,0.0004976367,0.0003717579,0.002226952,0.0007596167,0.0002556032,0.1066805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8471029,"threshold_uncertainty_score":0.9998731,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002101006,0.0003616682,0.0003626028,0.0004429907,0.0007240881,0.0003036663,0.0004821157,0.0002209987,0.002839924],"category_scores_gemma":[0.0000104338,0.0003956514,0.00008696976,0.0003255208,0.00008848058,0.0003548007,0.0002402639,0.0002190165,0.000310549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000681451,"about_ca_system_score_gemma":0.0001212142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005604461,"about_ca_topic_score_gemma":0.00001145746,"domain_scores_codex":[0.9980231,0.00004110595,0.000554452,0.0008622087,0.0003016347,0.0002174797],"domain_scores_gemma":[0.9982058,0.0002076113,0.0002465436,0.0006170361,0.0003598419,0.00036311],"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.000002667419,0.00004038851,0.000002428419,0.00001659595,0.00007103618,2.364386e-7,0.0000903167,0.01627267,0.000002960714,0.97215,0.0007617166,0.01058895],"study_design_scores_gemma":[0.0003884148,0.00004054351,0.00003857181,0.00002899659,0.0001766466,0.00001394226,0.00002066782,0.1435394,0.00001027018,0.1098297,0.7452609,0.000652004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[3.624237e-7,0.0003170114,0.7993237,0.002228815,0.0000230765,0.001382041,0.0003288604,0.0001891844,0.1962069],"genre_scores_gemma":[0.005909806,0.01269395,0.4109007,0.01990413,0.001035062,0.006594256,0.007401279,0.0002768382,0.535284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8623204,"threshold_uncertainty_score":0.9998496,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001116554,0.0002776774,0.0002717577,0.0003298522,0.0002987425,0.0002260398,0.0003786885,0.0002707851,0.003971438],"category_scores_gemma":[0.0000179747,0.0002924858,0.00009593114,0.000232106,0.00003828157,0.0004548062,0.0001302527,0.0002055778,0.0006145763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006446712,"about_ca_system_score_gemma":0.00005234755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.52364e-7,"about_ca_topic_score_gemma":5.866218e-7,"domain_scores_codex":[0.9984089,0.00001702026,0.0004307738,0.0006941352,0.000299894,0.0001493074],"domain_scores_gemma":[0.9984688,0.00005281258,0.0003309048,0.0005361249,0.0004621993,0.0001491389],"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":[6.291608e-7,0.00002333928,3.62561e-7,0.00001364916,0.0000454402,2.798596e-7,0.00003790242,0.04524714,0.000001823678,0.9423102,0.007377344,0.004941877],"study_design_scores_gemma":[0.0001162657,0.00001169478,0.000001238775,0.000005726388,0.00004223002,0.000007077902,0.000001222596,0.5208973,0.000006812087,0.003060354,0.4756282,0.0002217985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[2.004213e-8,0.0003871919,0.7284321,0.006407944,0.00009098106,0.0003445253,0.00001700369,0.0001923837,0.2641279],"genre_scores_gemma":[0.0001222079,0.005672391,0.1148616,0.0009747959,0.001002447,0.0001587459,0.0004645567,0.00005143739,0.8766919],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9392499,"threshold_uncertainty_score":0.9999527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}