{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":855,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":855,"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":"6222d1cbbe78","filters":{"topic":"Advanced Data Compression Techniques"}},"results":[{"id":"W2102740494","doi":"10.1109/83.846244","title":"Reversible integer-to-integer wavelet transforms for image compression: performance evaluation and analysis","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":372,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Lossless compression; Lossy compression; Data compression; Integer (computer science); Image compression; Wavelet; Wavelet transform; Mathematics; Integer programming; Algorithm; Computer science; Image processing; Image (mathematics); Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.019644011928643,"gpt":0.3088845074331082,"spread":0.2892404955044652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005407458,0.0002907363,0.0003493011,0.0005675147,0.0006593753,0.0003631908,0.0006171628,0.00009312382,0.0002330244],"category_scores_gemma":[0.00001130335,0.0002537812,0.0001449931,0.001392824,0.00009729392,0.00318607,0.000006598656,0.0002925707,0.00002562084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001085233,"about_ca_system_score_gemma":0.00009257681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008597804,"about_ca_topic_score_gemma":0.00000537217,"domain_scores_codex":[0.9978419,0.00006659023,0.0004271171,0.0007741989,0.0005013503,0.0003888502],"domain_scores_gemma":[0.9986292,0.00009969742,0.0001016982,0.0006076507,0.0003855353,0.0001762357],"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.00009573164,0.000103957,0.000002340139,0.00007616668,0.00004163548,0.000001510208,0.0005990792,0.003151439,0.01134426,0.000007529489,0.0002142684,0.9843621],"study_design_scores_gemma":[0.0005611739,0.0001526458,0.00006733804,0.000223951,0.0001754197,0.00001405989,0.00004293973,0.7659596,0.2307843,0.0004074696,0.001269789,0.0003413117],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006459496,0.00008287896,0.9910004,0.0005283377,0.0000847597,0.0007795898,0.0000517091,0.0004168733,0.0005959593],"genre_scores_gemma":[0.5140962,0.00008242927,0.4848365,0.0002707452,0.00001981473,0.0003001267,0.00001339442,0.00002219687,0.0003586411],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9840208,"threshold_uncertainty_score":0.9999914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115514375","doi":"10.1109/tip.2005.871116","title":"Lossless compression of color mosaic images","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":274,"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":"Lossless compression; Lossy compression; Data compression; Decorrelation; Wavelet transform; Computer science; Artificial intelligence; Computer vision; Image compression; Mathematics; Pattern recognition (psychology); Algorithm; Wavelet; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01108228063322351,"gpt":0.2715032746363414,"spread":0.2604209940031179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001398638,0.0002261953,0.0002707975,0.000258126,0.0003177296,0.0001630898,0.0008523181,0.00008313718,0.00002320417],"category_scores_gemma":[0.000004987919,0.0002060405,0.00008707745,0.0005731596,0.0001827435,0.001811323,0.000013336,0.0002695593,0.00001517909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005077527,"about_ca_system_score_gemma":0.0000762675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004131548,"about_ca_topic_score_gemma":0.000003335069,"domain_scores_codex":[0.9983192,0.00006542793,0.000438461,0.0004866053,0.0003969851,0.0002933148],"domain_scores_gemma":[0.998734,0.0001007721,0.0002522186,0.0006197681,0.000227712,0.00006552742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004650028,0.0006209322,0.00001116267,0.0001901143,0.000008138526,0.00002019362,0.0001073562,0.004926986,0.6924867,0.0002808611,0.001867527,0.2994335],"study_design_scores_gemma":[0.0003336734,0.00006193418,0.00006823812,0.0002691603,0.00001034471,0.00001764558,0.00001523792,0.04932609,0.9470801,0.00213744,0.0004543758,0.0002258076],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002049309,0.0001851129,0.9957672,0.0001394519,0.0001576899,0.000205453,0.00005091149,0.0006561596,0.0007886792],"genre_scores_gemma":[0.6394745,0.00001235246,0.3601928,0.00004843238,0.00001930909,0.00003977638,0.000003837505,0.00001822223,0.000190807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6374251,"threshold_uncertainty_score":0.8402087,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171033838","doi":"10.1109/83.846242","title":"Context-based lossless interband compression-extending CALIC","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":196,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Lossless compression; Computer science; Context (archaeology); Data compression; Theoretical computer science; Computer engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01610106005243912,"gpt":0.2858564250416775,"spread":0.2697553649892384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001709003,0.0003171389,0.0002942701,0.0002695899,0.0006602614,0.0004715081,0.001102797,0.0001012679,0.0003668366],"category_scores_gemma":[0.000006152717,0.0002898711,0.0001147288,0.0005670828,0.0001734749,0.002048697,0.000007171298,0.0004912132,0.0001082875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003968,"about_ca_system_score_gemma":0.0001030981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002183965,"about_ca_topic_score_gemma":0.000005562669,"domain_scores_codex":[0.9979082,0.0001002891,0.0004220782,0.0007145826,0.0004132507,0.0004415804],"domain_scores_gemma":[0.9986503,0.0001361266,0.0001312998,0.0007768656,0.0001273017,0.000178099],"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.00004681536,0.0002164734,0.000001996977,0.00005309049,0.000006553034,0.00002668927,0.0001790371,0.001944222,0.01570798,0.00003326073,0.0003583987,0.9814255],"study_design_scores_gemma":[0.0008213892,0.0001017313,0.00001925251,0.00092136,0.00001620145,0.0000456991,0.00003892879,0.3564899,0.6336393,0.0008391533,0.006532142,0.0005349444],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001686324,0.0002149092,0.9951234,0.0003767635,0.0002097686,0.0002354674,0.00002514678,0.001243407,0.0008848166],"genre_scores_gemma":[0.8315367,0.00002485226,0.1671509,0.0007548376,0.00002795977,0.0000818897,0.000003218238,0.00003376479,0.0003859168],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9808905,"threshold_uncertainty_score":0.9999554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130770975","doi":"10.1109/icip.2000.899223","title":"JasPer: a software-based JPEG-2000 codec implementation","year":2000,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Codec; Computer science; JPEG; Transform coding; Software; Lossless JPEG; JPEG 2000; Coding (social sciences); Adaptive Multi-Rate audio codec; Data compression; Computer architecture; Embedded system; Image compression; Computer hardware; Image processing; Image (mathematics); Discrete cosine transform; Speech recognition; Computer vision; Operating system; Speech processing; Voice activity detection; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01132716568854305,"gpt":0.3007598224798596,"spread":0.2894326567913166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001236026,0.0001275973,0.0001149496,0.0000846241,0.0001119216,0.0001100267,0.000859055,0.00003836642,0.003684487],"category_scores_gemma":[0.000009945396,0.0001145013,0.00004437879,0.000289733,0.00002710632,0.0008377478,0.0001125597,0.00008044969,0.0003343399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006738199,"about_ca_system_score_gemma":0.0001134699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008517819,"about_ca_topic_score_gemma":0.00003019852,"domain_scores_codex":[0.9987885,0.00004680864,0.0002342978,0.0003885629,0.0002840863,0.0002577037],"domain_scores_gemma":[0.9989362,0.00007431617,0.00004912697,0.0008037507,0.00004721859,0.0000893672],"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.000007155781,0.00004928391,0.0003827459,0.000003508339,0.000003192617,0.000006986323,0.00006745581,0.0001246157,0.0006628176,0.005401573,0.01968835,0.9736023],"study_design_scores_gemma":[0.001761945,0.0003368287,0.003662723,0.00004629991,0.000008997,0.00002379775,0.00002758507,0.0516841,0.289179,0.03208233,0.6202748,0.0009116599],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002267095,0.00003296728,0.991834,0.0005416542,0.00004796665,0.0002122693,0.00001372017,0.001524259,0.003526046],"genre_scores_gemma":[0.06927255,0.00001493694,0.9269413,0.002490606,0.00002677853,0.00006303385,0.00003797424,0.00001230419,0.001140458],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9726906,"threshold_uncertainty_score":0.9972263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115800223","doi":"10.5281/zenodo.1416647","title":"Jaudio: An Feature Extraction Library.","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":171,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scripting language; XML; Dependency (UML); Process (computing); Interface (matter); Feature extraction; Feature (linguistics); Graphical user interface; User interface; Data mining; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.0111212366032068,"gpt":0.2904757008850564,"spread":0.2793544642818496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000448147,0.00008541292,0.00006686311,0.00006522472,0.0000680683,0.0001461921,0.0008092882,0.00005717695,0.0002128521],"category_scores_gemma":[0.000006424164,0.00006903885,0.00002215283,0.0001830063,0.00001198892,0.007547045,0.0002544539,0.0001347073,0.00009775837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000114715,"about_ca_system_score_gemma":0.00001562154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001875334,"about_ca_topic_score_gemma":0.000002219558,"domain_scores_codex":[0.9993095,0.00002826285,0.00008734565,0.0002907287,0.0001409503,0.000143147],"domain_scores_gemma":[0.9990978,0.00001802676,0.00004282963,0.000740094,0.00001279529,0.00008842941],"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.000003394229,0.00007275025,0.00007564903,0.000001698293,0.000001765614,0.000005663192,0.00005203459,0.00004464051,0.007558896,0.1110922,0.2144441,0.6666471],"study_design_scores_gemma":[0.00007158823,0.00004059974,0.001210872,0.000006609533,6.796516e-7,0.00002780867,0.000004972788,0.01947409,0.1534107,0.005277658,0.8203303,0.0001440952],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003889014,0.00006271461,0.9654728,0.003177472,0.00008320888,0.00007474243,0.000002270521,0.002111649,0.02862627],"genre_scores_gemma":[0.04991355,0.0000222517,0.9429227,0.00147984,0.0001380153,0.000009426811,0.00001021938,0.000008446461,0.005495534],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6665031,"threshold_uncertainty_score":0.5471426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133988432","doi":"10.1109/icassp.1987.1169413","title":"Fast CELP coding based on algebraic codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":165,"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":"Code-excited linear prediction; Codebook; Computer science; Speech coding; Vector sum excited linear prediction; Linear predictive coding; Coding (social sciences); Linear prediction; Algebraic number; Scheme (mathematics); Algorithm; Speech recognition; Computer engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01529917722167532,"gpt":0.2721690719093684,"spread":0.2568698946876931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001315023,0.0001202579,0.0001108977,0.0001146288,0.0000989961,0.00009511517,0.0009507464,0.00003775442,0.0001625091],"category_scores_gemma":[0.00003330034,0.00009765226,0.0000356231,0.000200921,0.00002638604,0.0005902624,0.0002494052,0.0001114726,0.0001966804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004077989,"about_ca_system_score_gemma":0.0000235127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003689277,"about_ca_topic_score_gemma":0.000003887539,"domain_scores_codex":[0.998991,0.0000355068,0.0001543774,0.0003494269,0.0002524298,0.0002172651],"domain_scores_gemma":[0.9988869,0.000146921,0.00005129942,0.0007990514,0.00003398575,0.00008185984],"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.000008376121,0.0001538793,0.0001076846,0.000007950273,0.000003405948,0.00001018489,0.00006321604,0.002349052,0.01150124,0.3347698,0.0386568,0.6123685],"study_design_scores_gemma":[0.0002270451,0.00007787976,0.0002046169,0.00004601843,0.000001066063,0.000003108106,0.000005043277,0.630287,0.306906,0.003239373,0.05876768,0.0002352331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002416109,0.00001134309,0.97465,0.001679784,0.00006015726,0.00009587488,0.000003742281,0.001133876,0.02212358],"genre_scores_gemma":[0.4105456,0.000003768366,0.5865175,0.002346668,0.00004105124,0.00001303879,0.00000366611,0.000006861231,0.0005218849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6279379,"threshold_uncertainty_score":0.3982144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2264175841","doi":"10.1016/j.future.2016.01.015","title":"Data compression techniques in Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University","funders":"University of Waterloo; King Fahd University of Petroleum and Minerals","keywords":"Computer science; Discrete cosine transform; Discrete wavelet transform; Wireless sensor network; Compression ratio; Throughput; Image compression; Energy consumption; Computer hardware; Data compression; Real-time computing; Peak signal-to-noise ratio; Embedded system; Wireless; Algorithm; Wavelet; Artificial intelligence; Image processing; Computer network; Wavelet transform; Image (mathematics); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03466931739647738,"gpt":0.2778103459508886,"spread":0.2431410285544112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005962104,0.0003117188,0.0003826727,0.0002499364,0.0001491182,0.0003298852,0.00280484,0.0002304778,0.000005119617],"category_scores_gemma":[0.000009417554,0.0002087704,0.00003945749,0.0004167018,0.00003608834,0.001954893,0.001817294,0.0002045895,0.0000180729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009975355,"about_ca_system_score_gemma":0.00004808898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001911652,"about_ca_topic_score_gemma":0.00002302898,"domain_scores_codex":[0.9969411,0.000440244,0.0006796959,0.001114871,0.0004283847,0.0003957195],"domain_scores_gemma":[0.9962792,0.0001210625,0.0002920292,0.003024172,0.0001585335,0.0001250344],"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.000008278129,0.00008050699,0.0003272298,0.00002451988,0.00001260637,0.00004156593,0.00005489406,0.0006659097,0.01603411,0.01445405,0.557718,0.4105783],"study_design_scores_gemma":[0.0002896126,0.00005049308,0.0001464044,0.0002979759,0.000001927247,0.00005125975,0.000004169857,0.6779404,0.005902106,0.00001484917,0.3149525,0.0003482565],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003130244,0.0005195396,0.9777631,0.001007114,0.01860511,0.0005765287,0.00005850673,0.001095193,0.00006190531],"genre_scores_gemma":[0.06275462,0.0004929818,0.8536614,0.0007854964,0.08123632,0.0002387437,0.0004714977,0.00007342884,0.0002855721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6772745,"threshold_uncertainty_score":0.851341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2894662919","doi":"10.1155/2018/2016976","title":"Parallel Fractal Compression Method for Big Video Data","year":2018,"lang":"en","type":"article","venue":"Complexity","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Data compression; Video compression picture types; Fractal compression; Compression ratio; Data compression ratio; Video quality; Artificial intelligence; Computer vision; Image compression; Data mining; Video processing; Video tracking; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.2279117655148403,"gpt":0.4242580084439189,"spread":0.1963462429290786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006757044,0.0002293856,0.0003179222,0.00009985713,0.0004385433,0.0001542753,0.005234263,0.00009223278,0.00004370934],"category_scores_gemma":[0.0002903005,0.0001988975,0.00006293831,0.0002755499,0.0002453209,0.001126314,0.00501453,0.0001873954,0.00006499168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000330381,"about_ca_system_score_gemma":0.00006322416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006129658,"about_ca_topic_score_gemma":0.00003315316,"domain_scores_codex":[0.9976906,0.0001703937,0.0003598503,0.001027588,0.0003285378,0.0004229939],"domain_scores_gemma":[0.9949722,0.0004593766,0.0002138433,0.003967688,0.000219864,0.0001669825],"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.0001158009,0.0002527209,0.0001134904,0.00004525809,0.00003006982,0.000006156139,0.0002149363,0.00001158991,0.01014203,0.1269655,0.3734894,0.4886131],"study_design_scores_gemma":[0.0004292516,0.0001311154,0.0006103314,0.0000440251,0.000004439612,0.0000134092,0.000005688656,0.3461177,0.01109149,0.187187,0.4540864,0.0002791241],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001321653,0.00008288207,0.9950783,0.0008212713,0.001082683,0.0004866617,0.0002572006,0.0008721432,0.001186726],"genre_scores_gemma":[0.01644359,0.000007516716,0.9814546,0.0008483708,0.0008375849,0.00005150508,0.0002395581,0.00001967869,0.00009763601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.488334,"threshold_uncertainty_score":0.972665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030185887","doi":"10.1109/tip.2008.2007609","title":"Joint Optimization of Run-Length Coding, Huffman Coding, and Quantization Table With Complete Baseline JPEG Decoder Compatibility","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Huffman coding; Lossless JPEG; JPEG; Quantization (signal processing); Algorithm; Computer science; JPEG 2000; Image compression; Data compression; Variable-length code; Mathematics; Artificial intelligence; Image processing; Decoding methods; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03723398257603763,"gpt":0.2740565644659104,"spread":0.2368225818898727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120127,0.0002391818,0.0003342727,0.0002525729,0.0006199749,0.0001112217,0.000317053,0.00006494753,0.00002705704],"category_scores_gemma":[0.00002370977,0.000216019,0.00003569293,0.0006286578,0.0002664997,0.00196956,0.00001218545,0.0002371926,0.000001648717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005532842,"about_ca_system_score_gemma":0.0001148223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004040977,"about_ca_topic_score_gemma":0.00001684696,"domain_scores_codex":[0.9981892,0.000107155,0.0004992547,0.0005796441,0.0003745282,0.0002502533],"domain_scores_gemma":[0.9984822,0.0001005804,0.0003463213,0.0005183662,0.0004501951,0.0001023893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003953917,0.002244567,0.0007293348,0.001390492,0.00009365884,0.00004648271,0.00393668,0.7074952,0.1377874,0.0009772379,0.0006682211,0.1442354],"study_design_scores_gemma":[0.0005127185,0.0001315359,0.0001397341,0.0002709322,0.00001641621,0.00005414211,0.0000321253,0.8338275,0.1646269,0.0001144379,0.00004503707,0.0002285016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003117833,0.00006698993,0.9957554,0.0001123103,0.00005639319,0.0003218407,0.0000397637,0.0004206401,0.000108823],"genre_scores_gemma":[0.5255287,0.00009320724,0.474254,0.00005506427,0.000006363064,0.00001714885,0.000009809834,0.00001559191,0.00002007495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5224109,"threshold_uncertainty_score":0.8809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099665608","doi":"10.1109/tmi.2009.2012899","title":"Symmetry-Based Scalable Lossless Compression of 3D Medical Image Data","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Lossless compression; JPEG 2000; Computer science; Data compression; Image compression; Lossy compression; Computer vision; Artificial intelligence; Scalability; Algorithm; Wavelet transform; Wavelet; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02141983792750552,"gpt":0.3262134527351578,"spread":0.3047936148076523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029282,0.0002644057,0.0004193732,0.000332226,0.0002186472,0.0000826732,0.004283056,0.00016346,0.0005332751],"category_scores_gemma":[0.0002132602,0.000225833,0.00008197567,0.0007077838,0.0003456984,0.001338192,0.00005765304,0.0009028206,0.00003507773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004912306,"about_ca_system_score_gemma":0.0003464887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003673555,"about_ca_topic_score_gemma":0.000003408762,"domain_scores_codex":[0.9954498,0.0002101796,0.0006551648,0.0008311215,0.0023938,0.0004599119],"domain_scores_gemma":[0.996225,0.0005316967,0.0001687641,0.002358417,0.0001424754,0.0005736455],"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.00003037704,0.0008259892,0.00001378011,0.00004184714,0.00001123252,0.0001621387,0.0000267858,0.0001829713,0.005034681,0.0003895582,0.00648509,0.9867955],"study_design_scores_gemma":[0.0009467601,0.00006485257,0.00004454198,0.000876681,0.00001580614,0.00005538845,0.000009191766,0.869487,0.1249266,0.0009478764,0.00234852,0.0002768194],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001986273,0.0001225726,0.9910702,0.00675338,0.0004625348,0.0001769591,0.0000582187,0.0006337278,0.000523779],"genre_scores_gemma":[0.6099861,0.000111302,0.3861948,0.003538529,0.0000696915,0.00001375174,0.00003358884,0.00002316545,0.00002904581],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9865187,"threshold_uncertainty_score":0.9209203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296274957","doi":"10.1109/icip.2015.7351345","title":"Limitations of the SSIM quality metric in the context of diagnostic imaging","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":83,"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","funders":"","keywords":"Lossy compression; Computer science; Context (archaeology); Metric (unit); Image quality; Pooling; JPEG; Distortion (music); Artificial intelligence; Compression (physics); Quality (philosophy); Image compression; Data compression; Medical imaging; Encoder; Block (permutation group theory); Pattern recognition (psychology); Image (mathematics); Mathematics; Image processing; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1647632760790442,"gpt":0.3610033830072321,"spread":0.1962401069281879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008362037,0.00005157584,0.0001043077,0.00009070482,0.00002488014,0.00001645779,0.001403656,0.00001219265,0.000001502962],"category_scores_gemma":[0.006381756,0.00002601797,0.00003270731,0.0009157798,0.0000798715,0.0003345085,0.0003878782,0.00007992996,0.000001701146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001624041,"about_ca_system_score_gemma":0.00005283129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000230282,"about_ca_topic_score_gemma":0.0000589573,"domain_scores_codex":[0.9989395,0.0002836493,0.000277778,0.000121327,0.0002932239,0.00008451028],"domain_scores_gemma":[0.9942042,0.004666404,0.0001591914,0.0008110008,0.0001382257,0.00002101794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004089562,0.0002779399,0.02754443,0.00001464273,0.00000581639,0.000001893119,0.005581961,0.0001777523,0.0008558835,0.6792514,0.0114393,0.2748448],"study_design_scores_gemma":[0.001767544,0.0001837511,0.365717,0.0002677061,0.00002314549,0.00001691898,0.01289774,0.04285513,0.1850504,0.3686145,0.02202407,0.0005821312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006873761,0.0002700059,0.9864224,0.002284629,0.00008241602,0.000230585,0.000006532124,0.00005026415,0.003779428],"genre_scores_gemma":[0.9591224,0.00001719178,0.04038872,0.0004325617,0.000003602784,0.00001565581,6.398005e-7,0.000001833818,0.00001736926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9522486,"threshold_uncertainty_score":0.7640019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145103350","doi":"10.1109/89.966081","title":"Linear prediction based packet loss concealment algorithm for PCM coded speech","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Speech and Audio Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Linear prediction; Computer science; Speech coding; Algorithm; Packet loss; Speech recognition; Network packet; Voice activity detection; Linear predictive coding; Frame (networking); Pulse-code modulation; Speech processing; SIGNAL (programming language); Speech enhancement; Residual; Artificial intelligence; Noise reduction; Telecommunications; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02324473546787878,"gpt":0.2909834385252361,"spread":0.2677387030573573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002576732,0.0002598874,0.0002563586,0.0001979067,0.0005440796,0.0001745422,0.0003905,0.0001266955,0.00002159546],"category_scores_gemma":[0.000007742429,0.0002424723,0.00007988681,0.0004273433,0.0001003551,0.0009711388,0.000006542817,0.00025965,0.00000638478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008354881,"about_ca_system_score_gemma":0.0001184316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008288732,"about_ca_topic_score_gemma":0.000004725112,"domain_scores_codex":[0.9982136,0.00004256661,0.0003558811,0.0006471085,0.0003556232,0.0003851986],"domain_scores_gemma":[0.9989297,0.0001076177,0.0001528376,0.0004466603,0.0001941584,0.0001690604],"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.00004031433,0.0001590078,0.00001286628,0.00004152834,0.00001018175,0.00002058868,0.00005875483,0.0005157751,0.003808295,0.00001027759,0.0002890048,0.9950334],"study_design_scores_gemma":[0.001063493,0.0002962325,0.00001934827,0.0002162089,0.00002136122,0.0001077646,0.00002295395,0.4680769,0.518898,0.0008204614,0.01017648,0.0002808117],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001485535,0.00008503934,0.9960489,0.0005828593,0.0002814521,0.000533775,0.0001422842,0.0007412551,0.00009884552],"genre_scores_gemma":[0.1305429,0.0001551804,0.8680745,0.0005018722,0.0001084056,0.0001587851,0.00001878647,0.00002945411,0.0004101171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9947526,"threshold_uncertainty_score":0.9887734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4376112629","doi":"10.1016/j.engappai.2023.106361","title":"Learning-driven lossy image compression: A comprehensive survey","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Lossy compression; Artificial intelligence; Image compression; Data compression; Cluster analysis; Encoder; Convolutional neural network; Autoencoder; Pattern recognition (psychology); Deep learning; Computer vision; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03983839414224543,"gpt":0.3206039082887734,"spread":0.280765514146528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590606,0.0001810335,0.0002395207,0.0003281283,0.0001424827,0.00007164563,0.001434681,0.00007141966,0.00001448009],"category_scores_gemma":[0.0001865233,0.0001927007,0.00006370609,0.001904033,0.00009667751,0.000344033,0.0006427872,0.0002824972,0.0003212724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002598301,"about_ca_system_score_gemma":0.00003105621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004159378,"about_ca_topic_score_gemma":0.000002572513,"domain_scores_codex":[0.9984258,0.00006334974,0.0004840216,0.0004554017,0.0002949201,0.0002764686],"domain_scores_gemma":[0.9978215,0.0006326379,0.0001628185,0.0009541876,0.0003265926,0.000102241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001675503,0.0001965551,0.0002599756,0.0001300461,0.00003910413,0.00001123317,0.0005231424,0.4281234,0.2449904,0.1554648,0.001793418,0.1684512],"study_design_scores_gemma":[0.00001671276,0.00005499082,0.001730607,0.00005889585,0.00000288008,0.000003765833,0.0000511578,0.7717093,0.2140036,0.006112069,0.005988624,0.0002673543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004302054,0.00005045347,0.9935743,0.0001069767,0.0000957175,0.0003502373,0.00002893862,0.001425338,0.00006602193],"genre_scores_gemma":[0.728551,0.00006815566,0.2709006,0.00001401072,0.00004956614,0.0002587616,0.00007848356,0.00002662285,0.00005286082],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7242489,"threshold_uncertainty_score":0.7858108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038292149","doi":"10.1109/tip.2010.2061860","title":"Adaptive Sequential Prediction of Multidimensional Signals With Applications to Lossless Image Coding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":74,"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":"Minimum description length; Autoregressive model; Lossless compression; Pattern recognition (psychology); Mathematics; Computer science; Linear prediction; Artificial intelligence; Algorithm; Coding (social sciences); Adaptive coding; Data compression; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02191623160195614,"gpt":0.2926400405790815,"spread":0.2707238089771253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001887575,0.0002102909,0.0002067236,0.0003059624,0.0004030621,0.000114286,0.000521036,0.00007796757,0.00002775773],"category_scores_gemma":[0.000007074095,0.000189279,0.0000551443,0.0006733399,0.0001788337,0.001731202,0.00001382958,0.0004403011,0.00001624504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004324719,"about_ca_system_score_gemma":0.0001543229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001252678,"about_ca_topic_score_gemma":0.000009075344,"domain_scores_codex":[0.9983585,0.00003929586,0.0003447726,0.0005636114,0.0004386786,0.0002551008],"domain_scores_gemma":[0.9985,0.00009704318,0.0001941096,0.0005555064,0.0005049077,0.0001484064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005345944,0.0001957873,0.000001763957,0.00003437008,0.00001112628,0.000003643233,0.0002083197,0.001459142,0.9114452,0.0003308728,0.00003893411,0.08621741],"study_design_scores_gemma":[0.0003055396,0.0001356602,0.00002972594,0.000167032,0.00001900449,0.00003395625,0.00004505265,0.07264645,0.9257907,0.0004552652,0.0001805474,0.0001910457],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001820979,0.000008360971,0.996557,0.0001354883,0.0001173531,0.0005706419,0.000136569,0.0004744391,0.0001791881],"genre_scores_gemma":[0.4777434,0.00000192152,0.5219499,0.00004425712,0.00002311924,0.0001964023,0.000002948066,0.00001517745,0.00002274945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4759225,"threshold_uncertainty_score":0.7718572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144437575","doi":"10.1109/18.978755","title":"On the structure of optimal entropy-constrained scalar quantizers","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Rate–distortion theory; Regular polygon; Entropy (arrow of time); Applied mathematics; Monotone polygon; Piecewise; Quantization (signal processing); Convex function; Monotonic function; Convex optimization; Mathematical optimization; Discrete mathematics; Mathematical analysis; Algorithm; Data compression","retraction":null,"screen_n_in":null,"score":{"opus":0.009559750896264157,"gpt":0.2232828923796472,"spread":0.213723141483383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001909125,0.0001470622,0.0001285367,0.0002280749,0.0002150489,0.00006837825,0.0007302597,0.00007437554,0.0006729861],"category_scores_gemma":[0.00002777503,0.0001013938,0.00008874074,0.0003175438,0.0001411537,0.001603202,0.000004929491,0.0002804814,0.00009644655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003286421,"about_ca_system_score_gemma":0.0000154846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001298234,"about_ca_topic_score_gemma":1.749837e-7,"domain_scores_codex":[0.9988915,0.0001207801,0.0003621675,0.0001270872,0.0003330077,0.000165472],"domain_scores_gemma":[0.9985479,0.0004198318,0.0001960459,0.0007015499,0.00008432454,0.00005038131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005442481,0.00008363346,2.925876e-7,0.0000173437,0.0000340036,6.361945e-7,0.001747586,0.03699212,0.005391459,0.819901,0.001471734,0.1343058],"study_design_scores_gemma":[0.0006412865,0.0002720584,0.000009533832,0.00009199879,0.00001503951,0.00002332783,0.0003448426,0.1716453,0.7744587,0.05018607,0.002004576,0.0003072893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004877684,0.000006226552,0.9929572,0.0003599783,0.0002546389,0.0002500945,0.000101419,0.0002582117,0.0009344854],"genre_scores_gemma":[0.9760979,0.00001743005,0.02312562,0.0006818289,0.000006563959,0.00001233157,0.000003186624,0.00000545247,0.00004967256],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9712203,"threshold_uncertainty_score":0.7368726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1518500973","doi":"10.1109/83.841931","title":"L/sub ∞/ constrained high-fidelity image compression via adaptive context modeling","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Lossless compression; Image compression; Computer science; Fidelity; Data compression; Algorithm; Context (archaeology); Image (mathematics); Wavelet; High fidelity; Data compression ratio; Compression (physics); Artificial intelligence; Pattern recognition (psychology); Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01948508971450302,"gpt":0.2730916628622603,"spread":0.2536065731477573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002760245,0.0004395869,0.0004290603,0.0002405772,0.0008552934,0.0004005815,0.001044033,0.0001539324,0.0002079944],"category_scores_gemma":[0.000009087558,0.0004216347,0.0001398825,0.0005656409,0.0002651352,0.003920838,0.00001486105,0.000710051,0.0001269468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001318954,"about_ca_system_score_gemma":0.0001483196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008710871,"about_ca_topic_score_gemma":0.000009497051,"domain_scores_codex":[0.9970672,0.0001641922,0.0006618171,0.0009984978,0.0005469041,0.0005613948],"domain_scores_gemma":[0.998186,0.0001240284,0.0001841577,0.000911076,0.0003655888,0.000229164],"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.00009987961,0.0002242012,1.284709e-7,0.00003367493,0.00001267866,0.00002445966,0.0002481107,0.01144654,0.1312904,0.0000653657,0.00008485519,0.8564697],"study_design_scores_gemma":[0.0005285468,0.00007912168,0.000001990501,0.0002922507,0.00001493066,0.00003705641,0.00004596064,0.6705193,0.3241581,0.00389237,0.00006726658,0.0003631353],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003897871,0.0001408199,0.9927343,0.000277489,0.0001775227,0.000418214,0.00005727874,0.001580847,0.000715633],"genre_scores_gemma":[0.6322045,0.00004141882,0.3672647,0.0002996541,0.00002692036,0.00006766712,0.000004672826,0.00003009971,0.00006035691],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8561066,"threshold_uncertainty_score":0.9998236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116043386","doi":"10.1109/ijcnn.2008.4634186","title":"Efficient hardware implementation of an image compressor for wireless capsule endoscopy applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"JPEG; Computer science; Discrete cosine transform; Quantization (signal processing); Capsule endoscopy; Gas compressor; Computer hardware; Wireless; CMOS; Transpose; Image compression; Data compression; Image processing; Artificial intelligence; Computer vision; Electronic engineering; Image (mathematics); Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02198842503665055,"gpt":0.3399691805892719,"spread":0.3179807555526213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009644432,0.0001125464,0.0001597299,0.00009125804,0.0001893471,0.00002408381,0.0008513323,0.00002911486,0.00003035359],"category_scores_gemma":[0.000005160972,0.0001033078,0.00004687852,0.0002000122,0.00006808231,0.0003553278,0.0002240358,0.00004634567,0.000005529229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000263856,"about_ca_system_score_gemma":0.00005292574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006329786,"about_ca_topic_score_gemma":0.000006967282,"domain_scores_codex":[0.998897,0.00003067919,0.0003001604,0.0003643407,0.0002134386,0.0001944401],"domain_scores_gemma":[0.9986827,0.00005650766,0.0001617321,0.0008078723,0.0002128652,0.00007828399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001815499,0.0006033932,0.0001135341,0.0001215735,0.00002073385,0.000003676667,0.000941476,0.000644403,0.7923889,0.09350026,0.006628127,0.1050157],"study_design_scores_gemma":[0.0004790701,0.00009653657,0.000351779,0.000006993783,0.000003281267,0.000007298838,0.00008667346,0.07312656,0.9211081,0.001146225,0.003452249,0.0001352253],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02791937,0.00002224435,0.9702399,0.00007429651,0.00003449947,0.00100736,0.0001519518,0.000361157,0.0001892472],"genre_scores_gemma":[0.3248413,0.000007386506,0.6744008,0.00005730911,0.0000172355,0.0005621361,0.00006974381,0.000008858065,0.0000352262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2969219,"threshold_uncertainty_score":0.4212771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144706739","doi":"10.1007/s10278-008-9139-7","title":"Pan-Canadian Evaluation of Irreversible Compression Ratios (“Lossy” Compression) for Development of National Guidelines","year":2008,"lang":"en","type":"letter","venue":"Journal of Digital Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Toronto; Fraser Health; Canada Health Infoway; McMaster University; Health Sciences Centre; Hôpital Saint-Luc; Sunnybrook Health Science Centre","funders":"","keywords":"Lossy compression; JPEG; Computer science; Compression ratio; Data compression; Medical physics; Artificial intelligence; Medicine; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1441441281012234,"gpt":0.3799911628793061,"spread":0.2358470347780827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001008581,0.0003066829,0.0006353215,0.001046064,0.0001690174,0.0001513475,0.001581448,0.0001706131,0.00001433752],"category_scores_gemma":[0.0007929264,0.000263774,0.0002482099,0.0002894274,0.00009551956,0.002985313,0.0003337423,0.0005335906,0.000002320251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003991675,"about_ca_system_score_gemma":0.003109787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003154582,"about_ca_topic_score_gemma":0.00001051094,"domain_scores_codex":[0.9949945,0.00009567752,0.00190135,0.0003319201,0.002366382,0.0003102196],"domain_scores_gemma":[0.9892794,0.0003560553,0.002643041,0.0004180117,0.007182776,0.0001207164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001245913,0.00005158779,0.0001499296,0.0001086174,0.0000621317,0.00001798662,0.0001748624,0.0004339498,0.00139352,0.00003894083,0.8970388,0.1005172],"study_design_scores_gemma":[0.001522117,0.00008476916,0.0002439777,0.003252636,0.00005918392,0.000295355,0.00003235776,0.04479118,0.03274502,0.009389601,0.9069777,0.0006060903],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004448847,0.001230333,0.9557865,0.03961493,0.0008230419,0.0007223604,0.0002658633,0.00004386528,0.001068271],"genre_scores_gemma":[0.04970924,0.00007188088,0.9272476,0.0210058,0.001131607,0.0000407477,0.0005258133,0.00006987276,0.0001974258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09991112,"threshold_uncertainty_score":0.9999815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1567180517","doi":"10.1007/978-3-7091-2568-7_4","title":"Learning-Theoretic Methods in Vector Quantization","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Vector quantization; External Data Representation; Computer science; Binary number; Quantization (signal processing); Representation (politics); Algorithm; Coding (social sciences); Data compression; Binary data; Learning vector quantization; Theoretical computer science; Pattern recognition (psychology); Artificial intelligence; Mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.0339443556881549,"gpt":0.3383017103835649,"spread":0.30435735469541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003723121,0.0002853818,0.0003452286,0.0003819922,0.00004937544,0.00007941893,0.001103194,0.0002791364,0.001031322],"category_scores_gemma":[0.0001202962,0.0002610682,0.00007396387,0.0001030007,0.00006468831,0.0003620009,0.000614334,0.0005911985,0.0001911923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007883568,"about_ca_system_score_gemma":0.00002312392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004163747,"about_ca_topic_score_gemma":0.000001571133,"domain_scores_codex":[0.9983696,0.0001242572,0.0003957169,0.0006390949,0.0002609377,0.0002103835],"domain_scores_gemma":[0.9984527,0.0002763556,0.0002341005,0.0009052139,0.00006833205,0.00006332948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.670492e-7,0.000006888885,0.00000247256,0.00001168299,0.000002948036,0.00001048623,0.00003694243,0.00003382678,0.00009077341,0.8941025,0.0009439563,0.1047565],"study_design_scores_gemma":[0.0001346245,0.0001284124,0.00001423038,0.0002683084,0.00000600362,0.00001336805,0.000001383463,0.0606095,0.002918107,0.5292555,0.4060583,0.0005922677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.112932e-7,0.0001497979,0.6358283,0.00007514421,0.0001016105,0.0001414406,0.000001064419,0.0005574969,0.3631451],"genre_scores_gemma":[0.000105726,0.000429429,0.6806,0.0000952354,0.00002789494,0.00001179048,0.00001416416,0.00003380764,0.318682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4051144,"threshold_uncertainty_score":0.9999841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109088709","doi":"10.1109/dcc.1991.213341","title":"A better tree-structured vector quantizer","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Codebook; Tree (set theory); Encoding (memory); Linde–Buzo–Gray algorithm; Logarithm; Computer science; Vector quantization; Process (computing); Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Combinatorics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02381243993293119,"gpt":0.254899063405625,"spread":0.2310866234726938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004090689,0.0001186653,0.0001187087,0.00007440292,0.00006042169,0.000083565,0.0009874681,0.00004819546,0.000785285],"category_scores_gemma":[0.00002299942,0.00008927393,0.00004407526,0.0002236837,0.0000280789,0.0006414798,0.0003470469,0.0001059198,0.0002612876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001491033,"about_ca_system_score_gemma":0.000003302929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005208806,"about_ca_topic_score_gemma":0.000004122077,"domain_scores_codex":[0.9990536,0.00002958918,0.0001533373,0.0003422316,0.000204347,0.0002169112],"domain_scores_gemma":[0.9989133,0.00004502571,0.00004604017,0.0008923539,0.0000300163,0.00007323203],"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.000002932488,0.000069173,0.0002882674,0.000006967575,0.00001231893,0.00003910978,0.0002102966,0.000003611917,0.04699679,0.1046182,0.3176741,0.5300782],"study_design_scores_gemma":[0.0007537743,0.0001547186,0.006131545,0.00003530146,0.000006041043,0.00007324245,0.000007591824,0.1426034,0.3516664,0.04833603,0.4493454,0.0008866519],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001260965,0.0000731792,0.9867439,0.001979714,0.0001657968,0.00009782422,0.000002597057,0.001055633,0.008620358],"genre_scores_gemma":[0.2933717,0.0000101606,0.7028196,0.002013266,0.00005324521,0.00001539479,0.000001672116,0.000009433204,0.001705589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5291916,"threshold_uncertainty_score":0.859832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165238496","doi":"10.1109/icc.1993.397535","title":"Joint source and channel coding using a non-linear receiver","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":65,"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":"QAM; Algorithm; Estimator; Quadrature amplitude modulation; Joint (building); Computer science; SIGNAL (programming language); Modulation (music); Channel (broadcasting); Coding (social sciences); Mathematics; Decoding methods; Telecommunications; Bit error rate; Statistics; Acoustics","retraction":null,"screen_n_in":null,"score":{"opus":0.07186065655579724,"gpt":0.2791376371289322,"spread":0.207276980573135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009906592,0.0001027794,0.0001216831,0.00008890429,0.0001257706,0.00006497146,0.0003264021,0.00003879248,0.00004861258],"category_scores_gemma":[0.00002604624,0.00008761862,0.0000210105,0.0001719462,0.00003883036,0.0006584747,0.000593381,0.00009864292,0.000022728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002176002,"about_ca_system_score_gemma":0.000004067245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002227593,"about_ca_topic_score_gemma":5.83437e-7,"domain_scores_codex":[0.9991916,0.00002025139,0.0001431187,0.0003161369,0.0001377144,0.0001911306],"domain_scores_gemma":[0.9993722,0.00003184195,0.0000582898,0.0004216325,0.00003547786,0.0000805281],"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.00001625699,0.0004428829,0.0004147562,0.0001621746,0.00006330846,0.0001645754,0.007051588,0.00452176,0.3570164,0.02791643,0.065937,0.5362929],"study_design_scores_gemma":[0.0001130547,0.00002133259,0.00003198078,0.00004336944,0.000001327162,0.00003462426,0.00001423785,0.9539355,0.04082762,0.0008378637,0.00400368,0.0001353816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003059365,0.00006519202,0.9946254,0.0002230739,0.0000629597,0.00009720072,9.062171e-7,0.000304712,0.001561165],"genre_scores_gemma":[0.2970073,0.00007931187,0.7013994,0.0005109917,0.000045977,0.000004499921,4.769288e-7,0.00001057897,0.000941493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9494138,"threshold_uncertainty_score":0.3572984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2771942883","doi":"10.1109/smc.2017.8122605","title":"Medical image compression based on region of interest using better portable graphics (BPG)","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Lossy compression; Computer science; Lossless compression; Region of interest; Image compression; Computer vision; Data compression; Artificial intelligence; Medical imaging; Graphics; Compression (physics); Texture compression; Image processing; Computer graphics (images); Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.09125776043680382,"gpt":0.3528206759213247,"spread":0.2615629154845208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003027474,0.0001602238,0.0002379907,0.0001665736,0.0002755039,0.0001391364,0.002487853,0.0001244835,0.00007244877],"category_scores_gemma":[0.0002281339,0.0001218397,0.00007460015,0.00008474303,0.0002281475,0.001080411,0.001075668,0.0002665886,0.000004837929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001843405,"about_ca_system_score_gemma":0.00006097101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001085417,"about_ca_topic_score_gemma":0.00001159309,"domain_scores_codex":[0.9984654,0.00007218545,0.0003331483,0.0004218227,0.0004797392,0.0002276891],"domain_scores_gemma":[0.9968873,0.0001271244,0.0003871967,0.002343728,0.0001072568,0.0001473627],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003248565,0.002322922,0.03013531,0.0004473015,0.00006970695,0.001858778,0.000170746,0.0002346114,0.1375754,0.3819183,0.1633973,0.2815448],"study_design_scores_gemma":[0.0006301605,0.0001481714,0.003039401,0.001076543,0.00000588889,0.00003002557,0.000003448542,0.7648207,0.2135974,0.01262782,0.003697627,0.0003228675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01206987,0.000007952064,0.9836593,0.001550824,0.0001899472,0.0001273389,0.000003329218,0.0002178185,0.002173625],"genre_scores_gemma":[0.7015129,0.000008639048,0.2973363,0.001047443,0.00003414474,0.000004589529,0.000004867829,0.00001165449,0.000039496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7645861,"threshold_uncertainty_score":0.4968477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089848273","doi":"10.5555/2383795.2383812","title":"Adaptive scalable texture compression","year":2012,"lang":"en","type":"article","venue":"High Performance Graphics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Texel; Color depth; Computer science; Computer vision; Lossy compression; Artificial intelligence; Pixel; Texture compression; Bilinear interpolation; Color space; Color image; Image texture; Image segmentation; Segmentation; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01964150090634639,"gpt":0.2500547728112572,"spread":0.2304132719049108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915109,0.0002337751,0.0002141955,0.0002105743,0.0003569752,0.00006446029,0.001183874,0.0001476957,0.00003288515],"category_scores_gemma":[0.00001446653,0.0001911969,0.00005266861,0.0007502355,0.0001086496,0.003336922,0.0006892891,0.0004236721,0.0001023163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003298412,"about_ca_system_score_gemma":0.00002659682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001170097,"about_ca_topic_score_gemma":6.440211e-7,"domain_scores_codex":[0.9982874,0.00005908342,0.0002530407,0.0003481751,0.0004519669,0.0006003817],"domain_scores_gemma":[0.9984236,0.0000680779,0.0001450063,0.001041067,0.0001152538,0.0002070144],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007398825,0.0006138153,0.03747052,0.0001203617,0.00004096837,0.000008697235,0.0008167598,0.0003055362,0.005446171,0.7249197,0.04896519,0.1812183],"study_design_scores_gemma":[0.001527115,0.0007017807,0.2056493,0.0007685005,0.00003413009,0.0001510034,0.00006350943,0.3157329,0.1929098,0.02183909,0.2582885,0.002334505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06554343,0.0008215077,0.9294404,0.0001883433,0.0007756469,0.0002706705,0.00001389016,0.001090216,0.00185584],"genre_scores_gemma":[0.871793,0.0003686573,0.1270583,0.0004350723,0.0001367574,0.00004113771,0.00001362487,0.00001656693,0.0001368937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8062496,"threshold_uncertainty_score":0.7796785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107604367","doi":"10.1109/tcsvt.2011.2163985","title":"Low Power and Low Complexity Compressor for Video Capsule Endoscopy","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"University of Toronto; CMC Microsystems","keywords":"Computer science; Computer vision; Artificial intelligence; Chrominance; Data compression; Video decoder; Computer hardware; Decoding methods; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04666611885820893,"gpt":0.277397535849716,"spread":0.2307314169915071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002688336,0.0003249638,0.0005448771,0.0004974358,0.0005028653,0.000100258,0.0007898473,0.0002578357,0.000008063726],"category_scores_gemma":[0.00002549355,0.0003019984,0.00009790507,0.0003037555,0.0003639964,0.0005349632,0.00002099752,0.0002726825,0.000004532942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004997943,"about_ca_system_score_gemma":0.00004265671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006385238,"about_ca_topic_score_gemma":0.00002341826,"domain_scores_codex":[0.9978959,0.00005378266,0.0005097701,0.0008620532,0.000170966,0.0005075342],"domain_scores_gemma":[0.9982176,0.0002131737,0.0002258432,0.0009893967,0.0002073636,0.0001466106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003275604,0.002280981,0.00012406,0.0032197,0.0005133637,0.00006018076,0.002194508,0.0002504216,0.3083439,0.439734,0.006041231,0.2369101],"study_design_scores_gemma":[0.003661145,0.002335199,0.00008041767,0.0006631221,0.00007268547,0.0003953741,0.0002992363,0.0369904,0.8708753,0.06971718,0.01375398,0.001155938],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009036561,0.0005639511,0.986087,0.0001595714,0.0007998203,0.001827632,0.0004000016,0.001029812,0.0000957101],"genre_scores_gemma":[0.9681139,0.00007338906,0.03023826,0.0001591058,0.00001885651,0.001262144,0.000003798385,0.00003754991,0.00009298876],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9590774,"threshold_uncertainty_score":0.9999432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158531688","doi":"10.1109/icassp.1990.115567","title":"On reducing computational complexity of codebook search in CELP coder through the use of algebraic codes","year":2002,"lang":"en","type":"article","venue":"International Conference on Acoustics, Speech, and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":62,"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":"Codebook; Code-excited linear prediction; Code word; Algebraic number; Computer science; Algorithm; Linear predictive coding; Coding (social sciences); Theoretical computer science; Computation; Speech coding; Mathematics; Speech recognition; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.1829016084215625,"gpt":0.3431930907822718,"spread":0.1602914823607093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002159352,0.0001741026,0.000250608,0.0001790136,0.000122161,0.000170704,0.0007721587,0.00006353488,0.0001054775],"category_scores_gemma":[0.0001241392,0.0001370654,0.00003614254,0.0001685459,0.0005313689,0.0006407892,0.0002470788,0.0003228326,0.000003026839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005017887,"about_ca_system_score_gemma":0.00007745382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008298597,"about_ca_topic_score_gemma":0.000005295843,"domain_scores_codex":[0.9981154,0.0001030653,0.0004869278,0.0003844521,0.0007218812,0.0001883239],"domain_scores_gemma":[0.9983209,0.0005713978,0.0002779788,0.0002365297,0.0005497487,0.00004344307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001725495,0.0006942553,0.0002767883,0.0001966325,0.00004825142,0.00003390751,0.003621153,0.1187611,0.02717613,0.627919,0.001194941,0.2199053],"study_design_scores_gemma":[0.0002751138,0.0001146853,0.0004371808,0.0006016889,0.000003578493,0.00001139529,0.00007792663,0.887488,0.008262691,0.1025474,0.00004631047,0.000134016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02402421,0.00006104534,0.9732359,0.0009021491,0.00006750407,0.0001894534,0.00006130424,0.00005352001,0.001404911],"genre_scores_gemma":[0.8580157,0.00004854225,0.141515,0.0002915302,0.00002240943,0.000005481749,0.00001159794,0.000008378482,0.00008139756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8339914,"threshold_uncertainty_score":0.5589364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007759781","doi":"10.1007/s11036-005-4461-5","title":"Multiple Description Video Multicast in Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia","keywords":"Computer science; Multicast; Computer network; Wireless ad hoc network; Source-specific multicast; Xcast; Distributed computing; Multiple description coding; Protocol Independent Multicast; Wireless; Telecommunications; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.01054933178701628,"gpt":0.252056479072526,"spread":0.2415071472855097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001632502,0.0001616957,0.0001729116,0.00008160007,0.0001877373,0.0001291176,0.0005347648,0.000112734,0.000006696982],"category_scores_gemma":[0.000005558055,0.0001579825,0.00003248524,0.0004599316,0.0000702523,0.0006235336,0.0003474925,0.0002554033,0.000008982167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005219396,"about_ca_system_score_gemma":0.00001057646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006576001,"about_ca_topic_score_gemma":0.00008864616,"domain_scores_codex":[0.9987056,0.00004195086,0.0003104841,0.000515263,0.0001104009,0.0003163585],"domain_scores_gemma":[0.9988672,0.0001553696,0.00009938778,0.0007123952,0.00004777514,0.0001178632],"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.000004591082,0.0001169269,0.0005406234,0.000003158686,0.000002300716,7.707175e-7,0.00002113913,0.1743888,0.000252049,0.004149619,0.0008814376,0.8196386],"study_design_scores_gemma":[0.000257711,0.00002227588,0.001706799,0.00002944675,0.000002378001,0.000005111809,0.00001245786,0.8668063,0.0001303011,0.0003791863,0.1304771,0.0001709089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00400498,0.002628076,0.9919028,0.0001446666,0.00004093537,0.0008460834,0.00000492716,0.0003370777,0.00009042703],"genre_scores_gemma":[0.9445131,0.002458643,0.04989727,0.0002598234,0.00018552,0.002575178,0.00003616362,0.0000159307,0.00005833811],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9420056,"threshold_uncertainty_score":0.6442342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967451774","doi":"10.1016/j.ins.2005.12.004","title":"A motion compression/reconstruction method based on max t-norm composite fuzzy relational equations","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Data compression ratio; Norm (philosophy); Fuzzy logic; Data compression; Computer vision; Compression (physics); Compression ratio; Computer science; Image compression; Artificial intelligence; Algorithm; Image (mathematics); Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.02935977199868756,"gpt":0.3082857185496629,"spread":0.2789259465509754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898973,0.0001627049,0.0001412161,0.0006703425,0.0008082283,0.0004329449,0.000781188,0.00008042487,0.00004518684],"category_scores_gemma":[0.0001190916,0.0001381016,0.00006104739,0.001109094,0.0001593389,0.007978979,0.0001476531,0.0001621677,0.0001429911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009563896,"about_ca_system_score_gemma":0.0001116438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006955701,"about_ca_topic_score_gemma":0.000004220798,"domain_scores_codex":[0.9978088,0.0001356724,0.0005935592,0.0002967243,0.0009269359,0.0002383345],"domain_scores_gemma":[0.9983087,0.0004897582,0.0004564685,0.0004342336,0.0002441218,0.0000667119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009357372,0.00005896694,0.0007570873,0.000008970716,0.000002062182,4.311055e-7,0.00009907439,0.3098567,0.0008603291,0.4569463,0.00181427,0.2295865],"study_design_scores_gemma":[0.0002519676,0.00005430304,0.005664037,0.0000550722,0.000002207749,0.00001358253,0.00002160899,0.9403449,0.005535849,0.04362318,0.004251814,0.0001814921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006458997,0.000007681407,0.969481,0.001098376,0.0003482111,0.0002550278,0.00002701042,0.0004978257,0.027639],"genre_scores_gemma":[0.3393437,0.000001092208,0.6599047,0.0005534667,0.00003922002,0.00004138,0.00008295653,0.000002815333,0.00003072384],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6304882,"threshold_uncertainty_score":0.621632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980828944","doi":"10.1109/tsp.2002.804085","title":"Generalized S transform","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Rounding; Mathematics; Integer (computer science); S transform; Algorithm; Discrete mathematics; Applied mathematics; Arithmetic; Computer science; Wavelet transform; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03538752603953296,"gpt":0.2762269555945517,"spread":0.2408394295550188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001020971,0.000200022,0.0001780907,0.0002027086,0.0004064597,0.0001786407,0.0007137369,0.00008144938,0.0003032635],"category_scores_gemma":[9.781935e-7,0.000181756,0.0000933483,0.0005258273,0.00005410143,0.001510952,0.000002347261,0.0002982206,0.00008921291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000523758,"about_ca_system_score_gemma":0.00002249109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003430274,"about_ca_topic_score_gemma":0.000001545755,"domain_scores_codex":[0.9985583,0.00004245314,0.0002791175,0.0004450966,0.0003633047,0.0003116945],"domain_scores_gemma":[0.9992977,0.00004786432,0.00007212919,0.0003901572,0.00007131203,0.0001208587],"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.000008250196,0.000136761,1.990247e-7,0.0000169995,0.000005972789,0.000009116154,0.0002557475,0.002191107,0.008367511,0.0003090528,0.0004108754,0.9882884],"study_design_scores_gemma":[0.0005029255,0.0001245322,0.000001616793,0.0001087215,0.00001097141,0.00004506463,0.00001158376,0.506183,0.4801793,0.004222882,0.008239258,0.0003702154],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002128632,0.000214707,0.9957094,0.0006152497,0.0001090658,0.0001648128,0.000006944723,0.00103249,0.001934479],"genre_scores_gemma":[0.8338708,0.00005849167,0.1648302,0.0005010149,0.00002941587,0.00006079854,6.183303e-7,0.00001978354,0.0006288746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9879182,"threshold_uncertainty_score":0.7411792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1950765696","doi":"10.1109/icassp.1994.389322","title":"High quality coding of wideband audio signals using transform coded excitation (TCX)","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":55,"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":"H2020 European Research Council","keywords":"Speech coding; Computer science; Speech recognition; Linear predictive coding; Encoder; Code-excited linear prediction; Audio signal; Quantization (signal processing); Decoding methods; Harmonic Vector Excitation Coding; Frequency domain; Wideband; Transform coding; Linear prediction; Algorithm; Artificial intelligence; Electronic engineering; Discrete cosine transform; Computer vision; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08676036190007076,"gpt":0.3357824590285874,"spread":0.2490220971285166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003388778,0.0001206229,0.0002471799,0.0001095732,0.00008957383,0.00004616985,0.0005410001,0.00005465957,0.000184089],"category_scores_gemma":[0.00006126711,0.0001055294,0.0000541636,0.0003179898,0.00004984161,0.001202797,0.00009578742,0.00008085051,0.000005783416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004107364,"about_ca_system_score_gemma":0.00001186341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001103581,"about_ca_topic_score_gemma":0.000007645725,"domain_scores_codex":[0.9986488,0.0000874287,0.0004569454,0.0002952335,0.0003256689,0.0001859251],"domain_scores_gemma":[0.9989117,0.0002303463,0.0001909651,0.0004885513,0.000119436,0.00005901935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001417552,0.0001439313,0.00008836382,0.00008273358,0.000020096,0.000004383427,0.0009697684,0.0007888111,0.7551142,0.1704231,0.001930455,0.07041997],"study_design_scores_gemma":[0.00040427,0.00006289434,0.0002514129,0.00009300203,0.000005366059,0.000004710905,0.00003097457,0.10673,0.8510101,0.04079072,0.0003803252,0.0002362142],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01716735,0.00005730629,0.9803954,0.0002484078,0.00007330623,0.0001812181,0.000009849557,0.0003039276,0.001563269],"genre_scores_gemma":[0.63046,0.00002546581,0.3692801,0.00009849158,0.000009863329,0.000004601897,0.000002300044,0.000004980537,0.0001141484],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6132927,"threshold_uncertainty_score":0.4303366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118315922","doi":"10.1109/jsac.2009.090214","title":"A cross-layer design framework for robust IPTV services over IEEE 802.16 networks","year":2009,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Institute for Information Industry, Ministry of Science and Technology, Taiwan; Ontario Centres of Excellence","keywords":"Multicast; Computer science; Computer network; Multiple description coding; Video quality; WiMAX; IPTV; Scalable Video Coding; Real-time computing; Distributed computing; Wireless; Scalability; Telecommunications; Network packet","retraction":null,"screen_n_in":null,"score":{"opus":0.06827897961494891,"gpt":0.3712560710996058,"spread":0.3029770914846569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007987057,0.000315422,0.0003632032,0.0003980309,0.0008649427,0.0006825238,0.00585692,0.0002813326,0.00002067677],"category_scores_gemma":[0.0002344394,0.0002909801,0.0001216055,0.001529378,0.00008342919,0.001393734,0.0002339024,0.001706909,0.000008441752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003167898,"about_ca_system_score_gemma":0.0001703386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001108639,"about_ca_topic_score_gemma":0.00002991645,"domain_scores_codex":[0.9973005,0.0005231143,0.0007733851,0.0004274311,0.0003926063,0.0005829618],"domain_scores_gemma":[0.99353,0.001963157,0.0005720014,0.003066489,0.0006515609,0.000216752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006236816,0.003367582,0.002270444,0.00003574778,0.0001869453,0.0000436392,0.001328758,0.6537517,0.004977915,0.08724467,0.03578562,0.2103832],"study_design_scores_gemma":[0.001137202,0.0006184794,0.00737736,0.0011255,0.00002263735,0.000162066,0.00001778079,0.8149845,0.004796258,0.1585515,0.01045556,0.0007511534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001358796,0.0006630929,0.9947494,0.001705685,0.0003578699,0.0005351605,0.00001248576,0.0003961215,0.0002214272],"genre_scores_gemma":[0.3291641,0.0009789868,0.6676133,0.001900286,0.0001774628,0.0000836335,0.00001410377,0.00002544065,0.00004270264],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3278053,"threshold_uncertainty_score":0.9999542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146519691","doi":"10.1109/icassp.1997.596039","title":"Description of ITU-T Recommendation G.729 Annex A: reduced complexity 8 kbit/s CS-ACELP codec","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":52,"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":"Computer science; Speech coding; Codec; Code-excited linear prediction; Speech recognition; Computational complexity theory; Algorithm; Computer engineering; Linear predictive coding; Computer hardware","retraction":null,"screen_n_in":null,"score":{"opus":0.1491893380002697,"gpt":0.3017480852476926,"spread":0.152558747247423,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478816,0.0001651647,0.0002363392,0.0001567959,0.0001212979,0.00007407843,0.0008572295,0.00007636812,0.0007388745],"category_scores_gemma":[0.00007685839,0.0001533386,0.00005887884,0.0004260937,0.00009132539,0.001671901,0.0004491519,0.0001448721,0.00006986604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007262287,"about_ca_system_score_gemma":0.00001233031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005853908,"about_ca_topic_score_gemma":0.00001032926,"domain_scores_codex":[0.9984819,0.000122951,0.0004454479,0.0004511525,0.0002560524,0.0002424668],"domain_scores_gemma":[0.9985479,0.00007270565,0.0002534832,0.000859394,0.0001731104,0.00009345251],"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.00002855287,0.0007079763,0.0003126765,0.00005668147,0.00002691226,0.000005163401,0.0006809441,0.00004648995,0.263228,0.1170621,0.1990269,0.4188175],"study_design_scores_gemma":[0.0009570696,0.0003855972,0.003727664,0.0001191123,0.00001115558,0.00003737824,0.00008292788,0.4089185,0.4568377,0.06152894,0.0666533,0.0007406443],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006204168,0.00004028157,0.9785224,0.001613897,0.0002503865,0.0002518243,0.00001954304,0.0006864415,0.01241109],"genre_scores_gemma":[0.5119045,0.0000589569,0.4870644,0.0002729224,0.00002639977,0.00001925028,0.00003448667,0.000009540827,0.0006095588],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5057003,"threshold_uncertainty_score":0.8090158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067522308","doi":"10.1007/s00530-013-0319-z","title":"A review of multiple description coding techniques for error-resilient video delivery","year":2013,"lang":"en","type":"review","venue":"Multimedia Systems","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multiple description coding; Lossy compression; Cryptography; Computer engineering; Coding (social sciences); Theoretical computer science; Redundancy (engineering); Backward compatibility; Multimedia; Algorithm; Decoding methods; Computer network; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1015789503748944,"gpt":0.3550489160012574,"spread":0.253469965626363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001169108,0.0007191152,0.0030164,0.0004977349,0.0001137002,0.0001314864,0.002609927,0.0004447773,0.000008439029],"category_scores_gemma":[0.0008911057,0.0005611174,0.0007019439,0.0005532749,0.00008776745,0.0009482232,0.0008303779,0.0003671238,0.00005427557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000325702,"about_ca_system_score_gemma":0.0002309028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001424186,"about_ca_topic_score_gemma":0.00000211171,"domain_scores_codex":[0.9951571,0.0005113629,0.002178492,0.001071789,0.0005593595,0.0005219514],"domain_scores_gemma":[0.9935055,0.001287597,0.002185536,0.002179414,0.0006479136,0.0001940831],"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.000001106878,0.00004073071,4.193751e-7,0.1736081,0.00003525019,0.00000172913,0.00001844722,2.38781e-7,0.00005808305,0.00007613653,0.03261364,0.7935461],"study_design_scores_gemma":[0.00008777892,0.00005685393,7.983837e-8,0.2802716,0.0001060767,0.00002452615,0.000003626934,0.01759981,0.0001908342,0.00001676383,0.7012497,0.0003923033],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.480648e-8,0.5407891,0.4523295,0.000006823987,0.0005834496,0.005618299,0.0001554694,0.0004913674,0.00002595861],"genre_scores_gemma":[7.62244e-7,0.6537296,0.340116,0.00004138521,0.0001382287,0.005620779,0.0002069067,0.00005536282,0.00009096457],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.7931538,"threshold_uncertainty_score":0.999684,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093533836","doi":"10.1155/2011/343787","title":"Lossless and Low-Power Image Compressor for Wireless Capsule Endoscopy","year":2011,"lang":"en","type":"article","venue":"VLSI design","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Lossless compression; Lossy compression; Image compression; Computer science; Lossless JPEG; Computer vision; Data compression; Artificial intelligence; JPEG; Data compression ratio; Algorithm; Image (mathematics); Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.04172671341138279,"gpt":0.2721843846890394,"spread":0.2304576712776567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002784953,0.000220783,0.0002576357,0.0001083217,0.0001624953,0.0001175826,0.001128904,0.0000837402,0.00003274277],"category_scores_gemma":[0.00004119887,0.0001974907,0.00004762753,0.000159115,0.0001346004,0.0009857089,0.0004308474,0.0001207594,0.00002397318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002132811,"about_ca_system_score_gemma":0.00003935351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001531775,"about_ca_topic_score_gemma":5.587954e-7,"domain_scores_codex":[0.9985032,0.00009654823,0.0002540011,0.0005758223,0.0001877602,0.0003826553],"domain_scores_gemma":[0.9985451,0.0001743438,0.0001293824,0.0008809335,0.0001230173,0.0001472149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001623334,0.0005179066,0.00008083195,0.0002011685,0.00005756167,0.0001019436,0.002640349,0.00001051278,0.814108,0.07429448,0.04203097,0.06579393],"study_design_scores_gemma":[0.0006554067,0.0002168964,0.0001657829,0.00007292564,0.000007125613,0.00001584113,0.00001888945,0.01794573,0.9608002,0.01739874,0.002355523,0.0003469586],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003203992,0.000164534,0.9945079,0.0000505635,0.0001823905,0.0006904611,0.00002929377,0.0005194311,0.0006514409],"genre_scores_gemma":[0.2052422,0.00003845022,0.7941617,0.0001842978,0.00002257193,0.0001976093,0.000003973824,0.00002609363,0.000123139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2020382,"threshold_uncertainty_score":0.8053435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978068076","doi":"10.1109/tcsvt.2004.833168","title":"Prioritized Region of Interest Coding in JPEG2000","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Region of interest; ENCODE; JPEG 2000; Coding (social sciences); Network packet; Artificial intelligence; Data mining; Computer vision; Algorithm; Image compression; Image processing; Image (mathematics); Mathematics; Computer network; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05710625590233875,"gpt":0.2897319322096396,"spread":0.2326256763073008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001711022,0.0001414514,0.0003327191,0.0007620942,0.0001121258,0.00003900167,0.0004859489,0.0001810499,4.637706e-7],"category_scores_gemma":[0.00001848701,0.0001358981,0.0000495019,0.0005228941,0.0001302235,0.0003073588,0.000006896031,0.0002164926,0.000001136072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008937685,"about_ca_system_score_gemma":0.00004646613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005971074,"about_ca_topic_score_gemma":0.00005396466,"domain_scores_codex":[0.9988266,0.00002834422,0.0004329858,0.0003979692,0.00008474629,0.0002293917],"domain_scores_gemma":[0.9990802,0.0001103574,0.0001513796,0.0005458632,0.00007087871,0.00004132761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005530463,0.0004658459,0.00008664811,0.0004903835,0.00005196066,0.00007700477,0.0005507045,0.00227088,0.09770814,0.5325896,0.00008806579,0.3655655],"study_design_scores_gemma":[0.007320805,0.001824342,0.00009683644,0.003862802,0.00003516183,0.001238338,0.0005310916,0.01404877,0.8018533,0.1613088,0.006815847,0.001063907],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02295601,0.0003095247,0.9749979,0.0003552884,0.0003236933,0.0006110597,0.00001682606,0.0004032196,0.00002647324],"genre_scores_gemma":[0.9947715,0.0001598751,0.004778291,0.00002927714,0.000007429197,0.0002150731,5.48065e-7,0.00001237928,0.00002558053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718155,"threshold_uncertainty_score":0.5541763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390480875","doi":"10.1109/tpami.2023.3348486","title":"Deep Lossy Plus Residual Coding for Lossless and Near-Lossless Image Compression","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Lossless compression; Lossy compression; Computer science; Lossless JPEG; Image compression; Context-adaptive binary arithmetic coding; Adaptive coding; Data compression; Context-adaptive variable-length coding; Entropy encoding; Algorithm; Tunstall coding; Artificial intelligence; Theoretical computer science; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02382775102872816,"gpt":0.3132677874961801,"spread":0.289440036467452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002882348,0.0003007927,0.0004078467,0.0004781488,0.0004473844,0.000746231,0.0005677052,0.00009396106,0.00004980221],"category_scores_gemma":[0.000007357547,0.0002519891,0.0001809664,0.0007785519,0.0001749658,0.0007269899,0.00003516032,0.0003488941,0.00000907202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000048182,"about_ca_system_score_gemma":0.00002954342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002517275,"about_ca_topic_score_gemma":0.0002496334,"domain_scores_codex":[0.9979774,0.00008526594,0.0004381818,0.0008987261,0.0002941204,0.0003062421],"domain_scores_gemma":[0.9985732,0.0004629152,0.00008818116,0.0006198694,0.0000914809,0.0001643698],"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.00003304562,0.0000756744,0.0000373634,0.0001606193,0.0002810686,0.0000348824,0.0005230712,0.008722333,0.002909968,0.0007234599,0.00007414611,0.9864244],"study_design_scores_gemma":[0.00009433612,0.00008906527,0.00007669886,0.0001547588,0.0002215623,0.00002163243,0.000033712,0.8095044,0.1878669,0.001328407,0.0003270123,0.0002814953],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001317737,0.0007203815,0.9964654,0.0004563694,0.0002262067,0.0002768841,0.000154304,0.0003555877,0.00002716284],"genre_scores_gemma":[0.9511163,0.0007478574,0.04769909,0.00018575,0.00003005908,0.00007650255,0.00001812337,0.00002308737,0.0001032421],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9861429,"threshold_uncertainty_score":0.9999932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106339590","doi":"10.1109/tmi.2010.2052628","title":"3-D Scalable Medical Image Compression With Optimized Volume of Interest Coding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; JPEG 2000; Lossless compression; Data compression; Lossy compression; Image quality; Image compression; Decoding methods; Wavelet; Artificial intelligence; Computer vision; Algorithm; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01661681195153437,"gpt":0.2918962794420584,"spread":0.275279467490524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000691963,0.000239461,0.0003740757,0.0002586574,0.0002155704,0.00008797797,0.001734881,0.000153337,0.001425739],"category_scores_gemma":[0.0001486813,0.0001824943,0.00009260034,0.0004187654,0.0005943593,0.001011669,0.00004227994,0.001506231,0.00003389412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002758226,"about_ca_system_score_gemma":0.0002123366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000483635,"about_ca_topic_score_gemma":0.00002441824,"domain_scores_codex":[0.9972103,0.000120206,0.0005141706,0.0005526202,0.001209679,0.0003930321],"domain_scores_gemma":[0.9977742,0.000399908,0.0001628984,0.0009219426,0.0001688845,0.0005721804],"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.0002116016,0.001232972,0.0001098942,0.000126422,0.00006218362,0.0004657406,0.0002952609,0.0003836034,0.1332438,0.002341419,0.006329705,0.8551974],"study_design_scores_gemma":[0.001521663,0.00007867045,0.00003320449,0.0009204154,0.00001586265,0.0002771733,0.00003125067,0.7108032,0.2836331,0.0004553466,0.001913459,0.0003166563],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002712153,0.00001505705,0.992215,0.003070819,0.0007142528,0.0001798094,0.00001005495,0.0005671844,0.0005157077],"genre_scores_gemma":[0.6404487,0.00003838458,0.3588632,0.000462516,0.00004389628,0.00003507099,0.000002888394,0.00002432958,0.00008101969],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8548808,"threshold_uncertainty_score":0.9994871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100231395","doi":"10.1109/iwsoc.2003.1213058","title":"Efficient distributed arithmetic based DWT architecture for multimedia applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Discrete wavelet transform; Computational complexity theory; Wavelet transform; Parallel computing; Wavelet; Computer hardware; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01058093113311769,"gpt":0.2734630297245692,"spread":0.2628820985914515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009915957,0.0001352314,0.0001249046,0.0001015432,0.0001395329,0.00005846234,0.0009298587,0.00005246023,0.000007782583],"category_scores_gemma":[0.00006676363,0.0001090905,0.00006503339,0.0003843798,0.00005206362,0.0000584485,0.0001923129,0.0001045228,0.00001954965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006150057,"about_ca_system_score_gemma":0.00007092518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007384373,"about_ca_topic_score_gemma":0.000003613599,"domain_scores_codex":[0.9989226,0.00001489965,0.0001889886,0.0004301027,0.0001902234,0.0002532169],"domain_scores_gemma":[0.9986396,0.0001984368,0.0000666266,0.0008820444,0.00009666249,0.0001165924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002272543,0.0009268741,0.00001697669,0.00006943913,0.00001650838,0.00000550958,0.0001210061,0.4058622,0.01465666,0.2147823,0.002696154,0.3608237],"study_design_scores_gemma":[0.001231416,0.00009599094,0.0001543162,0.0000351098,0.000007355817,0.000006802408,0.000005634317,0.7539954,0.1187723,0.0632704,0.06206522,0.0003600556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005868093,0.00002708818,0.9959247,0.00172686,0.00004581504,0.0009851055,0.0001436881,0.0009764579,0.0001116274],"genre_scores_gemma":[0.06844002,5.507968e-7,0.9301905,0.0004052874,0.00002636541,0.0007959212,0.0001128232,0.000009244807,0.00001930166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3604637,"threshold_uncertainty_score":0.4448581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128714178","doi":"10.1155/asp.2005.1047","title":"An FPGA-Based People Detection System","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; JPEG; MicroBlaze; Field-programmable gate array; Discrete cosine transform; Frame rate; Computer hardware; Artificial intelligence; Process (computing); Background subtraction; Computer vision; Embedded system; Real-time computing; Data compression; Pixel; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01148647843370195,"gpt":0.3024103474440572,"spread":0.2909238690103553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007349641,0.0002647897,0.0002896996,0.0004799073,0.0004422762,0.0004600192,0.00126494,0.00007738444,0.00001239243],"category_scores_gemma":[0.00004304079,0.0002279121,0.00006419743,0.0007843487,0.00004088857,0.007066809,0.00007288878,0.0007248279,0.00002024699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003921194,"about_ca_system_score_gemma":0.0001221664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001011225,"about_ca_topic_score_gemma":0.0000173515,"domain_scores_codex":[0.9975274,0.000242604,0.0006145062,0.0005115786,0.0006639919,0.0004398874],"domain_scores_gemma":[0.9985557,0.0001275001,0.0005199521,0.0004085376,0.0001774924,0.0002108822],"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.00005981205,0.0001263556,0.0001725035,0.0000487063,0.000001140404,0.00004662625,0.0001151672,0.06195309,0.008237129,0.0002976235,0.00001070667,0.9289311],"study_design_scores_gemma":[0.0009321582,0.0006290752,0.000461881,0.001272624,0.000005009652,0.0004664792,0.0001546761,0.7595909,0.2225559,0.002068528,0.01130372,0.000559032],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006590242,0.0017432,0.9899846,0.0001907648,0.0002038832,0.0001363184,0.000001429154,0.0005199907,0.0006296041],"genre_scores_gemma":[0.79124,0.00004341226,0.2081079,0.000290017,0.0002750123,0.00001467223,0.000001048755,0.00002149944,0.000006496617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9283721,"threshold_uncertainty_score":0.9293984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998468704","doi":"10.5402/2012/760320","title":"A Survey of Image Compression Algorithms for Visual Sensor Networks","year":2012,"lang":"en","type":"article","venue":"ISRN Sensor Networks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":47,"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":"Computer science; Image compression; Data compression; JPEG 2000; JPEG; Compression (physics); Context (archaeology); Energy (signal processing); Algorithm; Computer vision; Artificial intelligence; Image (mathematics); Image processing; Geography; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03814222906508322,"gpt":0.3354868431399719,"spread":0.2973446140748887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001241292,0.0004133196,0.0006415703,0.0001478222,0.0002207181,0.0001057311,0.001178244,0.0003100114,0.0000194894],"category_scores_gemma":[0.0001903328,0.0003680061,0.0001721941,0.0006373914,0.0001574725,0.001106856,0.0008483315,0.0004378252,0.0000121164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165544,"about_ca_system_score_gemma":0.00002913914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000883405,"about_ca_topic_score_gemma":0.00001291681,"domain_scores_codex":[0.9966134,0.0004616295,0.0007412745,0.000663241,0.0004201902,0.00110031],"domain_scores_gemma":[0.9959942,0.001449084,0.0005191217,0.001245874,0.0004610174,0.0003307237],"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.0008237972,0.002300319,0.03240628,0.0002155784,0.0003264998,0.00004562635,0.0006604826,0.1369538,0.01757925,0.003167508,0.116986,0.6885349],"study_design_scores_gemma":[0.0005159636,0.0001454261,0.01427385,0.0001178648,0.00001539553,0.00001993534,0.00001348393,0.9737818,0.006552105,0.0000930433,0.003988668,0.0004825132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002944151,0.0008585513,0.9934691,0.00005211743,0.001153074,0.0007588957,0.00007333414,0.0005683976,0.000122381],"genre_scores_gemma":[0.4692688,0.000154262,0.5291942,0.0002479985,0.0006560248,0.00007213216,0.0001797566,0.00006989365,0.0001569346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.836828,"threshold_uncertainty_score":0.9998772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128894842","doi":"10.1109/4233.966105","title":"Wavelet-based space-frequency compression of ultrasound images","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Technology in Biomedicine","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":47,"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":"Set partitioning in hierarchical trees; Computer science; Artificial intelligence; Computer vision; Codec; Wavelet; Image compression; Ultrasound; Wavelet transform; Data compression; Grayscale; Pattern recognition (psychology); Mathematics; Image (mathematics); Image processing; Discrete wavelet transform; Radiology; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.008296223714880096,"gpt":0.2590608214615913,"spread":0.2507645977467112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002336649,0.0002031264,0.0002952178,0.002748377,0.0001064981,0.000018947,0.0009434614,0.0002539812,0.00005839339],"category_scores_gemma":[0.00004152973,0.0001760599,0.00004834382,0.002485404,0.000350404,0.00146637,0.000008871579,0.0004151202,0.00003338253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053151,"about_ca_system_score_gemma":0.00006142535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003634903,"about_ca_topic_score_gemma":0.00000272395,"domain_scores_codex":[0.9983743,0.00003644261,0.0007257867,0.0002275813,0.0003585728,0.0002773487],"domain_scores_gemma":[0.9983473,0.0001728914,0.0003141435,0.0009376972,0.0001673163,0.00006069006],"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.0001311826,0.0007837359,0.0005239616,0.0001585818,0.00003547883,0.00003418871,0.0004072802,0.001661341,0.3053861,0.01538353,0.002929952,0.6725646],"study_design_scores_gemma":[0.001840423,0.0005601355,0.0005284944,0.0004098293,0.000008535385,0.00009666131,0.0001473014,0.008929879,0.9711959,0.01230594,0.003681142,0.000295771],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003505906,0.00004651224,0.9907877,0.003654211,0.0002795345,0.0003372514,0.00003619471,0.000813087,0.0005396396],"genre_scores_gemma":[0.8109948,0.0002039803,0.1884095,0.0002585724,0.000006535739,0.00008094276,0.00001733342,0.000006930693,0.00002145105],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8074889,"threshold_uncertainty_score":0.7179513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132463201","doi":"10.1117/1.1344590","title":"Document compression using rate-distortion optimized segmentation","year":2001,"lang":"en","type":"article","venue":"Journal of Electronic Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia","keywords":"Computer science; Image compression; Imaging science; Data compression; Segmentation; Image segmentation; Computer vision; Artificial intelligence; Cover (algebra); Image processing; Image (mathematics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01139835198788083,"gpt":0.3047175451843562,"spread":0.2933191931964754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007171806,0.0001336212,0.0002059309,0.000243455,0.0001470254,0.0001369338,0.0005858454,0.00002332958,0.00002636],"category_scores_gemma":[0.00003255451,0.0001140936,0.00008453445,0.0002702746,0.00002158647,0.002518281,0.0001498928,0.0003021141,0.000002259482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000586884,"about_ca_system_score_gemma":0.0001622629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009845563,"about_ca_topic_score_gemma":4.441088e-7,"domain_scores_codex":[0.998438,0.000162534,0.0005177286,0.0001861881,0.000348244,0.0003473081],"domain_scores_gemma":[0.9986674,0.00006067401,0.00072026,0.0002828942,0.0001930168,0.00007575295],"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.0002842936,0.00019693,0.0007776481,0.00001822912,0.00006186975,0.0001916279,0.0003707427,0.03992387,0.6854273,0.003889954,0.002796556,0.2660609],"study_design_scores_gemma":[0.003527797,0.0003028922,0.0003553587,0.0004697744,0.0000615299,0.00228469,0.0001044972,0.5730051,0.3648976,0.03714969,0.01727352,0.0005675046],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02092011,0.001108873,0.9769447,0.0005038486,0.0002533554,0.0001078145,2.020394e-7,0.00007638826,0.00008470298],"genre_scores_gemma":[0.6414248,0.0003895905,0.3577821,0.0002322005,0.0001076947,0.000002912262,0.000002352093,0.00001387544,0.00004443127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6205047,"threshold_uncertainty_score":0.4652603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108844718","doi":"10.1109/isspa.2010.5605474","title":"Hybrid DWT-DCT algorithm for biomedical image and video compression applications","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discrete cosine transform; Computer science; Artificial intelligence; Algorithm; Computer vision; Data compression; Discrete wavelet transform; Image compression; Compression ratio; Peak signal-to-noise ratio; Image processing; Wavelet; Wavelet transform; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.008954292025601721,"gpt":0.2964611329641159,"spread":0.2875068409385141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868656,0.0001287659,0.0001438768,0.0001010142,0.0001983957,0.0001209358,0.000882253,0.00005778743,0.00003502633],"category_scores_gemma":[0.00003799535,0.0001008265,0.00003513845,0.0001238593,0.0001613228,0.0006438977,0.0007081919,0.0001897729,0.00001716722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007288761,"about_ca_system_score_gemma":0.00002726594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007618197,"about_ca_topic_score_gemma":8.804658e-7,"domain_scores_codex":[0.9988673,0.00001665113,0.000211062,0.0004877255,0.0001950604,0.0002222391],"domain_scores_gemma":[0.9986067,0.0002243301,0.00007279822,0.0008147044,0.00009246341,0.000188976],"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.000001111161,0.00006228885,0.000003437405,0.000007306751,0.000002385105,0.000001516284,0.000008101837,4.669186e-8,0.07867518,0.02260826,0.02170732,0.8769231],"study_design_scores_gemma":[0.0003793129,0.0000606395,0.00007024376,0.0000143855,0.000003778396,0.00005653997,0.000003662602,0.2142391,0.1476058,0.06516176,0.5721729,0.0002318977],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001053823,0.00003160338,0.9971023,0.0007627003,0.00013997,0.0005670609,0.0000629703,0.0006871096,0.0005409678],"genre_scores_gemma":[0.004439326,0.00001745526,0.9945194,0.0002962124,0.0001036469,0.0003969657,0.00004596419,0.00001093199,0.0001701433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8766912,"threshold_uncertainty_score":0.4111585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117853725","doi":"10.1016/j.jmir.2008.01.004","title":"Image Postprocessing in Digital Radiology—A Primer for Technologists","year":2008,"lang":"en","type":"article","venue":"Journal of medical imaging and radiation sciences","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer science; Unsharp masking; Image processing; Computer vision; Image compression; Artificial intelligence; Digital image processing; Image quality; Pixel; Image resolution; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01967935004858513,"gpt":0.3395744729389253,"spread":0.3198951228903402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151707,0.00006623733,0.0001558509,0.0003297451,0.0001690265,0.0001226801,0.000694976,0.00004699432,0.000001662702],"category_scores_gemma":[0.001988872,0.0000448348,0.00002850462,0.0003732891,0.0006433367,0.002168852,0.0001222832,0.000184105,3.917894e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002104295,"about_ca_system_score_gemma":0.0002253011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001936276,"about_ca_topic_score_gemma":1.283226e-7,"domain_scores_codex":[0.9987509,0.00002069357,0.0003512811,0.0001776088,0.0005346869,0.0001648063],"domain_scores_gemma":[0.9991194,0.0003236894,0.0002714503,0.00008950479,0.00009957115,0.00009638231],"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.00001165655,0.00008227415,0.02203863,0.00001556386,0.000004551337,0.0001744733,0.0005113248,0.00001638877,0.001598171,0.002916915,0.007408096,0.9652219],"study_design_scores_gemma":[0.004790561,0.00085732,0.04451947,0.0009791526,0.00001278507,0.02379284,0.001479571,0.7558118,0.01396264,0.1118188,0.04105794,0.0009171322],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04580202,0.003189655,0.9380653,0.01256719,0.0002089945,0.00005547357,0.000001124278,0.00004746592,0.00006277583],"genre_scores_gemma":[0.7719029,0.001002849,0.2266302,0.0003624834,0.00009107901,0.000002464433,4.287358e-7,0.000002575369,0.000004975268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9643048,"threshold_uncertainty_score":0.2381009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133078112","doi":"10.1109/36.843010","title":"Vector quantization using spectral index-based multiple subcodebooks for hyperspectral data compression","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Hyperspectral imaging; Codebook; Vector quantization; Lossy compression; Data compression; Computer science; Quantization (signal processing); Compression ratio; Artificial intelligence; Image compression; Algorithm; Pattern recognition (psychology); Mathematics; Image processing; Physics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.0543461859741568,"gpt":0.3051797222874569,"spread":0.2508335363133001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002398302,0.000211491,0.0001986056,0.0002049859,0.0008251028,0.0002003296,0.0006791503,0.00009174347,0.000005872478],"category_scores_gemma":[0.00001518251,0.0001912032,0.00005407885,0.0003783552,0.0001800375,0.001027576,0.00001131797,0.0002079472,0.000002463263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000612634,"about_ca_system_score_gemma":0.000112223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003008818,"about_ca_topic_score_gemma":0.00007305887,"domain_scores_codex":[0.9981104,0.00006855538,0.0002649541,0.0008424325,0.0003133991,0.0004002171],"domain_scores_gemma":[0.9985113,0.0001999544,0.00008645745,0.001005037,0.00006819167,0.0001290244],"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.00007986218,0.00005581089,0.000002769016,0.00001490103,0.000004976772,0.000007120238,0.0001257582,0.01209949,0.08054158,0.00003709782,0.00002248185,0.9070082],"study_design_scores_gemma":[0.0004021377,0.00007942792,0.00007189835,0.0001316982,0.00000909254,0.00003620823,0.00001465906,0.8765724,0.1216782,0.0003766172,0.0004050723,0.0002224911],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03921781,0.00002328644,0.9594494,0.000223132,0.0003149969,0.0003638384,0.0000475013,0.0003304264,0.00002957801],"genre_scores_gemma":[0.4426016,0.00001910684,0.5571319,0.0001579657,0.00002389608,2.307685e-7,0.000005939354,0.00001155688,0.00004776862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9067857,"threshold_uncertainty_score":0.7797041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312777148","doi":"10.1109/jsait.2022.3231820","title":"On the Rate-Distortion-Perception Function","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Perception; Distortion function; Randomness; Distortion (music); Constraint (computer-aided design); Mathematics; Coding (social sciences); Rate distortion; Decoding methods; Function (biology); Information theory; Theoretical computer science; Algorithm; Mathematical optimization; Computer science; Statistics; Psychology; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.008935774984870014,"gpt":0.232741993121707,"spread":0.223806218136837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089772,0.0001444525,0.0001142556,0.0005506004,0.0008135969,0.0001978818,0.0008403228,0.00004272998,0.0004876216],"category_scores_gemma":[0.0003775007,0.0001051196,0.00005328608,0.0009834566,0.00002748211,0.002326742,0.00009806847,0.001013357,0.0001235364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005516108,"about_ca_system_score_gemma":0.0001070526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000149398,"about_ca_topic_score_gemma":4.752872e-7,"domain_scores_codex":[0.9976168,0.0009246872,0.0005142145,0.0001355754,0.0005935695,0.0002151919],"domain_scores_gemma":[0.9983303,0.0005200912,0.000453688,0.0004363423,0.0001993688,0.00006023424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001001831,0.0002418998,0.00005522652,0.000007286118,0.00002766335,0.000009894878,0.002375202,0.05131926,0.002202434,0.6963533,0.07148478,0.1749212],"study_design_scores_gemma":[0.001800631,0.002142453,0.01248369,0.0001729218,0.00001484585,0.000454546,0.001354899,0.05276136,0.008035014,0.8312184,0.08873815,0.000823102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04290683,0.000009375201,0.9520319,0.0006716469,0.001200064,0.0002689042,0.000009925852,0.0002682954,0.002633134],"genre_scores_gemma":[0.9938745,0.00002018819,0.001000853,0.004788229,0.00007225096,0.0001095947,0.00002639496,0.000008483582,0.0000995391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.951031,"threshold_uncertainty_score":0.6257612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3034755948","doi":"10.1109/icme46284.2020.9102797","title":"Lightweight Compression Of Neural Network Feature Tensors For Collaborative Intelligence","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":41,"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":"Artificial neural network; Codec; Data compression; Compression (physics); Edge device; Code (set theory); Feature (linguistics); Inference; Enhanced Data Rates for GSM Evolution","retraction":null,"screen_n_in":null,"score":{"opus":0.03242712166723326,"gpt":0.2919537167898722,"spread":0.2595265951226389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008801326,0.0001706343,0.0002846595,0.00003619583,0.000104908,0.00004674479,0.001287796,0.00008072115,0.00001933642],"category_scores_gemma":[0.000099304,0.000124441,0.00006468211,0.0007578388,0.00006059181,0.0005760285,0.0006015848,0.0001505129,0.000004860166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000010736,"about_ca_system_score_gemma":0.00003694911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001190271,"about_ca_topic_score_gemma":8.275423e-7,"domain_scores_codex":[0.998735,0.00006588495,0.0002791306,0.0004503258,0.0002234555,0.0002462675],"domain_scores_gemma":[0.9985824,0.0002818697,0.0001988716,0.0004984522,0.0002986608,0.0001397357],"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.0002482462,0.0001055421,0.0002443685,0.0001166039,0.00003727008,0.00001241932,0.001351822,0.01687185,0.02044089,0.3369462,0.5344703,0.08915445],"study_design_scores_gemma":[0.000199822,0.0004641673,0.00008255485,0.00008632353,0.0000064248,0.000002700808,0.00007252883,0.5001894,0.3776644,0.0127544,0.1081743,0.0003030146],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001605242,0.0003534839,0.9928206,0.004725403,0.0001302726,0.0005337439,0.00002814894,0.0004223585,0.0008254232],"genre_scores_gemma":[0.1178258,0.00003900399,0.8802934,0.001511698,0.0001214063,0.00004585124,0.000014324,0.0000126275,0.0001359618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4833175,"threshold_uncertainty_score":0.5074556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161065057","doi":"10.1109/18.850705","title":"On the training distortion of vector quantizers","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Distortion (music); Mathematics; Set (abstract data type); Training set; Upper and lower bounds; Algorithm; Training (meteorology); Rate distortion; Function (biology); Computer science; Artificial intelligence; Mathematical optimization; Statistics; Telecommunications; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0166306690444241,"gpt":0.2441862137582662,"spread":0.2275555447138421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929906,0.0001059993,0.0001008797,0.0001491159,0.0002076834,0.00004349266,0.0005037533,0.00004688892,0.0004764888],"category_scores_gemma":[0.00001631918,0.00007584985,0.00007458503,0.0002803821,0.00007366963,0.00162287,0.000001480717,0.0001839855,0.0001664672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004151942,"about_ca_system_score_gemma":0.00002992191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003125485,"about_ca_topic_score_gemma":4.628779e-7,"domain_scores_codex":[0.9990631,0.0001103434,0.000326739,0.000102482,0.0002705563,0.0001268244],"domain_scores_gemma":[0.9988374,0.0003952584,0.0001319521,0.0005530612,0.00004574777,0.0000365467],"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.00008829084,0.0000451963,7.878202e-8,0.000007947847,0.0000113294,1.701995e-7,0.002771042,0.01176737,0.0002429477,0.2168616,0.0004102031,0.7677938],"study_design_scores_gemma":[0.001296851,0.0009492345,0.0001935158,0.00042926,0.00003436186,0.00002680493,0.001345324,0.07051354,0.6781404,0.22281,0.02341101,0.0008497621],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004712553,0.00000339108,0.9897813,0.0002351911,0.0002095363,0.0001885532,0.00002844163,0.0002773316,0.004563682],"genre_scores_gemma":[0.9943329,0.00001924601,0.004852771,0.000580634,0.000006241038,0.0000537688,0.000003599738,0.000004855891,0.0001459709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9896204,"threshold_uncertainty_score":0.5217218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165307236","doi":"10.1109/tmi.2005.846858","title":"Wavelet coding of volumetric medical images for high throughput and operability","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":37,"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; Lossless compression; Wavelet; Operability; Wavelet transform; Throughput; Data compression; Image compression; Scalability; Artificial intelligence; Volume (thermodynamics); Computer vision; Medical imaging; Coding (social sciences); Image processing; Image (mathematics); Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01404280855088935,"gpt":0.306208180765932,"spread":0.2921653722150426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009083858,0.0001648988,0.0002973384,0.0002248442,0.0001873159,0.00004753329,0.0008349877,0.00009962988,0.000186291],"category_scores_gemma":[0.0003740343,0.0001425454,0.00007351986,0.0004129256,0.0003262032,0.0008151227,0.00002557545,0.0004194949,0.000004145737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005675075,"about_ca_system_score_gemma":0.0001278701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004505248,"about_ca_topic_score_gemma":0.000006004919,"domain_scores_codex":[0.9977165,0.00008999376,0.0004663946,0.0005151498,0.0009099198,0.0003019983],"domain_scores_gemma":[0.998045,0.0009127102,0.0000852411,0.0005320242,0.0001194134,0.0003056265],"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.00001010781,0.0001790582,0.00002195218,0.00004332578,0.00001063421,0.000006388611,0.00006928616,0.00003631445,0.0008633037,0.001001078,0.001312414,0.9964461],"study_design_scores_gemma":[0.001836483,0.0001408494,0.0003069336,0.0004402224,0.00002927891,0.0001300102,0.00004360321,0.6946054,0.2921153,0.003998409,0.00590406,0.0004494195],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001463973,0.0001630035,0.9895934,0.007888619,0.0002870283,0.0002355857,0.00002956713,0.0002768479,0.00006200626],"genre_scores_gemma":[0.6973782,0.0002496835,0.3014108,0.0008144001,0.00006043186,0.00004604594,0.000001728183,0.00001148025,0.00002725358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9959967,"threshold_uncertainty_score":0.5812833,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099675194","doi":"10.1109/titb.2007.911307","title":"Efficient Lossless Compression of 4-D Medical Images Based on the Advanced Video Coding Scheme","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Technology in Biomedicine","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Aristotle University of Thessaloniki","keywords":"Lossless compression; Computer science; Motion compensation; Data compression; Computer vision; Lossy compression; JPEG 2000; Context-adaptive binary arithmetic coding; Coding (social sciences); Artificial intelligence; Image compression; Image processing; Mathematics; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01317922056826647,"gpt":0.2735809401614395,"spread":0.260401719593173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285951,0.0002048822,0.000296337,0.001742617,0.0002558032,0.00001186298,0.001477117,0.0002794607,0.00006223936],"category_scores_gemma":[0.0001149085,0.0001398472,0.00005411199,0.001988221,0.0006772423,0.0003948886,0.00002525791,0.0006879413,0.00002589203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009588662,"about_ca_system_score_gemma":0.0001010661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009727819,"about_ca_topic_score_gemma":7.359486e-7,"domain_scores_codex":[0.9976618,0.00006079663,0.0007532791,0.0002435143,0.001011234,0.0002693504],"domain_scores_gemma":[0.998083,0.0004101815,0.0003078325,0.0009765859,0.0001479686,0.00007443523],"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.0006574245,0.002692778,0.0002567138,0.0003769033,0.00007472065,0.0001186304,0.002004739,0.1279719,0.08130766,0.05756383,0.006485446,0.7204892],"study_design_scores_gemma":[0.001572123,0.0003325586,0.000124953,0.0007474829,0.000003125891,0.00004387219,0.0001555145,0.5444734,0.4508941,0.0005109084,0.0009669354,0.0001750327],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01452544,0.00002331183,0.9710118,0.01296642,0.0002967819,0.0004158054,0.00002319869,0.0005606234,0.0001766309],"genre_scores_gemma":[0.9626073,0.0001113674,0.03628745,0.0008282741,0.000007037656,0.0001380996,0.000006680198,0.000007129372,0.000006623881],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9480819,"threshold_uncertainty_score":0.5702803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170855391","doi":"10.1109/pacrim.2001.953547","title":"Wavelet transforms in the JPEG-2000 standard","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Wavelet; Computer science; Wavelet transform; JPEG 2000; JPEG; Artificial intelligence; Computer vision; Data compression; Image processing; Image compression; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02161650398792796,"gpt":0.2514134162616652,"spread":0.2297969122737373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002279395,0.00008966384,0.00009569487,0.00006816877,0.00005854795,0.00008435744,0.001367961,0.0000329857,0.0002751359],"category_scores_gemma":[0.00001310793,0.00004916011,0.00002968686,0.0003553022,0.00002905775,0.0006799636,0.00008737396,0.000149237,0.00005601493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003357986,"about_ca_system_score_gemma":0.00001150388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000116878,"about_ca_topic_score_gemma":0.00001678319,"domain_scores_codex":[0.9990634,0.00004332438,0.000166092,0.0002222019,0.0002957718,0.0002092492],"domain_scores_gemma":[0.9991649,0.00007232412,0.00002230247,0.0006906168,0.00001837361,0.00003150404],"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.000004660827,0.00008285478,0.00004822732,0.000004417489,0.000002272116,0.000040742,0.002685195,0.0000119492,0.0003075619,0.1445518,0.05220228,0.8000581],"study_design_scores_gemma":[0.0006123253,0.0002088967,0.0004662664,0.00003459282,0.000001178246,0.00005254487,0.0001149669,0.03835488,0.0262969,0.06959837,0.8638883,0.0003708123],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005066047,0.00009661927,0.9564608,0.003418047,0.00003982747,0.0001716468,0.000005282653,0.0002921936,0.039009],"genre_scores_gemma":[0.5635698,0.0002535944,0.4310655,0.003688175,0.00003457256,0.00006302043,0.00000277566,0.00001065683,0.001311946],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.811686,"threshold_uncertainty_score":0.3012545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}