{"meta":{"query_hash":"3fa8b1d51b75","filters":{"venue":"DCC"},"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/3fa8b1d51b75","api":"https://metacan.xera.ac/api/v1/cohort?venue=DCC"},"results":[{"id":"W1969027046","doi":"10.1109/dcc.2008.85","title":"Very Low Cost Algorithms for Predicting the File Size of JPEG Images Subject to Changes of Quality Factor and Scaling","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; File size; Algorithm; JPEG; Transcoding; Set (abstract data type); Factor (programming language); Image quality; Quality (philosophy); Artificial intelligence; Image (mathematics); Scaling; Data mining; Machine learning; Mathematics","score_opus":0.07266095815316403,"score_gpt":0.3473297572737434,"score_spread":0.27466879912057934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969027046","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.5736484,0.00021197496,0.4218258,0.0021664372,0.00026279644,0.0007958546,0.0008641143,0.000064394735,0.00016025474],"genre_scores_gemma":[0.96824574,0.000028022145,0.031048128,0.00040387915,0.00009202893,0.000052704225,0.000006648181,0.000007016993,0.000115825926],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990327,0.00009737497,0.0002432363,0.00021209837,0.00022869307,0.00018590159],"domain_scores_gemma":[0.9979367,0.0014280274,0.00014486595,0.00031450143,0.00012831012,0.000047564354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391921,0.0000900022,0.0002068161,0.00003343351,0.00013059132,0.00003350486,0.00032642088,0.000031383424,0.000016818754],"category_scores_gemma":[0.00043694658,0.000067092566,0.00005291959,0.00015204115,0.0000749168,0.00017118908,0.00017740541,0.000058698086,9.965472e-7],"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.0002752224,0.0010283405,0.0379819,0.002566974,0.00037586867,0.000028691715,0.1014931,0.00023985721,0.11641512,0.0028769926,0.025211243,0.71150666],"study_design_scores_gemma":[0.0012818462,0.00051065825,0.3917413,0.00030940198,0.00002436325,0.00001936445,0.0020525337,0.019354377,0.5810314,0.00047127242,0.0027131187,0.0004903627],"about_ca_topic_score_codex":0.0002548794,"about_ca_topic_score_gemma":0.000016805001,"teacher_disagreement_score":0.7110163,"about_ca_system_score_codex":0.00001545676,"about_ca_system_score_gemma":0.000054495522,"threshold_uncertainty_score":0.27359554},"labels":[],"label_agreement":null},{"id":"W2018694057","doi":"10.1109/dcc.2008.34","title":"A New Object-Based System for Fractal Video Sequences Compression","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Motion compensation; Computer vision; Artificial intelligence; Quadtree; Computer science; Inter frame; Data compression; Block-matching algorithm; Motion estimation; Video compression picture types; Video tracking; Reference frame; Frame (networking); Object (grammar)","score_opus":0.03693369676952915,"score_gpt":0.2915752338579597,"score_spread":0.2546415370884305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018694057","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.0069420924,0.0002194547,0.99038565,0.0002487852,0.00052175747,0.00015452027,0.0000019832487,0.00020535826,0.0013203847],"genre_scores_gemma":[0.56084925,0.000001108546,0.43815604,0.00028634586,0.00014479751,0.000010682286,0.0000021734568,0.000006365937,0.00054324564],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990525,0.000100277364,0.0001578766,0.00026222147,0.00021927412,0.00020783806],"domain_scores_gemma":[0.99919635,0.00027142622,0.00006959587,0.00030569363,0.00006368429,0.0000932255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002616906,0.00010103082,0.00015777705,0.0000658582,0.00023041932,0.00008634205,0.0004930209,0.000051617335,0.000006267698],"category_scores_gemma":[0.000045859833,0.00008214314,0.00008491871,0.00018249734,0.000025289464,0.00027507654,0.000050043887,0.00007081504,0.00003518957],"study_design_candidate":"bench_or_experimental","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.00042587143,0.00023383278,0.001367596,0.0005805862,0.00008649459,0.0010949456,0.005401371,0.0029505605,0.38321093,0.021627003,0.14070296,0.44231784],"study_design_scores_gemma":[0.0036249969,0.00049820583,0.0018304389,0.00044301918,0.00002217796,0.00032130582,0.00006297247,0.38658512,0.56255007,0.0021358158,0.041232206,0.0006936735],"about_ca_topic_score_codex":0.00011992632,"about_ca_topic_score_gemma":0.0000014667247,"teacher_disagreement_score":0.55390716,"about_ca_system_score_codex":0.000034229557,"about_ca_system_score_gemma":0.00020305625,"threshold_uncertainty_score":0.33497},"labels":[],"label_agreement":null},{"id":"W2100204172","doi":"10.1109/dcc.2008.101","title":"All-Match LZ77 Bit Recycling","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Redundancy (engineering); Multiplicity (mathematics); Exploit; Data compression; Algorithm; Computer hardware; Theoretical computer science; Arithmetic; Mathematics; Operating system; Computer security","score_opus":0.04280842797380473,"score_gpt":0.263671605095359,"score_spread":0.22086317712155423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100204172","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.06833169,0.0003036635,0.9204852,0.0014460827,0.0009132058,0.000088876404,0.0000044084195,0.00035864935,0.008068214],"genre_scores_gemma":[0.59116215,0.00030268496,0.40283048,0.0026424401,0.0005269026,0.00001344179,0.000024914143,0.00002077167,0.0024762098],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929386,0.000018884555,0.00011155036,0.00022764565,0.00017584953,0.00017218276],"domain_scores_gemma":[0.9993685,0.000035654448,0.000035026842,0.00046927054,0.00002422899,0.0000673096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090461144,0.00006846992,0.00008170811,0.000036121644,0.00013467079,0.000046180845,0.0005580036,0.000034964596,0.000029271107],"category_scores_gemma":[0.0000142851,0.000056765744,0.00003055414,0.00013907219,0.000018336325,0.00037103327,0.00028968917,0.000083737425,0.0003050482],"study_design_candidate":"not_applicable","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.000022345106,0.00045062735,0.008003072,0.000040286224,0.00007249583,0.0009972223,0.0060839513,0.0005268724,0.009359077,0.041428152,0.45280463,0.4802113],"study_design_scores_gemma":[0.00052622985,0.00006825871,0.010425117,0.000051084164,0.0000043788827,0.00019359725,0.000018671664,0.17884655,0.005289182,0.0042316704,0.7999151,0.0004301751],"about_ca_topic_score_codex":0.000065943335,"about_ca_topic_score_gemma":0.0000012734483,"teacher_disagreement_score":0.5228305,"about_ca_system_score_codex":0.000011151768,"about_ca_system_score_gemma":0.000023094843,"threshold_uncertainty_score":0.39208788},"labels":[],"label_agreement":null},{"id":"W2105768287","doi":"10.1109/dcc.2008.25","title":"List Update Algorithms for Data Compression","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"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; Algorithm; Data compression; Locality of reference; Compression (physics); Locality; Subroutine; Construct (python library); Compression ratio; Parallel computing; Cache; Programming language","score_opus":0.1267360926996233,"score_gpt":0.32464320323652107,"score_spread":0.19790711053689777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105768287","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.0009388801,0.00034553665,0.99627095,0.00066544977,0.00070636603,0.00018444067,0.00017485295,0.00019016273,0.0005233317],"genre_scores_gemma":[0.03304926,0.0002352113,0.96285945,0.001044233,0.00055555365,0.000030463574,0.0012433322,0.000023979223,0.0009585057],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987343,0.000027540857,0.00018703891,0.0005485554,0.00024339689,0.00025915346],"domain_scores_gemma":[0.9978346,0.00007453086,0.00007573946,0.0018439313,0.00006264932,0.000108532986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018072012,0.00012464655,0.00015071576,0.00004816999,0.0003642355,0.00009158457,0.0024195448,0.000053214866,0.000025042586],"category_scores_gemma":[0.000029752076,0.00010022888,0.00003570477,0.00015129274,0.0000466912,0.0010572003,0.0016848688,0.00009157885,0.00007455314],"study_design_candidate":"not_applicable","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.000020179888,0.00019717647,0.00029645636,0.00002278211,0.000019761399,0.000063068546,0.000225502,0.000028969944,0.0010203773,0.00884255,0.6870183,0.30224487],"study_design_scores_gemma":[0.00035145113,0.000028696391,0.00047737703,0.000016567912,0.000002521641,0.000034497523,0.0000024889189,0.50091076,0.00054134283,0.0007520164,0.49674642,0.00013585435],"about_ca_topic_score_codex":0.00005848381,"about_ca_topic_score_gemma":0.000002549711,"teacher_disagreement_score":0.5008818,"about_ca_system_score_codex":0.000011637845,"about_ca_system_score_gemma":0.00004826866,"threshold_uncertainty_score":0.44961566},"labels":[],"label_agreement":null},{"id":"W2112109461","doi":"10.1109/dcc.2008.38","title":"Improved Multiple Description Framework Based on Successively Refinable Quantization and Uneven Erasure Protection","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantization (signal processing); Erasure; Algorithm; Gaussian; Computer science; Source code; Decoding methods; Rate distortion; Coding (social sciences); Theoretical computer science; Mathematics; Statistics","score_opus":0.035832012687727385,"score_gpt":0.2539604214551683,"score_spread":0.21812840876744088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112109461","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.019845162,0.000037899877,0.97862685,0.00037040527,0.00013453641,0.00039670544,0.0000051712004,0.0005119349,0.00007134795],"genre_scores_gemma":[0.7273758,0.00001827137,0.27220184,0.00020467334,0.000028533941,0.00008131371,0.000010960523,0.000010189189,0.00006842223],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989388,0.00008483853,0.00017230521,0.00041625754,0.00020875718,0.000179064],"domain_scores_gemma":[0.99911904,0.0000733807,0.00013870977,0.00050072063,0.00011038605,0.0000577484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014627803,0.00013287367,0.0001234847,0.00013241915,0.00030665923,0.000078195255,0.00029411324,0.0001218264,0.000004386699],"category_scores_gemma":[0.00029218834,0.00012187838,0.000023507768,0.00036726,0.000040107618,0.0009182897,0.00010206935,0.00021613618,0.000006607632],"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.0007869113,0.0012998239,0.02643812,0.0003457729,0.0000396946,0.000118297074,0.0020069804,0.009564211,0.56065863,0.05186152,0.006921521,0.33995852],"study_design_scores_gemma":[0.0004814557,0.0003135466,0.015305137,0.00017006684,0.0000029164542,0.000014532798,0.00000765552,0.8862596,0.08614817,0.0066134487,0.0043938598,0.00028957913],"about_ca_topic_score_codex":0.000078640995,"about_ca_topic_score_gemma":0.000005361096,"teacher_disagreement_score":0.8766954,"about_ca_system_score_codex":0.00005382475,"about_ca_system_score_gemma":0.00003965612,"threshold_uncertainty_score":0.4970056},"labels":[],"label_agreement":null},{"id":"W2123034937","doi":"10.1109/dcc.2008.39","title":"Filter Banks for Prediction-Compensated Multiple Description Coding","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Biorthogonal system; Multiple description coding; Filter bank; JPEG; Algorithm; Computer science; Coding (social sciences); Filter (signal processing); Transform coding; Filter design; Sub-band coding; JPEG 2000; Data compression; Image compression; Theoretical computer science; Mathematics; Decoding methods; Artificial intelligence; Image processing; Image (mathematics); Computer vision; Discrete cosine transform; Wavelet transform; Wavelet; Statistics","score_opus":0.06031900922258013,"score_gpt":0.2629073698905953,"score_spread":0.2025883606680152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123034937","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.00799299,0.00002777516,0.99005705,0.00010927683,0.00033348365,0.00029672257,0.000066570006,0.00082240737,0.00029371819],"genre_scores_gemma":[0.60740864,0.00001773752,0.39181617,0.00020546804,0.00006700264,0.000096010124,0.000069519956,0.000009892779,0.00030954613],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991368,0.00002511017,0.00018620666,0.0003083683,0.00014791432,0.00019560655],"domain_scores_gemma":[0.9991869,0.00011641542,0.00006923278,0.00047635194,0.00009391246,0.000057241283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009523821,0.000099901634,0.00011094344,0.000083408835,0.0002363037,0.000042447376,0.00047571948,0.00005452619,0.000016150805],"category_scores_gemma":[0.00009180436,0.00009378425,0.000045587785,0.00015127893,0.000033128355,0.0008731202,0.00016063405,0.00008588712,0.000023381537],"study_design_candidate":"bench_or_experimental","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.00014026443,0.0004508749,0.02299159,0.000094682255,0.0000622247,0.00006615767,0.0022805748,0.0007156944,0.40716213,0.041069444,0.39968958,0.12527676],"study_design_scores_gemma":[0.0012998489,0.00019360747,0.02708091,0.00009099193,0.0000062911913,0.00009794203,0.000011262607,0.5957883,0.22831829,0.005846701,0.14084624,0.0004196159],"about_ca_topic_score_codex":0.0000075988614,"about_ca_topic_score_gemma":0.0000016623385,"teacher_disagreement_score":0.59941566,"about_ca_system_score_codex":0.000038146303,"about_ca_system_score_gemma":0.000019479176,"threshold_uncertainty_score":0.38244104},"labels":[],"label_agreement":null},{"id":"W2149860554","doi":"10.1109/dcc.2008.57","title":"M-Channel Multiple Description Coding with Two-Rate Predictive Coding and Staggered Quantization","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Encoder; Algorithm; Computer science; Quantization (signal processing); Entropy (arrow of time); Predictive coding; Variable-length code; Coding (social sciences); Bit rate; Entropy encoding; Decoding methods; Channel code; Mathematics; Statistics; Real-time computing; Physics","score_opus":0.03882110689853489,"score_gpt":0.25644651254309386,"score_spread":0.21762540564455896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149860554","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.05104555,0.000045231227,0.94796455,0.00005664056,0.00008034496,0.00021014083,0.000013434142,0.0004659259,0.00011820478],"genre_scores_gemma":[0.90608764,0.000106876694,0.09360741,0.000071923285,0.000024731436,0.000023927036,0.00001867534,0.000010385972,0.00004843129],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990814,0.00006461629,0.00015199045,0.0003530363,0.0001696921,0.00017930294],"domain_scores_gemma":[0.99931455,0.000088666435,0.00012026763,0.00030597483,0.00010284486,0.00006768133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014074516,0.000120479795,0.00012937233,0.00010362788,0.00027021335,0.00007008877,0.00023320699,0.000034652207,0.0000017223715],"category_scores_gemma":[0.00006800939,0.0001041392,0.000012416474,0.00023056475,0.00006845695,0.0014144029,0.00018579043,0.00009847918,0.000003253218],"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.0011675693,0.00077813416,0.07851767,0.00030654974,0.00020934956,0.00060928665,0.027674003,0.029560896,0.6610697,0.13685119,0.011355049,0.0519006],"study_design_scores_gemma":[0.0010401789,0.00022343545,0.011479223,0.00018373915,0.000006310234,0.000078221456,0.00010221529,0.921017,0.06256974,0.0025468532,0.00044279033,0.00031029663],"about_ca_topic_score_codex":0.000029121436,"about_ca_topic_score_gemma":0.000009053527,"teacher_disagreement_score":0.8914561,"about_ca_system_score_codex":0.0000374306,"about_ca_system_score_gemma":0.000023686678,"threshold_uncertainty_score":0.42466736},"labels":[],"label_agreement":null},{"id":"W2163649293","doi":"10.1109/dcc.2008.81","title":"Can Lower Resolution Be Better?","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Oversampling; Lossy compression; Artificial intelligence; Computer vision; Sampling (signal processing); JPEG; Image compression; Image resolution; Image quality; Rate–distortion theory; JPEG 2000; Nyquist rate; Data compression; Filter (signal processing); Image processing; Image (mathematics); Bandwidth (computing); Telecommunications","score_opus":0.03776596550436142,"score_gpt":0.2711330275307264,"score_spread":0.23336706202636495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163649293","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.08440971,0.00010199209,0.9007184,0.0056140996,0.0006004971,0.00004717999,0.000001160498,0.00014325966,0.008363737],"genre_scores_gemma":[0.75241095,0.000012283407,0.23855765,0.005718083,0.00021780469,0.0000039640868,0.0000022198014,0.000008251513,0.0030688003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993476,0.00007135524,0.00008374911,0.00017089253,0.00015922247,0.00016716405],"domain_scores_gemma":[0.99955213,0.00003526928,0.000022583814,0.00031049995,0.00003416182,0.000045370678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017882373,0.000057843095,0.00006796557,0.000045065888,0.00013741369,0.000035999252,0.00031052995,0.0000308862,0.000014754273],"category_scores_gemma":[0.000027150436,0.000053112046,0.00003678922,0.00017115186,0.000034021134,0.0001650052,0.00007517416,0.00007579571,0.000049240618],"study_design_candidate":"not_applicable","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.00007859912,0.00038570756,0.002926768,0.00003311971,0.00006408277,0.00333438,0.01086114,0.0002898364,0.08652712,0.049695868,0.39625132,0.44955206],"study_design_scores_gemma":[0.003114396,0.0007021624,0.0665316,0.00008016271,0.000024926023,0.0011517357,0.00002846106,0.08254912,0.105179474,0.036992274,0.70207214,0.001573577],"about_ca_topic_score_codex":0.000062118386,"about_ca_topic_score_gemma":0.0000044307567,"teacher_disagreement_score":0.66800123,"about_ca_system_score_codex":0.00002113178,"about_ca_system_score_gemma":0.000032886473,"threshold_uncertainty_score":0.21658464},"labels":[],"label_agreement":null}]}