{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"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"},"query_hash":"811b3a9bd0ec","filters":{"venue":"Reliable Computing"}},"results":[{"id":"W181038668","doi":"10.1023/a:1014798618404","title":"An Effective High-Order Interval Method for Validating Existence and Uniqueness of the Solution of an IVP for an ODE","year":2001,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University","funders":"Information Technology Research Centre","keywords":"A priori and a posteriori; Interval (graph theory); Uniqueness; Ordinary differential equation; Mathematics; Initial value problem; Enclosure; Computer science; Mathematical optimization; Applied mathematics; Differential equation; Algorithm; Mathematical analysis; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03066109418581418,"gpt":0.3572135145938523,"spread":0.3265524204080381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178134,0.000131333,0.0003084022,0.00004798988,0.0002331052,0.00006197303,0.0005932447,0.00005997618,3.140502e-7],"category_scores_gemma":[0.0002423171,0.0001000722,0.00006319507,0.0003836915,0.00005574855,0.0003990351,0.0002069657,0.00009332353,3.749867e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002610466,"about_ca_system_score_gemma":0.00003324584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003744468,"about_ca_topic_score_gemma":0.000005622706,"domain_scores_codex":[0.9984151,0.0004302007,0.0003291917,0.0004163456,0.0001392512,0.0002698905],"domain_scores_gemma":[0.9980379,0.0008327288,0.0003075511,0.0004294176,0.0003191438,0.00007323418],"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.00002978991,0.0001403505,0.0003564081,0.0001576967,0.00001902214,3.594677e-7,0.0008550948,0.008654424,0.04846746,0.01319125,0.000002081837,0.928126],"study_design_scores_gemma":[0.0003728496,0.0008033318,0.001453126,0.0001372042,0.00001634947,0.000007770965,0.00009356916,0.915466,0.06245414,0.01902888,0.00004312873,0.0001236728],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2173654,0.00003394393,0.7818151,0.0000455144,0.0002259454,0.000452538,0.000003370194,0.0000390399,0.00001923348],"genre_scores_gemma":[0.3021303,0.000001439332,0.6977314,0.00004288849,0.00006475591,0.0000138316,0.000001693919,0.000009759338,0.000003922088],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9280024,"threshold_uncertainty_score":0.4080825,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056331670","doi":"10.1007/s11155-006-9020-7","title":"Requirements Analysis for Engineering Computation: A Systematic Approach for Improving Reliability","year":2006,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Documentation; Computer science; Software requirements specification; Software engineering; Requirements engineering; System requirements specification; Requirements analysis; Reliability (semiconductor); Computation; Reliability engineering; Functional specification; Argument (complex analysis); Software; Software system; Systems engineering; Programming language; Software construction; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02422770441222972,"gpt":0.278808969988708,"spread":0.2545812655764783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003632932,0.0002840757,0.0008128477,0.0004952922,0.0004878527,0.0005091591,0.0009254255,0.0001229062,0.000001016867],"category_scores_gemma":[0.0009416571,0.0002717338,0.0006399002,0.002273424,0.00003302353,0.0003817797,0.000301343,0.0001587182,0.000002881497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002878961,"about_ca_system_score_gemma":0.0001053257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001692691,"about_ca_topic_score_gemma":0.000002080231,"domain_scores_codex":[0.9965017,0.0001008745,0.001043402,0.001018497,0.0005771489,0.0007583266],"domain_scores_gemma":[0.9963966,0.001610435,0.0003507014,0.0008346324,0.00069084,0.0001168041],"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.000007367206,0.0001506198,0.002940253,0.0124907,0.0002398423,7.001291e-7,0.00007309271,0.979371,0.0001867402,0.003525182,0.0000912617,0.0009232976],"study_design_scores_gemma":[0.0004732871,0.00005034989,0.0005259131,0.0001877184,0.0002921459,0.000002155908,0.00002384658,0.9968919,0.0002150987,0.001005975,0.00004088098,0.000290785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007064924,0.0002952947,0.9901294,0.00008725932,0.0001434843,0.001737995,0.000006336068,0.0004449876,0.00009033264],"genre_scores_gemma":[0.532809,7.096332e-7,0.4668128,0.00001495038,0.0001056538,0.000146735,0.00004642336,0.00001545406,0.00004827193],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5257441,"threshold_uncertainty_score":0.9999735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152750350","doi":"10.1023/a:1025888503247","title":"Dependable Handling of Uncertainty","year":2003,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Work (physics); Field (mathematics); Risk analysis (engineering); Engineering; Mathematics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.007072172241935242,"gpt":0.2046368574255798,"spread":0.1975646851836446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002547495,0.00008537566,0.0001726249,0.00005115759,0.00006045922,0.00001774603,0.00006407822,0.00004907473,0.00002957197],"category_scores_gemma":[0.00004136851,0.00008644478,0.00004829827,0.0001794354,0.000008142238,0.00003474849,0.000007693387,0.00009716943,0.00002629136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003889604,"about_ca_system_score_gemma":0.00001325757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006365846,"about_ca_topic_score_gemma":0.000004337412,"domain_scores_codex":[0.999348,0.00001906597,0.0002351132,0.00009765638,0.00009836959,0.0002018139],"domain_scores_gemma":[0.9997042,0.00004970346,0.00003588661,0.0001338456,0.00003514034,0.00004119986],"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.000001607908,0.000005191996,0.0003725244,0.00007852468,0.0000200377,0.000001624375,0.0000592721,0.9893752,0.006824656,0.001098519,0.000240459,0.001922326],"study_design_scores_gemma":[0.0003482232,0.00001389656,0.00002638324,0.00008707681,0.000006271657,0.00001478854,0.0001154262,0.9540818,0.0186425,0.00008382783,0.02646627,0.0001134861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8054408,0.003317038,0.08428562,0.000007477548,0.00208137,0.0002238692,0.000001804815,0.0006867967,0.1039553],"genre_scores_gemma":[0.9988459,0.000009133189,0.0009046607,0.000007896982,0.00004403093,0.000001556375,6.176307e-7,0.00001732721,0.000168854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1934052,"threshold_uncertainty_score":0.3525116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W136659167","doi":"10.1023/a:1009934225596","title":"Exact Computation of Delaunay and Power Triangulations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Delaunay triangulation; Computation; Algorithm; Floating point; Sign (mathematics); Rounding; Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01164632325023962,"gpt":0.2538830938771656,"spread":0.2422367706269259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000320592,0.00009669513,0.0001476716,0.0001330707,0.0001697086,0.0000773794,0.000158174,0.00004320314,0.00004253242],"category_scores_gemma":[0.00002914724,0.0001008465,0.00004049099,0.0005625136,0.0000249837,0.0002859847,0.0000630383,0.0000710496,0.00001861792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000185807,"about_ca_system_score_gemma":0.00004706317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001703597,"about_ca_topic_score_gemma":6.110593e-7,"domain_scores_codex":[0.9990253,0.00004864463,0.0003116616,0.0002590362,0.0001987372,0.0001566161],"domain_scores_gemma":[0.9994102,0.0001500536,0.000102376,0.0001620868,0.0001148056,0.00006049771],"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.0000112324,0.00008394128,0.0007761663,0.00003029737,0.00002507574,0.00000331557,0.0008445053,0.5633916,0.00108771,0.02981475,0.0006257964,0.4033057],"study_design_scores_gemma":[0.0004254874,0.00007470129,0.01361653,0.00004629969,0.00000598821,0.00002492457,0.00001177726,0.9788103,0.0007310655,0.003971645,0.002144729,0.0001365616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3703943,0.0003443135,0.625681,0.0001684104,0.0001271688,0.00009747165,7.439393e-7,0.00007644549,0.003110141],"genre_scores_gemma":[0.9133508,0.00001533904,0.08632625,0.00008670672,0.00004322801,0.000001020045,0.000006898661,0.000005416759,0.0001644024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5429565,"threshold_uncertainty_score":0.4112401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1544671383","doi":"10.1023/a:1009942122633","title":"Effective Computation of Rational Approximants and Interpolants","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"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":"Computation; Symbolic computation; Mathematics; Path (computing); Vandermonde matrix; Toeplitz matrix; Polynomial; Algorithm; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.006351138298687647,"gpt":0.2388861123183852,"spread":0.2325349740196976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597085,0.00008371855,0.000141628,0.00005663631,0.00010407,0.00005123565,0.0001887779,0.00003097792,0.00001363019],"category_scores_gemma":[0.00001654238,0.00007951244,0.0000255901,0.0001922419,0.00003699452,0.0002002113,0.00009820445,0.0000787282,0.00001624189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001208079,"about_ca_system_score_gemma":0.00001624152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000108616,"about_ca_topic_score_gemma":1.505456e-7,"domain_scores_codex":[0.9992492,0.00006566961,0.0001910954,0.0002233962,0.000129849,0.0001408259],"domain_scores_gemma":[0.9995637,0.000155689,0.0000770512,0.0001168523,0.00004662273,0.00004006284],"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.00002325701,0.00008283569,0.001068419,0.000102394,0.0000275025,0.000006699733,0.001160468,0.01190112,0.0005948447,0.03910555,0.0001163811,0.9458106],"study_design_scores_gemma":[0.0003293635,0.00006613993,0.003405932,0.0001104318,0.000002944455,0.0000281963,0.00001145426,0.9847342,0.001457181,0.009597123,0.0001589477,0.00009805086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3734692,0.0001590394,0.623257,0.00003665225,0.0001148455,0.0001450809,9.334676e-7,0.00006818261,0.002749143],"genre_scores_gemma":[0.9509382,0.00000765248,0.04888437,0.00004732806,0.00005001089,0.000001488243,0.000001785947,0.000004144613,0.00006500526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9728331,"threshold_uncertainty_score":0.3242423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W227382844","doi":"10.1023/a:1009950630139","title":"Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","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":"University of Victoria","funders":"","keywords":"Hull; Correctness; Completeness (order theory); Computer science; Testbed; Java applet; Property (philosophy); Interval arithmetic; Java; Mathematics; Interval (graph theory); Algorithm; Calculus (dental); Discrete mathematics; Programming language; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03498348181789564,"gpt":0.3330606291159964,"spread":0.2980771472981008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004723208,0.0001217586,0.000238667,0.00007582442,0.0001721449,0.00007981143,0.0002825831,0.00004744668,0.00002583504],"category_scores_gemma":[0.0001888057,0.000117109,0.0001050905,0.0003527178,0.00003788975,0.000547783,0.0001056099,0.0001389486,0.00001754014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000474878,"about_ca_system_score_gemma":0.00005014875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003550059,"about_ca_topic_score_gemma":4.398135e-7,"domain_scores_codex":[0.9987692,0.00007207612,0.0004538095,0.0003121653,0.0001333528,0.0002594397],"domain_scores_gemma":[0.9986737,0.0007302834,0.0001984069,0.0001850901,0.0001508887,0.00006163878],"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.00001701778,0.00009276529,0.0001636279,0.00002498124,0.00002726105,0.00000138134,0.001174088,0.008378788,0.001909614,0.02018266,0.0001044145,0.9679234],"study_design_scores_gemma":[0.0003615961,0.0002408362,0.0002011392,0.0001431213,0.000008136806,0.00001116343,0.0001566077,0.9820447,0.003214501,0.01235768,0.001109597,0.0001509551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04341909,0.00003078167,0.9540151,0.0003245455,0.0002402642,0.0002253414,0.000002436897,0.0001256487,0.001616778],"genre_scores_gemma":[0.4598233,0.000002268139,0.5399588,0.00006697701,0.00006883391,0.000006999071,0.000002743887,0.000008185661,0.00006189689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9736659,"threshold_uncertainty_score":0.4775567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W204457991","doi":"10.1023/a:1009984921053","title":"Introduction to the Special Issue: What Can One Learn from Box-Plane Intersections?","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Wildlife-Road Interactions and Conservation","field":"Environmental Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008658628500872595,"gpt":0.2132866465933397,"spread":0.2046280180924671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001799011,0.0001068103,0.0001024575,0.00002903857,0.00041934,0.0002260633,0.0001813412,0.00004118841,0.03386687],"category_scores_gemma":[0.00002932685,0.00009394031,0.00003726648,0.0003285245,0.00003766545,0.0003550024,0.00008264164,0.0002120482,0.006063828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002182214,"about_ca_system_score_gemma":0.000007464184,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007712435,"about_ca_topic_score_gemma":0.001163197,"domain_scores_codex":[0.9989843,0.00004818573,0.0002154885,0.000334656,0.0001993518,0.0002179539],"domain_scores_gemma":[0.9995303,0.00004581248,0.00005662582,0.0002921721,0.00001285676,0.00006223597],"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.00004085406,0.00006884999,0.002644538,0.000001705001,0.00001848842,0.000001355101,0.001684086,0.07306496,0.001109857,0.00001190197,0.522997,0.3983563],"study_design_scores_gemma":[0.0001038501,0.00005431781,0.01572837,0.00004461564,0.00001253796,0.00001047031,0.0009340087,0.009305073,0.0005562793,0.00004959094,0.9730686,0.0001322762],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9593315,0.00002751348,0.0008045432,0.02663263,0.002321494,0.0002059386,0.000003236767,0.00007774438,0.01059541],"genre_scores_gemma":[0.9318224,0.0001677807,0.003308771,0.005071164,0.0331175,0.00001521424,0.00008170271,0.00003505235,0.02638045],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4500716,"threshold_uncertainty_score":0.9988953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W37962542","doi":"10.1023/a:1009942427413","title":"Removing Degeneracies by Perturbing the Problem or Perturbing the World","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Delaunay triangulation; Euclidean geometry; Triangulation; Computational geometry; Bowyer–Watson algorithm; Mathematics; Simple (philosophy); Computer science; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01349828443541153,"gpt":0.2410837018505813,"spread":0.2275854174151698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001085598,0.0002300995,0.0001811069,0.00009251547,0.001895461,0.0008335821,0.001191641,0.0000472112,0.0001172979],"category_scores_gemma":[0.00006943165,0.0001287429,0.00009436438,0.001455034,0.00005922732,0.0004385122,0.000302163,0.0003508423,0.00006891348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008402392,"about_ca_system_score_gemma":0.0001252636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006689489,"about_ca_topic_score_gemma":0.00002409423,"domain_scores_codex":[0.9979278,0.0001677574,0.000415735,0.0005068186,0.0004727737,0.0005091074],"domain_scores_gemma":[0.998165,0.0009553807,0.0001440919,0.0005419367,0.0001181612,0.00007546662],"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.00001637856,0.00005201434,0.0001433649,0.00003251139,0.00003939954,0.000009276724,0.002475472,0.392636,0.001868675,0.01152006,0.04866374,0.5425431],"study_design_scores_gemma":[0.0001522642,0.00002676915,0.0001328504,0.00009217391,0.000008729341,0.00007150701,0.00006476276,0.7624544,0.001278426,0.0006709164,0.2348368,0.0002104161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1988741,0.00736642,0.7278823,0.02487518,0.00145581,0.001187893,0.000003760653,0.001042611,0.0373119],"genre_scores_gemma":[0.8507925,0.0001114678,0.1067109,0.005157414,0.0009375807,0.00002073376,0.00001396055,0.00003528242,0.03622019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6519184,"threshold_uncertainty_score":0.999404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}