{"meta":{"query_hash":"27b8360d6bf9","filters":{"venue":"Journal of Information Processing"},"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/27b8360d6bf9","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Information+Processing"},"results":[{"id":"W2090740586","doi":"10.2197/ipsjjip.19.231","title":"Defining and Investigating Device Comfort","year":2011,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Carleton University; Communications Research Centre Canada","funders":"","keywords":"Computer science; Context (archaeology); Human–computer interaction; Mobile device; Work (physics); State (computer science); Context awareness; World Wide Web","score_opus":0.030430273309762463,"score_gpt":0.250170893830511,"score_spread":0.21974062052074853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090740586","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.3560807,0.0004940269,0.63455683,0.00036435103,0.00024455538,0.00007322466,3.2327128e-7,0.00005775153,0.008128205],"genre_scores_gemma":[0.93701243,0.000004521797,0.062420387,0.000544463,0.000011536815,5.474924e-7,2.8323623e-7,0.0000014961464,0.0000043049863],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915785,0.000018647079,0.0005146454,0.000032607037,0.00019750807,0.00007875222],"domain_scores_gemma":[0.9988933,0.00001859742,0.00068921916,0.000065982225,0.00025798022,0.00007490799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053407,0.000050078885,0.00009069863,0.00015594275,0.0001116668,0.00025940436,0.00023289777,0.000026010865,0.000002427693],"category_scores_gemma":[0.000107546184,0.0000413297,0.000018625187,0.0001884193,0.000020782398,0.005322441,0.00004424544,0.00010170359,0.000006997022],"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.000005510667,0.00002472515,0.020866621,0.00034031196,0.000019108616,0.0000024762435,0.6109452,0.000006549284,0.00009343507,0.051561367,0.00018540697,0.31594926],"study_design_scores_gemma":[0.0022840337,0.0003642097,0.084205955,0.002187609,0.00005471942,0.002755869,0.015536028,0.8376217,0.007964065,0.031238347,0.015015609,0.0007718678],"about_ca_topic_score_codex":0.0000032701832,"about_ca_topic_score_gemma":4.810558e-7,"teacher_disagreement_score":0.83761513,"about_ca_system_score_codex":0.000013542731,"about_ca_system_score_gemma":0.00010424573,"threshold_uncertainty_score":0.38586414},"labels":[],"label_agreement":null},{"id":"W2176748244","doi":"10.2197/ipsjjip.23.554","title":"A Model for Adversarial Wiretap Channels and its Applications","year":2015,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Alberta Innovates","keywords":"Computer science; Secrecy; Adversarial system; Adversary; Alice and Bob; Secure communication; Channel (broadcasting); Computer network; Coding (social sciences); Secure coding; Secret sharing; Transmission (telecommunications); Computer security; Theoretical computer science; Cryptography; Telecommunications; Alice (programming language); Encryption; Artificial intelligence; Mathematics; Information security","score_opus":0.040268984927513296,"score_gpt":0.2779475069577659,"score_spread":0.23767852203025258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176748244","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.005555815,0.0006746965,0.9925592,0.0001740992,0.00004895758,0.00019914522,0.000004629451,0.000092524526,0.0006909504],"genre_scores_gemma":[0.95800185,0.00008750585,0.04172597,0.00006517107,0.000063586274,0.000036751815,0.0000052822743,0.0000074349728,0.0000064616315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.000004859434,0.00039753225,0.000020479192,0.00013499371,0.00007314686],"domain_scores_gemma":[0.9990592,0.00002097317,0.0002238588,0.00006299778,0.00056044076,0.000072557465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003541604,0.000061435836,0.00010608538,0.00015348256,0.00005329846,0.00009526518,0.00013787496,0.00005247205,5.2912463e-7],"category_scores_gemma":[0.00007215551,0.000059309936,0.000024282876,0.00009883626,0.00001106749,0.002459276,0.000018688714,0.000107681946,0.0000013961035],"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.00013701119,0.000054624106,0.000026838647,0.0014318746,0.00007622507,2.7171097e-7,0.055298697,0.5365231,0.0016091232,0.012210345,0.007070749,0.38556114],"study_design_scores_gemma":[0.00038745967,0.000017490642,0.0000025758873,0.0000549776,0.000009880413,0.000019794186,0.00027403055,0.9868134,0.0014208555,0.0027774475,0.008155366,0.00006669762],"about_ca_topic_score_codex":1.689889e-7,"about_ca_topic_score_gemma":2.1026791e-7,"teacher_disagreement_score":0.95244604,"about_ca_system_score_codex":0.000054487824,"about_ca_system_score_gemma":0.00008198378,"threshold_uncertainty_score":0.2418589},"labels":[],"label_agreement":null},{"id":"W2178800862","doi":"10.2197/ipsjjip.23.570","title":"New Secret Sharing Schemes Realizing General Access Structures","year":2015,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science; Secret sharing; Access structure; Secure multi-party computation; Homomorphic secret sharing; Verifiable secret sharing; Computer security; Computer network; Theoretical computer science; Distributed computing; Cryptography","score_opus":0.04172216416135151,"score_gpt":0.3144399746624166,"score_spread":0.2727178105010651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178800862","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.028852917,0.00032693765,0.9682701,0.00027081725,0.00025422123,0.000032659693,0.000001176938,0.000040456725,0.0019506965],"genre_scores_gemma":[0.51370776,0.000023029905,0.48521128,0.0006728341,0.0003678105,4.9920857e-7,0.000008189654,0.0000043345844,0.0000042801694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987783,0.000012732799,0.0005404075,0.000065500244,0.00045382424,0.00014923236],"domain_scores_gemma":[0.99845535,0.000009983441,0.00073722977,0.00015500927,0.00044067056,0.00020178079],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00054277125,0.0000906263,0.00013344939,0.00031667785,0.00011246303,0.0016990006,0.0010329519,0.00004739216,0.000006532995],"category_scores_gemma":[0.000121751254,0.00007300764,0.000053263477,0.00048503163,0.000012997319,0.021302858,0.0002482106,0.00019593658,0.0000019964796],"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.000066753295,0.000016662872,0.0050696805,0.00017626221,0.000037488466,0.000010431554,0.012375486,0.0025751158,0.00014979683,0.21754563,0.015857251,0.74611944],"study_design_scores_gemma":[0.0046801628,0.00032680406,0.012853797,0.00082035497,0.000059151895,0.0016841793,0.0026535767,0.24659917,0.015710136,0.5235295,0.18997565,0.00110746],"about_ca_topic_score_codex":0.000019805377,"about_ca_topic_score_gemma":0.0000015317596,"teacher_disagreement_score":0.745012,"about_ca_system_score_codex":0.00004023102,"about_ca_system_score_gemma":0.00040367647,"threshold_uncertainty_score":0.9993373},"labels":[],"label_agreement":null},{"id":"W3092916815","doi":"10.2197/ipsjjip.28.919","title":"Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard","year":2020,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Generalization; Computational complexity theory; Theoretical computer science; Algorithm; Mathematics","score_opus":0.03635320821608718,"score_gpt":0.2868326374416269,"score_spread":0.25047942922553973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092916815","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.287962,0.00048598184,0.6661177,0.04209147,0.000661209,0.0002924466,0.000003157446,0.000117677686,0.0022683109],"genre_scores_gemma":[0.9298088,0.000024364066,0.06370971,0.006320256,0.0001028776,0.0000024578915,2.4072855e-7,0.0000050799695,0.000026239648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762774,0.000027777352,0.0010072,0.00014045747,0.00090021774,0.00029658384],"domain_scores_gemma":[0.9976616,0.000033681503,0.0010686181,0.00015648617,0.0008994332,0.00018021191],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0011665922,0.0001286428,0.00022560514,0.000456211,0.00021664769,0.0010983385,0.0011056765,0.00005189284,0.000017046255],"category_scores_gemma":[0.00070090266,0.00010938794,0.00006088333,0.0015305434,0.00015686991,0.015589279,0.00017178003,0.00034563712,0.00009375354],"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.00009603604,0.00009705741,0.013147466,0.00043535908,0.000015100688,0.00004695355,0.09215307,0.007674983,0.007935011,0.003017515,0.0060132355,0.8693682],"study_design_scores_gemma":[0.0008626555,0.00055209675,0.023663407,0.0016080457,0.000017785027,0.00055059924,0.010138927,0.6327752,0.26539898,0.00628999,0.057192978,0.0009493699],"about_ca_topic_score_codex":0.0000058057576,"about_ca_topic_score_gemma":0.0000017796863,"teacher_disagreement_score":0.8684188,"about_ca_system_score_codex":0.000115010516,"about_ca_system_score_gemma":0.00071259745,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W3155866485","doi":"10.2197/ipsjjip.29.296","title":"Empirical Study on Dependency-related License Violation in the JavaScript Package Ecosystem","year":2021,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science","keywords":"License; Dependency (UML); Computer science; JavaScript; Software; MIT License; Computer security; World Wide Web; Software engineering; Empirical research; Artifact (error); Reuse; Operating system; Artificial intelligence; Engineering","score_opus":0.10322015682996123,"score_gpt":0.3939907377257572,"score_spread":0.290770580895796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155866485","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.97595793,0.000054702963,0.016837992,0.0013113857,0.0007658446,0.00015046529,0.0000022629015,0.000010590406,0.004908816],"genre_scores_gemma":[0.99909264,0.0000016112217,0.00028575413,0.0005047571,0.00004181949,0.0000011822018,0.0000033628978,0.0000020832608,0.00006676894],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9955315,0.00046306424,0.0016671313,0.00013671242,0.0020651175,0.0001364736],"domain_scores_gemma":[0.9971499,0.00045723203,0.0011280543,0.0003747559,0.0008442204,0.00004586682],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013560751,0.00008499561,0.00018498921,0.0005637624,0.00021815825,0.0015913487,0.00061356253,0.000038415215,0.00004760012],"category_scores_gemma":[0.003924439,0.00004810102,0.000072445015,0.00172099,0.000011162947,0.002616211,0.00008896753,0.0002786706,0.00013315403],"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.00015401702,0.001053915,0.07773537,0.00005743215,0.000050881565,0.00023447463,0.13893463,0.016528761,0.0000921937,0.00029844587,0.033536583,0.7313233],"study_design_scores_gemma":[0.0033650033,0.00055430847,0.5073164,0.0006482987,0.00006342702,0.0006326759,0.3491083,0.09205115,0.00033394442,0.005941479,0.03962666,0.00035834068],"about_ca_topic_score_codex":0.0000015309289,"about_ca_topic_score_gemma":0.000013483036,"teacher_disagreement_score":0.73096496,"about_ca_system_score_codex":0.0000706697,"about_ca_system_score_gemma":0.00018980648,"threshold_uncertainty_score":0.9994451},"labels":[],"label_agreement":null},{"id":"W4213240734","doi":"10.2197/ipsjjip.30.155","title":"Automatic Optimize-time Validation for Binary Optimizers","year":2022,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Binary number; Compatibility (geochemistry); Code (set theory); Binary code; Code coverage; Program optimization; Source code; Dead code; Redundant code; Programming language; Code generation; Set (abstract data type); Operating system; Software; Arithmetic","score_opus":0.01353373715607724,"score_gpt":0.2568205463823833,"score_spread":0.24328680922630602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213240734","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.005405689,0.000055565855,0.992204,0.00077920145,0.00019213036,0.00013617081,0.0000017009928,0.0010016935,0.00022385835],"genre_scores_gemma":[0.12986287,0.0000016835756,0.8696832,0.00036725504,0.000030341542,0.000024085426,0.000006254357,0.0000051464135,0.000019132747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987886,0.00004227799,0.000596447,0.000054929802,0.00038920838,0.000128514],"domain_scores_gemma":[0.9982639,0.00016099191,0.001038398,0.00012164186,0.00036932557,0.000045758305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013725343,0.00007910096,0.00014699061,0.00038710027,0.00039112926,0.0003050638,0.00053254905,0.000023225917,0.000020038735],"category_scores_gemma":[0.0004035665,0.000072368726,0.00007495679,0.00038366157,0.00001233926,0.0037626831,0.000118418575,0.00014534169,0.0000031133004],"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.00006167477,0.00009563615,0.0000783818,0.0002516328,0.000029086594,0.0000054567026,0.005789625,0.1650135,0.00020853445,0.0004897791,0.06346024,0.7645165],"study_design_scores_gemma":[0.00044553287,0.00025888448,0.000033989818,0.00007432785,0.000010472963,0.000255722,0.000064845066,0.99130464,0.0004994277,0.005424316,0.0015234543,0.00010437518],"about_ca_topic_score_codex":8.180123e-7,"about_ca_topic_score_gemma":1.8654744e-9,"teacher_disagreement_score":0.82629114,"about_ca_system_score_codex":0.00012732323,"about_ca_system_score_gemma":0.00026168596,"threshold_uncertainty_score":0.30082896},"labels":[],"label_agreement":null},{"id":"W4386729590","doi":"10.2197/ipsjjip.31.550","title":"A Deeper Look into Deep Learning-based Output Prediction Attacks Using Weak SPN Block Ciphers","year":2023,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Banting and Best Diabetes Centre, University of Toronto","keywords":"Computer science; Block cipher; Linear cryptanalysis; Deep learning; Differential cryptanalysis; Cipher; Cryptanalysis; Cryptography; Artificial intelligence; Key (lock); Differential (mechanical device); Theoretical computer science; Algorithm; Computer security; Encryption","score_opus":0.018853698256101815,"score_gpt":0.2874010940473963,"score_spread":0.26854739579129444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386729590","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.15110888,0.000081972736,0.84778565,0.00033110165,0.00027494415,0.00008377596,7.516924e-7,0.0001018272,0.0002311031],"genre_scores_gemma":[0.9567772,0.00002451196,0.042861145,0.00022082822,0.00008794338,0.000002981338,0.000009478134,0.000006669972,0.00000922686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830806,0.00004901805,0.0007895664,0.000082162456,0.000555977,0.00021520477],"domain_scores_gemma":[0.9983155,0.000042622032,0.00082687126,0.00010968421,0.00060956896,0.00009572901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009263231,0.000113115915,0.00014590067,0.00079525885,0.00046023098,0.0005599015,0.00030107787,0.0000623609,0.000010866654],"category_scores_gemma":[0.00010188868,0.00010252665,0.00009974877,0.0012841986,0.000034061108,0.0046819467,0.00006107851,0.00027487738,0.000013798241],"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.00005180932,0.00007232967,0.011299411,0.00035314748,0.00006463277,0.000010509742,0.027927708,0.4762708,0.0004266803,0.00085380976,0.001080845,0.48158833],"study_design_scores_gemma":[0.00078190345,0.00012233909,0.0025459572,0.00013454273,0.000020290798,0.00007306994,0.00359581,0.9813361,0.00026929047,0.00062598585,0.010362107,0.00013260226],"about_ca_topic_score_codex":0.000008424621,"about_ca_topic_score_gemma":0.0000046282325,"teacher_disagreement_score":0.80566835,"about_ca_system_score_codex":0.000112444104,"about_ca_system_score_gemma":0.0002807689,"threshold_uncertainty_score":0.5399143},"labels":[],"label_agreement":null},{"id":"W964026779","doi":"10.2197/ipsjjip.23.392","title":"A Classification of Intrusion Detection Systems in the Cloud","year":2015,"lang":"en","type":"article","venue":"Journal of Information Processing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Schlumberger Foundation","keywords":"Cloud computing; Computer science; Software deployment; Intrusion detection system; Scalability; Adaptability; Computer security; Architecture; Software engineering; Database; Operating system","score_opus":0.03672456630860296,"score_gpt":0.2766936222549267,"score_spread":0.23996905594632376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964026779","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.13789888,0.00021704465,0.86005825,0.000724162,0.0005090988,0.00010605112,0.0000010970538,0.0000119795295,0.00047347334],"genre_scores_gemma":[0.9964573,0.0000068503814,0.0033926438,0.000067630426,0.00006981204,0.0000021898327,0.0000016778739,0.0000011567284,7.377735e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986322,0.00008493906,0.00070601667,0.000033877353,0.0004670125,0.000075954944],"domain_scores_gemma":[0.9981176,0.000043195578,0.0010271582,0.00015037747,0.00062704366,0.000034613655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019858205,0.000047471574,0.00009550802,0.00029036755,0.000060352217,0.00022467534,0.00047743885,0.00004181017,2.4848208e-7],"category_scores_gemma":[0.00038844495,0.00003287191,0.000024980081,0.0006922868,0.000020822075,0.0045146826,0.000041493768,0.0001663877,0.0000041229937],"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.00014724613,0.00031949746,0.001727695,0.00059665553,0.00002211382,0.000005687003,0.16123557,0.014352432,0.0045016753,0.06667503,0.0038094933,0.7466069],"study_design_scores_gemma":[0.0010915584,0.00024033176,0.011258681,0.0004082271,0.000013159338,0.0006527934,0.014100057,0.95094377,0.00086856436,0.0033903338,0.016894666,0.00013788861],"about_ca_topic_score_codex":0.000020574507,"about_ca_topic_score_gemma":0.0000069128596,"teacher_disagreement_score":0.9365913,"about_ca_system_score_codex":0.000111528956,"about_ca_system_score_gemma":0.00021545358,"threshold_uncertainty_score":0.32730356},"labels":[],"label_agreement":null}]}