{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Xiangjun Zhang","is_ca":true},{"name":"Xiaolin Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003563584,0.0006849333,0.001016482,0.001077162,0.0009716942,0.005338881,0.001407568,0.003501505,0.02712513],"category_scores_gemma":[0.01249176,0.0003408396,0.0005625777,0.001218458,0.004303141,0.01098273,0.002072626,0.003648229,0.008322297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001486263,"about_ca_system_score_gemma":0.0008351755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002544633,"about_ca_topic_score_gemma":0.002525427,"domain_scores_codex":[0.9982724,0.0004319815,0.00007360875,0.000367224,0.0006725892,0.0001820433],"domain_scores_gemma":[0.99641,0.00151161,0.0003824413,0.0006292472,0.0007496808,0.0003170258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005846596,0.0002097262,0.003262528,0.001650734,0.0001948789,0.000457827,0.0009579866,0.002418049,0.01173908,0.3857584,0.1078847,0.4848814],"study_design_scores_gemma":[0.0001144953,0.0001999823,0.003431189,0.0009542567,0.0001199684,0.001366884,0.00168987,0.003306621,0.01434777,0.3775361,0.5968077,0.0001252306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"methods","genre_scores_codex":[0.04918132,0.2418558,0.09409714,0.4496228,0.01083587,0.00007352953,0.000780307,0.001322083,0.1522311],"genre_scores_gemma":[0.5596197,0.1163687,0.1374556,0.09585464,0.00733623,0.0001385479,0.0007505182,0.001553153,0.08092293],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02712513,"threshold_uncertainty_score":0.09074259,"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)","authors":[{"name":"Kamel Belloulata","is_ca":false},{"name":"Shiping Zhu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535472,0.0003388861,0.0005388,0.0007741842,0.0003088603,0.0004633309,0.0009096954,0.0005695337,0.002593755],"category_scores_gemma":[0.0003119058,0.0001659191,0.0002516177,0.0005548894,0.0002479742,0.0007511943,0.0005039239,0.0003807772,0.001128794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003560357,"about_ca_system_score_gemma":0.0002917442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005998914,"about_ca_topic_score_gemma":0.0007860397,"domain_scores_codex":[0.9997815,0.0000198485,0.00001355552,0.00003608668,0.0001324968,0.0000164052],"domain_scores_gemma":[0.999832,0.00002478834,0.00001659864,0.00003452329,0.00007097513,0.00002110403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000233938,0.0001003747,0.0005264031,0.00023684,0.00004224924,0.0003366077,0.0001362898,0.004443101,0.3980507,0.01753427,0.004627496,0.5737317],"study_design_scores_gemma":[0.0001555778,0.001040065,0.003738424,0.00007786341,0.0001789698,0.003888167,0.00006090087,0.4562476,0.3900385,0.005800877,0.1386023,0.0001708457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02613078,0.001198632,0.965722,0.0001079842,0.0002403483,0.0001334615,0.0001016232,0.001974189,0.004390865],"genre_scores_gemma":[0.1902697,0.000855752,0.7966855,0.000222533,0.0002341946,0.0001753861,0.0004166831,0.0001118945,0.01102847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002593755,"threshold_uncertainty_score":0.008677006,"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","authors":[{"name":"Jing Wang","is_ca":true},{"name":"Jie Liang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358569,0.0003948456,0.0003059965,0.000348295,0.0001916541,0.0004882444,0.0004005815,0.0007232515,0.001689519],"category_scores_gemma":[0.001444198,0.0002272465,0.0002611818,0.0003989732,0.0004088364,0.0007599407,0.0003180459,0.0005884127,0.0005104554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000530754,"about_ca_system_score_gemma":0.0006203827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009610046,"about_ca_topic_score_gemma":0.001185178,"domain_scores_codex":[0.9996127,0.00009229418,0.00001945359,0.00006091541,0.0001844399,0.00003023116],"domain_scores_gemma":[0.9995092,0.000237154,0.00004938915,0.00006250295,0.0001293192,0.00001239189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003640667,0.00007145946,0.0007233046,0.0002494475,0.0000502653,0.0001888054,0.0001180286,0.1950892,0.08492469,0.151478,0.004274529,0.5624683],"study_design_scores_gemma":[0.00003787269,0.00011143,0.0003359588,0.00004496035,0.00002929618,0.0002140912,0.0000209344,0.9363737,0.03040238,0.02030733,0.01208952,0.00003263429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005555139,0.0005669122,0.9925412,0.00009858036,0.00003292846,0.00001727237,0.0000234951,0.00008335156,0.001081106],"genre_scores_gemma":[0.2707822,0.001315981,0.7239039,0.0001609233,0.0001180979,0.0001062819,0.0001870823,0.00003970624,0.003385826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001689519,"threshold_uncertainty_score":0.00565201,"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","authors":[{"name":"Reza Dorrigiv","is_ca":true},{"name":"Luís Alejandro","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00269472,0.001359491,0.00102937,0.004172389,0.00131602,0.003856717,0.002882983,0.001847131,0.01303574],"category_scores_gemma":[0.0165698,0.0005731769,0.000914027,0.00684359,0.001510582,0.006666237,0.002987157,0.002572321,0.008135371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001678447,"about_ca_system_score_gemma":0.001571354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631103,"about_ca_topic_score_gemma":0.00167942,"domain_scores_codex":[0.9958352,0.0007798952,0.0004662035,0.0004985775,0.002196775,0.0002233537],"domain_scores_gemma":[0.9908754,0.003023828,0.0005167507,0.003557509,0.001902315,0.0001242198],"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.0002870625,0.0001147725,0.0008659986,0.0004990466,0.00006249626,0.00007743053,0.0002153726,0.0173503,0.006821578,0.1487134,0.0349052,0.7900872],"study_design_scores_gemma":[0.000210736,0.0003267112,0.001071695,0.0003319877,0.0001236268,0.001446656,0.0002377537,0.4235864,0.05659315,0.3297199,0.186194,0.0001574324],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004248885,0.003469491,0.9768627,0.0007201734,0.0003030495,0.0003542308,0.0006253398,0.005670264,0.007745927],"genre_scores_gemma":[0.06774476,0.002974746,0.9152485,0.0006149379,0.0005103181,0.00083818,0.002117391,0.001133854,0.0088173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01303574,"threshold_uncertainty_score":0.0436089,"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","authors":[{"name":"Sorina Dumitrescu","is_ca":true},{"name":"Ting Zheng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475786,0.0006387743,0.0007056214,0.0009157817,0.0003136072,0.0007010087,0.00149935,0.0007509685,0.001877961],"category_scores_gemma":[0.002994753,0.0002878343,0.0005701276,0.0007885251,0.0006726794,0.001805313,0.001173683,0.001097706,0.0004841005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006372356,"about_ca_system_score_gemma":0.001119788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321642,"about_ca_topic_score_gemma":0.001978511,"domain_scores_codex":[0.9990336,0.0002453356,0.00005708161,0.0001117594,0.0004802289,0.00007211251],"domain_scores_gemma":[0.9988348,0.0004207701,0.0001016812,0.0003052731,0.0002946723,0.00004276958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006666349,0.0001123194,0.0009189273,0.000239146,0.0000811037,0.0005300744,0.0002891617,0.3089892,0.1077865,0.1876382,0.002645456,0.3901034],"study_design_scores_gemma":[0.00004869153,0.000169213,0.0001699712,0.00001482489,0.0000195371,0.0002417596,0.00002174957,0.9544156,0.0230441,0.01750733,0.004306867,0.00004023153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007647821,0.0002868886,0.9909806,0.00007105022,0.00002364145,0.00003775857,0.00007458749,0.000223251,0.000654452],"genre_scores_gemma":[0.2532583,0.000456508,0.7430325,0.0001324112,0.00005759357,0.0001178428,0.0004002517,0.00008375756,0.002460751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002321642,"threshold_uncertainty_score":0.007804751,"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","authors":[{"name":"Upul Samarawickrama","is_ca":true},{"name":"Jie Liang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167521,0.0007428759,0.0010098,0.001106711,0.0003966431,0.0007732442,0.001776733,0.001100701,0.001698137],"category_scores_gemma":[0.002505873,0.00034753,0.0006530623,0.001819243,0.0006785308,0.001411425,0.001146116,0.001364597,0.0006369207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006355809,"about_ca_system_score_gemma":0.001120496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002951893,"about_ca_topic_score_gemma":0.003687388,"domain_scores_codex":[0.9991487,0.0002740079,0.00006227031,0.0000998815,0.000351085,0.00006394428],"domain_scores_gemma":[0.9992232,0.0003505876,0.00008171365,0.0001418646,0.0001753196,0.00002731166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004961485,0.0001281678,0.0005523246,0.0003442352,0.00009822967,0.0005078528,0.0001513553,0.2932387,0.02656948,0.1563413,0.005929119,0.5156431],"study_design_scores_gemma":[0.00004498044,0.00007431427,0.0001013436,0.00002376128,0.00001690541,0.0001941763,0.000008419412,0.9756437,0.007606443,0.01357031,0.002683473,0.00003219225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003061125,0.0005404167,0.9951933,0.000101097,0.00004667331,0.00006485196,0.00005805962,0.0001875546,0.0007468762],"genre_scores_gemma":[0.1860352,0.0008721392,0.8088915,0.0001943908,0.0001461992,0.0002829652,0.0003777968,0.00004529315,0.00315454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002951893,"threshold_uncertainty_score":0.006174505,"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","authors":[{"name":"Steven Pigeon","is_ca":true},{"name":"Stéphane Coulombe","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001362281,0.001780486,0.001003242,0.001882135,0.0005452504,0.001328432,0.002262885,0.001244963,0.004731227],"category_scores_gemma":[0.0086381,0.000651109,0.0007701313,0.001376577,0.000484764,0.001975011,0.0009365014,0.001520088,0.003946372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009558002,"about_ca_system_score_gemma":0.001036382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006202459,"about_ca_topic_score_gemma":0.008043278,"domain_scores_codex":[0.9988406,0.0001198149,0.00009806399,0.0003130136,0.0005526649,0.0000758675],"domain_scores_gemma":[0.9954429,0.002047736,0.0004687138,0.0007193496,0.001237439,0.00008390802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002988837,0.0002173041,0.005006122,0.0001447263,0.00009411245,0.00007772898,0.0001018478,0.08406726,0.01461554,0.00335858,0.009282164,0.8827358],"study_design_scores_gemma":[0.0000498736,0.00007856193,0.003339433,0.00001819532,0.00002473702,0.0001389943,0.00004486221,0.9736975,0.01466714,0.004236837,0.003665548,0.00003816335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0102491,0.000243438,0.980703,0.00008651214,0.0000754314,0.0001334258,0.000344838,0.007354616,0.0008096973],"genre_scores_gemma":[0.07626073,0.0002425745,0.9177566,0.00007781703,0.00009261867,0.0004633201,0.001926802,0.0003997423,0.002779745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006202459,"threshold_uncertainty_score":0.0158276,"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","authors":[{"name":"Danny Dub�","is_ca":true},{"name":"Vincent Beaudoin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007798412,0.001201561,0.001571921,0.001693079,0.0010159,0.002323893,0.002150361,0.0009156194,0.2513225],"category_scores_gemma":[0.005432789,0.0003847083,0.0005995187,0.00280342,0.00088819,0.002777074,0.00187224,0.00121946,0.1419708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207256,"about_ca_system_score_gemma":0.001325684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001148868,"about_ca_topic_score_gemma":0.001415573,"domain_scores_codex":[0.9986309,0.0001681342,0.0001115884,0.0002228165,0.0007094077,0.0001571028],"domain_scores_gemma":[0.9985682,0.0002862947,0.0001137774,0.0004350596,0.0005150792,0.00008159313],"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.001043178,0.0001046248,0.0005125803,0.00179875,0.00008502175,0.0003978349,0.0001384281,0.002820386,0.01805186,0.06664742,0.2429242,0.6654757],"study_design_scores_gemma":[0.0001067624,0.0001857192,0.0004225546,0.0002394056,0.00005243588,0.0006344286,0.00007660245,0.008494646,0.0277363,0.01824214,0.9437462,0.00006271387],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01990707,0.02088109,0.445205,0.00519955,0.01470739,0.00190351,0.01191379,0.03616818,0.4441145],"genre_scores_gemma":[0.1580198,0.01076863,0.3342485,0.002744856,0.003461608,0.0009931009,0.0260975,0.0064109,0.457255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2513225,"threshold_uncertainty_score":0.8407575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}