{"meta":{"query_hash":"811b3a9bd0ec","filters":{"venue":"Reliable Computing"},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/811b3a9bd0ec","api":"https://metacan.xera.ac/api/v1/cohort?venue=Reliable+Computing"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Delaunay triangulation; Computation; Algorithm; Floating point; Sign (mathematics); Rounding; Mathematics; Computer science","score_opus":0.011646323250239623,"score_gpt":0.25388309387716557,"score_spread":0.24223677062692595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136659167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37039426,0.00034431354,0.62568104,0.00016841036,0.00012716881,0.00009747165,7.439393e-7,0.00007644549,0.0031101413],"genre_scores_gemma":[0.91335076,0.000015339045,0.08632625,0.00008670672,0.00004322801,0.0000010200453,0.0000068986606,0.0000054167594,0.00016440236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990253,0.000048644633,0.0003116616,0.00025903617,0.00019873715,0.00015661611],"domain_scores_gemma":[0.99941015,0.00015005359,0.00010237604,0.00016208678,0.00011480562,0.000060497714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032059196,0.000096695134,0.0001476716,0.0001330707,0.00016970857,0.0000773794,0.000158174,0.00004320314,0.00004253242],"category_scores_gemma":[0.000029147242,0.000100846504,0.000040490988,0.0005625136,0.0000249837,0.0002859847,0.0000630383,0.0000710496,0.000018617924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011232397,0.00008394128,0.00077616633,0.00003029737,0.000025075737,0.0000033155704,0.00084450527,0.56339157,0.0010877097,0.02981475,0.0006257964,0.40330568],"study_design_scores_gemma":[0.00042548738,0.00007470129,0.013616527,0.000046299694,0.00000598821,0.000024924571,0.00001177726,0.9788103,0.0007310655,0.0039716447,0.002144729,0.00013656156],"about_ca_topic_score_codex":0.000017035965,"about_ca_topic_score_gemma":6.110593e-7,"teacher_disagreement_score":0.5429565,"about_ca_system_score_codex":0.000018580704,"about_ca_system_score_gemma":0.000047063168,"threshold_uncertainty_score":0.4112401},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006351138298687647,"score_gpt":0.23888611231838525,"score_spread":0.2325349740196976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544671383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37346917,0.00015903941,0.623257,0.000036652254,0.000114845505,0.00014508092,9.334676e-7,0.00006818261,0.002749143],"genre_scores_gemma":[0.9509382,0.00000765248,0.04888437,0.000047328056,0.000050010894,0.000001488243,0.0000017859475,0.0000041446133,0.00006500526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924916,0.000065669614,0.00019109539,0.00022339619,0.00012984898,0.0001408259],"domain_scores_gemma":[0.9995637,0.00015568903,0.0000770512,0.00011685229,0.00004662273,0.00004006284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035970853,0.00008371855,0.00014162796,0.000056636305,0.00010407002,0.000051235653,0.00018877792,0.00003097792,0.000013630188],"category_scores_gemma":[0.000016542384,0.00007951244,0.000025590101,0.00019224193,0.000036994516,0.00020021132,0.00009820445,0.000078728204,0.000016241891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023257007,0.000082835686,0.0010684186,0.00010239397,0.000027502503,0.0000066997327,0.0011604681,0.011901115,0.0005948447,0.039105546,0.000116381096,0.94581056],"study_design_scores_gemma":[0.00032936354,0.00006613993,0.0034059319,0.000110431756,0.0000029444552,0.000028196297,0.000011454257,0.98473424,0.0014571811,0.009597123,0.00015894766,0.00009805086],"about_ca_topic_score_codex":0.000010861599,"about_ca_topic_score_gemma":1.5054556e-7,"teacher_disagreement_score":0.9728331,"about_ca_system_score_codex":0.0000120807945,"about_ca_system_score_gemma":0.000016241522,"threshold_uncertainty_score":0.32424232},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.030661094185814183,"score_gpt":0.35721351459385225,"score_spread":0.32655242040803806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181038668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736535,0.000033943932,0.78181505,0.000045514404,0.0002259454,0.00045253802,0.0000033701945,0.000039039896,0.000019233477],"genre_scores_gemma":[0.30213034,0.0000014393316,0.6977314,0.00004288849,0.00006475591,0.000013831599,0.0000016939194,0.000009759338,0.0000039220877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984151,0.00043020074,0.00032919174,0.0004163456,0.00013925116,0.00026989047],"domain_scores_gemma":[0.99803793,0.00083272875,0.0003075511,0.00042941756,0.0003191438,0.00007323418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021781342,0.00013133296,0.0003084022,0.000047989877,0.00023310524,0.000061973034,0.00059324474,0.000059976184,3.140502e-7],"category_scores_gemma":[0.00024231712,0.00010007217,0.00006319507,0.00038369145,0.000055748547,0.00039903505,0.00020696569,0.00009332353,3.749867e-8],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002978991,0.00014035052,0.0003564081,0.00015769672,0.00001902214,3.5946775e-7,0.00085509475,0.008654424,0.04846746,0.013191249,0.000002081837,0.92812604],"study_design_scores_gemma":[0.00037284958,0.0008033318,0.0014531257,0.00013720417,0.000016349471,0.000007770965,0.000093569164,0.915466,0.062454138,0.019028876,0.00004312873,0.00012367283],"about_ca_topic_score_codex":0.00037444677,"about_ca_topic_score_gemma":0.0000056227063,"teacher_disagreement_score":0.9280024,"about_ca_system_score_codex":0.000026104655,"about_ca_system_score_gemma":0.000033245837,"threshold_uncertainty_score":0.40808246},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematics","score_opus":0.008658628500872595,"score_gpt":0.2132866465933397,"score_spread":0.2046280180924671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204457991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593315,0.000027513484,0.0008045432,0.026632627,0.0023214943,0.00020593856,0.0000032367675,0.00007774438,0.010595415],"genre_scores_gemma":[0.93182236,0.00016778074,0.0033087712,0.0050711636,0.033117495,0.00001521424,0.00008170271,0.00003505235,0.02638045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898434,0.000048185728,0.00021548846,0.00033465604,0.0001993518,0.00021795386],"domain_scores_gemma":[0.9995303,0.00004581248,0.00005662582,0.00029217207,0.000012856764,0.00006223597],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017990114,0.00010681033,0.00010245752,0.00002903857,0.00041934,0.00022606335,0.00018134124,0.000041188407,0.03386687],"category_scores_gemma":[0.000029326848,0.00009394031,0.00003726648,0.00032852447,0.000037665453,0.00035500244,0.00008264164,0.00021204818,0.006063828],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040854058,0.000068849986,0.002644538,0.0000017050008,0.000018488417,0.0000013551012,0.0016840864,0.07306496,0.0011098569,0.000011901971,0.522997,0.39835635],"study_design_scores_gemma":[0.00010385011,0.000054317807,0.015728373,0.000044615645,0.000012537963,0.00001047031,0.0009340087,0.009305073,0.00055627926,0.000049590944,0.9730686,0.0001322762],"about_ca_topic_score_codex":0.0077124354,"about_ca_topic_score_gemma":0.001163197,"teacher_disagreement_score":0.45007157,"about_ca_system_score_codex":0.00021822144,"about_ca_system_score_gemma":0.0000074641844,"threshold_uncertainty_score":0.9988953},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024227704412229722,"score_gpt":0.278808969988708,"score_spread":0.2545812655764783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056331670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007064924,0.00029529465,0.9901294,0.00008725932,0.0001434843,0.0017379954,0.0000063360676,0.00044498764,0.00009033264],"genre_scores_gemma":[0.532809,7.0963324e-7,0.46681276,0.000014950379,0.00010565382,0.00014673495,0.000046423364,0.000015454065,0.000048271933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650174,0.00010087451,0.0010434025,0.0010184972,0.0005771489,0.00075832655],"domain_scores_gemma":[0.9963966,0.001610435,0.00035070145,0.00083463243,0.00069083995,0.000116804105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003632932,0.00028407568,0.0008128477,0.0004952922,0.00048785267,0.00050915906,0.0009254255,0.00012290619,0.0000010168671],"category_scores_gemma":[0.00094165705,0.0002717338,0.00063990016,0.0022734243,0.00003302353,0.00038177974,0.000301343,0.00015871818,0.0000028814968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007367206,0.00015061982,0.002940253,0.012490695,0.00023984231,7.0012914e-7,0.00007309271,0.97937095,0.00018674023,0.0035251821,0.000091261696,0.0009232976],"study_design_scores_gemma":[0.00047328707,0.00005034989,0.00052591314,0.00018771835,0.00029214594,0.0000021559079,0.000023846584,0.99689186,0.00021509865,0.0010059746,0.000040880976,0.000290785],"about_ca_topic_score_codex":0.00016926906,"about_ca_topic_score_gemma":0.0000020802308,"teacher_disagreement_score":0.52574414,"about_ca_system_score_codex":0.0002878961,"about_ca_system_score_gemma":0.00010532568,"threshold_uncertainty_score":0.9999735},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007072172241935242,"score_gpt":0.20463685742557983,"score_spread":0.1975646851836446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152750350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8054408,0.0033170378,0.08428562,0.0000074775476,0.0020813697,0.00022386915,0.0000018048149,0.0006867967,0.10395526],"genre_scores_gemma":[0.99884593,0.000009133189,0.00090466073,0.0000078969815,0.00004403093,0.0000015563754,6.176307e-7,0.000017327211,0.000168854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999348,0.000019065967,0.00023511316,0.000097656375,0.00009836959,0.00020181392],"domain_scores_gemma":[0.99970424,0.000049703463,0.000035886605,0.00013384563,0.000035140336,0.00004119986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025474952,0.00008537566,0.0001726249,0.000051157585,0.00006045922,0.000017746028,0.000064078224,0.000049074733,0.000029571966],"category_scores_gemma":[0.000041368512,0.00008644478,0.000048298272,0.00017943536,0.000008142238,0.000034748486,0.0000076933875,0.00009716943,0.000026291362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016079084,0.0000051919956,0.00037252443,0.00007852468,0.000020037698,0.0000016243747,0.000059272097,0.98937523,0.006824656,0.0010985193,0.000240459,0.0019223257],"study_design_scores_gemma":[0.0003482232,0.000013896561,0.000026383237,0.00008707681,0.0000062716567,0.000014788539,0.000115426235,0.95408183,0.018642496,0.00008382783,0.026466265,0.000113486145],"about_ca_topic_score_codex":0.00006365846,"about_ca_topic_score_gemma":0.000004337412,"teacher_disagreement_score":0.19340515,"about_ca_system_score_codex":0.000038896036,"about_ca_system_score_gemma":0.000013257569,"threshold_uncertainty_score":0.35251158},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034983481817895644,"score_gpt":0.3330606291159964,"score_spread":0.29807714729810075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227382844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043419085,0.00003078167,0.95401514,0.00032454554,0.00024026424,0.00022534144,0.0000024368974,0.00012564866,0.0016167776],"genre_scores_gemma":[0.45982328,0.0000022681395,0.53995883,0.00006697701,0.00006883391,0.000006999071,0.0000027438873,0.0000081856615,0.00006189689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876916,0.000072076116,0.00045380954,0.00031216533,0.0001333528,0.00025943966],"domain_scores_gemma":[0.9986737,0.00073028344,0.00019840691,0.0001850901,0.00015088868,0.000061638784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047232083,0.00012175861,0.00023866704,0.00007582442,0.00017214492,0.00007981143,0.00028258306,0.000047446676,0.00002583504],"category_scores_gemma":[0.0001888057,0.000117109026,0.0001050905,0.0003527178,0.000037889753,0.00054778304,0.00010560991,0.00013894856,0.000017540142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017017775,0.000092765295,0.00016362792,0.000024981244,0.000027261054,0.00000138134,0.001174088,0.008378788,0.0019096136,0.020182662,0.000104414525,0.9679234],"study_design_scores_gemma":[0.00036159606,0.00024083625,0.00020113922,0.00014312127,0.000008136806,0.000011163428,0.00015660773,0.9820447,0.0032145008,0.012357677,0.0011095967,0.00015095512],"about_ca_topic_score_codex":0.000035500587,"about_ca_topic_score_gemma":4.3981348e-7,"teacher_disagreement_score":0.9736659,"about_ca_system_score_codex":0.0000474878,"about_ca_system_score_gemma":0.000050148752,"threshold_uncertainty_score":0.47755674},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013498284435411527,"score_gpt":0.24108370185058134,"score_spread":0.2275854174151698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37962542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19887409,0.00736642,0.7278823,0.024875185,0.0014558103,0.0011878931,0.0000037606528,0.0010426114,0.0373119],"genre_scores_gemma":[0.8507925,0.000111467794,0.10671086,0.0051574144,0.0009375807,0.000020733763,0.000013960554,0.00003528242,0.03622019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979278,0.00016775745,0.00041573503,0.00050681864,0.00047277368,0.00050910737],"domain_scores_gemma":[0.99816495,0.00095538073,0.00014409186,0.0005419367,0.00011816117,0.00007546662],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010855983,0.00023009954,0.00018110687,0.000092515475,0.001895461,0.0008335821,0.0011916405,0.000047211197,0.00011729787],"category_scores_gemma":[0.000069431655,0.00012874287,0.000094364375,0.0014550342,0.000059227317,0.0004385122,0.00030216304,0.0003508423,0.000068913476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016378555,0.00005201434,0.0001433649,0.000032511387,0.000039399543,0.000009276724,0.0024754722,0.392636,0.0018686755,0.011520057,0.048663735,0.5425431],"study_design_scores_gemma":[0.00015226421,0.00002676915,0.00013285037,0.00009217391,0.000008729341,0.00007150701,0.00006476276,0.7624544,0.0012784264,0.0006709164,0.23483679,0.00021041605],"about_ca_topic_score_codex":0.00006689489,"about_ca_topic_score_gemma":0.000024094226,"teacher_disagreement_score":0.6519184,"about_ca_system_score_codex":0.00008402392,"about_ca_system_score_gemma":0.00012526358,"threshold_uncertainty_score":0.99940395},"labels":[],"label_agreement":null}]}