{"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":"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.010249096,0.00024343797,0.980703,0.00008651214,0.000075431395,0.00013342581,0.00034483804,0.0073546157,0.0008096973],"genre_scores_gemma":[0.07626073,0.00024257449,0.91775656,0.00007781703,0.00009261867,0.00046332015,0.001926802,0.0003997423,0.0027797448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884063,0.000119814904,0.00009806399,0.0003130136,0.0005526649,0.0000758675],"domain_scores_gemma":[0.99544287,0.002047736,0.00046871378,0.0007193496,0.0012374392,0.00008390802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622813,0.0017804862,0.0010032424,0.0018821347,0.00054525037,0.0013284321,0.0022628854,0.001244963,0.0047312267],"category_scores_gemma":[0.0086381,0.00065110903,0.0007701313,0.0013765771,0.00048476402,0.0019750108,0.00093650137,0.001520088,0.003946372],"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.00029888374,0.00021730407,0.0050061224,0.00014472632,0.00009411245,0.000077728975,0.00010184778,0.084067255,0.014615544,0.0033585804,0.009282164,0.8827358],"study_design_scores_gemma":[0.000049873604,0.00007856193,0.0033394329,0.00001819532,0.00002473702,0.00013899435,0.000044862212,0.97369754,0.014667136,0.0042368374,0.003665548,0.00003816335],"about_ca_topic_score_codex":0.006202459,"about_ca_topic_score_gemma":0.008043278,"teacher_disagreement_score":0.006202459,"about_ca_system_score_codex":0.0009558002,"about_ca_system_score_gemma":0.0010363819,"threshold_uncertainty_score":0.015827596},"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":"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.026130777,0.0011986318,0.965722,0.00010798422,0.00024034832,0.00013346154,0.000101623235,0.0019741894,0.004390865],"genre_scores_gemma":[0.19026966,0.000855752,0.79668546,0.00022253298,0.00023419457,0.00017538606,0.00041668312,0.00011189448,0.011028466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978155,0.000019848498,0.000013555522,0.000036086676,0.00013249676,0.000016405202],"domain_scores_gemma":[0.99983203,0.000024788342,0.000016598644,0.00003452329,0.00007097513,0.000021104026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535472,0.00033888608,0.0005388,0.0007741842,0.0003088603,0.00046333086,0.0009096954,0.00056953373,0.0025937548],"category_scores_gemma":[0.0003119058,0.00016591913,0.00025161775,0.0005548894,0.00024797415,0.0007511943,0.0005039239,0.00038077717,0.0011287938],"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.00023393799,0.00010037472,0.00052640314,0.00023683996,0.000042249238,0.00033660766,0.00013628977,0.0044431007,0.3980507,0.017534267,0.0046274955,0.5737317],"study_design_scores_gemma":[0.00015557784,0.0010400646,0.003738424,0.000077863406,0.00017896983,0.003888167,0.000060900875,0.45624757,0.39003855,0.0058008768,0.13860229,0.0001708457],"about_ca_topic_score_codex":0.00059989135,"about_ca_topic_score_gemma":0.0007860397,"teacher_disagreement_score":0.0025937548,"about_ca_system_score_codex":0.00035603566,"about_ca_system_score_gemma":0.00029174422,"threshold_uncertainty_score":0.008677006},"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":"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.019907067,0.020881092,0.445205,0.00519955,0.014707388,0.0019035096,0.01191379,0.03616818,0.44411448],"genre_scores_gemma":[0.1580198,0.01076863,0.3342485,0.0027448563,0.0034616084,0.0009931009,0.026097503,0.0064108996,0.45725498],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863094,0.00016813424,0.000111588415,0.00022281645,0.00070940773,0.00015710275],"domain_scores_gemma":[0.9985682,0.0002862947,0.000113777365,0.00043505963,0.0005150792,0.00008159313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077984115,0.0012015611,0.001571921,0.0016930794,0.0010159004,0.0023238931,0.0021503607,0.00091561937,0.2513225],"category_scores_gemma":[0.005432789,0.00038470828,0.0005995187,0.0028034202,0.00088819,0.0027770745,0.00187224,0.0012194599,0.14197084],"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.0010431783,0.00010462484,0.0005125803,0.0017987498,0.000085021755,0.00039783493,0.0001384281,0.002820386,0.01805186,0.06664742,0.24292423,0.6654757],"study_design_scores_gemma":[0.0001067624,0.00018571918,0.0004225546,0.00023940559,0.000052435884,0.0006344286,0.000076602446,0.008494646,0.027736295,0.018242136,0.9437462,0.000062713865],"about_ca_topic_score_codex":0.0011488682,"about_ca_topic_score_gemma":0.0014155727,"teacher_disagreement_score":0.2513225,"about_ca_system_score_codex":0.0012072559,"about_ca_system_score_gemma":0.0013256845,"threshold_uncertainty_score":0.84075755},"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":"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.004248885,0.0034694914,0.97686267,0.00072017335,0.0003030495,0.00035423084,0.0006253398,0.005670264,0.007745927],"genre_scores_gemma":[0.06774476,0.0029747463,0.9152485,0.0006149379,0.0005103181,0.00083817996,0.0021173912,0.001133854,0.0088173],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958352,0.0007798952,0.00046620352,0.0004985775,0.0021967746,0.00022335371],"domain_scores_gemma":[0.99087536,0.003023828,0.0005167507,0.003557509,0.0019023152,0.00012421983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026947202,0.0013594908,0.0010293699,0.0041723894,0.00131602,0.0038567171,0.002882983,0.0018471306,0.01303574],"category_scores_gemma":[0.016569797,0.00057317695,0.000914027,0.0068435897,0.0015105818,0.0066662375,0.002987157,0.002572321,0.008135371],"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.00028706255,0.00011477252,0.00086599856,0.00049904664,0.00006249626,0.00007743053,0.0002153726,0.017350305,0.0068215784,0.14871341,0.034905203,0.7900872],"study_design_scores_gemma":[0.00021073599,0.0003267112,0.0010716952,0.00033198766,0.00012362683,0.0014466563,0.00023775373,0.42358637,0.05659315,0.32971987,0.18619402,0.00015743244],"about_ca_topic_score_codex":0.0016311031,"about_ca_topic_score_gemma":0.0016794205,"teacher_disagreement_score":0.01303574,"about_ca_system_score_codex":0.0016784471,"about_ca_system_score_gemma":0.0015713538,"threshold_uncertainty_score":0.043608904},"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":"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.0076478207,0.00028688862,0.99098057,0.00007105022,0.000023641445,0.000037758567,0.00007458749,0.00022325102,0.000654452],"genre_scores_gemma":[0.25325832,0.00045650796,0.7430325,0.00013241122,0.000057593574,0.000117842785,0.00040025165,0.000083757564,0.0024607508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990336,0.00024533563,0.000057081612,0.000111759415,0.0004802289,0.00007211251],"domain_scores_gemma":[0.9988348,0.00042077014,0.00010168121,0.00030527313,0.00029467227,0.000042769578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014757856,0.0006387743,0.00070562144,0.0009157817,0.0003136072,0.00070100866,0.0014993501,0.0007509685,0.0018779605],"category_scores_gemma":[0.0029947532,0.00028783426,0.0005701276,0.0007885251,0.0006726794,0.0018053133,0.001173683,0.0010977063,0.0004841005],"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.00066663494,0.00011231937,0.00091892725,0.00023914597,0.000081103695,0.0005300744,0.0002891617,0.30898917,0.10778652,0.18763818,0.0026454555,0.39010337],"study_design_scores_gemma":[0.000048691527,0.00016921299,0.0001699712,0.000014824889,0.0000195371,0.00024175963,0.000021749569,0.9544156,0.0230441,0.017507333,0.004306867,0.000040231527],"about_ca_topic_score_codex":0.0023216424,"about_ca_topic_score_gemma":0.0019785112,"teacher_disagreement_score":0.0023216424,"about_ca_system_score_codex":0.0006372356,"about_ca_system_score_gemma":0.0011197878,"threshold_uncertainty_score":0.0078047514},"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":"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.005555139,0.00056691223,0.9925412,0.00009858036,0.00003292846,0.000017272368,0.000023495102,0.00008335156,0.001081106],"genre_scores_gemma":[0.27078217,0.0013159808,0.7239039,0.00016092334,0.00011809794,0.00010628191,0.00018708229,0.000039706243,0.0033858255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961275,0.000092294176,0.000019453586,0.00006091541,0.00018443994,0.000030231156],"domain_scores_gemma":[0.9995092,0.00023715405,0.000049389146,0.00006250295,0.00012931919,0.000012391888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063585694,0.0003948456,0.00030599648,0.000348295,0.00019165412,0.0004882444,0.00040058146,0.0007232515,0.0016895192],"category_scores_gemma":[0.001444198,0.0002272465,0.00026118185,0.00039897324,0.0004088364,0.00075994065,0.00031804593,0.0005884127,0.0005104554],"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.00036406665,0.000071459464,0.00072330463,0.0002494475,0.000050265302,0.00018880535,0.000118028605,0.19508916,0.08492469,0.15147802,0.0042745294,0.5624683],"study_design_scores_gemma":[0.000037872687,0.00011143001,0.00033595882,0.00004496035,0.000029296183,0.00021409124,0.000020934402,0.93637365,0.030402381,0.020307327,0.012089524,0.000032634292],"about_ca_topic_score_codex":0.0009610046,"about_ca_topic_score_gemma":0.0011851783,"teacher_disagreement_score":0.0016895192,"about_ca_system_score_codex":0.00053075404,"about_ca_system_score_gemma":0.00062038266,"threshold_uncertainty_score":0.0056520104},"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":"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.003061125,0.00054041675,0.9951933,0.00010109702,0.00004667331,0.000064851956,0.000058059617,0.00018755463,0.0007468762],"genre_scores_gemma":[0.18603517,0.00087213924,0.8088915,0.00019439078,0.00014619916,0.0002829652,0.00037779676,0.00004529315,0.0031545397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991487,0.00027400794,0.00006227031,0.0000998815,0.00035108498,0.00006394428],"domain_scores_gemma":[0.99922323,0.00035058756,0.000081713646,0.00014186458,0.0001753196,0.000027311662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011675206,0.0007428759,0.0010098005,0.0011067105,0.00039664307,0.0007732442,0.0017767332,0.0011007012,0.001698137],"category_scores_gemma":[0.0025058733,0.00034752997,0.0006530623,0.0018192433,0.00067853084,0.0014114253,0.0011461158,0.0013645971,0.00063692074],"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.0004961485,0.00012816781,0.0005523246,0.0003442352,0.00009822967,0.0005078528,0.00015135527,0.2932387,0.02656948,0.15634134,0.0059291194,0.51564306],"study_design_scores_gemma":[0.000044980443,0.00007431427,0.000101343634,0.000023761282,0.000016905415,0.00019417629,0.000008419412,0.9756437,0.0076064435,0.013570313,0.0026834726,0.000032192245],"about_ca_topic_score_codex":0.0029518928,"about_ca_topic_score_gemma":0.0036873885,"teacher_disagreement_score":0.0029518928,"about_ca_system_score_codex":0.0006355809,"about_ca_system_score_gemma":0.0011204963,"threshold_uncertainty_score":0.0061745048},"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":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04918132,0.24185579,0.094097145,0.44962284,0.010835873,0.000073529525,0.00078030705,0.0013220826,0.15223107],"genre_scores_gemma":[0.55961967,0.116368674,0.13745564,0.09585464,0.0073362305,0.00013854787,0.0007505182,0.0015531534,0.08092293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982724,0.00043198155,0.000073608746,0.00036722404,0.00067258923,0.00018204325],"domain_scores_gemma":[0.99640995,0.0015116099,0.0003824413,0.0006292472,0.0007496808,0.0003170258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003563584,0.00068493333,0.0010164822,0.0010771623,0.0009716942,0.005338881,0.0014075682,0.003501505,0.027125131],"category_scores_gemma":[0.012491764,0.00034083964,0.0005625777,0.0012184579,0.0043031415,0.010982731,0.0020726258,0.0036482292,0.008322297],"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.0005846596,0.00020972617,0.003262528,0.0016507345,0.0001948789,0.00045782703,0.00095798663,0.0024180487,0.011739082,0.38575837,0.10788472,0.4848814],"study_design_scores_gemma":[0.00011449535,0.00019998227,0.0034311889,0.00095425674,0.00011996836,0.0013668835,0.0016898699,0.0033066205,0.014347769,0.37753612,0.5968077,0.00012523058],"about_ca_topic_score_codex":0.002544633,"about_ca_topic_score_gemma":0.002525427,"teacher_disagreement_score":0.027125131,"about_ca_system_score_codex":0.0014862629,"about_ca_system_score_gemma":0.0008351755,"threshold_uncertainty_score":0.09074259},"labels":[],"label_agreement":null}]}