{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3fa8b1d51b75","filters":{"venue":"DCC"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03776596550436142,"gpt":0.2711330275307264,"spread":0.233367062026365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001788237,0.0000578431,0.00006796557,0.00004506589,0.0001374137,0.00003599925,0.00031053,0.0000308862,0.00001475427],"category_scores_gemma":[0.00002715044,0.00005311205,0.00003678922,0.0001711519,0.00003402113,0.0001650052,0.00007517416,0.00007579571,0.00004924062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002113178,"about_ca_system_score_gemma":0.00003288647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006211839,"about_ca_topic_score_gemma":0.000004430757,"domain_scores_codex":[0.9993476,0.00007135524,0.00008374911,0.0001708925,0.0001592225,0.000167164],"domain_scores_gemma":[0.9995521,0.00003526928,0.00002258381,0.0003104999,0.00003416182,0.00004537068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007859912,0.0003857076,0.002926768,0.00003311971,0.00006408277,0.00333438,0.01086114,0.0002898364,0.08652712,0.04969587,0.3962513,0.4495521],"study_design_scores_gemma":[0.003114396,0.0007021624,0.0665316,0.00008016271,0.00002492602,0.001151736,0.00002846106,0.08254912,0.1051795,0.03699227,0.7020721,0.001573577],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08440971,0.0001019921,0.9007184,0.0056141,0.0006004971,0.00004717999,0.000001160498,0.0001432597,0.008363737],"genre_scores_gemma":[0.7524109,0.00001228341,0.2385577,0.005718083,0.0002178047,0.000003964087,0.000002219801,0.000008251513,0.0030688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6680012,"threshold_uncertainty_score":0.2165846,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03693369676952915,"gpt":0.2915752338579597,"spread":0.2546415370884305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002616906,0.0001010308,0.000157777,0.0000658582,0.0002304193,0.00008634205,0.0004930209,0.00005161733,0.000006267698],"category_scores_gemma":[0.00004585983,0.00008214314,0.00008491871,0.0001824973,0.00002528946,0.0002750765,0.00005004389,0.00007081504,0.00003518957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003422956,"about_ca_system_score_gemma":0.0002030562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001199263,"about_ca_topic_score_gemma":0.000001466725,"domain_scores_codex":[0.9990525,0.0001002774,0.0001578766,0.0002622215,0.0002192741,0.0002078381],"domain_scores_gemma":[0.9991964,0.0002714262,0.00006959587,0.0003056936,0.00006368429,0.0000932255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004258714,0.0002338328,0.001367596,0.0005805862,0.00008649459,0.001094946,0.005401371,0.002950561,0.3832109,0.021627,0.140703,0.4423178],"study_design_scores_gemma":[0.003624997,0.0004982058,0.001830439,0.0004430192,0.00002217796,0.0003213058,0.00006297247,0.3865851,0.5625501,0.002135816,0.04123221,0.0006936735],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006942092,0.0002194547,0.9903857,0.0002487852,0.0005217575,0.0001545203,0.000001983249,0.0002053583,0.001320385],"genre_scores_gemma":[0.5608492,0.000001108546,0.438156,0.0002863459,0.0001447975,0.00001068229,0.000002173457,0.000006365937,0.0005432456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5539072,"threshold_uncertainty_score":0.33497,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06031900922258013,"gpt":0.2629073698905953,"spread":0.2025883606680152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009523821,0.00009990163,0.0001109434,0.00008340884,0.0002363037,0.00004244738,0.0004757195,0.00005452619,0.00001615081],"category_scores_gemma":[0.00009180436,0.00009378425,0.00004558779,0.0001512789,0.00003312836,0.0008731202,0.0001606341,0.00008588712,0.00002338154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000381463,"about_ca_system_score_gemma":0.00001947918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007598861,"about_ca_topic_score_gemma":0.000001662338,"domain_scores_codex":[0.9991368,0.00002511017,0.0001862067,0.0003083683,0.0001479143,0.0001956066],"domain_scores_gemma":[0.9991869,0.0001164154,0.00006923278,0.0004763519,0.00009391246,0.00005724128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001402644,0.0004508749,0.02299159,0.00009468225,0.0000622247,0.00006615767,0.002280575,0.0007156944,0.4071621,0.04106944,0.3996896,0.1252768],"study_design_scores_gemma":[0.001299849,0.0001936075,0.02708091,0.00009099193,0.000006291191,0.00009794203,0.00001126261,0.5957883,0.2283183,0.005846701,0.1408462,0.0004196159],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00799299,0.00002777516,0.9900571,0.0001092768,0.0003334837,0.0002967226,0.00006657001,0.0008224074,0.0002937182],"genre_scores_gemma":[0.6074086,0.00001773752,0.3918162,0.000205468,0.00006700264,0.00009601012,0.00006951996,0.000009892779,0.0003095461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5994157,"threshold_uncertainty_score":0.382441,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1267360926996233,"gpt":0.3246432032365211,"spread":0.1979071105368978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001807201,0.0001246466,0.0001507158,0.00004816999,0.0003642355,0.00009158457,0.002419545,0.00005321487,0.00002504259],"category_scores_gemma":[0.00002975208,0.0001002289,0.00003570477,0.0001512927,0.0000466912,0.0010572,0.001684869,0.00009157885,0.00007455314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001163785,"about_ca_system_score_gemma":0.00004826866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005848381,"about_ca_topic_score_gemma":0.000002549711,"domain_scores_codex":[0.9987343,0.00002754086,0.0001870389,0.0005485554,0.0002433969,0.0002591535],"domain_scores_gemma":[0.9978346,0.00007453086,0.00007573946,0.001843931,0.00006264932,0.000108533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002017989,0.0001971765,0.0002964564,0.00002278211,0.0000197614,0.00006306855,0.000225502,0.00002896994,0.001020377,0.00884255,0.6870183,0.3022449],"study_design_scores_gemma":[0.0003514511,0.00002869639,0.000477377,0.00001656791,0.000002521641,0.00003449752,0.000002488919,0.5009108,0.0005413428,0.0007520164,0.4967464,0.0001358544],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009388801,0.0003455367,0.996271,0.0006654498,0.000706366,0.0001844407,0.0001748529,0.0001901627,0.0005233317],"genre_scores_gemma":[0.03304926,0.0002352113,0.9628595,0.001044233,0.0005555536,0.00003046357,0.001243332,0.00002397922,0.0009585057],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5008818,"threshold_uncertainty_score":0.4496157,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03583201268772739,"gpt":0.2539604214551683,"spread":0.2181284087674409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000146278,0.0001328737,0.0001234847,0.0001324192,0.0003066592,0.00007819525,0.0002941132,0.0001218264,0.000004386699],"category_scores_gemma":[0.0002921883,0.0001218784,0.00002350777,0.00036726,0.00004010762,0.0009182897,0.0001020694,0.0002161362,0.000006607632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005382475,"about_ca_system_score_gemma":0.00003965612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007864099,"about_ca_topic_score_gemma":0.000005361096,"domain_scores_codex":[0.9989388,0.00008483853,0.0001723052,0.0004162575,0.0002087572,0.000179064],"domain_scores_gemma":[0.999119,0.0000733807,0.0001387098,0.0005007206,0.000110386,0.0000577484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007869113,0.001299824,0.02643812,0.0003457729,0.0000396946,0.0001182971,0.00200698,0.009564211,0.5606586,0.05186152,0.006921521,0.3399585],"study_design_scores_gemma":[0.0004814557,0.0003135466,0.01530514,0.0001700668,0.000002916454,0.0000145328,0.00000765552,0.8862596,0.08614817,0.006613449,0.00439386,0.0002895791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01984516,0.00003789988,0.9786268,0.0003704053,0.0001345364,0.0003967054,0.0000051712,0.0005119349,0.00007134795],"genre_scores_gemma":[0.7273758,0.00001827137,0.2722018,0.0002046733,0.00002853394,0.00008131371,0.00001096052,0.00001018919,0.00006842223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8766954,"threshold_uncertainty_score":0.4970056,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03882110689853489,"gpt":0.2564465125430939,"spread":0.217625405644559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001407452,0.0001204798,0.0001293723,0.0001036279,0.0002702133,0.00007008877,0.000233207,0.00003465221,0.000001722372],"category_scores_gemma":[0.00006800939,0.0001041392,0.00001241647,0.0002305648,0.00006845695,0.001414403,0.0001857904,0.00009847918,0.000003253218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000374306,"about_ca_system_score_gemma":0.00002368668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002912144,"about_ca_topic_score_gemma":0.000009053527,"domain_scores_codex":[0.9990814,0.00006461629,0.0001519904,0.0003530363,0.0001696921,0.0001793029],"domain_scores_gemma":[0.9993145,0.00008866643,0.0001202676,0.0003059748,0.0001028449,0.00006768133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001167569,0.0007781342,0.07851767,0.0003065497,0.0002093496,0.0006092867,0.027674,0.0295609,0.6610697,0.1368512,0.01135505,0.0519006],"study_design_scores_gemma":[0.001040179,0.0002234354,0.01147922,0.0001837391,0.000006310234,0.00007822146,0.0001022153,0.921017,0.06256974,0.002546853,0.0004427903,0.0003102966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05104555,0.00004523123,0.9479645,0.00005664056,0.00008034496,0.0002101408,0.00001343414,0.0004659259,0.0001182048],"genre_scores_gemma":[0.9060876,0.0001068767,0.09360741,0.00007192328,0.00002473144,0.00002392704,0.00001867534,0.00001038597,0.00004843129],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8914561,"threshold_uncertainty_score":0.4246674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07266095815316403,"gpt":0.3473297572737434,"spread":0.2746687991205793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391921,0.0000900022,0.0002068161,0.00003343351,0.0001305913,0.00003350486,0.0003264209,0.00003138342,0.00001681875],"category_scores_gemma":[0.0004369466,0.00006709257,0.00005291959,0.0001520411,0.0000749168,0.0001711891,0.0001774054,0.00005869809,9.965472e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001545676,"about_ca_system_score_gemma":0.00005449552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002548794,"about_ca_topic_score_gemma":0.000016805,"domain_scores_codex":[0.9990327,0.00009737497,0.0002432363,0.0002120984,0.0002286931,0.0001859016],"domain_scores_gemma":[0.9979367,0.001428027,0.0001448659,0.0003145014,0.0001283101,0.00004756435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002752224,0.001028341,0.0379819,0.002566974,0.0003758687,0.00002869171,0.1014931,0.0002398572,0.1164151,0.002876993,0.02521124,0.7115067],"study_design_scores_gemma":[0.001281846,0.0005106583,0.3917413,0.000309402,0.00002436325,0.00001936445,0.002052534,0.01935438,0.5810314,0.0004712724,0.002713119,0.0004903627],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5736484,0.000211975,0.4218258,0.002166437,0.0002627964,0.0007958546,0.0008641143,0.00006439474,0.0001602547],"genre_scores_gemma":[0.9682457,0.00002802214,0.03104813,0.0004038792,0.00009202893,0.00005270422,0.000006648181,0.000007016993,0.0001158259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7110163,"threshold_uncertainty_score":0.2735955,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04280842797380473,"gpt":0.263671605095359,"spread":0.2208631771215542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009046114,0.00006846992,0.00008170811,0.00003612164,0.0001346708,0.00004618084,0.0005580036,0.0000349646,0.00002927111],"category_scores_gemma":[0.0000142851,0.00005676574,0.00003055414,0.0001390722,0.00001833632,0.0003710333,0.0002896892,0.00008373742,0.0003050482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001115177,"about_ca_system_score_gemma":0.00002309484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006594334,"about_ca_topic_score_gemma":0.000001273448,"domain_scores_codex":[0.9992939,0.00001888456,0.0001115504,0.0002276457,0.0001758495,0.0001721828],"domain_scores_gemma":[0.9993685,0.00003565445,0.00003502684,0.0004692705,0.00002422899,0.0000673096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002234511,0.0004506274,0.008003072,0.00004028622,0.00007249583,0.0009972223,0.006083951,0.0005268724,0.009359077,0.04142815,0.4528046,0.4802113],"study_design_scores_gemma":[0.0005262299,0.00006825871,0.01042512,0.00005108416,0.000004378883,0.0001935973,0.00001867166,0.1788466,0.005289182,0.00423167,0.7999151,0.0004301751],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06833169,0.0003036635,0.9204852,0.001446083,0.0009132058,0.0000888764,0.000004408419,0.0003586494,0.008068214],"genre_scores_gemma":[0.5911621,0.000302685,0.4028305,0.00264244,0.0005269026,0.00001344179,0.00002491414,0.00002077167,0.00247621],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5228305,"threshold_uncertainty_score":0.3920879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}