{"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":"1b9175ab18fa","filters":{"venue":"AIRO Springer series/AIRO Springer Series"}},"results":[{"id":"W3200592846","doi":"10.1007/978-3-030-57442-0","title":"Mathematical Optimization for Efficient and Robust Energy Networks","year":2021,"lang":"en","type":"book","venue":"AIRO Springer series/AIRO Springer Series","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Robust optimization; Mathematical optimization; Computer science; Set (abstract data type); Energy (signal processing); Work (physics); Optimization problem; Mathematics; Engineering; Mechanical engineering","authors":[{"name":"Natalia Selini Hadjidimitriou","is_ca":false},{"name":"Antonio Frangioni","is_ca":false},{"name":"Thorsten Koch","is_ca":false},{"name":"Andrea Lodi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008297438189911386,"gpt":0.1738255068324318,"spread":0.1655280686425204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0003381047,0.001387307,0.001410608,0.0003950919,0.0003515945,0.0004719197,0.0005746463,0.0008845725,0.0004246263],"category_scores_gemma":[0.00007277095,0.001576293,0.0003988494,0.0002960498,0.0003232996,0.0004876356,0.0008198942,0.0005943751,0.00001756875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00055072,"about_ca_system_score_gemma":0.0001331217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001028149,"about_ca_topic_score_gemma":0.00009585173,"domain_scores_codex":[0.9957199,0.00005008389,0.001139231,0.001272307,0.0006134658,0.001205054],"domain_scores_gemma":[0.9975933,0.0001769171,0.0002584257,0.001378234,0.0002291954,0.0003639019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006594293,0.00005173685,0.000009435478,0.001287144,0.0005398657,0.00005893292,0.0001784061,0.9294565,0.00002313347,0.05448203,0.01269176,0.001155134],"study_design_scores_gemma":[0.0007540637,0.0001729254,0.00007920204,0.0009016812,0.0004926031,0.00008221345,0.0001247225,0.4961121,0.0006400289,0.0007399296,0.4977255,0.00217499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.0004775728,0.009325567,0.8691958,0.0004558614,0.005768349,0.001324921,0.00007849972,0.002484974,0.1108885],"genre_scores_gemma":[0.006492641,0.01459713,0.1958631,0.0006431019,0.007399626,0.002697279,0.001592377,0.00293674,0.767778],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6733327,"threshold_uncertainty_score":0.9998878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4384434830","doi":"10.1007/978-3-031-28863-0_26","title":"Reducing the Supply-Chain Nervosity Thanks to Flexible Planning","year":2023,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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é Laval; Transport Canada","funders":"","keywords":"Supply chain; Economic shortage; Bullwhip effect; Production (economics); Lexicographical order; Operations research; Range (aeronautics); Operations management; Computer science; Distribution (mathematics); Production planning; Distribution center; Business; Mathematical optimization; Supply chain management; Economics; Engineering; Microeconomics; Commerce; Mathematics; Marketing","authors":[{"name":"Nicolas Zufferey","is_ca":true},{"name":"Marie-Sklaerder Vié","is_ca":false},{"name":"Leandro C. Coelho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03550432182061139,"gpt":0.2302053265999628,"spread":0.1947010047793514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.001428633,0.001830499,0.001434835,0.00131535,0.00163832,0.001801831,0.002252441,0.0006601121,0.002274538],"category_scores_gemma":[0.0001989529,0.001659743,0.0007340761,0.0007070772,0.0005043747,0.002692062,0.004365622,0.001455153,0.004337396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003480794,"about_ca_system_score_gemma":0.0001151409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001075958,"about_ca_topic_score_gemma":0.0006855614,"domain_scores_codex":[0.9931128,0.00003785831,0.001432594,0.002092025,0.001512571,0.001812124],"domain_scores_gemma":[0.9958649,0.0001336143,0.0009187044,0.002574838,0.0003373583,0.0001706294],"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.0009389754,0.0001343154,0.003932002,0.002384364,0.001283708,0.0007438406,0.003337702,0.003446027,0.0004876727,0.7726958,0.2001679,0.01044769],"study_design_scores_gemma":[0.0004676209,0.0001070825,0.004281108,0.001179095,0.0003691725,0.00001744836,0.00138018,0.0001196152,0.0004471779,0.008735269,0.9807703,0.002125874],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01135535,0.001402407,0.0004546253,0.01748196,0.01476366,0.003943759,0.00008149941,0.004717781,0.9457989],"genre_scores_gemma":[0.04971766,0.0003928309,0.0007355416,0.007063586,0.009401649,0.0005155202,0.0002368105,0.001025379,0.930911],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.7806024,"threshold_uncertainty_score":0.9996614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386433099","doi":"10.1007/978-3-031-38537-7_3","title":"An Overview of Benefits and Limitations of the Process Model Notation Applied for Modeling Patient Healthcare Trajectory","year":2023,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Centre intégré de santé et de services sociaux de Chaudière-Appalaches; Centre Intégré de Santé et Services Sociaux de Chaudière-Appalache; Université Laval; Centre hospitalier de l'Université Laval; Transport Canada","funders":"","keywords":"Business Process Model and Notation; Notation; Computer science; Process (computing); Health care; Process modeling; Process management; Domain (mathematical analysis); Task (project management); Business process; Business process modeling; Management science; Work in process; Systems engineering; Engineering; Operations management","authors":[{"name":"Paolo Landa","is_ca":true},{"name":"Jean‐Baptiste Gartner","is_ca":true},{"name":"Matthew T. Haren","is_ca":true},{"name":"Célia Lemaire","is_ca":false},{"name":"Kassim Said Abasse","is_ca":true},{"name":"Catherine Paquet","is_ca":true},{"name":"Frédéric Bergeron","is_ca":true},{"name":"Elena Tànfani","is_ca":false},{"name":"André Côté","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1085645624576468,"gpt":0.2639149131041854,"spread":0.1553503506465386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003197132,0.0007088735,0.001036589,0.0005294769,0.0004979224,0.0001679951,0.0005388805,0.0003861595,0.000006847765],"category_scores_gemma":[0.0001093907,0.0006395648,0.0003493212,0.0003832813,0.0002264487,0.001451919,0.0003056473,0.0003469808,0.000004018431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004753427,"about_ca_system_score_gemma":0.0001895667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001988394,"about_ca_topic_score_gemma":0.001316384,"domain_scores_codex":[0.9967496,0.000008972535,0.001210154,0.0008915231,0.00068883,0.000450912],"domain_scores_gemma":[0.9964749,0.00007060806,0.001264694,0.0008043412,0.001338943,0.00004651954],"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.0004922749,0.0001340009,0.0002296167,0.01315773,0.0003620829,0.000001160082,0.002373366,0.4815106,0.0005213214,0.4521383,0.00002855274,0.04905101],"study_design_scores_gemma":[0.001816619,0.0003074323,0.001098597,0.007094251,0.00321797,0.000005563334,0.00353482,0.8232521,0.001595355,0.1494412,0.004856957,0.003779065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8534277,0.03818829,0.0325289,0.01317099,0.004652737,0.01415921,0.001565828,0.003633392,0.03867297],"genre_scores_gemma":[0.991406,0.003247833,0.001722865,0.0003527928,0.0003834557,0.0003045011,0.0001768935,0.000313855,0.002091784],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3417415,"threshold_uncertainty_score":0.9996055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285213635","doi":"10.1007/978-3-030-95380-5_8","title":"Workload Balancing at Cross-Docking Platforms","year":2022,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Optimization and Packing Problems","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":"HEC Montréal","funders":"","keywords":"Workload; Truck; Container (type theory); Computer science; Integer programming; Operations research; Engineering; Operating system; Automotive engineering; Algorithm","authors":[{"name":"Nicolas Zufferey","is_ca":false},{"name":"Marc‐Antoine Coindreau","is_ca":false},{"name":"Olivier Gallay","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01248212389640737,"gpt":0.2071204750982882,"spread":0.1946383512018808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0005073849,0.001949207,0.001605065,0.0006814137,0.001284365,0.0006532498,0.001192234,0.001019956,0.01456946],"category_scores_gemma":[0.00005479189,0.002231445,0.0007085961,0.0003219254,0.0004455639,0.002006207,0.001604126,0.002154504,0.0008294117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001320327,"about_ca_system_score_gemma":0.0001468774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004221448,"about_ca_topic_score_gemma":0.0002672934,"domain_scores_codex":[0.9938967,0.00002444896,0.001665673,0.001518124,0.001242599,0.001652427],"domain_scores_gemma":[0.9966989,0.000120334,0.0005640587,0.001914845,0.0002001167,0.0005017135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001439536,0.0001875126,0.01739052,0.006688972,0.004129757,0.001680852,0.01020273,0.6415026,0.002704571,0.2761227,0.01905745,0.01889276],"study_design_scores_gemma":[0.0007938207,0.0001871399,0.001161251,0.0008931146,0.0001704329,0.0002585918,0.00007591131,0.0007825664,0.002443149,0.001843819,0.9882907,0.003099565],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01583656,0.01110493,0.0008589148,0.0003422435,0.01173528,0.001721892,0.0003337596,0.006959558,0.9511068],"genre_scores_gemma":[0.07375114,0.01244381,0.005775051,0.0005236483,0.001948098,0.0004001186,0.0005152949,0.002193858,0.902449],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9692332,"threshold_uncertainty_score":0.9999486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415028862","doi":"10.1007/978-3-031-90095-2_17","title":"Complexity Results on the Bi-Level Interdiction Knapsack Problem with Unit Interdiction Costs or Unit Weights","year":2025,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Infrastructure Resilience and Vulnerability Analysis","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":"Université de Montréal","funders":"","keywords":"Interdiction; Knapsack problem; Continuous knapsack problem; Unitary state; Computational complexity theory; Constraint (computer-aided design); Unit (ring theory)","authors":[{"name":"Alberto Boggio Tomasaz","is_ca":false},{"name":"Margarida Carvalho","is_ca":true},{"name":"Roberto Cordone","is_ca":false},{"name":"Pierre Hosteins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03108444116500014,"gpt":0.2327682559565606,"spread":0.2016838147915604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.000607155,0.001699822,0.001456663,0.000899134,0.0009929867,0.0004599282,0.001158316,0.0008999142,0.0009116491],"category_scores_gemma":[0.00010055,0.001200584,0.0005070581,0.0006605829,0.001132726,0.001113727,0.0005452537,0.002458432,0.0001981333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007957399,"about_ca_system_score_gemma":0.0002572094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002495768,"about_ca_topic_score_gemma":0.007332379,"domain_scores_codex":[0.9948782,0.0001473104,0.001518981,0.001424698,0.001012181,0.001018643],"domain_scores_gemma":[0.9961408,0.0003213376,0.0005234869,0.002230995,0.0005102652,0.0002731143],"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.01962506,0.000452311,0.001379194,0.005193712,0.01132734,0.000544705,0.007741509,0.03022702,0.001288688,0.821372,0.02918372,0.07166477],"study_design_scores_gemma":[0.002085922,0.002221382,0.006981391,0.006900339,0.001442603,0.0002280463,0.001341913,0.002339849,0.01269951,0.01231251,0.9473284,0.004118059],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.02463442,0.0007197073,0.01422221,0.005594146,0.004512243,0.004690079,0.001899398,0.004373013,0.9393548],"genre_scores_gemma":[0.4345666,0.00274457,0.006798021,0.0007695947,0.001829155,0.0005283242,0.0008889634,0.0008214527,0.5510533],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9181448,"threshold_uncertainty_score":0.9998429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393372583","doi":"10.1007/978-3-031-47686-0_24","title":"A Continuous Time Physical Graph Based Formulation to Scheduled Service Network Design","year":2024,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 à Montréal","funders":"","keywords":"Computer science; Network planning and design; Graph; Computer network; Theoretical computer science","authors":[{"name":"Giacomo Lanza","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Mauro Passacantando","is_ca":false},{"name":"Maria Grazia Scutellà","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01361247801313012,"gpt":0.2124434008473101,"spread":0.19883092283418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.000893577,0.001888846,0.002059002,0.001144857,0.0007446668,0.00116348,0.001186214,0.0006683752,0.001111504],"category_scores_gemma":[0.0001552794,0.001984618,0.0009258338,0.001152351,0.0002338413,0.003252949,0.001322854,0.001137985,0.006901383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000275515,"about_ca_system_score_gemma":0.0001237862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001048207,"about_ca_topic_score_gemma":0.0003003663,"domain_scores_codex":[0.9941711,0.00004384116,0.001240151,0.002051414,0.001060928,0.001432536],"domain_scores_gemma":[0.9960518,0.0002325336,0.0009274335,0.001866706,0.0007597456,0.0001617197],"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.00248811,0.0001697628,0.0001100143,0.001934811,0.001578637,0.000350605,0.0003849457,0.09910727,0.002468367,0.8848171,0.003797431,0.002792899],"study_design_scores_gemma":[0.0009500225,0.0002315925,0.0001931444,0.002406595,0.002692618,0.00001837169,0.00009028533,0.01751513,0.0009023428,0.2845968,0.6862226,0.004180587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0404818,0.004573207,0.1250828,0.03100874,0.01298894,0.01681397,0.0003046467,0.02306999,0.7456759],"genre_scores_gemma":[0.1582357,0.0001242852,0.05177167,0.01566437,0.02646958,0.001177405,0.0009343209,0.003589466,0.7420332],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.6824251,"threshold_uncertainty_score":0.9998734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4384435022","doi":"10.1007/978-3-031-28863-0_28","title":"Supply Chain Design and Cost Allocation in a Collaborative Three-Echelon Supply Network: A Literature Review","year":2023,"lang":"en","type":"review","venue":"AIRO Springer series/AIRO Springer Series","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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é Laval","funders":"","keywords":"Supply chain; Flexibility (engineering); Service management; Key (lock); Supply chain management; Supply chain risk management; Process management; Process (computing); Computer science; Network planning and design; Supply chain network; Risk analysis (engineering); Business; Operations research; Operations management; Engineering; Marketing; Economics","authors":[{"name":"Tatiana Grimard","is_ca":true},{"name":"Nadia Lehoux","is_ca":true},{"name":"Luc LeBel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0385793196861864,"gpt":0.2712923691437497,"spread":0.2327130494575633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002759737,0.001922492,0.003462608,0.001269322,0.000555327,0.001540407,0.001211393,0.0007498058,0.0003205139],"category_scores_gemma":[0.0003972574,0.001825985,0.000535875,0.00546296,0.0003594513,0.003813666,0.001746977,0.00126265,0.0004747502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004156312,"about_ca_system_score_gemma":0.0002958316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000286682,"about_ca_topic_score_gemma":0.00253402,"domain_scores_codex":[0.99303,0.0003146432,0.002103196,0.002018641,0.0008766922,0.001656873],"domain_scores_gemma":[0.9963218,0.0002428933,0.001404603,0.001474217,0.0004301738,0.000126325],"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.0004448307,0.0003628639,0.001191479,0.3179,0.001328718,0.001144814,0.0009374635,0.0002260874,0.000004639522,0.03964495,0.1013552,0.535459],"study_design_scores_gemma":[0.0005258943,0.00007790147,0.0004386645,0.09938628,0.0008177488,0.00002954274,0.0002167819,0.0001211148,0.000002219047,0.000713943,0.8960223,0.001647644],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00002067281,0.9851668,0.0002786249,0.002465876,0.001626443,0.008239995,0.00004884672,0.0007339638,0.001418711],"genre_scores_gemma":[0.00003428414,0.9860042,0.001520232,0.001833544,0.002116158,0.004027929,0.0007387135,0.0004542103,0.003270715],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.7946671,"threshold_uncertainty_score":0.9994961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}