{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05139966,0.00036883817,0.937351,0.00015179631,0.000071007154,0.000034431778,0.000105950894,0.0005451719,0.009972241],"genre_scores_gemma":[0.7207799,0.00033083,0.2737489,0.000037398127,0.000039069673,0.000064258114,0.00015614476,0.00038774413,0.004455748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.00011347227,0.000027766715,0.0000815692,0.00040667792,0.00007215599],"domain_scores_gemma":[0.9975712,0.0011738654,0.00012214898,0.00055155257,0.0004970217,0.00008429336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886515,0.0004940376,0.00089462847,0.0012026334,0.00080537953,0.0012375843,0.0013272706,0.0008223327,0.0061441017],"category_scores_gemma":[0.010924723,0.00056298,0.00042749837,0.001137508,0.0013662194,0.0024597535,0.0019032203,0.00068949914,0.00076160266],"study_design_candidate":"theoretical_or_conceptual","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.00021837908,0.000024388688,0.001317326,0.000230294,0.000029425388,0.00022514824,0.0005100708,0.61030465,0.0031560815,0.22121276,0.0028834273,0.15988806],"study_design_scores_gemma":[0.000015001286,0.000017013148,0.00018919264,0.000014799913,0.0000064854084,0.000070785914,0.000063884465,0.9328473,0.0020283356,0.062388886,0.0023488312,0.00000946268],"about_ca_topic_score_codex":0.002588628,"about_ca_topic_score_gemma":0.0048864908,"teacher_disagreement_score":0.0061441017,"about_ca_system_score_codex":0.0008727504,"about_ca_system_score_gemma":0.00070894003,"threshold_uncertainty_score":0.020554066},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032694373,0.0011571029,0.95158195,0.0003220589,0.00033125022,0.000028613495,0.000051155606,0.00044725498,0.01338626],"genre_scores_gemma":[0.69946146,0.0014952354,0.2876559,0.00014765968,0.00034486168,0.00008672406,0.00013373862,0.0005463609,0.010128067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998828,0.00036534242,0.00004663997,0.00009962858,0.0005550634,0.00010530997],"domain_scores_gemma":[0.9979469,0.0009994111,0.000110631525,0.00048602888,0.0003546176,0.000102353544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00190304,0.00096846116,0.0012852638,0.0016064835,0.000842591,0.002512362,0.0015369158,0.0009904904,0.00412814],"category_scores_gemma":[0.009361921,0.0005016061,0.00054273766,0.0014876937,0.0024749718,0.0032166939,0.0017279489,0.0022484171,0.0010083028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00008255195,0.000020401732,0.00014901614,0.00010244434,0.000020031086,0.00006596338,0.00013091801,0.045063652,0.0018046487,0.9163501,0.0014725174,0.034737736],"study_design_scores_gemma":[0.000019872365,0.000028460687,0.00008035048,0.000034386798,0.000017162969,0.00004831161,0.000044454817,0.4171368,0.0039959177,0.5742763,0.0042985617,0.000019412611],"about_ca_topic_score_codex":0.0008457341,"about_ca_topic_score_gemma":0.0011950566,"teacher_disagreement_score":0.00412814,"about_ca_system_score_codex":0.0009883567,"about_ca_system_score_gemma":0.00074385846,"threshold_uncertainty_score":0.013809979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138693815,0.00008717786,0.9831087,0.000039328108,0.000052551495,0.000036407328,0.000020127867,0.00019544437,0.0025907748],"genre_scores_gemma":[0.4417913,0.00017047585,0.55572313,0.000070344235,0.00003981084,0.00015893583,0.00007341794,0.000113682974,0.0018590519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.00026803053,0.000037113845,0.00007522175,0.0003775581,0.00005475621],"domain_scores_gemma":[0.9977323,0.0012590385,0.00015962488,0.00036227435,0.0003941947,0.000092608905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018645099,0.0005299056,0.00072520407,0.00072741864,0.00060156465,0.00092413893,0.0014893301,0.001110762,0.002400133],"category_scores_gemma":[0.0054582753,0.00027919177,0.0006304113,0.00041046238,0.0012463002,0.0010851739,0.0012137174,0.0014679254,0.00030879845],"study_design_candidate":"theoretical_or_conceptual","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.0003085218,0.00015537502,0.0015955697,0.000388103,0.0000746643,0.0002479795,0.00028401398,0.686672,0.037482128,0.17370985,0.0012267824,0.09785501],"study_design_scores_gemma":[0.000007612843,0.00004918037,0.00009649935,0.000009422238,0.000006218763,0.000020815742,0.00000896075,0.9923366,0.0023694984,0.0044271727,0.0006599687,0.0000080941445],"about_ca_topic_score_codex":0.0013741121,"about_ca_topic_score_gemma":0.0009644162,"teacher_disagreement_score":0.002400133,"about_ca_system_score_codex":0.0004264119,"about_ca_system_score_gemma":0.00088325114,"threshold_uncertainty_score":0.009860575},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007695353,0.07565924,0.017014824,0.2648095,0.61646056,0.00006899158,0.0005045679,0.00042875618,0.024283934],"genre_scores_gemma":[0.0069951746,0.06271328,0.006326271,0.06391515,0.80654925,0.0000980995,0.0006505279,0.000474798,0.052277446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925345,0.00019356607,0.00008752207,0.00016122371,0.00024230374,0.000061865365],"domain_scores_gemma":[0.9863521,0.0076603913,0.00039845932,0.0006131326,0.0036616887,0.0013143114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021317718,0.001450751,0.0019731272,0.0014727575,0.0018447839,0.005072786,0.0018146071,0.0057104537,0.02747805],"category_scores_gemma":[0.0147771025,0.00053844735,0.0010671004,0.0013451754,0.0019885064,0.007862731,0.0020176012,0.008525511,0.014536754],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000019460866,0.000017443079,0.00017585226,0.00019815848,0.000009228923,0.000066598346,0.000060631493,0.00015419166,0.000089448215,0.004791856,0.960294,0.034123052],"study_design_scores_gemma":[0.000011732857,0.000041739208,0.00057546195,0.00039130304,0.000024236711,0.00036540354,0.00025104673,0.0007270466,0.0001147483,0.024220452,0.97324544,0.000031363976],"about_ca_topic_score_codex":0.00132378,"about_ca_topic_score_gemma":0.0026102618,"teacher_disagreement_score":0.02747805,"about_ca_system_score_codex":0.00090622116,"about_ca_system_score_gemma":0.0011009072,"threshold_uncertainty_score":0.09192318},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016482229,0.00056808855,0.99411714,0.00047878796,0.000028192066,0.00029315072,0.00008678519,0.00053864316,0.0022410431],"genre_scores_gemma":[0.02208466,0.0008914241,0.975176,0.00015878877,0.00004437445,0.0003214591,0.00022768835,0.00027429382,0.0008212916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98019594,0.008114326,0.0010613321,0.0011952838,0.009048245,0.0003848881],"domain_scores_gemma":[0.9702106,0.015496342,0.0014555412,0.0061101597,0.0064884173,0.00023892781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010298065,0.0030982709,0.0022714182,0.006372975,0.00175068,0.0041779033,0.004089039,0.0018604551,0.0031280736],"category_scores_gemma":[0.042581145,0.0019755766,0.003492882,0.0029998743,0.002889107,0.0049373806,0.0030203706,0.004280911,0.0018798223],"study_design_candidate":"theoretical_or_conceptual","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.000109489265,0.00046733313,0.0022821373,0.0034771168,0.00039194062,0.00041892866,0.001881821,0.076769896,0.022511018,0.24982278,0.0108575905,0.63100994],"study_design_scores_gemma":[0.00013517085,0.00031481293,0.0014250309,0.0020951424,0.00050672493,0.0006937684,0.00092747406,0.46570623,0.037783064,0.41907156,0.07109014,0.0002508419],"about_ca_topic_score_codex":0.0043497025,"about_ca_topic_score_gemma":0.00559356,"teacher_disagreement_score":0.010298065,"about_ca_system_score_codex":0.0021681057,"about_ca_system_score_gemma":0.008734155,"threshold_uncertainty_score":0.054462016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012799145,0.0016264296,0.9731433,0.0006934993,0.00022767446,0.000031082436,0.00010402098,0.0005438912,0.010830964],"genre_scores_gemma":[0.8694707,0.0030595222,0.1134408,0.00035370147,0.00069889013,0.00014448818,0.00038197028,0.00032619436,0.012123678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982266,0.0003162775,0.0000942425,0.00026104503,0.0009400141,0.00016185748],"domain_scores_gemma":[0.996002,0.0017960488,0.00027737467,0.0013213296,0.00051266095,0.00009049934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012446032,0.000721874,0.0009078796,0.0007647864,0.0006723381,0.0022617737,0.0015963438,0.0010994918,0.0034334033],"category_scores_gemma":[0.0077627287,0.0004610553,0.0006824782,0.0008662525,0.0016270137,0.0034473715,0.0024387701,0.0025583315,0.00076106325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00024578668,0.000048644553,0.00041256807,0.00030933708,0.00008596652,0.00050239824,0.00046004512,0.1886498,0.014404509,0.6102688,0.0069106254,0.1777015],"study_design_scores_gemma":[0.0000212447,0.000056174093,0.0002018407,0.000043158365,0.000028679045,0.00012505664,0.000044587807,0.5058117,0.00711413,0.47421065,0.012317614,0.000025170453],"about_ca_topic_score_codex":0.0010518474,"about_ca_topic_score_gemma":0.0007006203,"teacher_disagreement_score":0.0034334033,"about_ca_system_score_codex":0.00074111274,"about_ca_system_score_gemma":0.00068751135,"threshold_uncertainty_score":0.011485875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014602637,0.00018567736,0.96047467,0.0002683745,0.00006140644,0.000109949986,0.0006466364,0.016610792,0.0070398706],"genre_scores_gemma":[0.20195857,0.00041946603,0.78602695,0.00019267017,0.00006386551,0.00037414048,0.00092563924,0.0064723184,0.0035663452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00016406161,0.000036281155,0.00006766161,0.00022877473,0.00005925926],"domain_scores_gemma":[0.9938089,0.004878816,0.00016136953,0.0005796661,0.00033428575,0.0002369155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011353245,0.0013925638,0.0011371819,0.0015829313,0.0007706713,0.0024149467,0.0019469089,0.0012539637,0.035744857],"category_scores_gemma":[0.0097867865,0.0005713317,0.00067994307,0.0016078715,0.0008804284,0.002251226,0.0040313196,0.0017791485,0.0020999839],"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.0021180802,0.00023894722,0.0021979425,0.0019563916,0.00010905988,0.0016472035,0.0048204563,0.0775024,0.059855312,0.15081337,0.05873417,0.64000666],"study_design_scores_gemma":[0.0002918872,0.00015207846,0.0010499766,0.0003899611,0.000070801,0.00050925405,0.00055976026,0.7778536,0.0390454,0.100712754,0.07923105,0.0001334402],"about_ca_topic_score_codex":0.0026068066,"about_ca_topic_score_gemma":0.003843365,"teacher_disagreement_score":0.035744857,"about_ca_system_score_codex":0.0005227804,"about_ca_system_score_gemma":0.0007463856,"threshold_uncertainty_score":0.11957842},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079204224,0.00066231727,0.8844936,0.0018332119,0.00067463645,0.00014270718,0.00020600048,0.0005623504,0.032220915],"genre_scores_gemma":[0.6114871,0.0013211413,0.37221384,0.0012416586,0.00022881295,0.00029595746,0.0003804609,0.0010593884,0.011771654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990909,0.00023021255,0.000060818493,0.00019462773,0.00031759214,0.000105750274],"domain_scores_gemma":[0.9978435,0.00048886327,0.00020742547,0.0011574335,0.00013748284,0.00016521779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958532,0.0010270512,0.001575644,0.0011008474,0.0015023835,0.001880099,0.0017482176,0.0017638232,0.009327163],"category_scores_gemma":[0.009495059,0.0007556846,0.00087573717,0.00087085355,0.0025347702,0.0040157554,0.00556536,0.0027833076,0.0018209915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00036683318,0.00028764142,0.0021888416,0.0005728449,0.00014548916,0.00048112054,0.0005134584,0.26364774,0.03541937,0.58545285,0.005154348,0.105769485],"study_design_scores_gemma":[0.00006752297,0.00012657295,0.00043921187,0.00008353079,0.000049585167,0.00032223912,0.00023423928,0.4221317,0.0067122905,0.5520954,0.017697122,0.000040647858],"about_ca_topic_score_codex":0.00064631476,"about_ca_topic_score_gemma":0.0007484911,"teacher_disagreement_score":0.009327163,"about_ca_system_score_codex":0.00059495604,"about_ca_system_score_gemma":0.00081576075,"threshold_uncertainty_score":0.031202495},"labels":[],"label_agreement":null}]}